// We are modularizing this manually because the current modularize setting in Emscripten has some issues: // https://github.com/kripken/emscripten/issues/5820 // In addition, When you use emcc's modularization, it still expects to export a global object called `Module`, // which is able to be used/called before the WASM is loaded. // The modularization below exports a promise that loads and resolves to the actual sql.js module. // That way, this module can't be used before the WASM is finished loading. // We are going to define a function that a user will call to start loading initializing our Sql.js library // However, that function might be called multiple times, and on subsequent calls, we don't actually want it to instantiate a new instance of the Module // Instead, we want to return the previously loaded module // TODO: Make this not declare a global if used in the browser var initSqlJsPromise = undefined; var initSqlJs = function (moduleConfig) { if (initSqlJsPromise){ return initSqlJsPromise; } // If we're here, we've never called this function before initSqlJsPromise = new Promise(function (resolveModule, reject) { // We are modularizing this manually because the current modularize setting in Emscripten has some issues: // https://github.com/kripken/emscripten/issues/5820 // The way to affect the loading of emcc compiled modules is to create a variable called `Module` and add // properties to it, like `preRun`, `postRun`, etc // We are using that to get notified when the WASM has finished loading. // Only then will we return our promise // If they passed in a moduleConfig object, use that // Otherwise, initialize Module to the empty object var Module = typeof moduleConfig !== 'undefined' ? moduleConfig : {}; // EMCC only allows for a single onAbort function (not an array of functions) // So if the user defined their own onAbort function, we remember it and call it var originalOnAbortFunction = Module['onAbort']; Module['onAbort'] = function (errorThatCausedAbort) { reject(new Error(errorThatCausedAbort)); if (originalOnAbortFunction){ originalOnAbortFunction(errorThatCausedAbort); } }; Module['postRun'] = Module['postRun'] || []; Module['postRun'].push(function () { // When Emscripted calls postRun, this promise resolves with the built Module resolveModule(Module); }); // There is a section of code in the emcc-generated code below that looks like this: // (Note that this is lowercase `module`) // if (typeof module !== 'undefined') { // module['exports'] = Module; // } // When that runs, it's going to overwrite our own modularization export efforts in shell-post.js! // The only way to tell emcc not to emit it is to pass the MODULARIZE=1 or MODULARIZE_INSTANCE=1 flags, // but that carries with it additional unnecessary baggage/bugs we don't want either. // So, we have three options: // 1) We undefine `module` // 2) We remember what `module['exports']` was at the beginning of this function and we restore it later // 3) We write a script to remove those lines of code as part of the Make process. // // Since those are the only lines of code that care about module, we will undefine it. It's the most straightforward // of the options, and has the side effect of reducing emcc's efforts to modify the module if its output were to change in the future. // That's a nice side effect since we're handling the modularization efforts ourselves module = undefined; // The emcc-generated code and shell-post.js code goes below, // meaning that all of it runs inside of this promise. If anything throws an exception, our promise will abort // include: shell.js // include: minimum_runtime_check.js (function() { // "30.0.0" -> 300000 function humanReadableVersionToPacked(str) { str = str.split('-')[0]; // Remove any trailing part from e.g. "12.53.3-alpha" var vers = str.split('.').slice(0, 3); while(vers.length < 3) vers.push('00'); vers = vers.map((n, i, arr) => n.padStart(2, '0')); return vers.join(''); } // 300000 -> "30.0.0" var packedVersionToHumanReadable = n => [n / 10000 | 0, (n / 100 | 0) % 100, n % 100].join('.'); var TARGET_NOT_SUPPORTED = 2147483647; // Note: We use a typeof check here instead of optional chaining using // globalThis because older browsers might not have globalThis defined. var currentNodeVersion = typeof process !== 'undefined' && process.versions?.node ? humanReadableVersionToPacked(process.versions.node) : TARGET_NOT_SUPPORTED; if (currentNodeVersion < 160000) { throw new Error(`This emscripten-generated code requires node v${ packedVersionToHumanReadable(160000) } (detected v${packedVersionToHumanReadable(currentNodeVersion)})`); } var userAgent = typeof navigator !== 'undefined' && navigator.userAgent; if (!userAgent) { return; } var currentSafariVersion = userAgent.includes("Safari/") && !userAgent.includes("Chrome/") && userAgent.match(/Version\/(\d+\.?\d*\.?\d*)/) ? humanReadableVersionToPacked(userAgent.match(/Version\/(\d+\.?\d*\.?\d*)/)[1]) : TARGET_NOT_SUPPORTED; if (currentSafariVersion < 150000) { throw new Error(`This emscripten-generated code requires Safari v${ packedVersionToHumanReadable(150000) } (detected v${currentSafariVersion})`); } var currentFirefoxVersion = userAgent.match(/Firefox\/(\d+(?:\.\d+)?)/) ? parseFloat(userAgent.match(/Firefox\/(\d+(?:\.\d+)?)/)[1]) : TARGET_NOT_SUPPORTED; if (currentFirefoxVersion < 79) { throw new Error(`This emscripten-generated code requires Firefox v79 (detected v${currentFirefoxVersion})`); } var currentChromeVersion = userAgent.match(/Chrome\/(\d+(?:\.\d+)?)/) ? parseFloat(userAgent.match(/Chrome\/(\d+(?:\.\d+)?)/)[1]) : TARGET_NOT_SUPPORTED; if (currentChromeVersion < 85) { throw new Error(`This emscripten-generated code requires Chrome v85 (detected v${currentChromeVersion})`); } })(); // end include: minimum_runtime_check.js // The Module object: Our interface to the outside world. We import // and export values on it. There are various ways Module can be used: // 1. Not defined. We create it here // 2. A function parameter, function(moduleArg) => Promise // 3. pre-run appended it, var Module = {}; ..generated code.. // 4. External script tag defines var Module. // We need to check if Module already exists (e.g. case 3 above). // Substitution will be replaced with actual code on later stage of the build, // this way Closure Compiler will not mangle it (e.g. case 4. 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 = typeof Module != 'undefined' ? Module : {}; // Determine the runtime environment we are in. You can customize this by // setting the ENVIRONMENT setting at compile time (see settings.js). // Attempt to auto-detect the environment var ENVIRONMENT_IS_WEB = !!globalThis.window; var ENVIRONMENT_IS_WORKER = !!globalThis.WorkerGlobalScope; // N.b. Electron.js environment is simultaneously a NODE-environment, but // also a web environment. var ENVIRONMENT_IS_NODE = globalThis.process?.versions?.node && globalThis.process?.type != 'renderer'; var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER; // --pre-jses are emitted after the Module integration code, so that they can // refer to Module (if they choose; they can also define Module) // include: src/api.js /* global FS HEAP8 Module _malloc _free getValue setValue stackAlloc stackRestore stackSave UTF8ToString stringToNewUTF8 removeFunction addFunction writeArrayToMemory */ "use strict"; /** * @typedef {{Database:Database, Statement:Statement}} SqlJs * @property {Database} Database A class that represents an SQLite database * @property {Statement} Statement The prepared statement class */ /** * @typedef {{locateFile:function(string):string}} SqlJsConfig * @property {function(string):string} locateFile * a function that returns the full path to a resource given its file name * @see https://emscripten.org/docs/api_reference/module.html */ /** * Asynchronously initializes sql.js * @function initSqlJs * @param {SqlJsConfig} config module inititialization parameters * @returns {SqlJs} * @example * initSqlJs({ * locateFile: name => '/path/to/assets/' + name * }).then(SQL => { * const db = new SQL.Database(); * const result = db.exec("select 'hello world'"); * console.log(result); * }) */ /** * @module SqlJs */ // Wait for preRun to run, and then finish our initialization Module["onRuntimeInitialized"] = function onRuntimeInitialized() { // Declare toplevel variables // register, used for temporary stack values var apiTemp = stackAlloc(4); var cwrap = Module["cwrap"]; // Null pointer var NULL = 0; // SQLite enum var SQLITE_OK = 0; var SQLITE_ROW = 100; var SQLITE_DONE = 101; var SQLITE_INTEGER = 1; var SQLITE_FLOAT = 2; var SQLITE_TEXT = 3; var SQLITE_BLOB = 4; // var - Encodings, used for registering functions. var SQLITE_UTF8 = 1; // var - Authorizer Action Codes used to identify change types in updateHook var SQLITE_INSERT = 18; var SQLITE_UPDATE = 23; var SQLITE_DELETE = 9; // var - cwrap function var sqlite3_open = cwrap("sqlite3_open", "number", ["string", "number"]); var sqlite3_close_v2 = cwrap("sqlite3_close_v2", "number", ["number"]); var sqlite3_exec = cwrap( "sqlite3_exec", "number", ["number", "string", "number", "number", "number"] ); var sqlite3_changes = cwrap("sqlite3_changes", "number", ["number"]); var sqlite3_prepare_v2 = cwrap( "sqlite3_prepare_v2", "number", ["number", "string", "number", "number", "number"] ); var sqlite3_sql = cwrap("sqlite3_sql", "string", ["number"]); var sqlite3_normalized_sql = cwrap( "sqlite3_normalized_sql", "string", ["number"] ); var sqlite3_prepare_v2_sqlptr = cwrap( "sqlite3_prepare_v2", "number", ["number", "number", "number", "number", "number"] ); var sqlite3_bind_text = cwrap( "sqlite3_bind_text", "number", ["number", "number", "number", "number", "number"] ); var sqlite3_bind_blob = cwrap( "sqlite3_bind_blob", "number", ["number", "number", "number", "number", "number"] ); var sqlite3_bind_double = cwrap( "sqlite3_bind_double", "number", ["number", "number", "number"] ); var sqlite3_bind_int = cwrap( "sqlite3_bind_int", "number", ["number", "number", "number"] ); var sqlite3_bind_parameter_index = cwrap( "sqlite3_bind_parameter_index", "number", ["number", "string"] ); var sqlite3_step = cwrap("sqlite3_step", "number", ["number"]); var sqlite3_errmsg = cwrap("sqlite3_errmsg", "string", ["number"]); var sqlite3_column_count = cwrap( "sqlite3_column_count", "number", ["number"] ); var sqlite3_data_count = cwrap("sqlite3_data_count", "number", ["number"]); var sqlite3_column_double = cwrap( "sqlite3_column_double", "number", ["number", "number"] ); var sqlite3_column_text = cwrap( "sqlite3_column_text", "string", ["number", "number"] ); var sqlite3_column_blob = cwrap( "sqlite3_column_blob", "number", ["number", "number"] ); var sqlite3_column_bytes = cwrap( "sqlite3_column_bytes", "number", ["number", "number"] ); var sqlite3_column_type = cwrap( "sqlite3_column_type", "number", ["number", "number"] ); var sqlite3_column_name = cwrap( "sqlite3_column_name", "string", ["number", "number"] ); var sqlite3_reset = cwrap("sqlite3_reset", "number", ["number"]); var sqlite3_clear_bindings = cwrap( "sqlite3_clear_bindings", "number", ["number"] ); var sqlite3_finalize = cwrap("sqlite3_finalize", "number", ["number"]); var sqlite3_create_function_v2 = cwrap( "sqlite3_create_function_v2", "number", [ "number", "string", "number", "number", "number", "number", "number", "number", "number" ] ); var sqlite3_value_type = cwrap("sqlite3_value_type", "number", ["number"]); var sqlite3_value_bytes = cwrap( "sqlite3_value_bytes", "number", ["number"] ); var sqlite3_value_text = cwrap("sqlite3_value_text", "string", ["number"]); var sqlite3_value_blob = cwrap("sqlite3_value_blob", "number", ["number"]); var sqlite3_value_double = cwrap( "sqlite3_value_double", "number", ["number"] ); var sqlite3_result_double = cwrap( "sqlite3_result_double", "", ["number", "number"] ); var sqlite3_result_null = cwrap( "sqlite3_result_null", "", ["number"] ); var sqlite3_result_text = cwrap( "sqlite3_result_text", "", ["number", "string", "number", "number"] ); var sqlite3_result_blob = cwrap( "sqlite3_result_blob", "", ["number", "number", "number", "number"] ); var sqlite3_result_int = cwrap( "sqlite3_result_int", "", ["number", "number"] ); var sqlite3_result_error = cwrap( "sqlite3_result_error", "", ["number", "string", "number"] ); // https://www.sqlite.org/c3ref/aggregate_context.html // void *sqlite3_aggregate_context(sqlite3_context*, int nBytes) var sqlite3_aggregate_context = cwrap( "sqlite3_aggregate_context", "number", ["number", "number"] ); var registerExtensionFunctions = cwrap( "RegisterExtensionFunctions", "number", ["number"] ); var sqlite3_update_hook = cwrap( "sqlite3_update_hook", "number", ["number", "number", "number"] ); /** * @classdesc * Represents a prepared statement. * Prepared statements allow you to have a template sql string, * that you can execute multiple times with different parameters. * * You can't instantiate this class directly, you have to use a * {@link Database} object in order to create a statement. * * **Warnings** * 1. When you close a database (using db.close()), all * its statements are closed too and become unusable. * 1. After calling db.prepare() you must manually free the assigned memory * by calling Statement.free(). Failure to do this will cause subsequent * 'DROP TABLE ...' statements to fail with 'Uncaught Error: database table * is locked'. * * Statements can't be created by the API user directly, only by * Database::prepare * * @see Database.html#prepare-dynamic * @see https://en.wikipedia.org/wiki/Prepared_statement * * @constructs Statement * @memberof module:SqlJs * @param {number} stmt1 The SQLite statement reference * @param {Database} db The database from which this statement was created */ function Statement(stmt1, db) { this.stmt = stmt1; this.db = db; // Index of the leftmost parameter is 1 this.pos = 1; // Pointers to allocated memory, that need to be freed // when the statemend is destroyed this.allocatedmem = []; } /** @typedef {string|number|null|Uint8Array} Database.SqlValue */ /** @typedef { Array|Object|null } Statement.BindParams */ /** Bind values to the parameters, after having reseted the statement. * If values is null, do nothing and return true. * * SQL statements can have parameters, * named *'?', '?NNN', ':VVV', '@VVV', '$VVV'*, * where NNN is a number and VVV a string. * This function binds these parameters to the given values. * * *Warning*: ':', '@', and '$' are included in the parameters names * * ## Value types * Javascript type | SQLite type * -----------------| ----------- * number | REAL, INTEGER * boolean | INTEGER * string | TEXT * Array, Uint8Array| BLOB * null | NULL * * @example Bind values to named parameters * var stmt = db.prepare( * "UPDATE test SET a=@newval WHERE id BETWEEN $mini AND $maxi" * ); * stmt.bind({$mini:10, $maxi:20, '@newval':5}); * * @example Bind values to anonymous parameters * // Create a statement that contains parameters like '?', '?NNN' * var stmt = db.prepare("UPDATE test SET a=? WHERE id BETWEEN ? AND ?"); * // Call Statement.bind with an array as parameter * stmt.bind([5, 10, 20]); * * @see http://www.sqlite.org/datatype3.html * @see http://www.sqlite.org/lang_expr.html#varparam * @param {Statement.BindParams} values The values to bind * @return {boolean} true if it worked * @throws {String} SQLite Error */ Statement.prototype.bind = function bind(values) { if (!this.stmt) { throw "Statement closed"; } this.reset(); if (Array.isArray(values)) return this.bindFromArray(values); if (values != null && typeof values === "object") { return this.bindFromObject(values); } return true; }; /** Execute the statement, fetching the the next line of result, that can be retrieved with {@link Statement.get}. @return {boolean} true if a row of result available @throws {String} SQLite Error */ Statement.prototype.step = function step() { if (!this.stmt) { throw "Statement closed"; } this.pos = 1; var ret = sqlite3_step(this.stmt); switch (ret) { case SQLITE_ROW: return true; case SQLITE_DONE: return false; default: throw this.db.handleError(ret); } }; /* Internal methods to retrieve data from the results of a statement that has been executed */ Statement.prototype.getNumber = function getNumber(pos) { if (pos == null) { pos = this.pos; this.pos += 1; } return sqlite3_column_double(this.stmt, pos); }; Statement.prototype.getBigInt = function getBigInt(pos) { if (pos == null) { pos = this.pos; this.pos += 1; } var text = sqlite3_column_text(this.stmt, pos); if (typeof BigInt !== "function") { throw new Error("BigInt is not supported"); } /* global BigInt */ return BigInt(text); }; Statement.prototype.getString = function getString(pos) { if (pos == null) { pos = this.pos; this.pos += 1; } return sqlite3_column_text(this.stmt, pos); }; Statement.prototype.getBlob = function getBlob(pos) { if (pos == null) { pos = this.pos; this.pos += 1; } var size = sqlite3_column_bytes(this.stmt, pos); var ptr = sqlite3_column_blob(this.stmt, pos); var result = new Uint8Array(size); for (var i = 0; i < size; i += 1) { result[i] = HEAP8[ptr + i]; } return result; }; /** Get one row of results of a statement. If the first parameter is not provided, step must have been called before. @param {Statement.BindParams} [params] If set, the values will be bound to the statement before it is executed @return {Array} One row of result @example Print all the rows of the table test to the console var stmt = db.prepare("SELECT * FROM test"); while (stmt.step()) console.log(stmt.get()); Enable BigInt support var stmt = db.prepare("SELECT * FROM test"); while (stmt.step()) console.log(stmt.get(null, {useBigInt: true})); */ Statement.prototype.get = function get(params, config) { config = config || {}; if (params != null && this.bind(params)) { this.step(); } var results1 = []; var ref = sqlite3_data_count(this.stmt); for (var field = 0; field < ref; field += 1) { switch (sqlite3_column_type(this.stmt, field)) { case SQLITE_INTEGER: var getfunc = config["useBigInt"] ? this.getBigInt(field) : this.getNumber(field); results1.push(getfunc); break; case SQLITE_FLOAT: results1.push(this.getNumber(field)); break; case SQLITE_TEXT: results1.push(this.getString(field)); break; case SQLITE_BLOB: results1.push(this.getBlob(field)); break; default: results1.push(null); } } return results1; }; /** Get the list of column names of a row of result of a statement. @return {Array} The names of the columns @example var stmt = db.prepare( "SELECT 5 AS nbr, x'616200' AS data, NULL AS null_value;" ); stmt.step(); // Execute the statement console.log(stmt.getColumnNames()); // Will print ['nbr','data','null_value'] */ Statement.prototype.getColumnNames = function getColumnNames() { var results1 = []; var ref = sqlite3_column_count(this.stmt); for (var i = 0; i < ref; i += 1) { results1.push(sqlite3_column_name(this.stmt, i)); } return results1; }; /** Get one row of result as a javascript object, associating column names with their value in the current row. @param {Statement.BindParams} [params] If set, the values will be bound to the statement, and it will be executed @return {Object} The row of result @see {@link Statement.get} @example var stmt = db.prepare( "SELECT 5 AS nbr, x'010203' AS data, NULL AS null_value;" ); stmt.step(); // Execute the statement console.log(stmt.getAsObject()); // Will print {nbr:5, data: Uint8Array([1,2,3]), null_value:null} */ Statement.prototype.getAsObject = function getAsObject(params, config) { var values = this.get(params, config); var names = this.getColumnNames(); var rowObject = {}; for (var i = 0; i < names.length; i += 1) { var name = names[i]; rowObject[name] = values[i]; } return rowObject; }; /** Get the SQL string used in preparing this statement. @return {string} The SQL string */ Statement.prototype.getSQL = function getSQL() { return sqlite3_sql(this.stmt); }; /** Get the SQLite's normalized version of the SQL string used in preparing this statement. The meaning of "normalized" is not well-defined: see {@link https://sqlite.org/c3ref/expanded_sql.html the SQLite documentation}. @example db.run("create table test (x integer);"); stmt = db.prepare("select * from test where x = 42"); // returns "SELECT*FROM test WHERE x=?;" @return {string} The normalized SQL string */ Statement.prototype.getNormalizedSQL = function getNormalizedSQL() { return sqlite3_normalized_sql(this.stmt); }; /** Shorthand for bind + step + reset Bind the values, execute the statement, ignoring the rows it returns, and resets it @param {Statement.BindParams} [values] Value to bind to the statement */ Statement.prototype.run = function run(values) { if (values != null) { this.bind(values); } this.step(); return this.reset(); }; Statement.prototype.bindString = function bindString(string, pos) { if (pos == null) { pos = this.pos; this.pos += 1; } var strptr = stringToNewUTF8(string); this.allocatedmem.push(strptr); this.db.handleError(sqlite3_bind_text( this.stmt, pos, strptr, -1, 0 )); return true; }; Statement.prototype.bindBlob = function bindBlob(array, pos) { if (pos == null) { pos = this.pos; this.pos += 1; } var blobptr = _malloc(array.length); writeArrayToMemory(array, blobptr); this.allocatedmem.push(blobptr); this.db.handleError(sqlite3_bind_blob( this.stmt, pos, blobptr, array.length, 0 )); return true; }; Statement.prototype.bindNumber = function bindNumber(num, pos) { if (pos == null) { pos = this.pos; this.pos += 1; } var bindfunc = ( num === (num | 0) ? sqlite3_bind_int : sqlite3_bind_double ); this.db.handleError(bindfunc(this.stmt, pos, num)); return true; }; Statement.prototype.bindNull = function bindNull(pos) { if (pos == null) { pos = this.pos; this.pos += 1; } return sqlite3_bind_blob(this.stmt, pos, 0, 0, 0) === SQLITE_OK; }; Statement.prototype.bindValue = function bindValue(val, pos) { if (pos == null) { pos = this.pos; this.pos += 1; } switch (typeof val) { case "string": return this.bindString(val, pos); case "number": return this.bindNumber(val + 0, pos); case "bigint": // BigInt is not fully supported yet at WASM level. return this.bindString(val.toString(), pos); case "boolean": return this.bindNumber(val + 0, pos); case "object": if (val === null) { return this.bindNull(pos); } if (val.length != null) { return this.bindBlob(val, pos); } break; default: break; } throw ( "Wrong API use : tried to bind a value of an unknown type (" + val + ")." ); }; /** Bind names and values of an object to the named parameters of the statement @param {Object} valuesObj @private @nodoc */ Statement.prototype.bindFromObject = function bindFromObject(valuesObj) { var that = this; Object.keys(valuesObj).forEach(function each(name) { var num = sqlite3_bind_parameter_index(that.stmt, name); if (num !== 0) { that.bindValue(valuesObj[name], num); } }); return true; }; /** Bind values to numbered parameters @param {Array} values @private @nodoc */ Statement.prototype.bindFromArray = function bindFromArray(values) { for (var num = 0; num < values.length; num += 1) { this.bindValue(values[num], num + 1); } return true; }; /** Reset a statement, so that its parameters can be bound to new values It also clears all previous bindings, freeing the memory used by bound parameters. */ Statement.prototype.reset = function reset() { this.freemem(); return ( sqlite3_clear_bindings(this.stmt) === SQLITE_OK && sqlite3_reset(this.stmt) === SQLITE_OK ); }; /** Free the memory allocated during parameter binding */ Statement.prototype.freemem = function freemem() { var mem; while ((mem = this.allocatedmem.pop()) !== undefined) { _free(mem); } }; /** Free the memory used by the statement @return {boolean} true in case of success */ Statement.prototype.free = function free() { var res; this.freemem(); res = sqlite3_finalize(this.stmt) === SQLITE_OK; delete this.db.statements[this.stmt]; this.stmt = NULL; return res; }; /** * @classdesc * An iterator over multiple SQL statements in a string, * preparing and returning a Statement object for the next SQL * statement on each iteration. * * You can't instantiate this class directly, you have to use a * {@link Database} object in order to create a statement iterator * * {@see Database#iterateStatements} * * @example * // loop over and execute statements in string sql * for (let statement of db.iterateStatements(sql) { * statement.step(); * // get results, etc. * // do not call statement.free() manually, each statement is freed * // before the next one is parsed * } * * // capture any bad query exceptions with feedback * // on the bad sql * let it = db.iterateStatements(sql); * try { * for (let statement of it) { * statement.step(); * } * } catch(e) { * console.log( * `The SQL string "${it.getRemainingSQL()}" ` + * `contains the following error: ${e}` * ); * } * * @implements {Iterator} * @implements {Iterable} * @constructs StatementIterator * @memberof module:SqlJs * @param {string} sql A string containing multiple SQL statements * @param {Database} db The database from which this iterator was created */ function StatementIterator(sql, db) { this.db = db; this.sqlPtr = stringToNewUTF8(sql); if (this.sqlPtr === null) { throw new Error("Unable to allocate memory for the SQL string"); } this.nextSqlPtr = this.sqlPtr; this.nextSqlString = null; this.activeStatement = null; } /** * @typedef {{ done:true, value:undefined } | * { done:false, value:Statement}} * StatementIterator.StatementIteratorResult * @property {Statement} value the next available Statement * (as returned by {@link Database.prepare}) * @property {boolean} done true if there are no more available statements */ /** Prepare the next available SQL statement @return {StatementIterator.StatementIteratorResult} @throws {String} SQLite error or invalid iterator error */ StatementIterator.prototype.next = function next() { if (this.sqlPtr === null) { return { done: true }; } if (this.activeStatement !== null) { this.activeStatement.free(); this.activeStatement = null; } if (!this.db.db) { this.finalize(); throw new Error("Database closed"); } var stack = stackSave(); var pzTail = stackAlloc(4); setValue(apiTemp, 0, "i32"); setValue(pzTail, 0, "i32"); try { this.db.handleError(sqlite3_prepare_v2_sqlptr( this.db.db, this.nextSqlPtr, -1, apiTemp, pzTail )); this.nextSqlPtr = getValue(pzTail, "i32"); var pStmt = getValue(apiTemp, "i32"); if (pStmt === NULL) { this.finalize(); return { done: true }; } this.activeStatement = new Statement(pStmt, this.db); this.db.statements[pStmt] = this.activeStatement; return { value: this.activeStatement, done: false }; } catch (e) { this.nextSqlString = UTF8ToString(this.nextSqlPtr); this.finalize(); throw e; } finally { stackRestore(stack); } }; StatementIterator.prototype.finalize = function finalize() { _free(this.sqlPtr); this.sqlPtr = null; }; /** Get any un-executed portions remaining of the original SQL string @return {String} */ StatementIterator.prototype.getRemainingSQL = function getRemainder() { // iff an exception occurred, we set the nextSqlString if (this.nextSqlString !== null) return this.nextSqlString; // otherwise, convert from nextSqlPtr return UTF8ToString(this.nextSqlPtr); }; /* implement Iterable interface */ if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { StatementIterator.prototype[Symbol.iterator] = function iterator() { return this; }; } /** @classdesc * Represents an SQLite database * @constructs Database * @memberof module:SqlJs * Open a new database either by creating a new one or opening an existing * one stored in the byte array passed in first argument * @param {Array} data An array of bytes representing * an SQLite database file */ function Database(data) { this.filename = "dbfile_" + (0xffffffff * Math.random() >>> 0); if (data != null) { FS.createDataFile("/", this.filename, data, true, true); } this.handleError(sqlite3_open(this.filename, apiTemp)); this.db = getValue(apiTemp, "i32"); registerExtensionFunctions(this.db); // A list of all prepared statements of the database this.statements = {}; // A list of all user function of the database // (created by create_function call) this.functions = {}; } /** Execute an SQL query, ignoring the rows it returns. @param {string} sql a string containing some SQL text to execute @param {Statement.BindParams} [params] When the SQL statement contains placeholders, you can pass them in here. They will be bound to the statement before it is executed. If you use the params argument, you **cannot** provide an sql string that contains several statements (separated by `;`) @example // Insert values in a table db.run( "INSERT INTO test VALUES (:age, :name)", { ':age' : 18, ':name' : 'John' } ); @return {Database} The database object (useful for method chaining) */ Database.prototype.run = function run(sql, params) { if (!this.db) { throw "Database closed"; } if (params) { var stmt = this.prepare(sql, params); try { stmt.step(); } finally { stmt.free(); } } else { this.handleError(sqlite3_exec(this.db, sql, 0, 0, apiTemp)); } return this; }; /** * @typedef {{ columns:Array, values:Array> }} Database.QueryExecResult * @property {Array} columns the name of the columns of the result * (as returned by {@link Statement.getColumnNames}) * @property { * Array> * } values one array per row, containing * the column values */ /** Execute an SQL query, and returns the result. * * This is a wrapper against * {@link Database.prepare}, * {@link Statement.bind}, * {@link Statement.step}, * {@link Statement.get}, * and {@link Statement.free}. * * The result is an array of result elements. There are as many result * elements as the number of statements in your sql string (statements are * separated by a semicolon) * * ## Example use * We will create the following table, named *test* and query it with a * multi-line statement using params: * * | id | age | name | * |:--:|:---:|:------:| * | 1 | 1 | Ling | * | 2 | 18 | Paul | * * We query it like that: * ```javascript * var db = new SQL.Database(); * var res = db.exec( * "DROP TABLE IF EXISTS test;\n" * + "CREATE TABLE test (id INTEGER, age INTEGER, name TEXT);" * + "INSERT INTO test VALUES ($id1, :age1, @name1);" * + "INSERT INTO test VALUES ($id2, :age2, @name2);" * + "SELECT id FROM test;" * + "SELECT age,name FROM test WHERE id=$id1", * { * "$id1": 1, ":age1": 1, "@name1": "Ling", * "$id2": 2, ":age2": 18, "@name2": "Paul" * } * ); * ``` * * `res` is now : * ```javascript * [ * {"columns":["id"],"values":[[1],[2]]}, * {"columns":["age","name"],"values":[[1,"Ling"]]} * ] * ``` * @param {string} sql a string containing some SQL text to execute @param {Statement.BindParams} [params] When the SQL statement contains placeholders, you can pass them in here. They will be bound to the statement before it is executed. If you use the params argument as an array, you **cannot** provide an sql string that contains several statements (separated by `;`). This limitation does not apply to params as an object. * @return {Array} The results of each statement */ Database.prototype.exec = function exec(sql, params, config) { if (!this.db) { throw "Database closed"; } var stmt = null; var originalSqlPtr = null; var currentSqlPtr = null; try { originalSqlPtr = stringToNewUTF8(sql); currentSqlPtr = originalSqlPtr; var pzTail = stackAlloc(4); var results = []; while (getValue(currentSqlPtr, "i8") !== NULL) { setValue(apiTemp, 0, "i32"); setValue(pzTail, 0, "i32"); this.handleError(sqlite3_prepare_v2_sqlptr( this.db, currentSqlPtr, -1, apiTemp, pzTail )); // pointer to a statement, or null var pStmt = getValue(apiTemp, "i32"); currentSqlPtr = getValue(pzTail, "i32"); // Empty statement if (pStmt !== NULL) { var curresult = null; stmt = new Statement(pStmt, this); if (params != null) { stmt.bind(params); } while (stmt.step()) { if (curresult === null) { curresult = { "columns": stmt.getColumnNames(), "values": [], }; results.push(curresult); } curresult.values.push(stmt.get(null, config)); } stmt.free(); } } return results; } catch (errCaught) { if (stmt) stmt.free(); throw errCaught; } finally { if (originalSqlPtr) _free(originalSqlPtr); } }; /** Execute an sql statement, and call a callback for each row of result. Currently this method is synchronous, it will not return until the callback has been called on every row of the result. But this might change. @param {string} sql A string of SQL text. Can contain placeholders that will be bound to the parameters given as the second argument @param {Statement.BindParams=} [params=] Parameters to bind to the query @param {function(Object):void} callback Function to call on each row of result @param {function():void} done A function that will be called when all rows have been retrieved @return {Database} The database object. Useful for method chaining @example Read values from a table db.each("SELECT name,age FROM users WHERE age >= $majority", {$majority:18}, function (row){console.log(row.name + " is a grown-up.")} ); */ // eslint-disable-next-line max-len Database.prototype.each = function each(sql, params, callback, done, config) { var stmt; if (typeof params === "function") { done = callback; callback = params; params = undefined; } stmt = this.prepare(sql, params); try { while (stmt.step()) { callback(stmt.getAsObject(null, config)); } } finally { stmt.free(); } if (typeof done === "function") { return done(); } return undefined; }; /** Prepare an SQL statement @param {string} sql a string of SQL, that can contain placeholders (`?`, `:VVV`, `:AAA`, `@AAA`) @param {Statement.BindParams} [params] values to bind to placeholders @return {Statement} the resulting statement @throws {String} SQLite error */ Database.prototype.prepare = function prepare(sql, params) { setValue(apiTemp, 0, "i32"); this.handleError( sqlite3_prepare_v2(this.db, sql, -1, apiTemp, NULL) ); // pointer to a statement, or null var pStmt = getValue(apiTemp, "i32"); if (pStmt === NULL) { throw "Nothing to prepare"; } var stmt = new Statement(pStmt, this); if (params != null) { stmt.bind(params); } this.statements[pStmt] = stmt; return stmt; }; /** Iterate over multiple SQL statements in a SQL string. * This function returns an iterator over {@link Statement} objects. * You can use a for..of loop to execute the returned statements one by one. * @param {string} sql a string of SQL that can contain multiple statements * @return {StatementIterator} the resulting statement iterator * @example Get the results of multiple SQL queries * const sql_queries = "SELECT 1 AS x; SELECT '2' as y"; * for (const statement of db.iterateStatements(sql_queries)) { * const sql = statement.getSQL(); // Get the SQL source * const result = statement.getAsObject({}); // Get the row of data * console.log(sql, result); * } * // This will print: * // 'SELECT 1 AS x;' { x: 1 } * // " SELECT '2' as y" { y: '2' } */ Database.prototype.iterateStatements = function iterateStatements(sql) { return new StatementIterator(sql, this); }; /** Exports the contents of the database to a binary array. This * operation will close and re-open the database which will cause * any pragmas to be set back to their default values. @return {Uint8Array} An array of bytes of the SQLite3 database file */ Database.prototype.export = function exportDatabase() { Object.values(this.statements).forEach(function each(stmt) { stmt.free(); }); Object.values(this.functions).forEach(removeFunction); this.functions = {}; this.handleError(sqlite3_close_v2(this.db)); var binaryDb = FS.readFile(this.filename, { encoding: "binary" }); this.handleError(sqlite3_open(this.filename, apiTemp)); this.db = getValue(apiTemp, "i32"); registerExtensionFunctions(this.db); return binaryDb; }; /** Close the database, and all associated prepared statements. * The memory associated to the database and all associated statements * will be freed. * * **Warning**: A statement belonging to a database that has been closed * cannot be used anymore. * * Databases **must** be closed when you're finished with them, or the * memory consumption will grow forever */ Database.prototype.close = function close() { // do nothing if db is null or already closed if (this.db === null) { return; } Object.values(this.statements).forEach(function each(stmt) { stmt.free(); }); Object.values(this.functions).forEach(removeFunction); this.functions = {}; if (this.updateHookFunctionPtr) { removeFunction(this.updateHookFunctionPtr); this.updateHookFunctionPtr = undefined; } this.handleError(sqlite3_close_v2(this.db)); FS.unlink("/" + this.filename); this.db = null; }; /** Analyze a result code, return null if no error occured, and throw an error with a descriptive message otherwise @nodoc */ Database.prototype.handleError = function handleError(returnCode) { var errmsg; if (returnCode === SQLITE_OK) { return null; } errmsg = sqlite3_errmsg(this.db); throw new Error(errmsg); }; /** Returns the number of changed rows (modified, inserted or deleted) by the latest completed INSERT, UPDATE or DELETE statement on the database. Executing any other type of SQL statement does not modify the value returned by this function. @return {number} the number of rows modified */ Database.prototype.getRowsModified = function getRowsModified() { return sqlite3_changes(this.db); }; var extract_blob = function extract_blob(ptr) { var size = sqlite3_value_bytes(ptr); var blob_ptr = sqlite3_value_blob(ptr); var blob_arg = new Uint8Array(size); for (var j = 0; j < size; j += 1) { blob_arg[j] = HEAP8[blob_ptr + j]; } return blob_arg; }; var parseFunctionArguments = function parseFunctionArguments(argc, argv) { var args = []; for (var i = 0; i < argc; i += 1) { var value_ptr = getValue(argv + (4 * i), "i32"); var value_type = sqlite3_value_type(value_ptr); var arg; if ( value_type === SQLITE_INTEGER || value_type === SQLITE_FLOAT ) { arg = sqlite3_value_double(value_ptr); } else if (value_type === SQLITE_TEXT) { arg = sqlite3_value_text(value_ptr); } else if (value_type === SQLITE_BLOB) { arg = extract_blob(value_ptr); } else arg = null; args.push(arg); } return args; }; var setFunctionResult = function setFunctionResult(cx, result) { switch (typeof result) { case "boolean": sqlite3_result_int(cx, result ? 1 : 0); break; case "number": sqlite3_result_double(cx, result); break; case "string": sqlite3_result_text(cx, result, -1, -1); break; case "object": if (result === null) { sqlite3_result_null(cx); } else if (result.length != null) { var blobptr = _malloc(result.length); writeArrayToMemory(result, blobptr); sqlite3_result_blob(cx, blobptr, result.length, -1); _free(blobptr); } else { sqlite3_result_error( cx, ( "Wrong API use : tried to return a value " + "of an unknown type (" + result + ")." ), -1 ); } break; default: sqlite3_result_null(cx); } }; /** Register a custom function with SQLite @example Register a simple function db.create_function("addOne", function (x) {return x+1;}) db.exec("SELECT addOne(1)") // = 2 @param {string} name the name of the function as referenced in SQL statements. @param {function(any)} func the actual function to be executed. @return {Database} The database object. Useful for method chaining */ Database.prototype.create_function = function create_function( name, func ) { function wrapped_func(cx, argc, argv) { var args = parseFunctionArguments(argc, argv); var result; try { result = func.apply(null, args); } catch (error) { sqlite3_result_error(cx, error, -1); return; } setFunctionResult(cx, result); } if (Object.prototype.hasOwnProperty.call(this.functions, name)) { removeFunction(this.functions[name]); delete this.functions[name]; } // The signature of the wrapped function is : // void wrapped(sqlite3_context *db, int argc, sqlite3_value **argv) var func_ptr = addFunction(wrapped_func, "viii"); this.functions[name] = func_ptr; this.handleError(sqlite3_create_function_v2( this.db, name, func.length, SQLITE_UTF8, 0, func_ptr, 0, 0, 0 )); return this; }; /** Register a custom aggregate with SQLite @example Register a custom sum function db.create_aggregate("js_sum", { init: () => 0, step: (state, value) => state + value, finalize: state => state }); db.exec("SELECT js_sum(column1) FROM (VALUES (1), (2))"); // = 3 @param {string} name the name of the aggregate as referenced in SQL statements. @param {object} aggregateFunctions object containing at least a step function. @param {function(): T} [aggregateFunctions.init=] a function receiving no arguments and returning an initial value for the aggregate function. The initial value will be null if this key is omitted. @param {function(T, any) : T} aggregateFunctions.step a function receiving the current state and a value to aggregate and returning a new state. Will receive the value from init for the first step. @param {function(T): any} [aggregateFunctions.finalize=] a function returning the result of the aggregate function given its final state. If omitted, the value returned by the last step will be used as the final value. @return {Database} The database object. Useful for method chaining @template T */ Database.prototype.create_aggregate = function create_aggregate( name, aggregateFunctions ) { // Default initializer and finalizer var init = aggregateFunctions["init"] || function init() { return null; }; var finalize = aggregateFunctions["finalize"] || function finalize(state) { return state; }; var step = aggregateFunctions["step"]; if (!step) { throw "An aggregate function must have a step function in " + name; } // state is a state object; we'll use the pointer p to serve as the // key for where we hold our state so that multiple invocations of // this function never step on each other var state = {}; function wrapped_step(cx, argc, argv) { // > The first time the sqlite3_aggregate_context(C,N) routine is // > called for a particular aggregate function, SQLite allocates N // > bytes of memory, zeroes out that memory, and returns a pointer // > to the new memory. // // We're going to use that pointer as a key to our state array, // since using sqlite3_aggregate_context as it's meant to be used // through webassembly seems to be very difficult. Just allocate // one byte. var p = sqlite3_aggregate_context(cx, 1); // If this is the first invocation of wrapped_step, call `init` // // Make sure that every path through the step and finalize // functions deletes the value state[p] when it's done so we don't // leak memory and possibly stomp the init value of future calls if (!Object.hasOwnProperty.call(state, p)) state[p] = init(); var args = parseFunctionArguments(argc, argv); var mergedArgs = [state[p]].concat(args); try { state[p] = step.apply(null, mergedArgs); } catch (error) { delete state[p]; sqlite3_result_error(cx, error, -1); } } function wrapped_finalize(cx) { var result; var p = sqlite3_aggregate_context(cx, 1); try { result = finalize(state[p]); } catch (error) { delete state[p]; sqlite3_result_error(cx, error, -1); return; } setFunctionResult(cx, result); delete state[p]; } if (Object.hasOwnProperty.call(this.functions, name)) { removeFunction(this.functions[name]); delete this.functions[name]; } var finalize_name = name + "__finalize"; if (Object.hasOwnProperty.call(this.functions, finalize_name)) { removeFunction(this.functions[finalize_name]); delete this.functions[finalize_name]; } // The signature of the wrapped function is : // void wrapped(sqlite3_context *db, int argc, sqlite3_value **argv) var step_ptr = addFunction(wrapped_step, "viii"); // The signature of the wrapped function is : // void wrapped(sqlite3_context *db) var finalize_ptr = addFunction(wrapped_finalize, "vi"); this.functions[name] = step_ptr; this.functions[finalize_name] = finalize_ptr; // passing null to the sixth parameter defines this as an aggregate // function // // > An aggregate SQL function requires an implementation of xStep and // > xFinal and NULL pointer must be passed for xFunc. // - http://www.sqlite.org/c3ref/create_function.html this.handleError(sqlite3_create_function_v2( this.db, name, step.length - 1, SQLITE_UTF8, 0, 0, step_ptr, finalize_ptr, 0 )); return this; }; /** Registers an update hook with SQLite. * * Every time a row is changed by whatever means, the callback is called * once with the change (`'insert'`, `'update'` or `'delete'`), the database * name and table name where the change happened and the * [rowid](https://www.sqlite.org/rowidtable.html) * of the row that has been changed. * * The rowid is cast to a plain number. If it exceeds * `Number.MAX_SAFE_INTEGER` (2^53 - 1), an error will be thrown. * * **Important notes:** * - The callback **MUST NOT** modify the database in any way * - Only a single callback can be registered at a time * - Unregister the callback by passing `null` * - Not called for some updates like `ON REPLACE CONFLICT` and `TRUNCATE` * (a `DELETE FROM` without a `WHERE` clause) * * See SQLite documentation on * [sqlite3_update_hook](https://www.sqlite.org/c3ref/update_hook.html) * for more details * * @example * // Create a database and table * var db = new SQL.Database(); * db.exec(` * CREATE TABLE users ( * id INTEGER PRIMARY KEY, -- this is the rowid column * name TEXT, * active INTEGER * ) * `); * * // Register an update hook * var changes = []; * db.updateHook(function(operation, database, table, rowId) { * changes.push({operation, database, table, rowId}); * console.log(`${operation} on ${database}.${table} row ${rowId}`); * }); * * // Insert a row - triggers the update hook with 'insert' * db.run("INSERT INTO users VALUES (1, 'Alice', 1)"); * // Logs: "insert on main.users row 1" * * // Update a row - triggers the update hook with 'update' * db.run("UPDATE users SET active = 0 WHERE id = 1"); * // Logs: "update on main.users row 1" * * // Delete a row - triggers the update hook with 'delete' * db.run("DELETE FROM users WHERE id = 1"); * // Logs: "delete on main.users row 1" * * // Unregister the update hook * db.updateHook(null); * * // This won't trigger any callback * db.run("INSERT INTO users VALUES (2, 'Bob', 1)"); * * @param {Database~UpdateHookCallback|null} callback * - Callback to be executed when a row changes. Takes the type of change, * the name of the database, the name of the table, and the row id of the * changed row. * - Set to `null` to unregister. * @returns {Database} The database object. Useful for method chaining */ Database.prototype.updateHook = function updateHook(callback) { if (this.updateHookFunctionPtr) { // unregister and cleanup a previously registered update hook sqlite3_update_hook(this.db, 0, 0); removeFunction(this.updateHookFunctionPtr); this.updateHookFunctionPtr = undefined; } if (!callback) { // no new callback to register return this; } // void(*)(void *,int ,char const *,char const *,sqlite3_int64) function wrappedCallback( ignored, operationCode, databaseNamePtr, tableNamePtr, rowIdBigInt ) { var operation; switch (operationCode) { case SQLITE_INSERT: operation = "insert"; break; case SQLITE_UPDATE: operation = "update"; break; case SQLITE_DELETE: operation = "delete"; break; default: throw "unknown operationCode in updateHook callback: " + operationCode; } var databaseName = UTF8ToString(databaseNamePtr); var tableName = UTF8ToString(tableNamePtr); if (rowIdBigInt > Number.MAX_SAFE_INTEGER) { throw "rowId too big to fit inside a Number"; } var rowId = Number(rowIdBigInt); callback(operation, databaseName, tableName, rowId); } this.updateHookFunctionPtr = addFunction(wrappedCallback, "viiiij"); sqlite3_update_hook( this.db, this.updateHookFunctionPtr, 0 // passed as the first arg to wrappedCallback ); return this; }; /** * @callback Database~UpdateHookCallback * @param {'insert'|'update'|'delete'} operation * - The type of change that occurred * @param {string} database * - The name of the database where the change occurred * @param {string} table * - The name of the database's table where the change occurred * @param {number} rowId * - The [rowid](https://www.sqlite.org/rowidtable.html) of the changed row */ // Preserve public API names across minification. /* eslint-disable no-self-assign */ Statement.prototype["bind"] = Statement.prototype.bind; Statement.prototype["step"] = Statement.prototype.step; Statement.prototype["get"] = Statement.prototype.get; Statement.prototype["getColumnNames"] = Statement.prototype.getColumnNames; Statement.prototype["getAsObject"] = Statement.prototype.getAsObject; Statement.prototype["getSQL"] = Statement.prototype.getSQL; Statement.prototype["getNormalizedSQL"] = Statement.prototype.getNormalizedSQL; Statement.prototype["run"] = Statement.prototype.run; Statement.prototype["reset"] = Statement.prototype.reset; Statement.prototype["freemem"] = Statement.prototype.freemem; Statement.prototype["free"] = Statement.prototype.free; StatementIterator.prototype["next"] = StatementIterator.prototype.next; StatementIterator.prototype["getRemainingSQL"] = StatementIterator.prototype.getRemainingSQL; Database.prototype["run"] = Database.prototype.run; Database.prototype["exec"] = Database.prototype.exec; Database.prototype["each"] = Database.prototype.each; Database.prototype["prepare"] = Database.prototype.prepare; Database.prototype["iterateStatements"] = Database.prototype.iterateStatements; Database.prototype["export"] = Database.prototype.export; Database.prototype["close"] = Database.prototype.close; Database.prototype["handleError"] = Database.prototype.handleError; Database.prototype["getRowsModified"] = Database.prototype.getRowsModified; Database.prototype["create_function"] = Database.prototype.create_function; Database.prototype["create_aggregate"] = Database.prototype.create_aggregate; Database.prototype["updateHook"] = Database.prototype.updateHook; /* eslint-enable no-self-assign */ // export Database to Module Module["Database"] = Database; }; // end include: src/api.js var arguments_ = []; var thisProgram = './this.program'; var quit_ = (status, toThrow) => { throw toThrow; }; // In MODULARIZE mode _scriptName needs to be captured already at the very top of the page immediately when the page is parsed, so it is generated there // before the page load. In non-MODULARIZE modes generate it here. var _scriptName = globalThis.document?.currentScript?.src; if (typeof __filename != 'undefined') { // Node _scriptName = __filename; } else if (ENVIRONMENT_IS_WORKER) { _scriptName = self.location.href; } // `/` should be present at the end if `scriptDirectory` is not empty var scriptDirectory = ''; function locateFile(path) { if (Module['locateFile']) { return Module['locateFile'](path, scriptDirectory); } return scriptDirectory + path; } // Hooks that are implemented differently in different runtime environments. var readAsync, readBinary; if (ENVIRONMENT_IS_NODE) { const isNode = globalThis.process?.versions?.node && globalThis.process?.type != 'renderer'; if (!isNode) throw new Error('not compiled for this environment (did you build to HTML and try to run it not on the web, or set ENVIRONMENT to something - like node - and run it someplace else - like on the web?)'); // These modules will usually be used on Node.js. Load them eagerly to avoid // the complexity of lazy-loading. var fs = require('node:fs'); scriptDirectory = __dirname + '/'; // include: node_shell_read.js readBinary = (filename) => { // We need to re-wrap `file://` strings to URLs. filename = isFileURI(filename) ? new URL(filename) : filename; var ret = fs.readFileSync(filename); assert(Buffer.isBuffer(ret)); return ret; }; readAsync = async (filename, binary = true) => { // See the comment in the `readBinary` function. filename = isFileURI(filename) ? new URL(filename) : filename; var ret = fs.readFileSync(filename, binary ? undefined : 'utf8'); assert(binary ? Buffer.isBuffer(ret) : typeof ret == 'string'); return ret; }; // end include: node_shell_read.js if (process.argv.length > 1) { thisProgram = process.argv[1].replace(/\\/g, '/'); } arguments_ = process.argv.slice(2); // MODULARIZE will export the module in the proper place outside, we don't need to export here if (typeof module != 'undefined') { module['exports'] = Module; } quit_ = (status, toThrow) => { process.exitCode = status; throw toThrow; }; } else if (ENVIRONMENT_IS_SHELL) { } else // Note that this includes Node.js workers when relevant (pthreads is enabled). // Node.js workers are detected as a combination of ENVIRONMENT_IS_WORKER and // ENVIRONMENT_IS_NODE. if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) { try { scriptDirectory = new URL('.', _scriptName).href; // includes trailing slash } catch { // Must be a `blob:` or `data:` URL (e.g. `blob:http://site.com/etc/etc`), we cannot // infer anything from them. } if (!(globalThis.window || globalThis.WorkerGlobalScope)) throw new Error('not compiled for this environment (did you build to HTML and try to run it not on the web, or set ENVIRONMENT to something - like node - and run it someplace else - like on the web?)'); { // include: web_or_worker_shell_read.js if (ENVIRONMENT_IS_WORKER) { readBinary = (url) => { var xhr = new XMLHttpRequest(); xhr.open('GET', url, false); xhr.responseType = 'arraybuffer'; xhr.send(null); return new Uint8Array(/** @type{!ArrayBuffer} */(xhr.response)); }; } readAsync = async (url) => { // Fetch has some additional restrictions over XHR, like it can't be used on a file:// url. // See https://github.com/github/fetch/pull/92#issuecomment-140665932 // Cordova or Electron apps are typically loaded from a file:// url. // So use XHR on webview if URL is a file URL. if (isFileURI(url)) { return new Promise((resolve, reject) => { var xhr = new XMLHttpRequest(); xhr.open('GET', url, true); xhr.responseType = 'arraybuffer'; xhr.onload = () => { if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0 resolve(xhr.response); return; } reject(xhr.status); }; xhr.onerror = reject; xhr.send(null); }); } var response = await fetch(url, { credentials: 'same-origin' }); if (response.ok) { return response.arrayBuffer(); } throw new Error(response.status + ' : ' + response.url); }; // end include: web_or_worker_shell_read.js } } else { throw new Error('environment detection error'); } var out = console.log.bind(console); var err = console.error.bind(console); var IDBFS = 'IDBFS is no longer included by default; build with -lidbfs.js'; var PROXYFS = 'PROXYFS is no longer included by default; build with -lproxyfs.js'; var WORKERFS = 'WORKERFS is no longer included by default; build with -lworkerfs.js'; var FETCHFS = 'FETCHFS is no longer included by default; build with -lfetchfs.js'; var ICASEFS = 'ICASEFS is no longer included by default; build with -licasefs.js'; var JSFILEFS = 'JSFILEFS is no longer included by default; build with -ljsfilefs.js'; var OPFS = 'OPFS is no longer included by default; build with -lopfs.js'; var NODEFS = 'NODEFS is no longer included by default; build with -lnodefs.js'; // perform assertions in shell.js after we set up out() and err(), as otherwise // if an assertion fails it cannot print the message assert(!ENVIRONMENT_IS_SHELL, 'shell environment detected but not enabled at build time. Add `shell` to `-sENVIRONMENT` to enable.'); // end include: shell.js // include: preamble.js // === Preamble library stuff === // Documentation for the public APIs defined in this file must be updated in: // site/source/docs/api_reference/preamble.js.rst // A prebuilt local version of the documentation is available at: // site/build/text/docs/api_reference/preamble.js.txt // You can also build docs locally as HTML or other formats in site/ // An online HTML version (which may be of a different version of Emscripten) // is up at http://kripken.github.io/emscripten-site/docs/api_reference/preamble.js.html var wasmBinary; // WASM == 2 includes wasm2js.js separately. // include: wasm2js.js // wasm2js.js - enough of a polyfill for the WebAssembly object so that we can load // wasm2js code that way. /** @suppress{duplicate, const, checkTypes} */ var WebAssembly = { // Note that we do not use closure quoting (this['buffer'], etc.) on these // functions, as they are just meant for internal use. In other words, this is // not a fully general polyfill. /** @constructor */ Memory: function(opts) { this.buffer = new ArrayBuffer(opts['initial'] * 65536); }, Module: function(binary) { // TODO: use the binary and info somehow - right now the wasm2js output is embedded in // the main JS }, /** @constructor */ Instance: function(module, info) { // TODO: use the module somehow - right now the wasm2js output is embedded in // the main JS // This will be replaced by the actual wasm2js code. this.exports = ( function instantiate(info) { function Table(ret) { ret.grow = function(by) { var old = this.length; this.length = this.length + by; return old; }; ret.set = function(i, func) { this[i] = func; }; ret.get = function(i) { return this[i]; }; return ret; } var bufferView; var base64ReverseLookup = new Uint8Array(123/*'z'+1*/); for (var i = 25; i >= 0; --i) { base64ReverseLookup[48+i] = 52+i; // '0-9' base64ReverseLookup[65+i] = i; // 'A-Z' base64ReverseLookup[97+i] = 26+i; // 'a-z' } base64ReverseLookup[43] = 62; // '+' base64ReverseLookup[47] = 63; // '/' /** @noinline Inlining this function would mean expanding the base64 string 4x times in the source code, which Closure seems to be happy to do. */ function base64DecodeToExistingUint8Array(uint8Array, offset, b64) { var b1, b2, i = 0, j = offset, bLength = b64.length, end = offset + (bLength*3>>2) - (b64[bLength-2] == '=') - (b64[bLength-1] == '='); for (; i < bLength; i += 4) { b1 = base64ReverseLookup[b64.charCodeAt(i+1)]; b2 = base64ReverseLookup[b64.charCodeAt(i+2)]; uint8Array[j++] = base64ReverseLookup[b64.charCodeAt(i)] << 2 | b1 >> 4; if (j < end) uint8Array[j++] = b1 << 4 | b2 >> 2; if (j < end) uint8Array[j++] = b2 << 6 | base64ReverseLookup[b64.charCodeAt(i+3)]; } return uint8Array; } function initActiveSegments(imports) { base64DecodeToExistingUint8Array(bufferView, 1024, "3.49.1 {} %s.%z json_pretty infinity affinity RealAffinity busy temp_store_directory not a writable directory openDirectory shrink_memory out of memory failed to allocate %u bytes of memory HAVING clause on a non-aggregate query IntCopy SCopy VDestroy Multiply query_only unlikely table "%s" has more than one primary key foreign key json_group_array jsonb_group_array json_array jsonb_array julianday fts4aux vacuum_%016llx unix sqlite_rename_quotefix prefix LIKE or GLOB pattern too complex unhex charindex OpenAutoindex automatic_index auto-index orphan index DropIndex idx ReopenIdx pcx max MemMax %02x 0x  FROM '%q'.'%q%s' AS x CREATE TABLE x rw psow implies_nonnull_row now integer overflow window shadow ResultRow IfNullRow new no such view cannot modify %s because it is a view Cannot add a column to a view cannot UPSERT a view Prev stdev  %llu %c%u Failed to read ptrmap key=%u %.*z:%u Offset %u out of range %u..%u invalid page number %u failed to get page %u 2nd reference to page %u Fragmentation of %u bytes reported as %u on page %u freelist leaf count too big on page %u Multiple uses for byte %u of page %u %s is %u but should be %u unable to use function %s in the requested context SorterNext VNext incomplete input busy_timeout localhost cannot drop column "%s": no other columns exist persist foreign_key_list index_list function_list collation_list database_list module_list PRAGMA table_list pragma_list set list ValueList sqlite_rename_test RowSetTest SequenceTest fast Last Cast sqrt SorterSort "\/bfnrt json_insert jsonb_insert IdxInsert SorterInsert restart cot BitNot IfNot Pagecount freelist_count max_page_count ResetCount wal_autocheckpoint wal_checkpoint Checkpoint Savepoint a CHECK constraint %sON CONFLICT clause does not match any PRIMARY KEY or UNIQUE constraint CursorHint _content parent DISTINCT aggregates must have exactly one argument comment API called with finalized prepared statement API called with NULL prepared statement MaxPgcnt default value of column [%s] is not constant MustBeInt Cannot add a column with non-constant default Halt lanoit stat_init Init AutoCommit analysis_limit soft_heap_limit hard_heap_limit journal_size_limit OffsetLimit SeekHit ON clause references tables to its right ShiftRight hght ShiftLeft Offset reset json_set jsonb_set too many columns in result set %r ORDER BY term does not match any column in the result set snippet stat_get sqlite_compileoption_get strict NoConflict json_group_object jsonb_group_object json_object jsonb_object json_extract jsonb_extract Subtract lstat fstat %s_stat tbl,idx,stat unsupported file format group_concat Concat Lt Gt defer_foreign_keys always parameters are not allowed in views concat_ws status synchronous index %s already exists output file already exists %s %T already exists trigger %T already exists NotExists ignore_check_constraints CHECK constraints expressions prohibited in PRIMARY KEY and UNIQUE constraints json_object() requires an even number of arguments json_%s() needs an odd number of arguments %s_segments unable to delete/modify user-function due to active statements unable to delete/modify collation sequence due to active statements offsets reverse_unordered_selects iissssss iss sess uncompress cannot open savepoint - SQL statements in progress cannot release savepoint - SQL statements in progress cannot commit transaction - SQL statements in progress cannot VACUUM - SQL statements in progress access parameters recursive_triggers the INDEXED BY clause is not allowed on UPDATE or DELETE statements within triggers the NOT INDEXED clause is not allowed on UPDATE or DELETE statements within triggers qualified table names are not allowed on INSERT, UPDATE, and DELETE statements within triggers Child page depth differs unable to close due to unfinalized statements or unfinished backups acos IfPos compile_options DISTINCT is not supported for window functions FILTER clause may only be used with aggregate window functions non-deterministic functions index expressions SELECTs to the left and right of %s do not have the same number of result columns virtual tables cannot use computed columns generated columns table %s has %d values for %d columns radians all VALUES must have the same number of terms empty_result_callbacks LoadAnalysis flgs flags vfs %d columns assigned %d values JSON cannot hold BLOB values failed memory resize %u to %u bytes partial index WHERE clauses short_column_names full_column_names unable to open a temporary database file for storing temporary tables cannot create triggers on shadow tables cannot create triggers on virtual tables %s RETURNING is not available on virtual tables cannot join using column %s - column not present in both tables AUTOINCREMENT not allowed on WITHOUT ROWID tables %s cannot use variables too many SQL variables subqueries cannot use window functions in recursive queries count_changes total_changes degrees RETURNING may not use "TABLE.*" wildcards threads abs .%.*s CREATE %s %.*s CREATE%s INDEX %.*s invalid uri authority: %.*s unknown table option: %.*s %.*s%s ,%s%s%s SCAN %s%s%s sqlite_altertab_%s SCAN %d CONSTANT ROW%s %Q%s 0x%x:%s %d:%s %s: %s.%s.%s missing datatype for %s.%s cannot store %s value in %s column %s.%s non-%s value in %s.%s TEXT value in %s.%s NULL value in %s.%s NUMERIC value in %s.%s malformed inverted index for FTS%d table %s.%s %s: %s.%s no such table column: %s.%s ..%s %.18s-%s subrtnsig:%d,%s  USING INTEGER PRIMARY KEY (%s use DROP VIEW to delete view %s row not in PRIMARY KEY order for %s illegal first argument to %s misuse of aliased window function %s too many columns on %s too many columns in %s %s prohibited in %s CHECK constraint failed in %s non-deterministic use of %s() in %s recovered %d pages from %s misuse of aliased aggregate %s %s %T cannot reference objects in database %s cannot detach database %s a JOIN clause is required before %s cannot open value of type %s cannot fstat db file %s recovered %d frames from WAL file %s PRIMARY KEY missing on table %s use DROP TABLE to delete table %s SELECT %s ORDER BY rowid %s SELECT %s WHERE rowid BETWEEN %lld AND %lld ORDER BY rowid %s there is already an index named %s table %S has no column named %s there is already a table named %s statement aborts at %d: [%s] %s COVERING INDEX %s SELECT %s unsupported use of NULLS %s ATTACH %Q AS %s USE TEMP B-TREE FOR %s -- TRIGGER %s RIGHT-JOIN %s >? AND %s %z: %s recursive reference in a subquery: %s vtable constructor called recursively: %s no such index: %s no such window: %s cannot override %s of window: %s cannot open view: %s no such savepoint: %s cannot open table with generated columns: %s no such vfs: %s multiple recursive references: %s error in %s %s%s%s: %s unable to validate the inverted index for FTS%d table %s.%s: %s error in %s %s after %s: %s unknown tokenizer: %s error parsing prefix parameter: %s unrecognized parameter: %s unrecognized order: %s unrecognized matchinfo: %s no such column: %s file renamed while open: %s file unlinked while open: %s unsupported encoding: %s cannot limit WAL size: %s MJ delete: %s target object/alias may not appear in FROM clause: %s object name reserved for internal use: %s unknown database: %s unable to open database: %s no such database: %s there is already another table or index with this name: %s duplicate column name: %s duplicate WITH table name: %s no such module: %s multiple links to file: %s cannot open virtual table: %s no such table: %s multiple references to recursive table: %s no such %s mode: %s MJ collide: %s no such collation sequence: %s circular reference: %s cannot open table without rowid: %s %s mode not allowed: %s vtable constructor failed: %s automatic extension loading failed: %s database table is locked: %s database schema is locked: %s vtable constructor did not declare schema: %s abort at %d in [%s]: %s -- %s %z - %s os_unix.c:%d: (%d) %s(%s) - %s wr rightstr leftstr instr substr expr_implies_expr invalid arguments to fts4aux constructor missing %s parameter in fts4 constructor the "." operator fts3cursor near "%T": syntax error internal query planner error unknown error Unknown error domain error not an error SQL logic error disk I/O error floor rmdir mkdir segdir fts3_tokenizer unknown tokenizer power lower sqlite_temp_master sqlite_master porter ResetSorter FkCounter API call with %s database connection pointer strfilter VFilter ESCAPE expression must be a single character upper proper cannot use RETURNING in a trigger DropTrigger second argument to nth_value must be a positive integer argument of ntile must be a positive integer frame starting offset must be a non-negative integer frame ending offset must be a non-negative integer Integer Rowid %lld out of order Remainder frame starting offset must be a non-negative number frame ending offset must be a non-negative number addr padr char year Clear BitOr seq CollSeq ElseEq regexp OpenDup Noop Jump /usr/tmp /var/tmp temp current_timestamp AggStep modeStep varianceStep munmap mmap mremap sqlite_returning_%p vtab:%p ssensuo ilsuo auto Goto into incremental_vacuum enabled with a max rootpage of zero IfNotZero DecrJumpZero FkIfZero seqno index_xinfo table_xinfo matchinfo index_info table_info OpenPseudo fchown BeginSubrtn Return json no query solution index corruption database corruption free space corruption json_error_position unknown column "%s" in foreign key definition %s.xBestIndex malfunction authorizer malfunction %#T() may not be used as a window function '%s' is not a function Function cannot start a transaction within a transaction cannot change %s wal mode from within a transaction temporary storage cannot be changed from within a transaction cannot VACUUM from within a transaction Safety level may not be changed inside a transaction Transaction Permutation unknown operation unsupported frame specification RANGE with offset PRECEDING/FOLLOWING requires one ORDER BY expression too many levels of trigger recursion user_version sqlite_version data_version schema_version sqlite_drop_column sqlite_rename_column after drop column no such column must have at least one non-generated column cannot use DEFAULT on a generated column add column Cannot add a PRIMARY KEY column Cannot add a UNIQUE column cannot add a STORED column VColumn builtin asin at most %d tables in a join min origin VBegin main Explain sign ssen open IfNotOpen SorterOpen VOpen IfSizeBetween hidden atan median SeekScan VInitIn auto_vacuum incremental_vacuum IncrVacuum sum flexnum pm drop column from /dev/urandom AddImm rtrim ltrim readonly_shm %s-shm tnem RAISE() may only be used within a trigger-program Program Param ful fcntl ioctl igol locking protocol ncol notnull ifnull /dev/null database or disk is full NotNull SoftNull IsNull ZeroOrNull HaltIfNull coll cache_spill RowCell ceil detail padl unix-excl tbl wal virtual total incremental OpenEphemeral AggFinal normal Index already optimal partial real Real pk ok unlink readlink FinishSeek DeferredSeek nolock CursorUnlock block %s.lock CursorLock TableLock integrity_check foreign_key_check quick_check cell_size_check integrity-check FkCheck TypeCheck VCheck IntegrityCk rezi noitazi itivi ssenevi iti issisi isisi pi noi gni sissii issisii sssiii sei itici etaci laci coth month json_array_length octet_length overflow list length wdth stat_push flush acosh asinh atanh json_patch jsonb_patch datatype mismatch argument type mismatch abbreviated query algorithm search unixepoch sqlite_attach sqlite_detach json_each avg narg sqlite_log statement too long cannot open %s column for writing substring String ceiling encoding string or blob too big string_agg ReleaseReg %.16g %!0.15g %!.15g ssenluf printf typeof modeof out of rename columns of inf -Inf nullif iif off timediff 0123456789abcdef If %c%04d-%02d-%02d %02d:%02d:%06.3f %.3f 50f 40f %!.*f getpagesize docsize mmap_size default_cache_size PRAGMA %Q.page_size fts3tokenize optimize json_remove jsonb_remove Move cannot commit - no transaction is active cannot rollback - no transaction is active exclusive true IsTrue unique dflt_value Cannot add a REFERENCES column with non-NULL default value AggValue json_quote pwrite OpenWrite on_delete secure_delete IdxDelete private aggregate VCreate on_update VUpdate current_date fallocate ftruncate replicate bad parameter or other API misuse too many terms in %s BY clause too many terms in ORDER BY clause aggregate functions are not allowed in the GROUP BY clause PARTITION clause a NATURAL join may not have an ON or USING clause database %s is already in use AggInverse reverse close Close false attempt to write a readonly database corrupt database attached databases must use the same text encoding as main database file is not a database temp_store %s clause should come after %s not before Expire square expr_compare SorterCompare subtype SetSubtype GetSubtype ClrSubtype json_type IsType IfNoHope iltne unix-none InitCoroutine EndCoroutine icne localtime strftime datetime current_time tneme after rename non-text filename VRename ambiguous column name temporary trigger may not have qualified name simple lower_quartile upper_quartile unix-dotfile cannot open file unable to open database file immutable Abortable legacy_alter_table sqlite_rename_table cannot create trigger on system table virtual table no such table number of columns in foreign key does not match the number of columns in the referenced table local time unavailable another row available no more rows available Variable DropTable utf16le UTF16le UTF-16le case_sensitive_like SetCookie ReadCookie cache column index out of range notification message warning message invalid rootpage Extends off end of page MAX_PAGE_COUNT=0xfffffffe json_tree CreateBtree dee journal_mode locking_mode opcode unicode JournalMode Divide coalesce sqlite_sequence Sequence difference variance Once Trace json_replace jsonb_replace utf16be UTF16be UTF-16be Ne Le Ge 20c:20e 20b:20e %!0.20e getcwd MakeRecord thstndrd likelihood fchmod round NotFound subsecond Rewind SeekEnd BitAnd old %lld %lld no such rowid: %lld rebuild Yield last_insert_rowid %s.rowid SELECT*FROM"%w".%s ORDER BY rowid SELECT*FROM"%w".%s WHERE %s ORDER BY rowid IdxRowid NewRowid SeekRowid geteuid invalid json_valid fkid __langid %z, langid languageid docid application_id sqlite_source_id not authorized Index optimized notindexed unable to identify the object to be reindexed views may not be indexed virtual tables may not be indexed table %s may not be indexed read_uncommitted recursive aggregate queries not supported query aborted rows inserted interrupted checkpointed access to %z is prohibited access to view "%s" prohibited rows deleted generated rows updated notused row value misused sqlite_compileoption_used Page %u: never used ColumnsUsed stored virtual tables may not be altered view %s may not be altered table %s may not be altered shared index associated with UNIQUE or PRIMARY KEY constraint cannot be dropped table %s may not be dropped view %s is circularly defined unopened database disk image is malformed %s constraint failed FOREIGN KEY constraint failed large file support is disabled fts3tokenize disabled database %s is locked database is locked database table is locked authorization denied access permission denied table %S has %d columns but %d values were supplied temporary table name must be unqualified table %s may not be modified conflicting ON CONFLICT clauses specified no tables specified database is already attached database schema has changed excluded Page %u: pointer map referenced RowSetAdd FilterAdd pread RowSetRead OpenRead %04d %03d %02d:%02d:%02d %04d-%02d-%02d %2d 40f-21a-21d 50f-20a-20d 40f-20a-20d sqlite_stat%d column%d sqlite_autoindex_%s_%d variable number must be between ?1 and ?%d unable to get the page. error code=%d k(%d UPDATE %Q.sqlite_master SET rootpage=%d WHERE #%d AND rootpage=#%d UPDATE %Q.sqlite_master SET type='%s', name=%Q, tbl_name=%Q, rootpage=#%d, sql=%Q WHERE rowid=#%d UPDATE %Q.sqlite_master SET type='table', name=%Q, tbl_name=%Q, rootpage=0, sql=%Q WHERE rowid=#%d too many attached databases - max %d too many arguments on %s() - max %d expected %d columns for '%s' but got %d attempt to open "%s" as file descriptor %d btreeInitPage() returns error code %d %r %s BY term out of range - should be between 1 and %d sub-select returns %d columns - expected %d IN(...) element has %d term%s - expected %d %sLIST SUBQUERY %d REUSE LIST SUBQUERY %d %sSCALAR SUBQUERY %d REUSE SUBQUERY %d INDEX %d too many FROM clause terms, max: %d rwc utc desc asc checkpoint_fullfsync full_fsync charindexFunc sqrtFunc cotFunc rightFunc leftFunc acosFunc floorFunc powerFunc strfilterFunc properFunc padrFunc expFunc asinFunc signFunc atanFunc ceilFunc padlFunc cothFunc acoshFunc asinhFunc atanhFunc logFunc rad2degFunc reverseFunc PureFunc squareFunc differenceFunc deg2radFunc padcFunc atn2Func log10Func enc numeric 1==argc SqlExec subsec padc %.4c%s%.16c sqlite-src/sqlite-amalgamation-3490100/extension-functions.c %s/etilqs_%llx%c unrecognized matchinfo request: %c Gosub glob zeroblob randomblob Blob jsonb ilb itilib memdb rota evita lanoita eta RowData SorterData icna sqlite_temp_schema sqlite_schema writable_schema trusted_schema corrupt schema ParseSchema illa ezila itila msila sqlite_ pragma_ SQLITE_ _ROWID_ %s at line %d of [%.10s] bind on a busy prepared statement: [%s] malformed MATCH expression: [%s] [%lld] [] [ LEFT-MOST SUBQUERY COMPOUND QUERY ANY generated columns cannot be part of the PRIMARY KEY AUTOINCREMENT is only allowed on an INTEGER PRIMARY KEY docid INTEGER PRIMARY KEY FOREIGN KEY USE TEMP B-TREE FOR %sORDER BY USE TEMP B-TREE FOR LAST %d TERMS OF ORDER BY GROUP BY iisX isiX AUTOMATIC PARTIAL COVERING INDEX AUTOMATIC COVERING INDEX -mj%06X9%02X SCAN CONSTANT ROW VIEW json_object() labels must be TEXT FIRST LAST EXCEPT NOT  INT IdxLT SeekLT SET DEFAULT MUTEX_OMIT COMMIT LIMIT RIGHT IdxGT SeekGT LEFT DISTINCT RESTRICT INTERSECT too many terms in compound SELECT unknown join type: %T%s%T%s%T -%T too many arguments on function %T unknown database %T foreign key on %s should reference only one column of table %T CREATE VIRTUAL TABLE %T hex literal too big: %s%#T no such function: %#T not authorized to use function: %#T DEFAULT_RECURSIVE_TRIGGERS ENABLE_FTS3_PARENTHESIS DISABLE_LFS %s %S SCAN %S no such index: %S cannot create %s trigger on view: %S no such trigger: %S cannot create INSTEAD OF trigger on table: %S MATERIALIZE %!S CO-ROUTINE %!S USING INDEX %s FOR IN-OPERATOR USING ROWID SEARCH ON TABLE %s FOR IN-OPERATOR MULTI-INDEX OR SQLITE_TMPDIR CREATE BLOOM FILTER AFTER INTEGER ORDER NEAR DELETE FROM %Q.%s WHERE %s=%Q name=%Q AND sql=%Q DELETE FROM %Q.sqlite_sequence WHERE name=%Q , x.%Q SELECT * FROM %Q.%Q UPDATE "%w".sqlite_sequence set name = %Q WHERE name = %Q UPDATE "%w".sqlite_master SET sql = printf('%%.%ds, ',sql) || %Q || substr(sql,1+length(printf('%%.%ds',sql))) WHERE type = 'table' AND name = %Q bad JSON path: %Q SETUP GROUP RECURSIVE STEP SNaN QNaN malformed JSON NO ACTION OMIT_LOAD_EXTENSION UNION  LEFT-JOIN BEGIN ,arg HIDDEN ,schema HIDDEN SCAN DEFAULT_AUTOVACUUM  NUM PM RTRIM AM Cannot add a NOT NULL column with default value NULL NOT NULL SET NULL SELECT 1 FROM %Q.'%q_segments' WHERE blockid=? AND block IS NULL UNION ALL  REAL CHECK abort due to ROLLBACK MATCH SEARCH USING ENABLE_NORMALIZE  UNIQUE DELETE UPDATE %u-ROW VALUES CLAUSE RELEASE NOCASE BEFORE NONE IdxLE SeekLE TABLE 16LE IdxGE SeekGE %s USING TEMP B-TREE CASCADE 16BE AND ROWID OID DIRECT_OVERFLOW_READ DESC SELECT idx, start_block, leaves_end_block, end_block, root FROM %Q.'%q_segdir' WHERE level = ? ORDER BY idx ASC SELECT idx, start_block, leaves_end_block, end_block, root FROM %Q.'%q_segdir' WHERE level BETWEEN ? AND ?ORDER BY level DESC, idx ASC SELECT level, idx, end_block FROM %Q.'%q_segdir' WHERE level BETWEEN ? AND ? ORDER BY level DESC, idx ASC SELECT idx FROM %Q.'%q_segdir' WHERE level=? ORDER BY 1 ASC SYSTEM_MALLOC BLOB BBB @ %s: "%s" - should this be a string literal in single-quotes? UPDATE OR FAIL %Q.'%q_segdir' SET level=-1,idx=? WHERE level=? AND idx=? UPDATE %Q.'%q_segdir' SET idx = ? WHERE level=? AND idx=? %s=? SELECT %s WHERE rowid=? SELECT size FROM %Q.'%q_docsize' WHERE docid=? SELECT value FROM %Q.'%q_stat' WHERE id=? ?,?,? DELETE FROM %Q.'%q_segdir' WHERE level BETWEEN ? AND ? SELECT max(level) FROM %Q.'%q_segdir' WHERE level BETWEEN ? AND ? DELETE FROM %Q.'%q_segments' WHERE blockid BETWEEN ? AND ? UPDATE %Q.'%q_segdir' SET start_block = ?, root = ?WHERE level = ? AND idx = ? SELECT idx, start_block, leaves_end_block, end_block, root FROM %Q.'%q_segdir' WHERE level = ? AND idx = ? DELETE FROM %Q.'%q_segdir' WHERE level = ? AND idx = ? DELETE FROM %Q.'%q_segdir' WHERE level = ? SELECT count(*) FROM %Q.'%q_segdir' WHERE level = ? SELECT %s WHERE rowid = ? DELETE FROM %Q.'%q_content' WHERE rowid = ? DELETE FROM %Q.'%q_docsize' WHERE docid = ? , ? <expr> <b> <b>...</b> ->> -> separators= tokenchars= automerge= < INSERT INTO %Q.sqlite_master VALUES('index',%Q,%Q,#%d,%Q); CREATE TABLE %Q.'%q_segments'(blockid INTEGER PRIMARY KEY, block BLOB); CREATE TABLE %Q.'%q_docsize'(docid INTEGER PRIMARY KEY, size BLOB); CREATE TABLE IF NOT EXISTS %Q.'%q_stat'(id INTEGER PRIMARY KEY, value BLOB); CREATE TABLE %Q.'%q_segdir'(level INTEGER,idx INTEGER,start_block INTEGER,leaves_end_block INTEGER,end_block INTEGER,root BLOB,PRIMARY KEY(level, idx)); UPDATE %Q.sqlite_master SET tbl_name = %Q, name = CASE WHEN type='table' THEN %Q WHEN name LIKE 'sqliteX_autoindex%%' ESCAPE 'X'      AND type='index' THEN 'sqlite_autoindex_' || %Q || substr(name,%d+18) ELSE name END WHERE tbl_name=%Q COLLATE nocase AND (type='table' OR type='index' OR type='trigger'); DROP TABLE IF EXISTS %Q.'%q_segments';DROP TABLE IF EXISTS %Q.'%q_segdir';DROP TABLE IF EXISTS %Q.'%q_docsize';DROP TABLE IF EXISTS %Q.'%q_stat';%s DROP TABLE IF EXISTS %Q.'%q_content'; ALTER TABLE %Q.'%q_content'  RENAME TO '%q_content'; ALTER TABLE %Q.'%q_stat'  RENAME TO '%q_stat'; ALTER TABLE %Q.'%q_segments' RENAME TO '%q_segments'; ALTER TABLE %Q.'%q_segdir'   RENAME TO '%q_segdir'; ALTER TABLE %Q.'%q_docsize'  RENAME TO '%q_docsize'; :memory: file: -9e999 9.0e999 +- 
	0123456789 \u0009 String8 utf8 UTF8 UTF-8 DEFAULT_SECTOR_SIZE=4096 DEFAULT_PAGE_SIZE=4096 MAX_VARIABLE_NUMBER=32766 MAX_PAGE_SIZE=65536 UTF16 UTF-16 p5 too many references to "%s": max 65535 FLAGS parameter to json_valid() must be between 1 and 15 sqlite_stat4 fts4 p4 DEFAULT_FILE_FORMAT=4 Int64 pwrite64 pread64 MALLOC_SOFT_LIMIT=1024 sqlite_stat3 SAVEPOINT fts3 ROLLBACK TO fts3 RELEASE fts3 p3 ENABLE_FTS3 p2 atn2 atan2 remove_diacritics=2 DEFAULT_SYNCHRONOUS=2 DEFAULT_WAL_SYNCHRONOUS=2 argc==3 ||argc==2 MAX_DEFAULT_PAGE_SIZE=8192 SELECT tbl,idx,stat FROM %Q.sqlite_stat1 AggStep1 remove_diacritics=1 ATOMIC_INTRINSICS=1 TEMP_STORE=1 argc==1 unicode61 UPDATE OR FAIL %Q.'%q_segdir' SET level=? WHERE level=-1 DEFAULT_JOURNAL_SIZE_LIMIT=-1 SELECT level, count(*) AS cnt FROM %Q.'%q_segdir'   GROUP BY level HAVING cnt>=?  ORDER BY (level %% 1024) ASC, 2 DESC LIMIT 1 SELECT (SELECT max(idx) FROM %Q.'%q_segdir' WHERE level = ?) + 1 SELECT'INSERT INTO %s.'||quote(name)||' SELECT*FROM"%w".'||quote(name)FROM %s.sqlite_schema WHERE type='table'AND coalesce(rootpage,1)>0 SELECT sql FROM "%w".sqlite_schema WHERE type='table'AND name<>'sqlite_sequence' AND coalesce(rootpage,1)>0 remove_diacritics=0 MAX_WORKER_THREADS=0 DEFAULT_WORKER_THREADS=0 MAX_MMAP_SIZE=0 DEFAULT_MMAP_SIZE=0 THREADSAFE=0 922337203685477580 2025-02-18 13:38:58 873d4e274b4988d260ba8354a9718324a1c26187a4ab4c1cc0227c03d0f10e70 DEFAULT_PCACHE_INITSZ=20 log10 MAX_ATTACHED=10 \u00 MAX_COMPOUND_SELECT=500 ?000 MAX_COLUMN=2000 DEFAULT_CACHE_SIZE=-2000 DEFAULT_WAL_AUTOCHECKPOINT=1000 MAX_EXPR_DEPTH=1000 MAX_TRIGGER_DEPTH=1000 MAX_FUNCTION_ARG=1000 \u0000 MAX_LIKE_PATTERN_LENGTH=50000 MAX_VDBE_OP=250000000 MAX_LENGTH=1000000000 MAX_SQL_LENGTH=1000000000 second argument to %#T() must be a constant between 0.0 and 1.0 COMPILER=clang-21.0.0 /proc/self/fd/ %Q. N. -- , noskipscan* unordered* sz=[0-9]* (subquery-%u) (join-%u) Bad ptr map entry key=%u expected=(%u,%u) got=(%u,%u) max rootpage (%u) disagrees with header (%u) CREATE TABLE x(type text,name text,tbl_name text,rootpage int,sql text) CREATE TABLE %Q.%s(%s) automatic index on %s(%s) ANY(%s) INSERT INTO %Q.'%q_content' VALUES(%s) CREATE TABLE %Q.'%q_content'(%s) malformed database schema (%s) MERGE (%s) CREATE TABLE %Q.sqlite_sequence(name,seq) CREATE TABLE x(input, token, start, end, position) UPDATE "%w".sqlite_master SET sql = sqlite_drop_column(%d, sql, %d) WHERE (type=='table' AND tbl_name=%Q COLLATE nocase) memdb(%p,%lld) %s(%d) zeroblob(%d) FTS expression tree is too large (maximum depth %d) Expression tree is too large (maximum depth %d) (blob) USE TEMP B-TREE FOR %s(ORDER BY) USE TEMP B-TREE FOR %s(DISTINCT) UPDATE "%w".sqlite_master SET sql = sqlite_rename_column(sql, type, name, %Q, %Q, %d, %Q, %d, %d) WHERE name NOT LIKE 'sqliteX_%%' ESCAPE 'X'  AND (type != 'index' OR tbl_name = %Q) CREATE TABLE x(key,value,type,atom,id,parent,fullkey,path,json HIDDEN,root HIDDEN) CREATE TABLE x(term, col, documents, occurrences, languageid HIDDEN) CREATE TABLE x(%s %Q HIDDEN, docid HIDDEN, %Q HIDDEN) (NULL) %c?) SELECT NOT EXISTS(SELECT docid FROM %Q.'%q_content' WHERE rowid!=?) REPLACE INTO %Q.'%q_segdir' VALUES(?,?,?,?,?,?) REPLACE INTO %Q.'%q_stat' VALUES(?,?) REPLACE INTO %Q.'%q_docsize' VALUES(?,?) ,%s(?) REPLACE INTO %Q.'%q_segments'(blockid, block) VALUES(?, ?) SELECT coalesce((SELECT max(blockid) FROM %Q.'%q_segments') + 1, 1) INSERT INTO %s.sqlite_schema SELECT*FROM "%w".sqlite_schema WHERE type IN('view','trigger') OR(type='table'AND rootpage=0) wrong number of arguments to function snippet() misuse of aggregate: %s() misuse of %s function %#T() wrong number of arguments to function %#T() unsafe use of %#T() ORDER BY may not be used with non-aggregate %#T() FILTER may not be used with non-aggregate %#T() unknown function: %#T() misuse of aggregate: %#T() ambiguous reference to %s in USING() UPDATE temp.sqlite_master SET sql = sqlite_rename_column(sql, type, name, %Q, %Q, %d, %Q, %d, 1) WHERE type IN ('trigger', 'view') UPDATE sqlite_temp_schema SET sql = sqlite_rename_table(%Q, type, name, sql, %Q, %Q, 1), tbl_name = CASE WHEN tbl_name=%Q COLLATE nocase AND   sqlite_rename_test(%Q, sql, type, name, 1, 'after rename', 0) THEN %Q ELSE tbl_name END WHERE type IN ('view', 'trigger') ,%s(x.'c%d%q') INSERT INTO %Q.sqlite_master VALUES('trigger',%Q,%Q,0,'CREATE TRIGGER %q') INSERT INTO %Q.%Q(%Q) VALUES('flush') SELECT 2 * total(1 + leaves_end_block - start_block)   FROM (SELECT * FROM %Q.'%q_segdir'         WHERE level = ? ORDER BY idx ASC LIMIT ?  ) 
) BLOOM FILTER ON %S ( SELECT sql FROM "%w".sqlite_schema WHERE type='index' DELETE FROM %Q.sqlite_master WHERE name=%Q AND type='index' name='%q' AND type='index' DELETE FROM %Q.'%q_content' DELETE FROM %Q.'%q_stat' DELETE FROM %Q.'%q_segments' DELETE FROM %Q.'%q_segdir' SELECT ? UNION SELECT level / (1024 * ?) FROM %Q.'%q_segdir' SELECT max( level %% 1024 ) FROM %Q.'%q_segdir' DELETE FROM %Q.sqlite_master WHERE name=%Q AND type='trigger' DELETE FROM %Q.sqlite_master WHERE tbl_name=%Q and type!='trigger' tbl_name='%q' AND type!='trigger' '%.*q' %z, 'c%d%q' type='trigger' AND name='%q' , x.'%q' index '%q' DELETE FROM %Q.'%q_docsize' UPDATE "%w".sqlite_master SET sql = sqlite_rename_table(%Q, type, name, sql, %Q, %Q, %d) WHERE (type!='index' OR tbl_name=%Q COLLATE nocase)AND   name NOT LIKE 'sqliteX_%%' ESCAPE 'X' SELECT CASE WHEN quick_check GLOB 'CHECK*' THEN raise(ABORT,'CHECK constraint failed') WHEN quick_check GLOB 'non-* value in*' THEN raise(ABORT,'type mismatch on DEFAULT') ELSE raise(ABORT,'NOT NULL constraint failed') END  FROM pragma_quick_check(%Q,%Q) WHERE quick_check GLOB 'CHECK*' OR quick_check GLOB 'NULL*' OR quick_check GLOB 'non-* value in*' UPDATE "%w".sqlite_master SET sql = sqlite_rename_quotefix(%Q, sql)WHERE name NOT LIKE 'sqliteX_%%' ESCAPE 'X' AND sql NOT LIKE 'create virtual%%' UPDATE temp.sqlite_master SET sql = sqlite_rename_quotefix('temp', sql)WHERE name NOT LIKE 'sqliteX_%%' ESCAPE 'X' AND sql NOT LIKE 'create virtual%%' sqlite\_% $ # SELECT*FROM"%w" SELECT*FROM"%w"."%w" SELECT raise(ABORT,%Q) FROM "%w"."%w" ANALYZE "%w"."%w" foreign key mismatch - "%w" referencing "%w" double-quoted string literal: "%w" ."%.*s" syntax error after column name "%.*s" %c"%s" ("%s" cannot %s %s "%s" generated column loop on "%s" cannot INSERT into generated column "%s" error in generated column "%s" cannot UPDATE generated column "%s" %s in "%s" trigger "%s" may not write to shadow table "%s" UPSERT not implemented for virtual table "%s" unsafe use of virtual table "%s" cannot create a TEMP index on non-TEMP table "%s" no such index: "%s" unknown datatype for %s.%s: "%s" cannot drop %s column: "%s" no such column: "%s" unrecognized token: "%s" \" no such column: "%T" unrecognized token: "%T" ." weekday  non-unique entry in index  wrong # of entries in index   values differ from index   missing from index   of index  rowid not at end-of-record for row  %r  start of  %d %d %d %d   USING COVERING INDEX   VIRTUAL TABLE INDEX  SELECT 1 FROM "%w".sqlite_master WHERE name NOT LIKE 'sqliteX_%%' ESCAPE 'X' AND sql NOT LIKE 'create virtual%%' AND sqlite_rename_test(%Q, sql, type, name, %d, %Q, %d)=NULL  SELECT 1 FROM temp.sqlite_master WHERE name NOT LIKE 'sqliteX_%%' ESCAPE 'X' AND sql NOT LIKE 'create virtual%%' AND sqlite_rename_test(%Q, sql, type, name, 1, %Q, %d)=NULL   USING  LAST TERM OF  CREATE  CREATE TABLE   AND  CORRELATED  PRAGMA  Tree %u page %u cell %u:  Tree %u page %u:  Freelist:  Tree %u page %u right child:  --  %z%Q,  "%w"  @        ,
    ,
 *** in database %s ***
"); base64DecodeToExistingUint8Array(bufferView, 30832, "ZAoBEAAAcwAEBQAAZwABAx4AegAEBgAAcQAECQAAUQAECgAAdwAEDgAAYwAACAAAbwgAAAACdQoAEAAAeBAAABABWBAAAAAEZgABAQAAZQABAh4ARQABAg4ARwABAw4AaQoBEAAAbgAABAAAJQAABwAAcBAADQABVAAACwAAUwAADAAAcgoBDwAAAAAAAAAAMDEyMzQ1Njc4OUFCQ0RFRjAxMjM0NTY3ODlhYmNkZWYALXgwAFgw"); base64DecodeToExistingUint8Array(bufferView, 31024, "ZXhwYW5kIDMyLWJ5dGUgawABAgMEBQYHCAkKCwwNDg8QERITFBUWFxgZGhscHR4fICEiIyQlJicoKSorLC0uLzAxMjM0NTY3ODk6Ozw9Pj9AYWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXpbXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX5/gIGCg4SFhoeIiYqLjI2Oj5CRkpOUlZaXmJmam5ydnp+goaKjpKWmp6ipqqusra6vsLGys7S1tre4ubq7vL2+v8DBwsPExcbHyMnKy8zNzs/Q0dLT1NXW19jZ2tvc3d7f4OHi4+Tl5ufo6err7O3u7/Dx8vP09fb3+Pn6+/z9/v8BAAABAQAAAQABAAEBAAEAAAEAAIkAAACKAAAAiwAAAAQFAwUBBQEFAgUCBQEFAQUEBQMFAQUBBQIFAgUBBQEFAgUCBQIFAgUCBQIFAgUCBQQFAwUCBQIFAgUCBQIFAgWpAAAAZgAAAB8ABQFeAAABVAEAAEYAAAAqP1sAJV8AAQ=="); base64DecodeToExistingUint8Array(bufferView, 31433, "AQEBAQE="); base64DecodeToExistingUint8Array(bufferView, 31456, "AQCAAEAAAIAAAAAAAAAAAAwMDAwMDAwMDAwAAAAAAAAACgoKCgoKAgICAgICAgICAgICAgICAgICAgKAAAAAQIAqKioqKioiIiIiIiIiIiIiIiIiIiIiIiIiIgAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBSRUlOREVYRURFU0NBUEVBQ0hFQ0tFWUJFRk9SRUlHTk9SRUdFWFBMQUlOU1RFQUREQVRBQkFTRUxFQ1RBQkxFRlRIRU5ERUZFUlJBQkxFTFNFWENMVURFTEVURU1QT1JBUllJU05VTExTQVZFUE9JTlRFUlNFQ1RJRVNOT1ROVUxMSUtFWENFUFRSQU5TQUNUSU9OQVRVUkFMVEVSQUlTRVhDTFVTSVZFWElTVFNDT05TVFJBSU5UT0ZGU0VUUklHR0VSQU5HRU5FUkFURURFVEFDSEFWSU5HTE9CRUdJTk5FUkVGRVJFTkNFU1VOSVFVRVJZV0lUSE9VVEVSRUxFQVNFQVRUQUNIQkVUV0VFTk9USElOR1JPVVBTQ0FTQ0FERUZBVUxUQ0FTRUNPTExBVEVDUkVBVEVDVVJSRU5UX0RBVEVJTU1FRElBVEVKT0lOU0VSVE1BVENIUExBTkFMWVpFUFJBR01BVEVSSUFMSVpFREVGRVJSRURJU1RJTkNUVVBEQVRFVkFMVUVTVklSVFVBTFdBWVNXSEVOV0hFUkVDVVJTSVZFQUJPUlRBRlRFUkVOQU1FQU5EUk9QQVJUSVRJT05BVVRPSU5DUkVNRU5UQ0FTVENPTFVNTkNPTU1JVENPTkZMSUNUQ1JPU1NDVVJSRU5UX1RJTUVTVEFNUFJFQ0VESU5HRkFJTEFTVEZJTFRFUkVQTEFDRUZJUlNURk9MTE9XSU5HRlJPTUZVTExJTUlUSUZPUkRFUkVTVFJJQ1RPVEhFUlNPVkVSRVRVUk5JTkdSSUdIVFJPTExCQUNLUk9XU1VOQk9VTkRFRFVOSU9OVVNJTkdWQUNVVU1WSUVXSU5ET1dCWUlOSVRJQUxMWVBSSU1BUlk="); base64DecodeToExistingUint8Array(bufferView, 32356, "AgACAAgACQAOABAAFAAXABkAGQAdACEAJAApAC4AMAA1ADYAOwA+AEEAQwBFAE4AUQBWAFoAWgBeAGMAZQBpAG8AdwB7AHsAewB+AIEAhACJAI4AkgCTAJgAnACgAKgArgC1ALgAuAC7AL0AwwDGAM4A0wDYANsA3gDiAOwA7wD0APQA+AD8AAMBCQEPARUBFQEbARwBIAEnASsBMgE4AUQBTQFPAVUBWgFcAWMBZwFyAXkBegGBAYcBjQGSAZgBnAGfAagBrQGxAbcBuQG8AcUBxwHJAdIB1gHcAeIB6gHvAe8B7wH/AQgCCwIPAhQCGwIgAikCLQIwAjUCNwI7AkMCSQJMAlUCWgJiAmICZgJvAnQCeQJ/AoIChQKIAooCjwKTAg=="); base64DecodeToExistingUint8Array(bufferView, 32657, "BwcFBAYEBQMGBwMGBgcHAwgCBgUEBAMKBAcGCQQCBgUJCQQHAwIEBAYLBgIHBQUJBgoEBgIDBwUJBgYEBQUKBgUHBAUHBgcHBgUHAwcEBwYMCQQGBQQHBgwICAIGBgcGBAUJBQUGAwQJDQICBAYGCAURDAcJBAQGBwUJBAQFAgUIBgQJBQgEAwkFBQYEBgICCQMH"); base64DecodeToExistingUint8Array(bufferView, 32816, "6gMAAAAAAAAAQAAAAAAAAOsDAAAAAAAAAAAEAAAAAAD3Aw=="); base64DecodeToExistingUint8Array(bufferView, 32859, "gAAAAADsAwAAAAAAAAAAQAAAAAAA7QMAAAAAAAAAAAEAAAAAAO4DAAAAAAAAAAgAAAAAAADvAwAAAAAAAAAAgAAAAAAA8AM="); base64DecodeToExistingUint8Array(bufferView, 32939, "AQAAAADxAw=="); base64DecodeToExistingUint8Array(bufferView, 32955, "AgAAAADyAw=="); base64DecodeToExistingUint8Array(bufferView, 32971, "EAAAAADzAwAAAAAAAAEAAAgAAAAA9AM="); base64DecodeToExistingUint8Array(bufferView, 33003, "BAAAAAD2Aw=="); base64DecodeToExistingUint8Array(bufferView, 33019, "IAAAAAD1Aw=="); base64DecodeToExistingUint8Array(bufferView, 33035, "QAAAAAD4AwAAAAAAAAIAAAAAAAAA+QMAAAAAAACAAAAAAAAAAPoDAAAAAAAAAAQAAAAAAAD7AwAAAAAAAAAQAAAAAAAA/AM="); base64DecodeToExistingUint8Array(bufferView, 33116, "EAAAAP0D"); base64DecodeToExistingUint8Array(bufferView, 33132, "IAAAAP4D"); base64DecodeToExistingUint8Array(bufferView, 33148, "QAAAAADKmjsAypo70AcAAOgDAAD0AQAAgLLmDugDAAAKAAAAUMMAAP5/AADoAwAAAAAAAAMAAACMAAAAjQAAAI4AAACPAAAAkAAAAJEAAACSAAAAkwAAAJQAAACVAAAAlgAAAJcAAACYAAAAmQAAAJoAAACbAAAAnAAAAJ0AAAADAAAAtAAAAI0AAACOAAAAjwAAAJAAAACRAAAAtQAAALYAAAC3AAAAlQAAAJYAAACXAAAAAAAAAJkAAACaAAAAmwAAAJwAAACdAAAAAQAAALgAAACNAAAAjgAAAI8AAACQAAAAkQAAALkAAAC6AAAAuwAAAJUAAACWAAAAlwAAAAAAAACZAAAAmgAAAJsAAACcAAAAnQAAAAMAAAC8AAAAvQAAAL4AAAC/AAAAwAAAAMEAAADCAAAAwwAAAAAAAADEAAAAAAAAAMU="); base64DecodeToExistingUint8Array(bufferView, 33496, "xgAAAMc="); base64DecodeToExistingUint8Array(bufferView, 33512, "AQAAANMAAADUAAAA1QAAANYAAADXAAAA2A=="); base64DecodeToExistingUint8Array(bufferView, 33588, "2dUF+SChY9c="); base64DecodeToExistingUint8Array(bufferView, 33632, "U1FMaXRlIGZvcm1hdCAzAAABAgMEBQYHCAkKCwwNDg8QERITFBUWFxgZGhscHR4fAAECAwQFBgcICQoLDA0ODwABAgMEBQYHAAECAwABAABCSU5BUlk="); base64DecodeToExistingUint8Array(bufferView, 33728, "z1UAAPlaAAAJUAAAOFAAAKIKAAA8DAAAQioAAJcKAADSOQAA/iwAAM0kAADgMwAANwwAAG8nAACvRgAAeTYAAAE7AADpCwAA4SYAABs6AAANMgAAPAoAAFk2AAA+CgAA0QYAANJJAAD8TwAAFFAAAAlKAACOLAAAYDYAAI0NAACuOgAAsToAAIE7AAAKDwAA1gkAAKksAADlCQAA6wkAAME6AACxCAAARQcAAL0IAAD2TwAAA0oAAMxJAAC3JgAA0zoAAA5QAADhQAAAuQkAAJAtAADHJwAAAhMAAAwuAAD7LQAAWjoAAMomAABKDgAAXToAAEcOAABgOgAAxiYAALAnAAC6JwAA+iwAALwIAADOJAAAv0UAADopAAAsKAAAhzYAAB4uAAAhDAAACiYAAPRbAABLMQAAICgAACQuAAADLgAAzkYAALI4AAC5MgAA7gQAAO0EAADlBAAAeC8AAMcGAAC+JgAAMi0AAC4EAADbCQAATioAAB42AAAhMwAAEy4AAOAMAAAwLAAAgC8AADIEAACCOgAAbwoAAPw4AADyOAAAQQYAAOxAAADQOgAAtCYAANYMAADGDAAA10AAAPENAAD8BAAA3jkAAComAABADgAAkDMAANQmAAA1CgAA/QUAAH8uAADjWgAAmCwAAMQJAAAOKAAAKzUAALU9AADKLAAAlQwAAP45AAB4OwAAIgoAADouAAC1MwAAagoAABg2AAAJRwAAAUcAAIU7AADTBgAAyDoAABIKAAAcCgAAsjMAAOYuAABvOwAA2y4AAPQEAACuJgAAgCQAAJk5AAAeRgAAaEcAALYUAAC7OAAAMwYAADElAADALgAAkS8AAMdAAACYLQAAjCQAAFMGAACJDAAAEjUAAA8nAAATXQAAdTMAAI0uAAD9NQAAFS8AAPouAAAgLwAAaywAAM4zAADzBAAAoywAAIovAADTLAAALywAAOc2AABCCgAAswsAAEQ2AAA5NgAALjYAANFAAAAgOgAACAsAAIUxAADcJgAAdywAAJ03"); base64DecodeToExistingUint8Array(bufferView, 34512, "DU8AALFPAABwTwAAxUgAAAAAAAABAgACAgABAgEBAQIBAhABAQEBAQECAQEQEBAAAgI="); base64DecodeToExistingUint8Array(bufferView, 34577, "AQIDBAYICAAAAAAAAAEBAgIDAwQEBQUGBgcHCAgJCQoKCwsMDA0NDg4PDxAQERESEhMTFBQVFRYWFxcYGBkZGhobGxwcHR0eHh8fICAhISIiIyMkJCUlJiYnJygoKSkqKisrLCwtLS4uLy8wMDExMjIzMzQ0NTU2Njc3ODg5ORBAAkA="); base64DecodeToExistingUint8Array(bufferView, 34720, "yEkAAGtPAACsSQAAEFIAAFtPAAAAAQIDBAYIAAAAAADONgAAXisAAM4rAAAhACAAHgAcABo="); base64DecodeToExistingUint8Array(bufferView, 34784, "qzMAABoJAADvMQAAADQAALcEAABhLgAAAQEDAAUABgAI"); base64DecodeToExistingUint8Array(bufferView, 34840, "AQ=="); base64DecodeToExistingUint8Array(bufferView, 34865, "BQwPEhUYGyMmLTUAAAAAYQBkAGQAcgAAAG8AcABjAG8AZABlAAAAcAAxAAAAcAAyAAAAcAAzAAAAcAA0AAAAcAA1AAAAYwBvAG0AbQBlAG4AdAAAAGkAZAAAAHAAYQByAGUAbgB0AAAAbgBvAHQAdQBzAGUAZAAAAGQAZQB0AGEAaQBs"); base64DecodeToExistingUint8Array(bufferView, 35008, "miYAAMM5AAAZXQAAa1wAAFxcAADbWwAAZlsAAFYLAADtOwAAHAsAAG09AABHLgAAAAAAABAAQQCBAQGBg4MBAQMDARIBycnJyQFJSUlJyUnBAUFBwQFBQUFBQSYmQSMLgQEDAwMLCwsLCwsBAwMBQQEAAAICCAAQEBAAEAAQEAAAEBAAAAACAgIAABIeIEAAAAAQEABAQCYmJiYmJiYmJiYAQBJAQBAAAABAAEBAEBAAAAAAAEAAUABABAQAQFBAEAAAEAAAAAAAABAABhAABBo="); base64DecodeToExistingUint8Array(bufferView, 35229, "QBBQQAAQEAISEg=="); base64DecodeToExistingUint8Array(bufferView, 35256, "2QAAANoAAADbAAAAAAAAANwAAADdAAAA3gAAAN8AAADgAAAA4QAAAOI="); base64DecodeToExistingUint8Array(bufferView, 35360, "RwwAAAEQ"); base64DecodeToExistingUint8Array(bufferView, 35376, "0DsAAAIUAAAIAAAAAAAAANssAAADlQ=="); base64DecodeToExistingUint8Array(bufferView, 35408, "CwYAAAQUAAAAgAAAAAAAANMIAAAFEDgBAAAAAAAAAABrMgAABpU="); base64DecodeToExistingUint8Array(bufferView, 35456, "Li4AAAeU"); base64DecodeToExistingUint8Array(bufferView, 35472, "3jgAAAgC"); base64DecodeToExistingUint8Array(bufferView, 35488, "WC8AAAQUAAAAACAAAAAAALJEAAAEFAAAEAAAAAAAAABMCQAACRAmAgAAAAAAAAAACBMAAAoQ"); base64DecodeToExistingUint8Array(bufferView, 35552, "FhcAAAQUAAAAAAAAAQAAABQrAAACGAAADwAAAAAAAABbCQAADBAvAwAAAAAAAAAAYzIAAA2VNwEAAAAAAAAAAE0OAAAEFAAAAAAIAAAAAACfFAAABBQAAAABAAAAAAAAWjEAAA4U"); base64DecodeToExistingUint8Array(bufferView, 35664, "Oi8AAA9xKwQAAAAAAAAAACIJAAAQYQAIAAAAAAAAAABTDgAABBQAAABAAAAAAAAATAoAAAIY"); base64DecodeToExistingUint8Array(bufferView, 35728, "YBUAAAQUAAAEAAAAAAAAAL1EAAAEFAAACAAAAAAAAAA+CQAAERAbBgAAAAAAAAAAZgwAABIQ"); base64DecodeToExistingUint8Array(bufferView, 35792, "FA8AAAQUAAAAAgAAAAAAAOcsAAATAw=="); base64DecodeToExistingUint8Array(bufferView, 35824, "+CcAABRhFQMAAAAAAAAAADMJAAAVYSYFAAAAAAAAAADWJwAAFGEVBgEAAAAAAAAAKi8AABZx"); base64DecodeToExistingUint8Array(bufferView, 35888, "qTkAABeR"); base64DecodeToExistingUint8Array(bufferView, 35904, "dgwAABiQ"); base64DecodeToExistingUint8Array(bufferView, 35920, "pzcAAAQUAAAAAAAEAAAAALY5AAAakA=="); base64DecodeToExistingUint8Array(bufferView, 35952, "WwoAABuR"); base64DecodeToExistingUint8Array(bufferView, 35968, "WTIAABw="); base64DecodeToExistingUint8Array(bufferView, 35984, "aQkAAB0QCQEAAAAAAAAAAJcyAAAeIQ=="); base64DecodeToExistingUint8Array(bufferView, 36016, "XwoAABuR"); base64DecodeToExistingUint8Array(bufferView, 36032, "gDIAAB+U"); base64DecodeToExistingUint8Array(bufferView, 36048, "hwkAACAQCQEAAAAAAAAAAAUFAAAEFAAAAAAQAAAAAABMLwAAFnE="); base64DecodeToExistingUint8Array(bufferView, 36096, "nzwAAAQUAAAAAAAABAAAAIURAAAEFAAAACAAAAAAAABxEAAABBQAAAAQAAAAAAAAISsAAAIUAAABAAAAAAAAAKQzAAAhEA=="); base64DecodeToExistingUint8Array(bufferView, 36176, "TRUAAAQUAABAAAAAAAAAAHwEAAAiAg=="); base64DecodeToExistingUint8Array(bufferView, 36208, "VgwAACMQ"); base64DecodeToExistingUint8Array(bufferView, 36224, "nA4AACSV"); base64DecodeToExistingUint8Array(bufferView, 36240, "AygAACVhCAYAAAAAAAAAAHwJAAAmIQ8GAAAAAAAAAADiJwAAJWEIBwEAAAAAAAAAyDUAACcU"); base64DecodeToExistingUint8Array(bufferView, 36304, "QAQAACgE"); base64DecodeToExistingUint8Array(bufferView, 36320, "ZBcAACkQ"); base64DecodeToExistingUint8Array(bufferView, 36336, "SkcAAAQUAACAAAAAAAAAAPgqAAACFAAABgAAAAAAAAB1CgAAKg=="); base64DecodeToExistingUint8Array(bufferView, 36384, "iAoAACsBMgMAAAAAAAAAADpHAAAEFAAAAQAACAAAAADtOwAAuiYAAGg4AAAgLQAAdicAANYzAACaMwAAnzAAAMw7AAAuNwAAVDYAAMktAAAvMwAAxS4AALcsAABhRwAALjcAAFQ2AADELQAA5yIAAIYNAADQJwAAzDsAAC43AACpRAAAKS4AAEoFAAAuNwAANywAAFQ2AAAKRgAA/DAAAMgUAABdLgAAPQYAAD4wAADRDAAAwxQAALomAAAuNwAAKDMAAGQsAACzLgAAaDgAAGk7AAAcCwAApjsAALomAAAuNwAAjjcAADsEAAAIMQAAAj0AAL81AACVDgAAazIAANgIAAADAgE="); base64DecodeToExistingUint8Array(bufferView, 36656, "VFyGUmkdAABeAFVIADUjVg8AKmE2WYcTAACMACiBABZrAAkAAHtQAE4GAEFnkwCIcwAAMABaGAARABtGFxoFPI5uegBJW0eRPXhKADEACykAcQAAAG0Kb3R9DjJ8AGQAEnmQOIKLWFMlHn4AAGwzg4AAIgAAhABiJicAFC11XQAAY3WiJzspfUQhhT9AMAJCpCYYixB3oAuEoVyBFRUrM1MNil80E0N6MIkGHHR3o0gJFHiYRkWDTlpgKJQwBXd+fAMaUncOIDGZXZMjH3mechFlCJCALwQeR2IHjS2CjFFhn5ZJGx1kLIZYfw8yJD0KJXdlZVZZKlWnSlRXj3eVEpJLXqaXdwxNTFuHkU9QpT4iQYh7"); base64DecodeToExistingUint8Array(bufferView, 36949, "BAArAABqcgAAAAIAAI8AAAANAAAAAI0AAHc0AACJDAAAPgCKAIUAACQAABxNAAAAADsALw=="); base64DecodeToExistingUint8Array(bufferView, 37011, "RQAAAAAAkgMAOgABSwAAAB8AAAAAAH8AaABAQj8AAAAAAC4AEAg="); base64DecodeToExistingUint8Array(bufferView, 37059, "UWUAcBUHQwBPYHYAAEQAAGMsADcATABfICE5GQBmAABX"); base64DecodeToExistingUint8Array(bufferView, 37104, "HRwcHBwcHBwcBwccBwccHBwcHBwcHBwcHBwcHBwcHBwHDwgFBBYYCBESFRQXCxoQAwMDAwMDAwMDAwUTDA4NBgUBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQACAgkcHBwCCAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAICHAocGRwbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxsbGxseGxsbGxsbGxsbGxsbGxsbGwAAAAA8ADwAPAA8AAAAPAA8ADwAAAA8ADwAPAA8AAAAAAAAADwAAAAAADw="); base64DecodeToExistingUint8Array(bufferView, 37412, "PAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8"); base64DecodeToExistingUint8Array(bufferView, 37454, "PAA8"); base64DecodeToExistingUint8Array(bufferView, 37482, "PAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8"); base64DecodeToExistingUint8Array(bufferView, 37744, "//3//QD////+/v79+/r/AP3/APv+AP3+//4A/Pr+AAD+/fz8/P39+/78/P/+/fwA/wD+/v39/f7+///+/f4A/v4A//75+/v2AAD9AP7///z+APf8//38//3//v/39vz/+/v//wAA+/37/gAA/v4A+/r4+voA/v/9//37/f/+/fz+/AAA/f4A/fv9//8A/v4AAP0A/gD+/Pz6AP4A/v789/v5/fv5+AD+9Pf7+P7+/wD9/f/9//37//////36+/j8+vf7//v9/f39/f39/f79+/79/fz6+/7+/v3//vv//vv9+/v8+/v8/gAAAP3/AP30/wAA/fv9AP78/v3+AP37+vv6/v779f/+AP///QD+/f79/f73+Pr9/Pr////8+v0A/v/9//36+fr/+P/8+AD//f/+/f/+/fr///39+/v6/Pv+AP36///+//7+/gD+/v7//v7///z++////v///v0A//7/AP7//P7////////+AP78/v79/wD//////v//AP////////////8A/f8A/wAA///9/gD8/gD//wAAAAAAAADtBwkH+wdkBWQFPgEPAdgFIQZqBr4CvgK+AuQCPgE+AT4BPgE+AQAAAADYAJkEvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4C9wH3AW8AbwDZAB8BXAFiAmIC4ALgAuAC4AIoAHAAQAFUAb0B6QFRAn0C5QIRA3kDjQP/AxMEhQSZBJkEmQSZBJkEmQSZBJkEmQSZBJkEmQSZBJkEmQSZBJkEmQStBJkEFQUpBSkFKgIKB3YHvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+Ar4CvgK+AooAxgDGAMYAxgDGAMYAxgC3AGMAqQAlAmIClwAeAmICYgL5A/kDYgLpA14B0AHQAdABSgIBAAEAnwifCFYDVgNWA9EBtgK2ArYCtgJIBEgEOQMlAk8DiANiAmICYgJiAmICYgJiAmICYgJiAmICYgJiAmICYgJiAmICYgJiAugBswOzA2ICaQTvAe8BcwRzBMcDxwOVBJ8InwifCJ8InwifCJ8IaQL9Av0CuQK8AcQClALpAv4BlwJgA2ICYgJiAmICYgJiAmICYgJiAmICvABiAmICYgJiAmICYgJiAmICYgJiAmICYgJHA0cDRwNiAmICYgKDBGICYgJiAl8E3wRiAkkFYgJiAmICYgJiAmICYgJiAicE7gFNBCMBIwEjASMBJwVNBE0EBwPFBF8FrAWbAj0FrgQ9BZsFzwWbApsCzwWbAq4EmwUJA/MDjwVIAkgCSAL5BPkE+QT5BL8FvwVwA/oFpgRHBMMGwwaEBoQGAgcCB4QGkwaVBhcHBAcgByAHIAcgB4QGJAelBpUGlQalBhcHBAelBgQHpQaEBiQHoQYIB4QGJAc4B4QGJAeEBiQHOAfmBuYG5gYfB04HTgc4B+YG5wbmBh8H5gbmBr8GUAf3BvcGOAeEBhUHFQchByEH8Qb1BnIHhAbuBvEG/QYAB6UGfwePB48HnQedB50HnwifCJ8InwifCJ8InwifCJ8InwifCJ8InwifCJ8IRQAIBE8AZQFhBbYEkAH1BUMDTAEEBp0FAwYABgwGLwZUBmEGhgaHBooGHwYRBpIG4gWLBk4FRwY1Bo4GkQZYBpcGmAYDBRkGnQagBlcG8QW4B7wHqgceB7QHtQetB68HOwcwB0YHsQexB7MHPQe5Bz4HvgfPB0IHTwexB1EHlQewB7EHPwegB6IHowekB1kHaAe9B1IH3QfeB84HcQdEB6UH2AeuB5sHvwdmB4EH5AfiB+oHeweDB+wHwAf0B/gH/wf5B9MH3AcCCLsHAQgICNsH/AcJCAAIjgcPCBAIEQgNCBIIFAjJB54HFwgYCMEHDggbCKcHGQgTCBYIHAgeCNoH7gfmBxUI7wflByIILggjCC8ILQgwCCYIwgfDBzQIGQg1CDcIOAg9CDsIPAg/CEEITQhDCEQIRQhGCEkISghCCNkH1AfVB9YHTAhPCFgIZwhoCAAAFQEWARcB8QDyAOEAwwDjAMMA8QDyAMMA2QDdAMMA6wD+AMMAAAETAOEAKgH+AMMAAAHOANUA1gDOANoA2wAfAM4AwwDaANsAwwDaANsAJwDaANsAOQErACwALQA9AS8AMAAxADIAMwA0ADUANgA3ADgAOQA6ABMA8QDyAMMA8QDyAMMA/wDxAPIAFQEWARcB6gD+AP8AAAH+AP8AAAHaAP4A8AAAASsALAAtAAgBLwAwADEAMgAzADQANQA2ADcAOAA5ADoADwEfARYAFwBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgByAC8AMAAxADIAuwC8AL0AvgC/AMAAvgBXAMAAWQDFABMAxwDFAD4BxwBAARkAwwDOACsBDwHOAGcAaABpAGoAawBsAG0AbgBvAHAAcQByACsALAAtAMMALwAwADEAMgAzADQANQA2ADcAOAA5ADoAPAAVAMMA8QDyANcA8QDyADgBOQFmAEYAzQA9Ac8A8gD+AE0AAAH+AHoAAAE3ADgAOQA6ADsA/gBYAAABWgANAfAAXQANAWsAbABtAG4AbwBwAHEAcgAPAWcAaABpAGoAawBsAG0AbgBvAHAAcQByADkBdQB2AHcAPQFRAMMALQETAMMALQEVARYBFwFnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgA3ADgAOQA6AJIAwwArACwALQBKAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6AHwAwwA8AG0AbgBvAHAAcQByAEQAwwBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgDQANoA2wBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgCiAOkAGACAAIEAggBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgDDAMMA1wB1AHYAdwB4AMMAEwB7AHwAfQDPABgASgD2ADwANgE3AYUAPAA3AVIAFgDaANsAAQHDABMASQDaANsAKwAsAC0AzgAvADAAMQAyADMANAA1ADYANwA4ADkAOgAWABcA2gDbACsALAAtADYALwAwADEAMgAzADQANQA2ADcAOAA5ADoAgABSAPEA8gDDAHUAdgB3ACEBPAB2AIsAjAAmAcMA/gDDAAABwwD/AAMBBAFJABYAZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAzgDaANsA2gDbANoA2wDqAGcAaABpAGoAawBsAG0AbgBvAHAAcQByAD4BPwGLAIwAZgA8AD4BPwHdABMAdQB2AHcAFwDDAPEA8gA5Af8AzgD/AD0B/wDOAIEAggDOAAgB/gAIAQABCAHDACsALAAtAJcALwAwADEAMgAzADQANQA2ADcAOAA5ADoA9gDVANYAEwATAPEA8gDDABcA8QDyAAEB8QDyAHYAFQEWARcB/gAdAAABPAD+ACEAAAH+AM4AAAErACwALQDaAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6AGcAaABpAGoAawBsAG0AbgBvAHAAcQByAEIAEwDaADwAeADxAPIAewB8AH0APADoAE0AEwAUABoAFgCFAP4AHwEAAQkBdQB2AHcAWgA4ATkBXQAvACQAPQFnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgB0AHUAFQEWARcBPABrAGwAEwAUATwAHwAXAJgAwwB0AHUAdgB3ACcAeQAUAUgAdQB2AHcApgCnAIEAkQDtAO4AKwAsAC0AFAEvADAAMQAyADMANAA1ADYANwA4ADkAOgA7ATwBkABlABMAmgB0AJwAFwBrAGwAbQA7ATwBdQB2AHcAcwA8AHUAdgB3AIQAyAB6ADwAOwE8ASsALAAtABABLwAwADEAMgAzADQANQA2ADcAOAA5ADoAZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAmgCbAJwAnQCeANQA1QDWABYAwwBlABYAPAATABQAPAAWAIsAjAB1AHYAdwAWAPsAwwD9AHUAdgDDALcAJAB6AGcAaABpAGoAawBsAG0AbgBvAHAAcQByAMMAwwA8ANoA2wA8AMMAHAETABkAPAAgARcA7QDuABYAPABtAOkAmgCbAJwASADaANsAdQB2AHcAdQB2AHcAdAArACwALQAJAS8AMAAxADIAMwA0ADUANgA3ADgAOQA6ALcA8wAZAGUAEwA8AAkBkAAXAGsAbAB1AHYAdwB1AHYAdwBzAJcAdQB2AHcAUgDDAHoAdQB2AHcAKwAsAC0AwwAvADAAMQAyADMANAA1ADYANwA4ADkAOgBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgCaAJsAnACdAJ4AeQB1AHYAdwAzAWUANQHDABYAFwDDABkAEwAjAIsAjADDABgAiwCMANAAwwB2AG0AtwAWAHoAZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAMAExAU0A5gB/AOgAQwDDABMAwwDDAIgAFwBYAEsAWgCNAMsAXQCaAJsAnADQACcBPADzABYAFwATABkA2gDbACsALAAtAGQALwAwADEAMgAzADQANQA2ADcAOAA5ADoAtwBmAGAAwwArACwALQDwAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6AHIAhgCDAJIAGQAeAXgAeQB6AHsAfAB9AH4AdQB2AHcAOQHDAIQAwwA9ATMBwwA1AWcAaABpAGoAawBsAG0AbgBvAHAAcQByAMMAwwBmAMMAwwDDANoA2wBnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgBNAOkAwwA8ANoA2wDaANsA2gDbABcAwwAZAFoA8wCfAF0AoQATAOkAwwDpABcA6QAQANoA2wDDAPMA1ADVANYABgEHAdoA2wDDAA8BEwAzAekANQErACwALQCgAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6AMMA2gDbAHYAKwAsAC0A8AAvADAAMQAyADMANAA1ADYANwA4ADkAOgAzAcMANQHaANsABwEMAMMATgALAVAAcABxAHIAMwEWADUBGAD/ABkBCgEbAGsAbABnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgAqAMMACwAWAP8AGADDAMMAZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAEwDDAEAAwwDaANsAwwA5AcMA2gDbAD0BSgCaAMMAnADDAMMAEwDpABcAPAAZABgA2gDbANoA2wDDANoA2wDaANsAgACBAIIAogAHARMA2gDbAAsBKwAsAC0AoAAvADAAMQAyADMANAA1ADYANwA4ADkAOgATAPAA5AD/ACsALAAtABkALwAwADEAMgAzADQANQA2ADcAOAA5ADoAhwB2AIkAigArACwALQAWAC8AMAAxADIAMwA0ADUANgA3ADgAOQA6AHUACgGBAIIAZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAwwDDAHcAJwHDAM4AwwDDAGcAaABpAGoAawBsAG0AbgBvAHAAcQByAMMAwwDDANoA2wDDAMMAkABnAGgAaQBqAGsAbABtAG4AbwBwAHEAcgDxAPIAQwDaANsA2gDbAJIAEwDaANsA8ADXAP4AiAAAAWsAbADDAI0A/wBWAIAAgQCCAMMApQDDABMAjwBfABABGQAsAC0ACgEvADAAMQAyADMANAA1ADYANwA4ADkAOgDaANsA2gDbAMMADAAtAMMALwAwADEAMgAzADQANQA2ADcAOAA5ADoAGwAXAAcACAAJANIA0wDaANsAdADaANsA5AAQAJMAKgDDACcBwwATABQACgEWACYBZwBoAGkAagBrAGwAbQBuAG8AcABxAHIAJABAAJEA2gDbANoA2wDDAGcAaABpAGoAawBsAG0AbgBvAHAAcQByAMMAmgB3AJwAPAC9AL4AvwDAAMMA2gDbAMMAxQDDAMcASADDABMATgDDAFAAzgDaANsAwwBSAJAA0gDTAMMADwDaANsALwDaANsA2gDbAAMBBAHDAAUB2gDbAGUALgEvAdoA2wDDAGsAbADaANsAlgCXAPEA8gBzABkAdQB2AHcA2gDbAHoAwwCSAMMA/gDDAAAB2gDbAPYAGQA9APYAEwAUAMMAFgCLAIwADQEBAcMACgEBAdoA2wDaANsA2gDbACQA9gCaAJsAnACdAJ4AdADaANsAwwAWAAEBMQDaANsAFwDDABkAwwB1AC0BwwAZADwAwwDDABcAwwAZAMMAtwAYANoA2wCCAEgAwwAWAMMA2gDbANoA2wDDANoA2wDDANoA2wBWANoA2wDaANsAWwATABQAmQAWANoA2wDaANsAwwBlAMMA2gDbAMMAwwBrAGwAJAAXAMMAGQDDAD4AcwDDAHUAdgB3AMMAkgB6ANoA2wDaANsAwwDaANsAEwA8AHoAPADaANsA2gDbAMMA2gDbAJYAhADaANsASADDABcAwwAZANoA2wDDADwAmgCbAJwAnQCeAFYAFwDDABkAwwBbABMAFACOABYA2gDbANoA2wCCAGUA2gDbAI8AeQB6AGsAbAAkALcA2gDbAI4APABzAHYAdQB2AHcABwAIAHoAmQAXABcAGQAZABcAFwAZABkAFwA8ABkAFwBiABkAdgBUAFUAFwAXABkAGQBIAJoAFwCcABkAFwDkABkAwwCaAJsAnACdAJ4AVgDDAMMAAgHDAFsAIwFCAcMAwwDDAMMAwwB2AMMAZQDDAMMAwwDDAO4AawBsAMMAtwDDAMMAwwAiAXMAwwB1AHYAdwD0AMMAegDDAMMAwwDDAMMAwwACAQIBAgECAcEA9QAsAdgAEgH3AA4BDgESASgBKAH4AN4ABgHGAAYBEgE9ABIB+ADnAJoAmwCcAJ0AngAAAAEAAgD3AOMABQDdAN0A3QCOAAoACwAMAA0ADgAGAQYBEQDKACwBEwAUACwBFgC3APcA+wD7APUAygAeACYAIADKAJgAlwAWACQAKwDsACgAEgDKAO8A7wASAO8A7wAbAckAlgDsAMoA7ADJAJ8AygD4APgA+AD4ADwAPwDJABMBEQETAREBEwEWAB4BRwDfAEgAygDfACkBKQHKAE8AyQB0AFIA3ADJANwA3ABBACUBJAHlABYApgB/AOIAGAByAOIA3wBjAN4AygBlAB0BXADcADQBUwBrAGwA3ADcADwB3AAdAQwBcwDlAHUAdgB3AN8AQQF6AAwBlQCSABYAEwAUAMoAFgCfABoBhgBBAZQAGAGTAIsAjAD8AI0AGQDMACQA/AANAPsAxAD4APoA+QDEAAYAmgCbAJwAnQCeANEAwgDCAKMAwgAyATIBLwHgADwA1wDXANEA1wDXANcA4ADYANgABADRAEgAAwAWALcApAAPABcAEAAXAIwAmACDABkAGACPABQAEACRAAEAjwCDAD4AgwAlADYAmAA2ADYANgBlAIMAdQABACIAjgBrAGwABQAWAHQAogBMACkAcwBFAHUAdgB3AAEAAgB6ABkABQBFAI4AdAAUAAoACwAMAA0ADgAYABMAEQCEAAUAfgAWAI0ARAAKAAsADAANAA4AFgAeABEAIAAWABYAmgCbAJwAnQCeACgAFwBEADwAHgAYACAAYQAcABYARAAXACUAIgAoAJYAFgAZABcAFwAXABYAYgCOALcAFwAXACIAFgAZAFkARwAiAHUAkAAiABYATABMAE8AVwAiAFIAIgAsAEcAXgAiABcAGQAYACIAGQBPABcAFwBSABcAFwBjAI8AjwAWABkAGQAXABYACwAWABYAGQAXABcAYwAWABYAiACOAI4AjgAZABcADwABAAEAQwFDAUMBQwFDAUMBQwFDAUMBhgBDAUMBQwFDAYsAjABDAUMBQwFDAUMBQwFDAYYAQwFDAUMBQwGLAIwAQwFDAUMBQwFDAUMBQwFDAaMAQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwGjAEMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwFDAUMBQwG7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALsAuwC7ALs="); base64DecodeToExistingUint8Array(bufferView, 44128, "ggB/AOoAGgEaATAFQAIbBcwBIQEhAUACVgZ9AUACMAU9AkACMgKdARQFBgY9AuEBMgIMAswBywEuAlIAUgDXAyYBdwEzADMA8gE9AD0A2ANSAFIAKQaJAIoAWwAHAMwEzAQnBCoEHQQdBIcAhwCIAIgAiACIAJ0BIAEgAbYAIAEgAeEBGAIgASABggB/AOoAsAE9Ag0CMgI9Ai0CMgIKBT0CpQEyAokAigBbAC8CzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAKAHMAY4B4QSGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwHDARoEGgQoBCsE5wQBAAEARgICAOsERQKWBOsElgRBAZ0BmwBBATAGmwB7AXAA4QE9BcgBKwE9BYYAhgCGAIYAhQCFAIQAhACEAIMAgADDAYkAigBbAPIBzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAtAReAwEFIAEgARsBIAEgAQsCCwLiBIsAQgIHAEICQQU9ApEEMgI9Ah4EMgKIAIgAiACIAIEAPQIjAjICkQT1AAUGkQT1AIUAhQCEAIQAhACDAIAAwwEuAYYAhgCGAIYAhQCFAIQAhACEAIMAgADDAScGtAS1BLQEBwDWASYCxwGdASYCxwGCAH8A6gCGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwGIAIgAiACIABoC4wGJAIoAWwD7A8wEzAQnBCoEHQQdBIcAhwCIAIgAiACIAD0EQAK0BIQAhACEAIMAgADDAV0A1gCGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwGRARMAEwCGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwHaBaoBCwFYAdMBTAGGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwEBBUACBgC0BLUEtAQBAUACnQH/AfwB+wH/BF4A+wPQAbQEJwInAvoByAQjBiwAJgAzADMAmwFAAp0BLQAzADMAiQCKAFsAEgLMBMwEJwQqBB0EHQSHAIcAiACIAIgAiACOAXwEUgBSAIkAigBbACcAzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAWAEsACABIAF3AbQEtQS0BNEAtATIBEABNwLXAUACPQJAAjICQAI8AQgB5wAuAKAAhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBLwFSAFIAUgBSAFIAUgC6AYYAhgCGAIYAhQCFAIQAhACEAIMAgADDAS4GIAJAATcC4gRqAy4GfAF+AZ0BtAS1BLQEaAG2ACABIAEoBi0COwUtAgcALQL9BNgBWgEOAhMCPQIsAjICtwHnBYkAigBbANsAzATMBCcEKgQdBB0EhwCHAIgAiACIAIgA0QHnBekFFAKdASABIAGnAQACIAEgAZsBIAEgAWoDggB/AOoAPQJTBDICtAQ9AlMEMgI9AjACMgKJAIoAWwANBcwEzAQnBCoEHQQdBIcAhwCIAIgAiACIAIYAhgCGAIYAhQCFAIQAhACEAIMAgADDAe0B9wEMBbQEAQEgASAB/wH8AfsBtARcBpEEewA4AhMBBAD6AT0C5wUyAksBtAS1BLQEkQQkAiQCkQQFATsCBwCGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwFsABUCggB/AOoAtATAAb8BnQGrBcQB1wN2A2AAPgbRBLQEtQS0BNgD0wSqBTUCtAS1BLQE5QAKAtIEFgI1BTUFiQCKAFsAqQXMBMwEJwQqBB0EHQSHAIcAiACIAIgAiAB1ATsGywMQBJ0B1ASiAdQEbwN5AHkAtAN1ATsGtAS1BLQEegC0BMQBQQLEAWsBoQEEBHIDdQE7BokAigBbAM4BzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBBAQEBAYEBwQjADoCOgI6AsUApwEQBMYAtAR7ADgCtAQEAEABNwK0BLUEtAQoAIQBQAKAAXIDBQSnAaQEOwIEBIYAhgCGAIYAhQCFAIQAhACEAIMAgADDARECIAa0BBMAEwC0BD8C7AGdAZ0AxAHpAaMEMwUzBQUAtAS1A68BBAQEBAYENQIWABYAtAS1BLQEtAS1BLQE3QGJAIoAWwDUAMwEzAQnBCoEHQQdBIcAhwCIAIgAiACIAKQEMABvABAEnQG0BNUAygMRBHkAeQC0BLUEtAS0BLUEtAR6AN0AxAFBAsQBLADnAQQEtAS1BLQEiQCKAFsAegHMBMwEJwQqBB0EHQSHAIcAiACIAIgAiACGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwEEBAQEBgQHBCMAzQG0BLUEtAQhBhAEeQHWAH0EeQYXAnkGtQGGA0ABNwIgBmwBQAE3ApwBSQEFBAcCpAQDAAQEhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBewaPAZEEMwF9AzMBAwJAAp0B1gDyAbADAAQcAocDkQSvA4gBkQQEBAQEBgSWASoBtAQyAH0EegadAXoGkQCRAIkAigBbACUBzATMBCcEKgQdBB0EhwCHAIgAiACIAIgApAR7BAICIAaJAIoAWwDhBcwEzAQnBCoEHQQdBIcAhwCIAIgAiACIALIBQwGzARsCbwDiBRIBIwF0AQUCbwEEAgYBtAS1BLQEJgbhAWsBQAIHACEGIAZ5AYYAhgCGAIYAhQCFAIQAhACEAIMAgADDASAGQAJ7BEAC6ABAAhMAEwCGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwGRBLEBQAK3BBMAEwATABMAEwATAFsGQAKPA5EELwB4AJEEdQCdATIB8gG2AWUEzgBQARMAEwCbBTEAwQHBAcEBWAU7AVEAUQBAAjABnQEiBs8AeQGJAIoAWwBzAMwEzAQnBCoEHQQdBIcAhwCIAIgAiACIAEACUgBSALcEiQCKAFsAPAXMBMwEJwQqBB0EHQSHAIcAiACIAIgAiAAhBoIBeQFSAFIAzwFmBBAGTQHPAU8BgwCAAMMBIQahAHkBEAA9AYMBrAFnBMABvwGGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwFoBEACUQQKAL0BCwFAAhIGhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBFAJAApoDQAITABMAQAIlBkACkwCTAAcAmwPUBPIB1ARAAucBnQEoAh0ByATJA9cAUgBSAEIAQgCbBUMAQwAVABUAVgRWBO8BTgEpAZ0BNQA1ACkBiQCKAFsAdwDMBMwEJwQqBB0EHQSHAIcAiACIAIgAiACdATgFHwW+AYkAigBbAOMAzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAPgLIBKgDqAOJAH4AWwCNAMwEzAQnBCoEHQQdBIcAhwCIAIgAiACIABUCrQHYAVoBhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBQALJAekAVwGbBZMB8gEOBoYAhgCGAIYAhQCFAIQAhACEAIMAgADDAUACRAFAAlIAUgDnAUACyQOGAIYAhgCGAIUAhQCEAIQAhACDAIAAwwEgASABIgJEAEQANgA2ACkCnQFFAEUAXwEGAD0CsAMyApoBmQGbBa8DwgEhAgQBAwECAUACngBAAp0B3gCcBN8ByQOKAFsArgHMBMwEJwQqBB0EHQSHAIcAiACIAIgAiABGAEYARwBHAEACZgRbAEACzATMBCcEKgQdBB0EhwCHAIgAiACIAIgAZwSmAFIDUwNUAwIFowFIAEgAbABJAEkAHgVmAZwEaARAAjEBQAJ7ADgC7gEEAOgBhgCGAIYAhgCFAIUAhACEAIQAgwCAAMMBOwI0AhYCNwA3ADgAOABAAoYAhgCGAIYAhQCFAIQAhACEAIMAgADDAUACUATpAFAExAFCBkYCAgDrBEACOQA5AEACQQFAApsANQKbBeUBYQFAAmQBPQU7ADsAQAIsAMkDOQKjAUAC7gA8ADwABQFKAEoASwBLAB8B5wBAAlYFTABMABAEpAG4ABQAFABAAnkAeQBNAE0AYQDaACABIAF6AH0AxAFBAsQBjwCPAAQEQAIIAkACPQJAAjICkACQANoB4wDcBN4BewA4AkACBABAATcC9QCbAUACuwGbAU4ATgA+AD4ATwBPADsCPwEEBAQEBgQHBCMAogE/AD8AQAIiAZsBCQBQAFAAeARAApABQALmAccBQALHBMQBQAJFAVYBQAJvAEACpATyAEAAQADZATUCQAIXAEACqgCqAKsAqwBAAlcAVwBIAUEAQQAeAlMAUwCSAJIAHQJ7ADgCVQEEAFQAVACoAKgAQAIQBEAClACUAEACZAV5AHkAOwL9A0ACCgFAAqgBegBAAsQBQQLEAUACKQIEBI4AjgCpAKkAQAKiAKIAEAJ5A3MBxAGYAJgAlwCXAGMFlQCVAG0AcgGWAJYANQJAAuABQAIKAVYAVgBAAkQEBAQEBAYEBwQjAB4C4gFAAgoB0gEfAnsAOAJQBgQAWABYAFUAVQDbARAENAA0AN4AhQOEA3kAeQA7AqQEOgA6APQACAR6AHkDxAFBAsQBjAONAwQELAFbAfgBbwAHAWkBpQBvAG8AQATEAQcBzgOBBAoBRATaA9sDrgOrA30AfQA1Ak8EaANPBJ8ArQMdBX0AFQYEBAQEBgQHBCMAHgJRAfoFzQD5BR0C8wE1BuoBXAFgBWABYwEIBGUBEARnASwFHAVuATMCeQB5AHgBpARtBZoFUgUYAXoAXgXEAUECxAGnAJ8FBAQJBQAF9ATzBPUESQZPBTgBOQE6AY0BDADtAOAAjQUnAYgFgQWSBVMB5AFUAf0BWwVMBlwFkQXcBJQBLQHkAAQEBAQGBAcEIwBBBqgExgFZARsFJAFxAd4F3QUOAYwBjAGLARUBiQFaBVkFWwMNBroAewA4AusABACkBIcB0gDTAN8ACwbvANkERwGmAWAA3ADDADsCtAC8AEYB1AHVAb4AvwD2AcAAwQA2AvcAbQCWBesBxwD7AGYAGQGSAdwBlQHYBcQB8QH9AI4FDQCUBQ4AkwXLAOMF8QD0ATUCYgGXAVwAXwD2BK8A/gAGAisALwX/AC4FLQW0Ae4FXgEmBWgA5QB9A1oGuAG5AVkGmAHwABAFDAEQBDYBDQERBQ8CvAF5AHkAcAEPBToGWAY3AXIFegAlBcQBQQLEAXYBLAYEBHEFjAApAgsAWgA4AoEBBAB0AD4BngErBm4AywUZAkABNwJGBSsCKgBDAjsCRQWuBH8BFAGGAdgAhQEWARcBBAQEBAYEBwQjAKwARALxBMoB7ASfAaABuQCcAMQB/gX/Ba0A/QX8BVkANAHhAOIATgOuADUCxQHZAKQEQgHsAE4EmgBMBEoBuwCwAMcE8wC9AJ0DUgH2AFwEwgCxAKkBsgCrAWIAxABjAGQAZQAQBLMAXwRbBPgA+QB5AHkAowAYAPoAXQHWBPABegBUBMQBQQLEAagExgEEBAoBJAHIAPwAyQBdA4wBjAGLARUBiQEPAPUBWwNyASQBAAHKACoC+QGMAYwBiwEVAYkBZwDvAFsDRwEZABoABAQEBAYEBwQjAEYBagH+AXsD7wBtAUcBAQKIA2kANQGkALUAGwBGAWoACQJrAKEELQSDBBEAggTmAKQEHAEeAQkBzAB9AJME8QAcANIDzAMdACkAlwSbBK8AlQQeACsAHwAIAPEAmgQgAIgE0AAlAiEAbwCvADsELgQrACwEMATwAHEAcgAiADECdgBkBA8BMQQkABIAPAIJBGkD8AB8ACUApwMQAREBUQa3AJkAigGqBKkE6AToBOgE6AToBOgE6AToBOgEngHoBOgE6AToBEABNwLoBOgE6AToBOgE6AToBJ4B6AToBOgE6ARAATcC6AToBOgE6AToBOgE6AToBMoB6AToBOgE6AToBOgE6AToBOgE6AToBOgE6ATKAQAAfwZ/Bn8G0wXmBFcF5gTmBOYE5gTTBdMF0wXmBOYE5gTmBOYE5gR1BXUFCAYHBeYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBNIF5gTmBOYE5gQqBioG5gTmBOYE5gTmBBsGGgbmBOYE5gR+BeYEhQXmBOYE5gTmBOYE1AXVBeYE5gTmBOYEBwYJBuQFjAWLBYoFiQX2BWkFgwV8BYAFzwXQBc4FaQbVBdQF5gR/Ba8FvwWuBeYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gS3Bb4FvQW8BcUFuwW4BbEFsAWyBbMF/gTmBPsEMQXmBOYE5gTmBOYEtAUHBagFpwWmBeYEwgW1BcEFwAUPBk8GTgblBeYE5gTmBOYE5gTmBCoG5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gRrBSoGKgbmBAcFKgYqBmwFbAUDBQMFbwUWBk4FTgVOBU4FVwVOBeYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBAwGCgbmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gRTBeYE5gTmBOYE5gTmBOYE5gTmBOYESAbmBPEFPwVTBVMFUwVTBVUFQAU+BU0FCAXtBHcGjwWEBVQFhAV0BoIFjwWPBYIFjwVUBXQGGAVeBhMFdQV1BXUFawVrBWsFawVvBW8F0QVUBU0F5gR3BncGXQVdBXYGdgZdBeUFZgaYBTQFOgU6BToFOgVdBfgEggVmBmYGggWYBTQFggU0BYIFXQX4BPUFcQZdBfgE2wVdBfgEXQX4BNsFMgUyBTIFJwXmBOYE2wUyBRgFMgUnBTIFMgU8BuYE3wXfBdsFXQU0BjQGeAV4BX0FbwXWBV0F5gR9BXsFeQWCBSoFSwZLBkcGRwZHBnwGfAYWBlcGBwUHBQcFBwVXBhoFGgUIBQgFBwVXBuYE5gTmBOYE5gTmBFIG5gQRBuYFYQXmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBBwG5gTmBOYE5gTmBOYE5gTmBOYE5gTmBJ0F5gTpBBMG5gTmBOYE5gTmBOYE5gTmBIYFhwViBeYE5gTmBOYE5gTmBOYElQXmBOYE5gSQBeYE5gTmBOYE5gTmBOYE5gRzBuYE5gTmBOYE5gTmBPQF8wXmBOYEXwXmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBBYF5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBHoF5gTmBOYE5gTmBOYE5gTmBOYE5gTmBOYE5gTmBDkGcAXmBOYE5gTmBGoG5gTmBOYE5gRIBeYE5gTmBOYE5gTmBOYE5gTmBOYEYgZCBZ4F5gShBfwE5gTyBOYE5gQAAAk="); base64DecodeToExistingUint8Array(bufferView, 49744, "vwC/AL4AwADBAMEAwQDBAMAAwADAAMAAwADFAMcAyQDJAMgAyADGAMYAzQDNAM8AzwDQANIA0gDSANMA1wDYANkA2QDZANkA2QDZANkA2QDZANkA2QDZANkA4gDiAN4A3gDgAOAA4wDjAOMA4wDkAOQA5ADkAOQA4QDhAOUA5QDlAMwA5wDoAOgA6ADoAOgA6wDcANwA7ADsAO0A7QDAAO8A7wDAAMAAwADOAM4AzgDxAPQA9AD0APIA8gD+APIAAAEAAfUA9QD1AAEB9gD2APYAAgECAfcA9wAEAQQBAwEDAQMBAwEDAcoAygDwAPAACQEJAQkBCQEFAQUBBQEFAQYBBgEGAQsBBwEHAfsA+wDpAOkA3QDdAN0ADAEMAQwB+QD5APoA+gD8APwA/AD8AMAA+AD4AA4BDgEOAQ4BwAAPAQ8BDwEPAcAAwAASARIBEgESARIBEgETARABEAERAREBCgEKAdsA2wDbANsA2gDaANoA2wDbANsA2wDbANsA2wDbANsA2gDbANsA2wDbANsA2wDbANsA2wAVAdsA2wDbANsA2wDbANsA2wDbANsA2wDbABYBFgHbABcBFwHbANsA2wDbANsA2wAaARoBGwEbARkBCAH/AP8AGAEYAcAAHAEcAd8A3wDqAOoAHQEdAcAAwADAAB4BHgHAAMAAwADAAMAA1QDWAMAAIAEiASIBIgEjASMBIwElASUBIQEhAScBKAEoASYBJgEmASYB2wDbAO4A7gDuAMAAwADAACoBKgHAAMAAwADAAMAAwADAACsBwADAAMAALQEvATABMAExAQ0BDQE0ATQBNAEzATUB8wDzADYBNwE4ATgBOAE4ATgBOQE5ATkBPQE/AT8BQAFAAT4BPgFBAUEBQgFCAUIB/QAUARQBFAE8ATwBOwHaALsAvAC8AL0AvQC9AMIAwgDCAMQAxADAAM0AywDLAMMAwwDSANMA1ADUANEA0QDZANkA2QDMAOYA5gDnAOsA7QDxAPIAAQECAQsBEwHbABUBGQEIAR8BHwEfAR8BHwHVACQBJAEnASgBKQEpASwBLAEuAS4BLwEyATIBMgENATYBOAE="); base64DecodeToExistingUint8Array(bufferView, 50576, "SwAAACQACgBeAAAANQAJAIcAAABeAAEAVgAAAFAAAAAJAAsAJwACAEcAAAB6AAAAQgBDAEQARQBGAAAAAAAAAMlGAACsCAAADkYAAAImAAC7LgAACS0AAI5OAADbTwAAg08AAAIECAYGAAAAAAByb3dfbnVtYmVyAGRlbnNlX3JhbmsAcmFuawBwZXJjZW50X3JhbmsAY3VtZV9kaXN0AG50aWxlAGxlYWQAbGFnAAD+xQAATQAAAFsAAABWAAAACcYAAFoAAABbAAAAVgAAABTGAABaAAAAWwAAAFYAAAAZxgAAXQAAAFYAAABbAAAAJsYAAF0AAABXAAAAWwAAADDGAABNAAAAVgAAAFsAAAA2xgAATQAAAFsAAABbAAAAO8YAAE0AAABbAAAAVgAAAENBRERFQgAA5TkAAAgAAACjRwAAQVAAAEdQAAAAAAAAZngAAKtJAADHTgAAx0kAAGpPAADHTgAAAwQDBwQEAAAKCgkJCAgHBwcGBgYFBQUEBAQEAwMDAwMDAgICAgICAm50aF92YWx1ZQBmaXJzdF92YWx1ZQA6OAAAAAAAAAAAnzAAAEAAAAC1RgAAQgAAAO04AABBAAAAzSYAAEMAAAAYFhUXAAAkIBgVFxYtKSgqJyYkIA=="); base64DecodeToExistingUint8Array(bufferView, 51072, "oiUAANclAAA9JQAANCYAAGgm"); base64DecodeToExistingUint8Array(bufferView, 51104, "OgAAADoAAAA3AAAAOgAAADo="); base64DecodeToExistingUint8Array(bufferView, 51136, "bmF0dXJhbGVmdG91dGVyaWdodGZ1bGxpbm5lcmNyb3Nz"); base64DecodeToExistingUint8Array(bufferView, 51185, "BwQGBCgKBSAOBTATBDgXBQEcBQMAAADXOgAAAwAAANsGAAAD"); base64DecodeToExistingUint8Array(bufferView, 51232, "NAACAH8AAABhAAIAgAAAAHo="); base64DecodeToExistingUint8Array(bufferView, 51264, "AgAAAGMAAQMyAQgARwACAGwBAgEyAQgARwABALsAAABUAQE="); base64DecodeToExistingUint8Array(bufferView, 51312, "AgABAGMAAQQQAQAARgACAGQABwCtRgAAfAgAAMUuAAAfGBERExQ="); base64DecodeToExistingUint8Array(bufferView, 51360, "VgEAADwBBAB2AAMAVAMBAEYAAAB2AAMACQADAAAAAADwWgAAAQAAAPVaAAABAAAA1TgAAAIAAABROgAAAwAAAM04AAACAAAASToAAAMAAABfWwAAAAAAAFlb"); base64DecodeToExistingUint8Array(bufferView, 51464, "AgABAGQAAAACAAAAYwABAFQBAQAAAAAAb25vZmZhbHNleWVzdHJ1ZXh0cmFmdWxsAAABAgQJDA8UAgIDBQMEBQQBAAAAAQEDAg=="); base64DecodeToExistingUint8Array(bufferView, 51556, "61oAAMU4AABBOgAAJV8AAAMAAAAB"); base64DecodeToExistingUint8Array(bufferView, 51588, "4w=="); base64DecodeToExistingUint8Array(bufferView, 51604, "0jAAAAAAAAB4AAAAIT4AAAAAAgC8MwAAAAAE"); base64DecodeToExistingUint8Array(bufferView, 51648, "zScAAAEAAACIBgAAAgAAAKFEAAAGAAAAtwQAAIA="); base64DecodeToExistingUint8Array(bufferView, 51688, "AQAAAAE="); base64DecodeToExistingUint8Array(bufferView, 51704, "5A=="); base64DecodeToExistingUint8Array(bufferView, 51720, "4DAAAAAAAAAGXQAADg4AAMlbAAAAAAAAIlwAAAAAAAAEAAAAAQ=="); base64DecodeToExistingUint8Array(bufferView, 51768, "5Q=="); base64DecodeToExistingUint8Array(bufferView, 51784, "LQwAAAAAAAACAAAAAQ=="); base64DecodeToExistingUint8Array(bufferView, 51808, "5g=="); base64DecodeToExistingUint8Array(bufferView, 51824, "QzAAAAAAAAABAAAAAQ=="); base64DecodeToExistingUint8Array(bufferView, 51848, "5w=="); base64DecodeToExistingUint8Array(bufferView, 51864, "ZA0AAAAAAAC9/+QEwP9O/0v/oAAvBI8ASP+JANoA3ADeAFL/5QAMARABEwFEATD/8gDr/tn/UQAZAhgDKgMsA0P/LgM/A6MAYQOwA3cDSAPEAzUERf8kAXv/EgGhAi4CqgIbAykDEv8Y/xL/GP9JAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBSQFJAUkBLQLIArUDxgPJA8sD0wNJBEsETwR2BHgEkQSUBLEEswTMBNkE4gTlBOcE7QTyBPcEAgULBRwFHgUgBSoFMAVDBUoFTAVPBVIFVQVXBV4FYAVlBXkFewV+BYQFhgWJBY0FlAWnBakFrQW2BUkBSQFJAUkBSQFJAUkBSQFJAUkBSQHq/2H/2wEk//QCJgD1AUkDygJJAXYAUQFdAWsByP9JAUkBSQFJATP/M/8z/68CVP9+/8f/FgONARAC8f6IAFQCVAJaADwBCgIdAtv/ywJRA9EDdAJYA9QD3wM5BE4EbwQ7BF7/0ADqBBoDqv+fACkAVQSfAlQDTAOkA5cE5gTgAZwEZAACAfEE9ATABAcFdf89AVgBPwBTAacBMwJ8AqQCLQOMA5IDtgM2BDwESgRTBWgFfwWfBbgFmwH3Bf4F/wUBBgUGBgYHBggGCQYLBg0GDgbeA4wE1AUPBhAGFAbBBBYGFwYYBsEFhQUbBuYFIAYzAiIGIwYkBiUGJgYnBqMFugXuBekF6gXrBewFwQTuBe4F+wUaBi4GxQXhBecF/QXoBdAFAgblBe0FCgbvBRUG0QUdBhwGKgYyBjMGNAb2BfgFEgYTBigGKQYeBisGMAY3BvAF8wVRBlwGLAYtBmAGMQY2BjkGRAZFBkYGSAZJBmkGcQZKBjgGOgZLBjsGUAZMBlIGTQZzBnYGPAY+BncGfwZyBokGkAaNBpQGdQaABoIGgwZ+BoUGiAaMBpYGjwabBpkGnAaeBj0GPwZTBl4GowakBkIGTwZwBnkGmgaiBnoGwQZ0Bp8GpgaoBqcGzQbaBt4G6AbpBusGfAZ9BoEG2AbcBt0G3wbgBuQG0QbZBuIG4wbhBuwGAAABAAAAR3g="); base64DecodeToExistingUint8Array(bufferView, 52720, "AiYAALsuAACsCAAAyUYAAN0t"); base64DecodeToExistingUint8Array(bufferView, 52752, "MDEyMzQ1Njc4OUFCQ0RFRmxhc3RfdmFsdWUAAAwADgAYAB8AOwB4OQAAAAAAAAAABnNlY29uZAAkINNXAACAPwZtaW51dGUA2TPhVAAAcEIEaG91cgAAALA58FEAAGFFA2RheQAAAABa/KNKAMCoRwVtb250aAAAgGgsSAA0HkoEeWVhcgAAAADkZUbAmfBLCQoNIA=="); base64DecodeToExistingUint8Array(bufferView, 52944, "AQEAAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQFpSQMFBwAAANsxAADEWgAAaUkIBQcAAAAcBAAAxFoAAG5OAwAEAAAATE4AAN0tAABxUQQABAAAAEtOAADdLQAAc1MEAAQAAABGTgAA3S0="); base64DecodeToExistingUint8Array(bufferView, 53257, "AQEAAAE="); base64DecodeToExistingUint8Array(bufferView, 53280, "AQ=="); base64DecodeToExistingUint8Array(bufferView, 53504, "Cww="); base64DecodeToExistingUint8Array(bufferView, 53528, "YnRuAGZy"); base64DecodeToExistingUint8Array(bufferView, 53552, "3S0AABwzAAAxNQAAAiYAAAImAAC7LgAAuy4AAKwIAACsCAAArAgAAKwIAACCBQAAzw0AAGZ4AABmeAAAZngAAGZ4AABUAQAAVQEAAFYBAABXAQAAWAEAAFkBAABaAQAAAAAAAAEAAAAAAAAAWwEAAFwBAABdAQAAXgEAAF8BAABgAQAAYQEAAGIBAABjAQAAZAEAAGUB"); base64DecodeToExistingUint8Array(bufferView, 53712, "5iMAAPMjAAAAAAAAlD8AANo8AABTPwAAZj8AAIoEAAA3NQAA9jwAAAMkAAC0PgAAWioAAOItAAB2NwAAsy0AAAAAAACCQAAAYzEAAPY+AAB8MAAAEzQAAAg/AAB/PwAAAAAAAA05AACxNQAAJzkAADw5AAABAgUKDxQZGRkyMmQAAQMIEiE1TmeAsuRmAQAAZwEAAGgBAAAEAAAAaQEAAGoBAABrAQAAbAEAAG0BAABuAQAAbwEAAHABAABxAQAAcgEAAHMBAAB0AQAAdQEAAHYBAAB3AQAAeAEAAHkBAAB6AQAAewEAAHwBAAB9AQAAfgEAAH8BAACAAQAAAAAAAIEBAACCAQAAgwEAAIQBAACFAQ=="); base64DecodeToExistingUint8Array(bufferView, 54000, "MAAAAAfoAAAGbAEAL+wBAAesAgAB0AIAA9gCAAHsAgAB/AIAAVwDAAHcAwAECAsADkgLAAeUCwABtAsAgbwLAAHUDQAB+A0AAhAOAAEcDgAB2A8ACAgSAAZoFQACJBYAATwWADdEFgACzBcABQAYABYYGAACeBgAFSwZAASoGQABwBkAAVAbAA9YGwAHnBsAAvQbAA4AHAABPBwAAUQcABvAHAALmB4ACawfAATYHwAEWCAACWwgAAOUIAAFpCAAD8AgAANkIQABeCEAG5AjAAQAJAAD6CQAEvgkAAdEJQAEiCUAAcAlAAMEJgAB8CYAB/gmAAIcJwADLCcAAVwnAAKIJwACyCcAAugnAAMEKAAB8CgABfgoAAIcKQADLCkAAUQpAALAKQAB1CkAAwQqAAHwKgAI+CoAAxwrAAMsKwACiCsAAsArAAMELAAB8CwAB/gsAAIcLQADLC0AAlgtAAKILQABwC0AAQguAAX4LgADGC8ABCgvAAFcLwAIzC8AAwQwAAf4MAADGDEABCgxAAJUMQACiDEAAfwxAAIIMgAB8DIAB/gyAAMYMwAEKDMAAlQzAAKIMwACCDQAB/g0AAMYNQAEKDUAAVw1AAKINQAB5DUAAgg2AAEoNwAGPDcAAVg3AAhgNwADyDcAAcQ4AAfQOAAB/DgACRw5AAJoOQABxDoABtA6AALsOgAGIDsAHwQ8AAzQPAAXxD0ACzQ+ACRkPgAP+D4ADTg/ABSsQAAGKEEABFhBAAN4QQADiEEAB5xBAATEQQAMCEIAATxCAAZoQgAB7EMADHRNAApATgABAFAAArRZAAEAWgACbFoAA6xbAANIXAAFyFwAAkhdAALIXQAj0F4ABGBfAAF0XwAPAGAAAaRiAAyAZAAMwGQAAQBlAAIQZQARwGYAAiBnACJ4ZwAFXGgAAnhoAApUaQAdgGkAAfxpAAeAagAGoGoABQBsABHQbAAjaG0AAwBuAA2EbgAOmG8ABPBvABSQcAAF7HAAAvhxAAgAcwAZQHMAAbRzAAPIcwAnAHcABPB3AAH0fgAD/H4AAzR/AAN0fwADtH8AAvR/AGUAgAAGqIEABeiBAAUoggAagIIAIUCDAAIAhAAEDIQAAiCEAAFQhAADWIQABniEAAGUhAABnIQAAaSEAAG4hAAC6IQABQCFAAQohQABPIUAZEKGACcAkAALAJEATnCSAAAClAB1BJwAuVOeAApArQAGlLMAA7yzAATkswAC+LMAAcC1AAH8tQBPgLcADMC4ABoAugBZbLoA1gC8AAzAvwAFAMAAGSDAAAeowAAC2MAAA/TAAARkwgABgMIAAezDAAJAxgAKWMYAJADHAB8AyAAeqMgAAUDJACCAyQAnKMoAPwDLAAABzABAADcBN0CSAgL4kwIDNJgCELyZAgF8mgIIwJsCFwCcAgKAnAICJJ4CAQigAgEYoAIBLKACCYygAgTYoAIE0KECAgCiAhHQogICOKMCEoCjAgPgowIKmKQCDRylAgF8pQIEAKYCG8ymAgJ4pwIOpKgCAQypAgIwqQIEcKkCA9ypAgHsqQIBwKoCA8iqAgLcqgIC+KoCAQSrAgJ4qwIHrKsCAtSrAguMrwIBAGADAvxtAwL8bwMB/H8DAXjsAwGk7AMQyO4DAvj0AwLw9wMaAPgDB4D4AyPA+AMTUPkDBKD5AwH8+wMPBPwDB2j8Awbs/AMLbP0DB4D/Aweg/wMF5P8DAwAEBAncBAQR5AUEDEAGBC5ABwQBfA4EAUAPBAFcIQQBfCQEAfwkBAMEKAQCFCgEBDAoBAPgKAQB/CgECUApBAH8KQQH5CwEAwBABBbgQAQDAEIEEsBCBAMARAQOnEQEBABFBAMARgQOzEYEBBRHBA2sWgQEwJEELkS9BQQ8vgX2AEAHJwBEB7WkRAdGAEgHVwBMBwEEWwcBbFsHAexbBwFUXAcB1FwHATxdBwG8XQcBJF4HAaReBwEMXwcCwLsHLADAB2TAwAcPgMIHDsTCBw8EwwcPRMMHH0DEBzzAxAcrwMUHHZjHBytAyAcJAMkHAkDJByEAzAcGwMwHRtzMBxQAzgclgM4HBRjPBxGAzwc/ANAHAQDRB7YI0QcE5NMHPgDUBwQA1QcYQNUHRuzXBwsU2QdGANoHdADcBwEEADhggAA48AAEOAAAAAAAAAAA////////APwBAAD4AQAA+EEADhq1AEABwAAOF9gADgcAAQEwMgEBBjkBARBKAQEueAF0AXkBAQZ/AWgBgQEyAYIBAQSGASwBhwEAAYkBKgKLAQABjgEgAY8BJgGQASgBkQEAAZMBKgGUAS4BlgE0AZcBMAGYAQABnAE0AZ0BNgGfATgBoAEBBqYBPAGnAQABqQE8AawBAAGuATwBrwEAAbEBOgKzAQEEtwE+AbgBAAG8AQABxAECAcUBAAHHAQIByAEAAcoBAgHLAQES3gEBEvEBAgHyAQEE9gF6AfcBhgH4AQEoIAJuASICARI6AkYBOwIAAT0CbAE+AkQBQQIAAUMCagFEAhwBRQIeAUYCAQpFAyQBcAMBBHYDAAGGAxIBiAMQA4wDGgGOAxgCkQMOEaMDDgnCAwABzwMEAdADjAHRA44B1QOSAdYDkAHYAwEY8AOIAfEDigH0A4IB9QOAAfcDAAH5A5gB+gMAAf0DbgMABCIQEAQOIGAEASKKBAE2wAQGAcEEAQ7QBAFYMQUWJqAQQibHEEIBzRBCAQAeAZabHoQBnh5gAaAeAWAIH5YIGB+WBigflgg4H5YISB+WBlkflwhoH5YIiB+WCJgflgioH5YIuB+WAroffgK8H5QBvh9kAcgffATMH5QB2B+WAtofeALoH5YC6h92AuwfmAH4H3AC+h9yAvwflAEmIWIBKiFcASshXgEyIQwBYCEIEIMhAAG2JAoaACwWL2AsAAFiLFgBYyxmAWQsWgFnLAEGbSxUAW4sVgFvLFABcCxSAXIsAAF1LAABfixOAoAsAWTrLAEE8iwAAUCmAS6ApgEYIqcBDjKnAT55pwEEfadMAX6nAQqLpwABjadKAZCnAQSgpwEKqqdIASH/DhoAAAAAAQACAAgADwAQABoAHAAgACUAJgAoADAAPwBAAEUARwBPAFAAdADKAMsAzQDOAM8A0QDSANMA1QDWANkA2gDbAAcDYBwoKisqvFrYWvx1wdXh1eLV5NUD1gnWGdZB37rfQeKj4vvjGvH0/j3/Xf9+/4D/gv+H/5D/nP+f/6r/tv/A/8T/xv/I/8r/0P/i/+f/6v/x//f/+P/5/wAAAAAAAAAABQc4B0MHYweIB5QHywfoB/gHDAg+CHgIngjYCO4IKAlPCagJuAnUCSQKbAqsCt4KGgtOC4oLqAu4C9QLCA2ADXAOgA6QDqAOtg74DjgPSA9YD2gPgA+oD8gP2A8KECoQShBqEIoQqhDIENgQ+BA4EUgRWhF4EYgRmBEEGDYYeBiIGNgYHRlpGYEZCPAc8EjwXvCY8KrwyvDo8PjwCPEe8VjxaPF48YzxuPHI8drx/PEu8m7yqvLK8ujy+PIK8yzzXvOc88rz6vMO9Ej0WvR49Iz0sPS49MD0yPQK9S71bvWq9cz1/vU49kr2avaO9s72Cvcq9073iPee9wAAAAAAYWNlaW5vdXl5YWNkZWVnaGlqa2xub3JzdHV1d3l6b3VhaW919eFna2/vamdu4WFlaW9ydXN0aGFl72/veQAAAAAAAAAAYWLjZGTlZeVmZ2hoaelrbOxsbW7vcHLycnPzdHX1dnd3eHl6aHR3eWHh4eFl5eVpb+/v73X19XkAAAAAAACGAQAAhgEAAIcBAACIAQAAiAEAAIkBAACKAQAAiwEAAIwBAACNAQAAjgEAAI8B"); base64DecodeToExistingUint8Array(bufferView, 56960, "dVUAAMZmAAApbQAAXm0AAHttAADqbgAARW0AAOBSAAA5XgAAkGcAAMtnAAAKZwAAZVAAANVQAAAnVQAAjlMAAPxUAADQUwAAHmMAAKFVAABgZwAA+FIAACdTAAA6ZwAAZngAAGZ4AABXUwAAlm0AALpdAAD2awAAxVQAAKFSAABaVAAAC1QAAB9PAADGUQAA020AAFxRAABYUgAAY10AAAAAAACQAQAAkQEAAJIBAACTAQAAlAE="); base64DecodeToExistingUint8Array(bufferView, 57152, "lQEAAJYBAACXAQAAmAEAAJkB"); base64DecodeToExistingUint8Array(bufferView, 57184, "AQEBAQEBAQEBAQAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAABAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAQEBAAEBAQABAQEBAQABAQEBAQABAQECAQAAAAAAAO4nAAAJAAAAxQUAAAYAAACfEAAACAAAAJ0QAAAKAAAAJCYAAAUAAAAUCwAABwAAAL87AAAKAAAADzwAAAo="); base64DecodeToExistingUint8Array(bufferView, 57396, "AQ=="); base64DecodeToExistingUint8Array(bufferView, 57408, "AQEBAQEBAQEBAQAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAABAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAACWTAAAAgAEAD1QAAADAQMAw0kAAAMBAgDPTAAABAABAFwNAACaAQAAaRAAAJsBAACXMgAAnAEAAO4nAACdAQAAFAsAAFEyAAAkJAAA3Q8AABYOAAAAAAAAngEAAJ4BAACfAQAAoAEAAKABAAChAQAAogEAAKMBAACkAQAApQEAAKYBAACnAQ=="); base64DecodeToExistingUint8Array(bufferView, 57680, "7jAAAEA/AQCPOQAApD8BAAAAAgADAAUABgAHAAgACQAwXQAA0GEAALROAACrYAAA3lsAAJxdAADBXwAAFFsAAEpgAABXSwAA+1oAAI1cAADEYAAAo1wAAJhfAABLUAAAiksAAF9cAABySwAAn08AAAtcAABpYAAAm2AAAH5gAADPXAAA5GAAAA9hAABgYQAALGEAALFfAAB1OQAARVsAAHZhAAD4YAAAK1sAAEphAACDXwAA5UkAAGlOAAACUgAARF0AANVfAABgTwAAvEkAACdKAAAeSgAAFk8AANlJAAAwUA=="); base64DecodeToExistingUint8Array(bufferView, 57920, "/RIAAAEAAQC3AQAAPywAAAEAAQC4AQAAviwAAAEAAQC5AQAAblwAAAIAAQC6AQAAc1wAAAIAAQC6AQAAUzAAAAEAAQC7AQAAWTAAAAEAAQC8AQAAXzAAAAEAAQC9AQAABzoAAAIAAQC+AQAAMhcAAAEAAQC/AQAAaRQAAAEAAQDAAQAA/hIAAAEAAQDBAQAAQCwAAAEAAQDCAQAAvywAAAEAAQDDAQAAMQoAAAEAAQDEAQAAVDAAAAEAAQDFAQAAWjAAAAEAAQDGAQAAYDAAAAEAAQDHAQAA/y8AAAEAAQDIAQAA0CYAAAEAAQDJAQAACDEAAAEAAQDKAQAAY2AAAAEAAQDLAQAATCQAAAIAAQDMAQAAfywAAAEAAQDNAQAA4AkAAAEAAQDOAQAABDYAAAEAAQDPAQAAQi4AAAEAAQDQAQAAEiQAAAEAAQDRAQAAyS8AAAAAAQHSAQAACTQAAAIAAQDTAQAA8wUAAAIAAQDUAQAA8wUAAAMAAQDUAQAA8yIAAAIAAQDVAQAA6iIAAAIAAQDWAQAAHTUAAAEAAQDXAQAACCUAAAEAAQDYAQAATi4AAAIAAQDZAQAAnyYAAAIAAQDaAQAALUYAAAIAAQDbAQAAwyQAAAIAAQDcAQAASgcAAAEAAADdAQAA3gEAABI6AAABAAAA3QEAAN8BAAC+OQAAAQAAAOABAADhAQAAwywAAAEAAADgAQAA4gEAADo3AAABAAAA4AEAAOMBAABJNwAAAQAAAOABAADkAQ=="); base64DecodeToExistingUint8Array(bufferView, 58562, "AQIDAAECAAACAgQFBQABAgYCAwABAAIAAgAAAAAAAAABAgMAAQIAAAICBAUFAAECBgIDAAEAAgAC"); base64DecodeToExistingUint8Array(bufferView, 58752, "BAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAgICAgICAgICAgICAgICAgMDAwMDAwMDBAQEBAQEBAQAAAAAgDAAAIAgDgCAIMgDAAAAAID///8A+P//AAD//0+7YQVnrN0/GC1EVPsh6T+b9oHSC3PvPxgtRFT7Ifk/4mUvIn8rejwHXBQzJqaBPL3L8HqIB3A8B1wUMyamkTwYLURU+yHpPxgtRFT7Iem/0iEzf3zZAkDSITN/fNkCwA=="); base64DecodeToExistingUint8Array(bufferView, 59023, "gBgtRFT7IQlAGC1EVPshCcADAAAABAAAAAQAAAAGAAAAg/miAERObgD8KRUA0VcnAN009QBi28AAPJmVAEGQQwBjUf4Au96rALdhxQA6biQA0k1CAEkG4AAJ6i4AHJLRAOsd/gApsRwA6D6nAPU1ggBEuy4AnOmEALQmcABBfl8A1pE5AFODOQCc9DkAi1+EACj5vQD4HzsA3v+XAA+YBQARL+8AClqLAG0fbQDPfjYACcsnAEZPtwCeZj8ALepfALondQDl68cAPXvxAPc5BwCSUooA+2vqAB+xXwAIXY0AMANWAHv8RgDwq2sAILzPADb0mgDjqR0AXmGRAAgb5gCFmWUAoBRfAI1AaACA2P8AJ3NNAAYGMQDKVhUAyahzAHviYABrjMAAGcRHAM1nwwAJ6NwAWYMqAIt2xACmHJYARK/dABlX0QClPgUABQf/ADN+PwDCMugAmE/eALt9MgAmPcMAHmvvAJ/4XgA1HzoAf/LKAPGHHQB8kCEAaiR8ANVu+gAwLXcAFTtDALUUxgDDGZ0ArcTCACxNQQAMAF0Ahn1GAONxLQCbxpoAM2IAALTSfAC0p5cAN1XVANc+9gCjEBgATXb8AGSdKgBw16sAY3z4AHqwVwAXFecAwElWADvW2QCnhDgAJCPLANaKdwBaVCMAAB+5APEKGwAZzt8AnzH/AGYeagCZV2EArPtHAH5/2AAiZbcAMuiJAOa/YADvxM0AbDYJAF0/1AAW3tcAWDveAN6bkgDSIigAKIboAOJYTQDGyjIACOMWAOB9ywAXwFAA8x2nABjgWwAuEzQAgxJiAINIAQD1jlsArbB/AB7p8gBISkMAEGfTAKrd2ACuX0IAamHOAAoopADTmbQABqbyAFx3fwCjwoMAYTyIAIpzeACvjFoAb9e9AC2mYwD0v8sAjYHvACbBZwBVykUAytk2ACio0gDCYY0AEsl3AAQmFAASRpsAxFnEAMjFRABNspEAABfzANRDrQApSeUA/dUQAAC+/AAelMwAcM7uABM+9QDs8YAAs+fDAMf4KACTBZQAwXE+AC4JswALRfMAiBKcAKsgewAutZ8AR5LCAHsyLwAMVW0AcqeQAGvnHwAxy5YAeRZKAEF54gD034kA6JSXAOLmhACZMZcAiO1rAF9fNgC7/Q4ASJq0AGekbABxckIAjV0yAJ8VuAC85QkAjTElAPd0OQAwBRwADQwBAEsIaAAs7lgAR6qQAHTnAgC91iQA932mAG5IcgCfFu8AjpSmALSR9gDRU1EAzwryACCYMwD1S34AsmNoAN0+XwBAXQMAhYl/AFVSKQA3ZMAAbdgQADJIMgBbTHUATnHUAEVUbgALCcEAKvVpABRm1QAnB50AXQRQALQ72wDqdsUAh/kXAElrfQAdJ7oAlmkpAMbMrACtFFQAkOJqAIjZiQAsclAABKS+AHcHlADzMHAAAPwnAOpxqABmwkkAZOA9AJfdgwCjP5cAQ5T9AA2GjAAxQd4AkjmdAN1wjAAXt+cACN87ABU3KwBcgKAAWoCTABARkgAP6NgAbICvANv/SwA4kA8AWRh2AGKlFQBhy7sAx4m5ABBAvQDS8gQASXUnAOu29gDbIrsAChSqAIkmLwBkg3YACTszAA6UGgBROqoAHaPCAK/trgBcJhIAbcJNAC16nADAVpcAAz+DAAnw9gArQIwAbTGZADm0BwAMIBUA2MNbAPWSxADGrUsATsqlAKc3zQDmqTYAq5KUAN1CaAAZY94AdozvAGiLUgD82zcArqGrAN8VMQAArqEADPvaAGRNZgDtBbcAKWUwAFdWvwBH/zoAavm5AHW+8wAok98Aq4AwAGaM9gAEyxUA+iIGANnkHQA9s6QAVxuPADbNCQBOQukAE76kADMjtQDwqhoAT2WoANLBpQALPw8AW3jNACP5dgB7iwQAiRdyAMamUwBvbuIA7+sAAJtKWADE2rcAqma6AHbPzwDRAh0AsfEtAIyZwQDDrXcAhkjaAPddoADGgPQArPAvAN3smgA/XLwA0N5tAJDHHwAq27YAoyU6AACvmgCtU5MAtlcEACkttABLgH4A2genAHaqDgB7WaEAFhIqANy3LQD65f0Aidv+AIm+/QDkdmwABqn8AD6AcACFbhUA/Yf/ACg+BwBhZzMAKhiGAE296gCz568Aj21uAJVnOQAxv1sAhNdIADDfFgDHLUMAJWE1AMlwzgAwy7gAv2z9AKQAogAFbOQAWt2gACFvRwBiEtIAuVyEAHBhSQBrVuAAmVIBAFBVNwAe1bcAM/HEABNuXwBdMOQAhS6pAB2ywwChMjYACLekAOqx1AAW9yEAj2nkACf/dwAMA4AAjUAtAE/NoAAgpZkAs6LTAC9dCgC0+UIAEdrLAH2+0ACb28EAqxe9AMqigQAIalwALlUXACcAVQB/FPAA4QeGABQLZACWQY0Ah77eANr9KgBrJbYAe4k0AAXz/gC5v54AaGpPAEoqqABPxFoALfi8ANdamAD0x5UADU2NACA6pgCkV18AFD+xAIA4lQDMIAEAcd2GAMnetgC/YPUATWURAAEHawCMsKwAssDQAFFVSAAe+w4AlXLDAKMGOwDAQDUABtx7AOBFzABOKfoA1srIAOjzQQB8ZN4Am2TYANm+MQCkl8MAd1jUAGnjxQDw2hMAujo8AEYYRgBVdV8A0r31AG6SxgCsLl0ADkTtABw+QgBhxIcAKf3pAOfW8wAifMoAb5E1AAjgxQD/140AbmriALD9xgCTCMEAfF10AGutsgDNbp0APnJ7AMYRagD3z6kAKXPfALXJugC3AFEA4rINAHS6JADlfWAAdNiKAA0VLACBGAwAfmaUAAEpFgCfenYA/f2+AFZF7wDZfjYA7NkTAIu6uQDEl/wAMagnAPFuwwCUxTYA2KhWALSotQDPzA4AEoktAG9XNAAsVokAmc7jANYguQBrXqoAPiqcABFfzAD9C0oA4fT7AI47bQDihiwA6dSEAPy0qQDv7tEALjXJAC85YQA4IUQAG9nIAIH8CgD7SmoALxzYAFO0hABOmYwAVCLMACpV3ADAxtYACxmWABpwuABplWQAJlpgAD9S7gB/EQ8A9LURAPzL9QA0vC0ANLzuAOhdzADdXmAAZ46bAJIz7wDJF7gAYVibAOFXvABRg8YA2D4QAN1xSAAtHN0ArxihACEsRgBZ89cA2XqYAJ5UwABPhvoAVgb8AOV5rgCJIjYAOK0iAGeT3ABV6KoAgiY4AMrnmwBRDaQAmTOxAKnXDgBpBUgAZbLwAH+IpwCITJcA+dE2ACGSswB7gkoAmM8hAECf3ADcR1UA4XQ6AGfrQgD+nd8AXtRfAHtnpAC6rHoAVfaiACuIIwBBulUAWW4IACEqhgA5R4MAiePmAOWe1ABJ+0AA/1bpABwPygDFWYoAlPorANPBxQAPxc8A21quAEfFhgCFQ2IAIYY7ACx5lAAQYYcAKkx7AIAsGgBDvxIAiCaQAHg8iQCoxOQA5dt7AMQ6wgAm9OoA92eKAA2SvwBloysAPZOxAL18CwCkUdwAJ91jAGnh3QCalBkAqCmVAGjOKAAJ7bQARJ8gAE6YygBwgmMAfnwjAA+5MgCn9Y4AFFbnACHxCAC1nSoAb35NAKUZUQC1+asAgt/WAJbdYQAWNgIAxDqfAIOioQBy7W0AOY16AIK4qQBrMlwARidbAAA07QDSAHcA/PRVAAFZTQDgcYA="); base64DecodeToExistingUint8Array(bufferView, 61827, "QPsh+T8AAAAALUR0PgAAAICYRvg8AAAAYFHMeDsAAACAgxvwOQAAAEAgJXo4AAAAgCKC4zYAAAAAHfNpNf6CK2VHFWdAAAAAAAAAOEMAAPr+Qi52vzo7nrya9wy9vf3/////3z88VFVVVVXFP5ErF89VVaU/F9CkZxERgT8AAAAAAADIQu85+v5CLuY/JMSC/72/zj+19AzXCGusP8xQRtKrsoM/hDpOm+DXVT8="); base64DecodeToExistingUint8Array(bufferView, 62014, "8D9uv4gaTzubPDUz+6k99u8/XdzYnBNgcbxhgHc+muzvP9FmhxB6XpC8hX9u6BXj7z8T9mc1UtKMPHSFFdOw2e8/+o75I4DOi7ze9t0pa9DvP2HI5mFO92A8yJt1GEXH7z+Z0zNb5KOQPIPzxso+vu8/bXuDXaaalzwPiflsWLXvP/zv/ZIatY4890dyK5Ks7z/RnC9wPb4+PKLR0zLso+8/C26QiTQDarwb0/6vZpvvPw69LypSVpW8UVsS0AGT7z9V6k6M74BQvMwxbMC9iu8/FvTVuSPJkbzgLamumoLvP69VXOnj04A8UY6lyJh67z9Ik6XqFRuAvHtRfTy4cu8/PTLeVfAfj7zqjYw4+WrvP79TEz+MiYs8dctv61tj7z8m6xF2nNmWvNRcBITgW+8/YC86PvfsmjyquWgxh1TvP504hsuC54+8Hdn8IlBN7z+Nw6ZEQW+KPNaMYog7Ru8/fQTksAV6gDyW3H2RST/vP5SoqOP9jpY8OGJ1bno47z99SHTyGF6HPD+msk/OMe8/8ucfmCtHgDzdfOJlRSvvP14IcT97uJa8gWP14d8k7z8xqwlt4feCPOHeH/WdHu8/+r9vGpshPbyQ2drQfxjvP7QKDHKCN4s8CwPkpoUS7z+Py86JkhRuPFYvPqmvDO8/tquwTXVNgzwVtzEK/gbvP0x0rOIBQoY8MdhM/HAB7z9K+NNdOd2PPP8WZLII/O4/BFuOO4Cjhrzxn5JfxfbuP2hQS8ztSpK8y6k6N6fx7j+OLVEb+AeZvGbYBW2u7O4/0jaUPujRcbz3n+U02+fuPxUbzrMZGZm85agTwy3j7j9tTCqnSJ+FPCI0Ekym3u4/imkoemASk7wcgKwERdruP1uJF0iPp1i8Ki73IQrW7j8bmklnmyx8vJeoUNn10e4/EazCYO1jQzwtiWFgCM7uP+9kBjsJZpY8VwAd7UHK7j95A6Ha4cxuPNA8wbWixu4/MBIPP47/kzze09fwKsPuP7CvervOkHY8Jyo21dq/7j934FTrvR2TPA3d/ZmyvO4/jqNxADSUj7ynLJ12srnuP0mjk9zM3oe8QmbPotq27j9fOA+9xt54vIJPnVYrtO4/9lx77EYShrwPkl3KpLHuP47X/RgFNZM82ie1Nkev7j8Fm4ovt5h7PP3Hl9QSre4/CVQc4uFjkDwpVEjdB6vuP+rGGVCFxzQ8t0ZZiiap7j81wGQr5jKUPEghrRVvp+4/n3aZYUrkjLwJ3Ha54aXuP6hN7zvFM4y8hVU6sH6k7j+u6SuJeFOEvCDDzDRGo+4/WFhWeN3Ok7wlIlWCOKLuP2QZfoCqEFc8c6lM1FWh7j8oIl6/77OTvM07f2aeoO4/grk0h60Sary/2gt1EqDuP+6pbbjvZ2O8LxplPLKf7j9RiOBUPdyAvISUUfl9n+4/zz5afmQfeLx0X+zodZ/uP7B9i8BK7oa8dIGlSJqf7j+K5lUeMhmGvMlnQlbrn+4/09QJXsuckDw/Xd5PaaDuPx2lTbncMnu8hwHrcxSh7j9rwGdU/eyUPDLBMAHtoe4/VWzWq+HrZTxiTs8286LuP0LPsy/FoYi8Eho+VCek7j80NzvxtmmTvBPOTJmJpe4/Hv8ZOoRegLytxyNGGqfuP25XcthQ1JS87ZJEm9mo7j8Aig5bZ62QPJlmitnHqu4/tOrwwS+3jTzboCpC5azuP//nxZxgtmW8jES1FjKv7j9EX/NZg/Z7PDZ3FZmuse4/gz0epx8Jk7zG/5ELW7TuPykebIu4qV285cXNsDe37j9ZuZB8+SNsvA9SyMtEuu4/qvn0IkNDkrxQTt6fgr3uP0uOZtdsyoW8ugfKcPHA7j8nzpEr/K9xPJDwo4KRxO4/u3MK4TXSbTwjI+MZY8juP2MiYiIExYe8ZeVde2bM7j/VMeLjhhyLPDMtSuyb0O4/Fbu809G7kbxdJT6yA9XuP9Ix7pwxzJA8WLMwE57Z7j+zWnNuhGmEPL/9eVVr3u4/tJ2Ol83fgrx689O/a+PuP4czy5J3Gow8rdNamZ/o7j/62dFKj3uQvGa2jSkH7u4/uq7cVtnDVbz7FU+4ovPuP0D2pj0OpJC8OlnljXL57j80k6049NZovEde+/J2/+4/NYpYa+LukbxKBqEwsAXvP83dXwrX/3Q80sFLkB4M7z+smJL6+72RvAke11vCEu8/swyvMK5uczycUoXdmxnvP5T9n1wy4448etD/X6sg7z+sWQnRj+CEPEvRVy7xJ+8/ZxpOOK/NYzy15waUbS/vP2gZkmwsa2c8aZDv3CA37z/StcyDGIqAvPrDXVULP+8/b/r/P12tj7x8iQdKLUfvP0mpdTiuDZC88okNCIdP7z+nBz2mhaN0PIek+9wYWO8/DyJAIJ6RgryYg8kW42DvP6ySwdVQWo48hTLbA+Zp7z9LawGsWTqEPGC0AfMhc+8/Hz60ByHVgrxfm3szl3zvP8kNRzu5Kom8KaH1FEaG7z/TiDpgBLZ0PPY/i+cukO8/cXKdUezFgzyDTMf7UZrvP/CR048S94+82pCkoq+k7z99dCPimK6NvPFnji1Ir+8/CCCqQbzDjjwnWmHuG7rvPzLrqcOUK4Q8l7prNyvF7z/uhdExqWSKPEBFblt20O8/7eM75Lo3jrwUvpyt/dvvP53NkU07iXc82JCegcHn7z+JzGBBwQVTPPFxjyvC8+8/ADj6/kIu5j8wZ8eTV/MuPQEAAAAAAOC/WzBRVVVV1T+QRev////PvxEB8SSzmck/n8gG5XVVxb8AAAAAAADgv3dVVVVVVdU/y/3/////z78M3ZWZmZnJP6dFZ1VVVcW/MN5EoyRJwj9lPUKk//+/v8rWKiiEcbw//2iwQ+uZub+F0K/3goG3P81F0XUTUrW/n97gw/A09z8AkOZ5f8zXvx/pLGp4E/c/AAANwu5v17+gtfoIYPL2PwDgURPjE9e/fYwTH6bR9j8AeCg4W7jWv9G0xQtJsfY/AHiAkFVd1r+6DC8zR5H2PwAAGHbQAta/I0IiGJ9x9j8AkJCGyqjVv9kepZlPUvY/AFADVkNP1b/EJI+qVjP2PwBAa8M39tS/FNyda7MU9j8AUKj9p53Uv0xcxlJk9vU/AKiJOZJF1L9PLJG1Z9j1PwC4sDn07dO/3pBby7y69T8AcI9EzpbTv3ga2fJhnfU/AKC9Fx5A07+HVkYSVoD1PwCARu/i6dK/02vnzpdj9T8A4DA4G5TSv5N/p+IlR/U/AIjajMU+0r+DRQZC/yr1PwCQJynh6dG/372y2yIP9T8A+EgrbZXRv9feNEeP8/Q/APi5mmdB0b9AKN7PQ9j0PwCY75TQ7dC/yKN4wD699D8AENsYpZrQv4ol4MN/ovQ/ALhjUuZH0L80hNQkBYj0PwDwhkUi68+/Cy0ZG85t9D8AsBd1SkfPv1QYOdPZU/Q/ADAQPUSkzr9ahLREJzr0PwCw6UQNAs6/+/gVQbUg9D8A8HcpomDNv7H0PtqCB/Q/AJCVBAHAzL+P/lddj+7zPwAQiVYpIMy/6UwLoNnV8z8AEIGNF4HLvyvBEMBgvfM/ANDTzMniyr+42nUrJKXzPwCQEi5ARcq/AtCfzSKN8z8A8B1od6jJvxx6hMVbdfM/ADBIaW0Myb/iNq1Jzl3zPwDARaYgcci/QNRNmHlG8z8AMBS0j9bHvyTL/85cL/M/AHBiPLg8x79JDaF1dxjzPwBgN5uao8a/kDk+N8gB8z8AoLdUMQvGv0H4lbtO6/I/ADAkdn1zxb/RqRkCCtXyPwAwwo973MS/Kv23qPm+8j8AANJRLEbEv6sbDHocqfI/AACDvIqww78wtRRgcpPyPwAASWuZG8O/9aFXV/p98j8AQKSQVIfCv787HZuzaPI/AKB5+Lnzwb+99Y+DnVPyPwCgLCXIYMG/OwjJqrc+8j8AIPdXf87Av7ZAqSsBKvI/AKD+Sdw8wL8yQcyWeRXyPwCAS7y9V7+/m/zSHSAB8j8AQECWCDe+vwtITUn07PE/AED5PpgXvb9pZY9S9djxPwCg2E5n+bu/fH5XESPF8T8AYC8gedy6v+kmy3R8sfE/AIAo58PAub+2GiwMAZ7xPwDAcrNGpri/vXC2e7CK8T8AAKyzAY23v7a87yWKd/E/AAA4RfF0tr/aMUw1jWTxPwCAh20OXrW/3V8nkLlR8T8A4KHeXEi0v0zSMqQOP/E/AKBqTdkzs7/a+RByiyzxPwBgxfh5ILK/MbXsKDAa8T8AIGKYRg6xv680hNr7B/E/AADSamz6r7+za04P7vXwPwBAd0qN2q2/zp8qXQbk8D8AAIXk7LyrvyGlLGNE0vA/AMASQImhqb8amOJ8p8DwPwDAAjNYiKe/0TbGgy+v8D8AgNZnXnGlvzkToJjbnfA/AIBlSYpco7/f51Kvq4zwPwBAFWTjSaG/+yhOL5978D8AgOuCwHKevxmPNYy1avA/AIBSUvFVmr8s+eyl7lnwPwCAgc9iPZa/kCzRzUlJ8D8AAKqM+yiSv6mt8MbGOPA/AAD5IHsxjL+pMnkTZSjwPwAAql01GYS/SHPqJyQY8D8AAOzCAxJ4v5WxFAYECPA/AAAkeQkEYL8a+ib3H+DvPwAAkITz728/dOphwhyh7z8AAD01QdyHPy6ZgbAQY+8/AIDCxKPOkz/Nre489iXvPwAAiRTBn5s/5xORA8jp7j8AABHO2LChP6uxy3iAru4/AMAB0FuKpT+bDJ2iGnTuPwCA2ECDXKk/tZkKg5E67j8AgFfvaietP1aaYAngAe4/AMCY5Zh1sD+Yu3flAcrtPwAgDeP1U7I/A5F8C/KS7T8AADiL3S60P85c+2asXO0/AMBXh1kGtj+d3l6qLCftPwAAajV22rc/zSxrPm7y7D8AYBxOQ6u5PwJ5p6Jtvuw/AGANu8d4uz9tCDdtJovsPwAg5zITQ70/BFhdvZRY7D8AYN5xMQq/P4yfuzO1Juw/AECRKxVnwD8/5+zug/XrPwCwkoKFR8E/wZbbdf3E6z8AMMrNbibCPyhKhgweles/AFDFptcDwz8sPu/F4mXrPwAQMzzD38M/i4jJZ0g36z8AgHprNrrEP0owHSFLCes/APDRKDmTxT9+7/KF6NvqPwDwGCTNasY/oj1gMR2v6j8AkGbs+EDHP6dY0z/mguo/APAa9cAVyD+LcwnvQFfqPwCA9lQp6cg/J0urkCos6j8AQPgCNrvJP9HykxOgAeo/AAAsHO2Lyj8bPNskn9fpPwDQAVxRW8s/kLHHBSWu6T8AwLzMZynMPy/Ol/Iuhek/AGBI1TX2zD91S6TuulzpPwDARjS9wc0/OEjnncY06T8A4M+4AYzOP+ZSZy9PDek/AJAXwAlVzz+d1/+OUuboPwC4HxJsDtA/fADMn86/6D8A0JMOuHHQPw7DvtrAmeg/AHCGnmvU0D/7FyOqJ3ToPwDQSzOHNtE/CJqzrABP6D8ASCNnDZjRP1U+ZehJKug/AIDM4P/40T9gAvSVAQboPwBoY9dfWdI/KaPgYyXi5z8AqBQJMLnSP6213Hezvuc/AGBDEHIY0z/CJZdnqpvnPwAY7G0md9M/VwYX8gd55z8AMK/7T9XTPwwT1tvKVuc/AOAv4+4y1D9rtk8BABDmPzxbQpFsAn48lbRNAwAw5j9BXQBI6r+NPHjUlA0AUOY/t6XWhqd/jjytb04HAHDmP0wlVGvq/GE8rg/f/v+P5j/9DllMJ358vLzFYwcAsOY/AdrcSGjBirz2wVweANDmPxGTSZ0cP4M8PvYF6//v5j9TLeIaBIB+vICXhg4AEOc/UnkJcWb/ezwS6Wf8/y/nPySHvSbiAIw8ahGB3/9P5z/SAfFukQJuvJCcZw8AcOc/dJxUzXH8Z7w1yH76/4/nP4ME9Z7BvoE85sIg/v+v5z9lZMwpF35wvADJP+3/z+c/HIt7CHKAgLx2Gibp/+/nP675nW0owI086KOcBAAQ6D8zTOVR0n+JPI8skxcAMOg/gfMwtun+irycczMGAFDoP7w1ZWu/v4k8xolCIABw6D91exHzZb+LvAR59ev/j+g/V8s9om4AibzfBLwiALDoPwpL4DjfAH28ihsM5f/P6D8Fn/9GcQCIvEOOkfz/7+g/OHB60HuBgzzHX/oeABDpPwO033aRPok8uXtGEwAw6T92AphLToB/PG8H7ub/T+k/LmL/2fB+j7zREjze/2/pP7o4JpaqgnC8DYpF9P+P6T/vqGSRG4CHvD4umN3/r+k/N5NaiuBAh7xm+0nt/8/pPwDgm8EIzj88UZzxIADw6T8KW4gnqj+KvAawRREAEOo/VtpYmUj/dDz69rsHADDqPxhtK4qrvow8eR2XEABQ6j8weXjdyv6IPEgu9R0AcOo/26vYPXZBj7xSM1kcAJDqPxJ2woQCv468Sz5PKgCw6j9fP/88BP1pvNEertf/z+o/tHCQEuc+grx4BFHu/+/qP6PeDuA+Bmo8Ww1l2/8P6z+5Ch84yAZaPFfKqv7/L+s/HTwjdB4BebzcupXZ/0/rP58qhmgQ/3m8nGWeJABw6z8+T4bQRf+KPEAWh/n/j+s/+cPClnf+fDxPywTS/6/rP8Qr8u4n/2O8RVxB0v/P6z8h6jvut/9svN8JY/j/7+s/XAsulwNBgbxTdrXh/w/sPxlqt5RkwYs841f68f8v7D/txjCN7/5kvCTkv9z/T+w/dUfsvGg/hLz3uVTt/2/sP+zgU/CjfoQ81Y+Z6/+P7D/xkvmNBoNzPJohJSEAsOw/BA4YZI79aLycRpTd/8/sP3Lqxxy+fo48dsT96v/v7D/+iJ+tOb6OPCv4mhYAEO0/cVq5qJF9dTwd9w8NADDtP9rHcGmQwYk8xA956v9P7T8M/ljFNw5YvOWH3C4AcO0/RA/BTdaAf7yqgtwhAJDtP1xc/ZSPfHS8gwJr2P+v7T9+YSHFHX+MPDlHbCkA0O0/U7H/sp4BiDz1kETl/+/tP4nMUsbSAG48lParzf8P7j/SaS0gQIN/vN3IUtv/L+4/ZAgbysEAezzvFkLy/0/uP1GrlLCo/3I8EV6K6P9v7j9Zvu+xc/ZXvA3/nhEAkO4/AcgLXo2AhLxEF6Xf/6/uP7UgQ9UGAHg8oX8SGgDQ7j+SXFZg+AJQvMS8ugcA8O4/EeY1XURAhbwCjXr1/w/vPwWR7zkx+0+8x4rlHgAw7z9VEXPyrIGKPJQ0gvX/T+8/Q8fX1EE/ijxrTKn8/2/vP3V4mBz0AmK8QcT54f+P7z9L53f00X13PH7j4NL/r+8/MaN8mhkBb7ye5HccANDvP7GszkvugXE8McPg9//v7z9ah3ABNwVuvG5gZfT/D/A/2gocSa1+irxYeobz/y/wP+Cy/MNpf5e8Fw38/f9P8D9blMs0/r+XPIJNzQMAcPA/y1bkwIMAgjzoy/L5/4/wPxp1N77f/228ZdoMAQCw8D/rJuaufz+RvDjTpAEA0PA/959Iefp9gDz9/dr6/+/wP8Br1nAFBHe8lv26CwAQ8T9iC22E1ICOPF305fr/L/E/7zb9ZPq/nTzZmtUNAFDxP65QEnB3AJo8mlUhDwBw8T/u3uPi+f2NPCZUJ/z/j/E/c3I73DAAkTxZPD0SALDxP4gBA4B5f5k8t54p+P/P8T9njJ+rMvllvADUivT/7/E/61unnb9/kzykhosMABDyPyJb/ZFrgJ88A0OFAwAw8j8zv5/rwv+TPIT2vP//T/I/ci4ufucBdjzZISn1/2/yP2EMf3a7/H88PDqTFACQ8j8rQQI8ygJyvBNjVRQAsPI/Ah/yM4KAkrw7Uv7r/8/yP/LcTzh+/4i8lq24CwDw8j/FQTBQUf+FvK/ievv/D/M/nSheiHEAgbx/X6z+/y/zPxW3tz9d/5G8VmemDABQ8z+9gosign+VPCH3+xEAcPM/zNUNxLoAgDy5L1n5/4/zP1Gnsi2dP5S8QtLdBACw8z/hOHZwa3+FPFfJsvX/z/M/MRK/EDoCejwYtLDq/+/zP7BSsWZtf5g89K8yFQAQ9D8khRlfN/hnPCmLRxcAMPQ/Q1HccuYBgzxjtJXn/0/0P1qJsrhp/4k84HUE6P9v9D9U8sKbscCVvOfBb+//j/Q/cio68glAmzwEp77l/6/0P0V9Db+3/5S83icQFwDQ9D89atxxZMCZvOI+8A8A8PQ/HFOFC4l/lzzRS9wSABD1PzakZnFlBGA8eicFFgAw9T8JMiPOzr+WvExw2+z/T/U/16EFBXICibypVF/v/2/1PxJkyQ7mv5s8EhDmFwCQ9T+Q76+BxX6IPJI+yQMAsPU/wAy/CghBn7y8GUkdAND1PylHJfsqgZi8iXq45//v9T8Eae2At36UvAA4+v5CLuY/MGfHk1fzLj0AAAAAAADgv2BVVVVVVeW/BgAAAAAA4D9OVVmZmZnpP3qkKVVVVeW/6UVIm1tJ8r/DPyaLKwDwPwAAAAAAoPY/"); base64DecodeToExistingUint8Array(bufferView, 68377, "yLnygizWv4BWNygktPo8AAAAAACA9j8="); base64DecodeToExistingUint8Array(bufferView, 68409, "CFi/vdHVvyD34NgIpRy9AAAAAABg9j8="); base64DecodeToExistingUint8Array(bufferView, 68441, "WEUXd3bVv21QttWkYiO9AAAAAABA9j8="); base64DecodeToExistingUint8Array(bufferView, 68473, "+C2HrRrVv9VnsJ7khOa8AAAAAAAg9j8="); base64DecodeToExistingUint8Array(bufferView, 68505, "eHeVX77Uv+A+KZNpGwS9AAAAAAAA9j8="); base64DecodeToExistingUint8Array(bufferView, 68537, "YBzCi2HUv8yETEgv2BM9AAAAAADg9T8="); base64DecodeToExistingUint8Array(bufferView, 68569, "qIaGMATUvzoLgu3zQtw8AAAAAADA9T8="); base64DecodeToExistingUint8Array(bufferView, 68601, "SGlVTKbTv2CUUYbGsSA9AAAAAACg9T8="); base64DecodeToExistingUint8Array(bufferView, 68633, "gJia3UfTv5KAxdRNWSU9AAAAAACA9T8="); base64DecodeToExistingUint8Array(bufferView, 68665, "IOG64ujSv9grt5keeyY9AAAAAABg9T8="); base64DecodeToExistingUint8Array(bufferView, 68697, "iN4TWonSvz+wz7YUyhU9AAAAAABg9T8="); base64DecodeToExistingUint8Array(bufferView, 68729, "iN4TWonSvz+wz7YUyhU9AAAAAABA9T8="); base64DecodeToExistingUint8Array(bufferView, 68761, "eM/7QSnSv3baUygkWha9AAAAAAAg9T8="); base64DecodeToExistingUint8Array(bufferView, 68793, "mGnBmMjRvwRU52i8rx+9AAAAAAAA9T8="); base64DecodeToExistingUint8Array(bufferView, 68825, "qKurXGfRv/CogjPGHx89AAAAAADg9D8="); base64DecodeToExistingUint8Array(bufferView, 68857, "SK75iwXRv2ZaBf3EqCa9AAAAAADA9D8="); base64DecodeToExistingUint8Array(bufferView, 68889, "kHPiJKPQvw4D9H7uawy9AAAAAACg9D8="); base64DecodeToExistingUint8Array(bufferView, 68921, "0LSUJUDQv38t9J64NvC8AAAAAACg9D8="); base64DecodeToExistingUint8Array(bufferView, 68953, "0LSUJUDQv38t9J64NvC8AAAAAACA9D8="); base64DecodeToExistingUint8Array(bufferView, 68985, "QF5tGLnPv4c8masqVw09AAAAAABg9D8="); base64DecodeToExistingUint8Array(bufferView, 69017, "YNzLrfDOvySvhpy3Jis9AAAAAABA9D8="); base64DecodeToExistingUint8Array(bufferView, 69049, "8CpuByfOvxD/P1RPLxe9AAAAAAAg9D8="); base64DecodeToExistingUint8Array(bufferView, 69081, "wE9rIVzNvxtoyruRuiE9AAAAAAAA9D8="); base64DecodeToExistingUint8Array(bufferView, 69113, "oJrH94/MvzSEn2hPeSc9AAAAAAAA9D8="); base64DecodeToExistingUint8Array(bufferView, 69145, "oJrH94/MvzSEn2hPeSc9AAAAAADg8z8="); base64DecodeToExistingUint8Array(bufferView, 69177, "kC10hsLLv4+3izGwThk9AAAAAADA8z8="); base64DecodeToExistingUint8Array(bufferView, 69209, "wIBOyfPKv2aQzT9jTro8AAAAAACg8z8="); base64DecodeToExistingUint8Array(bufferView, 69241, "sOIfvCPKv+rBRtxkjCW9AAAAAACg8z8="); base64DecodeToExistingUint8Array(bufferView, 69273, "sOIfvCPKv+rBRtxkjCW9AAAAAACA8z8="); base64DecodeToExistingUint8Array(bufferView, 69305, "UPScWlLJv+PUwQTZ0Sq9AAAAAABg8z8="); base64DecodeToExistingUint8Array(bufferView, 69337, "0CBloH/Ivwn623+/vSs9AAAAAABA8z8="); base64DecodeToExistingUint8Array(bufferView, 69369, "4BACiavHv1hKU3KQ2ys9AAAAAABA8z8="); base64DecodeToExistingUint8Array(bufferView, 69401, "4BACiavHv1hKU3KQ2ys9AAAAAAAg8z8="); base64DecodeToExistingUint8Array(bufferView, 69433, "0BnnD9bGv2bisqNq5BC9AAAAAAAA8z8="); base64DecodeToExistingUint8Array(bufferView, 69465, "kKdwMP/FvzlQEJ9Dnh69AAAAAAAA8z8="); base64DecodeToExistingUint8Array(bufferView, 69497, "kKdwMP/FvzlQEJ9Dnh69AAAAAADg8j8="); base64DecodeToExistingUint8Array(bufferView, 69529, "sKHj5SbFv49bB5CL3iC9AAAAAADA8j8="); base64DecodeToExistingUint8Array(bufferView, 69561, "gMtsK03Evzx4NWHBDBc9AAAAAADA8j8="); base64DecodeToExistingUint8Array(bufferView, 69593, "gMtsK03Evzx4NWHBDBc9AAAAAACg8j8="); base64DecodeToExistingUint8Array(bufferView, 69625, "kB4g/HHDvzpUJ02GePE8AAAAAACA8j8="); base64DecodeToExistingUint8Array(bufferView, 69657, "8B/4UpXCvwjEcRcwjSS9AAAAAABg8j8="); base64DecodeToExistingUint8Array(bufferView, 69689, "YC/VKrfBv5ajERikgC69AAAAAABg8j8="); base64DecodeToExistingUint8Array(bufferView, 69721, "YC/VKrfBv5ajERikgC69AAAAAABA8j8="); base64DecodeToExistingUint8Array(bufferView, 69753, "kNB8ftfAv/Rb6IiWaQo9AAAAAABA8j8="); base64DecodeToExistingUint8Array(bufferView, 69785, "kNB8ftfAv/Rb6IiWaQo9AAAAAAAg8j8="); base64DecodeToExistingUint8Array(bufferView, 69817, "4Nsxkey/v/Izo1xUdSW9AAAAAAAA8j8="); base64DecodeToExistingUint8Array(bufferView, 69850, "K24HJ76/PADwKiw0Kj0AAAAAAADyPw=="); base64DecodeToExistingUint8Array(bufferView, 69882, "K24HJ76/PADwKiw0Kj0AAAAAAODxPw=="); base64DecodeToExistingUint8Array(bufferView, 69913, "wFuPVF68vwa+X1hXDB29AAAAAADA8T8="); base64DecodeToExistingUint8Array(bufferView, 69945, "4Eo6bZK6v8iqW+g1OSU9AAAAAADA8T8="); base64DecodeToExistingUint8Array(bufferView, 69977, "4Eo6bZK6v8iqW+g1OSU9AAAAAACg8T8="); base64DecodeToExistingUint8Array(bufferView, 70009, "oDHWRcO4v2hWL00pfBM9AAAAAACg8T8="); base64DecodeToExistingUint8Array(bufferView, 70041, "oDHWRcO4v2hWL00pfBM9AAAAAACA8T8="); base64DecodeToExistingUint8Array(bufferView, 70073, "YOWK0vC2v9pzM8k3lya9AAAAAABg8T8="); base64DecodeToExistingUint8Array(bufferView, 70105, "IAY/Bxu1v1dexmFbAh89AAAAAABg8T8="); base64DecodeToExistingUint8Array(bufferView, 70137, "IAY/Bxu1v1dexmFbAh89AAAAAABA8T8="); base64DecodeToExistingUint8Array(bufferView, 70169, "4BuW10Gzv98T+czaXiw9AAAAAABA8T8="); base64DecodeToExistingUint8Array(bufferView, 70201, "4BuW10Gzv98T+czaXiw9AAAAAAAg8T8="); base64DecodeToExistingUint8Array(bufferView, 70233, "gKPuNmWxvwmjj3ZefBQ9AAAAAAAA8T8="); base64DecodeToExistingUint8Array(bufferView, 70265, "gBHAMAqvv5GONoOeWS09AAAAAAAA8T8="); base64DecodeToExistingUint8Array(bufferView, 70297, "gBHAMAqvv5GONoOeWS09AAAAAADg8D8="); base64DecodeToExistingUint8Array(bufferView, 70329, "gBlx3UKrv0xw1uV6ghw9AAAAAADg8D8="); base64DecodeToExistingUint8Array(bufferView, 70361, "gBlx3UKrv0xw1uV6ghw9AAAAAADA8D8="); base64DecodeToExistingUint8Array(bufferView, 70393, "wDL2WHSnv+6h8jRG/Cy9AAAAAADA8D8="); base64DecodeToExistingUint8Array(bufferView, 70425, "wDL2WHSnv+6h8jRG/Cy9AAAAAACg8D8="); base64DecodeToExistingUint8Array(bufferView, 70457, "wP65h56jv6r+JvW3AvU8AAAAAACg8D8="); base64DecodeToExistingUint8Array(bufferView, 70489, "wP65h56jv6r+JvW3AvU8AAAAAACA8D8="); base64DecodeToExistingUint8Array(bufferView, 70522, "eA6bgp+/5Al+fCaAKb0AAAAAAIDwPw=="); base64DecodeToExistingUint8Array(bufferView, 70554, "eA6bgp+/5Al+fCaAKb0AAAAAAGDwPw=="); base64DecodeToExistingUint8Array(bufferView, 70585, "gNUHG7mXvzmm+pNUjSi9AAAAAABA8D8="); base64DecodeToExistingUint8Array(bufferView, 70618, "/LCowI+/nKbT9nwe37wAAAAAAEDwPw=="); base64DecodeToExistingUint8Array(bufferView, 70650, "/LCowI+/nKbT9nwe37wAAAAAACDwPw=="); base64DecodeToExistingUint8Array(bufferView, 70682, "EGsq4H+/5EDaDT/iGb0AAAAAACDwPw=="); base64DecodeToExistingUint8Array(bufferView, 70714, "EGsq4H+/5EDaDT/iGb0AAAAAAADwPw=="); base64DecodeToExistingUint8Array(bufferView, 70766, "8D8="); base64DecodeToExistingUint8Array(bufferView, 70797, "wO8/"); base64DecodeToExistingUint8Array(bufferView, 70810, "iXUVEIA/6CudmWvHEL0AAAAAAIDvPw=="); base64DecodeToExistingUint8Array(bufferView, 70841, "gJNYViCQP9L34gZb3CO9AAAAAABA7z8="); base64DecodeToExistingUint8Array(bufferView, 70874, "ySglSZg/NAxaMrqgKr0AAAAAAADvPw=="); base64DecodeToExistingUint8Array(bufferView, 70905, "QOeJXUGgP1PX8VzAEQE9AAAAAADA7j8="); base64DecodeToExistingUint8Array(bufferView, 70938, "LtSuZqQ/KP29dXMWLL0AAAAAAIDuPw=="); base64DecodeToExistingUint8Array(bufferView, 70969, "wJ8UqpSoP30mWtCVeRm9AAAAAABA7j8="); base64DecodeToExistingUint8Array(bufferView, 71001, "wN3Nc8usPwco2EfyaBq9AAAAAAAg7j8="); base64DecodeToExistingUint8Array(bufferView, 71033, "wAbAMequP3s7yU8+EQ69AAAAAADg7T8="); base64DecodeToExistingUint8Array(bufferView, 71065, "YEbRO5exP5ueDVZdMiW9AAAAAACg7T8="); base64DecodeToExistingUint8Array(bufferView, 71097, "4NGn9b2zP9dO26VeyCw9AAAAAABg7T8="); base64DecodeToExistingUint8Array(bufferView, 71129, "oJdNWum1Px4dXTwGaSy9AAAAAABA7T8="); base64DecodeToExistingUint8Array(bufferView, 71161, "wOoK0wC3PzLtnamNHuw8AAAAAAAA7T8="); base64DecodeToExistingUint8Array(bufferView, 71193, "QFldXjO5P9pHvTpcESM9AAAAAADA7D8="); base64DecodeToExistingUint8Array(bufferView, 71225, "YK2NyGq7P+Vo9yuAkBO9AAAAAACg7D8="); base64DecodeToExistingUint8Array(bufferView, 71257, "QLwBWIi8P9OsWsbRRiY9AAAAAABg7D8="); base64DecodeToExistingUint8Array(bufferView, 71289, "IAqDOce+P+BF5q9owC29AAAAAABA7D8="); base64DecodeToExistingUint8Array(bufferView, 71321, "4Ns5kei/P/0KoU/WNCW9AAAAAAAA7D8="); base64DecodeToExistingUint8Array(bufferView, 71353, "4CeCjhfBP/IHLc547yE9AAAAAADg6z8="); base64DecodeToExistingUint8Array(bufferView, 71385, "8CN+K6rBPzSZOESOpyw9AAAAAACg6z8="); base64DecodeToExistingUint8Array(bufferView, 71417, "gIYMYdHCP6G0gctsnQM9AAAAAACA6z8="); base64DecodeToExistingUint8Array(bufferView, 71449, "kBWw/GXDP4lySyOoL8Y8AAAAAABA6z8="); base64DecodeToExistingUint8Array(bufferView, 71481, "sDODPZHEP3i2/VR5gyU9AAAAAAAg6z8="); base64DecodeToExistingUint8Array(bufferView, 71513, "sKHk5SfFP8d9aeXoMyY9AAAAAADg6j8="); base64DecodeToExistingUint8Array(bufferView, 71545, "EIy+TlfGP3guPCyLzxk9AAAAAADA6j8="); base64DecodeToExistingUint8Array(bufferView, 71577, "cHWLEvDGP+EhnOWNESW9AAAAAACg6j8="); base64DecodeToExistingUint8Array(bufferView, 71609, "UESFjYnHPwVDkXAQZhy9AAAAAABg6j8="); base64DecodeToExistingUint8Array(bufferView, 71642, "Oeuvvsg/0SzpqlQ9B70AAAAAAEDqPw=="); base64DecodeToExistingUint8Array(bufferView, 71674, "99xaWsk/b/+gWCjyBz0AAAAAAADqPw=="); base64DecodeToExistingUint8Array(bufferView, 71705, "4Io87ZPKP2khVlBDcii9AAAAAADg6T8="); base64DecodeToExistingUint8Array(bufferView, 71737, "0FtX2DHLP6rhrE6NNQy9AAAAAADA6T8="); base64DecodeToExistingUint8Array(bufferView, 71769, "4Ds4h9DLP7YSVFnESy29AAAAAACg6T8="); base64DecodeToExistingUint8Array(bufferView, 71801, "EPDG+2/MP9IrlsVy7PG8AAAAAABg6T8="); base64DecodeToExistingUint8Array(bufferView, 71833, "kNSwPbHNPzWwFfcq/yq9AAAAAABA6T8="); base64DecodeToExistingUint8Array(bufferView, 71865, "EOf/DlPOPzD0QWAnEsI8AAAAAAAg6T8="); base64DecodeToExistingUint8Array(bufferView, 71898, "3eSt9c4/EY67ZRUhyrwAAAAAAADpPw=="); base64DecodeToExistingUint8Array(bufferView, 71929, "sLNsHJnPPzDfDMrsyxs9AAAAAADA6D8="); base64DecodeToExistingUint8Array(bufferView, 71961, "WE1gOHHQP5FO7RbbnPg8AAAAAACg6D8="); base64DecodeToExistingUint8Array(bufferView, 71993, "YGFnLcTQP+nqPBaLGCc9AAAAAACA6D8="); base64DecodeToExistingUint8Array(bufferView, 72025, "6CeCjhfRPxzwpWMOISy9AAAAAABg6D8="); base64DecodeToExistingUint8Array(bufferView, 72057, "+KzLXGvRP4EWpffNmis9AAAAAABA6D8="); base64DecodeToExistingUint8Array(bufferView, 72089, "aFpjmb/RP7e9R1Htpiw9AAAAAAAg6D8="); base64DecodeToExistingUint8Array(bufferView, 72121, "uA5tRRTSP+q6Rrrehwo9AAAAAADg5z8="); base64DecodeToExistingUint8Array(bufferView, 72153, "kNx88L7SP/QEUEr6nCo9AAAAAADA5z8="); base64DecodeToExistingUint8Array(bufferView, 72185, "YNPh8RTTP7g8IdN64ii9AAAAAACg5z8="); base64DecodeToExistingUint8Array(bufferView, 72217, "EL52Z2vTP8h38bDNbhE9AAAAAACA5z8="); base64DecodeToExistingUint8Array(bufferView, 72249, "MDN3UsLTP1y9BrZUOxg9AAAAAABg5z8="); base64DecodeToExistingUint8Array(bufferView, 72281, "6NUjtBnUP53gkOw25Ag9AAAAAABA5z8="); base64DecodeToExistingUint8Array(bufferView, 72313, "yHHCjXHUP3XWZwnOJy+9AAAAAAAg5z8="); base64DecodeToExistingUint8Array(bufferView, 72345, "MBee4MnUP6TYChuJIC69AAAAAAAA5z8="); base64DecodeToExistingUint8Array(bufferView, 72377, "oDgHriLVP1nHZIFwvi49AAAAAADg5j8="); base64DecodeToExistingUint8Array(bufferView, 72409, "0MhT93vVP+9AXe7trR89AAAAAADA5j8="); base64DecodeToExistingUint8Array(bufferView, 72441, "YFnfvdXVP9xlpAgqCwq9"); base64DecodeToExistingUint8Array(bufferView, 72466, "oAJOAOsBpwV+BSABdQYYA4YE+gC5AywD/QW3AYoBegO8BB4AzAaiAD0DSQPXAQAECACTBggBjwIGAioGXwK3AvoCWAPZBP0GygK9BeEFzQXcAhAGQAJ4AH0CZwNhBOwA5QMKBdQAzAM+Bk8CdgGYA68EAABEABACrgCuA2AA+gF3BCEF6wQrAGABQQGSAKkGowFuAk4B"); base64DecodeToExistingUint8Array(bufferView, 72664, "EwQAAAAAAAAAACoC"); base64DecodeToExistingUint8Array(bufferView, 72696, "JwQ5BEgE"); base64DecodeToExistingUint8Array(bufferView, 72718, "kgQ="); base64DecodeToExistingUint8Array(bufferView, 72738, "OAVSBWAFUwYAAMoBAAAAAAAAAAC7BtsG6wYQBysHOwdQB1N1Y2Nlc3MASWxsZWdhbCBieXRlIHNlcXVlbmNlAERvbWFpbiBlcnJvcgBSZXN1bHQgbm90IHJlcHJlc2VudGFibGUATm90IGEgdHR5AFBlcm1pc3Npb24gZGVuaWVkAE9wZXJhdGlvbiBub3QgcGVybWl0dGVkAE5vIHN1Y2ggZmlsZSBvciBkaXJlY3RvcnkATm8gc3VjaCBwcm9jZXNzAEZpbGUgZXhpc3RzAFZhbHVlIHRvbyBsYXJnZSBmb3IgZGVmaW5lZCBkYXRhIHR5cGUATm8gc3BhY2UgbGVmdCBvbiBkZXZpY2UAT3V0IG9mIG1lbW9yeQBSZXNvdXJjZSBidXN5AEludGVycnVwdGVkIHN5c3RlbSBjYWxsAFJlc291cmNlIHRlbXBvcmFyaWx5IHVuYXZhaWxhYmxlAEludmFsaWQgc2VlawBDcm9zcy1kZXZpY2UgbGluawBSZWFkLW9ubHkgZmlsZSBzeXN0ZW0ARGlyZWN0b3J5IG5vdCBlbXB0eQBDb25uZWN0aW9uIHJlc2V0IGJ5IHBlZXIAT3BlcmF0aW9uIHRpbWVkIG91dABDb25uZWN0aW9uIHJlZnVzZWQASG9zdCBpcyBkb3duAEhvc3QgaXMgdW5yZWFjaGFibGUAQWRkcmVzcyBpbiB1c2UAQnJva2VuIHBpcGUASS9PIGVycm9yAE5vIHN1Y2ggZGV2aWNlIG9yIGFkZHJlc3MAQmxvY2sgZGV2aWNlIHJlcXVpcmVkAE5vIHN1Y2ggZGV2aWNlAE5vdCBhIGRpcmVjdG9yeQBJcyBhIGRpcmVjdG9yeQBUZXh0IGZpbGUgYnVzeQBFeGVjIGZvcm1hdCBlcnJvcgBJbnZhbGlkIGFyZ3VtZW50AEFyZ3VtZW50IGxpc3QgdG9vIGxvbmcAU3ltYm9saWMgbGluayBsb29wAEZpbGVuYW1lIHRvbyBsb25nAFRvbyBtYW55IG9wZW4gZmlsZXMgaW4gc3lzdGVtAE5vIGZpbGUgZGVzY3JpcHRvcnMgYXZhaWxhYmxlAEJhZCBmaWxlIGRlc2NyaXB0b3IATm8gY2hpbGQgcHJvY2VzcwBCYWQgYWRkcmVzcwBGaWxlIHRvbyBsYXJnZQBUb28gbWFueSBsaW5rcwBObyBsb2NrcyBhdmFpbGFibGUAUmVzb3VyY2UgZGVhZGxvY2sgd291bGQgb2NjdXIAU3RhdGUgbm90IHJlY292ZXJhYmxlAE93bmVyIGRpZWQAT3BlcmF0aW9uIGNhbmNlbGVkAEZ1bmN0aW9uIG5vdCBpbXBsZW1lbnRlZABObyBtZXNzYWdlIG9mIGRlc2lyZWQgdHlwZQBJZGVudGlmaWVyIHJlbW92ZWQARGV2aWNlIG5vdCBhIHN0cmVhbQBObyBkYXRhIGF2YWlsYWJsZQBEZXZpY2UgdGltZW91dABPdXQgb2Ygc3RyZWFtcyByZXNvdXJjZXMATGluayBoYXMgYmVlbiBzZXZlcmVkAFByb3RvY29sIGVycm9yAEJhZCBtZXNzYWdlAEZpbGUgZGVzY3JpcHRvciBpbiBiYWQgc3RhdGUATm90IGEgc29ja2V0AERlc3RpbmF0aW9uIGFkZHJlc3MgcmVxdWlyZWQATWVzc2FnZSB0b28gbGFyZ2UAUHJvdG9jb2wgd3JvbmcgdHlwZSBmb3Igc29ja2V0AFByb3RvY29sIG5vdCBhdmFpbGFibGUAUHJvdG9jb2wgbm90IHN1cHBvcnRlZABTb2NrZXQgdHlwZSBub3Qgc3VwcG9ydGVkAE5vdCBzdXBwb3J0ZWQAUHJvdG9jb2wgZmFtaWx5IG5vdCBzdXBwb3J0ZWQAQWRkcmVzcyBmYW1pbHkgbm90IHN1cHBvcnRlZCBieSBwcm90b2NvbABBZGRyZXNzIG5vdCBhdmFpbGFibGUATmV0d29yayBpcyBkb3duAE5ldHdvcmsgdW5yZWFjaGFibGUAQ29ubmVjdGlvbiByZXNldCBieSBuZXR3b3JrAENvbm5lY3Rpb24gYWJvcnRlZABObyBidWZmZXIgc3BhY2UgYXZhaWxhYmxlAFNvY2tldCBpcyBjb25uZWN0ZWQAU29ja2V0IG5vdCBjb25uZWN0ZWQAQ2Fubm90IHNlbmQgYWZ0ZXIgc29ja2V0IHNodXRkb3duAE9wZXJhdGlvbiBhbHJlYWR5IGluIHByb2dyZXNzAE9wZXJhdGlvbiBpbiBwcm9ncmVzcwBTdGFsZSBmaWxlIGhhbmRsZQBSZW1vdGUgSS9PIGVycm9yAFF1b3RhIGV4Y2VlZGVkAE5vIG1lZGl1bSBmb3VuZABXcm9uZyBtZWRpdW0gdHlwZQBNdWx0aWhvcCBhdHRlbXB0ZWQAUmVxdWlyZWQga2V5IG5vdCBhdmFpbGFibGUAS2V5IGhhcyBleHBpcmVkAEtleSBoYXMgYmVlbiByZXZva2VkAEtleSB3YXMgcmVqZWN0ZWQgYnkgc2VydmljZQAC/wAEZAAgAAAE//8QAAEAAQABAP//Af8B//////8B/wH/Af8B/wH/Af8B/wH//////wr/IAD//wP/Af8E/x4AAAEF//////9jAAAIYwDoAwIAAAD//////wAAAAH/Af//////////////"); base64DecodeToExistingUint8Array(bufferView, 74793, "BA=="); base64DecodeToExistingUint8Array(bufferView, 74806, "Af8B//////8AASAABACAAAAI//8B/wH/////////Af8G/wf/CP8J//////+8ArwCAQD//wEAAQD//wAA//////////8="); base64DecodeToExistingUint8Array(bufferView, 74890, "FA=="); base64DecodeToExistingUint8Array(bufferView, 74922, "//8BAAr///////////8B/wH/AAAAAAAAAf8B/wH/"); base64DecodeToExistingUint8Array(bufferView, 74970, "Af8AAAAAAAAB/wH/AQAAAAEAAAAB//////8AAAAAAf///wAAAAD/////////////KAAK//////8BAAr/////AP//////////"); base64DecodeToExistingUint8Array(bufferView, 75142, "Af8B////AQD//////////////////wr//////wz/Df8="); base64DecodeToExistingUint8Array(bufferView, 75184, "AwAAADQAAAAAAgAAAAAAAKkFAABUegAAfQAAAH4AAAB/AAAAgA=="); base64DecodeToExistingUint8Array(bufferView, 75240, "gQAAAIIAAACDAAAAhAAAAIUAAACGAAAAhwAAAIgAAAADAAAANAAAAAACAAAAAAAAbzYAAFh6AAB9AAAAfgAAAH8AAACA"); base64DecodeToExistingUint8Array(bufferView, 75328, "gQAAAIIAAACDAAAAhAAAAIUAAACGAAAAhwAAAIgAAAADAAAANAAAAAACAAAAAAAAWDcAAFx6AAB9AAAAfgAAAH8AAACA"); base64DecodeToExistingUint8Array(bufferView, 75416, "gQAAAIIAAACDAAAAhAAAAIUAAACGAAAAhwAAAIgAAAADAAAANAAAAAACAAAAAAAAUy4AAFR6AAB9AAAAfgAAAH8AAACA"); base64DecodeToExistingUint8Array(bufferView, 75504, "gQAAAIIAAACDAAAAhAAAAIUAAACGAAAAhwAAAIgAAAAAAABAAAAAAAEAAAABAAABAAEAAP7//38AAAAAsAQAACgAAAAAAAE="); base64DecodeToExistingUint8Array(bufferView, 75736, "FA=="); base64DecodeToExistingUint8Array(bufferView, 75748, "+g=="); base64DecodeToExistingUint8Array(bufferView, 75795, "QA=="); base64DecodeToExistingUint8Array(bufferView, 75812, "/v//f////38="); base64DecodeToExistingUint8Array(bufferView, 75844, "Bw=="); base64DecodeToExistingUint8Array(bufferView, 75856, "iSwAAJ4AAAAAAAAAJTUAAJ8AAAAAAAAAcxEAAKAAAAAAAAAAezoAAKEAAAAAAAAAFg4AAKIAAAAAAAAAAA4AAKMAAAAAAAAA/zMAAKQAAAAAAAAAoi0AAKUAAAAAAAAA3EAAAKYAAAAAAAAA20A="); base64DecodeToExistingUint8Array(bufferView, 75976, "A1w="); base64DecodeToExistingUint8Array(bufferView, 75988, "ijMAAKcAAAAAAAAAiTM="); base64DecodeToExistingUint8Array(bufferView, 76012, "+ls="); base64DecodeToExistingUint8Array(bufferView, 76024, "oToAAKgAAAAAAAAA9TM="); base64DecodeToExistingUint8Array(bufferView, 76048, "yy4AAKkAAAAAAAAAbgQAAKoAAAAAAAAAHiQAAKsAAAAAAAAAGCQAAKwAAAAAAAAAGSgAAK0AAAAAAAAAizsAAK4AAAAAAAAANCcAAK8AAAAAAAAALScAALAAAAAAAAAAOSc="); base64DecodeToExistingUint8Array(bufferView, 76156, "RTIAALEAAAAAAAAA0i4AALIAAAAAAAAA+g0AALMAAAAAAAAAqC0="); base64DecodeToExistingUint8Array(bufferView, 76216, "7yYAAOYmAADzJgAA+mEAAAIAAAAAAAAAAAQAAAAAAADkRgAAAAAAAMgAAAAAAAAAyQAAAMoAAADLAAAAzAAAAM0AAADOAAAAzwAAANAAAAAAAAAA0QAAANI="); base64DecodeToExistingUint8Array(bufferView, 76320, "O0gAABBSAADISQAAwUwAAGtPAACsSQ=="); base64DecodeToExistingUint8Array(bufferView, 76352, "AgAAAAFIxAABAAAAAAAAAOg="); base64DecodeToExistingUint8Array(bufferView, 76384, "kAYAAAAAAAACAAAAAUjEAAMAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76424, "CzYAAAAAAAACAAAAAUjEAAIAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76464, "CCMAAAAAAAABAAAAAUjEAAQAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76504, "JQQAAAAAAAABAAAAASCA"); base64DecodeToExistingUint8Array(bufferView, 76528, "6Q=="); base64DecodeToExistingUint8Array(bufferView, 76544, "hz0AAAAAAAABAAAAASCA"); base64DecodeToExistingUint8Array(bufferView, 76568, "6g=="); base64DecodeToExistingUint8Array(bufferView, 76584, "bQ0AAAAAAAABAAAAAQzAAGMAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76624, "EAUAAAAAAAACAAAAAQzAAGMAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76664, "ljoAAAAAAAABAAAAAQzAAGMAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 76704, "EgUAAAAAAAABAAAAAQiAAAEAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76744, "Py0AAAAAAAACAAAAAQiAAAEAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76784, "Py0AAAAAAAABAAAAAQiAAAIAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76824, "OS0AAAAAAAACAAAAAQiAAAIAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76864, "OS0AAAAAAAABAAAAAQiAAAMAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76904, "QC0AAAAAAAACAAAAAQiAAAMAAAAAAAAA6w=="); base64DecodeToExistingUint8Array(bufferView, 76944, "QC0AAAAAAAD9/wAAIQiA"); base64DecodeToExistingUint8Array(bufferView, 76968, "7A=="); base64DecodeToExistingUint8Array(bufferView, 76984, "YCwAAAAAAAABAAAAIRCACAAAAAAAAAAA7QAAAO4AAADvAAAAAAAAAGAsAAAAAAAA/f8AACEIgAABAAAAAAAAAOw="); base64DecodeToExistingUint8Array(bufferView, 77064, "TwYAAAAAAAABAAAAIRCACAEAAAAAAAAA7QAAAO4AAADvAAAAAAAAAE8GAAAAAAAAAQAAAIEIgA=="); base64DecodeToExistingUint8Array(bufferView, 77128, "8A=="); base64DecodeToExistingUint8Array(bufferView, 77144, "tDEAAAAAAAABAAAAgQiQ"); base64DecodeToExistingUint8Array(bufferView, 77168, "8Q=="); base64DecodeToExistingUint8Array(bufferView, 77184, "JjYAAAAAAAABAAAAQQiA"); base64DecodeToExistingUint8Array(bufferView, 77208, "8g=="); base64DecodeToExistingUint8Array(bufferView, 77224, "NzAAAAAAAAABAAAAwQiA"); base64DecodeToExistingUint8Array(bufferView, 77248, "8w=="); base64DecodeToExistingUint8Array(bufferView, 77264, "HDAAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77288, "9A=="); base64DecodeToExistingUint8Array(bufferView, 77304, "+yIAAAAAAAD//wAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77328, "9Q=="); base64DecodeToExistingUint8Array(bufferView, 77344, "rTEAAAAAAAD//wAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77368, "9Q=="); base64DecodeToExistingUint8Array(bufferView, 77384, "LA4AAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77408, "9g=="); base64DecodeToExistingUint8Array(bufferView, 77424, "yjkAAAAAAAD//wAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77448, "9w=="); base64DecodeToExistingUint8Array(bufferView, 77464, "pCYAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77488, "+A=="); base64DecodeToExistingUint8Array(bufferView, 77504, "bBcAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77528, "+Q=="); base64DecodeToExistingUint8Array(bufferView, 77544, "qDoAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77568, "+Q=="); base64DecodeToExistingUint8Array(bufferView, 77584, "qDoAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77608, "+g=="); base64DecodeToExistingUint8Array(bufferView, 77624, "AiUAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77648, "+w=="); base64DecodeToExistingUint8Array(bufferView, 77664, "UiQAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77688, "/A=="); base64DecodeToExistingUint8Array(bufferView, 77704, "7wUAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77728, "/Q=="); base64DecodeToExistingUint8Array(bufferView, 77744, "7QUAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77768, "/Q=="); base64DecodeToExistingUint8Array(bufferView, 77784, "7QUAAAAAAAD9/wAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77808, "/g=="); base64DecodeToExistingUint8Array(bufferView, 77824, "OQ4AAAAAAAD8/wAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 77848, "/w=="); base64DecodeToExistingUint8Array(bufferView, 77864, "iw4AAAAAAAACAAAAAQjA"); base64DecodeToExistingUint8Array(bufferView, 77888, "6A=="); base64DecodeToExistingUint8Array(bufferView, 77904, "0S0="); base64DecodeToExistingUint8Array(bufferView, 77916, "AQCA"); base64DecodeToExistingUint8Array(bufferView, 77929, "AQ=="); base64DecodeToExistingUint8Array(bufferView, 77944, "Ky0AAAAAAAABAAAAAQCA"); base64DecodeToExistingUint8Array(bufferView, 77968, "AQE="); base64DecodeToExistingUint8Array(bufferView, 77984, "w0YAAAAAAAACAAAAIQiA"); base64DecodeToExistingUint8Array(bufferView, 78008, "AgE="); base64DecodeToExistingUint8Array(bufferView, 78024, "5DE="); base64DecodeToExistingUint8Array(bufferView, 78036, "ASCA"); base64DecodeToExistingUint8Array(bufferView, 78048, "6A=="); base64DecodeToExistingUint8Array(bufferView, 78064, "BSs="); base64DecodeToExistingUint8Array(bufferView, 78076, "ASCA"); base64DecodeToExistingUint8Array(bufferView, 78088, "AwE="); base64DecodeToExistingUint8Array(bufferView, 78104, "3zsAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78128, "BAE="); base64DecodeToExistingUint8Array(bufferView, 78144, "ATEAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78168, "BQE="); base64DecodeToExistingUint8Array(bufferView, 78184, "gzM="); base64DecodeToExistingUint8Array(bufferView, 78196, "AQCA"); base64DecodeToExistingUint8Array(bufferView, 78208, "BgE="); base64DecodeToExistingUint8Array(bufferView, 78224, "Bzs="); base64DecodeToExistingUint8Array(bufferView, 78236, "AQCA"); base64DecodeToExistingUint8Array(bufferView, 78248, "BwE="); base64DecodeToExistingUint8Array(bufferView, 78264, "Khc="); base64DecodeToExistingUint8Array(bufferView, 78276, "AQCA"); base64DecodeToExistingUint8Array(bufferView, 78288, "CAE="); base64DecodeToExistingUint8Array(bufferView, 78304, "JBcAAAAAAAADAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78328, "CQE="); base64DecodeToExistingUint8Array(bufferView, 78344, "OToAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78368, "CgE="); base64DecodeToExistingUint8Array(bufferView, 78384, "ukYAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78408, "CwE="); base64DecodeToExistingUint8Array(bufferView, 78424, "ASMAAAAAAAADAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78448, "CwE="); base64DecodeToExistingUint8Array(bufferView, 78464, "ASMAAAAAAAACAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78488, "CwE="); base64DecodeToExistingUint8Array(bufferView, 78504, "QTEAAAAAAAADAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 78528, "CwE="); base64DecodeToExistingUint8Array(bufferView, 78544, "QTEAAAAAAAABAAAAAQCA"); base64DecodeToExistingUint8Array(bufferView, 78568, "DAEAAA0BAAANAQAADgEAAAUtAAAAAAAAAQAAAAEAgA=="); base64DecodeToExistingUint8Array(bufferView, 78608, "DAEAAA8BAAAPAQAADgEAAG0uAAAAAAAAAQAAAAEAgA=="); base64DecodeToExistingUint8Array(bufferView, 78648, "DAEAABABAAAQAQAADgEAAPgw"); base64DecodeToExistingUint8Array(bufferView, 78676, "AQGACAAAAAAAAAAAEQEAABIBAAASAQAAEwEAAGQKAAAAAAAAAQAAAAEAgAgAAAAAAAAAABEBAAASAQAAEgEAABMBAABkCgAAAAAAAAEAAAABAIA="); base64DecodeToExistingUint8Array(bufferView, 78768, "FAEAABUBAAAWAQAAFwEAADMOAAAAAAAAAgAAAAEAgA=="); base64DecodeToExistingUint8Array(bufferView, 78808, "FAEAABUBAAAWAQAAFwEAADMOAAAAAAAAAgAAAAEAgA=="); base64DecodeToExistingUint8Array(bufferView, 78848, "FAEAABUBAAAWAQAAFwEAAHoxAAAAAAAAAgAAAA0IgAC4egAAAAAAACs="); base64DecodeToExistingUint8Array(bufferView, 78904, "tUYAAAAAAAACAAAABQiAALx6AAAAAAAAKw=="); base64DecodeToExistingUint8Array(bufferView, 78944, "7TgAAAAAAAADAAAABQiAALx6AAAAAAAAKw=="); base64DecodeToExistingUint8Array(bufferView, 78984, "7TgAAAAAAAABAAAAAQiA"); base64DecodeToExistingUint8Array(bufferView, 79008, "GAE="); base64DecodeToExistingUint8Array(bufferView, 79024, "fywAAAAAAAD8/wAAAQjA"); base64DecodeToExistingUint8Array(bufferView, 79048, "6A=="); base64DecodeToExistingUint8Array(bufferView, 79064, "5TkAAAAAAAD8/wAAAQjAAAUAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 79104, "6zEAAAAAAAD8/wAAAQjAAAUAAAAAAAAA6A=="); base64DecodeToExistingUint8Array(bufferView, 79144, "7DEAAAAAAAAJAAAAAQiE"); base64DecodeToExistingUint8Array(bufferView, 79168, "GQE="); base64DecodeToExistingUint8Array(bufferView, 79184, "QysAAAAAAAAHAAAAAQiE"); base64DecodeToExistingUint8Array(bufferView, 79208, "GgE="); base64DecodeToExistingUint8Array(bufferView, 79224, "ujcAAAAAAAAHAAAAAQiE"); base64DecodeToExistingUint8Array(bufferView, 79248, "GwE="); base64DecodeToExistingUint8Array(bufferView, 79264, "pgkAAAAAAAADAAAAAQiE"); base64DecodeToExistingUint8Array(bufferView, 79288, "HAE="); base64DecodeToExistingUint8Array(bufferView, 79304, "MCsAAAAAAAACAAAAAQiE"); base64DecodeToExistingUint8Array(bufferView, 79328, "HQE="); base64DecodeToExistingUint8Array(bufferView, 79344, "rgU="); base64DecodeToExistingUint8Array(bufferView, 79364, "AQCB"); base64DecodeToExistingUint8Array(bufferView, 79376, "HgEAAB8BAAAfAQAAXgAAAP7F"); base64DecodeToExistingUint8Array(bufferView, 79404, "AQCB"); base64DecodeToExistingUint8Array(bufferView, 79416, "IAEAACEBAAAhAQAAXgAAAAnG"); base64DecodeToExistingUint8Array(bufferView, 79444, "AQCB"); base64DecodeToExistingUint8Array(bufferView, 79456, "IgEAACMBAAAjAQAAXgAAABTG"); base64DecodeToExistingUint8Array(bufferView, 79484, "AQCB"); base64DecodeToExistingUint8Array(bufferView, 79496, "JAEAACUBAAAlAQAAJgEAABnG"); base64DecodeToExistingUint8Array(bufferView, 79524, "AQCB"); base64DecodeToExistingUint8Array(bufferView, 79536, "JwEAACgBAAAoAQAAKQEAACbGAAAAAAAAAQAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79576, "KgEAACsBAAArAQAALAEAADDGAAAAAAAAAQAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79616, "LQEAAC4BAAAvAQAAMAEAACDOAAAAAAAAAgAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79656, "MQEAADIBAAAzAQAAXgAAACDHAAAAAAAAAQAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79696, "NAEAADUBAAAzAQAAXgAAACrHAAAAAAAAAQAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79736, "XgAAADMBAAAzAQAAXgAAADbGAAAAAAAAAgAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79776, "XgAAADMBAAAzAQAAXgAAADbGAAAAAAAAAwAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79816, "XgAAADMBAAAzAQAAXgAAADbGAAAAAAAAAQAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79856, "XgAAADMBAAAzAQAAXgAAADvGAAAAAAAAAgAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79896, "XgAAADMBAAAzAQAAXgAAADvGAAAAAAAAAwAAAAEAgQ=="); base64DecodeToExistingUint8Array(bufferView, 79936, "XgAAADMBAAAzAQAAXgAAADvG"); base64DecodeToExistingUint8Array(bufferView, 79968, "//8AAAEogAAYJwEAAAAAADYB"); base64DecodeToExistingUint8Array(bufferView, 80000, "iAUAAAAAAAD//wAAASiAABgnAQAAAAAANwE="); base64DecodeToExistingUint8Array(bufferView, 80040, "yDAAAAAAAAD//wAAASiAABgnAQAAAAAAOAE="); base64DecodeToExistingUint8Array(bufferView, 80080, "8DMAAAAAAAD//wAAASiAABgnAQAAAAAAOQE="); base64DecodeToExistingUint8Array(bufferView, 80120, "vTYAAAAAAAD//wAAASiAABgnAQAAAAAAOgE="); base64DecodeToExistingUint8Array(bufferView, 80160, "rDYAAAAAAAD//wAAASiAABgnAQAAAAAAOwE="); base64DecodeToExistingUint8Array(bufferView, 80200, "ozYAAAAAAAACAAAAASiAABgnAQAAAAAAPAE="); base64DecodeToExistingUint8Array(bufferView, 80240, "8zE="); base64DecodeToExistingUint8Array(bufferView, 80252, "ASCA"); base64DecodeToExistingUint8Array(bufferView, 80264, "PQE="); base64DecodeToExistingUint8Array(bufferView, 80280, "tTY="); base64DecodeToExistingUint8Array(bufferView, 80292, "ASCA"); base64DecodeToExistingUint8Array(bufferView, 80304, "PgE="); base64DecodeToExistingUint8Array(bufferView, 80320, "/SY="); base64DecodeToExistingUint8Array(bufferView, 80332, "ASCA"); base64DecodeToExistingUint8Array(bufferView, 80344, "PwE="); base64DecodeToExistingUint8Array(bufferView, 80360, "6DMAAAAAAAABAAAAAYiAAQAAAAAAAAAAQAE="); base64DecodeToExistingUint8Array(bufferView, 80400, "MygAAAAAAAABAAAAAYiAAAgAAAAAAAAAQAE="); base64DecodeToExistingUint8Array(bufferView, 80440, "00YAAAAAAAD//wAAAQiQAQAAAAAAAAAAQQE="); base64DecodeToExistingUint8Array(bufferView, 80480, "cQUAAAAAAAD//wAAAQiQAQgAAAAAAAAAQQE="); base64DecodeToExistingUint8Array(bufferView, 80520, "fAUAAAAAAAABAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 80544, "QgE="); base64DecodeToExistingUint8Array(bufferView, 80560, "CjAAAAAAAAACAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 80584, "QgE="); base64DecodeToExistingUint8Array(bufferView, 80600, "CjAAAAAAAAABAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 80624, "QwE="); base64DecodeToExistingUint8Array(bufferView, 80640, "hSgAAAAAAAD//wAAAYiAAQAAAAAAAAAARAE="); base64DecodeToExistingUint8Array(bufferView, 80680, "1g0AAAAAAAD//wAAAYiAAAgAAAAAAAAARAE="); base64DecodeToExistingUint8Array(bufferView, 80720, "4w0AAAAAAAACAAAAAYiAAQEAAAAAAAAARAE="); base64DecodeToExistingUint8Array(bufferView, 80760, "61UAAAAAAAACAAAAAYiAAAIAAAAAAAAARAE="); base64DecodeToExistingUint8Array(bufferView, 80800, "51UAAAAAAAD//wAAAYiQAQAAAAAAAAAARQE="); base64DecodeToExistingUint8Array(bufferView, 80840, "+QkAAAAAAAD//wAAAYiQAAgAAAAAAAAARQE="); base64DecodeToExistingUint8Array(bufferView, 80880, "BQoAAAAAAAD//wAAAQiQAQAAAAAAAAAARgE="); base64DecodeToExistingUint8Array(bufferView, 80920, "vQ0AAAAAAAD//wAAAQiQAQgAAAAAAAAARgE="); base64DecodeToExistingUint8Array(bufferView, 80960, "yQ0AAAAAAAACAAAAAYiAAQAAAAAAAAAARwE="); base64DecodeToExistingUint8Array(bufferView, 81000, "ZTAAAAAAAAACAAAAAYiAAAgAAAAAAAAARwE="); base64DecodeToExistingUint8Array(bufferView, 81040, "cDAAAAAAAAABAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81064, "SAE="); base64DecodeToExistingUint8Array(bufferView, 81080, "EAQAAAAAAAACAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81104, "SAE="); base64DecodeToExistingUint8Array(bufferView, 81120, "EAQAAAAAAAABAAAAAQiQAQAAAAAAAAAASQE="); base64DecodeToExistingUint8Array(bufferView, 81160, "fjMAAAAAAAD//wAAAYiAAQAAAAAAAAAAQAE="); base64DecodeToExistingUint8Array(bufferView, 81200, "oDIAAAAAAAD//wAAAYiAAAgAAAAAAAAAQAE="); base64DecodeToExistingUint8Array(bufferView, 81240, "rDIAAAAAAAD//wAAAYiQAQAAAAAAAAAASgE="); base64DecodeToExistingUint8Array(bufferView, 81280, "JjoAAAAAAAD//wAAAYiQAAgAAAAAAAAASgE="); base64DecodeToExistingUint8Array(bufferView, 81320, "MzoAAAAAAAD//wAAAYiQAQQAAAAAAAAARQE="); base64DecodeToExistingUint8Array(bufferView, 81360, "7QwAAAAAAAD//wAAAYiQAAwAAAAAAAAARQE="); base64DecodeToExistingUint8Array(bufferView, 81400, "9gwAAAAAAAABAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81424, "SwE="); base64DecodeToExistingUint8Array(bufferView, 81440, "TzYAAAAAAAACAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81464, "SwE="); base64DecodeToExistingUint8Array(bufferView, 81480, "TzYAAAAAAAABAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81504, "TAE="); base64DecodeToExistingUint8Array(bufferView, 81520, "mzsAAAAAAAACAAAAAYiA"); base64DecodeToExistingUint8Array(bufferView, 81544, "TAE="); base64DecodeToExistingUint8Array(bufferView, 81560, "mzsAAAAAAAABAAAAAQiQAQAAAAAAAAAATQEAAE4BAABPAQAAUAEAAE4FAAAAAAAAAQAAAAEIkAEIAAAAAAAAAE0BAABOAQAATwEAAFABAABfBQAAAAAAAAIAAAABCJABAAAAAAAAAABRAQAAUgEAAFMBAABQAQAAmA0AAAAAAAACAAAAAQiQAQgAAAAAAAAAUQEAAFIBAABTAQAAUAEAAKoN"); base64DecodeToExistingUint8Array(bufferView, 81736, "qAEAAKkBAACqAQAAAAAAAKsBAACsAQAArQEAAK4BAACvAQAAsAEAALEB"); base64DecodeToExistingUint8Array(bufferView, 81836, "qAEAAKkBAACqAQAAAAAAALIBAACsAQAArQEAAK4BAACvAQAAsAEAALEB"); base64DecodeToExistingUint8Array(bufferView, 81928, "BQ=="); base64DecodeToExistingUint8Array(bufferView, 81940, "5gE="); base64DecodeToExistingUint8Array(bufferView, 81964, "5wEAAOgBAAD4QwEAAAQ="); base64DecodeToExistingUint8Array(bufferView, 81988, "AQ=="); base64DecodeToExistingUint8Array(bufferView, 82004, "/////wo="); base64DecodeToExistingUint8Array(bufferView, 82072, "CEABAAAAAAAF"); base64DecodeToExistingUint8Array(bufferView, 82092, "6QE="); base64DecodeToExistingUint8Array(bufferView, 82116, "5wEAAOoBAAAISAE="); base64DecodeToExistingUint8Array(bufferView, 82140, "Ag=="); base64DecodeToExistingUint8Array(bufferView, 82156, "//////////8="); base64DecodeToExistingUint8Array(bufferView, 82224, "oEABAABKUQ=="); } var scratchBuffer = new ArrayBuffer(16); var i32ScratchView = new Int32Array(scratchBuffer); var f32ScratchView = new Float32Array(scratchBuffer); var f64ScratchView = new Float64Array(scratchBuffer); function wasm2js_scratch_load_i32(index) { return i32ScratchView[index]; } function wasm2js_scratch_store_i32(index, value) { i32ScratchView[index] = value; } function wasm2js_scratch_load_f64() { return f64ScratchView[0]; } function wasm2js_scratch_store_f64(value) { f64ScratchView[0] = value; } function wasm2js_memory_fill(dest, value, size) { dest = dest >>> 0; size = size >>> 0; if (dest + size > bufferView.length) throw "trap: invalid memory.fill"; bufferView.fill(value, dest, dest + size); } function wasm2js_memory_copy(dest, source, size) { // TODO: traps on invalid things bufferView.copyWithin(dest, source, source + size); } function wasm2js_trap() { throw new Error('abort'); } function asmFunc(imports) { var buffer = new ArrayBuffer(22151168); var HEAP8 = new Int8Array(buffer); var HEAP16 = new Int16Array(buffer); var HEAP32 = new Int32Array(buffer); var HEAPU8 = new Uint8Array(buffer); var HEAPU16 = new Uint16Array(buffer); var HEAPU32 = new Uint32Array(buffer); var HEAPF32 = new Float32Array(buffer); var HEAPF64 = new Float64Array(buffer); var Math_imul = Math.imul; var Math_fround = Math.fround; var Math_abs = Math.abs; var Math_clz32 = Math.clz32; var Math_min = Math.min; var Math_max = Math.max; var Math_floor = Math.floor; var Math_ceil = Math.ceil; var Math_trunc = Math.trunc; var Math_sqrt = Math.sqrt; var env = imports.env; var fimport$0 = env.__assert_fail; var fimport$1 = env.__syscall_faccessat; var wasi_snapshot_preview1 = imports.wasi_snapshot_preview1; var fimport$2 = wasi_snapshot_preview1.fd_close; var fimport$3 = env.emscripten_date_now; var fimport$4 = env.__syscall_fchmod; var fimport$5 = env.__syscall_chmod; var fimport$6 = env.__syscall_fchown32; var fimport$7 = env.__syscall_fcntl64; var fimport$8 = env.__syscall_fstat64; var fimport$9 = env.__syscall_stat64; var fimport$10 = env.__syscall_newfstatat; var fimport$11 = env.__syscall_lstat64; var fimport$12 = wasi_snapshot_preview1.fd_sync; var fimport$13 = env.__syscall_getcwd; var fimport$14 = wasi_snapshot_preview1.environ_sizes_get; var fimport$15 = wasi_snapshot_preview1.environ_get; var fimport$16 = env.__syscall_mkdirat; var fimport$17 = env.emscripten_get_now; var fimport$18 = env._tzset_js; var fimport$19 = env.__syscall_openat; var fimport$20 = wasi_snapshot_preview1.fd_read; var fimport$21 = env.__syscall_readlinkat; var fimport$22 = env.__syscall_rmdir; var fimport$23 = wasi_snapshot_preview1.fd_write; var fimport$24 = env.emscripten_get_heap_max; var fimport$25 = env.__syscall_unlinkat; var fimport$26 = env.__syscall_utimensat; var fimport$27 = wasi_snapshot_preview1.fd_fdstat_get; var fimport$28 = env._abort_js; var fimport$29 = env.emscripten_resize_heap; var fimport$30 = env.__handle_stack_overflow; var fimport$31 = env.__syscall_ftruncate64; var fimport$32 = wasi_snapshot_preview1.fd_seek; var fimport$33 = env._localtime_js; var fimport$34 = env._munmap_js; var fimport$35 = env._mmap_js; var global$0 = 5327360; var global$1 = 0; var global$2 = 0; var global$4 = 0; var global$5 = 0; var __wasm_intrinsics_temp_i64 = 0; var __wasm_intrinsics_temp_i64$hi = 0; var i64toi32_i32$HIGH_BITS = 0; // EMSCRIPTEN_START_FUNCS ; function $0() { var $0_1 = 0, $1_1 = 0, $2_1 = 0; $2120(); $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; block : { if (fimport$14($0_1 + 12 | 0, $0_1 + 8 | 0) | 0) { break block } $1_1 = $2109((HEAP32[$0_1 + 12 >> 2] << 2) + 4 | 0); HEAP32[20692] = $1_1; if (!$1_1) { break block } $1_1 = $2109(HEAP32[$0_1 + 8 >> 2]); if ($1_1) { $2_1 = HEAP32[20692]; HEAP32[$2_1 + (HEAP32[$0_1 + 12 >> 2] << 2) >> 2] = 0; if (!(fimport$15($2_1 | 0, $1_1 | 0) | 0)) { break block } } HEAP32[20692] = 0; } $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1($0_1) { $2(21, $0_1, 13358); return 21; } function $2($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 8 >> 2] = 24585; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $2_1; $64($0_1, 18347, $3); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $4($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (($2_1 | 0) != ($3 | 0)) { $1_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($2_1 << 4) | 0) + 4 >> 2]; if ($1_1) { HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] = HEAP32[$1_1 >> 2] } $2_1 = $2_1 + 1 | 0; continue; } break; }; } function $5($0_1, $1_1) { if (!(HEAPU8[$1_1 + 10 | 0] | !$1_1)) { $9($0_1, HEAP32[$1_1 + 28 >> 2]); $10($0_1, HEAP32[$1_1 >> 2]); $10($0_1, HEAP32[$1_1 + 4 >> 2]); $11($0_1, HEAP32[$1_1 + 12 >> 2]); $12($0_1, HEAP32[$1_1 + 16 >> 2]); $13($0_1, $1_1); } } function $6($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!$1_1) { break block } if (!HEAP32[$0_1 + 528 >> 2]) { $2_1 = HEAP32[$1_1 + 24 >> 2] - 1 | 0; HEAP32[$1_1 + 24 >> 2] = $2_1; if ($2_1) { break block } } $2_1 = $0_1; $3 = $1_1; $0_1 = HEAP32[$3 + 8 >> 2]; while (1) { if ($0_1) { $1_1 = HEAP32[$0_1 + 20 >> 2]; if (!(HEAP32[$2_1 + 528 >> 2] | HEAPU8[$3 + 43 | 0] == 1)) { $395(HEAP32[$0_1 + 24 >> 2] + 24 | 0, HEAP32[$0_1 >> 2], 0) } $704($2_1, $0_1); $0_1 = $1_1; continue; } break; }; block5 : { block4 : { switch (HEAPU8[$3 + 43 | 0]) { case 0: $0_1 = HEAP32[$3 + 48 >> 2]; while (1) { if (!$0_1) { break block5 } block6 : { if (HEAP32[$2_1 + 528 >> 2]) { break block6 } $1_1 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; block8 : { if ($4_1) { HEAP32[$4_1 + 12 >> 2] = $1_1; break block8; } $395(HEAP32[$3 + 60 >> 2] + 56 | 0, HEAP32[($1_1 ? $1_1 : $0_1) + 8 >> 2], $1_1); $1_1 = HEAP32[$0_1 + 12 >> 2]; } if (!$1_1) { break block6 } HEAP32[$1_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2]; } $736($2_1, HEAP32[$0_1 + 28 >> 2]); $736($2_1, HEAP32[$0_1 + 32 >> 2]); $1_1 = HEAP32[$0_1 + 4 >> 2]; $13($2_1, $0_1); $0_1 = $1_1; continue; }; case 1: if (!HEAP32[$2_1 + 528 >> 2]) { $683(0, $3) } if (!HEAP32[$3 + 48 >> 2]) { break block5 } $0_1 = 0; while (1) { if (($0_1 | 0) < HEAP32[$3 + 44 >> 2]) { if (($0_1 | 0) != 1) { $10($2_1, HEAP32[HEAP32[$3 + 48 >> 2] + ($0_1 << 2) >> 2]) } $0_1 = $0_1 + 1 | 0; continue; } break; }; $10($2_1, HEAP32[$3 + 48 >> 2]); break block5; default: break block4; }; } $789($2_1, HEAP32[$3 + 44 >> 2]); } $848($2_1, $3); $10($2_1, HEAP32[$3 >> 2]); $10($2_1, HEAP32[$3 + 12 >> 2]); $358($2_1, HEAP32[$3 + 16 >> 2]); $13($2_1, $3); } } function $7($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 116 >> 2]; if ($1_1) { $15($1_1, HEAPU16[$0_1 + 146 >> 1] << 1); $16($2_1, HEAP32[$0_1 + 116 >> 2]); } $1_1 = HEAP32[$0_1 + 232 >> 2]; while (1) { if ($1_1) { $3 = HEAP32[$1_1 + 24 >> 2]; $17($2_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); $13($2_1, $1_1); $1_1 = $3; continue; } break; }; block2 : { if (!HEAPU8[$0_1 + 151 | 0]) { break block2 } $15(HEAP32[$0_1 + 100 >> 2], HEAP16[$0_1 + 16 >> 1]); $1_1 = HEAP32[$0_1 + 128 >> 2]; if ($1_1) { $16($2_1, $1_1) } $1_1 = HEAP32[$0_1 + 212 >> 2]; if (!$1_1) { break block2 } $16($2_1, $1_1); } $17($2_1, HEAP32[$0_1 + 104 >> 2], HEAP32[$0_1 + 108 >> 2]); $1_1 = HEAP32[$0_1 + 200 >> 2]; if ($1_1) { $16($2_1, $1_1) } $10($2_1, HEAP32[$0_1 + 204 >> 2]); $1_1 = HEAP32[$0_1 + 208 >> 2]; while (1) { if ($1_1) { $3 = HEAP32[$1_1 >> 2]; $13($2_1, $1_1); $1_1 = $3; continue; } break; }; block6 : { if (HEAP32[$2_1 + 528 >> 2]) { break block6 } $3 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$3 >> 2] = $1_1; if (!$1_1) { break block6 } HEAP32[$1_1 + 4 >> 2] = $3; } $16($2_1, $0_1); } function $8($0_1) { var $1_1 = 0; while (1) { if ($0_1) { $1_1 = $1_1 + 1 | 0; $0_1 = HEAP32[$0_1 >> 2]; continue; } break; }; return $1_1; } function $9($0_1, $1_1) { var $2_1 = 0; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 + 40 >> 2]; $11($0_1, HEAP32[$1_1 + 20 >> 2]); $358($0_1, HEAP32[$1_1 + 24 >> 2]); $789($0_1, HEAP32[$1_1 + 8 >> 2]); $12($0_1, HEAP32[$1_1 + 28 >> 2]); $849($0_1, HEAP32[$1_1 + 32 >> 2]); $794($0_1, HEAP32[$1_1 + 16 >> 2]); $10($0_1, HEAP32[$1_1 + 36 >> 2]); $13($0_1, $1_1); $1_1 = $2_1; continue; } break; }; } function $10($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if ($1_1) { $13($0_1, $1_1) } } function $11($0_1, $1_1) { if ($1_1) { $790($0_1, $1_1) } } function $12($0_1, $1_1) { var $2_1 = 0, $3 = 0; if ($1_1) { $3 = $1_1 + 4 | 0; while (1) { if (!(HEAP32[$1_1 >> 2] <= ($2_1 | 0))) { $10($0_1, HEAP32[($2_1 << 2) + $3 >> 2]); $2_1 = $2_1 + 1 | 0; continue; } break; }; $16($0_1, $1_1); } } function $13($0_1, $1_1) { block : { if (!$0_1) { break block } block1 : { if (HEAPU32[$0_1 + 356 >> 2] <= $1_1 >>> 0) { break block1 } if ($1_1 >>> 0 >= HEAPU32[$0_1 + 348 >> 2]) { HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 344 >> 2]; HEAP32[$0_1 + 344 >> 2] = $1_1; return; } if (HEAPU32[$0_1 + 352 >> 2] > $1_1 >>> 0) { break block1 } HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 336 >> 2]; HEAP32[$0_1 + 336 >> 2] = $1_1; return; } if (!HEAP32[$0_1 + 528 >> 2]) { break block } $441($0_1, $1_1); return; } $24($1_1); } function $15($0_1, $1_1) { var $2_1 = 0; block : { if (!$0_1 | !$1_1) { break block } $1_1 = Math_imul($1_1, 40) + $0_1 | 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; if (!HEAP32[$2_1 + 528 >> 2]) { while (1) { block4 : { block3 : { if (HEAPU8[$0_1 + 17 | 0] & 144) { $204($0_1); break block3; } if (!HEAP32[$0_1 + 24 >> 2]) { break block4 } $16($2_1, HEAP32[$0_1 + 32 >> 2]); HEAP32[$0_1 + 24 >> 2] = 0; } HEAP16[$0_1 + 16 >> 1] = 0; } $0_1 = $0_1 + 40 | 0; if ($1_1 >>> 0 > $0_1 >>> 0) { continue } break block; } } while (1) { if (HEAP32[$0_1 + 24 >> 2]) { $10($2_1, HEAP32[$0_1 + 32 >> 2]) } $0_1 = $0_1 + 40 | 0; if ($1_1 >>> 0 > $0_1 >>> 0) { continue } break; }; } } function $16($0_1, $1_1) { block : { if (HEAPU32[$0_1 + 356 >> 2] <= $1_1 >>> 0) { break block } if ($1_1 >>> 0 >= HEAPU32[$0_1 + 348 >> 2]) { HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 344 >> 2]; HEAP32[$0_1 + 344 >> 2] = $1_1; return; } if (HEAPU32[$0_1 + 352 >> 2] > $1_1 >>> 0) { break block } HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 336 >> 2]; HEAP32[$0_1 + 336 >> 2] = $1_1; return; } if (HEAP32[$0_1 + 528 >> 2]) { $441($0_1, $1_1); return; } $24($1_1); } function $17($0_1, $1_1, $2_1) { var $3 = 0; if ($1_1) { $2_1 = Math_imul($2_1, 20) + $1_1 | 0; while (1) { $3 = HEAP8[$2_1 - 19 | 0]; if (($3 | 0) <= -6) { $329($0_1, $3, HEAP32[$2_1 - 4 >> 2]) } $2_1 = $2_1 - 20 | 0; if (($2_1 | 0) != ($1_1 | 0)) { continue } break; }; $16($0_1, $1_1); } } function $18($0_1) { var $1_1 = 0; block : { if ($19()) { break block } $1_1 = 82320; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$0_1 | !$1_1) { break block } if (!$2073($0_1, HEAP32[$1_1 + 16 >> 2])) { break block } $1_1 = $1_1 + 12 | 0; continue; }; } return $1_1; } function $19() { var $0_1 = 0, $1_1 = 0, $2_1 = 0, $3 = 0; block5 : { block : { if (HEAP32[18938]) { break block } HEAP32[18940] = 1; if (!HEAP32[18941]) { if (!HEAP32[18894]) { $20() } HEAP32[20640] = 8; if (!(!(!HEAP32[18932] | HEAP32[18933] < 512) & HEAP32[18934] > 0)) { HEAP32[18932] = 0; HEAP32[18933] = 0; } $0_1 = FUNCTION_TABLE[HEAP32[18899]](HEAP32[18901]) | 0; if ($0_1) { break block5 } } HEAP32[18941] = 1; if (!HEAP32[18944]) { HEAP32[18944] = 8 } $2_1 = HEAP32[18943] + 1 | 0; HEAP32[18943] = $2_1; if (!(HEAP32[18938] | HEAP32[18939])) { HEAP32[18939] = 1; wasm2js_memory_fill(82468, 0, 92); $21(79152, 5); $21(79360, 15); $21(79968, 10); $21(80368, 34); $21(76352, 70); block11 : { if (!HEAP32[18942]) { $1_1 = HEAP32[18913]; if (!$1_1) { $22(); $1_1 = HEAP32[18913]; } $1_1 = FUNCTION_TABLE[$1_1 | 0](HEAP32[18912]) | 0; if ($1_1) { break block11 } } $1_1 = 1; HEAP32[18942] = 1; $0_1 = $23(10); if (!$0_1) { $1_1 = 7; break block11; } $24($0_1); $0_1 = 0; while (1) { if (($0_1 | 0) != 4) { $26(Math_imul($0_1, 88) + 75184 | 0, !$0_1); $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP32[19052] = $1997(19609); HEAP32[19053] = $1997(19616); $3 = $18(0); if (!$3) { break block11 } $0_1 = HEAP32[$3 + 4 >> 2]; HEAP32[19063] = $3; HEAP32[19059] = $0_1 >>> 0 <= 12 ? 12 : $0_1; $1_1 = $26(76232, 0); if ($1_1) { break block11 } if (HEAP32[20665]) { $1_1 = HEAP32[18932]; $2_1 = $1_1 ? HEAP32[18934] : 0; HEAP32[20675] = $2_1; HEAP32[20669] = $2_1; $3 = $2_1 ? HEAP32[18933] & -8 : 0; HEAP32[20668] = $3; HEAP32[20671] = $1_1; if (($2_1 | 0) <= 90) { $0_1 = (($2_1 | 0) / 10 | 0) + 1 | 0 } else { $0_1 = 10 } HEAP32[20670] = $0_1; HEAP32[20676] = 0; HEAP32[20674] = 0; $0_1 = 0; while (1) { if ($2_1) { HEAP32[$1_1 >> 2] = $0_1; HEAP32[20674] = $1_1; $2_1 = $2_1 - 1 | 0; $0_1 = $1_1; $1_1 = $3 + $0_1 | 0; continue; } break; }; HEAP32[20672] = $1_1; } $1_1 = 0; HEAP32[18938] = 1; } HEAP32[18939] = 0; $2_1 = HEAP32[18943]; } HEAP32[18943] = $2_1 - 1; if (($2_1 | 0) > 1) { break block } HEAP32[18944] = 0; } return $1_1; } HEAP32[20646] = 0; HEAP32[20647] = 0; HEAP32[20644] = 0; HEAP32[20645] = 0; HEAP32[20642] = 0; HEAP32[20643] = 0; HEAP32[20640] = 0; HEAP32[20641] = 0; return $0_1; } function $20() { var $0_1 = 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; HEAP32[$0_1 >> 2] = 53620; $374(4, $0_1); $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $21($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { if (!(($1_1 | 0) == ($4_1 | 0))) { $3 = Math_imul($4_1, 40) + $0_1 | 0; $2_1 = HEAP32[$3 + 32 >> 2]; $5_1 = ($48($2_1) + HEAP8[$2_1 | 0] | 0) % 23 | 0; $2_1 = $394($5_1, $2_1); block2 : { if ($2_1) { HEAP32[$3 + 12 >> 2] = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $3; break block2; } HEAP32[$3 + 12 >> 2] = 0; $2_1 = ($5_1 << 2) + 82468 | 0; HEAP32[$3 + 36 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = $3; } $4_1 = $4_1 + 1 | 0; continue; } break; }; } function $22() { var $0_1 = 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; HEAP32[$0_1 >> 2] = 53652; $374(18, $0_1); $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $23($0_1) { var $1_1 = 0; if (!($19() | ($0_1 | 0) <= 0)) { $1_1 = $30($0_1, 0) } return $1_1; } function $24($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; if ($0_1) { if (HEAP32[18886]) { $1_1 = FUNCTION_TABLE[HEAP32[18897]]($0_1) | 0; HEAP32[20560] = HEAP32[20560] - $1_1; HEAP32[20569] = HEAP32[20569] - 1; } FUNCTION_TABLE[HEAP32[18895]]($0_1); } } function $26($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = $19(); if (!$3) { __inlined_func$27$3 : { if (!$0_1) { break __inlined_func$27$3 } $2_1 = HEAP32[20580]; if (($0_1 | 0) == ($2_1 | 0)) { HEAP32[20580] = HEAP32[$0_1 + 12 >> 2]; break __inlined_func$27$3; } if (!$2_1) { break __inlined_func$27$3 } while (1) { block2 : { $4_1 = $2_1; $2_1 = HEAP32[$2_1 + 12 >> 2]; if (!$2_1) { break block2 } if (($0_1 | 0) != ($2_1 | 0)) { continue } } break; }; if (($0_1 | 0) != ($2_1 | 0)) { break __inlined_func$27$3 } HEAP32[$4_1 + 12 >> 2] = HEAP32[$0_1 + 12 >> 2]; } $2_1 = $1_1; $1_1 = HEAP32[20580]; if ($1_1 ? $2_1 : 1) { HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[20580] = $0_1; return $3; } HEAP32[$0_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2]; HEAP32[$1_1 + 12 >> 2] = $0_1; } return $3; } function $28($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = -1; $6_1 = -1; block : { if ($19()) { break block } $5_1 = HEAP32[20642]; $6_1 = HEAP32[20643]; if (($1_1 | 0) < 0) { break block } $2_1 = HEAP32[20644]; $3 = $2_1; $2_1 = HEAP32[20645]; $4_1 = $3 >>> 0 > $0_1 >>> 0 & ($2_1 | 0) >= ($1_1 | 0) | ($1_1 | 0) < ($2_1 | 0); $7_1 = !($0_1 | $1_1); $8_1 = $7_1 ? $3 : $4_1 ? $0_1 : $3; $4_1 = $7_1 ? $2_1 : $4_1 ? $1_1 : $2_1; $2_1 = !!$3 & ($2_1 | 0) >= 0 | ($2_1 | 0) > 0; $0_1 = $2_1 ? $8_1 : $0_1; HEAP32[20642] = $0_1; $1_1 = $2_1 ? $4_1 : $1_1; HEAP32[20643] = $1_1; $2_1 = HEAP32[20560]; HEAP32[20646] = (!!$0_1 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0) & (($1_1 | 0) <= 0 & $0_1 >>> 0 <= $2_1 >>> 0 | ($1_1 | 0) < 0); } i64toi32_i32$HIGH_BITS = $6_1; return $5_1; } function $29($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = -1; $4_1 = -1; block : { if ($19()) { break block } $3 = HEAP32[20644]; $4_1 = HEAP32[20645]; if (($1_1 | 0) < 0) { break block } HEAP32[20644] = $0_1; HEAP32[20645] = $1_1; $5_1 = HEAP32[20642]; $2_1 = HEAP32[20643]; if (!($5_1 >>> 0 > $0_1 >>> 0 & ($2_1 | 0) >= ($1_1 | 0) | ($1_1 | 0) < ($2_1 | 0))) { if ($2_1 | $5_1) { break block } } HEAP32[20642] = $0_1; HEAP32[20643] = $1_1; } i64toi32_i32$HIGH_BITS = $4_1; return $3; } function $30($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = $1_1 - 1 | 0; block6 : { $1_1 = $0_1 - 2147483392 | 0; $2_1 = $1_1 >>> 0 < 2147483904 ? $2_1 + 1 | 0 : $2_1; block : { if (($2_1 | 0) == -1 & $1_1 >>> 0 < 2147483905 | ($2_1 | 0) != -1) { break block } if (HEAP32[18886]) { $2_1 = FUNCTION_TABLE[HEAP32[18898]]($0_1) | 0; if (HEAPU32[20575] < $0_1 >>> 0) { HEAP32[20575] = $0_1 } $0_1 = HEAP32[20643]; $5_1 = $0_1; $3 = HEAP32[20642]; block3 : { if (!$3 & ($0_1 | 0) <= 0 | ($0_1 | 0) < 0) { break block3 } $1_1 = $3 - $2_1 | 0; $0_1 = HEAP32[20560]; $4_1 = $5_1; $5_1 = $2_1 >> 31; $3 = $4_1 - ($5_1 + ($2_1 >>> 0 > $3 >>> 0) | 0) | 0; if (($3 | 0) > 0) { $1_1 = 1 } else { $1_1 = $0_1 >>> 0 < $1_1 >>> 0 & ($3 | 0) >= 0 } if (!$1_1) { HEAP32[20646] = 1; $4_1 = HEAP32[20644]; $3 = HEAP32[20645]; if (!($4_1 | $3)) { break block3 } $1_1 = $4_1 - $2_1 | 0; $3 = $3 - (($2_1 >>> 0 > $4_1 >>> 0) + $5_1 | 0) | 0; if (($3 | 0) > 0) { $0_1 = 1 } else { $0_1 = $0_1 >>> 0 < $1_1 >>> 0 & ($3 | 0) >= 0 } if ($0_1) { break block3 } break block; } HEAP32[20646] = 0; } $1_1 = FUNCTION_TABLE[HEAP32[18894]]($2_1) | 0; if (!$1_1) { break block } $0_1 = (FUNCTION_TABLE[HEAP32[18897]]($1_1) | 0) + HEAP32[20560] | 0; HEAP32[20560] = $0_1; if (HEAPU32[20570] < $0_1 >>> 0) { HEAP32[20570] = $0_1 } $0_1 = HEAP32[20569] + 1 | 0; HEAP32[20569] = $0_1; if ($0_1 >>> 0 <= HEAPU32[20579]) { break block6 } HEAP32[20579] = $0_1; break block6; } $6_1 = FUNCTION_TABLE[HEAP32[18894]]($0_1) | 0; } return $6_1; } return $1_1; } function $31($0_1, $1_1) { var $2_1 = 0; if (!$19()) { $2_1 = $30($0_1, $1_1) } return $2_1; } function $32($0_1, $1_1) { var $2_1 = 0; if (!$19()) { $2_1 = $33($0_1, ($1_1 | 0) > 0 ? $1_1 : 0, 0) } return $2_1; } function $33($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; if (!$0_1) { return $30($1_1, $2_1) } if (!($1_1 | $2_1)) { $24($0_1); return 0; } block7 : { block2 : { if (!$2_1 & $1_1 >>> 0 > 2147483391 | $2_1) { break block2 } $6_1 = FUNCTION_TABLE[HEAP32[18897]]($0_1) | 0; $5_1 = FUNCTION_TABLE[HEAP32[18898]]($1_1) | 0; if (($6_1 | 0) == ($5_1 | 0)) { return $0_1 } if (HEAP32[18886]) { if (HEAPU32[20575] < $1_1 >>> 0) { HEAP32[20575] = $1_1 } $4_1 = $5_1 - $6_1 | 0; block6 : { if (($4_1 | 0) <= 0) { break block6 } $3 = HEAP32[20642]; $2_1 = $3 - $4_1 | 0; $1_1 = HEAP32[20560]; $3 = HEAP32[20643] - ($3 >>> 0 < $4_1 >>> 0) | 0; if (($3 | 0) > 0) { $2_1 = 1 } else { $2_1 = $1_1 >>> 0 < $2_1 >>> 0 & ($3 | 0) >= 0 } if ($2_1) { break block6 } $2_1 = HEAP32[20645]; $7_1 = $2_1; $3 = HEAP32[20644]; if (!$3 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0) { break block6 } $2_1 = $3 - $4_1 | 0; $3 = $7_1 - ($3 >>> 0 < $4_1 >>> 0) | 0; if (($3 | 0) < 0) { $1_1 = 1 } else { $1_1 = ($3 | 0) <= 0 & $1_1 >>> 0 >= $2_1 >>> 0 } if ($1_1) { break block2 } } $1_1 = FUNCTION_TABLE[HEAP32[18896]]($0_1, $5_1) | 0; if (!$1_1) { break block2 } $0_1 = FUNCTION_TABLE[HEAP32[18897]]($1_1) | 0; $0_1 = HEAP32[20560] + ($0_1 - $6_1 | 0) | 0; HEAP32[20560] = $0_1; if ($0_1 >>> 0 <= HEAPU32[20570]) { break block7 } HEAP32[20570] = $0_1; break block7; } $8_1 = FUNCTION_TABLE[HEAP32[18896]]($0_1, $5_1) | 0; } return $8_1; } return $1_1; } function $34($0_1, $1_1, $2_1) { var $3 = 0; if (!$19()) { $3 = $33($0_1, $1_1, $2_1) } return $3; } function $35($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0.0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0; $6_1 = global$0 - 176 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $4_1; $22_1 = HEAPU8[$0_1 + 21 | 0] & 2; block1 : { if (!$22_1) { break block1 } $21_1 = HEAP32[$2_1 >> 2]; $2_1 = $2_1 + 4 | 0; } $12_1 = $2_1; $26_1 = $6_1 + 56 | 0; $29_1 = $6_1 + 80 | 1; while (1) { block61 : { block138 : { block137 : { block150 : { block149 : { block4 : { $4_1 = HEAPU8[$1_1 | 0]; block3 : { if (($4_1 | 0) == 37) { $13_1 = $1_1; break block3; } $2_1 = $1_1; if (!$4_1) { break block4 } while (1) { block5 : { $13_1 = $2_1 + 1 | 0; $4_1 = HEAPU8[$2_1 + 1 | 0]; if (($4_1 | 0) == 37) { break block5 } $2_1 = $13_1; if ($4_1) { continue } } break; }; $36($0_1, $1_1, $13_1 - $1_1 | 0); $3 = $1_1; if (!HEAPU8[$13_1 | 0]) { break block4 } } block64 : { block63 : { block106 : { block74 : { block104 : { block105 : { block82 : { block78 : { block79 : { block80 : { block101 : { block83 : { block98 : { $5_1 = HEAPU8[$13_1 + 1 | 0]; if ($5_1) { $13_1 = $13_1 + 1 | 0; $7_1 = -1; $14 = 0; $15_1 = 0; $23_1 = 0; $17_1 = 0; $27 = 0; $20_1 = 0; $24_1 = 0; $16_1 = 0; $10_1 = $12_1; block9 : { while (1) { $2_1 = $5_1 << 24 >> 24; $9_1 = 1; block13 : { block20 : { block14 : { block11 : { block16 : { block19 : { block18 : { block12 : { block15 : { block8 : { block10 : { block7 : { block17 : { $1_1 = $5_1 & 255; switch ($1_1 - 32 | 0) { case 3: break block10; case 10: break block11; case 12: break block12; case 13: break block13; case 14: break block14; case 16: break block15; case 17: case 18: case 19: case 20: case 21: case 22: case 23: case 24: case 25: break block16; case 0: case 11: break block7; case 1: break block8; case 2: case 4: case 5: case 6: case 7: case 8: case 9: case 15: break block9; default: break block17; }; } if (($1_1 | 0) != 108) { break block9 } $2_1 = HEAPU8[$13_1 + 1 | 0]; if (($2_1 | 0) == 108) { break block18 } $14 = 1; $13_1 = $13_1 + 1 | 0; break block19; } $9_1 = $24_1; $20_1 = $5_1; break block13; } $27 = 1; break block20; } $17_1 = 1; break block20; } $23_1 = 1; break block20; } $15_1 = 44; break block20; } $14 = 2; $2_1 = HEAPU8[$13_1 + 2 | 0]; $13_1 = $13_1 + 2 | 0; } $2_1 = $2_1 << 24 >> 24; break block9; } while (1) { $1_1 = $13_1 + 1 | 0; $4_1 = $2_1 - 48 | 0; $2_1 = HEAP8[$13_1 + 1 | 0]; if (!(($2_1 - 48 & 255) >>> 0 > 9)) { $2_1 = Math_imul($4_1, 10) + $2_1 | 0; $13_1 = $1_1; continue; } break; }; $16_1 = $4_1 & 2147483647; $4_1 = $2_1 & 255; if (($4_1 | 0) == 46) { break block20 } $9_1 = $24_1; if (($4_1 | 0) == 108) { break block13 } $13_1 = $1_1; break block9; } block23 : { if ($22_1) { $2_1 = $37($21_1); break block23; } $2_1 = HEAP32[$10_1 >> 2]; $10_1 = $10_1 + 4 | 0; } $1_1 = ($2_1 | 0) < 0; $16_1 = $1_1 ? (($2_1 | 0) != -2147483648 ? 0 - $2_1 | 0 : 0) : $2_1; $9_1 = $1_1 ? 1 : $24_1; $1_1 = HEAPU8[$13_1 + 1 | 0]; if (($1_1 | 0) == 46 | ($1_1 | 0) == 108) { break block13 } $2_1 = $1_1 << 24 >> 24; $13_1 = $13_1 + 1 | 0; $24_1 = $9_1; break block9; } block28 : { block25 : { $5_1 = HEAPU8[$13_1 + 1 | 0]; if (($5_1 | 0) != 42) { $1_1 = $13_1 + 1 | 0; $13_1 = 0; while (1) { $2_1 = $5_1 << 24 >> 24; if (($5_1 - 48 & 255) >>> 0 > 9) { break block25 } $13_1 = (Math_imul($13_1, 10) + $2_1 | 0) - 48 | 0; $5_1 = HEAPU8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; continue; }; } block27 : { if ($22_1) { $2_1 = $37($21_1); break block27; } $2_1 = HEAP32[$10_1 >> 2]; $10_1 = $10_1 + 4 | 0; } $7_1 = ($2_1 | 0) < 0 ? (($2_1 | 0) == -2147483648 ? -1 : 0 - $2_1 | 0) : $2_1; $1_1 = $13_1 + 2 | 0; $2_1 = HEAP8[$13_1 + 2 | 0]; break block28; } $7_1 = $13_1 & 2147483647; } if (($2_1 | 0) != 108) { $13_1 = $1_1; break block9; } $13_1 = $1_1 - 1 | 0; } $9_1 = $24_1; } $5_1 = HEAPU8[$13_1 + 1 | 0]; $24_1 = $9_1; $13_1 = $13_1 + 1 | 0; if ($5_1) { continue } break; }; $2_1 = 0; } $5_1 = 0; while (1) { if (($5_1 | 0) == 23) { break block4 } $1_1 = Math_imul($5_1, 6); $5_1 = $5_1 + 1 | 0; $25 = $1_1 + 30832 | 0; if (HEAP8[$25 | 0] != ($2_1 | 0)) { continue } break; }; block38 : { block66 : { block37 : { block36 : { block33 : { block35 : { block34 : { block32 : { block31 : { block40 : { block30 : { block39 : { $19_1 = HEAPU8[$25 + 3 | 0]; switch ($19_1 | 0) { case 0: case 15: break block30; case 1: case 2: case 3: break block31; case 4: break block32; case 5: case 6: break block33; case 7: break block34; case 8: break block35; case 9: case 10: case 14: break block36; case 11: break block37; case 12: break block38; case 13: break block39; case 16: break block40; default: break block4; }; } $15_1 = 0; $14 = 1; break block40; } $15_1 = 0; } block46 : { if (HEAP8[$25 + 2 | 0] & 1) { block43 : { if ($22_1) { $8_1 = $37($21_1); $12_1 = $10_1; $4_1 = i64toi32_i32$HIGH_BITS; break block43; } if (($14 | 0) == 2) { $1_1 = $10_1 + 7 & -8; $12_1 = $1_1 + 8 | 0; $8_1 = HEAP32[$1_1 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; break block43; } $12_1 = $10_1 + 4 | 0; $8_1 = HEAP32[$10_1 >> 2]; $4_1 = $8_1 >> 31; } $1_1 = $4_1 >> 31; $2_1 = $1_1; $8_1 = $2_1 ^ $8_1; $1_1 = $8_1 - $2_1 | 0; $18_1 = ($2_1 ^ $4_1) - (($2_1 >>> 0 > $8_1 >>> 0) + $2_1 | 0) | 0; $17_1 = ($4_1 | 0) < 0 ? 45 : $20_1; break block46; } if ($22_1) { $1_1 = $37($21_1); $18_1 = i64toi32_i32$HIGH_BITS; $12_1 = $10_1; $17_1 = 0; break block46; } block50 : { if (($14 | 0) == 2) { $2_1 = $10_1 + 7 & -8; $12_1 = $2_1 + 8 | 0; $18_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = HEAP32[$2_1 >> 2]; break block50; } $12_1 = $10_1 + 4 | 0; $18_1 = 0; $1_1 = HEAP32[$10_1 >> 2]; } $17_1 = 0; } if ($23_1) { $2_1 = $16_1 - (($17_1 & 255) != 0) | 0; $7_1 = ($2_1 | 0) < ($7_1 | 0) ? $7_1 : $2_1; } block53 : { if (($7_1 | 0) < 37) { $14 = 0; $2_1 = $6_1 + 80 | 0; $5_1 = 70; break block53; } $8_1 = $7_1 + 10 | 0; $4_1 = 0; if ($15_1 & 255) { $3 = 0; $2_1 = ($7_1 >>> 0) / 3 | 0; $8_1 = $2_1 + $8_1 | 0; $4_1 = $2_1 >>> 0 > $8_1 >>> 0 ? 1 : $3; } $2_1 = $38($0_1, $8_1, $4_1); if (!$2_1) { break block4 } $14 = $2_1; $5_1 = $8_1; } $2_1 = $2_1 + $5_1 | 0; $23_1 = $2_1 - 1 | 0; $3 = $23_1; if (($19_1 | 0) == 15) { $4_1 = __wasm_i64_udiv($1_1, $18_1, 10, 0); $3 = i64toi32_i32$HIGH_BITS; $10_1 = __wasm_i64_mul($4_1, $3, 10, 0); $8_1 = $1_1 - $10_1 | 0; $10_1 = $18_1 - (i64toi32_i32$HIGH_BITS + ($1_1 >>> 0 < $10_1 >>> 0) | 0) | 0; $4_1 = __wasm_i64_urem($4_1, $3, 10, 0); $3 = $2_1 - 3 | 0; $4_1 = (!$10_1 & $8_1 >>> 0 > 3 | $10_1 ? 0 : !i64toi32_i32$HIGH_BITS & ($4_1 | 0) == 1 ? 0 : $8_1) << 1; HEAP8[$3 | 0] = HEAPU8[$4_1 + 14989 | 0]; HEAP8[$2_1 - 2 | 0] = HEAPU8[$4_1 + 14990 | 0]; } $19_1 = HEAPU8[$25 + 4 | 0] + 30976 | 0; $2_1 = HEAPU8[$25 + 1 | 0]; $8_1 = $1_1; $4_1 = $18_1; while (1) { $5_1 = $4_1; $3 = $3 - 1 | 0; $9_1 = $8_1; $10_1 = __wasm_i64_udiv($8_1, $4_1, $2_1, 0); $20_1 = i64toi32_i32$HIGH_BITS; HEAP8[$3 | 0] = HEAPU8[($8_1 - __wasm_i64_mul($10_1, $20_1, $2_1, 0) | 0) + $19_1 | 0]; $8_1 = $10_1; $4_1 = $20_1; if (!$5_1 & $2_1 >>> 0 <= $9_1 >>> 0 | $5_1) { continue } break; }; $2_1 = $23_1 - $3 | 0; while (1) { if (!(($2_1 | 0) >= ($7_1 | 0))) { $3 = $3 - 1 | 0; HEAP8[$3 | 0] = 48; $2_1 = $2_1 + 1 | 0; continue; } break; }; block57 : { if (!($15_1 & 255)) { break block57 } $2_1 = $2_1 - 1 | 0; $5_1 = ($2_1 | 0) / 3 | 0; $9_1 = ($2_1 - Math_imul($5_1, 3) | 0) + 1 | 0; $3 = $3 - $5_1 | 0; $2_1 = 0; while (1) { if (($5_1 | 0) <= 0) { break block57 } $4_1 = $2_1 + $3 | 0; HEAP8[$4_1 | 0] = HEAPU8[$4_1 + $5_1 | 0]; $9_1 = $9_1 - 1 | 0; if (!$9_1) { $2_1 = $2_1 + 1 | 0; HEAP8[$3 + $2_1 | 0] = $15_1; $9_1 = 3; $5_1 = $5_1 - 1 | 0; } $2_1 = $2_1 + 1 | 0; continue; }; } if ($17_1 & 255) { $3 = $3 - 1 | 0; HEAP8[$3 | 0] = $17_1; } block60 : { if (!($1_1 | $18_1) | !$27) { break block60 } $1_1 = HEAPU8[$25 + 5 | 0]; if (!$1_1) { break block60 } $2_1 = $1_1 + 31009 | 0; while (1) { $1_1 = HEAPU8[$2_1 | 0]; if (!$1_1) { break block60 } $3 = $3 - 1 | 0; HEAP8[$3 | 0] = $1_1; $2_1 = $2_1 + 1 | 0; continue; }; } $7_1 = $23_1 - $3 | 0; break block61; } if ($22_1) { $11_1 = 0.0; $1_1 = HEAP32[$21_1 + 4 >> 2]; if (($1_1 | 0) >= HEAP32[$21_1 >> 2]) { break block63 } HEAP32[$21_1 + 4 >> 2] = $1_1 + 1; $11_1 = $39(HEAP32[HEAP32[$21_1 + 8 >> 2] + ($1_1 << 2) >> 2]); break block63; } $1_1 = $10_1 + 7 & -8; $12_1 = $1_1 + 8 | 0; $11_1 = HEAPF64[$1_1 >> 3]; break block64; } $14 = 0; if ($22_1) { $16_1 = 0; $7_1 = 0; $12_1 = $10_1; break block61; } HEAP32[HEAP32[$10_1 >> 2] >> 2] = HEAP32[$0_1 + 16 >> 2]; break block66; } HEAP8[$6_1 + 80 | 0] = 37; $3 = $6_1 + 80 | 0; $7_1 = 1; $14 = 0; $12_1 = $10_1; break block61; } block69 : { if ($22_1) { $2_1 = $40($21_1); if ($2_1) { $1_1 = HEAPU8[$2_1 | 0]; HEAP8[$6_1 + 80 | 0] = $1_1; $5_1 = 1; if ($1_1 >>> 0 < 192) { break block69 } while (1) { $1_1 = HEAP8[$2_1 + 1 | 0]; if (($1_1 | 0) > -65) { break block69 } $2_1 = $2_1 + 1 | 0; HEAP8[($6_1 + 80 | 0) + $5_1 | 0] = $1_1; $5_1 = $5_1 + 1 | 0; if (($5_1 | 0) != 4) { continue } break; }; $5_1 = 4; break block69; } HEAP8[$6_1 + 80 | 0] = 0; $5_1 = 1; break block69; } $1_1 = $10_1 + 4 | 0; $2_1 = HEAP32[$10_1 >> 2]; block71 : { if ($2_1 >>> 0 <= 127) { HEAP8[$6_1 + 80 | 0] = $2_1; $5_1 = 1; break block71; } if ($2_1 >>> 0 <= 2047) { HEAP8[$6_1 + 81 | 0] = $2_1 & 63 | 128; HEAP8[$6_1 + 80 | 0] = $2_1 >>> 6 | 192; $5_1 = 2; break block71; } if ($2_1 >>> 0 <= 65535) { HEAP8[$6_1 + 82 | 0] = $2_1 & 63 | 128; HEAP8[$6_1 + 80 | 0] = $2_1 >>> 12 | 224; HEAP8[$6_1 + 81 | 0] = $2_1 >>> 6 & 63 | 128; $5_1 = 3; break block71; } HEAP8[$6_1 + 83 | 0] = $2_1 & 63 | 128; HEAP8[$6_1 + 82 | 0] = $2_1 >>> 6 & 63 | 128; HEAP8[$6_1 + 81 | 0] = $2_1 >>> 12 & 63 | 128; HEAP8[$6_1 + 80 | 0] = $2_1 >>> 18 & 7 | 240; $5_1 = 4; } $10_1 = $1_1; } $1_1 = $6_1 + 80 | 0; $17_1 = 1; $14 = 0; if (($7_1 | 0) < 2) { break block74 } $2_1 = $7_1 - 1 | 0; $16_1 = $16_1 - $2_1 | 0; if (!($24_1 & 255 | ($16_1 | 0) < 2)) { $41($0_1, $16_1 - 1 | 0, 32); $16_1 = 0; } $36($0_1, $6_1 + 80 | 0, $5_1); $8_1 = 1; $4_1 = 0; while (1) { if (($2_1 | 0) < 2) { break block74 } $3 = $8_1; $12_1 = $2_1 - 1 | 0; $8_1 = $8_1 >>> 0 < $12_1 >>> 0 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0; $12_1 = $8_1 ? $3 : $12_1; $8_1 = $8_1 ? $4_1 : 0; $3 = __wasm_i64_mul($12_1, $8_1, $5_1, 0); $7_1 = HEAP32[$0_1 + 16 >> 2]; $9_1 = $3 + $7_1 | 0; $15_1 = i64toi32_i32$HIGH_BITS; $4_1 = $15_1; $4_1 = $7_1 >>> 0 > $9_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $7_1 = HEAP32[$0_1 + 8 >> 2]; if (!(($4_1 | 0) <= 0 & $7_1 >>> 0 > $9_1 >>> 0 | ($4_1 | 0) < 0)) { $42($0_1, $3, $15_1) } if (HEAPU8[$0_1 + 20 | 0]) { break block74 } $36($0_1, HEAP32[$0_1 + 4 >> 2] + (HEAP32[$0_1 + 16 >> 2] - $3 | 0) | 0, $3); $3 = $8_1 << 1 | $12_1 >>> 31; $8_1 = $12_1 << 1; $4_1 = $3; $2_1 = $2_1 - $12_1 | 0; continue; }; } if ($22_1) { $1_1 = $40($21_1); $1_1 = $1_1 ? $1_1 : 30822; $14 = 0; break block78; } $12_1 = $10_1 + 4 | 0; $3 = HEAP32[$10_1 >> 2]; $1_1 = $3 ? $3 : 30822; $14 = 0; if (!$3 | ($19_1 | 0) != 6) { break block79 } if (HEAP32[$0_1 + 16 >> 2] | !HEAP32[$0_1 + 12 >> 2] | (($7_1 | 0) >= 0 | $16_1)) { break block80 } if (HEAPU8[$0_1 + 20 | 0]) { $10_1 = $12_1; $1_1 = $3; $14 = $1_1; break block82; } HEAP32[$0_1 + 4 >> 2] = $3; HEAP32[$0_1 + 8 >> 2] = $43(HEAP32[$0_1 >> 2], $3); HEAP32[$0_1 + 16 >> 2] = $2080($3) & 2147483647; HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] | 4; break block83; } $1_1 = ($19_1 | 0) == 14; block85 : { if ($22_1) { $9_1 = $40($21_1); break block85; } $9_1 = HEAP32[$10_1 >> 2]; $10_1 = $10_1 + 4 | 0; } $18_1 = $1_1 ? 34 : 39; $20_1 = ($19_1 | 0) == 10; $15_1 = $9_1 ? $9_1 : $20_1 ? 20315 : 26298; $12_1 = $7_1 >> 31; $8_1 = 0; $4_1 = 0; $5_1 = 0; $2_1 = 0; while (1) { block86 : { if (!($7_1 | $12_1)) { break block86 } $3 = HEAPU8[$8_1 + $15_1 | 0]; if (!$3) { break block86 } $1_1 = ($3 | 0) == ($18_1 | 0); block89 : { if (!(!!($17_1 & 255) & $3 >>> 0 > 191)) { $3 = $4_1; $8_1 = $8_1 + 1 | 0; $4_1 = $8_1 ? $3 : $3 + 1 | 0; break block89; } while (1) { $8_1 = $8_1 + 1 | 0; $4_1 = $8_1 ? $4_1 : $4_1 + 1 | 0; if (HEAP8[$8_1 + $15_1 | 0] < -64) { continue } break; }; } $5_1 = $1_1 + $5_1 | 0; $2_1 = $5_1 >>> 0 < $1_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $3 = $12_1 - 1 | 0; $7_1 = $7_1 - 1 | 0; $12_1 = ($7_1 | 0) != -1 ? $3 + 1 | 0 : $3; continue; } break; }; $1_1 = $6_1 + 80 | 0; $14 = 0; $3 = $2_1 + $4_1 | 0; $2_1 = $5_1 + $8_1 | 0; $3 = $2_1 >>> 0 < $5_1 >>> 0 ? $3 + 1 | 0 : $3; $2_1 = $2_1 + 3 | 0; $3 = $2_1 >>> 0 < 3 ? $3 + 1 | 0 : $3; if (!($2_1 >>> 0 < 71 & ($3 | 0) <= 0 | ($3 | 0) < 0)) { $14 = $38($0_1, $2_1, $3); $1_1 = $14; if (!$1_1) { break block4 } } $7_1 = 0; $12_1 = 0; $5_1 = 0; $2_1 = 0; $20_1 = $20_1 & ($9_1 | 0) != 0; if ($20_1) { HEAP8[$1_1 | 0] = 39; $5_1 = 1; } $9_1 = $8_1; $3 = $4_1; $8_1 = !!$8_1 & ($3 | 0) >= 0 | ($3 | 0) > 0; $4_1 = $8_1 ? $9_1 : 0; $9_1 = $4_1; $19_1 = $8_1 ? $3 : 0; while (1) { if (!(($7_1 | 0) == ($9_1 | 0) & ($12_1 | 0) == ($19_1 | 0))) { $3 = HEAPU8[$7_1 + $15_1 | 0]; HEAP8[$1_1 + $5_1 | 0] = $3; $8_1 = $5_1 + 1 | 0; $4_1 = $8_1 ? $2_1 : $2_1 + 1 | 0; block94 : { if (($3 | 0) != ($18_1 | 0)) { $5_1 = $8_1; $2_1 = $4_1; break block94; } HEAP8[$1_1 + $8_1 | 0] = $18_1; $5_1 = $5_1 + 2 | 0; $2_1 = $5_1 >>> 0 < 2 ? $2_1 + 1 | 0 : $2_1; } $3 = $12_1; $7_1 = $7_1 + 1 | 0; $12_1 = $7_1 ? $3 : $3 + 1 | 0; continue; } break; }; if ($20_1) { HEAP8[$1_1 + $5_1 | 0] = 39; $5_1 = $5_1 + 1 | 0; $4_1 = $5_1; } HEAP8[$1_1 + $5_1 | 0] = 0; break block74; } if (!(HEAP8[$0_1 + 21 | 0] & 1)) { break block4 } $1_1 = HEAP32[$10_1 >> 2]; if ($27) { if (!$1_1 | HEAPU8[$1_1 + 5 | 0] & 8) { break block66 } $44($0_1, HEAP32[$1_1 + 8 >> 2]); $45(HEAP32[$0_1 >> 2], $1_1); break block66; } if (!$1_1) { break block66 } $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!$2_1) { break block66 } $36($0_1, HEAP32[$1_1 >> 2], $2_1); $4_1 = HEAP32[$0_1 >> 2]; if (!$4_1 | HEAP32[$4_1 + 68 >> 2] != -2) { break block66 } $2_1 = HEAP32[$4_1 + 264 >> 2]; if (!$2_1) { break block66 } $2_1 = HEAP32[$2_1 + 248 >> 2]; if (!$2_1) { break block66 } $1_1 = HEAP32[$1_1 >> 2]; if ($1_1 >>> 0 < $2_1 >>> 0) { break block66 } if ($1_1 >>> 0 >= $2080($2_1) + $2_1 >>> 0) { break block66 } HEAP32[$4_1 + 68 >> 2] = $1_1 - $2_1; } $12_1 = $10_1 + 4 | 0; break block83; } if (!(HEAP8[$0_1 + 21 | 0] & 1)) { break block4 } $12_1 = $10_1 + 4 | 0; $2_1 = HEAP32[$10_1 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; if (!(!$4_1 | $17_1 & 255)) { break block98 } $1_1 = HEAP32[$2_1 >> 2]; if ($1_1) { block100 : { if (HEAP8[$2_1 + 15 | 0] & 1 | HEAPU8[$2_1 + 13 | 0] & 4) { break block100 } $4_1 = HEAP32[$2_1 + 44 >> 2]; if (!$4_1) { break block100 } $44($0_1, $4_1); $36($0_1, 25082, 1); $1_1 = HEAP32[$2_1 >> 2]; } $44($0_1, $1_1); break block83; } if ($4_1) { break block98 } $14 = 0; if (!(HEAPU8[$2_1 + 13 | 0] & 4)) { break block101 } $1_1 = HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; if ($4_1 & 2048) { HEAP32[$6_1 + 32 >> 2] = HEAP32[$1_1 + 16 >> 2]; $46($0_1, 25136, $6_1 + 32 | 0); break block83; } if ($4_1 & 1024) { HEAP32[$6_1 + 16 >> 2] = HEAP32[$2_1 + 32 >> 2]; $46($0_1, 20422, $6_1 + 16 | 0); break block83; } HEAP32[$6_1 >> 2] = HEAP32[$1_1 + 16 >> 2]; $46($0_1, 25122, $6_1); break block83; } $36($0_1, 29265, 1); break block4; } $44($0_1, $4_1); } $14 = 0; } $16_1 = 0; $7_1 = 0; break block61; } $10_1 = $12_1; $14 = $3; $1_1 = $3; break block78; } $10_1 = $12_1; } if (($7_1 | 0) < 0) { break block82 } if (!($17_1 & 255)) { break block104 } $2_1 = $1_1; while (1) { if (($7_1 | 0) <= 0) { break block105 } $4_1 = HEAPU8[$2_1 | 0]; if (!$4_1) { break block105 } $7_1 = $7_1 - 1 | 0; $2_1 = $2_1 + 1 | 0; if ($4_1 >>> 0 < 192) { continue } while (1) { $4_1 = $2_1; $2_1 = $2_1 + 1 | 0; if (HEAP8[$4_1 | 0] < -64) { continue } break; }; $2_1 = $4_1; continue; }; } $5_1 = $2080($1_1) & 2147483647; break block74; } $5_1 = $2_1 - $1_1 | 0; $17_1 = 1; break block74; } $2_1 = 0; while (1) { if (($2_1 | 0) == ($7_1 | 0)) { break block106 } if (HEAPU8[$1_1 + $2_1 | 0]) { $2_1 = $2_1 + 1 | 0; continue; } else { $7_1 = $2_1; break block106; } }; } block108 : { if (!($17_1 & 255)) { break block108 } $2_1 = $5_1; if (($16_1 | 0) <= 0) { break block108 } while (1) { if (($2_1 | 0) <= 0) { break block108 } $2_1 = $2_1 - 1 | 0; $16_1 = (HEAP8[$2_1 + $1_1 | 0] < -64) + $16_1 | 0; continue; }; } $7_1 = $5_1; } $3 = $1_1; $12_1 = $10_1; break block61; } $12_1 = $10_1; } $5_1 = ($7_1 | 0) < 0 ? 6 : ($7_1 | 0) >= 1e8 ? 1e8 : $7_1; block112 : { block110 : { switch ($19_1 - 1 | 0) { case 0: $7_1 = 0 - $5_1 | 0; break block112; case 2: $7_1 = $5_1 >>> 0 <= 1 ? 1 : $5_1; $5_1 = $7_1; break block112; default: break block110; }; } $7_1 = $5_1 + 1 | 0; } HEAP32[$6_1 + 52 >> 2] = $26_1; HEAP8[$6_1 + 41 | 0] = 0; $28_1 = $17_1 & 255; block135 : { block115 : { block114 : { if ($11_1 < 0.0) { HEAP8[$6_1 + 40 | 0] = 45; $11_1 = -$11_1; break block114; } HEAP8[$6_1 + 40 | 0] = 43; if ($11_1 != 0.0) { break block114 } HEAP32[$6_1 + 52 >> 2] = 25060; HEAP32[$6_1 + 44 >> 2] = 1; HEAP32[$6_1 + 48 >> 2] = 1; $2_1 = 1; break block115; } wasm2js_scratch_store_f64(+$11_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; block117 : { if (($1_1 & 2146435072) == 2146435072) { HEAP32[$6_1 + 44 >> 2] = 0; HEAP32[$6_1 + 48 >> 2] = 0; $2_1 = !$2_1 & ($1_1 | 0) == 2146435072 ? 1 : 2; HEAP8[$6_1 + 41 | 0] = $2_1; $9_1 = $26_1; break block117; } HEAP32[$6_1 + 168 >> 2] = 0; HEAP32[$6_1 + 172 >> 2] = 0; HEAPF64[$6_1 + 160 >> 3] = $11_1; $2_1 = 0; block121 : { if ($11_1 > 9223372036854774784.0) { while (1) { if ($11_1 > 9223372036854774162882487.0e94) { $47($6_1 + 160 | 0, 1.0e-100, -1.9991899802602883e-117); $2_1 = $2_1 + 100 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; } break; }; while (1) { if ($11_1 > 9223372036854774048781395.0e4) { $47($6_1 + 160 | 0, 1.0e-10, -3.643219731549774e-27); $2_1 = $2_1 + 10 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; } break; }; while (1) { if (!($11_1 > 9223372036854774784.0)) { break block121 } $47($6_1 + 160 | 0, .1, -5.551115123125783e-18); $2_1 = $2_1 + 1 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; }; } while (1) { if ($11_1 < 9.223372036854775e-83) { $47($6_1 + 160 | 0, 1.e+100, -1590289110975991791564023.0e59); $2_1 = $2_1 - 100 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; } break; }; while (1) { if ($11_1 < 92233720.36854775) { $47($6_1 + 160 | 0, 1.0e10, 0.0); $2_1 = $2_1 - 10 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; } break; }; while (1) { if (!($11_1 < 922337203685477504.0)) { break block121 } $47($6_1 + 160 | 0, 10.0, 0.0); $2_1 = $2_1 - 1 | 0; $11_1 = HEAPF64[$6_1 + 160 >> 3]; continue; }; } if ($11_1 < 18446744073709551615.0 & $11_1 >= 0.0) { $1_1 = ~~$11_1 >>> 0; if (Math_abs($11_1) >= 1.0) { $4_1 = ~~($11_1 > 0.0 ? Math_min(Math_floor($11_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($11_1 - +(~~$11_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $4_1 = 0 } } else { $1_1 = 0; $4_1 = 0; } $11_1 = HEAPF64[$6_1 + 168 >> 3]; block125 : { if ($11_1 < 0.0) { $11_1 = -$11_1; if ($11_1 < 18446744073709551615.0 & $11_1 >= 0.0) { $10_1 = ~~$11_1 >>> 0; if (Math_abs($11_1) >= 1.0) { $3 = ~~($11_1 > 0.0 ? Math_min(Math_floor($11_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($11_1 - +(~~$11_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $3 = 0 } } else { $10_1 = 0; $3 = 0; } $8_1 = $1_1 - $10_1 | 0; $4_1 = $4_1 - (($1_1 >>> 0 < $10_1 >>> 0) + $3 | 0) | 0; break block125; } if ($11_1 < 18446744073709551615.0 & $11_1 >= 0.0) { $8_1 = ~~$11_1 >>> 0; if (Math_abs($11_1) >= 1.0) { $3 = ~~($11_1 > 0.0 ? Math_min(Math_floor($11_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($11_1 - +(~~$11_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $3 = 0 } } else { $8_1 = 0; $3 = 0; } $4_1 = $3 + $4_1 | 0; $8_1 = $1_1 + $8_1 | 0; $4_1 = $8_1 >>> 0 < $1_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; } $10_1 = $28_1 ? 26 : 16; $9_1 = 23; while (1) { if ($4_1 | $8_1) { $1_1 = __wasm_i64_udiv($8_1, $4_1, 10, 0); $4_1 = i64toi32_i32$HIGH_BITS; HEAP8[$9_1 + $26_1 | 0] = $8_1 - __wasm_i64_mul($1_1, $4_1, 10, 0) | 48; $9_1 = $9_1 - 1 | 0; $8_1 = $1_1; continue; } break; }; $3 = 23 - $9_1 | 0; HEAP32[$6_1 + 44 >> 2] = $3; $1_1 = $2_1 + $3 | 0; HEAP32[$6_1 + 48 >> 2] = $1_1; block129 : { block127 : { if (($7_1 | 0) > 0) { break block127 } $7_1 = $1_1 - $7_1 | 0; if (!$7_1) { $1_1 = $9_1 + $26_1 | 0; if (HEAP8[$1_1 + 1 | 0] < 53) { break block129 } HEAP8[$1_1 | 0] = 48; $7_1 = 1; $3 = HEAP32[$6_1 + 44 >> 2] + 1 | 0; HEAP32[$6_1 + 44 >> 2] = $3; HEAP32[$6_1 + 48 >> 2] = HEAP32[$6_1 + 48 >> 2] + 1; $9_1 = $9_1 - 1 | 0; break block127; } if (($7_1 | 0) <= 0) { break block129 } } if (($3 | 0) <= ($10_1 | 0) & ($3 | 0) <= ($7_1 | 0)) { break block129 } $3 = $7_1 >>> 0 < $10_1 >>> 0 ? $7_1 : $10_1; HEAP32[$6_1 + 44 >> 2] = $3; $4_1 = ($9_1 + $26_1 | 0) + 1 | 0; if (HEAP8[$4_1 + $3 | 0] < 53) { break block129 } block131 : { while (1) { $3 = $3 - 1 | 0; $1_1 = $4_1 + $3 | 0; $2_1 = HEAPU8[$1_1 | 0] + 1 | 0; HEAP8[$1_1 | 0] = $2_1; if ($2_1 << 24 >> 24 < 58) { break block131 } HEAP8[$1_1 | 0] = 48; if ($3) { continue } break; }; HEAP8[HEAP32[$6_1 + 52 >> 2] + $9_1 | 0] = 49; $3 = HEAP32[$6_1 + 44 >> 2] + 1 | 0; HEAP32[$6_1 + 44 >> 2] = $3; HEAP32[$6_1 + 48 >> 2] = HEAP32[$6_1 + 48 >> 2] + 1; $9_1 = $9_1 - 1 | 0; break block129; } $3 = HEAP32[$6_1 + 44 >> 2]; } $1_1 = $9_1 + $26_1 | 0; $9_1 = $1_1 + 1 | 0; HEAP32[$6_1 + 52 >> 2] = $9_1; while (1) { if (!(HEAPU8[$1_1 + $3 | 0] != 48 | ($3 | 0) <= 0)) { $3 = $3 - 1 | 0; HEAP32[$6_1 + 44 >> 2] = $3; continue; } break; }; $2_1 = HEAPU8[$6_1 + 41 | 0]; } block133 : { switch ($2_1 & 255) { default: if ($23_1) { HEAP8[$9_1 | 0] = 57; HEAP32[$6_1 + 44 >> 2] = 1; HEAP32[$6_1 + 48 >> 2] = 1e3; $2_1 = 1e3; break block115; } HEAP8[$6_1 + 84 | 0] = HEAPU8[12771]; HEAP32[$6_1 + 80 >> 2] = HEAPU8[12767] | HEAPU8[12768] << 8 | (HEAPU8[12769] << 16 | HEAPU8[12770] << 24); $1_1 = $6_1 + 80 | 0; if (HEAPU8[$6_1 + 40 | 0] == 45) { break block137 } $3 = $29_1; if (!($20_1 & 255)) { break block138 } HEAP8[$6_1 + 80 | 0] = $20_1; break block137; case 0: break block133; case 2: break block135; }; } $2_1 = HEAP32[$6_1 + 48 >> 2]; } $10_1 = HEAPU8[$6_1 + 40 | 0]; block140 : { if (($19_1 | 0) == 3) { $18_1 = ($2_1 | 0) < -3 | ($2_1 | 0) > ($5_1 | 0); $5_1 = ($18_1 ? -1 : 0 - $2_1 | 0) + $5_1 | 0; $1_1 = !$27; break block140; } $18_1 = ($19_1 | 0) == 2; $1_1 = $17_1; } $3 = $5_1 >> 31; $4_1 = $5_1 + $16_1 | 0; $3 = $4_1 >>> 0 < $5_1 >>> 0 ? $3 + 1 | 0 : $3; $9_1 = $18_1 ? 0 : $2_1 - 1 | 0; $2_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $4_1 = $2_1 + $4_1 | 0; $3 = $2_1 >>> 0 > $4_1 >>> 0 ? $3 + 1 | 0 : $3; $2_1 = $3; $8_1 = $4_1 + 15 | 0; $4_1 = $8_1 >>> 0 < 15 ? $2_1 + 1 | 0 : $2_1; $19_1 = $15_1 & 255; if (!(!$19_1 | ($9_1 | 0) <= 0)) { $2_1 = ($9_1 + 2 >>> 0) / 3 | 0; $8_1 = $2_1 + $8_1 | 0; $4_1 = $2_1 >>> 0 > $8_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; } if (($4_1 | 0) > 0) { $2_1 = 1 } else { $2_1 = ($4_1 | 0) >= 0 & $8_1 >>> 0 >= 71 } block143 : { if (!$2_1) { $3 = $6_1 + 80 | 0; $14 = 0; break block143; } $14 = $38($0_1, $8_1, $4_1); $3 = $14; if (!$3) { break block4 } } $2_1 = ($5_1 | 0) > 0 | $27; $15_1 = $3; $4_1 = ($10_1 | 0) == 45 ? 45 : $20_1; $8_1 = $4_1 & 255; if ($8_1) { HEAP8[$3 | 0] = $4_1; $15_1 = $3 + 1 | 0; } $4_1 = $2_1 | $17_1; $10_1 = 0; block146 : { if (($9_1 | 0) >= 0) { $7_1 = 0; while (1) { $2_1 = $15_1; if (($9_1 | 0) < 0) { break block146 } $17_1 = 48; if (($7_1 | 0) < HEAP32[$6_1 + 44 >> 2]) { $17_1 = HEAPU8[HEAP32[$6_1 + 52 >> 2] + $7_1 | 0]; $7_1 = $7_1 + 1 | 0; } HEAP8[$2_1 | 0] = $17_1; $15_1 = $2_1 + 1 | 0; if (!(($9_1 >>> 0) % 3 | (!$19_1 | $9_1 >>> 0 < 2))) { HEAP8[$2_1 + 1 | 0] = 44; $15_1 = $2_1 + 2 | 0; } $9_1 = $9_1 - 1 | 0; continue; }; } HEAP8[$15_1 | 0] = 48; $10_1 = $9_1 + 1 | 0; $7_1 = 0; $2_1 = $15_1 + 1 | 0; } $4_1 = $4_1 & 255; if (!$4_1) { break block149 } HEAP8[$2_1 | 0] = 46; $9_1 = 0; break block150; } $3 = $23_1 ? 11741 : 20044; break block138; } $0_1 = $6_1 + 176 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return; } $9_1 = 1; } while (1) { if (!$9_1) { $2_1 = $2_1 + 1 | 0; $9_1 = 1; continue; } block154 : { if (!(($5_1 | 0) <= 0 | ($10_1 | 0) >= 0)) { HEAP8[$2_1 | 0] = 48; $10_1 = $10_1 + 1 | 0; $5_1 = $5_1 - 1 | 0; break block154; } while (1) { if (!(($5_1 | 0) <= 0)) { $9_1 = 48; if (($7_1 | 0) < HEAP32[$6_1 + 44 >> 2]) { $9_1 = HEAPU8[HEAP32[$6_1 + 52 >> 2] + $7_1 | 0]; $7_1 = $7_1 + 1 | 0; } $5_1 = $5_1 - 1 | 0; HEAP8[$2_1 | 0] = $9_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; block157 : { if (!($1_1 & 255) | !$4_1) { break block157 } while (1) { block158 : { block159 : { $1_1 = $2_1 - 1 | 0; switch (HEAPU8[$1_1 | 0] - 46 | 0) { case 0: break block158; case 2: break block159; default: break block157; }; } HEAP8[$1_1 | 0] = 0; $2_1 = $1_1; continue; } break; }; if ($28_1) { HEAP8[$2_1 | 0] = 48; $2_1 = $2_1 + 1 | 0; break block157; } HEAP8[$1_1 | 0] = 0; $2_1 = $1_1; } if ($18_1) { $1_1 = HEAP32[$6_1 + 48 >> 2]; $4_1 = ($1_1 | 0) <= 0; HEAP8[$2_1 + 1 | 0] = $4_1 ? 45 : 43; HEAP8[$2_1 | 0] = HEAPU8[HEAPU8[$25 + 4 | 0] + 30976 | 0]; $5_1 = $4_1 ? 1 - $1_1 | 0 : $1_1 - 1 | 0; if ($5_1 >>> 0 < 100) { $2_1 = $2_1 + 2 | 0 } else { $1_1 = ($5_1 >>> 0) / 100 | 0; HEAP8[$2_1 + 2 | 0] = $1_1 + 48; $5_1 = $5_1 - Math_imul($1_1, 100) | 0; $2_1 = $2_1 + 3 | 0; } $1_1 = (($5_1 & 255) >>> 0) / 10 | 0; HEAP8[$2_1 | 0] = $1_1 | 48; HEAP8[$2_1 + 1 | 0] = $5_1 - Math_imul($1_1, 10) | 48; $2_1 = $2_1 + 2 | 0; } HEAP8[$2_1 | 0] = 0; $7_1 = $2_1 - $3 | 0; if (!$23_1 | $24_1 & 255 | ($7_1 | 0) >= ($16_1 | 0)) { break block61 } $2_1 = $16_1 - $7_1 | 0; $5_1 = $16_1; while (1) { if (!(($2_1 | 0) > ($5_1 | 0))) { HEAP8[$3 + $5_1 | 0] = HEAPU8[($5_1 - $2_1 | 0) + $3 | 0]; $5_1 = $5_1 - 1 | 0; continue; } break; }; $5_1 = ($8_1 | 0) != 0; while (1) if ($2_1) { HEAP8[$3 + $5_1 | 0] = 48; $5_1 = $5_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; continue; } else { $7_1 = $16_1; break block61; }; } $9_1 = 0; continue; }; } $3 = $1_1; } $14 = 0; $7_1 = $48($3); } block168 : { block167 : { $1_1 = $16_1 - $7_1 | 0; if (($1_1 | 0) > 0) { if ($24_1 & 255) { break block167 } $41($0_1, $1_1, 32); } $36($0_1, $3, $7_1); break block168; } $36($0_1, $3, $7_1); $41($0_1, $1_1, 32); } if ($14) { $13(HEAP32[$0_1 >> 2], $14) } $1_1 = $13_1 + 1 | 0; continue; }; } function $36($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 16 >> 2]; $4_1 = $3 + $2_1 | 0; if ($4_1 >>> 0 >= HEAPU32[$0_1 + 8 >> 2]) { $2_1 = $42($0_1, $2_1, $2_1 >> 31); if (($2_1 | 0) > 0) { if ($2_1) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0, $1_1, $2_1) } HEAP32[$0_1 + 16 >> 2] = $2_1 + HEAP32[$0_1 + 16 >> 2]; } return; } block1 : { if (!$2_1) { break block1 } HEAP32[$0_1 + 16 >> 2] = $4_1; if (!$2_1) { break block1 } wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + $3 | 0, $1_1, $2_1); } } function $37($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; if (($1_1 | 0) < HEAP32[$0_1 >> 2]) { HEAP32[$0_1 + 4 >> 2] = $1_1 + 1; $2_1 = $50(HEAP32[HEAP32[$0_1 + 8 >> 2] + ($1_1 << 2) >> 2]); $0_1 = i64toi32_i32$HIGH_BITS; } else { $0_1 = $2_1 } i64toi32_i32$HIGH_BITS = $0_1; return $2_1; } function $38($0_1, $1_1, $2_1) { var $3 = 0; block : { if (HEAPU8[$0_1 + 20 | 0]) { break block } if (!$2_1 & HEAPU32[$0_1 + 8 >> 2] >= $1_1 >>> 0 | !$2_1 & HEAPU32[$0_1 + 12 >> 2] >= $1_1 >>> 0) { $3 = $51(HEAP32[$0_1 >> 2], $1_1, $2_1); if ($3) { break block } $1_1 = 7; } else { $1_1 = 18 } $52($0_1, $1_1); $3 = 0; } return $3; } function $39($0_1) { var $1_1 = 0, $2_1 = 0.0; $1_1 = HEAPU16[$0_1 + 16 >> 1]; if ($1_1 & 8) { return HEAPF64[$0_1 >> 3] } if ($1_1 & 36) { return +HEAPU32[$0_1 >> 2] + +HEAP32[$0_1 + 4 >> 2] * 4294967296.0 } if (!($1_1 & 18)) { return 0.0 } $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $303(HEAP32[$0_1 + 8 >> 2], $1_1 + 8 | 0, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]); $2_1 = HEAPF64[$1_1 + 8 >> 3]; $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $40($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; if (($1_1 | 0) < HEAP32[$0_1 >> 2]) { HEAP32[$0_1 + 4 >> 2] = $1_1 + 1; $2_1 = $53(HEAP32[HEAP32[$0_1 + 8 >> 2] + ($1_1 << 2) >> 2]); } return $2_1; } function $41($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block1 : { $4_1 = $1_1 >> 31; $3 = $4_1; $6_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$0_1 + 16 >> 2] + $1_1 | 0; $3 = $5_1 >>> 0 < $1_1 >>> 0 ? $3 + 1 | 0 : $3; if (($3 | 0) < 0) { $3 = 1 } else { $3 = ($3 | 0) <= 0 & $6_1 >>> 0 > $5_1 >>> 0 } if (!$3) { $1_1 = $42($0_1, $1_1, $4_1); if (($1_1 | 0) <= 0) { break block1 } } while (1) { if (($1_1 | 0) <= 0) { break block1 } $3 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$0_1 + 16 >> 2] = $3 + 1; HEAP8[HEAP32[$0_1 + 4 >> 2] + $3 | 0] = $2_1; $1_1 = $1_1 - 1 | 0; continue; }; } } function $42($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block6 : { if (HEAPU8[$0_1 + 20 | 0]) { $1_1 = $4_1 } else { $4_1 = HEAP32[$0_1 + 12 >> 2]; if (!$4_1) { $52($0_1, 18); return HEAP32[$0_1 + 8 >> 2] + (HEAP32[$0_1 + 16 >> 2] ^ -1) | 0; } $6_1 = HEAPU8[$0_1 + 21 | 0] & 4 ? HEAP32[$0_1 + 4 >> 2] : $6_1; $3 = HEAP32[$0_1 + 16 >> 2]; $5_1 = $3 + $1_1 | 0; $2_1 = $3 >>> 0 > $5_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $5_1 = $5_1 + 1 | 0; $2_1 = $5_1 ? $2_1 : $2_1 + 1 | 0; $8_1 = $2_1; $7_1 = $3; $3 = $3 + $5_1 | 0; $2_1 = $7_1 >>> 0 > $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; $7_1 = $2_1; $9_1 = $3; $3 = $3 >>> 0 > $4_1 >>> 0 & ($2_1 | 0) >= 0 | ($2_1 | 0) > 0; $2_1 = $3 ? $5_1 : $9_1; $3 = $3 ? $8_1 : $7_1; if (($3 | 0) < 0) { $3 = 1 } else { $3 = ($3 | 0) <= 0 & $2_1 >>> 0 <= $4_1 >>> 0 } if (!$3) { $54($0_1); $52($0_1, 18); return 0; } HEAP32[$0_1 + 8 >> 2] = $2_1; $4_1 = 0; $3 = HEAP32[$0_1 >> 2]; block5 : { if ($3) { $4_1 = $55($3, $6_1, $2_1, $4_1); break block5; } $4_1 = $33($6_1, $2_1, $4_1); } if (!$4_1) { break block6 } block7 : { if (HEAPU8[$0_1 + 21 | 0] & 4) { break block7 } $2_1 = HEAP32[$0_1 + 16 >> 2]; if (!$2_1 | !$2_1) { break block7 } wasm2js_memory_copy($4_1, HEAP32[$0_1 + 4 >> 2], $2_1); } HEAP32[$0_1 + 4 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = $43(HEAP32[$0_1 >> 2], $4_1); HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] | 4; } return $1_1; } $54($0_1); $52($0_1, 7); return 0; } function $43($0_1, $1_1) { var $2_1 = 0; block1 : { block : { if (!$0_1 | HEAPU32[$0_1 + 360 >> 2] <= $1_1 >>> 0) { break block } $2_1 = 128; if (HEAPU32[$0_1 + 348 >> 2] <= $1_1 >>> 0) { break block1 } if (HEAPU32[$0_1 + 352 >> 2] > $1_1 >>> 0) { break block } return HEAPU16[$0_1 + 310 >> 1]; } $2_1 = FUNCTION_TABLE[HEAP32[18897]]($1_1) | 0; } return $2_1; } function $44($0_1, $1_1) { $36($0_1, $1_1, $48($1_1)); } function $45($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { while (1) { if (!$1_1) { break block } block2 : { $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!($2_1 & 3)) { $3 = HEAP32[$1_1 + 36 >> 2]; if (($3 | 0) > 0) { break block2 } } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; } break; }; if ($2_1 & 1073741824) { break block } HEAP32[$0_1 + 68 >> 2] = $3; } } function $46($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = $2_1; $35($0_1, $1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $47($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0.0; $3 = global$0 - 48 | 0; $4_1 = HEAPF64[$0_1 >> 3]; $5_1 = HEAPU8[$0_1 + 4 | 0] | HEAPU8[$0_1 + 5 | 0] << 8 | (HEAPU8[$0_1 + 6 | 0] << 16 | HEAPU8[$0_1 + 7 | 0] << 24); wasm2js_scratch_store_i32(0, (HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8 | (HEAPU8[$0_1 + 2 | 0] << 16 | HEAPU8[$0_1 + 3 | 0] << 24)) & -67108864); wasm2js_scratch_store_i32(1, $5_1 | 0); $6_1 = +wasm2js_scratch_load_f64(); HEAPF64[$3 + 40 >> 3] = $4_1 - $6_1; wasm2js_scratch_store_f64(+$1_1); $5_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_store_i32(0, wasm2js_scratch_load_i32(0) & -67108864); wasm2js_scratch_store_i32(1, $5_1 | 0); $4_1 = +wasm2js_scratch_load_f64(); HEAPF64[$3 + 32 >> 3] = $1_1 - $4_1; HEAPF64[$3 + 24 >> 3] = $4_1 * $6_1; HEAPF64[$3 + 16 >> 3] = $6_1 * HEAPF64[$3 + 32 >> 3] + HEAPF64[$3 + 40 >> 3] * $4_1; HEAPF64[$3 + 8 >> 3] = HEAPF64[$3 + 24 >> 3] + HEAPF64[$3 + 16 >> 3]; HEAPF64[$3 >> 3] = HEAPF64[$3 + 40 >> 3] * HEAPF64[$3 + 32 >> 3] + (HEAPF64[$3 + 16 >> 3] + (HEAPF64[$3 + 24 >> 3] - HEAPF64[$3 + 8 >> 3])); HEAPF64[$3 >> 3] = HEAPF64[$3 >> 3] + (HEAPF64[$0_1 >> 3] * $2_1 + $1_1 * HEAPF64[$0_1 + 8 >> 3]); HEAPF64[$0_1 >> 3] = HEAPF64[$3 + 8 >> 3] + HEAPF64[$3 >> 3]; HEAPF64[$0_1 + 8 >> 3] = HEAPF64[$3 + 8 >> 3] - HEAPF64[$0_1 >> 3]; HEAPF64[$0_1 + 8 >> 3] = HEAPF64[$3 >> 3] + HEAPF64[$0_1 + 8 >> 3]; } function $48($0_1) { if (!$0_1) { return 0 } return $2080($0_1) & 1073741823; } function $50($0_1) { var $1_1 = 0, $2_1 = 0.0, $3 = 0; $1_1 = HEAPU16[$0_1 + 16 >> 1]; if ($1_1 & 36) { i64toi32_i32$HIGH_BITS = HEAP32[$0_1 + 4 >> 2]; return HEAP32[$0_1 >> 2]; } if ($1_1 & 8) { $2_1 = HEAPF64[$0_1 >> 3]; if ($2_1 < -9223372036854774784.0) { i64toi32_i32$HIGH_BITS = -2147483648; return 0; } if ($2_1 > 9223372036854774784.0) { i64toi32_i32$HIGH_BITS = 2147483647; return -1; } if (Math_abs($2_1) < 9223372036854775808.0) { $0_1 = ~~$2_1 >>> 0; if (Math_abs($2_1) >= 1.0) { $1_1 = ~~($2_1 > 0.0 ? Math_min(Math_floor($2_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($2_1 - +(~~$2_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $1_1 = 0 } } else { $0_1 = 0; $1_1 = -2147483648; } i64toi32_i32$HIGH_BITS = $1_1; return $0_1; } if (!($1_1 & 18) | !HEAP32[$0_1 + 8 >> 2]) { $0_1 = 0 } else { $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; $305(HEAP32[$0_1 + 8 >> 2], $1_1 + 8 | 0, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]); $3 = HEAP32[$1_1 + 8 >> 2]; $0_1 = HEAP32[$1_1 + 12 >> 2]; $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; i64toi32_i32$HIGH_BITS = $0_1; $0_1 = i64toi32_i32$HIGH_BITS; } i64toi32_i32$HIGH_BITS = $0_1; return $3; } function $51($0_1, $1_1, $2_1) { if ($0_1) { return $325($0_1, $1_1, $2_1) } return $30($1_1, $2_1); } function $52($0_1, $1_1) { HEAP8[$0_1 + 20 | 0] = $1_1; if (HEAP32[$0_1 + 12 >> 2]) { $54($0_1) } if (($1_1 | 0) == 18) { $236(HEAP32[$0_1 >> 2], 18) } } function $53($0_1) { $0_1 = $0_1 | 0; return $208($0_1, 1) | 0; } function $54($0_1) { if (HEAPU8[$0_1 + 21 | 0] & 4) { $10(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2]); HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] & 251; } HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 0; } function $55($0_1, $1_1, $2_1, $3) { var $4_1 = 0; if (!$1_1) { return $325($0_1, $2_1, $3) } block3 : { block1 : { if (HEAPU32[$0_1 + 356 >> 2] <= $1_1 >>> 0) { break block1 } if ($1_1 >>> 0 >= HEAPU32[$0_1 + 348 >> 2]) { if (!$3 & $2_1 >>> 0 >= 129 | $3) { break block1 } break block3; } if (HEAPU32[$0_1 + 352 >> 2] > $1_1 >>> 0) { break block1 } if (!$3 & HEAPU16[$0_1 + 310 >> 1] >= $2_1 >>> 0) { break block3 } } __inlined_func$442$7 : { block : { if (HEAPU8[$0_1 + 87 | 0]) { break block } if (!(HEAPU32[$0_1 + 360 >> 2] <= $1_1 >>> 0 | HEAPU32[$0_1 + 352 >> 2] > $1_1 >>> 0)) { $2_1 = $325($0_1, $2_1, $3); if (!$2_1) { break block } $3 = $1_1 >>> 0 >= HEAPU32[$0_1 + 348 >> 2] ? 128 : HEAPU16[$0_1 + 310 >> 1]; if ($3) { wasm2js_memory_copy($2_1, $1_1, $3) } $13($0_1, $1_1); $1_1 = $2_1; break __inlined_func$442$7; } $4_1 = $33($1_1, $2_1, $3); if ($4_1) { break block } $106($0_1); $4_1 = 0; } $1_1 = $4_1; } } return $1_1; } function $57($0_1) { var $1_1 = 0, $2_1 = 0; block : { $1_1 = HEAP32[$0_1 + 4 >> 2]; if (!$1_1) { break block } HEAP8[HEAP32[$0_1 + 16 >> 2] + $1_1 | 0] = 0; if (!HEAP32[$0_1 + 12 >> 2] | HEAPU8[$0_1 + 21 | 0] & 4) { break block } $1_1 = $51(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 16 >> 2] + 1 | 0, 0); block2 : { if ($1_1) { $2_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; if ($2_1) { wasm2js_memory_copy($1_1, HEAP32[$0_1 + 4 >> 2], $2_1) } HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] | 4; break block2; } $52($0_1, 7); } HEAP32[$0_1 + 4 >> 2] = $1_1; return $1_1; } return HEAP32[$0_1 + 4 >> 2]; } function $60($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 112 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if (!$19()) { HEAP16[$2_1 + 28 >> 1] = 0; HEAP32[$2_1 + 24 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 70; HEAP32[$2_1 + 20 >> 2] = 1e9; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = $2_1 + 32; $3 = $2_1 + 8 | 0; $35($3, $0_1, $1_1); $3 = $57($3); } $0_1 = $2_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $61($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if (!$19()) { HEAP32[$2_1 + 12 >> 2] = $1_1; $3 = $60($0_1, $1_1); } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $63($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; if (($0_1 | 0) > 0) { HEAP16[$4_1 + 28 >> 1] = 0; HEAP32[$4_1 + 20 >> 2] = 0; HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = $3; HEAP32[$4_1 + 12 >> 2] = $1_1; $35($4_1 + 8 | 0, $2_1, $3); HEAP8[HEAP32[$4_1 + 24 >> 2] + $1_1 | 0] = 0; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $64($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 256 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (HEAP32[18945]) { HEAP32[$3 + 12 >> 2] = $2_1; HEAP16[$3 + 252 >> 1] = 0; HEAP32[$3 + 244 >> 2] = 0; HEAP32[$3 + 248 >> 2] = 0; HEAP32[$3 + 240 >> 2] = 210; HEAP32[$3 + 232 >> 2] = 0; HEAP32[$3 + 236 >> 2] = $3 + 16; $4_1 = $3 + 232 | 0; $35($4_1, $1_1, $2_1); $1_1 = HEAP32[18945]; FUNCTION_TABLE[$1_1 | 0](HEAP32[18946], $0_1, $57($4_1)); } $0_1 = $3 + 256 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $65($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0; $2_1 = global$0 + -64 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if ($19()) { break block } if (!($1_1 ? ($0_1 | 0) > 0 : 0)) { HEAP32[20581] = 0; break block; } if (HEAP32[20581]) { $4_1 = HEAPU8[82452] } else { $4_1 = $18(0); $3 = HEAP32[7759]; HEAP32[20583] = HEAP32[7758]; HEAP32[20584] = $3; $3 = HEAP32[7757]; HEAP32[20581] = HEAP32[7756]; HEAP32[20582] = $3; block6 : { if (!$4_1) { $3 = 0; wasm2js_memory_fill(82340, 0, 44); break block6; } $3 = 0; $10_1 = HEAP32[18955]; if ($10_1) { wasm2js_memory_fill(82344, 0, 40); HEAP32[20585] = $10_1; break block6; } FUNCTION_TABLE[HEAP32[$4_1 + 56 >> 2]]($4_1, 44, 82340) | 0; $3 = HEAP32[20593]; } HEAP32[20596] = $3; HEAP8[82452] = 0; HEAP32[20593] = 0; $4_1 = 0; } label1 : while (1) { $4_1 = $4_1 & 255; if (($0_1 | 0) <= ($4_1 | 0)) { if ($0_1) { wasm2js_memory_copy($1_1, ($4_1 - $0_1 | 0) + 82388 | 0, $0_1) } HEAP8[82452] = HEAPU8[82452] - $0_1; break block; } $3 = !!$4_1; if ($3) { if ($3) { wasm2js_memory_copy($1_1, 82388, $4_1) } $4_1 = HEAPU8[82452]; $1_1 = $4_1 + $1_1 | 0; $0_1 = $0_1 - $4_1 | 0; } $4_1 = 0; HEAP32[20593] = HEAP32[20593] + 1; wasm2js_memory_copy($2_1, 82324, 64); $7_1 = HEAP32[$2_1 + 44 >> 2]; $11_1 = HEAP32[$2_1 + 60 >> 2]; $14 = HEAP32[$2_1 + 12 >> 2]; $3 = HEAP32[$2_1 + 28 >> 2]; $5_1 = HEAP32[$2_1 + 40 >> 2]; $20_1 = HEAP32[$2_1 + 56 >> 2]; $15_1 = HEAP32[$2_1 + 8 >> 2]; $10_1 = HEAP32[$2_1 + 24 >> 2]; $21_1 = HEAP32[$2_1 + 36 >> 2]; $12_1 = HEAP32[$2_1 + 52 >> 2]; $16_1 = HEAP32[$2_1 + 4 >> 2]; $17_1 = HEAP32[$2_1 + 20 >> 2]; $18_1 = HEAP32[$2_1 + 32 >> 2]; $13_1 = HEAP32[$2_1 + 48 >> 2]; $19_1 = HEAP32[$2_1 >> 2]; $8_1 = HEAP32[$2_1 + 16 >> 2]; while (1) if (($4_1 | 0) == 10) { HEAP32[$2_1 + 48 >> 2] = $13_1; HEAP32[$2_1 >> 2] = $19_1; HEAP32[$2_1 + 16 >> 2] = $8_1; HEAP32[$2_1 + 32 >> 2] = $18_1; HEAP32[$2_1 + 20 >> 2] = $17_1; HEAP32[$2_1 + 52 >> 2] = $12_1; HEAP32[$2_1 + 4 >> 2] = $16_1; HEAP32[$2_1 + 36 >> 2] = $21_1; HEAP32[$2_1 + 24 >> 2] = $10_1; HEAP32[$2_1 + 56 >> 2] = $20_1; HEAP32[$2_1 + 8 >> 2] = $15_1; HEAP32[$2_1 + 40 >> 2] = $5_1; HEAP32[$2_1 + 28 >> 2] = $3; HEAP32[$2_1 + 60 >> 2] = $11_1; HEAP32[$2_1 + 12 >> 2] = $14; HEAP32[$2_1 + 44 >> 2] = $7_1; $4_1 = 0; while (1) { if (!(($4_1 | 0) == 16)) { $3 = $4_1 << 2; HEAP32[$3 + 82388 >> 2] = HEAP32[$3 + 82324 >> 2] + HEAP32[$2_1 + $3 >> 2]; $4_1 = $4_1 + 1 | 0; continue; } break; }; $4_1 = 64; HEAP8[82452] = 64; continue label1; } else { $6_1 = $8_1; $9_1 = $18_1; $8_1 = $8_1 + $19_1 | 0; $18_1 = __wasm_rotl_i32($8_1 ^ $13_1, 16); $13_1 = $9_1 + $18_1 | 0; $19_1 = __wasm_rotl_i32($6_1 ^ $13_1, 12); $6_1 = $19_1; $9_1 = $13_1; $19_1 = $8_1 + $19_1 | 0; $13_1 = __wasm_rotl_i32($19_1 ^ $18_1, 8); $18_1 = $9_1 + $13_1 | 0; $8_1 = __wasm_rotl_i32($6_1 ^ $18_1, 7); $6_1 = $7_1; $7_1 = $3 + $14 | 0; $11_1 = __wasm_rotl_i32($7_1 ^ $11_1, 16); $9_1 = $6_1 + $11_1 | 0; $3 = __wasm_rotl_i32($9_1 ^ $3, 12); $6_1 = $5_1; $14 = $10_1 + $15_1 | 0; $5_1 = __wasm_rotl_i32($14 ^ $20_1, 16); $22_1 = $6_1 + $5_1 | 0; $10_1 = __wasm_rotl_i32($22_1 ^ $10_1, 12); $6_1 = $5_1; $5_1 = $10_1 + $14 | 0; $23_1 = __wasm_rotl_i32($6_1 ^ $5_1, 8); $15_1 = $3 + $7_1 | 0; $14 = $8_1 + $15_1 | 0; $7_1 = __wasm_rotl_i32($23_1 ^ $14, 16); $6_1 = $21_1; $20_1 = $17_1 + $16_1 | 0; $21_1 = __wasm_rotl_i32($20_1 ^ $12_1, 16); $12_1 = $6_1 + $21_1 | 0; $17_1 = __wasm_rotl_i32($12_1 ^ $17_1, 12); $6_1 = $8_1; $8_1 = $12_1; $16_1 = $17_1 + $20_1 | 0; $12_1 = __wasm_rotl_i32($16_1 ^ $21_1, 8); $24_1 = $8_1 + $12_1 | 0; $8_1 = $7_1 + $24_1 | 0; $6_1 = __wasm_rotl_i32($6_1 ^ $8_1, 12); $14 = $6_1 + $14 | 0; $20_1 = __wasm_rotl_i32($7_1 ^ $14, 8); $21_1 = $20_1 + $8_1 | 0; $8_1 = __wasm_rotl_i32($21_1 ^ $6_1, 7); $6_1 = $5_1; $11_1 = __wasm_rotl_i32($11_1 ^ $15_1, 8); $7_1 = $11_1 + $9_1 | 0; $5_1 = __wasm_rotl_i32($7_1 ^ $3, 7); $15_1 = $6_1 + $5_1 | 0; $12_1 = __wasm_rotl_i32($15_1 ^ $12_1, 16); $3 = $12_1 + $18_1 | 0; $5_1 = __wasm_rotl_i32($3 ^ $5_1, 12); $15_1 = $5_1 + $15_1 | 0; $12_1 = __wasm_rotl_i32($12_1 ^ $15_1, 8); $18_1 = $3 + $12_1 | 0; $3 = __wasm_rotl_i32($18_1 ^ $5_1, 7); $6_1 = $7_1; $5_1 = $22_1 + $23_1 | 0; $7_1 = __wasm_rotl_i32($5_1 ^ $10_1, 7); $16_1 = $7_1 + $16_1 | 0; $13_1 = __wasm_rotl_i32($16_1 ^ $13_1, 16); $10_1 = $6_1 + $13_1 | 0; $9_1 = __wasm_rotl_i32($10_1 ^ $7_1, 12); $16_1 = $9_1 + $16_1 | 0; $13_1 = __wasm_rotl_i32($13_1 ^ $16_1, 8); $7_1 = $10_1 + $13_1 | 0; $10_1 = __wasm_rotl_i32($7_1 ^ $9_1, 7); $6_1 = $5_1; $9_1 = $11_1; $11_1 = __wasm_rotl_i32($17_1 ^ $24_1, 7); $5_1 = $11_1 + $19_1 | 0; $9_1 = __wasm_rotl_i32($9_1 ^ $5_1, 16); $17_1 = $6_1 + $9_1 | 0; $22_1 = __wasm_rotl_i32($17_1 ^ $11_1, 12); $19_1 = $22_1 + $5_1 | 0; $11_1 = __wasm_rotl_i32($9_1 ^ $19_1, 8); $5_1 = $17_1 + $11_1 | 0; $17_1 = __wasm_rotl_i32($5_1 ^ $22_1, 7); $4_1 = $4_1 + 1 | 0; continue; }; }; } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $66($0_1, $1_1) { if (!$0_1) { return $1_1 ? -1 : 0 } if (!$1_1) { return 1 } return $67($0_1, $1_1); } function $67($0_1, $1_1) { var $2_1 = 0, $3 = 0; while (1) { block2 : { $3 = HEAPU8[$1_1 | 0]; $2_1 = HEAPU8[$0_1 | 0]; block1 : { if (($3 | 0) == ($2_1 | 0)) { if ($2_1) { break block1 } $2_1 = 0; break block2; } $2_1 = HEAPU8[$2_1 + 31040 | 0] - HEAPU8[$3 + 31040 | 0] | 0; if ($2_1) { break block2 } } $1_1 = $1_1 + 1 | 0; $0_1 = $0_1 + 1 | 0; continue; } break; }; return $2_1; } function $68($0_1, $1_1, $2_1) { var $3 = 0; if (!$0_1) { return $1_1 ? -1 : 0 } if (!$1_1) { return 1 } while (1) { if (($2_1 | 0) <= 0) { return 0 } block4 : { $3 = HEAPU8[$0_1 | 0]; if (!$3) { $3 = 0; break block4; } $3 = HEAPU8[$3 + 31040 | 0]; if (($3 | 0) != HEAPU8[HEAPU8[$1_1 | 0] + 31040 | 0]) { break block4 } $2_1 = $2_1 - 1 | 0; $1_1 = $1_1 + 1 | 0; $0_1 = $0_1 + 1 | 0; continue; } break; }; return $3 - HEAPU8[HEAPU8[$1_1 | 0] + 31040 | 0] | 0; } function $69($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $6_1 = global$0 - 1088 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $12_1 = $3 & 1048320; $13_1 = $3 & 4; $9_1 = 0; block : { if (!$13_1) { break block } $9_1 = 1; if (($12_1 | 0) == 2048) { break block } $9_1 = 1; if (($12_1 | 0) == 16384) { break block } $9_1 = 1; if (($12_1 | 0) == 524288) { break block } $9_1 = 0; } if (HEAP32[20649] != 42) { HEAP32[20649] = 42; $65(0, 0); } wasm2js_memory_fill($2_1, 0, 52); block6 : { block8 : { block7 : { block5 : { if (($12_1 | 0) == 256) { $5_1 = $70($1_1, $3); if ($5_1) { $7_1 = HEAP32[$5_1 >> 2]; break block5; } $7_1 = -1; $5_1 = $31(12, 0); if ($5_1) { break block5 } $5_1 = 7; break block6; } $7_1 = -1; if ($1_1) { break block7 } $8_1 = $6_1 + 16 | 0; $5_1 = $71(HEAP32[$0_1 + 8 >> 2], $8_1); if ($5_1) { break block6 } $5_1 = $8_1; break block8; } HEAP32[$2_1 + 28 >> 2] = $5_1; } $5_1 = $1_1; } $8_1 = $5_1; $10_1 = $3 & 1; $15_1 = $3 & 8; block23 : { block10 : { if (($7_1 | 0) >= 0) { $5_1 = $3; break block10; } HEAP32[$6_1 + 1072 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; $11_1 = $3 & 526336; block15 : { block12 : { if ($11_1) { $7_1 = $48($8_1); while (1) { $5_1 = 0; if (($7_1 | 0) < 2) { break block12 } block13 : { $7_1 = $7_1 - 1 | 0; switch (HEAPU8[$8_1 + $7_1 | 0] - 45 | 0) { case 1: break block12; case 0: break block13; default: continue; }; } break; }; if ($7_1) { wasm2js_memory_copy($6_1 + 544 | 0, $8_1, $7_1) } $5_1 = $6_1 + 544 | 0; HEAP8[$5_1 + $7_1 | 0] = 0; $5_1 = $72($5_1, $6_1 + 1072 | 0, $6_1 + 12 | 0, $6_1 + 8 | 0); break block12; } $14 = 384; if ($15_1) { break block15 } $14 = 0; if (!($3 & 64)) { break block15 } $5_1 = $73($8_1, 12731); if (!$5_1) { break block15 } $5_1 = $72($5_1, $6_1 + 1072 | 0, $6_1 + 12 | 0, $6_1 + 8 | 0); } if ($5_1) { break block6 } $14 = HEAP32[$6_1 + 1072 >> 2]; } $5_1 = $3 & 2; $13_1 = $5_1 | ($3 << 3 & 128 | $13_1 << 4) | 131072; $7_1 = $74($8_1, $13_1, $14); block17 : { if (($7_1 | 0) >= 0) { $5_1 = $3; break block17; } block22 : { block19 : { block18 : { if (!$9_1 | HEAP32[20691] != 2) { break block18 } $11_1 = 0; if (!(FUNCTION_TABLE[HEAP32[18971]]($8_1, 0) | 0)) { break block18 } $10_1 = 1544; break block19; } $11_1 = 1; $10_1 = 0; if (!$5_1 | HEAP32[20691] == 31) { break block19 } $5_1 = $3 & -8 | 1; $10_1 = $70($8_1, $5_1); block21 : { if ($10_1) { $7_1 = HEAP32[$10_1 >> 2]; $24($10_1); break block21; } $7_1 = $74($8_1, $13_1 & 131200, $14); } $10_1 = 0; if (($7_1 | 0) >= 0) { break block22 } } $5_1 = (wasm2js_i32$0 = $76($75(44994), 11401, $8_1, 44994), wasm2js_i32$1 = $10_1, wasm2js_i32$2 = $11_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); break block23; } $11_1 = $3 & 526336; $10_1 = 1; } if (!$14 | !$11_1) { break block10 } $3 = HEAP32[$6_1 + 8 >> 2]; $11_1 = HEAP32[$6_1 + 12 >> 2]; if (FUNCTION_TABLE[HEAP32[19028]]() | 0) { break block10 } FUNCTION_TABLE[HEAP32[19025]]($7_1, $11_1, $3) | 0; } if ($4_1) { HEAP32[$4_1 >> 2] = $5_1 } $3 = HEAP32[$2_1 + 28 >> 2]; if ($3) { HEAP32[$3 >> 2] = $7_1; HEAP32[$3 + 4 >> 2] = $5_1 & 3; } if ($15_1) { FUNCTION_TABLE[HEAP32[19013]]($8_1) | 0 } HEAP32[$2_1 + 32 >> 2] = $1_1; HEAP32[$2_1 + 4 >> 2] = $0_1; HEAP32[$2_1 + 12 >> 2] = $7_1; $3 = $15_1 << 2; $3 = $10_1 ? $3 | 2 : $3; $3 = ($12_1 | 0) == 256 ? $3 : $3 | 128; $4_1 = $9_1 ? $3 | 8 : $3; $3 = $4_1 | $5_1 & 64; HEAP16[$2_1 + 18 >> 1] = $3; if ($77($3 << 25 >> 31 & $1_1, 1675, 1)) { HEAP16[$2_1 + 18 >> 1] = HEAPU16[$2_1 + 18 >> 1] | 16 } if (!$2073(HEAP32[$0_1 + 16 >> 2], 11859)) { HEAP16[$2_1 + 18 >> 1] = HEAPU16[$2_1 + 18 >> 1] | 1 } $3 = 33276; block32 : { block40 : { block29 : { if ($4_1 & 128) { break block29 } $3 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 + 20 >> 2] >> 2]]($1_1, $2_1) | 0; if (($3 | 0) == 33200) { if (FUNCTION_TABLE[HEAP32[18980]](HEAP32[$2_1 + 12 >> 2], $6_1 + 544 | 0) | 0) { $0_1 = HEAP32[20691]; HEAP32[$2_1 + 20 >> 2] = $0_1; $5_1 = ($0_1 | 0) == 61 ? 22 : 10; break block32; } HEAP32[$6_1 + 1072 >> 2] = 0; HEAP32[$6_1 + 1076 >> 2] = 0; $0_1 = HEAP32[$6_1 + 636 >> 2]; HEAP32[$6_1 + 1080 >> 2] = HEAP32[$6_1 + 632 >> 2]; HEAP32[$6_1 + 1084 >> 2] = $0_1; HEAP32[$6_1 + 1072 >> 2] = HEAP32[$6_1 + 544 >> 2]; $3 = 82592; block39 : { block34 : { while (1) { $3 = HEAP32[$3 >> 2]; if ($3) { if (!$2014($6_1 + 1072 | 0, $3, 16)) { break block34 } $3 = $3 + 44 | 0; continue; } break; }; $3 = $31(56, 0); if (!$3) { $5_1 = 7; break block32; } $0_1 = $3 + 16 | 0; wasm2js_memory_fill($0_1, 0, 40); $1_1 = $6_1 + 1080 | 0; $4_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $3 + 8 | 0; HEAP32[$5_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$5_1 + 4 >> 2] = $4_1; $1_1 = HEAP32[$6_1 + 1076 >> 2]; HEAP32[$3 >> 2] = HEAP32[$6_1 + 1072 >> 2]; HEAP32[$3 + 4 >> 2] = $1_1; if (HEAPU8[75548]) { HEAP32[$0_1 >> 2] = 8 } HEAP32[$3 + 36 >> 2] = 1; $0_1 = HEAP32[20648]; HEAP32[$3 + 48 >> 2] = 0; HEAP32[$3 + 44 >> 2] = $0_1; if ($0_1) { HEAP32[$0_1 + 48 >> 2] = $3 } HEAP32[20648] = $3; break block39; } HEAP32[$3 + 36 >> 2] = HEAP32[$3 + 36 >> 2] + 1; } HEAP32[$2_1 + 8 >> 2] = $3; $3 = 33200; break block29; } if (($3 | 0) != 33352) { break block29 } $0_1 = $2080($1_1) + 6 | 0; $3 = $31($0_1, $0_1 >> 31); if (!$3) { break block40 } HEAP32[$6_1 >> 2] = $1_1; HEAP32[$2_1 + 24 >> 2] = $63($0_1, $3, 12045, $6_1); $3 = 33352; } HEAP32[$2_1 >> 2] = $3; $5_1 = 0; HEAP32[$2_1 + 20 >> 2] = 0; $78($2_1); break block6; } HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 + 24 >> 2] = 0; $79($2_1, $7_1, 44546); $5_1 = 7; break block23; } $79($2_1, $7_1, 44461); HEAP32[$2_1 + 20 >> 2] = 0; } $24(HEAP32[$2_1 + 28 >> 2]); } $0_1 = $6_1 + 1088 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1 | 0; } function $70($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 96 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (!HEAP32[20648]) { break block } block1 : { if (FUNCTION_TABLE[HEAP32[18977]]($0_1, $3) | 0) { break block1 } $2_1 = 82592; $0_1 = HEAP32[$3 + 88 >> 2]; $4_1 = HEAP32[$3 + 92 >> 2]; $5_1 = HEAP32[$3 >> 2]; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block1 } if (!(HEAP32[$2_1 + 8 >> 2] == ($0_1 | 0) & ($4_1 | 0) == HEAP32[$2_1 + 12 >> 2] & HEAP32[$2_1 >> 2] == ($5_1 | 0))) { $2_1 = $2_1 + 44 | 0; continue; } break; }; $0_1 = $2_1 + 32 | 0; $4_1 = $1_1 & 3; while (1) { $1_1 = $0_1; $2_1 = HEAP32[$0_1 >> 2]; if (!$2_1) { break block1 } $0_1 = $2_1 + 8 | 0; if (($4_1 | 0) != HEAP32[$2_1 + 4 >> 2]) { continue } break; }; HEAP32[$1_1 >> 2] = HEAP32[$0_1 >> 2]; break block; } $2_1 = 0; } $0_1 = $3 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $71($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = global$0 - 128 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP8[$1_1 | 0] = 0; $3 = 82464; block3 : { while (1) { block1 : { $3 = HEAP32[$3 >> 2]; block : { if (!$3) { break block } if (FUNCTION_TABLE[HEAP32[18977]]($3, $2_1 + 32 | 0) | (HEAP32[$2_1 + 36 >> 2] & 61440) != 16384) { break block } if (!(FUNCTION_TABLE[HEAP32[18971]]($3, 3) | 0)) { break block1 } } if (($4_1 | 0) == 6) { $5_1 = 6410; break block3; } else { $3 = ($4_1 << 2) + 76208 | 0; $4_1 = $4_1 + 1 | 0; continue; } } break; }; $6_1 = ($0_1 + $1_1 | 0) - 2 | 0; $7_1 = $2_1 + 16 | 0; $4_1 = 0; while (1) { block4 : { $65(8, $2_1 + 32 | 0); HEAP8[$6_1 | 0] = 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$2_1 >> 2] = $3; $5_1 = HEAP32[$2_1 + 36 >> 2]; HEAP32[$2_1 + 8 >> 2] = HEAP32[$2_1 + 32 >> 2]; HEAP32[$2_1 + 12 >> 2] = $5_1; $8_1 = $63($0_1, $1_1, 18043, $2_1); if (HEAPU8[$6_1 | 0] | $4_1 >>> 0 > 10) { break block4 } $4_1 = $4_1 + 1 | 0; $5_1 = 0; if (!(FUNCTION_TABLE[HEAP32[18971]]($8_1, 0) | 0)) { continue } break block3; } break; }; $5_1 = 1; } $0_1 = $2_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $72($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 96 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = 1802; if (!(FUNCTION_TABLE[HEAP32[18977]]($0_1, $4_1) | 0)) { HEAP32[$1_1 >> 2] = HEAP32[$4_1 + 4 >> 2] & 511; HEAP32[$2_1 >> 2] = HEAP32[$4_1 + 12 >> 2]; HEAP32[$3 >> 2] = HEAP32[$4_1 + 16 >> 2]; $5_1 = 0; } $0_1 = $4_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $73($0_1, $1_1) { var $2_1 = 0; block : { if (!$0_1 | !$1_1) { break block } $0_1 = $435($0_1); while (1) { $0_1 = $48($0_1) + $0_1 | 0; if (!HEAPU8[$0_1 + 1 | 0]) { break block } $0_1 = $0_1 + 1 | 0; $2_1 = $2073($0_1, $1_1); $0_1 = ($48($0_1) + $0_1 | 0) + 1 | 0; if ($2_1) { continue } break; }; return $0_1; } return 0; } function $74($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 112 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $1_1 | 524288; $5_1 = $2_1 ? $2_1 : 420; $6_1 = ($1_1 & 192) != 192; block1 : { block2 : { while (1) { $1_1 = FUNCTION_TABLE[HEAP32[18965]]($0_1, $4_1, $5_1) | 0; if (($1_1 | 0) < 0) { if (HEAP32[20691] == 27) { continue } break block1; } if ($1_1 >>> 0 > 2) { break block2 } if (!$6_1) { FUNCTION_TABLE[HEAP32[19013]]($0_1) | 0 } FUNCTION_TABLE[HEAP32[18968]]($1_1) | 0; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $0_1; $64(28, 17218, $3); if ((FUNCTION_TABLE[HEAP32[18965]](11736, 0, $2_1) | 0) >= 0) { continue } break; }; $1_1 = -1; break block1; } if (!$2_1) { break block1 } if (FUNCTION_TABLE[HEAP32[18980]]($1_1, $3 + 16 | 0) | (HEAP32[$3 + 40 >> 2] | HEAP32[$3 + 44 >> 2] | (HEAP32[$3 + 20 >> 2] & 511) == ($2_1 | 0))) { break block1 } FUNCTION_TABLE[HEAP32[19007]]($1_1, $2_1) | 0; } $0_1 = $3 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $75($0_1) { $2(14, $0_1, 14181); return 14; } function $76($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[20691]; HEAP32[$4_1 + 16 >> 2] = $2078($5_1); HEAP32[$4_1 + 12 >> 2] = $2_1 ? $2_1 : 30822; HEAP32[$4_1 + 8 >> 2] = $1_1; HEAP32[$4_1 + 4 >> 2] = $5_1; HEAP32[$4_1 >> 2] = $3; $64($0_1, 8904, $4_1); $1_1 = $4_1 + 32 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $77($0_1, $1_1, $2_1) { $0_1 = $73($0_1, $1_1); if ($0_1) { return $436($0_1, ($2_1 | 0) != 0) } return ($2_1 | 0) != 0; } function $78($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 112 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block : { if (HEAPU8[$0_1 + 18 | 0] & 128) { break block } block2 : { if (FUNCTION_TABLE[HEAP32[18980]](HEAP32[$0_1 + 12 >> 2], $1_1 + 16 | 0) | 0) { $2_1 = 6957; break block2; } $2_1 = 8031; block3 : { switch (HEAP32[$1_1 + 24 >> 2]) { default: $2_1 = 8425; break block2; case 0: break block2; case 1: break block3; }; } if (!$462($0_1)) { break block } $2_1 = 8003; } HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 32 >> 2]; $64(28, $2_1, $1_1); } $0_1 = $1_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $79($0_1, $1_1, $2_1) { var $3 = 0; if (FUNCTION_TABLE[HEAP32[18968]]($1_1) | 0) { $76(4106, 13605, $0_1 ? HEAP32[$0_1 + 32 >> 2] : $3, $2_1) } } function $80($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; block1 : { if ((FUNCTION_TABLE[HEAP32[19013]]($1_1) | 0) == -1) { $3 = 5898; if (HEAP32[20691] == 44) { break block1 } $3 = 2570; $76(2570, 11979, $1_1, 45133); break block1; } if (!($2_1 & 1)) { break block1 } if (FUNCTION_TABLE[HEAP32[19016]]($1_1, $0_1 + 12 | 0) | 0) { break block1 } if ($1993(HEAP32[$0_1 + 12 >> 2])) { $76(1290, 17612, $1_1, 45143); $3 = 1290; } $79(0, HEAP32[$0_1 + 12 >> 2], 45145); } $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $81($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $0_1 = global$0 - 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; block2 : { if (!$2_1) { $2_1 = 0; if (!(FUNCTION_TABLE[HEAP32[18977]]($1_1, $0_1) | 0)) { $1_1 = HEAP32[$0_1 + 24 >> 2]; $2_1 = HEAP32[$0_1 + 28 >> 2]; if (($2_1 | 0) > 0) { $1_1 = 1 } else { $1_1 = !!$1_1 & ($2_1 | 0) >= 0 } $2_1 = $1_1 | (HEAP32[$0_1 + 4 >> 2] & 61440) != 32768; } HEAP32[$3 >> 2] = $2_1; break block2; } HEAP32[$3 >> 2] = !(FUNCTION_TABLE[HEAP32[18971]]($1_1, 6) | 0); } $0_1 = $0_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $82($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $0_1 = global$0 - 4128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; HEAP32[$0_1 + 4124 >> 2] = 0; HEAP32[$0_1 + 4108 >> 2] = 0; HEAP32[$0_1 + 4112 >> 2] = 0; HEAP32[$0_1 + 4120 >> 2] = $2_1; HEAP32[$0_1 + 4116 >> 2] = $3; block2 : { if (HEAPU8[$1_1 | 0] != 47) { if (!(FUNCTION_TABLE[HEAP32[18974]]($0_1, 4096) | 0)) { $1_1 = $76($75(45308), 14971, $1_1, 45308); break block2; } $83($0_1 + 4108 | 0, $0_1); } $83($0_1 + 4108 | 0, $1_1); $1_1 = HEAP32[$0_1 + 4124 >> 2]; HEAP8[$1_1 + $3 | 0] = 0; if (!(!HEAP32[$0_1 + 4108 >> 2] & ($1_1 | 0) >= 2)) { $1_1 = $75(45314); break block2; } $1_1 = HEAP32[$0_1 + 4112 >> 2] ? 512 : 0; } $0_1 = $0_1 + 4128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $83($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 4208 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; while (1) { $5_1 = $2_1; while (1) { $7_1 = $1_1 + $5_1 | 0; $3 = HEAPU8[$7_1 | 0]; if (!(!$3 | ($3 | 0) == 47)) { $5_1 = $5_1 + 1 | 0; continue; } break; }; block1 : { if (($2_1 | 0) >= ($5_1 | 0)) { break block1 } $6_1 = $5_1 - $2_1 | 0; block3 : { $3 = $1_1 + $2_1 | 0; if (HEAPU8[$3 | 0] != 46) { $2_1 = HEAP32[$0_1 + 16 >> 2]; break block3; } if (($6_1 | 0) == 1) { break block1 } $2_1 = HEAP32[$0_1 + 16 >> 2]; if (($6_1 | 0) != 2 | HEAPU8[$3 + 1 | 0] != 46) { break block3 } if (($2_1 | 0) < 2) { break block1 } $3 = HEAP32[$0_1 + 8 >> 2]; while (1) { $2_1 = $2_1 - 1 | 0; HEAP32[$0_1 + 16 >> 2] = $2_1; if (HEAPU8[$2_1 + $3 | 0] != 47) { continue } break; }; break block1; } if (HEAP32[$0_1 + 12 >> 2] <= (($2_1 + $6_1 | 0) + 2 | 0)) { HEAP32[$0_1 >> 2] = 1; break block1; } HEAP32[$0_1 + 16 >> 2] = $2_1 + 1; HEAP8[HEAP32[$0_1 + 8 >> 2] + $2_1 | 0] = 47; if ($6_1) { wasm2js_memory_copy(HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0, $3, $6_1) } $2_1 = HEAP32[$0_1 + 16 >> 2] + $6_1 | 0; HEAP32[$0_1 + 16 >> 2] = $2_1; if (HEAP32[$0_1 >> 2]) { break block1 } HEAP8[$2_1 + HEAP32[$0_1 + 8 >> 2] | 0] = 0; $3 = HEAP32[$0_1 + 8 >> 2]; if (FUNCTION_TABLE[HEAP32[19046]]($3, $4_1 + 4112 | 0) | 0) { if (HEAP32[20691] == 44) { break block1 } HEAP32[$0_1 >> 2] = $76($75(45239), 3578, $3, 45239); break block1; } if ((HEAP32[$4_1 + 4116 >> 2] & 61440) != 40960) { break block1 } $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = $2_1 + 1; block9 : { block8 : { if (($2_1 | 0) >= 201) { $2_1 = $75(45245); break block8; } $2_1 = FUNCTION_TABLE[HEAP32[19043]]($3, $4_1, 4096) | 0; if ($2_1 - 4096 >>> 0 > 4294963200) { break block9 } $2_1 = $76($75(45250), 11986, $3, 45250); } HEAP32[$0_1 >> 2] = $2_1; break block1; } HEAP8[$2_1 + $4_1 | 0] = 0; HEAP32[$0_1 + 16 >> 2] = HEAPU8[$4_1 | 0] != 47 ? HEAP32[$0_1 + 16 >> 2] + ($6_1 ^ -1) | 0 : 0; $83($0_1, $4_1); } $2_1 = $5_1 + 1 | 0; if (HEAPU8[$7_1 | 0]) { continue } break; }; $0_1 = $4_1 + 4208 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $84($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0.0, $5_1 = 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; if ($1_1) { wasm2js_memory_fill($2_1, 0, $1_1) } HEAP32[20649] = 42; $3 = $74(11557, 0, 0); block3 : { if (($3 | 0) >= 0) { while (1) { if ((FUNCTION_TABLE[HEAP32[18989]]($3, $2_1, $1_1) | 0) < 0 & HEAP32[20691] == 27) { continue } break; }; $79(0, $3, 45415); break block3; } $1_1 = $0_1 + 8 | 0; $3 = 0; $4_1 = +fimport$3() / 1.0e3; if (Math_abs($4_1) < 9223372036854775808.0) { $3 = ~~$4_1 >>> 0; if (Math_abs($4_1) >= 1.0) { $5_1 = ~~($4_1 > 0.0 ? Math_min(Math_floor($4_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($4_1 - +(~~$4_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $5_1 = 0 } } else { $5_1 = -2147483648 } if ($1_1) { HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $5_1; } i64toi32_i32$HIGH_BITS = $5_1; $1_1 = HEAP32[$0_1 + 12 >> 2]; $3 = HEAP32[$0_1 + 8 >> 2]; HEAP8[$2_1 | 0] = $3; HEAP8[$2_1 + 1 | 0] = $3 >>> 8; HEAP8[$2_1 + 2 | 0] = $3 >>> 16; HEAP8[$2_1 + 3 | 0] = $3 >>> 24; HEAP8[$2_1 + 4 | 0] = $1_1; HEAP8[$2_1 + 5 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 6 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 7 | 0] = $1_1 >>> 24; $1_1 = HEAP32[20649]; HEAP8[$2_1 + 8 | 0] = $1_1; HEAP8[$2_1 + 9 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 10 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 11 | 0] = $1_1 >>> 24; $1_1 = 12; } $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $85($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0.0, $7_1 = 0.0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $2_1 = ($1_1 | 0) / 1e6 | 0; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $2_1 >> 31; HEAP32[$0_1 + 8 >> 2] = Math_imul($1_1 - Math_imul($2_1, 1e6) | 0, 1e3); $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = 28; block : { if (!$0_1) { break block } $4_1 = HEAP32[$0_1 + 8 >> 2]; if ($4_1 >>> 0 > 999999999) { break block } $5_1 = HEAP32[$0_1 + 4 >> 2]; if (($5_1 | 0) < 0) { break block } $6_1 = (+HEAPU32[$0_1 >> 2] + +($5_1 | 0) * 4294967296.0) * 1.0e3 + +($4_1 | 0) / 1.0e6; $7_1 = +fimport$17(); while (1) { if (+fimport$17() - $7_1 < $6_1) { continue } break; }; $3 = 0; } $2_1 = $2_1 + 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2087(0 - $3 | 0); $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $86($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $87($0_1, $0_1 + 8 | 0); HEAPF64[$1_1 >> 3] = (+HEAPU32[$0_1 + 8 >> 2] + +HEAP32[$0_1 + 12 >> 2] * 4294967296.0) / 864.0e5; $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $87($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0.0, $4_1 = 0, $5_1 = 0.0, $6_1 = 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $5_1 = +fimport$3(); $3 = $5_1 / 1.0e3; if (Math_abs($3) < 9223372036854775808.0) { $4_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $2_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $2_1 = 0 } } else { $2_1 = -2147483648 } HEAP32[$0_1 >> 2] = $4_1; HEAP32[$0_1 + 4 >> 2] = $2_1; $3 = ($5_1 - (+(__wasm_i64_mul($4_1, $2_1, 1e3, 0) >>> 0) + +(i64toi32_i32$HIGH_BITS | 0) * 4294967296.0)) * 1.0e3; if (Math_abs($3) < 2147483647.0) { $2_1 = ~~$3 } else { $2_1 = -2147483648 } HEAP32[$0_1 + 8 >> 2] = $2_1; $4_1 = __wasm_i64_mul(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2], 1e3, 0); $2_1 = HEAP32[$0_1 + 8 >> 2] / 1e3 | 0; $4_1 = $4_1 + $2_1 | 0; $6_1 = i64toi32_i32$HIGH_BITS + ($2_1 >> 31) | 0; $2_1 = ($2_1 >>> 0 > $4_1 >>> 0 ? $6_1 + 1 | 0 : $6_1) + 49096 | 0; $4_1 = $4_1 + 1045635584 | 0; $2_1 = $4_1 >>> 0 < 1045635584 ? $2_1 + 1 | 0 : $2_1; HEAP32[$1_1 >> 2] = $4_1; HEAP32[$1_1 + 4 >> 2] = $2_1; $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $88($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return HEAP32[20691]; } function $89($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $0_1 = 0; block3 : { block1 : { if (!$1_1) { while (1) { if (($0_1 | 0) == 29) { break block1 } $1_1 = Math_imul($0_1, 12); $2_1 = HEAP32[$1_1 + 75864 >> 2]; if ($2_1) { HEAP32[($1_1 + 75856 | 0) + 4 >> 2] = $2_1 } $0_1 = $0_1 + 1 | 0; continue; } } $4_1 = 12; while (1) { if (($0_1 | 0) == 29) { break block3 } $3 = Math_imul($0_1, 12); $0_1 = $0_1 + 1 | 0; $3 = $3 + 75856 | 0; if ($2073($1_1, HEAP32[$3 >> 2])) { continue } break; }; $0_1 = HEAP32[$3 + 8 >> 2]; if (!$0_1) { $0_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$3 + 8 >> 2] = $0_1; } HEAP32[$3 + 4 >> 2] = $2_1 ? $2_1 : $0_1; } $4_1 = 0; } return $4_1 | 0; } function $90($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $0_1 = 0; block : { while (1) { if (($0_1 | 0) == 29) { break block } $2_1 = Math_imul($0_1, 12); $0_1 = $0_1 + 1 | 0; $2_1 = $2_1 + 75856 | 0; if ($2073($1_1, HEAP32[$2_1 >> 2])) { continue } break; }; $3 = HEAP32[$2_1 + 4 >> 2]; } return $3 | 0; } function $91($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; block1 : { if (!$1_1) { $0_1 = -1; break block1; } while (1) { $0_1 = 28; if (($2_1 | 0) == 28) { break block1 } if ($2073($1_1, HEAP32[Math_imul($2_1, 12) + 75856 >> 2])) { $2_1 = $2_1 + 1 | 0; continue; } else { $0_1 = $2_1 } break; }; } while (1) { if (($0_1 | 0) == 28) { return 0 } $0_1 = $0_1 + 1 | 0; $1_1 = Math_imul($0_1, 12); if (!HEAP32[$1_1 + 75860 >> 2]) { continue } break; }; return HEAP32[$1_1 + 75856 >> 2]; } function $92($0_1, $1_1) { var $2_1 = 0, $3 = 0; if (!$1_1) { return -1 } $2_1 = HEAP32[$0_1 + 20 >> 2] - 1 | 0; $3 = ($2_1 | 0) >= -1 ? -1 : $2_1; $0_1 = HEAP32[$0_1 + 16 >> 2] + ($2_1 << 4) | 0; while (1) { block3 : { if (($2_1 | 0) >= 0) { if (!$66(HEAP32[$0_1 >> 2], $1_1)) { return $2_1 } if ($2_1) { break block3 } if ($67(11378, $1_1)) { break block3 } $3 = 0; } return $3; } $0_1 = $0_1 - 16 | 0; $2_1 = $2_1 - 1 | 0; continue; }; } function $93($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; return $102($0_1, $1_1, $2_1, 128, 0, $3, $4_1) | 0; } function $94($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0; $4_1 = global$0 - 224 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block1 : { if ($103($0_1)) { $2_1 = $1(91561); break block1; } $22_1 = $0_1 + 104 | 0; $18_1 = $0_1 + 136 | 0; $12_1 = HEAP32[$0_1 >> 2]; $7_1 = $12_1; while (1) { block6 : { block2 : { $2_1 = HEAPU8[$0_1 + 151 | 0]; if (($2_1 | 0) == 2) { break block2 } while (1) { block4 : { switch (($2_1 & 255) - 1 | 0) { case 0: if (HEAPU8[$0_1 + 152 | 0] & 3) { HEAP32[$0_1 + 36 >> 2] = 17; $2_1 = 1; if (HEAP8[$0_1 + 150 | 0] >= 0) { break block6 } $2_1 = $104($0_1); break block6; } $1_1 = HEAP32[$7_1 + 184 >> 2]; if (!$1_1) { HEAP32[$7_1 + 296 >> 2] = 0 } if (!(!HEAP32[$0_1 + 200 >> 2] | (HEAPU8[$7_1 + 177 | 0] | !(HEAPU8[$7_1 + 94 | 0] & 130)))) { $105(HEAP32[$7_1 >> 2], $18_1); $1_1 = HEAP32[$7_1 + 184 >> 2]; } HEAP32[$7_1 + 184 >> 2] = $1_1 + 1; $1_1 = HEAPU16[$0_1 + 152 >> 1]; if (!($1_1 & 64)) { HEAP32[$7_1 + 192 >> 2] = HEAP32[$7_1 + 192 >> 2] + 1; $1_1 = HEAPU16[$0_1 + 152 >> 1]; } if ($1_1 & 128) { HEAP32[$7_1 + 188 >> 2] = HEAP32[$7_1 + 188 >> 2] + 1 } HEAP8[$0_1 + 151 | 0] = 2; HEAP32[$0_1 + 32 >> 2] = 0; break block2; case 2: break block4; default: break block2; }; } $96($0_1); $2_1 = HEAPU8[$0_1 + 151 | 0]; continue; }; } block14 : { block21 : { block19 : { block17 : { $1_1 = HEAPU16[$0_1 + 152 >> 1] & 12; if ($1_1) { $14 = HEAP32[$0_1 >> 2]; $1_1 = HEAP8[$14 + 35 | 0] & 1 | ($1_1 | 0) == 4; $9_1 = HEAP32[$0_1 + 88 >> 2]; $16_1 = $9_1 + 40 | 0; $15($16_1, 8); if (HEAP32[$0_1 + 36 >> 2] == 7) { $106($14); $2_1 = 1; break block14; } $3 = 0; $5_1 = HEAPU16[$0_1 + 152 >> 1] & 12; $15_1 = HEAP32[$0_1 + 108 >> 2]; $8_1 = $1_1 ? HEAP32[$0_1 + 88 >> 2] + 360 | 0 : 0; if (!$8_1) { $11_1 = 0; break block17; } $2_1 = 0; $11_1 = 0; if (HEAPU8[$8_1 + 16 | 0] & 16) { $11_1 = HEAP32[$8_1 + 8 >> 2]; $3 = HEAP32[$8_1 + 12 >> 2] >>> 2 | 0; } while (1) { if (($2_1 | 0) == ($3 | 0)) { break block17 } $15_1 = HEAP32[HEAP32[($2_1 << 2) + $11_1 >> 2] + 4 >> 2] + $15_1 | 0; $2_1 = $2_1 + 1 | 0; continue; }; } HEAP32[$7_1 + 196 >> 2] = HEAP32[$7_1 + 196 >> 2] + 1; $2_1 = $107($0_1); HEAP32[$7_1 + 196 >> 2] = HEAP32[$7_1 + 196 >> 2] - 1; if (($2_1 | 0) != 100) { break block14 } break block19; } $1_1 = HEAP32[$0_1 + 32 >> 2]; $23_1 = ($5_1 | 0) != 8; while (1) { $10_1 = $1_1 + 1 | 0; if (($1_1 | 0) >= ($15_1 | 0)) { HEAP32[$0_1 + 36 >> 2] = 0; $2_1 = 101; break block21; } $5_1 = $22_1; block22 : { $2_1 = $1_1; $6_1 = HEAP32[$0_1 + 108 >> 2]; if (($1_1 | 0) < ($6_1 | 0)) { break block22 } $2_1 = $1_1 - $6_1 | 0; $6_1 = 0; while (1) { $5_1 = HEAP32[($6_1 << 2) + $11_1 >> 2]; $13_1 = HEAP32[$5_1 + 4 >> 2]; if (($13_1 | 0) > ($2_1 | 0)) { break block22 } $6_1 = $6_1 + 1 | 0; $2_1 = $2_1 - $13_1 | 0; continue; }; } $13_1 = HEAP32[$5_1 >> 2]; block23 : { if (!$8_1) { break block23 } $17_1 = Math_imul($2_1, 20) + $13_1 | 0; if (HEAPU8[$17_1 + 1 | 0] != 252) { break block23 } $6_1 = 0; $19_1 = ($3 | 0) > 0 ? $3 : 0; $5_1 = $3 + 1 | 0; $20_1 = $5_1 << 2; while (1) { block25 : { if (($6_1 | 0) != ($19_1 | 0)) { if (HEAP32[($6_1 << 2) + $11_1 >> 2] != HEAP32[$17_1 + 16 >> 2]) { break block25 } } else { $6_1 = $19_1 } if (($6_1 | 0) != ($3 | 0)) { break block23 } $6_1 = $108($8_1, $20_1, ($3 | 0) != 0); HEAP32[$0_1 + 36 >> 2] = $6_1; if ($6_1) { $2_1 = 1; break block21; } $11_1 = HEAP32[$8_1 + 8 >> 2]; HEAP32[$11_1 + ($3 << 2) >> 2] = HEAP32[$17_1 + 16 >> 2]; HEAP32[$8_1 + 12 >> 2] = $20_1; HEAP16[$8_1 + 16 >> 1] = HEAPU16[$8_1 + 16 >> 1] & 62016 | 16; $15_1 = HEAP32[HEAP32[$17_1 + 16 >> 2] + 4 >> 2] + $15_1 | 0; $3 = $5_1; break block23; } $6_1 = $6_1 + 1 | 0; continue; }; } block27 : { if ($23_1) { break block27 } $5_1 = HEAPU8[Math_imul($2_1, 20) + $13_1 | 0]; if (($5_1 | 0) == 188) { break block27 } $6_1 = ($1_1 | 0) <= 0; $1_1 = $10_1; if (($5_1 | 0) != 8 | $6_1) { continue } } break; }; HEAP32[$0_1 + 32 >> 2] = $10_1; if (HEAP32[$14 + 296 >> 2]) { HEAP32[$0_1 + 36 >> 2] = 9; $109($0_1, 15606, 0); $2_1 = 1; break block14; } HEAP16[$4_1 + 220 >> 1] = 0; HEAP32[$4_1 + 216 >> 2] = 0; HEAP32[$4_1 + 208 >> 2] = 0; HEAP32[$4_1 + 212 >> 2] = 1e9; HEAP32[$4_1 + 200 >> 2] = 0; HEAP32[$4_1 + 204 >> 2] = 0; $6_1 = 11656; block46 : { block40 : { block48 : { block30 : { block29 : { block39 : { block32 : { block35 : { block36 : { block34 : { block41 : { block33 : { block31 : { block38 : { block42 : { block37 : { $1_1 = Math_imul($2_1, 20) + $13_1 | 0; switch (HEAPU8[$1_1 + 1 | 0] - 239 | 0) { case 0: break block29; case 2: break block31; case 3: break block32; case 4: break block33; case 5: break block34; case 6: break block35; case 7: break block36; case 9: break block37; case 10: break block38; case 12: break block39; case 13: break block40; case 14: break block41; case 15: break block42; default: break block30; }; } $3 = HEAP32[$1_1 + 16 >> 2]; HEAP32[$4_1 + 16 >> 2] = HEAPU16[$3 + 6 >> 1]; $46($4_1 + 200 | 0, 16836, $4_1 + 16 | 0); $10_1 = $3 + 20 | 0; $6_1 = 0; while (1) { if ($6_1 >>> 0 < HEAPU16[$3 + 6 >> 1]) { $5_1 = HEAPU8[HEAP32[$3 + 16 >> 2] + $6_1 | 0]; $8_1 = HEAP32[$10_1 + ($6_1 << 2) >> 2]; if ($8_1) { $8_1 = HEAP32[$8_1 >> 2] } else { $8_1 = 30822 } HEAP32[$4_1 + 8 >> 2] = $2073($8_1, 33712) ? $8_1 : 21015; HEAP32[$4_1 + 4 >> 2] = $5_1 & 2 ? 25081 : 30822; HEAP32[$4_1 >> 2] = $5_1 & 1 ? 25085 : 30822; $46($4_1 + 200 | 0, 6103, $4_1); $6_1 = $6_1 + 1 | 0; continue; } break; }; $36($4_1 + 200 | 0, 27781, 1); break block46; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAPU8[$3 + 4 | 0]; HEAP32[$4_1 + 32 >> 2] = HEAP32[$3 >> 2]; HEAP32[$4_1 + 36 >> 2] = HEAP32[($5_1 << 2) + 33728 >> 2]; $46($4_1 + 200 | 0, 6440, $4_1 + 32 | 0); break block46; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$3 + 32 >> 2]; HEAP32[$4_1 + 52 >> 2] = HEAP16[$3 >> 1]; HEAP32[$4_1 + 48 >> 2] = $5_1; $46($4_1 + 200 | 0, 25717, $4_1 + 48 | 0); break block46; } $3 = HEAP32[HEAP32[$1_1 + 16 >> 2] + 4 >> 2]; $5_1 = HEAP32[$3 + 32 >> 2]; HEAP32[$4_1 + 68 >> 2] = HEAP16[$3 >> 1]; HEAP32[$4_1 + 64 >> 2] = $5_1; $46($4_1 + 200 | 0, 25717, $4_1 - -64 | 0); break block46; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 80 >> 2] = HEAP32[$3 >> 2]; HEAP32[$4_1 + 84 >> 2] = $5_1; $46($4_1 + 200 | 0, 15092, $4_1 + 80 | 0); break block46; } HEAP32[$4_1 + 96 >> 2] = HEAP32[$1_1 + 16 >> 2]; $46($4_1 + 200 | 0, 17566, $4_1 + 96 | 0); break block46; } HEAPF64[$4_1 + 112 >> 3] = HEAPF64[HEAP32[$1_1 + 16 >> 2] >> 3]; $46($4_1 + 200 | 0, 12688, $4_1 + 112 | 0); break block46; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAPU16[$3 + 16 >> 1]; if ($5_1 & 2) { $5_1 = $3 + 8 | 0; break block48; } if ($5_1 & 36) { $5_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 144 >> 2] = HEAP32[$3 >> 2]; HEAP32[$4_1 + 148 >> 2] = $5_1; $46($4_1 + 200 | 0, 15092, $4_1 + 144 | 0); break block46; } if ($5_1 & 8) { HEAPF64[$4_1 + 128 >> 3] = HEAPF64[$3 >> 3]; $46($4_1 + 200 | 0, 12688, $4_1 + 128 | 0); break block46; } $6_1 = $5_1 & 1 ? 20315 : 25837; break block40; } HEAP32[$4_1 + 160 >> 2] = HEAP32[HEAP32[$1_1 + 16 >> 2] + 8 >> 2]; $46($4_1 + 200 | 0, 10068, $4_1 + 160 | 0); break block46; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$3 >> 2]; $6_1 = 1; while (1) { if ($5_1 >>> 0 >= $6_1 >>> 0) { HEAP32[$4_1 + 180 >> 2] = HEAP32[$3 + ($6_1 << 2) >> 2]; HEAP32[$4_1 + 176 >> 2] = ($6_1 | 0) == 1 ? 91 : 44; $46($4_1 + 200 | 0, 1878, $4_1 + 176 | 0); $6_1 = $6_1 + 1 | 0; continue; } break; }; $36($4_1 + 200 | 0, 18453, 1); break block46; } $5_1 = HEAP32[$1_1 + 16 >> 2]; break block48; } $3 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$3 >> 2]; HEAP32[$4_1 + 196 >> 2] = HEAP32[$3 + 8 >> 2]; HEAP32[$4_1 + 192 >> 2] = $5_1; $46($4_1 + 200 | 0, 6449, $4_1 + 192 | 0); break block46; } $5_1 = $1_1 + 16 | 0; } $6_1 = HEAP32[$5_1 >> 2]; if (!$6_1) { break block46 } } $44($4_1 + 200 | 0, $6_1); } if (HEAPU8[$4_1 + 220 | 0] & 7) { $106($14) } $3 = $57($4_1 + 200 | 0); block54 : { if ((HEAPU16[$0_1 + 152 >> 1] & 12) == 8) { $2_1 = HEAP32[$1_1 + 4 >> 2]; $110($16_1, $2_1, $2_1 >> 31); $2_1 = HEAP32[$1_1 + 8 >> 2]; $110($9_1 + 80 | 0, $2_1, $2_1 >> 31); $1_1 = HEAP32[$1_1 + 12 >> 2]; $110($9_1 + 120 | 0, $1_1, $1_1 >> 31); $1_1 = 160; break block54; } $110($16_1, $2_1, $2_1 >> 31); $111($9_1 + 80 | 0, HEAP32[(HEAPU8[$1_1 | 0] << 2) + 33744 >> 2], -1, -1, 1, 0); $2_1 = HEAP32[$1_1 + 4 >> 2]; $110($9_1 + 120 | 0, $2_1, $2_1 >> 31); $2_1 = HEAP32[$1_1 + 8 >> 2]; $110($9_1 + 160 | 0, $2_1, $2_1 >> 31); $2_1 = HEAP32[$1_1 + 12 >> 2]; $110($9_1 + 200 | 0, $2_1, $2_1 >> 31); $110($9_1 + 280 | 0, HEAPU16[$1_1 + 2 >> 1], 0); $112($9_1 + 320 | 0); $1_1 = 240; } $2_1 = 1; $111($1_1 + $9_1 | 0, $3, -1, -1, 1, 1); HEAP32[$0_1 + 120 >> 2] = $16_1; $1_1 = HEAPU8[$14 + 87 | 0]; HEAP32[$0_1 + 36 >> 2] = $1_1 ? 7 : 0; if ($1_1) { break block14 } } $2_1 = 100; HEAP32[$7_1 + 64 >> 2] = 100; break block1; } HEAP32[$0_1 + 32 >> 2] = $10_1; } $1_1 = HEAP32[$18_1 >> 2]; $3 = HEAP32[$18_1 + 4 >> 2]; if (($3 | 0) < 0) { $1_1 = 1 } else { $1_1 = !$1_1 & ($3 | 0) <= 0 } if (!$1_1) { $113($7_1, $0_1) } HEAP32[$0_1 + 120 >> 2] = 0; block58 : { if (($2_1 | 0) == 101) { if (!HEAPU8[$7_1 + 85 | 0]) { $2_1 = 101; break block58; } $2_1 = 0; $5_1 = 0; while (1) { if (($2_1 | 0) < HEAP32[$7_1 + 20 >> 2]) { $10_1 = HEAP32[$7_1 + 16 >> 2] + ($2_1 << 4) | 0; $1_1 = HEAP32[$10_1 + 4 >> 2]; block60 : { if (!$1_1) { break block60 } $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[HEAP32[$3 >> 2] + 232 >> 2]; if (!$1_1) { break block60 } $3 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$1_1 + 12 >> 2] = 0; if (($3 | 0) <= 0) { break block60 } $1_1 = HEAP32[$7_1 + 268 >> 2]; if ($5_1 | !$1_1) { break block60 } $5_1 = FUNCTION_TABLE[$1_1 | 0](HEAP32[$7_1 + 272 >> 2], $7_1, HEAP32[$10_1 >> 2], $3) | 0; } $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 36 >> 2] = $5_1; $2_1 = $5_1 ? 1 : 101; break block58; } if (HEAP8[$0_1 + 150 | 0] >= 0) { break block58 } $2_1 = $104($0_1); } HEAP32[$7_1 + 64 >> 2] = $2_1; if (($114(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 36 >> 2]) | 0) != 7) { break block6 } HEAP32[$0_1 + 36 >> 2] = 7; $2_1 = HEAP8[$0_1 + 150 | 0] < 0 ? 7 : $2_1; } $2_1 = HEAP32[$7_1 + 72 >> 2] & $2_1; if (($2_1 | 0) != 17) { break block1 } if (($21_1 | 0) == 50) { $2_1 = 17; break block1; } $10_1 = HEAP32[$0_1 + 32 >> 2]; $2_1 = global$0 - 256 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = HEAP32[$0_1 >> 2]; $5_1 = $102($1_1, $0_1 ? HEAP32[$0_1 + 200 >> 2] : 0, -1, HEAPU8[$0_1 + 150 | 0], $0_1, $2_1 + 12 | 0, 0); block20 : { if ($5_1) { if (($5_1 | 0) != 7) { break block20 } $106($1_1); break block20; } $3 = $2_1 + 16 | 0; $1_1 = HEAP32[$2_1 + 12 >> 2]; wasm2js_memory_copy($3, $1_1, 240); wasm2js_memory_copy($1_1, $0_1, 240); wasm2js_memory_copy($0_1, $3, 240); $3 = HEAP32[$1_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = $3; $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = $3; $3 = HEAP32[$1_1 + 200 >> 2]; HEAP32[$1_1 + 200 >> 2] = HEAP32[$0_1 + 200 >> 2]; HEAP32[$0_1 + 200 >> 2] = $3; $3 = HEAP32[$1_1 + 204 >> 2]; HEAP32[$1_1 + 204 >> 2] = HEAP32[$0_1 + 204 >> 2]; HEAP32[$0_1 + 204 >> 2] = $3; HEAP32[$0_1 + 228 >> 2] = HEAP32[$1_1 + 228 >> 2]; HEAP8[$0_1 + 150 | 0] = HEAPU8[$1_1 + 150 | 0]; wasm2js_memory_copy($0_1 + 164 | 0, $1_1 + 164 | 0, 36); HEAP32[$0_1 + 184 >> 2] = HEAP32[$0_1 + 184 >> 2] + 1; $3 = 0; while (1) { if (($3 | 0) < HEAP16[$1_1 + 16 >> 1]) { $7_1 = Math_imul($3, 40); $292($7_1 + HEAP32[$0_1 + 100 >> 2] | 0, HEAP32[$1_1 + 100 >> 2] + $7_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$1_1 + 36 >> 2] = 0; $126($1_1); } $1_1 = $2_1 + 256 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block63 : { if ($5_1) { $1_1 = $53(HEAP32[$12_1 + 288 >> 2]); $10($12_1, HEAP32[$0_1 + 124 >> 2]); if (HEAPU8[$12_1 + 87 | 0]) { break block63 } HEAP32[$0_1 + 124 >> 2] = $116($12_1, $1_1); $2_1 = $114($12_1, $5_1); HEAP32[$0_1 + 36 >> 2] = $2_1; break block1; } $96($0_1); if (($10_1 | 0) >= 0) { HEAP8[$0_1 + 149 | 0] = 254 } $21_1 = $21_1 + 1 | 0; $7_1 = HEAP32[$0_1 >> 2]; continue; } break; }; $2_1 = 7; HEAP32[$0_1 + 36 >> 2] = 7; HEAP32[$0_1 + 124 >> 2] = 0; } $0_1 = $4_1 + 224 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $95($0_1, $1_1) { var $2_1 = 0; $1_1 = $50($117($0_1, $1_1)); $2_1 = i64toi32_i32$HIGH_BITS; $118($0_1); i64toi32_i32$HIGH_BITS = $2_1; return $1_1; } function $96($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; if (!$0_1) { return 0 } $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 136 >> 2]; $3 = HEAP32[$0_1 + 140 >> 2]; if (($3 | 0) < 0) { $1_1 = 1 } else { $1_1 = !$1_1 & ($3 | 0) <= 0 } if (!$1_1) { $113($2_1, $0_1) } $1_1 = $119($0_1); $120($0_1); return $114($2_1, $1_1) | 0; } function $97($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $6_1 = global$0 - 16 | 0; $8_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $8_1; HEAP32[$6_1 + 8 >> 2] = 0; block1 : { if (!$121($0_1)) { $1_1 = $1(137269); break block1; } $122($0_1, 0); $1_1 = $1_1 ? $1_1 : 30822; block15 : { block10 : { while (1) { if (!(!HEAPU8[$1_1 | 0] | $7_1)) { $7_1 = $93($0_1, $1_1, -1, $6_1 + 8 | 0, $6_1 + 12 | 0); if ($7_1) { continue } $8_1 = 0; $1_1 = 0; $9_1 = 0; $10_1 = 0; $5_1 = HEAP32[$6_1 + 8 >> 2]; if (!$5_1) { $7_1 = 0; $1_1 = HEAP32[$6_1 + 12 >> 2]; continue; } while (1) { block6 : { $7_1 = $94($5_1); block4 : { if (!$2_1) { break block4 } block12 : { block8 : { block7 : { if (($7_1 | 0) != 100) { if ($1_1 | ($7_1 | 0) != 101) { break block6 } if (HEAP8[$0_1 + 33 | 0] & 1) { break block7 } break block6; } if ($1_1) { break block8 } } $1_1 = 0; $9_1 = $5_1 ? HEAPU16[$5_1 + 144 >> 1] : 0; $8_1 = $51($0_1, $9_1 << 3 | 4, 0); if (!$8_1) { break block10 } while (1) { if (($1_1 | 0) != ($9_1 | 0)) { HEAP32[($1_1 << 2) + $8_1 >> 2] = $277($5_1, $1_1); $1_1 = $1_1 + 1 | 0; continue; } break; }; if (($7_1 | 0) != 100) { break block12 } } $1_1 = 0; $10_1 = ($9_1 << 2) + $8_1 | 0; while (1) { if (($1_1 | 0) != ($9_1 | 0)) { $11_1 = $124($5_1, $1_1); HEAP32[($1_1 << 2) + $10_1 >> 2] = $11_1; block14 : { if ($11_1) { break block14 } if (($125($5_1, $1_1) | 0) == 5) { break block14 } $106($0_1); $7_1 = 100; $1_1 = $8_1; break block10; } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[($9_1 << 2) + $10_1 >> 2] = 0; } $1_1 = 1; $11_1 = FUNCTION_TABLE[$2_1 | 0]($3, $9_1, $10_1, $8_1) | 0; $5_1 = HEAP32[$6_1 + 8 >> 2]; if (!$11_1) { break block4 } $126($5_1); HEAP32[$6_1 + 8 >> 2] = 0; $7_1 = 4; $122($0_1, 4); break block15; } if (($7_1 | 0) == 100) { continue } } break; }; $7_1 = $126($5_1); HEAP32[$6_1 + 8 >> 2] = 0; $5_1 = HEAP32[$6_1 + 12 >> 2]; while (1) { $1_1 = $5_1; $5_1 = $1_1 + 1 | 0; if (HEAP8[HEAPU8[$1_1 | 0] + 31424 | 0] & 1) { continue } break; }; $10($0_1, $8_1); continue; } break; }; $5_1 = HEAP32[$6_1 + 8 >> 2]; $1_1 = 0; } if ($5_1) { $126($5_1) } $8_1 = $1_1; } $10($0_1, $8_1); $1_1 = $114($0_1, $7_1); if (!(!$4_1 | !$1_1)) { $2_1 = $116(0, $127($0_1)); HEAP32[$4_1 >> 2] = $2_1; if ($2_1) { break block1 } $1_1 = 7; $122($0_1, 7); break block1; } if (!$4_1) { break block1 } HEAP32[$4_1 >> 2] = 0; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $98($0_1, $1_1) { $1_1 = $50($117($0_1, $1_1)); $118($0_1); return $1_1; } function $99($0_1) { if ($0_1) { $128($0_1) } } function $100($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; if (!$0_1) { return 0 } $2_1 = HEAP32[$0_1 >> 2]; if ($129($0_1)) { return $1(90767) | 0 } $1_1 = HEAP32[$0_1 + 136 >> 2]; $3 = HEAP32[$0_1 + 140 >> 2]; if (($3 | 0) < 0) { $1_1 = 1 } else { $1_1 = !$1_1 & ($3 | 0) <= 0 } if (!$1_1) { $113($2_1, $0_1) } $1_1 = $119($0_1); $7($0_1); $0_1 = $114($2_1, $1_1); $130($2_1); return $0_1 | 0; } function $102($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0; HEAP32[$5_1 >> 2] = 0; $7_1 = $121($0_1); if ($7_1 ? !$1_1 : 1) { return $1(143608) } $4($0_1); while (1) { block2 : { $8_1 = $350($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1); if (!$8_1 | HEAPU8[$0_1 + 87 | 0]) { break block2 } $7_1 = $9_1; if (($8_1 | 0) != 17) { if (($8_1 | 0) != 513) { break block2 } $9_1 = $7_1 + 1 | 0; if (($7_1 | 0) < 25) { continue } break block2; } $351($0_1, -1); $9_1 = 1; if (!$7_1) { continue } } break; }; $1_1 = $114($0_1, $8_1); HEAP32[$0_1 + 456 >> 2] = 0; return $1_1; } function $103($0_1) { if (!$0_1) { $64(21, 2955, 0); return 1; } return $129($0_1); } function $104($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 + 36 >> 2]; $1_1 = HEAP32[$0_1 >> 2]; block4 : { if (HEAP32[$0_1 + 124 >> 2]) { HEAP8[$1_1 + 88 | 0] = HEAPU8[$1_1 + 88 | 0] + 1; $2_1 = HEAP32[20678]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } $2_1 = HEAP32[$1_1 + 288 >> 2]; if (!$2_1) { $2_1 = $134($1_1); HEAP32[$1_1 + 288 >> 2] = $2_1; } $137($2_1, HEAP32[$0_1 + 124 >> 2], -1); $0_1 = HEAP32[20679]; if ($0_1) { FUNCTION_TABLE[$0_1 | 0]() } HEAP8[$1_1 + 88 | 0] = HEAPU8[$1_1 + 88 | 0] - 1; break block4; } $0_1 = HEAP32[$1_1 + 288 >> 2]; if (!$0_1) { break block4 } $112($0_1); } HEAP32[$1_1 + 68 >> 2] = -1; HEAP32[$1_1 + 64 >> 2] = $3; return $3; } function $105($0_1, $1_1) { var $2_1 = 0, $3 = 0.0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { block : { if (HEAP32[$0_1 >> 2] < 2) { break block } $4_1 = HEAP32[$0_1 + 72 >> 2]; if (!$4_1) { break block } $0_1 = FUNCTION_TABLE[$4_1 | 0]($0_1, $1_1) | 0; break block1; } $0_1 = FUNCTION_TABLE[HEAP32[$0_1 + 64 >> 2]]($0_1, $2_1 + 8 | 0) | 0; $3 = HEAPF64[$2_1 + 8 >> 3] * 864.0e5; if (Math_abs($3) < 9223372036854775808.0) { $4_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $5_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $5_1 = 0 } } else { $4_1 = 0; $5_1 = -2147483648; } HEAP32[$1_1 >> 2] = $4_1; HEAP32[$1_1 + 4 >> 2] = $5_1; } $1_1 = $2_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $106($0_1) { var $1_1 = 0; block : { if (HEAPU8[$0_1 + 87 | 0] | HEAPU8[$0_1 + 88 | 0]) { break block } HEAP8[$0_1 + 87 | 0] = 1; if (HEAP32[$0_1 + 196 >> 2] > 0) { HEAP32[$0_1 + 296 >> 2] = 1 } HEAP16[$0_1 + 308 >> 1] = 0; HEAP32[$0_1 + 304 >> 2] = HEAP32[$0_1 + 304 >> 2] + 1; $1_1 = HEAP32[$0_1 + 264 >> 2]; if (!$1_1) { break block } $257($1_1, 1162, 0); $0_1 = HEAP32[$0_1 + 264 >> 2]; while (1) { HEAP32[$0_1 + 12 >> 2] = 7; $0_1 = HEAP32[$0_1 + 200 >> 2]; if (!$0_1) { break block } HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; continue; }; } } function $107($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0.0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0.0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0, $44_1 = 0, $45_1 = 0, $46_1 = 0, $47_1 = 0, $48_1 = 0, $49 = 0, $50_1 = 0, $51_1 = 0, $52_1 = 0, $53_1 = 0, $54_1 = 0, $55_1 = 0, $56 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0, wasm2js_i32$3 = 0, wasm2js_i32$4 = 0; $8_1 = global$0 - 560 | 0; $1_1 = $8_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $15_1 = HEAP32[$0_1 + 88 >> 2]; $19_1 = HEAP32[$0_1 + 104 >> 2]; $9_1 = HEAP32[$0_1 >> 2]; $21_1 = HEAPU8[$9_1 + 84 | 0]; if (HEAP32[$0_1 + 160 >> 2]) { $651($0_1) } block2 : { if (!HEAP32[$9_1 + 372 >> 2]) { $26_1 = -1; $23_1 = -1; break block2; } $1_1 = HEAP32[$9_1 + 380 >> 2]; $26_1 = $1_1 - (HEAPU32[$0_1 + 180 >> 2] % ($1_1 >>> 0) | 0) | 0; $23_1 = 0; } block704 : { block6 : { block705 : { block305 : { block4 : { if (HEAP32[$0_1 + 36 >> 2] == 7) { $6_1 = $19_1; break block4; } HEAP32[$0_1 + 56 >> 2] = 0; HEAP32[$0_1 + 60 >> 2] = 0; HEAP32[$0_1 + 36 >> 2] = 0; HEAP32[$9_1 + 456 >> 2] = 0; if (HEAP32[$9_1 + 296 >> 2]) { $5_1 = 9; $6_1 = $19_1; break block6; } $40_1 = $9_1 + 492 | 0; $46_1 = $0_1 + 164 | 0; $35_1 = $0_1 + 216 | 0; $47_1 = $9_1 + 388 | 0; $27 = $0_1 + 124 | 0; $48_1 = $0_1 + 236 | 0; $6_1 = Math_imul(HEAP32[$0_1 + 32 >> 2], 20) + $19_1 | 0; $31_1 = $8_1 + 480 | 0; $41_1 = $8_1 + 520 | 0; $36_1 = $8_1 + 380 | 0; $49 = $8_1 + 372 | 0; $50_1 = $8_1 + 376 | 0; while (1) { $32_1 = $32_1 + 1 | 0; $30_1 = $32_1 ? $30_1 : $30_1 + 1 | 0; block79 : { block277 : { block16 : { block160 : { block168 : { block167 : { block691 : { block190 : { block191 : { block189 : { block205 : { block207 : { block658 : { block170 : { block673 : { block672 : { block670 : { block660 : { block661 : { block659 : { block251 : { block245 : { block249 : { block84 : { block85 : { block86 : { block87 : { block320 : { block586 : { block296 : { block386 : { block7 : { block8 : { block9 : { block88 : { block202 : { block89 : { block555 : { block91 : { block90 : { block95 : { block97 : { block99 : { block100 : { block101 : { block102 : { block540 : { block466 : { block28 : { block272 : { block103 : { block104 : { block29 : { block31 : { block30 : { block517 : { block515 : { block32 : { block33 : { block105 : { block106 : { block107 : { block108 : { block109 : { block110 : { block111 : { block112 : { block113 : { block114 : { block115 : { block34 : { block35 : { block37 : { block36 : { block442 : { block439 : { block441 : { block437 : { block38 : { block40 : { block39 : { block116 : { block117 : { block118 : { block119 : { block120 : { block41 : { block121 : { block122 : { block123 : { block124 : { block125 : { block126 : { block127 : { block128 : { block129 : { block130 : { block132 : { block133 : { block43 : { block44 : { block45 : { block134 : { block135 : { block46 : { block136 : { block47 : { block137 : { block52 : { block53 : { block159 : { block138 : { block140 : { block10 : { block11 : { block12 : { block54 : { block141 : { block142 : { block143 : { block144 : { block145 : { block146 : { block147 : { block148 : { block149 : { block150 : { block13 : { block151 : { block55 : { block152 : { block14 : { block153 : { block154 : { block57 : { block155 : { block156 : { block157 : { block158 : { block56 : { block15 : { block59 : { block83 : { block27 : { block49 : { block82 : { block25 : { block48 : { block24 : { block23 : { block22 : { block96 : { block26 : { block81 : { block42 : { block21 : { block80 : { block51 : { block50 : { block78 : { block77 : { block20 : { block76 : { block92 : { block75 : { block93 : { block94 : { block74 : { block73 : { block72 : { block71 : { block70 : { block69 : { block68 : { block67 : { block66 : { block65 : { block64 : { block98 : { block131 : { block63 : { block62 : { block61 : { block60 : { block19 : { block18 : { block58 : { block17 : { block139 : { $1_1 = HEAPU8[$6_1 | 0]; switch ($1_1 | 0) { case 3: break block10; case 120: break block100; case 121: break block101; case 122: break block102; case 124: break block103; case 125: break block104; case 126: break block105; case 127: break block106; case 128: break block107; case 129: break block108; case 130: break block109; case 4: break block11; case 131: break block110; case 132: break block111; case 133: break block112; case 134: break block113; case 135: break block114; case 136: break block115; case 138: break block116; case 139: break block117; case 140: break block118; case 141: case 142: break block119; case 5: break block12; case 143: break block120; case 144: break block121; case 145: break block122; case 146: break block123; case 147: break block124; case 148: break block125; case 149: break block126; case 150: break block127; case 151: break block128; case 152: break block129; case 6: break block13; case 153: break block130; case 154: break block131; case 155: break block132; case 156: break block133; case 157: break block134; case 158: break block135; case 159: break block136; case 160: break block137; case 161: case 162: break block138; case 163: break block139; case 7: break block14; case 164: case 165: break block140; case 166: break block141; case 167: break block142; case 168: break block143; case 169: break block144; case 170: break block145; case 171: break block146; case 172: break block147; case 173: break block148; case 174: break block149; case 8: case 184: break block15; case 175: break block150; case 176: break block151; case 177: break block152; case 178: break block153; case 179: break block154; case 180: break block155; case 181: break block156; case 182: break block157; case 183: break block158; case 9: break block16; case 10: break block17; case 11: break block18; case 12: break block19; case 13: break block20; case 14: break block21; case 15: break block22; case 16: break block23; case 17: break block24; case 18: break block25; case 19: break block26; case 20: break block27; case 21: case 22: case 23: case 24: break block28; case 25: break block29; case 26: break block30; case 27: case 28: case 29: break block31; case 30: break block32; case 31: break block33; case 32: case 137: break block34; case 33: break block35; case 34: case 35: break block36; case 36: break block37; case 37: break block38; case 38: break block39; case 39: break block40; case 40: case 41: case 42: case 45: break block41; case 43: case 44: break block42; case 46: break block43; case 47: break block44; case 48: break block45; case 49: break block46; case 50: break block47; case 51: break block48; case 52: break block49; case 53: case 54: case 55: case 56: case 57: case 58: break block50; case 59: break block51; case 60: break block52; case 61: break block53; case 62: break block54; case 63: break block55; case 64: break block56; case 65: case 66: break block57; case 67: break block58; case 68: break block59; case 69: break block60; case 70: break block61; case 71: break block62; case 72: break block63; case 73: break block64; case 74: case 75: break block65; case 76: break block66; case 77: break block67; case 78: break block68; case 79: break block69; case 0: break block7; case 80: break block70; case 81: break block71; case 82: break block72; case 83: break block73; case 84: break block74; case 85: break block75; case 86: break block76; case 87: break block77; case 88: break block78; case 1: break block8; case 90: break block80; case 91: break block81; case 92: break block82; case 94: break block83; case 95: break block84; case 96: break block85; case 97: break block86; case 98: break block87; case 99: break block88; case 100: break block89; case 2: break block9; case 101: break block90; case 102: case 113: break block91; case 103: case 104: case 105: case 106: break block92; case 107: case 108: case 109: case 110: case 111: break block93; case 112: break block94; case 114: break block95; case 115: break block96; case 116: case 117: break block97; case 118: break block98; case 119: break block99; default: break block79; }; } $7_1 = HEAP32[$6_1 + 16 >> 2]; break block159; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = ($6_1 - $19_1 | 0) / 20 | 0; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $2_1 >> 31; HEAP16[$1_1 + 16 >> 1] = 4; break block16; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAPU8[$1_1 + 16 | 0] & 4)) { break block79 } $6_1 = Math_imul(HEAP32[$1_1 >> 2], 20) + $19_1 | 0; break block79; } $2_1 = HEAP32[$6_1 + 12 >> 2]; $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; HEAP16[$1_1 + 16 >> 1] = 4; $2_1 = $2_1 - 1 | 0; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $2_1 >> 31; if (!HEAP32[$6_1 + 8 >> 2]) { break block79 } break block160; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; HEAP16[$1_1 + 16 >> 1] = 4; $2_1 = HEAP32[$1_1 >> 2]; $3 = ($6_1 - $19_1 | 0) / 20 | 0; HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $3 >> 31; $6_1 = Math_imul($2_1, 20) + $19_1 | 0; break block79; } if (!(HEAP8[(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0) + 16 | 0] & 1)) { break block79 } } $1_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = HEAP32[$35_1 >> 2]; if (!($1_1 | !$2_1)) { HEAP32[$0_1 + 216 >> 2] = HEAP32[$2_1 + 4 >> 2]; HEAP32[$0_1 + 224 >> 2] = HEAP32[$0_1 + 224 >> 2] - 1; $1_1 = HEAP32[$0_1 + 44 >> 2]; $3 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$9_1 + 104 >> 2] = $3; HEAP32[$9_1 + 108 >> 2] = $1_1; $1_1 = HEAP32[$9_1 + 116 >> 2] + $1_1 | 0; $4_1 = HEAP32[$9_1 + 112 >> 2]; $3 = $3 + $4_1 | 0; HEAP32[$9_1 + 112 >> 2] = $3; HEAP32[$9_1 + 116 >> 2] = $3 >>> 0 < $4_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $1_1 = $647($2_1); $19_1 = HEAP32[$0_1 + 104 >> 2]; $6_1 = $19_1 + Math_imul(HEAP32[$6_1 + 8 >> 2] == 4 ? HEAP32[(Math_imul($1_1, 20) + $19_1 | 0) + 8 >> 2] - 1 | 0 : $1_1, 20) | 0; $15_1 = HEAP32[$0_1 + 88 >> 2]; break block79; } HEAP32[$0_1 + 36 >> 2] = $1_1; HEAP8[$0_1 + 148 | 0] = HEAP32[$6_1 + 8 >> 2]; if ($1_1) { $1_1 = HEAP32[$6_1 + 12 >> 2]; block165 : { if (!(HEAPU8[$6_1 + 1 | 0] | ($1_1 | 0) <= 0)) { HEAP32[$8_1 + 48 >> 2] = $208(Math_imul($1_1, 40) + $15_1 | 0, 1); $109($0_1, 8932, $8_1 + 48 | 0); break block165; } $1_1 = HEAPU16[$6_1 + 2 >> 1]; if ($1_1) { HEAP32[$8_1 + 96 >> 2] = HEAP32[($1_1 << 2) + 34508 >> 2]; $109($0_1, 16085, $8_1 + 96 | 0); $1_1 = HEAP32[$6_1 + 16 >> 2]; if (!$1_1) { break block165 } $2_1 = HEAP32[$27 >> 2]; HEAP32[$8_1 + 84 >> 2] = $1_1; HEAP32[$8_1 + 80 >> 2] = $2_1; HEAP32[$27 >> 2] = $310($9_1, 7440, $8_1 + 80 | 0); break block165; } HEAP32[$8_1 + 64 >> 2] = HEAP32[$6_1 + 16 >> 2]; $109($0_1, 8932, $8_1 - -64 | 0); } $1_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 + 200 >> 2]; HEAP32[$8_1 + 40 >> 2] = HEAP32[$0_1 + 124 >> 2]; HEAP32[$8_1 + 36 >> 2] = $2_1; HEAP32[$8_1 + 32 >> 2] = ($6_1 - $19_1 | 0) / 20; $64($1_1, 8866, $8_1 + 32 | 0); } $13_1 = 5; if (($201($0_1) | 0) == 5) { break block167 } $13_1 = HEAP32[$0_1 + 36 >> 2] ? 1 : 101; break block168; } $1_1 = $670($0_1, $6_1); $2_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $2_1 >> 31; break block79; } $1_1 = $670($0_1, $6_1); $2_1 = HEAP32[$6_1 + 16 >> 2]; $3 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $3; break block79; } $1_1 = $670($0_1, $6_1); HEAP16[$1_1 + 16 >> 1] = 8; HEAPF64[$1_1 >> 3] = HEAPF64[HEAP32[$6_1 + 16 >> 2] >> 3]; break block79; } $1_1 = $670($0_1, $6_1); $3 = HEAP32[$6_1 + 16 >> 2]; $2_1 = $48($3); HEAP32[$6_1 + 4 >> 2] = $2_1; if (($21_1 | 0) != 1) { if ($111($1_1, $3, -1, -1, 1, 0)) { break block170 } if ($228($1_1, $21_1)) { break block4 } $13_1 = 0; HEAP32[$1_1 + 24 >> 2] = 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] | 8192; if (HEAPU8[$6_1 + 1 | 0] == 250) { $10($9_1, HEAP32[$6_1 + 16 >> 2]) } HEAP8[$6_1 + 1 | 0] = 250; HEAP32[$6_1 + 16 >> 2] = HEAP32[$1_1 + 8 >> 2]; $2_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$6_1 + 4 >> 2] = $2_1; } if (HEAP32[$9_1 + 120 >> 2] < ($2_1 | 0)) { break block170 } HEAP8[$6_1 | 0] = 73; } $1_1 = $670($0_1, $6_1); HEAP16[$1_1 + 16 >> 1] = 8706; HEAP32[$1_1 + 8 >> 2] = HEAP32[$6_1 + 16 >> 2]; $2_1 = HEAP32[$6_1 + 4 >> 2]; HEAP8[$1_1 + 18 | 0] = $21_1; HEAP32[$1_1 + 12 >> 2] = $2_1; $2_1 = HEAP32[$6_1 + 12 >> 2]; if (($2_1 | 0) <= 0) { break block79 } $2_1 = Math_imul($2_1, 40) + $15_1 | 0; if (HEAP32[$2_1 >> 2] != HEAPU16[$6_1 + 2 >> 1] | HEAP32[$2_1 + 4 >> 2]) { break block79 } HEAP16[$1_1 + 16 >> 1] = 8720; break block79; } $1_1 = $670($0_1, $6_1); $2_1 = HEAP32[$6_1 + 8 >> 2]; $3 = HEAP32[$6_1 + 12 >> 2]; $4_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$1_1 + 12 >> 2] = 0; $4_1 = $4_1 ? 257 : 1; HEAP16[$1_1 + 16 >> 1] = $4_1; $2_1 = $3 - $2_1 | 0; while (1) { if (($2_1 | 0) <= 0) { break block79 } $3 = $1_1 + 40 | 0; $112($3); HEAP32[$1_1 + 52 >> 2] = 0; HEAP16[$1_1 + 56 >> 1] = $4_1; $2_1 = $2_1 - 1 | 0; $1_1 = $3; continue; }; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 65472 | 1; break block79; } $1_1 = $670($0_1, $6_1); $2_1 = HEAP32[$6_1 + 4 >> 2]; $3 = HEAP32[$6_1 + 16 >> 2]; block173 : { if (!$3) { $254($1_1, $2_1); if (!$207($1_1)) { break block173 } break block4; } $111($1_1, $3, $2_1, $2_1 >> 31, 0, 0); } HEAP8[$1_1 + 18 | 0] = $21_1; break block79; } $2_1 = (HEAP32[$0_1 + 100 >> 2] + Math_imul(HEAP32[$6_1 + 4 >> 2], 40) | 0) - 40 | 0; if ($229($2_1)) { break block170 } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; if (HEAPU8[$1_1 + 17 | 0] & 144) { $112($1_1) } $3 = $1_1 + 16 | 0; $4_1 = HEAP32[$2_1 + 16 >> 2]; HEAP32[$3 >> 2] = $4_1; $7_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $7_1; $2_1 = $2_1 + 8 | 0; $7_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = $1_1 + 8 | 0; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $7_1; HEAP16[$3 >> 1] = $4_1 & 36799 | 8256; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $7_1 = HEAP32[$6_1 + 12 >> 2]; while (1) { $292($1_1, $2_1); if (HEAPU8[$1_1 + 17 | 0] & 64) { if ($223($1_1)) { break block4 } } $1_1 = $1_1 + 40 | 0; $2_1 = $2_1 + 40 | 0; $7_1 = $7_1 - 1 | 0; if ($7_1) { continue } break; }; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $7_1 = HEAP32[$6_1 + 12 >> 2]; while (1) { $671($1_1, $2_1, 16384); $3 = HEAPU16[$1_1 + 16 >> 1]; if ($3 & 16384) { if ($223($1_1)) { break block4 } $3 = HEAPU16[$1_1 + 16 >> 1]; } if (!(!($3 & 2048) | !(HEAPU8[$6_1 + 2 | 0] & 2))) { HEAP16[$1_1 + 16 >> 1] = $3 & 63487 } if (!$7_1) { break block79 } $2_1 = $2_1 + 40 | 0; $1_1 = $1_1 + 40 | 0; $7_1 = $7_1 - 1 | 0; continue; }; } $671(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0, Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0, 16384); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $110(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); break block79; } $13_1 = 0; $5_1 = $652($0_1, 0); if (!$5_1) { break block79 } break block6; } HEAP32[$0_1 + 28 >> 2] = (HEAP32[$0_1 + 28 >> 2] | 1) + 2; HEAP32[$0_1 + 120 >> 2] = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1; if (HEAPU8[$9_1 + 87 | 0]) { break block4 } if (HEAPU8[$9_1 + 94 | 0] & 4) { FUNCTION_TABLE[HEAP32[$9_1 + 212 >> 2]](4, HEAP32[$9_1 + 216 >> 2], $0_1, 0) | 0 } HEAP32[$0_1 + 32 >> 2] = (($6_1 - $19_1 | 0) / 20 | 0) + 1; $13_1 = 100; break block168; } $10_1 = HEAP32[$6_1 + 12 >> 2]; $1_1 = Math_imul($10_1, 40) + $15_1 | 0; $14 = HEAP32[$6_1 + 8 >> 2]; $2_1 = Math_imul($14, 40) + $15_1 | 0; $3 = HEAPU16[$2_1 + 16 >> 1]; $4_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $12_1 = HEAPU16[$4_1 + 16 >> 1]; if (($3 | $12_1) & 1) { $112($1_1); break block79; } block182 : { block181 : { if (!($12_1 & 18)) { if (!$669($4_1, $21_1, 0)) { break block181 } break block4; } if (!($12_1 & 1024)) { break block182 } if ($207($4_1)) { break block4 } } $12_1 = HEAPU16[$4_1 + 16 >> 1] & -3; $3 = HEAPU16[$2_1 + 16 >> 1]; } block185 : { block184 : { if (!($3 & 18)) { if (!$669($2_1, $21_1, 0)) { break block184 } break block4; } if (!($3 & 1024)) { break block185 } if ($207($2_1)) { break block4 } } $3 = HEAPU16[$2_1 + 16 >> 1] & -3; } $7_1 = HEAP32[$2_1 + 12 >> 2] + HEAP32[$4_1 + 12 >> 2] | 0; if (($7_1 | 0) > HEAP32[$9_1 + 120 >> 2]) { break block170 } $10_1 = ($10_1 | 0) == ($14 | 0); if ($108($1_1, $7_1 + 2 | 0, $10_1)) { break block4 } HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 62016 | 2; if (!$10_1) { $10_1 = HEAP32[$2_1 + 12 >> 2]; if ($10_1) { wasm2js_memory_copy(HEAP32[$1_1 + 8 >> 2], HEAP32[$2_1 + 8 >> 2], $10_1) } HEAP16[$2_1 + 16 >> 1] = $3; } $3 = HEAP32[$4_1 + 12 >> 2]; if ($3) { wasm2js_memory_copy(HEAP32[$1_1 + 8 >> 2] + HEAP32[$2_1 + 12 >> 2] | 0, HEAP32[$4_1 + 8 >> 2], $3) } HEAP16[$4_1 + 16 >> 1] = $12_1; $2_1 = $21_1 >>> 0 > 1 ? $7_1 & -2 : $7_1; HEAP8[$2_1 + HEAP32[$1_1 + 8 >> 2] | 0] = 0; HEAP8[($2_1 + HEAP32[$1_1 + 8 >> 2] | 0) + 1 | 0] = 0; HEAP8[$1_1 + 18 | 0] = $21_1; HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] | 512; break block79; } $10_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $14 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = HEAPU16[$14 + 16 >> 1]; $12_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $3 = HEAPU16[$12_1 + 16 >> 1]; if ($2_1 & $3 & 4) { break block189 } if (($2_1 | $3) & 1) { break block190 } if (!($672($14) & $672($12_1) & 4)) { break block191 } $1_1 = HEAPU8[$6_1 | 0]; break block189; } $1_1 = HEAP32[$6_1 + 4 >> 2]; if (!$1_1) { break block79 } $110(Math_imul($1_1, 40) + $15_1 | 0, 0, 0); break block79; } $7_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if ((HEAPU16[$1_1 + 16 >> 1] | HEAPU16[$2_1 + 16 >> 1]) & 1) { $112($7_1); break block79; } $11_1 = $50($1_1); $4_1 = i64toi32_i32$HIGH_BITS; $2_1 = $50($2_1); $1_1 = i64toi32_i32$HIGH_BITS; block196 : { block195 : { block194 : { block193 : { $3 = HEAPU8[$6_1 | 0]; switch ($3 - 103 | 0) { case 0: break block193; case 1: break block194; default: break block195; }; } $11_1 = $2_1 & $11_1; $4_1 = $1_1 & $4_1; break block196; } $11_1 = $2_1 | $11_1; $4_1 = $1_1 | $4_1; break block196; } if (!($1_1 | $2_1)) { break block196 } $10_1 = ($1_1 | 0) < 0; $14 = $10_1 ? -45 - $3 | 0 : $3; $12_1 = $2_1 >>> 0 > 4294967232 & ($1_1 | 0) >= -1 | ($1_1 | 0) >= 0; $3 = $10_1 ? ($12_1 ? 0 - $2_1 | 0 : 64) : $2_1; $1_1 = $10_1 ? ($12_1 ? 0 - ((($2_1 | 0) != 0) + $1_1 | 0) | 0 : 0) : $1_1; if (($1_1 | 0) < 0) { $1_1 = 1 } else { $1_1 = $3 >>> 0 < 64 & ($1_1 | 0) <= 0 } if (!$1_1) { $1_1 = ($14 & 255) != 105 & ($4_1 | 0) < 0; $11_1 = 0 - $1_1 | 0; $4_1 = 0 - $1_1 | 0; break block196; } if (($14 & 255) == 105) { $1_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $4_1 = $11_1 << $1_1; $11_1 = 0; } else { $4_1 = (1 << $1_1) - 1 & $11_1 >>> 32 - $1_1 | $4_1 << $1_1; $11_1 = $11_1 << $1_1; } break block196; } $1_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $10_1 = 0; $11_1 = $4_1 >>> $1_1 | 0; } else { $10_1 = $4_1 >>> $1_1 | 0; $11_1 = ((1 << $1_1) - 1 & $4_1) << 32 - $1_1 | $11_1 >>> $1_1; } if (!(($4_1 | 0) < 0 | ($4_1 | 0) < -1)) { $4_1 = $10_1; break block196; } $2_1 = 64 - $3 | 0; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $4_1 = -1 << $1_1; $2_1 = 0; } else { $2_1 = -1 << $1_1; $4_1 = $2_1 | (1 << $1_1) - 1 & -1 >>> 32 - $1_1; } $11_1 = $2_1 | $11_1; $4_1 = $4_1 | $10_1; } HEAP32[$7_1 >> 2] = $11_1; HEAP32[$7_1 + 4 >> 2] = $4_1; HEAP16[$7_1 + 16 >> 1] = HEAPU16[$7_1 + 16 >> 1] & 62016 | 4; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $673($1_1); $2_1 = HEAP32[$6_1 + 8 >> 2]; $3 = $2_1 + HEAP32[$1_1 >> 2] | 0; $4_1 = HEAP32[$1_1 + 4 >> 2] + ($2_1 >> 31) | 0; HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $2_1 >>> 0 > $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; break block79; } block200 : { $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = HEAPU16[$1_1 + 16 >> 1]; if ($2_1 & 4) { break block200 } $674($1_1, 67, $21_1); $2_1 = HEAPU16[$1_1 + 16 >> 1]; if ($2_1 & 4) { break block200 } if (HEAP32[$6_1 + 8 >> 2]) { break block160 } $5_1 = 20; break block6; } HEAP16[$1_1 + 16 >> 1] = $2_1 & 62016 | 4; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAPU8[$1_1 + 16 | 0] & 36)) { break block79 } $675($1_1); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (HEAPU8[$1_1 + 17 | 0] & 4) { $5_1 = $207($1_1); if ($5_1) { break block6 } } $5_1 = $676($1_1, HEAPU8[$6_1 + 8 | 0], $21_1); break block202; } $14 = HEAP32[$6_1 + 12 >> 2]; $3 = Math_imul($14, 40) + $15_1 | 0; $2_1 = HEAPU16[$3 + 16 >> 1]; $16_1 = HEAP32[$6_1 + 4 >> 2]; $4_1 = Math_imul($16_1, 40) + $15_1 | 0; $12_1 = HEAPU16[$4_1 + 16 >> 1]; $11_1 = $2_1 & $12_1; if ($11_1 & 4) { $2_1 = HEAP32[$3 + 4 >> 2]; $7_1 = HEAP32[$4_1 + 4 >> 2]; $3 = HEAP32[$3 >> 2]; $4_1 = HEAP32[$4_1 >> 2]; if (!(($2_1 | 0) <= ($7_1 | 0) & $3 >>> 0 <= $4_1 >>> 0 | ($2_1 | 0) < ($7_1 | 0))) { if (HEAPU8[$1_1 + 31255 | 0]) { break block160 } break block205; } if (!(($2_1 | 0) >= ($7_1 | 0) & $3 >>> 0 >= $4_1 >>> 0 | ($2_1 | 0) > ($7_1 | 0))) { if (HEAPU8[$1_1 + 31243 | 0]) { break block160 } $22_1 = -1; break block79; } if (HEAPU8[$1_1 + 31249 | 0]) { break block160 } break block207; } $7_1 = HEAPU16[$6_1 + 2 >> 1]; block211 : { block212 : { block224 : { $10_1 = $2_1 | $12_1; block213 : { if ($10_1 & 1) { if ($7_1 & 128) { $22_1 = 1; if (!(!($11_1 & 1) | $2_1 & 256)) { $22_1 = 0; $7_1 = 31249; break block211; } if (!($2_1 & 1)) { break block212 } $22_1 = -1; break block213; } if ($7_1 & 16) { break block160 } break block205; } $1_1 = $7_1 & 71; block215 : { if ($1_1 >>> 0 >= 67) { if (!($10_1 & 2)) { break block215 } if (($12_1 & 46) == 2) { $302($4_1, 0); $2_1 = HEAPU16[$3 + 16 >> 1]; } if (($2_1 & 46) != 2) { break block215 } $302($3, 0); break block215; } if (!($10_1 & 2) | ($1_1 | 0) != 66) { break block215 } block220 : { block219 : { block218 : { if ($12_1 & 2) { HEAP16[$4_1 + 16 >> 1] = $12_1 & 65491; break block218; } if ($12_1 & 44) { break block219 } } $1_1 = $2_1; break block220; } $669($4_1, $21_1, 1); $12_1 = HEAPU16[$4_1 + 16 >> 1] & -3520 | $12_1 & 3517; $1_1 = ($14 | 0) == ($16_1 | 0) ? $12_1 | 2 : $2_1; $2_1 = $1_1 & 65535; } block223 : { block222 : { if ($2_1 & 2) { HEAP16[$3 + 16 >> 1] = HEAPU16[$3 + 16 >> 1] & 65491; break block222; } if ($2_1 & 44) { break block223 } } $2_1 = $1_1; break block215; } $669($3, $21_1, 1); $2_1 = HEAPU16[$3 + 16 >> 1] & -3520 | $1_1 & 3517; } $22_1 = $677($3, $4_1, HEAP32[$6_1 + 16 >> 2]); $1_1 = HEAPU8[$6_1 | 0]; if (($22_1 | 0) >= 0) { break block224 } } $7_1 = 31243; break block211; } if ($22_1) { break block212 } $22_1 = 0; $7_1 = 31249; break block211; } $7_1 = 31255; } HEAP16[$3 + 16 >> 1] = $2_1; HEAP16[$4_1 + 16 >> 1] = $12_1; if (HEAPU8[($1_1 & 255) + $7_1 | 0]) { break block160 } break block79; } if ($22_1) { break block79 } $22_1 = 0; break block160; } $1_1 = 0; $2_1 = HEAP8[$6_1 + 2 | 0] & 1 ? HEAP32[$6_1 - 4 >> 2] + 4 | 0 : 0; $3 = HEAP32[$6_1 + 12 >> 2]; $7_1 = ($3 | 0) > 0 ? $3 : 0; $3 = HEAP32[$6_1 + 16 >> 2]; $10_1 = $3 + 20 | 0; $14 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $12_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; while (1) { if (($1_1 | 0) == ($7_1 | 0)) { break block79 } $16_1 = HEAPU8[HEAP32[$3 + 16 >> 2] + $1_1 | 0]; $4_1 = $1_1 << 2; $11_1 = Math_imul($2_1 ? HEAP32[$4_1 + $2_1 >> 2] : $1_1, 40); $22_1 = $11_1 + $12_1 | 0; $11_1 = $11_1 + $14 | 0; $4_1 = $677($22_1, $11_1, HEAP32[$4_1 + $10_1 >> 2]); if ($4_1) { $1_1 = !(HEAPU8[HEAP32[$3 + 16 >> 2] + $1_1 | 0] & 2) | !(HEAP8[$22_1 + 16 | 0] & 1 | HEAP8[$11_1 + 16 | 0] & 1) ? $4_1 : 0 - $4_1 | 0; $22_1 = $16_1 & 1 ? 0 - $1_1 | 0 : $1_1; break block79; } else { $1_1 = $1_1 + 1 | 0; $22_1 = 0; continue; } }; } if (($22_1 | 0) < 0) { $6_1 = (Math_imul(HEAP32[$6_1 + 4 >> 2], 20) + $19_1 | 0) - 20 | 0; break block79; } if (!$22_1) { $6_1 = (Math_imul(HEAP32[$6_1 + 8 >> 2], 20) + $19_1 | 0) - 20 | 0; break block207; } $6_1 = (Math_imul(HEAP32[$6_1 + 12 >> 2], 20) + $19_1 | 0) - 20 | 0; break block79; } $2_1 = $678(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0, 2); $3 = $678(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0, 2); $1_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $2_1 = HEAPU8[($3 + Math_imul($2_1, 3) | 0) + (HEAPU8[$6_1 | 0] == 44 ? 34528 : 34537) | 0]; if (($2_1 | 0) == 2) { HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 62016 | 1; break block79; } HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 62016 | 4; break block79; } $2_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $1_1 = $678(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0, HEAP32[$6_1 + 12 >> 2]) ^ HEAP32[$6_1 + 16 >> 2]; $110($2_1, $1_1, $1_1 >> 31); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAP8[$2_1 + 16 | 0] & 1)) { $110($1_1, !$678($2_1, 0), 0); break block79; } $112($1_1); break block79; } $2_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $112($1_1); $2_1 = Math_imul($2_1, 40) + $15_1 | 0; if (HEAP8[$2_1 + 16 | 0] & 1) { break block79 } HEAP16[$1_1 + 16 >> 1] = 4; HEAP32[$1_1 >> 2] = $50($2_1) ^ -1; HEAP32[$1_1 + 4 >> 2] = i64toi32_i32$HIGH_BITS ^ -1; break block79; } $1_1 = HEAP32[$0_1 + 104 >> 2]; $2_1 = HEAP32[$0_1 + 216 >> 2]; block235 : { if ($2_1) { $1_1 = ($6_1 - $1_1 | 0) / 20 | 0; $3 = 1 << ($1_1 & 7); $1_1 = HEAP32[$2_1 + 20 >> 2] + ($1_1 >>> 3 | 0) | 0; $2_1 = HEAPU8[$1_1 | 0]; if ($3 & $2_1) { break block160 } HEAP8[$1_1 | 0] = $2_1 | $3; $1_1 = HEAP32[HEAP32[$0_1 + 104 >> 2] + 4 >> 2]; break block235; } $1_1 = HEAP32[$1_1 + 4 >> 2]; if (($1_1 | 0) == HEAP32[$6_1 + 4 >> 2]) { break block160 } } HEAP32[$6_1 + 4 >> 2] = $1_1; break block79; } if ($678(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0, HEAP32[$6_1 + 12 >> 2])) { break block160 } break block79; } if (!$678(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0, !HEAP32[$6_1 + 12 >> 2])) { break block160 } break block79; } if (HEAP8[(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0) + 16 | 0] & 1) { break block160 } break block79; } $1_1 = HEAP32[$6_1 + 4 >> 2]; block239 : { if (($1_1 | 0) >= 0) { $2_1 = HEAP32[$6_1 + 12 >> 2]; $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + ($1_1 << 2) >> 2]; if (($2_1 | 0) < HEAPU16[$1_1 + 54 >> 1]) { $1_1 = HEAP32[($1_1 + ($2_1 << 2) | 0) + 84 >> 2]; if ($1_1 >>> 0 >= 12) { $1_1 = $1_1 & 1 ? 4 : 8; break block239; } $1_1 = HEAPU8[$1_1 + 34546 | 0]; break block239; } $1_1 = 1 << HEAP32[$6_1 + 16 >> 2] - 1; break block239; } $1_1 = 1 << HEAPU8[(HEAPU16[(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0) + 16 >> 1] & 63) + 31328 | 0] - 1; } if ($1_1 & HEAPU16[$6_1 + 2 >> 1]) { break block160 } break block79; } block241 : { if (!(HEAP8[(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0) + 16 | 0] & 1)) { if (!(HEAP8[(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0) + 16 | 0] & 1)) { break block241 } } $112(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0); break block79; } $110(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0, 0, 0); break block79; } if (!(HEAP8[(Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0) + 16 | 0] & 1)) { break block160 } break block79; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (!$1_1 | !HEAPU8[$1_1 + 2 | 0]) { break block79 } $112(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0); break block160; } $1_1 = HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) | 0; $3 = HEAP32[$6_1 + 8 >> 2]; label4 : while (1) { $10_1 = HEAP32[$1_1 >> 2]; while (1) { $16_1 = HEAP32[$10_1 + 64 >> 2]; block250 : { block244 : { $2_1 = HEAP32[$0_1 + 28 >> 2]; if (($2_1 | 0) != HEAP32[$10_1 + 24 >> 2]) { if (HEAPU8[$10_1 + 2 | 0]) { if (HEAPU8[$10_1 | 0] != 3) { break block244 } $1_1 = HEAP32[$10_1 + 28 >> 2]; if (($1_1 | 0) <= 0) { break block244 } $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $4_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$10_1 + 72 >> 2] = $4_1; HEAP32[$10_1 + 76 >> 2] = $4_1; $7_1 = HEAP32[$1_1 + 8 >> 2]; HEAP32[$10_1 + 68 >> 2] = $7_1; break block245; } $1_1 = HEAP32[$10_1 + 36 >> 2]; if (HEAPU8[$10_1 + 3 | 0]) { block248 : { $2_1 = HEAP32[$10_1 + 8 >> 2]; if ($2_1) { $2_1 = HEAP32[($2_1 + ($3 << 2) | 0) + 4 >> 2]; if ($2_1) { break block248 } } $13_1 = 0; $5_1 = $679($10_1); if ($5_1) { break block6 } break block249; } $3 = $2_1 - 1 | 0; $1_1 = $10_1 + 32 | 0; continue label4; } if (!HEAPU8[$1_1 | 0]) { break block249 } break block250; } if (HEAPU8[HEAP32[$10_1 + 36 >> 2]]) { break block250 } $12_1 = HEAPU16[$10_1 + 54 >> 1]; break block251; } $112(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0); break block79; } $13_1 = 0; $5_1 = $680($10_1); if (!$5_1) { continue } break; }; break; }; break block6; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[$1_1 >> 2]; $3 = (($6_1 - HEAP32[$0_1 + 104 >> 2] | 0) / 20 | 0) - 1 | 0; HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $3 >> 31; $6_1 = (Math_imul(HEAP32[(Math_imul($2_1, 20) + $19_1 | 0) + 8 >> 2], 20) + $19_1 | 0) - 20 | 0; break block79; } $1_1 = HEAPU8[$9_1 + 94 | 0]; block252 : { if (!($1_1 & 65) | HEAPU8[$0_1 + 149 | 0] == 254) { break block252 } $2_1 = HEAP32[$6_1 + 16 >> 2]; if (!$2_1) { $2_1 = HEAP32[$0_1 + 200 >> 2]; if (!$2_1) { break block252 } } if ($1_1 & 64) { $10_1 = global$0 - 160 | 0; $1_1 = $10_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$10_1 + 152 >> 2] = 0; $14 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$14 + 120 >> 2]; HEAP16[$10_1 + 148 >> 1] = 0; HEAP32[$10_1 + 144 >> 2] = 0; HEAP32[$10_1 + 140 >> 2] = $1_1; HEAP32[$10_1 + 136 >> 2] = 0; HEAP32[$10_1 + 128 >> 2] = 0; HEAP32[$10_1 + 132 >> 2] = 0; block1 : { if (HEAP32[$14 + 196 >> 2] >= 2) { $1_1 = $2_1; while (1) { $7_1 = HEAPU8[$2_1 | 0]; if (!$7_1) { break block1 } while (1) { block210 : { $1_1 = $1_1 + 1 | 0; if (($7_1 | 0) == 10) { break block210 } $7_1 = HEAPU8[$1_1 | 0]; if ($7_1) { continue } } break; }; $3 = $10_1 + 128 | 0; $36($3, 30762, 3); $36($3, $2_1, $1_1 - $2_1 | 0); $2_1 = $1_1; continue; }; } if (HEAPU16[$0_1 + 16 >> 1]) { $3 = 1; label211 : while (1) { if (!HEAPU8[$2_1 | 0]) { break block1 } $4_1 = 0; $7_1 = 1; $11_1 = 0; $1_1 = $2_1; while (1) { block5 : { if ($7_1) { $7_1 = $295($1_1, $10_1 + 156 | 0); if (HEAP32[$10_1 + 156 >> 2] != 157) { break block5 } $4_1 = $7_1; } $36($10_1 + 128 | 0, $2_1, $11_1); if (!$4_1) { break block1 } $2_1 = $2_1 + $11_1 | 0; block813 : { if (HEAPU8[$2_1 | 0] == 63) { if (($4_1 | 0) >= 2) { $296($2_1 + 1 | 0, $10_1 + 152 | 0); $1_1 = HEAP32[$10_1 + 152 >> 2]; break block813; } HEAP32[$10_1 + 152 >> 2] = $3; $1_1 = $3; break block813; } $1_1 = $290($0_1, $2_1, $4_1); HEAP32[$10_1 + 152 >> 2] = $1_1; } $7_1 = $1_1 + 1 | 0; $3 = ($3 | 0) < ($7_1 | 0) ? $7_1 : $3; $2_1 = $2_1 + $4_1 | 0; $4_1 = HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0; $1_1 = HEAPU16[$4_1 - 24 >> 1]; if ($1_1 & 1) { $36($10_1 + 128 | 0, 20315, 4); continue label211; } $7_1 = $4_1 - 40 | 0; if ($1_1 & 36) { $1_1 = HEAP32[$7_1 + 4 >> 2]; HEAP32[$10_1 + 80 >> 2] = HEAP32[$7_1 >> 2]; HEAP32[$10_1 + 84 >> 2] = $1_1; $46($10_1 + 128 | 0, 15092, $10_1 + 80 | 0); continue label211; } if ($1_1 & 8) { HEAPF64[$10_1 + 64 >> 3] = HEAPF64[$7_1 >> 3]; $46($10_1 + 128 | 0, 12702, $10_1 - -64 | 0); continue label211; } if ($1_1 & 2) { $1_1 = $4_1 - 32 | 0; $12_1 = HEAPU8[$14 + 84 | 0]; if (($12_1 | 0) != 1) { $7_1 = $10_1 + 88 | 0; wasm2js_memory_fill($7_1, 0, 40); HEAP32[$10_1 + 108 >> 2] = $14; $11_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$4_1 - 28 >> 2]; $111($7_1, $11_1, $1_1, $1_1 >> 31, $12_1, 0); if (($228($7_1, 1) | 0) == 7) { HEAP32[$10_1 + 136 >> 2] = 0; HEAP8[$10_1 + 148 | 0] = 7; } HEAP32[$10_1 + 48 >> 2] = __wasm_rotl_i64(HEAP32[$10_1 + 96 >> 2], HEAP32[$10_1 + 100 >> 2], 32); HEAP32[$10_1 + 52 >> 2] = i64toi32_i32$HIGH_BITS; $46($10_1 + 128 | 0, 28326, $10_1 + 48 | 0); $204($10_1 + 88 | 0); continue label211; } $4_1 = HEAP32[$4_1 - 28 >> 2]; HEAP32[$10_1 + 36 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$10_1 + 32 >> 2] = $4_1; $46($10_1 + 128 | 0, 28326, $10_1 + 32 | 0); continue label211; } if ($1_1 & 1024) { HEAP32[$10_1 + 16 >> 2] = HEAP32[$7_1 >> 2]; $46($10_1 + 128 | 0, 25724, $10_1 + 16 | 0); continue label211; } $36($10_1 + 128 | 0, 27942, 2); $1_1 = 0; $7_1 = HEAP32[$4_1 - 28 >> 2]; $7_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $4_1 = $4_1 - 32 | 0; while (1) { if (($1_1 | 0) != ($7_1 | 0)) { HEAP32[$10_1 >> 2] = HEAPU8[HEAP32[$4_1 >> 2] + $1_1 | 0]; $46($10_1 + 128 | 0, 1626, $10_1); $1_1 = $1_1 + 1 | 0; continue; } break; }; $36($10_1 + 128 | 0, 29255, 1); continue label211; } $11_1 = $7_1 + $11_1 | 0; $1_1 = $1_1 + $7_1 | 0; $7_1 = HEAPU8[$1_1 | 0]; continue; }; }; } $36($10_1 + 128 | 0, $2_1, $48($2_1)); } if (HEAPU8[$10_1 + 148 | 0]) { $54($10_1 + 128 | 0) } $2_1 = $57($10_1 + 128 | 0); $1_1 = $10_1 + 160 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; FUNCTION_TABLE[HEAP32[$9_1 + 212 >> 2]](HEAP32[$9_1 + 216 >> 2], $2_1); $24($2_1); break block252; } if (HEAP32[$9_1 + 196 >> 2] >= 2) { HEAP32[$8_1 + 112 >> 2] = $2_1; $1_1 = $310($9_1, 8890, $8_1 + 112 | 0); FUNCTION_TABLE[HEAP32[$9_1 + 212 >> 2]](1, HEAP32[$9_1 + 216 >> 2], $0_1, $1_1) | 0; $10($9_1, $1_1); break block252; } FUNCTION_TABLE[HEAP32[$9_1 + 212 >> 2]](1, HEAP32[$9_1 + 216 >> 2], $0_1, $2_1) | 0; } $1_1 = HEAP32[$6_1 + 4 >> 2]; if (($1_1 | 0) >= HEAP32[18953]) { if (HEAPU8[$6_1 | 0] == 184) { break block79 } $1_1 = 1; $2_1 = HEAP32[$0_1 + 108 >> 2]; $2_1 = ($2_1 | 0) <= 1 ? 1 : $2_1; while (1) { if (($1_1 | 0) != ($2_1 | 0)) { $3 = HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0; if (HEAPU8[$3 | 0] == 15) { HEAP32[$3 + 4 >> 2] = 0 } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$6_1 + 4 >> 2] = 0; $1_1 = 0; } HEAP32[$6_1 + 4 >> 2] = $1_1 + 1; HEAP32[$0_1 + 188 >> 2] = HEAP32[$0_1 + 188 >> 2] + 1; break block160; } $1_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = $681($15_1, $6_1); $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $3 = HEAP32[$1_1 + 8 >> 2]; $1_1 = HEAP32[$1_1 + 12 >> 2] << 3; $1_1 = __wasm_i64_urem($2_1, i64toi32_i32$HIGH_BITS, $1_1, $1_1 >> 31); if (!(HEAPU8[((i64toi32_i32$HIGH_BITS & 7) << 29 | $1_1 >>> 3) + $3 | 0] >>> ($1_1 & 7) & 1)) { HEAP32[$0_1 + 196 >> 2] = HEAP32[$0_1 + 196 >> 2] + 1; break block160; } HEAP32[$0_1 + 192 >> 2] = HEAP32[$0_1 + 192 >> 2] + 1; break block79; } $1_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = $681($15_1, $6_1); $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $3 = HEAP32[$1_1 + 8 >> 2]; $1_1 = HEAP32[$1_1 + 12 >> 2] << 3; $1_1 = __wasm_i64_urem($2_1, i64toi32_i32$HIGH_BITS, $1_1, $1_1 >> 31); $2_1 = ((i64toi32_i32$HIGH_BITS & 7) << 29 | $1_1 >>> 3) + $3 | 0; HEAP8[$2_1 | 0] = HEAPU8[$2_1 | 0] | 1 << ($1_1 & 7); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = HEAPU16[$1_1 + 16 >> 1]; $3 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (HEAP8[$3 + 16 | 0] & 1) { HEAP16[$1_1 + 16 >> 1] = $2_1 & 63487; break block79; } HEAP16[$1_1 + 16 >> 1] = $2_1 | 2048; HEAP8[$1_1 + 19 | 0] = HEAP32[$3 >> 2]; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (HEAPU8[$2_1 + 17 | 0] & 8) { $110($1_1, HEAPU8[$2_1 + 19 | 0], 0); break block79; } $112($1_1); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 63487; break block79; } block263 : { $3 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[$6_1 + 16 >> 2]; if (($3 | 0) == HEAP32[$2_1 >> 2]) { $12_1 = HEAPU16[$2_1 + 26 >> 1]; break block263; } HEAP8[$2_1 + 24 | 0] = $21_1; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $0_1; $4_1 = $2_1 + 28 | 0; $12_1 = HEAPU16[$2_1 + 26 >> 1]; $1_1 = $12_1; while (1) { if (($1_1 | 0) <= 0) { break block263 } $1_1 = $1_1 - 1 | 0; HEAP32[$4_1 + ($1_1 << 2) >> 2] = (Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0) + Math_imul($1_1, 40); continue; }; } HEAP16[$3 + 16 >> 1] = HEAPU16[$3 + 16 >> 1] & 62016 | 1; FUNCTION_TABLE[HEAP32[HEAP32[$2_1 + 4 >> 2] + 16 >> 2]]($2_1, $12_1, $2_1 + 28 | 0); $1_1 = HEAP32[$2_1 + 20 >> 2]; if (!$1_1) { break block79 } $5_1 = $13_1; if (($1_1 | 0) > 0) { HEAP32[$8_1 + 336 >> 2] = $53($3); $109($0_1, 8932, $8_1 + 336 | 0); $5_1 = HEAP32[$2_1 + 20 >> 2]; } $650($9_1, $48_1, HEAP32[$2_1 + 16 >> 2], HEAP32[$6_1 + 4 >> 2]); $13_1 = 0; HEAP32[$2_1 + 20 >> 2] = 0; if (!$5_1) { break block79 } break block6; } $3 = $670($0_1, $6_1); $4_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2]; $2_1 = HEAP32[$4_1 + 4 >> 2]; $1_1 = HEAP32[$6_1 + 12 >> 2]; if ($1_1) { $7_1 = HEAP32[$2_1 + 48 >> 2]; $1_1 = $1_1 >>> 0 < $7_1 >>> 0 ? $7_1 : $1_1; } else { $1_1 = 0 } HEAP32[$2_1 + 4 >> 2] = HEAP32[$4_1 >> 2]; $2_1 = HEAP32[$2_1 >> 2]; block268 : { if (!$1_1) { $1_1 = HEAP32[$2_1 + 160 >> 2]; break block268; } HEAP32[$2_1 + 160 >> 2] = $1_1; } HEAP32[$3 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = 0; break block79; } $1_1 = $670($0_1, $6_1); HEAP32[$1_1 >> 2] = HEAP32[HEAP32[HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2] + 4 >> 2] + 48 >> 2]; HEAP32[$1_1 + 4 >> 2] = 0; break block79; } HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = 0; if (HEAPU8[$9_1 + 87 | 0]) { break block4 } $5_1 = 6; $3 = HEAP32[HEAP32[$6_1 + 16 >> 2] + 8 >> 2]; if (!$3) { break block6 } $1_1 = HEAP32[$3 >> 2]; if (!$1_1) { break block6 } $7_1 = HEAP32[$1_1 + 52 >> 2]; if (!$7_1) { break block79 } $1_1 = 0; $5_1 = HEAP32[$6_1 + 8 >> 2]; $10_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $2_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $4_1 = HEAP32[$0_1 + 92 >> 2]; $14 = HEAPU8[$9_1 + 92 | 0]; while (1) { if (($1_1 | 0) != ($10_1 | 0)) { HEAP32[$4_1 + ($1_1 << 2) >> 2] = $2_1; $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 + 40 | 0; continue; } break; }; HEAP8[$9_1 + 92 | 0] = HEAPU8[$6_1 + 2 | 0]; $5_1 = FUNCTION_TABLE[$7_1 | 0]($3, $5_1, $4_1, $8_1 + 368 | 0) | 0; HEAP8[$9_1 + 92 | 0] = $14; $653($0_1, $3); if (!$5_1) { if (HEAP32[$6_1 + 4 >> 2]) { $1_1 = HEAP32[$8_1 + 372 >> 2]; HEAP32[$9_1 + 40 >> 2] = HEAP32[$8_1 + 368 >> 2]; HEAP32[$9_1 + 44 >> 2] = $1_1; } $1_1 = HEAP32[$0_1 + 44 >> 2]; $2_1 = $1_1; $3 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 40 >> 2] + 1 | 0; $2_1 = $1_1 ? $2_1 : $3; HEAP32[$0_1 + 40 >> 2] = $1_1; HEAP32[$0_1 + 44 >> 2] = $2_1; break block272; } if (!(!HEAPU8[HEAP32[$6_1 + 16 >> 2] + 16 | 0] | ($5_1 & 255) != 19)) { $1_1 = 2; $13_1 = 0; block274 : { block275 : { $2_1 = HEAPU16[$6_1 + 2 >> 1]; switch ($2_1 - 4 | 0) { case 1: break block274; case 0: break block79; default: break block275; }; } $1_1 = $2_1; } HEAP8[$0_1 + 148 | 0] = $1_1; break block6; } $1_1 = HEAP32[$0_1 + 44 >> 2]; $2_1 = $1_1; $3 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 40 >> 2] + 1 | 0; $2_1 = $1_1 ? $2_1 : $3; HEAP32[$0_1 + 40 >> 2] = $1_1; HEAP32[$0_1 + 44 >> 2] = $2_1; break block6; } $1_1 = HEAP32[$9_1 + 36 >> 2]; $2_1 = HEAP32[$9_1 + 32 >> 2]; HEAP32[$9_1 + 32 >> 2] = $2_1 | 67108864; HEAP32[$9_1 + 36 >> 2] = $1_1; $1_1 = HEAP32[HEAP32[$6_1 + 16 >> 2] + 8 >> 2]; $3 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $5_1 = $228($3, 1); if ($5_1) { break block6 } $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 76 >> 2]]($1_1, HEAP32[$3 + 8 >> 2]) | 0; if (!($2_1 & 67108864)) { $2_1 = HEAP32[$9_1 + 36 >> 2]; HEAP32[$9_1 + 32 >> 2] = HEAP32[$9_1 + 32 >> 2] & -67108865; HEAP32[$9_1 + 36 >> 2] = $2_1; } $653($0_1, $1_1); HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532; break block202; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (HEAPU8[$1_1 + 2 | 0]) { break block79 } $5_1 = HEAP32[$1_1 + 36 >> 2]; $3 = HEAP32[$5_1 >> 2]; $2_1 = HEAP32[$3 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[$2_1 + 36 >> 2]]($5_1) | 0; $653($0_1, $3); if ($5_1) { break block6 } $13_1 = 0; if (!(FUNCTION_TABLE[HEAP32[$2_1 + 40 >> 2]](HEAP32[$1_1 + 36 >> 2]) | 0)) { break block16 } break block277; } $1_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (HEAPU8[$2_1 + 2 | 0]) { $112($1_1); break block79; } $13_1 = HEAP32[HEAP32[$2_1 + 36 >> 2] >> 2]; $5_1 = HEAP32[$13_1 >> 2]; $3 = $31_1 + 16 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $31_1 + 8 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$31_1 >> 2] = 0; HEAP32[$31_1 + 4 >> 2] = 0; HEAP8[$8_1 + 496 | 0] = $21_1; HEAP32[$8_1 + 472 >> 2] = $1_1; HEAP32[$8_1 + 372 >> 2] = 16777216; HEAP32[$8_1 + 376 >> 2] = 0; HEAP32[$8_1 + 476 >> 2] = $8_1 + 368; block280 : { if (HEAP8[$6_1 + 2 | 0] & 1) { $112($1_1); HEAP32[$1_1 >> 2] = 0; HEAP16[$1_1 + 16 >> 1] = 1025; break block280; } HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 62016 | 1; } $5_1 = FUNCTION_TABLE[HEAP32[$5_1 + 44 >> 2]](HEAP32[$2_1 + 36 >> 2], $8_1 + 472 | 0, HEAP32[$6_1 + 8 >> 2]) | 0; $653($0_1, $13_1); if (HEAP32[$8_1 + 492 >> 2] > 0) { HEAP32[$8_1 + 320 >> 2] = $53($1_1); $109($0_1, 8932, $8_1 + 320 | 0); $5_1 = HEAP32[$8_1 + 492 >> 2]; } $228($1_1, $21_1); $13_1 = 0; if (!$5_1) { break block79 } break block6; } $1_1 = 0; $2_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $5_1 = HEAP32[$2_1 + 40 >> 2]; $7_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $10_1 = $2_1 + 40 | 0; $14 = HEAP32[$2_1 >> 2]; $12_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$12_1 + 36 >> 2]; $16_1 = HEAP32[$2_1 >> 2]; $3 = HEAP32[$16_1 >> 2]; $4_1 = HEAP32[$0_1 + 92 >> 2]; while (1) { if (($1_1 | 0) != ($7_1 | 0)) { $11_1 = $4_1 + ($1_1 << 2) | 0; $1_1 = $1_1 + 1 | 0; HEAP32[$11_1 >> 2] = $10_1 + Math_imul($1_1, 40); continue; } break; }; $5_1 = FUNCTION_TABLE[HEAP32[$3 + 32 >> 2]]($2_1, $14, HEAP32[$6_1 + 16 >> 2], $5_1, $4_1) | 0; $653($0_1, $16_1); if ($5_1) { break block6 } $13_1 = 0; $1_1 = FUNCTION_TABLE[HEAP32[$3 + 40 >> 2]]($2_1) | 0; HEAP8[$12_1 + 2 | 0] = 0; if ($1_1) { break block160 } break block79; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $1_1 = $31(8, 0); if (!$1_1) { break block4 } HEAP32[$1_1 >> 2] = HEAP32[$2_1 + 36 >> 2]; HEAP32[$1_1 + 4 >> 2] = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1; $2_1 = $670($0_1, $6_1); HEAP16[$2_1 + 16 >> 1] = 1; $244($2_1, $1_1, 2460, 2); break block79; } HEAP32[$8_1 + 368 >> 2] = 0; $3 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $112($3); $2_1 = HEAP32[$6_1 + 16 >> 2]; $1_1 = HEAP32[$2_1 + 52 >> 2]; if (!$1_1) { break block79 } $5_1 = HEAP32[$1_1 + 8 >> 2]; $4_1 = HEAP32[$5_1 >> 2]; HEAP32[$1_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2] + 1; $5_1 = FUNCTION_TABLE[HEAP32[$4_1 + 96 >> 2]]($5_1, HEAP32[HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) >> 2], HEAP32[$2_1 >> 2], HEAP32[$6_1 + 12 >> 2], $8_1 + 368 | 0) | 0; $646(HEAP32[$2_1 + 52 >> 2]); $1_1 = HEAP32[$8_1 + 368 >> 2]; if (!$5_1) { $13_1 = 0; if (!$1_1) { break block79 } $111($3, $1_1, -1, -1, 1, 1); break block79; } $24($1_1); break block6; } HEAP32[$8_1 + 368 >> 2] = 0; $5_1 = 6; $1_1 = HEAP32[HEAP32[$6_1 + 16 >> 2] + 8 >> 2]; if (!$1_1) { break block6 } $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block6 } $5_1 = FUNCTION_TABLE[HEAP32[$2_1 + 24 >> 2]]($1_1, $8_1 + 368 | 0) | 0; $653($0_1, $1_1); if ($5_1) { break block6 } HEAP32[HEAP32[$8_1 + 368 >> 2] >> 2] = $1_1; $13_1 = 0; $3 = $682($0_1, HEAP32[$6_1 + 4 >> 2], 0, 2); if ($3) { HEAP32[$3 + 36 >> 2] = HEAP32[$8_1 + 368 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] + 1; break block79; } FUNCTION_TABLE[HEAP32[$2_1 + 28 >> 2]](HEAP32[$8_1 + 368 >> 2]) | 0; break block4; } HEAP32[$9_1 + 200 >> 2] = HEAP32[$9_1 + 200 >> 2] + 1; $13_1 = 0; $5_1 = 0; $2_1 = $319($9_1, HEAP32[$6_1 + 16 >> 2], HEAP32[HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) >> 2]); block285 : { if (!$2_1 | HEAPU8[$2_1 + 43 | 0] != 1) { break block285 } $1_1 = HEAP32[$2_1 + 52 >> 2]; if (!$1_1) { break block285 } while (1) { if ($1_1) { if (HEAP32[HEAP32[$1_1 + 8 >> 2] + 4 >> 2] > 0) { $5_1 = 6; break block285; } else { $1_1 = HEAP32[$1_1 + 24 >> 2]; continue; } } break; }; $1_1 = $683($9_1, $2_1); $5_1 = HEAP32[HEAP32[$1_1 + 4 >> 2] >> 2]; $7_1 = HEAP32[$5_1 + 20 >> 2]; if (!$7_1) { $7_1 = HEAP32[$5_1 + 16 >> 2] } HEAP32[$2_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2] + 1; $5_1 = FUNCTION_TABLE[$7_1 | 0](HEAP32[$1_1 + 8 >> 2]) | 0; if (!$5_1) { HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$2_1 + 52 >> 2] = 0; $646($1_1); } $6($9_1, $2_1); } HEAP32[$9_1 + 200 >> 2] = HEAP32[$9_1 + 200 >> 2] - 1; if (!$5_1) { break block79 } break block6; } $1_1 = $8_1 + 368 | 0; wasm2js_memory_fill($1_1, 0, 40); HEAP32[$8_1 + 388 >> 2] = $9_1; $5_1 = $251($1_1, Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0); $1_1 = $53($1_1); block291 : { if (!$1_1) { break block291 } block293 : { $1_1 = $319($9_1, $1_1, HEAP32[HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) >> 2]); $5_1 = HEAP32[HEAP32[$1_1 + 48 >> 2] >> 2]; $2_1 = $320($47_1, $5_1); block292 : { if (!$2_1) { break block292 } $3 = HEAP32[$2_1 >> 2]; $4_1 = HEAP32[$3 + 4 >> 2]; if (!$4_1) { break block292 } if (HEAP32[$3 + 20 >> 2]) { break block293 } } HEAP32[$8_1 + 304 >> 2] = $5_1; HEAP32[$27 >> 2] = $310($9_1, 8406, $8_1 + 304 | 0); $5_1 = 1; break block291; } $5_1 = $324($9_1, $1_1, $2_1, $4_1, $27); if ($5_1) { break block291 } $5_1 = 0; if (!$684($9_1, $1_1)) { break block291 } $5_1 = $685($9_1); if ($5_1) { break block291 } $686($9_1, $684($9_1, $1_1)); $5_1 = 0; } $204($8_1 + 368 | 0); break block202; } $2_1 = HEAP32[$6_1 + 16 >> 2]; block298 : { block295 : { $3 = HEAP32[$9_1 + 384 >> 2]; if (!(HEAP32[$9_1 + 408 >> 2] | ($3 | 0) <= 0)) { $5_1 = 6; break block295; } if (!$2_1) { break block296 } $4_1 = HEAP32[HEAP32[$2_1 + 8 >> 2] >> 2]; if (!HEAP32[$4_1 + 56 >> 2]) { $5_1 = 0; break block298; } $1_1 = 0; $5_1 = ($3 | 0) > 0 ? $3 : 0; block299 : { while (1) { if (($1_1 | 0) == ($5_1 | 0)) { break block299 } $3 = $1_1 << 2; $1_1 = $1_1 + 1 | 0; if (($2_1 | 0) != HEAP32[$3 + HEAP32[$9_1 + 408 >> 2] >> 2]) { continue } break; }; $5_1 = 0; break block295; } $5_1 = $685($9_1); if ($5_1) { break block295 } $5_1 = FUNCTION_TABLE[HEAP32[$4_1 + 56 >> 2]](HEAP32[$2_1 + 8 >> 2]) | 0; if ($5_1) { break block298 } $1_1 = HEAP32[$9_1 + 504 >> 2]; $3 = HEAP32[$9_1 + 508 >> 2]; $686($9_1, $2_1); $5_1 = 0; $1_1 = $1_1 + $3 | 0; if (!$1_1) { break block298 } $3 = HEAP32[$4_1 + 80 >> 2]; if (!$3) { break block298 } HEAP32[$2_1 + 20 >> 2] = $1_1; $5_1 = FUNCTION_TABLE[$3 | 0](HEAP32[$2_1 + 8 >> 2], $1_1 - 1 | 0) | 0; break block298; } if (!$2_1) { break block202 } } $653($0_1, HEAP32[$2_1 + 8 >> 2]); break block202; } $1_1 = HEAPU8[$6_1 + 12 | 0]; if (!(HEAPU8[$9_1 + 36 | 0] & 4 ? $1_1 : 1)) { break block79 } $13_1 = 0; $2_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2]; if (!HEAPU8[$2_1 + 9 | 0]) { break block79 } $3 = HEAP32[$6_1 + 8 >> 2]; HEAP32[HEAP32[$2_1 + 4 >> 2] + 4 >> 2] = HEAP32[$2_1 >> 2]; $4_1 = $1_1 + 1 | 0; $5_1 = $610($2_1, $3, $4_1 & 255); if (!$5_1) { $7_1 = HEAP32[$2_1 + 4 >> 2] + 76 | 0; $1_1 = $7_1; block304 : { while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { if (HEAP32[$1_1 + 4 >> 2] == ($3 | 0) & ($2_1 | 0) == HEAP32[$1_1 >> 2]) { break block304 } $1_1 = $1_1 + 12 | 0; continue; } break; }; $1_1 = $132(16, 0); if (!$1_1) { break block305 } HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; HEAP32[$1_1 + 12 >> 2] = HEAP32[$7_1 >> 2]; HEAP32[$7_1 >> 2] = $1_1; } if (HEAPU8[$1_1 + 8 | 0] >= ($4_1 & 255) >>> 0) { break block79 } HEAP8[$1_1 + 8 | 0] = $4_1; break block79; } if (($5_1 & 255) != 6) { break block6 } HEAP32[$8_1 + 288 >> 2] = HEAP32[$6_1 + 16 >> 2]; $109($0_1, 8761, $8_1 + 288 | 0); break block6; } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2]; HEAP8[$1_1 + 1 | 0] = HEAPU8[$1_1 + 1 | 0] & 191; break block79; } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2]; HEAP8[$1_1 + 1 | 0] = HEAPU8[$1_1 + 1 | 0] | 64; break block79; } $1_1 = HEAP32[$6_1 + 8 >> 2]; if (!HEAP32[$6_1 + 4 >> 2]) { $342($9_1, $1_1); break block79; } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532 | $1_1 + 1 & 3; break block79; } $2_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2]; $1_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$2_1 >> 2]; $13_1 = 0; if (!HEAPU8[$1_1 + 17 | 0]) { break block160 } $2_1 = HEAP32[$1_1 + 48 >> 2]; $3 = $156(HEAP32[HEAP32[$1_1 + 12 >> 2] + 56 >> 2] + 36 | 0); $4_1 = $182($1_1, $2_1, $3); block309 : { if (!($2_1 >>> 0 > $3 >>> 0 & $2_1 >>> 0 >= $4_1 >>> 0)) { $5_1 = $181(74914); break block309; } if (!$3) { break block160 } $5_1 = $183($1_1, 0, 0); if ($5_1) { break block309 } $179($1_1); $5_1 = $184($1_1, $4_1, $2_1, 0); if ($5_1) { break block309 } $5_1 = $150(HEAP32[HEAP32[$1_1 + 12 >> 2] + 72 >> 2]); $2_1 = HEAP32[HEAP32[$1_1 + 12 >> 2] + 56 >> 2]; $1_1 = HEAP32[$1_1 + 48 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 28 | 0] = $1_1; HEAP8[$2_1 + 29 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 30 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 31 | 0] = $1_1 >>> 24; } if (!$5_1) { $13_1 = $5_1; break block79; } if (($5_1 | 0) == 101) { break block160 } break block6; } $13_1 = 0; $12_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = HEAP32[$6_1 + 8 >> 2]; $11_1 = $1_1 ? Math_imul($1_1, 40) + $15_1 | 0 : 0; $10_1 = 0; $16_1 = 0; $3 = global$0 - 208 | 0; if ($3 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $3 >>> 0) { fimport$30($3 | 0) } $1_1 = $27; global$0 = $3; block161 : { if (!HEAPU8[$9_1 + 85 | 0]) { $774($1_1, $9_1, 10725); $2_1 = 1; break block161; } if (HEAP32[$9_1 + 184 >> 2] >= 2) { $774($1_1, $9_1, 4424); $2_1 = 1; break block161; } $7_1 = HEAP32[$9_1 + 60 >> 2]; block462 : { if (!$11_1) { $2_1 = 30822; break block462; } $5_1 = HEAPU16[$11_1 + 16 >> 1]; $2_1 = $5_1 & 31; if (($5_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $2_1; $5_1 = 0; } else { $5_1 = 1 << $2_1; $2_1 = $5_1 - 1 & 1 >>> 32 - $2_1; } if (!($5_1 & 262148 | $2_1 & 262144)) { $774($1_1, $9_1, 14037); $2_1 = 1; break block161; } $2_1 = $53($11_1); HEAP32[$9_1 + 60 >> 2] = HEAP32[$9_1 + 60 >> 2] & -8 | 6; } $51_1 = HEAPU8[$9_1 + 94 | 0]; HEAP8[$9_1 + 94 | 0] = 0; $42_1 = HEAP32[$9_1 + 24 >> 2]; HEAP32[$9_1 + 24 >> 2] = $42_1 | 6; $5_1 = HEAP32[$9_1 + 36 >> 2]; $33_1 = $5_1; $43_1 = HEAP32[$9_1 + 32 >> 2]; HEAP32[$9_1 + 32 >> 2] = $43_1 & -268456450 | 513; HEAP32[$9_1 + 36 >> 2] = $5_1 & -2; $5_1 = HEAP32[$9_1 + 16 >> 2] + ($12_1 << 4) | 0; $14 = HEAP32[$5_1 + 4 >> 2]; $4_1 = HEAP32[HEAP32[$14 + 4 >> 2] >> 2]; if (!HEAPU8[$4_1 + 12 | 0]) { $16_1 = !HEAPU8[$4_1 + 16 | 0] } $5_1 = HEAP32[$5_1 >> 2]; $52_1 = HEAP32[$9_1 + 112 >> 2]; $53_1 = HEAP32[$9_1 + 116 >> 2]; $54_1 = HEAP32[$9_1 + 104 >> 2]; $55_1 = HEAP32[$9_1 + 108 >> 2]; $65(8, $3 + 144 | 0); $4_1 = HEAP32[$3 + 148 >> 2]; HEAP32[$3 + 80 >> 2] = HEAP32[$3 + 144 >> 2]; HEAP32[$3 + 84 >> 2] = $4_1; $4_1 = $63(42, $3 + 96 | 0, 1434, $3 + 80 | 0); $17_1 = HEAP32[$9_1 + 20 >> 2]; HEAP32[$3 + 68 >> 2] = $4_1; HEAP32[$3 + 64 >> 2] = $2_1; $2_1 = $783($9_1, $1_1, 7363, $3 - -64 | 0); HEAP32[$9_1 + 60 >> 2] = $7_1; block763 : { if ($2_1) { break block763 } $2_1 = HEAP32[$9_1 + 16 >> 2]; $10_1 = $2_1 + ($17_1 << 4) | 0; $7_1 = HEAP32[$10_1 + 4 >> 2]; block1164 : { if ($11_1) { $18_1 = HEAP32[HEAP32[HEAP32[$7_1 + 4 >> 2] >> 2] + 64 >> 2]; HEAP32[$3 + 160 >> 2] = 0; HEAP32[$3 + 164 >> 2] = 0; $20_1 = HEAP32[$18_1 >> 2]; if ($20_1) { if (FUNCTION_TABLE[HEAP32[$20_1 + 24 >> 2]]($18_1, $3 + 160 | 0) | 0) { break block1164 } $2_1 = HEAP32[$3 + 160 >> 2]; $18_1 = HEAP32[$3 + 164 >> 2]; if (($18_1 | 0) > 0) { $2_1 = 1 } else { $2_1 = !!$2_1 & ($18_1 | 0) >= 0 } if ($2_1) { break block1164 } $2_1 = HEAP32[$9_1 + 16 >> 2]; } HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 8; $2_1 = HEAPU8[(($12_1 << 4) + $2_1 | 0) + 8 | 0] | HEAP32[$9_1 + 32 >> 2] & 24 | 32; } else { $2_1 = 33 } $18_1 = $422($14); $512($7_1, HEAP32[HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($12_1 << 4) | 0) + 12 >> 2] + 80 >> 2]); $784($7_1, $784($14, 0)); $785($7_1, $2_1); $2_1 = $786($9_1, $1_1, 20110); if ($2_1) { break block763 } $2_1 = $143($14, $11_1 ? 0 : 2, 0); if ($2_1) { break block763 } $12_1 = HEAP32[$14 + 4 >> 2]; if (!(HEAPU8[HEAP32[$12_1 >> 2] + 5 | 0] != 5 | $11_1)) { HEAP32[$9_1 + 100 >> 2] = 0 } $2_1 = 7; if ($144($7_1, HEAP32[$12_1 + 36 >> 2], $18_1, 0)) { break block763 } if ($16_1) { if ($144($7_1, HEAP32[$9_1 + 100 >> 2], $18_1, 0)) { break block763 } } if (HEAPU8[$9_1 + 87 | 0]) { break block763 } $2_1 = HEAP8[$9_1 + 90 | 0]; if (($2_1 | 0) < 0) { $2_1 = $787($14) } $788($7_1, $2_1); HEAP8[$9_1 + 176 | 0] = $17_1; HEAP32[$3 + 48 >> 2] = $5_1; $2_1 = $783($9_1, $1_1, 24323, $3 + 48 | 0); if ($2_1) { break block763 } HEAP32[$3 + 32 >> 2] = $5_1; $2_1 = $783($9_1, $1_1, 27804, $3 + 32 | 0); if ($2_1) { break block763 } HEAP8[$9_1 + 176 | 0] = 0; HEAP32[$3 + 24 >> 2] = $4_1; HEAP32[$3 + 20 >> 2] = $5_1; HEAP32[$3 + 16 >> 2] = $4_1; $2_1 = $783($9_1, $1_1, 24186, $3 + 16 | 0); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] & -5; if ($2_1) { break block763 } HEAP32[$3 + 4 >> 2] = $5_1; HEAP32[$3 >> 2] = $4_1; $2_1 = $783($9_1, $1_1, 26639, $3); if ($2_1) { break block763 } $1_1 = 0; while (1) { if ($1_1 >>> 0 <= 9) { $2_1 = HEAPU8[$1_1 + 34808 | 0]; $709($14, $2_1, $3 + 92 | 0); $5_1 = $1_1 + 34809 | 0; $1_1 = $1_1 + 2 | 0; $2_1 = $147($7_1, $2_1, HEAP32[$3 + 92 >> 2] + HEAPU8[$5_1 | 0] | 0); if (!$2_1) { continue } break block763; } break; }; block1966 : { if (!$11_1) { $2_1 = HEAP32[$14 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$14 >> 2]; $1_1 = HEAP32[$7_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$7_1 >> 2]; $2_1 = HEAP32[HEAP32[$2_1 >> 2] + 64 >> 2]; $5_1 = HEAP32[$2_1 >> 2]; block1767 : { if (!$5_1) { break block1767 } $4_1 = HEAP32[$1_1 + 48 >> 2]; $1_1 = HEAP32[$1_1 + 36 >> 2]; HEAP32[$3 + 152 >> 2] = __wasm_i64_mul($4_1, 0, $1_1, $1_1 >> 31); HEAP32[$3 + 156 >> 2] = i64toi32_i32$HIGH_BITS; $2_1 = FUNCTION_TABLE[HEAP32[$5_1 + 40 >> 2]]($2_1, 11, $3 + 152 | 0) | 0; if (($2_1 | 0) == 12) { break block1767 } if ($2_1) { break block763 } } $1_1 = $3 + 160 | 0; wasm2js_memory_fill($1_1, 0, 48); $2_1 = HEAP32[$7_1 >> 2]; HEAP32[$3 + 184 >> 2] = $7_1; HEAP32[$3 + 180 >> 2] = $2_1; HEAP32[$3 + 176 >> 2] = 1; HEAP32[$3 + 164 >> 2] = $14; $20_1 = 0; $39_1 = 0; $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$1_1 + 24 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$2_1 >> 2]; $12_1 = HEAP32[$1_1 + 28 >> 2]; if (!($12_1 >>> 0 > 6 | !(1 << $12_1 & 97))) { $25 = HEAP32[$4_1 >> 2]; $16_1 = HEAP32[HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] >> 2]; block214 : { if (!(!HEAP32[$1_1 >> 2] | HEAPU8[$4_1 + 20 | 0] != 2)) { $39_1 = 1; $2_1 = 5; break block214; } if (HEAPU8[$2_1 + 8 | 0]) { $39_1 = 1; $2_1 = 0; break block214; } $2_1 = $143($2_1, 0, 0); } $17_1 = HEAP32[$1_1 + 12 >> 2]; block510 : { block611 : { if (!($2_1 | $17_1)) { $2_1 = 7; if (($144(HEAP32[$1_1 + 4 >> 2], HEAP32[HEAP32[HEAP32[$1_1 + 24 >> 2] + 4 >> 2] + 36 >> 2], 0, 0) | 0) == 7) { break block510 } $17_1 = HEAP32[$1_1 + 12 >> 2]; break block611; } if ($2_1) { break block510 } } $2_1 = 0; if ($17_1) { break block510 } $2_1 = $143(HEAP32[$1_1 + 4 >> 2], 2, $1_1 + 8 | 0); if ($2_1) { break block510 } HEAP32[$1_1 + 12 >> 2] = 1; $2_1 = 0; } $4_1 = HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2]; $18_1 = HEAP32[$4_1 + 36 >> 2]; $17_1 = HEAP32[HEAP32[$1_1 + 24 >> 2] + 4 >> 2]; $12_1 = HEAP32[$17_1 + 36 >> 2]; $28_1 = HEAPU8[HEAP32[$4_1 >> 2] + 5 | 0]; block715 : { if ($2_1) { break block715 } block1016 : { if (($28_1 | 0) != 5) { $2_1 = 0; if (!(HEAPU8[$16_1 + 12 | 0] ? 1 : HEAPU8[$16_1 + 16 | 0])) { break block715 } if (($12_1 | 0) != ($18_1 | 0)) { break block1016 } break block715; } $2_1 = 0; if (($12_1 | 0) == ($18_1 | 0)) { break block715 } } $2_1 = 8; } $4_1 = HEAP32[$17_1 + 48 >> 2]; while (1) { block1218 : { if (($20_1 | 0) == 2147483647) { break block1218 } $17_1 = HEAP32[$1_1 + 16 >> 2]; if ($2_1 | $4_1 >>> 0 < $17_1 >>> 0) { break block1218 } $2_1 = 0; if (($17_1 | 0) != ((HEAPU32[18884] / HEAPU32[HEAP32[HEAP32[$1_1 + 24 >> 2] + 4 >> 2] + 36 >> 2] | 0) + 1 | 0)) { $2_1 = FUNCTION_TABLE[HEAP32[$25 + 220 >> 2]]($25, $17_1, $5_1 + 8 | 0, 2) | 0; if (!$2_1) { $2_1 = $145($1_1, $17_1, HEAP32[HEAP32[$5_1 + 8 >> 2] + 4 >> 2], 0); $99(HEAP32[$5_1 + 8 >> 2]); } $17_1 = HEAP32[$1_1 + 16 >> 2]; } HEAP32[$1_1 + 16 >> 2] = $17_1 + 1; $20_1 = $20_1 + 1 | 0; continue; } break; }; block1619 : { block1520 : { if (($2_1 | 0) == 101) { break block1520 } if ($2_1) { break block1619 } HEAP32[$1_1 + 36 >> 2] = $4_1; $2_1 = HEAP32[$1_1 + 16 >> 2]; HEAP32[$1_1 + 32 >> 2] = ($4_1 - $2_1 | 0) + 1; if ($2_1 >>> 0 > $4_1 >>> 0) { break block1520 } $2_1 = 0; if (HEAP32[$1_1 + 40 >> 2]) { break block1619 } $4_1 = HEAP32[HEAP32[HEAP32[$1_1 + 24 >> 2] + 4 >> 2] >> 2]; HEAP32[$1_1 + 44 >> 2] = HEAP32[$4_1 + 96 >> 2]; HEAP32[$4_1 + 96 >> 2] = $1_1; HEAP32[$1_1 + 40 >> 2] = 1; break block1619; } block1721 : { if ($4_1) { break block1721 } $2_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$2_1 + 48 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = $4_1; $4_1 = 1; $2_1 = $146($2_1); if (($2_1 | 0) == 101) { break block1721 } if ($2_1) { break block1619 } } $2_1 = $147(HEAP32[$1_1 + 4 >> 2], 1, HEAP32[$1_1 + 8 >> 2] + 1 | 0); if ($2_1) { break block1619 } $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { $148($2_1) } if (($28_1 | 0) == 5) { $2_1 = $149(HEAP32[$1_1 + 4 >> 2], 2); if ($2_1) { break block1619 } } block2722 : { if (($12_1 | 0) < ($18_1 | 0)) { $2_1 = ($18_1 | 0) / ($12_1 | 0) | 0; $2_1 = (($2_1 + $4_1 | 0) - 1 | 0) / ($2_1 | 0) | 0; $17_1 = $2_1 - (($2_1 | 0) == ((HEAPU32[18884] / HEAPU32[HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] + 36 >> 2] | 0) + 1 | 0)) | 0; $28_1 = HEAP32[$16_1 + 28 >> 2]; $20_1 = HEAP32[$16_1 + 64 >> 2]; $29_1 = $4_1 >> 31; $2_1 = 0; while (1) { if (!($17_1 >>> 0 > $28_1 >>> 0 | $2_1)) { $2_1 = 0; block2224 : { if (((HEAPU32[18884] / HEAPU32[HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] + 36 >> 2] | 0) + 1 | 0) == ($17_1 | 0)) { break block2224 } $2_1 = FUNCTION_TABLE[HEAP32[$16_1 + 220 >> 2]]($16_1, $17_1, $5_1 + 8 | 0, 0) | 0; if ($2_1) { break block2224 } $2_1 = $150(HEAP32[$5_1 + 8 >> 2]); $99(HEAP32[$5_1 + 8 >> 2]); } $17_1 = $17_1 + 1 | 0; continue; } break; }; $17_1 = $29_1; $29_1 = $12_1 >> 31; $28_1 = __wasm_i64_mul($4_1, $17_1, $12_1, $29_1); $17_1 = i64toi32_i32$HIGH_BITS; if (!$2_1) { $2_1 = $151($16_1, 0, 1) } $44_1 = HEAP32[18884]; $18_1 = $44_1 + $18_1 | 0; $4_1 = $18_1 >> 31; $37_1 = $18_1; $18_1 = $18_1 >>> 0 > $28_1 >>> 0 & ($4_1 | 0) >= ($17_1 | 0) | ($4_1 | 0) > ($17_1 | 0); $56 = $18_1 ? $28_1 : $37_1; $37_1 = $18_1 ? $17_1 : $4_1; $18_1 = $12_1 + $44_1 | 0; $4_1 = $18_1 >> 31; while (1) { if (!(($4_1 | 0) >= ($37_1 | 0) & $18_1 >>> 0 >= $56 >>> 0 | ($4_1 | 0) > ($37_1 | 0) | $2_1)) { HEAP32[$5_1 + 8 >> 2] = 0; $2_1 = (((((wasm2js_i32$1 = $25, wasm2js_i32$2 = __wasm_i64_sdiv($18_1, $4_1, $12_1, $29_1) + 1 | 0), wasm2js_i32$3 = $5_1 + 8 | 0), wasm2js_i32$4 = 0), wasm2js_i32$0 = HEAP32[$25 + 220 >> 2]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0, wasm2js_i32$3 | 0, wasm2js_i32$4 | 0) | 0); if (!$2_1) { $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$20_1 >> 2] + 12 >> 2]]($20_1, HEAP32[HEAP32[$5_1 + 8 >> 2] + 4 >> 2], $12_1, $18_1, $4_1) | 0 } $99(HEAP32[$5_1 + 8 >> 2]); $4_1 = $4_1 + $29_1 | 0; $18_1 = $12_1 + $18_1 | 0; $4_1 = $18_1 >>> 0 < $12_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; if ($2_1) { break block1619 } $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$20_1 >> 2] + 24 >> 2]]($20_1, $5_1 + 8 | 0) | 0; if ($2_1) { break block1619 } $2_1 = HEAP32[$5_1 + 12 >> 2]; if (!(($17_1 | 0) >= ($2_1 | 0) & $28_1 >>> 0 >= HEAPU32[$5_1 + 8 >> 2] | ($2_1 | 0) < ($17_1 | 0))) { $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$20_1 >> 2] + 16 >> 2]]($20_1, $28_1, $17_1) | 0; if ($2_1) { break block1619 } } $2_1 = $152($16_1, 0); break block2722; } HEAP32[$16_1 + 28 >> 2] = Math_imul(($12_1 | 0) / ($18_1 | 0) | 0, $4_1); $2_1 = $151($16_1, 0, 0); } if ($2_1) { break block1619 } $2_1 = $153(HEAP32[$1_1 + 4 >> 2], 0); $2_1 = $2_1 ? $2_1 : 101; } if (!$39_1) { $154(HEAP32[$1_1 + 24 >> 2], 0); $153(HEAP32[$1_1 + 24 >> 2], 0); } HEAP32[$1_1 + 28 >> 2] = ($2_1 | 0) == 3082 ? 7 : $2_1; } $2_1 = $5_1 + 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if ($1_1) { $4_1 = HEAP32[$1_1 + 20 >> 2]; $2_1 = HEAP32[$1_1 + 24 >> 2]; $5_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$5_1 + 4 >> 2] = HEAP32[$2_1 >> 2]; if (HEAP32[$1_1 >> 2]) { HEAP32[$2_1 + 16 >> 2] = HEAP32[$2_1 + 16 >> 2] - 1 } if (HEAP32[$1_1 + 40 >> 2]) { $2_1 = HEAP32[$5_1 >> 2] + 96 | 0; while (1) { $5_1 = $2_1; $12_1 = HEAP32[$2_1 >> 2]; $2_1 = $12_1 + 44 | 0; if (($1_1 | 0) != ($12_1 | 0)) { continue } break; }; HEAP32[$5_1 >> 2] = HEAP32[$1_1 + 44 >> 2]; } $187(HEAP32[$1_1 + 4 >> 2], 0, 0); $2_1 = HEAP32[$1_1 + 28 >> 2]; $2_1 = ($2_1 | 0) != 101 ? $2_1 : 0; $5_1 = HEAP32[$1_1 >> 2]; block3 : { if (!$5_1) { break block3 } $122($5_1, $2_1); $130(HEAP32[$1_1 >> 2]); if (!HEAP32[$1_1 >> 2]) { break block3 } $24($1_1); } $130($4_1); } else { $2_1 = 0 } if ($2_1) { break block1966 } $1_1 = HEAP32[$14 + 4 >> 2]; HEAP16[$1_1 + 24 >> 1] = HEAPU16[$1_1 + 24 >> 1] & 65533; } $2_1 = $775($7_1); $1_1 = !$2_1; if (!($2_1 | $11_1)) { $788($14, $787($7_1)); $1_1 = 1; } if (!$1_1 | $11_1) { break block763 } $1_1 = $422($7_1); $2_1 = $144($14, HEAP32[HEAP32[$7_1 + 4 >> 2] + 36 >> 2], $1_1, 1); break block763; } $1_1 = HEAP32[HEAP32[HEAP32[$3 + 164 >> 2] + 4 >> 2] >> 2]; if (!HEAPU8[$1_1 + 12 | 0]) { $516($1_1) } break block763; } $774($1_1, $9_1, 3776); $2_1 = 1; } HEAP32[$9_1 + 112 >> 2] = $52_1; HEAP32[$9_1 + 116 >> 2] = $53_1; HEAP32[$9_1 + 104 >> 2] = $54_1; HEAP32[$9_1 + 108 >> 2] = $55_1; HEAP32[$9_1 + 32 >> 2] = $43_1; HEAP32[$9_1 + 36 >> 2] = $33_1; HEAP32[$9_1 + 24 >> 2] = $42_1; HEAP8[$9_1 + 176 | 0] = 0; HEAP8[$9_1 + 94 | 0] = $51_1; $144($14, -1, 0, 1); HEAP8[$9_1 + 85 | 0] = 1; if ($10_1) { $195(HEAP32[$10_1 + 4 >> 2]); HEAP32[$10_1 + 12 >> 2] = 0; HEAP32[$10_1 + 4 >> 2] = 0; } $148($9_1); } $1_1 = $3 + 208 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $5_1 = $2_1; if (!$2_1) { break block79 } break block6; } $4_1 = $670($0_1, $6_1); $5_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2]; $2_1 = HEAP32[HEAP32[$5_1 + 4 >> 2] >> 2]; $1_1 = HEAPU8[$2_1 + 5 | 0]; block312 : { if (HEAPU8[$2_1 + 17 | 0] <= 2) { $3 = HEAP32[$6_1 + 12 >> 2]; $3 = ($3 | 0) == -1 ? $1_1 : $3; if (!HEAP32[HEAP32[$2_1 + 68 >> 2] >> 2]) { break block312 } $7_1 = HEAP32[$2_1 + 80 >> 2]; $10_1 = HEAP32[$2_1 + 84 >> 2]; if (($10_1 | 0) < 0) { $7_1 = 1 } else { $7_1 = !$7_1 & ($10_1 | 0) <= 0 } if ($7_1) { break block312 } } $3 = $1_1; } $7_1 = HEAPU8[$2_1 + 15 | 0] | HEAP32[$2_1 >> 2] == 76232 ? 33508 : HEAP32[$2_1 + 184 >> 2]; $10_1 = $1_1; block317 : { block315 : { block316 : { if (($3 | 0) == 5) { if (!$48($7_1)) { break block315 } if (!$618($2_1) | ($1_1 | 0) == 5) { break block315 } break block316; } if (($1_1 | 0) == ($3 | 0)) { break block315 } if (($1_1 | 0) == 5) { break block316 } $5_1 = $13_1; $1_1 = $3; break block317; } if (!(!!HEAPU8[$9_1 + 85 | 0] & HEAP32[$9_1 + 188 >> 2] < 2)) { HEAP32[$8_1 + 272 >> 2] = ($3 | 0) == 5 ? 10100 : 12738; $109($0_1, 10611, $8_1 + 272 | 0); break block320; } $7_1 = $5_1; block323 : { block326 : { if (($3 | 0) != 5) { block325 : { if (!HEAP32[$2_1 + 232 >> 2]) { HEAP32[$8_1 + 368 >> 2] = 0; $5_1 = $576($2_1, 1); if ($5_1) { break block323 } $1_1 = HEAP32[$2_1 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[$1_1 + 32 >> 2]]($1_1, HEAP32[$2_1 + 236 >> 2], 0, $8_1 + 368 | 0) | 0; if (!($5_1 | !HEAP32[$8_1 + 368 >> 2])) { $5_1 = $619($2_1) } if ($5_1) { break block323 } if (!HEAP32[$2_1 + 232 >> 2]) { break block325 } } $5_1 = $620($2_1); if ($5_1) { break block323 } $5_1 = $518(HEAP32[$2_1 + 232 >> 2], $9_1, HEAPU8[$2_1 + 11 | 0], HEAP32[$2_1 + 168 >> 2], HEAP32[$2_1 + 224 >> 2]); HEAP32[$2_1 + 232 >> 2] = 0; if (!$5_1) { break block325 } if (HEAPU8[$2_1 + 4 | 0]) { break block323 } $587($2_1, 1); break block323; } $688($2_1, $3); $1_1 = 1; break block326; } if (($1_1 | 0) == 4) { $688($2_1, 2) } $5_1 = $13_1; $1_1 = 5; if ($5_1) { break block317 } $1_1 = 2; } $5_1 = $149($7_1, $1_1); } $1_1 = $3; break block317; } $5_1 = $13_1; } $1_1 = $688($2_1, $5_1 ? $10_1 : $1_1); HEAP16[$4_1 + 16 >> 1] = 8706; $13_1 = 0; $1_1 = ($1_1 | 0) != 6 ? HEAP32[($1_1 << 2) + 34784 >> 2] : 0; HEAP32[$4_1 + 8 >> 2] = $1_1; $1_1 = $48($1_1); HEAP8[$4_1 + 18 | 0] = 1; HEAP32[$4_1 + 12 >> 2] = $1_1; $228($4_1, $21_1); if (!$5_1) { break block79 } break block6; } HEAP32[$8_1 + 376 >> 2] = -1; HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = -1; $5_1 = $400($9_1, HEAP32[$6_1 + 4 >> 2], HEAP32[$6_1 + 8 >> 2], $49, $50_1); if ($5_1) { if (($5_1 | 0) != 5) { break block6 } HEAP32[$8_1 + 368 >> 2] = 1; } $2_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) == 3) { break block296 } $13_1 = HEAP32[($8_1 + 368 | 0) + ($1_1 << 2) >> 2]; $110($2_1, $13_1, $13_1 >> 31); $2_1 = $2_1 + 40 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $5_1 = HEAP32[$6_1 + 12 >> 2]; block331 : { if ($5_1) { $2_1 = HEAP32[$6_1 + 16 >> 2]; HEAP32[$36_1 + 16 >> 2] = 0; $3 = $36_1 + 8 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$36_1 >> 2] = 0; HEAP32[$36_1 + 4 >> 2] = 0; $5_1 = Math_imul($5_1, 40) + $15_1 | 0; $112($5_1); HEAP32[$8_1 + 368 >> 2] = $5_1; HEAP32[$8_1 + 372 >> 2] = $2_1; HEAP32[$8_1 + 376 >> 2] = $1_1; HEAP8[$8_1 + 392 | 0] = HEAPU8[HEAP32[$1_1 + 20 >> 2] + 84 | 0]; FUNCTION_TABLE[HEAP32[$2_1 + 24 >> 2]]($8_1 + 368 | 0); $1_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $5_1 = HEAP32[$8_1 + 388 >> 2]; break block331; } $5_1 = $667($1_1, HEAP32[$6_1 + 16 >> 2]); } if (!$5_1) { $228($1_1, $21_1); break block296; } HEAP32[$8_1 + 256 >> 2] = $53($1_1); $109($0_1, 8932, $8_1 + 256 | 0); break block6; } $2_1 = HEAPU16[$6_1 + 2 >> 1]; $1_1 = ($2_1 << 2) + 35 & 524280; $7_1 = $325($9_1, $1_1 + 40 | 0, 0); if (!$7_1) { break block4 } $1_1 = $1_1 + $7_1 | 0; HEAP32[$7_1 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = $9_1; HEAP16[$1_1 + 16 >> 1] = 1; HEAP32[$7_1 + 8 >> 2] = 0; $1_1 = HEAP32[$6_1 + 16 >> 2]; HEAP32[$7_1 + 16 >> 2] = ($6_1 - $19_1 | 0) / 20; HEAP32[$7_1 + 4 >> 2] = $1_1; HEAP8[$7_1 + 25 | 0] = 0; HEAP32[$7_1 + 12 >> 2] = $0_1; HEAP16[$7_1 + 26 >> 1] = $2_1; HEAP8[$7_1 + 24 | 0] = $21_1; HEAP32[$7_1 + 20 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = $7_1; HEAP16[$6_1 >> 1] = 61859; } block334 : { $2_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; if (($2_1 | 0) == HEAP32[$7_1 + 8 >> 2]) { $12_1 = HEAPU16[$7_1 + 26 >> 1]; break block334; } HEAP32[$7_1 + 8 >> 2] = $2_1; $3 = $7_1 + 28 | 0; $12_1 = HEAPU16[$7_1 + 26 >> 1]; $1_1 = $12_1; while (1) { if (($1_1 | 0) <= 0) { break block334 } $1_1 = $1_1 - 1 | 0; HEAP32[$3 + ($1_1 << 2) >> 2] = (Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0) + Math_imul($1_1, 40); continue; }; } HEAP32[$2_1 + 12 >> 2] = HEAP32[$2_1 + 12 >> 2] + 1; FUNCTION_TABLE[HEAP32[HEAP32[$7_1 + 4 >> 2] + (HEAP32[$6_1 + 4 >> 2] ? 28 : 16) >> 2]]($7_1, $12_1, $7_1 + 28 | 0); $1_1 = HEAP32[$7_1 + 20 >> 2]; if (!$1_1) { break block79 } $5_1 = $13_1; if (($1_1 | 0) > 0) { HEAP32[$8_1 + 240 >> 2] = $53(HEAP32[$7_1 >> 2]); $109($0_1, 8932, $8_1 + 240 | 0); $5_1 = HEAP32[$7_1 + 20 >> 2]; } if (HEAPU8[$7_1 + 25 | 0]) { $1_1 = HEAP32[$6_1 - 16 >> 2]; if ($1_1) { $110(Math_imul($1_1, 40) + $15_1 | 0, 1, 0) } HEAP8[$7_1 + 25 | 0] = 0; } $204(HEAP32[$7_1 >> 2]); HEAP16[HEAP32[$7_1 >> 2] + 16 >> 1] = 1; $13_1 = 0; HEAP32[$7_1 + 20 >> 2] = 0; if (!$5_1) { break block79 } break block6; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[$1_1 >> 2]; $3 = HEAP32[$1_1 + 4 >> 2]; if (!$2_1 & ($3 | 0) == -2147483648) { break block79 } $3 = $3 - 1 | 0; $2_1 = $2_1 - 1 | 0; $3 = ($2_1 | 0) != -1 ? $3 + 1 | 0 : $3; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; if (!($2_1 | $3)) { break block160 } break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $3 = HEAP32[$1_1 >> 2]; $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!($3 | $2_1)) { break block79 } if (!$3 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0) { break block160 } $2_1 = $2_1 - 1 | 0; $7_1 = $2_1 + 1 | 0; $4_1 = $2_1; $2_1 = $3 - 1 | 0; $3 = ($2_1 | 0) != -1 ? $7_1 : $4_1; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; break block160; } $1_1 = HEAP32[$6_1 + 4 >> 2]; $4_1 = HEAP32[$6_1 + 12 >> 2]; $2_1 = $670($0_1, $6_1); $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $3 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$8_1 + 368 >> 2] = $3; HEAP32[$8_1 + 372 >> 2] = $1_1; block339 : { if (!(!!$3 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0)) { $11_1 = -1; $1_1 = -1; break block339; } $1_1 = Math_imul($4_1, 40) + $15_1 | 0; $3 = HEAP32[$1_1 >> 2]; $4_1 = $3; $1_1 = HEAP32[$1_1 + 4 >> 2]; $3 = !!$3 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0; $1_1 = $689($8_1 + 368 | 0, $3 ? $4_1 : 0, $3 ? $1_1 : 0); $11_1 = $1_1 ? -1 : HEAP32[$8_1 + 368 >> 2]; $1_1 = $1_1 ? -1 : HEAP32[$8_1 + 372 >> 2]; } HEAP32[$2_1 >> 2] = $11_1; HEAP32[$2_1 + 4 >> 2] = $1_1; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[$1_1 >> 2]; $3 = HEAP32[$1_1 + 4 >> 2]; if (!$2_1 & ($3 | 0) <= 0 | ($3 | 0) < 0) { break block79 } $4_1 = HEAP32[$6_1 + 12 >> 2]; HEAP32[$1_1 >> 2] = $2_1 - $4_1; HEAP32[$1_1 + 4 >> 2] = $3 - (($4_1 >> 31) + ($2_1 >>> 0 < $4_1 >>> 0) | 0); break block160; } $1_1 = HEAP32[$35_1 >> 2]; if ($1_1) { while (1) { $2_1 = $1_1; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($1_1) { continue } break; }; $1_1 = HEAP32[$2_1 + 12 >> 2]; } else { $1_1 = $15_1 } $1_1 = $1_1 + Math_imul(HEAP32[$6_1 + 4 >> 2], 40) | 0; $673($1_1); $2_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $673($2_1); $3 = HEAP32[$2_1 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; if ($3 >>> 0 <= HEAPU32[$1_1 >> 2] & ($4_1 | 0) >= ($2_1 | 0) | ($2_1 | 0) < ($4_1 | 0)) { break block79 } HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $2_1; break block79; } if (HEAP32[$6_1 + 4 >> 2]) { if (HEAP32[$9_1 + 512 >> 2] | HEAP32[$9_1 + 516 >> 2]) { break block79 } if (!(HEAP32[$9_1 + 520 >> 2] | HEAP32[$9_1 + 524 >> 2])) { break block160 } break block79; } if (HEAP32[$0_1 + 64 >> 2] | HEAP32[$0_1 + 68 >> 2]) { break block79 } if (!(HEAP32[$9_1 + 520 >> 2] | HEAP32[$9_1 + 524 >> 2])) { break block160 } break block79; } if (HEAPU8[$9_1 + 34 | 0] & 8) { $1_1 = HEAP32[$6_1 + 8 >> 2]; $2_1 = $1_1 + HEAP32[$9_1 + 520 >> 2] | 0; $3 = HEAP32[$9_1 + 524 >> 2] + ($1_1 >> 31) | 0; HEAP32[$9_1 + 520 >> 2] = $2_1; HEAP32[$9_1 + 524 >> 2] = $1_1 >>> 0 > $2_1 >>> 0 ? $3 + 1 | 0 : $3; break block79; } $1_1 = HEAP32[$6_1 + 8 >> 2]; $2_1 = $1_1 >> 31; if (HEAP32[$6_1 + 4 >> 2]) { $2_1 = $2_1 + HEAP32[$9_1 + 516 >> 2] | 0; $4_1 = $2_1 + 1 | 0; $3 = $2_1; $2_1 = $1_1 + HEAP32[$9_1 + 512 >> 2] | 0; $1_1 = $1_1 >>> 0 > $2_1 >>> 0 ? $4_1 : $3; HEAP32[$9_1 + 512 >> 2] = $2_1; HEAP32[$9_1 + 516 >> 2] = $1_1; break block79; } $2_1 = $2_1 + HEAP32[$0_1 + 68 >> 2] | 0; $4_1 = $2_1 + 1 | 0; $3 = $2_1; $2_1 = $1_1 + HEAP32[$0_1 + 64 >> 2] | 0; $1_1 = $1_1 >>> 0 > $2_1 >>> 0 ? $4_1 : $3; HEAP32[$0_1 + 64 >> 2] = $2_1; HEAP32[$0_1 + 68 >> 2] = $1_1; break block79; } $2_1 = $670($0_1, $6_1); $1_1 = HEAP32[$0_1 + 216 >> 2]; $671($2_1, (HEAP32[$1_1 + 12 >> 2] + Math_imul(HEAP32[$6_1 + 4 >> 2], 40) | 0) + Math_imul(HEAP32[(HEAP32[$1_1 + 8 >> 2] + Math_imul(HEAP32[$1_1 + 48 >> 2], 20) | 0) + 4 >> 2], 40) | 0, 16384); break block79; } $4_1 = HEAP32[$6_1 + 12 >> 2]; $3 = HEAP32[$6_1 + 16 >> 2]; block344 : { if (!HEAPU16[$6_1 + 2 >> 1]) { break block344 } $7_1 = HEAP32[$3 + 20 >> 2]; $2_1 = $35_1; while (1) { $1_1 = HEAP32[$2_1 >> 2]; if (!$1_1) { break block344 } $2_1 = $1_1 + 4 | 0; if (($7_1 | 0) != HEAP32[$1_1 + 24 >> 2]) { continue } break; }; break block79; } $2_1 = HEAP32[$0_1 + 224 >> 2]; if (($2_1 | 0) < HEAP32[$9_1 + 160 >> 2]) { block348 : { block347 : { $1_1 = Math_imul($4_1, 40) + $15_1 | 0; if (!(HEAPU8[$1_1 + 16 | 0] & 16)) { $2_1 = HEAP32[$3 + 12 >> 2]; $12_1 = ($2_1 + HEAP32[$3 + 8 >> 2] | 0) + !$2_1 | 0; $4_1 = Math_imul($12_1, 40); $2_1 = ($4_1 + (((HEAP32[$3 + 4 >> 2] + 7 | 0) / 8 | 0) + ($2_1 << 2) | 0) | 0) + 88 | 0; $7_1 = $270($9_1, $2_1, $2_1 >> 31); if (!$7_1) { break block4 } $204($1_1); HEAP32[$1_1 + 36 >> 2] = 3; HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$1_1 + 8 >> 2] = $7_1; HEAP16[$1_1 + 16 >> 1] = 4112; HEAP32[$7_1 + 60 >> 2] = $12_1; HEAP32[$7_1 >> 2] = $0_1; $10_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$7_1 + 48 >> 2] = ($6_1 - $19_1 | 0) / 20; HEAP32[$7_1 + 64 >> 2] = $10_1; HEAP32[$7_1 + 12 >> 2] = HEAP32[$0_1 + 88 >> 2]; HEAP32[$7_1 + 56 >> 2] = HEAP32[$0_1 + 20 >> 2]; HEAP32[$7_1 + 16 >> 2] = HEAP32[$0_1 + 96 >> 2]; HEAP32[$7_1 + 44 >> 2] = HEAP32[$0_1 + 24 >> 2]; HEAP32[$7_1 + 8 >> 2] = HEAP32[$0_1 + 104 >> 2]; HEAP32[$7_1 + 52 >> 2] = HEAP32[$0_1 + 108 >> 2]; HEAP32[$7_1 + 24 >> 2] = HEAP32[$3 + 20 >> 2]; $1_1 = $7_1 + 88 | 0; $2_1 = $4_1 + $1_1 | 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block347 } HEAP32[$1_1 + 20 >> 2] = $9_1; HEAP16[$1_1 + 16 >> 1] = 0; $1_1 = $1_1 + 40 | 0; continue; }; } $10_1 = HEAP32[$3 + 12 >> 2]; $7_1 = HEAP32[$1_1 + 8 >> 2]; $1_1 = HEAPU16[$7_1 + 64 >> 1]; $12_1 = HEAP32[$7_1 + 60 >> 2]; break block348; } $2_1 = HEAP32[$0_1 + 224 >> 2]; $1_1 = $10_1; } HEAP32[$0_1 + 224 >> 2] = $2_1 + 1; HEAP32[$7_1 + 4 >> 2] = HEAP32[$0_1 + 216 >> 2]; $2_1 = HEAP32[$9_1 + 44 >> 2]; HEAP32[$7_1 + 32 >> 2] = HEAP32[$9_1 + 40 >> 2]; HEAP32[$7_1 + 36 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$7_1 + 72 >> 2] = HEAP32[$0_1 + 40 >> 2]; HEAP32[$7_1 + 76 >> 2] = $2_1; $2_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$2_1 + 108 >> 2]; HEAP32[$7_1 + 80 >> 2] = HEAP32[$2_1 + 104 >> 2]; HEAP32[$7_1 + 84 >> 2] = $4_1; HEAP32[$7_1 + 40 >> 2] = HEAP32[$0_1 + 236 >> 2]; HEAP32[$0_1 + 216 >> 2] = $7_1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; HEAP32[$0_1 + 236 >> 2] = 0; $15_1 = $7_1 + 88 | 0; HEAP32[$0_1 + 88 >> 2] = $15_1; $2_1 = Math_imul($12_1, 40) + $15_1 | 0; HEAP32[$0_1 + 96 >> 2] = $2_1; HEAP32[$0_1 + 24 >> 2] = $1_1 & 65535; HEAP32[$0_1 + 20 >> 2] = $12_1; $1_1 = $2_1 + ($10_1 << 2) | 0; HEAP32[$7_1 + 20 >> 2] = $1_1; $2_1 = (HEAP32[$3 + 4 >> 2] + 7 | 0) / 8 | 0; if ($2_1) { wasm2js_memory_fill($1_1, 0, $2_1) } $19_1 = HEAP32[$3 >> 2]; HEAP32[$0_1 + 104 >> 2] = $19_1; HEAP32[$0_1 + 108 >> 2] = HEAP32[$3 + 4 >> 2]; $6_1 = $19_1 - 20 | 0; break block277; } $109($0_1, 10963, 0); break block320; } $1_1 = HEAP32[$6_1 + 12 >> 2]; $10_1 = HEAP32[$6_1 + 16 >> 2]; $14 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAPU8[$14 + 16 | 0] & 16)) { if ($691($14)) { break block4 } } $12_1 = Math_imul($1_1, 40) + $15_1 | 0; $1_1 = $12_1; $11_1 = HEAP32[$1_1 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; if ($10_1) { $1_1 = HEAP32[$14 + 8 >> 2]; if (HEAP32[$1_1 + 28 >> 2] != ($10_1 | 0)) { $2_1 = HEAP32[$1_1 + 8 >> 2]; if ($2_1) { if (!(HEAP8[$1_1 + 26 | 0] & 1)) { $2_1 = $692($2_1) } $7_1 = $1_1 + 20 | 0; block357 : { block355 : { while (1) { $3 = HEAP32[$7_1 >> 2]; if (!$3) { break block355 } $7_1 = HEAP32[$3 + 12 >> 2]; if ($7_1) { $693($7_1, $8_1 + 368 | 0, $8_1 + 472 | 0); HEAP32[$3 + 12 >> 2] = 0; $7_1 = $3 + 8 | 0; $2_1 = $694(HEAP32[$8_1 + 368 >> 2], $2_1); continue; } break; }; HEAP32[$3 + 12 >> 2] = $695($2_1); break block357; } $3 = $696($1_1); HEAP32[$7_1 >> 2] = $3; if (!$3) { break block357 } HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$3 + 12 >> 2] = $695($2_1); } HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; HEAP16[$1_1 + 26 >> 1] = HEAPU16[$1_1 + 26 >> 1] | 1; } HEAP32[$1_1 + 28 >> 2] = $10_1; } $1_1 = $1_1 + 20 | 0; while (1) { $3 = HEAP32[$1_1 >> 2]; if ($3) { $1_1 = $3 + 12 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $2_1 = HEAP32[$1_1 + 4 >> 2]; $7_1 = HEAP32[$1_1 >> 2]; if (($4_1 | 0) <= ($2_1 | 0) & $11_1 >>> 0 <= $7_1 >>> 0 | ($2_1 | 0) > ($4_1 | 0)) { if (($2_1 | 0) <= ($4_1 | 0) & $7_1 >>> 0 <= $11_1 >>> 0 | ($2_1 | 0) < ($4_1 | 0)) { break block160 } $2_1 = 12; } else { $2_1 = 8 } $1_1 = $2_1 + $1_1 | 0; continue; } break; }; $1_1 = $3 + 8 | 0; continue; } break; }; if (($10_1 | 0) < 0) { break block79 } $11_1 = HEAP32[$12_1 >> 2]; $4_1 = HEAP32[$12_1 + 4 >> 2]; } $697(HEAP32[$14 + 8 >> 2], $11_1, $4_1); break block79; } block362 : { $3 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAPU8[$3 + 16 | 0] & 16)) { break block362 } $1_1 = HEAP32[$3 + 8 >> 2]; $2_1 = HEAPU16[$1_1 + 26 >> 1]; if (!($2_1 & 2)) { if (!($2_1 & 1)) { HEAP32[$1_1 + 8 >> 2] = $692(HEAP32[$1_1 + 8 >> 2]); $2_1 = HEAPU16[$1_1 + 26 >> 1]; } HEAP16[$1_1 + 26 >> 1] = $2_1 | 3; } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!$2_1) { break block362 } $3 = HEAP32[$2_1 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; $2_1 = HEAP32[$2_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = $2_1; if (!$2_1) { $698($1_1) } $110(Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0, $3, $4_1); break block277; } $112($3); break block16; } $2_1 = HEAP32[$6_1 + 8 >> 2]; $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; if (!(HEAPU8[$1_1 + 16 | 0] & 16)) { if ($691($1_1)) { break block4 } } $3 = HEAP32[$1_1 + 8 >> 2]; $1_1 = Math_imul($2_1, 40) + $15_1 | 0; $697($3, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); break block79; } $3 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $4_1 = HEAP32[$3 >> 2]; $14 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAPU16[$6_1 + 2 >> 1] << 4) | 0) + 4 >> 2]; $13_1 = HEAP32[$14 + 4 >> 2]; $1_1 = HEAP32[$13_1 + 4 >> 2]; $12_1 = 0; $2_1 = HEAP32[$6_1 + 16 >> 2]; $7_1 = HEAP32[$2_1 + 4 >> 2]; if (!$7_1) { $12_1 = HEAP32[$2_1 + 8 >> 2] != 1 } $16_1 = HEAP32[$6_1 + 12 >> 2]; $10_1 = HEAP32[$6_1 + 8 >> 2]; $17_1 = HEAP32[$1_1 + 32 >> 2]; $18_1 = HEAP32[$1_1 + 36 >> 2]; HEAP32[$13_1 + 4 >> 2] = HEAP32[$14 >> 2]; wasm2js_memory_fill($31_1, 0, 80); HEAP32[$8_1 + 472 >> 2] = $13_1; HEAP32[$8_1 + 548 >> 2] = $9_1; HEAP32[$8_1 + 476 >> 2] = HEAP32[$13_1 >> 2]; $1_1 = HEAP32[$13_1 + 48 >> 2]; HEAP8[$8_1 + 541 | 0] = 1; HEAP32[$8_1 + 528 >> 2] = 100; HEAP32[$8_1 + 532 >> 2] = 1e9; HEAP32[$8_1 + 488 >> 2] = $4_1 + 1; HEAP32[$8_1 + 484 >> 2] = $1_1; HEAP32[$8_1 + 524 >> 2] = $8_1 + 368; block369 : { if (!$1_1) { break block369 } $4_1 = $132(($1_1 >>> 3 | 0) + 1 | 0, 0); HEAP32[$8_1 + 480 >> 2] = $4_1; block370 : { if (!$4_1) { break block370 } $14 = $515(HEAP32[$13_1 + 36 >> 2]); HEAP32[$8_1 + 544 >> 2] = $14; if (!$14) { break block370 } $14 = (HEAPU32[18884] / HEAPU32[$13_1 + 36 >> 2] | 0) + 1 | 0; if ($1_1 >>> 0 >= $14 >>> 0) { $1_1 = $4_1 + ($14 >>> 3 | 0) | 0; HEAP8[$1_1 | 0] = HEAPU8[$1_1 | 0] | 1 << ($14 & 7); } if (!$12_1) { HEAP32[$8_1 + 504 >> 2] = 30721; $1_1 = HEAP32[HEAP32[$13_1 + 12 >> 2] + 56 >> 2]; $699($8_1 + 472 | 0, 1, $156($1_1 + 32 | 0), $156($1_1 + 36 | 0)); HEAP32[$8_1 + 504 >> 2] = 0; } $4_1 = Math_imul($16_1, 40); $14 = $2_1 + 4 | 0; block373 : { if (!$7_1) { break block373 } if (HEAPU8[$13_1 + 17 | 0]) { $2_1 = 0; $12_1 = ($10_1 | 0) > 0 ? $10_1 : 0; $1_1 = 0; while (1) { if (($1_1 | 0) != ($12_1 | 0)) { $16_1 = HEAP32[$14 + ($1_1 << 2) >> 2]; $2_1 = $2_1 >>> 0 > $16_1 >>> 0 ? $2_1 : $16_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; $1_1 = $156(HEAP32[HEAP32[$13_1 + 12 >> 2] + 56 >> 2] + 52 | 0); if (($1_1 | 0) == ($2_1 | 0)) { break block373 } HEAP32[$8_1 + 228 >> 2] = $1_1; HEAP32[$8_1 + 224 >> 2] = $2_1; $700($8_1 + 472 | 0, 25200, $8_1 + 224 | 0); break block373; } if (!$156(HEAP32[HEAP32[$13_1 + 12 >> 2] + 56 >> 2] - -64 | 0)) { break block373 } $700($8_1 + 472 | 0, 10105, 0); } $12_1 = $4_1 + $15_1 | 0; $1_1 = HEAP32[$13_1 + 4 >> 2]; $2_1 = HEAP32[$1_1 + 32 >> 2]; $4_1 = HEAP32[$1_1 + 36 >> 2]; HEAP32[$1_1 + 32 >> 2] = $2_1 & -2097153; HEAP32[$1_1 + 36 >> 2] = $4_1; $1_1 = 0; while (1) { $2_1 = HEAP32[$8_1 + 488 >> 2]; if (!(!$2_1 | ($1_1 | 0) >= ($10_1 | 0))) { $11_1 = 0; $4_1 = 0; HEAP32[$8_1 + 552 >> 2] = 0; HEAP32[$8_1 + 556 >> 2] = 0; $16_1 = $14 + ($1_1 << 2) | 0; $2_1 = HEAP32[$16_1 >> 2]; if ($2_1) { if (!(!HEAPU8[$13_1 + 17 | 0] | (!$7_1 | ($2_1 | 0) == 1))) { $701($8_1 + 472 | 0, $2_1, 1, 0); $2_1 = HEAP32[$16_1 >> 2]; } HEAP32[$8_1 + 508 >> 2] = $2_1; $702($8_1 + 472 | 0, $2_1, $8_1 + 360 | 0, -1, 2147483647); $11_1 = HEAP32[$8_1 + 552 >> 2]; $4_1 = HEAP32[$8_1 + 556 >> 2]; } $110($12_1 + Math_imul($1_1, 40) | 0, $11_1, $4_1); $1_1 = $1_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$13_1 + 4 >> 2]; HEAP32[$1_1 + 32 >> 2] = $17_1; HEAP32[$1_1 + 36 >> 2] = $18_1; $1_1 = 1; if (!$7_1) { break block369 } while (1) { if (!$2_1 | HEAPU32[$8_1 + 484 >> 2] < $1_1 >>> 0) { break block369 } $2_1 = 1 << ($1_1 & 7); $4_1 = $1_1 >>> 3 | 0; block381 : { if (!($2_1 & HEAPU8[$4_1 + HEAP32[$8_1 + 480 >> 2] | 0])) { if (wasm2js_i32$0 = ($180($13_1, $1_1) | 0) == ($1_1 | 0), wasm2js_i32$4 = 0, wasm2js_i32$3 = HEAPU8[$13_1 + 17 | 0], wasm2js_i32$3 ? wasm2js_i32$0 : wasm2js_i32$4) { break block381 } HEAP32[$8_1 + 208 >> 2] = $1_1; $700($8_1 + 472 | 0, 15777, $8_1 + 208 | 0); if (!($2_1 & HEAPU8[$4_1 + HEAP32[$8_1 + 480 >> 2] | 0])) { break block381 } } if (($180($13_1, $1_1) | 0) != ($1_1 | 0) | !HEAPU8[$13_1 + 17 | 0]) { break block381 } HEAP32[$8_1 + 192 >> 2] = $1_1; $700($8_1 + 472 | 0, 16551, $8_1 + 192 | 0); } $1_1 = $1_1 + 1 | 0; $2_1 = HEAP32[$8_1 + 488 >> 2]; continue; }; } HEAP32[$8_1 + 488 >> 2] = 0; HEAP32[$8_1 + 492 >> 2] = 1; HEAP32[$8_1 + 496 >> 2] = 7; } $1_1 = $3 + 40 | 0; $506(HEAP32[$8_1 + 544 >> 2]); $24(HEAP32[$8_1 + 480 >> 2]); $2_1 = HEAP32[$8_1 + 492 >> 2]; block383 : { if (!$2_1) { $54($41_1); $4_1 = 0; break block383; } $4_1 = $57($41_1); } $13_1 = HEAP32[$8_1 + 496 >> 2]; $112($1_1); block385 : { if ($2_1) { if ($13_1) { break block385 } $7_1 = HEAP32[$3 >> 2]; $2_1 = $2_1 - 1 | 0; $10_1 = $7_1 - $2_1 | 0; $2_1 = HEAP32[$3 + 4 >> 2] - (($2_1 >> 31) + ($2_1 >>> 0 > $7_1 >>> 0) | 0) | 0; HEAP32[$3 >> 2] = $10_1; HEAP32[$3 + 4 >> 2] = $2_1; $111($1_1, $4_1, -1, -1, 1, 1); } $228($1_1, $21_1); break block277; } $24($4_1); break block386; } $2_1 = $395(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 12 >> 2] + 40 | 0, HEAP32[$6_1 + 16 >> 2], 0); if (!$2_1) { break block79 } block387 : { if (HEAP32[$2_1 + 20 >> 2] != HEAP32[$2_1 + 24 >> 2]) { break block387 } $1_1 = $703($2_1); if (!$1_1) { break block387 } $7_1 = $1_1 + 56 | 0; while (1) { $1_1 = $7_1; $3 = HEAP32[$1_1 >> 2]; if (!$3) { break block387 } $7_1 = $3 + 32 | 0; if (($2_1 | 0) != ($3 | 0)) { continue } break; }; HEAP32[$1_1 >> 2] = HEAP32[$7_1 >> 2]; } $5($9_1, $2_1); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; break block79; } $3 = $395(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 12 >> 2] + 24 | 0, HEAP32[$6_1 + 16 >> 2], 0); if ($3) { $2_1 = HEAP32[$3 + 12 >> 2]; $1_1 = HEAP32[$2_1 + 8 >> 2]; block390 : { if (($1_1 | 0) == ($3 | 0)) { HEAP32[$2_1 + 8 >> 2] = HEAP32[$3 + 20 >> 2]; break block390; } while (1) { $2_1 = $1_1; if (!$1_1) { break block390 } $1_1 = HEAP32[$1_1 + 20 >> 2]; if (($3 | 0) != ($1_1 | 0)) { continue } break; }; HEAP32[$2_1 + 20 >> 2] = HEAP32[$3 + 20 >> 2]; } $704($9_1, $3); } HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; break block79; } $6($9_1, $395(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 12 >> 2] + 8 | 0, HEAP32[$6_1 + 16 >> 2], 0)); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; break block79; } $5_1 = $705($9_1, HEAP32[$6_1 + 4 >> 2]); break block202; } $1_1 = HEAP32[$6_1 + 4 >> 2]; block394 : { block392 : { if (!HEAP32[$6_1 + 16 >> 2]) { $158(HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] & -17; $5_1 = $420($9_1, $1_1, $27, HEAPU16[$6_1 + 2 >> 1]); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532; break block392; } HEAP32[$8_1 + 368 >> 2] = $9_1; HEAP32[$8_1 + 384 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = $27; HEAP32[$8_1 + 376 >> 2] = $1_1; $1_1 = HEAP32[$9_1 + 16 >> 2] + ($1_1 << 4) | 0; HEAP32[$8_1 + 392 >> 2] = HEAP32[HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] + 48 >> 2]; $1_1 = HEAP32[$1_1 >> 2]; HEAP32[$8_1 + 184 >> 2] = HEAP32[$6_1 + 16 >> 2]; HEAP32[$8_1 + 180 >> 2] = 9323; HEAP32[$8_1 + 176 >> 2] = $1_1; $1_1 = $310($9_1, 15172, $8_1 + 176 | 0); if (!$1_1) { $5_1 = 7; break block394; } HEAP8[$9_1 + 177 | 0] = 1; HEAP32[$8_1 + 388 >> 2] = 0; HEAP32[$8_1 + 380 >> 2] = 0; $2_1 = $97($9_1, $1_1, 4, $8_1 + 368 | 0, 0); $5_1 = $2_1 ? $2_1 : HEAP32[$8_1 + 380 >> 2]; if (!($5_1 | HEAP32[$8_1 + 388 >> 2])) { $5_1 = $181(100609) } $13($9_1, $1_1); HEAP8[$9_1 + 177 | 0] = 0; } if (!$5_1) { break block296 } } $148($9_1); if (($5_1 | 0) != 7) { break block6 } break block4; } HEAP8[$9_1 + 96 | 0] = HEAPU8[$9_1 + 96 | 0] + 1; HEAP32[$8_1 + 368 >> 2] = 0; $1_1 = HEAPU8[$9_1 + 94 | 0]; $2_1 = HEAP32[$9_1 + 364 >> 2]; $5_1 = HEAP32[$6_1 + 4 >> 2]; if ($5_1 & 1) { HEAP8[$9_1 + 94 | 0] = 0; HEAP32[$9_1 + 364 >> 2] = 0; } $3 = HEAP32[$9_1 + 496 >> 2]; if ($5_1 & 2) { HEAP32[$9_1 + 496 >> 2] = HEAP32[$6_1 + 8 >> 2] } $5_1 = $97($9_1, HEAP32[$6_1 + 16 >> 2], 0, 0, $8_1 + 368 | 0); HEAP32[$9_1 + 364 >> 2] = $2_1; HEAP32[$9_1 + 496 >> 2] = $3; HEAP8[$9_1 + 94 | 0] = $1_1; HEAP8[$9_1 + 96 | 0] = HEAPU8[$9_1 + 96 | 0] - 1; $1_1 = HEAP32[$8_1 + 368 >> 2]; if (!($1_1 | $5_1)) { break block296 } HEAP32[$8_1 + 160 >> 2] = $1_1; $109($0_1, 8932, $8_1 + 160 | 0); $24(HEAP32[$8_1 + 368 >> 2]); if (($5_1 | 0) != 7) { break block6 } break block4; } $13_1 = 0; $1_1 = $670($0_1, $6_1); HEAP32[$8_1 + 368 >> 2] = 0; $5_1 = $707(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2], $8_1 + 368 | 0, HEAP32[$6_1 + 12 >> 2]); if ($5_1) { break block6 } HEAP32[$1_1 >> 2] = HEAP32[$8_1 + 368 >> 2]; HEAP32[$1_1 + 4 >> 2] = 0; break block79; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $1_1 = HEAP32[$2_1 + 36 >> 2]; if (HEAPU8[$2_1 | 0] == 1) { $659($9_1, $1_1); break block79; } $13_1 = 0; $5_1 = $708(HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 64 >> 2], 0); if (!$5_1) { break block79 } break block6; } HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = 0; $5_1 = $708(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 8 >> 2] << 4) | 0) + 4 >> 2], HEAP32[$6_1 + 4 >> 2], $8_1 + 368 | 0); $2_1 = HEAP32[$6_1 + 12 >> 2]; if (!$2_1) { break block202 } $4_1 = HEAP32[$8_1 + 372 >> 2]; $3 = $4_1 + HEAP32[$0_1 + 44 >> 2] | 0; $1_1 = HEAP32[$8_1 + 368 >> 2]; $7_1 = $1_1 + HEAP32[$0_1 + 40 >> 2] | 0; HEAP32[$0_1 + 40 >> 2] = $7_1; HEAP32[$0_1 + 44 >> 2] = $1_1 >>> 0 > $7_1 >>> 0 ? $3 + 1 | 0 : $3; if (($2_1 | 0) <= 0) { break block202 } $2_1 = Math_imul($2_1, 40) + $15_1 | 0; $3 = HEAP32[$2_1 >> 2]; $4_1 = $4_1 + HEAP32[$2_1 + 4 >> 2] | 0; $3 = $1_1 + $3 | 0; $1_1 = $1_1 >>> 0 > $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $1_1; break block202; } $7_1 = $670($0_1, $6_1); HEAP16[$7_1 + 16 >> 1] = 1; if (HEAP32[$9_1 + 188 >> 2] > (HEAP32[$9_1 + 200 >> 2] + 1 | 0)) { HEAP8[$0_1 + 148 | 0] = 2; $5_1 = 6; break block6; } $3 = HEAP32[$6_1 + 4 >> 2]; $10_1 = HEAP32[$6_1 + 12 >> 2]; $4_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($10_1 << 4) | 0) + 4 >> 2]; $1_1 = HEAP32[$4_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$4_1 >> 2]; $2_1 = 0; HEAP32[$8_1 + 472 >> 2] = 0; block402 : { if (HEAPU32[$1_1 + 48 >> 2] < $3 >>> 0) { $5_1 = $181(81028); break block402; } $5_1 = $708($4_1, $3, 0); if ($5_1) { break block402 } $5_1 = $189($1_1, $3, $8_1 + 472 | 0, 0); HEAP32[$8_1 + 368 >> 2] = $5_1; if ($5_1) { $625(HEAP32[$8_1 + 472 >> 2]); break block402; } if (HEAPU8[$1_1 + 17 | 0]) { $709($4_1, 4, $8_1 + 360 | 0); $12_1 = HEAP32[$8_1 + 360 >> 2]; block406 : { if (($12_1 | 0) == ($3 | 0)) { $5_1 = HEAP32[$8_1 + 472 >> 2]; $710($5_1, $8_1 + 368 | 0); $625($5_1); $5_1 = HEAP32[$8_1 + 368 >> 2]; if ($5_1) { break block402 } $2_1 = 0; break block406; } $625(HEAP32[$8_1 + 472 >> 2]); $14 = $8_1 + 356 | 0; $5_1 = $189($1_1, $12_1, $14, 0); if ($5_1) { break block402 } $16_1 = HEAP32[$8_1 + 356 >> 2]; $5_1 = $626($1_1, $16_1, 1, 0, $3, 0); $625($16_1); if ($5_1) { break block402 } HEAP32[$8_1 + 356 >> 2] = 0; HEAP32[$8_1 + 368 >> 2] = $189($1_1, $12_1, $14, 0); $5_1 = HEAP32[$8_1 + 356 >> 2]; $710($5_1, $8_1 + 368 | 0); $625($5_1); $5_1 = HEAP32[$8_1 + 368 >> 2]; if ($5_1) { break block402 } $2_1 = $12_1; } $5_1 = (HEAPU32[18884] / HEAPU32[$1_1 + 36 >> 2] | 0) + 2 | 0; while (1) { $3 = ($5_1 | 0) == ($12_1 | 0); $12_1 = $12_1 - 1 | 0; if ($3) { continue } if (($180($1_1, $12_1) | 0) == ($12_1 | 0)) { continue } break; }; $5_1 = $147($4_1, 4, $12_1); break block402; } $1_1 = HEAP32[$8_1 + 472 >> 2]; $710($1_1, $8_1 + 368 | 0); $625($1_1); $5_1 = HEAP32[$8_1 + 368 >> 2]; } HEAP32[$7_1 >> 2] = $2_1; HEAP32[$7_1 + 4 >> 2] = $2_1 >> 31; HEAP16[$7_1 + 16 >> 1] = 4; if ($5_1) { break block6 } $13_1 = 0; if (!$2_1) { break block79 } $4_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($10_1 << 4) | 0) + 12 >> 2]; $1_1 = $4_1 + 16 | 0; $3 = HEAP32[$6_1 + 4 >> 2]; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $7_1 = HEAP32[$1_1 + 8 >> 2]; if (HEAP32[$7_1 + 20 >> 2] != ($2_1 | 0)) { continue } HEAP32[$7_1 + 20 >> 2] = $3; continue; } break; }; $1_1 = $4_1 + 32 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $4_1 = HEAP32[$1_1 + 8 >> 2]; if (HEAP32[$4_1 + 44 >> 2] != ($2_1 | 0)) { continue } HEAP32[$4_1 + 44 >> 2] = $3; continue; } break; }; $45_1 = $10_1 + 1 | 0; break block79; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; HEAP32[$8_1 + 472 >> 2] = HEAP32[$2_1 + 40 >> 2]; $5_1 = HEAP32[$6_1 + 16 >> 2]; HEAP8[$8_1 + 494 | 0] = $1_1 >>> 0 < 42 ? -1 : 0; HEAP16[$8_1 + 492 >> 1] = $5_1; HEAP32[$8_1 + 476 >> 2] = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1; $1_1 = HEAP32[$2_1 + 36 >> 2]; $2_1 = $262($1_1); if (($2_1 | 0) <= 0) { $5_1 = $181(100316); break block6; } HEAP32[$8_1 + 392 >> 2] = 0; HEAP32[$8_1 + 388 >> 2] = $9_1; HEAP16[$8_1 + 384 >> 1] = 0; $5_1 = $2_1; $2_1 = $8_1 + 368 | 0; $5_1 = $263($1_1, $5_1, $2_1); if ($5_1) { break block6 } $13_1 = 0; $1_1 = $711(HEAP32[$8_1 + 380 >> 2], HEAP32[$8_1 + 376 >> 2], $8_1 + 472 | 0, 0); $712($2_1); if (((HEAP8[$6_1 | 0] & 1 ? $1_1 + 1 | 0 : 0 - $1_1 | 0) | 0) > 0) { break block160 } break block79; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (!HEAPU8[$1_1 + 3 | 0]) { break block79 } $5_1 = $679($1_1); break block202; } $3 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $5_1 = $713($3); if ($5_1) { break block6 } if (!HEAPU8[$3 + 2 | 0]) { $1_1 = HEAP32[$3 + 36 >> 2]; $2_1 = $262($1_1); HEAP32[$8_1 + 392 >> 2] = 0; HEAP32[$8_1 + 388 >> 2] = $9_1; HEAP16[$8_1 + 384 >> 1] = 0; $5_1 = $263($1_1, $2_1, $8_1 + 368 | 0); if ($5_1) { break block6 } $1_1 = HEAP32[$8_1 + 376 >> 2]; $2_1 = HEAP8[$1_1 | 0]; if (($2_1 | 0) < 0) { $264($1_1, $8_1 + 360 | 0); $2_1 = HEAP32[$8_1 + 360 >> 2]; } block414 : { block412 : { if ($2_1 >>> 0 < 3) { break block412 } $4_1 = HEAP32[$8_1 + 380 >> 2]; if ($4_1 >>> 0 < $2_1 >>> 0) { break block412 } $10_1 = ($1_1 + $2_1 | 0) - 1 | 0; $7_1 = HEAP8[$10_1 | 0]; if (($7_1 | 0) < 0) { $264($10_1, $8_1 + 356 | 0); $7_1 = HEAP32[$8_1 + 356 >> 2]; } if (($7_1 | 0) == 7 | $7_1 - 10 >>> 0 < 4294967287) { break block412 } $10_1 = HEAPU8[$7_1 + 34576 | 0]; if ($4_1 >>> 0 >= $2_1 + $10_1 >>> 0) { break block414 } } $712($8_1 + 368 | 0); $5_1 = $181(90337); break block6; } $265($1_1 + ($4_1 - $10_1 | 0) | 0, $7_1, $8_1 + 472 | 0); $2_1 = HEAP32[$8_1 + 472 >> 2]; $13_1 = HEAP32[$8_1 + 476 >> 2]; $1_1 = $13_1; $712($8_1 + 368 | 0); if (HEAPU8[$6_1 | 0] == 141) { $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 12 >> 2] << 2) >> 2]; HEAP32[$1_1 + 56 >> 2] = $2_1; HEAP32[$1_1 + 60 >> 2] = $13_1; HEAP16[$1_1 + 2 >> 1] = 256; $13_1 = 0; HEAP32[$1_1 + 24 >> 2] = 0; $2_1 = HEAP32[$6_1 + 16 >> 2]; HEAP32[$1_1 + 32 >> 2] = $3; HEAP32[$1_1 + 8 >> 2] = $2_1; break block79; } $13_1 = $670($0_1, $6_1); HEAP32[$13_1 >> 2] = $2_1; HEAP32[$13_1 + 4 >> 2] = $1_1; break block296; } $112(Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0); break block296; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$1_1 + 36 >> 2]; HEAP32[$8_1 + 368 >> 2] = HEAP32[$1_1 + 40 >> 2]; $5_1 = HEAP32[$6_1 + 12 >> 2]; HEAP8[$8_1 + 390 | 0] = 0; HEAP16[$8_1 + 388 >> 1] = $5_1; HEAP32[$8_1 + 372 >> 2] = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1; $5_1 = $714($2_1, $8_1 + 368 | 0, $8_1 + 472 | 0); if ($5_1) { break block6 } block417 : { if (!HEAP32[$8_1 + 472 >> 2]) { $5_1 = $715($2_1, 4); if ($5_1) { break block6 } break block417; } if (!HEAPU16[$6_1 + 2 >> 1] | (HEAP32[$9_1 + 32 >> 2] & 268435457) == 1) { break block417 } $5_1 = 779; $2(779, 100111, 10314); break block6; } HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 28 >> 2] = 0; break block296; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $14 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; if (HEAPU8[$14 + 17 | 0] & 4) { $5_1 = $207($14); if ($5_1) { break block6 } } $2_1 = HEAP32[$1_1 + 36 >> 2]; $1_1 = HEAP32[$14 + 8 >> 2]; $5_1 = HEAP8[$1_1 + 1 | 0]; $7_1 = $5_1 & 255; HEAP32[$8_1 + 368 >> 2] = $7_1; if (($5_1 | 0) < 0) { $264($1_1 + 1 | 0, $8_1 + 368 | 0); $7_1 = HEAP32[$8_1 + 368 >> 2]; } block421 : { if (!(($7_1 | 0) == 7 | $7_1 - 1 >>> 0 > 8)) { HEAP8[$2_1 + 68 | 0] = HEAP8[$2_1 + 68 | 0] & 1; break block421; } if (!(!($7_1 & 1) | ($7_1 | 0) < 11)) { HEAP8[$2_1 + 68 | 0] = HEAPU8[$2_1 + 68 | 0] & 2; break block421; } HEAP8[$2_1 + 68 | 0] = 0; } $16_1 = HEAP32[$14 + 12 >> 2]; $4_1 = $16_1 + 8 | 0; $1_1 = $716($16_1, $16_1 >> 31) + $16_1 | 0; $12_1 = $1_1 >> 31; $5_1 = 0; $3 = HEAP32[$2_1 + 4 >> 2]; block423 : { if (!$3) { break block423 } block425 : { if (HEAP32[$2_1 + 44 >> 2]) { $10_1 = HEAP32[$2_1 + 56 >> 2]; $7_1 = $10_1 >> 31; if (!($7_1 | $10_1)) { break block423 } $10_1 = $4_1 + $10_1 | 0; $7_1 = $10_1 >>> 0 < $4_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; $10_1 = $3 >>> 0 < $10_1 >>> 0; $3 = $3 >> 31; if ($10_1 & ($3 | 0) <= ($7_1 | 0) | ($3 | 0) < ($7_1 | 0)) { break block425 } break block423; } $10_1 = HEAP32[$2_1 + 48 >> 2]; $11_1 = $3 >>> 0 < $10_1 >>> 0; $7_1 = HEAP32[$2_1 + 52 >> 2]; $3 = $3 >> 31; if ($11_1 & ($7_1 | 0) >= ($3 | 0) | ($3 | 0) < ($7_1 | 0)) { break block425 } $3 = HEAP32[$2_1 >> 2]; $11_1 = $3 >> 31; if (!HEAP32[20646] | (($11_1 | 0) >= ($7_1 | 0) & $3 >>> 0 >= $10_1 >>> 0 | ($7_1 | 0) < ($11_1 | 0))) { break block423 } } $5_1 = $717($2_1); HEAP32[$2_1 + 56 >> 2] = 0; HEAP32[$2_1 + 48 >> 2] = 0; HEAP32[$2_1 + 52 >> 2] = 0; } $3 = $12_1 + HEAP32[$2_1 + 52 >> 2] | 0; $10_1 = $3 + 1 | 0; $7_1 = $3; $3 = $1_1 + HEAP32[$2_1 + 48 >> 2] | 0; $7_1 = $3 >>> 0 < $1_1 >>> 0 ? $10_1 : $7_1; HEAP32[$2_1 + 48 >> 2] = $3; HEAP32[$2_1 + 52 >> 2] = $7_1; if (HEAP32[$2_1 + 8 >> 2] < ($1_1 | 0)) { HEAP32[$2_1 + 8 >> 2] = $1_1 } $1_1 = HEAP32[$2_1 + 44 >> 2]; block432 : { if ($1_1) { $3 = HEAP32[$2_1 + 40 >> 2]; $12_1 = HEAP32[$2_1 + 56 >> 2]; $10_1 = $4_1 + $12_1 | 0; $11_1 = HEAP32[$2_1 + 60 >> 2]; block429 : { if (($10_1 | 0) <= ($11_1 | 0)) { $10_1 = $1_1; break block429; } $7_1 = $10_1 >> 31; $4_1 = $11_1 >> 31; while (1) { $4_1 = $4_1 << 1 | $11_1 >>> 31; $11_1 = $11_1 << 1; if (($4_1 | 0) <= ($7_1 | 0) & $10_1 >>> 0 > $11_1 >>> 0 | ($4_1 | 0) < ($7_1 | 0)) { continue } break; }; $17_1 = HEAP32[$2_1 + 4 >> 2]; $12_1 = $17_1 >> 31; $18_1 = $11_1; $11_1 = $11_1 >>> 0 < $17_1 >>> 0 & ($4_1 | 0) <= ($12_1 | 0) | ($4_1 | 0) < ($12_1 | 0); $17_1 = $11_1 ? $18_1 : $17_1; $18_1 = $10_1; $4_1 = $11_1 ? $4_1 : $12_1; $10_1 = $10_1 >>> 0 < $17_1 >>> 0 & ($7_1 | 0) <= ($4_1 | 0) | ($4_1 | 0) > ($7_1 | 0); $12_1 = $10_1 ? $17_1 : $18_1; $10_1 = $33($1_1, $12_1, $10_1 ? $4_1 : $7_1); if (!$10_1) { break block305 } $1_1 = $3 ? $3 - $1_1 | 0 : -1; block431 : { if (($1_1 | 0) < 0) { $3 = HEAP32[$2_1 + 40 >> 2]; break block431; } $3 = $1_1 + $10_1 | 0; HEAP32[$2_1 + 40 >> 2] = $3; } HEAP32[$2_1 + 60 >> 2] = $12_1; HEAP32[$2_1 + 44 >> 2] = $10_1; $12_1 = HEAP32[$2_1 + 56 >> 2]; } HEAP32[$2_1 + 56 >> 2] = ($16_1 + 15 & -8) + $12_1; $7_1 = $10_1 + $12_1 | 0; if (!$3) { break block432 } HEAP32[$7_1 + 4 >> 2] = $3 - $10_1; break block432; } $7_1 = $30($4_1, 0); if (!$7_1) { break block305 } HEAP32[$7_1 + 4 >> 2] = HEAP32[$2_1 + 40 >> 2]; } $1_1 = HEAP32[$14 + 12 >> 2]; if ($1_1) { wasm2js_memory_copy($7_1 + 8 | 0, HEAP32[$14 + 8 >> 2], $1_1) } HEAP32[$7_1 >> 2] = HEAP32[$14 + 12 >> 2]; HEAP32[$2_1 + 40 >> 2] = $7_1; break block202; } $1_1 = Math_imul(HEAP32[$6_1 + 8 >> 2], 40) + $15_1 | 0; $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $7_1 = HEAPU16[$6_1 + 2 >> 1]; if ($7_1 & 1) { $5_1 = HEAP32[$0_1 + 44 >> 2]; $3 = $5_1; $4_1 = $5_1 + 1 | 0; $5_1 = HEAP32[$0_1 + 40 >> 2] + 1 | 0; $3 = $5_1 ? $3 : $4_1; HEAP32[$0_1 + 40 >> 2] = $5_1; HEAP32[$0_1 + 44 >> 2] = $3; } if (HEAPU8[$1_1 + 17 | 0] & 4) { $5_1 = $207($1_1); if ($5_1) { break block6 } $7_1 = HEAPU16[$6_1 + 2 >> 1]; } $5_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$8_1 + 376 >> 2] = $5_1; HEAP32[$8_1 + 380 >> 2] = $5_1 >> 31; HEAP32[$8_1 + 368 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$8_1 + 388 >> 2] = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1; HEAP16[$8_1 + 392 >> 1] = HEAP32[$6_1 + 16 >> 2]; $5_1 = $718(HEAP32[$2_1 + 36 >> 2], $8_1 + 368 | 0, $7_1 & 138, $7_1 & 16 ? HEAP32[$2_1 + 28 >> 2] : 0); HEAP32[$2_1 + 24 >> 2] = 0; break block202; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $5_1 = $719(HEAP32[$1_1 + 36 >> 2]); break block437; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $5_1 = $260(HEAP32[$1_1 + 36 >> 2]); break block437; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$1_1 + 36 >> 2]; if (HEAPU8[$2_1 + 64 | 0]) { HEAP32[$8_1 + 368 >> 2] = 0; $5_1 = $720(HEAP32[$2_1 + 20 >> 2], $8_1 + 368 | 0); if ($5_1 | !HEAP32[$8_1 + 368 >> 2]) { break block437 } break block439; } $13_1 = HEAP32[$2_1 + 40 >> 2]; HEAP32[$2_1 + 40 >> 2] = HEAP32[$13_1 + 4 >> 2]; HEAP32[$13_1 + 4 >> 2] = 0; if (!HEAP32[$2_1 + 44 >> 2]) { $661($9_1, $13_1) } if (!HEAP32[$2_1 + 40 >> 2]) { break block439 } HEAP32[$1_1 + 24 >> 2] = 0; break block441; } HEAP32[$1_1 + 24 >> 2] = 0; if (($5_1 | 0) == 101) { break block442 } if ($5_1) { break block6 } } $13_1 = 0; HEAP8[$1_1 + 2 | 0] = 0; $1_1 = (HEAPU16[$6_1 + 2 >> 1] << 2) + $46_1 | 0; HEAP32[$1_1 >> 2] = HEAP32[$1_1 >> 2] + 1; break block16; } HEAP32[$1_1 + 24 >> 2] = 0; } HEAP8[$1_1 + 2 | 0] = 1; $13_1 = 0; break block277; } HEAP32[$0_1 + 172 >> 2] = HEAP32[$0_1 + 172 >> 2] + 1; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; HEAP32[$8_1 + 356 >> 2] = 1; $17_1 = HEAP32[$1_1 + 36 >> 2]; $29_1 = $1_1; block446 : { block447 : { if (HEAPU8[$1_1 | 0] == 1) { if (!HEAPU8[$17_1 + 64 | 0]) { $1_1 = 1; if (!HEAP32[$17_1 + 40 >> 2]) { break block446 } HEAP32[$8_1 + 356 >> 2] = 0; $5_1 = $721($17_1 + 72 | 0, $17_1 + 40 | 0); break block447; } $5_1 = $717($17_1); if ($5_1) { break block6 } $25 = $17_1 + 72 | 0; $20_1 = 0; $5_1 = 0; $16_1 = 0; while (1) { block452 : { block46268 : { block461 : { block449 : { if (!$5_1) { if (HEAPU8[$17_1 + 67 | 0] <= $20_1 >>> 0) { break block449 } $18_1 = Math_imul($20_1, 80) + $25 | 0; $1_1 = HEAP32[$18_1 + 8 >> 2]; $2_1 = $1_1 >> 31; $11_1 = 16; $4_1 = 0; $12_1 = 0; while (1) { if (!(($2_1 | 0) <= ($4_1 | 0) & $1_1 >>> 0 <= $11_1 >>> 0 | ($2_1 | 0) < ($4_1 | 0))) { $12_1 = $12_1 + 1 | 0; $4_1 = $4_1 << 4 | $11_1 >>> 28; $11_1 = $11_1 << 4; continue; } break; }; HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = 0; if (($1_1 | 0) <= 16) { $5_1 = $722($18_1, $1_1, $8_1 + 368 | 0, $8_1 + 472 | 0); $14 = HEAP32[$8_1 + 472 >> 2]; break block452; } $4_1 = 0; $14 = $723(16); $5_1 = $14 ? 0 : 7; $11_1 = ($12_1 | 0) <= 1 ? 1 : $12_1; $10_1 = 0; while (1) { $1_1 = HEAP32[$18_1 + 8 >> 2]; if ($5_1 | ($1_1 | 0) <= ($4_1 | 0)) { break block452 } $1_1 = $1_1 - $4_1 | 0; $5_1 = $722($18_1, ($1_1 | 0) >= 16 ? 16 : $1_1, $8_1 + 368 | 0, $8_1 + 360 | 0); if (!$5_1) { $2_1 = 1; $5_1 = $724($18_1, HEAP32[$8_1 + 360 >> 2], $8_1 + 472 | 0); $7_1 = 1; $1_1 = 1; while (1) { if (($7_1 | 0) == ($11_1 | 0)) { $3 = $14; while (1) { if (!($5_1 | $2_1 >>> 0 >= $12_1 >>> 0)) { $5_1 = HEAP32[$3 + 12 >> 2] + Math_imul((($10_1 | 0) / ($1_1 | 0) | 0) % 16 | 0, 56) | 0; $7_1 = HEAP32[$5_1 + 48 >> 2]; block458 : { if (!$7_1) { $7_1 = $723(16); if (!$7_1) { $5_1 = 7; break block458; } $33_1 = $7_1; $7_1 = $5_1 + 48 | 0; $5_1 = $724($18_1, $33_1, $7_1); if ($5_1) { break block458 } $7_1 = HEAP32[$7_1 >> 2]; } $1_1 = ($1_1 | 0) / 16 | 0; $3 = HEAP32[$7_1 + 4 >> 2]; $5_1 = 0; } $2_1 = $2_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$8_1 + 472 >> 2]; block460 : { if (!$5_1) { HEAP32[(HEAP32[$3 + 12 >> 2] + Math_imul(($10_1 | 0) % 16 | 0, 56) | 0) + 48 >> 2] = $1_1; break block460; } $663($1_1); } $10_1 = $10_1 + 1 | 0; } else { $7_1 = $7_1 + 1 | 0; $1_1 = $1_1 << 4; continue; } break; }; } $4_1 = $4_1 + 16 | 0; continue; }; } $660($16_1); break block461; } $5_1 = $725($25, $16_1); HEAP32[$17_1 + 20 >> 2] = $16_1; if ($5_1) { break block461 } $5_1 = 0; break block46268; } $660(0); } HEAP32[$8_1 + 356 >> 2] = 0; break block447; } block464 : { if (!$5_1) { $16_1 = $14; break block464; } $660($14); } $20_1 = $20_1 + 1 | 0; continue; }; } $5_1 = $261($17_1, $8_1 + 356 | 0); HEAP32[$1_1 + 24 >> 2] = 0; HEAP8[$1_1 + 3 | 0] = 0; } if ($5_1) { break block6 } $1_1 = HEAP32[$8_1 + 356 >> 2]; } HEAP8[$29_1 + 2 | 0] = $1_1; $13_1 = 0; if (HEAP32[$6_1 + 8 >> 2] <= 0) { break block79 } if ($1_1) { break block160 } break block79; } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2]; $5_1 = $261($1_1, $8_1 + 368 | 0); if ($5_1) { break block6 } $11_1 = -1; $4_1 = -1; if (!HEAP32[$8_1 + 368 >> 2]) { $11_1 = $433($726($1_1), i64toi32_i32$HIGH_BITS); $4_1 = $11_1 >> 31; } $1_1 = HEAP32[$6_1 + 12 >> 2]; $2_1 = $1_1 >>> 0 > $11_1 >>> 0; $1_1 = $1_1 >> 31; if ($2_1 & ($1_1 | 0) >= ($4_1 | 0) | ($1_1 | 0) > ($4_1 | 0)) { break block296 } $1_1 = HEAP32[$6_1 + 16 >> 2]; $2_1 = $1_1 >> 31; if (($2_1 | 0) >= ($4_1 | 0) & $1_1 >>> 0 >= $11_1 >>> 0 | ($2_1 | 0) > ($4_1 | 0)) { break block466 } break block296; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $3 = HEAP32[$2_1 + 36 >> 2]; HEAP32[$8_1 + 368 >> 2] = 0; if (($1_1 | 0) == 137) { HEAP32[$2_1 + 28 >> 2] = -1; if (!HEAPU8[$3 | 0]) { break block79 } } $5_1 = $727($3, $8_1 + 368 | 0); $1_1 = HEAP32[$8_1 + 368 >> 2]; HEAP32[$2_1 + 24 >> 2] = 0; HEAP8[$2_1 + 3 | 0] = 0; HEAP8[$2_1 + 2 | 0] = $1_1; if ($5_1) { break block6 } $13_1 = 0; if (HEAP32[$6_1 + 8 >> 2] <= 0) { break block79 } if ($1_1) { break block466 } break block79; } $2_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + ($2_1 << 2) >> 2]; if (!$1_1) { $1_1 = $682($0_1, $2_1, 1, 3); if (!$1_1) { break block4 } HEAP8[$1_1 + 4 | 0] = 1; HEAP32[$1_1 + 28 >> 2] = 0; HEAP32[$1_1 + 36 >> 2] = 82720; HEAP8[$1_1 + 5 | 0] = HEAPU8[$1_1 + 5 | 0] | 8; } HEAP32[$1_1 + 24 >> 2] = 0; HEAP8[$1_1 + 2 | 0] = 1; if (HEAPU8[$1_1 | 0]) { break block79 } $641(HEAP32[$1_1 + 36 >> 2]); break block79; } $2_1 = $670($0_1, $6_1); $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (HEAPU8[$1_1 + 2 | 0]) { HEAP16[$2_1 + 16 >> 1] = 1; break block79; } block471 : { if (HEAPU8[$1_1 + 3 | 0]) { $11_1 = HEAP32[$1_1 + 56 >> 2]; $1_1 = HEAP32[$1_1 + 60 >> 2]; break block471; } if (HEAPU8[$1_1 | 0] == 2) { $5_1 = HEAP32[$1_1 + 36 >> 2]; $1_1 = HEAP32[$5_1 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 48 >> 2]]($5_1, $8_1 + 368 | 0) | 0; $653($0_1, $1_1); if ($5_1) { break block6 } $13_1 = 0; $11_1 = HEAP32[$8_1 + 368 >> 2]; $1_1 = HEAP32[$8_1 + 372 >> 2]; break block471; } $5_1 = $713($1_1); if ($5_1) { break block6 } if (HEAPU8[$1_1 + 2 | 0]) { HEAP16[$2_1 + 16 >> 1] = 1; break block296; } $13_1 = 0; $11_1 = $631(HEAP32[$1_1 + 36 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; } HEAP32[$2_1 >> 2] = $11_1; HEAP32[$2_1 + 4 >> 2] = $1_1; break block79; } $1_1 = $670($0_1, $6_1); $5_1 = HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2]; $2_1 = $262($5_1); if ($2_1 >>> 0 > HEAPU32[$9_1 + 120 >> 2]) { break block170 } $5_1 = $263($5_1, $2_1, $1_1); if ($5_1) { break block6 } $13_1 = 0; if (HEAP32[$6_1 + 12 >> 2] | !(HEAPU8[$1_1 + 17 | 0] & 64)) { break block79 } if (!$223($1_1)) { break block79 } break block4; } $1_1 = HEAP32[$6_1 + 8 >> 2]; $3 = $728(HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2], $8_1 + 368 | 0); $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $2_1 = HEAP32[$8_1 + 368 >> 2]; if ($237($1_1, $2_1)) { break block305 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 62016 | 16; if ($2_1) { wasm2js_memory_copy(HEAP32[$1_1 + 8 >> 2], $3, $2_1) } $13_1 = 0; HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 12 >> 2] << 2) >> 2] + 24 >> 2] = 0; break block79; } $4_1 = HEAP32[$6_1 + 12 >> 2]; $2_1 = HEAP32[$6_1 + 16 >> 2]; $3 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $1_1 = HEAP32[$3 + 40 >> 2]; $3 = HEAP32[$3 + 36 >> 2]; $7_1 = HEAP32[$3 + 32 >> 2]; if (!$7_1) { $7_1 = $729($1_1); HEAP32[$3 + 32 >> 2] = $7_1; if (!$7_1) { break block305 } HEAP16[$7_1 + 20 >> 1] = $2_1; } $4_1 = Math_imul($4_1, 40) + $15_1 | 0; $13_1 = $728($3, $8_1 + 368 | 0); $730($1_1, HEAP32[$8_1 + 368 >> 2], $13_1, $7_1); $1_1 = 0; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { if (($1_1 | 0) != ($2_1 | 0)) { $13_1 = Math_imul($1_1, 40); $1_1 = $1_1 + 1 | 0; if (!(HEAP8[($13_1 + HEAP32[$7_1 + 4 >> 2] | 0) + 16 | 0] & 1)) { continue } break block466; } break; }; $13_1 = 0; if ($731(HEAP32[$4_1 + 12 >> 2], HEAP32[$4_1 + 8 >> 2], $7_1)) { break block160 } break block79; } $1_1 = HEAP32[$0_1 + 44 >> 2]; $2_1 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$9_1 + 104 >> 2] = $2_1; HEAP32[$9_1 + 108 >> 2] = $1_1; $1_1 = HEAP32[$9_1 + 116 >> 2] + $1_1 | 0; $3 = HEAP32[$9_1 + 112 >> 2]; $2_1 = $2_1 + $3 | 0; HEAP32[$9_1 + 112 >> 2] = $2_1; HEAP32[$9_1 + 116 >> 2] = $2_1 >>> 0 < $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; break block79; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $4_1 = HEAP32[$6_1 + 8 >> 2]; $2_1 = 0; block478 : { if (HEAPU8[$6_1 + 1 | 0] != 251) { $3 = 0; break block478; } $3 = 0; if (!HEAP32[$9_1 + 248 >> 2]) { break block478 } $3 = HEAP32[HEAP32[$9_1 + 16 >> 2] + (HEAP8[$1_1 + 1 | 0] << 4) >> 2]; $2_1 = HEAP32[$6_1 + 16 >> 2]; if (!(HEAPU8[$6_1 + 2 | 0] & 2) | !HEAPU8[$1_1 + 4 | 0]) { break block478 } HEAP32[$1_1 + 56 >> 2] = $631(HEAP32[$1_1 + 36 >> 2]); HEAP32[$1_1 + 60 >> 2] = i64toi32_i32$HIGH_BITS; } $5_1 = $715(HEAP32[$1_1 + 36 >> 2], HEAPU8[$6_1 + 2 | 0]); HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 28 >> 2] = 0; if ($5_1) { break block6 } $34_1 = $34_1 + 1 | 0; $13_1 = 0; if (!($4_1 & 1)) { break block79 } $4_1 = HEAP32[$0_1 + 44 >> 2]; $7_1 = $4_1; $10_1 = $4_1 + 1 | 0; $4_1 = HEAP32[$0_1 + 40 >> 2] + 1 | 0; $7_1 = $4_1 ? $7_1 : $10_1; HEAP32[$0_1 + 40 >> 2] = $4_1; HEAP32[$0_1 + 44 >> 2] = $7_1; $4_1 = HEAP32[$9_1 + 248 >> 2]; if (HEAPU8[$2_1 + 28 | 0] & 128 | (!$4_1 | !$2_1)) { break block79 } FUNCTION_TABLE[$4_1 | 0](HEAP32[$9_1 + 244 >> 2], 9, $3, HEAP32[$2_1 >> 2], HEAP32[$1_1 + 56 >> 2], HEAP32[$1_1 + 60 >> 2]); break block79; } $1_1 = HEAP32[$0_1 + 96 >> 2]; $3 = HEAP32[$1_1 + (HEAP32[$6_1 + 8 >> 2] << 2) >> 2]; $1_1 = HEAP32[$1_1 + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$6_1 + 12 >> 2]; block480 : { if (!$2_1) { $11_1 = 0; $4_1 = 0; break block480; } $2_1 = Math_imul($2_1, 40) + $15_1 | 0; $11_1 = HEAP32[$2_1 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; } $2_1 = HEAP32[$1_1 + 36 >> 2]; $16_1 = HEAP32[$2_1 + 20 >> 2]; $1_1 = HEAP32[$16_1 + 84 >> 2]; $17_1 = HEAP32[$3 + 36 >> 2]; $633($17_1); $3 = HEAP32[$17_1 + 44 >> 2]; block482 : { if ($3 >>> 0 <= 127) { HEAP8[$1_1 | 0] = $3; $12_1 = $1_1 + 1 | 0; break block482; } $12_1 = $732($1_1, $3, 0) + $1_1 | 0; } if (!HEAP32[$2_1 + 112 >> 2]) { $12_1 = $732($12_1, $11_1, $4_1) + $12_1 | 0 } $1_1 = HEAPU16[$17_1 + 48 >> 1]; $3 = HEAP32[$17_1 + 40 >> 2]; $7_1 = $1_1 + $3 | 0; $11_1 = HEAP32[HEAP32[$17_1 + 116 >> 2] + 60 >> 2]; if ($7_1 >>> 0 > $11_1 >>> 0) { $5_1 = $181(80435); break block6; } $4_1 = HEAP32[$17_1 + 44 >> 2]; $10_1 = HEAP32[$2_1 + 116 >> 2]; $14 = HEAPU16[$10_1 + 14 >> 1]; if (!(($4_1 | 0) != ($1_1 | 0) | $14 >>> 0 <= $1_1 >>> 0)) { if ($1_1) { wasm2js_memory_copy($12_1, $3, $1_1) } HEAP32[$16_1 + 88 >> 2] = ($1_1 + $12_1 | 0) - HEAP32[$16_1 + 84 >> 2]; break block296; } HEAP32[$8_1 + 368 >> 2] = 0; $18_1 = HEAP32[HEAP32[$17_1 + 20 >> 2] >> 2]; HEAP32[$8_1 + 472 >> 2] = 0; $2_1 = $4_1; if ($2_1 >>> 0 > $14 >>> 0) { $5_1 = HEAPU16[$10_1 + 16 >> 1]; $2_1 = __wasm_i64_srem($2_1 - $5_1 | 0, 0 - ($2_1 >>> 0 < $5_1 >>> 0) | 0, HEAP32[HEAP32[$10_1 + 52 >> 2] + 40 >> 2] - 4 | 0, 0) + $5_1 | 0; $2_1 = ($2_1 | 0) > ($14 | 0) ? $5_1 : $2_1; } $5_1 = ($12_1 - HEAP32[$16_1 + 84 >> 2] | 0) + $2_1 | 0; $14 = $5_1 + 4 | 0; $10_1 = $5_1; $5_1 = $2_1 >>> 0 < $4_1 >>> 0; HEAP32[$16_1 + 88 >> 2] = $5_1 ? $14 : $10_1; $10_1 = 0; if ($1_1 >>> 0 < $4_1 >>> 0) { if ($7_1 + 4 >>> 0 > $11_1 >>> 0) { $5_1 = $181(80460); break block6; } $10_1 = $156($7_1); } $14 = $5_1 ? $2_1 + $12_1 | 0 : 0; $11_1 = 0; while (1) { $4_1 = $4_1 - $2_1 | 0; while (1) { if ($1_1) { $5_1 = $1_1 >>> 0 > $2_1 >>> 0 ? $2_1 : $1_1; if ($5_1) { wasm2js_memory_copy($12_1, $3, $5_1) } $3 = $3 + $5_1 | 0; $12_1 = $5_1 + $12_1 | 0; $2_1 = $2_1 - $5_1 | 0; $1_1 = $1_1 - $5_1 | 0; } else { $1_1 = 0 } block494 : { if (!$2_1) { $5_1 = HEAP32[$8_1 + 368 >> 2]; $7_1 = !$5_1; break block494; } $99(HEAP32[$8_1 + 472 >> 2]); $7_1 = 0; HEAP32[$8_1 + 472 >> 2] = 0; $5_1 = FUNCTION_TABLE[HEAP32[$18_1 + 220 >> 2]]($18_1, $10_1, $8_1 + 472 | 0, 2) | 0; HEAP32[$8_1 + 368 >> 2] = $5_1; if ($5_1) { break block494 } $1_1 = HEAP32[HEAP32[$8_1 + 472 >> 2] + 4 >> 2]; $3 = $1_1 + 4 | 0; $10_1 = $156($1_1); $1_1 = HEAP32[HEAP32[$17_1 + 20 >> 2] + 40 >> 2] - 4 | 0; continue; } break; }; if (!(!$14 | (!$7_1 | !$4_1))) { HEAP32[$8_1 + 356 >> 2] = 0; HEAP32[$8_1 + 368 >> 2] = $624($16_1, $8_1 + 356 | 0, $8_1 + 360 | 0, 0, 0); $5_1 = HEAP32[$8_1 + 360 >> 2]; $5_1 = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); HEAP8[$14 | 0] = $5_1; HEAP8[$14 + 1 | 0] = $5_1 >>> 8; HEAP8[$14 + 2 | 0] = $5_1 >>> 16; HEAP8[$14 + 3 | 0] = $5_1 >>> 24; if (!(!HEAPU8[$16_1 + 17 | 0] | !$11_1)) { $639($16_1, HEAP32[$8_1 + 360 >> 2], 4, HEAP32[$11_1 + 4 >> 2], $8_1 + 368 | 0) } $625($11_1); $11_1 = HEAP32[$8_1 + 356 >> 2]; if ($11_1) { $14 = HEAP32[$11_1 + 56 >> 2]; HEAP8[$14 | 0] = 0; HEAP8[$14 + 1 | 0] = 0; HEAP8[$14 + 2 | 0] = 0; HEAP8[$14 + 3 | 0] = 0; $12_1 = $14 + 4 | 0; $2_1 = HEAP32[$16_1 + 40 >> 2] - 4 | 0; $2_1 = $2_1 >>> 0 < $4_1 >>> 0 ? $2_1 : $4_1; } $5_1 = HEAP32[$8_1 + 368 >> 2]; } if (!(!$4_1 | $5_1)) { continue } break; }; $625($11_1); $99(HEAP32[$8_1 + 472 >> 2]); break block202; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$6_1 + 8 >> 2]; $5_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $4_1 = HEAP32[$5_1 >> 2]; $5_1 = HEAP32[$5_1 + 4 >> 2]; $7_1 = $5_1; HEAP32[$8_1 + 376 >> 2] = $4_1; HEAP32[$8_1 + 380 >> 2] = $7_1; $2_1 = Math_imul($2_1, 40); $3 = 0; $10_1 = 0; block500 : { if (HEAPU8[$6_1 + 1 | 0] != 251) { break block500 } $10_1 = 0; if (!HEAP32[$9_1 + 248 >> 2]) { break block500 } $3 = HEAP32[$6_1 + 16 >> 2]; $10_1 = HEAP32[HEAP32[$9_1 + 16 >> 2] + (HEAP8[$1_1 + 1 | 0] << 4) >> 2]; } $2_1 = $2_1 + $15_1 | 0; $5_1 = HEAPU16[$6_1 + 2 >> 1]; block501 : { if (!($5_1 & 1)) { break block501 } $14 = HEAP32[$0_1 + 44 >> 2]; $12_1 = $14; $11_1 = $14 + 1 | 0; $14 = HEAP32[$0_1 + 40 >> 2] + 1 | 0; $12_1 = $14 ? $12_1 : $11_1; HEAP32[$0_1 + 40 >> 2] = $14; HEAP32[$0_1 + 44 >> 2] = $12_1; if (!($5_1 & 32)) { break block501 } HEAP32[$9_1 + 40 >> 2] = $4_1; HEAP32[$9_1 + 44 >> 2] = $7_1; } HEAP32[$8_1 + 384 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP32[$8_1 + 396 >> 2] = HEAP32[$2_1 + 12 >> 2]; $14 = $5_1 & 16 ? HEAP32[$1_1 + 28 >> 2] : 0; $2_1 = HEAPU8[$2_1 + 17 | 0] & 4 ? HEAP32[$2_1 >> 2] : 0; HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 400 >> 2] = $2_1; $5_1 = $718(HEAP32[$1_1 + 36 >> 2], $8_1 + 368 | 0, $5_1 & 138, $14); HEAP32[$1_1 + 24 >> 2] = 0; HEAP8[$1_1 + 3 | 0] = 0; if ($5_1) { break block6 } if ($3) { FUNCTION_TABLE[HEAP32[$9_1 + 248 >> 2]](HEAP32[$9_1 + 244 >> 2], HEAPU16[$6_1 + 2 >> 1] & 4 ? 23 : 18, $10_1, HEAP32[$3 >> 2], $4_1, $7_1) } $34_1 = $34_1 + 1 | 0; break block296; } HEAP32[$8_1 + 368 >> 2] = 0; HEAP32[$8_1 + 372 >> 2] = 0; HEAP32[$8_1 + 472 >> 2] = 0; $7_1 = $670($0_1, $6_1); $3 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (!(HEAPU8[$3 + 5 | 0] & 2)) { $5_1 = $727(HEAP32[$3 + 36 >> 2], $8_1 + 472 | 0); if ($5_1) { break block6 } block507 : { if (HEAP32[$8_1 + 472 >> 2]) { HEAP32[$8_1 + 368 >> 2] = 1; HEAP32[$8_1 + 372 >> 2] = 0; break block507; } $2_1 = $631(HEAP32[$3 + 36 >> 2]); HEAP32[$8_1 + 368 >> 2] = $2_1; $1_1 = i64toi32_i32$HIGH_BITS; HEAP32[$8_1 + 372 >> 2] = $1_1; if (!(($2_1 | 0) != -1 | ($1_1 | 0) != 2147483647)) { HEAP8[$3 + 5 | 0] = HEAPU8[$3 + 5 | 0] | 2; break block507; } $4_1 = $1_1; $13_1 = $1_1 + 1 | 0; $1_1 = $2_1 + 1 | 0; $2_1 = $1_1 ? $4_1 : $13_1; HEAP32[$8_1 + 368 >> 2] = $1_1; HEAP32[$8_1 + 372 >> 2] = $2_1; } $13_1 = 0; } $4_1 = HEAP32[$6_1 + 12 >> 2]; if ($4_1) { $1_1 = HEAP32[$35_1 >> 2]; if ($1_1) { while (1) { $2_1 = $1_1; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($1_1) { continue } break; }; $1_1 = HEAP32[$2_1 + 12 >> 2]; } else { $1_1 = $15_1 } $2_1 = $1_1 + Math_imul($4_1, 40) | 0; $673($2_1); $5_1 = 13; $14 = HEAP32[$2_1 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; if (($14 | 0) == -1 & ($4_1 | 0) == 2147483647 | HEAPU8[$3 + 5 | 0] & 2) { break block6 } $1_1 = HEAP32[$8_1 + 368 >> 2]; $10_1 = HEAP32[$8_1 + 372 >> 2]; if (!($14 >>> 0 < $1_1 >>> 0 & ($4_1 | 0) <= ($10_1 | 0) | ($4_1 | 0) < ($10_1 | 0))) { $1_1 = $14 + 1 | 0; $4_1 = $1_1 ? $4_1 : $4_1 + 1 | 0; $10_1 = $4_1; HEAP32[$8_1 + 368 >> 2] = $1_1; HEAP32[$8_1 + 372 >> 2] = $4_1; } HEAP32[$2_1 >> 2] = $1_1; HEAP32[$2_1 + 4 >> 2] = $10_1; } block514 : { if (HEAPU8[$3 + 5 | 0] & 2) { $1_1 = 0; while (1) { block513 : { $65(8, $8_1 + 368 | 0); $2_1 = HEAP32[$8_1 + 372 >> 2] & 1073741823; $4_1 = $2_1; $10_1 = $2_1 + 1 | 0; $2_1 = HEAP32[$8_1 + 368 >> 2] + 1 | 0; $4_1 = $2_1 ? $4_1 : $10_1; HEAP32[$8_1 + 368 >> 2] = $2_1; HEAP32[$8_1 + 372 >> 2] = $4_1; $2_1 = $733(HEAP32[$3 + 36 >> 2], $2_1, $4_1, 0, $8_1 + 472 | 0); $4_1 = HEAP32[$8_1 + 472 >> 2]; if ($2_1 | $4_1) { break block513 } $10_1 = $1_1 >>> 0 < 99; $1_1 = $1_1 + 1 | 0; if ($10_1) { continue } } break; }; if ($2_1) { break block514 } $13_1 = 0; if (!$4_1) { break block514 } } HEAP32[$3 + 24 >> 2] = 0; HEAP8[$3 + 3 | 0] = 0; $1_1 = HEAP32[$8_1 + 372 >> 2]; HEAP32[$7_1 >> 2] = HEAP32[$8_1 + 368 >> 2]; HEAP32[$7_1 + 4 >> 2] = $1_1; break block79; } $5_1 = $2_1 ? $2_1 : 13; break block6; } $2_1 = $670($0_1, $6_1); $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $3 = HEAP32[$1_1 + 20 >> 2]; $4_1 = HEAP32[$1_1 + 16 >> 2]; $7_1 = $4_1 + 1 | 0; $10_1 = $7_1 ? $3 : $3 + 1 | 0; HEAP32[$1_1 + 16 >> 2] = $7_1; HEAP32[$1_1 + 20 >> 2] = $10_1; HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = $3; break block79; } $1_1 = HEAP32[$6_1 + 12 >> 2]; break block515; } $1_1 = HEAP32[$6_1 + 12 >> 2]; $2_1 = Math_imul($1_1, 40) + $15_1 | 0; if (HEAPU8[$2_1 + 16 | 0] & 36) { break block515 } $1_1 = $8_1 + 368 | 0; wasm2js_memory_copy($1_1, $2_1, 40); $674($1_1, 67, $21_1); if (!(HEAPU16[$8_1 + 384 >> 1] & 4)) { break block160 } $11_1 = HEAP32[$8_1 + 368 >> 2]; $2_1 = HEAP32[$8_1 + 372 >> 2]; break block517; } $1_1 = Math_imul($1_1, 40) + $15_1 | 0; $11_1 = HEAP32[$1_1 >> 2]; $2_1 = HEAP32[$1_1 + 4 >> 2]; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $5_1 = HEAP32[$1_1 + 36 >> 2]; $13_1 = 0; HEAP32[$8_1 + 352 >> 2] = 0; $5_1 = $733($5_1, $11_1, $2_1, 0, $8_1 + 352 | 0); HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 56 >> 2] = $11_1; HEAP32[$1_1 + 60 >> 2] = $2_1; HEAP16[$1_1 + 2 >> 1] = 0; $2_1 = $1_1; $1_1 = HEAP32[$8_1 + 352 >> 2]; HEAP32[$2_1 + 28 >> 2] = $1_1; if ($1_1) { if (HEAP32[$6_1 + 8 >> 2]) { $13_1 = $5_1; break block160; } $5_1 = $181(99019); break block6; } if (!$5_1) { break block79 } break block6; } if (HEAP32[$6_1 + 16 >> 2] <= HEAPU16[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 6 >> 1]) { break block79 } } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; HEAP32[$8_1 + 372 >> 2] = $2_1; $5_1 = HEAP32[$6_1 + 16 >> 2]; HEAP16[$8_1 + 388 >> 1] = $5_1; block521 : { if ($5_1 & 65535) { $2_1 = HEAP32[$1_1 + 40 >> 2]; HEAP8[$8_1 + 390 | 0] = 0; HEAP32[$8_1 + 368 >> 2] = $2_1; $5_1 = $714(HEAP32[$1_1 + 36 >> 2], $8_1 + 368 | 0, $1_1 + 28 | 0); break block521; } if (HEAPU8[$2_1 + 17 | 0] & 4) { if ($207($2_1)) { break block4 } } $2_1 = $729(HEAP32[$1_1 + 40 >> 2]); if (!$2_1) { break block4 } $5_1 = HEAP32[$8_1 + 372 >> 2]; $730(HEAP32[$1_1 + 40 >> 2], HEAP32[$5_1 + 12 >> 2], HEAP32[$5_1 + 8 >> 2], $2_1); HEAP8[$2_1 + 22 | 0] = 0; $5_1 = $714(HEAP32[$1_1 + 36 >> 2], $2_1, $1_1 + 28 | 0); $13($9_1, $2_1); } if ($5_1) { break block6 } HEAP32[$1_1 + 24 >> 2] = 0; HEAP8[$1_1 + 3 | 0] = 0; $2_1 = HEAP32[$1_1 + 28 >> 2]; HEAP8[$1_1 + 2 | 0] = ($2_1 | 0) != 0; $13_1 = HEAPU8[$6_1 | 0]; if (($13_1 | 0) == 29) { if (!$2_1) { break block466 } break block296; } if ($2_1) { break block466 } block524 : { switch ($13_1 - 26 | 0) { case 1: $1_1 = 0; $2_1 = HEAP32[$8_1 + 372 >> 2]; $13_1 = HEAPU16[$8_1 + 388 >> 1]; while (1) { if (($1_1 | 0) == ($13_1 | 0)) { break block296 } $3 = Math_imul($1_1, 40); $1_1 = $1_1 + 1 | 0; if (!(HEAP8[($2_1 + $3 | 0) + 16 | 0] & 1)) { continue } break; }; break block466; case 0: break block524; default: break block296; }; } HEAP16[$1_1 + 6 >> 1] = HEAP32[$6_1 + 16 >> 2]; break block296; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (!$1_1 | HEAPU8[$1_1 + 2 | 0]) { break block16 } break block79; } $2_1 = HEAP32[$6_1 + 8 >> 2]; $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $3 = HEAPU16[$1_1 + 6 >> 1]; if (($2_1 | 0) > ($3 | 0)) { HEAP16[$1_1 + 6 >> 1] = $2_1; break block79; } $2_1 = HEAP32[$6_1 + 12 >> 2]; if (($2_1 | 0) >= ($3 | 0)) { break block79 } HEAP16[$1_1 + 6 >> 1] = $2_1; break block79; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 24 >> 2] << 2) >> 2]; if (HEAPU8[HEAP32[$1_1 + 36 >> 2]]) { break block79 } $3 = $6_1 + 20 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$8_1 + 472 >> 2] = HEAP32[$1_1 + 40 >> 2]; $2_1 = HEAP32[$6_1 + 36 >> 2]; HEAP8[$8_1 + 494 | 0] = 0; HEAP16[$8_1 + 492 >> 1] = $2_1; HEAP32[$8_1 + 476 >> 2] = Math_imul(HEAP32[$6_1 + 32 >> 2], 40) + $15_1; block529 : { while (1) { $2_1 = HEAP32[$1_1 + 36 >> 2]; $5_1 = $262($2_1); if (($5_1 | 0) <= 0) { $5_1 = $181(90370); break block6; } HEAP32[$8_1 + 392 >> 2] = 0; HEAP32[$8_1 + 388 >> 2] = $9_1; HEAP16[$8_1 + 384 >> 1] = 0; $4_1 = $8_1 + 368 | 0; $5_1 = $263($2_1, $5_1, $4_1); if ($5_1) { break block6 } $2_1 = $711(HEAP32[$8_1 + 380 >> 2], HEAP32[$8_1 + 376 >> 2], $8_1 + 472 | 0, 0); $712($4_1); if (($2_1 | 0) > 0) { $3 = HEAPU16[$6_1 + 2 >> 1] ? $6_1 : $3; break block529; } if (($2_1 | 0) >= 0) { $3 = $6_1; break block529; } if (($7_1 | 0) <= 0) { break block272 } HEAP32[$1_1 + 24 >> 2] = 0; $7_1 = $7_1 - 1 | 0; $5_1 = $260(HEAP32[$1_1 + 36 >> 2]); if (!$5_1) { continue } break; }; if (($5_1 | 0) != 101) { break block6 } } $13_1 = 0; $6_1 = $3; break block160; } $13_1 = 0; break block79; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; HEAP32[$2_1 + 24 >> 2] = 0; HEAP16[$2_1 + 2 >> 1] = 0; block535 : { block537 : { if (HEAPU8[$2_1 + 4 | 0]) { $3 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; $14 = HEAPU16[$3 + 16 >> 1]; if (($14 & 46) == 2) { $302($3, 0) } $4_1 = $50($3); $7_1 = i64toi32_i32$HIGH_BITS; $10_1 = HEAPU16[$3 + 16 >> 1]; HEAP16[$3 + 16 >> 1] = $14; block533 : { if ($10_1 & 36) { break block533 } if (!($10_1 & 8)) { if ($10_1 & 1 | $1_1 >>> 0 > 22) { break block160 } $10_1 = 0; $5_1 = $727(HEAP32[$2_1 + 36 >> 2], $8_1 + 472 | 0); if ($5_1) { break block6 } break block535; } $5_1 = $734($4_1, $7_1, HEAPF64[$3 >> 3]); if (($5_1 | 0) > 0) { $1_1 = (($1_1 & 1) + $1_1 | 0) - 1 | 0; break block533; } $1_1 = (($5_1 | 0) != 0 & $1_1) + $1_1 | 0; } $3 = 0; $5_1 = $733(HEAP32[$2_1 + 36 >> 2], $4_1, $7_1, 0, $8_1 + 472 | 0); HEAP32[$2_1 + 56 >> 2] = $4_1; HEAP32[$2_1 + 60 >> 2] = $7_1; if (!$5_1) { break block537 } break block6; } $10_1 = 1; $5_1 = HEAP32[$2_1 + 36 >> 2]; $3 = HEAPU8[$5_1 + 3 | 0]; $4_1 = HEAP32[$2_1 + 40 >> 2]; $7_1 = HEAP32[$6_1 + 16 >> 2]; HEAP8[$8_1 + 390 | 0] = $1_1 & 1 ? 1 : -1; HEAP16[$8_1 + 388 >> 1] = $7_1; HEAP32[$8_1 + 368 >> 2] = $4_1; $4_1 = HEAP32[$6_1 + 12 >> 2]; HEAP8[$8_1 + 394 | 0] = 0; HEAP32[$8_1 + 372 >> 2] = Math_imul($4_1, 40) + $15_1; $5_1 = $714($5_1, $8_1 + 368 | 0, $8_1 + 472 | 0); if ($5_1) { break block6 } $4_1 = $3 & 2; $3 = $4_1 >>> 1 | 0; if (!$4_1) { break block537 } if (!HEAPU8[$8_1 + 394 | 0]) { break block535 } } $4_1 = HEAP32[$8_1 + 472 >> 2]; if ($1_1 >>> 0 >= 23) { if ($4_1 | ($1_1 | 0) != 24 ? ($4_1 | 0) >= 0 : 0) { break block540 } $5_1 = $260(HEAP32[$2_1 + 36 >> 2]); if (!$5_1) { break block540 } if (($5_1 | 0) == 101) { break block466 } break block6; } if (!($4_1 | ($1_1 | 0) != 21 ? ($4_1 | 0) <= 0 : 0)) { $5_1 = $719(HEAP32[$2_1 + 36 >> 2]); if (!$5_1) { break block540 } if (($5_1 | 0) != 101) { break block6 } break block466; } if (HEAPU8[HEAP32[$2_1 + 36 >> 2]]) { break block466 } break block540; } $3 = $10_1; if (!HEAP32[$8_1 + 472 >> 2]) { break block540 } } $13_1 = 0; break block160; } $13_1 = 0; $6_1 = ($3 ? 20 : 0) + $6_1 | 0; break block79; } $1_1 = HEAP32[$0_1 + 96 >> 2]; $2_1 = HEAP32[$6_1 + 4 >> 2]; $3 = HEAP32[$1_1 + ($2_1 << 2) >> 2]; if ($3) { $649($0_1, $3); $2_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 96 >> 2]; } HEAP32[$1_1 + ($2_1 << 2) >> 2] = 0; break block79; } $1_1 = $682($0_1, HEAP32[$6_1 + 4 >> 2], HEAP32[$6_1 + 12 >> 2], 3); if (!$1_1) { break block4 } HEAP8[$1_1 + 2 | 0] = 1; $2_1 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$1_1 + 36 >> 2] = 82720; HEAP8[$1_1 + 4 | 0] = 1; HEAP32[$1_1 + 28 >> 2] = $2_1; break block79; } $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; $2_1 = HEAP32[$1_1 + 20 >> 2]; $3 = HEAP32[$1_1 + 16 >> 2]; $4_1 = $3 + 1 | 0; $7_1 = $4_1 ? $2_1 : $2_1 + 1 | 0; HEAP32[$1_1 + 16 >> 2] = $4_1; HEAP32[$1_1 + 20 >> 2] = $7_1; if (!($2_1 | $3)) { break block160 } break block79; } $2_1 = $682($0_1, HEAP32[$6_1 + 4 >> 2], HEAP32[$6_1 + 8 >> 2], 1); if (!$2_1) { break block4 } $1_1 = HEAP32[$6_1 + 16 >> 2]; HEAP32[$2_1 + 40 >> 2] = $1_1; $3 = HEAP32[$6_1 + 12 >> 2]; $5_1 = HEAPU16[$1_1 + 6 >> 1] << 2; $1_1 = $270($9_1, $5_1 + 172 | 0, 0); HEAP32[$2_1 + 36 >> 2] = $1_1; if (!$1_1) { break block305 } $4_1 = HEAP32[HEAP32[$9_1 + 16 >> 2] + 4 >> 2]; $7_1 = $1_1 + 152 | 0; HEAP32[$1_1 + 28 >> 2] = $7_1; $5_1 = $5_1 + 20 | 0; if ($5_1) { wasm2js_memory_copy($7_1, HEAP32[$2_1 + 40 >> 2], $5_1) } $5_1 = 0; HEAP32[$1_1 + 164 >> 2] = 0; if ($3) { HEAP16[$1_1 + 158 >> 1] = $3 } $2_1 = HEAP32[$4_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$4_1 >> 2]; $2_1 = HEAP32[$2_1 + 36 >> 2]; HEAP8[$1_1 + 67 | 0] = 1; HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP8[$1_1 + 65 | 0] = 0; HEAP8[$1_1 + 66 | 0] = 255; HEAP32[$1_1 + 84 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $9_1; block546 : { if (HEAPU8[$9_1 + 86 | 0] == 2) { break block546 } $3 = Math_imul($2_1, HEAP32[18937]); HEAP32[$1_1 >> 2] = $3; $4_1 = HEAP32[HEAP32[HEAP32[$9_1 + 16 >> 2] + 12 >> 2] + 80 >> 2]; $7_1 = $4_1 >> 31; $10_1 = ($7_1 | 0) < 0; $14 = $2_1 >> 31; $4_1 = __wasm_i64_mul($10_1 ? -1024 : $2_1, $10_1 ? -1 : $14, $4_1, $7_1); $7_1 = i64toi32_i32$HIGH_BITS; if (($7_1 | 0) < 0) { $7_1 = 1 } else { $7_1 = $4_1 >>> 0 < 536870912 & ($7_1 | 0) <= 0 } $4_1 = $7_1 ? $4_1 : 536870912; HEAP32[$1_1 + 4 >> 2] = ($3 | 0) > ($4_1 | 0) ? $3 : $4_1; if (HEAPU8[75552]) { break block546 } HEAP32[$1_1 + 60 >> 2] = $2_1; $2_1 = $30($2_1, $14); HEAP32[$1_1 + 44 >> 2] = $2_1; $5_1 = $2_1 ? 0 : 7; } if (HEAPU16[$1_1 + 160 >> 1] > 12) { break block202 } $2_1 = HEAP32[$1_1 + 172 >> 2]; if (!!$2_1 & ($2_1 | 0) != HEAP32[$9_1 + 8 >> 2] | HEAPU8[HEAP32[$1_1 + 168 >> 2]] & 2) { break block202 } HEAP8[$1_1 + 68 | 0] = 3; break block202; } $1_1 = HEAP32[$6_1 + 12 >> 2]; if (($1_1 | 0) > 0) { $1_1 = Math_imul($1_1, 40) + $15_1 | 0; HEAP32[$1_1 + 8 >> 2] = 30822; HEAP32[$1_1 + 12 >> 2] = 0; } $2_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + ($2_1 << 2) >> 2]; block554 : { if (!(!(!$1_1 | HEAPU8[$1_1 + 5 | 0] & 8) & HEAP32[$6_1 + 8 >> 2] <= HEAP16[$1_1 + 52 >> 1])) { $1_1 = $682($0_1, $2_1, HEAP32[$6_1 + 8 >> 2], 0); if (!$1_1) { break block4 } HEAP8[$1_1 + 5 | 0] = HEAPU8[$1_1 + 5 | 0] | 1; $2_1 = $1_1 + 8 | 0; $5_1 = $410(HEAP32[$9_1 >> 2], 0, $9_1, $2_1, HEAPU16[$6_1 + 2 >> 1] | 5, 1054); if ($5_1) { break block6 } $5_1 = $143(HEAP32[$2_1 >> 2], 1, 0); if (!$5_1) { $4_1 = HEAP32[$6_1 + 16 >> 2]; HEAP32[$1_1 + 40 >> 2] = $4_1; block553 : { if ($4_1) { $3 = 0; $5_1 = $707(HEAP32[$1_1 + 8 >> 2], $1_1 + 48 | 0, HEAPU16[$6_1 + 2 >> 1] | 2); if ($5_1) { break block553 } $5_1 = $735(HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 48 >> 2], 4, $4_1, HEAP32[$1_1 + 36 >> 2]); break block553; } $3 = 1; HEAP32[$1_1 + 48 >> 2] = 1; $5_1 = $735(HEAP32[$1_1 + 8 >> 2], 1, 4, 0, HEAP32[$1_1 + 36 >> 2]); } HEAP8[$1_1 + 4 | 0] = $3; } HEAP8[$1_1 + 5 | 0] = HEAPU8[$1_1 + 5 | 0] & 251 | (HEAPU16[$6_1 + 2 >> 1] != 8 ? 4 : 0); if (!$5_1) { break block554 } $195(HEAP32[$2_1 >> 2]); HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] = 0; break block6; } HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = 0; $5_1 = $708(HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 48 >> 2], 0); if ($5_1) { break block6 } } HEAP8[$1_1 + 2 | 0] = 1; break block296; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 8 >> 2] << 2) >> 2]; $1_1 = $682($0_1, HEAP32[$6_1 + 4 >> 2], HEAP16[$2_1 + 52 >> 1], 0); if (!$1_1) { break block4 } HEAP8[$1_1 + 2 | 0] = 1; $13_1 = HEAPU8[$1_1 + 5 | 0] | 1; HEAP8[$1_1 + 5 | 0] = $13_1; HEAP32[$1_1 + 40 >> 2] = HEAP32[$2_1 + 40 >> 2]; HEAP8[$1_1 + 4 | 0] = HEAPU8[$2_1 + 4 | 0]; HEAP32[$1_1 + 48 >> 2] = HEAP32[$2_1 + 48 >> 2]; $13_1 = HEAPU8[$2_1 + 5 | 0] & 4 | $13_1 & -5; HEAP8[$1_1 + 5 | 0] = $13_1; $3 = HEAP32[$2_1 + 8 >> 2]; HEAP8[$1_1 + 5 | 0] = $13_1 | 8; HEAP32[$1_1 + 8 >> 2] = $3; HEAP8[$2_1 + 5 | 0] = HEAPU8[$2_1 + 5 | 0] | 8; $13_1 = $735(HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 48 >> 2], 4, HEAP32[$1_1 + 40 >> 2], HEAP32[$1_1 + 36 >> 2]); break block79; } $2_1 = HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2]; if (!$2_1 | HEAP32[$2_1 + 48 >> 2] != HEAP32[$6_1 + 8 >> 2]) { break block91 } $641(HEAP32[$2_1 + 36 >> 2]); break block555; } if ((HEAPU16[$0_1 + 152 >> 1] & 3) == 1) { $5_1 = 516; break block6; } $4_1 = HEAP32[$6_1 + 12 >> 2]; $2_1 = HEAP32[$9_1 + 16 >> 2] + ($4_1 << 4) | 0; $10_1 = HEAP32[$2_1 + 4 >> 2]; $3 = HEAP32[$6_1 + 8 >> 2]; $7_1 = 0; block558 : { if (($1_1 | 0) != 113) { $12_1 = 0; break block558; } $1_1 = HEAPU16[$6_1 + 2 >> 1]; $14 = $1_1 & 8; $2_1 = HEAPU8[HEAP32[$2_1 + 12 >> 2] + 76 | 0]; if ($2_1 >>> 0 < HEAPU8[$0_1 + 149 | 0]) { HEAP8[$0_1 + 149 | 0] = $2_1 } $12_1 = $14 | 4; if (!($1_1 & 16)) { break block558 } $1_1 = Math_imul($3, 40) + $15_1 | 0; $673($1_1); $3 = HEAP32[$1_1 >> 2]; } $11_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = HEAPU8[$6_1 + 1 | 0]; block561 : { if (($1_1 | 0) != 253) { $2_1 = 0; if (($1_1 | 0) != 248) { break block561 } $7_1 = HEAP32[$6_1 + 16 >> 2]; $2_1 = HEAPU16[$7_1 + 8 >> 1]; break block561; } $2_1 = HEAP32[$6_1 + 16 >> 2]; } $2_1 = $682($0_1, $11_1, $2_1, 0); if (!$2_1) { break block4 } HEAP8[$2_1 + 2 | 0] = 1; HEAP8[$2_1 + 1 | 0] = $4_1; HEAP32[$2_1 + 48 >> 2] = $3; HEAP8[$2_1 + 5 | 0] = HEAPU8[$2_1 + 5 | 0] | 4; $13_1 = $735($10_1, $3, $12_1, $7_1, HEAP32[$2_1 + 36 >> 2]); HEAP32[$2_1 + 40 >> 2] = $7_1; HEAP8[$2_1 + 4 | 0] = HEAPU8[$6_1 + 1 | 0] != 248; } HEAP8[HEAP32[$2_1 + 36 >> 2] + 3 | 0] = HEAPU8[$6_1 + 2 | 0] & 3; if ($13_1) { break block386 } break block296; } $1_1 = HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0; $5_1 = $147(HEAP32[$1_1 + 4 >> 2], HEAP32[$6_1 + 8 >> 2], HEAP32[$6_1 + 12 >> 2]); block564 : { block563 : { switch (HEAP32[$6_1 + 8 >> 2] - 1 | 0) { case 0: HEAP32[HEAP32[$1_1 + 12 >> 2] >> 2] = HEAP32[$6_1 + 12 >> 2] - HEAPU16[$6_1 + 2 >> 1]; HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; $2_1 = HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 12 >> 2] + 16 | 0; label42 : while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block564 } $1_1 = HEAP32[$2_1 + 8 >> 2]; if (HEAPU8[$1_1 + 43 | 0]) { continue } $1_1 = $1_1 + 48 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { continue label42 } $736($9_1, HEAP32[$1_1 + 28 >> 2]); HEAP32[$1_1 + 28 >> 2] = 0; $736($9_1, HEAP32[$1_1 + 32 >> 2]); HEAP32[$1_1 + 32 >> 2] = 0; $1_1 = $1_1 + 4 | 0; continue; }; }; case 1: break block563; default: break block564; }; } HEAP8[HEAP32[$1_1 + 12 >> 2] + 76 | 0] = HEAP32[$6_1 + 12 >> 2]; } if (HEAP32[$6_1 + 4 >> 2] != 1) { break block202 } $342($9_1, 0); HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532; } if (!$5_1) { break block296 } break block6; } $709(HEAP32[(HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0) + 4 >> 2], HEAP32[$6_1 + 12 >> 2], $8_1 + 368 | 0); $1_1 = $670($0_1, $6_1); $2_1 = HEAP32[$8_1 + 368 >> 2]; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $2_1 >> 31; break block79; } HEAP32[$8_1 + 368 >> 2] = 0; block565 : { $2_1 = HEAP32[$6_1 + 8 >> 2]; if (!$2_1) { break block565 } $1_1 = HEAP32[$9_1 + 32 >> 2] & 1048576; if (!($1_1 | HEAP32[$9_1 + 36 >> 2] & 2)) { break block565 } $13_1 = $1_1 ? 8 : 11; break block386; } $3 = HEAP32[$9_1 + 16 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 4) | 0; $1_1 = HEAP32[$3 + 4 >> 2]; block568 : { if ($1_1) { $13_1 = $143($1_1, $2_1, $8_1 + 368 | 0); if ($13_1) { if (($13_1 & 255) != 5) { break block386 } HEAP32[$0_1 + 36 >> 2] = $13_1; HEAP32[$0_1 + 32 >> 2] = ($6_1 - $19_1 | 0) / 20; break block168; } if (!!HEAPU8[$9_1 + 85 | 0] & HEAP32[$9_1 + 188 >> 2] < 2 | (!(HEAPU8[$0_1 + 152 | 0] & 32) | !HEAP32[$6_1 + 8 >> 2])) { break block568 } $2_1 = HEAP32[$0_1 + 48 >> 2]; if (!$2_1) { $2_1 = HEAP32[$9_1 + 508 >> 2] + 1 | 0; HEAP32[$9_1 + 508 >> 2] = $2_1; $2_1 = $2_1 + HEAP32[$9_1 + 504 >> 2] | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; } $13_1 = $666($9_1, 0, $2_1 - 1 | 0); if (!$13_1) { $2_1 = HEAP32[$0_1 + 48 >> 2]; $13_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$13_1 + 4 >> 2] = HEAP32[$1_1 >> 2]; $13_1 = $157(HEAP32[$13_1 >> 2], $2_1); } $1_1 = HEAP32[$9_1 + 516 >> 2]; HEAP32[$0_1 + 72 >> 2] = HEAP32[$9_1 + 512 >> 2]; HEAP32[$0_1 + 76 >> 2] = $1_1; $1_1 = HEAP32[$9_1 + 524 >> 2]; HEAP32[$0_1 + 80 >> 2] = HEAP32[$9_1 + 520 >> 2]; HEAP32[$0_1 + 84 >> 2] = $1_1; } if ($13_1) { break block386 } } if (!HEAPU16[$6_1 + 2 >> 1] | HEAP32[$8_1 + 368 >> 2] == HEAP32[$6_1 + 12 >> 2] & HEAP32[HEAP32[$3 + 12 >> 2] + 4 >> 2] == HEAP32[$6_1 + 16 >> 2]) { break block296 } $10($9_1, HEAP32[$27 >> 2]); HEAP32[$27 >> 2] = $116($9_1, 16514); $1_1 = HEAP32[$6_1 + 4 >> 2]; if (HEAP32[HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2] >> 2] != HEAP32[$8_1 + 368 >> 2]) { $351($9_1, $1_1) } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65516 | 1; $13_1 = 17; break block386; } $2_1 = HEAP32[$6_1 + 8 >> 2]; $1_1 = HEAP32[$6_1 + 4 >> 2]; block578 : { if (($1_1 | 0) != HEAPU8[$9_1 + 85 | 0]) { block576 : { if ($2_1) { $193($9_1, 516); $2_1 = 1; break block576; } if (!(!$1_1 | HEAP32[$9_1 + 192 >> 2] <= 0)) { $5_1 = 5; $1_1 = 4369; break block578; } $13_1 = $652($0_1, 1); if ($13_1) { break block168 } $2_1 = $1_1; } HEAP8[$9_1 + 85 | 0] = $2_1; $13_1 = 5; if (($201($0_1) | 0) == 5) { HEAP32[$0_1 + 32 >> 2] = ($6_1 - $19_1 | 0) / 20; HEAP8[$9_1 + 85 | 0] = 1 - $1_1; break block167; } $194($9_1); $13_1 = HEAP32[$0_1 + 36 >> 2] ? 1 : 101; break block168; } $5_1 = 1; $1_1 = $1_1 ? ($2_1 ? 13031 : 12990) : 10563; } $109($0_1, $1_1, 0); break block6; } $4_1 = HEAP32[$6_1 + 16 >> 2]; $2_1 = 0; $1_1 = $40_1; $3 = HEAP32[$6_1 + 4 >> 2]; block582 : { if (!$3) { if (HEAP32[$9_1 + 192 >> 2] > 0) { $109($0_1, 4264, 0); $5_1 = 5; break block6; } $2_1 = $48($4_1); $5_1 = $666($9_1, 0, HEAP32[$9_1 + 504 >> 2] + HEAP32[$9_1 + 508 >> 2] | 0); if ($5_1) { break block6 } $1_1 = $325($9_1, $2_1 + 33 | 0, 0); if (!$1_1) { break block582 } $13_1 = $1_1 + 32 | 0; HEAP32[$1_1 >> 2] = $13_1; $2_1 = $2_1 + 1 | 0; if ($2_1) { wasm2js_memory_copy($13_1, $4_1, $2_1) } block585 : { if (HEAPU8[$9_1 + 85 | 0]) { HEAP8[$9_1 + 93 | 0] = 1; HEAP8[$9_1 + 85 | 0] = 0; break block585; } HEAP32[$9_1 + 504 >> 2] = HEAP32[$9_1 + 504 >> 2] + 1; } HEAP32[$1_1 + 24 >> 2] = HEAP32[$9_1 + 492 >> 2]; HEAP32[$9_1 + 492 >> 2] = $1_1; $2_1 = HEAP32[$9_1 + 516 >> 2]; HEAP32[$1_1 + 8 >> 2] = HEAP32[$9_1 + 512 >> 2]; HEAP32[$1_1 + 12 >> 2] = $2_1; $2_1 = HEAP32[$9_1 + 524 >> 2]; HEAP32[$1_1 + 16 >> 2] = HEAP32[$9_1 + 520 >> 2]; HEAP32[$1_1 + 20 >> 2] = $2_1; break block582; } while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block586 } if ($67(HEAP32[$1_1 >> 2], $4_1)) { $1_1 = $1_1 + 24 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; if (!(($3 | 0) != 1 | HEAP32[$9_1 + 192 >> 2] <= 0)) { $109($0_1, 4315, 0); $5_1 = 5; break block6; } $10_1 = 0; block596 : { block591 : { block589 : { if (HEAP32[$1_1 + 24 >> 2]) { break block589 } $4_1 = HEAPU8[$9_1 + 93 | 0]; $10_1 = ($4_1 | 0) != 0; if (!$4_1 | ($3 | 0) != 1) { break block589 } $13_1 = $652($0_1, 1); if ($13_1) { break block168 } HEAP8[$9_1 + 85 | 0] = 1; $13_1 = 5; if (($201($0_1) | 0) == 5) { HEAP32[$0_1 + 32 >> 2] = ($6_1 - $19_1 | 0) / 20; HEAP8[$9_1 + 85 | 0] = 0; break block167; } $5_1 = HEAP32[$0_1 + 36 >> 2]; if (!$5_1) { break block591 } HEAP8[$9_1 + 85 | 0] = 0; break block6; } $4_1 = HEAP32[$9_1 + 504 >> 2]; $12_1 = 1; if (($3 | 0) == 2) { $14 = HEAP32[$9_1 + 24 >> 2] & 1; $12_1 = !$14; $7_1 = 0; while (1) { if (($7_1 | 0) < HEAP32[$9_1 + 20 >> 2]) { $5_1 = $7_1 << 4; $13_1 = 0; $7_1 = $7_1 + 1 | 0; $5_1 = $188(HEAP32[($5_1 + HEAP32[$9_1 + 16 >> 2] | 0) + 4 >> 2], 516, $12_1); if (!$5_1) { continue } break block6; } break; }; $12_1 = !$14; } $2_1 = $4_1 + ($2_1 ^ -1) | 0; $7_1 = 0; while (1) { if (($7_1 | 0) < HEAP32[$9_1 + 20 >> 2]) { $5_1 = $7_1 << 4; $13_1 = 0; $7_1 = $7_1 + 1 | 0; $5_1 = $665(HEAP32[($5_1 + HEAP32[$9_1 + 16 >> 2] | 0) + 4 >> 2], $3, $2_1); if (!$5_1) { continue } break block6; } break; }; if (!$12_1) { $342($9_1, 0); $148($9_1); HEAP32[$9_1 + 24 >> 2] = HEAP32[$9_1 + 24 >> 2] | 1; } if (!$13_1) { break block596 } break block386; } HEAP8[$9_1 + 93 | 0] = 0; $10_1 = 1; } while (1) { $4_1 = HEAP32[$40_1 >> 2]; if (($1_1 | 0) != ($4_1 | 0)) { HEAP32[$9_1 + 492 >> 2] = HEAP32[$4_1 + 24 >> 2]; $10($9_1, $4_1); HEAP32[$9_1 + 504 >> 2] = HEAP32[$9_1 + 504 >> 2] - 1; continue; } break; }; block600 : { block599 : { if (($3 | 0) == 1) { HEAP32[$9_1 + 492 >> 2] = HEAP32[$1_1 + 24 >> 2]; $13($9_1, $1_1); if ($10_1) { break block599 } HEAP32[$9_1 + 504 >> 2] = HEAP32[$9_1 + 504 >> 2] - 1; break block600; } $4_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$9_1 + 512 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$9_1 + 516 >> 2] = $4_1; $4_1 = HEAP32[$1_1 + 20 >> 2]; HEAP32[$9_1 + 520 >> 2] = HEAP32[$1_1 + 16 >> 2]; HEAP32[$9_1 + 524 >> 2] = $4_1; } if (($3 | 0) != 2 & $10_1) { break block582 } } $5_1 = $666($9_1, $3, $2_1); if ($5_1) { break block6 } } if (HEAPU8[$0_1 + 151 | 0] != 3) { break block296 } $13_1 = 101; break block168; } $5_1 = $13_1; break block6; } $13_1 = 0; break block79; } HEAP32[$8_1 + 144 >> 2] = $4_1; $109($0_1, 7618, $8_1 + 144 | 0); } $5_1 = 1; break block6; } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 + 96 >> 2] + (HEAP32[$6_1 + 4 >> 2] << 2) >> 2] + 36 >> 2]; block602 : { if (HEAP32[$6_1 + 12 >> 2]) { $11_1 = $726($1_1); $4_1 = i64toi32_i32$HIGH_BITS; break block602; } $13_1 = 0; block603 : { $5_1 = $737($1_1); if (($5_1 | 0) == 16) { break block603 } $11_1 = 0; $4_1 = 0; while (1) { if ($5_1) { break block6 } if (HEAP32[$9_1 + 296 >> 2]) { break block603 } block606 : { $2_1 = HEAP32[$1_1 + 116 >> 2]; block605 : { if (!HEAPU8[$2_1 + 8 | 0]) { $7_1 = HEAPU16[$2_1 + 24 >> 1]; if (HEAPU8[$2_1 + 1 | 0]) { break block605 } $5_1 = $7_1 & 65535; $11_1 = $5_1 + $11_1 | 0; $4_1 = $11_1 >>> 0 < $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; break block605; } $2_1 = HEAPU16[$2_1 + 24 >> 1]; $11_1 = $2_1 + $11_1 | 0; $4_1 = $11_1 >>> 0 < $2_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; while (1) { if (!HEAPU8[$1_1 + 68 | 0]) { break block606 } $738($1_1); $2_1 = HEAP32[$1_1 + 116 >> 2]; $7_1 = HEAPU16[$2_1 + 24 >> 1]; $5_1 = HEAPU16[$1_1 + 70 >> 1]; if ($7_1 >>> 0 <= $5_1 >>> 0) { continue } break; }; HEAP16[$1_1 + 70 >> 1] = $5_1 + 1; } $5_1 = HEAPU16[$1_1 + 70 >> 1]; if (($5_1 | 0) == ($7_1 & 65535)) { $2_1 = (HEAP32[$2_1 + 56 >> 2] + HEAPU8[$2_1 + 9 | 0] | 0) + 8 | 0 } else { $3 = HEAP32[$2_1 + 56 >> 2]; $7_1 = HEAPU16[$2_1 + 26 >> 1]; $2_1 = HEAP32[$2_1 + 64 >> 2] + ($5_1 << 1) | 0; $2_1 = $3 + ($7_1 & (HEAPU8[$2_1 | 0] << 8 | HEAPU8[$2_1 + 1 | 0])) | 0; } $5_1 = $739($1_1, $156($2_1)); continue; } break; }; $5_1 = $737($1_1); if ($5_1) { break block6 } break block602; } $11_1 = 0; $4_1 = 0; } $1_1 = $670($0_1, $6_1); HEAP32[$1_1 >> 2] = $11_1; HEAP32[$1_1 + 4 >> 2] = $4_1; break block277; } $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $10_1 = $2_1 + Math_imul(HEAP32[$6_1 + 8 >> 2], 40) | 0; $14 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40); $3 = HEAP32[$6_1 + 16 >> 2]; if ($3) { $7_1 = HEAPU8[$3 | 0]; $1_1 = $2_1; while (1) { $674($1_1, $7_1 << 24 >> 24, $21_1); $4_1 = $3; block610 : { if (HEAPU8[$3 | 0] != 69) { break block610 } $3 = HEAPU16[$1_1 + 16 >> 1]; if (!($3 & 4)) { break block610 } HEAP16[$1_1 + 16 >> 1] = $3 & 65499 | 32; } $1_1 = $1_1 + 40 | 0; $3 = $4_1 + 1 | 0; $7_1 = HEAPU8[$4_1 + 1 | 0]; if ($7_1) { continue } break; }; } $17_1 = $15_1 + $14 | 0; $3 = 0; $16_1 = 0; $14 = 0; $11_1 = 0; $4_1 = 0; $25 = $10_1 - 40 | 0; $7_1 = $25; while (1) { $1_1 = $7_1; $18_1 = HEAPU16[$1_1 + 16 >> 1]; block612 : { if ($18_1 & 1) { HEAP32[$1_1 + 28 >> 2] = $18_1 << 21 >> 31 & 10; $3 = $3 + 1 | 0; break block612; } if ($18_1 & 36) { $3 = $3 + 1 | 0; $20_1 = HEAP32[$1_1 >> 2]; $10_1 = HEAP32[$1_1 + 4 >> 2]; $7_1 = $10_1 >> 31; $12_1 = $20_1 ^ $7_1; $7_1 = $7_1 ^ $10_1; if (!(!$7_1 & $12_1 >>> 0 > 127 | ($7_1 | 0) != 0)) { if (!(!$10_1 & $20_1 >>> 0 > 1 | ($10_1 | 0) != 0 | HEAPU8[$0_1 + 149 | 0] < 4)) { HEAP32[$1_1 + 28 >> 2] = $20_1 | 8; break block612; } HEAP32[$1_1 + 28 >> 2] = 1; $11_1 = $11_1 + 1 | 0; $4_1 = $11_1 ? $4_1 : $4_1 + 1 | 0; break block612; } if (!(!$7_1 & $12_1 >>> 0 > 32767 | ($7_1 | 0) != 0)) { HEAP32[$1_1 + 28 >> 2] = 2; $11_1 = $11_1 + 2 | 0; $4_1 = $11_1 >>> 0 < 2 ? $4_1 + 1 | 0 : $4_1; break block612; } if (!(!$7_1 & $12_1 >>> 0 > 8388607 | ($7_1 | 0) != 0)) { HEAP32[$1_1 + 28 >> 2] = 3; $11_1 = $11_1 + 3 | 0; $4_1 = $11_1 >>> 0 < 3 ? $4_1 + 1 | 0 : $4_1; break block612; } if (!(!$7_1 & $12_1 >>> 0 > 2147483647 | ($7_1 | 0) != 0)) { HEAP32[$1_1 + 28 >> 2] = 4; $11_1 = $11_1 + 4 | 0; $4_1 = $11_1 >>> 0 < 4 ? $4_1 + 1 | 0 : $4_1; break block612; } if ($7_1 >>> 0 <= 32767) { HEAP32[$1_1 + 28 >> 2] = 5; $11_1 = $11_1 + 6 | 0; $4_1 = $11_1 >>> 0 < 6 ? $4_1 + 1 | 0 : $4_1; break block612; } $11_1 = $11_1 + 8 | 0; $4_1 = $11_1 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; if ($18_1 & 32) { HEAP32[$1_1 + 28 >> 2] = 7; HEAPF64[$1_1 >> 3] = +($20_1 >>> 0) + +($10_1 | 0) * 4294967296.0; HEAP16[$1_1 + 16 >> 1] = $18_1 & 65495 | 8; break block612; } HEAP32[$1_1 + 28 >> 2] = 6; break block612; } if ($18_1 & 8) { HEAP32[$1_1 + 28 >> 2] = 7; $11_1 = $11_1 + 8 | 0; $4_1 = $11_1 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; $3 = $3 + 1 | 0; break block612; } $12_1 = HEAP32[$1_1 + 12 >> 2]; $10_1 = ($18_1 >>> 1 & 1 | $12_1 << 1) + 12 | 0; block622 : { if (!($18_1 & 1024)) { break block622 } $7_1 = HEAP32[$1_1 >> 2]; $10_1 = ($7_1 << 1) + $10_1 | 0; if ($4_1 | $11_1) { if ($207($1_1)) { break block4 } $12_1 = HEAP32[$1_1 >> 2] + $12_1 | 0; break block622; } $14 = ($7_1 >> 31) + $14 | 0; $16_1 = $7_1 + $16_1 | 0; $14 = $16_1 >>> 0 < $7_1 >>> 0 ? $14 + 1 | 0 : $14; } HEAP32[$1_1 + 28 >> 2] = $10_1; $11_1 = $12_1 + $11_1 | 0; $4_1 = $11_1 >>> 0 < $12_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $3 = $716($10_1, 0) + $3 | 0; } $7_1 = $1_1 - 40 | 0; if (($1_1 | 0) != ($2_1 | 0)) { continue } break; }; $7_1 = $4_1; if (($3 | 0) <= 126) { $1_1 = $3 + 1 | 0 } else { $4_1 = $716($3, 0); $1_1 = $3 + $4_1 | 0; $1_1 = (($716($1_1, $1_1 >> 31) | 0) > ($4_1 | 0)) + $1_1 | 0; } $10_1 = $1_1 >> 31; $3 = $7_1 + $10_1 | 0; $4_1 = $1_1 + $11_1 | 0; $3 = $14 + ($4_1 >>> 0 < $1_1 >>> 0 ? $3 + 1 | 0 : $3) | 0; $7_1 = $4_1 + $16_1 | 0; $3 = $7_1 >>> 0 < $16_1 >>> 0 ? $3 + 1 | 0 : $3; $12_1 = HEAP32[$17_1 + 24 >> 2]; $11_1 = $12_1 >>> 0 < $7_1 >>> 0; $12_1 = $12_1 >> 31; block627 : { if (!($11_1 & ($12_1 | 0) <= ($3 | 0) | ($3 | 0) > ($12_1 | 0))) { HEAP32[$17_1 + 8 >> 2] = HEAP32[$17_1 + 32 >> 2]; break block627; } $12_1 = HEAP32[$9_1 + 120 >> 2]; $11_1 = $7_1 >>> 0 > $12_1 >>> 0; $7_1 = $12_1 >> 31; if ($11_1 & ($7_1 | 0) <= ($3 | 0) | ($3 | 0) > ($7_1 | 0)) { break block170 } if ($237($17_1, $4_1)) { break block4 } } HEAP16[$17_1 + 16 >> 1] = 16; HEAP32[$17_1 + 12 >> 2] = $4_1; if ($14 | $16_1) { HEAP16[$17_1 + 16 >> 1] = 1040; HEAP32[$17_1 >> 2] = $16_1; } $3 = HEAP32[$17_1 + 8 >> 2]; block630 : { if (($1_1 | 0) <= 127) { HEAP8[$3 | 0] = $1_1; $7_1 = $3 + 1 | 0; break block630; } $7_1 = $732($3, $1_1, $10_1) + $3 | 0; } $3 = $1_1 + $3 | 0; while (1) { $1_1 = $2_1; $10_1 = HEAP32[$1_1 + 28 >> 2]; block632 : { if ($10_1 >>> 0 <= 7) { HEAP8[$7_1 | 0] = $10_1; $7_1 = $7_1 + 1 | 0; if (!$10_1) { break block632 } $11_1 = HEAP32[$1_1 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; block633 : { block634 : { block635 : { block636 : { block638 : { block637 : { $10_1 = HEAPU8[$10_1 + 34576 | 0]; switch ($10_1 - 1 | 0) { case 0: break block633; case 1: break block634; case 2: break block635; case 3: break block636; case 5: break block638; default: break block637; }; } $2_1 = $11_1 << 8 | ($11_1 & 65280) >>> 8; HEAP8[$3 + 6 | 0] = $2_1; HEAP8[$3 + 7 | 0] = $2_1 >>> 8; $2_1 = $4_1; $4_1 = $2_1 >>> 16 | 0; $11_1 = ($2_1 & 65535) << 16 | $11_1 >>> 16; } $2_1 = $11_1 << 8 | ($11_1 & 65280) >>> 8; HEAP8[$3 + 4 | 0] = $2_1; HEAP8[$3 + 5 | 0] = $2_1 >>> 8; $11_1 = ($4_1 & 65535) << 16 | $11_1 >>> 16; $4_1 = $4_1 >>> 16 | 0; } HEAP8[$3 + 3 | 0] = $11_1; $2_1 = $4_1; $4_1 = $2_1 >>> 8 | 0; $11_1 = ($2_1 & 255) << 24 | $11_1 >>> 8; } HEAP8[$3 + 2 | 0] = $11_1; $2_1 = $4_1; $4_1 = $2_1 >>> 8 | 0; $11_1 = ($2_1 & 255) << 24 | $11_1 >>> 8; } HEAP8[$3 + 1 | 0] = $11_1; $11_1 = ($4_1 & 255) << 24 | $11_1 >>> 8; } HEAP8[$3 | 0] = $11_1; $3 = $3 + $10_1 | 0; break block632; } if ($10_1 >>> 0 <= 127) { HEAP8[$7_1 | 0] = $10_1; $7_1 = $7_1 + 1 | 0; if ($10_1 >>> 0 < 14) { break block632 } $2_1 = HEAP32[$1_1 + 12 >> 2]; if (($2_1 | 0) <= 0) { break block632 } if ($2_1) { wasm2js_memory_copy($3, HEAP32[$1_1 + 8 >> 2], $2_1) } $3 = HEAP32[$1_1 + 12 >> 2] + $3 | 0; break block632; } $7_1 = $732($7_1, $10_1, 0) + $7_1 | 0; $2_1 = HEAP32[$1_1 + 12 >> 2]; if (!$2_1) { break block632 } if ($2_1) { wasm2js_memory_copy($3, HEAP32[$1_1 + 8 >> 2], $2_1) } $3 = HEAP32[$1_1 + 12 >> 2] + $3 | 0; } $2_1 = $1_1 + 40 | 0; if (($1_1 | 0) != ($25 | 0)) { continue } break; }; break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $7_1 = HEAP32[$6_1 + 16 >> 2]; $2_1 = HEAPU8[$7_1 | 0]; while (1) { $674($1_1, $2_1 << 24 >> 24, $21_1); $2_1 = $7_1; block642 : { if (HEAPU8[$2_1 | 0] != 69) { break block642 } $3 = HEAPU16[$1_1 + 16 >> 1]; if (!($3 & 4)) { break block642 } $4_1 = HEAP32[$1_1 + 4 >> 2]; $7_1 = $4_1 + 32768 | 0; block644 : { if (!(($7_1 | 0) == 65536 | $7_1 >>> 0 > 65536)) { $12_1 = 65499; $4_1 = 32; break block644; } HEAPF64[$1_1 >> 3] = +HEAPU32[$1_1 >> 2] + +($4_1 | 0) * 4294967296.0; $12_1 = 65521; $4_1 = 8; } HEAP16[$1_1 + 16 >> 1] = $4_1 | $3 & $12_1; } $1_1 = $1_1 + 40 | 0; $7_1 = $2_1 + 1 | 0; $2_1 = HEAPU8[$2_1 + 1 | 0]; if ($2_1) { continue } break; }; break block79; } $2_1 = Math_imul(HEAP32[$6_1 + 4 >> 2], 40) + $15_1 | 0; $7_1 = HEAP32[$6_1 + 16 >> 2]; $10_1 = HEAP32[$7_1 + 4 >> 2]; $1_1 = 0; while (1) { if (HEAP16[$7_1 + 34 >> 1] <= ($1_1 | 0)) { break block79 } block646 : { block645 : { $4_1 = $10_1 + Math_imul($1_1, 12) | 0; $3 = HEAPU16[$4_1 + 10 >> 1]; if (!($3 & 96)) { break block645 } if ($3 & 32) { break block646 } if (!HEAP32[$6_1 + 12 >> 2]) { break block645 } $2_1 = $2_1 + 40 | 0; break block646; } $674($2_1, HEAP8[$4_1 + 5 | 0], $21_1); block647 : { $3 = HEAPU16[$2_1 + 16 >> 1]; if ($3 & 1) { break block647 } block652 : { block648 : { block650 : { block651 : { block649 : { $14 = HEAPU8[$4_1 + 4 | 0] >>> 4 | 0; switch ($14 - 2 | 0) { case 0: break block648; case 1: case 2: break block649; case 3: break block650; case 4: break block651; default: break block647; }; } if ($3 & 4) { break block647 } break block652; } if ($3 & 2) { break block647 } break block652; } block655 : { block654 : { if ($3 & 4) { $4_1 = HEAP32[$2_1 >> 2]; $14 = HEAP32[$2_1 + 4 >> 2]; $12_1 = $14 + 32768 | 0; if (($12_1 | 0) == 65536 | $12_1 >>> 0 > 65536) { break block654 } $12_1 = 65499; $4_1 = 32; break block655; } if ($3 & 40) { break block647 } break block652; } HEAPF64[$2_1 >> 3] = +($4_1 >>> 0) + +($14 | 0) * 4294967296.0; $12_1 = 65523; $4_1 = 8; } HEAP16[$2_1 + 16 >> 1] = $4_1 | $3 & $12_1; break block647; } if ($3 & 16) { break block647 } } $1_1 = HEAP32[($14 << 2) + 76316 >> 2]; $2_1 = HEAP32[$7_1 >> 2]; HEAP32[$8_1 + 140 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$8_1 + 136 >> 2] = $2_1; HEAP32[$8_1 + 132 >> 2] = $1_1; HEAP32[$8_1 + 128 >> 2] = HEAP32[(HEAPU8[($3 & 63) + 31328 | 0] << 2) + 34716 >> 2]; $109($0_1, 6224, $8_1 + 128 | 0); $5_1 = 3091; break block6; } $2_1 = $2_1 + 40 | 0; } $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$10_1 + 72 >> 2] = $262($1_1); $2_1 = HEAPU16[$1_1 + 48 >> 1]; $4_1 = HEAP32[HEAP32[$1_1 + 116 >> 2] + 60 >> 2]; $7_1 = HEAP32[$1_1 + 40 >> 2]; HEAP32[$10_1 + 68 >> 2] = $7_1; $1_1 = $4_1 - $7_1 | 0; HEAP32[$10_1 + 76 >> 2] = ($1_1 | 0) < ($2_1 | 0) ? (($1_1 | 0) > 0 ? $1_1 : 0) : $2_1; $2_1 = HEAP32[$0_1 + 28 >> 2]; } HEAP32[$10_1 + 24 >> 2] = $2_1; $1_1 = HEAP8[$7_1 | 0]; HEAP32[$16_1 >> 2] = $1_1 & 255; $2_1 = 1; if (($1_1 | 0) < 0) { $2_1 = $264($7_1, $16_1) } $12_1 = 0; HEAP16[$10_1 + 54 >> 1] = 0; HEAP32[$10_1 + 44 >> 2] = $2_1; $7_1 = HEAP32[$16_1 >> 2]; if ($7_1 >>> 0 > HEAPU32[$10_1 + 76 >> 2]) { HEAP32[$10_1 + 76 >> 2] = 0; HEAP32[$10_1 + 68 >> 2] = 0; $1_1 = HEAP32[$16_1 >> 2]; if ($1_1 >>> 0 > 98307) { break block658 } if ($1_1 >>> 0 <= HEAPU32[$10_1 + 72 >> 2]) { break block251 } break block658; } $14 = HEAP32[$10_1 + 68 >> 2]; break block659; } if (($12_1 & 65535) >>> 0 > $3 >>> 0) { break block660 } $7_1 = HEAP32[$16_1 >> 2]; $2_1 = HEAP32[$10_1 + 44 >> 2]; if ($7_1 >>> 0 <= $2_1 >>> 0) { break block661 } $14 = HEAP32[$10_1 + 68 >> 2]; if ($14) { break block659 } $1_1 = $8_1 + 368 | 0; wasm2js_memory_fill($1_1, 0, 40); $5_1 = $263(HEAP32[$10_1 + 36 >> 2], HEAP32[$16_1 >> 2], $1_1); if ($5_1) { break block6 } $7_1 = HEAP32[$16_1 >> 2]; $2_1 = HEAP32[$10_1 + 44 >> 2]; $12_1 = HEAPU16[$10_1 + 54 >> 1]; $13_1 = 0; $14 = HEAP32[$8_1 + 376 >> 2]; } $17_1 = $10_1 + 84 | 0; $1_1 = $7_1 + $14 | 0; $2_1 = $2_1 + $14 | 0; $7_1 = $12_1 & 65535; $11_1 = HEAP32[$16_1 + ($7_1 << 2) >> 2]; $4_1 = 0; while (1) { $18_1 = HEAP8[$2_1 | 0]; $12_1 = $18_1 & 255; HEAP32[$8_1 + 472 >> 2] = $12_1; $20_1 = $17_1 + ($7_1 << 2) | 0; HEAP32[$20_1 >> 2] = $12_1; $33_1 = $4_1 + 1 | 0; $25 = $4_1; $29_1 = $11_1; block664 : { if (($18_1 | 0) >= 0) { $2_1 = $2_1 + 1 | 0; $4_1 = HEAPU8[$12_1 + 34576 | 0]; break block664; } $12_1 = $264($2_1, $8_1 + 472 | 0); $4_1 = HEAP32[$8_1 + 472 >> 2]; HEAP32[$20_1 >> 2] = $4_1; $2_1 = $2_1 + $12_1 | 0; $4_1 = $4_1 >>> 0 >= 128 ? $4_1 - 12 >>> 1 | 0 : HEAPU8[$4_1 + 34576 | 0]; } $11_1 = $4_1 + $11_1 | 0; $4_1 = $29_1 >>> 0 > $11_1 >>> 0 ? $33_1 : $25; $12_1 = $7_1 + 1 | 0; HEAP32[$16_1 + ($12_1 << 2) >> 2] = $11_1; if ($3 >>> 0 > $7_1 >>> 0) { $7_1 = $12_1; if ($1_1 >>> 0 > $2_1 >>> 0) { continue } } break; }; block669 : { if ($1_1 >>> 0 <= $2_1 >>> 0) { if (HEAP32[$10_1 + 72 >> 2] != ($11_1 | 0) | $4_1 | $1_1 >>> 0 < $2_1 >>> 0) { break block669 } break block670; } if (!$4_1 & HEAPU32[$10_1 + 72 >> 2] >= $11_1 >>> 0) { break block670 } } if (!HEAP32[$16_1 >> 2]) { $12_1 = 0; $2_1 = $1_1; break block670; } if (HEAP32[$10_1 + 68 >> 2]) { break block658 } $204($8_1 + 368 | 0); break block658; } HEAP32[$8_1 + 472 >> 2] = 0; break block672; } HEAP32[$8_1 + 472 >> 2] = HEAP32[($10_1 + ($3 << 2) | 0) + 84 >> 2]; break block673; } HEAP16[$10_1 + 54 >> 1] = $12_1; HEAP32[$10_1 + 44 >> 2] = $2_1 - $14; if (HEAP32[$10_1 + 68 >> 2]) { break block672 } $204($8_1 + 368 | 0); $12_1 = HEAPU16[$10_1 + 54 >> 1]; } if (($12_1 & 65535) >>> 0 > $3 >>> 0) { break block673 } $1_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; if (HEAPU8[$6_1 + 1 | 0] == 246) { $671($1_1, HEAP32[$6_1 + 16 >> 2], 8192); break block79; } $112($1_1); break block79; } $1_1 = Math_imul(HEAP32[$6_1 + 12 >> 2], 40) + $15_1 | 0; if (HEAPU8[$1_1 + 17 | 0] & 144) { $112($1_1) } $7_1 = $16_1 + ($3 << 2) | 0; if (HEAPU32[$10_1 + 76 >> 2] >= HEAPU32[$7_1 + 4 >> 2]) { $4_1 = HEAP32[$10_1 + 68 >> 2] + HEAP32[$7_1 >> 2] | 0; $2_1 = HEAP32[$8_1 + 472 >> 2]; if ($2_1 >>> 0 <= 11) { $265($4_1, $2_1, $1_1); break block79; } HEAP8[$1_1 + 18 | 0] = $21_1; $2_1 = $2_1 - 12 >>> 1 | 0; HEAP32[$1_1 + 12 >> 2] = $2_1; $3 = $2_1 + 2 | 0; block679 : { if (($3 | 0) > HEAP32[$1_1 + 24 >> 2]) { if (($2_1 | 0) > HEAP32[$9_1 + 120 >> 2]) { break block170 } HEAP16[$1_1 + 16 >> 1] = 1; if ($108($1_1, $3, 0)) { break block4 } $3 = HEAP32[$1_1 + 8 >> 2]; break block679; } $3 = HEAP32[$1_1 + 32 >> 2]; HEAP32[$1_1 + 8 >> 2] = $3; } if ($2_1) { wasm2js_memory_copy($3, $4_1, $2_1) } HEAP8[$2_1 + HEAP32[$1_1 + 8 >> 2] | 0] = 0; HEAP8[($2_1 + HEAP32[$1_1 + 8 >> 2] | 0) + 1 | 0] = 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[((HEAP32[$8_1 + 472 >> 2] & 1) << 1) + 34558 >> 1]; break block79; } HEAP8[$1_1 + 18 | 0] = $21_1; $2_1 = HEAP32[$8_1 + 472 >> 2]; block684 : { $4_1 = HEAPU16[$6_1 + 2 >> 1] & 192; block682 : { block683 : { if ($4_1) { if (($4_1 | 0) == 128) { break block682 } if ($2_1 >>> 0 < 12) { break block683 } if (!($2_1 & 1) | ($4_1 | 0) == 192) { break block682 } } if ($2_1 >>> 0 > 127) { break block684 } } if (HEAPU8[$2_1 + 34576 | 0]) { break block684 } } $265(31424, $2_1, $1_1); break block79; } $4_1 = $2_1 >>> 0 >= 128 ? $2_1 - 12 >>> 1 | 0 : HEAPU8[$2_1 + 34576 | 0]; $13_1 = HEAP32[$1_1 + 20 >> 2]; $11_1 = 18; __inlined_func$740$29 : { if (($4_1 | 0) > HEAP32[$13_1 + 120 >> 2]) { break __inlined_func$740$29 } $14 = HEAP32[$7_1 >> 2]; $12_1 = HEAP32[$0_1 + 28 >> 2]; $16_1 = HEAPU8[$1_1 + 18 | 0]; block671 : { block1072 : { block1273 : { if (!(HEAP32[$10_1 + 40 >> 2] | $4_1 >>> 0 < 4001)) { block574 : { if (HEAPU8[$10_1 + 5 | 0] & 16) { $13_1 = HEAP32[$10_1 + 80 >> 2]; break block574; } $13_1 = $270($13_1, 32, 0); HEAP32[$10_1 + 80 >> 2] = $13_1; if (!$13_1) { break block671 } HEAP8[$10_1 + 5 | 0] = HEAPU8[$10_1 + 5 | 0] | 16; } $7_1 = HEAP32[$13_1 >> 2]; block975 : { block776 : { if (!$7_1) { break block776 } if (!(HEAP32[$13_1 + 16 >> 2] != ($3 | 0) | HEAP32[$13_1 + 20 >> 2] != ($12_1 | 0) | HEAP32[$13_1 + 24 >> 2] != ($34_1 | 0))) { $11_1 = HEAP32[$13_1 + 8 >> 2]; $17_1 = HEAP32[$13_1 + 12 >> 2]; $18_1 = $749(HEAP32[$10_1 + 36 >> 2]); $7_1 = HEAP32[$13_1 >> 2]; if (($11_1 | 0) == ($18_1 | 0) & (i64toi32_i32$HIGH_BITS | 0) == ($17_1 | 0)) { break block975 } if (!$7_1) { break block776 } } $249($7_1); } $7_1 = $750($4_1 + 3 | 0, 0); HEAP32[$13_1 >> 2] = $7_1; if (!$7_1) { break block671 } $11_1 = $338(HEAP32[$10_1 + 36 >> 2], $14, $4_1, $7_1); if ($11_1) { break block1072 } $14 = $4_1 + $7_1 | 0; HEAP8[$14 + 2 | 0] = 0; HEAP8[$14 | 0] = 0; HEAP8[$14 + 1 | 0] = 0; HEAP32[$13_1 + 24 >> 2] = $34_1; HEAP32[$13_1 + 20 >> 2] = $12_1; HEAP32[$13_1 + 16 >> 2] = $3; HEAP32[$13_1 + 8 >> 2] = $749(HEAP32[$10_1 + 36 >> 2]); HEAP32[$13_1 + 12 >> 2] = i64toi32_i32$HIGH_BITS; } $13_1 = $7_1 - 8 | 0; $3 = HEAP32[$13_1 + 4 >> 2]; $10_1 = $3; $12_1 = $3 + 1 | 0; $3 = HEAP32[$13_1 >> 2] + 1 | 0; $10_1 = $3 ? $10_1 : $12_1; HEAP32[$13_1 >> 2] = $3; HEAP32[$13_1 + 4 >> 2] = $10_1; if ($2_1 & 1) { $11_1 = $111($1_1, $7_1, $4_1, 0, $16_1, 9); HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] | 512; break block1273; } $11_1 = $111($1_1, $7_1, $4_1, 0, 0, 9); break block1273; } $11_1 = $748(HEAP32[$10_1 + 36 >> 2], $14, $4_1, $1_1); if ($11_1) { break block1072 } $265(HEAP32[$1_1 + 8 >> 2], $2_1, $1_1); $11_1 = 0; if (!($2_1 & 1) | ($16_1 | 0) != 1) { break block1273 } HEAP8[HEAP32[$1_1 + 8 >> 2] + $4_1 | 0] = 0; HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] | 512; } HEAP16[$1_1 + 16 >> 1] = HEAPU16[$1_1 + 16 >> 1] & 49151; } break __inlined_func$740$29; } $11_1 = 7; } $13_1 = $11_1; if (!$13_1) { break block79 } if (($13_1 | 0) == 18) { break block170 } $5_1 = $13_1; if (($5_1 | 0) != 7) { break block6 } break block4; } $109($0_1, 12643, 0); $5_1 = 18; break block6; } $1_1 = HEAP32[$19_1 + 12 >> 2]; if (($1_1 | 0) > 0) { $6_1 = (Math_imul($1_1, 20) + $19_1 | 0) - 20 | 0; break block79; } $5_1 = $181(96759); break block6; } $22_1 = 0; break block79; } $22_1 = 1; break block79; } $3 = HEAP32[$14 >> 2]; $2_1 = HEAP32[$14 + 4 >> 2]; $4_1 = HEAP32[$12_1 + 4 >> 2]; $7_1 = HEAP32[$12_1 >> 2]; HEAP32[$8_1 + 368 >> 2] = $7_1; HEAP32[$8_1 + 372 >> 2] = $4_1; block686 : { block695 : { block690 : { switch (($1_1 & 255) - 107 | 0) { case 1: if (!$741($8_1 + 368 | 0, $3, $2_1)) { break block691 } break block191; case 2: block693 : { if (!(!$3 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0)) { $11_1 = __wasm_i64_udiv(-1, 2147483647, $3, $2_1) >>> 0 < $7_1 >>> 0; $1_1 = i64toi32_i32$HIGH_BITS; if ($11_1 & ($1_1 | 0) <= ($4_1 | 0) | ($1_1 | 0) < ($4_1 | 0)) { break block191 } $1_1 = __wasm_i64_udiv(0, -2147483648, $3, $2_1); $16_1 = 0 - $1_1 | 0; $1_1 = 0 - (i64toi32_i32$HIGH_BITS + (($1_1 | 0) != 0) | 0) | 0; if (($1_1 | 0) <= ($4_1 | 0) & $7_1 >>> 0 >= $16_1 >>> 0 | ($1_1 | 0) < ($4_1 | 0)) { break block693 } break block191; } if (($2_1 | 0) >= 0) { break block693 } if (!(!$7_1 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0)) { $1_1 = __wasm_i64_udiv(0, -2147483648, $7_1, $4_1); $16_1 = 0 - $1_1 | 0; $1_1 = 0 - (i64toi32_i32$HIGH_BITS + (($1_1 | 0) != 0) | 0) | 0; if (($1_1 | 0) == ($2_1 | 0) & $3 >>> 0 >= $16_1 >>> 0 | $1_1 >>> 0 < $2_1 >>> 0) { break block693 } break block191; } if (($4_1 | 0) >= 0) { break block693 } if (!$3 & ($2_1 | 0) == -2147483648 | !$7_1 & ($4_1 | 0) == -2147483648) { break block191 } $1_1 = __wasm_i64_udiv(-1, 2147483647, 0 - $3 | 0, 0 - ((($3 | 0) != 0) + $2_1 | 0) | 0); $16_1 = i64toi32_i32$HIGH_BITS; $11_1 = 0 - ((($7_1 | 0) != 0) + $4_1 | 0) | 0; if (($16_1 | 0) == ($11_1 | 0) & 0 - $7_1 >>> 0 > $1_1 >>> 0 | $11_1 >>> 0 > $16_1 >>> 0) { break block191 } } $11_1 = __wasm_i64_mul($7_1, $4_1, $3, $2_1); $1_1 = i64toi32_i32$HIGH_BITS; break block695; case 3: if (!($2_1 | $3)) { break block190 } if (!$7_1 & ($4_1 | 0) == -2147483648 & ($2_1 & $3) == -1) { break block191 } $11_1 = __wasm_i64_sdiv($7_1, $4_1, $3, $2_1); $1_1 = i64toi32_i32$HIGH_BITS; break block695; case 0: break block686; default: break block690; }; } if (!($2_1 | $3)) { break block190 } $1_1 = ($2_1 & $3) == -1; $11_1 = __wasm_i64_srem($7_1, $4_1, $1_1 ? 1 : $3, $1_1 ? 0 : $2_1); $1_1 = i64toi32_i32$HIGH_BITS; } HEAP32[$8_1 + 368 >> 2] = $11_1; HEAP32[$8_1 + 372 >> 2] = $1_1; break block691; } if (!$689($8_1 + 368 | 0, $3, $2_1)) { break block691 } } $24_1 = $39($14); $38_1 = $39($12_1); block703 : { block702 : { block697 : { switch (HEAPU8[$6_1 | 0] - 107 | 0) { case 1: $24_1 = $38_1 - $24_1; break block702; case 2: $24_1 = $24_1 * $38_1; break block702; case 3: if ($24_1 == 0.0) { break block190 } $24_1 = $38_1 / $24_1; break block702; default: $1_1 = $50($14); $2_1 = i64toi32_i32$HIGH_BITS; $3 = $50($12_1); HEAP32[$8_1 + 368 >> 2] = $3; $4_1 = i64toi32_i32$HIGH_BITS; HEAP32[$8_1 + 372 >> 2] = $4_1; if (!($1_1 | $2_1)) { break block190 } $7_1 = $1_1; $1_1 = ($1_1 & $2_1) == -1; $24_1 = +(__wasm_i64_srem($3, $4_1, $1_1 ? 1 : $7_1, $1_1 ? 0 : $2_1) >>> 0) + +(i64toi32_i32$HIGH_BITS | 0) * 4294967296.0; break block703; case 0: break block697; }; } $24_1 = $24_1 + $38_1; } if ($24_1 != $24_1) { break block190 } } HEAPF64[$10_1 >> 3] = $24_1; HEAP16[$10_1 + 16 >> 1] = HEAPU16[$10_1 + 16 >> 1] & 62016 | 8; break block79; } $112($10_1); break block79; } $1_1 = HEAP32[$8_1 + 372 >> 2]; HEAP32[$10_1 >> 2] = HEAP32[$8_1 + 368 >> 2]; HEAP32[$10_1 + 4 >> 2] = $1_1; HEAP16[$10_1 + 16 >> 1] = HEAPU16[$10_1 + 16 >> 1] & 62016 | 4; break block79; } HEAP32[$0_1 + 36 >> 2] = 5; } $1_1 = 1; break block704; } $6_1 = (Math_imul(HEAP32[$6_1 + 8 >> 2], 20) + $19_1 | 0) - 20 | 0; break block79; } $6_1 = (Math_imul(HEAP32[$6_1 + 8 >> 2], 20) + $19_1 | 0) - 20 | 0; } if (HEAP32[$9_1 + 296 >> 2]) { break block705 } while (1) { if (($23_1 | 0) == ($30_1 | 0) & $26_1 >>> 0 > $32_1 >>> 0 | $23_1 >>> 0 > $30_1 >>> 0) { break block79 } $1_1 = HEAP32[$9_1 + 372 >> 2]; if (!$1_1) { break block79 } $2_1 = HEAP32[$9_1 + 380 >> 2]; $26_1 = $2_1 + $26_1 | 0; $23_1 = $26_1 >>> 0 < $2_1 >>> 0 ? $23_1 + 1 | 0 : $23_1; if (!(FUNCTION_TABLE[$1_1 | 0](HEAP32[$9_1 + 376 >> 2]) | 0)) { continue } break; }; $26_1 = -1; $23_1 = -1; break block705; } $6_1 = $6_1 + 20 | 0; continue; }; } $106($9_1); $109($0_1, 1162, 0); } $5_1 = 7; break block6; } $5_1 = 9; } $1_1 = 0; } while (1) { block717 : { block71529 : { block716 : { block714 : { if (!$1_1) { $1_1 = 7; block708 : { if (HEAPU8[$9_1 + 87 | 0]) { break block708 } $1_1 = $5_1; if (($1_1 | 0) != 8458) { break block708 } $1_1 = $181(102667); } if (!(HEAP32[$0_1 + 124 >> 2] | ($1_1 | 0) == 3082)) { HEAP32[$8_1 + 16 >> 2] = $256($1_1); $109($0_1, 8932, $8_1 + 16 | 0); } HEAP32[$0_1 + 36 >> 2] = $1_1; $133($9_1, $1_1); $2_1 = HEAP32[$0_1 + 200 >> 2]; HEAP32[$8_1 + 8 >> 2] = HEAP32[$0_1 + 124 >> 2]; HEAP32[$8_1 + 4 >> 2] = $2_1; HEAP32[$8_1 >> 2] = ($6_1 - $19_1 | 0) / 20; $64($1_1, 7275, $8_1); if (HEAPU8[$0_1 + 151 | 0] == 2) { $201($0_1) } block712 : { if (($1_1 | 0) != 11) { if (($1_1 | 0) != 3082) { break block712 } $106($9_1); break block712; } if (HEAPU8[$9_1 + 85 | 0]) { break block712 } $1_1 = HEAP32[$9_1 + 36 >> 2] | 2; HEAP32[$9_1 + 32 >> 2] = HEAP32[$9_1 + 32 >> 2]; HEAP32[$9_1 + 36 >> 2] = $1_1; } $13_1 = 1; $1_1 = $45_1 & 255; if (!$1_1) { $45_1 = 0; break block714; } $351($9_1, $1_1 - 1 | 0); break block714; } if (($23_1 | 0) == ($30_1 | 0) & $26_1 >>> 0 > $32_1 >>> 0 | $23_1 >>> 0 > $30_1 >>> 0) { break block71529 } $1_1 = HEAP32[$9_1 + 372 >> 2]; if (!$1_1) { break block71529 } $2_1 = HEAP32[$9_1 + 380 >> 2]; $26_1 = $2_1 + $26_1 | 0; $23_1 = $26_1 >>> 0 < $2_1 >>> 0 ? $23_1 + 1 | 0 : $23_1; if (FUNCTION_TABLE[$1_1 | 0](HEAP32[$9_1 + 376 >> 2]) | 0) { break block716 } } $1_1 = 1; continue; } $5_1 = 9; $26_1 = -1; $23_1 = -1; break block717; } HEAP32[$0_1 + 180 >> 2] = HEAP32[$0_1 + 180 >> 2] + $32_1; $0_1 = $8_1 + 560 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $13_1; } $1_1 = 0; continue; }; } function $108($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 24 >> 2]; block4 : { block5 : { block1 : { if (!(!$2_1 | ($3 | 0) <= 0)) { $3 = HEAP32[$0_1 + 32 >> 2]; $4_1 = HEAP32[$0_1 + 8 >> 2]; if (($3 | 0) != ($4_1 | 0)) { break block1 } $2_1 = $1_1 >> 31; $3 = HEAP32[$0_1 + 20 >> 2]; block3 : { if ($3) { $3 = $668($3, $4_1, $1_1, $2_1); HEAP32[$0_1 + 32 >> 2] = $3; break block3; } $3 = $33($4_1, $1_1, $2_1); HEAP32[$0_1 + 32 >> 2] = $3; if ($3) { break block3 } $24(HEAP32[$0_1 + 8 >> 2]); $3 = HEAP32[$0_1 + 32 >> 2]; } HEAP32[$0_1 + 8 >> 2] = $3; $2_1 = 1; break block4; } if (($3 | 0) <= 0) { break block5 } $3 = HEAP32[$0_1 + 32 >> 2]; } $13(HEAP32[$0_1 + 20 >> 2], $3); } $3 = $51(HEAP32[$0_1 + 20 >> 2], $1_1, $1_1 >> 31); HEAP32[$0_1 + 32 >> 2] = $3; $2_1 = !$2_1; } if (!$3) { $112($0_1); HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 0; return 7; } HEAP32[$0_1 + 24 >> 2] = $43(HEAP32[$0_1 + 20 >> 2], $3); block7 : { if ($2_1) { break block7 } $1_1 = HEAP32[$0_1 + 8 >> 2]; if (!$1_1) { break block7 } $2_1 = HEAP32[$0_1 + 12 >> 2]; if (!$2_1) { break block7 } wasm2js_memory_copy(HEAP32[$0_1 + 32 >> 2], $1_1, $2_1); } $3 = HEAPU16[$0_1 + 16 >> 1]; if ($3 & 4096) { FUNCTION_TABLE[HEAP32[$0_1 + 36 >> 2]](HEAP32[$0_1 + 8 >> 2]); $3 = HEAPU16[$0_1 + 16 >> 1]; } HEAP16[$0_1 + 16 >> 1] = $3 & 36863; HEAP32[$0_1 + 8 >> 2] = HEAP32[$0_1 + 32 >> 2]; return 0; } function $109($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $10(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 124 >> 2]); HEAP32[$3 + 12 >> 2] = $2_1; HEAP32[$0_1 + 124 >> 2] = $135(HEAP32[$0_1 >> 2], $1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $110($0_1, $1_1, $2_1) { if (HEAPU8[$0_1 + 17 | 0] & 144) { $112($0_1); HEAP16[$0_1 + 16 >> 1] = 4; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1; return; } HEAP16[$0_1 + 16 >> 1] = 4; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1; } function $111($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; if (!$1_1) { $112($0_1); return 0; } $11_1 = HEAP32[$0_1 + 20 >> 2]; block2 : { if (!$11_1) { $10_1 = 1e9; $8_1 = 0; break block2; } $10_1 = HEAP32[$11_1 + 120 >> 2]; $8_1 = $10_1 >> 31; } block6 : { block5 : { block4 : { if (($3 | 0) < 0) { $6_1 = 1; if (($4_1 | 0) == 1) { break block4 } $2_1 = 0; while (1) { $9_1 = 514; if ($2_1 >>> 0 > $10_1 >>> 0 & ($7_1 | 0) >= ($8_1 | 0) | ($7_1 | 0) > ($8_1 | 0)) { break block5 } $6_1 = $1_1 + $2_1 | 0; if (!(HEAPU8[$6_1 + 1 | 0] | HEAPU8[$6_1 | 0])) { break block5 } $2_1 = $2_1 + 2 | 0; $7_1 = $2_1 >>> 0 < 2 ? $7_1 + 1 | 0 : $7_1; continue; }; } $9_1 = $4_1 ? 2 : 16; $6_1 = $4_1 >>> 0 <= 1 ? 1 : $4_1; $7_1 = $3; break block6; } $2_1 = $2080($1_1); $9_1 = 514; break block6; } $6_1 = $4_1; } if (!(($7_1 | 0) <= ($8_1 | 0) & $2_1 >>> 0 <= $10_1 >>> 0 | ($7_1 | 0) < ($8_1 | 0))) { block8 : { if ($5_1 + 1 >>> 0 < 2) { break block8 } if (($5_1 | 0) == 5) { $13($11_1, $1_1); break block8; } FUNCTION_TABLE[$5_1 | 0]($1_1); } $112($0_1); $236(HEAP32[$0_1 + 20 >> 2], 18); return 18; } block11 : { block12 : { if (($5_1 | 0) == -1) { $3 = ($3 | 0) >= 0; $5_1 = $3 ? 0 : ($6_1 | 0) == 1 ? 1 : 2; $4_1 = $7_1; $3 = $2_1 + $5_1 | 0; $4_1 = $3 >>> 0 < $2_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; if ($237($0_1, $3 >>> 0 > 32 & ($4_1 | 0) >= 0 | ($4_1 | 0) > 0 ? $3 : 32)) { break block11 } if (!$3) { break block12 } wasm2js_memory_copy(HEAP32[$0_1 + 8 >> 2], $1_1, $3); break block12; } $204($0_1); HEAP32[$0_1 + 8 >> 2] = $1_1; if (($5_1 | 0) == 5) { HEAP32[$0_1 + 32 >> 2] = $1_1; HEAP32[$0_1 + 24 >> 2] = $43(HEAP32[$0_1 + 20 >> 2], $1_1); break block12; } HEAP32[$0_1 + 36 >> 2] = $5_1; $9_1 = ($5_1 ? 4096 : 8192) | $9_1; } HEAP8[$0_1 + 18 | 0] = $6_1; HEAP16[$0_1 + 16 >> 1] = $9_1; $1_1 = $2_1 & 2147483647; HEAP32[$0_1 + 12 >> 2] = $1_1; block14 : { if ($6_1 >>> 0 < 2 | $1_1 >>> 0 < 2) { break block14 } $2_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAPU8[$2_1 + 1 | 0]; $2_1 = HEAPU8[$2_1 | 0]; if (($2_1 | 0) != 255 | ($1_1 | 0) != 254) { if (($2_1 | 0) != 254 | ($1_1 | 0) != 255) { break block14 } $6_1 = 3; } else { $6_1 = 2 } if ($223($0_1)) { break block11 } $1_1 = HEAP32[$0_1 + 12 >> 2] - 2 | 0; HEAP32[$0_1 + 12 >> 2] = $1_1; if ($1_1) { $2_1 = HEAP32[$0_1 + 8 >> 2]; wasm2js_memory_copy($2_1, $2_1 + 2 | 0, $1_1); } HEAP8[HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0] = 0; HEAP8[(HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0) + 1 | 0] = 0; HEAP8[$0_1 + 18 | 0] = $6_1; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 512; } return 0; } return 7; } function $112($0_1) { if (HEAPU8[$0_1 + 17 | 0] & 144) { $242($0_1); return; } HEAP16[$0_1 + 16 >> 1] = 1; } function $113($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $105(HEAP32[$0_1 >> 2], $2_1 + 8 | 0); $3 = HEAP32[$2_1 + 8 >> 2]; $4_1 = HEAP32[$1_1 + 136 >> 2]; $3 = __wasm_i64_mul($3 - $4_1 | 0, HEAP32[$2_1 + 12 >> 2] - (HEAP32[$1_1 + 140 >> 2] + ($3 >>> 0 < $4_1 >>> 0) | 0) | 0, 1e6, 0); HEAP32[$2_1 >> 2] = $3; $4_1 = i64toi32_i32$HIGH_BITS; HEAP32[$2_1 + 4 >> 2] = $4_1; $5_1 = HEAP32[$0_1 + 220 >> 2]; if ($5_1) { FUNCTION_TABLE[$5_1 | 0](HEAP32[$0_1 + 224 >> 2], HEAP32[$1_1 + 200 >> 2], $3, $4_1) } if (HEAPU8[$0_1 + 94 | 0] & 2) { FUNCTION_TABLE[HEAP32[$0_1 + 212 >> 2]](2, HEAP32[$0_1 + 216 >> 2], $1_1, $2_1) | 0 } HEAP32[$1_1 + 136 >> 2] = 0; HEAP32[$1_1 + 140 >> 2] = 0; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $114($0_1, $1_1) { var $2_1 = 0; block1 : { if (!$1_1) { $2_1 = 0; if (!HEAPU8[$0_1 + 87 | 0]) { break block1 } } __inlined_func$202$31 : { if (!(!HEAPU8[$0_1 + 87 | 0] & ($1_1 | 0) != 3082)) { $136($0_1); $122($0_1, 7); $2_1 = 7; break __inlined_func$202$31; } $2_1 = HEAP32[$0_1 + 72 >> 2] & $1_1; } } return $2_1; } function $116($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$1_1) { break block } $2_1 = $2080($1_1) + 1 | 0; $0_1 = $51($0_1, $2_1, 0); if (!$0_1) { break block } if ($2_1) { wasm2js_memory_copy($0_1, $1_1, $2_1) } $3 = $0_1; } return $3; } function $117($0_1, $1_1) { var $2_1 = 0; if ($0_1) { $2_1 = HEAP32[$0_1 + 120 >> 2]; if (!(!$2_1 | HEAPU16[$0_1 + 144 >> 1] <= $1_1 >>> 0)) { return Math_imul($1_1, 40) + $2_1 | 0 } $122(HEAP32[$0_1 >> 2], 25); } return 34824; } function $118($0_1) { if ($0_1) { HEAP32[$0_1 + 36 >> 2] = $114(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 36 >> 2]) } } function $119($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$0_1 + 151 | 0] == 2) { $201($0_1) } block1 : { if (HEAP32[$0_1 + 32 >> 2] < 0) { break block1 } if (HEAP32[$1_1 + 288 >> 2] | HEAP32[$0_1 + 124 >> 2]) { $104($0_1); break block1; } HEAP32[$1_1 + 64 >> 2] = HEAP32[$0_1 + 36 >> 2]; } $2_1 = HEAP32[$0_1 + 124 >> 2]; if ($2_1) { $13($1_1, $2_1); HEAP32[$0_1 + 124 >> 2] = 0; } HEAP32[$0_1 + 120 >> 2] = 0; return HEAP32[$1_1 + 72 >> 2] & HEAP32[$0_1 + 36 >> 2]; } function $120($0_1) { HEAP32[$0_1 + 36 >> 2] = 0; HEAP8[$0_1 + 151 | 0] = 1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; HEAP16[$0_1 + 148 >> 1] = 65282; HEAP32[$0_1 + 28 >> 2] = 1; HEAP32[$0_1 + 32 >> 2] = -1; HEAP32[$0_1 + 64 >> 2] = 0; HEAP32[$0_1 + 68 >> 2] = 0; HEAP32[$0_1 + 48 >> 2] = 0; } function $121($0_1) { block3 : { if ($0_1) { if (HEAPU8[$0_1 + 97 | 0] == 118) { return 1 } if (!$347($0_1)) { break block3 } $0_1 = 16043; } else { $0_1 = 20315 } $348($0_1); } return 0; } function $122($0_1, $1_1) { var $2_1 = 0; HEAP32[$0_1 + 64 >> 2] = $1_1; if ($1_1 | HEAP32[$0_1 + 288 >> 2]) { $2_1 = HEAP32[$0_1 + 288 >> 2]; if ($2_1) { $112($2_1) } $133($0_1, $1_1); return; } HEAP32[$0_1 + 68 >> 2] = -1; } function $123($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $277($0_1, $1_1) | 0; } function $124($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $1_1 = $53($117($0_1, $1_1)); $118($0_1); return $1_1 | 0; } function $125($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $1_1 = HEAPU16[$117($0_1, $1_1) + 16 >> 1]; $118($0_1); return HEAPU8[($1_1 & 63) + 31328 | 0]; } function $126($0_1) { var $1_1 = 0; if (HEAPU8[$0_1 + 151 | 0]) { $1_1 = $119($0_1) } else { $1_1 = 0 } $7($0_1); return $1_1; } function $127($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = 1162; block : { if (!$0_1) { break block } block2 : { if (!$347($0_1)) { $1_1 = $1(184181); break block2; } if (HEAPU8[$0_1 + 87 | 0]) { break block } $1_1 = 0; if (!HEAP32[$0_1 + 64 >> 2]) { break block2 } $1_1 = $53(HEAP32[$0_1 + 288 >> 2]); if ($1_1) { break block } $1_1 = HEAP32[$0_1 + 64 >> 2]; } $1_1 = $256($1_1); } return $1_1 | 0; } function $128($0_1) { var $1_1 = 0; if (HEAPU8[$0_1 + 28 | 0] & 32) { $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$1_1 + 128 >> 2] = HEAP32[$1_1 + 128 >> 2] - 1; HEAP32[$0_1 + 16 >> 2] = HEAP32[$1_1 + 144 >> 2]; HEAP32[$1_1 + 144 >> 2] = $0_1; return; } $501($0_1); } function $129($0_1) { var $1_1 = 0; if (!HEAP32[$0_1 >> 2]) { $64(21, 2910, 0); $1_1 = 1; } return $1_1; } function $130($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (HEAPU8[$0_1 + 97 | 0] != 167) { break block } if ($192($0_1)) { break block } $193($0_1, 0); $194($0_1); while (1) { $2_1 = HEAP32[$0_1 + 16 >> 2]; if (!(HEAP32[$0_1 + 20 >> 2] <= ($1_1 | 0))) { $3 = $2_1 + ($1_1 << 4) | 0; $2_1 = HEAP32[$3 + 4 >> 2]; block2 : { if (!$2_1) { break block2 } $195($2_1); HEAP32[$3 + 4 >> 2] = 0; if (($1_1 | 0) == 1) { break block2 } HEAP32[$3 + 12 >> 2] = 0; } $1_1 = $1_1 + 1 | 0; continue; } break; }; $2_1 = HEAP32[$2_1 + 28 >> 2]; if ($2_1) { $158($2_1) } $159($0_1); $160($0_1); $3 = $0_1 + 424 | 0; while (1) { $3 = HEAP32[$3 >> 2]; if ($3) { $1_1 = HEAP32[$3 + 8 >> 2]; while (1) { $196($0_1, $1_1); $2_1 = HEAP32[$1_1 + 12 >> 2]; $10($0_1, $1_1); $1_1 = $2_1; if ($1_1) { continue } break; }; continue; } break; }; $197($0_1 + 416 | 0); $4_1 = $0_1 + 440 | 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $5_1 = HEAP32[$4_1 + 8 >> 2]; $1_1 = 0; while (1) { if (($1_1 | 0) != 3) { $3 = Math_imul($1_1, 20) + $5_1 | 0; $2_1 = HEAP32[$3 + 16 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0](HEAP32[$3 + 8 >> 2]) } $1_1 = $1_1 + 1 | 0; continue; } break; }; $10($0_1, $5_1); continue; } break; }; $197($0_1 + 432 | 0); $1_1 = $0_1 + 396 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $2_1 = HEAP32[$1_1 + 8 >> 2]; $198($0_1, $2_1); $199($0_1, $2_1); continue; } break; }; $197($0_1 + 388 | 0); $122($0_1, 0); $200(HEAP32[$0_1 + 288 >> 2]); HEAP8[$0_1 + 97 | 0] = 213; $10($0_1, HEAP32[HEAP32[$0_1 + 16 >> 2] + 28 >> 2]); $2_1 = HEAP32[$0_1 + 256 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0](HEAP32[$0_1 + 252 >> 2]) } HEAP8[$0_1 + 97 | 0] = 206; if (HEAPU8[$0_1 + 312 | 0]) { $24(HEAP32[$0_1 + 352 >> 2]) } $24($0_1); } } function $131($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$0_1 + 64 >> 2] = $1_1; $133($0_1, $1_1); block1 : { if (!$2_1) { $122($0_1, $1_1); break block1; } if (!HEAP32[$0_1 + 288 >> 2]) { $1_1 = $134($0_1); HEAP32[$0_1 + 288 >> 2] = $1_1; if (!$1_1) { break block1 } } HEAP32[$4_1 + 12 >> 2] = $3; $1_1 = $135($0_1, $2_1, $3); $137(HEAP32[$0_1 + 288 >> 2], $1_1, 5); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $132($0_1, $1_1) { $1_1 = $30($0_1, $1_1); if (!(!$1_1 | !$0_1)) { wasm2js_memory_fill($1_1, 0, $0_1) } return $1_1; } function $133($0_1, $1_1) { var $2_1 = 0; if (!(($1_1 | 0) == 3082 | ($1_1 & 251) != 10)) { $2_1 = $0_1; $1_1 = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$1_1 + 68 >> 2]; if ($0_1) { $0_1 = FUNCTION_TABLE[$0_1 | 0]($1_1, 0, 0) | 0 } else { $0_1 = 0 } HEAP32[$2_1 + 76 >> 2] = $0_1; } } function $134($0_1) { var $1_1 = 0; $1_1 = $270($0_1, 40, 0); if ($1_1) { HEAP32[$1_1 + 20 >> 2] = $0_1; HEAP16[$1_1 + 16 >> 1] = 1; } return $1_1; } function $135($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 112 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$0_1 + 120 >> 2]; HEAP16[$3 + 28 >> 1] = 256; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 20 >> 2] = $4_1; HEAP32[$3 + 16 >> 2] = 70; HEAP32[$3 + 8 >> 2] = $0_1; HEAP32[$3 + 12 >> 2] = $3 + 32; $4_1 = $3 + 8 | 0; $35($4_1, $1_1, $2_1); $1_1 = $57($4_1); if (HEAPU8[$3 + 28 | 0] == 7) { $106($0_1) } $0_1 = $3 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $136($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; if (!(HEAP32[$0_1 + 196 >> 2] | !HEAPU8[$0_1 + 87 | 0])) { HEAP32[$0_1 + 296 >> 2] = 0; HEAP8[$0_1 + 87 | 0] = 0; $1_1 = HEAP32[$0_1 + 304 >> 2] - 1 | 0; HEAP32[$0_1 + 304 >> 2] = $1_1; HEAP16[$0_1 + 308 >> 1] = $1_1 ? $2_1 : HEAPU16[$0_1 + 310 >> 1]; } } function $137($0_1, $1_1, $2_1) { if ($0_1) { $111($0_1, $1_1, -1, -1, 1, $2_1) } } function $139($0_1, $1_1) { wasm2js_memory_fill($0_1 + 4 | 0, 0, 164); wasm2js_memory_fill($0_1 + 212 | 0, 0, 76); HEAP32[$0_1 + 200 >> 2] = HEAP32[$1_1 + 264 >> 2]; HEAP32[$1_1 + 264 >> 2] = $0_1; HEAP32[$0_1 >> 2] = $1_1; if (HEAPU8[$1_1 + 87 | 0]) { $257($0_1, 1162, 0) } } function $140($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = HEAP32[$0_1 >> 2]; block : { if (HEAP32[HEAP32[$2_1 + 16 >> 2] + 20 >> 2] | HEAPU8[$0_1 + 223 | 0]) { break block } $3 = $410(HEAP32[$2_1 >> 2], 0, $2_1, $1_1 + 12 | 0, 0, 542); block2 : { if ($3) { $257($0_1, 5490, 0); HEAP32[$0_1 + 12 >> 2] = $3; break block2; } $0_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[HEAP32[$2_1 + 16 >> 2] + 20 >> 2] = $0_1; if (($144($0_1, HEAP32[$2_1 + 100 >> 2], 0, 0) | 0) != 7) { break block } $106($2_1); } $4_1 = 1; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $141($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 124 >> 2]; if ($1_1) { $16($2_1, $1_1) } while (1) { $1_1 = HEAP32[$0_1 + 144 >> 2]; if ($1_1) { HEAP32[$0_1 + 144 >> 2] = HEAP32[$1_1 >> 2]; FUNCTION_TABLE[HEAP32[$1_1 + 8 >> 2]]($2_1, HEAP32[$1_1 + 4 >> 2]); $16($2_1, $1_1); continue; } break; }; $1_1 = HEAP32[$0_1 + 68 >> 2]; if ($1_1) { $16($2_1, $1_1) } $1_1 = HEAP32[$0_1 + 72 >> 2]; if ($1_1) { $333($2_1, $1_1) } $3 = HEAP32[$2_1 + 304 >> 2]; $4_1 = HEAPU8[$0_1 + 24 | 0]; HEAP32[$2_1 + 304 >> 2] = $3 - $4_1; $1_1 = 0; HEAP16[$2_1 + 308 >> 1] = ($3 | 0) == ($4_1 | 0) ? HEAPU16[$2_1 + 310 >> 1] : $1_1; HEAP32[$2_1 + 264 >> 2] = HEAP32[$0_1 + 200 >> 2]; } function $143($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; block1 : { block : { if (HEAPU8[$0_1 + 9 | 0]) { break block } $4_1 = HEAPU8[$0_1 + 8 | 0]; if (!$4_1) { break block } if (!$1_1 | ($4_1 | 0) != 1) { break block1 } } $4_1 = $0_1; $9_1 = $1_1; $12_1 = $2_1; $10_1 = global$0 - 16 | 0; $0_1 = $10_1; if (global$4 >>> 0 < $0_1 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $3 = HEAP32[$4_1 + 4 >> 2]; $0_1 = HEAP32[$4_1 >> 2]; HEAP32[$3 + 4 >> 2] = $0_1; $5_1 = HEAP32[$3 >> 2]; block4 : { block0 : { $1_1 = HEAPU8[$4_1 + 8 | 0]; if (($1_1 | 0) == 2 | !$9_1 & ($1_1 | 0) == 1) { break block0 } if (!(HEAPU8[$5_1 + 14 | 0] | !(HEAPU8[$0_1 + 35 | 0] & 2))) { HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] & 65534 } $0_1 = HEAPU16[$3 + 24 >> 1]; if (!(!$9_1 | !($0_1 & 1))) { $1_1 = 8; break block4; } block7 : { block8 : { block6 : { if ($9_1) { if ($0_1 & 128 | HEAPU8[$3 + 20 | 0] == 2) { break block6 } if (($9_1 | 0) < 2) { break block7 } $0_1 = $3 + 76 | 0; while (1) { $1_1 = HEAP32[$0_1 >> 2]; if (!$1_1) { break block7 } $0_1 = $1_1 + 12 | 0; $1_1 = HEAP32[$1_1 >> 2]; if (($1_1 | 0) == ($4_1 | 0)) { continue } break; }; break block8; } if (!($0_1 & 128)) { break block7 } } $1_1 = HEAP32[$3 + 80 >> 2]; } if (!HEAP32[$1_1 >> 2]) { break block7 } $1_1 = 262; break block4; } $1_1 = $610($4_1, 1, 1); if ($1_1) { break block4 } $0_1 = HEAPU16[$3 + 24 >> 1]; HEAP16[$3 + 24 >> 1] = $0_1 & 65519; if (!HEAP32[$3 + 48 >> 2]) { HEAP16[$3 + 24 >> 1] = $0_1 | 16 } $13_1 = $3 + 36 | 0; $0_1 = 0; while (1) { block11 : { block21 : { if (!HEAP32[$3 + 12 >> 2]) { $1_1 = $611(HEAP32[$3 >> 2]); if ($1_1) { break block11 } $1_1 = $189($3, 1, $10_1 + 12 | 0, 0); if ($1_1) { break block11 } $7_1 = HEAP32[$3 >> 2]; $2_1 = HEAP32[$7_1 + 28 >> 2]; $11_1 = HEAP32[$10_1 + 12 >> 2]; $6_1 = HEAP32[$11_1 + 56 >> 2]; $0_1 = $156($6_1 + 28 | 0); block13 : { if ($0_1) { if ((HEAPU8[$6_1 + 24 | 0] | HEAPU8[$6_1 + 25 | 0] << 8 | (HEAPU8[$6_1 + 26 | 0] << 16 | HEAPU8[$6_1 + 27 | 0] << 24)) == (HEAPU8[$6_1 + 92 | 0] | HEAPU8[$6_1 + 93 | 0] << 8 | (HEAPU8[$6_1 + 94 | 0] << 16 | HEAPU8[$6_1 + 95 | 0] << 24))) { break block13 } } $0_1 = $2_1; } block17 : { block20 : { block16 : { if ($0_1 ? HEAPU8[HEAP32[$3 + 4 >> 2] + 35 | 0] & 2 : 1) { $7_1 = HEAP32[$3 + 40 >> 2]; $0_1 = 0; break block16; } $1_1 = 26; if ($2014($6_1, 33632, 16)) { break block17 } if (HEAPU8[$6_1 + 18 | 0] >= 3) { HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] | 1 } $8_1 = HEAPU8[$6_1 + 19 | 0]; if ($8_1 >>> 0 > 2) { break block17 } block19 : { if (HEAPU8[$3 + 24 | 0] & 32 | ($8_1 | 0) != 2) { break block19 } HEAP32[$10_1 + 8 >> 2] = 0; $7_1 = $612($7_1, $10_1 + 8 | 0); if ($7_1) { break block20 } if (HEAP32[$10_1 + 8 >> 2]) { break block19 } $191($11_1); $1_1 = 0; break block21; } if ($2014($6_1 + 21 | 0, 30779, 3)) { break block17 } $8_1 = HEAPU8[$6_1 + 17 | 0] << 16 | HEAPU8[$6_1 + 16 | 0] << 8; if ($8_1 - 1 & $8_1 | $8_1 >>> 0 > 65536 | $8_1 >>> 0 < 257) { break block17 } $14 = HEAPU8[$6_1 + 20 | 0]; $7_1 = $8_1 - $14 | 0; if (HEAP32[$13_1 >> 2] != ($8_1 | 0)) { $191($11_1); HEAP32[$3 + 36 >> 2] = $8_1; HEAP32[$3 + 40 >> 2] = $7_1; HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] | 2; $424($3); $1_1 = $425(HEAP32[$3 >> 2], $13_1, $14); break block21; } block23 : { if ($0_1 >>> 0 <= $2_1 >>> 0) { break block23 } $0_1 = $2_1; if ((HEAP32[HEAP32[$3 + 4 >> 2] + 32 >> 2] & 268435457) == 1) { break block23 } $1_1 = $181(74173); break block17; } if ($7_1 >>> 0 < 480) { break block17 } HEAP32[$3 + 40 >> 2] = $7_1; HEAP32[$3 + 36 >> 2] = $8_1; HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] | 2; HEAP8[$3 + 17 | 0] = ($156($6_1 + 52 | 0) | 0) != 0; HEAP8[$3 + 18 | 0] = ($156($6_1 - -64 | 0) | 0) != 0; } HEAP32[$3 + 48 >> 2] = $0_1; HEAP32[$3 + 12 >> 2] = $11_1; HEAP16[$3 + 30 >> 1] = $7_1 - 35; $0_1 = ((($7_1 << 5) - 384 >>> 0) / 255 | 0) - 23 | 0; HEAP16[$3 + 32 >> 1] = $0_1; HEAP16[$3 + 28 >> 1] = $0_1; $0_1 = ((($7_1 << 6) - 768 >>> 0) / 255 | 0) - 23 | 0; HEAP16[$3 + 26 >> 1] = $0_1; $0_1 = $0_1 & 65535; HEAP8[$3 + 21 | 0] = $0_1 >>> 0 >= 127 ? 127 : $0_1; $1_1 = 0; break block21; } $1_1 = $7_1; } $191($11_1); HEAP32[$3 + 12 >> 2] = 0; break block11; } block31 : { block26 : { block25 : { if (!$9_1) { $1_1 = $0_1; break block25; } $1_1 = $0_1; if ($0_1) { break block25 } $1_1 = 8; if (HEAP8[$3 + 24 | 0] & 1) { break block11 } $1_1 = HEAP32[$5_1 + 44 >> 2]; if ($1_1) { break block26 } HEAP8[$5_1 + 22 | 0] = HEAPU8[HEAP32[$4_1 >> 2] + 86 | 0] == 2; if (HEAPU8[$5_1 + 17 | 0] == 1) { $0_1 = HEAP32[$5_1 + 232 >> 2]; block30 : { if ($0_1) { if (!(HEAPU8[$0_1 + 43 | 0] | !HEAPU8[$5_1 + 4 | 0])) { $1_1 = $576($5_1, 4); if ($1_1) { break block26 } $586(HEAP32[$5_1 + 232 >> 2], 1); $0_1 = HEAP32[$5_1 + 232 >> 2]; } $1_1 = 8; if (HEAPU8[$0_1 + 46 | 0]) { break block11 } $1_1 = $539($0_1, 0, 1); if ($1_1) { break block26 } HEAP8[$0_1 + 44 | 0] = 1; if (!$2014($0_1 + 52 | 0, HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2], 48)) { break block30 } $541($0_1, 0, 1); HEAP8[$0_1 + 44 | 0] = 0; break block31; } $1_1 = $576($5_1, 2); if (!($1_1 | ($9_1 | 0) < 2)) { $1_1 = $575($5_1, 4) } if ($1_1) { break block26 } } HEAP8[$5_1 + 17 | 0] = 2; HEAP32[$5_1 + 80 >> 2] = 0; HEAP32[$5_1 + 84 >> 2] = 0; $0_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$5_1 + 40 >> 2] = $0_1; HEAP32[$5_1 + 36 >> 2] = $0_1; HEAP32[$5_1 + 32 >> 2] = $0_1; } $1_1 = $146($3); } if ($1_1) { break block11 } block33 : { if (HEAPU8[$4_1 + 8 | 0]) { break block33 } HEAP32[$3 + 44 >> 2] = HEAP32[$3 + 44 >> 2] + 1; if (!HEAPU8[$4_1 + 9 | 0]) { break block33 } HEAP8[$4_1 + 40 | 0] = 1; HEAP32[$4_1 + 44 >> 2] = HEAP32[$3 + 76 >> 2]; HEAP32[$3 + 76 >> 2] = $4_1 + 32; } $0_1 = $9_1 ? 2 : 1; HEAP8[$4_1 + 8 | 0] = $0_1; if (HEAPU8[$3 + 20 | 0] < $0_1 >>> 0) { HEAP8[$3 + 20 | 0] = $0_1 } if (!$9_1) { break block0 } HEAP32[$3 + 80 >> 2] = $4_1; HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] & 65471 | (($9_1 | 0) > 1 ? 64 : 0); $0_1 = HEAP32[$3 + 12 >> 2]; if (HEAP32[$3 + 48 >> 2] == ($156(HEAP32[$0_1 + 56 >> 2] + 28 | 0) | 0)) { break block0 } $1_1 = $150(HEAP32[$0_1 + 72 >> 2]); if ($1_1) { break block4 } $0_1 = HEAP32[$0_1 + 56 >> 2]; $1_1 = HEAP32[$3 + 48 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$0_1 + 28 | 0] = $1_1; HEAP8[$0_1 + 29 | 0] = $1_1 >>> 8; HEAP8[$0_1 + 30 | 0] = $1_1 >>> 16; HEAP8[$0_1 + 31 | 0] = $1_1 >>> 24; break block0; } if (($1_1 | 0) != 517) { break block11 } } $1_1 = HEAPU8[$3 + 20 | 0] ? 517 : 5; break block11; } $0_1 = 0; if (!$1_1) { continue } } $613($3); if (HEAPU8[$3 + 20 | 0] | ($1_1 & 255) != 5) { break block4 } $0_1 = $1_1; if ($511($3)) { continue } break; }; break block4; } if ($12_1) { HEAP32[$12_1 >> 2] = $156(HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2] + 40 | 0) } if (!$9_1) { $1_1 = 0; break block4; } $1_1 = $157($5_1, HEAP32[HEAP32[$4_1 >> 2] + 504 >> 2]); } $0_1 = $10_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } $4_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1) { HEAP32[$2_1 >> 2] = $156(HEAP32[HEAP32[$4_1 + 12 >> 2] + 56 >> 2] + 40 | 0) } if (!$1_1) { return 0 } return $157(HEAP32[$4_1 >> 2], HEAP32[HEAP32[$0_1 >> 2] + 504 >> 2]); } function $144($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$0_1 + 4 >> 2]; HEAP8[$0_1 + 22 | 0] = $2_1; HEAP32[$0_1 + 4 >> 2] = $4_1; $4_1 = 8; block : { if (HEAPU8[$0_1 + 24 | 0] & 2) { break block } $4_1 = HEAP32[$0_1 + 36 >> 2] - HEAP32[$0_1 + 40 >> 2] | 0; $2_1 = ($2_1 | 0) > ($4_1 | 0) ? $2_1 : $4_1; $4_1 = $0_1 + 36 | 0; if (!($1_1 + 131071 & $1_1 | $1_1 - 512 >>> 0 > 65024)) { HEAP32[$0_1 + 36 >> 2] = ($1_1 | 0) == 512 ? (($2_1 | 0) > 32 ? 1024 : $1_1) : $1_1; $424($0_1); } $4_1 = $425(HEAP32[$0_1 >> 2], $4_1, $2_1); HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 36 >> 2] - ($2_1 & 65535); if (!$3) { break block } HEAP16[$0_1 + 24 >> 1] = HEAPU16[$0_1 + 24 >> 1] | 2; } return $4_1; } function $145($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0; $8_1 = global$0 - 16 | 0; $4_1 = $8_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = HEAP32[HEAP32[HEAP32[$0_1 + 24 >> 2] + 4 >> 2] + 36 >> 2]; $5_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2]; $9_1 = HEAP32[$5_1 + 36 >> 2]; $14 = ($4_1 | 0) < ($9_1 | 0) ? $4_1 : $9_1; $16_1 = $4_1; $10_1 = $4_1 >> 31; $11_1 = __wasm_i64_mul($4_1, $10_1, $1_1, 0); $1_1 = $11_1 - $4_1 | 0; $12_1 = i64toi32_i32$HIGH_BITS; $4_1 = $12_1 - (($4_1 >>> 0 > $11_1 >>> 0) + $10_1 | 0) | 0; $15_1 = HEAP32[$5_1 >> 2]; $13_1 = $9_1 >> 31; $5_1 = 0; while (1) { if (!(($4_1 | 0) >= ($12_1 | 0) & $1_1 >>> 0 >= $11_1 >>> 0 | ($4_1 | 0) > ($12_1 | 0) | $5_1)) { $5_1 = 0; HEAP32[$8_1 + 12 >> 2] = 0; $6_1 = HEAPU32[18884] / HEAPU32[HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2] + 36 >> 2] | 0; $7_1 = __wasm_i64_sdiv($1_1, $4_1, $9_1, $13_1); $17_1 = i64toi32_i32$HIGH_BITS; if (($6_1 | 0) != ($7_1 | 0)) { $5_1 = FUNCTION_TABLE[HEAP32[$15_1 + 220 >> 2]]($15_1, $7_1 + 1 | 0, $8_1 + 12 | 0, 0) | 0; block2 : { if ($5_1) { break block2 } $5_1 = $150(HEAP32[$8_1 + 12 >> 2]); if ($5_1) { break block2 } $5_1 = __wasm_i64_srem($1_1, $4_1, $16_1, $10_1); $7_1 = HEAP32[HEAP32[$8_1 + 12 >> 2] + 4 >> 2] + ($1_1 - __wasm_i64_mul($7_1, $17_1, $9_1, $13_1) | 0) | 0; if ($14) { wasm2js_memory_copy($7_1, $2_1 + $5_1 | 0, $14) } $5_1 = 0; HEAP8[HEAP32[HEAP32[$8_1 + 12 >> 2] + 8 >> 2]] = 0; if ($1_1 | $4_1 | $3) { break block2 } $6_1 = HEAP32[HEAP32[HEAP32[$0_1 + 24 >> 2] + 4 >> 2] + 48 >> 2]; $6_1 = $6_1 << 24 | ($6_1 & 65280) << 8 | ($6_1 >>> 8 & 65280 | $6_1 >>> 24); HEAP8[$7_1 + 28 | 0] = $6_1; HEAP8[$7_1 + 29 | 0] = $6_1 >>> 8; HEAP8[$7_1 + 30 | 0] = $6_1 >>> 16; HEAP8[$7_1 + 31 | 0] = $6_1 >>> 24; } $99(HEAP32[$8_1 + 12 >> 2]); } $4_1 = $4_1 + $13_1 | 0; $1_1 = $1_1 + $9_1 | 0; $4_1 = $1_1 >>> 0 < $9_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $146($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (HEAP32[$0_1 + 48 >> 2]) { break block } $5_1 = HEAP32[$0_1 + 12 >> 2]; $1_1 = HEAP32[$5_1 + 56 >> 2]; $6_1 = $150(HEAP32[$5_1 + 72 >> 2]); if ($6_1) { break block } $6_1 = 0; $3 = HEAP32[8411]; $2_1 = $1_1 + 8 | 0; $4_1 = HEAP32[8410]; HEAP8[$2_1 | 0] = $4_1; HEAP8[$2_1 + 1 | 0] = $4_1 >>> 8; HEAP8[$2_1 + 2 | 0] = $4_1 >>> 16; HEAP8[$2_1 + 3 | 0] = $4_1 >>> 24; HEAP8[$2_1 + 4 | 0] = $3; HEAP8[$2_1 + 5 | 0] = $3 >>> 8; HEAP8[$2_1 + 6 | 0] = $3 >>> 16; HEAP8[$2_1 + 7 | 0] = $3 >>> 24; $2_1 = HEAP32[8409]; $3 = HEAP32[8408]; HEAP8[$1_1 | 0] = $3; HEAP8[$1_1 + 1 | 0] = $3 >>> 8; HEAP8[$1_1 + 2 | 0] = $3 >>> 16; HEAP8[$1_1 + 3 | 0] = $3 >>> 24; HEAP8[$1_1 + 4 | 0] = $2_1; HEAP8[$1_1 + 5 | 0] = $2_1 >>> 8; HEAP8[$1_1 + 6 | 0] = $2_1 >>> 16; HEAP8[$1_1 + 7 | 0] = $2_1 >>> 24; HEAP8[$1_1 + 16 | 0] = HEAP32[$0_1 + 36 >> 2] >>> 8; HEAP8[$1_1 + 17 | 0] = HEAPU16[$0_1 + 38 >> 1]; HEAP8[$1_1 + 18 | 0] = 1; HEAP8[$1_1 + 19 | 0] = 1; $2_1 = HEAP32[$0_1 + 40 >> 2]; $3 = HEAP32[$0_1 + 36 >> 2]; HEAP8[$1_1 + 21 | 0] = 64; HEAP8[$1_1 + 22 | 0] = 32; HEAP8[$1_1 + 23 | 0] = 32; HEAP8[$1_1 + 20 | 0] = $3 - $2_1; wasm2js_memory_fill($1_1 + 24 | 0, 0, 76); $615($5_1, 13); HEAP16[$0_1 + 24 >> 1] = HEAPU16[$0_1 + 24 >> 1] | 2; HEAP8[$1_1 + 55 | 0] = HEAPU8[$0_1 + 17 | 0]; HEAP8[$1_1 + 54 | 0] = 0; HEAP8[$1_1 + 52 | 0] = 0; HEAP8[$1_1 + 53 | 0] = 0; HEAP8[$1_1 + 67 | 0] = HEAPU8[$0_1 + 18 | 0]; HEAP8[$1_1 + 66 | 0] = 0; HEAP8[$1_1 + 64 | 0] = 0; HEAP8[$1_1 + 65 | 0] = 0; HEAP32[$0_1 + 48 >> 2] = 1; HEAP8[$1_1 + 31 | 0] = 1; } return $6_1; } function $147($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$4_1 + 12 >> 2]; $3 = HEAP32[$0_1 + 56 >> 2]; $5_1 = $150(HEAP32[$0_1 + 72 >> 2]); block : { if ($5_1) { break block } $0_1 = (($1_1 << 2) + $3 | 0) + 36 | 0; $3 = $2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24); HEAP8[$0_1 | 0] = $3; HEAP8[$0_1 + 1 | 0] = $3 >>> 8; HEAP8[$0_1 + 2 | 0] = $3 >>> 16; HEAP8[$0_1 + 3 | 0] = $3 >>> 24; if (($1_1 | 0) != 7) { break block } HEAP8[$4_1 + 18 | 0] = $2_1; } return $5_1; } function $148($0_1) { var $1_1 = 0, $2_1 = 0; $4($0_1); while (1) { if (!(HEAP32[$0_1 + 20 >> 2] <= ($2_1 | 0))) { $1_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($2_1 << 4) | 0) + 12 >> 2]; block1 : { if (!$1_1) { break block1 } if (!HEAP32[$0_1 + 56 >> 2]) { $158($1_1); break block1; } HEAP16[$1_1 + 78 >> 1] = HEAPU16[$1_1 + 78 >> 1] | 8; } $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] & -18; $159($0_1); if (!HEAP32[$0_1 + 56 >> 2]) { $160($0_1) } } function $149($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 4 >> 2]; HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] & 65503 | (($1_1 | 0) == 1 ? 32 : 0); $2_1 = $143($0_1, 0, 0); block : { if ($2_1) { break block } $4_1 = HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2]; if (($1_1 | 0) == HEAPU8[$4_1 + 18 | 0]) { $2_1 = 0; if (HEAPU8[$4_1 + 19 | 0] == ($1_1 | 0)) { break block } } $2_1 = $143($0_1, 2, 0); if ($2_1) { break block } $2_1 = $150(HEAP32[HEAP32[$3 + 12 >> 2] + 72 >> 2]); if ($2_1) { break block } HEAP8[$4_1 + 19 | 0] = $1_1; HEAP8[$4_1 + 18 | 0] = $1_1; $2_1 = 0; } HEAP16[$3 + 24 >> 1] = HEAPU16[$3 + 24 >> 1] & 65503; return $2_1; } function $150($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; if (!(!(HEAPU8[$0_1 + 28 | 0] & 4) | HEAPU32[$1_1 + 28 >> 2] < HEAPU32[$0_1 + 24 >> 2])) { if (!HEAP32[$1_1 + 104 >> 2]) { return 0 } return $161($0_1); } $2_1 = HEAP32[$1_1 + 44 >> 2]; if (!$2_1) { if (HEAPU32[$1_1 + 156 >> 2] > HEAPU32[$1_1 + 168 >> 2]) { $6_1 = global$0 - 16 | 0; $1_1 = $6_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP8[$1_1 + 21 | 0] = HEAPU8[$1_1 + 21 | 0] | 4; $4_1 = HEAP32[$0_1 + 24 >> 2]; $3 = __wasm_i64_sdiv(HEAP32[$1_1 + 156 >> 2], 0, HEAP32[$1_1 + 168 >> 2], HEAP32[$1_1 + 172 >> 2]); $2_1 = $4_1 - 1 & 0 - $3; $5_1 = HEAP32[$1_1 + 28 >> 2]; if ($4_1 >>> 0 > $5_1 >>> 0) { $5_1 = $4_1 - $2_1 | 0 } else { $5_1 = $5_1 >>> 0 < $2_1 + $3 >>> 0 ? $5_1 - $2_1 | 0 : $3 } $7_1 = $2_1 + 1 | 0; $2_1 = 0; $4_1 = 0; while (1) { if (!($4_1 | ($2_1 | 0) >= ($5_1 | 0))) { block5 : { block6 : { block4 : { $3 = $2_1 + $7_1 | 0; if (($3 | 0) != HEAP32[$0_1 + 24 >> 2]) { if ($429(HEAP32[$1_1 + 60 >> 2], $3)) { break block4 } } $4_1 = 0; if (($3 | 0) == HEAP32[$1_1 + 164 >> 2]) { break block5 } $4_1 = FUNCTION_TABLE[HEAP32[$1_1 + 220 >> 2]]($1_1, $3, $6_1 + 12 | 0, 0) | 0; if ($4_1) { break block5 } $4_1 = $163(HEAP32[$6_1 + 12 >> 2]); $3 = HEAP32[$6_1 + 12 >> 2]; break block6; } $3 = $594($1_1, $3); HEAP32[$6_1 + 12 >> 2] = $3; $4_1 = 0; if (!$3) { break block5 } } $9_1 = HEAPU16[$3 + 28 >> 1]; $128($3); $8_1 = $9_1 & 8 ? 1 : $8_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; block7 : { if (!$8_1 | $4_1) { break block7 } $2_1 = 0; $3 = ($5_1 | 0) > 0 ? $5_1 : 0; while (1) { if (($2_1 | 0) == ($3 | 0)) { break block7 } $0_1 = $594($1_1, $2_1 + $7_1 | 0); if ($0_1) { HEAP16[$0_1 + 28 >> 1] = HEAPU16[$0_1 + 28 >> 1] | 8; $128($0_1); } $2_1 = $2_1 + 1 | 0; continue; }; } HEAP8[$1_1 + 21 | 0] = HEAPU8[$1_1 + 21 | 0] & 251; $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } $2_1 = $163($0_1); } return $2_1; } function $151($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $6_1 = global$0 - 16 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $3 = HEAP32[$0_1 + 44 >> 2]; block : { if ($3) { break block } $4_1 = HEAP32[18950]; if ($4_1) { $3 = 10; if (FUNCTION_TABLE[$4_1 | 0](400) | 0) { break block } } block2 : { if (HEAPU8[$0_1 + 17 | 0] < 3) { break block2 } block4 : { if (!$164($0_1, 1)) { $165(HEAP32[$0_1 + 96 >> 2]); break block4; } block7 : { if (HEAP32[$0_1 + 232 >> 2]) { HEAP32[$6_1 + 8 >> 2] = 0; $3 = $166(HEAP32[$0_1 + 228 >> 2]); if (!$3) { FUNCTION_TABLE[HEAP32[$0_1 + 220 >> 2]]($0_1, 1, $6_1 + 8 | 0, 0) | 0; $3 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$3 + 16 >> 2] = 0; } $3 = $167($0_1, $3, HEAP32[$0_1 + 28 >> 2], 1); $99(HEAP32[$6_1 + 8 >> 2]); if ($3) { break block7 } $168(HEAP32[$0_1 + 228 >> 2]); break block7; } if (!(HEAPU8[$0_1 + 19 | 0] | !HEAP32[$0_1 + 28 >> 2])) { $3 = FUNCTION_TABLE[HEAP32[$0_1 + 220 >> 2]]($0_1, 1, $6_1 + 8 | 0, 0) | 0; block9 : { if ($3) { break block9 } $3 = $150(HEAP32[$6_1 + 8 >> 2]); if ($3) { break block9 } $169(HEAP32[$6_1 + 8 >> 2]); HEAP8[$0_1 + 19 | 0] = 1; $3 = 0; } $99(HEAP32[$6_1 + 8 >> 2]); if ($3) { break block } } block10 : { if (!$1_1 | HEAPU8[$0_1 + 5 | 0] == 4) { break block10 } $3 = HEAP32[$0_1 + 68 >> 2]; if (!HEAP32[$3 >> 2]) { break block10 } HEAP8[$0_1 + 20 | 0] = 1; while (1) { $4_1 = HEAP8[$1_1 + $7_1 | 0]; if ($4_1) { $7_1 = $7_1 + 1 | 0; $8_1 = $4_1 + $8_1 | 0; continue; } break; }; block13 : { if (!HEAPU8[$0_1 + 8 | 0]) { $5_1 = HEAP32[$0_1 + 80 >> 2]; $4_1 = HEAP32[$0_1 + 84 >> 2]; break block13; } $5_1 = $170($0_1); HEAP32[$0_1 + 80 >> 2] = $5_1; $4_1 = i64toi32_i32$HIGH_BITS; HEAP32[$0_1 + 84 >> 2] = $4_1; } $3 = $171($3, $5_1, $4_1, HEAP32[$0_1 + 164 >> 2]); if ($3) { break block } $3 = HEAP32[$0_1 + 68 >> 2]; $5_1 = $5_1 + 4 | 0; $4_1 = $5_1 >>> 0 < 4 ? $4_1 + 1 | 0 : $4_1; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 12 >> 2]]($3, $1_1, $7_1, $5_1, $4_1) | 0; if ($3) { break block } $3 = HEAP32[$0_1 + 68 >> 2]; $5_1 = $5_1 + $7_1 | 0; $4_1 = $5_1 >>> 0 < $7_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $3 = $171($3, $5_1, $4_1, $7_1); if ($3) { break block } $9_1 = $5_1 + 4 | 0; $3 = $9_1 >>> 0 < 4 ? $4_1 + 1 | 0 : $4_1; $3 = $171(HEAP32[$0_1 + 68 >> 2], $9_1, $3, $8_1); if ($3) { break block } $3 = HEAP32[$0_1 + 68 >> 2]; $5_1 = $5_1 + 8 | 0; $4_1 = $5_1 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 12 >> 2]]($3, 33588, 8, $5_1, $4_1) | 0; if ($3) { break block } $4_1 = HEAP32[$0_1 + 84 >> 2]; $5_1 = $7_1 + 20 | 0; $3 = $5_1; $5_1 = $5_1 + HEAP32[$0_1 + 80 >> 2] | 0; $4_1 = $3 >>> 0 > $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 + 80 >> 2] = $5_1; HEAP32[$0_1 + 84 >> 2] = $4_1; $4_1 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$4_1 >> 2] + 24 >> 2]]($4_1, $6_1 + 8 | 0) | 0; if ($3) { break block } $5_1 = HEAP32[$6_1 + 12 >> 2]; $7_1 = HEAP32[$0_1 + 84 >> 2]; $4_1 = HEAP32[$0_1 + 80 >> 2]; if (($5_1 | 0) <= ($7_1 | 0) & $4_1 >>> 0 >= HEAPU32[$6_1 + 8 >> 2] | ($5_1 | 0) < ($7_1 | 0)) { break block10 } $5_1 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 16 >> 2]]($5_1, $4_1, $7_1) | 0; if ($3) { break block } } $3 = $172($0_1, 0); if ($3) { break block } $3 = $173($0_1, $166(HEAP32[$0_1 + 228 >> 2])); if ($3) { break block } $168(HEAP32[$0_1 + 228 >> 2]); $4_1 = HEAP32[$0_1 + 28 >> 2]; if ($4_1 >>> 0 > HEAPU32[$0_1 + 36 >> 2]) { $3 = $174($0_1, $4_1 - (($4_1 | 0) == HEAP32[$0_1 + 164 >> 2]) | 0); if ($3) { break block } } if ($2_1) { break block4 } $3 = $152($0_1, $1_1); } if ($3) { break block } } if (HEAP32[$0_1 + 232 >> 2]) { break block2 } HEAP8[$0_1 + 17 | 0] = 5; } $3 = 0; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $152($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 64 >> 2]; $3 = HEAP32[$2_1 >> 2]; block1 : { block : { if (!$3) { break block } $1_1 = FUNCTION_TABLE[HEAP32[$3 + 40 >> 2]]($2_1, 21, $1_1) | 0; if (($1_1 | 0) == 12) { break block } if ($1_1) { break block1 } } $1_1 = 0; if (HEAPU8[$0_1 + 7 | 0]) { break block1 } $2_1 = HEAPU8[$0_1 + 10 | 0]; if (!$2_1) { break block1 } $0_1 = HEAP32[$0_1 + 64 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]]($0_1, $2_1) | 0; } return $1_1; } function $153($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAPU8[$0_1 + 8 | 0]; block : { if (!$2_1) { break block } $4_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; if (($2_1 | 0) == 2) { $2_1 = HEAP32[$4_1 >> 2]; $3 = HEAP32[$2_1 + 44 >> 2]; block4 : { if (!$3) { HEAP32[$2_1 + 108 >> 2] = HEAP32[$2_1 + 108 >> 2] + 1; if (!(!HEAPU8[$2_1 + 4 | 0] | HEAPU8[$2_1 + 17 | 0] != 2 | HEAPU8[$2_1 + 5 | 0] != 1)) { HEAP8[$2_1 + 17 | 0] = 1; break block4; } $3 = $176($2_1, $175($2_1, HEAPU8[$2_1 + 20 | 0], 1)); } if ($1_1) { break block4 } if ($3) { break block } } HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] - 1; HEAP8[$4_1 + 20 | 0] = 1; $177($4_1); } $178($0_1); $3 = 0; } return $3; } function $154($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; if (HEAPU8[$0_1 + 8 | 0] == 2) { $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$0_1 >> 2]; block1 : { if (!HEAPU8[$3 + 17 | 0]) { break block1 } $11_1 = HEAP32[$3 >> 2]; $179($3); if (HEAPU8[$3 + 18 | 0]) { break block1 } block3 : { $4_1 = HEAP32[$3 + 48 >> 2]; if (($4_1 | 0) != ($180($3, $4_1) | 0)) { $8_1 = HEAP32[$3 + 36 >> 2]; if (((HEAPU32[18884] / ($8_1 >>> 0) | 0) + 1 | 0) != ($4_1 | 0)) { break block3 } } return $181(74965); } $6_1 = $156(HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2] + 36 | 0); $2_1 = $6_1; block4 : { $7_1 = HEAP32[$0_1 >> 2]; $9_1 = HEAP32[$7_1 + 260 >> 2]; if (!$9_1) { break block4 } $2_1 = HEAP32[$7_1 + 20 >> 2]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $10_1 = HEAP32[$7_1 + 16 >> 2]; while (1) { block6 : { $12_1 = HEAP32[$7_1 + 252 >> 2]; if (($2_1 | 0) != ($5_1 | 0)) { if (HEAP32[($10_1 + ($5_1 << 4) | 0) + 4 >> 2] != ($0_1 | 0)) { break block6 } $2_1 = $5_1; } $0_1 = FUNCTION_TABLE[$9_1 | 0]($12_1, HEAP32[$10_1 + ($2_1 << 4) >> 2], $4_1, $6_1, $8_1) | 0; $2_1 = $0_1 >>> 0 < $6_1 >>> 0 ? $0_1 : $6_1; if (!$2_1) { break block1 } break block4; } $5_1 = $5_1 + 1 | 0; continue; }; } $0_1 = $182($3, $4_1, $2_1); if ($4_1 >>> 0 < $0_1 >>> 0) { return $181(74992) } $5_1 = 0; if ($0_1 >>> 0 < $4_1 >>> 0) { $5_1 = $183($3, 0, 0) } $7_1 = ($2_1 | 0) == ($6_1 | 0); while (1) { if (!($5_1 | $0_1 >>> 0 >= $4_1 >>> 0)) { $5_1 = $184($3, $0_1, $4_1, $7_1); $4_1 = $4_1 - 1 | 0; continue; } break; }; if (!(!$6_1 | ($5_1 | 0) != 101 & ($5_1 | 0) != 0)) { $5_1 = $150(HEAP32[HEAP32[$3 + 12 >> 2] + 72 >> 2]); if (($2_1 | 0) == ($6_1 | 0)) { $2_1 = HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2]; HEAP8[$2_1 + 32 | 0] = 0; HEAP8[$2_1 + 33 | 0] = 0; HEAP8[$2_1 + 34 | 0] = 0; HEAP8[$2_1 + 35 | 0] = 0; $2_1 = HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2]; HEAP8[$2_1 + 36 | 0] = 0; HEAP8[$2_1 + 37 | 0] = 0; HEAP8[$2_1 + 38 | 0] = 0; HEAP8[$2_1 + 39 | 0] = 0; } $2_1 = HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2]; $4_1 = $0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24); HEAP8[$2_1 + 28 | 0] = $4_1; HEAP8[$2_1 + 29 | 0] = $4_1 >>> 8; HEAP8[$2_1 + 30 | 0] = $4_1 >>> 16; HEAP8[$2_1 + 31 | 0] = $4_1 >>> 24; HEAP32[$3 + 48 >> 2] = $0_1; HEAP8[$3 + 19 | 0] = 1; } if (!$5_1) { break block1 } $185($11_1); return $5_1; } $0_1 = HEAP32[$3 >> 2]; if (HEAPU8[$3 + 19 | 0]) { HEAP32[$0_1 + 28 >> 2] = HEAP32[$3 + 48 >> 2] } $5_1 = $151($0_1, $1_1, 0); } return $5_1; } function $156($0_1) { $0_1 = HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8 | (HEAPU8[$0_1 + 2 | 0] << 16 | HEAPU8[$0_1 + 3 | 0] << 24); return $0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24); } function $157($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; if (!HEAPU8[$0_1 + 6 | 0] | HEAP32[$0_1 + 104 >> 2] >= ($1_1 | 0)) { $5_1 = 0 } else { $3 = HEAP32[$0_1 + 104 >> 2]; $5_1 = 7; block : { $4_1 = $33(HEAP32[$0_1 + 100 >> 2], Math_imul($1_1, 48), 0); if (!$4_1) { break block } $2_1 = Math_imul($1_1 - $3 | 0, 48); if ($2_1) { wasm2js_memory_fill(Math_imul($3, 48) + $4_1 | 0, 0, $2_1) } HEAP32[$0_1 + 100 >> 2] = $4_1; $8_1 = ($1_1 | 0) < ($3 | 0) ? $3 : $1_1; while (1) { if (($3 | 0) == ($8_1 | 0)) { $5_1 = 0; break block; } $1_1 = Math_imul($3, 48) + $4_1 | 0; $7_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$1_1 + 20 >> 2] = $7_1; block4 : { if (HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2]) { $6_1 = HEAP32[$0_1 + 80 >> 2]; $2_1 = HEAP32[$0_1 + 84 >> 2]; if (!!$6_1 & ($2_1 | 0) >= 0 | ($2_1 | 0) > 0) { break block4 } } $6_1 = HEAP32[$0_1 + 156 >> 2]; $2_1 = 0; } HEAP32[$1_1 >> 2] = $6_1; HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$1_1 + 24 >> 2] = HEAP32[$0_1 + 56 >> 2]; $2_1 = $426($7_1); HEAP32[$1_1 + 28 >> 2] = 1; HEAP32[$1_1 + 16 >> 2] = $2_1; if (!$2_1) { break block } $2_1 = HEAP32[$0_1 + 232 >> 2]; if ($2_1) { HEAP32[$1_1 + 32 >> 2] = HEAP32[$2_1 + 68 >> 2]; HEAP32[$1_1 + 36 >> 2] = HEAP32[$2_1 + 76 >> 2]; HEAP32[$1_1 + 40 >> 2] = HEAP32[$2_1 + 80 >> 2]; HEAP32[$1_1 + 44 >> 2] = HEAP32[$2_1 + 112 >> 2]; } $3 = $3 + 1 | 0; HEAP32[$0_1 + 104 >> 2] = $3; continue; }; } } return $5_1; } function $158($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 576 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $1_1; wasm2js_memory_fill($2_1 + 8 | 0, 0, 536); $3 = $0_1 + 16 | 0; $4_1 = HEAP32[$3 + 4 >> 2]; $1_1 = $2_1 + 568 | 0; HEAP32[$1_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$1_1 + 4 >> 2] = $4_1; $1_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$2_1 + 560 >> 2] = HEAP32[$0_1 + 8 >> 2]; HEAP32[$2_1 + 564 >> 2] = $1_1; $1_1 = $0_1 + 48 | 0; $4_1 = HEAP32[$1_1 + 4 >> 2]; $3 = $2_1 + 552 | 0; HEAP32[$3 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$3 + 4 >> 2] = $4_1; $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$2_1 + 544 >> 2] = HEAP32[$0_1 + 40 >> 2]; HEAP32[$2_1 + 548 >> 2] = $4_1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $197($0_1 + 24 | 0); $1_1 = $0_1 + 8 | 0; $3 = HEAP32[$3 >> 2]; while (1) { if ($3) { $5($2_1 + 8 | 0, HEAP32[$3 + 8 >> 2]); $3 = HEAP32[$3 >> 2]; continue; } break; }; $197($2_1 + 544 | 0); HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $1_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $3 = HEAP32[$2_1 + 568 >> 2]; while (1) { if ($3) { $6($2_1 + 8 | 0, HEAP32[$3 + 8 >> 2]); $3 = HEAP32[$3 >> 2]; continue; } break; }; $197($2_1 + 560 | 0); $197($0_1 + 56 | 0); HEAP32[$0_1 + 72 >> 2] = 0; $1_1 = HEAPU16[$0_1 + 78 >> 1]; if ($1_1 & 1) { HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] + 1 } HEAP16[$0_1 + 78 >> 1] = $1_1 & 65526; $0_1 = $2_1 + 576 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $159($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 412 >> 2]; if ($1_1) { HEAP32[$0_1 + 412 >> 2] = 0; while (1) { $0_1 = HEAP32[$1_1 + 24 >> 2]; $646($1_1); $1_1 = $0_1; if ($1_1) { continue } break; }; } } function $160($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = 2; $4_1 = 2; while (1) { if (!(HEAP32[$0_1 + 20 >> 2] <= ($4_1 | 0))) { $2_1 = HEAP32[$0_1 + 16 >> 2]; $1_1 = $2_1 + ($4_1 << 4) | 0; block2 : { if (!HEAP32[$1_1 + 4 >> 2]) { $10($0_1, HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = 0; break block2; } if (($3 | 0) < ($4_1 | 0)) { $5_1 = HEAP32[$1_1 + 4 >> 2]; $2_1 = $2_1 + ($3 << 4) | 0; HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $5_1; $1_1 = $1_1 + 8 | 0; $5_1 = HEAP32[$1_1 + 4 >> 2]; $2_1 = $2_1 + 8 | 0; HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $5_1; } $3 = $3 + 1 | 0; } $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 20 >> 2] = $3; block4 : { if (($3 | 0) > 2) { break block4 } $3 = HEAP32[$0_1 + 16 >> 2]; $4_1 = $0_1 + 460 | 0; if (($3 | 0) == ($4_1 | 0)) { break block4 } $1_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$4_1 + 4 >> 2] = $1_1; $2_1 = $3 + 24 | 0; $5_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = $4_1 + 24 | 0; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; $2_1 = $3 + 16 | 0; $5_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = $4_1 + 16 | 0; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; $2_1 = $3 + 8 | 0; $5_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = $4_1 + 8 | 0; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; $10($0_1, $3); HEAP32[$0_1 + 16 >> 2] = $4_1; } } function $161($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; $3 = HEAP32[$2_1 + 104 >> 2]; $5_1 = ($3 | 0) > 0 ? $3 : 0; $6_1 = HEAP32[$0_1 + 24 >> 2]; block : { while (1) { if (($4_1 | 0) == ($5_1 | 0)) { break block } block2 : { block1 : { $7_1 = HEAP32[$2_1 + 100 >> 2]; $8_1 = $7_1 + Math_imul($4_1, 48) | 0; if (HEAPU32[$8_1 + 20 >> 2] < $6_1 >>> 0) { break block1 } if ($430(HEAP32[$8_1 + 16 >> 2], $6_1)) { break block1 } while (1) { $4_1 = $4_1 + 1 | 0; if (($4_1 | 0) >= ($3 | 0)) { break block2 } HEAP32[(Math_imul($4_1, 48) + $7_1 | 0) + 28 >> 2] = 0; continue; }; } $4_1 = $4_1 + 1 | 0; continue; } break; }; $4_1 = HEAPU8[$2_1 + 5 | 0]; if (($4_1 | 0) != 2) { $3 = HEAP32[$2_1 + 72 >> 2]; if (!HEAP32[$3 >> 2]) { $1_1 = HEAP32[$2_1 >> 2]; if (HEAPU8[$2_1 + 22 | 0] | ($4_1 | 0) == 4) { $7_1 = -1 } else { $7_1 = HEAP32[18893] } $1_1 = $537($1_1, 0, $3, 8222, $7_1); if ($1_1) { break block } $6_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAP32[$2_1 + 72 >> 2]; } $4_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$2_1 + 172 >> 2]; $5_1 = HEAP32[$2_1 + 168 >> 2] + 4 | 0; $1_1 = $5_1 >>> 0 < 4 ? $1_1 + 1 | 0 : $1_1; $7_1 = $3; $5_1 = __wasm_i64_mul($5_1, $1_1, HEAP32[$2_1 + 56 >> 2], 0); $3 = i64toi32_i32$HIGH_BITS; $1_1 = $171($7_1, $5_1, $3, $6_1); if ($1_1) { break block } $6_1 = HEAP32[$2_1 + 72 >> 2]; $1_1 = HEAP32[$2_1 + 168 >> 2]; $5_1 = $5_1 + 4 | 0; $3 = $5_1 >>> 0 < 4 ? $3 + 1 | 0 : $3; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2]]($6_1, $4_1, $1_1, $5_1, $3) | 0; if ($1_1) { break block } $6_1 = HEAP32[$0_1 + 24 >> 2]; } HEAP32[$2_1 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2] + 1; $1_1 = $538($2_1, $6_1); } return $1_1; } function $163($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; block1 : { if (HEAPU8[$2_1 + 17 | 0] == 2) { $1_1 = HEAP32[$2_1 + 44 >> 2]; if ($1_1) { break block1 } block2 : { if (HEAP32[$2_1 + 232 >> 2] | HEAPU8[$2_1 + 5 | 0] == 2) { break block2 } $4_1 = HEAP32[$2_1 >> 2]; $1_1 = $426(HEAP32[$2_1 + 28 >> 2]); HEAP32[$2_1 + 60 >> 2] = $1_1; if (!$1_1) { return 7 } $1_1 = HEAP32[$2_1 + 68 >> 2]; block8 : { block4 : { if (HEAP32[$1_1 >> 2]) { break block4 } if (HEAPU8[$2_1 + 5 | 0] == 4) { wasm2js_memory_fill($1_1 + 8 | 0, 0, 56); HEAP32[$1_1 >> 2] = 33512; HEAP32[$1_1 + 4 >> 2] = 1020; HEAP32[$1_1 + 8 >> 2] = -1; break block4; } $5_1 = HEAP32[18893]; $3 = HEAPU8[$2_1 + 12 | 0]; $1_1 = $517($2_1); if (!$1_1) { $1_1 = $537($4_1, HEAP32[$2_1 + 188 >> 2], HEAP32[$2_1 + 68 >> 2], $3 ? 4126 : 2054, $3 ? $5_1 : 0) } if ($1_1) { break block8 } } HEAP32[$2_1 + 80 >> 2] = 0; HEAP32[$2_1 + 84 >> 2] = 0; HEAP8[$2_1 + 20 | 0] = 0; HEAP32[$2_1 + 48 >> 2] = 0; $1_1 = $2_1 + 88 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $553($2_1); if (!$1_1) { break block2 } } $434(HEAP32[$2_1 + 60 >> 2]); HEAP32[$2_1 + 80 >> 2] = 0; HEAP32[$2_1 + 84 >> 2] = 0; HEAP32[$2_1 + 60 >> 2] = 0; return $1_1; } HEAP8[$2_1 + 17 | 0] = 3; } $595($0_1); $1_1 = HEAP32[$2_1 + 60 >> 2]; block9 : { if (!$1_1) { break block9 } $3 = $1_1; $1_1 = HEAP32[$0_1 + 24 >> 2]; if ($430($3, $1_1)) { break block9 } if (HEAPU32[$2_1 + 32 >> 2] >= $1_1 >>> 0) { $1_1 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$1_1 + 84 >> 2]; $5_1 = HEAP32[$1_1 + 80 >> 2]; $6_1 = HEAP32[$0_1 + 4 >> 2]; $7_1 = $593($1_1, $6_1); HEAP16[$0_1 + 28 >> 1] = HEAPU16[$0_1 + 28 >> 1] | 8; $3 = $171(HEAP32[$1_1 + 68 >> 2], $5_1, $4_1, HEAP32[$0_1 + 24 >> 2]); block : { if ($3) { break block } $8_1 = $4_1 + 1 | 0; $3 = $4_1; $4_1 = $5_1 + 4 | 0; $5_1 = $4_1 >>> 0 < 4 ? $8_1 : $3; $3 = HEAP32[$1_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 12 >> 2]]($3, $6_1, HEAP32[$1_1 + 168 >> 2], $4_1, $5_1) | 0; if ($3) { break block } $3 = HEAP32[$1_1 + 168 >> 2]; $4_1 = $4_1 + $3 | 0; $5_1 = HEAP32[$1_1 + 172 >> 2] + $5_1 | 0; $3 = $171(HEAP32[$1_1 + 68 >> 2], $4_1, $4_1 >>> 0 < $3 >>> 0 ? $5_1 + 1 | 0 : $5_1, $7_1); if ($3) { break block } HEAP32[$1_1 + 48 >> 2] = HEAP32[$1_1 + 48 >> 2] + 1; $4_1 = HEAP32[$1_1 + 80 >> 2]; $3 = $4_1 + HEAP32[$1_1 + 168 >> 2] | 0; $5_1 = HEAP32[$1_1 + 172 >> 2] + HEAP32[$1_1 + 84 >> 2] | 0; $4_1 = $4_1 >>> 0 > $3 >>> 0 ? $5_1 + 1 | 0 : $5_1; $3 = $3 + 8 | 0; $4_1 = $3 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; HEAP32[$1_1 + 80 >> 2] = $3; HEAP32[$1_1 + 84 >> 2] = $4_1; $3 = $427(HEAP32[$1_1 + 60 >> 2], HEAP32[$0_1 + 24 >> 2]) | $538($1_1, HEAP32[$0_1 + 24 >> 2]); } $1_1 = $3; if (!$1_1) { break block9 } break block1; } if (HEAPU8[$2_1 + 17 | 0] == 4) { break block9 } HEAP16[$0_1 + 28 >> 1] = HEAPU16[$0_1 + 28 >> 1] | 8; } HEAP16[$0_1 + 28 >> 1] = HEAPU16[$0_1 + 28 >> 1] | 4; if (HEAP32[$2_1 + 104 >> 2] <= 0) { $1_1 = 0 } else { $1_1 = $161($0_1) } $0_1 = HEAP32[$0_1 + 24 >> 2]; if ($0_1 >>> 0 <= HEAPU32[$2_1 + 28 >> 2]) { break block1 } HEAP32[$2_1 + 28 >> 2] = $0_1; } return $1_1; } function $164($0_1, $1_1) { var $2_1 = 0; if (!HEAPU8[$0_1 + 12 | 0]) { return 1 } if (!(!$1_1 | !HEAP32[HEAP32[$0_1 + 64 >> 2] >> 2])) { $1_1 = 0; $0_1 = HEAP32[$0_1 + 228 >> 2]; $2_1 = $523($0_1); while (1) { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { $0_1 = $0_1 + 40 | 0; $1_1 = $1_1 + 1 | 0; continue; } break; }; if (!$2_1) { return 0 } $2_1 = (__wasm_i64_sdiv(__wasm_i64_mul($1_1, 0, 100, 0), i64toi32_i32$HIGH_BITS, $2_1, $2_1 >> 31) | 0) > 24; } return $2_1; } function $165($0_1) { while (1) { if ($0_1) { HEAP32[$0_1 + 16 >> 2] = 1; $0_1 = HEAP32[$0_1 + 44 >> 2]; continue; } break; }; } function $166($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 128 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = HEAP32[$0_1 >> 2]; $0_1 = $1_1; while (1) { if ($0_1) { $3 = $0_1; $0_1 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$3 + 16 >> 2] = $0_1; continue; } break; }; wasm2js_memory_fill($2_1, 0, 128); label1 : while (1) { if ($1_1) { $3 = HEAP32[$1_1 + 16 >> 2]; $0_1 = 0; HEAP32[$1_1 + 16 >> 2] = 0; while (1) { if (($0_1 | 0) != 31) { $4_1 = ($0_1 << 2) + $2_1 | 0; $5_1 = HEAP32[$4_1 >> 2]; if ($5_1) { $1_1 = $596($5_1, $1_1); HEAP32[$4_1 >> 2] = 0; $0_1 = $0_1 + 1 | 0; continue; } else { HEAP32[$4_1 >> 2] = $1_1; $1_1 = $3; continue label1; } } break; }; HEAP32[$2_1 + 124 >> 2] = $596(HEAP32[$2_1 + 124 >> 2], $1_1); $1_1 = $3; continue; } break; }; $1_1 = HEAP32[$2_1 >> 2]; $0_1 = 1; while (1) { if (!(($0_1 | 0) == 32)) { $3 = HEAP32[($0_1 << 2) + $2_1 >> 2]; block6 : { if (!$3) { break block6 } if (!$1_1) { $1_1 = $3; break block6; } $1_1 = $596($1_1, $3); } $0_1 = $0_1 + 1 | 0; continue; } break; }; $0_1 = $2_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $167($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0; $8_1 = global$0 - 80 | 0; $9_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $9_1; HEAP32[$8_1 + 4 >> 2] = $1_1; block1 : { if (!$3) { $6_1 = 1; break block1; } $4_1 = $8_1 + 4 | 0; while (1) { HEAP32[$4_1 >> 2] = $1_1; if ($1_1) { $9_1 = HEAPU32[$1_1 + 24 >> 2] <= $2_1 >>> 0; $4_1 = $9_1 ? $1_1 + 16 | 0 : $4_1; $6_1 = $6_1 + $9_1 | 0; $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; } break; }; $1_1 = HEAP32[$8_1 + 4 >> 2]; } HEAP32[$0_1 + 208 >> 2] = HEAP32[$0_1 + 208 >> 2] + $6_1; if (HEAP32[$1_1 + 24 >> 2] == 1) { $169($1_1) } $14 = HEAPU8[$0_1 + 11 | 0]; $9_1 = HEAP32[$0_1 + 168 >> 2]; $4_1 = HEAP32[$0_1 + 172 >> 2]; $7_1 = HEAP32[$0_1 + 232 >> 2]; $5_1 = HEAP32[HEAP32[$7_1 + 32 >> 2] >> 2]; block5 : { if (!$2014($7_1 + 52 | 0, $5_1, 48)) { $11_1 = 0; break block5; } $11_1 = HEAP32[$5_1 + 16 >> 2] + 1 | 0; } block9 : { if (!HEAPU16[$7_1 + 40 >> 1]) { block8 : { block7 : { if (!HEAP32[$5_1 + 96 >> 2]) { break block7 } $65(4, $8_1 + 8 | 0); $6_1 = $539($7_1, 4, 4); if (($6_1 | 0) == 5) { break block7 } if ($6_1) { break block8 } $540($7_1, HEAP32[$8_1 + 8 >> 2]); $541($7_1, 4, 4); } $542($7_1, 3); HEAP16[$7_1 + 40 >> 1] = 65535; HEAP32[$8_1 + 16 >> 2] = 0; while (1) { $6_1 = $543($7_1, $8_1 + 8 | 0, 1, $8_1 + 16 | 0); if (($6_1 | 0) == -1) { continue } break; }; } if ($6_1) { break block9 } } $15_1 = $9_1; $13_1 = HEAP32[$7_1 + 68 >> 2]; block10 : { if ($13_1) { break block10 } HEAP32[$8_1 + 16 >> 2] = -2113503433; HEAP32[$8_1 + 20 >> 2] = 417475840; HEAP8[$8_1 + 27 | 0] = $9_1; HEAP8[$8_1 + 26 | 0] = ($4_1 & 255) << 24 | $9_1 >>> 8; HEAP8[$8_1 + 25 | 0] = ($4_1 & 65535) << 16 | $9_1 >>> 16; HEAP8[$8_1 + 24 | 0] = ($4_1 & 16777215) << 8 | $9_1 >>> 24; $5_1 = HEAP32[$7_1 + 112 >> 2]; HEAP32[$8_1 + 28 >> 2] = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); if (!$5_1) { $65(8, $7_1 + 84 | 0) } $5_1 = HEAP32[$7_1 + 88 >> 2]; HEAP32[$8_1 + 32 >> 2] = HEAP32[$7_1 + 84 >> 2]; HEAP32[$8_1 + 36 >> 2] = $5_1; $4_1 = $8_1 + 16 | 0; $544(1, $4_1, 24, 0, $8_1 + 8 | 0); $5_1 = HEAP32[$8_1 + 8 >> 2]; HEAP32[$8_1 + 40 >> 2] = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); $10_1 = HEAP32[$8_1 + 12 >> 2]; HEAP32[$8_1 + 44 >> 2] = $10_1 << 24 | ($10_1 & 65280) << 8 | ($10_1 >>> 8 & 65280 | $10_1 >>> 24); HEAP32[$7_1 + 36 >> 2] = $15_1; HEAP32[$7_1 + 76 >> 2] = $5_1; HEAP32[$7_1 + 80 >> 2] = $10_1; HEAP8[$7_1 + 65 | 0] = 0; HEAP8[$7_1 + 47 | 0] = 1; $5_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 12 >> 2]]($5_1, $4_1, 32, 0, 0) | 0; if ($6_1) { break block9 } if (!HEAPU8[$7_1 + 48 | 0]) { break block10 } $5_1 = $14 >>> 2 & 3; if (!$5_1) { break block10 } $10_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$10_1 >> 2] + 20 >> 2]]($10_1, $5_1) | 0; if ($6_1) { break block9 } } if (($15_1 | 0) != HEAP32[$7_1 + 36 >> 2]) { $6_1 = $181(69216); break block9; } HEAP32[$8_1 + 56 >> 2] = $7_1; $21_1 = HEAP32[$7_1 + 8 >> 2]; HEAP32[$8_1 + 76 >> 2] = $15_1; HEAP32[$8_1 + 72 >> 2] = $14; HEAP32[$8_1 + 64 >> 2] = 0; HEAP32[$8_1 + 68 >> 2] = 0; HEAP32[$8_1 + 60 >> 2] = $21_1; $4_1 = $9_1 + 24 | 0; $5_1 = $4_1 >> 31; $16_1 = $4_1; $20_1 = $5_1; $9_1 = __wasm_i64_mul($4_1, $5_1, $13_1, 0); $4_1 = i64toi32_i32$HIGH_BITS; $10_1 = $9_1 + 32 | 0; $9_1 = $10_1 >>> 0 < 32 ? $4_1 + 1 | 0 : $4_1; $4_1 = $1_1; while (1) { if ($4_1) { $12_1 = $8_1 + 56 | 0; block18 : { block16 : { block14 : { if (!$11_1) { break block14 } if ($3) { $5_1 = $2_1; if (!HEAP32[$4_1 + 16 >> 2]) { break block16 } } HEAP32[$8_1 + 16 >> 2] = 0; $545($7_1, HEAP32[$4_1 + 24 >> 2], $8_1 + 16 | 0); $6_1 = HEAP32[$8_1 + 16 >> 2]; if ($6_1 >>> 0 < $11_1 >>> 0) { break block14 } $12_1 = __wasm_i64_mul($16_1, $20_1, $6_1 - 1 | 0, 0); $5_1 = i64toi32_i32$HIGH_BITS; $12_1 = $12_1 + 56 | 0; $5_1 = $12_1 >>> 0 < 56 ? $5_1 + 1 | 0 : $5_1; if (HEAP32[$7_1 + 104 >> 2] - 1 >>> 0 >= $6_1 >>> 0) { HEAP32[$7_1 + 104 >> 2] = $6_1 } $6_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2]]($6_1, HEAP32[$4_1 + 4 >> 2], $15_1, $12_1, $5_1) | 0; if ($6_1) { break block9 } HEAP16[$4_1 + 28 >> 1] = HEAPU16[$4_1 + 28 >> 1] & 65471; break block18; } $5_1 = 0; if (!$3) { break block16 } $5_1 = HEAP32[$4_1 + 16 >> 2] ? 0 : $2_1; } $6_1 = $546($12_1, $4_1, $5_1, $10_1, $9_1); if ($6_1) { break block9 } HEAP16[$4_1 + 28 >> 1] = HEAPU16[$4_1 + 28 >> 1] | 64; $9_1 = $9_1 + $20_1 | 0; $10_1 = $10_1 + $16_1 | 0; $9_1 = $10_1 >>> 0 < $16_1 >>> 0 ? $9_1 + 1 | 0 : $9_1; $13_1 = $13_1 + 1 | 0; $22_1 = $4_1; } $4_1 = HEAP32[$4_1 + 16 >> 2]; continue; } break; }; block21 : { if (!$3) { $6_1 = 0; $11_1 = 0; break block21; } if (HEAP32[$7_1 + 104 >> 2]) { $12_1 = HEAP32[$7_1 + 36 >> 2] + 24 | 0; $11_1 = $23($12_1); if (!$11_1) { $6_1 = 7; break block9; } $4_1 = HEAP32[$7_1 + 104 >> 2]; block25 : { if (($4_1 | 0) == 1) { $17_1 = $12_1 >> 31; $5_1 = 24; $4_1 = 0; break block25; } $17_1 = $12_1 >> 31; $5_1 = __wasm_i64_mul($4_1 - 2 | 0, 0, $12_1, $17_1); $4_1 = i64toi32_i32$HIGH_BITS; $5_1 = $5_1 + 48 | 0; $4_1 = $5_1 >>> 0 < 48 ? $4_1 + 1 | 0 : $4_1; } $6_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 8 >> 2]]($6_1, $11_1, 8, $5_1, $4_1) | 0; HEAP32[$7_1 + 76 >> 2] = $156($11_1); $23_1 = $11_1 + 4 | 0; HEAP32[$7_1 + 80 >> 2] = $156($23_1); $4_1 = HEAP32[$7_1 + 104 >> 2]; HEAP32[$7_1 + 104 >> 2] = 0; $24_1 = $11_1 + 24 | 0; while (1) { if (!($4_1 >>> 0 > $13_1 >>> 0 | $6_1)) { $18_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = $12_1; $19_1 = __wasm_i64_mul($6_1, $17_1, $4_1 - 1 | 0, 0); $5_1 = i64toi32_i32$HIGH_BITS; $19_1 = $19_1 + 32 | 0; $5_1 = $19_1 >>> 0 < 32 ? $5_1 + 1 | 0 : $5_1; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$18_1 >> 2] + 8 >> 2]]($18_1, $11_1, $6_1, $19_1, $5_1) | 0; if (!$6_1) { $18_1 = $8_1 + 16 | 0; $547($7_1, $156($11_1), $156($23_1), $24_1, $18_1); $6_1 = HEAP32[$7_1 + 8 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2]]($6_1, $18_1, 24, $19_1, $5_1) | 0; } $4_1 = $4_1 + 1 | 0; continue; } break; }; $24($11_1); if ($6_1) { break block9 } } $17_1 = $14 & 3; block29 : { if (!$17_1) { $11_1 = 0; $6_1 = 0; break block29; } block31 : { if (!HEAPU8[$7_1 + 49 | 0]) { $11_1 = 0; break block31; } $12_1 = $535(HEAP32[$7_1 + 8 >> 2]); $6_1 = $12_1 + $10_1 | 0; $4_1 = $9_1; $5_1 = ($6_1 >>> 0 < $12_1 >>> 0 ? $4_1 + 1 | 0 : $4_1) - 1 | 0; $4_1 = $6_1 - 1 | 0; $5_1 = ($4_1 | 0) != -1 ? $5_1 + 1 | 0 : $5_1; $6_1 = __wasm_i64_srem($4_1, $5_1, $12_1, 0); $12_1 = $4_1 - $6_1 | 0; $4_1 = $5_1 - (i64toi32_i32$HIGH_BITS + ($4_1 >>> 0 < $6_1 >>> 0) | 0) | 0; $14 = $4_1; HEAP32[$8_1 + 64 >> 2] = $12_1; HEAP32[$8_1 + 68 >> 2] = $4_1; $11_1 = 0; $5_1 = $10_1; $4_1 = $9_1; while (1) { if (!(($4_1 | 0) >= ($14 | 0) & $5_1 >>> 0 >= $12_1 >>> 0 | ($4_1 | 0) > ($14 | 0))) { $6_1 = $546($8_1 + 56 | 0, $22_1, $2_1, $5_1, $4_1); if ($6_1) { break block9 } $11_1 = $11_1 + 1 | 0; $4_1 = $4_1 + $20_1 | 0; $5_1 = $5_1 + $16_1 | 0; $4_1 = $5_1 >>> 0 < $16_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; if (($10_1 | 0) == ($12_1 | 0) & ($9_1 | 0) == ($14 | 0)) { break block31 } $6_1 = 0; break block29; } $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$21_1 >> 2] + 20 >> 2]]($21_1, $17_1) | 0; } if (!HEAPU8[$7_1 + 47 | 0]) { break block21 } $9_1 = HEAP32[$7_1 + 16 >> 2]; $4_1 = HEAP32[$7_1 + 20 >> 2]; if (($4_1 | 0) < 0) { break block21 } $10_1 = __wasm_i64_mul($16_1, $20_1, $11_1 + $13_1 | 0, 0); $5_1 = i64toi32_i32$HIGH_BITS; $10_1 = $10_1 + 32 | 0; $5_1 = $10_1 >>> 0 < 32 ? $5_1 + 1 | 0 : $5_1; $12_1 = $9_1; $9_1 = $9_1 >>> 0 < $10_1 >>> 0 & ($4_1 | 0) <= ($5_1 | 0) | ($4_1 | 0) < ($5_1 | 0); $548($7_1, $9_1 ? $10_1 : $12_1, $9_1 ? $5_1 : $4_1); HEAP8[$7_1 + 47 | 0] = 0; } $13_1 = HEAP32[$7_1 + 68 >> 2]; $4_1 = $1_1; while (1) { if (!($6_1 | !$4_1)) { $6_1 = 0; if (HEAPU8[$4_1 + 28 | 0] & 64) { $13_1 = $13_1 + 1 | 0; $6_1 = $549($7_1, $13_1, HEAP32[$4_1 + 24 >> 2]); } $4_1 = HEAP32[$4_1 + 16 >> 2]; continue; } break; }; while (1) { if (!(($11_1 | 0) <= 0 | $6_1)) { $11_1 = $11_1 - 1 | 0; $13_1 = $13_1 + 1 | 0; $6_1 = $549($7_1, $13_1, HEAP32[$22_1 + 24 >> 2]); continue; } break; }; if ($6_1) { break block9 } HEAP32[$7_1 + 68 >> 2] = $13_1; HEAP16[$7_1 + 66 >> 1] = $15_1 & 65280 | $15_1 >>> 16; if ($3) { HEAP32[$7_1 + 72 >> 2] = $2_1; HEAP32[$7_1 + 60 >> 2] = HEAP32[$7_1 + 60 >> 2] + 1; $550($7_1); HEAP32[$7_1 + 12 >> 2] = $13_1; } $6_1 = 0; if (!HEAP32[$0_1 + 96 >> 2]) { break block9 } while (1) { if (!$1_1) { break block9 } $551(HEAP32[$0_1 + 96 >> 2], HEAP32[$1_1 + 24 >> 2], HEAP32[$1_1 + 4 >> 2]); $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; }; } $0_1 = $8_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $168($0_1) { var $1_1 = 0; while (1) { $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { $536($1_1); continue; } break; }; } function $169($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; if ($0_1) { $2_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = $156(HEAP32[$0_1 + 20 >> 2] + 112 | 0) + 1 | 0; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 24 | 0] = $1_1; HEAP8[$2_1 + 25 | 0] = $1_1 >>> 8; $3 = $1_1 >>> 16 | 0; HEAP8[$2_1 + 26 | 0] = $3; HEAP8[$2_1 + 27 | 0] = $1_1 >>> 24; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP8[$2_1 + 92 | 0] = $1_1; HEAP8[$2_1 + 93 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 94 | 0] = $3; HEAP8[$2_1 + 95 | 0] = $1_1 >>> 24; $0_1 = HEAP32[$0_1 + 4 >> 2]; HEAP8[$0_1 + 96 | 0] = 0; HEAP8[$0_1 + 97 | 0] = 46; HEAP8[$0_1 + 98 | 0] = 134; HEAP8[$0_1 + 99 | 0] = 41; } } function $170($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 + 80 >> 2]; $1_1 = HEAP32[$0_1 + 84 >> 2]; if (!($2_1 | $1_1)) { i64toi32_i32$HIGH_BITS = 0; return 0; } $1_1 = $1_1 - 1 | 0; $2_1 = $2_1 - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; $0_1 = HEAP32[$0_1 + 156 >> 2]; $1_1 = __wasm_i64_sdiv($2_1, $1_1, $0_1, 0); $2_1 = i64toi32_i32$HIGH_BITS; $1_1 = $1_1 + 1 | 0; $2_1 = $1_1 ? $2_1 : $2_1 + 1 | 0; $0_1 = __wasm_i64_mul($1_1, $2_1, $0_1, 0); return $0_1; } function $171($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $3 = $3 << 24 | ($3 & 65280) << 8 | ($3 >>> 8 & 65280 | $3 >>> 24); HEAP8[$4_1 + 12 | 0] = $3; HEAP8[$4_1 + 13 | 0] = $3 >>> 8; HEAP8[$4_1 + 14 | 0] = $3 >>> 16; HEAP8[$4_1 + 15 | 0] = $3 >>> 24; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]]($0_1, $4_1 + 12 | 0, 4, $1_1, $2_1) | 0; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $172($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 32 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $2_1 = $552($0_1); block : { if ($2_1) { break block } block1 : { if (HEAPU8[$0_1 + 7 | 0]) { break block1 } $2_1 = HEAP32[$0_1 + 68 >> 2]; $5_1 = HEAP32[$2_1 >> 2]; if (!(!$5_1 | HEAPU8[$0_1 + 5 | 0] == 4)) { $3 = HEAP32[$0_1 + 64 >> 2]; $6_1 = HEAP32[$3 >> 2]; block6 : { block4 : { if (!$6_1) { $6_1 = 0; break block4; } $6_1 = FUNCTION_TABLE[HEAP32[$6_1 + 48 >> 2]]($3) | 0; $5_1 = 1; if ($6_1 & 512) { break block6 } $2_1 = HEAP32[$0_1 + 68 >> 2]; $5_1 = HEAP32[$2_1 >> 2]; } HEAP32[$4_1 + 8 >> 2] = -117058087; HEAP32[$4_1 + 12 >> 2] = -681336544; $3 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$4_1 + 16 >> 2] = $3 << 24 | ($3 & 65280) << 8 | ($3 >>> 8 & 65280 | $3 >>> 24); $3 = $170($0_1); $7_1 = i64toi32_i32$HIGH_BITS; $2_1 = FUNCTION_TABLE[HEAP32[$5_1 + 8 >> 2]]($2_1, $4_1 + 24 | 0, 8, $3, $7_1) | 0; block8 : { if (!$2_1) { if ((HEAPU8[$4_1 + 24 | 0] | HEAPU8[$4_1 + 25 | 0] << 8 | (HEAPU8[$4_1 + 26 | 0] << 16 | HEAPU8[$4_1 + 27 | 0] << 24)) != -117058087 | (HEAPU8[$4_1 + 28 | 0] | HEAPU8[$4_1 + 29 | 0] << 8 | (HEAPU8[$4_1 + 30 | 0] << 16 | HEAPU8[$4_1 + 31 | 0] << 24)) != -681336544) { break block8 } $2_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 12 >> 2]]($2_1, 33596, 1, $3, $7_1) | 0; } if (($2_1 | 0) == 522) { break block8 } if ($2_1) { break block } } block9 : { if (!HEAPU8[$0_1 + 8 | 0] | $6_1 & 1024) { break block9 } $3 = HEAPU8[$0_1 + 10 | 0]; if (!$3) { break block9 } $2_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 20 >> 2]]($2_1, $3) | 0; if ($2_1) { break block } } $2_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 12 >> 2]]($2_1, $4_1 + 8 | 0, 12, HEAP32[$0_1 + 88 >> 2], HEAP32[$0_1 + 92 >> 2]) | 0; if ($2_1) { break block } $5_1 = 0; } block10 : { if ($6_1 & 1024) { break block10 } $3 = HEAPU8[$0_1 + 10 | 0]; $3 = (($3 | 0) == 3 ? 16 : 0) | $3; if (!$3) { break block10 } $2_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 20 >> 2]]($2_1, $3) | 0; if ($2_1) { break block } } $3 = HEAP32[$0_1 + 84 >> 2]; HEAP32[$0_1 + 88 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$0_1 + 92 >> 2] = $3; if (!$1_1 | $5_1) { break block1 } HEAP32[$0_1 + 48 >> 2] = 0; $2_1 = $553($0_1); if (!$2_1) { break block1 } break block; } $1_1 = HEAP32[$0_1 + 84 >> 2]; HEAP32[$0_1 + 88 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$0_1 + 92 >> 2] = $1_1; } $3 = HEAP32[$0_1 + 228 >> 2]; $2_1 = $3; while (1) { $1_1 = HEAP32[$2_1 >> 2]; if ($1_1) { HEAP16[$1_1 + 28 >> 1] = HEAPU16[$1_1 + 28 >> 1] & 65527; $2_1 = $1_1 + 40 | 0; continue; } break; }; HEAP32[$3 + 8 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP8[$0_1 + 17 | 0] = 4; $2_1 = 0; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $173($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $9_1 = global$0 - 16 | 0; $2_1 = $9_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 + 64 >> 2]; block1 : { if (!HEAP32[$3 >> 2]) { $2_1 = HEAP32[$0_1 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[$2_1 + 24 >> 2]]($2_1, 0, $3, HEAP32[$0_1 + 152 >> 2] & 17334113 | 30, 0) | 0; if ($6_1) { break block1 } } $6_1 = 0; $4_1 = HEAP32[$0_1 + 28 >> 2]; $2_1 = HEAP32[$0_1 + 40 >> 2]; if ($4_1 >>> 0 <= $2_1 >>> 0 | !HEAP32[$1_1 + 16 >> 2] & $2_1 >>> 0 >= HEAPU32[$1_1 + 24 >> 2]) { break block1 } HEAP32[$9_1 + 8 >> 2] = __wasm_i64_mul(HEAP32[$0_1 + 168 >> 2], HEAP32[$0_1 + 172 >> 2], $4_1, 0); HEAP32[$9_1 + 12 >> 2] = i64toi32_i32$HIGH_BITS; $3 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$3 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 40 >> 2]]($3, 5, $9_1 + 8 | 0) | 0; $4_1 = HEAP32[$0_1 + 28 >> 2]; } HEAP32[$0_1 + 40 >> 2] = $4_1; } $7_1 = $0_1 + 112 | 0; $4_1 = $7_1 + 8 | 0; while (1) { if (!(!$1_1 | $6_1)) { $6_1 = 0; $8_1 = HEAP32[$1_1 + 24 >> 2]; if (!(HEAPU8[$1_1 + 28 | 0] & 16 | $8_1 >>> 0 > HEAPU32[$0_1 + 28 >> 2])) { $2_1 = HEAP32[$0_1 + 168 >> 2]; $3 = __wasm_i64_mul($2_1, HEAP32[$0_1 + 172 >> 2], $8_1 - 1 | 0, 0); $11_1 = i64toi32_i32$HIGH_BITS; $10_1 = ($8_1 | 0) != 1; if (!$10_1) { $169($1_1); $2_1 = HEAP32[$0_1 + 168 >> 2]; } $6_1 = HEAP32[$0_1 + 64 >> 2]; $5_1 = HEAP32[$1_1 + 4 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2]]($6_1, $5_1, $2_1, $3, $11_1) | 0; if (!$10_1) { $3 = HEAPU8[$5_1 + 28 | 0] | HEAPU8[$5_1 + 29 | 0] << 8 | (HEAPU8[$5_1 + 30 | 0] << 16 | HEAPU8[$5_1 + 31 | 0] << 24); $2_1 = HEAPU8[$5_1 + 24 | 0] | HEAPU8[$5_1 + 25 | 0] << 8 | (HEAPU8[$5_1 + 26 | 0] << 16 | HEAPU8[$5_1 + 27 | 0] << 24); HEAP8[$7_1 | 0] = $2_1; HEAP8[$7_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $2_1 >>> 24; HEAP8[$7_1 + 4 | 0] = $3; HEAP8[$7_1 + 5 | 0] = $3 >>> 8; HEAP8[$7_1 + 6 | 0] = $3 >>> 16; HEAP8[$7_1 + 7 | 0] = $3 >>> 24; $3 = $5_1 + 32 | 0; $2_1 = HEAPU8[$3 | 0] | HEAPU8[$3 + 1 | 0] << 8 | (HEAPU8[$3 + 2 | 0] << 16 | HEAPU8[$3 + 3 | 0] << 24); $3 = HEAPU8[$3 + 4 | 0] | HEAPU8[$3 + 5 | 0] << 8 | (HEAPU8[$3 + 6 | 0] << 16 | HEAPU8[$3 + 7 | 0] << 24); HEAP8[$4_1 | 0] = $2_1; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 3 | 0] = $2_1 >>> 24; HEAP8[$4_1 + 4 | 0] = $3; HEAP8[$4_1 + 5 | 0] = $3 >>> 8; HEAP8[$4_1 + 6 | 0] = $3 >>> 16; HEAP8[$4_1 + 7 | 0] = $3 >>> 24; } if (HEAPU32[$0_1 + 36 >> 2] < $8_1 >>> 0) { HEAP32[$0_1 + 36 >> 2] = $8_1 } HEAP32[$0_1 + 208 >> 2] = HEAP32[$0_1 + 208 >> 2] + 1; $551(HEAP32[$0_1 + 96 >> 2], $8_1, HEAP32[$1_1 + 4 >> 2]); } $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; } break; }; $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $174($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $3; $6_1 = HEAP32[$0_1 + 64 >> 2]; $4_1 = HEAP32[$6_1 >> 2]; block : { if (!$4_1 | (HEAPU8[$0_1 + 17 | 0] - 4 & 255) >>> 0 > 252) { break block } $3 = HEAP32[$0_1 + 168 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[$4_1 + 24 >> 2]]($6_1, $5_1 + 8 | 0) | 0; $9_1 = $3 >> 31; $6_1 = __wasm_i64_mul($3, $9_1, $1_1, 0); $4_1 = i64toi32_i32$HIGH_BITS; $8_1 = $4_1; HEAP32[$5_1 >> 2] = $6_1; HEAP32[$5_1 + 4 >> 2] = $4_1; if ($2_1) { break block } $2_1 = 0; $4_1 = HEAP32[$5_1 + 8 >> 2]; $7_1 = HEAP32[$5_1 + 12 >> 2]; if (($6_1 | 0) == ($4_1 | 0) & ($8_1 | 0) == ($7_1 | 0)) { break block } block3 : { block2 : { if (!($4_1 >>> 0 <= $6_1 >>> 0 & ($8_1 | 0) >= ($7_1 | 0) | ($8_1 | 0) > ($7_1 | 0))) { $3 = HEAP32[$0_1 + 64 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 16 >> 2]]($3, $6_1, $8_1) | 0; break block2; } $2_1 = $7_1 + $9_1 | 0; $4_1 = $3 + $4_1 | 0; $2_1 = $4_1 >>> 0 < $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; if ($4_1 >>> 0 > $6_1 >>> 0 & ($2_1 | 0) >= ($8_1 | 0) | ($2_1 | 0) > ($8_1 | 0)) { break block3 } $4_1 = HEAP32[$0_1 + 224 >> 2]; $6_1 = $3; if ($3) { wasm2js_memory_fill($4_1, 0, $3) } $2_1 = HEAP32[$0_1 + 64 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 40 >> 2]]($2_1, 5, $5_1) | 0; $7_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$5_1 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$7_1 >> 2] + 12 >> 2]]($7_1, $4_1, $6_1, $2_1 - $3 | 0, HEAP32[$5_1 + 4 >> 2] - ($9_1 + ($2_1 >>> 0 < $3 >>> 0) | 0) | 0) | 0; } $2_1 = $3; if ($2_1) { break block } } HEAP32[$0_1 + 36 >> 2] = $1_1; $2_1 = 0; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $175($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if (HEAPU8[$0_1 + 17 | 0] <= 1) { $4_1 = 0; if (HEAPU8[$0_1 + 18 | 0] < 2) { break block1 } } $584($0_1); $6_1 = HEAP32[$0_1 + 68 >> 2]; $5_1 = HEAP32[$6_1 >> 2]; block2 : { if (!$5_1) { break block2 } if (($5_1 | 0) == 33512) { $554($6_1); HEAP32[$6_1 >> 2] = 0; break block2; } block8 : { block7 : { block9 : { block4 : { block5 : { block6 : { $4_1 = HEAPU8[$0_1 + 5 | 0]; switch ($4_1 - 1 | 0) { case 0: break block4; case 2: break block6; default: break block5; }; } if (!(HEAP32[$0_1 + 80 >> 2] | HEAP32[$0_1 + 84 >> 2])) { break block7 } $3 = FUNCTION_TABLE[HEAP32[$5_1 + 16 >> 2]]($6_1, 0, 0) | 0; if ($3) { break block8 } if (!HEAPU8[$0_1 + 8 | 0]) { break block7 } $3 = 0; $1_1 = HEAPU8[$0_1 + 10 | 0]; if (!$1_1) { break block8 } $4_1 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$4_1 >> 2] + 20 >> 2]]($4_1, $1_1) | 0; break block8; } if (!HEAPU8[$0_1 + 4 | 0] | $4_1 >>> 0 > 4) { break block9 } } $3 = 1; $3 = $1_1 ? $3 : HEAPU8[$0_1 + 12 | 0] != 0; block12 : { if (!(HEAP32[$0_1 + 80 >> 2] | HEAP32[$0_1 + 84 >> 2])) { $3 = 0; break block12; } $4_1 = HEAP32[$0_1 + 176 >> 2]; $1_1 = HEAP32[$0_1 + 180 >> 2]; block14 : { if ((!($4_1 | $1_1) | $3) == 1) { $3 = FUNCTION_TABLE[HEAP32[$5_1 + 16 >> 2]]($6_1, 0, 0) | 0; break block14; } $3 = FUNCTION_TABLE[HEAP32[$5_1 + 12 >> 2]]($6_1, 33600, 28, 0, 0) | 0; } if ($3) { break block12 } $3 = 0; if (!HEAPU8[$0_1 + 7 | 0]) { $3 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 20 >> 2]]($3, HEAPU8[$0_1 + 10 | 0] | 16) | 0; } if (!$4_1 & ($1_1 | 0) <= 0 | ($1_1 | 0) < 0 | $3) { break block12 } $3 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 24 >> 2]]($3, $7_1 + 8 | 0) | 0; if ($3) { break block12 } $3 = 0; $5_1 = HEAP32[$7_1 + 12 >> 2]; if (($1_1 | 0) >= ($5_1 | 0) & $4_1 >>> 0 >= HEAPU32[$7_1 + 8 >> 2] | ($1_1 | 0) > ($5_1 | 0)) { break block12 } $3 = HEAP32[$0_1 + 68 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 16 >> 2]]($3, $4_1, $1_1) | 0; } HEAP32[$0_1 + 80 >> 2] = 0; HEAP32[$0_1 + 84 >> 2] = 0; break block2; } $1_1 = HEAPU8[$0_1 + 12 | 0]; FUNCTION_TABLE[HEAP32[$5_1 + 4 >> 2]]($6_1) | 0; HEAP32[$6_1 >> 2] = 0; if ($1_1) { break block2 } $1_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$1_1 + 28 >> 2]; if (!$4_1) { break block2 } $3 = FUNCTION_TABLE[$4_1 | 0]($1_1, HEAP32[$0_1 + 188 >> 2], HEAPU8[$0_1 + 9 | 0]) | 0; break block2; } $3 = 0; } HEAP32[$0_1 + 80 >> 2] = 0; HEAP32[$0_1 + 84 >> 2] = 0; } $434(HEAP32[$0_1 + 60 >> 2]); HEAP32[$0_1 + 48 >> 2] = 0; HEAP32[$0_1 + 60 >> 2] = 0; if (!$3) { block19 : { block18 : { if (!HEAPU8[$0_1 + 15 | 0]) { if (!$164($0_1, $2_1)) { break block18 } } $168(HEAP32[$0_1 + 228 >> 2]); $4_1 = HEAP32[$0_1 + 228 >> 2]; break block19; } $4_1 = HEAP32[$0_1 + 228 >> 2]; $1_1 = $4_1; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { HEAP16[$1_1 + 28 >> 1] = HEAPU16[$1_1 + 28 >> 1] & 65523; $1_1 = $1_1 + 40 | 0; continue; } break; }; HEAP32[$4_1 + 8 >> 2] = HEAP32[$4_1 + 4 >> 2]; } $585($4_1, HEAP32[$0_1 + 28 >> 2]); } $1_1 = HEAP32[$0_1 + 232 >> 2]; block22 : { if ($1_1) { $574($1_1); break block22; } if ($3 | !$2_1) { break block22 } $3 = 0; $1_1 = HEAP32[$0_1 + 28 >> 2]; if ($1_1 >>> 0 >= HEAPU32[$0_1 + 36 >> 2]) { break block22 } $3 = $174($0_1, $1_1); } block23 : { if ($3 | !$2_1) { break block23 } $1_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { $3 = FUNCTION_TABLE[HEAP32[$2_1 + 40 >> 2]]($1_1, 22, 0) | 0; if (($3 | 0) != 12) { break block23 } } $3 = 0; } $1_1 = 0; block25 : { if (HEAPU8[$0_1 + 4 | 0]) { break block25 } $2_1 = HEAP32[$0_1 + 232 >> 2]; if ($2_1) { $1_1 = 0; if (!$586($2_1, 0)) { break block25 } } $1_1 = $587($0_1, 1); } HEAP8[$0_1 + 20 | 0] = 0; HEAP8[$0_1 + 17 | 0] = 1; $4_1 = $3 ? $3 : $1_1; } $3 = $4_1; $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $176($0_1, $1_1) { block1 : { switch (($1_1 & 255) - 10 | 0) { case 0: case 3: HEAP8[$0_1 + 17 | 0] = 6; HEAP32[$0_1 + 44 >> 2] = $1_1; HEAP32[$0_1 + 220 >> 2] = $1_1 ? 6 : 7; break; default: break block1; }; } return $1_1; } function $177($0_1) { $434(HEAP32[$0_1 + 64 >> 2]); HEAP32[$0_1 + 64 >> 2] = 0; } function $178($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP8[$1_1 + 19 | 0] = 0; block : { if (!HEAPU8[$0_1 + 8 | 0]) { break block } if (HEAP32[$2_1 + 188 >> 2] >= 2) { block2 : { if (HEAP32[$1_1 + 80 >> 2] != ($0_1 | 0)) { break block2 } HEAP32[$1_1 + 80 >> 2] = 0; HEAP16[$1_1 + 24 >> 1] = HEAPU16[$1_1 + 24 >> 1] & 65343; $3 = $1_1 + 76 | 0; while (1) { $2_1 = HEAP32[$3 >> 2]; if (!$2_1) { break block2 } HEAP8[$2_1 + 8 | 0] = 1; $3 = $2_1 + 12 | 0; continue; }; } HEAP8[$0_1 + 8 | 0] = 1; return; } $2_1 = $1_1 + 76 | 0; while (1) { $3 = HEAP32[$2_1 >> 2]; if ($3) { if (($0_1 | 0) != HEAP32[$3 >> 2]) { $2_1 = $3 + 12 | 0; continue; } HEAP32[$2_1 >> 2] = HEAP32[$3 + 12 >> 2]; if (HEAP32[$3 + 4 >> 2] == 1) { continue } $24($3); continue; } break; }; block7 : { block6 : { if (($0_1 | 0) == HEAP32[$1_1 + 80 >> 2]) { HEAP32[$1_1 + 80 >> 2] = 0; $2_1 = HEAP32[$1_1 + 44 >> 2]; $4_1 = 65343; break block6; } $2_1 = 2; $4_1 = 65407; $3 = HEAP32[$1_1 + 44 >> 2]; if (($3 | 0) != 2) { break block7 } } HEAP16[$1_1 + 24 >> 1] = HEAPU16[$1_1 + 24 >> 1] & $4_1; $3 = $2_1; } $2_1 = $3 - 1 | 0; HEAP32[$1_1 + 44 >> 2] = $2_1; if ($2_1) { break block } HEAP8[$1_1 + 20 | 0] = 0; } HEAP8[$0_1 + 8 | 0] = 0; $613($1_1); } function $179($0_1) { $0_1 = $0_1 + 8 | 0; while (1) { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 251; $0_1 = $0_1 + 24 | 0; continue; } break; }; } function $180($0_1, $1_1) { var $2_1 = 0; if ($1_1 >>> 0 >= 2) { $1_1 = $1_1 - 2 | 0; $1_1 = $1_1 - (($1_1 >>> 0) % ((HEAPU32[$0_1 + 40 >> 2] / 5 | 0) + 1 >>> 0) | 0) | 0; $2_1 = (($1_1 + 1 | 0) == (HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0) ? 3 : 2) + $1_1 | 0; } return $2_1; } function $181($0_1) { $2(11, $0_1, 10331); return 11; } function $182($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = $2_1; $4_1 = $180($0_1, $1_1) + ($2_1 - $1_1 | 0) | 0; $2_1 = HEAPU32[$0_1 + 40 >> 2] / 5 | 0; $2_1 = $1_1 - ($3 + (($4_1 + $2_1 >>> 0) / ($2_1 >>> 0) | 0) | 0) | 0; $3 = (HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0) + 1 | 0; $2_1 = $2_1 - ($3 >>> 0 < $1_1 >>> 0 & $2_1 >>> 0 < $3 >>> 0) | 0; while (1) { $1_1 = $2_1; $2_1 = $1_1 - 1 | 0; if (($180($0_1, $1_1) | 0) == ($1_1 | 0) | ($1_1 | 0) == ($3 | 0)) { continue } break; }; return $1_1; } function $183($0_1, $1_1, $2_1) { var $3 = 0; $0_1 = $0_1 + 8 | 0; block : { while (1) { $0_1 = HEAP32[$0_1 >> 2]; if (!$0_1) { break block } if (!((!$1_1 | HEAP32[$0_1 + 64 >> 2] == ($1_1 | 0)) & ($0_1 | 0) != ($2_1 | 0))) { $0_1 = $0_1 + 24 | 0; continue; } break; }; block4 : { while (1) { block1 : { if (!!$1_1 & HEAP32[$0_1 + 64 >> 2] != ($1_1 | 0) | ($0_1 | 0) == ($2_1 | 0)) { break block1 } block3 : { switch (HEAPU8[$0_1 | 0]) { case 0: case 2: $3 = $627($0_1); if (!$3) { break block1 } break block4; default: break block3; }; } $628($0_1); } $0_1 = HEAP32[$0_1 + 24 >> 2]; if ($0_1) { continue } break; }; $3 = 0; } return $3; } if ($2_1) { HEAP8[$2_1 + 1 | 0] = HEAPU8[$2_1 + 1 | 0] & 223 } return 0; } function $184($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block2 : { block : { if (($180($0_1, $2_1) | 0) == ($2_1 | 0) | ((HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0) + 1 | 0) == ($2_1 | 0)) { break block } if (!$156(HEAP32[HEAP32[$0_1 + 12 >> 2] + 56 >> 2] + 36 | 0)) { $5_1 = 101; break block2; } $5_1 = $623($0_1, $2_1, $4_1 + 31 | 0, $4_1 + 24 | 0); if ($5_1) { break block2 } block5 : { block4 : { block3 : { $6_1 = HEAPU8[$4_1 + 31 | 0]; switch ($6_1 - 1 | 0) { case 0: break block3; case 1: break block4; default: break block5; }; } $5_1 = $181(74794); break block2; } if ($3) { break block } $5_1 = $624($0_1, $4_1 + 16 | 0, $4_1 + 20 | 0, $2_1, 1); if ($5_1) { break block2 } $625(HEAP32[$4_1 + 16 >> 2]); break block; } $5_1 = $189($0_1, $2_1, $4_1 + 16 | 0, 0); if ($5_1) { break block2 } $7_1 = $3 ? 0 : $1_1; $8_1 = $3 ? 0 : 2; while (1) { $9_1 = HEAP32[$0_1 + 48 >> 2]; $5_1 = $624($0_1, $4_1 + 12 | 0, $4_1 + 20 | 0, $7_1, $8_1); if ($5_1) { $625(HEAP32[$4_1 + 16 >> 2]); break block2; } $625(HEAP32[$4_1 + 12 >> 2]); $5_1 = HEAP32[$4_1 + 20 >> 2]; if ($9_1 >>> 0 < $5_1 >>> 0) { $625(HEAP32[$4_1 + 16 >> 2]); $5_1 = $181(74846); break block2; } if (!!$3 & $1_1 >>> 0 < $5_1 >>> 0) { continue } break; }; $1_1 = HEAP32[$4_1 + 16 >> 2]; $5_1 = $626($0_1, $1_1, $6_1, HEAP32[$4_1 + 24 >> 2], $5_1, $3); $625($1_1); if ($5_1) { break block2 } } $5_1 = 0; if ($3) { break block2 } $1_1 = (HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0) + 2 | 0; while (1) { $3 = ($1_1 | 0) == ($2_1 | 0); $2_1 = $2_1 - 1 | 0; if ($3) { continue } if (($180($0_1, $2_1) | 0) == ($2_1 | 0)) { continue } break; }; HEAP32[$0_1 + 48 >> 2] = $2_1; HEAP8[$0_1 + 19 | 0] = 1; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $185($0_1) { var $1_1 = 0, $2_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $1_1 = HEAPU8[$0_1 + 17 | 0]; if (($1_1 | 0) == 6) { return } if ($1_1 >>> 0 >= 2) { block3 : { if (HEAP32[$0_1 + 232 >> 2]) { $1_1 = $583($0_1, 2, -1); $1_1 = (wasm2js_i32$0 = $1_1, wasm2js_i32$1 = $175($0_1, HEAPU8[$0_1 + 20 | 0], 0), wasm2js_i32$2 = $1_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); break block3; } $2_1 = ($1_1 | 0) == 2; if (HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2] ? $2_1 : 1) { $1_1 = $175($0_1, 0, 0); if (HEAPU8[$0_1 + 15 | 0] | $2_1) { break block3 } HEAP32[$0_1 + 220 >> 2] = 6; HEAP8[$0_1 + 17 | 0] = 6; HEAP32[$0_1 + 44 >> 2] = 4; return; } $1_1 = $582($0_1, 0); } $0_1 = $176($0_1, $1_1); } else { $0_1 = 0 } } function $187($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; block1 : { if (!$1_1) { $2_1 = 0; $1_1 = $183($4_1, 0, 0); if (!$1_1) { break block1 } } $188($0_1, $1_1, $2_1); } if (HEAPU8[$0_1 + 8 | 0] == 2) { $185(HEAP32[$4_1 >> 2]); if (!$189($4_1, 1, $3 + 12 | 0, 0)) { $1_1 = HEAP32[$3 + 12 >> 2]; $190($4_1, $1_1); $191($1_1); } HEAP8[$4_1 + 20 | 0] = 1; $177($4_1); } $178($0_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $188($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = !$2_1; block : { label : while (1) { if (!$0_1) { break block } $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $2_1 = $2_1 + 8 | 0; while (1) { $3 = HEAP32[$2_1 >> 2]; if ($3) { block4 : { if (!(HEAP8[$3 + 1 | 0] & 1 | $4_1)) { block3 : { switch (HEAPU8[$3 | 0]) { case 0: case 2: break block3; default: break block4; }; } $2_1 = $627($3); if (!$2_1) { break block4 } $4_1 = 1; $5_1 = $6_1 ? $5_1 : $2_1; $1_1 = $2_1; $6_1 = 1; continue label; } $641($3); HEAP32[$3 + 4 >> 2] = $1_1; HEAP8[$3 | 0] = 4; } $628($3); $2_1 = $3 + 24 | 0; continue; } break; }; break; }; $7_1 = $6_1 ? $5_1 : 0; } return $7_1; } function $189($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; $3 = FUNCTION_TABLE[HEAP32[$5_1 + 220 >> 2]]($5_1, $1_1, $4_1 + 12 | 0, $3) | 0; if (!$3) { HEAP32[$2_1 >> 2] = $617(HEAP32[$4_1 + 12 >> 2], $1_1, $0_1) } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $190($0_1, $1_1) { $1_1 = $156(HEAP32[$1_1 + 56 >> 2] + 28 | 0); if (!$1_1) { $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 28 >> 2] } HEAP32[$0_1 + 48 >> 2] = $1_1; } function $191($0_1) { var $1_1 = 0; $0_1 = HEAP32[$0_1 + 72 >> 2]; $1_1 = HEAP32[$0_1 + 20 >> 2]; $501($0_1); $580($1_1); } function $192($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; block1 : { block : { if (HEAP32[$0_1 + 4 >> 2]) { break block } $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($3 | 0)) { break block1 } $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if (!(HEAP32[$2_1 + 16 >> 2] ? !$2_1 : 1)) { break block } $1_1 = $1_1 + 1 | 0; continue; }; } $4_1 = 1; } return $4_1; } function $193($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = HEAP32[20678]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } $4($0_1); $3 = HEAP8[$0_1 + 24 | 0] & 1 ? !HEAPU8[$0_1 + 177 | 0] : $3; $6_1 = !$3; $2_1 = 0; while (1) { if (!(HEAP32[$0_1 + 20 >> 2] <= ($2_1 | 0))) { $4_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($2_1 << 4) | 0) + 4 >> 2]; if ($4_1) { $7_1 = HEAPU8[$4_1 + 8 | 0]; $187($4_1, $1_1, $6_1); $5_1 = ($7_1 | 0) == 2 ? 1 : $5_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; $383($0_1); $1_1 = HEAP32[20679]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } if ($3) { $342($0_1, 0); $148($0_1); } HEAP32[$0_1 + 512 >> 2] = 0; HEAP32[$0_1 + 516 >> 2] = 0; $1_1 = $0_1 + 520 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $2_1 = HEAP32[$0_1 + 36 >> 2] & -3; HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] & -524289; HEAP32[$0_1 + 36 >> 2] = $2_1; $1_1 = HEAP32[$0_1 + 240 >> 2]; if (!(!$1_1 | !(HEAPU8[$0_1 + 85 | 0] ? $5_1 : 1))) { FUNCTION_TABLE[$1_1 | 0](HEAP32[$0_1 + 236 >> 2]) } } function $194($0_1) { var $1_1 = 0; while (1) { $1_1 = HEAP32[$0_1 + 492 >> 2]; if ($1_1) { HEAP32[$0_1 + 492 >> 2] = HEAP32[$1_1 + 24 >> 2]; $13($0_1, $1_1); continue; } break; }; HEAP8[$0_1 + 93 | 0] = 0; HEAP32[$0_1 + 504 >> 2] = 0; HEAP32[$0_1 + 508 >> 2] = 0; } function $195($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $187($0_1, 0, 0); block1 : { block : { if (!HEAPU8[$0_1 + 9 | 0]) { break block } $1_1 = HEAP32[$2_1 + 68 >> 2]; HEAP32[$2_1 + 68 >> 2] = $1_1 - 1; if (($1_1 | 0) > 1) { break block1 } $1_1 = HEAP32[20677]; if (($1_1 | 0) == ($2_1 | 0)) { HEAP32[20677] = HEAP32[$2_1 + 72 >> 2]; break block; } while (1) { $3 = $1_1; if (!$1_1) { break block } $1_1 = HEAP32[$1_1 + 72 >> 2]; if (($2_1 | 0) != ($1_1 | 0)) { continue } break; }; HEAP32[$3 + 72 >> 2] = HEAP32[$2_1 + 72 >> 2]; } $513(HEAP32[$2_1 >> 2], HEAP32[$0_1 >> 2]); $1_1 = HEAP32[$2_1 + 56 >> 2]; block3 : { if (!$1_1) { break block3 } $3 = HEAP32[$2_1 + 52 >> 2]; if (!$3) { break block3 } FUNCTION_TABLE[$1_1 | 0]($3); } $10(0, HEAP32[$2_1 + 52 >> 2]); $424($2_1); $24($2_1); } $1_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAP32[$0_1 + 28 >> 2]; if ($3) { HEAP32[$3 + 24 >> 2] = $1_1 } if ($1_1) { HEAP32[$1_1 + 28 >> 2] = $3 } $24($0_1); } function $196($0_1, $1_1) { var $2_1 = 0; block : { $1_1 = HEAP32[$1_1 + 36 >> 2]; if (!$1_1) { break block } $2_1 = HEAP32[$1_1 >> 2] - 1 | 0; HEAP32[$1_1 >> 2] = $2_1; if ($2_1) { break block } FUNCTION_TABLE[HEAP32[$1_1 + 4 >> 2]](HEAP32[$1_1 + 8 >> 2]); $13($0_1, $1_1); } } function $197($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = 0; $24(HEAP32[$0_1 + 12 >> 2]); HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 >> 2]; $24($1_1); $1_1 = $2_1; continue; } break; }; HEAP32[$0_1 + 4 >> 2] = 0; } function $198($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$1_1 + 20 >> 2]; if ($2_1) { HEAP32[$2_1 + 28 >> 2] = HEAP32[$2_1 + 28 >> 2] | 16384; $6($0_1, $2_1); HEAP32[$1_1 + 20 >> 2] = 0; } } function $199($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$1_1 + 8 >> 2] - 1 | 0; HEAP32[$1_1 + 8 >> 2] = $2_1; if (!$2_1) { $2_1 = HEAP32[$1_1 + 16 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0](HEAP32[$1_1 + 12 >> 2]) } $10($0_1, $1_1); } } function $200($0_1) { if ($0_1) { $204($0_1); $13(HEAP32[$0_1 + 20 >> 2], $0_1); } } function $201($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0, wasm2js_i32$3 = 0, wasm2js_i32$4 = 0, wasm2js_i32$5 = 0; $7_1 = global$0 - 80 | 0; $1_1 = $7_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $3 = HEAP32[$0_1 >> 2]; if (HEAPU8[$3 + 87 | 0]) { HEAP32[$0_1 + 36 >> 2] = 7 } $1_1 = HEAP32[$0_1 + 216 >> 2]; if ($1_1) { while (1) { $2_1 = $1_1; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($1_1) { continue } break; }; $647($2_1); HEAP32[$0_1 + 224 >> 2] = 0; HEAP32[$0_1 + 216 >> 2] = 0; } $648($0_1); $15(HEAP32[$0_1 + 88 >> 2], HEAP32[$0_1 + 20 >> 2]); while (1) { $2_1 = HEAP32[$0_1 + 220 >> 2]; if ($2_1) { HEAP32[$0_1 + 220 >> 2] = HEAP32[$2_1 + 4 >> 2]; $4_1 = $2_1 + 88 | 0; $6_1 = $4_1 + Math_imul(HEAP32[$2_1 + 60 >> 2], 40) | 0; $1_1 = 0; while (1) { if (($1_1 | 0) < HEAP32[$2_1 + 64 >> 2]) { $5_1 = HEAP32[$6_1 + ($1_1 << 2) >> 2]; if ($5_1) { $649(HEAP32[$2_1 >> 2], $5_1) } $1_1 = $1_1 + 1 | 0; continue; } break; }; $15($4_1, HEAP32[$2_1 + 60 >> 2]); $650(HEAP32[HEAP32[$2_1 >> 2] >> 2], $2_1 + 40 | 0, -1, 0); $13(HEAP32[HEAP32[$2_1 >> 2] >> 2], $2_1); continue; } break; }; if (HEAP32[$0_1 + 236 >> 2]) { $650(HEAP32[$0_1 >> 2], $0_1 + 236 | 0, -1, 0) } block19 : { block6 : { if (!(HEAPU8[$0_1 + 152 | 0] & 128)) { break block6 } $651($0_1); $1_1 = 0; $2_1 = HEAP32[$0_1 + 36 >> 2]; block10 : { block7 : { if (!$2_1) { break block7 } block12 : { block8 : { $4_1 = $2_1 & 255; if ($4_1 >>> 0 > 13) { break block8 } $2_1 = 1; if (!(1 << $4_1 & 9856)) { break block8 } $1_1 = HEAPU16[$0_1 + 152 >> 1]; $10_1 = 1; if (!(!($1_1 & 64) | ($4_1 | 0) != 9)) { break block10 } if (!($1_1 & 32) | ($4_1 | 0) != 13 & ($4_1 | 0) != 7) { break block12 } $11_1 = 2; $10_1 = 0; break block10; } if (HEAPU8[$0_1 + 148 | 0] == 3) { break block7 } $2_1 = 0; $10_1 = 1; break block10; } $193($3, 516); $194($3); HEAP8[$3 + 85 | 0] = 1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; $1_1 = 1; $10_1 = $1_1; if (HEAP32[$0_1 + 36 >> 2]) { break block10 } } $2_1 = $1_1; $652($0_1, 0); $10_1 = 1; } block63 : { block64 : { block50 : { block47 : { block46 : { block20 : { block24 : { block60 : { block32 : { block40 : { block44 : { if (!(!HEAP32[$3 + 408 >> 2] & HEAP32[$3 + 384 >> 2] > 0 | (!HEAPU8[$3 + 85 | 0] | HEAP32[$3 + 192 >> 2] != (!(HEAPU8[$0_1 + 152 | 0] & 64) | 0)))) { $1_1 = HEAP32[$0_1 + 36 >> 2]; if (!(HEAPU8[$0_1 + 148 | 0] != 3 | $2_1 ? $1_1 : 0)) { $1_1 = 1; if ($652($0_1, 1)) { if (HEAPU8[$0_1 + 152 | 0] & 64) { break block19 } $2_1 = 787; break block20; } $1_1 = HEAP32[$3 + 36 >> 2]; if ($1_1 & 2) { HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 32 >> 2]; HEAP32[$3 + 36 >> 2] = $1_1 & -3; $2_1 = 11; break block20; } $6_1 = HEAP32[$3 + 408 >> 2]; $2_1 = 0; HEAP32[$3 + 408 >> 2] = 0; $1_1 = 0; while (1) { if (!(HEAP32[$3 + 384 >> 2] <= ($1_1 | 0) | $2_1)) { $2_1 = 0; $4_1 = HEAP32[HEAP32[$6_1 + ($1_1 << 2) >> 2] + 8 >> 2]; block23 : { if (!$4_1) { break block23 } $5_1 = HEAP32[HEAP32[$4_1 >> 2] + 60 >> 2]; if (!$5_1) { break block23 } $2_1 = FUNCTION_TABLE[$5_1 | 0]($4_1) | 0; $653($0_1, $4_1); } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$3 + 408 >> 2] = $6_1; $5_1 = 0; $4_1 = 0; $1_1 = 0; while (1) { if ($2_1) { break block24 } if (($1_1 | 0) < HEAP32[$3 + 20 >> 2]) { $2_1 = 0; $8_1 = HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0; $6_1 = HEAP32[$8_1 + 4 >> 2]; if (!(!$6_1 | HEAPU8[$6_1 + 8 | 0] != 2)) { $2_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$6_1 >> 2]; $2_1 = HEAP32[$2_1 >> 2]; if (!(1 << HEAPU8[$2_1 + 5 | 0] & 52 | HEAPU8[$8_1 + 8 | 0] == 1 | HEAPU8[$2_1 + 12 | 0])) { $4_1 = !HEAPU8[$2_1 + 16 | 0] + $4_1 | 0 } $5_1 = 1; $2_1 = $552($2_1); } $1_1 = $1_1 + 1 | 0; continue; } break; }; block28 : { if (!$5_1) { break block28 } $1_1 = HEAP32[$3 + 232 >> 2]; if (!$1_1) { break block28 } if (!(FUNCTION_TABLE[$1_1 | 0](HEAP32[$3 + 228 >> 2]) | 0)) { break block28 } $2_1 = 531; break block20; } $2_1 = 0; block31 : { $5_1 = $439(HEAP32[HEAP32[$3 + 16 >> 2] + 4 >> 2]); block30 : { if (!$48($5_1)) { $1_1 = 0; break block30; } $1_1 = 0; if (($4_1 | 0) > 1) { break block31 } } while (1) { if (HEAP32[$3 + 20 >> 2] <= ($1_1 | 0) | $2_1) { break block32 } $2_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if ($2_1) { $2_1 = $154($2_1, 0) } else { $2_1 = 0 } $1_1 = $1_1 + 1 | 0; continue; }; } $6_1 = HEAP32[$3 >> 2]; HEAP32[$7_1 + 76 >> 2] = 0; $1_1 = $48($5_1); HEAP32[$7_1 + 56 >> 2] = 0; HEAP32[$7_1 + 52 >> 2] = $5_1; HEAP32[$7_1 + 48 >> 2] = 0; $13_1 = $310($3, 17970, $7_1 + 48 | 0); if (!$13_1) { $2_1 = 7; break block24; } $8_1 = $13_1 + 4 | 0; $4_1 = $8_1 + $1_1 | 0; $1_1 = 0; block38 : { while (1) { block36 : { if (!$1_1) { break block36 } if ($1_1 >>> 0 >= 101) { HEAP32[$7_1 + 16 >> 2] = $8_1; $64(13, 8111, $7_1 + 16 | 0); $1_1 = HEAP32[$6_1 + 28 >> 2]; if (!$1_1) { break block38 } FUNCTION_TABLE[$1_1 | 0]($6_1, $8_1, 0) | 0; break block38; } if (($1_1 | 0) != 1) { break block36 } HEAP32[$7_1 + 32 >> 2] = $8_1; $64(13, 8563, $7_1 + 32 | 0); } $65(4, $7_1 + 68 | 0); $2_1 = HEAP32[$7_1 + 68 >> 2]; HEAP32[$7_1 >> 2] = $2_1 >>> 8; HEAP32[$7_1 + 4 >> 2] = $2_1 & 255; $63(13, $4_1, 18795, $7_1); $2_1 = FUNCTION_TABLE[HEAP32[$6_1 + 32 >> 2]]($6_1, $8_1, 0, $7_1 + 72 | 0) | 0; if (!$2_1) { $1_1 = $1_1 + 1 | 0; if (HEAP32[$7_1 + 72 >> 2]) { continue } } break; }; if ($2_1) { break block40 } } $1_1 = 0; $2_1 = $654($6_1, $8_1, $7_1 + 76 | 0, 16406, 0); if ($2_1) { break block40 } $4_1 = 0; $5_1 = HEAP32[$7_1 + 76 >> 2]; block41 : { while (1) { if (HEAP32[$3 + 20 >> 2] <= ($1_1 | 0)) { break block41 } block43 : { $2_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; block42 : { if (!$2_1 | HEAPU8[$2_1 + 8 | 0] != 2) { break block42 } $12_1 = HEAP32[HEAP32[HEAP32[$2_1 + 4 >> 2] >> 2] + 188 >> 2]; if (!$12_1) { break block42 } $2_1 = ((((((wasm2js_i32$1 = $5_1, wasm2js_i32$2 = $12_1), wasm2js_i32$3 = $48($12_1) + 1 | 0), wasm2js_i32$4 = $9_1), wasm2js_i32$5 = $4_1), wasm2js_i32$0 = HEAP32[HEAP32[$5_1 >> 2] + 12 >> 2]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0, wasm2js_i32$3 | 0, wasm2js_i32$4 | 0, wasm2js_i32$5 | 0) | 0); $12_1 = $48($12_1); if ($2_1) { break block43 } $2_1 = $12_1 + 1 | 0; $9_1 = $2_1 + $9_1 | 0; $4_1 = $2_1 >>> 0 > $9_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; } $1_1 = $1_1 + 1 | 0; continue; } break; }; $655($5_1); $1_1 = HEAP32[$6_1 + 28 >> 2]; if (!$1_1) { break block40 } FUNCTION_TABLE[$1_1 | 0]($6_1, $8_1, 0) | 0; break block40; } if (FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 48 >> 2]]($5_1) & 1024) { break block44 } $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 20 >> 2]]($5_1, 2) | 0; if (!$2_1) { break block44 } $655($5_1); $1_1 = HEAP32[$6_1 + 28 >> 2]; if (!$1_1) { break block40 } FUNCTION_TABLE[$1_1 | 0]($6_1, $8_1, 0) | 0; break block40; } if (!(($1_1 | 0) != 17 | HEAP32[$3 + 184 >> 2] < 2)) { HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; break block46; } $193($3, 0); HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; break block46; } if (!$10_1) { break block47 } $11_1 = 1; if (!HEAP32[$0_1 + 36 >> 2]) { break block47 } block48 : { switch (HEAPU8[$0_1 + 148 | 0] - 2 | 0) { default: $193($3, 516); $194($3); $11_1 = 0; break block50; case 1: break block47; case 0: break block48; }; } $11_1 = 2; break block47; } $2_1 = 0; $1_1 = 0; block51 : { while (1) { if ($2_1) { break block51 } if (($1_1 | 0) < HEAP32[$3 + 20 >> 2]) { $2_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if ($2_1) { $2_1 = $154($2_1, $8_1) } else { $2_1 = 0 } $1_1 = $1_1 + 1 | 0; continue; } break; }; $655($5_1); $1_1 = HEAP32[$6_1 + 28 >> 2]; if ($1_1) { $2_1 = FUNCTION_TABLE[$1_1 | 0]($6_1, $8_1, 1) | 0 } else { $2_1 = 0 } $13($3, $13_1); if ($2_1) { break block24 } $1_1 = 0; $2_1 = HEAP32[20678]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } while (1) { if (($1_1 | 0) < HEAP32[$3 + 20 >> 2]) { $2_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if ($2_1) { $153($2_1, 1) } $1_1 = $1_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[20679]; if (!$1_1) { break block60 } FUNCTION_TABLE[$1_1 | 0](); break block60; } $655($5_1); } $13($3, $13_1); break block24; } $1_1 = 0; while (1) { if ($2_1) { break block24 } if (HEAP32[$3 + 20 >> 2] <= ($1_1 | 0)) { break block60 } $2_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if ($2_1) { $2_1 = $153($2_1, 0) } else { $2_1 = 0 } $1_1 = $1_1 + 1 | 0; continue; }; } $664($3, 64); HEAP32[$3 + 512 >> 2] = 0; HEAP32[$3 + 516 >> 2] = 0; $1_1 = $3 + 520 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = HEAP32[$3 + 36 >> 2]; HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 32 >> 2] & -524289; HEAP32[$3 + 36 >> 2] = $1_1; HEAP32[$3 + 24 >> 2] = HEAP32[$3 + 24 >> 2] & -2; break block46; } $1_1 = 5; if (($2_1 | 0) != 5) { break block20 } $2_1 = 5; if (HEAPU8[$0_1 + 152 | 0] & 64) { break block19 } } $133($3, $2_1); HEAP32[$0_1 + 36 >> 2] = $2_1; $193($3, 0); HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; } HEAP32[$3 + 508 >> 2] = 0; $1_1 = 0; if ($10_1) { break block63 } } if (!HEAP32[HEAP32[$0_1 >> 2] + 508 >> 2] | !HEAP32[$0_1 + 48 >> 2]) { break block64 } $2_1 = 0; $4_1 = 0; $6_1 = HEAP32[$0_1 + 48 >> 2] - 1 | 0; $1_1 = HEAP32[$0_1 >> 2]; $9_1 = ($11_1 | 0) != 2; while (1) { if (($4_1 | 0) < HEAP32[$1_1 + 20 >> 2]) { $5_1 = HEAP32[(HEAP32[$1_1 + 16 >> 2] + ($4_1 << 4) | 0) + 4 >> 2]; if ($5_1) { block3 : { if (!$9_1) { $8_1 = $665($5_1, 2, $6_1); if ($8_1) { break block3 } } $8_1 = $665($5_1, 1, $6_1); } $2_1 = $2_1 ? $2_1 : $8_1; } $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 + 508 >> 2] = HEAP32[$1_1 + 508 >> 2] - 1; HEAP32[$0_1 + 48 >> 2] = 0; block71 : { block62 : { if (!$2_1) { if (($11_1 | 0) == 2) { $2_1 = $666($1_1, 2, $6_1); if ($2_1) { break block62 } } $2_1 = $666($1_1, 1, $6_1); } if (($11_1 | 0) != 2) { break block71 } } $4_1 = HEAP32[$0_1 + 76 >> 2]; HEAP32[$1_1 + 512 >> 2] = HEAP32[$0_1 + 72 >> 2]; HEAP32[$1_1 + 516 >> 2] = $4_1; $4_1 = HEAP32[$0_1 + 84 >> 2]; HEAP32[$1_1 + 520 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$1_1 + 524 >> 2] = $4_1; } if (!$2_1) { break block64 } $1_1 = HEAP32[$0_1 + 36 >> 2]; if (!(!!$1_1 & ($1_1 & 255) != 19)) { HEAP32[$0_1 + 36 >> 2] = $2_1; $10($3, HEAP32[$0_1 + 124 >> 2]); HEAP32[$0_1 + 124 >> 2] = 0; } $193($3, 516); $194($3); } HEAP8[$3 + 85 | 0] = 1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; } $1_1 = $11_1; } if (!(HEAPU8[$0_1 + 152 | 0] & 16)) { break block6 } $9_1 = 0; $4_1 = 0; if (($1_1 | 0) != 2) { $4_1 = HEAP32[$0_1 + 44 >> 2]; $1_1 = $4_1 + HEAP32[$3 + 116 >> 2] | 0; $9_1 = HEAP32[$0_1 + 40 >> 2]; $2_1 = $9_1 + HEAP32[$3 + 112 >> 2] | 0; HEAP32[$3 + 112 >> 2] = $2_1; HEAP32[$3 + 116 >> 2] = $2_1 >>> 0 < $9_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; } HEAP32[$3 + 104 >> 2] = $9_1; HEAP32[$3 + 108 >> 2] = $4_1; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; } HEAP32[$3 + 184 >> 2] = HEAP32[$3 + 184 >> 2] - 1; $1_1 = HEAPU16[$0_1 + 152 >> 1]; if (!($1_1 & 64)) { HEAP32[$3 + 192 >> 2] = HEAP32[$3 + 192 >> 2] - 1; $1_1 = HEAPU16[$0_1 + 152 >> 1]; } if ($1_1 & 128) { HEAP32[$3 + 188 >> 2] = HEAP32[$3 + 188 >> 2] - 1 } HEAP8[$0_1 + 151 | 0] = 3; if (!HEAPU8[$3 + 87 | 0]) { $1_1 = HEAP32[$0_1 + 36 >> 2] == 5 ? 5 : 0; break block19; } HEAP32[$0_1 + 36 >> 2] = 7; $1_1 = 0; } $0_1 = $7_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $203($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; while (1) { if (!(HEAP16[$0_1 + 16 >> 1] <= ($1_1 | 0))) { $2_1 = Math_imul($1_1, 40); $204($2_1 + HEAP32[$0_1 + 100 >> 2] | 0); HEAP16[(HEAP32[$0_1 + 100 >> 2] + $2_1 | 0) + 16 >> 1] = 1; $1_1 = $1_1 + 1 | 0; continue; } break; }; if (HEAP32[$0_1 + 228 >> 2]) { HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532 | 1 } return 0; } function $204($0_1) { if (HEAPU8[$0_1 + 17 | 0] & 144 | HEAP32[$0_1 + 24 >> 2]) { $205($0_1) } } function $205($0_1) { if (HEAPU8[$0_1 + 17 | 0] & 144) { $242($0_1) } if (HEAP32[$0_1 + 24 >> 2]) { $13(HEAP32[$0_1 + 20 >> 2], HEAP32[$0_1 + 32 >> 2]); HEAP32[$0_1 + 24 >> 2] = 0; } HEAP32[$0_1 + 8 >> 2] = 0; } function $206($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; block2 : { $1_1 = HEAPU16[$0_1 + 16 >> 1]; if ($1_1 & 18) { if ($1_1 & 1024) { if ($207($0_1)) { break block2 } $1_1 = HEAPU16[$0_1 + 16 >> 1]; } HEAP16[$0_1 + 16 >> 1] = $1_1 | 16; if (!HEAP32[$0_1 + 12 >> 2]) { break block2 } return HEAP32[$0_1 + 8 >> 2]; } return $53($0_1) | 0; } return 0; } function $207($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0; block1 : { if (($1_1 | 0) <= 0) { $1_1 = 1; if (!(HEAPU8[$0_1 + 16 | 0] & 16)) { break block1 } } $2_1 = 7; if ($108($0_1, $1_1, 1)) { break block1 } $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { wasm2js_memory_fill(HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0, 0, $1_1) } HEAP32[$0_1 + 12 >> 2] = HEAP32[$0_1 + 12 >> 2] + HEAP32[$0_1 >> 2]; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 63999; } return $2_1; } function $208($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$0_1) { break block } $2_1 = HEAPU16[$0_1 + 16 >> 1]; if (!(($2_1 & 514) != 514 | HEAPU8[$0_1 + 18 | 0] != ($1_1 | 0))) { return HEAP32[$0_1 + 8 >> 2] } if ($2_1 & 1) { break block } $3 = $219($0_1, $1_1); } return $3; } function $209($0_1) { $0_1 = $0_1 | 0; return $210($0_1, 1) | 0; } function $210($0_1, $1_1) { var $2_1 = 0, $3 = 0; block1 : { $3 = HEAPU16[$0_1 + 16 >> 1]; block : { if (!($3 & 2)) { break block } $2_1 = HEAPU8[$0_1 + 18 | 0]; if (($2_1 | 0) == ($1_1 | 0)) { break block1 } if (($1_1 | 0) == 1) { break block } if (($2_1 | 0) != 1) { break block1 } } block3 : { if ($3 & 16) { $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = $1_1; if (!($3 & 1024)) { break block3 } return HEAP32[$0_1 >> 2] + $1_1 | 0; } $2_1 = 0; if ($3 & 1) { break block3 } if ($219($0_1, $1_1)) { $2_1 = HEAP32[$0_1 + 12 >> 2] } else { $2_1 = 0 } } return $2_1; } return HEAP32[$0_1 + 12 >> 2]; } function $213($0_1) { $0_1 = $0_1 | 0; return +$39($0_1); } function $215($0_1) { $0_1 = $0_1 | 0; return $50($0_1) | 0; } function $217($0_1) { $0_1 = $50($0_1); return $0_1; } function $219($0_1, $1_1) { var $2_1 = 0; block2 : { $2_1 = HEAPU16[$0_1 + 16 >> 1]; block5 : { if ($2_1 & 18) { if ($2_1 & 1024) { if ($207($0_1)) { break block2 } $2_1 = HEAPU16[$0_1 + 16 >> 1]; } HEAP16[$0_1 + 16 >> 1] = $2_1 | 2; $2_1 = $1_1 & 247; if (($2_1 | 0) != HEAPU8[$0_1 + 18 | 0]) { $228($0_1, $2_1) } if (!(!($1_1 & 8) | !(HEAP8[$0_1 + 8 | 0] & 1))) { if ($223($0_1)) { break block2 } } if ((HEAPU16[$0_1 + 16 >> 1] & 514) != 2) { break block5 } $224($0_1); break block5; } $669($0_1, $1_1, 0); } if (HEAPU8[$0_1 + 18 | 0] != ($1_1 & 247)) { break block2 } return HEAP32[$0_1 + 8 >> 2]; } return 0; } function $221($0_1) { $0_1 = $0_1 | 0; return HEAPU8[(HEAPU16[$0_1 + 16 >> 1] & 63) + 31328 | 0]; } function $222($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!$0_1) { break block } $1_1 = $23(40); if (!$1_1) { break block } wasm2js_memory_fill($1_1, 0, 40); $4_1 = $1_1 + 16 | 0; $2_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$4_1 >> 2] = $2_1; $5_1 = $0_1 + 8 | 0; $3 = HEAP32[$5_1 + 4 >> 2]; $6_1 = $1_1 + 8 | 0; HEAP32[$6_1 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 4 >> 2] = $3; $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $3; HEAP32[$1_1 + 20 >> 2] = 0; $0_1 = $2_1 & 61439; HEAP16[$4_1 >> 1] = $0_1; block3 : { if ($2_1 & 18) { HEAP16[$1_1 + 16 >> 1] = $2_1 & 36863 | 16384; if (!$223($1_1)) { break block3 } $200($1_1); return 0; } if (!($0_1 & 1)) { break block3 } HEAP16[$1_1 + 16 >> 1] = $2_1 & 58861; } $3 = $1_1; } return $3; } function $223($0_1) { var $1_1 = 0; $1_1 = HEAPU16[$0_1 + 16 >> 1]; block2 : { block : { if (!($1_1 & 18)) { break block } if ($1_1 & 1024) { $1_1 = 7; if ($207($0_1)) { break block2 } } if (!!HEAP32[$0_1 + 24 >> 2] & HEAP32[$0_1 + 8 >> 2] == HEAP32[$0_1 + 32 >> 2]) { break block } $1_1 = $224($0_1); if ($1_1) { break block2 } } HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 49151; $1_1 = 0; } return $1_1; } function $224($0_1) { var $1_1 = 0; $1_1 = 7; if (!$108($0_1, HEAP32[$0_1 + 12 >> 2] + 3 | 0, 1)) { HEAP8[HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0] = 0; HEAP8[(HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0) + 1 | 0] = 0; HEAP8[(HEAP32[$0_1 + 8 >> 2] + HEAP32[$0_1 + 12 >> 2] | 0) + 2 | 0] = 0; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 512; $1_1 = 0; } return $1_1; } function $225($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $226($0_1, $1_1, $2_1, 0, $3); } function $226($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; block2 : { $5_1 = HEAP32[$0_1 >> 2]; $1_1 = $111($5_1, $1_1, $2_1, $2_1 >> 31, $3, $4_1); block1 : { if ($1_1) { if (($1_1 | 0) == 18) { break block1 } $227($0_1); return; } $228($5_1, HEAPU8[$0_1 + 24 | 0]); if (!$229($5_1)) { break block2 } } $230($0_1); } } function $227($0_1) { $112(HEAP32[$0_1 >> 2]); HEAP32[$0_1 + 20 >> 2] = 7; $106(HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]); } function $228($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; if (!(HEAPU8[$0_1 + 16 | 0] & 2)) { HEAP8[$0_1 + 18 | 0] = $1_1; return 0; } if (($1_1 | 0) != HEAPU8[$0_1 + 18 | 0]) { __inlined_func$252$41 : { block1 : { $10_1 = $1_1; $6_1 = $0_1; if (!(($1_1 | 0) == 1 | HEAPU8[$0_1 + 18 | 0] == 1)) { if ($223($0_1)) { break block1 } $2_1 = HEAP32[$0_1 + 8 >> 2]; $0_1 = $2_1 + (HEAP32[$0_1 + 12 >> 2] & -2) | 0; while (1) { if ($0_1 >>> 0 > $2_1 >>> 0) { $1_1 = HEAPU8[$2_1 + 1 | 0]; HEAP8[$2_1 + 1 | 0] = HEAPU8[$2_1 | 0]; HEAP8[$2_1 | 0] = $1_1; $2_1 = $2_1 + 2 | 0; continue; } break; }; HEAP8[$6_1 + 18 | 0] = $10_1; $0_1 = 0; break __inlined_func$252$41; } $7_1 = HEAP32[$6_1 + 12 >> 2]; block4 : { if (($10_1 | 0) == 1) { $7_1 = $7_1 & -2; HEAP32[$6_1 + 12 >> 2] = $7_1; $2_1 = $7_1 >> 31 << 1 | $7_1 >>> 31; $0_1 = $7_1 << 1 | 1; break block4; } $0_1 = $7_1 >> 31 << 1 | $7_1 >>> 31; $2_1 = $0_1 + 1 | 0; $1_1 = $0_1; $0_1 = ($7_1 << 1) + 2 | 0; $2_1 = $0_1 >>> 0 < 2 ? $2_1 : $1_1; } $1_1 = $0_1; $0_1 = HEAP32[$6_1 + 8 >> 2]; $8_1 = $51(HEAP32[$6_1 + 20 >> 2], $1_1, $2_1); if (!$8_1) { break block1 } $9_1 = $0_1 + $7_1 | 0; $2_1 = $8_1; block22 : { block9 : { block8 : { block15 : { block6 : { switch (HEAPU8[$6_1 + 18 | 0] - 1 | 0) { case 0: if (($10_1 | 0) != 2) { break block8 } $3 = $8_1; $1_1 = $0_1; label1 : while (1) { if ($1_1 >>> 0 >= $9_1 >>> 0) { break block9 } $2_1 = $1_1 + 1 | 0; block11 : { $5_1 = HEAPU8[$1_1 | 0]; if ($5_1 >>> 0 < 192) { $1_1 = $2_1; break block11; } $1_1 = $0_1 + $7_1 | 0; $4_1 = HEAPU8[$5_1 + 33456 | 0]; while (1) { block13 : { if ($2_1 >>> 0 < $9_1 >>> 0) { $5_1 = HEAPU8[$2_1 | 0]; if (($5_1 & 192) == 128) { break block13 } $1_1 = $2_1; } $5_1 = 65533; if (($4_1 & -2) == 65534 | $4_1 >>> 0 < 128 | ($4_1 & -2048) == 55296) { break block11 } if ($4_1 >>> 0 <= 65535) { $5_1 = $4_1; break block11; } HEAP8[$3 + 2 | 0] = $4_1; HEAP8[$3 + 3 | 0] = $4_1 >>> 8 & 3 | 220; $2_1 = $4_1 - 65536 | 0; HEAP8[$3 + 1 | 0] = $2_1 >>> 18 & 3 | 216; HEAP8[$3 | 0] = $2_1 >>> 10 & 192 | $4_1 >>> 10 & 63; $3 = $3 + 4 | 0; continue label1; } $4_1 = $5_1 & 63 | $4_1 << 6; $2_1 = $2_1 + 1 | 0; continue; }; } HEAP8[$3 | 0] = $5_1; HEAP8[$3 + 1 | 0] = $5_1 >>> 8; $3 = $3 + 2 | 0; continue; }; default: while (1) { if ($0_1 >>> 0 >= $9_1 >>> 0) { break block15 } $3 = HEAPU8[$0_1 + 1 | 0]; $5_1 = HEAPU8[$0_1 | 0]; $4_1 = $3 | $5_1 << 8; $1_1 = $0_1 + 2 | 0; if (!(($5_1 & 248) != 216 | $1_1 >>> 0 >= $9_1 >>> 0)) { $1_1 = HEAPU8[$0_1 + 2 | 0]; $5_1 = HEAPU8[$0_1 + 3 | 0]; HEAP8[$2_1 + 3 | 0] = $5_1 & 63 | 128; $4_1 = ($4_1 << 10 & 983040) + 65536 | 0; HEAP8[$2_1 | 0] = $4_1 >>> 18 | 240; $3 = $3 << 10; HEAP8[$2_1 + 1 | 0] = ($4_1 | $3 & 61440) >>> 12 & 63 | 128; HEAP8[$2_1 + 2 | 0] = ($3 | ($5_1 | $1_1 << 8 & 768)) >>> 6 & 63 | 128; $2_1 = $2_1 + 4 | 0; $0_1 = $0_1 + 4 | 0; continue; } if ($4_1 >>> 0 <= 127) { HEAP8[$2_1 | 0] = $3; $2_1 = $2_1 + 1 | 0; $0_1 = $1_1; continue; } if ($5_1 >>> 0 <= 7) { HEAP8[$2_1 + 1 | 0] = $3 & 63 | 128; HEAP8[$2_1 | 0] = $4_1 >>> 6 | 192; $2_1 = $2_1 + 2 | 0; } else { HEAP8[$2_1 + 2 | 0] = $3 & 63 | 128; HEAP8[$2_1 | 0] = $5_1 >>> 4 | 224; HEAP8[$2_1 + 1 | 0] = $4_1 >>> 6 & 63 | 128; $2_1 = $2_1 + 3 | 0; } $0_1 = $1_1; continue; }; case 1: break block6; }; } while (1) { if ($0_1 >>> 0 >= $9_1 >>> 0) { break block15 } $3 = HEAPU8[$0_1 | 0]; $5_1 = HEAPU8[$0_1 + 1 | 0]; $4_1 = $3 | $5_1 << 8; $1_1 = $0_1 + 2 | 0; if (!(($5_1 & 248) != 216 | $1_1 >>> 0 >= $9_1 >>> 0)) { $1_1 = HEAPU8[$0_1 + 3 | 0]; $5_1 = HEAPU8[$0_1 + 2 | 0]; HEAP8[$2_1 + 3 | 0] = $5_1 & 63 | 128; $4_1 = ($4_1 << 10 & 983040) + 65536 | 0; HEAP8[$2_1 | 0] = $4_1 >>> 18 | 240; $3 = $3 << 10; HEAP8[$2_1 + 1 | 0] = ($4_1 | $3 & 61440) >>> 12 & 63 | 128; HEAP8[$2_1 + 2 | 0] = ($3 | ($5_1 | $1_1 << 8 & 768)) >>> 6 & 63 | 128; $2_1 = $2_1 + 4 | 0; $0_1 = $0_1 + 4 | 0; continue; } if ($4_1 >>> 0 <= 127) { HEAP8[$2_1 | 0] = $3; $2_1 = $2_1 + 1 | 0; $0_1 = $1_1; continue; } if ($5_1 >>> 0 <= 7) { HEAP8[$2_1 + 1 | 0] = $3 & 63 | 128; HEAP8[$2_1 | 0] = $4_1 >>> 6 | 192; $2_1 = $2_1 + 2 | 0; } else { HEAP8[$2_1 + 2 | 0] = $3 & 63 | 128; HEAP8[$2_1 | 0] = $5_1 >>> 4 | 224; HEAP8[$2_1 + 1 | 0] = $4_1 >>> 6 & 63 | 128; $2_1 = $2_1 + 3 | 0; } $0_1 = $1_1; continue; }; } HEAP32[$6_1 + 12 >> 2] = $2_1 - $8_1; break block22; } $3 = $8_1; label5 : while (1) { if ($0_1 >>> 0 >= $9_1 >>> 0) { break block9 } $2_1 = $0_1 + 1 | 0; block24 : { $5_1 = HEAPU8[$0_1 | 0]; if ($5_1 >>> 0 < 192) { $0_1 = $2_1; break block24; } $4_1 = HEAPU8[$5_1 + 33456 | 0]; while (1) { block27 : { if ($2_1 >>> 0 >= $9_1 >>> 0) { $0_1 = $9_1 } else { $0_1 = HEAPU8[$2_1 | 0]; if (($0_1 & 192) == 128) { break block27 } $0_1 = $2_1; } $5_1 = 65533; if (($4_1 & -2) == 65534 | $4_1 >>> 0 < 128 | ($4_1 & -2048) == 55296) { break block24 } if ($4_1 >>> 0 <= 65535) { $5_1 = $4_1; break block24; } HEAP8[$3 + 3 | 0] = $4_1; HEAP8[$3 + 2 | 0] = $4_1 >>> 8 & 3 | 220; $1_1 = $4_1 - 65536 | 0; HEAP8[$3 + 1 | 0] = $1_1 >>> 10 & 192 | $4_1 >>> 10 & 63; HEAP8[$3 | 0] = $1_1 >>> 18 & 3 | 216; $3 = $3 + 4 | 0; continue label5; } $4_1 = $0_1 & 63 | $4_1 << 6; $2_1 = $2_1 + 1 | 0; continue; }; } $1_1 = $5_1 << 8 | ($5_1 & 65280) >>> 8; HEAP8[$3 | 0] = $1_1; HEAP8[$3 + 1 | 0] = $1_1 >>> 8; $3 = $3 + 2 | 0; continue; }; } HEAP32[$6_1 + 12 >> 2] = $3 - $8_1; HEAP8[$3 | 0] = 0; $2_1 = $3 + 1 | 0; } HEAP8[$2_1 | 0] = 0; $0_1 = HEAPU16[$6_1 + 16 >> 1]; $204($6_1); HEAP8[$6_1 + 18 | 0] = $10_1; HEAP32[$6_1 + 32 >> 2] = $8_1; HEAP32[$6_1 + 8 >> 2] = $8_1; HEAP16[$6_1 + 16 >> 1] = $0_1 & 2109 | 514; HEAP32[$6_1 + 24 >> 2] = $43(HEAP32[$6_1 + 20 >> 2], $8_1); $0_1 = 0; break __inlined_func$252$41; } $0_1 = 7; } } else { $0_1 = 0 } return $0_1; } function $229($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAPU16[$0_1 + 16 >> 1]; if (!($1_1 & 18)) { return 0 } $2_1 = HEAP32[$0_1 + 12 >> 2]; return HEAP32[HEAP32[$0_1 + 20 >> 2] + 120 >> 2] < (($1_1 & 1024 ? HEAP32[$0_1 >> 2] + $2_1 | 0 : $2_1) | 0); } function $230($0_1) { HEAP32[$0_1 + 20 >> 2] = 18; $111(HEAP32[$0_1 >> 2], 12643, -1, -1, 1, 0); } function $232($0_1, $1_1, $2_1) { if ($1_1 + 1 >>> 0 >= 2) { FUNCTION_TABLE[$1_1 | 0]($0_1) } $230($2_1); } function $233($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = +$1_1; $234(HEAP32[$0_1 >> 2], $1_1); } function $234($0_1, $1_1) { $112($0_1); if ($1_1 == $1_1) { HEAP16[$0_1 + 16 >> 1] = 8; HEAPF64[$0_1 >> 3] = $1_1; } } function $235($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; HEAP32[$0_1 + 20 >> 2] = 1; $111(HEAP32[$0_1 >> 2], $1_1, $2_1, $2_1 >> 31, 1, -1); } function $236($0_1, $1_1) { block : { if (!$0_1) { break block } $0_1 = HEAP32[$0_1 + 264 >> 2]; if (!$0_1) { break block } HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; } } function $237($0_1, $1_1) { if (($1_1 | 0) > HEAP32[$0_1 + 24 >> 2]) { return $108($0_1, $1_1, 0) } HEAP32[$0_1 + 8 >> 2] = HEAP32[$0_1 + 32 >> 2]; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 45; return 0; } function $238($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $110(HEAP32[$0_1 >> 2], $1_1, $1_1 >> 31); } function $240($0_1, $1_1, $2_1) { $110(HEAP32[$0_1 >> 2], $1_1, $2_1); } function $241($0_1) { $0_1 = $0_1 | 0; $112(HEAP32[$0_1 >> 2]); } function $242($0_1) { var $1_1 = 0; $1_1 = HEAP16[$0_1 + 16 >> 1]; if (($1_1 | 0) < 0) { $667($0_1, HEAP32[$0_1 >> 2]); $1_1 = HEAPU16[$0_1 + 16 >> 1]; } if ($1_1 & 4096) { FUNCTION_TABLE[HEAP32[$0_1 + 36 >> 2]](HEAP32[$0_1 + 8 >> 2]) } HEAP16[$0_1 + 16 >> 1] = 1; } function $244($0_1, $1_1, $2_1, $3) { $205($0_1); HEAP32[$0_1 + 36 >> 2] = $3 ? $3 : 8; HEAP8[$0_1 + 19 | 0] = 112; HEAP16[$0_1 + 16 >> 1] = 6657; HEAP32[$0_1 + 8 >> 2] = $1_1; HEAP32[$0_1 >> 2] = $2_1 ? $2_1 : 30822; } function $245($0_1) { $0_1 = $0_1 | 0; } function $246($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $226($0_1, $1_1, $2_1, 1, $3); } function $247($0_1, $1_1, $2_1, $3, $4_1) { if (!(!$3 & $2_1 >>> 0 < 2147483648)) { $232($1_1, $4_1, $0_1); return; } $226($0_1, $1_1, $2_1, 1, $4_1); $248(HEAP32[$0_1 >> 2]); } function $248($0_1) { var $1_1 = 0, $2_1 = 0; block : { $1_1 = HEAPU16[$0_1 + 16 >> 1]; if (($1_1 & 25090) != 2 | HEAPU8[$0_1 + 18 | 0] != 1) { break block } $2_1 = HEAP32[$0_1 + 8 >> 2]; if (!$2_1) { break block } block4 : { if ($1_1 & 4096) { $1_1 = HEAP32[$0_1 + 36 >> 2]; if (($1_1 | 0) == 1) { $1_1 = FUNCTION_TABLE[HEAP32[18897]]($2_1) | 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($1_1 >>> 0 >= $2_1 + 1 >>> 0) { HEAP8[$2_1 + HEAP32[$0_1 + 8 >> 2] | 0] = 0; break block4; } $1_1 = HEAP32[$0_1 + 36 >> 2]; } if (($1_1 | 0) == 9) { break block4 } break block; } $1_1 = HEAP32[$0_1 + 12 >> 2]; if (($1_1 | 0) >= HEAP32[$0_1 + 24 >> 2]) { break block } HEAP8[$1_1 + $2_1 | 0] = 0; } HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 512; } } function $249($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $0_1 = $0_1 - 8 | 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 4 >> 2]; if (!(!$1_1 & $2_1 >>> 0 < 2)) { $1_1 = $1_1 - 1 | 0; $2_1 = $2_1 - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; return; } $24($0_1); } function $250($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; $251($2_1, $1_1); $228($2_1, HEAPU8[$0_1 + 24 | 0]); if ($229($2_1)) { $230($0_1) } } function $251($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (HEAPU8[$0_1 + 17 | 0] & 144) { $242($0_1) } $3 = $0_1 + 16 | 0; $4_1 = HEAP32[$1_1 + 16 >> 2]; HEAP32[$3 >> 2] = $4_1; $2_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$0_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = $2_1; $5_1 = $1_1 + 8 | 0; $6_1 = HEAP32[$5_1 + 4 >> 2]; $2_1 = $0_1 + 8 | 0; HEAP32[$2_1 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $6_1; $2_1 = $4_1 & -4097; HEAP16[$3 >> 1] = $2_1; $3 = 0; if (!(!($4_1 & 18) | HEAPU8[$1_1 + 17 | 0] & 32)) { HEAP16[$0_1 + 16 >> 1] = $2_1 | 16384; $3 = $223($0_1); } return $3; } function $254($0_1, $1_1) { $204($0_1); HEAP16[$0_1 + 16 >> 1] = 1040; HEAP8[$0_1 + 18 | 0] = 1; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 >> 2] = ($1_1 | 0) > 0 ? $1_1 : 0; } function $255($0_1, $1_1) { HEAP32[$0_1 + 20 >> 2] = $1_1 ? $1_1 : -1; if (HEAP8[HEAP32[$0_1 >> 2] + 16 | 0] & 1) { $226($0_1, $256($1_1), -1, 1, 0) } } function $256($0_1) { var $1_1 = 0; block2 : { switch ($0_1 - 100 | 0) { case 0: return 14469; case 1: return 14491; default: break block2; }; } $1_1 = 20342; block3 : { if (($0_1 | 0) == 516) { break block3 } $0_1 = $0_1 & 255; $1_1 = 9149; if ($0_1 >>> 0 > 28 | 1 << $0_1 & 16842756) { break block3 } $1_1 = HEAP32[($0_1 << 2) + 53712 >> 2]; } return $1_1; } function $257($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = HEAP32[$0_1 >> 2]; HEAP32[$3 + 68 >> 2] = -2; HEAP32[$4_1 + 12 >> 2] = $2_1; $1_1 = $135($3, $1_1, $2_1); if (HEAP32[$3 + 68 >> 2] <= -2) { HEAP32[$3 + 68 >> 2] = -1 } block2 : { if (HEAPU8[$3 + 91 | 0]) { $10($3, $1_1); if (!HEAPU8[$3 + 87 | 0]) { break block2 } HEAP32[$0_1 + 12 >> 2] = 7; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block2; } HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; $10($3, HEAP32[$0_1 + 4 >> 2]); HEAP32[$0_1 + 280 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 1; HEAP32[$0_1 + 4 >> 2] = $1_1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $259($0_1) { $0_1 = $0_1 | 0; $24($0_1); } function $260($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; HEAP16[$0_1 + 50 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; block : { if (HEAPU8[$0_1 | 0]) { break block } $1_1 = HEAPU16[$0_1 + 70 >> 1]; $2_1 = $1_1 + 1 | 0; HEAP16[$0_1 + 70 >> 1] = $2_1; $3 = HEAP32[$0_1 + 116 >> 2]; if (HEAPU16[$3 + 24 >> 1] <= ($2_1 & 65535) >>> 0) { HEAP16[$0_1 + 70 >> 1] = $1_1; break block; } if (HEAPU8[$3 + 8 | 0]) { $0_1 = 0 } else { $0_1 = $760($0_1) } return $0_1; } __inlined_func$761$42 : { block11 : { $2_1 = HEAPU8[$0_1 | 0]; block2 : { block0 : { if (!$2_1) { break block0 } if ($2_1 >>> 0 >= 3) { $1_1 = $340($0_1); if ($1_1) { break block2 } $2_1 = HEAPU8[$0_1 | 0]; } $1_1 = 101; block3 : { switch ($2_1 - 1 | 0) { case 0: break block2; case 1: break block3; default: break block0; }; } $1_1 = 0; HEAP8[$0_1 | 0] = 0; if (HEAP32[$0_1 + 4 >> 2] > 0) { break block2 } } $3 = HEAPU16[$0_1 + 70 >> 1] + 1 | 0; HEAP16[$0_1 + 70 >> 1] = $3; $1_1 = HEAP32[$0_1 + 116 >> 2]; block6 : { block5 : { block4 : { $2_1 = HEAP32[18950]; if (!$2_1) { break block4 } if (!(FUNCTION_TABLE[$2_1 | 0](412) | 0)) { break block4 } HEAP8[$1_1 | 0] = 0; break block5; } if (HEAPU8[$1_1 | 0]) { break block6 } } $1_1 = $181(77056); break __inlined_func$761$42; } $2_1 = HEAPU8[$1_1 + 8 | 0]; block9 : { if (HEAPU16[$1_1 + 24 >> 1] <= ($3 & 65535) >>> 0) { if (!$2_1) { $1_1 = $739($0_1, $156((HEAP32[$1_1 + 56 >> 2] + HEAPU8[$1_1 + 9 | 0] | 0) + 8 | 0)); if (!$1_1) { break block9 } break block2; } while (1) { if (!HEAPU8[$0_1 + 68 | 0]) { HEAP8[$0_1 | 0] = 1; $1_1 = 101; break __inlined_func$761$42; } $738($0_1); $1_1 = HEAP32[$0_1 + 116 >> 2]; if (HEAPU16[$0_1 + 70 >> 1] >= HEAPU16[$1_1 + 24 >> 1]) { continue } break; }; if (!HEAPU8[$1_1 + 1 | 0]) { break block11 } $1_1 = $260($0_1); break __inlined_func$761$42; } if ($2_1) { break block11 } } $1_1 = $760($0_1); } break __inlined_func$761$42; } $1_1 = 0; } return $1_1; } function $261($0_1, $1_1) { var $2_1 = 0; $2_1 = $737($0_1); block1 : { if (($2_1 | 0) != 16) { if ($2_1) { break block1 } HEAP32[$1_1 >> 2] = 0; return $760($0_1); } HEAP32[$1_1 >> 2] = 1; $2_1 = 0; } return $2_1; } function $262($0_1) { $633($0_1); return HEAP32[$0_1 + 44 >> 2]; } function $263($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAPU16[$0_1 + 48 >> 1]; $3 = HEAP32[HEAP32[$0_1 + 116 >> 2] + 60 >> 2]; $5_1 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$2_1 + 8 >> 2] = $5_1; $3 = $3 - $5_1 | 0; if ($1_1 >>> 0 <= (($3 | 0) < ($4_1 | 0) ? (($3 | 0) > 0 ? $3 : 0) : $4_1) >>> 0) { HEAP32[$2_1 + 12 >> 2] = $1_1; HEAP16[$2_1 + 16 >> 1] = 16400; return 0; } return $748($0_1, 0, $1_1, $2_1); } function $264($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP8[$0_1 + 1 | 0]; $3 = $4_1 & 255; block1 : { if (($4_1 | 0) >= 0) { $0_1 = (HEAPU8[$0_1 | 0] & 127) << 7 | $3; $3 = 2; break block1; } $4_1 = HEAP8[$0_1 + 2 | 0]; if (($4_1 | 0) >= 0) { $0_1 = $4_1 | ($3 << 7 & 16256 | (HEAPU8[$0_1 | 0] & 127) << 14); $3 = 3; break block1; } $3 = $607($0_1, $2_1 + 8 | 0); $0_1 = HEAP32[$2_1 + 12 >> 2] ? -1 : HEAP32[$2_1 + 8 >> 2]; } HEAP32[$1_1 >> 2] = $0_1; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $265($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block9 : { switch ($1_1 | 0) { case 10: HEAP32[$2_1 + 12 >> 2] = 0; HEAP16[$2_1 + 16 >> 1] = 1025; HEAP32[$2_1 >> 2] = 0; return; case 0: case 11: HEAP16[$2_1 + 16 >> 1] = 1; return; case 1: $0_1 = HEAP8[$0_1 | 0]; $1_1 = $0_1 >> 31; HEAP16[$2_1 + 16 >> 1] = 4; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $1_1; return; case 2: $1_1 = HEAPU8[$0_1 + 1 | 0]; $0_1 = HEAP8[$0_1 | 0]; HEAP16[$2_1 + 16 >> 1] = 4; $0_1 = $1_1 | $0_1 << 8; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $0_1 >> 31; return; case 3: $1_1 = HEAPU8[$0_1 + 2 | 0]; $3 = HEAPU8[$0_1 + 1 | 0]; $0_1 = HEAP8[$0_1 | 0]; HEAP16[$2_1 + 16 >> 1] = 4; $0_1 = $1_1 | ($3 << 8 | $0_1 << 16); HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $0_1 >> 31; return; case 4: $0_1 = HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8 | (HEAPU8[$0_1 + 2 | 0] << 16 | HEAPU8[$0_1 + 3 | 0] << 24); HEAP16[$2_1 + 16 >> 1] = 4; $0_1 = $0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24); HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $0_1 >> 31; return; case 5: $6_1 = HEAPU8[$0_1 + 1 | 0]; $7_1 = HEAP8[$0_1 | 0]; $1_1 = HEAPU8[$0_1 + 5 | 0]; $4_1 = HEAPU8[$0_1 + 4 | 0]; $3 = HEAPU8[$0_1 + 3 | 0]; $5_1 = HEAPU8[$0_1 + 2 | 0]; HEAP16[$2_1 + 16 >> 1] = 4; $6_1 = $6_1 | $7_1 << 8; $0_1 = $3; $3 = $0_1 >>> 16 | 0; $8_1 = $0_1 << 16; $0_1 = $3; $3 = $5_1 >>> 8 | 0; HEAP32[$2_1 >> 2] = $1_1 | ($5_1 << 24 | $8_1 | $4_1 << 8); HEAP32[$2_1 + 4 >> 2] = $0_1 | $3 | $4_1 >>> 24 | $6_1; return; case 6: case 7: $4_1 = HEAPU8[$0_1 + 5 | 0]; $6_1 = $4_1 << 16; $4_1 = HEAPU8[$0_1 + 4 | 0]; $7_1 = $4_1 << 24 | $6_1; $8_1 = $3 | $5_1; $4_1 = HEAPU8[$0_1 + 2 | 0]; $5_1 = HEAPU8[$0_1 + 3 | 0] | $4_1 << 8; $4_1 = HEAPU8[$0_1 + 1 | 0]; $6_1 = $4_1 << 16; $4_1 = HEAPU8[$0_1 | 0]; $4_1 = $4_1 << 24 | $6_1; $3 = $4_1 | $5_1; $5_1 = HEAPU8[$0_1 + 7 | 0] | $7_1; $6_1 = $3 | $8_1; $3 = HEAPU8[$0_1 + 6 | 0]; $0_1 = 0; $3 = $3 << 8 | $5_1; $5_1 = $0_1 | $6_1; $0_1 = 4; if (($1_1 | 0) != 6) { $0_1 = ($4_1 & 2146435072) != 2146435072 ? 8 : $5_1 & 1048575 | $3 ? 1 : 8 } HEAP16[$2_1 + 16 >> 1] = $0_1; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $5_1; return; case 8: case 9: HEAP16[$2_1 + 16 >> 1] = 4; HEAP32[$2_1 >> 2] = $1_1 - 8; HEAP32[$2_1 + 4 >> 2] = 0; return; default: break block9; }; } HEAP32[$2_1 + 8 >> 2] = $0_1; HEAP32[$2_1 + 12 >> 2] = $1_1 - 12 >>> 1; HEAP16[$2_1 + 16 >> 1] = HEAPU16[(($1_1 & 1) << 1) + 34704 >> 1]; } function $266($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAP16[$2_1 + 16 >> 1] >= 0) { $2_1 = HEAP32[$0_1 + 8 >> 2]; __inlined_func$267$43 : { if (($1_1 | 0) <= 0) { $112($2_1); HEAP32[$2_1 + 8 >> 2] = 0; $0_1 = 0; break __inlined_func$267$43; } $237($2_1, $1_1); HEAP16[$2_1 + 16 >> 1] = 32768; HEAP32[$2_1 >> 2] = HEAP32[$0_1 + 4 >> 2]; $0_1 = HEAP32[$2_1 + 8 >> 2]; if ($0_1) { if ($1_1) { wasm2js_memory_fill($0_1, 0, $1_1) } $0_1 = HEAP32[$2_1 + 8 >> 2]; } else { $0_1 = 0 } } return $0_1 | 0; } return HEAP32[$2_1 + 8 >> 2]; } function $268($0_1) { $0_1 = HEAP32[$0_1 + 12 >> 2] + 236 | 0; while (1) { block1 : { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { if (HEAP32[$0_1 + 4 >> 2] != -429938) { break block1 } $0_1 = HEAP32[$0_1 + 8 >> 2]; } else { $0_1 = 0 } return $0_1; } $0_1 = $0_1 + 16 | 0; continue; }; } function $270($0_1, $1_1, $2_1) { $0_1 = $51($0_1, $1_1, $2_1); if (!(!$0_1 | !$1_1)) { wasm2js_memory_fill($0_1, 0, $1_1) } return $0_1; } function $271($0_1) { $0_1 = $0_1 | 0; if (!$0_1) { return 0 } return HEAPU16[$0_1 + 144 >> 1]; } function $272($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; return (!$0_1 | !HEAP32[$0_1 + 120 >> 2] ? $1_1 : HEAPU16[$0_1 + 144 >> 1]) | 0; } function $273($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $1_1 = $206($117($0_1, $1_1)); $118($0_1); return $1_1 | 0; } function $274($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $1_1 = $209($117($0_1, $1_1)); $118($0_1); return $1_1 | 0; } function $275($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0.0; $2_1 = $39($117($0_1, $1_1)); $118($0_1); return +$2_1; } function $276($0_1, $1_1) { var $2_1 = 0; $1_1 = $117($0_1, $1_1); $2_1 = HEAPU16[$1_1 + 16 >> 1]; if ($2_1 & 8192) { HEAP16[$1_1 + 16 >> 1] = $2_1 & 40959 | 16384 } $118($0_1); return $1_1; } function $277($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (($1_1 | 0) < 0) { break block } $2_1 = HEAPU16[$0_1 + 152 >> 1] >>> 2 & 3; if ($2_1) { if ((($2_1 | 0) == 1 ? 8 : 4) >>> 0 <= $1_1 >>> 0) { break block } return HEAP32[(($2_1 << 3) + $1_1 << 2) + 34976 >> 2]; } if (HEAPU16[$0_1 + 144 >> 1] <= $1_1 >>> 0) { break block } $2_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAPU8[$2_1 + 87 | 0]; $3 = $53(HEAP32[$0_1 + 116 >> 2] + Math_imul($1_1, 40) | 0); if ($4_1 >>> 0 >= HEAPU8[$2_1 + 87 | 0]) { break block } $136($2_1); $3 = 0; } return $3; } function $278($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; return $279($0_1, $1_1, $2_1, $3, $3 >> 31, $4_1, 0) | 0; } function $279($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0; $7_1 = $1_1 - 1 | 0; $1_1 = $280($0_1, $7_1); block1 : { if (!$1_1) { $1_1 = 0; if (!$2_1) { break block1 } $7_1 = HEAP32[$0_1 + 100 >> 2] + Math_imul($7_1, 40) | 0; $5_1 = $111($7_1, $2_1, $3, $4_1, $6_1, $5_1); if (!($5_1 | !$6_1)) { $5_1 = $228($7_1, HEAPU8[HEAP32[$0_1 >> 2] + 84 | 0]) } if (!$5_1) { break block1 } $122(HEAP32[$0_1 >> 2], $5_1); return $114(HEAP32[$0_1 >> 2], $5_1); } if ($5_1 + 1 >>> 0 < 2) { break block1 } FUNCTION_TABLE[$5_1 | 0]($2_1); } return $1_1; } function $280($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if ($103($0_1)) { $3 = $1(92298); break block1; } if (HEAPU8[$0_1 + 151 | 0] != 1) { $122(HEAP32[$0_1 >> 2], $1(92302)); HEAP32[$2_1 >> 2] = HEAP32[$0_1 + 200 >> 2]; $64(21, 18372, $2_1); $3 = $1(92306); break block1; } if ($1_1 >>> 0 >= HEAP16[$0_1 + 16 >> 1] >>> 0) { $3 = 25; $122(HEAP32[$0_1 >> 2], 25); break block1; } $3 = HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0; $204($3); HEAP16[$3 + 16 >> 1] = 1; $3 = 0; HEAP32[HEAP32[$0_1 >> 2] + 64 >> 2] = 0; $4_1 = HEAP32[$0_1 + 228 >> 2]; if (!$4_1 | !(($1_1 >>> 0 > 30 ? -2147483648 : 1 << $1_1) & $4_1)) { break block1 } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65532 | 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $281($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = +$2_1; var $3 = 0; $1_1 = $1_1 - 1 | 0; $3 = $280($0_1, $1_1); if (!$3) { $234(HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0, $2_1) } return $3 | 0; } function $282($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return $283($0_1, $1_1, $2_1, $2_1 >> 31) | 0; } function $283($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $1_1 = $1_1 - 1 | 0; $4_1 = $280($0_1, $1_1); if (!$4_1) { $110(HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0, $2_1, $3) } return $4_1; } function $285($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; return $279($0_1, $1_1, $2_1, $3, $3 >> 31, $4_1, 1) | 0; } function $286($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0.0; block4 : { block2 : { block3 : { block1 : { block : { $3 = HEAPU16[$2_1 + 16 >> 1]; switch (HEAPU8[($3 & 63) + 31328 | 0] - 1 | 0) { case 0: break block; case 1: break block1; case 2: break block2; case 3: break block3; default: break block4; }; } return $283($0_1, $1_1, HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2]); } if ($3 & 8) { $4_1 = HEAPF64[$2_1 >> 3] } else { $4_1 = +HEAPU32[$2_1 >> 2] + +HEAP32[$2_1 + 4 >> 2] * 4294967296.0 } return $281($0_1, $1_1, $4_1); } if ($3 & 1024) { $2_1 = HEAP32[$2_1 >> 2]; $1_1 = $1_1 - 1 | 0; $3 = $280($0_1, $1_1); if (!$3) { $254(HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0, $2_1) } return $3; } return $278($0_1, $1_1, HEAP32[$2_1 + 8 >> 2], HEAP32[$2_1 + 12 >> 2], -1); } $3 = $0_1; $0_1 = HEAP32[$2_1 + 12 >> 2]; return $279($3, $1_1, HEAP32[$2_1 + 8 >> 2], $0_1, $0_1 >> 31, -1, HEAPU8[$2_1 + 18 | 0]); } return $280($0_1, $1_1 - 1 | 0); } function $289($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $290($0_1, $1_1, $48($1_1)) | 0; } function $290($0_1, $1_1, $2_1) { var $3 = 0; if (!(!$0_1 | !$1_1)) { $3 = $291(HEAP32[$0_1 + 128 >> 2], $1_1, $2_1) } return $3; } function $291($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if ($0_1) { $6_1 = HEAP32[$0_1 + 4 >> 2]; $3 = 2; while (1) { $4_1 = ($3 << 2) + $0_1 | 0; $5_1 = $4_1 + 8 | 0; if (!($2081($5_1, $1_1, $2_1) | HEAPU8[$2_1 + $5_1 | 0])) { return HEAP32[$4_1 >> 2] } $3 = HEAP32[$4_1 + 4 >> 2] + $3 | 0; if (($3 | 0) < ($6_1 | 0)) { continue } break; }; } return 0; } function $292($0_1, $1_1) { $204($0_1); wasm2js_memory_copy($0_1, $1_1, 40); HEAP32[$1_1 + 24 >> 2] = 0; HEAP16[$1_1 + 16 >> 1] = 1; } function $293($0_1) { $0_1 = $0_1 | 0; if (!$0_1) { return 0 } return HEAP32[$0_1 + 200 >> 2]; } function $295($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = 1; $4_1 = 1; $2_1 = 1; folding_inner1 : { folding_inner0 : { block55 : { block51 : { block49 : { block32 : { block2 : { block26 : { block27 : { block28 : { block : { block1 : { block4 : { block5 : { block8 : { block3 : { block25 : { block7 : { block24 : { block23 : { block22 : { block9 : { block14 : { block12 : { block11 : { block13 : { block21 : { block15 : { block20 : { block19 : { block18 : { block17 : { block16 : { block10 : { block6 : { $5_1 = HEAPU8[$0_1 | 0]; switch (HEAPU8[$5_1 + 37104 | 0]) { case 0: break block; case 1: break block1; case 11: break block10; case 12: break block11; case 13: break block12; case 14: break block13; case 15: break block14; case 16: break block15; case 17: break block16; case 18: break block17; case 19: break block18; case 20: break block19; case 2: case 27: break block2; case 21: break block20; case 22: break block21; case 23: break block22; case 24: break block23; case 25: break block24; case 26: break block25; case 29: break block27; case 30: break block28; case 3: break block3; case 4: case 5: break block4; case 6: break block5; case 7: break block6; case 8: break block7; case 9: break block8; case 10: break block9; default: break block26; }; } while (1) { $2_1 = $4_1; $4_1 = $2_1 + 1 | 0; if (HEAP8[HEAPU8[$0_1 + $2_1 | 0] + 31424 | 0] & 1) { continue } break; }; HEAP32[$1_1 >> 2] = 184; return $2_1; } block30 : { $2_1 = HEAPU8[$0_1 + 1 | 0]; if (($2_1 | 0) != 62) { if (($2_1 | 0) != 45) { break block30 } $2_1 = 2; while (1) { $4_1 = HEAPU8[$0_1 + $2_1 | 0]; if (!(!$4_1 | ($4_1 | 0) == 10)) { $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = 185; return $2_1; } HEAP32[$1_1 >> 2] = 113; return HEAPU8[$0_1 + 2 | 0] == 62 ? 3 : 2; } HEAP32[$1_1 >> 2] = 108; break folding_inner0; } HEAP32[$1_1 >> 2] = 22; break folding_inner0; } HEAP32[$1_1 >> 2] = 23; break folding_inner0; } HEAP32[$1_1 >> 2] = 1; break folding_inner0; } HEAP32[$1_1 >> 2] = 107; break folding_inner0; } HEAP32[$1_1 >> 2] = 109; break folding_inner0; } if (HEAPU8[$0_1 + 1 | 0] != 42) { break block32 } $2_1 = HEAPU8[$0_1 + 2 | 0]; if (!$2_1) { break block32 } $3 = 3; block35 : { while (1) { block34 : { $4_1 = $2_1 & 255; $2_1 = HEAPU8[$0_1 + $3 | 0]; if (($4_1 | 0) == 42 & ($2_1 & 255) == 47) { break block34 } if (!($2_1 & 255)) { break block35 } $3 = $3 + 1 | 0; continue; } break; }; $3 = $3 + 1 | 0; } HEAP32[$1_1 >> 2] = 185; return $3; } HEAP32[$1_1 >> 2] = 111; break folding_inner0; } HEAP32[$1_1 >> 2] = 54; return HEAPU8[$0_1 + 1 | 0] == 61 ? 2 : 1; } block39 : { switch (HEAPU8[$0_1 + 1 | 0] - 60 | 0) { case 1: HEAP32[$1_1 >> 2] = 56; break folding_inner1; case 2: HEAP32[$1_1 >> 2] = 53; break folding_inner1; case 0: HEAP32[$1_1 >> 2] = 105; break folding_inner1; default: break block39; }; } HEAP32[$1_1 >> 2] = 57; break folding_inner0; } block42 : { switch (HEAPU8[$0_1 + 1 | 0] - 61 | 0) { case 0: HEAP32[$1_1 >> 2] = 58; break folding_inner1; case 1: HEAP32[$1_1 >> 2] = 106; break folding_inner1; default: break block42; }; } HEAP32[$1_1 >> 2] = 55; break folding_inner0; } if (HEAPU8[$0_1 + 1 | 0] != 61) { HEAP32[$1_1 >> 2] = 186; break folding_inner0; } HEAP32[$1_1 >> 2] = 53; break folding_inner1; } if (HEAPU8[$0_1 + 1 | 0] != 124) { HEAP32[$1_1 >> 2] = 104; break folding_inner0; } HEAP32[$1_1 >> 2] = 112; break folding_inner1; } HEAP32[$1_1 >> 2] = 25; break folding_inner0; } HEAP32[$1_1 >> 2] = 103; break folding_inner0; } HEAP32[$1_1 >> 2] = 115; break folding_inner0; } block45 : { while (1) { $2_1 = HEAPU8[$0_1 + $3 | 0]; if (!$2_1) { break block45 } block47 : { if (($2_1 | 0) == ($5_1 | 0)) { $3 = $3 + 1 | 0; if (HEAPU8[$3 + $0_1 | 0] != ($5_1 | 0)) { break block47 } } $3 = $3 + 1 | 0; continue; } break; }; if (($5_1 | 0) == 39) { HEAP32[$1_1 >> 2] = 118; return $3; } HEAP32[$1_1 >> 2] = 60; return $3; } HEAP32[$1_1 >> 2] = 186; return $3; } if (HEAPU8[$0_1 + 1 | 0] - 58 >>> 0 > 4294967285) { break block3 } HEAP32[$1_1 >> 2] = 142; break folding_inner0; } $5_1 = 156; HEAP32[$1_1 >> 2] = 156; $3 = HEAPU8[$0_1 | 0]; if (!(HEAPU8[HEAPU8[$0_1 + 2 | 0] + 31424 | 0] & 8) | (($3 | 0) != 48 | (HEAPU8[$0_1 + 1 | 0] | 32) != 120)) { break block49 } $2_1 = 3; while (1) { $4_1 = HEAPU8[$0_1 + $2_1 | 0]; if (!(HEAPU8[$4_1 + 31424 | 0] & 8)) { if (($4_1 | 0) != 95) { break block51 } HEAP32[$1_1 >> 2] = 183; } $2_1 = $2_1 + 1 | 0; continue; }; } block53 : { while (1) { $2_1 = 60; if (($5_1 | 0) == 93) { break block53 } $5_1 = HEAPU8[$0_1 + $3 | 0]; if ($5_1) { $3 = $3 + 1 | 0; continue; } break; }; $2_1 = 186; } HEAP32[$1_1 >> 2] = $2_1; return $3; } HEAP32[$1_1 >> 2] = 157; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; if (HEAPU8[$0_1 + $2_1 | 0] - 58 >>> 0 >= 4294967286) { continue } break; }; break block55; } HEAP32[$1_1 >> 2] = 157; $4_1 = 0; block56 : { while (1) { $3 = HEAPU8[$0_1 + $2_1 | 0]; if (!$3) { break block56 } block60 : { block58 : { if (HEAPU8[$3 + 31424 | 0] & 70) { $4_1 = $4_1 + 1 | 0; break block58; } if (!(($3 | 0) != 40 | ($4_1 | 0) <= 0)) { while (1) { $3 = $2_1; $2_1 = $2_1 + 1 | 0; $5_1 = HEAPU8[$2_1 + $0_1 | 0]; if (!$5_1) { break block60 } if (!(HEAP8[$5_1 + 31424 | 0] & 1) & ($5_1 | 0) != 41) { continue } break; }; if (($5_1 | 0) != 41) { break block60 } $2_1 = $3 + 2 | 0; break block56; } if (($3 | 0) != 58) { break block56 } $3 = $2_1 + 1 | 0; if (HEAPU8[$3 + $0_1 | 0] != 58) { break block56 } $2_1 = $3; } $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = 186; } if ($4_1) { break block55 } HEAP32[$1_1 >> 2] = 186; return $2_1; } if (HEAPU8[HEAPU8[$0_1 + 1 | 0] + 37104 | 0] >= 3) { break block2 } $2_1 = 2; while (1) { $4_1 = $2_1; $2_1 = $2_1 + 1 | 0; $3 = HEAPU8[$0_1 + $4_1 | 0]; if (HEAPU8[$3 + 37104 | 0] < 3) { continue } break; }; if (HEAPU8[$3 + 31424 | 0] & 70) { break block2 } HEAP32[$1_1 >> 2] = 60; return $360($0_1, $4_1, $1_1); } if (HEAPU8[$0_1 + 1 | 0] != 39) { break block2 } HEAP32[$1_1 >> 2] = 155; $3 = 2; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; $4_1 = HEAPU8[$0_1 + $2_1 | 0]; if (HEAPU8[$4_1 + 31424 | 0] & 8) { continue } break; }; block63 : { if (($4_1 | 0) == 39) { $4_1 = 1; if (!($2_1 & 1)) { break block63 } } HEAP32[$1_1 >> 2] = 186; while (1) { $1_1 = HEAPU8[$0_1 + $2_1 | 0]; if (!(!$1_1 | ($1_1 | 0) == 39)) { $2_1 = $2_1 + 1 | 0; continue; } break; }; $4_1 = ($1_1 | 0) != 0; } return $4_1 + $2_1 | 0; } if (HEAPU8[$0_1 + 1 | 0] != 187) { break block2 } if (HEAPU8[$0_1 + 2 | 0] != 191) { break block2 } HEAP32[$1_1 >> 2] = 184; return 3; } HEAP32[$1_1 >> 2] = 186; return 0; } HEAP32[$1_1 >> 2] = 186; break folding_inner0; } while (1) { $4_1 = $2_1; $2_1 = $2_1 + 1 | 0; if (HEAPU8[HEAPU8[$0_1 + $4_1 | 0] + 31424 | 0] & 70) { continue } break; }; HEAP32[$1_1 >> 2] = 60; $2_1 = $4_1; break block55; } HEAP32[$1_1 >> 2] = 110; break folding_inner0; } $2_1 = 0; block67 : { block69 : { while (1) { block68 : { $4_1 = $3 & 255; if ($4_1 - 58 >>> 0 <= 4294967285) { if (($4_1 | 0) != 95) { if (($4_1 | 0) != 46) { break block67 } $4_1 = 154; if (($5_1 | 0) != 156) { break block68 } $3 = 0; break block69; } HEAP32[$1_1 >> 2] = 183; $5_1 = 183; } $2_1 = $2_1 + 1 | 0; $3 = HEAPU8[$2_1 + $0_1 | 0]; continue; } break; }; $3 = 1; } while (1) { if (!$3) { HEAP32[$1_1 >> 2] = $4_1; $5_1 = $4_1; $3 = 1; continue; } while (1) { $2_1 = $2_1 + 1 | 0; $3 = HEAPU8[$2_1 + $0_1 | 0]; if ($3 - 58 >>> 0 > 4294967285) { continue } break; }; $4_1 = 183; if (($3 | 0) != 95) { break block67 } $3 = 0; continue; }; } if ((($3 | 32) & 255) != 101) { break block51 } $4_1 = $0_1 + $2_1 | 0; $3 = HEAPU8[$4_1 + 1 | 0]; if ($3 - 58 >>> 0 <= 4294967285) { block73 : { switch ($3 - 43 | 0) { case 0: case 2: break block73; default: break block51; }; } if (HEAPU8[$4_1 + 2 | 0] - 58 >>> 0 <= 4294967285) { break block51 } } if (($5_1 | 0) == 156) { HEAP32[$1_1 >> 2] = 154 } $2_1 = $2_1 + 2 | 0; while (1) { $4_1 = HEAPU8[$0_1 + $2_1 | 0]; if ($4_1 - 58 >>> 0 <= 4294967285) { if (($4_1 | 0) != 95) { break block51 } HEAP32[$1_1 >> 2] = 183; } $2_1 = $2_1 + 1 | 0; continue; }; } while (1) { if (!(HEAPU8[HEAPU8[$0_1 + $2_1 | 0] + 31424 | 0] & 70)) { break block55 } HEAP32[$1_1 >> 2] = 186; $2_1 = $2_1 + 1 | 0; continue; }; } return $2_1; } return 1; } return 2; } function $296($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block4 : { block5 : { block1 : { $6_1 = HEAPU8[$0_1 | 0]; if (($6_1 | 0) == 45) { $0_1 = $0_1 + 1 | 0; $7_1 = -1; break block1; } if (($6_1 | 0) != 48) { if (($6_1 | 0) != 43) { break block1 } $0_1 = $0_1 + 1 | 0; break block1; } if (!(HEAPU8[HEAPU8[$0_1 + 2 | 0] + 31424 | 0] & 8) | (HEAPU8[$0_1 + 1 | 0] | 32) != 120) { break block1 } $2_1 = $0_1 + 2 | 0; while (1) { $4_1 = $2_1; $2_1 = $2_1 + 1 | 0; if (HEAPU8[$4_1 | 0] == 48) { continue } break; }; $2_1 = 0; $0_1 = 0; while (1) { block3 : { if (($2_1 | 0) == 8) { break block3 } $3 = HEAPU8[$2_1 + $4_1 | 0]; if (!(HEAPU8[$3 + 31424 | 0] & 8)) { break block3 } $0_1 = $3 + ($3 << 1 << 24 >> 24 >>> 7 & 9) & 15 | $0_1 << 4; $2_1 = $2_1 + 1 | 0; continue; } break; }; if (($0_1 | 0) < 0) { break block4 } if (!(HEAPU8[HEAPU8[$2_1 + $4_1 | 0] + 31424 | 0] & 8)) { break block5 } break block4; } $2_1 = HEAPU8[$0_1 | 0]; if ($2_1 - 58 >>> 0 < 4294967286) { break block4 } while (1) { if (($2_1 & 255) != 48) { block7 : { $2_1 = 0; while (1) { if (($2_1 | 0) == 11) { break block7 } $5_1 = HEAPU8[$0_1 + $2_1 | 0]; if (($5_1 - 48 & 255) >>> 0 > 9) { break block7 } $5_1 = $5_1 & 15; $4_1 = __wasm_i64_mul($4_1, $3, 10, 0) + $5_1 | 0; $3 = i64toi32_i32$HIGH_BITS; $3 = $4_1 >>> 0 < $5_1 >>> 0 ? $3 + 1 | 0 : $3; $2_1 = $2_1 + 1 | 0; continue; }; } } else { $2_1 = HEAPU8[$0_1 + 1 | 0]; $0_1 = $0_1 + 1 | 0; continue; } break; }; $5_1 = 0; if ($2_1 >>> 0 > 10) { break block4 } $0_1 = $3 + $7_1 | 0; $3 = $4_1 + $7_1 | 0; $0_1 = $3 >>> 0 < $7_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; if ($3 >>> 0 > 2147483647 & ($0_1 | 0) >= 0 | ($0_1 | 0) > 0) { break block4 } $0_1 = ($6_1 | 0) == 45 ? 0 - $4_1 | 0 : $4_1; } HEAP32[$1_1 >> 2] = $0_1; $5_1 = 1; } return $5_1; } function $297($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $6_1 = global$0 - 16 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (!$0_1) { break block } $3 = HEAP32[$0_1 + 204 >> 2]; if ($3) { break block } $3 = 0; $12_1 = HEAP32[$0_1 + 200 >> 2]; if (!$12_1) { break block } $8_1 = HEAP32[$0_1 >> 2]; HEAP32[$6_1 + 12 >> 2] = -1; $2_1 = $31(24, 0); if ($2_1) { $3 = $8_1 ? HEAP32[$8_1 + 120 >> 2] : 1e9; HEAP16[$2_1 + 20 >> 1] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; } else { $2_1 = 75824 } $1_1 = $2_1; $2_1 = -1; while (1) { $3 = $2_1; block2 : { $4_1 = $13_1 + $12_1 | 0; $7_1 = HEAPU8[$4_1 | 0]; if (!(HEAPU8[$1_1 + 20 | 0] | !$7_1)) { $9_1 = $295($4_1, $6_1 + 12 | 0); $2_1 = HEAP32[$6_1 + 12 >> 2]; if (($9_1 | 0) > 0) { break block2 } } if (($2_1 | 0) != 1) { $36($1_1, 23212, 1) } $2_1 = $0_1; $0_1 = 0; if (!(!$1_1 | ($1_1 | 0) == 75824)) { $0_1 = $57($1_1); $24($1_1); } $3 = $0_1; HEAP32[$2_1 + 204 >> 2] = $3; break block; } $11_1 = ($3 | 0) == 184 ? $11_1 : $3; block11 : { block18 : { block4 : { if ($2_1 - 154 >>> 0 < 4) { break block4 } block12 : { block6 : { switch ($2_1 - 22 | 0) { default: block9 : { block8 : { block10 : { switch ($2_1 - 118 | 0) { case 0: break block4; case 1: case 2: case 3: break block8; case 4: break block9; default: break block10; }; } if ($2_1 - 184 >>> 0 < 2) { break block11 } if (($2_1 | 0) == 60) { break block12 } if (($2_1 | 0) != 139) { break block8 } $5_1 = 0; } if (HEAPU8[$7_1 + 31424 | 0] & 70) { $298($1_1) } $3 = HEAP32[$1_1 + 16 >> 2]; $36($1_1, $4_1, $9_1); while (1) { if (HEAPU32[$1_1 + 16 >> 2] <= $3 >>> 0) { break block11 } $7_1 = HEAP32[$1_1 + 4 >> 2] + $3 | 0; $4_1 = HEAPU8[$7_1 | 0]; HEAP8[$7_1 | 0] = $4_1 & (HEAPU8[$4_1 + 31424 | 0] ^ -1 | 223); $3 = $3 + 1 | 0; continue; }; } if (($11_1 | 0) != 45 & ($11_1 | 0) != 19) { break block4 } $36($1_1, 20314, 5); break block11; case 0: $10_1 = $10_1 + 1 | 0; if (($11_1 | 0) == 50) { $5_1 = HEAP32[$1_1 + 16 >> 2]; $14 = $10_1; } $36($1_1, 27802, 1); break block11; case 1: break block6; }; } if (!(($10_1 | 0) != ($14 | 0) | ($5_1 | 0) <= 0)) { HEAP32[$1_1 + 16 >> 2] = $5_1 + 1; $36($1_1, 21329, 5); $5_1 = 0; } $36($1_1, 27781, 1); $10_1 = $10_1 - 1 | 0; break block11; } $3 = HEAP32[$1_1 + 16 >> 2]; block23 : { if (HEAP8[$7_1 + 31424 | 0] < 0) { $5_1 = $299($8_1, $4_1, $9_1, 0); HEAP32[$6_1 + 8 >> 2] = 0; if (!$5_1) { break block18 } $300($5_1); block22 : { block21 : { block20 : { block19 : { if (HEAPU8[$4_1 | 0] != 34) { break block19 } $4_1 = HEAP32[$0_1 + 208 >> 2]; if (!$4_1) { break block19 } while (1) { if (!$4_1) { break block19 } if (!$2073($5_1, $4_1 + 4 | 0)) { break block20 } $4_1 = HEAP32[$4_1 >> 2]; continue; }; } $4_1 = $48($5_1); if (($295($5_1, $6_1 + 8 | 0) | 0) != ($4_1 | 0) | HEAP32[$6_1 + 8 >> 2] != 60) { break block21 } $298($1_1); $36($1_1, $5_1, $4_1); break block22; } $36($1_1, 21967, 1); $13($8_1, $5_1); break block18; } HEAP32[$6_1 >> 2] = $5_1; $46($1_1, 29439, $6_1); } $13($8_1, $5_1); break block23; } $298($1_1); $36($1_1, $4_1, $9_1); } while (1) { if (HEAPU32[$1_1 + 16 >> 2] <= $3 >>> 0) { break block18 } $5_1 = HEAP32[$1_1 + 4 >> 2] + $3 | 0; HEAP8[$5_1 | 0] = HEAPU8[HEAPU8[$5_1 | 0] + 31040 | 0]; $3 = $3 + 1 | 0; continue; }; } $36($1_1, 21967, 1); break block11; } $5_1 = 0; } $13_1 = $9_1 + $13_1 | 0; continue; }; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $298($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; if (!(!$1_1 | !(HEAPU8[HEAPU8[(HEAP32[$0_1 + 4 >> 2] + $1_1 | 0) - 1 | 0] + 31424 | 0] & 70))) { $36($0_1, 30791, 1) } } function $299($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; block : { if (!$1_1) { break block } $4_1 = $2_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; $0_1 = $325($0_1, $4_1, $3); if (!$0_1) { break block } if ($2_1) { wasm2js_memory_copy($0_1, $1_1, $2_1) } HEAP8[$0_1 + $2_1 | 0] = 0; $5_1 = $0_1; } return $5_1; } function $300($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!$0_1) { break block } $1_1 = HEAPU8[$0_1 | 0]; if (HEAP8[$1_1 + 31424 | 0] >= 0) { break block } $1_1 = ($1_1 | 0) == 91 ? 93 : $1_1; $2_1 = 1; while (1) { block2 : { $3 = HEAPU8[$0_1 + $2_1 | 0]; if (($1_1 | 0) == ($3 | 0)) { $3 = $1_1; $2_1 = $2_1 + 1 | 0; if (HEAPU8[$2_1 + $0_1 | 0] != ($1_1 | 0)) { break block2 } } HEAP8[$0_1 + $4_1 | 0] = $3; $2_1 = $2_1 + 1 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP8[$0_1 + $4_1 | 0] = 0; } } function $301($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAPU16[$0_1 + 16 >> 1]; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $1_1 = 1 << $1_1; $3 = 0; } else { $3 = 1 << $1_1; $1_1 = $3 - 1 & 1 >>> 32 - $1_1; } block1 : { if (!($3 & 262148 | $1_1 & 262144)) { $0_1 = $2_1 & 63; break block1; } $302($0_1, 0); $0_1 = HEAPU16[$0_1 + 16 >> 1] & 63; } return HEAPU8[$0_1 + 31328 | 0]; } function $302($0_1, $1_1) { var $2_1 = 0, $3 = 0.0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $6_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = HEAP32[$0_1 + 12 >> 2]; $8_1 = HEAPU8[$0_1 + 18 | 0]; $2_1 = $303($6_1, $5_1 + 8 | 0, $7_1, $8_1); if (($2_1 | 0) > 0) { $3 = HEAPF64[$5_1 + 8 >> 3]; block7 : { block1 : { if (($2_1 | 0) != 1) { break block1 } block3 : { if ($3 < -9223372036854774784.0) { $2_1 = 0; $4_1 = -2147483648; break block3; } if ($3 > 9223372036854774784.0) { $2_1 = -1; $4_1 = 2147483647; break block3; } if (Math_abs($3) < 9223372036854775808.0) { $2_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $4_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $4_1 = 0 } } else { $2_1 = 0; $4_1 = -2147483648; } } block6 : { if ($304($3, $2_1, $4_1)) { HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $4_1; break block6; } if ($305($6_1, $0_1, $7_1, $8_1)) { break block1 } } $2_1 = HEAPU16[$0_1 + 16 >> 1] | 4; break block7; } HEAPF64[$0_1 >> 3] = $3; $2_1 = HEAPU16[$0_1 + 16 >> 1] | 8; HEAP16[$0_1 + 16 >> 1] = $2_1; if (!$1_1) { break block7 } $306($0_1); $2_1 = HEAPU16[$0_1 + 16 >> 1]; } HEAP16[$0_1 + 16 >> 1] = $2_1 & 65533; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $303($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0.0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0.0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $8_1 = global$0 - 16 | 0; $5_1 = $8_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; block : { if (!$2_1) { break block } block2 : { if (($3 | 0) == 1) { $4_1 = $0_1; $3 = 1; $9_1 = 1; break block2; } $4_1 = 3 - $3 | 0; $2_1 = $2_1 & -2; while (1) { block5 : { if (($2_1 | 0) <= ($4_1 | 0)) { $9_1 = 1 } else { if (!HEAPU8[$0_1 + $4_1 | 0]) { break block5 } $9_1 = -100; } $2_1 = $4_1 ^ 1; $4_1 = ($3 & 1) + $0_1 | 0; $3 = 2; break block2; } $4_1 = $4_1 + 2 | 0; continue; }; } $10_1 = $0_1 + $2_1 | 0; while (1) { if ($4_1 >>> 0 >= $10_1 >>> 0) { break block } $13_1 = HEAPU8[$4_1 | 0]; if (HEAP8[$13_1 + 31424 | 0] & 1) { $4_1 = $3 + $4_1 | 0; continue; } break; }; $0_1 = (($13_1 | 0) == 45 ? $3 : ($13_1 | 0) == 43 ? $3 : 0) + $4_1 | 0; $2_1 = 0; $5_1 = 0; block12 : { block11 : { block8 : { label2 : while (1) { $6_1 = 0; if ($0_1 >>> 0 >= $10_1 >>> 0) { $11_1 = 1; break block8; } $4_1 = HEAPU8[$0_1 | 0]; if ($4_1 - 58 >>> 0 >= 4294967286) { $14 = $14 + 1 | 0; $0_1 = $0_1 + $3 | 0; $6_1 = __wasm_i64_mul($2_1, $5_1, 10, 0); $2_1 = $4_1 << 24 >> 24; $6_1 = $6_1 + $2_1 | 0; $5_1 = i64toi32_i32$HIGH_BITS + ($2_1 >> 31) | 0; $5_1 = ($2_1 >>> 0 > $6_1 >>> 0 ? $5_1 + 1 | 0 : $5_1) - 1 | 0; $2_1 = $6_1 - 48 | 0; $5_1 = $2_1 >>> 0 < 4294967248 ? $5_1 + 1 | 0 : $5_1; if (($5_1 | 0) == 429496729 & $2_1 >>> 0 < 2576980376 | $5_1 >>> 0 < 429496729) { continue } while (1) { if (HEAPU8[$0_1 | 0] - 58 >>> 0 < 4294967286 | $0_1 >>> 0 >= $10_1 >>> 0) { continue label2 } $15_1 = $15_1 + 1 | 0; $0_1 = $0_1 + $3 | 0; continue; }; } break; }; block10 : { if (($4_1 | 0) != 46) { break block10 } $9_1 = $9_1 + 1 | 0; while (1) { $0_1 = $0_1 + $3 | 0; if ($10_1 >>> 0 <= $0_1 >>> 0) { break block10 } $4_1 = HEAPU8[$0_1 | 0]; if ($4_1 - 58 >>> 0 < 4294967286) { break block10 } if (($5_1 | 0) == 429496729 & $2_1 >>> 0 > 2576980375 | $5_1 >>> 0 > 429496729) { continue } $14 = $14 + 1 | 0; $15_1 = $15_1 - 1 | 0; $5_1 = __wasm_i64_mul($2_1, $5_1, 10, 0); $2_1 = $4_1 << 24 >> 24; $4_1 = $5_1 + $2_1 | 0; $5_1 = i64toi32_i32$HIGH_BITS + ($2_1 >> 31) | 0; $5_1 = ($2_1 >>> 0 > $4_1 >>> 0 ? $5_1 + 1 | 0 : $5_1) - 1 | 0; $2_1 = $4_1 - 48 | 0; $5_1 = $2_1 >>> 0 < 4294967248 ? $5_1 + 1 | 0 : $5_1; continue; }; } $11_1 = 1; if ($0_1 >>> 0 < $10_1 >>> 0) { break block11 } } $16_1 = 1; break block12; } block14 : { if ((HEAPU8[$0_1 | 0] | 32) != 101) { $16_1 = 1; break block14; } $9_1 = $9_1 + 1 | 0; $0_1 = $0_1 + $3 | 0; if ($0_1 >>> 0 >= $10_1 >>> 0) { break block12 } block17 : { block16 : { switch (HEAPU8[$0_1 | 0] - 43 | 0) { case 2: $0_1 = $0_1 + $3 | 0; $11_1 = -1; break block17; case 0: break block16; default: break block17; }; } $0_1 = $0_1 + $3 | 0; } while (1) { if ($0_1 >>> 0 >= $10_1 >>> 0) { break block14 } $4_1 = HEAPU8[$0_1 | 0]; if ($4_1 - 58 >>> 0 < 4294967286) { break block14 } $6_1 = ($6_1 | 0) >= 1e4 ? 1e4 : (($4_1 << 24 >> 24) + Math_imul($6_1, 10) | 0) - 48 | 0; $0_1 = $0_1 + $3 | 0; $16_1 = 1; continue; }; } while (1) { if (!(HEAP8[HEAPU8[$0_1 | 0] + 31424 | 0] & 1) | $0_1 >>> 0 >= $10_1 >>> 0) { break block12 } $0_1 = $0_1 + $3 | 0; continue; }; } block31 : { if ($2_1 | $5_1) { $4_1 = Math_imul($6_1, $11_1) + $15_1 | 0; while (1) { if (!(($5_1 | 0) == 429496729 & $2_1 >>> 0 > 2576980171 | $5_1 >>> 0 > 429496729 | ($4_1 | 0) <= 0)) { $4_1 = $4_1 - 1 | 0; $2_1 = __wasm_i64_mul($2_1, $5_1, 10, 0); $5_1 = i64toi32_i32$HIGH_BITS; continue; } break; }; while (1) { block22 : { $6_1 = __wasm_i64_udiv($2_1, $5_1, 10, 0); $3 = i64toi32_i32$HIGH_BITS; if (($4_1 | 0) >= 0) { break block22 } $11_1 = __wasm_i64_mul($6_1, $3, 10, 0); if ($2_1 - $11_1 | $5_1 - (i64toi32_i32$HIGH_BITS + ($2_1 >>> 0 < $11_1 >>> 0) | 0)) { break block22 } $4_1 = $4_1 + 1 | 0; $2_1 = $6_1; $5_1 = $3; continue; } break; }; $7_1 = +($2_1 >>> 0) + +($5_1 >>> 0) * 4294967296.0; HEAPF64[$8_1 >> 3] = $7_1; $12_1 = 0.0; block23 : { if (!($7_1 <= 18446744073709549568.0)) { break block23 } if ($7_1 < 18446744073709551615.0 & $7_1 >= 0.0) { $6_1 = ~~$7_1 >>> 0; if (Math_abs($7_1) >= 1.0) { $3 = ~~($7_1 > 0.0 ? Math_min(Math_floor($7_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($7_1 - +(~~$7_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $3 = 0 } } else { $6_1 = 0; $3 = 0; } $11_1 = $2_1 >>> 0 < $6_1 >>> 0; if (!(($3 | 0) == ($5_1 | 0) & $11_1 | $5_1 >>> 0 < $3 >>> 0)) { $12_1 = +($2_1 - $6_1 >>> 0) + +($5_1 - ($11_1 + $3 | 0) >>> 0) * 4294967296.0; break block23; } $12_1 = -(+($6_1 - $2_1 >>> 0) + +($3 - (($2_1 >>> 0 > $6_1 >>> 0) + $5_1 | 0) >>> 0) * 4294967296.0); } HEAPF64[$8_1 + 8 >> 3] = $12_1; block28 : { if (($4_1 | 0) > 0) { while (1) if ($4_1 >>> 0 < 100) { while (1) if ($4_1 >>> 0 < 10) { while (1) { if (($4_1 | 0) <= 0) { break block28 } $47($8_1, 10.0, 0.0); $4_1 = $4_1 - 1 | 0; continue; } } else { $47($8_1, 1.0e10, 0.0); $4_1 = $4_1 - 10 | 0; continue; } } else { $47($8_1, 1.e+100, -1590289110975991791564023.0e59); $4_1 = $4_1 - 100 | 0; continue; } } while (1) if (($4_1 | 0) > -100) { while (1) if (($4_1 | 0) > -10) { while (1) { if (($4_1 | 0) >= 0) { break block28 } $47($8_1, .1, -5.551115123125783e-18); $4_1 = $4_1 + 1 | 0; continue; } } else { $47($8_1, 1.0e-10, -3.643219731549774e-27); $4_1 = $4_1 + 10 | 0; continue; } } else { $47($8_1, 1.0e-100, -1.9991899802602883e-117); $4_1 = $4_1 + 100 | 0; continue; }; } $7_1 = HEAPF64[$8_1 >> 3] + HEAPF64[$8_1 + 8 >> 3]; $7_1 = $7_1 == $7_1 ? $7_1 : Infinity; HEAPF64[$1_1 >> 3] = $7_1; if (($13_1 | 0) != 45) { break block31 } $12_1 = -$7_1; } else { $12_1 = ($13_1 | 0) == 45 ? -0.0 : 0.0 } HEAPF64[$1_1 >> 3] = $12_1; } if (!(!(($0_1 | 0) == ($10_1 | 0) & ($14 | 0) > 0 & $16_1) | ($9_1 | 0) <= 0)) { $6_1 = $9_1; break block; } block33 : { if (($9_1 | 0) < 2) { break block33 } $6_1 = -1; if (($16_1 ^ -1) & ($9_1 | 0) != 3) { break block33 } if (($14 | 0) > 0) { break block } } $6_1 = 0; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $304($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = 1; block : { if ($0_1 == 0.0) { break block } $3 = 0; if (($2_1 | 0) < -524288) { break block } wasm2js_scratch_store_f64(+$0_1); $4_1 = wasm2js_scratch_load_i32(1) | 0; $5_1 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+(+($1_1 >>> 0) + +($2_1 | 0) * 4294967296.0)); $1_1 = wasm2js_scratch_load_i32(1) | 0; if (($5_1 | 0) != (wasm2js_scratch_load_i32(0) | 0) | ($1_1 | 0) != ($4_1 | 0)) { break block } $3 = ($2_1 | 0) < 524288; } return $3; } function $305($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; block1 : { if (($3 | 0) == 1) { $4_1 = $0_1; $3 = 1; break block1; } $5_1 = 3 - $3 | 0; $2_1 = $2_1 & -2; while (1) { if (!(HEAPU8[$0_1 + $5_1 | 0] | ($2_1 | 0) <= ($5_1 | 0))) { $5_1 = $5_1 + 2 | 0; continue; } break; }; $9_1 = ($2_1 | 0) > ($5_1 | 0); $2_1 = $5_1 ^ 1; $4_1 = ($3 & 1) + $0_1 | 0; $3 = 2; } $10_1 = $0_1 + $2_1 | 0; block3 : { while (1) { $8_1 = 1; if ($4_1 >>> 0 >= $10_1 >>> 0) { break block3 } $0_1 = HEAPU8[$4_1 | 0]; if (HEAP8[$0_1 + 31424 | 0] & 1) { $4_1 = $3 + $4_1 | 0; continue; } break; }; block5 : { switch ($0_1 - 43 | 0) { case 2: $4_1 = $3 + $4_1 | 0; $8_1 = 0; break block3; case 0: break block5; default: break block3; }; } $4_1 = $3 + $4_1 | 0; } $5_1 = $4_1; while (1) { if (!(HEAPU8[$5_1 | 0] == 48 & $5_1 >>> 0 < $10_1 >>> 0)) { $2_1 = 0; $0_1 = 0; while (1) { block9 : { $6_1 = $2_1 + $5_1 | 0; $11_1 = $6_1 >>> 0 >= $10_1 >>> 0; if ($11_1) { break block9 } $6_1 = HEAPU8[$6_1 | 0]; if (($6_1 - 48 & 255) >>> 0 > 9) { break block9 } $2_1 = $2_1 + $3 | 0; $0_1 = __wasm_i64_mul($0_1, $7_1, 10, 0); $7_1 = $6_1 & 255; $6_1 = $0_1 + $7_1 | 0; $0_1 = i64toi32_i32$HIGH_BITS; $7_1 = ($7_1 >>> 0 > $6_1 >>> 0 ? $0_1 + 1 | 0 : $0_1) - 1 | 0; $0_1 = $6_1 - 48 | 0; $7_1 = $0_1 >>> 0 < 4294967248 ? $7_1 + 1 | 0 : $7_1; continue; } break; }; $6_1 = $8_1 ? $7_1 : 0 - ($7_1 + (($0_1 | 0) != 0) | 0) | 0; $12_1 = $8_1 ? $0_1 : 0 - $0_1 | 0; $0_1 = ($7_1 | 0) < 0; HEAP32[$1_1 >> 2] = $0_1 ? ($8_1 ? -1 : 0) : $12_1; HEAP32[$1_1 + 4 >> 2] = $0_1 ? ($8_1 ? 2147483647 : -2147483648) : $6_1; block11 : { if (!(($4_1 | 0) != ($5_1 | 0) | $2_1)) { $9_1 = -1; break block11; } if ($9_1 | $11_1) { break block11 } $4_1 = $2_1; while (1) { $9_1 = 1; if (!(HEAP8[HEAPU8[$4_1 + $5_1 | 0] + 31424 | 0] & 1)) { break block11 } $4_1 = $3 + $4_1 | 0; if ($10_1 >>> 0 > $5_1 + $4_1 >>> 0) { continue } break; }; $9_1 = 0; } $4_1 = Math_imul($3, 19); block12 : { if ($4_1 >>> 0 > $2_1 >>> 0) { break block12 } $0_1 = 1; if ($2_1 >>> 0 <= $4_1 >>> 0) { $4_1 = 0; $0_1 = 0; while (1) { if (!($4_1 >>> 0 > 17 | $0_1)) { $0_1 = Math_imul(HEAP8[Math_imul($3, $4_1) + $5_1 | 0] - HEAP8[$4_1 + 24546 | 0] | 0, 10); $4_1 = $4_1 + 1 | 0; continue; } break; }; $0_1 = $0_1 ? $0_1 : HEAP8[Math_imul($3, 18) + $5_1 | 0] - 56 | 0; if (($0_1 | 0) < 0) { break block12 } } HEAP32[$1_1 >> 2] = $8_1 ? -1 : 0; HEAP32[$1_1 + 4 >> 2] = $8_1 ? 2147483647 : -2147483648; $9_1 = $0_1 ? 2 : $8_1 ? 3 : $9_1; } return $9_1; } $5_1 = $3 + $5_1 | 0; continue; }; } function $306($0_1) { var $1_1 = 0.0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block4 : { $4_1 = HEAPU16[$0_1 + 16 >> 1]; if (!($4_1 & 32)) { $1_1 = HEAPF64[$0_1 >> 3]; block2 : { if ($1_1 < -9223372036854774784.0) { $2_1 = -2147483648; break block2; } if ($1_1 > 9223372036854774784.0) { $3 = -1; $2_1 = 2147483647; break block2; } if (Math_abs($1_1) < 9223372036854775808.0) { $3 = ~~$1_1 >>> 0; if (Math_abs($1_1) >= 1.0) { $2_1 = ~~($1_1 > 0.0 ? Math_min(Math_floor($1_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($1_1 - +(~~$1_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $2_1 = 0 } } else { $2_1 = -2147483648 } } if (+($3 >>> 0) + +($2_1 | 0) * 4294967296.0 != $1_1) { break block4 } $5_1 = $2_1 + 2147483647 | 0; $6_1 = $3 - 1 | 0; if (((($6_1 | 0) != -1 ? $5_1 + 1 | 0 : $5_1) | 0) == -1 & $6_1 >>> 0 > 4294967293) { break block4 } HEAP32[$0_1 >> 2] = $3; HEAP32[$0_1 + 4 >> 2] = $2_1; } HEAP16[$0_1 + 16 >> 1] = $4_1 & 62016 | 4; } } function $308($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $6_1 = global$0 - 48 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $4_1 = HEAP32[$0_1 >> 2]; block9 : { block1 : { if (!(HEAPU8[$4_1 + 24 | 0] & 16)) { if ($318($0_1)) { break block1 } } $5_1 = $319($4_1, $2_1, $3); block8 : { if (!$5_1) { block5 : { block7 : { block3 : { if (HEAPU8[$4_1 + 177 | 0] | HEAPU8[$0_1 + 25 | 0] & 4) { break block3 } $5_1 = $320($4_1 + 388 | 0, $2_1); if (!$5_1) { if ($68($2_1, 18323, 7)) { break block3 } $5_1 = $321($2_1 + 7 | 0); if (!$5_1 | !(HEAPU8[$5_1 + 5 | 0] & 48)) { break block3 } $5_1 = $322($4_1, $2_1, 35248, $5_1, 0); if (!$5_1) { break block3 } } $8_1 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 44 >> 2] = 0; if (HEAP32[$5_1 + 20 >> 2]) { break block5 } $7_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$8_1 + 4 >> 2]; if (!!$4_1 & ($4_1 | 0) != HEAP32[$8_1 + 8 >> 2]) { break block3 } $4_1 = $270($7_1, 64, 0); if (!$4_1) { break block3 } $9_1 = $116($7_1, HEAP32[$5_1 + 4 >> 2]); HEAP32[$4_1 >> 2] = $9_1; if ($9_1) { break block7 } $13($7_1, $4_1); } if ($1_1 >>> 0 > 1) { break block1 } HEAP8[$0_1 + 17 | 0] = 1; break block8; } HEAP32[$5_1 + 20 >> 2] = $4_1; HEAP8[$4_1 + 43 | 0] = 1; HEAP32[$4_1 + 24 >> 2] = 1; $1_1 = HEAP32[HEAP32[$7_1 + 16 >> 2] + 12 >> 2]; HEAP16[$4_1 + 32 >> 1] = 65535; HEAP32[$4_1 + 60 >> 2] = $1_1; HEAP32[$4_1 + 28 >> 2] = HEAP32[$4_1 + 28 >> 2] | 32768; $323($0_1, $4_1, $116($7_1, $9_1)); $323($0_1, $4_1, 0); $323($0_1, $4_1, $116($7_1, HEAP32[$4_1 >> 2])); if (!$324($7_1, $4_1, $5_1, HEAP32[$8_1 + 8 >> 2], $6_1 + 44 | 0)) { break block5 } $1_1 = HEAP32[$6_1 + 44 >> 2]; HEAP32[$6_1 + 32 >> 2] = $1_1; $257($0_1, 8932, $6_1 + 32 | 0); $10($7_1, $1_1); $198($7_1, $5_1); } $5_1 = HEAP32[$5_1 + 20 >> 2]; break block9; } if (!(HEAPU8[$0_1 + 25 | 0] & 4) | HEAPU8[$5_1 + 43 | 0] != 1) { break block9 } } $1_1 = $1_1 & 1 ? 1759 : 14338; if ($3) { HEAP32[$6_1 + 24 >> 2] = $2_1; HEAP32[$6_1 + 20 >> 2] = $3; HEAP32[$6_1 + 16 >> 2] = $1_1; $257($0_1, 6397, $6_1 + 16 | 0); break block1; } HEAP32[$6_1 + 4 >> 2] = $2_1; HEAP32[$6_1 >> 2] = $1_1; $257($0_1, 7843, $6_1); } $5_1 = 0; } $0_1 = $6_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $309($0_1, $1_1) { var $2_1 = 0, $3 = 0; if (!$1_1) { return -32768 } $3 = HEAP32[$0_1 + 16 >> 2]; $0_1 = 0; while (1) { $2_1 = $0_1; $0_1 = $2_1 + 1 | 0; if (HEAP32[(($2_1 << 4) + $3 | 0) + 12 >> 2] != ($1_1 | 0)) { continue } break; }; return $2_1; } function $310($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = $2_1; $1_1 = $135($0_1, $1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $311($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = $325($2_1, 240, 0); if ($1_1) { wasm2js_memory_fill($1_1 + 104 | 0, 0, 136); HEAP32[$1_1 >> 2] = $2_1; $3 = $2_1 + 4 | 0; $2_1 = HEAP32[$2_1 + 4 >> 2]; if ($2_1) { HEAP32[$2_1 + 4 >> 2] = $1_1 + 8 } HEAP32[$1_1 + 4 >> 2] = $3; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$3 >> 2] = $1_1; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 8 >> 2] = $1_1; $326($1_1, 8, 0, 1); } return $1_1; } function $312($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; $6_1 = HEAP32[$0_1 + 108 >> 2]; if (($6_1 | 0) >= HEAP32[$0_1 + 112 >> 2]) { $1_1 = $835($0_1, $1_1, $2_1, $3, $4_1); if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0; HEAP32[$0_1 + 16 >> 2] = $5_1; HEAP8[$0_1 + 1 | 0] = 253; } return $1_1; } HEAP32[$0_1 + 108 >> 2] = $6_1 + 1; $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($6_1, 20) | 0; HEAP32[$0_1 + 16 >> 2] = $5_1; HEAP32[$0_1 + 12 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = $3; HEAP32[$0_1 + 4 >> 2] = $2_1; HEAP16[$0_1 + 2 >> 1] = 0; HEAP8[$0_1 | 0] = $1_1; HEAP8[$0_1 + 1 | 0] = 253; return $6_1; } function $313($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = HEAP32[$0_1 + 108 >> 2]; block1 : { if (HEAP32[$0_1 + 112 >> 2] < ($3 + $1_1 | 0)) { if ($328($0_1)) { break block1 } $3 = HEAP32[$0_1 + 108 >> 2]; } $5_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($3, 20) | 0; $3 = $5_1; while (1) { if (($1_1 | 0) != ($6_1 | 0)) { $7_1 = HEAPU8[$2_1 | 0]; HEAP8[$3 | 0] = $7_1; HEAP32[$3 + 4 >> 2] = HEAP8[$2_1 + 1 | 0]; $4_1 = HEAP8[$2_1 + 2 | 0]; HEAP32[$3 + 8 >> 2] = $4_1; if (!(!(HEAP8[$7_1 + 35056 | 0] & 1) | ($4_1 | 0) <= 0)) { HEAP32[$3 + 8 >> 2] = $4_1 + HEAP32[$0_1 + 108 >> 2] } $4_1 = HEAP8[$2_1 + 3 | 0]; HEAP32[$3 + 16 >> 2] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP32[$3 + 12 >> 2] = $4_1; HEAP16[$3 + 2 >> 1] = 0; $3 = $3 + 20 | 0; $2_1 = $2_1 + 4 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 108 >> 2] = HEAP32[$0_1 + 108 >> 2] + $1_1; } return $5_1; } function $314($0_1, $1_1) { var $2_1 = 0; $2_1 = 1 << $1_1; HEAP32[$0_1 + 156 >> 2] = $2_1 | HEAP32[$0_1 + 156 >> 2]; if (!(!HEAPU8[HEAP32[(HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2] + 9 | 0] | ($1_1 | 0) == 1)) { HEAP32[$0_1 + 160 >> 2] = HEAP32[$0_1 + 160 >> 2] | $2_1 } } function $315($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block1 : { $4_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$4_1 + 87 | 0]) { if (($3 | 0) == -11) { break block1 } $329($4_1, $3, $2_1); return; } $1_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul(($1_1 | 0) < 0 ? HEAP32[$0_1 + 108 >> 2] - 1 | 0 : $1_1, 20) | 0; if (!(!HEAPU8[$1_1 + 1 | 0] & ($3 | 0) < 0)) { if (HEAPU8[$1_1 + 1 | 0]) { HEAP32[$1_1 + 16 >> 2] = 0; HEAP8[$1_1 + 1 | 0] = 0; } __inlined_func$330$49 : { if (($3 | 0) < 0) { $315($0_1, ($1_1 - HEAP32[$0_1 + 104 >> 2] | 0) / 20 | 0, $2_1, $3); break __inlined_func$330$49; } if (!$3) { $3 = $48($2_1) } $0_1 = $299(HEAP32[$0_1 >> 2], $2_1, $3, 0); HEAP8[$1_1 + 1 | 0] = 250; HEAP32[$1_1 + 16 >> 2] = $0_1; } return; } if (($3 | 0) == -3) { HEAP8[$1_1 + 1 | 0] = 253; HEAP32[$1_1 + 16 >> 2] = $2_1; return; } if (!$2_1) { break block1 } HEAP8[$1_1 + 1 | 0] = $3; HEAP32[$1_1 + 16 >> 2] = $2_1; if (($3 | 0) != -11) { break block1 } HEAP32[$2_1 + 12 >> 2] = HEAP32[$2_1 + 12 >> 2] + 1; } } function $316($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $14 = global$0 - 16 | 0; $5_1 = $14; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$0_1 + 128 >> 2] = HEAP32[$1_1 + 240 >> 2]; $5_1 = 0; HEAP32[$1_1 + 240 >> 2] = 0; $19_1 = HEAP16[$1_1 + 220 >> 1]; $15_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$1_1 + 48 >> 2]; $17_1 = HEAP32[$1_1 + 44 >> 2]; HEAP32[$14 + 12 >> 2] = HEAP32[$1_1 + 108 >> 2]; $3 = HEAP32[$1_1 + 52 >> 2]; $2_1 = HEAP32[$0_1 + 104 >> 2]; $4_1 = HEAP32[$0_1 + 108 >> 2]; $331($0_1, $14 + 12 | 0); $10_1 = $6_1 + $17_1 | 0; $7_1 = !$17_1 & ($10_1 | 0) > 0; $12_1 = $3; $3 = Math_imul($4_1, 20) + 7 & -8; $6_1 = $12_1 - $3 & -8; $10_1 = $7_1 + $10_1 | 0; $3 = $2_1 + $3 | 0; $2_1 = $6_1 >> 31; $5_1 = HEAPU16[$0_1 + 152 >> 1] & -33 | (HEAPU8[$1_1 + 20 | 0] ? (HEAPU8[$1_1 + 21 | 0] ? 32 : 0) : $5_1); HEAP16[$0_1 + 152 >> 1] = $5_1; $1_1 = HEAPU8[$1_1 + 223 | 0]; if ($1_1) { $1_1 = $1_1 << 2 & 12; HEAP16[$0_1 + 144 >> 1] = $1_1 ^ 12; $10_1 = ($10_1 | 0) <= 10 ? 10 : $10_1; $5_1 = $1_1 | $5_1 & -13; } HEAP16[$0_1 + 152 >> 1] = $5_1 & 65532; $5_1 = Math_imul($10_1, 40); $1_1 = $6_1 - $5_1 | 0; $7_1 = $2_1 - ($5_1 >>> 0 > $6_1 >>> 0) | 0; $8_1 = ($2_1 | 0) <= 0 & $5_1 >>> 0 > $6_1 >>> 0 | ($2_1 | 0) < 0; HEAP32[$0_1 + 88 >> 2] = $8_1 ? 0 : $1_1 + $3 | 0; $1_1 = $8_1 ? $6_1 : $1_1; $6_1 = Math_imul($19_1, 40); $4_1 = $1_1 - $6_1 | 0; $2_1 = $8_1 ? $2_1 : $7_1; $7_1 = $2_1 - ($1_1 >>> 0 < $6_1 >>> 0) | 0; $18_1 = $1_1 >>> 0 < $6_1 >>> 0 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0; HEAP32[$0_1 + 100 >> 2] = $18_1 ? 0 : $3 + $4_1 | 0; $1_1 = $18_1 ? $1_1 : $4_1; $2_1 = $18_1 ? $2_1 : $7_1; $4_1 = 0; $7_1 = (HEAP32[$14 + 12 >> 2] << 2) + 7 | 0; $4_1 = $7_1 >>> 0 < 7 ? 1 : $4_1; $7_1 = $7_1 & -8; $13_1 = $1_1 - $7_1 | 0; $16_1 = $4_1 & 1; $4_1 = $16_1; $11_1 = $1_1 >>> 0 < $7_1 >>> 0; $9_1 = $2_1 - ($4_1 + $11_1 | 0) | 0; $11_1 = ($2_1 | 0) <= ($4_1 | 0) & $11_1 | ($2_1 | 0) < ($4_1 | 0); HEAP32[$0_1 + 92 >> 2] = $11_1 ? 0 : $3 + $13_1 | 0; $1_1 = $11_1 ? $1_1 : $13_1; $4_1 = $11_1 ? $2_1 : $9_1; $2_1 = 0; $13_1 = $17_1 << 2; $9_1 = $13_1 + 7 | 0; $2_1 = $9_1 >>> 0 < 7 ? 1 : $2_1; $9_1 = $9_1 & -8; $20_1 = ($1_1 - $9_1 | 0) + $3 | 0; $12_1 = $2_1 & 1; $2_1 = $12_1; $3 = $1_1 >>> 0 < $9_1 >>> 0 & ($2_1 | 0) >= ($4_1 | 0) | ($2_1 | 0) > ($4_1 | 0); HEAP32[$0_1 + 96 >> 2] = $3 ? 0 : $20_1; $2_1 = $8_1 ? $5_1 : 0; $1_1 = $2_1 + ($18_1 ? $6_1 : 0) | 0; $4_1 = 0; $4_1 = $1_1 >>> 0 < $2_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $8_1 = $11_1 ? $7_1 : 0; $1_1 = $8_1 + $1_1 | 0; $2_1 = ($11_1 & $16_1) + $4_1 | 0; $2_1 = $1_1 >>> 0 < $8_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $4_1 = $3 ? $9_1 : 0; $1_1 = $4_1 + $1_1 | 0; $3 = ($3 ? $12_1 : 0) + $2_1 | 0; block9 : { block8 : { $3 = $1_1 >>> 0 < $4_1 >>> 0 ? $3 + 1 | 0 : $3; block3 : { if ($3 | $1_1) { $4_1 = $325($15_1, $1_1, $3); HEAP32[$0_1 + 212 >> 2] = $4_1; if (HEAPU8[$15_1 + 87 | 0]) { break block3 } $2_1 = HEAP32[$0_1 + 88 >> 2]; block4 : { if ($2_1) { break block4 } $2_1 = 0; $8_1 = $1_1 >>> 0 < $5_1 >>> 0; if ($8_1 & !$3) { break block4 } $3 = $3 - $8_1 | 0; $1_1 = $1_1 - $5_1 | 0; $2_1 = $1_1 + $4_1 | 0; } HEAP32[$0_1 + 88 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 100 >> 2]; block5 : { if ($2_1) { break block5 } $2_1 = 0; $5_1 = $1_1 >>> 0 < $6_1 >>> 0; if ($5_1 & !$3) { break block5 } $3 = $3 - $5_1 | 0; $1_1 = $1_1 - $6_1 | 0; $2_1 = $1_1 + $4_1 | 0; } HEAP32[$0_1 + 100 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 92 >> 2]; block6 : { if ($2_1) { break block6 } $2_1 = 0; $5_1 = $1_1 >>> 0 < $7_1 >>> 0; if ($5_1 & ($3 | 0) <= ($16_1 | 0) | ($3 | 0) < ($16_1 | 0)) { break block6 } $3 = $3 - ($5_1 + $16_1 | 0) | 0; $1_1 = $1_1 - $7_1 | 0; $2_1 = $1_1 + $4_1 | 0; } HEAP32[$0_1 + 92 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 96 >> 2]; block7 : { if ($2_1) { break block7 } $2_1 = 0; if ($1_1 >>> 0 < $9_1 >>> 0 & ($3 | 0) <= ($12_1 | 0) | ($3 | 0) < ($12_1 | 0)) { break block7 } $2_1 = ($1_1 - $9_1 | 0) + $4_1 | 0; } HEAP32[$0_1 + 96 >> 2] = $2_1; break block8; } if (!HEAPU8[$15_1 + 87 | 0]) { break block8 } } HEAP16[$0_1 + 16 >> 1] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 0; break block9; } HEAP16[$0_1 + 16 >> 1] = $19_1; HEAP32[$0_1 + 24 >> 2] = $17_1; $332(HEAP32[$0_1 + 100 >> 2], $19_1, $15_1, 1); HEAP32[$0_1 + 20 >> 2] = $10_1; $332(HEAP32[$0_1 + 88 >> 2], $10_1, $15_1, 0); if (!$13_1) { break block9 } wasm2js_memory_fill(HEAP32[$0_1 + 96 >> 2], 0, $13_1); } $120($0_1); $0_1 = $14 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $317($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $6_1 = global$0 - 48 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = HEAP32[$0_1 + 16 >> 2]; $110(HEAP32[$4_1 + 88 >> 2] + 40 | 0, $1_1, $2_1); block1 : { if (HEAP32[$4_1 + 32 >> 2] >= 5) { HEAP32[$4_1 + 32 >> 2] = 4; $5_1 = $107($4_1); break block1; } $5_1 = $94(HEAP32[$0_1 + 16 >> 2]); } block5 : { if (($5_1 | 0) == 100) { $5_1 = 11741; block4 : { $2_1 = HEAPU16[$0_1 + 8 >> 1]; $4_1 = HEAP32[HEAP32[$4_1 + 96 >> 2] >> 2]; if ($2_1 >>> 0 < HEAPU16[$4_1 + 54 >> 1]) { $1_1 = $4_1 + 84 | 0; $5_1 = HEAP32[$1_1 + ($2_1 << 2) >> 2]; if ($5_1 >>> 0 > 11) { break block4 } $5_1 = $5_1 ? (($5_1 | 0) == 7 ? 11963 : 9730) : 11741; } $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$6_1 >> 2] = $5_1; $1_1 = $310($1_1, 6928, $6_1); $100(HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 16 >> 2] = 0; $5_1 = 1; break block5; } HEAP32[$0_1 + 4 >> 2] = HEAP32[(HEAP16[$4_1 + 52 >> 1] + $2_1 << 2) + $1_1 >> 2]; if ($5_1 >>> 0 >= 128) { $1_1 = $5_1 - 12 >>> 1 | 0 } else { $1_1 = HEAPU8[$5_1 + 34576 | 0] } HEAP32[$0_1 >> 2] = $1_1; $1_1 = $0_1; $0_1 = HEAP32[$4_1 + 36 >> 2]; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] | 16; HEAP8[HEAP32[$0_1 + 8 >> 2] + 11 | 0] = 1; $1_1 = 0; $5_1 = 0; break block5; } $4_1 = HEAP32[$0_1 + 16 >> 2]; if (!$4_1) { $1_1 = 0; break block5; } $5_1 = $100($4_1); HEAP32[$0_1 + 16 >> 2] = 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; if (!$5_1) { HEAP32[$6_1 + 16 >> 2] = $1_1; HEAP32[$6_1 + 20 >> 2] = $2_1; $5_1 = 1; $1_1 = $310($0_1, 15077, $6_1 + 16 | 0); break block5; } HEAP32[$6_1 + 32 >> 2] = $127($0_1); $1_1 = $310($0_1, 8932, $6_1 + 32 | 0); } HEAP32[$3 >> 2] = $1_1; $0_1 = $6_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $318($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; block : { if (HEAPU8[$1_1 + 177 | 0]) { break block } $2_1 = $416($1_1, $0_1 + 4 | 0); if ($2_1) { HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; return $2_1; } if (!HEAPU8[$1_1 + 95 | 0]) { break block } HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] | 16; } return 0; } function $319($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; block3 : { block7 : { block6 : { if ($2_1) { $3 = HEAP32[$0_1 + 20 >> 2]; $5_1 = ($3 | 0) > 0 ? $3 : 0; block2 : { while (1) { if (($4_1 | 0) != ($5_1 | 0)) { $3 = HEAP32[$0_1 + 16 >> 2]; if (!$67($2_1, HEAP32[$3 + ($4_1 << 4) >> 2])) { break block2 } $4_1 = $4_1 + 1 | 0; continue; } break; }; $3 = 0; if ($67($2_1, 11378)) { break block3 } $3 = HEAP32[$0_1 + 16 >> 2]; $4_1 = 0; } $3 = $320(HEAP32[(($4_1 << 4) + $3 | 0) + 12 >> 2] + 8 | 0, $1_1); if ($3) { break block3 } $3 = 0; if ($68($1_1, 18315, 7)) { break block3 } $1_1 = $1_1 + 7 | 0; if (($4_1 | 0) == 1) { if (!$67($1_1, 18208)) { break block6 } if (!$67($1_1, 18227)) { break block6 } if ($67($1_1, 9330)) { break block3 } break block6; } if ($67($1_1, 18227)) { break block3 } $4_1 = (HEAP32[$0_1 + 16 >> 2] + ($4_1 << 4) | 0) + 12 | 0; $0_1 = 9323; break block7; } $3 = $320(HEAP32[HEAP32[$0_1 + 16 >> 2] + 28 >> 2] + 8 | 0, $1_1); if ($3) { break block3 } $3 = $320(HEAP32[HEAP32[$0_1 + 16 >> 2] + 12 >> 2] + 8 | 0, $1_1); if ($3) { break block3 } $4_1 = 2; while (1) { if (($4_1 | 0) < HEAP32[$0_1 + 20 >> 2]) { $2_1 = $4_1 << 4; $4_1 = $4_1 + 1 | 0; $3 = $320(HEAP32[($2_1 + HEAP32[$0_1 + 16 >> 2] | 0) + 12 >> 2] + 8 | 0, $1_1); if (!$3) { continue } break block3; } break; }; $3 = 0; if ($68($1_1, 18315, 7)) { break block3 } $1_1 = $1_1 + 7 | 0; if (!$67($1_1, 18227)) { $4_1 = HEAP32[$0_1 + 16 >> 2] + 12 | 0; $0_1 = 9323; break block7; } if ($67($1_1, 18208)) { break block3 } } $4_1 = HEAP32[$0_1 + 16 >> 2] + 28 | 0; $0_1 = 9304; } $3 = $320(HEAP32[$4_1 >> 2] + 8 | 0, $0_1); } return $3; } function $320($0_1, $1_1) { return HEAP32[$825($0_1, $1_1, 0) + 8 >> 2]; } function $321($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = 65; while (1) { block : { $1_1 = ($2_1 | 0) < ($4_1 | 0); if ($1_1) { break block } $3 = ($2_1 + $4_1 | 0) / 2 | 0; $5_1 = $66($0_1, HEAP32[($3 << 4) + 35360 >> 2]); if (!$5_1) { break block } $1_1 = ($5_1 | 0) < 0; $2_1 = $1_1 ? $3 - 1 | 0 : $2_1; $4_1 = $1_1 ? $4_1 : $3 + 1 | 0; continue; } break; }; return $1_1 ? 0 : ($3 << 4) + 35360 | 0; } function $322($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; block1 : { if (!$2_1) { $7_1 = $1_1; break block1; } $6_1 = $48($1_1); $5_1 = $30($6_1 + 25 | 0, 0); if (!$5_1) { $106($0_1); return 0; } $7_1 = $5_1 + 24 | 0; $6_1 = $6_1 + 1 | 0; if ($6_1) { wasm2js_memory_copy($7_1, $1_1, $6_1) } HEAP32[$5_1 + 20 >> 2] = 0; HEAP32[$5_1 + 16 >> 2] = $4_1; HEAP32[$5_1 + 12 >> 2] = $3; HEAP32[$5_1 >> 2] = $2_1; HEAP32[$5_1 + 4 >> 2] = $7_1; HEAP32[$5_1 + 8 >> 2] = 1; } $1_1 = $395($0_1 + 388 | 0, $7_1, $5_1); if ($1_1) { if (($1_1 | 0) == ($5_1 | 0)) { $106($0_1); $13($0_1, $1_1); return 0; } $198($0_1, $1_1); $199($0_1, $1_1); } return $5_1; } function $323($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; $3 = HEAP32[$1_1 + 44 >> 2]; $5_1 = ($3 << 2) + 8 | 0; $6_1 = $3 + 3 | 0; $3 = HEAP32[$0_1 >> 2]; if (($6_1 | 0) >= HEAP32[$3 + 128 >> 2]) { HEAP32[$4_1 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, 6630, $4_1); } $0_1 = $55($3, HEAP32[$1_1 + 48 >> 2], $5_1, 0); block2 : { if (!$0_1) { $10($3, $2_1); break block2; } $5_1 = HEAP32[$1_1 + 44 >> 2]; $3 = $5_1 + 1 | 0; HEAP32[$1_1 + 44 >> 2] = $3; HEAP32[$0_1 + ($5_1 << 2) >> 2] = $2_1; HEAP32[$0_1 + ($3 << 2) >> 2] = 0; HEAP32[$1_1 + 48 >> 2] = $0_1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $324($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $6_1 = global$0 - 80 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $8_1 = HEAP32[$1_1 + 44 >> 2]; HEAP32[$6_1 + 60 >> 2] = 0; $5_1 = $0_1 + 404 | 0; $9_1 = HEAP32[$1_1 + 48 >> 2]; block1 : { block : { while (1) { $7_1 = HEAP32[$5_1 >> 2]; if (!$7_1) { break block } $5_1 = $7_1 + 8 | 0; if (HEAP32[$7_1 + 4 >> 2] != ($1_1 | 0)) { continue } break; }; HEAP32[$6_1 + 48 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$4_1 >> 2] = $310($0_1, 7485, $6_1 + 48 | 0); $5_1 = 6; break block1; } $5_1 = 7; $10_1 = $116($0_1, HEAP32[$1_1 >> 2]); if (!$10_1) { break block1 } $7_1 = $132(28, 0); block3 : { if (!$7_1) { $106($0_1); break block3; } HEAP8[$7_1 + 18 | 0] = 1; HEAP32[$7_1 + 4 >> 2] = $2_1; HEAP32[$7_1 >> 2] = $0_1; HEAP32[HEAP32[$1_1 + 48 >> 2] + 4 >> 2] = HEAP32[HEAP32[$0_1 + 16 >> 2] + ($309($0_1, HEAP32[$1_1 + 60 >> 2]) << 4) >> 2]; HEAP32[$6_1 + 64 >> 2] = $7_1; HEAP32[$6_1 + 68 >> 2] = $1_1; $5_1 = HEAP32[$0_1 + 404 >> 2]; HEAP32[$6_1 + 76 >> 2] = 0; HEAP32[$6_1 + 72 >> 2] = $5_1; HEAP32[$0_1 + 404 >> 2] = $6_1 - -64; HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] + 1; $5_1 = $8_1; $8_1 = $7_1 + 8 | 0; $5_1 = FUNCTION_TABLE[$3 | 0]($0_1, HEAP32[$2_1 + 12 >> 2], $5_1, $9_1, $8_1, $6_1 + 60 | 0) | 0; $6($0_1, $1_1); HEAP32[$0_1 + 404 >> 2] = HEAP32[$6_1 + 72 >> 2]; if ($5_1) { if (($5_1 | 0) == 7) { $106($0_1) } $1_1 = HEAP32[$6_1 + 60 >> 2]; block7 : { if (!$1_1) { HEAP32[$6_1 >> 2] = $10_1; HEAP32[$4_1 >> 2] = $310($0_1, 8692, $6_1); break block7; } HEAP32[$6_1 + 16 >> 2] = $1_1; HEAP32[$4_1 >> 2] = $310($0_1, 8932, $6_1 + 16 | 0); $24(HEAP32[$6_1 + 60 >> 2]); } $13($0_1, $7_1); break block3; } $5_1 = 0; $3 = HEAP32[$8_1 >> 2]; if (!$3) { break block3 } HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; HEAP32[HEAP32[$7_1 + 8 >> 2] >> 2] = HEAP32[$2_1 >> 2]; $5_1 = 1; HEAP32[$2_1 + 8 >> 2] = HEAP32[$2_1 + 8 >> 2] + 1; HEAP32[$7_1 + 12 >> 2] = 1; if (!HEAP32[$6_1 + 76 >> 2]) { HEAP32[$6_1 + 32 >> 2] = $10_1; HEAP32[$4_1 >> 2] = $310($0_1, 8820, $6_1 + 32 | 0); $646($7_1); break block3; } HEAP32[$7_1 + 24 >> 2] = HEAP32[$1_1 + 52 >> 2]; HEAP32[$1_1 + 52 >> 2] = $7_1; $3 = 0; $2_1 = 0; while (1) { if (($3 | 0) >= HEAP16[$1_1 + 34 >> 1]) { $5_1 = 0 } else { $5_1 = 0; $11_1 = Math_imul($3, 12); $8_1 = $418($11_1 + HEAP32[$1_1 + 4 >> 2] | 0, 30822); $9_1 = $48($8_1); block16 : { block10 : { while (1) { if (($5_1 | 0) == ($9_1 | 0)) { break block10 } block13 : { $7_1 = $5_1 + $8_1 | 0; if (!($68(11447, $7_1, 6) | !!$5_1 & HEAPU8[$7_1 - 1 | 0] != 32)) { $4_1 = HEAPU8[$7_1 + 6 | 0]; if (($4_1 | 32) == 32) { break block13 } } $5_1 = $5_1 + 1 | 0; continue; } break; }; $2_1 = $4_1 ? 7 : 6; $4_1 = $5_1; while (1) { $12_1 = $2_1 + $4_1 | 0; if (!($12_1 >>> 0 > $9_1 >>> 0)) { HEAP8[$4_1 + $8_1 | 0] = HEAPU8[$8_1 + $12_1 | 0]; $4_1 = $4_1 + 1 | 0; continue; } break; }; if (!(HEAPU8[$7_1 | 0] | !$5_1)) { HEAP8[$7_1 - 1 | 0] = 0 } $2_1 = HEAP32[$1_1 + 4 >> 2] + $11_1 | 0; HEAP16[$2_1 + 10 >> 1] = HEAPU16[$2_1 + 10 >> 1] | 2; $2_1 = 1024; $4_1 = 2; break block16; } $4_1 = $2_1; } HEAP32[$1_1 + 28 >> 2] = $4_1 | HEAP32[$1_1 + 28 >> 2]; $3 = $3 + 1 | 0; continue; } break; }; } $13($0_1, $10_1); } $0_1 = $6_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $325($0_1, $1_1, $2_1) { var $3 = 0; folding_inner0 : { block3 : { block2 : { if (!(!$2_1 & HEAPU16[$0_1 + 308 >> 1] >= $1_1 >>> 0)) { if (!HEAP32[$0_1 + 304 >> 2]) { HEAP32[$0_1 + 324 >> 2] = HEAP32[$0_1 + 324 >> 2] + 1; break block2; } if (!HEAPU8[$0_1 + 87 | 0]) { break block2 } break block3; } block4 : { if (!$2_1 & $1_1 >>> 0 > 128 | $2_1) { break block4 } $3 = HEAP32[$0_1 + 344 >> 2]; if ($3) { HEAP32[$0_1 + 344 >> 2] = HEAP32[$3 >> 2]; break folding_inner0; } $3 = HEAP32[$0_1 + 340 >> 2]; if (!$3) { break block4 } HEAP32[$0_1 + 340 >> 2] = HEAP32[$3 >> 2]; break folding_inner0; } $3 = HEAP32[$0_1 + 336 >> 2]; if ($3) { HEAP32[$0_1 + 336 >> 2] = HEAP32[$3 >> 2]; break folding_inner0; } $3 = HEAP32[$0_1 + 332 >> 2]; if ($3) { HEAP32[$0_1 + 332 >> 2] = HEAP32[$3 >> 2]; break folding_inner0; } HEAP32[$0_1 + 328 >> 2] = HEAP32[$0_1 + 328 >> 2] + 1; } $1_1 = $30($1_1, $2_1); if (!$1_1) { $106($0_1) } $3 = $1_1; } return $3; } HEAP32[$0_1 + 320 >> 2] = HEAP32[$0_1 + 320 >> 2] + 1; return $3; } function $326($0_1, $1_1, $2_1, $3) { return $835($0_1, $1_1, $2_1, $3, 0); } function $328($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = HEAP32[$0_1 + 112 >> 2]; $1_1 = $2_1 >> 31; $6_1 = $1_1 << 1 | $2_1 >>> 31; $3 = !($2_1 | $1_1); $2_1 = $3 ? 51 : $2_1 << 1; $4_1 = HEAP32[$0_1 + 12 >> 2]; $5_1 = HEAP32[$4_1 >> 2]; $1_1 = HEAP32[$5_1 + 140 >> 2]; $7_1 = $1_1; block2 : { $3 = $3 ? 0 : $6_1; $1_1 = $1_1 >> 31; block1 : { if (!(($3 | 0) <= ($1_1 | 0) & $2_1 >>> 0 <= $7_1 >>> 0 | ($1_1 | 0) > ($3 | 0))) { $106($5_1); break block1; } $1_1 = $55($5_1, HEAP32[$0_1 + 104 >> 2], __wasm_i64_mul($2_1, $3, 20, 0), i64toi32_i32$HIGH_BITS); if ($1_1) { break block2 } } return 7; } $2_1 = $43(HEAP32[$4_1 >> 2], $1_1); HEAP32[$4_1 + 52 >> 2] = $2_1; HEAP32[$0_1 + 104 >> 2] = $1_1; HEAP32[$0_1 + 112 >> 2] = ($2_1 >>> 0) / 20; return 0; } function $329($0_1, $1_1, $2_1) { block6 : { block : { switch ($1_1 + 17 | 0) { case 2: $644($0_1, HEAP32[$2_1 + 4 >> 2]); $16($0_1, $2_1); return; case 3: case 4: case 5: case 11: if (!$2_1) { break block6 } $16($0_1, $2_1); return; case 9: if (HEAP32[$0_1 + 528 >> 2]) { break block6 } $643($2_1); return; case 10: $644($0_1, $2_1); return; case 7: if (!HEAP32[$0_1 + 528 >> 2]) { $200($2_1); return; } if (HEAP32[$2_1 + 24 >> 2]) { $10($0_1, HEAP32[$2_1 + 32 >> 2]) } $16($0_1, $2_1); return; case 6: if (HEAP32[$0_1 + 528 >> 2]) { break block6 } $646($2_1); return; case 1: if (HEAP32[$0_1 + 528 >> 2]) { break block6 } $6($0_1, $2_1); return; case 0: break block; default: break block6; }; } $10($0_1, HEAP32[$2_1 + 8 >> 2]); $10($0_1, $2_1); } } function $331($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAP32[$1_1 >> 2]; $5_1 = HEAP32[$0_1 + 12 >> 2]; $7_1 = HEAP32[$5_1 + 68 >> 2]; HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65343 | 64; $6_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0; while (1) { $2_1 = $6_1; $6_1 = $2_1 - 20 | 0; $3 = HEAPU8[$6_1 | 0]; if ($3 >>> 0 > 64) { continue } block5 : { block6 : { block3 : { block4 : { block2 : { block : { block1 : { switch ($3 | 0) { case 0: case 1: break block; case 2: break block1; case 3: case 4: case 5: break block2; case 6: break block3; case 7: break block4; case 8: break block5; default: break block6; }; } if (!HEAP32[$2_1 - 12 >> 2]) { break block } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65471; } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] | 128; continue; } HEAP16[$0_1 + 152 >> 1] = HEAPU16[$0_1 + 152 >> 1] & 65343 | 128; continue; } $2_1 = HEAP32[$2_1 - 12 >> 2]; $4_1 = ($2_1 | 0) > ($4_1 | 0) ? $2_1 : $4_1; continue; } $3 = HEAP32[$2_1 - 36 >> 2]; $4_1 = ($4_1 | 0) < ($3 | 0) ? $3 : $4_1; } $2_1 = $2_1 - 12 | 0; $3 = HEAP32[$2_1 >> 2]; if (($3 | 0) >= 0) { continue } HEAP32[$2_1 >> 2] = HEAP32[(($3 ^ -1) << 2) + $7_1 >> 2]; continue; } break; }; if ($7_1) { $16(HEAP32[$0_1 >> 2], HEAP32[$5_1 + 68 >> 2]); HEAP32[$5_1 + 68 >> 2] = 0; } HEAP32[$5_1 + 60 >> 2] = 0; HEAP32[$1_1 >> 2] = $4_1; } function $332($0_1, $1_1, $2_1, $3) { var $4_1 = 0; if (($1_1 | 0) > 0) { while (1) { HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = $2_1; HEAP16[$0_1 + 16 >> 1] = $3; $0_1 = $0_1 + 40 | 0; $4_1 = $1_1 >>> 0 > 1; $1_1 = $1_1 - 1 | 0; if ($4_1) { continue } break; } } } function $333($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = $1_1 + 8 | 0; $4_1 = HEAP32[$1_1 >> 2]; while (1) { $11($0_1, HEAP32[$2_1 >> 2]); $3 = HEAP32[$2_1 + 4 >> 2]; if ($3) { $16($0_1, $3) } $2_1 = $2_1 + 16 | 0; $3 = ($4_1 | 0) > 1; $4_1 = $4_1 - 1 | 0; if ($3) { continue } break; }; $16($0_1, $1_1); } function $334($0_1) { var $1_1 = 0; if (!$0_1) { return } $1_1 = HEAP32[$0_1 + 16 >> 2]; $13(HEAP32[$0_1 + 20 >> 2], $0_1); $100($1_1); } function $335($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $8_1 = $1_1; __inlined_func$337$53 : { if (!$0_1) { $0_1 = $1(103156); break __inlined_func$337$53; } $6_1 = HEAP32[$0_1 + 20 >> 2]; $1_1 = 1; block1 : { if (($2_1 | $3) < 0) { break block1 } $4_1 = $2_1 + $3 | 0; $5_1 = $2_1 >>> 0 > $4_1 >>> 0; $7_1 = HEAP32[$0_1 >> 2]; $9_1 = $4_1 >>> 0 > $7_1 >>> 0; $4_1 = $7_1 >> 31; if ($9_1 & ($4_1 | 0) <= ($5_1 | 0) | ($4_1 | 0) < ($5_1 | 0)) { break block1 } $5_1 = HEAP32[$0_1 + 16 >> 2]; if (!$5_1) { $1_1 = 4; break block1; } $4_1 = HEAP32[$0_1 + 12 >> 2]; $1_1 = HEAP32[$4_1 + 8 >> 2]; HEAP32[HEAP32[$1_1 + 4 >> 2] + 4 >> 2] = HEAP32[$1_1 >> 2]; $1_1 = 4; $2_1 = FUNCTION_TABLE[10]($4_1, HEAP32[$0_1 + 4 >> 2] + $3 | 0, $2_1, $8_1) | 0; if (($2_1 | 0) == 4) { $126($5_1); HEAP32[$0_1 + 16 >> 2] = 0; break block1; } HEAP32[$5_1 + 36 >> 2] = $2_1; $1_1 = $2_1; } $122($6_1, $1_1); $0_1 = $114($6_1, $1_1); } return $0_1; } function $336($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; if (!HEAPU8[$0_1 | 0]) { return $338($0_1, $1_1, $2_1, $3) | 0 } $4_1 = 4; block : { if (HEAPU8[$0_1 | 0] == 1) { break block } $4_1 = $340($0_1); if ($4_1) { break block } $4_1 = $338($0_1, $1_1, $2_1, $3); } return $4_1 | 0; } function $338($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0, wasm2js_i32$3 = 0, wasm2js_i32$4 = 0, wasm2js_i32$5 = 0; $5_1 = global$0 - 16 | 0; $7_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $7_1; $4_1 = HEAP32[$0_1 + 116 >> 2]; block1 : { if (HEAPU16[$0_1 + 70 >> 1] >= HEAPU16[$4_1 + 24 >> 1]) { $1_1 = $181(75880); break block1; } $11_1 = HEAP32[$0_1 + 20 >> 2]; $633($0_1); $9_1 = HEAP32[$0_1 + 40 >> 2]; $7_1 = HEAPU16[$0_1 + 48 >> 1]; if ($9_1 - HEAP32[$4_1 + 56 >> 2] >>> 0 > HEAP32[$11_1 + 40 >> 2] - $7_1 >>> 0) { $1_1 = $181(75895); break block1; } block10 : { block4 : { if ($1_1 >>> 0 < $7_1 >>> 0) { $8_1 = $7_1 >>> 0 < $1_1 + $2_1 >>> 0 ? $7_1 - $1_1 | 0 : $2_1; $2_1 = $2_1 - $8_1 | 0; $7_1 = $3 + $8_1 | 0; $1_1 = $634($1_1 + $9_1 | 0, $3, $8_1); break block4; } $6_1 = $1_1 - $7_1 | 0; $7_1 = $3; $1_1 = 0; } block5 : { if ($1_1 | !$2_1) { break block5 } $1_1 = HEAP32[$11_1 + 40 >> 2]; $4_1 = HEAPU16[$0_1 + 48 >> 1]; HEAP32[$5_1 + 8 >> 2] = $156($4_1 + $9_1 | 0); $9_1 = $1_1 - 4 | 0; block12 : { if (!(HEAPU8[$0_1 + 1 | 0] & 4)) { $1_1 = ((HEAP32[$0_1 + 44 >> 2] + ($1_1 - $4_1 | 0) | 0) - 5 >>> 0) / ($9_1 >>> 0) | 0; block8 : { block7 : { $4_1 = HEAP32[$0_1 + 12 >> 2]; if (!$4_1) { break block7 } $8_1 = FUNCTION_TABLE[HEAP32[18897]]($4_1) | 0; $4_1 = $1_1 << 2; if (($8_1 | 0) < ($4_1 | 0)) { break block7 } $10_1 = HEAP32[$0_1 + 12 >> 2]; break block8; } $4_1 = HEAP32[18950]; if ($4_1) { if (FUNCTION_TABLE[$4_1 | 0](413) | 0) { break block10 } } $10_1 = $33(HEAP32[$0_1 + 12 >> 2], $1_1 << 3, 0); if (!$10_1) { break block10 } HEAP32[$0_1 + 12 >> 2] = $10_1; $4_1 = $1_1 << 2; } $8_1 = 0; if ($4_1) { wasm2js_memory_fill($10_1, 0, $4_1) } HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] | 4; break block12; } $8_1 = ($6_1 >>> 0) / ($9_1 >>> 0) | 0; $1_1 = HEAP32[HEAP32[$0_1 + 12 >> 2] + ($8_1 << 2) >> 2]; if (!$1_1) { $8_1 = 0; break block12; } HEAP32[$5_1 + 8 >> 2] = $1_1; $6_1 = $6_1 - Math_imul($9_1, $8_1) | 0; } while (1) { $1_1 = HEAP32[$5_1 + 8 >> 2]; if (!$1_1) { $1_1 = 0; break block5; } if (HEAPU32[$11_1 + 48 >> 2] < $1_1 >>> 0) { $1_1 = $181(75966); break block1; } $4_1 = HEAP32[$0_1 + 12 >> 2] + ($8_1 << 2) | 0; HEAP32[$4_1 >> 2] = $1_1; block19 : { if ($6_1 >>> 0 >= $9_1 >>> 0) { $4_1 = HEAP32[$4_1 + 4 >> 2]; block18 : { if ($4_1) { HEAP32[$5_1 + 8 >> 2] = $4_1; $1_1 = 0; break block18; } $1_1 = $635($11_1, $1_1, 0, $5_1 + 8 | 0); } $6_1 = $6_1 - $9_1 | 0; break block19; } $10_1 = $9_1 >>> 0 < $2_1 + $6_1 >>> 0 ? $9_1 - $6_1 | 0 : $2_1; block23 : { block22 : { block20 : { if ($6_1) { break block20 } $4_1 = HEAP32[$11_1 >> 2]; $12_1 = HEAP32[$4_1 + 64 >> 2]; $13_1 = HEAP32[$12_1 >> 2]; if (!$13_1 | HEAP32[HEAP32[$4_1 + 228 >> 2] >> 2]) { break block20 } $14 = HEAP32[$4_1 + 232 >> 2]; if ($14) { HEAP32[$5_1 + 12 >> 2] = 0; $545($14, $1_1, $5_1 + 12 | 0); if (HEAP32[$5_1 + 12 >> 2]) { break block20 } $12_1 = HEAP32[$4_1 + 64 >> 2]; $13_1 = HEAP32[$12_1 >> 2]; } if (!(FUNCTION_TABLE[HEAP32[$13_1 + 48 >> 2]]($12_1) & 32768)) { break block20 } $4_1 = $7_1 - 4 | 0; if ($4_1 >>> 0 < $3 >>> 0) { break block20 } $6_1 = HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8 | (HEAPU8[$4_1 + 2 | 0] << 16 | HEAPU8[$4_1 + 3 | 0] << 24); $12_1 = HEAP32[HEAP32[$11_1 >> 2] + 64 >> 2]; $1_1 = ((((((wasm2js_i32$1 = $12_1, wasm2js_i32$2 = $4_1), wasm2js_i32$3 = $10_1 + 4 | 0), wasm2js_i32$4 = __wasm_i64_mul(HEAP32[$11_1 + 36 >> 2], 0, $1_1 - 1 | 0, 0)), wasm2js_i32$5 = i64toi32_i32$HIGH_BITS), wasm2js_i32$0 = HEAP32[HEAP32[$12_1 >> 2] + 8 >> 2]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0, wasm2js_i32$3 | 0, wasm2js_i32$4 | 0, wasm2js_i32$5 | 0) | 0); HEAP32[$5_1 + 8 >> 2] = $156($4_1); HEAP8[$4_1 | 0] = $6_1; HEAP8[$4_1 + 1 | 0] = $6_1 >>> 8; HEAP8[$4_1 + 2 | 0] = $6_1 >>> 16; HEAP8[$4_1 + 3 | 0] = $6_1 >>> 24; break block22; } $4_1 = HEAP32[$11_1 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[$4_1 + 220 >> 2]]($4_1, $1_1, $5_1 + 4 | 0, 2) | 0; if ($1_1) { break block23 } $1_1 = HEAP32[$5_1 + 4 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$5_1 + 8 >> 2] = $156($4_1); $1_1 = $634(($4_1 + $6_1 | 0) + 4 | 0, $7_1, $10_1); $99(HEAP32[$5_1 + 4 >> 2]); } $6_1 = 0; } $2_1 = $2_1 - $10_1 | 0; if (!$2_1) { break block1 } $7_1 = $7_1 + $10_1 | 0; } $8_1 = $8_1 + 1 | 0; if (!$1_1) { continue } break; }; } if (!$2_1 | $1_1) { break block1 } $1_1 = $181(76050); break block1; } $1_1 = 7; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $340($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 + 12 >> 2] = 0; block1 : { if (HEAPU8[$0_1 | 0] == 4) { $1_1 = HEAP32[$0_1 + 4 >> 2]; break block1; } HEAP8[$0_1 | 0] = 1; block2 : { $1_1 = HEAP32[18950]; if (!$1_1) { break block2 } if (!(FUNCTION_TABLE[$1_1 | 0](410) | 0)) { break block2 } $1_1 = 10; break block1; } $1_1 = $764($0_1, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 56 >> 2], HEAP32[$0_1 + 60 >> 2], 0, $2_1 + 12 | 0); if ($1_1) { break block1 } $24(HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 16 >> 2] = 0; block4 : { $1_1 = HEAP32[$2_1 + 12 >> 2]; if ($1_1) { HEAP32[$0_1 + 4 >> 2] = $1_1; break block4; } if (HEAP32[$0_1 + 4 >> 2]) { break block4 } $1_1 = 0; break block1; } $1_1 = 0; if (HEAPU8[$0_1 | 0]) { break block1 } HEAP8[$0_1 | 0] = 2; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $342($0_1, $1_1) { $0_1 = $0_1 + 4 | 0; $1_1 = $1_1 + 1 & 3; while (1) { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { HEAP16[$0_1 + 152 >> 1] = $1_1 | HEAPU16[$0_1 + 152 >> 1] & 65532; $0_1 = $0_1 + 8 | 0; continue; } break; }; } function $343($0_1, $1_1) { if (!$1_1) { return ($0_1 | 0) != 0 } if (!$0_1) { return 1 } return $344($0_1, $1_1, 31416, 91); } function $344($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $5_1 = global$0 - 16 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $4_1; HEAP32[$5_1 + 8 >> 2] = $1_1; HEAP32[$5_1 + 12 >> 2] = $0_1; $10_1 = HEAPU8[$2_1 | 0]; $8_1 = HEAPU8[$2_1 + 1 | 0]; $11_1 = HEAPU8[$2_1 + 3 | 0]; block10 : { block8 : { label4 : while (1) { $1_1 = HEAP32[$5_1 + 12 >> 2]; $0_1 = HEAP8[$1_1 | 0]; block1 : { if (($0_1 | 0) >= 0) { HEAP32[$5_1 + 12 >> 2] = $1_1 + 1; break block1; } $0_1 = $345($5_1 + 12 | 0); } block13 : { block21 : { block20 : { if ($0_1) { if (($0_1 | 0) == ($10_1 | 0)) { while (1) { $1_1 = HEAP32[$5_1 + 12 >> 2]; $0_1 = HEAP8[$1_1 | 0]; block5 : { if (($0_1 | 0) >= 0) { HEAP32[$5_1 + 12 >> 2] = $1_1 + 1; break block5; } $0_1 = $345($5_1 + 12 | 0); } if (!(!(($0_1 | 0) == ($8_1 | 0) & ($8_1 | 0) != 0) & ($0_1 | 0) != ($10_1 | 0))) { if (($0_1 | 0) != ($8_1 | 0)) { continue } if ($345($5_1 + 8 | 0)) { continue } break block8; } break; }; if (!$0_1) { $6_1 = 0; break block10; } if (($0_1 | 0) == ($3 | 0)) { if (HEAPU8[$2_1 + 2 | 0]) { $1_1 = HEAP32[$5_1 + 12 >> 2] - 1 | 0; $4_1 = HEAP32[$5_1 + 8 >> 2]; while (1) { $7_1 = HEAPU8[$4_1 | 0]; if (!$7_1) { break block8 } $6_1 = $344($1_1, $4_1, $2_1, $3); if (($6_1 | 0) != 1) { break block10 } $4_1 = $4_1 + 1 | 0; $0_1 = $4_1; if ($7_1 >>> 0 < 192) { continue } while (1) { $6_1 = HEAP8[$0_1 | 0]; $4_1 = $0_1; $0_1 = $0_1 + 1 | 0; if (($6_1 | 0) < -64) { continue } break; }; continue; }; } $0_1 = $345($5_1 + 12 | 0); if (!$0_1) { break block8 } } if ($0_1 >>> 0 < 128) { break block13 } $4_1 = HEAP32[$5_1 + 12 >> 2]; while (1) { $6_1 = HEAP32[$5_1 + 8 >> 2]; $1_1 = HEAP8[$6_1 | 0]; block15 : { if (($1_1 | 0) >= 0) { HEAP32[$5_1 + 8 >> 2] = $6_1 + 1; break block15; } $1_1 = $345($5_1 + 8 | 0); } if (!$1_1) { break block8 } if (($0_1 | 0) != ($1_1 | 0)) { continue } $6_1 = $344($4_1, HEAP32[$5_1 + 8 >> 2], $2_1, $3); if (($6_1 | 0) == 1) { continue } break; }; break block10; } if (($0_1 | 0) == ($3 | 0)) { block18 : { if (!HEAPU8[$2_1 + 2 | 0]) { $0_1 = $345($5_1 + 12 | 0); if ($0_1) { break block18 } $6_1 = 1; break block10; } $6_1 = 1; $9_1 = $345($5_1 + 8 | 0); if (!$9_1) { break block10 } $0_1 = 0; $12_1 = 0; $7_1 = 0; $1_1 = $5_1 + 12 | 0; $4_1 = $345($1_1); if (($4_1 | 0) == 94) { $12_1 = 1; $4_1 = $345($1_1); } if (($4_1 | 0) != 93) { break block20 } $7_1 = ($9_1 | 0) == 93; $1_1 = 0; break block21; } $14 = HEAP32[$5_1 + 12 >> 2]; } $4_1 = HEAP32[$5_1 + 8 >> 2]; $1_1 = HEAP8[$4_1 | 0]; block23 : { if (($1_1 | 0) >= 0) { HEAP32[$5_1 + 8 >> 2] = $4_1 + 1; break block23; } $1_1 = $345($5_1 + 8 | 0); } if (($0_1 | 0) == ($1_1 | 0)) { continue } if (!(!$11_1 | ($0_1 | $1_1) >>> 0 > 127)) { if (HEAPU8[($0_1 & 255) + 31040 | 0] == HEAPU8[($1_1 & 255) + 31040 | 0]) { continue } } $6_1 = 1; if (!$1_1 | ($0_1 | 0) != ($8_1 | 0)) { break block10 } if (HEAP32[$5_1 + 12 >> 2] != ($14 | 0)) { continue } break block10; } $6_1 = HEAPU8[HEAP32[$5_1 + 8 >> 2]] != 0; break block10; } $1_1 = 1; } while (1) { block32 : { block29 : { block31 : { block27 : { if (!$1_1) { $0_1 = 0; break block27; } $1_1 = $0_1; $0_1 = $4_1; block30 : { if (($0_1 | 0) != 45) { if (($0_1 | 0) == 93) { break block29 } if (!$0_1) { break block10 } break block30; } $13_1 = HEAPU8[HEAP32[$5_1 + 12 >> 2]]; if (!$1_1 | ($13_1 | 0) == 93) { break block30 } if ($13_1) { break block31 } } $7_1 = ($0_1 | 0) == ($9_1 | 0) ? 1 : $7_1; } $4_1 = $345($5_1 + 12 | 0); $1_1 = 1; continue; } $7_1 = (wasm2js_i32$0 = $7_1, wasm2js_i32$1 = $345($5_1 + 12 | 0) >>> 0 >= $9_1 >>> 0 ? 1 : $7_1, wasm2js_i32$2 = $1_1 >>> 0 > $9_1 >>> 0, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); break block32; } if (($7_1 | 0) != ($12_1 | 0)) { continue label4 } break block10; } $1_1 = 0; continue; }; } break; }; block34 : { if ($11_1) { HEAP8[$5_1 + 7 | 0] = 0; $4_1 = HEAPU8[$0_1 + 31040 | 0]; $0_1 = (HEAPU8[$0_1 + 31424 | 0] ^ -1 | -33) & $0_1; break block34; } $4_1 = 0; } HEAP8[$5_1 + 6 | 0] = $4_1; HEAP8[$5_1 + 5 | 0] = $0_1; $7_1 = HEAP32[$5_1 + 12 >> 2]; $0_1 = HEAP32[$5_1 + 8 >> 2]; while (1) { $1_1 = $5_1 + 5 | 0; $6_1 = global$0 - 32 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = HEAP8[$1_1 | 0]; block2 : { if (!(HEAPU8[$1_1 + 1 | 0] ? $4_1 : 0)) { $1_1 = $2072($0_1, $4_1); break block2; } $2027($6_1, 32); $4_1 = HEAPU8[$1_1 | 0]; if ($4_1) { while (1) { $8_1 = ($4_1 >>> 3 & 28) + $6_1 | 0; HEAP32[$8_1 >> 2] = HEAP32[$8_1 >> 2] | 1 << $4_1; $4_1 = HEAPU8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if ($4_1) { continue } break; } } $1_1 = $0_1; $4_1 = HEAPU8[$0_1 | 0]; if (!$4_1) { break block2 } while (1) { if (HEAP32[($4_1 >>> 3 & 28) + $6_1 >> 2] >>> $4_1 & 1) { break block2 } $4_1 = HEAPU8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if ($4_1) { continue } break; }; } $4_1 = $6_1 + 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $0_1 = $0_1 + ($1_1 - $0_1 | 0) | 0; if (!HEAPU8[$0_1 | 0]) { break block8 } $0_1 = $0_1 + 1 | 0; $6_1 = $344($7_1, $0_1, $2_1, $3); if (($6_1 | 0) == 1) { continue } break; }; break block10; } $6_1 = 2; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $345($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; $3 = $2_1 + 1 | 0; HEAP32[$0_1 >> 2] = $3; $1_1 = HEAPU8[$2_1 | 0]; if ($1_1 >>> 0 >= 192) { $1_1 = HEAPU8[$1_1 + 33456 | 0]; while (1) { if (!(HEAP8[$3 | 0] > -65)) { $2_1 = $3 + 1 | 0; HEAP32[$0_1 >> 2] = $2_1; $1_1 = HEAPU8[$3 | 0] & 63 | $1_1 << 6; $3 = $2_1; continue; } break; }; $1_1 = ($1_1 & -2) == 65534 ? 65533 : $1_1 >>> 0 < 128 ? 65533 : ($1_1 & -2048) == 55296 ? 65533 : $1_1; } return $1_1; } function $347($0_1) { var $1_1 = 0; $1_1 = 1; $0_1 = HEAPU8[$0_1 + 97 | 0]; if (!(($0_1 | 0) == 109 | ($0_1 | 0) == 118 | ($0_1 | 0) == 186)) { $348(15251); $1_1 = 0; } return $1_1; } function $348($0_1) { var $1_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 >> 2] = $0_1; $64(21, 9366, $1_1); $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $349($0_1, $1_1, $2_1) { return $102($0_1, $1_1, -1, 0, 0, $2_1, 0); } function $350($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0; $7_1 = global$0 - 320 | 0; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; wasm2js_memory_fill($7_1 + 32 | 0, 0, 164); wasm2js_memory_fill($7_1 + 240 | 0, 0, 76); HEAP32[$7_1 + 228 >> 2] = HEAP32[$0_1 + 264 >> 2]; HEAP32[$0_1 + 264 >> 2] = $7_1 + 28; HEAP32[$7_1 + 28 >> 2] = $0_1; if ($4_1) { HEAP32[$7_1 + 272 >> 2] = $4_1; HEAP8[$7_1 + 251 | 0] = HEAPU8[$4_1 + 152 | 0] >>> 2 & 3; } block4 : { if (HEAPU8[$0_1 + 87 | 0]) { $257($7_1 + 28 | 0, 1162, 0); $8_1 = 7; HEAP32[$0_1 + 64 >> 2] = 7; break block4; } if ($3 & 1) { HEAP8[$7_1 + 52 | 0] = 1; HEAP16[$0_1 + 308 >> 1] = 0; HEAP32[$0_1 + 304 >> 2] = HEAP32[$0_1 + 304 >> 2] + 1; } HEAP8[$7_1 + 53 | 0] = $3; block6 : { if (HEAPU8[$0_1 + 95 | 0]) { break block6 } $4_1 = 0; while (1) { if (HEAP32[$0_1 + 20 >> 2] <= ($4_1 | 0)) { break block6 } block7 : { $8_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($4_1 << 4) | 0) + 4 >> 2]; if (!$8_1) { break block7 } HEAP32[HEAP32[$8_1 + 4 >> 2] + 4 >> 2] = HEAP32[$8_1 >> 2]; $8_1 = $610($8_1, 1, 1); if (!$8_1) { break block7 } HEAP32[$7_1 >> 2] = HEAP32[HEAP32[$0_1 + 16 >> 2] + ($4_1 << 4) >> 2]; $131($0_1, $8_1, 8790, $7_1); break block4; } $4_1 = $4_1 + 1 | 0; continue; }; } if (HEAP32[$0_1 + 412 >> 2]) { $159($0_1) } block26 : { block20 : { block11 : { block13 : { if (!(!(!$2_1 | HEAPU8[($1_1 + $2_1 | 0) - 1 | 0]) | ($2_1 | 0) < 0)) { if (HEAP32[$0_1 + 124 >> 2] < ($2_1 | 0)) { break block11 } $4_1 = $299($0_1, $1_1, $2_1, 0); if ($4_1) { $357($7_1 + 28 | 0, $4_1); HEAP32[$7_1 + 276 >> 2] = (HEAP32[$7_1 + 276 >> 2] - $4_1 | 0) + $1_1; $13($0_1, $4_1); break block13; } HEAP32[$7_1 + 276 >> 2] = $1_1 + $2_1; break block13; } $357($7_1 + 28 | 0, $1_1); } if ($6_1) { HEAP32[$6_1 >> 2] = HEAP32[$7_1 + 276 >> 2] } block15 : { if (HEAPU8[$0_1 + 177 | 0]) { break block15 } $2_1 = HEAP32[$7_1 + 36 >> 2]; if (!$2_1) { break block15 } $4_1 = HEAP32[$7_1 + 276 >> 2] - $1_1 | 0; HEAP8[$2_1 + 150 | 0] = $3; if ($3 << 24 >> 24 >= 0) { HEAP32[$2_1 + 228 >> 2] = 0 } HEAP32[$2_1 + 200 >> 2] = $299(HEAP32[$2_1 >> 2], $1_1, $4_1, $4_1 >> 31); } block19 : { block18 : { if (HEAPU8[$0_1 + 87 | 0]) { HEAP8[$7_1 + 45 | 0] = 0; HEAP32[$7_1 + 40 >> 2] = 7; break block18; } $1_1 = HEAP32[$7_1 + 40 >> 2]; if (!$1_1 | ($1_1 | 0) == 101) { break block19 } } if (HEAPU8[$0_1 + 177 | 0] | !HEAPU8[$7_1 + 45 | 0]) { break block20 } $1_1 = HEAP32[$7_1 + 28 >> 2]; $4_1 = 0; while (1) { if (HEAP32[$1_1 + 20 >> 2] <= ($4_1 | 0)) { break block20 } $5_1 = $4_1 << 4; $2_1 = HEAP32[($5_1 + HEAP32[$1_1 + 16 >> 2] | 0) + 4 >> 2]; block21 : { if (!$2_1) { break block21 } block22 : { $6_1 = HEAPU8[$2_1 + 8 | 0]; if ($6_1) { break block22 } $3 = $143($2_1, 0, 0); if (!$3) { break block22 } if (($3 | 0) != 3082 & ($3 | 0) != 7) { break block20 } $106($1_1); HEAP32[$7_1 + 40 >> 2] = 7; break block20; } $709($2_1, 1, $7_1 + 316 | 0); $3 = HEAP32[($5_1 + HEAP32[$1_1 + 16 >> 2] | 0) + 12 >> 2]; if (HEAP32[$7_1 + 316 >> 2] != HEAP32[$3 >> 2]) { if (HEAP8[$3 + 78 | 0] & 1) { HEAP32[$7_1 + 40 >> 2] = 17 } $351($1_1, $4_1); } if ($6_1) { break block21 } $775($2_1); } $4_1 = $4_1 + 1 | 0; continue; }; } HEAP32[$5_1 >> 2] = HEAP32[$7_1 + 36 >> 2]; HEAP32[$0_1 + 64 >> 2] = 0; HEAP32[$0_1 + 68 >> 2] = -1; $8_1 = 0; $1_1 = HEAP32[$0_1 + 288 >> 2]; if (!$1_1) { break block26 } $112($1_1); break block26; } $131($0_1, 18, 12556, 0); $8_1 = $114($0_1, 18); break block4; } $1_1 = HEAP32[$7_1 + 36 >> 2]; if ($1_1) { $126($1_1) } $8_1 = HEAP32[$7_1 + 40 >> 2]; $1_1 = HEAP32[$7_1 + 32 >> 2]; if ($1_1) { HEAP32[$7_1 + 16 >> 2] = $1_1; $131($0_1, $8_1, 8932, $7_1 + 16 | 0); $10($0_1, HEAP32[$7_1 + 32 >> 2]); break block26; } $122($0_1, $8_1); } while (1) { $1_1 = HEAP32[$7_1 + 168 >> 2]; if (!$1_1) { break block4 } HEAP32[$7_1 + 168 >> 2] = HEAP32[$1_1 + 4 >> 2]; $13($0_1, $1_1); continue; }; } $141($7_1 + 28 | 0); $0_1 = $7_1 + 320 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $351($0_1, $1_1) { var $2_1 = 0; if (($1_1 | 0) >= 0) { $2_1 = $1_1 << 4; $1_1 = HEAP32[$0_1 + 16 >> 2]; $2_1 = HEAP32[($2_1 + $1_1 | 0) + 12 >> 2]; HEAP16[$2_1 + 78 >> 1] = HEAPU16[$2_1 + 78 >> 1] | 8; $1_1 = HEAP32[$1_1 + 28 >> 2]; HEAP16[$1_1 + 78 >> 1] = HEAPU16[$1_1 + 78 >> 1] | 8; HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] & -17; } block1 : { if (HEAP32[$0_1 + 56 >> 2]) { break block1 } $1_1 = 0; while (1) { if (HEAP32[$0_1 + 20 >> 2] <= ($1_1 | 0)) { break block1 } $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]; if (HEAPU8[$2_1 + 78 | 0] & 8) { $158($2_1) } $1_1 = $1_1 + 1 | 0; continue; }; } } function $352($0_1, $1_1, $2_1, $3) { return $102($0_1, $1_1, -1, $2_1 & 31 | 128, 0, $3, 0); } function $353($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = -1; while (1) { $2_1 = HEAPU8[$0_1 | 0]; if (!(!$2_1 | $0_1 >>> 0 >= $4_1 >>> 0)) { $1_1 = $0_1 + 1 | 0; $0_1 = $1_1; if ($2_1 >>> 0 >= 192) { while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if (HEAP8[$0_1 | 0] < -64) { continue } break; } } $3 = $3 + 1 | 0; continue; } break; }; return $3; } function $354($0_1, $1_1, $2_1) { return $355($0_1, $1_1, $2_1, 0, 0); } function $355($0_1, $1_1, $2_1, $3, $4_1) { $322($0_1, $1_1, $2_1, $3, $4_1); $0_1 = $114($0_1, 0); if (!(!$4_1 | !$0_1)) { FUNCTION_TABLE[$4_1 | 0]($3) } return $0_1; } function $356($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = global$0 - 304 | 0; $3 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $3; $3 = $1_1; block2 : { while (1) { if (($5_1 | 0) != 2) { HEAP32[$2_1 + 16 >> 2] = 0; while (1) { $3 = $295($3, $2_1 + 16 | 0) + $3 | 0; $4_1 = HEAP32[$2_1 + 16 >> 2]; if (($4_1 & -2) == 184) { continue } break; }; if (HEAPU8[$5_1 + 30793 | 0] != ($4_1 | 0)) { $131($0_1, 1, 9107, 0); $3 = 1; break block2; } else { $5_1 = $5_1 + 1 | 0; continue; } } break; }; $5_1 = HEAP32[$0_1 + 404 >> 2]; if (!$5_1 | HEAP32[$5_1 + 12 >> 2]) { $122($0_1, $1(157358)); $3 = $1(157360); break block2; } $3 = HEAP32[$5_1 + 4 >> 2]; $6_1 = $2_1 + 16 | 0; $139($6_1, $0_1); HEAP8[$2_1 + 181 | 0] = 1; HEAP8[$2_1 + 240 | 0] = 1; $7_1 = HEAPU8[$0_1 + 177 | 0]; $4_1 = 0; HEAP8[$0_1 + 177 | 0] = 0; HEAP16[$2_1 + 176 >> 1] = 1; block8 : { if (!$357($6_1, $1_1)) { block6 : { if (HEAP32[$3 + 4 >> 2]) { break block6 } $1_1 = HEAP32[$2_1 + 268 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2]; $358($0_1, HEAP32[$1_1 + 52 >> 2]); $4_1 = HEAPU16[$1_1 + 34 >> 1]; HEAP16[$3 + 36 >> 1] = $4_1; HEAP16[$3 + 34 >> 1] = $4_1; HEAP32[$3 + 28 >> 2] = HEAP32[$3 + 28 >> 2] | HEAP32[$1_1 + 28 >> 2] & 640; $4_1 = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP16[$1_1 + 34 >> 1] = 0; if (!(!(HEAPU8[$1_1 + 28 | 0] & 128) | !HEAP32[HEAP32[HEAP32[HEAP32[$5_1 >> 2] + 4 >> 2] >> 2] + 52 >> 2])) { $4_1 = HEAPU16[$359($1_1) + 50 >> 1] != 1 } $6_1 = HEAP32[$1_1 + 8 >> 2]; if (!$6_1) { break block6 } HEAP32[$3 + 8 >> 2] = $6_1; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = $3; } HEAP32[$5_1 + 12 >> 2] = 1; break block8; } $1_1 = HEAP32[$2_1 + 20 >> 2]; HEAP32[$2_1 >> 2] = $1_1; $131($0_1, 1, $1_1 ? 8932 : 0, $2_1); $10($0_1, HEAP32[$2_1 + 20 >> 2]); $4_1 = 1; } HEAP8[$2_1 + 240 | 0] = 0; $1_1 = HEAP32[$2_1 + 24 >> 2]; if ($1_1) { $126($1_1) } $6($0_1, HEAP32[$2_1 + 268 >> 2]); $141($2_1 + 16 | 0); HEAP8[$0_1 + 177 | 0] = $7_1; $3 = $114($0_1, $4_1); } $0_1 = $2_1 + 304 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $357($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0; $13_1 = global$0 - 1280 | 0; $2_1 = $13_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $21_1 = HEAP32[$0_1 >> 2]; $28_1 = HEAP32[$21_1 + 124 >> 2]; if (!HEAP32[$21_1 + 184 >> 2]) { HEAP32[$21_1 + 296 >> 2] = 0 } HEAP32[$0_1 + 248 >> 2] = $1_1; HEAP32[$0_1 + 12 >> 2] = 0; $29_1 = $13_1 + 52 | 0; HEAP32[$13_1 + 48 >> 2] = $29_1; HEAP32[$13_1 + 40 >> 2] = $0_1; HEAP32[$13_1 + 44 >> 2] = $13_1 + 1240; HEAP32[$13_1 + 52 >> 2] = 0; HEAP32[$13_1 + 36 >> 2] = $29_1; $33_1 = HEAP32[$21_1 + 264 >> 2]; HEAP32[$21_1 + 264 >> 2] = $0_1; $18_1 = -1; label2 : while (1) { $2_1 = $18_1; while (1) { block5 : { $24_1 = $295($1_1, $13_1 + 1252 | 0); $28_1 = $28_1 - $24_1 | 0; block2 : { if (($28_1 | 0) < 0) { HEAP32[$0_1 + 12 >> 2] = 18; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block2; } $18_1 = HEAP32[$13_1 + 1252 >> 2]; block3 : { if (($18_1 | 0) < 165) { break block3 } if (HEAP32[$21_1 + 296 >> 2]) { HEAP32[$0_1 + 12 >> 2] = 9; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block2; } if (($18_1 | 0) == 184) { break block5 } block7 : { block8 : { if (!HEAPU8[$1_1 | 0]) { $24_1 = 0; $18_1 = 0; switch ($2_1 | 0) { case 0: break block2; case 1: break block7; default: break block8; }; } block9 : { block10 : { switch ($18_1 - 183 | 0) { default: block14 : { switch ($18_1 - 165 | 0) { case 0: HEAP32[$13_1 + 1272 >> 2] = $1_1 + 6; $18_1 = 60; $2_1 = $13_1 + 1272 | 0; if (($361($2_1) | 0) != 60) { break block7 } $18_1 = ($361($2_1) | 0) == 24 ? 165 : 60; break block7; case 1: HEAP32[$13_1 + 1272 >> 2] = $1_1 + 4; $18_1 = 60; if (($2_1 | 0) != 23) { break block7 } $2_1 = $361($13_1 + 1272 | 0); $18_1 = ($2_1 | 0) == 60 ? 166 : ($2_1 | 0) == 22 ? 166 : 60; break block7; case 2: break block14; default: break block9; }; } HEAP32[$13_1 + 1272 >> 2] = $1_1 + 6; if (($2_1 | 0) == 23) { $18_1 = 167; if (($361($13_1 + 1272 | 0) | 0) == 22) { break block7 } } $18_1 = 60; break block7; case 2: break block10; case 0: break block3; case 1: break block9; }; } if (HEAPU8[$21_1 + 36 | 0] & 64) { break block5 } } HEAP32[$13_1 + 1276 >> 2] = $24_1; HEAP32[$13_1 + 1272 >> 2] = $1_1; HEAP32[$13_1 + 32 >> 2] = $13_1 + 1272; $257($0_1, 29998, $13_1 + 32 | 0); break block2; } $18_1 = 1; } HEAP32[$13_1 + 1252 >> 2] = $18_1; } HEAP32[$0_1 + 216 >> 2] = $24_1; HEAP32[$0_1 + 212 >> 2] = $1_1; $2_1 = HEAPU8[$0_1 + 216 | 0] | HEAPU8[$0_1 + 217 | 0] << 8 | (HEAPU8[$0_1 + 218 | 0] << 16 | HEAPU8[$0_1 + 219 | 0] << 24); $30_1 = $2_1; $25 = HEAPU8[$0_1 + 212 | 0] | HEAPU8[$0_1 + 213 | 0] << 8 | (HEAPU8[$0_1 + 214 | 0] << 16 | HEAPU8[$0_1 + 215 | 0] << 24); HEAP32[$13_1 + 1256 >> 2] = $25; HEAP32[$13_1 + 1260 >> 2] = $2_1; $4_1 = HEAPU16[HEAP32[$13_1 + 36 >> 2] >> 1]; $5_1 = HEAP32[$13_1 + 40 >> 2]; block21 : { while (1) { $2_1 = $4_1 & 65535; block16 : { if ($2_1 >>> 0 > 582) { break block16 } $7_1 = $2_1 << 1; $6_1 = HEAPU16[$7_1 + 38160 >> 1]; $2_1 = $18_1; block17 : { while (1) { $4_1 = $2_1 & 65535; $2_1 = $4_1 + $6_1 << 1; if (HEAPU16[$2_1 + 39328 >> 1] == ($4_1 | 0)) { break block17 } $2_1 = HEAPU16[($4_1 << 1) + 37360 >> 1]; if ($2_1) { continue } break; }; block18 : { if (!$4_1) { break block18 } $2_1 = $6_1 + 102 << 1; if (HEAPU16[$2_1 + 39328 >> 1] != 102) { break block18 } $4_1 = HEAPU16[$2_1 + 44128 >> 1]; break block16; } $4_1 = HEAPU16[$7_1 + 48544 >> 1]; break block16; } $4_1 = HEAPU16[$2_1 + 44128 >> 1]; } $6_1 = $4_1 & 65535; if ($6_1 >>> 0 >= 1257) { block20 : { if (HEAPU8[$6_1 + 36487 | 0] | HEAPU32[$13_1 + 36 >> 2] < HEAPU32[$13_1 + 44 >> 2]) { break block20 } $2_1 = $13_1 + 36 | 0; if (!$362($2_1)) { break block20 } $363($2_1); break block21; } $2_1 = HEAP32[$13_1 + 1260 >> 2]; HEAP32[$13_1 + 24 >> 2] = HEAP32[$13_1 + 1256 >> 2]; HEAP32[$13_1 + 28 >> 2] = $2_1; $4_1 = 0; $7_1 = 0; $15_1 = 0; $8_1 = global$0 - 768 | 0; $3 = $8_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } $2_1 = $13_1 + 24 | 0; global$0 = $3; $32_1 = $13_1 + 36 | 0; $3 = HEAP32[$32_1 >> 2]; block262 : { block306 : { block303 : { block22 : { block23 : { block24 : { block25 : { block26 : { block27 : { block28 : { block29 : { block30 : { block31 : { block32 : { block33 : { block34 : { block35 : { block36 : { block37 : { block38 : { block39 : { block40 : { block41 : { block42 : { block43 : { block44 : { block45 : { block46 : { block47 : { block48 : { block49 : { block50 : { block51 : { block52 : { block53 : { block54 : { block55 : { block56 : { block57 : { block58 : { block59 : { block60 : { block61 : { block62 : { block63 : { block64 : { block65 : { block66 : { block67 : { block68 : { block69 : { block70 : { block71 : { block72 : { block73 : { block74 : { block75 : { block76 : { block77 : { block78 : { block79 : { block80 : { block81 : { block82 : { block83 : { block84 : { block85 : { block86 : { block87 : { block88 : { block89 : { block90 : { block91 : { block92 : { block93 : { block94 : { block95 : { block96 : { block97 : { block98 : { block99 : { block100 : { block101 : { block102 : { block103 : { block104 : { block105 : { block106 : { block107 : { block108 : { block109 : { block110 : { block111 : { block112 : { block113 : { block114 : { block115 : { block116 : { block117 : { block118 : { block119 : { block120 : { block121 : { block122 : { block123 : { block124 : { block125 : { block126 : { block127 : { block128 : { block129 : { block130 : { block131 : { block132 : { block133 : { block134 : { block135 : { block136 : { block137 : { block138 : { block139 : { block140 : { block141 : { block142 : { block143 : { block144 : { block145 : { block146 : { block147 : { block148 : { block149 : { block150 : { block151 : { block152 : { block153 : { block154 : { block155 : { block156 : { block157 : { block158 : { block159 : { block160 : { block161 : { block162 : { block163 : { block164 : { block165 : { block166 : { block167 : { block168 : { block169 : { block170 : { block171 : { block172 : { block173 : { block174 : { block175 : { block176 : { block177 : { block178 : { block179 : { block180 : { block181 : { block182 : { block183 : { block184 : { block185 : { block186 : { block187 : { block188 : { block189 : { block190 : { block191 : { block192 : { block193 : { block194 : { block195 : { block196 : { block197 : { block198 : { block199 : { block200 : { block201 : { block202 : { block203 : { block204 : { block205 : { block206 : { block207 : { block208 : { block209 : { block210 : { block211 : { block212 : { block213 : { block214 : { block215 : { block216 : { block217 : { block218 : { block219 : { block220 : { block221 : { block222 : { block223 : { block224 : { block225 : { block226 : { block227 : { block228 : { block229 : { block230 : { block231 : { block232 : { block233 : { block234 : { block235 : { block236 : { block237 : { block238 : { block239 : { block240 : { block241 : { block242 : { block243 : { block244 : { block245 : { block246 : { block247 : { block248 : { block249 : { block250 : { block251 : { block252 : { block253 : { block254 : { block255 : { block256 : { block257 : { block258 : { block259 : { block260 : { block261 : { block263 : { block264 : { block265 : { block266 : { block267 : { block268 : { block269 : { block270 : { block271 : { block272 : { block273 : { block274 : { block275 : { block2110 : { block2011 : { block19 : { block1812 : { block1713 : { block1614 : { block15 : { block1415 : { block1316 : { block1217 : { block1118 : { block1019 : { block920 : { block821 : { block722 : { block6 : { block523 : { block4 : { block324 : { block276 : { block1 : { block : { $31_1 = $6_1 - 1257 | 0; switch ($31_1 | 0) { case 0: break block; case 1: break block1; case 119: break block100; case 120: break block101; case 13: break block1019; case 121: break block102; case 122: break block103; case 123: break block104; case 124: break block105; case 125: break block106; case 126: break block107; case 127: break block108; case 128: break block109; case 129: break block110; case 130: break block111; case 14: break block1118; case 132: break block112; case 133: break block113; case 135: case 145: break block114; case 136: break block115; case 137: break block116; case 138: break block117; case 139: break block118; case 140: case 143: break block119; case 141: break block120; case 142: break block121; case 15: case 18: case 47: case 62: case 72: case 81: case 100: case 246: break block1217; case 146: case 148: case 153: case 155: case 232: case 233: case 252: break block122; case 147: case 154: case 156: case 231: case 251: break block123; case 149: break block124; case 150: break block125; case 151: break block126; case 152: break block127; case 157: break block128; case 158: break block129; case 159: break block130; case 160: break block131; case 16: break block1316; case 161: break block132; case 162: break block133; case 163: break block134; case 164: break block135; case 165: break block136; case 166: break block137; case 167: break block138; case 168: break block139; case 169: break block140; case 170: break block141; case 17: break block1415; case 171: break block142; case 172: break block143; case 175: break block144; case 176: break block145; case 177: break block146; case 178: break block147; case 179: break block148; case 180: break block149; case 19: break block15; case 181: break block150; case 182: break block151; case 183: case 184: break block152; case 185: break block153; case 186: break block154; case 187: break block155; case 188: break block156; case 189: break block157; case 190: break block158; case 191: break block159; case 192: break block160; case 193: break block161; case 20: break block1614; case 194: break block162; case 195: break block163; case 196: break block164; case 197: break block165; case 198: case 199: case 200: case 201: case 202: case 203: case 204: break block166; case 205: break block167; case 206: break block168; case 207: break block169; case 208: break block170; case 209: break block171; case 21: break block1713; case 210: break block172; case 211: break block173; case 212: break block174; case 213: break block175; case 214: case 215: break block176; case 216: break block177; case 217: break block178; case 218: case 221: break block179; case 220: break block180; case 223: break block181; case 22: break block1812; case 224: break block182; case 225: break block183; case 226: break block184; case 227: break block185; case 228: break block186; case 229: break block187; case 230: break block188; case 235: break block189; case 23: break block19; case 236: break block190; case 238: case 243: break block191; case 239: break block192; case 240: case 282: break block193; case 241: break block194; case 244: break block195; case 245: break block196; case 248: break block197; case 249: break block198; case 250: break block199; case 253: break block200; case 254: break block201; case 24: break block2011; case 255: break block202; case 256: break block203; case 257: break block204; case 260: break block205; case 261: break block206; case 262: break block207; case 263: break block208; case 264: break block209; case 265: case 266: break block210; case 267: break block211; case 25: break block2110; case 268: case 287: break block212; case 269: case 288: break block213; case 270: break block214; case 271: break block215; case 272: break block216; case 273: break block217; case 274: break block218; case 275: break block219; case 26: case 65: case 106: break block22; case 276: break block220; case 277: break block221; case 278: break block222; case 279: break block223; case 280: break block224; case 281: break block225; case 283: break block226; case 284: break block227; case 285: break block228; case 286: break block229; case 27: break block23; case 289: break block230; case 290: break block231; case 291: break block232; case 292: break block233; case 293: break block234; case 294: break block235; case 295: break block236; case 296: break block237; case 297: break block238; case 298: break block239; case 28: break block24; case 299: break block240; case 300: break block241; case 301: break block242; case 302: case 303: case 304: break block243; case 305: case 306: break block244; case 307: break block245; case 308: break block246; case 309: break block247; case 310: break block248; case 311: break block249; case 29: break block25; case 312: break block250; case 313: break block251; case 314: break block252; case 315: break block253; case 316: break block254; case 317: break block255; case 318: break block256; case 319: break block257; case 320: break block258; case 321: break block259; case 30: break block26; case 322: break block260; case 323: break block261; case 326: case 328: case 330: break block263; case 329: break block264; case 331: break block265; case 332: break block266; case 333: case 334: break block267; case 335: break block268; case 336: break block269; case 31: break block27; case 337: break block270; case 339: break block271; case 340: break block272; case 341: break block273; case 342: break block274; case 343: break block275; case 2: break block276; case 32: case 67: break block28; case 33: break block29; case 34: break block30; case 35: break block31; case 36: break block32; case 3: break block324; case 37: break block33; case 38: break block34; case 39: break block35; case 40: break block36; case 41: break block37; case 42: break block38; case 43: break block39; case 4: break block4; case 44: break block40; case 45: break block41; case 46: break block42; case 48: break block43; case 49: break block44; case 50: break block45; case 51: break block46; case 52: break block47; case 53: break block48; case 54: break block49; case 55: break block50; case 56: break block51; case 57: break block52; case 5: case 6: case 7: case 324: break block523; case 58: break block53; case 59: break block54; case 60: break block55; case 61: case 76: case 173: break block56; case 63: case 80: case 219: case 222: case 247: break block57; case 64: break block58; case 66: break block59; case 8: case 9: break block6; case 68: break block60; case 69: break block61; case 70: break block62; case 71: break block63; case 73: case 75: break block64; case 74: break block65; case 77: break block66; case 78: case 174: break block67; case 79: break block68; case 82: break block69; case 83: break block70; case 84: break block71; case 85: break block72; case 10: break block722; case 86: break block73; case 87: break block74; case 88: break block75; case 89: case 91: break block76; case 90: break block77; case 92: break block78; case 93: break block79; case 94: break block80; case 95: break block81; case 96: case 97: break block82; case 11: break block821; case 98: break block83; case 99: break block84; case 101: case 134: case 144: case 234: case 237: case 242: break block85; case 102: break block86; case 103: break block87; case 104: break block88; case 105: case 117: case 258: case 259: break block89; case 107: case 110: break block90; case 108: break block91; case 109: break block92; case 12: break block920; case 111: break block93; case 112: break block94; case 113: break block95; case 114: break block96; case 115: break block97; case 116: case 131: break block98; case 118: break block99; default: break block262; }; } if (HEAP32[$5_1 + 244 >> 2]) { break block262 } HEAP8[$5_1 + 223 | 0] = 1; break block262; } if (HEAP32[$5_1 + 244 >> 2]) { break block262 } HEAP8[$5_1 + 223 | 0] = 2; break block262; } if (HEAPU8[$5_1 + 18 | 0]) { break block262 } $2_1 = HEAP32[$5_1 >> 2]; block277 : { if (HEAP32[$5_1 + 40 >> 2]) { if (!HEAPU8[$2_1 + 87 | 0]) { break block262 } $2_1 = 7; break block277; } block279 : { block280 : { block278 : { $4_1 = HEAP32[$5_1 + 8 >> 2]; if ($4_1) { break block278 } if (HEAPU8[$2_1 + 177 | 0]) { break block279 } $4_1 = $856($5_1); if ($4_1) { break block278 } HEAP32[$5_1 + 12 >> 2] = 1; $4_1 = 0; break block280; } block281 : { if (!HEAPU8[$5_1 + 163 | 0]) { break block281 } $7_1 = HEAP32[$5_1 + 148 >> 2]; if (!HEAP32[$7_1 + 96 >> 2]) { break block281 } $857($4_1, 83); $10_1 = $858($4_1, 36, HEAP32[$7_1 + 92 >> 2]); $9_1 = HEAP32[$7_1 + 100 >> 2]; $6_1 = 0; while (1) { if (($6_1 | 0) < HEAP32[$7_1 + 96 >> 2]) { $835($4_1, 94, HEAP32[$7_1 + 92 >> 2], $6_1, $6_1 + $9_1 | 0); $6_1 = $6_1 + 1 | 0; continue; } break; }; $326($4_1, 84, $9_1, $6_1); $326($4_1, 39, HEAP32[$7_1 + 92 >> 2], $10_1 + 1 | 0); HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; } $857($4_1, 70); HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2]) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; $6_1 = 0; while (1) { block285 : { if (!(HEAP32[$5_1 + 96 >> 2] >>> $6_1 & 1)) { break block285 } $314($4_1, $6_1); $7_1 = HEAP32[(HEAP32[$2_1 + 16 >> 2] + ($6_1 << 4) | 0) + 12 >> 2]; $312($4_1, 2, $6_1, HEAP32[$5_1 + 92 >> 2] >>> $6_1 & 1, HEAP32[$7_1 >> 2], HEAP32[$7_1 + 4 >> 2]); if (HEAPU8[$2_1 + 177 | 0]) { break block285 } $7_1 = HEAP32[$4_1 + 108 >> 2]; if (($7_1 | 0) <= 0) { break block285 } HEAP16[(HEAP32[$4_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) - 18 >> 1] = 1; } $6_1 = $6_1 + 1 | 0; if (($6_1 | 0) < HEAP32[$2_1 + 20 >> 2]) { continue } break; }; $6_1 = 0; while (1) { if (($6_1 | 0) < HEAP32[$5_1 + 228 >> 2]) { $859($4_1, 170, 0, 0, 0, $684($2_1, HEAP32[HEAP32[$5_1 + 276 >> 2] + ($6_1 << 2) >> 2]), -11); $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = 0; HEAP32[$5_1 + 228 >> 2] = 0; block287 : { $2_1 = HEAP32[$5_1 + 120 >> 2]; if (!$2_1) { break block287 } $7_1 = HEAP32[$5_1 + 8 >> 2]; while (1) { if (($2_1 | 0) <= ($6_1 | 0)) { break block287 } $2_1 = HEAP32[$5_1 + 124 >> 2] + ($6_1 << 4) | 0; $859($7_1, 169, HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], HEAPU8[$2_1 + 8 | 0], HEAP32[$2_1 + 12 >> 2], -1); $6_1 = $6_1 + 1 | 0; $2_1 = HEAP32[$5_1 + 120 >> 2]; continue; }; } block288 : { $2_1 = HEAP32[$5_1 + 128 >> 2]; if (!$2_1) { break block288 } $10_1 = HEAP32[$5_1 + 8 >> 2]; $9_1 = HEAP32[$5_1 >> 2]; while (1) { if (!$2_1) { break block288 } $7_1 = HEAP32[$2_1 + 12 >> 2]; $6_1 = HEAP32[$2_1 + 8 >> 2]; $860($5_1, 0, $6_1, HEAP32[HEAP32[(HEAP32[$9_1 + 16 >> 2] + ($6_1 << 4) | 0) + 12 >> 2] + 72 >> 2], 102); $11_1 = $7_1 - 1 | 0; $861($10_1, $11_1, HEAP32[HEAP32[$2_1 + 4 >> 2] >> 2]); $6_1 = $313($10_1, 12, 50576); if (!$6_1) { break block288 } HEAP32[$6_1 + 72 >> 2] = $7_1; HEAP32[$6_1 + 64 >> 2] = $11_1; HEAP32[$6_1 + 52 >> 2] = $7_1; HEAP32[$6_1 + 8 >> 2] = $7_1; HEAP32[$6_1 + 124 >> 2] = $7_1; HEAP32[$6_1 + 112 >> 2] = $7_1; HEAP16[$6_1 + 62 >> 1] = 16; HEAP32[$6_1 + 208 >> 2] = $7_1; HEAP32[$6_1 + 144 >> 2] = $7_1; $11_1 = $7_1 + 2 | 0; HEAP32[$6_1 + 12 >> 2] = $11_1; HEAP32[$6_1 + 148 >> 2] = $11_1; HEAP32[$6_1 + 88 >> 2] = $7_1 + 1; if (!HEAP32[$5_1 + 44 >> 2]) { HEAP32[$5_1 + 44 >> 2] = 1 } $2_1 = HEAP32[$2_1 >> 2]; continue; }; } block290 : { $2_1 = HEAP32[$5_1 + 72 >> 2]; if (!$2_1) { break block290 } $6_1 = 0; HEAP8[$5_1 + 23 | 0] = 0; $7_1 = $2_1 + 8 | 0; while (1) { if (HEAP32[$2_1 >> 2] <= ($6_1 | 0)) { break block290 } $10_1 = $7_1 + ($6_1 << 4) | 0; $862($5_1, HEAP32[$10_1 >> 2], HEAP32[$10_1 + 12 >> 2]); $6_1 = $6_1 + 1 | 0; continue; }; } block291 : { if (!HEAPU8[$5_1 + 163 | 0]) { break block291 } $2_1 = HEAP32[$5_1 + 148 >> 2]; $6_1 = HEAP32[$2_1 + 96 >> 2]; if (!$6_1) { break block291 } $326($4_1, 117, HEAP32[$2_1 + 92 >> 2], $6_1); } $863($4_1, 1); } $2_1 = 1; if (HEAP32[$5_1 + 40 >> 2]) { break block277 } $316($4_1, $5_1); } $2_1 = 101; } HEAP32[$5_1 + 12 >> 2] = $2_1; break block262; } $4_1 = HEAP32[$3 - 8 >> 2]; $7_1 = HEAP32[$5_1 >> 2]; if ($864($5_1, 22, 20110, 0, 0)) { break block262 } $2_1 = $856($5_1); if (!$2_1) { break block262 } block293 : { if (($4_1 | 0) == 7) { break block293 } $4_1 = ($4_1 | 0) == 9 ? 2 : 1; $6_1 = 0; while (1) { if (HEAP32[$7_1 + 20 >> 2] <= ($6_1 | 0)) { break block293 } $10_1 = HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($6_1 << 4) | 0) + 4 >> 2]; block295 : { if ($10_1) { $9_1 = 0; if (HEAP8[HEAP32[$10_1 + 4 >> 2] + 24 | 0] & 1) { break block295 } } $9_1 = $4_1; } $326($2_1, 2, $6_1, $9_1); $314($2_1, $6_1); $6_1 = $6_1 + 1 | 0; continue; }; } $857($2_1, 1); break block262; } HEAP32[$3 + 16 >> 2] = 7; break block262; } HEAP32[$3 + 4 >> 2] = HEAPU16[$3 + 2 >> 1]; break block262; } $2_1 = HEAPU16[$3 - 10 >> 1] == 12; if ($864($5_1, 22, $2_1 ? 20355 : 18928, 0, 0)) { break block262 } $4_1 = $856($5_1); if (!$4_1) { break block262 } $326($4_1, 1, 1, $2_1); break block262; } $865($5_1, 0, $3 + 4 | 0); break block262; } $865($5_1, 1, $3 + 4 | 0); break block262; } $865($5_1, 2, $3 + 4 | 0); break block262; } $866($5_1, $3 - 8 | 0, $3 + 4 | 0, HEAP32[$3 - 44 >> 2], 0, 0, HEAP32[$3 - 20 >> 2]); break block262; } $867($5_1); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 - 20 >> 2] = 1; break block262; } HEAP32[$3 + 4 >> 2] = !HEAPU8[HEAP32[$5_1 >> 2] + 177 | 0]; break block262; } $868($5_1, $3 - 20 | 0, $3 - 8 | 0, HEAP32[$3 + 4 >> 2], 0); break block262; } $868($5_1, 0, 0, 0, HEAP32[$3 + 4 >> 2]); $789(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = HEAP32[$3 + 4 >> 2] | HEAP32[$2_1 >> 2]; break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; block296 : { $4_1 = HEAP32[$3 + 8 >> 2]; if (($4_1 | 0) != 5) { break block296 } if ($68($2_1, 15209, 5)) { break block296 } HEAP32[$3 - 8 >> 2] = 640; break block262; } HEAP32[$3 - 8 >> 2] = 0; HEAP32[$8_1 + 4 >> 2] = $2_1; HEAP32[$8_1 >> 2] = $4_1; $257($5_1, 6069, $8_1); break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; block298 : { block297 : { $4_1 = HEAP32[$3 + 8 >> 2]; if (($4_1 | 0) != 6) { break block297 } if ($68($2_1, 3462, 6)) { break block297 } $2_1 = 65536; break block298; } HEAP32[$8_1 + 20 >> 2] = $2_1; HEAP32[$8_1 + 16 >> 2] = $4_1; $257($5_1, 6069, $8_1 + 16 | 0); $2_1 = 0; } HEAP32[$3 + 4 >> 2] = $2_1; break block262; } $2_1 = HEAPU8[$3 + 8 | 0] | HEAPU8[$3 + 9 | 0] << 8 | (HEAPU8[$3 + 10 | 0] << 16 | HEAPU8[$3 + 11 | 0] << 24); $9_1 = HEAPU8[$3 + 4 | 0] | HEAPU8[$3 + 5 | 0] << 8 | (HEAPU8[$3 + 6 | 0] << 16 | HEAPU8[$3 + 7 | 0] << 24); HEAP32[$8_1 + 712 >> 2] = $9_1; HEAP32[$8_1 + 716 >> 2] = $2_1; $4_1 = $3 - 8 | 0; $6_1 = HEAPU8[$4_1 + 4 | 0] | HEAPU8[$4_1 + 5 | 0] << 8 | (HEAPU8[$4_1 + 6 | 0] << 16 | HEAPU8[$4_1 + 7 | 0] << 24); HEAP32[$8_1 + 704 >> 2] = HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8 | (HEAPU8[$4_1 + 2 | 0] << 16 | HEAPU8[$4_1 + 3 | 0] << 24); HEAP32[$8_1 + 708 >> 2] = $6_1; $7_1 = HEAP32[$5_1 + 252 >> 2]; if (!$7_1) { break block262 } $14 = HEAP32[$5_1 >> 2]; if (HEAP32[$14 + 128 >> 2] <= HEAP16[$7_1 + 34 >> 1]) { HEAP32[$8_1 + 48 >> 2] = HEAP32[$7_1 >> 2]; $257($5_1, 6630, $8_1 + 48 | 0); break block262; } if (HEAPU8[$5_1 + 224 | 0] <= 1) { $869($8_1 + 704 | 0) } block302 : { block301 : { if ($2_1 >>> 0 < 16) { break block301 } if ($68(($2_1 + $9_1 | 0) - 6 | 0, 3680, 6)) { break block302 } $4_1 = $9_1 - 1 | 0; $2_1 = $2_1 - 6 | 0; $11_1 = 1; while (1) { $10_1 = 65; if (!$2_1) { break block303 } if (HEAP8[HEAPU8[$2_1 + $4_1 | 0] + 31424 | 0] & 1) { $2_1 = $2_1 - 1 | 0; continue; } break; }; HEAP32[$8_1 + 716 >> 2] = $2_1; if ($2_1 >>> 0 < 9) { break block301 } if ($68(($2_1 + $9_1 | 0) - 9 | 0, 15702, 9)) { break block302 } $2_1 = $2_1 - 9 | 0; while (1) { if (!$2_1) { break block303 } if (HEAP8[HEAPU8[$2_1 + $4_1 | 0] + 31424 | 0] & 1) { $2_1 = $2_1 - 1 | 0; continue; } break; }; HEAP32[$8_1 + 716 >> 2] = $2_1; } if ($2_1 >>> 0 >= 3) { break block302 } $10_1 = 65; $11_1 = 1; break block306; } $869($8_1 + 712 | 0); $9_1 = HEAP32[$8_1 + 712 >> 2]; $2_1 = HEAP32[$8_1 + 716 >> 2]; $11_1 = 1; $6_1 = 0; while (1) { if (($6_1 | 0) == 6) { $10_1 = 65; break block306; } block308 : { if (HEAPU8[$6_1 + 50936 | 0] != ($2_1 | 0)) { break block308 } if ($68($9_1, HEAP32[($6_1 << 2) + 76320 >> 2], $2_1)) { break block308 } $11_1 = ($6_1 & 3) == 1 ? 5 : 1; $15_1 = ($6_1 << 4) + 16 | 0; $10_1 = HEAPU8[$6_1 + 50880 | 0]; $2_1 = 0; break block306; } $6_1 = $6_1 + 1 | 0; continue; }; } $2_1 = HEAPU16[$3 + 2 >> 1]; $4_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 688 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 692 >> 2] = $4_1; $9_1 = $3 + 4 | 0; $10_1 = $870($5_1, $2_1, $8_1 + 688 | 0); block309 : { if (!$10_1) { break block309 } $4_1 = HEAP32[$10_1 + 8 >> 2]; if (HEAPU8[$4_1 | 0] == 48) { $7_1 = (HEAPU8[$4_1 + 1 | 0] & 223) == 88 } HEAP8[$10_1 | 0] = 156; $6_1 = $4_1; while (1) { $2_1 = HEAPU8[$6_1 | 0]; block313 : { block314 : { if (($2_1 | 0) != 95) { HEAP8[$4_1 | 0] = $2_1; $4_1 = $4_1 + 1 | 0; $2_1 = HEAPU8[$6_1 | 0]; if (!(($2_1 | 0) == 46 | ($2_1 | 0) == 101) & ($2_1 | 0) != 69) { break block313 } HEAP8[$10_1 | 0] = 154; break block314; } $2_1 = HEAPU8[$6_1 - 1 | 0]; block316 : { if (!$7_1) { if ($2_1 - 58 >>> 0 < 4294967286 | HEAPU8[$6_1 + 1 | 0] - 58 >>> 0 < 4294967286) { break block316 } break block314; } if (!(HEAPU8[$2_1 + 31424 | 0] & 8)) { break block316 } if (HEAPU8[HEAPU8[$6_1 + 1 | 0] + 31424 | 0] & 8) { break block314 } } HEAP32[$8_1 + 672 >> 2] = HEAP32[$10_1 + 8 >> 2]; $257($5_1, 29949, $8_1 + 672 | 0); } $2_1 = HEAPU8[$6_1 | 0]; } $6_1 = $6_1 + 1 | 0; if ($2_1 & 255) { continue } break; }; block318 : { if ($7_1) { HEAP8[$10_1 | 0] = 156; break block318; } if (HEAPU8[$10_1 | 0] != 156) { break block309 } } if (!$296(HEAP32[$10_1 + 8 >> 2], $8_1 + 712 | 0)) { break block309 } HEAP32[$10_1 + 8 >> 2] = HEAP32[$8_1 + 712 >> 2]; HEAP32[$10_1 + 4 >> 2] = HEAP32[$10_1 + 4 >> 2] | 2048; } HEAP32[$9_1 >> 2] = $10_1; break block262; } HEAP32[$3 - 44 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } $2_1 = $3 - 8 | 0; $4_1 = $270(HEAP32[$5_1 >> 2], 100, 0); HEAP32[$2_1 >> 2] = $4_1; if (!$4_1) { break block262 } $4_1 = $299(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$3 + 8 >> 2], 0); HEAP32[HEAP32[$2_1 >> 2] >> 2] = $4_1; break block262; } HEAP32[$3 - 32 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } $2_1 = $270(HEAP32[$5_1 >> 2], 100, 0); block320 : { if ($2_1) { HEAP8[$2_1 + 16 | 0] = 167; HEAP32[$2_1 + 40 >> 2] = HEAP32[$3 + 4 >> 2]; break block320; } $11(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]); } HEAP32[$3 + 4 >> 2] = $2_1; break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; block322 : { if ($2_1) { HEAP32[$2_1 + 40 >> 2] = HEAP32[$3 - 8 >> 2]; break block322; } $11(HEAP32[$5_1 >> 2], HEAP32[$3 - 8 >> 2]); } HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP8[$3 + 4 | 0] = HEAPU8[$3 + 2 | 0]; break block262; } HEAP8[$3 - 8 | 0] = HEAPU8[$3 - 10 | 0]; break block262; } HEAP8[$3 - 8 | 0] = HEAPU8[$3 + 4 | 0]; break block262; } HEAP8[$3 + 16 | 0] = 0; break block262; } $2_1 = $3 - 8 | 0; HEAP32[$3 - 4 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = HEAPU16[$3 + 2 >> 1]; break block262; } HEAP32[$3 - 4 >> 2] = 0; HEAP32[$3 - 8 >> 2] = HEAPU16[$3 - 10 >> 1]; break block262; } $2_1 = $3 - 56 | 0; HEAP32[$2_1 >> 2] = $871($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 - 28 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 - 4 >> 2], HEAPU8[$3 + 4 | 0]); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $871($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 - 4 >> 2], 86, 0, HEAPU8[$3 + 4 | 0]); break block262; } HEAP32[$3 + 16 >> 2] = $871($5_1, 0, 91, 0, 86, 0, 0); break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = $872($5_1, HEAP32[$3 + 4 >> 2], 0, 0, $2_1); break block262; } $2_1 = $3 - 44 | 0; HEAP32[$2_1 >> 2] = $872($5_1, HEAP32[$3 + 4 >> 2], 0, HEAP32[$3 - 8 >> 2], $2_1); break block262; } HEAP32[$3 - 32 >> 2] = $872($5_1, HEAP32[$3 + 4 >> 2], 0, HEAP32[$3 - 8 >> 2], 0); break block262; } $2_1 = $3 - 56 | 0; HEAP32[$2_1 >> 2] = $872($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2], $2_1); break block262; } HEAP32[$3 - 44 >> 2] = $872($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2], 0); break block262; } $4_1 = $3 - 44 | 0; $6_1 = $4_1; $2_1 = $3 - 8 | 0; if (HEAP32[$2_1 >> 2]) { $4_1 = $299(HEAP32[$5_1 >> 2], HEAP32[$4_1 >> 2], HEAP32[$3 - 40 >> 2], 0); HEAP32[HEAP32[$2_1 >> 2] >> 2] = $4_1; $2_1 = HEAP32[$2_1 >> 2]; } else { $2_1 = 0 } HEAP32[$6_1 >> 2] = $2_1; break block262; } $2_1 = $3 - 20 | 0; $873($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$2_1 >> 2]); HEAP32[HEAP32[$3 + 4 >> 2] + 36 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $874($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 + 4 >> 2] = $874($5_1, 0, HEAP32[$3 + 4 >> 2]); break block262; } HEAP8[$5_1 + 27 | 0] = 1; break block262; } $6_1 = $3 - 56 | 0; $9_1 = HEAPU8[$3 - 32 | 0]; $7_1 = HEAP32[$3 - 8 >> 2]; $10_1 = HEAP32[$3 - 44 >> 2]; $4_1 = HEAP32[$5_1 >> 2]; $2_1 = $270($4_1, 24, 0); block326 : { if (HEAPU8[$4_1 + 87 | 0]) { $358($4_1, $10_1); $789($4_1, $7_1); break block326; } HEAP32[$2_1 + 4 >> 2] = $10_1; HEAP32[$2_1 + 8 >> 2] = $7_1; $4_1 = $875(HEAP32[$5_1 >> 2], $6_1); HEAP8[$2_1 + 20 | 0] = $9_1; HEAP32[$2_1 >> 2] = $4_1; } HEAP32[$6_1 >> 2] = $2_1; break block262; } HEAP8[$3 - 20 | 0] = 2; break block262; } HEAP8[$3 - 8 | 0] = 0; break block262; } HEAP8[$3 + 4 | 0] = 1; break block262; } $876($5_1, HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; $4_1 = HEAP32[$5_1 + 268 >> 2]; block328 : { if (!$4_1) { HEAP32[$5_1 + 268 >> 2] = $2_1; $2_1 = HEAP32[$3 + 8 >> 2]; break block328; } $2_1 = ($2_1 + HEAP32[$3 + 8 >> 2] | 0) - $4_1 | 0; } HEAP32[$5_1 + 272 >> 2] = $2_1; break block262; } $877($5_1); HEAP32[$5_1 + 268 >> 2] = 0; HEAP32[$5_1 + 272 >> 2] = 0; break block262; } $866($5_1, $3 - 32 | 0, $3 - 20 | 0, 0, 0, 1, HEAP32[$3 - 44 >> 2]); $2_1 = HEAP32[$5_1 + 252 >> 2]; if (!$2_1) { break block262 } HEAP8[$2_1 + 43 | 0] = 1; $4_1 = HEAP32[$5_1 >> 2]; $323($5_1, $2_1, $875($4_1, $3 + 4 | 0)); $323($5_1, $2_1, 0); $323($5_1, $2_1, $116($4_1, HEAP32[$2_1 >> 2])); HEAP32[$5_1 + 208 >> 2] = (HEAP32[$3 + 4 >> 2] + HEAP32[$3 + 8 >> 2] | 0) - HEAP32[$5_1 + 204 >> 2]; $6_1 = HEAP32[$2_1 + 48 >> 2]; if (!$6_1) { break block262 } $864($5_1, 29, HEAP32[$2_1 >> 2], HEAP32[$6_1 >> 2], HEAP32[HEAP32[HEAP32[$5_1 >> 2] + 16 >> 2] + ($309($4_1, HEAP32[$2_1 + 60 >> 2]) << 4) >> 2]); break block262; } $878($5_1, $3 + 4 | 0); break block262; } $878($5_1, 0); break block262; } $7_1 = HEAP32[$5_1 >> 2]; block330 : { block329 : { $15_1 = HEAP32[$3 - 56 >> 2]; $6_1 = $879($5_1, 0, $15_1 + 8 | 0); if (!$6_1) { break block329 } $2_1 = 0; if ($880($5_1, $6_1)) { break block330 } $2_1 = 0; if ($881($5_1, $6_1, 0)) { break block330 } $2_1 = HEAP32[$7_1 + 16 >> 2]; $11_1 = $309($7_1, HEAP32[$6_1 + 60 >> 2]); $10_1 = HEAP32[$2_1 + ($11_1 << 4) >> 2]; if ($864($5_1, 26, $10_1, HEAP32[$6_1 >> 2], 0)) { break block329 } $16_1 = $3 - 20 | 0; $12_1 = $875($7_1, $16_1); $2_1 = 0; if (!$12_1) { break block330 } $14 = $3 + 4 | 0; $9_1 = HEAP16[$6_1 + 34 >> 1]; $2_1 = ($9_1 | 0) > 0 ? $9_1 : 0; while (1) { block332 : { if (($2_1 | 0) != ($4_1 | 0)) { if ($67(HEAP32[HEAP32[$6_1 + 4 >> 2] + Math_imul($4_1, 12) >> 2], $12_1)) { break block332 } $2_1 = $4_1; } block336 : { block335 : { block334 : { if (($2_1 | 0) == ($9_1 | 0)) { HEAP32[$8_1 + 592 >> 2] = $16_1; $257($5_1, 29977, $8_1 + 592 | 0); break block334; } $9_1 = ($11_1 | 0) == 1; $882($5_1, $10_1, $9_1, 30822, 0); $883($5_1, $10_1, $9_1); $4_1 = HEAP32[$5_1 + 132 >> 2]; HEAP8[($4_1 ? $4_1 : $5_1) + 21 | 0] = 1; $4_1 = $875($7_1, $14); if ($4_1) { break block335 } } $4_1 = 0; break block336; } $14 = HEAPU8[HEAP32[$14 >> 2]]; $16_1 = HEAP32[$6_1 >> 2]; HEAP32[$8_1 + 668 >> 2] = $16_1; HEAP32[$8_1 + 664 >> 2] = $9_1; $17_1 = $8_1 + 640 | 0; HEAP32[$17_1 + 16 >> 2] = $4_1; $14 = HEAPU8[$14 + 31424 | 0] & 128; HEAP32[$8_1 + 660 >> 2] = $14; HEAP32[$8_1 + 652 >> 2] = $2_1; HEAP32[$8_1 + 648 >> 2] = $16_1; HEAP32[$8_1 + 644 >> 2] = $10_1; HEAP32[$8_1 + 640 >> 2] = $10_1; $884($5_1, 25910, $17_1); $6_1 = HEAP32[$6_1 >> 2]; $16_1 = $8_1 + 608 | 0; HEAP32[$16_1 + 16 >> 2] = $14; HEAP32[$8_1 + 620 >> 2] = $4_1; HEAP32[$8_1 + 616 >> 2] = $2_1; HEAP32[$8_1 + 612 >> 2] = $6_1; HEAP32[$8_1 + 608 >> 2] = $10_1; $884($5_1, 27114, $16_1); $885($5_1, $11_1, 1); $882($5_1, $10_1, $9_1, 14024, 1); } $2_1 = $12_1; break block330; } $4_1 = $4_1 + 1 | 0; continue; }; } $2_1 = 0; } $794($7_1, $15_1); $10($7_1, $2_1); $10($7_1, $4_1); break block262; } $867($5_1); $10_1 = HEAP32[$3 + 4 >> 2]; $4_1 = HEAP32[$5_1 >> 2]; block337 : { if (HEAPU8[$4_1 + 87 | 0]) { break block337 } $7_1 = $879($5_1, 0, $10_1 + 8 | 0); if (!$7_1) { break block337 } block340 : { switch (HEAPU8[$7_1 + 43 | 0] - 1 | 0) { case 0: $257($5_1, 15816, 0); break block337; case 1: $257($5_1, 1810, 0); break block337; default: break block340; }; } if ($880($5_1, $7_1)) { break block337 } $2_1 = HEAP32[$5_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $5_1) + 21 | 0] = 1; $12_1 = $309($4_1, HEAP32[$7_1 + 60 >> 2]); $2_1 = $270($4_1, 64, 0); if (!$2_1) { break block337 } HEAP32[$5_1 + 252 >> 2] = $2_1; HEAP32[$2_1 + 24 >> 2] = 1; $6_1 = HEAP16[$7_1 + 34 >> 1]; HEAP16[$2_1 + 34 >> 1] = $6_1; HEAP32[$2_1 + 4 >> 2] = $270($4_1, Math_imul(($6_1 - 1 | 0) / 8 | 0, 96) + 96 | 0, 0); HEAP32[$8_1 + 576 >> 2] = HEAP32[$7_1 >> 2]; $6_1 = $310($4_1, 6123, $8_1 + 576 | 0); HEAP32[$2_1 >> 2] = $6_1; $9_1 = HEAP32[$2_1 + 4 >> 2]; if (!$9_1 | !$6_1) { break block337 } $6_1 = Math_imul(HEAP16[$2_1 + 34 >> 1], 12); if ($6_1) { wasm2js_memory_copy($9_1, HEAP32[$7_1 + 4 >> 2], $6_1) } $6_1 = 0; while (1) { if (($6_1 | 0) < HEAP16[$2_1 + 34 >> 1]) { $9_1 = HEAP32[$2_1 + 4 >> 2] + Math_imul($6_1, 12) | 0; $11_1 = $116($4_1, HEAP32[$9_1 >> 2]); HEAP32[$9_1 >> 2] = $11_1; HEAP8[$9_1 + 7 | 0] = $886($11_1); $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP32[$2_1 + 52 >> 2] = $887($4_1, HEAP32[$7_1 + 52 >> 2], 0); HEAP32[$2_1 + 60 >> 2] = HEAP32[(HEAP32[$4_1 + 16 >> 2] + ($12_1 << 4) | 0) + 12 >> 2]; HEAP32[$2_1 + 44 >> 2] = HEAP32[$7_1 + 44 >> 2]; } $794($4_1, $10_1); break block262; } $20_1 = HEAP32[$3 - 32 >> 2]; $2_1 = 0; $14 = HEAP32[$5_1 >> 2]; block343 : { if (HEAPU8[$14 + 87 | 0]) { break block343 } $9_1 = $879($5_1, 0, $20_1 + 8 | 0); if (!$9_1) { break block343 } if ($880($5_1, $9_1)) { break block343 } if ($881($5_1, $9_1, 1)) { break block343 } $4_1 = $3 + 4 | 0; $7_1 = $875($14, $4_1); if (!$7_1) { break block343 } $15_1 = $888($9_1, $7_1); block345 : { if (($15_1 | 0) < 0) { HEAP32[$8_1 + 512 >> 2] = $4_1; $257($5_1, 29977, $8_1 + 512 | 0); break block345; } $2_1 = HEAPU16[(HEAP32[$9_1 + 4 >> 2] + Math_imul($15_1, 12) | 0) + 10 >> 1]; if ($2_1 & 9) { HEAP32[$8_1 + 564 >> 2] = $7_1; HEAP32[$8_1 + 560 >> 2] = $2_1 & 1 ? 18617 : 20401; $257($5_1, 29900, $8_1 + 560 | 0); break block345; } if (HEAP16[$9_1 + 34 >> 1] <= 1) { HEAP32[$8_1 + 528 >> 2] = $7_1; $257($5_1, 2282, $8_1 + 528 | 0); break block345; } $4_1 = HEAP32[$14 + 16 >> 2]; $2_1 = $309($14, HEAP32[$9_1 + 60 >> 2]); $4_1 = HEAP32[$4_1 + ($2_1 << 4) >> 2]; if ($864($5_1, 26, $4_1, HEAP32[$9_1 >> 2], $7_1)) { break block345 } $6_1 = ($2_1 | 0) == 1; $882($5_1, $4_1, $6_1, 30822, 0); $883($5_1, $4_1, $6_1); HEAP32[$8_1 + 556 >> 2] = HEAP32[$9_1 >> 2]; HEAP32[$8_1 + 552 >> 2] = $15_1; HEAP32[$8_1 + 548 >> 2] = $2_1; HEAP32[$8_1 + 544 >> 2] = $4_1; $884($5_1, 25581, $8_1 + 544 | 0); $885($5_1, $2_1, 2); $882($5_1, $4_1, $6_1, 11096, 1); if (HEAP32[$5_1 + 40 >> 2] | HEAPU8[(HEAP32[$9_1 + 4 >> 2] + Math_imul($15_1, 12) | 0) + 10 | 0] & 32) { break block345 } $11_1 = $856($5_1); $12_1 = HEAP32[$5_1 + 44 >> 2]; HEAP32[$5_1 + 44 >> 2] = $12_1 + 1; $860($5_1, $12_1, $2_1, $9_1, 113); $22_1 = $858($11_1, 36, $12_1); $4_1 = HEAP32[$5_1 + 48 >> 2]; $16_1 = $4_1 + 1 | 0; HEAP32[$5_1 + 48 >> 2] = $16_1; block349 : { if (!(HEAPU8[$9_1 + 28 | 0] & 128)) { $326($11_1, 135, $12_1, $16_1); $10_1 = $4_1 + 2 | 0; $4_1 = 0; $2_1 = 0; $6_1 = HEAP32[$5_1 + 48 >> 2] + HEAP16[$9_1 + 34 >> 1] | 0; break block349; } $2_1 = $359($9_1); HEAP32[$5_1 + 48 >> 2] = $16_1 + HEAPU16[$2_1 + 52 >> 1]; $10_1 = $4_1 + 2 | 0; $6_1 = 0; while (1) { $4_1 = HEAPU16[$2_1 + 50 >> 1]; if ($6_1 >>> 0 < $4_1 >>> 0) { $835($11_1, 94, $12_1, $6_1, $6_1 + $10_1 | 0); $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = HEAP32[$5_1 + 48 >> 2]; } $17_1 = $6_1 + 1 | 0; HEAP32[$5_1 + 48 >> 2] = $17_1; $6_1 = 0; while (1) { if (($6_1 | 0) < HEAP16[$9_1 + 34 >> 1]) { block352 : { if (($6_1 | 0) == ($15_1 | 0)) { break block352 } $23_1 = Math_imul($6_1, 12); $26_1 = $23_1 + HEAP32[$9_1 + 4 >> 2] | 0; if (HEAPU8[$26_1 + 10 | 0] & 32) { break block352 } block354 : { if ($2_1) { $19_1 = $889($2_1, $6_1 << 16 >> 16); $27 = $889($2_1, $15_1 << 16 >> 16); if (($19_1 | 0) < HEAPU16[$2_1 + 50 >> 1]) { break block352 } $19_1 = ($10_1 + $19_1 | 0) - (($19_1 | 0) > ($27 | 0)) | 0; break block354; } $19_1 = $4_1 + $10_1 | 0; } block356 : { if (($6_1 | 0) == HEAP16[$9_1 + 32 >> 1]) { $326($11_1, 75, 0, $19_1); break block356; } $27 = HEAPU8[$26_1 + 5 | 0]; if (($27 | 0) == 69) { HEAP8[$26_1 + 5 | 0] = 67 } $890($11_1, $9_1, $12_1, $6_1, $19_1); HEAP8[($23_1 + HEAP32[$9_1 + 4 >> 2] | 0) + 5 | 0] = $27; } $4_1 = $4_1 + 1 | 0; } $6_1 = $6_1 + 1 | 0; continue; } break; }; if (!$4_1) { HEAP32[$5_1 + 48 >> 2] = HEAP32[$5_1 + 48 >> 2] + 1; $326($11_1, 75, 0, $10_1); $4_1 = 1; } $835($11_1, 97, $10_1, $4_1, $17_1); block360 : { if ($2_1) { $312($11_1, 138, $12_1, $17_1, $10_1, HEAPU16[$2_1 + 50 >> 1]); break block360; } $835($11_1, 128, $12_1, $17_1, $16_1); } $2_1 = HEAP32[$11_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$11_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 2 } $326($11_1, 39, $12_1, $22_1 + 1 | 0); HEAP32[(HEAPU8[HEAP32[$11_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$11_1 + 104 >> 2] + Math_imul($22_1, 20) | 0) + 8 >> 2] = HEAP32[$11_1 + 108 >> 2]; } $2_1 = $7_1; } $10($14, $2_1); $794($14, $20_1); break block262; } $14 = $3 - 4 | 0; $15_1 = $3 - 8 | 0; HEAP32[$14 >> 2] = HEAP32[$5_1 + 216 >> 2] + (HEAP32[$5_1 + 212 >> 2] - HEAP32[$15_1 >> 2] | 0); if (HEAP32[$5_1 + 40 >> 2]) { break block262 } $7_1 = HEAP32[$5_1 >> 2]; $2_1 = HEAP32[$7_1 + 16 >> 2]; $4_1 = HEAP32[$5_1 + 252 >> 2]; $9_1 = $309($7_1, HEAP32[$4_1 + 60 >> 2]); $6_1 = HEAP32[$2_1 + ($9_1 << 4) >> 2]; $12_1 = HEAP32[$4_1 + 4 >> 2] + Math_imul(HEAP16[$4_1 + 34 >> 1], 12) | 0; $2_1 = $891($4_1, $12_1 - 12 | 0); $10_1 = HEAP32[$4_1 >> 2] + 16 | 0; $16_1 = $319($7_1, $10_1, $6_1); if ($864($5_1, 26, $6_1, HEAP32[$16_1 >> 2], 0)) { break block262 } $17_1 = $12_1 - 2 | 0; $11_1 = HEAPU16[$17_1 >> 1]; if ($11_1 & 1) { $257($5_1, 11225, 0); break block262; } if (HEAP32[$4_1 + 8 >> 2]) { $257($5_1, 11257, 0); break block262; } block370 : { if (!($11_1 & 96)) { $2_1 = $2_1 ? (HEAPU8[HEAP32[$2_1 + 12 >> 2]] != 122 ? $2_1 : 0) : 0; if (!(!$2_1 | (!(HEAPU8[$7_1 + 33 | 0] & 64) | !HEAP32[$4_1 + 48 >> 2]))) { $892($5_1, $6_1, $10_1, 13114) } if (!($2_1 | !(HEAPU8[$12_1 - 8 | 0] & 15))) { $892($5_1, $6_1, $10_1, 20184); break block370; } if (!$2_1) { break block370 } HEAP32[$8_1 + 712 >> 2] = 0; if ($371($7_1, $2_1, 1, 65, $8_1 + 712 | 0)) { break block262 } $2_1 = HEAP32[$8_1 + 712 >> 2]; if (!$2_1) { $892($5_1, $6_1, $10_1, 3059) } $200($2_1); break block370; } if (!($11_1 & 64)) { break block370 } $892($5_1, $6_1, $10_1, 11284); } $11_1 = $299($7_1, HEAP32[$15_1 >> 2], HEAP32[$14 >> 2], 0); if ($11_1) { $2_1 = $11_1 + HEAP32[$14 >> 2] | 0; while (1) { block373 : { $2_1 = $2_1 - 1 | 0; if ($11_1 >>> 0 >= $2_1 >>> 0) { break block373 } $14 = HEAPU8[$2_1 | 0]; if (($14 | 0) != 59 & !(HEAP8[$14 + 31424 | 0] & 1)) { break block373 } HEAP8[$2_1 | 0] = 0; continue; } break; }; $2_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$8_1 + 496 >> 2] = $10_1; HEAP32[$8_1 + 492 >> 2] = $2_1; HEAP32[$8_1 + 488 >> 2] = $11_1; HEAP32[$8_1 + 484 >> 2] = $2_1; HEAP32[$8_1 + 480 >> 2] = $6_1; $884($5_1, 19847, $8_1 + 480 | 0); $13($7_1, $11_1); } $2_1 = $856($5_1); if (!$2_1) { break block262 } $7_1 = $893($5_1); $835($2_1, 99, $9_1, $7_1, 2); $314($2_1, $9_1); $326($2_1, 86, $7_1, -2); $326($2_1, 50, $7_1, HEAP32[$2_1 + 108 >> 2] + 2 | 0); $835($2_1, 100, $9_1, 2, 3); $894($5_1, $7_1); $885($5_1, $9_1, 3); if (!(HEAP8[$16_1 + 30 | 0] & 1 | (HEAP32[$4_1 + 16 >> 2] | !!(HEAPU8[$17_1 | 0] & 96 ? HEAPU8[$12_1 - 8 | 0] & 15 : 0)))) { break block262 } HEAP32[$8_1 + 468 >> 2] = $6_1; HEAP32[$8_1 + 464 >> 2] = $10_1; $884($5_1, 28606, $8_1 + 464 | 0); break block262; } $11_1 = HEAP32[$3 - 32 >> 2]; $2_1 = 0; $9_1 = HEAP32[$5_1 >> 2]; block377 : { if (HEAPU8[$9_1 + 87 | 0]) { break block377 } $10_1 = $879($5_1, 0, $11_1 + 8 | 0); if (!$10_1) { break block377 } $6_1 = HEAP32[$9_1 + 16 >> 2]; $12_1 = $309(HEAP32[$5_1 >> 2], HEAP32[$10_1 + 60 >> 2]); $7_1 = HEAP32[$6_1 + ($12_1 << 4) >> 2]; $6_1 = $875($9_1, $3 + 4 | 0); if (!$6_1) { break block377 } block380 : { block379 : { block378 : { if ($319($9_1, $6_1, $7_1)) { break block378 } if ($778($9_1, $6_1, $7_1)) { break block378 } if (!$895($9_1, $10_1, $6_1)) { break block379 } } HEAP32[$8_1 + 448 >> 2] = $6_1; $257($5_1, 8291, $8_1 + 448 | 0); break block380; } if ($880($5_1, $10_1)) { break block380 } if ($896($5_1, $6_1, 14440, $6_1)) { break block380 } $2_1 = HEAP32[$10_1 >> 2]; if (HEAPU8[$10_1 + 43 | 0] == 2) { HEAP32[$8_1 + 320 >> 2] = $2_1; $257($5_1, 15850, $8_1 + 320 | 0); break block380; } if ($864($5_1, 26, $7_1, $2_1, 0)) { break block380 } if ($897($5_1, $10_1)) { break block380 } if (HEAPU8[$10_1 + 43 | 0] == 1) { $2_1 = $684($9_1, $10_1); $4_1 = HEAP32[HEAP32[HEAP32[$2_1 + 8 >> 2] >> 2] + 76 >> 2] ? $2_1 : 0; } $14 = $856($5_1); if (!$14) { break block380 } $2_1 = HEAP32[$5_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $5_1) + 21 | 0] = 1; $2_1 = HEAP32[$10_1 >> 2]; $17_1 = $353($2_1); $15_1 = $8_1 + 416 | 0; HEAP32[$15_1 + 20 >> 2] = $2_1; $16_1 = ($12_1 | 0) == 1; HEAP32[$15_1 + 16 >> 2] = $16_1; HEAP32[$8_1 + 428 >> 2] = $6_1; HEAP32[$8_1 + 424 >> 2] = $2_1; HEAP32[$8_1 + 420 >> 2] = $7_1; HEAP32[$8_1 + 416 >> 2] = $7_1; $884($5_1, 28422, $15_1); $15_1 = $8_1 + 384 | 0; HEAP32[$15_1 + 20 >> 2] = $2_1; HEAP32[$15_1 + 16 >> 2] = $17_1; HEAP32[$8_1 + 396 >> 2] = $6_1; HEAP32[$8_1 + 392 >> 2] = $6_1; HEAP32[$8_1 + 388 >> 2] = $6_1; HEAP32[$8_1 + 384 >> 2] = $7_1; $884($5_1, 22464, $15_1); if ($319($9_1, 14830, $7_1)) { HEAP32[$8_1 + 376 >> 2] = HEAP32[$10_1 >> 2]; HEAP32[$8_1 + 372 >> 2] = $6_1; HEAP32[$8_1 + 368 >> 2] = $7_1; $884($5_1, 19789, $8_1 + 368 | 0); } if (!$16_1) { HEAP32[$8_1 + 356 >> 2] = $6_1; HEAP32[$8_1 + 352 >> 2] = $7_1; HEAP32[$8_1 + 348 >> 2] = $2_1; HEAP32[$8_1 + 344 >> 2] = $6_1; HEAP32[$8_1 + 340 >> 2] = $2_1; HEAP32[$8_1 + 336 >> 2] = $7_1; $884($5_1, 27245, $8_1 + 336 | 0); } if ($4_1) { $2_1 = HEAP32[$5_1 + 48 >> 2] + 1 | 0; HEAP32[$5_1 + 48 >> 2] = $2_1; $861($14, $2_1, $6_1); $859($14, 177, $2_1, 0, 0, $4_1, -11); } $885($5_1, $12_1, 1); $882($5_1, $7_1, $16_1, 14024, 0); } $2_1 = $6_1; } $794($9_1, $11_1); $10($9_1, $2_1); break block262; } $898($5_1, $3 - 8 | 0, $3 + 4 | 0); break block262; } $898($5_1, 0, 0); break block262; } $899($5_1, $3 - 8 | 0, $3 + 4 | 0); break block262; } $899($5_1, 0, 0); break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; $900($5_1, 25, 51688, $2_1, 0, 0, $2_1); break block262; } $2_1 = HEAP32[$3 - 32 >> 2]; $900($5_1, 24, 51572, $2_1, $2_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; $4_1 = HEAP32[$5_1 >> 2]; block386 : { if (HEAPU8[$4_1 + 87 | 0]) { break block386 } $9_1 = HEAP32[$3 - 8 >> 2]; if ($318($5_1)) { break block386 } $11_1 = $2_1 + 8 | 0; $12_1 = HEAP32[$2_1 + 8 >> 2]; $7_1 = HEAP32[$2_1 + 52 >> 2]; $6_1 = 0; block390 : { while (1) { if (($6_1 | 0) < HEAP32[$4_1 + 20 >> 2]) { $10_1 = $6_1 >>> 0 < 2 ^ $6_1; block389 : { if ($7_1) { if (!$828($4_1, $10_1, $7_1)) { break block389 } } $10_1 = $320(HEAP32[(HEAP32[$4_1 + 16 >> 2] + ($10_1 << 4) | 0) + 12 >> 2] + 40 | 0, $12_1); if ($10_1) { break block390 } } $6_1 = $6_1 + 1 | 0; continue; } break; }; block392 : { if (!$9_1) { HEAP32[$8_1 + 304 >> 2] = $11_1; $257($5_1, 19419, $8_1 + 304 | 0); break block392; } $901($5_1, $7_1); } HEAP8[$5_1 + 17 | 0] = 1; break block386; } $902($5_1, $10_1); } $794($4_1, $2_1); break block262; } HEAP32[$3 + 4 >> 2] = 3; break block262; } HEAP32[$3 + 4 >> 2] = 1; break block262; } $2_1 = $903($5_1, 72, HEAP32[$3 - 8 >> 2], 0); HEAP32[$3 - 56 >> 2] = $2_1; if (!$2_1) { break block262 } HEAP8[$2_1 + 1 | 0] = HEAP32[$3 - 32 >> 2]; break block262; } $2_1 = $903($5_1, 72, 0, 0); HEAP32[$3 - 32 >> 2] = $2_1; if (!$2_1) { break block262 } HEAP8[$2_1 + 1 | 0] = 4; break block262; } $7_1 = $3 - 20 | 0; $10_1 = HEAP32[$7_1 >> 2]; $4_1 = HEAP32[$3 - 8 >> 2]; $9_1 = HEAP32[$3 + 4 >> 2]; $6_1 = HEAP32[$5_1 >> 2]; $2_1 = $270($6_1, 48, 0); block394 : { if (!$2_1) { $789($6_1, $4_1); break block394; } HEAP32[$2_1 + 8 >> 2] = $4_1; HEAP16[$2_1 >> 1] = 2955; HEAP32[$2_1 + 36 >> 2] = $904($6_1, $10_1, $9_1); } HEAP32[$7_1 >> 2] = $2_1; break block262; } $2_1 = HEAP32[$3 - 8 >> 2]; $7_1 = HEAP32[$5_1 >> 2]; $10_1 = $3 - 56 | 0; $4_1 = $905($5_1, 129, $3 - 32 | 0, HEAP32[$10_1 >> 2], HEAP32[$3 + 4 >> 2]); if ($4_1) { block397 : { if (HEAPU8[$5_1 + 224 | 0] > 1) { $6_1 = $2_1; $2_1 = 0; break block397; } $6_1 = $906($7_1, $2_1, 1); } HEAP8[$4_1 + 1 | 0] = 11; HEAP32[$4_1 + 20 >> 2] = $6_1; } $11($7_1, $2_1); HEAP32[$10_1 >> 2] = $4_1; break block262; } $7_1 = HEAP32[$3 - 8 >> 2]; $11_1 = HEAP32[$3 - 68 >> 2]; $2_1 = HEAP32[$3 - 20 >> 2]; $9_1 = HEAP32[$3 - 32 >> 2]; $10_1 = HEAP32[$5_1 >> 2]; $12_1 = $3 - 80 | 0; $6_1 = $905($5_1, 128, $3 - 44 | 0, HEAP32[$12_1 >> 2], HEAP32[$3 + 4 >> 2]); block401 : { if ($6_1) { block400 : { if (HEAPU8[$5_1 + 224 | 0] > 1) { $4_1 = $2_1; $2_1 = 0; break block400; } $4_1 = $907($10_1, $2_1, 1); } HEAP32[$6_1 + 32 >> 2] = $7_1; HEAP32[$6_1 + 28 >> 2] = $9_1; HEAP32[$6_1 + 8 >> 2] = $4_1; HEAP8[$6_1 + 1 | 0] = $11_1; if (!$7_1) { break block401 } $908($5_1, HEAP32[$7_1 >> 2]); break block401; } $12($10_1, $9_1); $849($10_1, $7_1); } $789($10_1, $2_1); HEAP32[$12_1 >> 2] = $6_1; break block262; } $11_1 = HEAP32[$3 - 80 >> 2]; $4_1 = HEAP32[$3 - 8 >> 2]; $2_1 = HEAP32[$3 - 32 >> 2]; $7_1 = HEAP32[$3 - 20 >> 2]; $9_1 = HEAP32[$5_1 >> 2]; $12_1 = $3 - 92 | 0; $10_1 = $905($5_1, 130, $3 - 68 | 0, HEAP32[$12_1 >> 2], HEAP32[$3 + 4 >> 2]); if ($10_1) { block404 : { if (HEAPU8[$5_1 + 224 | 0] >= 2) { HEAP32[$10_1 + 20 >> 2] = $4_1; HEAP32[$10_1 + 24 >> 2] = $2_1; $4_1 = 0; $6_1 = $7_1; $2_1 = 0; $7_1 = 0; break block404; } HEAP32[$10_1 + 24 >> 2] = $887($9_1, $2_1, 1); HEAP32[$10_1 + 20 >> 2] = $906($9_1, $4_1, 1); $6_1 = $909($9_1, $7_1, 1); } HEAP8[$10_1 + 1 | 0] = $11_1; HEAP32[$10_1 + 16 >> 2] = $6_1; } $358($9_1, $2_1); $11($9_1, $4_1); $794($9_1, $7_1); HEAP32[$12_1 >> 2] = $10_1; break block262; } $257($5_1, 4588, 0); break block262; } $257($5_1, 4504, 0); break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; $4_1 = $3 - 20 | 0; HEAP32[$4_1 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = $2_1; $257($5_1, 4673, 0); break block262; } $2_1 = HEAP32[$3 - 8 >> 2]; HEAP32[$2_1 + 44 >> 2] = $2_1; break block262; } $2_1 = $3 - 20 | 0; $4_1 = HEAP32[$3 - 8 >> 2]; HEAP32[HEAP32[HEAP32[$2_1 >> 2] + 44 >> 2] + 40 >> 2] = $4_1; HEAP32[HEAP32[$2_1 >> 2] + 44 >> 2] = $4_1; break block262; } HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 - 20 >> 2] = 130; HEAP32[$3 - 16 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 4 >> 2] = HEAPU16[$3 + 2 >> 1]; break block262; } HEAP32[$3 + 16 >> 2] = 33; break block262; } HEAP32[$3 - 8 >> 2] = 66; break block262; } HEAP32[$3 + 4 >> 2] = HEAPU16[$3 + 2 >> 1]; break block262; } $17_1 = $3 - 68 | 0; $15_1 = $3 - 80 | 0; $22_1 = HEAP32[$3 - 92 >> 2]; $11_1 = HEAP32[$3 - 20 >> 2]; $2_1 = HEAP32[$3 - 40 >> 2]; $26_1 = HEAP32[$3 - 44 >> 2]; $14 = HEAP32[$3 - 56 >> 2]; $6_1 = HEAP32[$5_1 >> 2]; $7_1 = HEAP32[$3 + 4 >> 2]; block418 : { block407 : { block409 : { $16_1 = $3 - 116 | 0; $19_1 = HEAP32[$16_1 >> 2]; block408 : { if ($19_1) { if (HEAP32[$3 + -64 >> 2]) { $257($5_1, 14085, 0); break block407; } HEAP32[$8_1 + 704 >> 2] = $15_1; $10_1 = 1; if ($11_1) { break block408 } break block409; } $10_1 = $910($5_1, $15_1, $17_1, $8_1 + 704 | 0); if (!$11_1 | ($10_1 | 0) < 0) { break block407 } } if (HEAPU8[$6_1 + 87 | 0]) { break block407 } if (!(!HEAPU8[$6_1 + 177 | 0] | ($10_1 | 0) == 1)) { $10($6_1, HEAP32[$11_1 + 52 >> 2]); HEAP32[$11_1 + 52 >> 2] = 0; } $9_1 = $911($5_1, $11_1); if (!(!$9_1 | (HEAPU8[$6_1 + 177 | 0] | HEAP32[$3 + -64 >> 2]))) { $10_1 = HEAP32[$9_1 + 60 >> 2] == HEAP32[HEAP32[$6_1 + 16 >> 2] + 28 >> 2] ? 1 : $10_1 } if (HEAPU8[$6_1 + 87 | 0]) { break block407 } $4_1 = HEAP32[$5_1 >> 2]; HEAP32[$8_1 + 712 >> 2] = $5_1; $4_1 = HEAP32[$4_1 + 16 >> 2] + ($10_1 << 4) | 0; HEAP32[$8_1 + 752 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$8_1 + 744 >> 2] = HEAP32[$4_1 + 12 >> 2]; HEAP32[$8_1 + 716 >> 2] = $5_1; HEAP32[$8_1 + 720 >> 2] = 11; HEAP32[$8_1 + 724 >> 2] = 12; HEAP32[$8_1 + 728 >> 2] = 13; $4_1 = 0; HEAP32[$8_1 + 732 >> 2] = 0; HEAP16[$8_1 + 736 >> 1] = 0; HEAP8[$8_1 + 748 | 0] = ($10_1 | 0) == 1; HEAP32[$8_1 + 756 >> 2] = 9513; $20_1 = HEAP32[$8_1 + 704 >> 2]; HEAP32[$8_1 + 760 >> 2] = $20_1; $9_1 = $8_1 + 712 | 0; HEAP32[$8_1 + 740 >> 2] = $9_1; if ($915($9_1, $11_1)) { break block407 } $9_1 = 0; block412 : { $12_1 = $911($5_1, $11_1); if (!$12_1) { break block412 } if (HEAPU8[$12_1 + 43 | 0] == 1) { $257($5_1, 5600, 0); break block412; } block414 : { if (!(HEAPU8[$12_1 + 29 | 0] & 16)) { break block414 } if (!$916($6_1)) { break block414 } $257($5_1, 5560, 0); break block412; } $4_1 = $875($6_1, $20_1); if (!$4_1) { break block409 } if ($896($5_1, $4_1, 9513, HEAP32[$12_1 >> 2])) { break block407 } block415 : { if (HEAPU8[$5_1 + 224 | 0] > 1) { break block415 } if (!$320(HEAP32[(HEAP32[$6_1 + 16 >> 2] + ($10_1 << 4) | 0) + 12 >> 2] + 40 | 0, $4_1)) { break block415 } if (!$22_1) { HEAP32[$8_1 + 288 >> 2] = $20_1; $257($5_1, 3824, $8_1 + 288 | 0); break block407; } $917($5_1, $10_1); break block407; } $22_1 = HEAP32[$12_1 >> 2]; if (!$68($22_1, 18315, 7)) { $257($5_1, 14286, 0); break block418; } $20_1 = HEAPU8[$12_1 + 43 | 0]; if (!(($14 | 0) == 66 | ($20_1 | 0) != 2)) { HEAP32[$8_1 + 260 >> 2] = $11_1 + 8; HEAP32[$8_1 + 256 >> 2] = ($14 | 0) == 33 ? 20458 : 19643; $257($5_1, 19382, $8_1 + 256 | 0); break block412; } if (!(($20_1 | 0) == 2 | ($14 | 0) != 66)) { HEAP32[$8_1 + 272 >> 2] = $11_1 + 8; $257($5_1, 19439, $8_1 + 272 | 0); break block412; } if (HEAPU8[$5_1 + 224 | 0] <= 1) { $9_1 = HEAP32[$6_1 + 16 >> 2]; $23_1 = $309($6_1, HEAP32[$12_1 + 60 >> 2]); $20_1 = HEAP32[$9_1 + ($23_1 << 4) >> 2]; $23_1 = ($23_1 | 0) == 1; if ($864($5_1, $19_1 ? 5 : $23_1 ? 5 : 7, $4_1, $22_1, $19_1 ? HEAP32[$9_1 + 16 >> 2] : $20_1)) { break block407 } $9_1 = 0; if ($864($5_1, 18, $23_1 ? 9304 : 9323, 0, $20_1)) { break block418 } } $9_1 = $270($6_1, 36, 0); if (!$9_1) { break block407 } HEAP32[$9_1 >> 2] = $4_1; $4_1 = $116($6_1, HEAP32[$11_1 + 8 >> 2]); HEAP32[$9_1 + 4 >> 2] = $4_1; HEAP32[$9_1 + 20 >> 2] = HEAP32[(HEAP32[$6_1 + 16 >> 2] + ($10_1 << 4) | 0) + 12 >> 2]; $10_1 = HEAP32[$12_1 + 60 >> 2]; HEAP8[$9_1 + 9 | 0] = ($14 | 0) == 66 ? 1 : ($14 | 0) == 33 ? 1 : 2; HEAP8[$9_1 + 8 | 0] = $26_1; HEAP32[$9_1 + 24 >> 2] = $10_1; block424 : { if (HEAPU8[$5_1 + 224 | 0] >= 2) { $918($5_1, $4_1, HEAP32[$11_1 + 8 >> 2]); $4_1 = $7_1; $7_1 = 0; break block424; } $4_1 = $906($6_1, $7_1, 1); } HEAP32[$9_1 + 16 >> 2] = $2_1; HEAP32[$9_1 + 12 >> 2] = $4_1; HEAP32[$5_1 + 260 >> 2] = $9_1; $4_1 = 0; $2_1 = 0; break block418; } if (HEAPU8[$6_1 + 176 | 0] != 1) { break block418 } HEAP8[$6_1 + 178 | 0] = HEAPU8[$6_1 + 178 | 0] | 1; break block418; } $4_1 = 0; } $9_1 = 0; } $10($6_1, $4_1); $794($6_1, $11_1); $12($6_1, $2_1); $11($6_1, $7_1); if (!HEAP32[$5_1 + 260 >> 2]) { $5($6_1, $9_1) } if (!HEAP32[$3 + -64 >> 2]) { $2_1 = HEAP32[$15_1 + 4 >> 2]; HEAP32[$16_1 >> 2] = HEAP32[$15_1 >> 2]; HEAP32[$16_1 + 4 >> 2] = $2_1; break block262; } $2_1 = HEAP32[$17_1 + 4 >> 2]; HEAP32[$16_1 >> 2] = HEAP32[$17_1 >> 2]; HEAP32[$16_1 + 4 >> 2] = $2_1; break block262; } $6_1 = HEAP32[$3 - 8 >> 2]; $16_1 = HEAP32[$3 - 32 >> 2]; $10_1 = HEAP32[$5_1 >> 2]; $2_1 = HEAP32[$5_1 + 260 >> 2]; $4_1 = HEAP32[$3 + 8 >> 2]; $7_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$5_1 + 260 >> 2] = 0; block427 : { if (HEAP32[$5_1 + 40 >> 2] | !$2_1) { break block427 } $17_1 = $4_1 + ($7_1 - $16_1 | 0) | 0; $14 = HEAP32[$2_1 >> 2]; $11_1 = $309($10_1, HEAP32[$2_1 + 20 >> 2]); HEAP32[$2_1 + 28 >> 2] = $6_1; $4_1 = $2_1 + 28 | 0; while (1) { if ($6_1) { HEAP32[$6_1 + 4 >> 2] = $2_1; $6_1 = HEAP32[$6_1 + 40 >> 2]; continue; } break; }; HEAP32[$8_1 + 704 >> 2] = $14; $6_1 = $48($14); HEAP32[$8_1 + 712 >> 2] = $5_1; HEAP32[$8_1 + 708 >> 2] = $6_1; $6_1 = HEAP32[$10_1 + 16 >> 2] + ($11_1 << 4) | 0; HEAP32[$8_1 + 752 >> 2] = HEAP32[$6_1 >> 2]; $6_1 = HEAP32[$6_1 + 12 >> 2]; HEAP32[$8_1 + 756 >> 2] = 9513; HEAP32[$8_1 + 744 >> 2] = $6_1; HEAP8[$8_1 + 748 | 0] = ($11_1 | 0) == 1; HEAP16[$8_1 + 736 >> 1] = 0; HEAP32[$8_1 + 732 >> 2] = 0; HEAP32[$8_1 + 728 >> 2] = 13; HEAP32[$8_1 + 724 >> 2] = 12; HEAP32[$8_1 + 720 >> 2] = 11; HEAP32[$8_1 + 716 >> 2] = $5_1; HEAP32[$8_1 + 760 >> 2] = $8_1 + 704; $6_1 = $8_1 + 712 | 0; HEAP32[$8_1 + 740 >> 2] = $6_1; $9_1 = $6_1 + 4 | 0; $6_1 = $4_1; while (1) { $12_1 = HEAP32[$6_1 >> 2]; if ($12_1) { $6_1 = 0; if ($919($9_1, HEAP32[$12_1 + 8 >> 2])) { break block427 } if ($920($9_1, HEAP32[$12_1 + 20 >> 2])) { break block427 } if ($921($9_1, HEAP32[$12_1 + 24 >> 2])) { break block427 } if ($915($8_1 + 712 | 0, HEAP32[$12_1 + 16 >> 2])) { break block427 } $7_1 = $12_1 + 32 | 0; while (1) { $15_1 = HEAP32[$7_1 >> 2]; if ($15_1) { if ($921($9_1, HEAP32[$15_1 >> 2])) { break block427 } if ($920($9_1, HEAP32[$15_1 + 4 >> 2])) { break block427 } if ($921($9_1, HEAP32[$15_1 + 8 >> 2])) { break block427 } $7_1 = $15_1 + 16 | 0; if (!$920($9_1, HEAP32[$15_1 + 12 >> 2])) { continue } break block427; } break; }; $6_1 = $12_1 + 40 | 0; continue; } break; }; $6_1 = 0; if ($920($9_1, HEAP32[$2_1 + 12 >> 2])) { break block427 } block432 : { if (HEAPU8[$5_1 + 224 | 0] >= 2) { HEAP32[$5_1 + 260 >> 2] = $2_1; $2_1 = 0; break block432; } if (HEAPU8[$10_1 + 177 | 0]) { break block432 } block433 : { if (!$916($10_1)) { break block433 } while (1) { $4_1 = HEAP32[$4_1 >> 2]; if (!$4_1) { break block433 } block435 : { $7_1 = HEAP32[$4_1 + 12 >> 2]; if ($7_1) { if ($922($10_1, $7_1)) { break block435 } } $4_1 = $4_1 + 40 | 0; continue; } break; }; $7_1 = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 244 >> 2] = HEAP32[$4_1 + 12 >> 2]; HEAP32[$8_1 + 240 >> 2] = $7_1; $257($5_1, 29670, $8_1 + 240 | 0); break block427; } $7_1 = $856($5_1); if (!$7_1) { break block427 } $923($5_1, 0, $11_1); $4_1 = $299($10_1, $16_1, $17_1, 0); $9_1 = HEAP32[HEAP32[$10_1 + 16 >> 2] + ($11_1 << 4) >> 2]; $12_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$8_1 + 236 >> 2] = $4_1; HEAP32[$8_1 + 232 >> 2] = $12_1; HEAP32[$8_1 + 228 >> 2] = $14; HEAP32[$8_1 + 224 >> 2] = $9_1; $884($5_1, 27525, $8_1 + 224 | 0); $10($10_1, $4_1); $924($5_1, $11_1); HEAP32[$8_1 + 208 >> 2] = $14; $925($7_1, $11_1, $310($10_1, 28345, $8_1 + 208 | 0), 0); } if (!HEAPU8[$10_1 + 177 | 0]) { break block427 } $4_1 = $395(HEAP32[(HEAP32[$10_1 + 16 >> 2] + ($11_1 << 4) | 0) + 12 >> 2] + 40 | 0, $14, $2_1); if ($4_1) { $106($10_1); $2_1 = $4_1; break block427; } $4_1 = HEAP32[$2_1 + 24 >> 2]; if (($4_1 | 0) == HEAP32[$2_1 + 20 >> 2]) { $4_1 = $320($4_1 + 8 | 0, HEAP32[$2_1 + 4 >> 2]); HEAP32[$2_1 + 32 >> 2] = HEAP32[$4_1 + 56 >> 2]; HEAP32[$4_1 + 56 >> 2] = $2_1; } $2_1 = 0; } $5($10_1, $2_1); $9($10_1, $6_1); break block262; } $926($5_1, $3 - 44 | 0, $3 - 32 | 0, $3 - 8 | 0, 1); break block262; } $926($5_1, $3 - 32 | 0, $3 - 20 | 0, $3 + 4 | 0, 1); break block262; } $926($5_1, $3 - 44 | 0, $3 - 32 | 0, $3 - 8 | 0, 0); break block262; } $926($5_1, $3 - 32 | 0, $3 - 20 | 0, $3 + 4 | 0, 0); break block262; } $926($5_1, $3 - 8 | 0, $3 + 4 | 0, 0, 0); break block262; } $927($5_1, $3 - 8 | 0, HEAP32[$3 + 4 >> 2]); break block262; } $927($5_1, 0, HEAP32[$3 + 4 >> 2]); break block262; } $6_1 = HEAP32[$3 + 4 >> 2]; $7_1 = HEAP32[$5_1 >> 2]; block438 : { if (HEAPU8[$7_1 + 87 | 0]) { break block438 } $4_1 = HEAP32[$3 - 8 >> 2]; if ($318($5_1)) { break block438 } $2_1 = $778($7_1, HEAP32[$6_1 + 8 >> 2], HEAP32[$6_1 + 52 >> 2]); if (!$2_1) { block441 : { if (!$4_1) { HEAP32[$8_1 + 160 >> 2] = $6_1 + 8; $257($5_1, 19364, $8_1 + 160 | 0); break block441; } $901($5_1, HEAP32[$6_1 + 52 >> 2]); $928($5_1); } HEAP8[$5_1 + 17 | 0] = 1; break block438; } if (HEAPU8[$2_1 + 55 | 0] & 3) { HEAP32[$8_1 + 192 >> 2] = 0; $257($5_1, 15912, $8_1 + 192 | 0); break block438; } $10_1 = HEAP32[$2_1 + 12 >> 2]; $4_1 = $309($7_1, HEAP32[$2_1 + 24 >> 2]); $9_1 = ($4_1 | 0) == 1; $11_1 = HEAP32[HEAP32[$7_1 + 16 >> 2] + ($4_1 << 4) >> 2]; if ($864($5_1, 9, $9_1 ? 9304 : 9323, 0, $11_1)) { break block438 } if ($864($5_1, $9_1 ? 12 : 10, HEAP32[$2_1 >> 2], HEAP32[$10_1 >> 2], $11_1)) { break block438 } $10_1 = $856($5_1); if (!$10_1) { break block438 } $923($5_1, 1, $4_1); $9_1 = HEAP32[HEAP32[$7_1 + 16 >> 2] + ($4_1 << 4) >> 2]; HEAP32[$8_1 + 180 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 176 >> 2] = $9_1; $884($5_1, 27858, $8_1 + 176 | 0); $929($5_1, $4_1, 1597, HEAP32[$2_1 >> 2]); $924($5_1, $4_1); $930($5_1, HEAP32[$2_1 + 44 >> 2], $4_1); $859($10_1, 152, $4_1, 0, 0, HEAP32[$2_1 >> 2], 0); } $794($7_1, $6_1); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $931($5_1, 0, $2_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $3 - 44 | 0; HEAP32[$2_1 >> 2] = $931($5_1, HEAP32[$2_1 >> 2], $3 - 20 | 0, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 + 4 >> 2] = 2; break block262; } $2_1 = $3 - 44 | 0; $933($5_1, $3 - 80 | 0, $3 - 68 | 0, $932($5_1, 0, $2_1, 0), HEAP32[$3 - 20 >> 2], HEAP32[$3 - 116 >> 2], $3 - 128 | 0, HEAP32[$3 + 4 >> 2], 0, HEAP32[$3 - 92 >> 2], 0); if (HEAPU8[$5_1 + 224 | 0] < 2) { break block262 } $4_1 = HEAP32[$5_1 + 256 >> 2]; if (!$4_1) { break block262 } $934($5_1, HEAP32[$4_1 >> 2], $2_1); break block262; } HEAP32[$3 - 20 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } HEAP32[$3 + 4 >> 2] = $935(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $936($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $3 - 32 | 0; $4_1 = $935(HEAP32[$5_1 >> 2], HEAP32[$3 - 20 >> 2]); HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 >> 2] = $936($5_1, $4_1, HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $3 - 44 | 0; $4_1 = $936($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 - 20 >> 2]); HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 >> 2] = $936($5_1, $4_1, HEAP32[$3 + 4 >> 2]); break block262; } $4_1 = $3 - 44 | 0; $6_1 = $903($5_1, 158, HEAP32[$3 - 32 >> 2], 0); HEAP32[$4_1 >> 2] = $6_1; if ($6_1) { $2_1 = HEAP32[$3 - 20 >> 2]; $7_1 = HEAP32[$3 - 8 >> 2]; if ($7_1) { $2_1 = $936($5_1, $2_1, $7_1); $6_1 = HEAP32[$4_1 >> 2]; } HEAP32[$6_1 + 20 >> 2] = $2_1; $937($5_1, HEAP32[$4_1 >> 2]); break block262; } $358(HEAP32[$5_1 >> 2], HEAP32[$3 - 20 >> 2]); $11(HEAP32[$5_1 >> 2], HEAP32[$3 - 8 >> 2]); break block262; } $2_1 = $903($5_1, 20, 0, 0); HEAP32[$3 - 32 >> 2] = $2_1; $938($5_1, $2_1, HEAP32[$3 - 8 >> 2]); break block262; } $2_1 = $932($5_1, 0, $3 - 20 | 0, $3 - 8 | 0); $4_1 = $939($5_1, 0, $2_1, 0, 0, 0, 0, 0, 0); $6_1 = HEAP32[$3 + 4 >> 2]; if ($6_1) { $940($5_1, $4_1 ? $2_1 : 0, $6_1) } $2_1 = $3 - 44 | 0; $6_1 = $903($5_1, 50, HEAP32[$2_1 >> 2], 0); HEAP32[$2_1 >> 2] = $6_1; $938($5_1, $6_1, $4_1); if (!HEAP32[$3 - 32 >> 2]) { break block262 } HEAP32[$2_1 >> 2] = $903($5_1, 19, HEAP32[$2_1 >> 2], 0); break block262; } $2_1 = $3 - 44 | 0; $4_1 = $903($5_1, 50, HEAP32[$2_1 >> 2], 0); HEAP32[$2_1 >> 2] = $4_1; $938($5_1, $4_1, HEAP32[$3 - 8 >> 2]); if (!HEAP32[$3 - 32 >> 2]) { break block262 } HEAP32[$2_1 >> 2] = $903($5_1, 19, HEAP32[$2_1 >> 2], 0); break block262; } $2_1 = $903($5_1, 139, 0, 0); HEAP32[$3 - 20 >> 2] = $2_1; $938($5_1, $2_1, HEAP32[$3 - 8 >> 2]); break block262; } $4_1 = $3 - 8 | 0; $2_1 = HEAP32[$4_1 >> 2]; if (!$2_1) { $2_1 = $3 - 44 | 0; $941($5_1, HEAP32[$2_1 >> 2]); $4_1 = $2_1; $2_1 = $942(HEAP32[$5_1 >> 2], 118, HEAP32[$3 - 32 >> 2] ? 13084 : 13617); HEAP32[$4_1 >> 2] = $2_1; if (!$2_1) { break block262 } $943($2_1); break block262; } block450 : { block447 : { if (HEAP32[$2_1 >> 2] != 1) { break block447 } block449 : { $6_1 = HEAP32[$2_1 + 8 >> 2]; if (!$944($5_1, $6_1)) { $2_1 = HEAP32[$4_1 >> 2]; break block449; } $2_1 = HEAP32[$4_1 >> 2]; $7_1 = $3 - 44 | 0; if (HEAPU8[HEAP32[$7_1 >> 2]] == 177) { break block449 } HEAP32[$2_1 + 8 >> 2] = 0; $358(HEAP32[$5_1 >> 2], HEAP32[$4_1 >> 2]); $2_1 = $903($5_1, 173, $6_1, 0); HEAP32[$7_1 >> 2] = $903($5_1, 54, HEAP32[$7_1 >> 2], $2_1); break block450; } if (HEAP32[$2_1 >> 2] != 1 | HEAPU8[$6_1 | 0] != 139) { break block447 } $7_1 = $3 - 44 | 0; $2_1 = $903($5_1, 50, HEAP32[$7_1 >> 2], 0); HEAP32[$7_1 >> 2] = $2_1; $938($5_1, $2_1, HEAP32[$6_1 + 20 >> 2]); HEAP32[$6_1 + 20 >> 2] = 0; $358(HEAP32[$5_1 >> 2], HEAP32[$4_1 >> 2]); break block450; } $7_1 = $3 - 44 | 0; $2_1 = $903($5_1, 50, HEAP32[$7_1 >> 2], 0); HEAP32[$7_1 >> 2] = $2_1; if (!$2_1) { $358(HEAP32[$5_1 >> 2], HEAP32[$4_1 >> 2]); break block450; } $6_1 = HEAP32[$2_1 + 12 >> 2]; if (HEAPU8[$6_1 | 0] == 177) { $10_1 = HEAP32[$4_1 >> 2]; $12_1 = $10_1 + 8 | 0; $11_1 = HEAP32[HEAP32[$6_1 + 20 >> 2] >> 2]; $2_1 = 0; $6_1 = 0; while (1) { block456 : { block457 : { if (($6_1 | 0) < HEAP32[$10_1 >> 2]) { $4_1 = 1; $9_1 = HEAP32[$12_1 + ($6_1 << 4) >> 2]; if (HEAPU8[$9_1 | 0] == 177) { $4_1 = HEAP32[HEAP32[$9_1 + 20 >> 2] >> 2] } if (($4_1 | 0) == ($11_1 | 0)) { $4_1 = $939($5_1, HEAP32[$9_1 + 20 >> 2], 0, 0, 0, 0, 0, 512, 0); HEAP32[$9_1 + 20 >> 2] = 0; if (!$4_1) { break block456 } if (!$2_1) { break block457 } HEAP32[$4_1 + 52 >> 2] = $2_1; HEAP8[$4_1 | 0] = 136; break block457; } HEAP32[$8_1 + 152 >> 2] = $11_1; HEAP32[$8_1 + 144 >> 2] = $4_1; HEAP32[$8_1 + 148 >> 2] = ($4_1 | 0) > 1 ? 8933 : 30822; $257($5_1, 17399, $8_1 + 144 | 0); } if ($2_1) { if (HEAP32[$2_1 + 52 >> 2]) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 1024 } $333(HEAP32[$5_1 >> 2], $10_1); $945($5_1, $2_1); $938($5_1, HEAP32[$7_1 >> 2], $2_1); break block450; } $333(HEAP32[$5_1 >> 2], $10_1); break block450; } $2_1 = $4_1; } $6_1 = $6_1 + 1 | 0; continue; }; } HEAP32[$2_1 + 20 >> 2] = HEAP32[$4_1 >> 2]; $937($5_1, HEAP32[$7_1 >> 2]); } if (!HEAP32[$3 - 32 >> 2]) { break block262 } $2_1 = $3 - 44 | 0; HEAP32[$2_1 >> 2] = $903($5_1, 19, HEAP32[$2_1 >> 2], 0); break block262; } $6_1 = $936($5_1, $935(HEAP32[$5_1 >> 2], HEAP32[$3 - 20 >> 2]), HEAP32[$3 + 4 >> 2]); $2_1 = $3 - 44 | 0; $4_1 = $903($5_1, 49, HEAP32[$2_1 >> 2], 0); HEAP32[$2_1 >> 2] = $4_1; block461 : { if ($4_1) { HEAP32[$4_1 + 20 >> 2] = $6_1; break block461; } $358(HEAP32[$5_1 >> 2], $6_1); } if (!HEAP32[$3 - 32 >> 2]) { break block262 } HEAP32[$2_1 >> 2] = $903($5_1, 19, HEAP32[$2_1 >> 2], 0); break block262; } HEAP32[$3 + 4 >> 2] = 0; break block262; } $2_1 = $3 - 20 | 0; $4_1 = $935(HEAP32[$5_1 >> 2], HEAP32[$2_1 >> 2]); HEAP32[$2_1 >> 2] = $946($5_1, $936($5_1, $4_1, HEAP32[$3 + 4 >> 2]), $3 - 8 | 0, 0); break block262; } $4_1 = HEAPU8[$3 - 10 | 0] + 66 | 0; $2_1 = HEAP32[$3 + 4 >> 2]; if (!(!$2_1 | HEAPU8[$2_1 | 0] != 173)) { HEAP8[$2_1 | 0] = $4_1; HEAP32[$3 - 8 >> 2] = $2_1; break block262; } HEAP32[$3 - 8 >> 2] = $903($5_1, $4_1 & 255, $2_1, 0); break block262; } HEAP32[$3 - 8 >> 2] = $903($5_1, HEAPU16[$3 - 10 >> 1], HEAP32[$3 + 4 >> 2], 0); break block262; } $4_1 = $3 - 44 | 0; $2_1 = $903($5_1, 46, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $947($5_1, HEAP32[$3 + 4 >> 2], $2_1, 52); break block262; } $4_1 = $3 - 56 | 0; $2_1 = $903($5_1, 45, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $947($5_1, HEAP32[$3 + 4 >> 2], $2_1, 51); break block262; } $4_1 = $3 - 32 | 0; $2_1 = $903($5_1, 46, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $947($5_1, HEAP32[$3 + 4 >> 2], $2_1, 52); break block262; } $4_1 = $3 - 20 | 0; $2_1 = $903($5_1, 45, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $947($5_1, HEAP32[$3 + 4 >> 2], $2_1, 51); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $903($5_1, 52, HEAP32[$2_1 >> 2], 0); break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = $903($5_1, HEAPU16[$3 + 2 >> 1], HEAP32[$2_1 >> 2], 0); break block262; } $4_1 = $3 - 28 | 0; $2_1 = HEAP32[$4_1 >> 2]; HEAP32[$4_1 >> 2] = $2_1 & 2147483647; $4_1 = $3 - 44 | 0; $6_1 = $946($5_1, $936($5_1, $936($5_1, $935(HEAP32[$5_1 >> 2], HEAP32[$3 - 20 >> 2]), HEAP32[$4_1 >> 2]), HEAP32[$3 + 4 >> 2]), $3 - 32 | 0, 0); HEAP32[$4_1 >> 2] = $6_1; if (($2_1 | 0) < 0) { $6_1 = $903($5_1, 19, $6_1, 0); HEAP32[$4_1 >> 2] = $6_1; } if (!$6_1) { break block262 } HEAP32[$6_1 + 4 >> 2] = HEAP32[$6_1 + 4 >> 2] | 256; break block262; } $4_1 = $3 - 4 | 0; $2_1 = HEAP32[$4_1 >> 2]; HEAP32[$4_1 >> 2] = $2_1 & 2147483647; $4_1 = $3 - 20 | 0; $6_1 = $946($5_1, $936($5_1, $935(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]), HEAP32[$4_1 >> 2]), $3 - 8 | 0, 0); HEAP32[$4_1 >> 2] = $6_1; if (($2_1 | 0) < 0) { $6_1 = $903($5_1, 19, $6_1, 0); HEAP32[$4_1 >> 2] = $6_1; } if (!$6_1) { break block262 } HEAP32[$6_1 + 4 >> 2] = HEAP32[$6_1 + 4 >> 2] | 256; break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; $4_1 = $3 - 8 | 0; HEAP32[$4_1 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = $2_1; HEAP32[$3 - 4 >> 2] = $2_1 | -2147483648; break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $903($5_1, HEAPU16[$3 - 10 >> 1], HEAP32[$2_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $948($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $936($5_1, HEAP32[$3 - 32 >> 2], HEAP32[$3 - 8 >> 2]); $6_1 = $3 - 44 | 0; $4_1 = $903($5_1, 177, 0, 0); HEAP32[$6_1 >> 2] = $4_1; if ($4_1) { HEAP32[$4_1 + 20 >> 2] = $2_1; if (!HEAP32[$2_1 >> 2]) { break block262 } $4_1 = HEAP32[$6_1 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | HEAP32[HEAP32[$2_1 + 8 >> 2] + 4 >> 2] & 4194824; break block262; } $358(HEAP32[$5_1 >> 2], $2_1); break block262; } HEAP32[$3 + 4 >> 2] = $946($5_1, 0, $3 + 4 | 0, 0); break block262; } $2_1 = $3 - 44 | 0; $4_1 = $946($5_1, 0, $2_1, 0); $949($5_1, $4_1, HEAP32[$3 + 4 >> 2]); HEAP32[$2_1 >> 2] = $4_1; break block262; } $4_1 = $3 - 92 | 0; $2_1 = $946($5_1, HEAP32[$3 - 56 >> 2], $4_1, HEAP32[$3 - 68 >> 2]); $949($5_1, $2_1, HEAP32[$3 + 4 >> 2]); $950($5_1, $2_1, HEAP32[$3 - 20 >> 2]); HEAP32[$4_1 >> 2] = $2_1; break block262; } $2_1 = $3 - 56 | 0; $4_1 = $946($5_1, HEAP32[$3 - 20 >> 2], $2_1, HEAP32[$3 - 32 >> 2]); $949($5_1, $4_1, HEAP32[$3 + 4 >> 2]); HEAP32[$2_1 >> 2] = $4_1; break block262; } $2_1 = $3 - 32 | 0; HEAP32[$2_1 >> 2] = $946($5_1, 0, $2_1, 0); break block262; } $2_1 = $3 - 80 | 0; $4_1 = $946($5_1, HEAP32[$3 - 44 >> 2], $2_1, HEAP32[$3 - 56 >> 2]); $950($5_1, $4_1, HEAP32[$3 - 8 >> 2]); HEAP32[$2_1 >> 2] = $4_1; break block262; } $2_1 = $3 - 44 | 0; HEAP32[$2_1 >> 2] = $946($5_1, HEAP32[$3 - 8 >> 2], $2_1, HEAP32[$3 - 20 >> 2]); break block262; } $2_1 = $951(HEAP32[$5_1 >> 2], 36, $3 - 8 | 0, 1); HEAP32[$3 - 56 >> 2] = $2_1; $952(HEAP32[$5_1 >> 2], $2_1, HEAP32[$3 - 32 >> 2], 0); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $953($5_1, HEAP32[$2_1 >> 2], $3 + 4 | 0, 1); break block262; } $2_1 = $3 + 4 | 0; block473 : { $4_1 = HEAP32[$3 + 4 >> 2]; if (!(HEAPU8[$4_1 | 0] == 35 & HEAPU8[$4_1 + 1 | 0] - 58 >>> 0 > 4294967285)) { $11_1 = HEAP32[$3 + 8 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$8_1 + 136 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 140 >> 2] = $4_1; $14 = $870($5_1, 157, $8_1 + 136 | 0); HEAP32[$3 + 4 >> 2] = $14; if (!$14) { break block262 } $16_1 = HEAP32[$5_1 >> 2]; $15_1 = HEAP32[$14 + 8 >> 2]; $2_1 = HEAP8[$15_1 + 1 | 0]; $4_1 = $2_1 >> 31; block469 : { if (!($2_1 | $4_1)) { $4_1 = HEAPU16[$5_1 + 220 >> 1] + 1 | 0; HEAP16[$5_1 + 220 >> 1] = $4_1; break block469; } block475 : { block474 : { if (HEAPU8[$15_1 | 0] == 63) { block472 : { if (($11_1 | 0) == 2) { $6_1 = 0; $4_1 = $4_1 - 1 | 0; $7_1 = $2_1 - 48 | 0; $2_1 = $7_1 >>> 0 < 4294967248 ? $4_1 + 1 | 0 : $4_1; break block472; } $6_1 = ($305($15_1 + 1 | 0, $8_1 + 712 | 0, $11_1 - 1 | 0, 1) | 0) != 0; $7_1 = HEAP32[$8_1 + 712 >> 2]; $2_1 = HEAP32[$8_1 + 716 >> 2]; } $4_1 = HEAP32[$16_1 + 156 >> 2]; if (!$7_1 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0 | $6_1) { break block473 } $6_1 = $4_1 >> 31; if ($4_1 >>> 0 < $7_1 >>> 0 & ($6_1 | 0) <= ($2_1 | 0) | ($2_1 | 0) > ($6_1 | 0)) { break block473 } $4_1 = $7_1 << 16 >> 16; if (($4_1 | 0) <= HEAP16[$5_1 + 220 >> 1]) { break block474 } HEAP16[$5_1 + 220 >> 1] = $4_1; $6_1 = HEAP32[$5_1 + 240 >> 2]; break block475; } $6_1 = HEAP32[$5_1 + 240 >> 2]; $4_1 = $291($6_1, $15_1, $11_1); if ($4_1 & 65535) { break block469 } $4_1 = HEAPU16[$5_1 + 220 >> 1] + 1 | 0; HEAP16[$5_1 + 220 >> 1] = $4_1; break block475; } $6_1 = HEAP32[$5_1 + 240 >> 2]; __inlined_func$288$304 : { if ($6_1) { $10_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = 2; while (1) { $7_1 = ($2_1 << 2) + $6_1 | 0; if (($4_1 | 0) == HEAP32[$7_1 >> 2]) { $2_1 = $7_1 + 8 | 0; break __inlined_func$288$304; } $2_1 = HEAP32[$7_1 + 4 >> 2] + $2_1 | 0; if (($2_1 | 0) < ($10_1 | 0)) { continue } break; }; } $2_1 = 0; } if ($2_1) { break block469 } } $12_1 = (($11_1 | 0) / 4 | 0) + 3 | 0; block481 : { block479 : { block477 : { if (!$6_1) { $7_1 = 10; $2_1 = 0; break block477; } $9_1 = HEAP32[$6_1 + 4 >> 2]; $10_1 = $12_1 + $9_1 | 0; $2_1 = HEAP32[$6_1 >> 2]; if (($10_1 | 0) <= ($2_1 | 0)) { $2_1 = $6_1; break block479; } $7_1 = $2_1 << 1; $2_1 = $2_1 >> 31 << 1 | $2_1 >>> 31; } $2_1 = $2_1 + ($12_1 >> 31) | 0; $7_1 = $7_1 + $12_1 | 0; $2_1 = $7_1 >>> 0 < $12_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $2_1 = $55($16_1, $6_1, $7_1 << 2, $2_1 << 2 | $7_1 >>> 30); if (!$2_1) { $2_1 = $6_1; break block481; } if ($6_1) { $9_1 = HEAP32[$2_1 + 4 >> 2] } else { HEAP32[$2_1 + 4 >> 2] = 2; $9_1 = 2; } HEAP32[$2_1 >> 2] = $7_1; $10_1 = $9_1 + $12_1 | 0; } $6_1 = ($9_1 << 2) + $2_1 | 0; HEAP32[$6_1 >> 2] = $4_1 << 16 >> 16; HEAP32[$6_1 + 4 >> 2] = $12_1; HEAP32[$2_1 + 4 >> 2] = $10_1; $6_1 = $6_1 + 8 | 0; if ($11_1) { wasm2js_memory_copy($6_1, $15_1, $11_1) } HEAP8[$6_1 + $11_1 | 0] = 0; } HEAP32[$5_1 + 240 >> 2] = $2_1; } HEAP16[$14 + 32 >> 1] = $4_1; if (HEAP32[$16_1 + 156 >> 2] >= $4_1 << 16 >> 16) { break block262 } $257($5_1, 5827, 0); $45(HEAP32[$5_1 >> 2], $14); break block262; } $4_1 = HEAP32[$2_1 + 4 >> 2]; $6_1 = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 712 >> 2] = $6_1; HEAP32[$8_1 + 716 >> 2] = $4_1; if (!HEAPU8[$5_1 + 18 | 0]) { $365($5_1, $8_1 + 712 | 0); HEAP32[$2_1 >> 2] = 0; break block262; } $4_1 = $2_1; $2_1 = $903($5_1, 176, 0, 0); HEAP32[$4_1 >> 2] = $2_1; if (!$2_1) { break block262 } $296($6_1 + 1 | 0, $2_1 + 28 | 0); break block262; } HEAP32[$8_1 + 128 >> 2] = $4_1; $257($5_1, 16755, $8_1 + 128 | 0); $45(HEAP32[$5_1 >> 2], $14); break block262; } $2_1 = $3 + 4 | 0; $4_1 = $951(HEAP32[$5_1 >> 2], 156, $2_1, 1); if ($4_1) { HEAP32[$4_1 + 36 >> 2] = HEAP32[$2_1 >> 2] - HEAP32[$5_1 + 248 >> 2] } HEAP32[$2_1 >> 2] = $4_1; break block262; } $2_1 = HEAPU16[$3 + 2 >> 1]; $4_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 120 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 124 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $870($5_1, $2_1, $8_1 + 120 | 0); break block262; } $2_1 = $3 - 44 | 0; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$8_1 + 112 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 116 >> 2] = $4_1; $4_1 = $870($5_1, 60, $8_1 + 112 | 0); $6_1 = $3 - 20 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$8_1 + 104 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$8_1 + 108 >> 2] = $7_1; $6_1 = $870($5_1, 60, $8_1 + 104 | 0); $7_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 96 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 100 >> 2] = $7_1; $6_1 = $903($5_1, 142, $6_1, $870($5_1, 60, $8_1 + 96 | 0)); if (HEAPU8[$5_1 + 224 | 0] >= 2) { $918($5_1, 0, $4_1) } HEAP32[$2_1 >> 2] = $903($5_1, 142, $4_1, $6_1); break block262; } $2_1 = $3 - 20 | 0; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$8_1 + 88 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 92 >> 2] = $4_1; $4_1 = $870($5_1, 60, $8_1 + 88 | 0); $6_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 80 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 84 >> 2] = $6_1; HEAP32[$2_1 >> 2] = $903($5_1, 142, $4_1, $870($5_1, 60, $8_1 + 80 | 0)); break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 72 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 76 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $870($5_1, 60, $8_1 + 72 | 0); break block262; } HEAP32[$3 - 20 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } HEAP32[$3 + 4 >> 2] = $954($5_1, 0, $3 + 4 | 0); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $954($5_1, HEAP32[$2_1 >> 2], $3 + 4 | 0); break block262; } HEAP32[$3 - 20 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } $955($5_1, HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 80 >> 2] = $956(HEAP32[$5_1 >> 2], 0, 0, HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2], 0); break block262; } HEAP32[$3 - 44 >> 2] = $956(HEAP32[$5_1 >> 2], 0, 0, 0, 0, 0); break block262; } HEAP32[$3 - 92 >> 2] = $956(HEAP32[$5_1 >> 2], HEAP32[$3 - 56 >> 2], HEAP32[$3 - 32 >> 2], 0, 0, HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 128 >> 2] = $956(HEAP32[$5_1 >> 2], HEAP32[$3 - 92 >> 2], HEAP32[$3 - 68 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 8 >> 2] = 0; $955($5_1, HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } $957($5_1, HEAP32[$3 - 44 >> 2], 0, HEAP32[$3 - 32 >> 2], HEAP32[$3 - 68 >> 2], 0); break block262; } $957($5_1, HEAP32[$3 - 32 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 56 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 44 >> 2] = $958($5_1, 0, HEAP32[$3 - 32 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = $935(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]); $4_1 = $3 - 20 | 0; $959($5_1, $2_1, $4_1, 1); HEAP32[$4_1 >> 2] = $2_1; break block262; } $2_1 = $3 - 68 | 0; HEAP32[$2_1 >> 2] = $958($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $4_1 = $3 - 44 | 0; $2_1 = $936($5_1, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $959($5_1, $2_1, $3 - 20 | 0, 1); break block262; } $2_1 = $3 - 56 | 0; $960($5_1, HEAP32[$2_1 >> 2], $3 - 44 | 0); $4_1 = $3 - 20 | 0; $961($5_1, HEAP32[$4_1 >> 2], 2451); $6_1 = HEAP32[$3 - 8 >> 2]; block489 : { if (!$6_1) { $6_1 = HEAP32[$2_1 >> 2]; break block489; } if (HEAP32[$6_1 >> 2] >= 2) { $6_1 = $939($5_1, 0, $6_1, 0, 0, 0, 0, 2048, 0); HEAP32[$8_1 + 712 >> 2] = 0; HEAP32[$8_1 + 716 >> 2] = 0; $6_1 = $962($5_1, 0, 0, 0, $8_1 + 712 | 0, $6_1, 0); } $6_1 = $963($5_1, HEAP32[$2_1 >> 2], $6_1); HEAP32[$2_1 >> 2] = $6_1; } $964($5_1, $6_1, HEAP32[$4_1 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$3 - 68 >> 2], 0); break block262; } $955($5_1, HEAP32[$3 + 4 >> 2]); HEAP32[$3 - 32 >> 2] = HEAP32[$3 - 20 >> 2]; break block262; } $955($5_1, HEAP32[$3 + 4 >> 2]); HEAP32[$3 - 8 >> 2] = 0; break block262; } $2_1 = $3 - 20 | 0; $960($5_1, HEAP32[$2_1 >> 2], $3 - 8 | 0); $965($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 32 >> 2] = $903($5_1, 149, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2]); break block262; } HEAP32[$3 - 32 >> 2] = $903($5_1, 149, HEAP32[$3 - 20 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 8 >> 2] = $903($5_1, 149, HEAP32[$3 + 4 >> 2], 0); break block262; } HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 - 8 >> 2] = 1; break block262; } HEAP32[$3 - 8 >> 2] = 0; break block262; } HEAP32[$3 + 16 >> 2] = -1; break block262; } HEAP32[$3 + 4 >> 2] = 1; break block262; } HEAP32[$3 + 4 >> 2] = 0; break block262; } $4_1 = $3 - 20 | 0; $2_1 = $935(HEAP32[$5_1 >> 2], HEAP32[$4_1 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $966($2_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $4_1 = $3 - 44 | 0; $2_1 = $936($5_1, HEAP32[$4_1 >> 2], HEAP32[$3 - 20 >> 2]); HEAP32[$4_1 >> 2] = $2_1; $966($2_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 20 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 1; break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; $4_1 = $3 - 20 | 0; HEAP32[$4_1 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = $2_1; break block262; } HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; break block262; } HEAP32[$3 - 32 >> 2] = 0; HEAP32[$3 - 28 >> 2] = HEAP32[$3 - 8 >> 2]; break block262; } HEAP32[$3 - 4 >> 2] = 0; HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } $2_1 = $3 - 32 | 0; HEAP32[$2_1 >> 2] = $967($5_1, $2_1, $3 - 20 | 0, $3 - 8 | 0); break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $967($5_1, $2_1, $3 - 8 | 0, 0); break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = $967($5_1, $2_1, 0, 0); break block262; } HEAP32[$3 + 4 >> 2] = 1; break block262; } $2_1 = $3 - 20 | 0; $4_1 = $932($5_1, 0, $2_1, 0); HEAP32[$2_1 >> 2] = $4_1; if (!$4_1) { break block262 } $4_1 = $875(HEAP32[$5_1 >> 2], $3 + 4 | 0); HEAP32[HEAP32[$2_1 >> 2] + 12 >> 2] = $4_1; break block262; } $2_1 = $3 - 44 | 0; $4_1 = $932($5_1, 0, $2_1, $3 - 20 | 0); HEAP32[$2_1 >> 2] = $4_1; if (!$4_1) { break block262 } $4_1 = $875(HEAP32[$5_1 >> 2], $3 + 4 | 0); HEAP32[HEAP32[$2_1 >> 2] + 12 >> 2] = $4_1; break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = $932($5_1, 0, $2_1, $3 + 4 | 0); break block262; } HEAP32[$3 + 4 >> 2] = $932($5_1, 0, $3 + 4 | 0, 0); break block262; } $4_1 = $3 - 20 | 0; $6_1 = $3 + 4 | 0; $2_1 = $932($5_1, 0, $4_1, $6_1); if (!(!$2_1 | HEAPU8[$5_1 + 224 | 0] < 2)) { $934($5_1, HEAP32[$2_1 + 8 >> 2], $6_1) } HEAP32[$4_1 >> 2] = $2_1; break block262; } $2_1 = $3 + 4 | 0; $4_1 = $932($5_1, 0, $2_1, 0); if (!(!$4_1 | HEAPU8[$5_1 + 224 | 0] < 2)) { $934($5_1, HEAP32[$4_1 + 8 >> 2], $2_1) } HEAP32[$2_1 >> 2] = $4_1; break block262; } HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; break block262; } $2_1 = $3 - 56 | 0; $7_1 = HEAP32[$2_1 >> 2]; if (!($7_1 | HEAP32[$3 - 4 >> 2] | (HEAP32[$3 + 4 >> 2] | HEAP32[$3 + 8 >> 2]))) { HEAP32[$2_1 >> 2] = HEAP32[$3 - 32 >> 2]; break block262; } $6_1 = $3 - 32 | 0; $4_1 = HEAP32[$6_1 >> 2]; if (!(!$4_1 | HEAP32[$4_1 >> 2] != 1)) { $4_1 = $2_1; $2_1 = $962($5_1, $7_1, 0, 0, $3 - 8 | 0, 0, $3 + 4 | 0); HEAP32[$4_1 >> 2] = $2_1; if ($2_1) { $4_1 = ($2_1 + Math_imul(HEAP32[$2_1 >> 2], 48) | 0) - 40 | 0; $2_1 = HEAP32[$6_1 >> 2]; HEAP32[$4_1 >> 2] = HEAP32[$2_1 + 8 >> 2]; block497 : { if (HEAPU8[$2_1 + 21 | 0] & 4) { $7_1 = HEAPU8[$4_1 + 13 | 0] | HEAPU8[$4_1 + 14 | 0] << 8 | 4; HEAP8[$4_1 + 13 | 0] = $7_1; HEAP8[$4_1 + 14 | 0] = $7_1 >>> 8; HEAP32[$4_1 + 44 >> 2] = HEAP32[$2_1 + 52 >> 2]; HEAP32[$2_1 + 52 >> 2] = 0; $7_1 = (HEAPU8[$2_1 + 21 | 0] | HEAPU8[$2_1 + 22 | 0] << 8) & 65531; HEAP8[$2_1 + 21 | 0] = $7_1; HEAP8[$2_1 + 22 | 0] = $7_1 >>> 8; if (!(HEAPU8[HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2] + 5 | 0] & 8)) { break block497 } $7_1 = HEAPU8[$4_1 + 13 | 0] | HEAPU8[$4_1 + 14 | 0] << 8 | 16384; HEAP8[$4_1 + 13 | 0] = $7_1; HEAP8[$4_1 + 14 | 0] = $7_1 >>> 8; break block497; } HEAP32[$4_1 + 44 >> 2] = HEAP32[$2_1 + 52 >> 2]; HEAP32[$2_1 + 52 >> 2] = 0; } if (HEAPU8[$2_1 + 21 | 0] & 8) { HEAP32[$4_1 + 32 >> 2] = HEAP32[$2_1 + 40 >> 2]; HEAP32[$2_1 + 40 >> 2] = 0; $7_1 = (HEAPU8[$2_1 + 21 | 0] | HEAPU8[$2_1 + 22 | 0] << 8) & 65527; HEAP8[$2_1 + 21 | 0] = $7_1; HEAP8[$2_1 + 22 | 0] = $7_1 >>> 8; $7_1 = HEAPU8[$4_1 + 13 | 0] | HEAPU8[$4_1 + 14 | 0] << 8 | 8; HEAP8[$4_1 + 13 | 0] = $7_1; HEAP8[$4_1 + 14 | 0] = $7_1 >>> 8; } HEAP32[$2_1 + 8 >> 2] = 0; } $794(HEAP32[$5_1 >> 2], HEAP32[$6_1 >> 2]); break block262; } $968($4_1); $4_1 = $939($5_1, 0, HEAP32[$6_1 >> 2], 0, 0, 0, 0, 2048, 0); HEAP32[$2_1 >> 2] = $962($5_1, HEAP32[$2_1 >> 2], 0, 0, $3 - 8 | 0, $4_1, $3 + 4 | 0); break block262; } $2_1 = $3 - 56 | 0; HEAP32[$2_1 >> 2] = $962($5_1, HEAP32[$2_1 >> 2], 0, 0, $3 - 8 | 0, HEAP32[$3 - 32 >> 2], $3 + 4 | 0); break block262; } $4_1 = $3 - 80 | 0; $2_1 = $962($5_1, HEAP32[$4_1 >> 2], $3 - 68 | 0, $3 - 56 | 0, $3 - 8 | 0, 0, $3 + 4 | 0); HEAP32[$4_1 >> 2] = $2_1; $940($5_1, $2_1, HEAP32[$3 - 32 >> 2]); break block262; } $4_1 = $3 - 56 | 0; $2_1 = $962($5_1, HEAP32[$4_1 >> 2], $3 - 44 | 0, $3 - 32 | 0, $3 - 20 | 0, 0, $3 + 4 | 0); HEAP32[$4_1 >> 2] = $2_1; $960($5_1, $2_1, $3 - 8 | 0); break block262; } $2_1 = $3 - 44 | 0; HEAP32[$2_1 >> 2] = $962($5_1, HEAP32[$2_1 >> 2], $3 - 32 | 0, $3 - 20 | 0, $3 - 8 | 0, 0, $3 + 4 | 0); break block262; } $2_1 = HEAP32[$3 - 8 >> 2]; if (!$2_1) { break block262 } $4_1 = HEAP32[$2_1 >> 2]; if (($4_1 | 0) <= 0) { break block262 } HEAP8[($2_1 + Math_imul($4_1, 48) | 0) - 28 | 0] = HEAP32[$3 + 4 >> 2]; break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$3 - 8 >> 2] = $2_1; $968($2_1); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; $4_1 = $3 - 8 | 0; HEAP32[$4_1 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$4_1 + 4 >> 2] = $2_1; break block262; } $2_1 = $903($5_1, 180, 0, 0); if (!(!$2_1 | HEAPU8[$2_1 + 4 | 0] & 3)) { HEAP32[$2_1 + 36 >> 2] = HEAP32[$3 + 4 >> 2] - HEAP32[$5_1 + 248 >> 2] } $4_1 = $3 - 20 | 0; $6_1 = HEAP32[$4_1 + 4 >> 2]; HEAP32[$8_1 + 64 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$8_1 + 68 >> 2] = $6_1; $2_1 = $903($5_1, 142, $870($5_1, 60, $8_1 - -64 | 0), $2_1); $4_1 = $3 - 44 | 0; HEAP32[$4_1 >> 2] = $936($5_1, HEAP32[$4_1 >> 2], $2_1); break block262; } $2_1 = $942(HEAP32[$5_1 >> 2], 180, 0); if (!(!$2_1 | HEAPU8[$2_1 + 4 | 0] & 3)) { HEAP32[$2_1 + 36 >> 2] = HEAP32[$3 + 4 >> 2] - HEAP32[$5_1 + 248 >> 2] } $4_1 = $3 - 20 | 0; HEAP32[$4_1 >> 2] = $936($5_1, HEAP32[$4_1 >> 2], $2_1); break block262; } $2_1 = $3 - 44 | 0; $6_1 = $936($5_1, HEAP32[$2_1 >> 2], HEAP32[$3 - 20 >> 2]); HEAP32[$2_1 >> 2] = $6_1; if (HEAP32[$3 + 8 >> 2]) { $959($5_1, $6_1, $3 + 4 | 0, 1); $6_1 = HEAP32[$2_1 >> 2]; } if (!$6_1) { break block262 } $2_1 = (HEAP32[$6_1 >> 2] << 4) + $6_1 | 0; if (HEAP32[$2_1 - 4 >> 2]) { break block262 } $2_1 = $2_1 - 8 | 0; HEAP32[$2_1 + 4 >> 2] = $969(HEAP32[$5_1 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 - 8 >> 2]); $4_1 = (HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8) & 65532 | 1; HEAP8[$2_1 + 9 | 0] = $4_1; HEAP8[$2_1 + 10 | 0] = $4_1 >>> 8; break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 + 4 >> 2] = 2; break block262; } HEAP32[$3 + 4 >> 2] = 1; break block262; } $10_1 = HEAP32[$3 - 8 >> 2]; $12_1 = $3 - 44 | 0; $4_1 = HEAP32[$12_1 >> 2]; block509 : { block504 : { block502 : { if (HEAPU8[$5_1 + 27 | 0] | HEAPU8[HEAP32[$5_1 >> 2] + 177 | 0]) { break block502 } if (!$970($5_1, $10_1)) { break block502 } block503 : { if (HEAP32[HEAP32[$4_1 + 32 >> 2] >> 2]) { break block503 } $6_1 = HEAP32[$4_1 + 28 >> 2]; if (!$970($5_1, $6_1)) { break block502 } $7_1 = $6_1 + 8 | 0; $2_1 = 0; while (1) { if (HEAP32[$6_1 >> 2] <= ($2_1 | 0)) { break block503 } $9_1 = $2_1 << 4; $2_1 = $2_1 + 1 | 0; if (!$971(HEAP32[$7_1 + $9_1 >> 2])) { continue } break; }; break block502; } if (!HEAPU8[$5_1 + 224 | 0]) { break block504 } } block506 : { if (HEAP32[HEAP32[$4_1 + 32 >> 2] >> 2]) { $972($5_1, $4_1); $2_1 = 512; break block506; } $2_1 = 1536; if (!HEAP32[$4_1 + 52 >> 2]) { break block506 } $2_1 = HEAP32[$4_1 + 4 >> 2] & 1536; } $2_1 = $939($5_1, $10_1, 0, 0, 0, 0, 0, $2_1, 0); HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] & -1025; if (!$2_1) { $2_1 = $4_1; break block509; } HEAP32[$2_1 + 52 >> 2] = $4_1; HEAP8[$2_1 | 0] = 136; break block509; } $2_1 = HEAP32[$4_1 + 32 >> 2]; block514 : { block512 : { if (!HEAP32[$2_1 >> 2]) { $7_1 = 0; $9_1 = $856($5_1); $2_1 = $939($5_1, 0, 0, 0, 0, 0, 0, 0, 0); if (!(HEAPU8[HEAP32[$5_1 >> 2] + 24 | 0] & 16)) { $318($5_1) } if (!$2_1) { break block512 } $6_1 = HEAP32[$2_1 + 32 >> 2]; HEAP32[$6_1 >> 2] = 1; $7_1 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$2_1 + 52 >> 2] = $7_1; HEAP8[$2_1 | 0] = HEAPU8[$4_1 | 0]; if ($7_1) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 512 } HEAP8[$4_1 | 0] = 139; HEAP32[$4_1 + 52 >> 2] = 0; HEAP32[$6_1 + 40 >> 2] = 2; HEAP32[$6_1 + 24 >> 2] = -1; $7_1 = HEAPU8[$6_1 + 21 | 0] | HEAPU8[$6_1 + 22 | 0] << 8 | 64; HEAP8[$6_1 + 21 | 0] = $7_1; HEAP8[$6_1 + 22 | 0] = $7_1 >>> 8; $7_1 = $6_1 + 8 | 0; if (!$973($5_1, $7_1, $4_1, 0)) { break block514 } $6_1 = HEAP32[$6_1 + 52 >> 2]; $14 = HEAP32[$9_1 + 108 >> 2] + 1 | 0; HEAP32[$6_1 + 4 >> 2] = $14; $11_1 = HEAP32[$5_1 + 48 >> 2] + 1 | 0; HEAP32[$5_1 + 48 >> 2] = $11_1; HEAP32[$6_1 + 8 >> 2] = $11_1; $835($9_1, 11, $11_1, 0, $14); $11_1 = HEAP32[$6_1 + 8 >> 2]; $9_1 = $8_1 + 728 | 0; HEAP32[$9_1 >> 2] = 0; HEAP32[$9_1 + 4 >> 2] = 0; HEAP32[$8_1 + 720 >> 2] = 0; HEAP32[$8_1 + 724 >> 2] = 0; HEAP32[$8_1 + 716 >> 2] = $11_1; HEAP8[$8_1 + 712 | 0] = 13; $11_1 = HEAP32[$5_1 + 48 >> 2]; HEAP32[$8_1 + 724 >> 2] = $11_1 + 3; $19_1 = $9_1; $9_1 = HEAP32[HEAP32[$4_1 + 28 >> 2] >> 2]; HEAP32[$19_1 >> 2] = $9_1; HEAP32[$5_1 + 48 >> 2] = ($9_1 + $11_1 | 0) + 2; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 1024; $974($5_1, $4_1, $8_1 + 712 | 0); HEAP32[$6_1 + 12 >> 2] = HEAP32[$8_1 + 724 >> 2]; break block514; } HEAP32[$2_1 + 40 >> 2] = HEAP32[$2_1 + 40 >> 2] + 1; $7_1 = $2_1 + 8 | 0; } $2_1 = $4_1; } block515 : { if (HEAP32[$5_1 + 40 >> 2]) { break block515 } $4_1 = HEAP32[$7_1 + 44 >> 2]; $6_1 = HEAP32[$4_1 >> 2]; if (HEAP32[HEAP32[$6_1 + 28 >> 2] >> 2] != HEAP32[$10_1 >> 2]) { $975($5_1, $6_1); break block515; } $976($5_1, $10_1, HEAP32[$4_1 + 12 >> 2], 0, 0); $858(HEAP32[$5_1 + 8 >> 2], 12, HEAP32[$4_1 + 8 >> 2]); } $358(HEAP32[$5_1 >> 2], $10_1); } HEAP32[$12_1 >> 2] = $2_1; break block262; } $972($5_1, HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 32 >> 2] = $939($5_1, HEAP32[$3 - 8 >> 2], 0, 0, 0, 0, 0, 512, 0); break block262; } $2_1 = $939($5_1, HEAP32[$3 - 80 >> 2], HEAP32[$3 - 68 >> 2], HEAP32[$3 - 56 >> 2], HEAP32[$3 - 44 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 - 92 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$3 - 104 >> 2] = $2_1; if ($2_1) { HEAP32[$2_1 + 72 >> 2] = HEAP32[$3 - 20 >> 2]; break block262; } $796(HEAP32[$5_1 >> 2], HEAP32[$3 - 20 >> 2]); break block262; } HEAP32[$3 - 92 >> 2] = $939($5_1, HEAP32[$3 - 68 >> 2], HEAP32[$3 - 56 >> 2], HEAP32[$3 - 44 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2], HEAP32[$3 - 80 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } HEAP32[$3 - 8 >> 2] = 136; break block262; } HEAP32[$3 + 4 >> 2] = HEAPU16[$3 + 2 >> 1]; break block262; } $4_1 = $3 - 20 | 0; $2_1 = HEAP32[$4_1 >> 2]; block521 : { block518 : { $6_1 = HEAP32[$3 + 4 >> 2]; if (!$6_1) { break block518 } if (HEAP32[$6_1 + 52 >> 2]) { HEAP32[$8_1 + 716 >> 2] = 0; $945($5_1, $6_1); $6_1 = $939($5_1, 0, $962($5_1, 0, 0, 0, $8_1 + 712 | 0, $6_1, 0), 0, 0, 0, 0, 0, 0); if (!$6_1) { break block518 } } $7_1 = $3 - 8 | 0; $10_1 = HEAP32[$7_1 >> 2]; HEAP32[$6_1 + 52 >> 2] = $2_1; HEAP8[$6_1 | 0] = $10_1; if ($2_1) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] & -1025 } HEAP32[$6_1 + 4 >> 2] = HEAP32[$6_1 + 4 >> 2] & -1025; if (HEAP32[$7_1 >> 2] == 136) { break block521 } HEAP8[$5_1 + 22 | 0] = 1; break block521; } $789(HEAP32[$5_1 >> 2], $2_1); $6_1 = 0; } HEAP32[$4_1 >> 2] = $6_1; break block262; } $2_1 = HEAP32[$3 + 4 >> 2]; if (!$2_1) { break block262 } $945($5_1, $2_1); break block262; } HEAP32[$3 - 32 >> 2] = $977($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 8 >> 2]); break block262; } HEAP32[$3 - 20 >> 2] = $977($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 8 >> 2]); break block262; } HEAP32[$8_1 + 736 >> 2] = HEAP32[12434]; $2_1 = HEAP32[12433]; $4_1 = $8_1 + 728 | 0; HEAP32[$4_1 >> 2] = HEAP32[12432]; HEAP32[$4_1 + 4 >> 2] = $2_1; $2_1 = HEAP32[12431]; $4_1 = $8_1 + 720 | 0; HEAP32[$4_1 >> 2] = HEAP32[12430]; HEAP32[$4_1 + 4 >> 2] = $2_1; $2_1 = HEAP32[12429]; HEAP32[$8_1 + 712 >> 2] = HEAP32[12428]; HEAP32[$8_1 + 716 >> 2] = $2_1; block52381 : { if (!(HEAPU8[HEAP32[$5_1 >> 2] + 24 | 0] & 64)) { if ($318($5_1)) { break block52381 } } $974($5_1, HEAP32[$3 + 4 >> 2], $8_1 + 712 | 0); } $789(HEAP32[$5_1 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $978($5_1, HEAP32[$3 + 4 >> 2], 1, HEAP32[$3 - 8 >> 2]); break block262; } $2_1 = HEAP32[$3 - 56 >> 2]; $7_1 = HEAP32[$3 - 80 >> 2]; $10_1 = HEAP32[$3 - 20 >> 2]; $4_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 700 >> 2] = 0; $6_1 = HEAP32[$5_1 >> 2]; block525 : { if (HEAP16[$5_1 + 220 >> 1] > 0) { $257($5_1, 3687, 0); break block525; } $9_1 = $3 - 44 | 0; $11_1 = $3 - 32 | 0; $866($5_1, $9_1, $11_1, $7_1, 1, 0, $2_1); $2_1 = HEAP32[$5_1 + 252 >> 2]; if (HEAP32[$5_1 + 40 >> 2] | !$2_1) { break block525 } HEAP32[$2_1 + 28 >> 2] = HEAP32[$2_1 + 28 >> 2] | 512; $910($5_1, $9_1, $11_1, $8_1 + 700 | 0); $7_1 = $309($6_1, HEAP32[$2_1 + 60 >> 2]); $9_1 = HEAP32[$5_1 >> 2]; HEAP32[$8_1 + 712 >> 2] = $5_1; $9_1 = HEAP32[$9_1 + 16 >> 2] + ($7_1 << 4) | 0; HEAP32[$8_1 + 752 >> 2] = HEAP32[$9_1 >> 2]; HEAP32[$8_1 + 744 >> 2] = HEAP32[$9_1 + 12 >> 2]; HEAP32[$8_1 + 716 >> 2] = $5_1; HEAP32[$8_1 + 720 >> 2] = 11; HEAP32[$8_1 + 724 >> 2] = 12; HEAP32[$8_1 + 728 >> 2] = 13; HEAP32[$8_1 + 732 >> 2] = 0; HEAP16[$8_1 + 736 >> 1] = 0; HEAP8[$8_1 + 748 | 0] = ($7_1 | 0) == 1; HEAP32[$8_1 + 756 >> 2] = 1856; HEAP32[$8_1 + 760 >> 2] = HEAP32[$8_1 + 700 >> 2]; $7_1 = $8_1 + 712 | 0; HEAP32[$8_1 + 740 >> 2] = $7_1; if ($919($7_1 + 4 | 0, $4_1)) { break block525 } HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 2097152; block527 : { if (HEAPU8[$5_1 + 224 | 0] > 1) { $7_1 = $4_1; $4_1 = 0; break block527; } $7_1 = $907($6_1, $4_1, 1); } HEAP32[$2_1 + 44 >> 2] = $7_1; $7_1 = $887($6_1, $10_1, 1); HEAP8[$2_1 + 43 | 0] = 2; HEAP32[$2_1 + 16 >> 2] = $7_1; if (HEAPU8[$6_1 + 87 | 0]) { break block525 } $2_1 = HEAP32[$5_1 + 212 >> 2]; $7_1 = HEAP32[$3 - 92 >> 2]; $2_1 = (HEAPU8[$2_1 | 0] == 59 ? $2_1 : HEAP32[$5_1 + 216 >> 2] + $2_1 | 0) - $7_1 | 0; $9_1 = $7_1 - 1 | 0; while (1) { $7_1 = $2_1 + $9_1 | 0; $2_1 = $2_1 - 1 | 0; if (HEAP8[HEAPU8[$7_1 | 0] + 31424 | 0] & 1) { continue } break; }; HEAP32[$8_1 + 708 >> 2] = 1; HEAP32[$8_1 + 704 >> 2] = $7_1; $868($5_1, 0, $8_1 + 704 | 0, 0, 0); } $789($6_1, $4_1); if (HEAPU8[$5_1 + 224 | 0] >= 2) { $979($5_1, $10_1) } $358($6_1, $10_1); break block262; } $978($5_1, HEAP32[$3 + 4 >> 2], 0, HEAP32[$3 - 8 >> 2]); break block262; } HEAP32[$3 + 4 >> 2] = 5; break block262; } HEAP32[$3 + 4 >> 2] = 4; break block262; } HEAP32[$3 - 20 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 + 16 >> 2] = 11; break block262; } $980($5_1, HEAP32[$3 - 68 >> 2], $3 - 32 | 0, HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2]); $981($5_1, HEAP32[$3 + 4 >> 2]); break block262; } $982($5_1, HEAP32[$3 - 20 >> 2], HEAP32[$3 - 32 >> 2], HEAP32[$3 - 8 >> 2]); break block262; } $933($5_1, 0, 0, 0, HEAP32[$3 - 20 >> 2], HEAP32[$3 + 4 >> 2], 0, 0, 0, 0, 1); break block262; } $983($5_1, HEAP32[$3 - 32 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2], 0); break block262; } HEAP32[$5_1 + 88 >> 2] = 0; break block262; } HEAP32[$3 - 8 >> 2] = 0; break block262; } HEAP32[$3 - 8 >> 2] = 1; break block262; } HEAP32[$3 - 8 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } HEAP32[$3 - 20 >> 2] = 0; break block262; } HEAP32[$3 - 8 >> 2] = 0; break block262; } HEAP32[$3 + 4 >> 2] = 7; break block262; } HEAP32[$3 + 4 >> 2] = 10; break block262; } HEAP32[$3 - 8 >> 2] = 9; break block262; } HEAP32[$3 - 8 >> 2] = 8; break block262; } HEAP32[$3 - 16 >> 2] = 65280; HEAP32[$3 - 20 >> 2] = HEAP32[$3 + 4 >> 2] << 8; break block262; } HEAP32[$3 - 16 >> 2] = 255; HEAP32[$3 - 20 >> 2] = HEAP32[$3 + 4 >> 2]; break block262; } $2_1 = $3 - 20 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; break block262; } $2_1 = $3 - 8 | 0; HEAP32[$2_1 >> 2] = HEAP32[$3 + 4 >> 2] | HEAP32[$2_1 >> 2] & (HEAP32[$3 + 8 >> 2] ^ -1); break block262; } HEAP32[$3 + 16 >> 2] = 0; break block262; } HEAP32[$3 + 4 >> 2] = 1; break block262; } $984($5_1, HEAP32[$3 - 20 >> 2], $3 + 4 | 0); break block262; } $984($5_1, HEAP32[$3 - 8 >> 2], 0); break block262; } $2_1 = HEAP32[$5_1 + 252 >> 2]; if (!$2_1 | HEAPU8[$5_1 + 224 | 0] > 1) { break block262 } $6_1 = HEAP16[$2_1 + 34 >> 1]; $7_1 = HEAP32[$5_1 >> 2]; $4_1 = $875($7_1, $3 + 4 | 0); if (!$4_1) { break block262 } block529 : { if (!$985($5_1, $4_1)) { break block529 } $10_1 = $6_1 - 1 | 0; $9_1 = Math_imul($10_1, 12); $986($7_1, $9_1 + HEAP32[$2_1 + 4 >> 2] | 0, $4_1); $6_1 = $2_1 + 8 | 0; while (1) { $6_1 = HEAP32[$6_1 >> 2]; if (!$6_1) { break block529 } if (HEAP16[HEAP32[$6_1 + 4 >> 2] >> 1] == ($10_1 | 0)) { HEAP32[HEAP32[$6_1 + 32 >> 2] >> 2] = $419($9_1 + HEAP32[$2_1 + 4 >> 2] | 0) } $6_1 = $6_1 + 20 | 0; continue; }; } $13($7_1, $4_1); break block262; } $981($5_1, HEAP32[$3 + 4 >> 2]); break block262; } $980($5_1, 0, $3 - 20 | 0, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $982($5_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 + 4 >> 2]); break block262; } $933($5_1, 0, 0, 0, 0, HEAP32[$3 + 4 >> 2], 0, 0, 0, 0, 1); break block262; } $983($5_1, 0, HEAP32[$3 - 8 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2]); break block262; } $2_1 = HEAP32[$5_1 + 252 >> 2]; if (!$2_1) { break block262 } $4_1 = HEAP16[$2_1 + 34 >> 1]; if (($4_1 | 0) <= 0) { break block262 } $4_1 = HEAP32[$2_1 + 4 >> 2] + Math_imul($4_1, 12) | 0; $6_1 = $4_1 - 8 | 0; HEAP8[$6_1 | 0] = HEAPU8[$6_1 | 0] & 240 | HEAP32[$3 + 4 >> 2] & 15; HEAP32[$2_1 + 28 >> 2] = HEAP32[$2_1 + 28 >> 2] | 2048; if (!(HEAPU8[$4_1 - 2 | 0] & 8)) { break block262 } $6_1 = $2_1 + 8 | 0; while (1) { $4_1 = HEAP32[$6_1 >> 2]; if (!$4_1) { break block262 } if (HEAP16[HEAP32[$4_1 + 4 >> 2] >> 1] == (HEAP16[$2_1 + 34 >> 1] - 1 | 0)) { $6_1 = HEAPU8[$4_1 + 55 | 0] | HEAPU8[$4_1 + 56 | 0] << 8 | 8; HEAP8[$4_1 + 55 | 0] = $6_1; HEAP8[$4_1 + 56 | 0] = $6_1 >>> 8; } $6_1 = $4_1 + 20 | 0; continue; }; } $2_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$8_1 + 56 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$8_1 + 60 >> 2] = $2_1; $2_1 = $870($5_1, 118, $8_1 + 56 | 0); if ($2_1) { $943($2_1) } $4_1 = $2_1; $2_1 = HEAP32[$3 + 4 >> 2]; $987($5_1, $4_1, $2_1, $2_1 + HEAP32[$3 + 8 >> 2] | 0); break block262; } $987($5_1, $903($5_1, 174, HEAP32[$3 + 4 >> 2], 0), HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2] + HEAP32[$3 - 4 >> 2] | 0); break block262; } $987($5_1, HEAP32[$3 + 4 >> 2], HEAP32[$3 - 20 >> 2], HEAP32[$3 - 8 >> 2] + HEAP32[$3 - 4 >> 2] | 0); break block262; } $987($5_1, HEAP32[$3 - 8 >> 2], HEAP32[$3 - 20 >> 2] + 1 | 0, HEAP32[$3 + 4 >> 2]); break block262; } $2_1 = HEAP32[$3 - 8 >> 2]; $987($5_1, HEAP32[$3 + 4 >> 2], $2_1, $2_1 + HEAP32[$3 - 4 >> 2] | 0); break block262; } $2_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$5_1 + 84 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$5_1 + 88 >> 2] = $2_1; break block262; } $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$3 + 20 >> 2] = $4_1; break block262; } HEAP32[$3 + 16 >> 2] = HEAP32[$2_1 >> 2]; break block262; } HEAP32[$3 - 4 >> 2] = (HEAP32[$3 + 8 >> 2] + HEAP32[$3 + 4 >> 2] | 0) - HEAP32[$3 - 8 >> 2]; break block262; } HEAP32[$3 - 52 >> 2] = (HEAP32[$3 + 4 >> 2] + HEAP32[$3 + 8 >> 2] | 0) - HEAP32[$3 - 56 >> 2]; break block262; } HEAP32[$3 - 28 >> 2] = (HEAP32[$3 + 4 >> 2] + HEAP32[$3 + 8 >> 2] | 0) - HEAP32[$3 - 32 >> 2]; break block262; } HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; break block262; } $2_1 = 0; } $4_1 = ($2_1 | 0) != 0; $6_1 = $4_1; $4_1 = $2_1 + $4_1 | 0; $6_1 = $6_1 >>> 0 > $4_1 >>> 0; $12_1 = HEAP32[$8_1 + 708 >> 2]; $4_1 = $4_1 + $12_1 | 0; $6_1 = $12_1 >>> 0 > $4_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $4_1 = $4_1 + 1 | 0; $6_1 = $4_1 ? $6_1 : $6_1 + 1 | 0; $4_1 = $51($14, $4_1, $6_1); if (!$4_1) { break block262 } if (HEAPU8[$5_1 + 224 | 0] >= 2) { $934($5_1, $4_1, $8_1 + 704 | 0) } if ($12_1) { wasm2js_memory_copy($4_1, HEAP32[$8_1 + 704 >> 2], $12_1) } $6_1 = 0; HEAP8[$4_1 + $12_1 | 0] = 0; $300($4_1); $16_1 = $886($4_1); $12_1 = HEAP16[$7_1 + 34 >> 1]; $19_1 = ($12_1 | 0) > 0 ? $12_1 : 0; $17_1 = HEAP32[$7_1 + 4 >> 2]; $20_1 = $12_1 >> 31; block538 : { block537 : { while (1) { if (($6_1 | 0) != ($19_1 | 0)) { block536 : { $22_1 = $17_1 + Math_imul($6_1, 12) | 0; if (($16_1 | 0) != HEAPU8[$22_1 + 7 | 0]) { break block536 } if ($67($4_1, HEAP32[$22_1 >> 2])) { break block536 } HEAP32[$8_1 + 32 >> 2] = $4_1; $257($5_1, 8350, $8_1 + 32 | 0); break block537; } $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = __wasm_i64_mul($12_1, $20_1, 12, 0); $12_1 = i64toi32_i32$HIGH_BITS; $6_1 = $6_1 + 12 | 0; $12_1 = $6_1 >>> 0 < 12 ? $12_1 + 1 | 0 : $12_1; $6_1 = $55($14, $17_1, $6_1, $12_1); if ($6_1) { break block538 } } $13($14, $4_1); break block262; } HEAP32[$7_1 + 4 >> 2] = $6_1; $6_1 = $6_1 + Math_imul(HEAP16[$7_1 + 34 >> 1], 12) | 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 >> 2] = $4_1; HEAP8[$6_1 + 7 | 0] = $16_1; block540 : { if (!$2_1) { HEAP8[$6_1 + 6 | 0] = $11_1; HEAP8[$6_1 + 4 | 0] = $15_1; break block540; } $4_1 = ($48($4_1) + $4_1 | 0) + 1 | 0; if ($2_1) { wasm2js_memory_copy($4_1, $9_1, $2_1) } HEAP8[$2_1 + $4_1 | 0] = 0; $300($4_1); $10_1 = $853($4_1, $6_1); HEAP16[$6_1 + 10 >> 1] = HEAPU16[$6_1 + 10 >> 1] | 4; } HEAP8[$6_1 + 5 | 0] = $10_1; HEAP16[$7_1 + 34 >> 1] = HEAPU16[$7_1 + 34 >> 1] + 1; HEAP16[$7_1 + 36 >> 1] = HEAPU16[$7_1 + 36 >> 1] + 1; HEAP32[$5_1 + 88 >> 2] = 0; } $2_1 = $3 + Math_imul(HEAP8[$31_1 + 37744 | 0], 12) | 0; $4_1 = HEAPU16[$2_1 >> 1]; $6_1 = $2_1 + 12 | 0; HEAP32[$32_1 >> 2] = $6_1; $7_1 = $2_1 + 14 | 0; $2_1 = HEAPU16[($31_1 << 1) + 49744 >> 1]; HEAP16[$7_1 >> 1] = $2_1; $4_1 = HEAPU16[($2_1 + HEAP16[($4_1 << 1) + 51872 >> 1] << 1) + 44128 >> 1]; HEAP16[$6_1 >> 1] = $4_1; $2_1 = $8_1 + 768 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; continue; } break; }; if ($6_1 >>> 0 <= 1253) { $2_1 = HEAP32[$13_1 + 36 >> 2] + 12 | 0; HEAP32[$13_1 + 36 >> 2] = $2_1; block2382 : { if (HEAPU32[$13_1 + 44 >> 2] >= $2_1 >>> 0) { break block2382 } $7_1 = $13_1 + 36 | 0; $3 = $362($7_1); $2_1 = HEAP32[$13_1 + 36 >> 2]; if (!$3) { break block2382 } HEAP32[$13_1 + 36 >> 2] = $2_1 - 12; $363($7_1); break block21; } HEAP32[$2_1 + 4 >> 2] = $25; HEAP32[$2_1 + 8 >> 2] = $30_1; HEAP16[$2_1 + 2 >> 1] = $18_1; HEAP16[$2_1 >> 1] = $6_1 >>> 0 > 582 ? $4_1 + 412 | 0 : $4_1; break block21; } if (($6_1 | 0) == 1255) { HEAP32[$13_1 + 36 >> 2] = HEAP32[$13_1 + 36 >> 2] - 12; break block21; } HEAP32[$13_1 + 1264 >> 2] = $25; HEAP32[$13_1 + 1268 >> 2] = $30_1; HEAP32[$13_1 + 1272 >> 2] = $25; HEAP32[$13_1 + 1276 >> 2] = $30_1; $2_1 = HEAP32[$13_1 + 40 >> 2]; block2683 : { if (HEAPU8[$25 | 0]) { $365($2_1, $13_1 + 1272 | 0); break block2683; } $257($2_1, 2242, 0); } HEAP32[$13_1 + 40 >> 2] = $2_1; $366($13_1 + 36 | 0, $18_1 & 65535, $13_1 + 1264 | 0); } $1_1 = $1_1 + $24_1 | 0; if (!HEAP32[$0_1 + 12 >> 2]) { continue label2 } } $4_1 = HEAP32[$13_1 + 36 >> 2]; while (1) { $2_1 = HEAP32[$13_1 + 48 >> 2]; if ($4_1 >>> 0 > $2_1 >>> 0) { $2_1 = HEAPU16[$4_1 + 2 >> 1]; if ($2_1 >>> 0 >= 206) { $366($13_1 + 36 | 0, $2_1, $4_1 + 4 | 0) } $4_1 = $4_1 - 12 | 0; continue; } break; }; if (($2_1 | 0) != ($29_1 | 0)) { $24($2_1) } if (HEAPU8[$21_1 + 87 | 0]) { HEAP32[$0_1 + 12 >> 2] = 7 } $2_1 = HEAP32[$0_1 + 4 >> 2]; block3285 : { if (!$2_1) { $4_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; if (!$2_1 | ($2_1 | 0) == 101) { break block3285 } HEAP32[$13_1 + 16 >> 2] = $256($2_1); $2_1 = $310($21_1, 8932, $13_1 + 16 | 0); HEAP32[$0_1 + 4 >> 2] = $2_1; } $4_1 = 1; if (HEAPU8[$0_1 + 25 | 0] & 16) { break block3285 } $6_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$13_1 + 4 >> 2] = HEAP32[$0_1 + 248 >> 2]; HEAP32[$13_1 >> 2] = $2_1; $64($6_1, 29659, $13_1); } HEAP32[$0_1 + 248 >> 2] = $1_1; $24(HEAP32[$0_1 + 276 >> 2]); $1_1 = HEAP32[$0_1 + 252 >> 2]; if (!(HEAPU8[$0_1 + 224 | 0] | !$1_1)) { $6($21_1, $1_1) } $1_1 = HEAP32[$0_1 + 260 >> 2]; if (!(!$1_1 | HEAPU8[$0_1 + 224 | 0] > 1)) { $5($21_1, $1_1) } $0_1 = HEAP32[$0_1 + 240 >> 2]; if ($0_1) { $16($21_1, $0_1) } HEAP32[$21_1 + 264 >> 2] = $33_1; $0_1 = $13_1 + 1280 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } $1_1 = $1_1 + $24_1 | 0; continue; }; }; } function $358($0_1, $1_1) { if ($1_1) { $333($0_1, $1_1) } } function $359($0_1) { $0_1 = $0_1 + 8 | 0; while (1) { $0_1 = HEAP32[$0_1 >> 2]; if (!(!$0_1 | ((HEAPU8[$0_1 + 55 | 0] | HEAPU8[$0_1 + 56 | 0] << 8) & 3) == 2)) { $0_1 = $0_1 + 20 | 0; continue; } break; }; return $0_1; } function $360($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = HEAPU8[$0_1 | 0]; $4_1 = ((Math_imul(HEAPU8[HEAPU8[($0_1 + $1_1 | 0) - 1 | 0] + 31040 | 0], 3) ^ HEAPU8[$3 + 31040 | 0] << 2 ^ $1_1) % 127 | 0) + 36656 | 0; $6_1 = ($1_1 | 0) <= 2 ? 2 : $1_1; $7_1 = $3 & 223; block : { while (1) { $3 = HEAPU8[$4_1 | 0]; if (!$3) { break block } block2 : { block1 : { if (HEAPU8[$3 + 32656 | 0] != ($1_1 | 0)) { break block1 } $5_1 = HEAPU16[($3 << 1) + 32352 >> 1] + 31680 | 0; if (HEAPU8[$5_1 | 0] != ($7_1 | 0)) { break block1 } $4_1 = 2; if (HEAPU8[$5_1 + 1 | 0] != (HEAPU8[$0_1 + 1 | 0] & 223)) { break block1 } while (1) { if (($4_1 | 0) == ($6_1 | 0)) { break block2 } $8_1 = $0_1 + $4_1 | 0; $9_1 = $4_1 + $5_1 | 0; $4_1 = $4_1 + 1 | 0; if (HEAPU8[$9_1 | 0] == (HEAPU8[$8_1 | 0] & 223)) { continue } break; }; } $4_1 = $3 + 36944 | 0; continue; } break; }; HEAP32[$2_1 >> 2] = HEAPU8[$3 + 36784 | 0]; } return $1_1; } function $361($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $3 = HEAP32[$0_1 >> 2]; $4_1 = 60; while (1) { $3 = $295($3, $1_1 + 12 | 0) + $3 | 0; $2_1 = HEAP32[$1_1 + 12 >> 2]; if (($2_1 | 0) == 184) { continue } break; }; if (!($2_1 - 118 >>> 0 < 2 | $2_1 - 165 >>> 0 < 2 | ($2_1 | 0) == 60)) { $4_1 = HEAPU16[($2_1 << 1) + 37360 >> 1] == 60 ? 60 : $2_1 } HEAP32[$0_1 >> 2] = $3; $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $362($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2] - $3 | 0; $4_1 = ($2_1 | 0) / 12 | 0; $1_1 = Math_imul($4_1, 24) + 1224 | 0; block1 : { block2 : { if (($3 | 0) == ($0_1 + 16 | 0)) { $1_1 = $855(0, $1_1); if (!$1_1) { break block1 } $2_1 = $2_1 + 12 | 0; if (!$2_1) { break block2 } wasm2js_memory_copy($1_1, HEAP32[$0_1 + 12 >> 2], $2_1); break block2; } $1_1 = $855($3, $1_1); if (!$1_1) { break block1 } } HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[$0_1 >> 2] = ($5_1 - $3 | 0) + $1_1; HEAP32[$0_1 + 8 >> 2] = (Math_imul($4_1, 24) + $1_1 | 0) + 1212; return 0; } return 1; } function $363($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; while (1) { $1_1 = HEAP32[$0_1 >> 2]; if (!($1_1 >>> 0 <= HEAPU32[$0_1 + 12 >> 2])) { HEAP32[$0_1 >> 2] = $1_1 - 12; $366($0_1, HEAPU16[$1_1 + 2 >> 1], $1_1 + 4 | 0); continue; } break; }; $106(HEAP32[$2_1 >> 2]); HEAP32[$0_1 + 4 >> 2] = $2_1; } function $365($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 >> 2] = $1_1; $257($0_1, 9096, $2_1); $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $366($0_1, $1_1, $2_1) { $0_1 = HEAP32[$0_1 + 4 >> 2]; block1 : { switch ($1_1 - 206 | 0) { case 0: case 35: case 36: case 48: case 50: $789(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 12: case 13: case 42: case 44: case 64: case 75: case 77: case 80: case 87: case 92: case 109: $11(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 17: case 27: case 28: case 40: case 43: case 45: case 49: case 51: case 58: case 65: case 74: case 76: case 108: $358(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 34: case 41: case 53: case 54: case 59: $794(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 37: $795(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 47: case 104: $796(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 60: case 67: $12(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 70: case 105: case 106: case 107: case 110: $792(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 83: case 88: $9(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2]); return; case 85: $12(HEAP32[$0_1 >> 2], HEAP32[$2_1 + 4 >> 2]); return; case 112: case 113: case 114: $11(HEAP32[$0_1 >> 2], HEAP32[$2_1 + 4 >> 2]); break; default: break block1; }; } } function $367($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $0_1; $0_1 = HEAP32[$0_1 + 404 >> 2]; block8 : { block1 : { if (!$0_1) { $0_1 = $1(157855); break block1; } HEAP32[$3 + 12 >> 2] = $2_1; block6 : { switch ($1_1 - 1 | 0) { case 0: $1_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$3 + 12 >> 2] = $1_1 + 4; HEAP8[HEAP32[$0_1 >> 2] + 16 | 0] = HEAP32[$1_1 >> 2]; break block8; case 1: HEAP8[HEAP32[$0_1 >> 2] + 18 | 0] = 0; break block8; case 2: HEAP8[HEAP32[$0_1 >> 2] + 18 | 0] = 2; break block8; case 3: HEAP8[HEAP32[$0_1 >> 2] + 17 | 0] = 1; break block8; default: break block6; }; } $0_1 = $1(157877); } $122($4_1, $0_1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $368($0_1, $1_1) { var $2_1 = 0; while (1) { if (!$0_1) { return 0 } $2_1 = HEAP32[$0_1 + 12 >> 2]; if (($1_1 | 0) < ($2_1 | 0)) { $0_1 = HEAP32[$0_1 + 24 >> 2] + Math_imul($1_1, 48) | 0 } else { $1_1 = $1_1 - $2_1 | 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; continue; } break; }; return $0_1; } function $369($0_1, $1_1) { var $2_1 = 0; $2_1 = $0_1; $0_1 = HEAP32[$1_1 + 4 >> 2] & 1024; return $370($2_1, HEAP32[($0_1 ? 16 : 12) + $1_1 >> 2], HEAP32[($0_1 ? 12 : 16) + $1_1 >> 2]); } function $370($0_1, $1_1, $2_1) { block3 : { block1 : { if (HEAPU8[$1_1 + 5 | 0] & 2) { $2_1 = $1_1; break block1; } if (!(HEAPU8[$2_1 + 5 | 0] & 2 ? !$2_1 : 1)) { break block1 } $1_1 = $851($0_1, $1_1); if ($1_1) { break block3 } } $1_1 = $851($0_1, $2_1); } return $1_1; } function $371($0_1, $1_1, $2_1, $3, $4_1) { if (!$1_1) { return 0 } return $372($0_1, $1_1, $2_1, $3, $4_1); } function $372($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $7_1 = global$0 - 32 | 0; $6_1 = $7_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$7_1 + 28 >> 2] = 0; block1 : { while (1) { block2 : { block : { block3 : { $6_1 = HEAPU8[$1_1 | 0]; switch ($6_1 - 173 | 0) { case 0: break block; case 1: case 2: break block1; case 3: break block2; default: break block3; }; } if (($6_1 | 0) != 181) { break block1 } } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; } break; }; $6_1 = HEAPU8[$1_1 + 2 | 0]; } block7 : { block20 : { block16 : { block13 : { block15 : { block11 : { block14 : { block9 : { block6 : { if (($6_1 | 0) != 174) { if (($6_1 | 0) != 36) { $10_1 = 30822; $8_1 = 1; break block6; } $6_1 = $853(HEAP32[$1_1 + 8 >> 2], 0) & 255; $9_1 = $372($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $6_1, $4_1); $0_1 = HEAP32[$4_1 >> 2]; if (!$0_1) { break block7 } $676($0_1, $6_1, $2_1); $674(HEAP32[$4_1 >> 2], $3 << 24 >> 24, $2_1); break block7; } block8 : { $1_1 = HEAP32[$1_1 + 12 >> 2]; $6_1 = HEAPU8[$1_1 | 0]; switch ($6_1 - 154 | 0) { case 0: case 2: break block8; default: break block9; }; } $10_1 = 25085; $8_1 = -1; $11_1 = -1; if (HEAPU8[$1_1 + 5 | 0] & 8) { break block6 } $5_1 = HEAP32[$1_1 + 8 >> 2]; if (HEAPU8[$5_1 | 0] != 48) { break block6 } if ((HEAPU8[$5_1 + 1 | 0] & 223) == 88) { break block9 } } block10 : { block12 : { switch ($6_1 - 154 | 0) { case 0: case 2: break block10; case 1: break block11; default: break block12; }; } $5_1 = 0; switch ($6_1 - 118 | 0) { case 0: break block10; case 1: case 2: case 3: break block13; case 4: break block14; default: break block15; }; } $5_1 = $134($0_1); if (!$5_1) { break block16 } block18 : { if (HEAPU8[$1_1 + 5 | 0] & 8) { $0_1 = HEAP32[$1_1 + 8 >> 2]; $110($5_1, __wasm_i64_mul($8_1, $11_1, $0_1, $0_1 >> 31), i64toi32_i32$HIGH_BITS); break block18; } block19 : { if (($6_1 | 0) != 156) { break block19 } if ($438(HEAP32[$1_1 + 8 >> 2], $7_1 + 16 | 0)) { break block19 } $110($5_1, __wasm_i64_mul(HEAP32[$7_1 + 16 >> 2], HEAP32[$7_1 + 20 >> 2], $8_1, $11_1), i64toi32_i32$HIGH_BITS); break block18; } HEAP32[$7_1 + 4 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$7_1 >> 2] = $10_1; $1_1 = $310($0_1, 6118, $7_1); if (!$1_1) { break block20 } $137($5_1, $1_1, 5); } block23 : { if (($3 | 0) == 65) { if (($6_1 | 0) == 154) { $303(HEAP32[$5_1 + 8 >> 2], $5_1, HEAP32[$5_1 + 12 >> 2], 1); HEAP16[$5_1 + 16 >> 1] = 8; break block23; } if (($6_1 | 0) != 156) { break block23 } $674($5_1, 67, 1); break block23; } $674($5_1, $3 << 24 >> 24, 1); } $0_1 = HEAPU16[$5_1 + 16 >> 1]; if ($0_1 & 44) { HEAP16[$5_1 + 16 >> 1] = $0_1 & 65533 } if (($2_1 | 0) == 1) { break block13 } $9_1 = $228($5_1, $2_1); break block13; } $0_1 = $372($0_1, $1_1, $2_1, $3, $7_1 + 28 | 0); $5_1 = HEAP32[$7_1 + 28 >> 2]; if ($0_1 | !$5_1) { break block13 } $745($5_1); $1_1 = HEAPU16[$5_1 + 16 >> 1]; block26 : { if ($1_1 & 8) { HEAPF64[$5_1 >> 3] = -HEAPF64[$5_1 >> 3]; break block26; } $0_1 = HEAP32[$5_1 >> 2]; $6_1 = HEAP32[$5_1 + 4 >> 2]; if (!(($0_1 | 0) != 0 | ($6_1 | 0) != -2147483648)) { HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 1138753536; HEAP16[$5_1 + 16 >> 1] = $1_1 & 62016 | 8; break block26; } HEAP32[$5_1 >> 2] = 0 - $0_1; HEAP32[$5_1 + 4 >> 2] = 0 - ($6_1 + (($0_1 | 0) != 0) | 0); } $674($5_1, $3 << 24 >> 24, $2_1); break block13; } $5_1 = $134($0_1); if (!$5_1) { break block16 } $112($5_1); break block13; } $5_1 = $134($0_1); if (!$5_1) { break block16 } $1_1 = HEAP32[$1_1 + 8 >> 2] + 2 | 0; $2_1 = $48($1_1) - 1 | 0; $3 = ($2_1 | 0) / 2 | 0; $111($5_1, $854($0_1, $1_1, $2_1), $3, 0, 0, 5); break block13; } if (($6_1 | 0) != 171) { break block13 } $5_1 = $134($0_1); if (!$5_1) { $5_1 = 0; break block13; } HEAP16[$5_1 + 16 >> 1] = 4; HEAP32[$5_1 >> 2] = !HEAPU8[HEAP32[$1_1 + 8 >> 2] + 4 | 0]; HEAP32[$5_1 + 4 >> 2] = 0; $674($5_1, $3 << 24 >> 24, $2_1); } HEAP32[$4_1 >> 2] = $5_1; break block7; } $5_1 = 0; } $106($0_1); $10($0_1, 0); $200($5_1); $9_1 = 7; } $0_1 = $7_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1; } function $374($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block2 : { block : { if (!HEAP32[18938]) { break block } if ($0_1 >>> 0 <= 63) { if ((($0_1 & 63) >>> 0 < 32 ? 1 << $0_1 : 0) & 16842752) { break block } } $1(181973); break block2; } HEAP32[$2_1 + 12 >> 2] = $1_1; block5 : { switch ($0_1 - 4 | 0) { case 0: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; $0_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[18894] = HEAP32[$0_1 >> 2]; HEAP32[18895] = $1_1; $1_1 = $0_1 + 24 | 0; $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[18900] = HEAP32[$1_1 >> 2]; HEAP32[18901] = $3; $1_1 = $0_1 + 16 | 0; $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[18898] = HEAP32[$1_1 >> 2]; HEAP32[18899] = $3; $0_1 = $0_1 + 8 | 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[18896] = HEAP32[$0_1 >> 2]; HEAP32[18897] = $1_1; break block2; case 1: if (!HEAP32[18894]) { $20() } $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; $1_1 = HEAP32[18895]; $0_1 = HEAP32[$0_1 >> 2]; HEAP32[$0_1 >> 2] = HEAP32[18894]; HEAP32[$0_1 + 4 >> 2] = $1_1; $1_1 = HEAP32[18901]; $3 = $0_1 + 24 | 0; HEAP32[$3 >> 2] = HEAP32[18900]; HEAP32[$3 + 4 >> 2] = $1_1; $1_1 = HEAP32[18899]; $3 = $0_1 + 16 | 0; HEAP32[$3 >> 2] = HEAP32[18898]; HEAP32[$3 + 4 >> 2] = $1_1; $1_1 = HEAP32[18897]; $0_1 = $0_1 + 8 | 0; HEAP32[$0_1 >> 2] = HEAP32[18896]; HEAP32[$0_1 + 4 >> 2] = $1_1; break block2; case 5: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[18886] = HEAP32[$0_1 >> 2]; break block2; case 23: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP8[75552] = HEAP32[$0_1 >> 2]; break block2; case 3: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[18932] = HEAP32[$0_1 >> 2]; HEAP32[18933] = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 12; HEAP32[18934] = HEAP32[$0_1 + 8 >> 2]; break block2; case 20: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[HEAP32[$0_1 >> 2] >> 2] = 168; break block2; case 14: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; wasm2js_memory_copy(75644, HEAP32[$0_1 >> 2], 52); break block2; case 15: if (!HEAP32[18913]) { $22() } $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; wasm2js_memory_copy(HEAP32[$0_1 >> 2], 75644, 52); break block2; case 9: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[18891] = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 8; HEAP32[18892] = HEAP32[$0_1 + 4 >> 2]; break block2; case 12: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; $1_1 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 8; HEAP32[18946] = HEAP32[$0_1 + 4 >> 2]; HEAP32[18945] = $1_1; break block2; case 13: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP8[75550] = HEAP32[$0_1 >> 2]; break block2; case 16: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP8[75551] = HEAP32[$0_1 >> 2]; break block2; case 18: HEAP32[18928] = 0; HEAP32[18929] = 0; HEAP32[18930] = 0; HEAP32[18931] = 0; HEAP32[$2_1 + 12 >> 2] = (HEAP32[$2_1 + 12 >> 2] + 7 & -8) + 16; break block2; case 21: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[18937] = HEAP32[$0_1 >> 2]; break block2; case 22: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[18893] = HEAP32[$0_1 >> 2]; break block2; case 25: $0_1 = HEAP32[$2_1 + 12 >> 2] + 7 & -8; HEAP32[$2_1 + 12 >> 2] = $0_1 + 8; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[18948] = HEAP32[$0_1 >> 2]; HEAP32[18949] = $1_1; break block2; case 26: $0_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$2_1 + 12 >> 2] = $0_1 + 4; HEAP32[HEAP32[$0_1 >> 2] >> 2] = 0; break; case 10: break block2; default: break block5; }; } } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $376($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; block : { if (HEAP32[$0_1 + 44 >> 2]) { break block } $3 = HEAPU8[$0_1 + 21 | 0]; if (!($3 & 3 | HEAPU8[$1_1 + 28 | 0] & 8 ? !$3 : 1)) { break block } HEAP32[$0_1 + 212 >> 2] = HEAP32[$0_1 + 212 >> 2] + 1; HEAP32[$1_1 + 16 >> 2] = 0; block3 : { block4 : { if (HEAP32[$0_1 + 232 >> 2]) { $2_1 = $161($1_1); if ($2_1) { break block3 } $2_1 = $167($0_1, $1_1, 0, 0); break block4; } if (!(!(HEAPU8[$1_1 + 28 | 0] & 8) & HEAPU8[$0_1 + 17 | 0] != 3)) { $2_1 = $172($0_1, 1); if ($2_1) { break block3 } } $2_1 = $173($0_1, $1_1); } if ($2_1) { break block3 } $536($1_1); $2_1 = 0; } $2_1 = $176($0_1, $2_1); } return $2_1 | 0; } function $379($0_1) { $0_1 = $0_1 | 0; return HEAP32[$0_1 + 104 >> 2]; } function $381($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if ($0_1) { if (!$347($0_1)) { return $1(182778) } if (HEAPU8[$0_1 + 94 | 0] & 8) { FUNCTION_TABLE[HEAP32[$0_1 + 212 >> 2]](8, HEAP32[$0_1 + 216 >> 2], $0_1, 0) | 0 } $4($0_1); while (1) { if (!(HEAP32[$0_1 + 20 >> 2] <= ($3 | 0))) { block4 : { $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($3 << 4) | 0) + 12 >> 2]; if (!$2_1) { break block4 } $2_1 = $2_1 + 16 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block4 } $4_1 = HEAP32[$2_1 + 8 >> 2]; if (HEAPU8[$4_1 + 43 | 0] != 1) { continue } $382($0_1, $4_1); continue; }; } $3 = $3 + 1 | 0; continue; } break; }; $2_1 = $0_1 + 396 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $3 = HEAP32[HEAP32[$2_1 + 8 >> 2] + 20 >> 2]; if (!$3) { continue } $382($0_1, $3); continue; } break; }; $159($0_1); $383($0_1); block6 : { if ($1_1) { break block6 } if (!$192($0_1)) { break block6 } $131($0_1, 5, 4793, 0); return 5; } while (1) { $1_1 = HEAP32[$0_1 + 532 >> 2]; if ($1_1) { HEAP32[$0_1 + 532 >> 2] = HEAP32[$1_1 >> 2]; $2_1 = HEAP32[$1_1 + 8 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0](HEAP32[$1_1 + 4 >> 2]) } $24($1_1); continue; } break; }; HEAP8[$0_1 + 97 | 0] = 167; $130($0_1); } return 0; } function $382($0_1, $1_1) { var $2_1 = 0, $3 = 0; $1_1 = $1_1 + 52 | 0; block : { while (1) { $3 = $1_1; $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block } $1_1 = $2_1 + 24 | 0; if (HEAP32[$2_1 >> 2] != ($0_1 | 0)) { continue } break; }; HEAP32[$3 >> 2] = HEAP32[$2_1 + 24 >> 2]; $646($2_1); } } function $383($0_1) { $664($0_1, 68); } function $384($0_1) { $0_1 = $0_1 | 0; return $381($0_1, 1) | 0; } function $385($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 + 500 >> 2]; block1 : { if (($1_1 | 0) <= 11) { $2_1 = HEAPU8[$1_1 + 53840 | 0]; $1_1 = HEAPU8[$1_1 + 53828 | 0]; break block1; } $2_1 = Math_imul($1_1, 100) - 872 | 0; $1_1 = 100; } block2 : { if (($1_1 + $2_1 | 0) <= ($3 | 0)) { break block2 } $1_1 = $3 - $2_1 | 0; if (($1_1 | 0) > 0) { break block2 } return 0; } $0_1 = HEAP32[$0_1 >> 2]; FUNCTION_TABLE[HEAP32[$0_1 + 60 >> 2]]($0_1, Math_imul($1_1, 1e3)) | 0; return 1; } function $386($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { return $387($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, 0); } function $387($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0; block3 : { if ($8_1) { $9_1 = $30(12, 0); if (!$9_1) { $106($0_1); FUNCTION_TABLE[$8_1 | 0]($4_1); $1_1 = 1; break block3; } HEAP32[$9_1 + 8 >> 2] = $4_1; HEAP32[$9_1 + 4 >> 2] = $8_1; HEAP32[$9_1 >> 2] = 0; } $1_1 = $388($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, 0, 0, $9_1); if (HEAP32[$9_1 >> 2] | !$9_1) { break block3 } FUNCTION_TABLE[$8_1 | 0]($4_1); $24($9_1); } return $114($0_1, $1_1); } function $388($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1) { var $11_1 = 0, $12_1 = 0, $13_1 = 0; block2 : { block : { if (!$1_1 | !($7_1 ? !$5_1 : 1)) { break block } if ((!$7_1 | 0) == (($6_1 | 0) != 0 | 0) | $2_1 - 1001 >>> 0 < 4294966294 | !$8_1 ^ !$9_1) { break block } if ($48($1_1) >>> 0 < 256) { break block2 } } return $1(183429); } $12_1 = $3 & 54003712; block7 : { block3 : { block6 : { block5 : { block4 : { $3 = $3 & 7; switch ($3 - 1 | 0) { case 0: case 1: case 2: break block3; case 3: break block4; case 4: break block5; default: break block6; }; } $3 = 2; break block3; } $11_1 = $388($0_1, $1_1, $2_1, $12_1 | 1, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1); if ($11_1) { break block7 } $11_1 = $388($0_1, $1_1, $2_1, $12_1 | 2, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1); if ($11_1) { break block7 } $3 = 3; break block3; } $3 = 1; } $11_1 = 0; $13_1 = $390($0_1, $1_1, $2_1, $3, 0); block10 : { if (!(!$13_1 | (HEAP32[$13_1 + 4 >> 2] & 3) != ($3 | 0) | HEAP16[$13_1 >> 1] != ($2_1 | 0))) { if (HEAP32[$0_1 + 184 >> 2]) { $131($0_1, 5, 4070, 0); return 5; } $342($0_1, 0); break block10; } if (!($5_1 | $7_1)) { break block7 } } $1_1 = $390($0_1, $1_1, $2_1, $3, 1); if (!$1_1) { return 7 } $196($0_1, $1_1); if ($10_1) { HEAP32[$10_1 >> 2] = HEAP32[$10_1 >> 2] + 1 } HEAP32[$1_1 + 36 >> 2] = $10_1; HEAP32[$1_1 + 28 >> 2] = $9_1; HEAP32[$1_1 + 24 >> 2] = $8_1; HEAP32[$1_1 + 20 >> 2] = $7_1; HEAP32[$1_1 + 8 >> 2] = $4_1; HEAP16[$1_1 >> 1] = $2_1; HEAP32[$1_1 + 16 >> 2] = $5_1 ? $5_1 : $6_1; HEAP32[$1_1 + 4 >> 2] = (HEAP32[$1_1 + 4 >> 2] & 3 | $12_1) ^ 2097152; } return $11_1; } function $389($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; $6_1 = $6_1 | 0; $7_1 = $7_1 | 0; $8_1 = $8_1 | 0; return $387($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) | 0; } function $390($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $10_1 = $48($1_1); $11_1 = $0_1 + 416 | 0; $5_1 = $320($11_1, $1_1); while (1) { if ($5_1) { $8_1 = $393($5_1, $2_1, $3); $9_1 = $8_1 >>> 0 > $7_1 >>> 0; $7_1 = $9_1 ? $8_1 : $7_1; $6_1 = $9_1 ? $5_1 : $6_1; $5_1 = HEAP32[$5_1 + 12 >> 2]; continue; } break; }; block9 : { block5 : { block3 : { block1 : { if ($4_1) { break block1 } if ($6_1) { $5_1 = 0; if (!(HEAPU8[$0_1 + 24 | 0] & 2)) { break block3 } } $7_1 = 0; $5_1 = $394((HEAPU8[HEAPU8[$1_1 | 0] + 31040 | 0] + $10_1 >>> 0) % 23 | 0, $1_1); while (1) { if (!$5_1) { break block1 } $8_1 = $393($5_1, $2_1, $3); $9_1 = $8_1 >>> 0 > $7_1 >>> 0; $7_1 = $9_1 ? $8_1 : $7_1; $6_1 = $9_1 ? $5_1 : $6_1; $5_1 = HEAP32[$5_1 + 12 >> 2]; continue; }; } if (!(!$4_1 | $7_1 >>> 0 > 5)) { $4_1 = $270($0_1, $10_1 + 41 | 0, 0); if (!$4_1) { break block5 } HEAP32[$4_1 + 4 >> 2] = $3; HEAP16[$4_1 >> 1] = $2_1; $5_1 = $4_1 + 40 | 0; HEAP32[$4_1 + 32 >> 2] = $5_1; $2_1 = $10_1 + 1 | 0; if ($2_1) { wasm2js_memory_copy($5_1, $1_1, $2_1) } while (1) { $1_1 = HEAPU8[$5_1 | 0]; if ($1_1) { HEAP8[$5_1 | 0] = HEAPU8[$1_1 + 31040 | 0]; $5_1 = $5_1 + 1 | 0; continue; } break; }; $1_1 = $395($11_1, HEAP32[$4_1 + 32 >> 2], $4_1); if (($4_1 | 0) == ($1_1 | 0)) { $13($0_1, $4_1); $106($0_1); break block5; } HEAP32[$4_1 + 12 >> 2] = $1_1; return $4_1; } if (!$6_1) { break block5 } $5_1 = $4_1; } if ($5_1 | HEAP32[$6_1 + 16 >> 2]) { break block9 } } $6_1 = 0; } return $6_1; } function $391($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = 0; block : { if ($390($0_1, $1_1, $2_1, 1, 0)) { break block } HEAP32[$3 >> 2] = $1_1; $5_1 = $61(8932, $3); $4_1 = 7; if (!$5_1) { break block } $4_1 = $387($0_1, $1_1, $2_1, 1, $5_1, 14, 0, 0, 1); } $1_1 = $4_1; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $392($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 >> 2] = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; $2_1 = $0_1; $0_1 = $61(2174, $1_1); $235($2_1, $0_1, -1); $24($0_1); $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $393($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = 4; $3 = HEAP16[$0_1 >> 1]; block2 : { block : { if (($3 | 0) == ($1_1 | 0)) { break block } if (($1_1 | 0) == -2) { return HEAP32[$0_1 + 16 >> 2] ? 6 : 0 } if (($3 | 0) >= 0) { break block2 } $4_1 = 1; if ($3 >>> 0 > 4294967293) { break block } if ((-2 - $3 | 0) > ($1_1 | 0)) { break block2 } } $0_1 = HEAP32[$0_1 + 4 >> 2]; if (($2_1 | 0) == ($0_1 & 3)) { return $4_1 | 2 } $5_1 = (($0_1 & $2_1) >>> 1 & 1) + $4_1 | 0; } return $5_1; } function $394($0_1, $1_1) { $0_1 = ($0_1 << 2) + 82468 | 0; while (1) { block : { $0_1 = HEAP32[$0_1 >> 2]; if (!$0_1) { break block } if (!$67(HEAP32[$0_1 + 32 >> 2], $1_1)) { break block } $0_1 = $0_1 + 36 | 0; continue; } break; }; return $0_1; } function $395($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $3; $4_1 = $825($0_1, $1_1, $5_1 + 12 | 0); $3 = HEAP32[$4_1 + 8 >> 2]; block7 : { if ($3) { if (!$2_1) { $1_1 = HEAP32[$4_1 >> 2]; $6_1 = HEAP32[$5_1 + 12 >> 2]; $2_1 = HEAP32[$4_1 + 4 >> 2]; block3 : { if ($2_1) { HEAP32[$2_1 >> 2] = $1_1; break block3; } HEAP32[$0_1 + 8 >> 2] = $1_1; } if ($1_1) { HEAP32[$1_1 + 4 >> 2] = $2_1 } $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($2_1) { $2_1 = $2_1 + ($6_1 << 3) | 0; if (HEAP32[$2_1 + 4 >> 2] == ($4_1 | 0)) { HEAP32[$2_1 + 4 >> 2] = $1_1 } HEAP32[$2_1 >> 2] = HEAP32[$2_1 >> 2] - 1; } $24($4_1); $1_1 = HEAP32[$0_1 + 4 >> 2] - 1 | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; if ($1_1) { break block7 } $197($0_1); break block7; } HEAP32[$4_1 + 12 >> 2] = $1_1; HEAP32[$4_1 + 8 >> 2] = $2_1; break block7; } if (!$2_1) { $3 = 0; break block7; } $6_1 = $30(16, 0); if (!$6_1) { $3 = $2_1; break block7; } HEAP32[$6_1 + 8 >> 2] = $2_1; HEAP32[$6_1 + 12 >> 2] = $1_1; $2_1 = HEAP32[$0_1 + 4 >> 2] + 1 | 0; HEAP32[$0_1 + 4 >> 2] = $2_1; block10 : { if ($2_1 >>> 0 < 10) { break block10 } $3 = HEAP32[$0_1 >> 2]; if ($2_1 >>> 0 <= $3 << 1 >>> 0) { break block10 } $2_1 = $2_1 << 4 >>> 0 > 1024 ? 128 : $2_1 << 1; if (($2_1 | 0) == ($3 | 0)) { break block10 } $3 = HEAP32[20678]; if ($3) { FUNCTION_TABLE[$3 | 0]() } $4_1 = $30($2_1 << 3, 0); $2_1 = HEAP32[20679]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } if (!$4_1) { break block10 } $24(HEAP32[$0_1 + 12 >> 2]); HEAP32[$0_1 + 12 >> 2] = $4_1; $2_1 = FUNCTION_TABLE[HEAP32[18897]]($4_1) | 0; $7_1 = $2_1 >>> 3 | 0; HEAP32[$0_1 >> 2] = $7_1; $2_1 = $2_1 & -8; if ($2_1) { wasm2js_memory_fill($4_1, 0, $2_1) } $2_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = 0; while (1) { if ($2_1) { $3 = HEAP32[$2_1 >> 2]; $827($0_1, $4_1 + (($826(HEAP32[$2_1 + 12 >> 2]) >>> 0) % ($7_1 >>> 0) << 3) | 0, $2_1); $2_1 = $3; continue; } break; }; HEAP32[$5_1 + 12 >> 2] = ($826($1_1) >>> 0) % HEAPU32[$0_1 >> 2]; } $3 = 0; $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 12 >> 2]; $827($1_1, $0_1 ? $0_1 + (HEAP32[$5_1 + 12 >> 2] << 3) | 0 : 0, $6_1); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $396($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; HEAP32[$0_1 + 248 >> 2] = $1_1; $1_1 = HEAP32[$0_1 + 244 >> 2]; HEAP32[$0_1 + 244 >> 2] = $2_1; return $1_1 | 0; } function $397($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; block : { if (($0_1 | 0) > ($3 | 0)) { break block } $0_1 = HEAP32[20678]; if ($0_1) { FUNCTION_TABLE[$0_1 | 0]() } $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $3 = 12; block5 : { block4 : { if (!$2_1 | !HEAPU8[$2_1 | 0]) { break block4 } $3 = $92($1_1, $2_1); if (($3 | 0) >= 0) { break block4 } HEAP32[$0_1 >> 2] = $2_1; $2_1 = 1; $131($1_1, 1, 8221, $0_1); break block5; } HEAP32[$1_1 + 456 >> 2] = 0; $2_1 = $400($1_1, $3, 0, 0, 0); $122($1_1, $2_1); } $114($1_1, $2_1); if (!HEAP32[$1_1 + 184 >> 2]) { HEAP32[$1_1 + 296 >> 2] = 0 } $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $0_1 = HEAP32[20679]; if (!$0_1) { break block } FUNCTION_TABLE[$0_1 | 0](); } return 0; } function $400($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $10_1 = ($1_1 | 0) == 12; while (1) { if (!(HEAP32[$0_1 + 20 >> 2] <= ($8_1 | 0) | $5_1)) { block2 : { if (!$10_1) { $5_1 = 0; if (($1_1 | 0) != ($8_1 | 0)) { break block2 } } $11_1 = $7_1; $5_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($8_1 << 4) | 0) + 4 >> 2]; $6_1 = 0; block3 : { if (!$5_1) { break block3 } $7_1 = HEAP32[$5_1 + 4 >> 2]; $9_1 = HEAP32[$5_1 >> 2]; HEAP32[$7_1 + 4 >> 2] = $9_1; $6_1 = 6; if (HEAPU8[$7_1 + 20 | 0]) { break block3 } $5_1 = HEAP32[$7_1 >> 2]; $7_1 = HEAP32[$5_1 + 232 >> 2]; if (!$7_1) { $6_1 = 0; if (HEAPU8[$5_1 + 5 | 0] != 5) { break block3 } $97($9_1, 2421, 0, 0, 0); $7_1 = HEAP32[$5_1 + 232 >> 2]; $6_1 = 0; if (!$7_1) { break block3 } } if ($2_1) { $6_1 = HEAP32[$5_1 + 192 >> 2] } else { $6_1 = 0 } $6_1 = $401($7_1, $9_1, $2_1, $6_1, HEAP32[$5_1 + 196 >> 2], HEAPU8[$5_1 + 11 | 0], HEAP32[$5_1 + 168 >> 2], HEAP32[$5_1 + 224 >> 2], $3, $4_1); } $5_1 = $6_1; $3 = ($5_1 | 0) == 5; $7_1 = $3 ? 1 : $11_1; $5_1 = $3 ? 0 : $5_1; $4_1 = 0; $3 = 0; } $8_1 = $8_1 + 1 | 0; continue; } break; }; return $5_1 ? $5_1 : $7_1 ? 5 : $5_1; } function $401($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1) { var $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0, wasm2js_i32$3 = 0, wasm2js_i32$4 = 0, wasm2js_i32$5 = 0; $12_1 = global$0 - 144 | 0; $18_1 = $12_1; if (global$4 >>> 0 < $12_1 >>> 0 | global$5 >>> 0 > $12_1 >>> 0) { fimport$30($12_1 | 0) } global$0 = $18_1; HEAP32[$12_1 + 12 >> 2] = 0; $11_1 = 8; if (!HEAPU8[$0_1 + 46 | 0]) { $18_1 = $2_1; $10_1 = $539($0_1, 1, 1); block1 : { if ($10_1) { break block1 } HEAP8[$0_1 + 45 | 0] = 1; block6 : { block3 : { if (!$18_1) { $18_1 = 0; break block3; } $18_1 = 0; $10_1 = $608($0_1, $3, $4_1, 0, 1); if (($10_1 | 0) == 5) { $3 = 0; break block3; } if ($10_1) { $18_1 = $2_1; break block6; } HEAP8[$0_1 + 44 | 0] = 1; $18_1 = $2_1; } $10_1 = $566($0_1, $12_1 + 12 | 0); } if ($10_1) { break block1 } $20_1 = HEAP32[$0_1 + 68 >> 2]; $19_1 = HEAPU16[$0_1 + 66 >> 1]; $19_1 = ($19_1 << 16 | $19_1) & 130560; block8 : { if (!(!$20_1 | ($19_1 | 0) == ($6_1 | 0))) { $10_1 = $181(69476); break block8; } $22_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; block14 : { if ($20_1 >>> 0 <= HEAPU32[$22_1 + 96 >> 2]) { $10_1 = 0 } else { $13_1 = $22_1 + 100 | 0; $28_1 = HEAP32[$0_1 + 72 >> 2]; $10_1 = 0; $11_1 = 1; while (1) { if (($11_1 | 0) != 5) { $14 = $13_1 + ($11_1 << 2) | 0; $6_1 = HEAP32[$14 >> 2]; block12 : { if ($6_1 >>> 0 >= $20_1 >>> 0) { break block12 } $15_1 = $11_1 + 3 | 0; $10_1 = $608($0_1, $3, $4_1, $15_1, 1); if (($10_1 | 0) == 5) { $20_1 = $6_1; $3 = 0; break block12; } if ($10_1) { break block14 } HEAP32[$14 >> 2] = ($11_1 | 0) != 1 ? -1 : $20_1; $541($0_1, $15_1, 1); $10_1 = 0; } $11_1 = $11_1 + 1 | 0; continue; } break; }; block15 : { if (HEAPU32[$22_1 + 96 >> 2] >= $20_1 >>> 0) { break block15 } $13_1 = HEAP32[$22_1 + 96 >> 2]; $15_1 = HEAP32[$0_1 + 68 >> 2]; $17_1 = $15_1 + 33 >>> 12 | 0; $10_1 = 0; $11_1 = ($15_1 >>> 0 >= 4096 ? 4096 : $15_1) << 1; $14 = $11_1; $6_1 = (Math_imul($17_1, 20) + ($15_1 << 1) | 0) + 28 | 0; $11_1 = $11_1 + $6_1 | 0; $10_1 = $14 >>> 0 > $11_1 >>> 0 ? 1 : $10_1; $16_1 = $31($11_1, $10_1); if (!$16_1) { $10_1 = 7; $16_1 = 0; break block14; } $10_1 = 0; if ($6_1) { wasm2js_memory_fill($16_1, 0, $6_1) } HEAP32[$16_1 + 4 >> 2] = $17_1 + 1; $27 = $16_1 + 8 | 0; $26_1 = $6_1 + $16_1 | 0; $6_1 = $13_1 + 34 >>> 12 | 0; while (1) { if (!($6_1 >>> 0 > $17_1 >>> 0 | $10_1)) { $10_1 = $562($0_1, $6_1, $12_1 + 16 | 0); if (!$10_1) { block21 : { if (($6_1 | 0) == ($17_1 | 0)) { $11_1 = HEAP32[$12_1 + 24 >> 2]; $14 = $15_1 - $11_1 | 0; break block21; } $11_1 = HEAP32[$12_1 + 24 >> 2]; $14 = HEAP32[$12_1 + 16 >> 2] - HEAP32[$12_1 + 20 >> 2] >> 2; } $13_1 = HEAP32[$16_1 + 4 >> 2]; $29_1 = $11_1 + 1 | 0; HEAP32[$12_1 + 24 >> 2] = $29_1; $23_1 = (Math_imul($13_1, 20) + $27 | 0) + ($11_1 << 1) | 0; $11_1 = 0; $24_1 = ($14 | 0) > 0 ? $14 : 0; while (1) { if (!(($11_1 | 0) == ($24_1 | 0))) { HEAP16[$23_1 + ($11_1 << 1) >> 1] = $11_1; $11_1 = $11_1 + 1 | 0; continue; } break; }; $21_1 = HEAP32[$12_1 + 20 >> 2]; $11_1 = 0; HEAP32[$12_1 + 140 >> 2] = 0; HEAP32[$12_1 + 136 >> 2] = 0; wasm2js_memory_fill($12_1 + 32 | 0, 0, 104); $13_1 = 0; while (1) { if (!(($13_1 | 0) == ($24_1 | 0))) { HEAP32[$12_1 + 140 >> 2] = 1; HEAP32[$12_1 + 136 >> 2] = $23_1 + ($13_1 << 1); $11_1 = 0; while (1) { if ($13_1 >>> $11_1 & 1) { $25 = ($12_1 + 32 | 0) + ($11_1 << 3) | 0; $609($21_1, HEAP32[$25 + 4 >> 2], HEAP32[$25 >> 2], $12_1 + 136 | 0, $12_1 + 140 | 0, $26_1); $11_1 = $11_1 + 1 | 0; continue; } break; }; $25 = ($12_1 + 32 | 0) + ($11_1 << 3) | 0; HEAP32[$25 + 4 >> 2] = HEAP32[$12_1 + 136 >> 2]; HEAP32[$25 >> 2] = HEAP32[$12_1 + 140 >> 2]; $13_1 = $13_1 + 1 | 0; continue; } break; }; while (1) { $11_1 = $11_1 + 1 | 0; if ($11_1 >>> 0 <= 12) { if (!($14 >>> $11_1 & 1)) { continue } $13_1 = ($12_1 + 32 | 0) + ($11_1 << 3) | 0; $609($21_1, HEAP32[$13_1 + 4 >> 2], HEAP32[$13_1 >> 2], $12_1 + 136 | 0, $12_1 + 140 | 0, $26_1); continue; } break; }; $11_1 = Math_imul($6_1, 20) + $27 | 0; HEAP32[$11_1 + 12 >> 2] = HEAP32[$12_1 + 140 >> 2]; HEAP32[$11_1 + 16 >> 2] = $29_1; HEAP32[$11_1 + 8 >> 2] = $21_1; HEAP32[$11_1 + 4 >> 2] = $23_1; } $6_1 = $6_1 + 1 | 0; continue; } break; }; if ($10_1) { $24($16_1); $16_1 = 0; break block15; } $10_1 = $608($0_1, $3, $4_1, 3, 1); if ($10_1) { break block15 } $23_1 = HEAP32[$22_1 + 96 >> 2]; HEAP32[$22_1 + 128 >> 2] = $20_1; block29 : { block28 : { $15_1 = $5_1 >>> 2 & 3; if (!$15_1) { break block28 } $5_1 = HEAP32[$0_1 + 8 >> 2]; $11_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 20 >> 2]]($5_1, $15_1) | 0; if (!$11_1) { break block28 } break block29; } HEAP32[$12_1 + 32 >> 2] = __wasm_i64_mul($28_1, 0, $19_1, 0); HEAP32[$12_1 + 36 >> 2] = i64toi32_i32$HIGH_BITS; $5_1 = HEAP32[$0_1 + 4 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 40 >> 2]]($5_1, 39, 0) | 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; $11_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 24 >> 2]]($5_1, $12_1 + 16 | 0) | 0; if ($11_1) { break block29 } $13_1 = HEAP32[$12_1 + 20 >> 2]; $10_1 = $13_1; $11_1 = HEAP32[$12_1 + 36 >> 2]; $5_1 = HEAP32[$12_1 + 16 >> 2]; $6_1 = HEAP32[$12_1 + 32 >> 2]; block30 : { if (($10_1 | 0) >= ($11_1 | 0) & $5_1 >>> 0 >= $6_1 >>> 0 | ($10_1 | 0) > ($11_1 | 0)) { break block30 } $14 = __wasm_i64_mul(HEAP32[$0_1 + 68 >> 2], 0, $19_1, 0); $10_1 = $14 + $5_1 | 0; $5_1 = i64toi32_i32$HIGH_BITS + $13_1 | 0; $5_1 = $10_1 >>> 0 < $14 >>> 0 ? $5_1 + 1 | 0 : $5_1; $10_1 = $10_1 + 65536 | 0; $5_1 = $10_1 >>> 0 < 65536 ? $5_1 + 1 | 0 : $5_1; if (!(($11_1 | 0) <= ($5_1 | 0) & $6_1 >>> 0 <= $10_1 >>> 0 | ($5_1 | 0) > ($11_1 | 0))) { $11_1 = $181(67403); break block29; } $5_1 = HEAP32[$0_1 + 4 >> 2]; $6_1 = HEAP32[$5_1 >> 2]; if (!$6_1) { break block30 } FUNCTION_TABLE[HEAP32[$6_1 + 40 >> 2]]($5_1, 5, $12_1 + 32 | 0) | 0; } $11_1 = 0; } $13_1 = $19_1 | 24; $14 = 0; while (1) { block32 : { $10_1 = $11_1; if ($11_1) { break block32 } $17_1 = HEAP32[$16_1 + 4 >> 2]; $21_1 = HEAP32[$16_1 >> 2]; $5_1 = -1; label6 : while (1) { if (($17_1 | 0) > 0) { $17_1 = $17_1 - 1 | 0; $10_1 = Math_imul($17_1, 20) + $27 | 0; $11_1 = HEAP32[$10_1 >> 2]; $6_1 = HEAP32[$10_1 + 12 >> 2]; $26_1 = ($6_1 | 0) < ($11_1 | 0) ? $11_1 : $6_1; while (1) { if (($11_1 | 0) == ($26_1 | 0)) { continue label6 } $24_1 = HEAPU16[HEAP32[$10_1 + 4 >> 2] + ($11_1 << 1) >> 1]; $6_1 = HEAP32[HEAP32[$10_1 + 8 >> 2] + ($24_1 << 2) >> 2]; if ($21_1 >>> 0 < $6_1 >>> 0) { if ($5_1 >>> 0 <= $6_1 >>> 0) { continue label6 } $14 = $24_1 + HEAP32[$10_1 + 16 >> 2] | 0; $5_1 = $6_1; continue label6; } else { $11_1 = $11_1 + 1 | 0; HEAP32[$10_1 >> 2] = $11_1; continue; } }; } break; }; HEAP32[$16_1 >> 2] = $5_1; if (($5_1 | 0) == -1) { $10_1 = 0; break block32; } if (HEAP32[$1_1 + 296 >> 2]) { $10_1 = HEAPU8[$1_1 + 87 | 0] ? 7 : 9; break block32; } $11_1 = 0; if ($14 >>> 0 <= $23_1 >>> 0 | $14 >>> 0 > $20_1 >>> 0 | $5_1 >>> 0 > $28_1 >>> 0) { continue } $17_1 = HEAP32[$0_1 + 8 >> 2]; $6_1 = $19_1; $21_1 = __wasm_i64_mul($14 - 1 | 0, 0, $13_1, 0); $10_1 = i64toi32_i32$HIGH_BITS; $21_1 = $21_1 + 56 | 0; $10_1 = $21_1 >>> 0 < 56 ? $10_1 + 1 | 0 : $10_1; $10_1 = FUNCTION_TABLE[HEAP32[HEAP32[$17_1 >> 2] + 8 >> 2]]($17_1, $7_1, $6_1, $21_1, $10_1) | 0; if ($10_1) { break block32 } $6_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = ((((((wasm2js_i32$1 = $6_1, wasm2js_i32$2 = $7_1), wasm2js_i32$3 = $19_1), wasm2js_i32$4 = __wasm_i64_mul($19_1, 0, $5_1 - 1 | 0, 0)), wasm2js_i32$5 = i64toi32_i32$HIGH_BITS), wasm2js_i32$0 = HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0, wasm2js_i32$3 | 0, wasm2js_i32$4 | 0, wasm2js_i32$5 | 0) | 0); if (!$10_1) { continue } } break; }; $1_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = HEAP32[$1_1 >> 2]; if ($5_1) { FUNCTION_TABLE[HEAP32[$5_1 + 40 >> 2]]($1_1, 37, 0) | 0 } block38 : { if ($10_1) { break block38 } block39 : { if (HEAP32[HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2] + 16 >> 2] != ($20_1 | 0)) { break block39 } $1_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = ((((wasm2js_i32$5 = $1_1, wasm2js_i32$4 = __wasm_i64_mul($19_1, 0, HEAP32[$0_1 + 72 >> 2], 0)), wasm2js_i32$3 = i64toi32_i32$HIGH_BITS), wasm2js_i32$0 = HEAP32[HEAP32[$1_1 >> 2] + 16 >> 2]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$5 | 0, wasm2js_i32$4 | 0, wasm2js_i32$3 | 0) | 0); if ($10_1) { break block38 } if (!$15_1) { break block39 } $1_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 20 >> 2]]($1_1, $15_1) | 0; if ($10_1) { break block38 } } HEAP32[$22_1 + 96 >> 2] = $20_1; $10_1 = 0; } $541($0_1, 3, 1); } $10_1 = ($10_1 | 0) != 5 ? $10_1 : 0; } if ($10_1 | !$18_1) { break block14 } if (HEAPU32[$22_1 + 96 >> 2] < HEAPU32[$0_1 + 68 >> 2]) { $10_1 = 5; break block14; } if (($18_1 | 0) < 2) { $10_1 = 0; break block14; } $65(4, $12_1 + 32 | 0); $10_1 = $608($0_1, $3, $4_1, 4, 4); if ($10_1) { break block14 } $10_1 = 0; if (($18_1 | 0) == 3) { $540($0_1, HEAP32[$12_1 + 32 >> 2]); $1_1 = HEAP32[$0_1 + 8 >> 2]; $10_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 16 >> 2]]($1_1, 0, 0) | 0; } $541($0_1, 4, 4); } $24($16_1); } if ($10_1 ? ($10_1 | 0) != 5 : 0) { break block1 } if ($8_1) { HEAP32[$8_1 >> 2] = HEAP32[$0_1 + 68 >> 2] } if (!$9_1) { break block1 } HEAP32[$9_1 >> 2] = HEAP32[HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2] + 96 >> 2]; } if (HEAP32[$12_1 + 12 >> 2]) { wasm2js_memory_fill($0_1 + 52 | 0, 0, 48) } $574($0_1); if (HEAPU8[$0_1 + 45 | 0]) { $541($0_1, 1, 1); HEAP8[$0_1 + 45 | 0] = 0; } $11_1 = ($2_1 | 0) == ($18_1 | 0) ? $10_1 : $10_1 ? $10_1 : 5; } $0_1 = $12_1 + 144 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $11_1; } function $402($0_1) { var $1_1 = 0; $1_1 = 7; block : { if (!$0_1) { break block } if (!$347($0_1)) { return $1(184260) } if (HEAPU8[$0_1 + 87 | 0]) { break block } $1_1 = HEAP32[$0_1 + 72 >> 2] & HEAP32[$0_1 + 64 >> 2]; } return $1_1; } function $403($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $5_1 = global$0 - 48 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 + 36 >> 2] = 0; HEAP32[$5_1 + 32 >> 2] = 0; HEAP32[$1_1 >> 2] = 0; $3 = $19(); if (!$3) { $4_1 = !(HEAPU8[75548] ? HEAPU8[75549] : 0); $3 = HEAP32[18936] ? 131078 : 6; $6_1 = $3 & -655129; HEAP32[$5_1 + 40 >> 2] = $6_1; $2_1 = $132(536, 0); block4 : { if (!$2_1) { break block4 } if (!$4_1) { HEAP32[$2_1 + 12 >> 2] = 8 } HEAP8[$2_1 + 97 | 0] = 109; HEAP32[$2_1 + 20 >> 2] = 2; HEAP16[$2_1 + 308 >> 1] = 0; HEAP32[$2_1 + 304 >> 2] = 1; HEAP32[$2_1 + 16 >> 2] = $2_1 + 460; HEAP32[$2_1 + 72 >> 2] = $3 & 33554432 ? -1 : 255; wasm2js_memory_copy($2_1 + 120 | 0, 33152, 48); HEAP8[$2_1 + 90 | 0] = 255; HEAP8[$2_1 + 85 | 0] = 1; HEAP32[$2_1 + 164 >> 2] = 0; $4_1 = HEAP32[18929]; $7_1 = HEAP32[18928]; HEAP32[$2_1 + 180 >> 2] = 76320; HEAP32[$2_1 + 100 >> 2] = 0; HEAP32[$2_1 + 48 >> 2] = $7_1; HEAP32[$2_1 + 52 >> 2] = $4_1; $4_1 = HEAP32[$2_1 + 36 >> 2] | 112; HEAP32[$2_1 + 32 >> 2] = HEAP32[$2_1 + 32 >> 2] | -536575776; HEAP32[$2_1 + 36 >> 2] = $4_1; HEAP32[$2_1 + 432 >> 2] = 0; HEAP32[$2_1 + 436 >> 2] = 0; $4_1 = $2_1 + 440 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$2_1 + 388 >> 2] = 0; HEAP32[$2_1 + 392 >> 2] = 0; $4_1 = $2_1 + 396 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $406($2_1, 33712, 1, 15); $406($2_1, 33712, 3, 15); $406($2_1, 33712, 2, 15); $406($2_1, 20451, 1, 16); $406($2_1, 20175, 1, 17); if (HEAPU8[$2_1 + 87 | 0]) { break block4 } HEAP32[$2_1 + 60 >> 2] = $6_1; block8 : { if (!(1 << ($3 & 7) & 70)) { $0_1 = $1(184992); break block8; } $0_1 = $409(0, $0_1 ? $0_1 : 23214, $5_1 + 40 | 0, $2_1, $5_1 + 36 | 0, $5_1 + 32 | 0); } if ($0_1) { if (($0_1 | 0) == 7) { $106($2_1) } $3 = HEAP32[$5_1 + 32 >> 2]; HEAP32[$5_1 >> 2] = $3; $131($2_1, $0_1, $3 ? 8932 : 0, $5_1); $24($3); break block4; } $0_1 = $410(HEAP32[$2_1 >> 2], HEAP32[$5_1 + 36 >> 2], $2_1, HEAP32[$2_1 + 16 >> 2] + 4 | 0, 0, HEAP32[$5_1 + 40 >> 2] | 256); if ($0_1) { $122($2_1, ($0_1 | 0) == 3082 ? 7 : $0_1); break block4; } $0_1 = HEAP32[HEAP32[$2_1 + 16 >> 2] + 4 >> 2]; HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = $411($2_1, $0_1); HEAP32[HEAP32[$2_1 + 16 >> 2] + 12 >> 2] = $0_1; if (!HEAPU8[$2_1 + 87 | 0]) { $412($2_1, HEAPU8[$0_1 + 77 | 0]) } $3 = $411($2_1, 0); $0_1 = HEAP32[$2_1 + 16 >> 2]; HEAP8[$0_1 + 24 | 0] = 1; HEAP32[$0_1 + 16 >> 2] = 9976; HEAP8[$0_1 + 8 | 0] = 3; HEAP32[$0_1 >> 2] = 11378; HEAP32[$0_1 + 28 >> 2] = $3; HEAP8[$2_1 + 97 | 0] = 118; if (HEAPU8[$2_1 + 87 | 0]) { break block4 } $122($2_1, 0); if (($391($2_1, 20364, 2) | 0) == 7) { $106($2_1) } $3 = 0; $0_1 = $402($2_1); while (1) { if (!($3 >>> 0 > 2 | $0_1)) { $0_1 = FUNCTION_TABLE[HEAP32[($3 << 2) + 53852 >> 2]]($2_1) | 0; $3 = $3 + 1 | 0; continue; } break; }; block19 : { if (!$0_1) { $3 = 0; block16 : { if (!HEAP32[20614]) { break block16 } $0_1 = 1; while (1) { if (!$0_1) { break block16 } block18 : { if ($3 >>> 0 >= HEAPU32[20614]) { HEAP32[$5_1 + 44 >> 2] = 0; $0_1 = 0; $6_1 = 0; break block18; } $4_1 = HEAP32[HEAP32[20615] + ($3 << 2) >> 2]; HEAP32[$5_1 + 44 >> 2] = 0; $0_1 = 1; $6_1 = 0; if (!$4_1) { break block18 } $4_1 = FUNCTION_TABLE[$4_1 | 0]($2_1, $5_1 + 44 | 0, 0) | 0; $6_1 = HEAP32[$5_1 + 44 >> 2]; if (!$4_1) { break block18 } HEAP32[$5_1 + 16 >> 2] = $6_1; $131($2_1, $4_1, 8722, $5_1 + 16 | 0); $0_1 = 0; $6_1 = HEAP32[$5_1 + 44 >> 2]; } $24($6_1); $3 = $3 + 1 | 0; continue; }; } if (!$402($2_1)) { break block19 } break block4; } $122($2_1, $0_1); } $9_1 = HEAP32[18891]; $0_1 = HEAP32[18892]; $4_1 = 0; $6_1 = 0; $3 = $8(HEAP32[$2_1 + 332 >> 2]); $7_1 = $8(HEAP32[$2_1 + 336 >> 2]); $3 = $8(HEAP32[$2_1 + 340 >> 2]) + $3 | 0; $10_1 = $8(HEAP32[$2_1 + 344 >> 2]); if ((HEAP32[$2_1 + 316 >> 2] - (($3 + $7_1 | 0) + $10_1 | 0) | 0) <= 0) { if (HEAPU8[$2_1 + 312 | 0]) { $24(HEAP32[$2_1 + 352 >> 2]) } block9 : { block2 : { if (($0_1 | 0) <= 0) { break block2 } $3 = (($9_1 | 0) <= 7 ? 7 : $9_1) & 2147483640; if (!$3) { break block2 } $4_1 = $3 >>> 0 >= 65528 ? 65528 : $3; $3 = __wasm_i64_mul($4_1, 0, ($0_1 | 0) > 0 ? $0_1 : 0, 0); $7_1 = i64toi32_i32$HIGH_BITS; $0_1 = HEAP32[20678]; if ($0_1) { FUNCTION_TABLE[$0_1 | 0]() } $0_1 = $30($3, $7_1); $6_1 = HEAP32[20679]; if ($6_1) { FUNCTION_TABLE[$6_1 | 0]() } block40 : { if (!$0_1) { $0_1 = 0; break block40; } $3 = FUNCTION_TABLE[HEAP32[18897]]($0_1) | 0; $7_1 = $3 >> 31; } if (($9_1 | 0) >= 384) { $6_1 = __wasm_i64_sdiv($3, $7_1, $4_1 + 384 | 0, 0); $8_1 = __wasm_i64_mul($6_1, $6_1 >> 31, $4_1, 0); $8_1 = __wasm_i64_sdiv($3 - $8_1 | 0, $7_1 - (i64toi32_i32$HIGH_BITS + ($3 >>> 0 < $8_1 >>> 0) | 0) | 0, 128, 0); break block9; } if (($9_1 | 0) >= 256) { $6_1 = __wasm_i64_sdiv($3, $7_1, $4_1 + 128 | 0, 0); $8_1 = __wasm_i64_mul($6_1, $6_1 >> 31, $4_1, 0); $8_1 = __wasm_i64_sdiv($3 - $8_1 | 0, $7_1 - (i64toi32_i32$HIGH_BITS + ($3 >>> 0 < $8_1 >>> 0) | 0) | 0, 128, 0); break block9; } $6_1 = __wasm_i64_sdiv($3, $7_1, $4_1, 0); break block9; } $0_1 = 0; } HEAP32[$2_1 + 332 >> 2] = 0; HEAP32[$2_1 + 336 >> 2] = 0; HEAP32[$2_1 + 352 >> 2] = $0_1; HEAP16[$2_1 + 310 >> 1] = $4_1; HEAP16[$2_1 + 308 >> 1] = $4_1; block14 : { if ($0_1) { $3 = 0; $9_1 = ($6_1 | 0) > 0 ? $6_1 : 0; $7_1 = 0; while (1) { if (($7_1 | 0) != ($9_1 | 0)) { HEAP32[$0_1 >> 2] = $3; HEAP32[$2_1 + 332 >> 2] = $0_1; $7_1 = $7_1 + 1 | 0; $3 = $0_1; $0_1 = $0_1 + $4_1 | 0; continue; } break; }; HEAP32[$2_1 + 348 >> 2] = $0_1; HEAP32[$2_1 + 340 >> 2] = 0; HEAP32[$2_1 + 344 >> 2] = 0; $3 = 0; $4_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $7_1 = 0; while (1) { if (($4_1 | 0) != ($7_1 | 0)) { HEAP32[$0_1 >> 2] = $3; HEAP32[$2_1 + 340 >> 2] = $0_1; $7_1 = $7_1 + 1 | 0; $3 = $0_1; $0_1 = $0_1 + 128 | 0; continue; } break; }; HEAP32[$2_1 + 304 >> 2] = 0; HEAP32[$2_1 + 356 >> 2] = $0_1; HEAP8[$2_1 + 312 | 0] = 1; $3 = $6_1 + $8_1 | 0; break block14; } HEAP32[$2_1 + 340 >> 2] = 0; HEAP32[$2_1 + 344 >> 2] = 0; HEAP8[$2_1 + 312 | 0] = 0; HEAP16[$2_1 + 308 >> 1] = 0; HEAP32[$2_1 + 304 >> 2] = 1; HEAP32[$2_1 + 356 >> 2] = 0; $0_1 = $2_1 + 348 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $0_1 = 0; $3 = 0; } HEAP32[$2_1 + 360 >> 2] = $0_1; HEAP32[$2_1 + 316 >> 2] = $3; $0_1 = 0; } else { $0_1 = 5 } HEAP32[$2_1 + 272 >> 2] = 1e3; HEAP32[$2_1 + 268 >> 2] = 18; } $3 = $402($2_1); block21 : { if (($3 & 255) == 7) { $381($2_1, 0); $2_1 = 0; break block21; } if (!$3) { break block21 } HEAP8[$2_1 + 97 | 0] = 186; } HEAP32[$1_1 >> 2] = $2_1; $413(HEAP32[$5_1 + 36 >> 2]); } $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $405($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $0_1 = $2014($2_1, $4_1, ($1_1 | 0) < ($3 | 0) ? $1_1 : $3); return ($0_1 ? $0_1 : $1_1 - $3 | 0) | 0; } function $406($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = ($2_1 | 0) == 4 ? 2 : ($2_1 | 0) == 8 ? 2 : $2_1; if ($4_1 - 4 >>> 0 <= 4294967292) { $1(184317); return; } block1 : { $5_1 = $414($0_1, $4_1, $1_1, 0); if (!$5_1 | !HEAP32[$5_1 + 12 >> 2]) { break block1 } if (HEAP32[$0_1 + 184 >> 2]) { $131($0_1, 5, 4133, 0); return; } $342($0_1, 0); if ((HEAPU8[$5_1 + 4 | 0] & 247) != ($4_1 | 0)) { break block1 } $9_1 = $320($0_1 + 432 | 0, $1_1); while (1) { if (($7_1 | 0) == 3) { break block1 } $6_1 = Math_imul($7_1, 20) + $9_1 | 0; if (HEAPU8[$6_1 + 4 | 0] == HEAPU8[$5_1 + 4 | 0]) { $8_1 = HEAP32[$6_1 + 16 >> 2]; if ($8_1) { FUNCTION_TABLE[$8_1 | 0](HEAP32[$6_1 + 8 >> 2]) } HEAP32[$6_1 + 12 >> 2] = 0; } $7_1 = $7_1 + 1 | 0; continue; }; } $1_1 = $414($0_1, $4_1, $1_1, 1); if (!$1_1) { return } HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = $3; HEAP8[$1_1 + 4 | 0] = $2_1 & 8 | $4_1; $122($0_1, 0); } function $407($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $0_1 = $68($2_1, $4_1, ($1_1 | 0) < ($3 | 0) ? $1_1 : $3); return ($0_1 ? $0_1 : $1_1 - $3 | 0) | 0; } function $408($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $0_1 = $2_1 - 1 | 0; while (1) { if (!(!$1_1 | HEAPU8[$0_1 + $1_1 | 0] != 32)) { $1_1 = $1_1 - 1 | 0; continue; } break; }; $0_1 = $4_1 - 1 | 0; while (1) { if (!(!$3 | HEAPU8[$0_1 + $3 | 0] != 32)) { $3 = $3 - 1 | 0; continue; } break; }; return $405($3, $1_1, $2_1, $3, $4_1) | 0; } function $409($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $12_1 = global$0 + -64 | 0; $6_1 = $12_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $8_1 = $48($1_1); block38 : { block37 : { block9 : { block4 : { block25 : { block1 : { $9_1 = HEAP32[$2_1 >> 2]; block2 : { if (!($9_1 & 64)) { if (!HEAPU8[75550]) { break block1 } if ($8_1 >>> 0 > 4) { break block2 } break block1; } if ($8_1 >>> 0 < 5) { break block1 } } if ($2014($1_1, 23223, 5)) { break block1 } $10_1 = $8_1 + 8 | 0; $6_1 = 0; while (1) { if (!(($7_1 | 0) == ($8_1 | 0))) { $11_1 = HEAPU8[$1_1 + $7_1 | 0] == 38; $10_1 = $10_1 + $11_1 | 0; $6_1 = $11_1 >>> 0 > $10_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $7_1 = $7_1 + 1 | 0; continue; } break; }; $6_1 = $31($10_1, $6_1); if (!$6_1) { break block4 } $16_1 = $9_1 | 64; $8_1 = 0; HEAP8[$6_1 | 0] = 0; HEAP8[$6_1 + 1 | 0] = 0; HEAP8[$6_1 + 2 | 0] = 0; HEAP8[$6_1 + 3 | 0] = 0; $11_1 = $6_1 + 4 | 0; $6_1 = 5; block5 : { if (HEAPU8[$1_1 + 5 | 0] != 47 | HEAPU8[$1_1 + 6 | 0] != 47) { break block5 } $7_1 = 7; while (1) { $6_1 = HEAPU8[$1_1 + $7_1 | 0]; if (!(!$6_1 | ($6_1 | 0) == 47)) { $7_1 = $7_1 + 1 | 0; continue; } break; }; if (($7_1 | 0) == 7) { $6_1 = $7_1; break block5; } $6_1 = 16; if (($7_1 | 0) == 16) { if (!$2014(2272, $1_1 + 7 | 0, 9)) { break block5 } } HEAP32[$12_1 + 4 >> 2] = $1_1 + 7; HEAP32[$12_1 >> 2] = $7_1 - 7; $7_1 = 1; $6_1 = $61(6041, $12_1); break block9; } $18_1 = $1_1 + 2 | 0; $9_1 = 0; while (1) { $14 = $9_1 + $11_1 | 0; $19_1 = $14 - 1 | 0; $7_1 = HEAPU8[$1_1 + $6_1 | 0]; block10 : { block12 : { block18 : { block21 : { block16 : { label2 : while (1) { $13_1 = $7_1 & 255; if (!$13_1 | ($13_1 | 0) == 35) { break block10 } $10_1 = $6_1 + 1 | 0; block11 : { if (($13_1 | 0) != 37) { break block11 } $15_1 = HEAPU8[$1_1 + $10_1 | 0]; if (!(HEAPU8[$15_1 + 31424 | 0] & 8)) { break block11 } $17_1 = HEAPU8[$6_1 + $18_1 | 0]; if (!(HEAPU8[$17_1 + 31424 | 0] & 8)) { break block11 } $6_1 = $6_1 + 3 | 0; $7_1 = $17_1 + ($17_1 << 1 << 24 >> 24 >>> 7 & 9) & 15 | $15_1 + ($15_1 << 1 << 24 >> 24 >>> 7 & 9) << 4; if ($7_1 & 255) { break block12 } while (1) { $7_1 = HEAPU8[$1_1 + $6_1 | 0]; if (!$7_1 | ($7_1 | 0) == 35 | !$8_1 & ($7_1 | 0) == 63) { continue label2 } block15 : { if (($8_1 | 0) == 1) { if (($7_1 | 0) == 38 | ($7_1 | 0) == 61) { continue label2 } break block15; } if (($8_1 | 0) != 2) { break block15 } if (($7_1 | 0) == 38) { continue label2 } } $6_1 = $6_1 + 1 | 0; continue; }; } if (($8_1 | 0) != 1) { break block16 } if (!(($13_1 | 0) == 61 | ($13_1 | 0) == 38)) { $8_1 = 1; break block18; } if (!HEAPU8[$19_1 | 0]) { $6_1 = $10_1; while (1) { $8_1 = 1; $10_1 = $1_1 + $6_1 | 0; $7_1 = HEAPU8[$10_1 | 0]; if (!$7_1 | ($7_1 | 0) == 35 | HEAPU8[$10_1 - 1 | 0] == 38) { continue label2 } $6_1 = $6_1 + 1 | 0; continue; }; } break; }; $8_1 = 2; if (($13_1 | 0) != 38) { break block21 } $7_1 = 0; HEAP8[$14 | 0] = 0; $8_1 = 1; $9_1 = $9_1 + 1 | 0; break block18; } if (!(!$8_1 & ($13_1 | 0) == 63)) { if (($8_1 | 0) != 2 | ($13_1 | 0) != 38) { break block18 } } $8_1 = 1; } $7_1 = 0; } $6_1 = $10_1; } HEAP8[$9_1 + $11_1 | 0] = $7_1; $9_1 = $9_1 + 1 | 0; continue; } break; }; if (($8_1 | 0) == 1) { HEAP8[$14 | 0] = 0; $9_1 = $9_1 + 1 | 0; } $1_1 = $9_1 + $11_1 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; $7_1 = $48($11_1) + $11_1 | 0; while (1) { if (!HEAPU8[$7_1 + 1 | 0]) { break block25 } $1_1 = $7_1 + 1 | 0; $7_1 = $48($1_1); $6_1 = ($1_1 + $7_1 | 0) + 1 | 0; $10_1 = $48($6_1); block29 : { block30 : { block27 : { switch ($7_1 - 3 | 0) { case 0: if ($2014(5326, $1_1, 3)) { break block29 } $0_1 = $6_1; break block29; case 2: $8_1 = 14599; if ($2014(14599, $1_1, 5)) { break block29 } $9_1 = 393216; $13_1 = -393217; $1_1 = 51616; break block30; case 1: break block27; default: break block29; }; } if ((HEAPU8[$1_1 | 0] | HEAPU8[$1_1 + 1 | 0] << 8 | (HEAPU8[$1_1 + 2 | 0] << 16 | HEAPU8[$1_1 + 3 | 0] << 24)) != 1701080941) { break block29 } $9_1 = $16_1 & 135; $13_1 = -136; $8_1 = 4467; $1_1 = 51648; } $7_1 = 0; block34 : { block31 : { while (1) { $15_1 = ($7_1 << 3) + $1_1 | 0; $14 = HEAP32[$15_1 >> 2]; if (!$14) { break block31 } block33 : { if (($48($14) | 0) == ($10_1 | 0)) { if (!$2014($6_1, $14, $10_1)) { break block33 } } $7_1 = $7_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$15_1 + 4 >> 2]; if ($1_1) { break block34 } } HEAP32[$12_1 + 36 >> 2] = $6_1; HEAP32[$12_1 + 32 >> 2] = $8_1; $7_1 = 1; $6_1 = $61(8543, $12_1 + 32 | 0); break block9; } if (($9_1 | 0) < ($1_1 & -129)) { HEAP32[$12_1 + 52 >> 2] = $6_1; HEAP32[$12_1 + 48 >> 2] = $8_1; $7_1 = 3; $6_1 = $61(8668, $12_1 + 48 | 0); break block9; } $16_1 = $1_1 | $13_1 & $16_1; } $7_1 = $6_1 + $10_1 | 0; continue; }; } $6_1 = $31($8_1 + 8 | 0, 0); if (!$6_1) { break block4 } HEAP8[$6_1 | 0] = 0; HEAP8[$6_1 + 1 | 0] = 0; HEAP8[$6_1 + 2 | 0] = 0; HEAP8[$6_1 + 3 | 0] = 0; $11_1 = $6_1 + 4 | 0; if ($8_1) { wasm2js_memory_copy($11_1, $1_1, $8_1) } $1_1 = $8_1 + $11_1 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; $16_1 = $9_1 & -65; } $1_1 = $18($0_1); HEAP32[$3 >> 2] = $1_1; $7_1 = 0; if ($1_1) { break block37 } HEAP32[$12_1 + 16 >> 2] = $0_1; $7_1 = 1; $6_1 = $61(7685, $12_1 + 16 | 0); break block9; } $7_1 = 7; break block38; } HEAP32[$5_1 >> 2] = $6_1; $413($11_1); $11_1 = 0; } HEAP32[$2_1 >> 2] = $16_1; HEAP32[$4_1 >> 2] = $11_1; } $0_1 = $12_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $410($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $9_1 = global$0 - 112 | 0; $6_1 = $9_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; block4 : { block3 : { block2 : { if ($1_1) { $8_1 = HEAPU8[$1_1 | 0]; if (!$2073($1_1, 23214)) { $6_1 = !$8_1; break block2; } $6_1 = 0; if ($8_1) { break block3 } } $6_1 = 1; if (HEAPU8[$2_1 + 86 | 0] != 2) { break block3 } } $14 = 1; $16_1 = $4_1 | 2; break block4; } $8_1 = $5_1 & 128; $14 = $8_1 >>> 7 | 0; $16_1 = $8_1 >>> 6 | $4_1; } $7_1 = 7; $8_1 = $132(48, 0); block5 : { if (!$8_1) { break block5 } HEAP32[$8_1 + 36 >> 2] = 1; HEAP32[$8_1 >> 2] = $2_1; HEAP8[$8_1 + 8 | 0] = 0; HEAP32[$8_1 + 32 >> 2] = $8_1; block7 : { block15 : { block29 : { block20 : { block30 : { block31 : { block28 : { block21 : { block18 : { block23 : { block13 : { $12_1 = ($5_1 & 256) >>> 8 | 0 ? (($6_1 | $14) & 1 ? $5_1 & -769 | 512 : $5_1) : $5_1; if (!(!($12_1 & 64) & $14 | $6_1 | !($12_1 & 131072))) { $6_1 = HEAP32[$0_1 + 8 >> 2] + 1 | 0; $5_1 = $48($1_1) + 1 | 0; $4_1 = $30(($5_1 | 0) < ($6_1 | 0) ? $6_1 : $5_1, 0); HEAP8[$8_1 + 9 | 0] = 1; if (!$4_1) { break block7 } block9 : { if ($14) { if (!$5_1) { break block9 } wasm2js_memory_copy($4_1, $1_1, $5_1); break block9; } HEAP8[$4_1 | 0] = 0; $7_1 = FUNCTION_TABLE[HEAP32[$0_1 + 36 >> 2]]($0_1, $1_1, $6_1, $4_1) | 0; if (($7_1 | 512) == 512) { break block9 } $24($4_1); break block7; } $5_1 = 82708; block10 : { while (1) { $5_1 = HEAP32[$5_1 >> 2]; if (!$5_1) { break block10 } block12 : { $6_1 = HEAP32[$5_1 >> 2]; if (!($2073($4_1, HEAP32[$6_1 + 184 >> 2]) | HEAP32[$6_1 >> 2] != ($0_1 | 0))) { $6_1 = HEAP32[$2_1 + 20 >> 2]; while (1) { if (($6_1 | 0) <= 0) { break block12 } $6_1 = $6_1 - 1 | 0; $7_1 = HEAP32[(HEAP32[$2_1 + 16 >> 2] + ($6_1 << 4) | 0) + 4 >> 2]; if (!$7_1 | HEAP32[$7_1 + 4 >> 2] != ($5_1 | 0)) { continue } break; }; $24($4_1); $24($8_1); $7_1 = 19; break block5; } $5_1 = $5_1 + 72 | 0; continue; } break; }; HEAP32[$8_1 + 4 >> 2] = $5_1; HEAP32[$5_1 + 68 >> 2] = HEAP32[$5_1 + 68 >> 2] + 1; } $24($4_1); if ($5_1) { break block13 } } HEAP32[$9_1 + 16 >> 2] = 0; HEAP32[$9_1 + 20 >> 2] = 0; $5_1 = $132(92, 0); if (!$5_1) { $7_1 = 7; break block15; } HEAP32[$9_1 + 108 >> 2] = 4096; $13_1 = HEAP32[$0_1 + 4 >> 2]; $4_1 = 0; HEAP32[$5_1 >> 2] = 0; $17_1 = $16_1 & 2; if ($17_1) { if (!$1_1) { $19_1 = 1; $6_1 = 1; break block18; } if (!HEAPU8[$1_1 | 0]) { $4_1 = $1_1; $6_1 = 1; break block18; } $10_1 = $116(0, $1_1); if (!$10_1) { break block20 } $19_1 = 1; $20_1 = 1; $11_1 = $48($10_1); break block21; } if (!$1_1) { $19_1 = 1; break block23; } if (!HEAPU8[$1_1 | 0]) { $4_1 = $1_1; break block23; } $6_1 = HEAP32[$0_1 + 8 >> 2] + 1 | 0; $4_1 = $6_1 << 1; $10_1 = $30($4_1, $4_1 >> 31); if (!$10_1) { break block20 } HEAP8[$10_1 | 0] = 0; $7_1 = $12_1 & 16777216; $4_1 = FUNCTION_TABLE[HEAP32[$0_1 + 36 >> 2]]($0_1, $1_1, $6_1, $10_1) | 0; $11_1 = $48($10_1); $18_1 = ($48($1_1) + $1_1 | 0) + 1 | 0; $6_1 = $18_1; while (1) { if (HEAPU8[$6_1 | 0]) { $6_1 = ($2080($6_1) + $6_1 | 0) + 1 | 0; $6_1 = ($2080($6_1) + $6_1 | 0) + 1 | 0; continue; } break; }; $7_1 = ($4_1 | 0) == 512 ? ($7_1 ? 1550 : 0) : $4_1; if (!$7_1) { if (HEAP32[$0_1 + 8 >> 2] >= ($11_1 + 8 | 0)) { $4_1 = $1_1; $15_1 = ($6_1 - $18_1 | 0) + 1 | 0; break block28; } $7_1 = $75(62119); } $24($10_1); break block29; } if (!HEAPU8[$8_1 + 9 | 0]) { break block30 } break block31; } $6_1 = 0; } $20_1 = $6_1; $11_1 = 0; } $15_1 = 1; } $7_1 = 7; $13_1 = (($13_1 | 0) <= 64 ? 64 : $13_1) + 7 & 2147483640; $6_1 = $132((((Math_imul($11_1, 3) + ($13_1 << 1) | 0) + $15_1 | 0) + (HEAP32[$0_1 + 4 >> 2] + 7 & -8) | 0) + 322 | 0, 0); if (!$6_1) { $10(0, $10_1); break block29; } $7_1 = $6_1 + 296 | 0; HEAP32[$6_1 + 64 >> 2] = $7_1; HEAP32[$6_1 + 228 >> 2] = $6_1 + 240; $7_1 = $7_1 + (HEAP32[$0_1 + 4 >> 2] + 7 & -8) | 0; HEAP32[$6_1 + 72 >> 2] = $7_1; $7_1 = $7_1 + $13_1 | 0; HEAP32[$6_1 + 68 >> 2] = $7_1; $7_1 = $7_1 + $13_1 | 0; HEAP8[$7_1 | 0] = $6_1; HEAP8[$7_1 + 1 | 0] = $6_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $6_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $6_1 >>> 24; $7_1 = $7_1 + 8 | 0; HEAP32[$6_1 + 184 >> 2] = $7_1; block40 : { if ($11_1) { $13_1 = !$11_1; if (!$13_1) { wasm2js_memory_copy($7_1, $10_1, $11_1) } $7_1 = $7_1 + $11_1 | 0; block37 : { if ($18_1) { $7_1 = $7_1 + 1 | 0; if ($15_1) { wasm2js_memory_copy($7_1, $18_1, $15_1) } $7_1 = $7_1 + $15_1 | 0; break block37; } $7_1 = $7_1 + 2 | 0; } HEAP32[$6_1 + 188 >> 2] = $7_1; if (!$13_1) { wasm2js_memory_copy($7_1, $10_1, $11_1) } $7_1 = $7_1 + $11_1 | 0; HEAP8[$7_1 | 0] = 45; HEAP8[$7_1 + 1 | 0] = 106; HEAP8[$7_1 + 2 | 0] = 111; HEAP8[$7_1 + 3 | 0] = 117; HEAP8[$7_1 + 4 | 0] = 114; HEAP8[$7_1 + 5 | 0] = 110; HEAP8[$7_1 + 6 | 0] = 97; HEAP8[$7_1 + 7 | 0] = 108; $7_1 = $7_1 + 9 | 0; HEAP32[$6_1 + 236 >> 2] = $7_1; if (!$13_1) { wasm2js_memory_copy($7_1, $10_1, $11_1) } $7_1 = $7_1 + $11_1 | 0; HEAP8[$7_1 | 0] = 45; HEAP8[$7_1 + 1 | 0] = 119; HEAP8[$7_1 + 2 | 0] = 97; HEAP8[$7_1 + 3 | 0] = 108; $10(0, $10_1); break block40; } HEAP32[$6_1 + 236 >> 2] = 0; HEAP32[$6_1 + 188 >> 2] = 0; } HEAP32[$6_1 + 152 >> 2] = $12_1; HEAP32[$6_1 >> 2] = $0_1; $11_1 = 0; block48 : { block42 : { block46 : { if (!(!HEAPU8[$4_1 | 0] | $19_1)) { HEAP32[$9_1 + 104 >> 2] = 0; $7_1 = FUNCTION_TABLE[HEAP32[$0_1 + 24 >> 2]]($0_1, HEAP32[$6_1 + 184 >> 2], HEAP32[$6_1 + 64 >> 2], $12_1 & 17334143, $9_1 + 104 | 0) | 0; $0_1 = 1; $4_1 = HEAP32[$9_1 + 104 >> 2]; $11_1 = $4_1 >>> 7 & 1; HEAP8[$6_1 + 16 | 0] = $11_1; if ($7_1) { break block42 } $12_1 = $4_1 & 1; $4_1 = HEAP32[$6_1 + 64 >> 2]; $7_1 = HEAP32[$4_1 >> 2]; if ($7_1) { $0_1 = !(FUNCTION_TABLE[HEAP32[$7_1 + 48 >> 2]]($4_1) & 8192) } block44 : { if ($12_1) { break block44 } $504($6_1); $4_1 = HEAP32[$6_1 + 156 >> 2]; if ($4_1 >>> 0 <= HEAPU32[$9_1 + 108 >> 2]) { break block44 } HEAP32[$9_1 + 108 >> 2] = $4_1 >>> 0 >= 8192 ? 8192 : $4_1; } HEAP8[$6_1 + 13 | 0] = $77(HEAP32[$6_1 + 184 >> 2], 12019, 0); block45 : { if (!$0_1) { break block45 } if ($77(HEAP32[$6_1 + 184 >> 2], 14227, 0)) { break block45 } $10_1 = 0; break block46; } $12_1 = 1; } HEAP8[$6_1 + 13 | 0] = 1; HEAP8[$6_1 + 17 | 0] = 1; HEAP8[$6_1 + 18 | 0] = 4; $12_1 = $12_1 & 1; $10_1 = 1; } $7_1 = $425($6_1, $9_1 + 108 | 0, -1); if ($7_1) { break block42 } $7_1 = HEAP32[$9_1 + 108 >> 2]; $0_1 = HEAP32[$6_1 + 228 >> 2]; wasm2js_memory_fill($0_1, 0, 56); HEAP32[$0_1 + 48 >> 2] = $6_1; HEAP32[$0_1 + 44 >> 2] = $17_1 ? 0 : 19; $4_1 = 2; HEAP8[$0_1 + 41 | 0] = 2; HEAP8[$0_1 + 40 | 0] = !($17_1 >>> 1 | 0); HEAP32[$0_1 + 32 >> 2] = 1; HEAP32[$0_1 + 36 >> 2] = 88; HEAP32[$0_1 + 24 >> 2] = 100; HEAP32[$0_1 + 28 >> 2] = 1; $7_1 = $505($0_1, $7_1); if (!$7_1) { break block48 } } $0_1 = HEAP32[$6_1 + 64 >> 2]; $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[$1_1 + 4 >> 2]]($0_1) | 0; HEAP32[$0_1 >> 2] = 0; } $506(HEAP32[$6_1 + 224 >> 2]); $24($6_1); break block29; } HEAP32[$6_1 + 160 >> 2] = -2; HEAP8[$6_1 + 12 | 0] = $10_1; HEAP8[$6_1 + 19 | 0] = $10_1; HEAP8[$6_1 + 4 | 0] = $10_1; HEAP8[$6_1 + 15 | 0] = $20_1; HEAP8[$6_1 + 14 | 0] = $12_1; $0_1 = $16_1 & 1; HEAP8[$6_1 + 6 | 0] = !$0_1; $507($6_1, 35); HEAP32[$6_1 + 176 >> 2] = -1; HEAP32[$6_1 + 180 >> 2] = -1; HEAP16[$6_1 + 148 >> 1] = 88; $504($6_1); block51 : { if (!$0_1) { $4_1 = 4; if (!($11_1 | $17_1)) { break block51 } } HEAP8[$6_1 + 5 | 0] = $4_1; } HEAP32[$6_1 + 216 >> 2] = 20; HEAP32[$6_1 + 220 >> 2] = HEAP32[$6_1 + 44 >> 2] ? 6 : 7; HEAP32[$5_1 >> 2] = $6_1; $0_1 = HEAP32[$2_1 + 52 >> 2]; HEAP32[$6_1 + 136 >> 2] = HEAP32[$2_1 + 48 >> 2]; HEAP32[$6_1 + 140 >> 2] = $0_1; wasm2js_memory_fill($9_1, 0, 100); $0_1 = HEAP32[$6_1 + 64 >> 2]; $4_1 = HEAP32[$0_1 >> 2]; block53 : { if (!$4_1) { break block53 } $7_1 = FUNCTION_TABLE[HEAP32[$4_1 + 8 >> 2]]($0_1, $9_1, 100, 0, 0) | 0; if (($7_1 | 0) == 522) { break block53 } if ($7_1) { break block29 } } HEAP32[$5_1 + 4 >> 2] = $2_1; HEAP8[$5_1 + 16 | 0] = $16_1; $6_1 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 192 >> 2] = 21; HEAP32[$6_1 + 196 >> 2] = $5_1; $0_1 = HEAP32[$6_1 + 64 >> 2]; $4_1 = HEAP32[$0_1 >> 2]; if ($4_1) { FUNCTION_TABLE[HEAP32[$4_1 + 40 >> 2]]($0_1, 15, $6_1 + 192 | 0) | 0; $6_1 = HEAP32[$5_1 >> 2]; } HEAP32[$8_1 + 4 >> 2] = $5_1; HEAP32[$5_1 + 8 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 0; if (HEAPU8[$6_1 + 14 | 0]) { HEAP16[$5_1 + 24 >> 1] = HEAPU16[$5_1 + 24 >> 1] | 1 } $0_1 = HEAPU8[$9_1 + 17 | 0] << 16 | HEAPU8[$9_1 + 16 | 0] << 8; HEAP32[$5_1 + 36 >> 2] = $0_1; $4_1 = $5_1 + 36 | 0; block58 : { if (!(!($0_1 & $0_1 + 131071) & $0_1 - 65537 >>> 0 >= 4294902271)) { $0_1 = 0; HEAP32[$4_1 >> 2] = 0; if (!$1_1 | $14) { break block58 } HEAP8[$5_1 + 17 | 0] = 0; HEAP8[$5_1 + 18 | 0] = 0; break block58; } $0_1 = HEAPU8[$9_1 + 20 | 0]; HEAP16[$5_1 + 24 >> 1] = HEAPU16[$5_1 + 24 >> 1] | 2; $1_1 = HEAP32[$9_1 + 52 >> 2]; HEAP8[$5_1 + 17 | 0] = ($1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24)) != 0; $1_1 = HEAP32[$9_1 + 64 >> 2]; HEAP8[$5_1 + 18 | 0] = ($1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24)) != 0; } $7_1 = $425($6_1, $4_1, $0_1); if ($7_1) { break block29 } HEAP32[$5_1 + 68 >> 2] = 1; HEAP32[$5_1 + 40 >> 2] = HEAP32[$5_1 + 36 >> 2] - $0_1; if (!HEAPU8[$8_1 + 9 | 0]) { break block30 } HEAP32[$5_1 + 72 >> 2] = HEAP32[20677]; HEAP32[20677] = $5_1; } $6_1 = 0; $0_1 = HEAP32[$2_1 + 20 >> 2]; $0_1 = ($0_1 | 0) > 0 ? $0_1 : 0; while (1) { if (($0_1 | 0) == ($6_1 | 0)) { break block30 } $1_1 = HEAP32[(HEAP32[$2_1 + 16 >> 2] + ($6_1 << 4) | 0) + 4 >> 2]; if (!$1_1 | !HEAPU8[$1_1 + 9 | 0]) { $6_1 = $6_1 + 1 | 0; continue; } else { while (1) { $6_1 = $1_1; $1_1 = HEAP32[$6_1 + 28 >> 2]; if ($1_1) { continue } break; }; $0_1 = HEAP32[$8_1 + 4 >> 2]; if ($0_1 >>> 0 < HEAPU32[$6_1 + 4 >> 2]) { HEAP32[$8_1 + 28 >> 2] = 0; HEAP32[$8_1 + 24 >> 2] = $6_1; HEAP32[$6_1 + 28 >> 2] = $8_1; break block30; } block62 : { while (1) { $1_1 = $6_1; $6_1 = HEAP32[$6_1 + 24 >> 2]; if (!$6_1) { $2_1 = 0; $6_1 = $8_1; $7_1 = $1_1; $0_1 = 24; break block62; } if ($0_1 >>> 0 > HEAPU32[$6_1 + 4 >> 2]) { continue } break; }; HEAP32[$8_1 + 24 >> 2] = $6_1; $2_1 = $1_1; $7_1 = $8_1; $0_1 = 28; } HEAP32[$0_1 + $8_1 >> 2] = $2_1; HEAP32[$6_1 + 28 >> 2] = $7_1; HEAP32[$1_1 + 24 >> 2] = $8_1; } break; }; } HEAP32[$3 >> 2] = $8_1; $0_1 = HEAP32[$8_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$8_1 >> 2]; if (!HEAP32[$0_1 + 52 >> 2]) { $512($8_1, -2e3) } $7_1 = 0; $0_1 = HEAP32[HEAP32[$5_1 >> 2] + 64 >> 2]; $1_1 = HEAP32[$0_1 >> 2]; if (!$1_1) { break block5 } FUNCTION_TABLE[HEAP32[$1_1 + 40 >> 2]]($0_1, 30, $5_1 + 4 | 0) | 0; break block5; } $7_1 = 7; } $0_1 = HEAP32[$5_1 >> 2]; if (!$0_1) { break block15 } $513($0_1, 0); } $24($5_1); $24($8_1); HEAP32[$3 >> 2] = 0; break block5; } $24($8_1); } $0_1 = $9_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $411($0_1, $1_1) { var $2_1 = 0; block1 : { if ($1_1) { $2_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$2_1 + 52 >> 2]; if (!$1_1) { $1_1 = $270(0, 84, 0); HEAP32[$2_1 + 56 >> 2] = 22; HEAP32[$2_1 + 52 >> 2] = $1_1; } break block1; } $1_1 = $270(0, 84, 0); } if (!$1_1) { $106($0_1); return $1_1; } if (!HEAPU8[$1_1 + 76 | 0]) { wasm2js_memory_fill($1_1 + 8 | 0, 0, 64); HEAP8[$1_1 + 77 | 0] = 1; } return $1_1; } function $412($0_1, $1_1) { HEAP8[$0_1 + 84 | 0] = $1_1; HEAP32[$0_1 + 8 >> 2] = $414($0_1, $1_1, 33712, 0); $342($0_1, 1); } function $413($0_1) { if ($0_1) { $24($435($0_1) - 4 | 0) } } function $414($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; block2 : { if ($2_1) { block4 : { $6_1 = $0_1 + 432 | 0; $4_1 = $320($6_1, $2_1); if (!($4_1 | !$3)) { $5_1 = $48($2_1); $4_1 = $270($0_1, $5_1 + 61 | 0, 0); $3 = 0; if (!$4_1) { break block2 } HEAP8[$4_1 + 44 | 0] = 3; HEAP8[$4_1 + 24 | 0] = 2; HEAP8[$4_1 + 4 | 0] = 1; $3 = $4_1 + 60 | 0; HEAP32[$4_1 + 40 >> 2] = $3; HEAP32[$4_1 + 20 >> 2] = $3; HEAP32[$4_1 >> 2] = $3; $5_1 = $5_1 + 1 | 0; if ($5_1) { wasm2js_memory_copy($3, $2_1, $5_1) } $2_1 = $395($6_1, $3, $4_1); if (!$2_1) { break block4 } $106($0_1); $13($0_1, $2_1); return 0; } if ($4_1) { break block4 } return 0; } return (Math_imul($1_1, 20) + $4_1 | 0) - 20 | 0; } $3 = HEAP32[$0_1 + 8 >> 2]; } return $3; } function $416($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[HEAP32[$0_1 + 16 >> 2] + 12 >> 2]; HEAP8[$0_1 + 84 | 0] = HEAPU8[$2_1 + 77 | 0]; $4_1 = HEAP32[$0_1 + 24 >> 2]; block1 : { if (!(HEAP8[$2_1 + 78 | 0] & 1)) { $3 = $420($0_1, 0, $1_1, 0); if ($3) { break block1 } } $4_1 = $4_1 & 1; $2_1 = HEAP32[$0_1 + 20 >> 2]; while (1) { if (($2_1 | 0) >= 2) { $2_1 = $2_1 - 1 | 0; if (HEAP8[HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($2_1 << 4) | 0) + 12 >> 2] + 78 | 0] & 1) { continue } $3 = $420($0_1, $2_1, $1_1, 0); if (!$3) { continue } break block1; } break; }; $3 = 0; if ($4_1) { break block1 } HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] & -2; } return $3; } function $417($0_1) { var $1_1 = 0; $1_1 = 1; block : { if (!$67($0_1, 18339)) { break block } if (!$67($0_1, 20545)) { break block } $1_1 = !$67($0_1, 20551); } return $1_1; } function $418($0_1, $1_1) { if (HEAPU8[$0_1 + 10 | 0] & 4) { $0_1 = HEAP32[$0_1 >> 2]; return ($2080($0_1) + $0_1 | 0) + 1 | 0; } $0_1 = HEAPU8[$0_1 + 4 | 0]; if ($0_1 >>> 0 >= 16) { $1_1 = HEAP32[($0_1 >>> 2 & 60) + 76316 >> 2] } return $1_1; } function $419($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAPU16[$0_1 + 10 >> 1]; if ($2_1 & 512) { $1_1 = HEAP32[$0_1 >> 2]; while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if (HEAPU8[$0_1 | 0]) { continue } break; }; if ($2_1 & 4) { while (1) { $1_1 = HEAPU8[$0_1 + 1 | 0]; $0_1 = $0_1 + 1 | 0; if ($1_1) { continue } break; } } $1_1 = $0_1 + 1 | 0; } return $1_1; } function $420($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 112 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; HEAP8[$0_1 + 177 | 0] = 1; $5_1 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$4_1 + 100 >> 2] = 0; HEAP32[$4_1 + 96 >> 2] = 25245; HEAP32[$4_1 + 92 >> 2] = 24184; $8_1 = ($1_1 | 0) == 1 ? 9304 : 9323; HEAP32[$4_1 + 88 >> 2] = $8_1; HEAP32[$4_1 + 84 >> 2] = $8_1; HEAP32[$4_1 + 80 >> 2] = 14440; HEAP32[$4_1 + 32 >> 2] = 0; HEAP32[$4_1 + 28 >> 2] = $1_1; HEAP32[$4_1 + 20 >> 2] = $0_1; HEAP32[$4_1 + 40 >> 2] = 0; HEAP32[$4_1 + 44 >> 2] = 0; HEAP32[$4_1 + 36 >> 2] = $3; HEAP32[$4_1 + 24 >> 2] = $2_1; $706($4_1 + 20 | 0, $4_1, $4_1 + 80 | 0, $4_1); HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] & ($5_1 | -65); $3 = HEAP32[$4_1 + 32 >> 2]; block2 : { block : { if ($3) { break block } $7_1 = HEAP32[$0_1 + 16 >> 2]; $6_1 = $7_1 + ($1_1 << 4) | 0; $3 = HEAP32[$6_1 + 4 >> 2]; if (!$3) { $1_1 = HEAP32[$7_1 + 28 >> 2]; HEAP16[$1_1 + 78 >> 1] = HEAPU16[$1_1 + 78 >> 1] | 1; $3 = 0; break block2; } HEAP32[HEAP32[$3 + 4 >> 2] + 4 >> 2] = HEAP32[$3 >> 2]; block3 : { $9_1 = HEAPU8[$3 + 8 | 0]; if ($9_1) { break block3 } $3 = $143($3, 0, 0); if (!$3) { break block3 } $774($2_1, $0_1, $256($3)); break block; } $3 = 0; while (1) { if (!(($3 | 0) == 5)) { $5_1 = $3 + 1 | 0; $709(HEAP32[$6_1 + 4 >> 2], $5_1, ($4_1 + 48 | 0) + ($3 << 2) | 0); $3 = $5_1; continue; } break; }; block8 : { block6 : { if (HEAPU8[$0_1 + 35 | 0] & 2) { HEAP32[$4_1 - -64 >> 2] = 0; HEAP32[$4_1 + 56 >> 2] = 0; HEAP32[$4_1 + 60 >> 2] = 0; HEAP32[$4_1 + 48 >> 2] = 0; HEAP32[$4_1 + 52 >> 2] = 0; $3 = HEAP32[$6_1 + 12 >> 2]; HEAP32[$3 >> 2] = 0; break block6; } $5_1 = HEAP32[$4_1 + 64 >> 2]; $3 = HEAP32[$6_1 + 12 >> 2]; HEAP32[$3 >> 2] = HEAP32[$4_1 + 48 >> 2]; if (!$5_1) { break block6 } if (!(HEAPU8[$0_1 + 24 | 0] & 64 | $1_1)) { $3 = $5_1 & 3; $412($0_1, $3 ? $3 : 1); $3 = HEAP32[$6_1 + 12 >> 2]; break block6; } if (HEAPU8[$0_1 + 84 | 0] == ($5_1 & 3)) { break block6 } $774($2_1, $0_1, 13677); $3 = 1; break block8; } HEAP8[$3 + 77 | 0] = HEAPU8[$0_1 + 84 | 0]; if (!HEAP32[$3 + 80 >> 2]) { $5_1 = $3; $3 = HEAP32[$4_1 + 56 >> 2]; $3 = ($3 | 0) < 0 ? (($3 | 0) == -2147483648 ? 2147483647 : 0 - $3 | 0) : $3; $3 = $3 ? $3 : -2e3; HEAP32[$5_1 + 80 >> 2] = $3; $512(HEAP32[$6_1 + 4 >> 2], $3); $3 = HEAP32[$6_1 + 12 >> 2]; } $5_1 = HEAP32[$4_1 + 52 >> 2]; HEAP8[$3 + 76 | 0] = $5_1; block11 : { $10_1 = $5_1 & 255; if (!$10_1) { HEAP8[$3 + 76 | 0] = 1; break block11; } if ($10_1 >>> 0 < 5) { break block11 } $774($2_1, $0_1, 3611); $3 = 1; break block8; } if (!(($5_1 | 0) < 4 | $1_1)) { $3 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] & -3; HEAP32[$0_1 + 36 >> 2] = $3; } HEAP32[$4_1 + 44 >> 2] = HEAP32[HEAP32[HEAP32[$6_1 + 4 >> 2] + 4 >> 2] + 48 >> 2]; $2_1 = HEAP32[HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) >> 2]; HEAP32[$4_1 + 4 >> 2] = $8_1; HEAP32[$4_1 >> 2] = $2_1; $2_1 = $310($0_1, 15138, $4_1); $5_1 = HEAP32[$0_1 + 364 >> 2]; HEAP32[$0_1 + 364 >> 2] = 0; $3 = $97($0_1, $2_1, 4, $4_1 + 20 | 0, 0); HEAP32[$0_1 + 364 >> 2] = $5_1; $5_1 = HEAP32[$4_1 + 32 >> 2]; $10($0_1, $2_1); block15 : { block16 : { $3 = $3 ? $3 : $5_1; block14 : { if (!$3) { $705($0_1, $1_1); if (HEAPU8[$0_1 + 87 | 0]) { break block14 } break block15; } if (!HEAPU8[$0_1 + 87 | 0]) { break block16 } } $148($0_1); $7_1 = HEAP32[$0_1 + 16 >> 2]; $3 = 7; break block8; } if (!(HEAPU8[$0_1 + 35 | 0] & 8) | ($3 | 0) == 7) { break block8 } } $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]; HEAP16[$2_1 + 78 >> 1] = HEAPU16[$2_1 + 78 >> 1] | 1; $3 = 0; } if ($9_1) { break block } $775(HEAP32[(($1_1 << 4) + $7_1 | 0) + 4 >> 2]); } if (!$3) { break block2 } if (!(($3 | 0) != 3082 & ($3 | 0) != 7)) { $106($0_1) } $351($0_1, $1_1); } HEAP8[$0_1 + 177 | 0] = 0; $0_1 = $4_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $422($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$1_1 + 36 >> 2] - HEAP32[$1_1 + 40 >> 2] | 0; $1_1 = HEAPU8[$1_1 + 22 | 0]; return ($0_1 | 0) > ($1_1 | 0) ? $0_1 : $1_1; } function $424($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 84 >> 2]; if ($1_1) { $1_1 = $1_1 - 4 | 0; HEAP32[$0_1 + 84 >> 2] = $1_1; $506($1_1); HEAP32[$0_1 + 84 >> 2] = 0; } } function $425($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = global$0 - 16 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $5_1 = HEAP32[$1_1 >> 2]; block6 : { block3 : { block1 : { if (!(HEAP32[$0_1 + 28 >> 2] ? !HEAPU8[$0_1 + 15 | 0] : 1)) { break block1 } $3 = HEAP32[$0_1 + 228 >> 2]; if (!$5_1 | (HEAP32[$3 + 16 >> 2] | HEAP32[$3 + 20 >> 2]) | HEAP32[$0_1 + 168 >> 2] == ($5_1 | 0)) { break block1 } HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; block2 : { if (!HEAPU8[$0_1 + 17 | 0]) { break block2 } $3 = HEAP32[$0_1 + 64 >> 2]; $4_1 = HEAP32[$3 >> 2]; if (!$4_1) { break block2 } $3 = FUNCTION_TABLE[HEAP32[$4_1 + 24 >> 2]]($3, $6_1 + 8 | 0) | 0; if (!$3) { break block2 } $4_1 = 0; break block3; } $4_1 = $515($5_1 + 8 | 0); if (!$4_1) { $4_1 = 0; $3 = 7; break block3; } $3 = $4_1 + $5_1 | 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; $516($0_1); $3 = $505(HEAP32[$0_1 + 228 >> 2], $5_1); if ($3) { break block3 } $506(HEAP32[$0_1 + 224 >> 2]); HEAP32[$0_1 + 224 >> 2] = $4_1; $4_1 = HEAP32[$6_1 + 8 >> 2]; $3 = HEAP32[$6_1 + 12 >> 2]; HEAP32[$0_1 + 168 >> 2] = $5_1; HEAP32[$0_1 + 172 >> 2] = 0; $7_1 = $4_1; $4_1 = $4_1 + $5_1 | 0; $3 = ($7_1 >>> 0 > $4_1 >>> 0 ? $3 + 1 | 0 : $3) - 1 | 0; $4_1 = $4_1 - 1 | 0; $3 = ($4_1 | 0) != -1 ? $3 + 1 | 0 : $3; HEAP32[$0_1 + 28 >> 2] = __wasm_i64_sdiv($4_1, $3, $5_1, 0); HEAP32[$0_1 + 164 >> 2] = (HEAPU32[18884] / ($5_1 >>> 0) | 0) + 1; } HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 168 >> 2]; HEAP16[$0_1 + 150 >> 1] = ($2_1 | 0) < 0 ? HEAPU16[$0_1 + 150 >> 1] : $2_1; $3 = 0; break block6; } $506($4_1); HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 168 >> 2]; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $426($0_1) { var $1_1 = 0; $1_1 = $132(512, 0); if ($1_1) { HEAP32[$1_1 >> 2] = $0_1 } return $1_1; } function $427($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block3 : { block7 : { if ($0_1) { $2_1 = $1_1 - 1 | 0; block2 : { while (1) { if (HEAPU32[$0_1 >> 2] >= 4001) { $1_1 = HEAP32[$0_1 + 8 >> 2]; if (!$1_1) { break block2 } $3 = ($2_1 >>> 0) / ($1_1 >>> 0) | 0; $2_1 = $2_1 - Math_imul($3, $1_1) | 0; $3 = ($3 << 2) + $0_1 | 0; $0_1 = HEAP32[$3 + 12 >> 2]; if ($0_1) { continue } $0_1 = $426($1_1); HEAP32[$3 + 12 >> 2] = $0_1; if ($0_1) { continue } break block3; } break; }; $0_1 = ($2_1 >>> 3 | 0) + $0_1 | 0; HEAP8[$0_1 + 12 | 0] = HEAPU8[$0_1 + 12 | 0] | 1 << ($2_1 & 7); return 0; } $4_1 = $2_1 + 1 | 0; $3 = $0_1 + 12 | 0; $1_1 = ($2_1 >>> 0) % 125 | 0; $2_1 = HEAP32[$3 + ($1_1 << 2) >> 2]; block6 : { if ($2_1) { while (1) { if (($2_1 | 0) == ($4_1 | 0)) { return 0 } $1_1 = $1_1 + 1 | 0; $1_1 = $1_1 >>> 0 <= 124 ? $1_1 : 0; $2_1 = HEAP32[($1_1 << 2) + $3 >> 2]; if ($2_1) { continue } break; }; $2_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1 >>> 0 < 62) { break block6 } break block7; } $2_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1 >>> 0 >= 124) { break block7 } } HEAP32[$0_1 + 4 >> 2] = $2_1 + 1; HEAP32[($1_1 << 2) + $3 >> 2] = $4_1; } return 0; } $2_1 = $30(500, 0); if (!$2_1) { break block3 } wasm2js_memory_copy($2_1, $3, 500); $1_1 = 0; wasm2js_memory_fill($3, 0, 500); HEAP32[$0_1 + 8 >> 2] = (HEAP32[$0_1 >> 2] + 124 >>> 0) / 125; $3 = $427($0_1, $4_1); while (1) { if (!(($1_1 | 0) == 125)) { $4_1 = HEAP32[($1_1 << 2) + $2_1 >> 2]; if ($4_1) { $3 = $427($0_1, $4_1) | $3 } $1_1 = $1_1 + 1 | 0; continue; } break; }; $24($2_1); return $3; } return 7; } function $429($0_1, $1_1) { if (!$0_1) { return 0 } return $430($0_1, $1_1); } function $430($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { $1_1 = $1_1 - 1 | 0; if ($1_1 >>> 0 >= HEAPU32[$0_1 >> 2]) { break block } while (1) { $2_1 = HEAP32[$0_1 + 8 >> 2]; if ($2_1) { $3 = $2_1; $2_1 = ($1_1 >>> 0) / ($2_1 >>> 0) | 0; $1_1 = $1_1 - Math_imul($3, $2_1) | 0; $0_1 = HEAP32[(($2_1 << 2) + $0_1 | 0) + 12 >> 2]; if ($0_1) { continue } break block; } break; }; if (HEAPU32[$0_1 >> 2] <= 4e3) { return HEAPU8[(($1_1 >>> 3 | 0) + $0_1 | 0) + 12 | 0] >>> ($1_1 & 7) & 1 } $0_1 = $0_1 + 12 | 0; $2_1 = $1_1 + 1 | 0; while (1) { $1_1 = ($1_1 >>> 0) % 125 | 0; $3 = HEAP32[$0_1 + ($1_1 << 2) >> 2]; if (!$3) { break block } $1_1 = $1_1 + 1 | 0; if (($2_1 | 0) != ($3 | 0)) { continue } break; }; return 1; } return 0; } function $433($0_1, $1_1) { var $2_1 = 0, $3 = 0; block3 : { block2 : { if (!(!$1_1 & $0_1 >>> 0 <= 7)) { $2_1 = 40; while (1) if (!$1_1 & $0_1 >>> 0 >= 256 | ($1_1 | 0) != 0) { $0_1 = ($1_1 & 15) << 28 | $0_1 >>> 4; $1_1 = $1_1 >>> 4 | 0; $2_1 = $2_1 + 40 | 0; continue; } else { while (1) { if (!$1_1 & $0_1 >>> 0 < 16) { break block2 } $3 = $1_1; $1_1 = $1_1 >>> 1 | 0; $0_1 = ($3 & 1) << 31 | $0_1 >>> 1; $2_1 = $2_1 + 10 | 0; continue; } }; } $3 = 0; if (!$1_1 & $0_1 >>> 0 < 2) { break block3 } $2_1 = 40; while (1) { if (!$1_1 & $0_1 >>> 0 > 7 | $1_1) { break block2 } $1_1 = $1_1 << 1 | $0_1 >>> 31; $0_1 = $0_1 << 1; $2_1 = $2_1 - 10 | 0; continue; }; } $3 = (HEAPU16[(($0_1 & 7) << 1) + 57696 >> 1] + $2_1 | 0) - 10 | 0; } return $3 << 16 >> 16; } function $434($0_1) { var $1_1 = 0, $2_1 = 0; if ($0_1) { block1 : { if (!HEAP32[$0_1 + 8 >> 2]) { break block1 } $2_1 = $0_1 + 12 | 0; while (1) { if (($1_1 | 0) == 125) { break block1 } $434(HEAP32[($1_1 << 2) + $2_1 >> 2]); $1_1 = $1_1 + 1 | 0; continue; }; } $24($0_1); } } function $435($0_1) { var $1_1 = 0; while (1) { $1_1 = $0_1; $0_1 = $1_1 - 1 | 0; if (HEAPU8[$0_1 | 0] | HEAPU8[$1_1 - 2 | 0] | (HEAPU8[$1_1 - 3 | 0] | HEAPU8[$1_1 - 4 | 0])) { continue } break; }; return $1_1; } function $436($0_1, $1_1) { return ($437($0_1, 1, $1_1) | 0) != 0; } function $437($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block1 : { if (HEAPU8[$0_1 | 0] - 58 >>> 0 >= 4294967286) { $2_1 = $830($0_1); break block1; } $4_1 = $48($0_1); while (1) { if (($3 | 0) == 8) { break block1 } block2 : { if (HEAPU8[$3 + 51521 | 0] != ($4_1 | 0)) { break block2 } if ($68(HEAPU8[$3 + 51513 | 0] + 51488 | 0, $0_1, $4_1) | !!$1_1 & ($3 | -8) >>> 0 > 4294967293) { break block2 } $2_1 = HEAPU8[$3 + 51529 | 0]; break block1; } $3 = $3 + 1 | 0; continue; }; } return $2_1 & 255; } function $438($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block2 : { if (!(HEAPU8[$0_1 | 0] != 48 | (HEAPU8[$0_1 + 1 | 0] | 32) != 120)) { $2_1 = 2; while (1) { $3 = $2_1; $2_1 = $2_1 + 1 | 0; $4_1 = HEAPU8[$0_1 + $3 | 0]; if (($4_1 | 0) == 48) { continue } break; }; $2_1 = $3; while (1) { if (HEAPU8[$4_1 + 31424 | 0] & 8) { $6_1 = $6_1 << 4 | $5_1 >>> 28; $5_1 = ($4_1 << 1 << 24 >> 24 >>> 7 & 9) + $4_1 & 15 | $5_1 << 4; $2_1 = $2_1 + 1 | 0; $4_1 = HEAPU8[$2_1 + $0_1 | 0]; continue; } break; }; HEAP32[$1_1 >> 2] = $5_1; HEAP32[$1_1 + 4 >> 2] = $6_1; $1_1 = 2; if (($2_1 - $3 | 0) > 16) { break block2 } return HEAPU8[$0_1 + $2_1 | 0] != 0; } $3 = $0_1; $0_1 = $2086($0_1, 23244) & 1073741823; $1_1 = $305($3, $1_1, (HEAPU8[$3 + $0_1 | 0] != 0) + $0_1 | 0, 1); } return $1_1; } function $439($0_1) { var $1_1 = 0; $1_1 = 33508; $0_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] >> 2]; if (!(HEAPU8[$0_1 + 15 | 0] | HEAP32[$0_1 >> 2] == 76232)) { $1_1 = HEAP32[$0_1 + 184 >> 2] } return $1_1; } function $441($0_1, $1_1) { $1_1 = $43($0_1, $1_1); $0_1 = HEAP32[$0_1 + 528 >> 2]; HEAP32[$0_1 >> 2] = $1_1 + HEAP32[$0_1 >> 2]; } function $444($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return 33200; } function $445($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; $78($0_1); $446($0_1, 0); $2_1 = HEAP32[$0_1 + 8 >> 2]; block2 : { block1 : { if (HEAP32[$1_1 + 24 >> 2]) { $1_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$1_1 + 8 >> 2] = HEAP32[$2_1 + 32 >> 2]; HEAP32[$2_1 + 32 >> 2] = $1_1; HEAP32[$0_1 + 28 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = -1; break block1; } if (!$2_1) { break block2 } } $1_1 = HEAP32[$2_1 + 36 >> 2] - 1 | 0; HEAP32[$2_1 + 36 >> 2] = $1_1; if ($1_1) { break block2 } $447($0_1); $1_1 = HEAP32[$2_1 + 44 >> 2]; $3 = HEAP32[$2_1 + 48 >> 2]; block4 : { if ($3) { HEAP32[$3 + 44 >> 2] = $1_1; break block4; } HEAP32[20648] = $1_1; } if ($1_1) { HEAP32[$1_1 + 48 >> 2] = $3 } $24($2_1); } $448($0_1); return 0; } function $446($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $6_1 = HEAPU8[$0_1 + 16 | 0]; block : { if (($6_1 | 0) <= ($1_1 | 0)) { break block } $4_1 = HEAP32[$0_1 + 8 >> 2]; block3 : { if ($6_1 >>> 0 >= 2) { block2 : { if (($1_1 | 0) != 1) { break block2 } HEAP32[$2_1 + 16 >> 2] = 510; HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 >> 2] = 0; $3 = HEAP32[18884] + 2 | 0; HEAP32[$2_1 + 8 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $3 >> 31; if (!$457($0_1, $2_1)) { break block2 } HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $3 = 2314; break block; } HEAP32[$2_1 >> 2] = 2; HEAP32[$2_1 + 16 >> 2] = 2; HEAP32[$2_1 + 20 >> 2] = 0; $3 = HEAP32[18884]; HEAP32[$2_1 + 8 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $3 >> 31; if ($457($0_1, $2_1)) { break block3 } HEAP8[$4_1 + 28 | 0] = 1; } if (!$1_1) { $3 = HEAP32[$4_1 + 20 >> 2] - 1 | 0; HEAP32[$4_1 + 20 >> 2] = $3; $6_1 = 1; $5_1 = 0; block5 : { if ($3) { break block5 } $3 = $2_1 + 16 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 >> 2] = 2; if (!$457($0_1, $2_1)) { HEAP8[$4_1 + 28 | 0] = 0; $5_1 = 0; break block5; } HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $6_1 = 0; HEAP8[$4_1 + 28 | 0] = 0; HEAP8[$0_1 + 16 | 0] = 0; $5_1 = 2058; } $3 = $5_1; $5_1 = $4_1; $4_1 = HEAP32[$4_1 + 24 >> 2] - 1 | 0; HEAP32[$5_1 + 24 >> 2] = $4_1; if (!$4_1) { $447($0_1) } if (!$6_1) { break block } } HEAP8[$0_1 + 16 | 0] = $1_1; $3 = 0; break block; } HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $3 = 2058; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $447($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAP32[$2_1 + 32 >> 2]; while (1) { if ($1_1) { $3 = HEAP32[$1_1 + 8 >> 2]; $79($0_1, HEAP32[$1_1 >> 2], 39959); $24($1_1); $1_1 = $3; continue; } break; }; HEAP32[$2_1 + 32 >> 2] = 0; } function $448($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 12 >> 2]; if (($1_1 | 0) >= 0) { $79($0_1, $1_1, 40743); HEAP32[$0_1 + 12 >> 2] = -1; } $24(HEAP32[$0_1 + 28 >> 2]); wasm2js_memory_fill($0_1, 0, 52); } function $449($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $7_1 = $1_1; $6_1 = $2_1; while (1) { block6 : { $2011(HEAP32[$0_1 + 12 >> 2], $3, $4_1, 0); block4 : { block9 : { block8 : { block7 : { block5 : { if ((i64toi32_i32$HIGH_BITS | 0) >= 0) { $5_1 = FUNCTION_TABLE[HEAP32[18989]](HEAP32[$0_1 + 12 >> 2], $7_1, $6_1) | 0; block2 : { if (($6_1 | 0) == ($5_1 | 0)) { $5_1 = $6_1; break block2; } if (($5_1 | 0) < 0) { $9_1 = HEAP32[20691]; if (($9_1 | 0) == 27) { continue } HEAP32[$0_1 + 20 >> 2] = $9_1; $8_1 = 0; break block2; } if ($5_1) { break block4 } $5_1 = 0; } $3 = $5_1 + $8_1 | 0; if (($3 | 0) != ($2_1 | 0)) { break block5 } break block6; } $5_1 = HEAP32[20691]; HEAP32[$0_1 + 20 >> 2] = $5_1; if (($2_1 | 0) == -1) { break block6 } break block7; } if (($3 | 0) >= 0) { break block8 } $5_1 = HEAP32[$0_1 + 20 >> 2]; } $0_1 = 8458; if (($5_1 | 0) == 29 | ($5_1 | 0) == 60 | ($5_1 | 0) == 68) { break block9 } return 266; } HEAP32[$0_1 + 20 >> 2] = 0; $0_1 = $2_1 - $3 | 0; if ($0_1) { wasm2js_memory_fill($1_1 + $3 | 0, 0, $0_1) } $0_1 = 522; } return $0_1 | 0; } $7_1 = $5_1 + $7_1 | 0; $8_1 = $5_1 + $8_1 | 0; $6_1 = $6_1 - $5_1 | 0; $3 = $3 + $5_1 | 0; $4_1 = $3 >>> 0 < $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; return 0; } function $450($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0; while (1) { $5_1 = $451($0_1, $3, $4_1, $1_1, $2_1); $6_1 = ($5_1 | 0) >= ($2_1 | 0); if (!($6_1 | ($5_1 | 0) <= 0)) { $1_1 = $1_1 + $5_1 | 0; $2_1 = $2_1 - $5_1 | 0; $3 = $3 + $5_1 | 0; $4_1 = $3 >>> 0 < $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; if ($6_1) { return 0 } if (!(HEAP32[$0_1 + 20 >> 2] == 51 | ($5_1 | 0) >= 0)) { return 778 } HEAP32[$0_1 + 20 >> 2] = 0; return 13; } function $451($0_1, $1_1, $2_1, $3, $4_1) { return $469(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1, $3, $4_1, $0_1 + 20 | 0); } function $452($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = HEAP32[$0_1 + 40 >> 2]; if (($3 | 0) > 0) { $1_1 = $1_1 + $3 | 0; $2_1 = ($1_1 >>> 0 < $3 >>> 0 ? $2_1 + 1 | 0 : $2_1) - 1 | 0; $5_1 = $2_1 + 1 | 0; $4_1 = $2_1; $2_1 = $1_1 - 1 | 0; $4_1 = ($2_1 | 0) != -1 ? $5_1 : $4_1; $3 = __wasm_i64_srem($2_1, $4_1, $3, 0); $1_1 = $2_1 - $3 | 0; $2_1 = $4_1 - (i64toi32_i32$HIGH_BITS + ($2_1 >>> 0 < $3 >>> 0) | 0) | 0; } if (!$453(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1)) { return 0 } HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $76(1546, 13311, HEAP32[$0_1 + 32 >> 2], 42410); return 1546; } function $453($0_1, $1_1, $2_1) { var $3 = 0; while (1) { $3 = FUNCTION_TABLE[HEAP32[18983]]($0_1, $1_1, $2_1) | 0; if (($3 | 0) < 0 & HEAP32[20691] == 27) { continue } break; }; return $3; } function $454($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block1 : { if ($1993(HEAP32[$0_1 + 12 >> 2])) { HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $2_1 = 1034; $76(1034, 17607, HEAP32[$0_1 + 32 >> 2], 42365); break block1; } if (!(HEAPU8[$0_1 + 18 | 0] & 8)) { break block1 } if (!(FUNCTION_TABLE[HEAP32[19016]](HEAP32[$0_1 + 32 >> 2], $1_1 + 12 | 0) | 0)) { $1993(HEAP32[$1_1 + 12 >> 2]); $79($0_1, HEAP32[$1_1 + 12 >> 2], 42379); } HEAP16[$0_1 + 18 >> 1] = HEAPU16[$0_1 + 18 >> 1] & 65527; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $455($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 96 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (FUNCTION_TABLE[HEAP32[18980]](HEAP32[$0_1 + 12 >> 2], $2_1) | 0) { HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $4_1 = 1802; break block1; } $0_1 = HEAP32[$2_1 + 24 >> 2]; $5_1 = $0_1; $3 = HEAP32[$2_1 + 28 >> 2]; $0_1 = !$3 & ($0_1 | 0) == 1; HEAP32[$1_1 >> 2] = $0_1 ? 0 : $5_1; HEAP32[$1_1 + 4 >> 2] = $0_1 ? 0 : $3; } $0_1 = $2_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1 | 0; } function $456($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 32 | 0; $3 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $3; $3 = 0; $5_1 = HEAPU8[$0_1 + 16 | 0]; block : { if (($5_1 | 0) >= ($1_1 | 0)) { break block } block5 : { block17 : { block16 : { block12 : { block7 : { block11 : { block10 : { block8 : { block6 : { block3 : { $4_1 = HEAP32[$0_1 + 8 >> 2]; $6_1 = HEAPU8[$4_1 + 28 | 0]; block2 : { if (($6_1 | 0) != ($5_1 | 0)) { $3 = 5; if ($1_1 >>> 0 > 1) { break block } if ($6_1 >>> 0 <= 2) { break block2 } break block; } if (($1_1 | 0) != 1) { break block3 } } if (($6_1 - 1 & 255) >>> 0 <= 1) { HEAP8[$0_1 + 16 | 0] = 1; HEAP32[$4_1 + 20 >> 2] = HEAP32[$4_1 + 20 >> 2] + 1; HEAP32[$4_1 + 24 >> 2] = HEAP32[$4_1 + 24 >> 2] + 1; break block5; } $3 = 0; HEAP16[$2_1 + 2 >> 1] = 0; HEAP32[$2_1 + 16 >> 2] = 1; HEAP32[$2_1 + 20 >> 2] = 0; break block6; } HEAP16[$2_1 + 2 >> 1] = 0; HEAP32[$2_1 + 16 >> 2] = 1; HEAP32[$2_1 + 20 >> 2] = 0; if (($1_1 | 0) != 4) { break block7 } $3 = 1; if (($5_1 | 0) != 2) { break block8 } } HEAP16[$2_1 >> 1] = $3; $5_1 = HEAP32[18884]; HEAP32[$2_1 + 8 >> 2] = $5_1; HEAP32[$2_1 + 12 >> 2] = $5_1 >> 31; if ($457($0_1, $2_1)) { $3 = 5; $4_1 = HEAP32[20691]; $1_1 = $458($4_1); if (($1_1 | 0) == 5) { break block } HEAP32[$0_1 + 20 >> 2] = $4_1; $3 = $1_1; break block; } if (($1_1 | 0) != 4) { break block10 } HEAP8[$0_1 + 16 | 0] = 3; HEAP8[$4_1 + 28 | 0] = 3; if (!$3) { break block11 } } $3 = 5; if (HEAP32[$4_1 + 20 >> 2] > 1) { break block } HEAP16[$2_1 >> 1] = 1; $5_1 = 510; $3 = 2; break block12; } if ($3) { break block7 } } HEAP32[$2_1 + 16 >> 2] = 510; HEAP32[$2_1 + 20 >> 2] = 0; $3 = HEAP32[18884] + 2 | 0; HEAP32[$2_1 + 8 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $3 >> 31; $3 = 0; $5_1 = 0; if ($457($0_1, $2_1)) { $5_1 = HEAP32[20691]; $3 = $458($5_1); } HEAP32[$2_1 + 16 >> 2] = 1; HEAP32[$2_1 + 20 >> 2] = 0; HEAP16[$2_1 >> 1] = 2; $6_1 = HEAP32[18884]; HEAP32[$2_1 + 8 >> 2] = $6_1; HEAP32[$2_1 + 12 >> 2] = $6_1 >> 31; block15 : { if (!($3 | !$457($0_1, $2_1))) { $5_1 = HEAP32[20691]; $3 = 2058; break block15; } if (!$3) { break block16 } if (($3 | 0) == 5) { break block } } HEAP32[$0_1 + 20 >> 2] = $5_1; break block; } $3 = ($1_1 | 0) == 2; $5_1 = $3 ? 1 : 510; HEAP16[$2_1 >> 1] = 1; $3 = $3 ? 1 : 2; } HEAP32[$2_1 + 16 >> 2] = $5_1; HEAP32[$2_1 + 20 >> 2] = 0; $3 = HEAP32[18884] + $3 | 0; HEAP32[$2_1 + 8 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $3 >> 31; if (!$457($0_1, $2_1)) { break block17 } $3 = 5; $4_1 = HEAP32[20691]; $1_1 = $458($4_1); if (($1_1 | 0) == 5) { break block } HEAP32[$0_1 + 20 >> 2] = $4_1; $3 = $1_1; break block; } HEAP32[$4_1 + 20 >> 2] = 1; HEAP32[$4_1 + 24 >> 2] = HEAP32[$4_1 + 24 >> 2] + 1; } HEAP8[$0_1 + 16 | 0] = $1_1; HEAP8[$4_1 + 28 | 0] = $1_1; } $3 = 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $457($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 + -64 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if ((HEAPU16[$0_1 + 18 >> 1] & 3) == 1) { $1_1 = 0; $3 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$3 + 29 | 0]) { break block1 } HEAP32[$2_1 + 48 >> 2] = 510; HEAP32[$2_1 + 52 >> 2] = 0; HEAP32[$2_1 + 32 >> 2] = 1; $1_1 = HEAP32[18884] + 2 | 0; HEAP32[$2_1 + 40 >> 2] = $1_1; HEAP32[$2_1 + 44 >> 2] = $1_1 >> 31; $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$2_1 >> 2] = $2_1 + 32; $1_1 = FUNCTION_TABLE[HEAP32[18986]]($0_1, 13, $2_1) | 0; if (($1_1 | 0) < 0) { break block1 } HEAP8[$3 + 29 | 0] = 1; HEAP32[$3 + 24 >> 2] = HEAP32[$3 + 24 >> 2] + 1; break block1; } $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$2_1 + 16 >> 2] = $1_1; $1_1 = FUNCTION_TABLE[HEAP32[18986]]($0_1, 13, $2_1 + 16 | 0) | 0; } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $458($0_1) { var $1_1 = 0; $1_1 = 5; block : { block1 : { block2 : { switch ($0_1 - 6 | 0) { case 0: case 4: break block; case 1: case 2: case 3: break block1; default: break block2; }; } if (($0_1 | 0) == 2 | ($0_1 | 0) == 27 | (($0_1 | 0) == 46 | ($0_1 | 0) == 73)) { break block } if (($0_1 | 0) != 63) { break block1 } return 3; } $1_1 = 3850; } return $1_1; } function $459($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 48 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 + 8 >> 2]; $4_1 = 1; block3 : { block : { if (HEAPU8[$3 + 28 | 0] > 1) { break block } $4_1 = 0; if (HEAPU8[$3 + 29 | 0]) { break block } HEAP32[$2_1 + 32 >> 2] = 1; HEAP32[$2_1 + 36 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 1; $3 = HEAP32[18884] + 1 | 0; HEAP32[$2_1 + 24 >> 2] = $3; HEAP32[$2_1 + 28 >> 2] = $3 >> 31; $3 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$2_1 >> 2] = $2_1 + 16; if (FUNCTION_TABLE[HEAP32[18986]]($3, 12, $2_1) | 0) { HEAP32[$0_1 + 20 >> 2] = HEAP32[20691]; $3 = 3594; break block3; } $4_1 = HEAPU16[$2_1 + 16 >> 1] != 2; } $5_1 = $4_1; $3 = 0; } HEAP32[$1_1 >> 2] = $5_1; $0_1 = $2_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $460($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $4_1 = global$0 - 128 | 0; $6_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $6_1; $8_1 = 12; block1 : { block13 : { block11 : { block9 : { switch ($1_1 - 1 | 0) { default: block12 : { switch ($1_1 - 40 | 0) { case 0: break block11; case 3: break block12; default: break block1; }; } $8_1 = 0; FUNCTION_TABLE[HEAP32[18968]](HEAP32[$0_1 + 12 >> 2]) | 0; HEAP32[$0_1 + 12 >> 2] = -1; break block1; case 0: HEAP32[$2_1 >> 2] = HEAPU8[$0_1 + 16 | 0]; break block13; case 3: HEAP32[$2_1 >> 2] = HEAP32[$0_1 + 20 >> 2]; break block13; case 5: HEAP32[$0_1 + 40 >> 2] = HEAP32[$2_1 >> 2]; break block13; case 4: if (HEAP32[$0_1 + 40 >> 2] <= 0) { break block13 } $6_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; $8_1 = 0; if (FUNCTION_TABLE[HEAP32[18980]](HEAP32[$0_1 + 12 >> 2], $4_1 + 32 | 0) | 0) { $8_1 = 1802; break block1; } $1_1 = HEAP32[$0_1 + 40 >> 2]; $6_1 = $1_1 + $6_1 | 0; $5_1 = $2_1; $2_1 = $1_1 >> 31; $3 = $5_1 + $2_1 | 0; $3 = ($1_1 >>> 0 > $6_1 >>> 0 ? $3 + 1 | 0 : $3) - 1 | 0; $7_1 = $6_1 - 1 | 0; $3 = ($7_1 | 0) != -1 ? $3 + 1 | 0 : $3; $6_1 = __wasm_i64_srem($7_1, $3, $1_1, $2_1); $2_1 = $7_1 - $6_1 | 0; $11_1 = $3 - (i64toi32_i32$HIGH_BITS + ($6_1 >>> 0 > $7_1 >>> 0) | 0) | 0; $7_1 = $11_1; $12_1 = HEAP32[$4_1 + 60 >> 2]; $6_1 = $12_1; $14 = $2_1; $3 = HEAP32[$4_1 + 56 >> 2]; if (($7_1 | 0) <= ($6_1 | 0) & $2_1 >>> 0 <= $3 >>> 0 | ($6_1 | 0) > ($7_1 | 0)) { break block1 } $5_1 = $7_1 - 1 | 0; $7_1 = $2_1 - 1 | 0; $5_1 = ($7_1 | 0) != -1 ? $5_1 + 1 | 0 : $5_1; $9_1 = HEAP32[$4_1 + 64 >> 2]; $2_1 = $9_1 + $7_1 | 0; $6_1 = $5_1; $13_1 = $9_1 >> 31; $10_1 = $5_1 + $13_1 | 0; $10_1 = $2_1 >>> 0 < $9_1 >>> 0 ? $10_1 + 1 | 0 : $10_1; $5_1 = __wasm_i64_srem($3, $12_1, $9_1, $13_1) ^ -1; $1_1 = $5_1 + $3 | 0; $3 = (i64toi32_i32$HIGH_BITS ^ -1) + $12_1 | 0; $3 = $1_1 >>> 0 < $5_1 >>> 0 ? $3 + 1 | 0 : $3; while (1) { $5_1 = $3 + $13_1 | 0; $1_1 = $1_1 + $9_1 | 0; $5_1 = $1_1 >>> 0 < $9_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; if (($10_1 | 0) <= ($5_1 | 0) & $1_1 >>> 0 >= $2_1 >>> 0 | ($5_1 | 0) > ($10_1 | 0)) { break block1 } $3 = $1_1 >>> 0 < $14 >>> 0 & ($5_1 | 0) <= ($11_1 | 0) | ($5_1 | 0) < ($11_1 | 0); $1_1 = $3 ? $1_1 : $7_1; $3 = $3 ? $5_1 : $6_1; if (($451($0_1, $1_1, $3, 30822, 1) | 0) == 1) { continue } break; }; $8_1 = 778; break block1; case 9: $461($0_1, 4, $2_1); break block13; case 12: $461($0_1, 16, $2_1); break block13; case 11: HEAP32[$4_1 >> 2] = HEAP32[HEAP32[$0_1 + 4 >> 2] + 16 >> 2]; HEAP32[$2_1 >> 2] = $61(8932, $4_1); break block13; case 15: $8_1 = 0; $1_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; $1_1 = $31($1_1, $1_1 >> 31); if (!$1_1) { break block1 } $71(HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2], $1_1); HEAP32[$2_1 >> 2] = $1_1; break block1; case 1: case 2: case 6: case 7: case 8: case 10: case 13: case 14: case 16: case 17: case 18: break block1; case 19: break block9; }; } HEAP32[$2_1 >> 2] = $462($0_1); break block13; } $8_1 = 0; HEAP32[$2_1 >> 2] = 0; $0_1 = HEAP32[$0_1 + 36 >> 2]; if (!$0_1) { break block1 } $1_1 = HEAP32[$0_1 >> 2]; $0_1 = $4_1 + 56 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $0_1 = $4_1 + 48 | 0; HEAP32[$0_1 >> 2] = 5; HEAP32[$0_1 + 4 >> 2] = 0; $0_1 = $4_1 + 40 | 0; HEAP32[$0_1 >> 2] = 123; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$4_1 + 32 >> 2] = 0; HEAP32[$4_1 + 36 >> 2] = 0; HEAP16[$4_1 + 32 >> 1] = 1; $0_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$4_1 + 16 >> 2] = $4_1 + 32; if ((FUNCTION_TABLE[HEAP32[18986]]($0_1, 12, $4_1 + 16 | 0) | 0) < 0) { $8_1 = 3850; break block1; } HEAP32[$2_1 >> 2] = HEAPU16[$4_1 + 32 >> 1] != 2; break block1; } $8_1 = 0; } $0_1 = $4_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1 | 0; } function $461($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$2_1 >> 2]; if (($3 | 0) < 0) { HEAP32[$2_1 >> 2] = (HEAPU16[$0_1 + 18 >> 1] & $1_1) != 0; return; } if (!$3) { HEAP16[$0_1 + 18 >> 1] = HEAPU16[$0_1 + 18 >> 1] & ($1_1 ^ -1) << 24 >> 24; return; } HEAP16[$0_1 + 18 >> 1] = HEAPU16[$0_1 + 18 >> 1] | $1_1; } function $462($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 96 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = 0; block1 : { if (!HEAP32[$0_1 + 8 >> 2]) { break block1 } $2_1 = 1; if (FUNCTION_TABLE[HEAP32[18977]](HEAP32[$0_1 + 32 >> 2], $1_1) | 0) { break block1 } $0_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2] != HEAP32[$1_1 + 88 >> 2] | HEAP32[$1_1 + 92 >> 2] != HEAP32[$0_1 + 12 >> 2]; } $0_1 = $2_1; $1_1 = $1_1 + 96 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $463($0_1) { $0_1 = $0_1 | 0; $464($0_1); return HEAP32[$0_1 + 44 >> 2]; } function $464($0_1) { if (!HEAP32[$0_1 + 44 >> 2]) { HEAP32[$0_1 + 44 >> 2] = 4096; HEAP32[$0_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2] | HEAPU16[$0_1 + 18 >> 1] << 8 & 4096 | 32768; } } function $465($0_1) { $0_1 = $0_1 | 0; $464($0_1); return HEAP32[$0_1 + 48 >> 2]; } function $466($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0, wasm2js_i32$3 = 0, wasm2js_i32$4 = 0, wasm2js_i32$5 = 0, wasm2js_i32$6 = 0, wasm2js_i32$7 = 0; $10_1 = global$0 - 112 | 0; $6_1 = $10_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $13_1 = FUNCTION_TABLE[HEAP32[19040]]() | 0; $6_1 = HEAP32[$0_1 + 36 >> 2]; block3 : { block1 : { if ($6_1) { $5_1 = HEAP32[$6_1 >> 2]; break block1; } $9_1 = $31(16, 0); if (!$9_1) { $7_1 = 7; break block3; } HEAP32[$9_1 >> 2] = 0; HEAP32[$9_1 + 4 >> 2] = 0; $6_1 = $9_1 + 8 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; block4 : { $11_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$11_1 + 40 >> 2]; if ($5_1) { break block4 } $7_1 = HEAP32[$0_1 + 32 >> 2]; block6 : { if (FUNCTION_TABLE[HEAP32[18980]](HEAP32[$0_1 + 12 >> 2], $10_1 + 16 | 0) | 0) { $7_1 = 1802; break block6; } $8_1 = $2080($7_1); $6_1 = $8_1 + 74 | 0; $5_1 = $31($6_1, 0); if (!$5_1) { $7_1 = 7; break block6; } if ($6_1) { wasm2js_memory_fill($5_1, 0, $6_1) } $6_1 = $5_1 + 68 | 0; HEAP32[$5_1 + 8 >> 2] = $6_1; HEAP32[$10_1 >> 2] = $7_1; $8_1 = $63($8_1 + 6 | 0, $6_1, 11602, $10_1); HEAP32[$5_1 + 12 >> 2] = -1; $6_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$6_1 + 40 >> 2] = $5_1; HEAP32[$5_1 >> 2] = $6_1; if (HEAPU8[75548]) { HEAP32[$5_1 + 4 >> 2] = 8 } $7_1 = 0; if (HEAPU8[$11_1 + 29 | 0]) { break block4 } block11 : { if (!$77(HEAP32[$0_1 + 32 >> 2], 11589, 0)) { $7_1 = $74($8_1, 131138, HEAP32[$10_1 + 20 >> 2] & 511); HEAP32[$5_1 + 12 >> 2] = $7_1; break block11; } $7_1 = HEAP32[$5_1 + 12 >> 2]; } if (($7_1 | 0) < 0) { $7_1 = $74($8_1, 131072, HEAP32[$10_1 + 20 >> 2] & 511); HEAP32[$5_1 + 12 >> 2] = $7_1; if (($7_1 | 0) < 0) { $7_1 = $76($75(43342), 11401, $8_1, 43342); break block6; } HEAP8[$5_1 + 22 | 0] = 1; } $8_1 = HEAP32[$10_1 + 32 >> 2]; $6_1 = HEAP32[$10_1 + 28 >> 2]; if (!(FUNCTION_TABLE[HEAP32[19028]]() | 0)) { FUNCTION_TABLE[HEAP32[19025]]($7_1, $6_1, $8_1) | 0 } $7_1 = $467($0_1, $5_1); if (($7_1 | 0) == 1288 | !$7_1) { break block4 } } $468($0_1); $24($9_1); break block3; } HEAP32[$9_1 >> 2] = $5_1; HEAP32[$5_1 + 28 >> 2] = HEAP32[$5_1 + 28 >> 2] + 1; HEAP32[$0_1 + 36 >> 2] = $9_1; HEAP32[$9_1 + 4 >> 2] = HEAP32[$5_1 + 32 >> 2]; HEAP32[$5_1 + 32 >> 2] = $9_1; if ($7_1) { break block3 } } block16 : { if (HEAPU8[$5_1 + 23 | 0]) { $12_1 = $467($0_1, $5_1); if ($12_1) { break block16 } HEAP8[$5_1 + 23 | 0] = 0; } $12_1 = 0; $14 = (($13_1 | 0) <= 32768 ? 32768 : $13_1) >>> 15 | 0; $0_1 = $14 + $1_1 | 0; $9_1 = $0_1 - (($0_1 | 0) % ($14 | 0) | 0) | 0; if (($9_1 | 0) <= HEAPU16[$5_1 + 20 >> 1]) { break block16 } HEAP32[$5_1 + 16 >> 2] = $2_1; block20 : { block17 : { $0_1 = HEAP32[$5_1 + 12 >> 2]; if (($0_1 | 0) < 0) { break block17 } if (FUNCTION_TABLE[HEAP32[18980]]($0_1, $10_1 + 16 | 0) | 0) { $12_1 = 4874; break block16; } $8_1 = HEAP32[$10_1 + 44 >> 2]; $11_1 = Math_imul($2_1, $9_1); $6_1 = $11_1 >> 31; $0_1 = HEAP32[$10_1 + 40 >> 2]; if (($8_1 | 0) >= ($6_1 | 0) & $11_1 >>> 0 <= $0_1 >>> 0 | ($6_1 | 0) < ($8_1 | 0)) { break block17 } if (!$3) { break block16 } $3 = __wasm_i64_sdiv($0_1, $8_1, 4096, 0); $0_1 = ($11_1 | 0) / 4096 | 0; $6_1 = ($0_1 | 0) > ($3 | 0) ? $0_1 : $3; $11_1 = $6_1 >> 31; $0_1 = $3 >> 31; while (1) { if (($3 | 0) == ($6_1 | 0) & ($0_1 | 0) == ($11_1 | 0)) { break block17 } if (($469(HEAP32[$5_1 + 12 >> 2], $3 << 12 | 4095, $0_1 << 12 | $3 >>> 20, 30822, 1, $10_1 + 12 | 0) | 0) != 1) { break block20 } $3 = $3 + 1 | 0; $0_1 = $3 ? $0_1 : $0_1 + 1 | 0; continue; }; } $0_1 = $32(HEAP32[$5_1 + 24 >> 2], $9_1 << 2); if (!$0_1) { $12_1 = 3082; break block16; } HEAP32[$5_1 + 24 >> 2] = $0_1; $3 = Math_imul($2_1, $14); $7_1 = $3 >> 31; $0_1 = HEAPU16[$5_1 + 20 >> 1]; $11_1 = $2_1 >> 31; while (1) { $0_1 = $0_1 & 65535; if (($9_1 | 0) <= ($0_1 | 0)) { break block16 } $8_1 = HEAP32[$5_1 + 12 >> 2]; block23 : { if (($8_1 | 0) >= 0) { $13_1 = ((((((((wasm2js_i32$1 = 0, wasm2js_i32$2 = $3), wasm2js_i32$3 = HEAPU8[$5_1 + 22 | 0] ? 1 : 3), wasm2js_i32$4 = 1), wasm2js_i32$5 = $8_1), wasm2js_i32$6 = __wasm_i64_mul($0_1, 0, $2_1, $11_1)), wasm2js_i32$7 = i64toi32_i32$HIGH_BITS), wasm2js_i32$0 = HEAP32[19031]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0, wasm2js_i32$3 | 0, wasm2js_i32$4 | 0, wasm2js_i32$5 | 0, wasm2js_i32$6 | 0, wasm2js_i32$7 | 0) | 0); if (($13_1 | 0) != -1) { break block23 } $12_1 = 5386; $76(5386, 10036, HEAP32[$5_1 + 8 >> 2], 43513); break block16; } $13_1 = $31($3, $7_1); if (!$13_1) { $12_1 = 7; break block16; } if (!$3) { break block23 } wasm2js_memory_fill($13_1, 0, $3); } $8_1 = HEAPU16[$5_1 + 20 >> 1]; $6_1 = HEAP32[$5_1 + 24 >> 2] + ($8_1 << 2) | 0; $0_1 = 0; while (1) { if (!(($0_1 | 0) == ($14 | 0))) { HEAP32[$6_1 + ($0_1 << 2) >> 2] = Math_imul($0_1, $2_1) + $13_1; $0_1 = $0_1 + 1 | 0; continue; } break; }; $0_1 = $8_1 + $14 | 0; HEAP16[$5_1 + 20 >> 1] = $0_1; continue; }; } $12_1 = 4874; $76(4874, 13194, HEAP32[$5_1 + 8 >> 2], 43486); } $0_1 = 0; HEAP32[$4_1 >> 2] = ($1_1 | 0) < HEAPU16[$5_1 + 20 >> 1] ? HEAP32[HEAP32[$5_1 + 24 >> 2] + ($1_1 << 2) >> 2] : $0_1; $7_1 = $12_1 ? $12_1 : HEAPU8[$5_1 + 22 | 0] ? 8 : $12_1; } $0_1 = $10_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1 | 0; } function $467($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 48 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 + 32 >> 2] = 1; HEAP32[$2_1 + 36 >> 2] = 0; HEAP32[$2_1 + 24 >> 2] = 128; HEAP32[$2_1 + 28 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 1; $3 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$2_1 >> 2] = $2_1 + 16; block1 : { if (FUNCTION_TABLE[HEAP32[18986]]($3, 12, $2_1) | 0) { $3 = 3850; break block1; } $3 = 5; block3 : { block2 : { switch (HEAPU16[$2_1 + 16 >> 1] - 1 | 0) { case 0: break block1; case 1: break block2; default: break block3; }; } if (HEAPU8[$1_1 + 22 | 0]) { HEAP8[$1_1 + 23 | 0] = 1; $3 = 1288; break block1; } $3 = $471($0_1, 1, 128, 1); if ($3) { break block1 } if (!$453(HEAP32[$1_1 + 12 >> 2], 3, 0)) { break block3 } $3 = 4618; $76(4618, 13311, HEAP32[$1_1 + 8 >> 2], 43205); break block1; } $3 = $471($0_1, 0, 128, 1); } $0_1 = $2_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $468($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[HEAP32[$0_1 + 8 >> 2] + 40 >> 2]; if (!(!$1_1 | HEAP32[$1_1 + 28 >> 2])) { $2_1 = FUNCTION_TABLE[HEAP32[19040]]() | 0; $3 = (($2_1 | 0) <= 32768 ? 32768 : $2_1) >>> 15 | 0; $2_1 = 0; while (1) { if (!(HEAPU16[$1_1 + 20 >> 1] <= $2_1 >>> 0)) { block3 : { if (HEAP32[$1_1 + 12 >> 2] >= 0) { FUNCTION_TABLE[HEAP32[19034]](HEAP32[HEAP32[$1_1 + 24 >> 2] + ($2_1 << 2) >> 2], HEAP32[$1_1 + 16 >> 2]) | 0; break block3; } $24(HEAP32[HEAP32[$1_1 + 24 >> 2] + ($2_1 << 2) >> 2]); } $2_1 = $2_1 + $3 | 0; continue; } break; }; $24(HEAP32[$1_1 + 24 >> 2]); $2_1 = HEAP32[$1_1 + 12 >> 2]; if (($2_1 | 0) >= 0) { $79($0_1, $2_1, 43135); HEAP32[$1_1 + 12 >> 2] = -1; } HEAP32[HEAP32[$1_1 >> 2] + 40 >> 2] = 0; $24($1_1); } } function $469($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; $6_1 = $4_1 & 131071; block2 : { while (1) { block1 : { $2011($0_1, $1_1, $2_1, 0); if ((i64toi32_i32$HIGH_BITS | 0) < 0) { $4_1 = -1; break block1; } $4_1 = FUNCTION_TABLE[HEAP32[18998]]($0_1, $3, $6_1) | 0; if (($4_1 | 0) >= 0) { break block2 } if (HEAP32[20691] == 27) { continue } } break; }; HEAP32[$5_1 >> 2] = HEAP32[20691]; } return $4_1; } function $470($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = 5130; block : { $5_1 = HEAP32[$0_1 + 36 >> 2]; if (!$5_1) { break block } $6_1 = HEAP32[$5_1 >> 2]; if (!$6_1) { break block } $7_1 = $1_1 + $2_1 | 0; $8_1 = (1 << $7_1) + (-1 << $1_1) | 0; $6_1 = $6_1 + 36 | 0; block6 : { block10 : { block9 : { block3 : { block4 : { block2 : { if ($3 & 1) { $4_1 = HEAPU16[$5_1 + 10 >> 1]; if ($8_1 & ($4_1 | HEAPU16[$5_1 + 12 >> 1])) { break block2 } } $4_1 = 0; switch ($3 - 6 | 0) { case 0: break block3; case 4: break block4; default: break block; }; } block5 : { if (!($3 & 4)) { break block5 } $3 = $6_1 + ($1_1 << 2) | 0; $7_1 = HEAP32[$3 >> 2]; if (($7_1 | 0) < 2) { break block5 } HEAP32[$3 >> 2] = $7_1 - 1; HEAP16[$5_1 + 10 >> 1] = $4_1 & ($8_1 ^ -1); break block6; } $4_1 = $471($0_1, 2, $1_1 + 120 | 0, $2_1); if ($4_1) { break block } $0_1 = $2_1 << 2; if ($0_1) { wasm2js_memory_fill($6_1 + ($1_1 << 2) | 0, 0, $0_1) } $0_1 = $8_1 ^ -1; HEAP16[$5_1 + 10 >> 1] = $0_1 & HEAPU16[$5_1 + 10 >> 1]; HEAP16[$5_1 + 12 >> 1] = $0_1 & HEAPU16[$5_1 + 12 >> 1]; return 0; } $3 = ($1_1 | 0) > ($7_1 | 0) ? $1_1 : $7_1; $4_1 = $1_1; while (1) { if (($3 | 0) != ($4_1 | 0)) { $7_1 = $4_1 << 2; $4_1 = $4_1 + 1 | 0; if (!HEAP32[$6_1 + $7_1 >> 2]) { continue } break block9; } break; }; $4_1 = $471($0_1, 1, $1_1 + 120 | 0, $2_1); if ($4_1) { break block } HEAP16[$5_1 + 12 >> 1] = HEAPU16[$5_1 + 12 >> 1] | $8_1; while (1) { if (($1_1 | 0) == ($3 | 0)) { break block6 } HEAP32[$6_1 + ($1_1 << 2) >> 2] = -1; $1_1 = $1_1 + 1 | 0; continue; }; } $3 = HEAPU16[$5_1 + 10 >> 1]; if ($8_1 & $3) { break block } $6_1 = $6_1 + ($1_1 << 2) | 0; $4_1 = HEAP32[$6_1 >> 2]; if (($4_1 | 0) >= 0) { break block10 } } return 5; } if (!$4_1) { $4_1 = $471($0_1, 0, $1_1 + 120 | 0, $2_1); if ($4_1) { break block } $4_1 = HEAP32[$6_1 >> 2]; $3 = HEAPU16[$5_1 + 10 >> 1]; } HEAP16[$5_1 + 10 >> 1] = $3 | $8_1; HEAP32[$6_1 >> 2] = $4_1 + 1; } return 0; } return $4_1 | 0; } function $471($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 48 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $0_1 = HEAP32[HEAP32[HEAP32[$0_1 + 8 >> 2] + 40 >> 2] + 12 >> 2]; if (($0_1 | 0) >= 0) { HEAP16[$4_1 + 16 >> 1] = $1_1; HEAP32[$4_1 + 32 >> 2] = $3; HEAP32[$4_1 + 36 >> 2] = $3 >> 31; HEAP32[$4_1 + 24 >> 2] = $2_1; HEAP32[$4_1 + 28 >> 2] = $2_1 >> 31; HEAP32[$4_1 >> 2] = $4_1 + 16; HEAP16[$4_1 + 18 >> 1] = 0; $5_1 = (FUNCTION_TABLE[HEAP32[18986]]($0_1, 13, $4_1) | 0) == -1 ? 5 : 0; } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $473($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = HEAP32[$0_1 + 36 >> 2]; block : { if (!$3) { break block } $4_1 = HEAP32[$3 >> 2]; $2_1 = $4_1 + 32 | 0; while (1) { $6_1 = $2_1; $5_1 = HEAP32[$2_1 >> 2]; $2_1 = $5_1 + 4 | 0; if (($3 | 0) != ($5_1 | 0)) { continue } break; }; HEAP32[$6_1 >> 2] = HEAP32[$3 + 4 >> 2]; $24($3); HEAP32[$0_1 + 36 >> 2] = 0; $2_1 = HEAP32[$4_1 + 28 >> 2] - 1 | 0; HEAP32[$4_1 + 28 >> 2] = $2_1; if ($2_1) { break block } if (!(!$1_1 | HEAP32[$4_1 + 12 >> 2] < 0)) { FUNCTION_TABLE[HEAP32[19013]](HEAP32[$4_1 + 8 >> 2]) | 0 } $468($0_1); } return 0; } function $474($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; HEAP32[$4_1 >> 2] = 0; return 0; } function $475($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; return 0; } function $476($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 >> 2] = $2_1; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!($1_1 & 64)) { $4_1 = 0; if (($1_1 & 4259840) != 4259840) { break block1 } } HEAP32[$2_1 + 12 >> 2] = $3 + 4; $4_1 = HEAP32[$3 >> 2]; } HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = 0; $1_1 = $2087(fimport$19(-100, $0_1 | 0, $1_1 | 32768, $2_1 | 0) | 0); $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $477($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 544 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 >> 2] = $0_1; $3 = $63(512, $2_1 + 16 | 0, 8932, $2_1); $0_1 = $2080($3); block1 : { block : { while (1) { if (($0_1 | 0) <= 0) { break block } $4_1 = $0_1 + $3 | 0; $0_1 = $0_1 - 1 | 0; if (HEAPU8[$4_1 | 0] != 47) { continue } break; }; HEAP8[$4_1 | 0] = 0; break block1; } if (HEAPU8[$3 | 0] != 47) { HEAP8[$3 | 0] = 46 } HEAP8[$3 + 1 | 0] = 0; } $0_1 = 0; $4_1 = $1_1; $1_1 = $74($3, 0, 0); HEAP32[$4_1 >> 2] = $1_1; if (($1_1 | 0) < 0) { $0_1 = $76($75(42324), 1134, $3, 42324) } $1_1 = $2_1 + 544 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1 | 0; } function $478() { var $0_1 = 0, $1_1 = 0; $1_1 = HEAP16[37366]; __inlined_func$2088$79 : { if (!$1_1) { HEAP32[20691] = 28; $0_1 = -1; break __inlined_func$2088$79; } block3 : { block2 : { if (($1_1 | 0) > -2) { break block2 } $0_1 = 200809; block10 : { switch (($1_1 & 255) - 1 | 0) { case 1: $0_1 = 131072; break __inlined_func$2088$79; case 2: $0_1 = 32768; break __inlined_func$2088$79; case 3: $0_1 = 65536; break __inlined_func$2088$79; case 4: case 10: $0_1 = 2147483647; break __inlined_func$2088$79; case 5: case 6: $0_1 = 1; break __inlined_func$2088$79; case 7: case 8: $0_1 = fimport$24() >>> 16 | 0; break __inlined_func$2088$79; case 9: break block10; case 0: break block3; default: break block2; }; } $0_1 = 0; break __inlined_func$2088$79; } $0_1 = $1_1; } } return $0_1 | 0; } function $479($0_1) { $0_1 = $0_1 | 0; $448($0_1); return 0; } function $480($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return 0; } function $482($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP32[$1_1 >> 2] = 0; return 0; } function $483($0_1) { $0_1 = $0_1 | 0; $484($0_1, 0); $24(HEAP32[$0_1 + 24 >> 2]); $448($0_1); return 0; } function $484($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; block : { if (HEAPU8[$0_1 + 16 | 0] == ($1_1 | 0)) { break block } if (($1_1 | 0) == 1) { HEAP8[$0_1 + 16 | 0] = 1; return 0; } if ((FUNCTION_TABLE[HEAP32[19022]](HEAP32[$0_1 + 24 >> 2]) | 0) < 0) { $1_1 = HEAP32[20691]; if (($1_1 | 0) == 44) { break block } HEAP32[$0_1 + 20 >> 2] = $1_1; return 2058; } HEAP8[$0_1 + 16 | 0] = 0; } return 0; } function $485($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 24 >> 2]; if (HEAPU8[$0_1 + 16 | 0]) { HEAP8[$0_1 + 16 | 0] = $1_1; $0_1 = global$0 - 32 | 0; if ($0_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $2087(fimport$26(-100, $2_1 | 0, 0, 0) | 0); $0_1 = $0_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } $2_1 = FUNCTION_TABLE[HEAP32[19019]]($2_1, 511) | 0; block2 : { if (($2_1 | 0) < 0) { $2_1 = 5; $1_1 = HEAP32[20691]; if (($1_1 | 0) == 20) { break block2 } $3 = $458($1_1); if (($3 | 0) == 5) { break block2 } HEAP32[$0_1 + 20 >> 2] = $1_1; return $3 | 0; } HEAP8[$0_1 + 16 | 0] = $1_1; } return $2_1 | 0; } function $486($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; if (!HEAPU8[$0_1 + 16 | 0]) { $2_1 = !(FUNCTION_TABLE[HEAP32[18971]](HEAP32[$0_1 + 24 >> 2], 0) | 0) } HEAP32[$1_1 >> 2] = $2_1; return 0; } function $487($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return 33276; } function $488($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return 33352; } function $489($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; block : { if (!HEAP32[$1_1 + 52 >> 2]) { break block } $0_1 = 0; $3 = HEAP32[20650]; $5_1 = ($3 | 0) > 0 ? $3 : 0; $4_1 = HEAP32[20651]; while (1) { if (($0_1 | 0) == ($5_1 | 0)) { break block } $2_1 = $0_1 << 2; $0_1 = $0_1 + 1 | 0; $2_1 = $4_1 + $2_1 | 0; if (HEAP32[$2_1 >> 2] != ($1_1 | 0)) { continue } break; }; if (HEAP32[$1_1 + 48 >> 2] != 1) { break block } $0_1 = $3 - 1 | 0; HEAP32[20650] = $0_1; HEAP32[$2_1 >> 2] = HEAP32[($0_1 << 2) + $4_1 >> 2]; if ($0_1) { break block } $24($4_1); HEAP32[20651] = 0; } $0_1 = HEAP32[$1_1 + 48 >> 2]; HEAP32[$1_1 + 48 >> 2] = $0_1 - 1; if (($0_1 | 0) <= 1) { if (HEAP8[$1_1 + 36 | 0] & 1) { $24(HEAP32[$1_1 + 24 >> 2]) } $24($1_1); } return 0; } function $490($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = ($2_1 >> 31) + $4_1 | 0; $6_1 = HEAP32[$0_1 + 4 >> 2]; $0_1 = $6_1; $8_1 = HEAP32[$0_1 >> 2]; $7_1 = $2_1 + $3 | 0; $5_1 = $7_1 >>> 0 < $2_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; $0_1 = HEAP32[$0_1 + 4 >> 2]; block2 : { if (!(($5_1 | 0) <= ($0_1 | 0) & $8_1 >>> 0 >= $7_1 >>> 0 | ($0_1 | 0) > ($5_1 | 0))) { if ($2_1) { wasm2js_memory_fill($1_1, 0, $2_1) } $2_1 = 522; $5_1 = HEAP32[$6_1 + 4 >> 2]; $0_1 = HEAP32[$6_1 >> 2]; if (($4_1 | 0) >= ($5_1 | 0) & $3 >>> 0 >= $0_1 >>> 0 | ($4_1 | 0) > ($5_1 | 0)) { break block2 } $0_1 = $0_1 - $3 | 0; if (!$0_1) { break block2 } wasm2js_memory_copy($1_1, $3 + HEAP32[$6_1 + 24 >> 2] | 0, $0_1); return 522; } if ($2_1) { wasm2js_memory_copy($1_1, HEAP32[$6_1 + 24 >> 2] + $3 | 0, $2_1) } $2_1 = 0; } return $2_1 | 0; } function $491($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; $8_1 = HEAP32[$5_1 + 36 >> 2]; if ($8_1 & 4) { return 778 } $0_1 = ($2_1 >> 31) + $4_1 | 0; $10_1 = $2_1 + $3 | 0; $0_1 = $10_1 >>> 0 < $2_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; $7_1 = HEAP32[$5_1 + 4 >> 2]; $6_1 = HEAP32[$5_1 >> 2]; block3 : { if (!(($0_1 | 0) <= ($7_1 | 0) & $6_1 >>> 0 >= $10_1 >>> 0 | ($0_1 | 0) < ($7_1 | 0))) { $9_1 = HEAP32[$5_1 + 12 >> 2]; if (!(($9_1 | 0) >= ($0_1 | 0) & HEAPU32[$5_1 + 8 >> 2] >= $10_1 >>> 0 | ($0_1 | 0) < ($9_1 | 0))) { $7_1 = 13; if (!($8_1 & 2) | HEAP32[$5_1 + 32 >> 2] > 0) { break block3 } $6_1 = HEAP32[$5_1 + 16 >> 2]; $8_1 = HEAP32[$5_1 + 20 >> 2]; if ($6_1 >>> 0 < $10_1 >>> 0 & ($8_1 | 0) <= ($0_1 | 0) | ($0_1 | 0) > ($8_1 | 0)) { break block3 } $9_1 = $10_1 << 1; $7_1 = $9_1; $11_1 = $6_1; $9_1 = $6_1 >>> 0 > $9_1 >>> 0; $6_1 = $0_1 << 1 | $10_1 >>> 31; $9_1 = $9_1 & ($8_1 | 0) >= ($6_1 | 0) | ($6_1 | 0) < ($8_1 | 0); $7_1 = $9_1 ? $7_1 : $11_1; $6_1 = $9_1 ? $6_1 : $8_1; $8_1 = $33(HEAP32[$5_1 + 24 >> 2], $7_1, $6_1); if (!$8_1) { return 3082 } HEAP32[$5_1 + 8 >> 2] = $7_1; HEAP32[$5_1 + 12 >> 2] = $6_1; HEAP32[$5_1 + 24 >> 2] = $8_1; $7_1 = HEAP32[$5_1 + 4 >> 2]; $6_1 = HEAP32[$5_1 >> 2]; } block5 : { if (($4_1 | 0) <= ($7_1 | 0) & $3 >>> 0 <= $6_1 >>> 0 | ($4_1 | 0) < ($7_1 | 0)) { break block5 } $4_1 = $3 - $6_1 | 0; if (!$4_1) { break block5 } wasm2js_memory_fill($6_1 + HEAP32[$5_1 + 24 >> 2] | 0, 0, $4_1); } HEAP32[$5_1 >> 2] = $10_1; HEAP32[$5_1 + 4 >> 2] = $0_1; } if ($2_1) { wasm2js_memory_copy(HEAP32[$5_1 + 24 >> 2] + $3 | 0, $1_1, $2_1) } $7_1 = 0; } return $7_1 | 0; } function $492($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = 11; $0_1 = HEAP32[$0_1 + 4 >> 2]; $4_1 = HEAP32[$0_1 + 4 >> 2]; if (!($1_1 >>> 0 > HEAPU32[$0_1 >> 2] & ($4_1 | 0) <= ($2_1 | 0) | ($2_1 | 0) > ($4_1 | 0))) { HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1; $3 = 0; } return $3 | 0; } function $494($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; return 0; } function $495($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; block5 : { $3 = HEAP32[$0_1 + 8 >> 2]; if (($1_1 | 0) > ($3 | 0)) { $2_1 = HEAP32[$0_1 + 4 >> 2]; if (!(!(HEAPU8[$2_1 + 36 | 0] & 4) | ($1_1 | 0) < 2)) { return 8 } block6 : { block4 : { switch ($1_1 - 1 | 0) { case 0: if (HEAP32[$2_1 + 44 >> 2] > 0) { break block5 } HEAP32[$2_1 + 40 >> 2] = HEAP32[$2_1 + 40 >> 2] + 1; break block6; case 1: case 2: if (($3 | 0) != 1) { break block6 } if (HEAP32[$2_1 + 44 >> 2] > 0) { break block5 } HEAP32[$2_1 + 44 >> 2] = 1; break block6; default: break block4; }; } if (HEAP32[$2_1 + 40 >> 2] > 1) { break block5 } if (($3 | 0) != 1) { break block6 } HEAP32[$2_1 + 44 >> 2] = 1; } HEAP32[$0_1 + 8 >> 2] = $1_1; } return 0; } return 5; } function $496($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 + 8 >> 2]; if (($1_1 | 0) < ($3 | 0)) { $2_1 = HEAP32[$0_1 + 4 >> 2]; block2 : { if (($1_1 | 0) == 1) { HEAP32[$2_1 + 44 >> 2] = HEAP32[$2_1 + 44 >> 2] - 1; break block2; } if (($3 | 0) >= 2) { HEAP32[$2_1 + 44 >> 2] = HEAP32[$2_1 + 44 >> 2] - 1 } HEAP32[$2_1 + 40 >> 2] = HEAP32[$2_1 + 40 >> 2] - 1; } HEAP32[$0_1 + 8 >> 2] = $1_1; } return 0; } function $497($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $3; $5_1 = HEAP32[$0_1 + 4 >> 2]; block1 : { block2 : { if (($1_1 | 0) != 36) { $3 = 12; if (($1_1 | 0) != 12) { break block1 } $0_1 = HEAP32[$5_1 + 24 >> 2]; $1_1 = HEAP32[$5_1 + 4 >> 2]; HEAP32[$4_1 + 8 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$4_1 + 12 >> 2] = $1_1; HEAP32[$4_1 >> 2] = $0_1; HEAP32[$2_1 >> 2] = $61(25702, $4_1); break block2; } $1_1 = HEAP32[$2_1 >> 2]; $0_1 = HEAP32[$5_1 >> 2]; $6_1 = HEAP32[$2_1 + 4 >> 2]; $3 = HEAP32[$5_1 + 4 >> 2]; block4 : { if (!($1_1 >>> 0 < $0_1 >>> 0 & ($6_1 | 0) <= ($3 | 0) | ($3 | 0) > ($6_1 | 0))) { $0_1 = $1_1; $3 = $6_1; break block4; } if (($6_1 | 0) >= 0) { break block4 } $0_1 = HEAP32[$5_1 + 16 >> 2]; $3 = HEAP32[$5_1 + 20 >> 2]; } HEAP32[$5_1 + 16 >> 2] = $0_1; HEAP32[$5_1 + 20 >> 2] = $3; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $3; } $3 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $498($0_1) { $0_1 = $0_1 | 0; return 5633; } function $499($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0; $2_1 = $2_1 + ($3 >> 31) | 0; $5_1 = $3; $3 = $1_1 + $3 | 0; $2_1 = $5_1 >>> 0 > $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; $0_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = HEAPU32[$0_1 >> 2] < $3 >>> 0; $3 = HEAP32[$0_1 + 4 >> 2]; block : { if ($5_1 & ($3 | 0) <= ($2_1 | 0) | ($2_1 | 0) > ($3 | 0)) { break block } if (HEAPU8[$0_1 + 36 | 0] & 2) { break block } HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] + 1; $6_1 = HEAP32[$0_1 + 24 >> 2] + $1_1 | 0; } HEAP32[$4_1 >> 2] = $6_1; return 0; } function $500($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] - 1; return 0; } function $501($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = $1_1; $3 = HEAP32[$1_1 + 16 >> 2]; $1_1 = HEAP32[$1_1 + 20 >> 2] - 1 | 0; $3 = $3 - 1 | 0; $1_1 = ($3 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $1_1; $1_1 = HEAP32[$0_1 + 36 >> 2] - 1 | 0; $2_1 = HEAP32[$0_1 + 32 >> 2] - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 32 >> 2] = $2_1; HEAP32[$0_1 + 36 >> 2] = $1_1; if (!($1_1 | $2_1)) { if (HEAP8[$0_1 + 28 | 0] & 1) { $502($0_1); return; } $503($0_1, 3); } } function $502($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 12 >> 2]; if (HEAPU8[$1_1 + 40 | 0]) { FUNCTION_TABLE[HEAP32[18919]](HEAP32[$1_1 + 52 >> 2], HEAP32[$0_1 >> 2], 0) } } function $503($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; block : { if (!($1_1 & 1)) { break block } if (($0_1 | 0) == HEAP32[$2_1 + 8 >> 2]) { HEAP32[$2_1 + 8 >> 2] = HEAP32[$0_1 + 44 >> 2] } $3 = HEAP32[$0_1 + 44 >> 2]; block4 : { block3 : { $4_1 = HEAP32[$0_1 + 40 >> 2]; if (!$4_1) { HEAP32[$2_1 + 4 >> 2] = $3; if (!$3) { break block3 } break block4; } HEAP32[$4_1 + 44 >> 2] = $3; if ($3) { break block4 } HEAP32[$2_1 >> 2] = $4_1; break block; } HEAP8[$2_1 + 41 | 0] = 2; HEAP32[$2_1 >> 2] = 0; break block; } HEAP32[$3 + 40 >> 2] = $4_1; } block5 : { if ($1_1 >>> 0 < 2) { break block5 } HEAP32[$0_1 + 44 >> 2] = 0; $1_1 = HEAP32[$2_1 >> 2]; HEAP32[$0_1 + 40 >> 2] = $1_1; block7 : { if ($1_1) { HEAP32[$1_1 + 44 >> 2] = $0_1; break block7; } HEAP32[$2_1 + 4 >> 2] = $0_1; if (!HEAPU8[$2_1 + 40 | 0]) { break block7 } HEAP8[$2_1 + 41 | 0] = 1; } HEAP32[$2_1 >> 2] = $0_1; if (HEAP32[$2_1 + 8 >> 2] | HEAPU8[$0_1 + 28 | 0] & 8) { break block5 } HEAP32[$2_1 + 8 >> 2] = $0_1; } } function $504($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = 512; block : { if (HEAPU8[$0_1 + 12 | 0]) { break block } $1_1 = HEAP32[$0_1 + 64 >> 2]; $3 = HEAP32[$1_1 >> 2]; if ($3) { if (FUNCTION_TABLE[HEAP32[$3 + 48 >> 2]]($1_1) & 4096) { break block } $1_1 = HEAP32[$0_1 + 64 >> 2]; } $2_1 = $535($1_1); } HEAP32[$0_1 + 156 >> 2] = $2_1; } function $505($0_1, $1_1) { var $2_1 = 0, $3 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; if (HEAP32[$0_1 + 32 >> 2]) { $2_1 = FUNCTION_TABLE[HEAP32[18915]]($1_1, HEAP32[$0_1 + 36 >> 2] + 48 | 0, HEAPU8[$0_1 + 40 | 0]) | 0; if (!$2_1) { return 7 } ((wasm2js_i32$1 = $2_1, wasm2js_i32$2 = $523($0_1)), wasm2js_i32$0 = HEAP32[18916]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0); $3 = HEAP32[$0_1 + 52 >> 2]; if ($3) { FUNCTION_TABLE[HEAP32[18922]]($3) } HEAP32[$0_1 + 32 >> 2] = $1_1; HEAP32[$0_1 + 52 >> 2] = $2_1; } return 0; } function $506($0_1) { var $1_1 = 0; if ($0_1) { if (!(HEAPU32[20672] <= $0_1 >>> 0 | HEAPU32[20671] > $0_1 >>> 0)) { HEAP32[20561] = HEAP32[20561] - 1; HEAP32[$0_1 >> 2] = HEAP32[20674]; HEAP32[20674] = $0_1; $0_1 = HEAP32[20675] + 1 | 0; HEAP32[20675] = $0_1; HEAP32[20676] = ($0_1 | 0) < HEAP32[20670]; return; } $1_1 = FUNCTION_TABLE[HEAP32[18897]]($0_1) | 0; HEAP32[20562] = HEAP32[20562] - $1_1; $24($0_1); } } function $507($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block1 : { if (HEAPU8[$0_1 + 12 | 0]) { $3 = 1; break block1; } $3 = $1_1 & 7; $2_1 = ($3 | 0) == 4; $4_1 = $3 >>> 0 > 2; $3 = ($3 | 0) == 1; } HEAP8[$0_1 + 9 | 0] = $2_1; HEAP8[$0_1 + 8 | 0] = $4_1; HEAP8[$0_1 + 7 | 0] = $3; $2_1 = 0; block3 : { if ($3) { break block3 } $2_1 = 3; if ($1_1 & 8) { break block3 } $2_1 = 2; } HEAP8[$0_1 + 10 | 0] = $2_1; HEAP8[$0_1 + 21 | 0] = !($1_1 & 32) | HEAPU8[$0_1 + 21 | 0] & 254; $5_1 = $0_1; $0_1 = $2_1 << 2; HEAP8[$5_1 + 11 | 0] = ($1_1 & 16 ? ($3 ? $0_1 : 12) : $0_1) | ($4_1 ? $2_1 : 0); } function $508($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; block : { $1_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[$1_1 | 0]) { break block } HEAP8[$1_1 | 0] = 0; if (HEAP32[$0_1 + 32 >> 2] < 2) { break block } $514($1_1); } } function $509($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; HEAP32[$2_1 >> 2] = 0; return HEAP32[$0_1 + 44 >> 2]; } function $510($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0; if (!$1_1) { return $181(62853) | 0 } $4_1 = HEAP32[$0_1 + 228 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[18918]](HEAP32[$4_1 + 52 >> 2], $1_1, HEAPU8[$4_1 + 41 | 0] & 3) | 0; block2 : { if (!$4_1) { $5_1 = 7; $6_1 = HEAP32[$0_1 + 228 >> 2]; if (HEAPU8[$6_1 + 41 | 0] == 2) { break block2 } block3 : { if ((FUNCTION_TABLE[HEAP32[18917]](HEAP32[$6_1 + 52 >> 2]) | 0) <= HEAP32[$6_1 + 28 >> 2]) { break block3 } $5_1 = $6_1 + 8 | 0; $4_1 = $5_1; block7 : { block6 : { while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { if (!(HEAP32[$4_1 + 32 >> 2] | HEAP32[$4_1 + 36 >> 2])) { if (!(HEAPU8[$4_1 + 28 | 0] & 8)) { break block6 } } $4_1 = $4_1 + 44 | 0; continue; } break; }; HEAP32[$6_1 + 8 >> 2] = 0; $4_1 = $6_1 + 4 | 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if (!$4_1) { break block3 } if (!(HEAP32[$4_1 + 32 >> 2] | HEAP32[$4_1 + 36 >> 2])) { break block7 } $4_1 = $4_1 + 44 | 0; continue; }; } HEAP32[$5_1 >> 2] = $4_1; } $5_1 = FUNCTION_TABLE[HEAP32[$6_1 + 44 >> 2]](HEAP32[$6_1 + 48 >> 2], $4_1) | 0; if (($5_1 | 0) == 5) { break block3 } if ($5_1) { break block2 } } $5_1 = 7; $4_1 = FUNCTION_TABLE[HEAP32[18918]](HEAP32[$6_1 + 52 >> 2], $1_1, 2) | 0; if (!$4_1) { break block2 } } $4_1 = $577(HEAP32[$0_1 + 228 >> 2], $1_1, $4_1); HEAP32[$2_1 >> 2] = $4_1; block11 : { $3 = $3 & 1; block18 : { if (!($3 | !HEAP32[$4_1 + 20 >> 2])) { HEAP32[$0_1 + 200 >> 2] = HEAP32[$0_1 + 200 >> 2] + 1; break block18; } if (($1_1 | 0) == HEAP32[$0_1 + 164 >> 2]) { $5_1 = $181(62885); break block11; } HEAP32[$4_1 + 20 >> 2] = $0_1; if (!(!($3 | !HEAP32[HEAP32[$0_1 + 64 >> 2] >> 2]) & HEAPU32[$0_1 + 28 >> 2] >= $1_1 >>> 0)) { if ($1_1 >>> 0 > HEAPU32[$0_1 + 160 >> 2]) { $5_1 = 13; if (HEAPU32[$0_1 + 28 >> 2] < $1_1 >>> 0) { break block11 } $501($4_1); break block2; } block15 : { if (!$3) { break block15 } $2_1 = HEAP32[20678]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } if ($1_1 >>> 0 <= HEAPU32[$0_1 + 32 >> 2]) { $427(HEAP32[$0_1 + 60 >> 2], $1_1) } $538($0_1, $1_1); $1_1 = HEAP32[20679]; if (!$1_1) { break block15 } FUNCTION_TABLE[$1_1 | 0](); } $0_1 = HEAP32[$0_1 + 168 >> 2]; if (!$0_1) { break block18 } wasm2js_memory_fill(HEAP32[$4_1 + 4 >> 2], 0, $0_1); return 0; } HEAP32[$0_1 + 204 >> 2] = HEAP32[$0_1 + 204 >> 2] + 1; $5_1 = $578($4_1); if ($5_1) { break block11 } } return 0; } $579($4_1); } $580($0_1); HEAP32[$2_1 >> 2] = 0; return $5_1 | 0; } function $511($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 448 >> 2]; if (!$1_1) { return 0 } $2_1 = HEAP32[$0_1 + 456 >> 2]; if (($2_1 | 0) >= 0) { $3 = FUNCTION_TABLE[$1_1 | 0](HEAP32[$0_1 + 452 >> 2], $2_1) | 0; if ($3) { $1_1 = HEAP32[$0_1 + 456 >> 2] + 1 | 0 } else { $1_1 = -1 } HEAP32[$0_1 + 456 >> 2] = $1_1; } return $3 | 0; } function $512($0_1, $1_1) { var $2_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[HEAP32[$2_1 >> 2] + 228 >> 2]; HEAP32[$0_1 + 24 >> 2] = $1_1; ((wasm2js_i32$1 = HEAP32[$0_1 + 52 >> 2], wasm2js_i32$2 = $523($0_1)), wasm2js_i32$0 = HEAP32[18916]), FUNCTION_TABLE[wasm2js_i32$0](wasm2js_i32$1 | 0, wasm2js_i32$2 | 0); } function $513($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = HEAP32[$0_1 + 224 >> 2]; $2_1 = HEAP32[20678]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]() } $3 = HEAP32[$0_1 + 144 >> 2]; while (1) { if ($3) { $2_1 = HEAP32[$3 + 16 >> 2]; $24($3); $3 = $2_1; continue; } break; }; HEAP8[$0_1 + 4 | 0] = 0; $3 = 0; block2 : { if (!$1_1) { break block2 } $3 = 0; if (HEAPU8[$1_1 + 33 | 0] & 8) { break block2 } $3 = $517($0_1) ? 0 : $4_1; } $518(HEAP32[$0_1 + 232 >> 2], $1_1, HEAPU8[$0_1 + 11 | 0], HEAP32[$0_1 + 168 >> 2], $3); HEAP32[$0_1 + 232 >> 2] = 0; $516($0_1); block4 : { if (HEAPU8[$0_1 + 15 | 0]) { $519($0_1); break block4; } if (HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2]) { $176($0_1, $520($0_1)) } $521($0_1); } $1_1 = HEAP32[20679]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } $2_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = HEAP32[$2_1 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[$1_1 + 4 >> 2]]($2_1) | 0; HEAP32[$2_1 >> 2] = 0; } $2_1 = HEAP32[$0_1 + 64 >> 2]; $1_1 = HEAP32[$2_1 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[$1_1 + 4 >> 2]]($2_1) | 0; HEAP32[$2_1 >> 2] = 0; } $506($4_1); FUNCTION_TABLE[HEAP32[18922]](HEAP32[HEAP32[$0_1 + 228 >> 2] + 52 >> 2]); $24($0_1); } function $514($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = HEAP32[$0_1 + 52 >> 2]; $1_1 = HEAP32[$0_1 + 56 >> 2] + HEAPU8[$0_1 + 9 | 0] | 0; if ($597($0_1, HEAPU8[$1_1 | 0])) { return $181(73006) } $2_1 = HEAP32[$3 + 36 >> 2]; HEAP8[$0_1 + 12 | 0] = 0; HEAP16[$0_1 + 26 >> 1] = $2_1 - 1; $5_1 = HEAP32[$0_1 + 56 >> 2]; $4_1 = HEAPU8[$0_1 + 10 | 0]; HEAP32[$0_1 + 68 >> 2] = $5_1 + $4_1; HEAP32[$0_1 + 60 >> 2] = $2_1 + $5_1; HEAP32[$0_1 + 64 >> 2] = ($1_1 + $4_1 | 0) + 8; HEAP16[$0_1 + 18 >> 1] = (HEAPU8[$0_1 + 9 | 0] + $4_1 | 0) + 8; $1_1 = HEAPU8[$1_1 + 3 | 0] | HEAPU8[$1_1 + 4 | 0] << 8; $1_1 = $1_1 << 8 | $1_1 >>> 8; HEAP16[$0_1 + 24 >> 1] = $1_1; if (($2_1 - 8 >>> 0) / 6 >>> 0 < ($1_1 & 65535) >>> 0) { return $181(73020) } HEAP8[$0_1 | 0] = 1; HEAP32[$0_1 + 20 >> 2] = -1; if (HEAPU8[HEAP32[$3 + 4 >> 2] + 34 | 0] & 32) { $3 = 0; $4_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; $5_1 = $4_1 + (HEAPU8[$0_1 + 8 | 0] ? -4 : -5) | 0; $7_1 = HEAP32[$0_1 + 56 >> 2]; $1_1 = HEAPU16[$0_1 + 18 >> 1]; $8_1 = $7_1 + $1_1 | 0; $9_1 = $1_1 + (HEAPU16[$0_1 + 24 >> 1] << 1) | 0; $1_1 = 0; block : { block1 : { while (1) { if (HEAPU16[$0_1 + 24 >> 1] <= $1_1 >>> 0) { break block } $2_1 = ($1_1 << 1) + $8_1 | 0; $2_1 = HEAPU8[$2_1 | 0] << 8 | HEAPU8[$2_1 + 1 | 0]; $6_1 = 72969; if ($2_1 >>> 0 < $9_1 >>> 0 | ($2_1 | 0) > ($5_1 | 0)) { break block1 } $1_1 = $1_1 + 1 | 0; if (((FUNCTION_TABLE[HEAP32[$0_1 + 76 >> 2]]($0_1, $2_1 + $7_1 | 0) | 0) + $2_1 | 0) <= ($4_1 | 0)) { continue } break; }; $6_1 = 72974; } $3 = $181($6_1); } } else { $3 = 0 } return $3; } function $515($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; block2 : { block : { if (HEAP32[20668] < ($0_1 | 0)) { break block } $2_1 = HEAP32[20674]; if (!$2_1) { break block } HEAP32[20674] = HEAP32[$2_1 >> 2]; $1_1 = HEAP32[20675]; HEAP32[20675] = $1_1 - 1; HEAP32[20676] = ($1_1 | 0) <= HEAP32[20670]; if ($0_1 >>> 0 > HEAPU32[20577]) { HEAP32[20577] = $0_1 } $0_1 = HEAP32[20561] + 1 | 0; HEAP32[20561] = $0_1; if ($0_1 >>> 0 <= HEAPU32[20571]) { break block2 } HEAP32[20571] = $0_1; break block2; } $1_1 = $30($0_1, $0_1 >> 31); if ($1_1) { $3 = FUNCTION_TABLE[HEAP32[18897]]($1_1) | 0; if ($0_1 >>> 0 > HEAPU32[20577]) { HEAP32[20577] = $0_1 } $0_1 = $3 + HEAP32[20562] | 0; HEAP32[20562] = $0_1; if (HEAPU32[20572] < $0_1 >>> 0) { HEAP32[20572] = $0_1 } $0_1 = $1_1; } else { $0_1 = $3 } return $0_1; } return $2_1; } function $516($0_1) { HEAP32[$0_1 + 108 >> 2] = HEAP32[$0_1 + 108 >> 2] + 1; $165(HEAP32[$0_1 + 96 >> 2]); $585(HEAP32[$0_1 + 228 >> 2], 0); } function $517($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 12 >> 2] = 0; block : { if (HEAPU8[$0_1 + 12 | 0] | !HEAP32[$0_1 + 28 >> 2]) { break block } $0_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$0_1 >> 2]; if (!$2_1) { break block } $0_1 = FUNCTION_TABLE[HEAP32[$2_1 + 40 >> 2]]($0_1, 20, $1_1 + 12 | 0) | 0; if (($0_1 | 0) == 12) { break block } $3 = $0_1 ? $0_1 : HEAP32[$1_1 + 12 >> 2] ? 1032 : $0_1; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $518($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block1 : { if (!$0_1) { break block1 } block3 : { block2 : { if (!$4_1) { break block2 } $6_1 = HEAP32[$0_1 + 4 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 28 >> 2]]($6_1, 4) | 0; if ($6_1) { break block3 } if (!HEAPU8[$0_1 + 43 | 0]) { HEAP8[$0_1 + 43 | 0] = 1 } $6_1 = $401($0_1, $1_1, 0, 0, 0, $2_1, $3, $4_1, 0, 0); if ($6_1) { break block3 } HEAP32[$5_1 + 12 >> 2] = -1; $1_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { $7_1 = 1; break block2; } FUNCTION_TABLE[HEAP32[$2_1 + 40 >> 2]]($1_1, 10, $5_1 + 12 | 0) | 0; $7_1 = 1; if (HEAP32[$5_1 + 12 >> 2] != 1) { break block2 } $7_1 = 0; if (HEAP32[$0_1 + 20 >> 2] < 0) { break block2 } $548($0_1, 0, 0); } $6_1 = 0; } $572($0_1, $7_1); $1_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } block7 : { if (!$7_1) { break block7 } $1_1 = HEAP32[20678]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } $1_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$1_1 + 28 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]($1_1, HEAP32[$0_1 + 108 >> 2], 0) | 0 } $1_1 = HEAP32[20679]; if (!$1_1) { break block7 } FUNCTION_TABLE[$1_1 | 0](); } $24(HEAP32[$0_1 + 32 >> 2]); $24($0_1); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $519($0_1) { var $1_1 = 0, $2_1 = 0; $434(HEAP32[$0_1 + 60 >> 2]); HEAP32[$0_1 + 60 >> 2] = 0; $584($0_1); $1_1 = HEAP32[$0_1 + 232 >> 2]; block2 : { block1 : { if ($1_1) { $569($1_1); break block1; } if (HEAPU8[$0_1 + 4 | 0]) { break block2 } $1_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; block4 : { block3 : { if (!$2_1) { break block3 } if (!(FUNCTION_TABLE[HEAP32[$2_1 + 48 >> 2]]($1_1) & 2048)) { break block3 } if ((HEAPU8[$0_1 + 5 | 0] & 5) == 1) { break block4 } } $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block4 } FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } if (!$587($0_1, 0) | HEAPU8[$0_1 + 17 | 0] != 6) { break block1 } HEAP8[$0_1 + 18 | 0] = 5; } HEAP8[$0_1 + 17 | 0] = 0; } if (HEAP32[$0_1 + 44 >> 2]) { block7 : { if (!HEAPU8[$0_1 + 12 | 0]) { $516($0_1); HEAP8[$0_1 + 19 | 0] = 0; $1_1 = 0; break block7; } $1_1 = !HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2]; } HEAP32[$0_1 + 220 >> 2] = 7; HEAP32[$0_1 + 44 >> 2] = 0; HEAP8[$0_1 + 17 | 0] = $1_1; } HEAP32[$0_1 + 80 >> 2] = 0; HEAP32[$0_1 + 84 >> 2] = 0; HEAP8[$0_1 + 20 | 0] = 0; $0_1 = $0_1 + 88 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; } function $520($0_1) { var $1_1 = 0; block1 : { if (!HEAPU8[$0_1 + 7 | 0]) { $1_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 20 >> 2]]($1_1, 2) | 0; if ($1_1) { break block1 } } $1_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 24 >> 2]]($1_1, $0_1 + 88 | 0) | 0; } return $1_1; } function $521($0_1) { var $1_1 = 0, $2_1 = 0; block : { block3 : { switch (HEAPU8[$0_1 + 17 | 0]) { default: $1_1 = HEAP32[20678]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } $185($0_1); $1_1 = HEAP32[20679]; if (!$1_1) { break block } FUNCTION_TABLE[$1_1 | 0](); break block; case 1: if (HEAPU8[$0_1 + 4 | 0]) { break block } $175($0_1, 0, 0); break block; case 0: break block; case 6: break block3; }; } if (!HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2] | HEAPU8[$0_1 + 5 | 0] != 4) { break block } $1_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = 0; $2_1 = HEAPU8[$0_1 + 18 | 0]; HEAP8[$0_1 + 17 | 0] = 0; HEAP8[$0_1 + 18 | 0] = 4; $582($0_1, 1); HEAP8[$0_1 + 18 | 0] = $2_1; HEAP32[$0_1 + 44 >> 2] = $1_1; } $519($0_1); } function $523($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 24 >> 2]; if (($1_1 | 0) < 0) { $2_1 = $1_1 >> 31 << 10 | $1_1 >>> 22; $1_1 = $1_1 << 10; $0_1 = HEAP32[$0_1 + 36 >> 2] + HEAP32[$0_1 + 32 >> 2] | 0; $0_1 = __wasm_i64_sdiv(0 - $1_1 | 0, 0 - ($2_1 + (($1_1 | 0) != 0) | 0) | 0, $0_1, $0_1 >> 31); $1_1 = i64toi32_i32$HIGH_BITS; if (($1_1 | 0) < 0) { $1_1 = 1 } else { $1_1 = $0_1 >>> 0 < 1e9 & ($1_1 | 0) <= 0 } $1_1 = $1_1 ? $0_1 : 1e9; } return $1_1; } function $524($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 0; block4 : { block3 : { block : { $8_1 = $48($1_1); if ($8_1 >>> 0 < 2) { break block } $0_1 = HEAPU8[$1_1 | 0]; if (($0_1 | 0) != 92 & ($0_1 | 0) != 47) { break block } $0_1 = HEAP32[20650]; $6_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $7_1 = HEAP32[20651]; block2 : { while (1) { if (($5_1 | 0) == ($6_1 | 0)) { break block2 } $0_1 = $5_1 << 2; $5_1 = $5_1 + 1 | 0; $0_1 = HEAP32[$0_1 + $7_1 >> 2]; if ($2073(HEAP32[$0_1 + 52 >> 2], $1_1)) { continue } break; }; HEAP32[$0_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2] + 1; break block3; } $0_1 = $30($8_1 + 59 | 0, 0); $5_1 = 7; if (!$0_1) { break block4 } $5_1 = $33(HEAP32[20651], (HEAP32[20650] << 2) + 4 | 0, 0); if (!$5_1) { $24($0_1); return 7; } $6_1 = HEAP32[20650]; HEAP32[20650] = $6_1 + 1; HEAP32[$5_1 + ($6_1 << 2) >> 2] = $0_1; HEAP32[20651] = $5_1; wasm2js_memory_fill($0_1, 0, 56); HEAP32[$0_1 + 36 >> 2] = 3; $5_1 = HEAP32[18949]; $6_1 = HEAP32[18948]; $7_1 = $0_1 + 56 | 0; HEAP32[$0_1 + 52 >> 2] = $7_1; HEAP32[$0_1 + 16 >> 2] = $6_1; HEAP32[$0_1 + 20 >> 2] = $5_1; $5_1 = $8_1 + 1 | 0; if ($5_1) { wasm2js_memory_copy($7_1, $1_1, $5_1) } HEAP32[$0_1 + 48 >> 2] = 1; HEAP32[$0_1 + 28 >> 2] = 8; break block3; } $0_1 = $30(56, 0); if (!$0_1) { return 7 } wasm2js_memory_fill($0_1, 0, 56); HEAP32[$0_1 + 36 >> 2] = 3; $1_1 = HEAP32[18949]; HEAP32[$0_1 + 16 >> 2] = HEAP32[18948]; HEAP32[$0_1 + 20 >> 2] = $1_1; } HEAP32[$2_1 + 4 >> 2] = $0_1; if ($4_1) { HEAP32[$4_1 >> 2] = $3 | 128 } HEAP32[$2_1 >> 2] = 33428; $5_1 = 0; } return $5_1 | 0; } function $525($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; HEAP32[$3 >> 2] = 0; return 0; } function $526($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; HEAP32[$0_1 >> 2] = $1_1; $63($2_1, $3, 8932, $0_1); $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $527($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 40 >> 2]]($0_1, $1_1) | 0; } function $528($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; FUNCTION_TABLE[HEAP32[$0_1 + 44 >> 2]]($0_1, $1_1, $2_1); } function $529($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 48 >> 2]]($0_1, $1_1, $2_1) | 0; } function $530($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; FUNCTION_TABLE[HEAP32[$0_1 + 52 >> 2]]($0_1, $1_1); } function $531($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 56 >> 2]]($0_1, $1_1, $2_1) | 0; } function $532($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 60 >> 2]]($0_1, $1_1) | 0; } function $533($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 68 >> 2]]($0_1, $1_1, $2_1) | 0; } function $534($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; return FUNCTION_TABLE[HEAP32[$0_1 + 72 >> 2]]($0_1, $1_1) | 0; } function $535($0_1) { var $1_1 = 0; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 44 >> 2]; if (!$1_1) { return 4096 } $0_1 = FUNCTION_TABLE[$1_1 | 0]($0_1) | 0; return ($0_1 | 0) < 32 ? 512 : $0_1 >>> 0 >= 65536 ? 65536 : $0_1; } function $536($0_1) { $503($0_1, 1); HEAP16[$0_1 + 28 >> 1] = HEAPU16[$0_1 + 28 >> 1] & 65520 | 1; if (!(HEAP32[$0_1 + 32 >> 2] | HEAP32[$0_1 + 36 >> 2])) { $502($0_1) } } function $537($0_1, $1_1, $2_1, $3, $4_1) { wasm2js_memory_fill($2_1, 0, 64); if (!$4_1) { return FUNCTION_TABLE[HEAP32[$0_1 + 24 >> 2]]($0_1, $1_1, $2_1, $3 & 16255, 0) | 0 } HEAP32[$2_1 + 56 >> 2] = $1_1; HEAP32[$2_1 + 48 >> 2] = $3; HEAP32[$2_1 + 8 >> 2] = $4_1; HEAP32[$2_1 >> 2] = 33512; HEAP32[$2_1 + 52 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = ($4_1 | 0) <= 0 ? 1020 : $4_1; return 0; } function $538($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; while (1) { if (!(HEAP32[$0_1 + 104 >> 2] <= ($2_1 | 0))) { $3 = HEAP32[$0_1 + 100 >> 2] + Math_imul($2_1, 48) | 0; if ($1_1 >>> 0 <= HEAPU32[$3 + 20 >> 2]) { $4_1 = $427(HEAP32[$3 + 16 >> 2], $1_1) | $4_1 } $2_1 = $2_1 + 1 | 0; continue; } break; }; return $4_1; } function $539($0_1, $1_1, $2_1) { var $3 = 0; if (!HEAPU8[$0_1 + 43 | 0]) { $0_1 = HEAP32[$0_1 + 4 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 56 >> 2]]($0_1, $1_1, $2_1, 10) | 0; } return $3; } function $540($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; HEAP32[$0_1 + 112 >> 2] = HEAP32[$0_1 + 112 >> 2] + 1; HEAP32[$0_1 + 68 >> 2] = 0; $3 = $156($0_1 + 84 | 0); HEAP32[$0_1 + 88 >> 2] = $1_1; $1_1 = $3 + 1 | 0; HEAP8[$0_1 + 87 | 0] = $1_1; HEAP8[$0_1 + 86 | 0] = $1_1 >>> 8; HEAP8[$0_1 + 85 | 0] = $1_1 >>> 16; HEAP8[$0_1 + 84 | 0] = $1_1 >>> 24; $550($0_1); HEAP32[$2_1 + 96 >> 2] = 0; HEAP32[$2_1 + 128 >> 2] = 0; HEAP32[$2_1 + 104 >> 2] = 0; HEAP32[$2_1 + 108 >> 2] = -1; HEAP32[$2_1 + 112 >> 2] = -1; HEAP32[$2_1 + 116 >> 2] = -1; } function $541($0_1, $1_1, $2_1) { if (!HEAPU8[$0_1 + 43 | 0]) { $0_1 = HEAP32[$0_1 + 4 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 56 >> 2]]($0_1, $1_1, $2_1, 9) | 0; } } function $542($0_1, $1_1) { if (!HEAPU8[$0_1 + 43 | 0]) { $0_1 = HEAP32[$0_1 + 4 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 56 >> 2]]($0_1, $1_1, 1, 5) | 0; } } function $543($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 + -64 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $5_1 = $3; $3 = HEAP32[$3 >> 2]; HEAP32[$5_1 >> 2] = $3 + 1; block1 : { if (($3 | 0) >= 5) { $4_1 = 15; if ($3 >>> 0 > 99) { break block1 } $5_1 = HEAP32[$0_1 >> 2]; $7_1 = $3 - 8 | 0; FUNCTION_TABLE[HEAP32[$5_1 + 60 >> 2]]($5_1, $3 >>> 0 <= 8 ? 1 : Math_imul(Math_imul($7_1, $7_1), 39)) | 0; } block8 : { block15 : { block14 : { block9 : { block17 : { block6 : { if (!$2_1) { if (!HEAPU8[$0_1 + 50 | 0]) { $4_1 = $566($0_1, $1_1); if ($4_1) { if (($4_1 | 0) != 5) { break block1 } $4_1 = -1; if (!HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]) { break block1 } $1_1 = $567($0_1, 2); if (!$1_1) { $542($0_1, 2); break block1; } $4_1 = ($1_1 | 0) == 5 ? 261 : $1_1; break block1; } if (!HEAPU8[$0_1 + 50 | 0]) { break block6 } } $2_1 = $567($0_1, 3); if ($2_1) { $4_1 = ($2_1 | 0) == 5 ? -1 : $2_1; $3 = 0; break block8; } $3 = 0; HEAP16[$0_1 + 40 >> 1] = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 52 >> 2]]($2_1, 0, 32768, 0, $6_1 + 12 | 0) | 0; if (($4_1 | 0) == 8) { break block9 } if (($4_1 | 0) != 1288) { break block8 } wasm2js_memory_copy($0_1 + 52 | 0, HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2], 48); $2_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 24 >> 2]]($2_1, $6_1 + 56 | 0) | 0; if ($4_1) { break block8 } $2_1 = HEAP32[$6_1 + 56 >> 2]; $5_1 = HEAP32[$6_1 + 60 >> 2]; if (($5_1 | 0) > 0) { $2_1 = 1 } else { $2_1 = $2_1 >>> 0 > 31 & ($5_1 | 0) >= 0 } if (!$2_1) { HEAP32[$1_1 >> 2] = 1; $4_1 = HEAP32[$0_1 + 68 >> 2] ? -1 : 0; break block8; } $2_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 8 >> 2]]($2_1, $6_1 + 16 | 0, 32, 0, 0) | 0; if ($4_1) { break block8 } if (!(HEAP32[$6_1 + 32 >> 2] == (HEAPU8[$0_1 + 84 | 0] | HEAPU8[$0_1 + 85 | 0] << 8 | (HEAPU8[$0_1 + 86 | 0] << 16 | HEAPU8[$0_1 + 87 | 0] << 24)) & HEAP32[$6_1 + 36 >> 2] == (HEAPU8[$0_1 + 88 | 0] | HEAPU8[$0_1 + 89 | 0] << 8 | (HEAPU8[$0_1 + 90 | 0] << 16 | HEAPU8[$0_1 + 91 | 0] << 24)))) { $4_1 = -1; break block8; } $9_1 = HEAP32[$0_1 + 36 >> 2] + 24 | 0; $2_1 = $9_1 >> 31; $10_1 = $2_1; $3 = $31($9_1, $2_1); if (!$3) { $4_1 = 7; $3 = 0; break block8; } $11_1 = $3 + 24 | 0; $2_1 = __wasm_i64_mul(HEAP32[$0_1 + 36 >> 2] + 24 | 0, 0, HEAP32[$0_1 + 68 >> 2], 0); $5_1 = i64toi32_i32$HIGH_BITS; $2_1 = $2_1 + 32 | 0; $5_1 = $2_1 >>> 0 < 32 ? $5_1 + 1 | 0 : $5_1; $12_1 = HEAP32[$0_1 + 80 >> 2]; $13_1 = HEAP32[$0_1 + 76 >> 2]; while (1) { $8_1 = $5_1 + $10_1 | 0; $7_1 = $2_1 + $9_1 | 0; $8_1 = $7_1 >>> 0 < $9_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $4_1 = HEAP32[$6_1 + 60 >> 2]; if (HEAPU32[$6_1 + 56 >> 2] < $7_1 >>> 0 & ($4_1 | 0) <= ($8_1 | 0) | ($4_1 | 0) < ($8_1 | 0)) { break block14 } $4_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[HEAP32[$4_1 >> 2] + 8 >> 2]]($4_1, $3, $9_1, $2_1, $5_1) | 0; if ($4_1) { break block15 } if (!$568($0_1, $6_1 + 8 | 0, $6_1 + 4 | 0, $11_1, $3)) { break block14 } if (HEAP32[$6_1 + 4 >> 2]) { $4_1 = -1; break block15; } else { $2_1 = $7_1; $5_1 = $8_1; continue; } }; } $7_1 = $0_1 + 32 | 0; $8_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2] + 96 | 0; $4_1 = 0; break block17; } $7_1 = $0_1 + 32 | 0; $1_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; $8_1 = $1_1 + 96 | 0; $4_1 = 0; if (HEAP32[$1_1 + 96 >> 2] != HEAP32[$0_1 + 68 >> 2]) { break block17 } $4_1 = $567($0_1, 3); $565($0_1); if (($4_1 | 0) == 5) { break block17 } if ($4_1) { break block1 } if ($2014(HEAP32[HEAP32[$7_1 >> 2] >> 2], $0_1 + 52 | 0, 48)) { $542($0_1, 3); $4_1 = -1; break block1; } $4_1 = 0; HEAP16[$0_1 + 40 >> 1] = 0; break block1; } $9_1 = $8_1 + 4 | 0; $5_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = 0; $3 = 1; $2_1 = 0; while (1) { if (!(($3 | 0) == 5)) { $10_1 = HEAP32[$9_1 + ($3 << 2) >> 2]; $11_1 = $10_1 >>> 0 < $2_1 >>> 0 | $5_1 >>> 0 < $10_1 >>> 0; $2_1 = $11_1 ? $2_1 : $10_1; $1_1 = $11_1 ? $1_1 : $3; $3 = $3 + 1 | 0; continue; } break; }; block22 : { block20 : { if (HEAPU8[$0_1 + 46 | 0] & 2) { break block20 } $3 = 1; if ($1_1 ? $2_1 >>> 0 >= $5_1 >>> 0 : 0) { break block22 } while (1) { if (($3 | 0) == 5) { break block20 } $10_1 = $3 + 3 | 0; $4_1 = $539($0_1, $10_1, 1); if (($4_1 | 0) != 5) { if ($4_1) { break block1 } HEAP32[$9_1 + ($3 << 2) >> 2] = $5_1; $541($0_1, $10_1, 1); $2_1 = $5_1; $1_1 = $3; break block22; } else { $3 = $3 + 1 | 0; $4_1 = 5; continue; } }; } if ($1_1) { break block22 } $4_1 = ($4_1 | 0) == 5 ? -1 : 1288; break block1; } $5_1 = $1_1 + 3 | 0; $3 = $567($0_1, $5_1); if ($3) { $4_1 = ($3 & 255) == 5 ? -1 : $3; break block1; } HEAP32[$0_1 + 100 >> 2] = HEAP32[$8_1 >> 2] + 1; $565($0_1); block26 : { if (($2_1 | 0) == HEAP32[$9_1 + ($1_1 << 2) >> 2]) { if (!$2014(HEAP32[HEAP32[$7_1 >> 2] >> 2], $0_1 + 52 | 0, 48)) { break block26 } } $542($0_1, $5_1); $4_1 = -1; break block1; } HEAP16[$0_1 + 40 >> 1] = $1_1; $4_1 = 0; break block1; } $4_1 = -1; break block8; } $4_1 = 0; } HEAP32[$0_1 + 80 >> 2] = $12_1; HEAP32[$0_1 + 76 >> 2] = $13_1; } $24($3); if (!$4_1) { break block1 } $3 = 0; while (1) { if (!(HEAP32[$0_1 + 24 >> 2] <= ($3 | 0))) { $2_1 = $3 << 2; $24(HEAP32[$2_1 + HEAP32[$0_1 + 32 >> 2] >> 2]); HEAP32[$2_1 + HEAP32[$0_1 + 32 >> 2] >> 2] = 0; $3 = $3 + 1 | 0; continue; } break; }; HEAP8[$0_1 + 50 | 0] = 0; $569($0_1); HEAP32[$1_1 >> 2] = 1; } $0_1 = $6_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $544($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; block1 : { if (!$3) { $3 = 0; break block1; } $5_1 = HEAP32[$3 + 4 >> 2]; $3 = HEAP32[$3 >> 2]; } $6_1 = $1_1 + $2_1 | 0; block3 : { if (!$0_1) { while (1) { $0_1 = HEAP32[$1_1 >> 2]; $3 = ($3 + $5_1 | 0) + ($0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24)) | 0; $0_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $3 + (($0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24)) + $5_1 | 0) | 0; $1_1 = $1_1 + 8 | 0; if ($6_1 >>> 0 > $1_1 >>> 0) { continue } break block3; } } if (!($2_1 & 63)) { while (1) { $0_1 = HEAP32[$1_1 >> 2] + ($3 + $5_1 | 0) | 0; $2_1 = $0_1 + (HEAP32[$1_1 + 4 >> 2] + $5_1 | 0) | 0; $0_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 8 >> 2] | 0) | 0; $2_1 = ($2_1 + HEAP32[$1_1 + 12 >> 2] | 0) + $0_1 | 0; $0_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 16 >> 2] | 0) | 0; $2_1 = ($2_1 + HEAP32[$1_1 + 20 >> 2] | 0) + $0_1 | 0; $0_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 24 >> 2] | 0) | 0; $2_1 = ($2_1 + HEAP32[$1_1 + 28 >> 2] | 0) + $0_1 | 0; $0_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 32 >> 2] | 0) | 0; $2_1 = ($2_1 + HEAP32[$1_1 + 36 >> 2] | 0) + $0_1 | 0; $0_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 40 >> 2] | 0) | 0; $2_1 = ($2_1 + HEAP32[$1_1 + 44 >> 2] | 0) + $0_1 | 0; $3 = $2_1 + HEAP32[$1_1 + 52 >> 2] | 0; $2_1 = $2_1 + ($0_1 + HEAP32[$1_1 + 48 >> 2] | 0) | 0; $0_1 = $3 + $2_1 | 0; $3 = $0_1 + ($2_1 + HEAP32[$1_1 + 56 >> 2] | 0) | 0; $5_1 = $3 + ($0_1 + HEAP32[$1_1 + 60 >> 2] | 0) | 0; $1_1 = $1_1 - -64 | 0; if ($6_1 >>> 0 > $1_1 >>> 0) { continue } break block3; } } while (1) { $3 = HEAP32[$1_1 >> 2] + ($3 + $5_1 | 0) | 0; $5_1 = $3 + (HEAP32[$1_1 + 4 >> 2] + $5_1 | 0) | 0; $1_1 = $1_1 + 8 | 0; if ($6_1 >>> 0 > $1_1 >>> 0) { continue } break; }; } HEAP32[$4_1 + 4 >> 2] = $5_1; HEAP32[$4_1 >> 2] = $3; } function $545($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $3 = global$0 - 16 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; block2 : { $8_1 = HEAP32[$0_1 + 68 >> 2]; if (HEAPU16[$0_1 + 40 >> 1] | HEAPU8[$0_1 + 50 | 0] ? !$8_1 : 1) { HEAP32[$2_1 >> 2] = 0; break block2; } $11_1 = Math_imul($1_1, 383); $6_1 = $8_1 + 33 >>> 12 | 0; $12_1 = HEAP32[$0_1 + 100 >> 2] + 33 >>> 12 | 0; while (1) { $7_1 = 0; block7 : { if (($6_1 | 0) >= ($12_1 | 0)) { $5_1 = $562($0_1, $6_1, $3 + 4 | 0); if ($5_1) { break block2 } $13_1 = HEAP32[$3 + 8 >> 2] - 4 | 0; $5_1 = 8192; $14 = HEAP32[$3 + 12 >> 2]; $15_1 = HEAP32[$3 + 4 >> 2]; $4_1 = $11_1; while (1) { $10_1 = $4_1 & 8191; $4_1 = HEAPU16[($10_1 << 1) + $15_1 >> 1]; if ($4_1) { $9_1 = $4_1 + $14 | 0; if (!($9_1 >>> 0 > $8_1 >>> 0 | HEAPU32[$0_1 + 100 >> 2] > $9_1 >>> 0)) { $7_1 = HEAP32[($4_1 << 2) + $13_1 >> 2] == ($1_1 | 0) ? $9_1 : $7_1 } if ($5_1) { $4_1 = $10_1 + 1 | 0; $5_1 = $5_1 - 1 | 0; continue; } else { HEAP32[$2_1 >> 2] = 0; $5_1 = $181(68693); break block2; } } break; }; if (!$7_1) { break block7 } } HEAP32[$2_1 >> 2] = $7_1; $5_1 = 0; break block2; } $6_1 = $6_1 - 1 | 0; continue; }; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $546($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 32 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = $2_1; $2_1 = HEAP32[$1_1 + 4 >> 2]; $547(HEAP32[$0_1 >> 2], HEAP32[$1_1 + 24 >> 2], $6_1, $2_1, $5_1); $1_1 = $563($0_1, $5_1, 24, $3, $4_1); if (!$1_1) { $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $3 + 24 | 0; $4_1 = $3 >>> 0 < 24 ? $4_1 + 1 | 0 : $4_1; $1_1 = $563($0_1, $2_1, $1_1, $3, $4_1); } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $547($0_1, $1_1, $2_1, $3, $4_1) { HEAP8[$4_1 + 7 | 0] = $2_1; HEAP8[$4_1 + 3 | 0] = $1_1; HEAP8[$4_1 + 6 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 5 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 4 | 0] = $2_1 >>> 24; HEAP8[$4_1 + 2 | 0] = $1_1 >>> 8; HEAP8[$4_1 + 1 | 0] = $1_1 >>> 16; HEAP8[$4_1 | 0] = $1_1 >>> 24; if (!HEAP32[$0_1 + 104 >> 2]) { $1_1 = HEAP32[$0_1 + 88 >> 2]; $2_1 = HEAP32[$0_1 + 84 >> 2]; HEAP8[$4_1 + 8 | 0] = $2_1; HEAP8[$4_1 + 9 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 10 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 11 | 0] = $2_1 >>> 24; HEAP8[$4_1 + 12 | 0] = $1_1; HEAP8[$4_1 + 13 | 0] = $1_1 >>> 8; HEAP8[$4_1 + 14 | 0] = $1_1 >>> 16; HEAP8[$4_1 + 15 | 0] = $1_1 >>> 24; $2_1 = !HEAPU8[$0_1 + 65 | 0]; $1_1 = $0_1 + 76 | 0; $544($2_1, $4_1, 8, $1_1, $1_1); $544($2_1, $3, HEAP32[$0_1 + 36 >> 2], $1_1, $1_1); $1_1 = HEAP32[$0_1 + 76 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$4_1 + 16 | 0] = $1_1; HEAP8[$4_1 + 17 | 0] = $1_1 >>> 8; HEAP8[$4_1 + 18 | 0] = $1_1 >>> 16; HEAP8[$4_1 + 19 | 0] = $1_1 >>> 24; $0_1 = HEAP32[$0_1 + 80 >> 2]; $0_1 = $0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24); HEAP8[$4_1 + 20 | 0] = $0_1; HEAP8[$4_1 + 21 | 0] = $0_1 >>> 8; HEAP8[$4_1 + 22 | 0] = $0_1 >>> 16; HEAP8[$4_1 + 23 | 0] = $0_1 >>> 24; return; } HEAP8[$4_1 + 8 | 0] = 0; HEAP8[$4_1 + 9 | 0] = 0; HEAP8[$4_1 + 10 | 0] = 0; HEAP8[$4_1 + 11 | 0] = 0; HEAP8[$4_1 + 12 | 0] = 0; HEAP8[$4_1 + 13 | 0] = 0; HEAP8[$4_1 + 14 | 0] = 0; HEAP8[$4_1 + 15 | 0] = 0; $0_1 = $4_1 + 16 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; } function $548($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $3 = HEAP32[20678]; if ($3) { FUNCTION_TABLE[$3 | 0]() } $3 = HEAP32[$0_1 + 8 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 24 >> 2]]($3, $4_1 + 8 | 0) | 0; block1 : { if ($3) { break block1 } $3 = 0; $5_1 = HEAP32[$4_1 + 12 >> 2]; if (HEAPU32[$4_1 + 8 >> 2] <= $1_1 >>> 0 & ($2_1 | 0) >= ($5_1 | 0) | ($2_1 | 0) > ($5_1 | 0)) { break block1 } $3 = HEAP32[$0_1 + 8 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 16 >> 2]]($3, $1_1, $2_1) | 0; } $1_1 = HEAP32[20679]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } if ($3) { HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 108 >> 2]; $64($3, 8085, $4_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $549($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; $3 = $562($0_1, $1_1 + 33 >>> 12 | 0, $4_1 + 4 | 0); block : { if ($3) { break block } $5_1 = $1_1 - HEAP32[$4_1 + 12 >> 2] | 0; block2 : { if (($5_1 | 0) != 1) { $1_1 = HEAP32[$4_1 + 8 >> 2]; break block2; } $1_1 = HEAP32[$4_1 + 8 >> 2]; $3 = (HEAP32[$4_1 + 4 >> 2] - $1_1 | 0) + 16384 | 0; if (!$3) { break block2 } wasm2js_memory_fill($1_1, 0, $3); } $6_1 = (($5_1 << 2) + $1_1 | 0) - 4 | 0; if (HEAP32[$6_1 >> 2]) { $564($0_1) } $3 = Math_imul($2_1, 383); $0_1 = HEAP32[$4_1 + 4 >> 2]; $1_1 = $5_1; block5 : { while (1) { $3 = $3 & 8191; $7_1 = $0_1 + ($3 << 1) | 0; if (HEAPU16[$7_1 >> 1]) { if (!$1_1) { break block5 } $3 = $3 + 1 | 0; $1_1 = $1_1 - 1 | 0; continue; } break; }; HEAP32[$6_1 >> 2] = $2_1; HEAP16[$7_1 >> 1] = $5_1; $3 = 0; break block; } $3 = $181(66461); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $550($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; HEAP8[$0_1 + 64 | 0] = 1; HEAP32[$0_1 + 52 >> 2] = 3007e3; $1_1 = $0_1 + 52 | 0; $544(1, $1_1, 40, 0, $0_1 + 92 | 0); wasm2js_memory_copy($2_1 + 48 | 0, $1_1, 48); $565($0_1); wasm2js_memory_copy($2_1, $1_1, 48); } function $551($0_1, $1_1, $2_1) { if ($0_1) { $561($0_1, $1_1, $2_1) } } function $552($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 44 >> 2]; block : { if ($1_1) { break block } $1_1 = 0; if (HEAP32[$0_1 + 232 >> 2]) { break block } $1_1 = $575($0_1, 4); } return $1_1; } function $553($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = HEAP32[$0_1 + 104 >> 2]; $3 = ($5_1 | 0) > 0 ? $5_1 : 0; $6_1 = HEAP32[$0_1 + 156 >> 2]; $5_1 = HEAP32[$0_1 + 168 >> 2]; $2_1 = HEAP32[$0_1 + 224 >> 2]; while (1) { if (!(($1_1 | 0) == ($3 | 0))) { $4_1 = HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 48) | 0; if (!(HEAP32[$4_1 + 8 >> 2] | HEAP32[$4_1 + 12 >> 2])) { $7_1 = HEAP32[$0_1 + 84 >> 2]; $4_1 = $4_1 + 8 | 0; HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$4_1 + 4 >> 2] = $7_1; } $1_1 = $1_1 + 1 | 0; continue; } break; }; $1_1 = $170($0_1); HEAP32[$0_1 + 88 >> 2] = $1_1; $3 = i64toi32_i32$HIGH_BITS; HEAP32[$0_1 + 92 >> 2] = $3; HEAP32[$0_1 + 80 >> 2] = $1_1; HEAP32[$0_1 + 84 >> 2] = $3; $3 = $5_1 >>> 0 > $6_1 >>> 0; block4 : { block3 : { if (!(HEAPU8[$0_1 + 7 | 0] | HEAPU8[$0_1 + 5 | 0] == 4)) { $1_1 = HEAP32[$0_1 + 64 >> 2]; $4_1 = HEAP32[$1_1 >> 2]; if (!$4_1) { break block3 } if (!(FUNCTION_TABLE[HEAP32[$4_1 + 48 >> 2]]($1_1) & 512)) { break block3 } } HEAP8[$2_1 + 8 | 0] = 255; HEAP8[$2_1 + 9 | 0] = 255; HEAP8[$2_1 + 10 | 0] = 255; HEAP8[$2_1 + 11 | 0] = 255; HEAP8[$2_1 | 0] = 217; HEAP8[$2_1 + 1 | 0] = 213; HEAP8[$2_1 + 2 | 0] = 5; HEAP8[$2_1 + 3 | 0] = 249; HEAP8[$2_1 + 4 | 0] = 32; HEAP8[$2_1 + 5 | 0] = 161; HEAP8[$2_1 + 6 | 0] = 99; HEAP8[$2_1 + 7 | 0] = 215; break block4; } HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; HEAP8[$2_1 + 4 | 0] = 0; HEAP8[$2_1 + 5 | 0] = 0; HEAP8[$2_1 + 6 | 0] = 0; HEAP8[$2_1 + 7 | 0] = 0; $1_1 = $2_1 + 8 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; } $5_1 = $3 ? $6_1 : $5_1; if (HEAPU8[$0_1 + 5 | 0] != 4) { $65(4, $0_1 + 52 | 0) } $1_1 = HEAP32[$0_1 + 52 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 12 | 0] = $1_1; HEAP8[$2_1 + 13 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 14 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 15 | 0] = $1_1 >>> 24; $1_1 = HEAP32[$0_1 + 32 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 16 | 0] = $1_1; HEAP8[$2_1 + 17 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 18 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 19 | 0] = $1_1 >>> 24; $1_1 = HEAP32[$0_1 + 156 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 20 | 0] = $1_1; HEAP8[$2_1 + 21 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 22 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 23 | 0] = $1_1 >>> 24; $1_1 = HEAP32[$0_1 + 168 >> 2]; $1_1 = $1_1 << 24 | ($1_1 & 65280) << 8 | ($1_1 >>> 8 & 65280 | $1_1 >>> 24); HEAP8[$2_1 + 24 | 0] = $1_1; HEAP8[$2_1 + 25 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 26 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 27 | 0] = $1_1 >>> 24; $6_1 = 0; $1_1 = $5_1 - 28 | 0; if ($1_1) { wasm2js_memory_fill($2_1 + 28 | 0, 0, $1_1) } $1_1 = 0; while (1) { if (!(HEAPU32[$0_1 + 156 >> 2] <= $1_1 >>> 0 | $6_1)) { $3 = HEAP32[$0_1 + 68 >> 2]; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$3 >> 2] + 12 >> 2]]($3, $2_1, $5_1, HEAP32[$0_1 + 80 >> 2], HEAP32[$0_1 + 84 >> 2]) | 0; $3 = HEAP32[$0_1 + 84 >> 2]; $4_1 = $5_1 + HEAP32[$0_1 + 80 >> 2] | 0; $3 = $5_1 >>> 0 > $4_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$0_1 + 80 >> 2] = $4_1; HEAP32[$0_1 + 84 >> 2] = $3; $1_1 = $1_1 + $5_1 | 0; continue; } break; }; return $6_1; } function $554($0_1) { $0_1 = $0_1 | 0; $555(HEAP32[$0_1 + 12 >> 2]); return 0; } function $555($0_1) { var $1_1 = 0; while (1) { if ($0_1) { $1_1 = HEAP32[$0_1 >> 2]; $24($0_1); $0_1 = $1_1; continue; } break; }; } function $556($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = 522; $7_1 = ($2_1 >> 31) + $4_1 | 0; $8_1 = $2_1 + $3 | 0; $7_1 = $8_1 >>> 0 < $2_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; $5_1 = HEAP32[$0_1 + 20 >> 2]; if (!(HEAPU32[$0_1 + 16 >> 2] < $8_1 >>> 0 & ($5_1 | 0) <= ($7_1 | 0) | ($5_1 | 0) < ($7_1 | 0))) { block4 : { if (!(!!($3 | $4_1) & (($3 | 0) == HEAP32[$0_1 + 32 >> 2] & ($4_1 | 0) == HEAP32[$0_1 + 36 >> 2]))) { $6_1 = $0_1 + 12 | 0; $5_1 = 0; while (1) { $6_1 = HEAP32[$6_1 >> 2]; if (!$6_1) { $6_1 = 0; break block4; } $9_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = $9_1 + $10_1 | 0; $5_1 = ($9_1 >> 31) + $5_1 | 0; $5_1 = $10_1 >>> 0 < $9_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; if (($4_1 | 0) >= ($5_1 | 0) & $3 >>> 0 >= $10_1 >>> 0 | ($4_1 | 0) > ($5_1 | 0)) { continue } break; }; break block4; } $6_1 = HEAP32[$0_1 + 40 >> 2]; } $5_1 = $3; $3 = HEAP32[$0_1 + 4 >> 2]; $3 = __wasm_i64_srem($5_1, $4_1, $3, $3 >> 31); while (1) { $5_1 = HEAP32[$0_1 + 4 >> 2] - $3 | 0; $4_1 = ($2_1 | 0) < ($5_1 | 0) ? $2_1 : $5_1; if ($4_1) { wasm2js_memory_copy($1_1, ($3 + $6_1 | 0) + 4 | 0, $4_1) } $2_1 = $2_1 - $5_1 | 0; block6 : { if (($2_1 | 0) < 0) { break block6 } $6_1 = HEAP32[$6_1 >> 2]; if (!$2_1) { break block6 } $1_1 = $1_1 + $4_1 | 0; $3 = 0; if ($6_1) { continue } } break; }; HEAP32[$0_1 + 40 >> 2] = $6_1; HEAP32[$0_1 + 32 >> 2] = $6_1 ? $8_1 : 0; HEAP32[$0_1 + 36 >> 2] = $6_1 ? $7_1 : 0; $6_1 = 0; } return $6_1 | 0; } function $557($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0; $8_1 = global$0 - 32 | 0; $5_1 = $8_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block5 : { block7 : { block3 : { block : { $12_1 = HEAP32[$0_1 + 8 >> 2]; if (($12_1 | 0) <= 0) { break block } $6_1 = ($2_1 >> 31) + $4_1 | 0; $5_1 = $2_1 + $3 | 0; $6_1 = $5_1 >>> 0 < $2_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; if (($6_1 | 0) < 0) { $5_1 = 1 } else { $5_1 = ($6_1 | 0) <= 0 & $5_1 >>> 0 <= $12_1 >>> 0 } if ($5_1) { break block } $13_1 = HEAP32[$0_1 + 16 >> 2]; $14 = HEAP32[$0_1 + 20 >> 2]; $15_1 = HEAP32[$0_1 + 12 >> 2]; $17_1 = HEAP32[$0_1 + 4 >> 2]; $21_1 = HEAP32[$0_1 >> 2]; $6_1 = $0_1 + 40 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; $5_1 = $8_1 + 24 | 0; HEAP32[$5_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 4 >> 2] = $7_1; $6_1 = $0_1 + 32 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; $5_1 = $8_1 + 16 | 0; HEAP32[$5_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 4 >> 2] = $7_1; $5_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$8_1 + 8 >> 2] = HEAP32[$0_1 + 24 >> 2]; HEAP32[$8_1 + 12 >> 2] = $5_1; $22_1 = HEAP32[$0_1 + 60 >> 2]; $18_1 = HEAP32[$0_1 + 56 >> 2]; $16_1 = HEAP32[$0_1 + 52 >> 2]; $19_1 = HEAP32[$0_1 + 48 >> 2]; wasm2js_memory_fill($0_1, 0, 64); block2 : { $9_1 = FUNCTION_TABLE[HEAP32[$16_1 + 24 >> 2]]($16_1, $18_1, $0_1, $19_1 & 17334143, 0) | 0; if ($9_1) { break block2 } $7_1 = 0; $6_1 = 0; $5_1 = $17_1; $11_1 = $15_1; while (1) { if (!$11_1) { break block3 } $9_1 = $13_1 - $7_1 | 0; $10_1 = ($5_1 >> 31) + $6_1 | 0; $20_1 = $5_1 + $7_1 | 0; $10_1 = $20_1 >>> 0 < $5_1 >>> 0 ? $10_1 + 1 | 0 : $10_1; $5_1 = $13_1 >>> 0 < $20_1 >>> 0 & ($10_1 | 0) >= ($14 | 0) | ($10_1 | 0) > ($14 | 0) ? $9_1 : $5_1; $9_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]]($0_1, $11_1 + 4 | 0, $5_1, $7_1, $6_1) | 0; if ($9_1) { break block2 } $6_1 = ($5_1 >> 31) + $6_1 | 0; $7_1 = $5_1 + $7_1 | 0; $6_1 = $7_1 >>> 0 < $5_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $11_1 = HEAP32[$11_1 >> 2]; continue; }; } $1_1 = $0_1 + 24 | 0; $2_1 = HEAP32[$0_1 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($0_1) | 0 } HEAP32[$0_1 + 16 >> 2] = $13_1; HEAP32[$0_1 + 20 >> 2] = $14; HEAP32[$0_1 + 12 >> 2] = $15_1; HEAP32[$0_1 + 8 >> 2] = $12_1; HEAP32[$0_1 + 4 >> 2] = $17_1; HEAP32[$0_1 >> 2] = $21_1; $6_1 = $8_1 + 8 | 0; $3 = $6_1 + 16 | 0; $4_1 = HEAP32[$3 + 4 >> 2]; $2_1 = $1_1 + 16 | 0; HEAP32[$2_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$2_1 + 4 >> 2] = $4_1; $3 = $6_1 + 8 | 0; $4_1 = HEAP32[$3 + 4 >> 2]; $2_1 = $1_1 + 8 | 0; HEAP32[$2_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$2_1 + 4 >> 2] = $4_1; $2_1 = HEAP32[$8_1 + 12 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$8_1 + 8 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$0_1 + 60 >> 2] = $22_1; HEAP32[$0_1 + 56 >> 2] = $18_1; HEAP32[$0_1 + 52 >> 2] = $16_1; HEAP32[$0_1 + 48 >> 2] = $19_1; break block5; } if (!(!$3 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0)) { if (HEAP32[$0_1 + 16 >> 2] == ($3 | 0) & HEAP32[$0_1 + 20 >> 2] == ($4_1 | 0)) { break block7 } $558($0_1, $3, $4_1); break block7; } if ($3 | $4_1) { break block7 } $3 = HEAP32[$0_1 + 12 >> 2]; if (!$3) { break block7 } if ($2_1) { wasm2js_memory_copy($3 + 4 | 0, $1_1, $2_1) } break block5; } $555($15_1); $9_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]]($0_1, $1_1, $2_1, $3, $4_1) | 0; break block5; } while (1) { if (($2_1 | 0) <= 0) { break block5 } $3 = HEAP32[$0_1 + 24 >> 2]; $6_1 = HEAP32[$0_1 + 4 >> 2]; $4_1 = __wasm_i64_srem(HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2], $6_1, $6_1 >> 31); block10 : { if ($4_1 | i64toi32_i32$HIGH_BITS) { $5_1 = $3; break block10; } $5_1 = $23($6_1 + 4 | 0); if (!$5_1) { $9_1 = 3082; break block5; } HEAP32[$5_1 >> 2] = 0; block13 : { if ($3) { HEAP32[$3 >> 2] = $5_1; break block13; } HEAP32[$0_1 + 12 >> 2] = $5_1; } HEAP32[$0_1 + 24 >> 2] = $5_1; } $3 = $6_1 - $4_1 | 0; $3 = ($2_1 | 0) < ($3 | 0) ? $2_1 : $3; if ($3) { wasm2js_memory_copy(($4_1 + $5_1 | 0) + 4 | 0, $1_1, $3) } $4_1 = HEAP32[$0_1 + 20 >> 2] + ($3 >> 31) | 0; $5_1 = $3 + HEAP32[$0_1 + 16 >> 2] | 0; $4_1 = $5_1 >>> 0 < $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 + 16 >> 2] = $5_1; HEAP32[$0_1 + 20 >> 2] = $4_1; $2_1 = $2_1 - $3 | 0; $1_1 = $1_1 + $3 | 0; continue; }; } $0_1 = $8_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1 | 0; } function $558($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = HEAP32[$0_1 + 20 >> 2]; if (!(($3 | 0) <= ($2_1 | 0) & HEAPU32[$0_1 + 16 >> 2] <= $1_1 >>> 0 | ($2_1 | 0) > ($3 | 0))) { block2 : { if (!($1_1 | $2_1)) { $555(HEAP32[$0_1 + 12 >> 2]); HEAP32[$0_1 + 12 >> 2] = 0; break block2; } $4_1 = $0_1 + 12 | 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; $3 = $5_1 >> 31; $6_1 = $5_1; $7_1 = $3; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $8_1 = $1_1 >>> 0 > $6_1 >>> 0 & ($2_1 | 0) >= ($3 | 0) | ($2_1 | 0) > ($3 | 0); $3 = $3 + $7_1 | 0; $6_1 = $5_1 + $6_1 | 0; $3 = $5_1 >>> 0 > $6_1 >>> 0 ? $3 + 1 | 0 : $3; if ($8_1) { continue } } break; }; if (!$4_1) { $4_1 = 0; break block2; } $555(HEAP32[$4_1 >> 2]); HEAP32[$4_1 >> 2] = 0; } HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $2_1; HEAP32[$0_1 + 24 >> 2] = $4_1; HEAP32[$0_1 + 32 >> 2] = 0; HEAP32[$0_1 + 36 >> 2] = 0; } return 0; } function $560($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; return 0; } function $561($0_1, $1_1, $2_1) { var $3 = 0; while (1) { $3 = HEAP32[$0_1 + 28 >> 2]; block : { if ($3 >>> 0 > 6 | !(1 << $3 & 97) | HEAPU32[$0_1 + 16 >> 2] <= $1_1 >>> 0) { break block } $3 = $145($0_1, $1_1, $2_1, 1); if (!$3) { break block } HEAP32[$0_1 + 28 >> 2] = $3; } $0_1 = HEAP32[$0_1 + 44 >> 2]; if ($0_1) { continue } break; }; } function $562($0_1, $1_1, $2_1) { var $3 = 0; $0_1 = $570($0_1, $1_1, $2_1 + 4 | 0); $3 = HEAP32[$2_1 + 4 >> 2]; if ($3) { HEAP32[$2_1 >> 2] = $3 + 16384; if (!$1_1) { HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = $3 + 136; return $0_1; } HEAP32[$2_1 + 8 >> 2] = ($1_1 << 12) - 34; return $0_1; } return $0_1 >>> 0 <= 1 ? 1 : $0_1; } function $563($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = HEAP32[$0_1 + 12 >> 2]; $5_1 = $7_1; $6_1 = HEAP32[$0_1 + 8 >> 2]; block1 : { block : { if (($4_1 | 0) >= ($5_1 | 0) & $3 >>> 0 >= $6_1 >>> 0 | ($4_1 | 0) > ($5_1 | 0)) { break block } $5_1 = ($2_1 >> 31) + $4_1 | 0; $8_1 = $2_1 + $3 | 0; $5_1 = $8_1 >>> 0 < $2_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; if (($5_1 | 0) <= ($7_1 | 0) & $6_1 >>> 0 > $8_1 >>> 0 | ($5_1 | 0) < ($7_1 | 0)) { break block } $5_1 = HEAP32[$0_1 + 4 >> 2]; $6_1 = $6_1 - $3 | 0; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 12 >> 2]]($5_1, $1_1, $6_1, $3, $4_1) | 0; if ($5_1) { break block1 } $5_1 = HEAP32[$0_1 + 16 >> 2] & 3; if ($5_1) { $7_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$7_1 >> 2] + 20 >> 2]]($7_1, $5_1) | 0; } else { $5_1 = 0 } $2_1 = $2_1 - $6_1 | 0; if ($5_1 | !$2_1) { break block1 } $1_1 = $1_1 + $6_1 | 0; $4_1 = $4_1 + ($6_1 >> 31) | 0; $5_1 = $3; $3 = $3 + $6_1 | 0; $4_1 = $5_1 >>> 0 > $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; } $0_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]]($0_1, $1_1, $2_1, $3, $4_1) | 0; } return $5_1; } function $564($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = HEAP32[$0_1 + 68 >> 2]; block : { if (!$2_1) { break block } if ($562($0_1, $2_1 + 33 >>> 12 | 0, $1_1 + 4 | 0)) { break block } $2_1 = HEAP32[$0_1 + 68 >> 2] - HEAP32[$1_1 + 12 >> 2] | 0; $3 = HEAP32[$1_1 + 4 >> 2]; $0_1 = 0; while (1) { if (($0_1 | 0) != 8192) { $4_1 = ($0_1 << 1) + $3 | 0; if (($2_1 | 0) < HEAPU16[$4_1 >> 1]) { HEAP16[$4_1 >> 1] = 0 } $0_1 = $0_1 + 1 | 0; continue; } break; }; $0_1 = HEAP32[$1_1 + 8 >> 2] + ($2_1 << 2) | 0; $2_1 = $3 - $0_1 | 0; if (!$2_1) { break block } wasm2js_memory_fill($0_1, 0, $2_1); } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $565($0_1) { if (HEAPU8[$0_1 + 43 | 0] != 2) { $0_1 = HEAP32[$0_1 + 4 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 60 >> 2]]($0_1); } } function $566($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0; $4_1 = global$0 - 80 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = $570($0_1, 0, $4_1 + 16 | 0); block1 : { if ($3) { if (($3 | 0) != 1288) { break block1 } HEAP8[$0_1 + 43 | 0] = 2; HEAP8[$0_1 + 50 | 0] = 1; HEAP32[$1_1 >> 2] = 1; } block28 : { block6 : { block5 : { block3 : { if (HEAP32[$4_1 + 16 >> 2]) { if (!$571($0_1, $1_1)) { break block3 } } if (!(HEAPU8[$0_1 + 50 | 0] | !(HEAPU8[$0_1 + 46 | 0] & 2))) { $3 = $567($0_1, 0); if ($3) { break block5 } $542($0_1, 0); $3 = 264; if (!HEAPU8[$0_1 + 50 | 0]) { break block1 } break block6; } $14 = HEAPU8[$0_1 + 44 | 0]; if (!$14) { $3 = $539($0_1, 0, 1); if ($3) { break block5 } } HEAP8[$0_1 + 44 | 0] = 1; $3 = $570($0_1, 0, $4_1 + 16 | 0); $2_1 = 0; block8 : { if ($3) { break block8 } if (!$571($0_1, $1_1)) { $3 = 0; $2_1 = 1; break block8; } $2_1 = HEAPU8[$0_1 + 45 | 0]; $15_1 = $2_1 + 1 | 0; $16_1 = 2 - $2_1 | 0; $3 = $539($0_1, $15_1, $16_1); if (!$3) { wasm2js_memory_fill($0_1 + 52 | 0, 0, 48); $2_1 = HEAP32[$0_1 + 8 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 24 >> 2]]($2_1, $4_1 + 72 | 0) | 0; block12 : { if ($3) { break block12 } $2_1 = HEAP32[$4_1 + 72 >> 2]; $5_1 = HEAP32[$4_1 + 76 >> 2]; if (($5_1 | 0) < 0) { $3 = 1 } else { $3 = $2_1 >>> 0 < 33 & ($5_1 | 0) <= 0 } block13 : { if ($3) { break block13 } $2_1 = HEAP32[$0_1 + 8 >> 2]; $6_1 = $4_1 + 32 | 0; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 8 >> 2]]($2_1, $6_1, 32, 0, 0) | 0; if ($3) { break block12 } block14 : { $2_1 = HEAPU8[$4_1 + 35 | 0]; if (($2_1 & 254 | (HEAPU8[$4_1 + 33 | 0] << 16 | HEAPU8[$4_1 + 32 | 0] << 24 | HEAPU8[$4_1 + 34 | 0] << 8)) != 931071618) { break block14 } $3 = HEAPU8[$4_1 + 42 | 0] << 8; $8_1 = HEAPU8[$4_1 + 41 | 0] << 16 | HEAPU8[$4_1 + 40 | 0] << 24; $5_1 = $3 | ($8_1 | HEAPU8[$4_1 + 43 | 0]); if ($5_1 - 1 & $5_1 | $5_1 - 65537 >>> 0 < 4294902271) { break block14 } HEAP32[$0_1 + 36 >> 2] = $5_1; $7_1 = $2_1 & 1; HEAP8[$0_1 + 65 | 0] = $7_1; $2_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$0_1 + 112 >> 2] = $2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24); $2_1 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$0_1 + 84 >> 2] = HEAP32[$4_1 + 48 >> 2]; HEAP32[$0_1 + 88 >> 2] = $2_1; $544(!$7_1, $6_1, 24, 0, $0_1 + 76 | 0); $2_1 = HEAP32[$4_1 + 56 >> 2]; if (HEAP32[$0_1 + 76 >> 2] != ($2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24))) { break block14 } $2_1 = HEAP32[$4_1 + 60 >> 2]; if (HEAP32[$0_1 + 80 >> 2] != ($2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24))) { break block14 } $2_1 = HEAP32[$4_1 + 36 >> 2]; if (($2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24)) != 3007e3) { $3 = $75(66593); break block12; } $7_1 = $31($5_1 + 32792 | 0, 0); if (!$7_1) { $3 = 7; break block12; } $22_1 = $3 | $8_1 >>> 16; $17_1 = $7_1 + 24 | 0; $18_1 = $5_1 + $17_1 | 0; $2_1 = HEAP32[$4_1 + 76 >> 2] - 1 | 0; $3 = HEAP32[$4_1 + 72 >> 2] - 32 | 0; $2_1 = $3 >>> 0 < 4294967264 ? $2_1 + 1 | 0 : $2_1; $8_1 = $5_1 + 24 | 0; $12_1 = __wasm_i64_sdiv($3, $2_1, $8_1, 0); $23_1 = ($12_1 + 33 >>> 12 | 0) + 1 | 0; $3 = 0; while (1) { block17 : { if (($9_1 | 0) == ($23_1 | 0)) { break block17 } $3 = $570($0_1, $9_1, $4_1 + 28 | 0); $13_1 = HEAP32[$4_1 + 28 >> 2]; if (!$13_1) { break block17 } $19_1 = $9_1 << 2; HEAP32[$19_1 + HEAP32[$0_1 + 32 >> 2] >> 2] = $18_1; $5_1 = $9_1 << 12; $2_1 = $5_1 | 4062; $24_1 = $2_1 >>> 0 < $12_1 >>> 0 ? $2_1 : $12_1; $5_1 = $9_1 ? $5_1 - 33 | 0 : 1; $2_1 = 0; while (1) { block18 : { $20_1 = !$2_1 & $5_1 >>> 0 > $24_1 >>> 0 | ($2_1 | 0) != 0; if ($20_1) { break block18 } $21_1 = HEAP32[$0_1 + 8 >> 2]; $3 = $8_1; $6_1 = $2_1 - 1 | 0; $10_1 = $5_1 - 1 | 0; $6_1 = ($10_1 | 0) != -1 ? $6_1 + 1 | 0 : $6_1; $10_1 = __wasm_i64_mul($10_1, $6_1, $3, 0); $6_1 = i64toi32_i32$HIGH_BITS; $10_1 = $10_1 + 32 | 0; $6_1 = $10_1 >>> 0 < 32 ? $6_1 + 1 | 0 : $6_1; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$21_1 >> 2] + 8 >> 2]]($21_1, $7_1, $3, $10_1, $6_1) | 0; if ($3) { break block18 } if (!$568($0_1, $4_1 + 24 | 0, $4_1 + 20 | 0, $17_1, $7_1)) { $3 = 0; break block18; } $3 = $549($0_1, $5_1, HEAP32[$4_1 + 24 >> 2]); if ($3) { break block18 } $3 = HEAP32[$4_1 + 20 >> 2]; if ($3) { HEAP32[$0_1 + 72 >> 2] = $3; HEAP32[$0_1 + 68 >> 2] = $5_1; HEAP16[$0_1 + 66 >> 1] = $22_1; $25 = HEAP32[$0_1 + 80 >> 2]; $26_1 = HEAP32[$0_1 + 76 >> 2]; } $5_1 = $5_1 + 1 | 0; $2_1 = $5_1 ? $2_1 : $2_1 + 1 | 0; $3 = 0; continue; } break; }; HEAP32[$19_1 + HEAP32[$0_1 + 32 >> 2] >> 2] = $13_1; $2_1 = $9_1 ? 0 : 136; $5_1 = 32768 - $2_1 | 0; if ($5_1) { wasm2js_memory_copy($2_1 + $13_1 | 0, $2_1 + $18_1 | 0, $5_1) } if (!$20_1) { break block17 } $9_1 = $9_1 + 1 | 0; continue; } break; }; $24($7_1); if ($3) { break block12 } break block13; } } HEAP32[$0_1 + 80 >> 2] = $25; HEAP32[$0_1 + 76 >> 2] = $26_1; $550($0_1); $2_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; HEAP32[$2_1 + 96 >> 2] = 0; HEAP32[$2_1 + 128 >> 2] = HEAP32[$0_1 + 68 >> 2]; HEAP32[$2_1 + 100 >> 2] = 0; $5_1 = $2_1 + 100 | 0; $3 = 1; block24 : { while (1) { if (($3 | 0) != 5) { $8_1 = $3 + 3 | 0; $11_1 = $539($0_1, $8_1, 1); if (($11_1 | 0) != 5) { if ($11_1) { break block24 } block26 : { block25 : { if (($3 | 0) != 1) { break block25 } $7_1 = HEAP32[$0_1 + 68 >> 2]; if (!$7_1) { break block25 } HEAP32[$2_1 + 104 >> 2] = $7_1; break block26; } HEAP32[$5_1 + ($3 << 2) >> 2] = -1; } $541($0_1, $8_1, 1); } $3 = $3 + 1 | 0; continue; } break; }; if (!HEAP32[$0_1 + 72 >> 2]) { break block24 } $2_1 = HEAP32[$0_1 + 68 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$0_1 + 108 >> 2]; HEAP32[$4_1 >> 2] = $2_1; $64(283, 6981, $4_1); } $3 = $11_1; } $541($0_1, $15_1, $16_1); } HEAP32[$1_1 >> 2] = 1; $2_1 = 0; } $11_1 = $2_1; if (!$14) { HEAP8[$0_1 + 44 | 0] = 0; $541($0_1, 0, 1); } if (!$11_1) { break block5 } } if (HEAP32[$0_1 + 52 >> 2] == 3007e3) { break block5 } $3 = $75(67847); } if (!HEAPU8[$0_1 + 50 | 0]) { break block1 } if ($3) { break block6 } $3 = 0; break block28; } $572($0_1, 0); HEAP8[$0_1 + 50 | 0] = 0; $3 = ($3 | 0) == 522 ? -1 : $3; } HEAP8[$0_1 + 43 | 0] = 0; } $0_1 = $4_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $567($0_1, $1_1) { var $2_1 = 0; if (!HEAPU8[$0_1 + 43 | 0]) { $0_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 56 >> 2]]($0_1, $1_1, 1, 6) | 0; } return $2_1; } function $568($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if ((HEAPU8[$0_1 + 84 | 0] | HEAPU8[$0_1 + 85 | 0] << 8 | (HEAPU8[$0_1 + 86 | 0] << 16 | HEAPU8[$0_1 + 87 | 0] << 24)) != (HEAPU8[$4_1 + 8 | 0] | HEAPU8[$4_1 + 9 | 0] << 8 | (HEAPU8[$4_1 + 10 | 0] << 16 | HEAPU8[$4_1 + 11 | 0] << 24)) | (HEAPU8[$0_1 + 88 | 0] | HEAPU8[$0_1 + 89 | 0] << 8 | (HEAPU8[$0_1 + 90 | 0] << 16 | HEAPU8[$0_1 + 91 | 0] << 24)) != (HEAPU8[$4_1 + 12 | 0] | HEAPU8[$4_1 + 13 | 0] << 8 | (HEAPU8[$4_1 + 14 | 0] << 16 | HEAPU8[$4_1 + 15 | 0] << 24))) { break block } $6_1 = $156($4_1); if (!$6_1) { break block } $7_1 = !HEAPU8[$0_1 + 65 | 0]; $5_1 = $0_1 + 76 | 0; $544($7_1, $4_1, 8, $5_1, $5_1); $544($7_1, $3, HEAP32[$0_1 + 36 >> 2], $5_1, $5_1); if (HEAP32[$0_1 + 76 >> 2] != ($156($4_1 + 16 | 0) | 0)) { break block } if (HEAP32[$0_1 + 80 >> 2] != ($156($4_1 + 20 | 0) | 0)) { break block } HEAP32[$1_1 >> 2] = $6_1; HEAP32[$2_1 >> 2] = $156($4_1 + 4 | 0); $8_1 = 1; } return $8_1; } function $569($0_1) { var $1_1 = 0; $574($0_1); $1_1 = HEAP16[$0_1 + 40 >> 1]; if (($1_1 | 0) >= 0) { $542($0_1, $1_1 + 3 & 65535); HEAP16[$0_1 + 40 >> 1] = 65535; } } function $570($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block1 : { if (($1_1 | 0) < HEAP32[$0_1 + 24 >> 2]) { $3 = HEAP32[HEAP32[$0_1 + 32 >> 2] + ($1_1 << 2) >> 2]; HEAP32[$2_1 >> 2] = $3; $4_1 = 0; if ($3) { break block1 } } $4_1 = $2_1; block2 : { if (($1_1 | 0) >= HEAP32[$0_1 + 24 >> 2]) { $2_1 = $1_1 + 1 | 0; $3 = $33(HEAP32[$0_1 + 32 >> 2], $2_1 << 2, 0); if (!$3) { $2_1 = 7; $0_1 = 0; break block2; } $5_1 = HEAP32[$0_1 + 24 >> 2]; $6_1 = $2_1 - $5_1 << 2; if ($6_1) { wasm2js_memory_fill($3 + ($5_1 << 2) | 0, 0, $6_1) } HEAP32[$0_1 + 24 >> 2] = $2_1; HEAP32[$0_1 + 32 >> 2] = $3; } block5 : { if (HEAPU8[$0_1 + 43 | 0] == 2) { $2_1 = $132(32768, 0); HEAP32[HEAP32[$0_1 + 32 >> 2] + ($1_1 << 2) >> 2] = $2_1; $2_1 = $2_1 ? 0 : 7; break block5; } $2_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 52 >> 2]]($2_1, $1_1, 32768, HEAPU8[$0_1 + 44 | 0], HEAP32[$0_1 + 32 >> 2] + ($1_1 << 2) | 0) | 0; if (!$2_1) { $2_1 = 0; if (!$1_1) { break block5 } $3 = HEAP32[18950]; if (!$3) { break block5 } if (!(FUNCTION_TABLE[$3 | 0](600) | 0)) { break block5 } $2_1 = 7; break block5; } if (($2_1 & 255) != 8) { break block5 } HEAP8[$0_1 + 46 | 0] = HEAPU8[$0_1 + 46 | 0] | 2; $2_1 = ($2_1 | 0) != 8 ? $2_1 : 0; } $0_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] + ($1_1 << 2) >> 2]; } HEAP32[$4_1 >> 2] = $0_1; $4_1 = $2_1; } return $4_1; } function $571($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 112 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = $2_1 + 56 | 0; $4_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] >> 2]; wasm2js_memory_copy($3, $4_1, 48); $565($0_1); $5_1 = $2_1 + 8 | 0; wasm2js_memory_copy($5_1, $4_1 + 48 | 0, 48); $4_1 = 1; block2 : { if ($2014($3, $5_1, 48) | !HEAPU8[$2_1 + 68 | 0]) { break block2 } $544(1, $3, 40, 0, $2_1 + 104 | 0); if (HEAP32[$2_1 + 104 >> 2] != HEAP32[$2_1 + 96 >> 2] | HEAP32[$2_1 + 108 >> 2] != HEAP32[$2_1 + 100 >> 2]) { break block2 } $4_1 = 0; $5_1 = $0_1 + 52 | 0; if (!$2014($5_1, $3, 48)) { break block2 } HEAP32[$1_1 >> 2] = 1; wasm2js_memory_copy($5_1, $3, 48); $1_1 = $0_1; $0_1 = HEAPU16[$0_1 + 66 >> 1]; HEAP32[$1_1 + 36 >> 2] = ($0_1 << 16 | $0_1) & 130560; } $0_1 = $2_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $572($0_1, $1_1) { var $2_1 = 0, $3 = 0; block3 : { if (!(!HEAPU8[$0_1 + 50 | 0] & HEAPU8[$0_1 + 43 | 0] != 2)) { while (1) { if (!(HEAP32[$0_1 + 24 >> 2] <= ($2_1 | 0))) { $3 = $2_1 << 2; $24(HEAP32[$3 + HEAP32[$0_1 + 32 >> 2] >> 2]); HEAP32[HEAP32[$0_1 + 32 >> 2] + $3 >> 2] = 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; if (HEAPU8[$0_1 + 43 | 0] == 2) { break block3 } } $0_1 = HEAP32[$0_1 + 4 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 64 >> 2]]($0_1, $1_1) | 0; } } function $574($0_1) { if (HEAPU8[$0_1 + 44 | 0]) { $541($0_1, 0, 1); HEAP32[$0_1 + 104 >> 2] = 0; HEAP8[$0_1 + 44 | 0] = 0; HEAP8[$0_1 + 47 | 0] = 0; } } function $575($0_1, $1_1) { var $2_1 = 0; while (1) { $2_1 = $576($0_1, $1_1); if (($2_1 | 0) == 5) { if (FUNCTION_TABLE[HEAP32[$0_1 + 192 >> 2]](HEAP32[$0_1 + 196 >> 2]) | 0) { continue } } break; }; return $2_1; } function $576($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAPU8[$0_1 + 18 | 0]; block3 : { block1 : { if (($2_1 | 0) != 5 & $1_1 >>> 0 <= $2_1 >>> 0) { break block1 } if (!HEAPU8[$0_1 + 13 | 0]) { $2_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 28 >> 2]]($2_1, $1_1) | 0; if ($2_1) { break block3 } $2_1 = HEAPU8[$0_1 + 18 | 0]; } if (($2_1 & 255) == 5 & ($1_1 | 0) != 4) { break block1 } HEAP8[$0_1 + 18 | 0] = $1_1; } $2_1 = 0; } return $2_1; } function $577($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = HEAP32[$2_1 + 4 >> 2]; if (!HEAP32[$3 >> 2]) { $3 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 >> 2] = $2_1; $4_1 = $3 + 40 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $3 + 32 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $3 + 24 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $5_1 = HEAP32[$2_1 >> 2]; HEAP8[$3 + 48 | 0] = 0; HEAP8[$3 + 49 | 0] = 0; HEAP8[$3 + 50 | 0] = 0; HEAP8[$3 + 51 | 0] = 0; HEAP8[$3 + 52 | 0] = 0; HEAP8[$3 + 53 | 0] = 0; HEAP8[$3 + 54 | 0] = 0; HEAP8[$3 + 55 | 0] = 0; HEAP32[$3 + 8 >> 2] = $3 + 48; HEAP32[$3 + 4 >> 2] = $5_1; HEAP16[$3 + 28 >> 1] = 1; HEAP32[$4_1 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = $0_1; return $577($0_1, $1_1, $2_1); } $1_1 = HEAP32[$0_1 + 20 >> 2]; $2_1 = $1_1; $4_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $2_1 = $1_1 ? $2_1 : $4_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $2_1; $0_1 = HEAP32[$3 + 36 >> 2]; $1_1 = $0_1; $2_1 = $0_1 + 1 | 0; $0_1 = HEAP32[$3 + 32 >> 2] + 1 | 0; $1_1 = $0_1 ? $1_1 : $2_1; HEAP32[$3 + 32 >> 2] = $0_1; HEAP32[$3 + 36 >> 2] = $1_1; return $3; } function $578($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$4_1 + 12 >> 2] = 0; block1 : { block2 : { block : { $1_1 = HEAP32[$2_1 + 232 >> 2]; if (!$1_1) { break block } $1_1 = $545($1_1, HEAP32[$0_1 + 24 >> 2], $4_1 + 12 | 0); if ($1_1) { break block1 } $3 = HEAP32[$4_1 + 12 >> 2]; if (!$3) { break block } $1_1 = HEAP32[$2_1 + 232 >> 2]; $5_1 = HEAP32[$1_1 + 8 >> 2]; $7_1 = HEAP32[$0_1 + 4 >> 2]; $6_1 = HEAP32[$2_1 + 168 >> 2]; $1_1 = HEAPU16[$1_1 + 66 >> 1]; $1_1 = ($1_1 << 16 | $1_1) & 130560; $6_1 = ($1_1 | 0) > ($6_1 | 0) ? $6_1 : $1_1; $3 = __wasm_i64_mul($1_1 | 24, 0, $3 - 1 | 0, 0); $1_1 = i64toi32_i32$HIGH_BITS; $3 = $3 + 56 | 0; $1_1 = $3 >>> 0 < 56 ? $1_1 + 1 | 0 : $1_1; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 8 >> 2]]($5_1, $7_1, $6_1, $3, $1_1) | 0; break block2; } $1_1 = HEAP32[$2_1 + 64 >> 2]; $5_1 = HEAP32[$0_1 + 4 >> 2]; $3 = HEAP32[$2_1 + 168 >> 2]; $7_1 = __wasm_i64_mul($3, HEAP32[$2_1 + 172 >> 2], HEAP32[$0_1 + 24 >> 2] - 1 | 0, 0); $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 8 >> 2]]($1_1, $5_1, $3, $7_1, i64toi32_i32$HIGH_BITS) | 0; $1_1 = ($1_1 | 0) != 522 ? $1_1 : 0; } if (HEAP32[$0_1 + 24 >> 2] != 1) { break block1 } if ($1_1) { HEAP32[$2_1 + 112 >> 2] = -1; HEAP32[$2_1 + 116 >> 2] = -1; $0_1 = $2_1 + 120 | 0; HEAP32[$0_1 >> 2] = -1; HEAP32[$0_1 + 4 >> 2] = -1; break block1; } $0_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAPU8[$0_1 + 28 | 0] | HEAPU8[$0_1 + 29 | 0] << 8 | (HEAPU8[$0_1 + 30 | 0] << 16 | HEAPU8[$0_1 + 31 | 0] << 24); $3 = HEAPU8[$0_1 + 24 | 0] | HEAPU8[$0_1 + 25 | 0] << 8 | (HEAPU8[$0_1 + 26 | 0] << 16 | HEAPU8[$0_1 + 27 | 0] << 24); HEAP8[$2_1 + 112 | 0] = $3; HEAP8[$2_1 + 113 | 0] = $3 >>> 8; HEAP8[$2_1 + 114 | 0] = $3 >>> 16; HEAP8[$2_1 + 115 | 0] = $3 >>> 24; HEAP8[$2_1 + 116 | 0] = $1_1; HEAP8[$2_1 + 117 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 118 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 119 | 0] = $1_1 >>> 24; $0_1 = $0_1 + 32 | 0; $1_1 = HEAPU8[$0_1 + 4 | 0] | HEAPU8[$0_1 + 5 | 0] << 8 | (HEAPU8[$0_1 + 6 | 0] << 16 | HEAPU8[$0_1 + 7 | 0] << 24); $2_1 = $2_1 + 120 | 0; $0_1 = HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8 | (HEAPU8[$0_1 + 2 | 0] << 16 | HEAPU8[$0_1 + 3 | 0] << 24); HEAP8[$2_1 | 0] = $0_1; HEAP8[$2_1 + 1 | 0] = $0_1 >>> 8; HEAP8[$2_1 + 2 | 0] = $0_1 >>> 16; HEAP8[$2_1 + 3 | 0] = $0_1 >>> 24; HEAP8[$2_1 + 4 | 0] = $1_1; HEAP8[$2_1 + 5 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 6 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 7 | 0] = $1_1 >>> 24; $1_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $579($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; if (HEAPU8[$0_1 + 28 | 0] & 2) { $503($0_1, 1) } $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = HEAP32[$1_1 + 16 >> 2]; $3 = HEAP32[$1_1 + 20 >> 2] - 1 | 0; $2_1 = $2_1 - 1 | 0; $3 = ($2_1 | 0) != -1 ? $3 + 1 | 0 : $3; HEAP32[$1_1 + 16 >> 2] = $2_1; HEAP32[$1_1 + 20 >> 2] = $3; FUNCTION_TABLE[HEAP32[18919]](HEAP32[$1_1 + 52 >> 2], HEAP32[$0_1 >> 2], 1); } function $580($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 228 >> 2]; if (!(HEAP32[$1_1 + 16 >> 2] | HEAP32[$1_1 + 20 >> 2])) { $521($0_1) } } function $582($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $5_1 = global$0 - 48 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[$0_1 >> 2]; HEAP32[$5_1 + 16 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 1; HEAP32[$5_1 + 8 >> 2] = HEAP32[$0_1 + 168 >> 2]; block14 : { block : { $2_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$2_1 >> 2] + 24 >> 2]]($2_1, $5_1 + 24 | 0) | 0; if ($2_1) { break block } $3 = HEAP32[$0_1 + 224 >> 2]; $2_1 = $588(HEAP32[$0_1 + 68 >> 2], $3, HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] + 1 | 0); block1 : { if ($2_1) { break block1 } if (!HEAPU8[$3 | 0]) { $2_1 = 0; break block1; } $2_1 = FUNCTION_TABLE[HEAP32[$4_1 + 32 >> 2]]($4_1, $3, 0, $5_1 + 12 | 0) | 0; } block5 : { block3 : { if (!HEAP32[$5_1 + 12 >> 2] | $2_1) { break block3 } HEAP32[$0_1 + 80 >> 2] = 0; HEAP32[$0_1 + 84 >> 2] = 0; $9_1 = $0_1 + 80 | 0; $8_1 = $1_1; label : while (1) { $2_1 = $589($0_1, $1_1, HEAP32[$5_1 + 24 >> 2], HEAP32[$5_1 + 28 >> 2], $5_1 + 20 | 0, $5_1 + 16 | 0); if ($2_1) { if (($2_1 | 0) == 101) { break block5 } break block; } $2_1 = HEAP32[$0_1 + 156 >> 2]; $4_1 = HEAP32[$5_1 + 20 >> 2]; if (($4_1 | 0) == -1) { $4_1 = HEAP32[$5_1 + 24 >> 2]; $6_1 = $4_1 - $2_1 | 0; $4_1 = HEAP32[$5_1 + 28 >> 2] - ($2_1 >>> 0 > $4_1 >>> 0) | 0; $3 = HEAP32[$0_1 + 172 >> 2]; $7_1 = HEAP32[$0_1 + 168 >> 2] + 8 | 0; $3 = $7_1 >>> 0 < 8 ? $3 + 1 | 0 : $3; $4_1 = __wasm_i64_sdiv($6_1, $4_1, $7_1, $3); HEAP32[$5_1 + 20 >> 2] = $4_1; } $3 = HEAP32[$9_1 >> 2]; $6_1 = HEAP32[$9_1 + 4 >> 2]; block8 : { if ($1_1 | $4_1) { break block8 } $7_1 = HEAP32[$0_1 + 92 >> 2]; $10_1 = $2_1 + HEAP32[$0_1 + 88 >> 2] | 0; $7_1 = $10_1 >>> 0 < $2_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; if (($3 | 0) != ($10_1 | 0) | ($6_1 | 0) != ($7_1 | 0)) { break block8 } $4_1 = HEAP32[$5_1 + 24 >> 2]; $7_1 = $4_1 - $3 | 0; $10_1 = HEAP32[$5_1 + 28 >> 2] - (($3 >>> 0 > $4_1 >>> 0) + $6_1 | 0) | 0; $4_1 = HEAP32[$0_1 + 172 >> 2]; $11_1 = HEAP32[$0_1 + 168 >> 2] + 8 | 0; $4_1 = $11_1 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; $4_1 = __wasm_i64_sdiv($7_1, $10_1, $11_1, $4_1); HEAP32[$5_1 + 20 >> 2] = $4_1; } block9 : { if (($2_1 | 0) != ($3 | 0) | $6_1) { break block9 } $3 = HEAP32[$5_1 + 16 >> 2]; $2_1 = $174($0_1, $3); if ($2_1) { break block } HEAP32[$0_1 + 28 >> 2] = $3; if ($3 >>> 0 <= HEAPU32[$0_1 + 160 >> 2]) { break block9 } HEAP32[$0_1 + 160 >> 2] = $3; } $3 = $4_1 + $12_1 | 0; $6_1 = 0; while (1) { if (($4_1 | 0) == ($6_1 | 0)) { $12_1 = $3; continue label; } if ($8_1) { $516($0_1) } block13 : { $2_1 = $590($0_1, $9_1, 0, 1, 0); if ($2_1) { if (($2_1 | 0) == 101) { break block13 } if (($2_1 | 0) == 522) { break block5 } break block3; } $6_1 = $6_1 + 1 | 0; $12_1 = $12_1 + 1 | 0; $8_1 = 0; continue; } break; }; $2_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$9_1 >> 2] = HEAP32[$5_1 + 24 >> 2]; HEAP32[$9_1 + 4 >> 2] = $2_1; $8_1 = 0; continue; }; } if ($2_1) { break block } } $2_1 = $425($0_1, $5_1 + 8 | 0, -1); HEAP8[$0_1 + 19 | 0] = HEAPU8[$0_1 + 12 | 0]; if ($2_1) { break block14 } $10_1 = HEAP32[$0_1 + 224 >> 2] + 4 | 0; $2_1 = $588(HEAP32[$0_1 + 68 >> 2], $10_1, HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] + 1 | 0); if ($2_1) { break block14 } if ((HEAPU8[$0_1 + 17 | 0] - 4 & 255) >>> 0 <= 252) { $2_1 = $152($0_1, 0); if ($2_1) { break block14 } } $2_1 = $175($0_1, HEAPU8[$10_1 | 0] != 0, 0); if ($2_1) { break block14 } if (!(!HEAPU8[$10_1 | 0] | !HEAP32[$5_1 + 12 >> 2])) { $4_1 = 0; $2_1 = HEAP32[$0_1 + 224 >> 2]; HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; $2_1 = 7; $7_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$7_1 + 4 >> 2] << 1; $6_1 = $132($3, $3 >> 31); block17 : { if (!$6_1) { break block17 } $3 = FUNCTION_TABLE[HEAP32[$7_1 + 24 >> 2]]($7_1, $10_1, $6_1, 16385, 0) | 0; if ($3) { $2_1 = $3; break block17; } $9_1 = HEAP32[$7_1 + 4 >> 2]; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 24 >> 2]]($6_1, $5_1 + 40 | 0) | 0; if ($3) { $2_1 = $3; break block17; } $14 = HEAP32[$7_1 + 8 >> 2] + 1 | 0; $3 = HEAP32[$5_1 + 44 >> 2] + ($14 >> 31) | 0; $8_1 = $14 + HEAP32[$5_1 + 40 >> 2] | 0; $3 = $8_1 >>> 0 < $14 >>> 0 ? $3 + 1 | 0 : $3; $8_1 = $8_1 + 6 | 0; $3 = $8_1 >>> 0 < 6 ? $3 + 1 | 0 : $3; $3 = $30($8_1, $3); if (!$3) { break block17 } HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; block23 : { $8_1 = $3 + 4 | 0; $4_1 = HEAP32[$5_1 + 40 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 8 >> 2]]($6_1, $8_1, $4_1, 0, 0) | 0; block20 : { if ($2_1) { break block20 } $11_1 = $6_1 + $9_1 | 0; $15_1 = ($4_1 + $8_1 | 0) + 2 | 0; HEAP8[HEAP32[$5_1 + 40 >> 2] + $8_1 | 0] = 0; HEAP8[(HEAP32[$5_1 + 40 >> 2] + $8_1 | 0) + 1 | 0] = 0; $4_1 = $8_1; while (1) { $9_1 = HEAP32[$5_1 + 44 >> 2]; $2_1 = $4_1 - $8_1 | 0; $13_1 = $2_1 >> 31; if (!(($9_1 | 0) <= ($13_1 | 0) & $2_1 >>> 0 >= HEAPU32[$5_1 + 40 >> 2] | ($9_1 | 0) < ($13_1 | 0))) { $2_1 = FUNCTION_TABLE[HEAP32[$7_1 + 32 >> 2]]($7_1, $4_1, 0, $5_1 + 36 | 0) | 0; if ($2_1) { break block20 } block22 : { if (!HEAP32[$5_1 + 36 >> 2]) { break block22 } $9_1 = FUNCTION_TABLE[HEAP32[$7_1 + 24 >> 2]]($7_1, $4_1, $11_1, 16385, 0) | 0; if ($9_1) { break block23 } $9_1 = $588($11_1, $15_1, $14); $13_1 = HEAP32[$11_1 >> 2]; if ($13_1) { FUNCTION_TABLE[HEAP32[$13_1 + 4 >> 2]]($11_1) | 0; HEAP32[$11_1 >> 2] = 0; } if ($9_1) { break block23 } if (!HEAPU8[$15_1 | 0]) { break block22 } if (!$2073($15_1, $10_1)) { break block20 } } $4_1 = ($48($4_1) + $4_1 | 0) + 1 | 0; continue; } break; }; $2_1 = HEAP32[$6_1 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($6_1) | 0; HEAP32[$6_1 >> 2] = 0; } $2_1 = HEAP32[$7_1 + 28 >> 2]; if (!$2_1) { $2_1 = 0; break block20; } $2_1 = FUNCTION_TABLE[$2_1 | 0]($7_1, $10_1, 0) | 0; } $4_1 = $3; break block17; } $4_1 = $3; $2_1 = $9_1; } $24($4_1); if (!$6_1) { break block14 } $4_1 = HEAP32[$6_1 >> 2]; if ($4_1) { FUNCTION_TABLE[HEAP32[$4_1 + 4 >> 2]]($6_1) | 0; HEAP32[$6_1 >> 2] = 0; } $24($6_1); break block14; } $2_1 = 0; break block14; } HEAP8[$0_1 + 19 | 0] = HEAPU8[$0_1 + 12 | 0]; } if (!(!$1_1 | !$12_1)) { HEAP32[$5_1 + 4 >> 2] = HEAP32[$0_1 + 188 >> 2]; HEAP32[$5_1 >> 2] = $12_1; $64(539, 6762, $5_1); } $504($0_1); $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $583($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $9_1 = global$0 - 16 | 0; $3 = $9_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$0_1 + 44 >> 2]; block : { if ($4_1) { break block } $4_1 = 0; $5_1 = HEAP32[$0_1 + 104 >> 2]; if (($5_1 | 0) <= ($2_1 | 0)) { break block } $3 = (($1_1 | 0) != 1) + $2_1 | 0; $2_1 = $3; while (1) { if (!(($2_1 | 0) >= ($5_1 | 0))) { $434(HEAP32[(HEAP32[$0_1 + 100 >> 2] + Math_imul($2_1, 48) | 0) + 16 >> 2]); $2_1 = $2_1 + 1 | 0; $5_1 = HEAP32[$0_1 + 104 >> 2]; continue; } break; }; HEAP32[$0_1 + 104 >> 2] = $3; if (($1_1 | 0) == 1) { $3 = HEAP32[$0_1 + 100 >> 2] + Math_imul($3, 48) | 0; if (!HEAP32[$3 + 28 >> 2]) { break block } $1_1 = HEAP32[$0_1 + 72 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block } if (($2_1 | 0) == 33512) { $2_1 = HEAP32[$0_1 + 172 >> 2]; $4_1 = HEAP32[$0_1 + 168 >> 2] + 4 | 0; $2_1 = $4_1 >>> 0 < 4 ? $2_1 + 1 | 0 : $2_1; $4_1 = $558($1_1, __wasm_i64_mul($4_1, $2_1, HEAP32[$3 + 24 >> 2], 0), i64toi32_i32$HIGH_BITS); } HEAP32[$0_1 + 56 >> 2] = HEAP32[$3 + 24 >> 2]; break block; } if (!(HEAP32[$0_1 + 232 >> 2] | HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2])) { break block } block7 : { block5 : { if (!$3) { break block5 } $1_1 = HEAP32[$0_1 + 100 >> 2] + Math_imul($3, 48) | 0; $6_1 = $1_1 - 48 | 0; if (!$6_1) { break block5 } $2_1 = $1_1 - 28 | 0; $12_1 = $426(HEAP32[$2_1 >> 2]); if (!$12_1) { $4_1 = 7; break block; } $8_1 = 0; break block7; } $2_1 = $0_1 + 32 | 0; $6_1 = 0; $8_1 = 1; } HEAP32[$0_1 + 28 >> 2] = HEAP32[$2_1 >> 2]; HEAP8[$0_1 + 19 | 0] = HEAPU8[$0_1 + 12 | 0]; block17 : { block18 : { block10 : { if ($8_1) { $3 = HEAP32[$0_1 + 232 >> 2]; if (!$3) { $5_1 = $0_1 + 80 | 0; $3 = HEAP32[$0_1 + 80 >> 2]; $10_1 = HEAP32[$0_1 + 84 >> 2]; break block10; } HEAP32[$0_1 + 28 >> 2] = HEAP32[$0_1 + 32 >> 2]; block12 : { if (!HEAPU8[$3 + 44 | 0]) { break block12 } $5_1 = HEAP32[$3 + 68 >> 2]; wasm2js_memory_copy($3 + 52 | 0, HEAP32[HEAP32[$3 + 32 >> 2] >> 2], 48); $2_1 = HEAP32[$3 + 68 >> 2]; while (1) { block14 : { if ($4_1) { break block14 } $1_1 = $2_1 + 1 | 0; if ($1_1 >>> 0 > $5_1 >>> 0) { break block14 } $2_1 = $2_1 + 34 | 0; if ($2_1 >>> 0 <= 4095) { $2_1 = (HEAP32[HEAP32[$3 + 32 >> 2] >> 2] + ($1_1 << 2) | 0) + 132 | 0 } else { $2_1 = HEAP32[HEAP32[$3 + 32 >> 2] + ($2_1 >>> 10 & 4194300) >> 2] + (($2_1 & 4095) << 2) | 0 } $4_1 = $591($0_1, HEAP32[$2_1 >> 2]); $2_1 = $1_1; continue; } break; }; if (($5_1 | 0) == HEAP32[$3 + 68 >> 2]) { break block12 } $564($3); } $2_1 = $166(HEAP32[$0_1 + 228 >> 2]); while (1) { if ($4_1 | !$2_1) { break block } $1_1 = HEAP32[$2_1 + 16 >> 2]; $4_1 = $591($0_1, HEAP32[$2_1 + 24 >> 2]); $2_1 = $1_1; continue; }; } $5_1 = $0_1 + 80 | 0; $3 = HEAP32[$0_1 + 80 >> 2]; $10_1 = HEAP32[$0_1 + 84 >> 2]; if (HEAP32[$0_1 + 232 >> 2]) { break block10 } $1_1 = HEAP32[$6_1 + 8 >> 2]; $2_1 = HEAP32[$6_1 + 12 >> 2]; $4_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$5_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 4 >> 2] = $4_1; $4_1 = !($1_1 | $2_1); $1_1 = $4_1 ? $3 : $1_1; $2_1 = $4_1 ? $10_1 : $2_1; $4_1 = 0; while (1) { if ($4_1) { break block17 } $7_1 = HEAP32[$5_1 + 4 >> 2]; if (($2_1 | 0) <= ($7_1 | 0) & $1_1 >>> 0 <= HEAPU32[$5_1 >> 2] | ($2_1 | 0) < ($7_1 | 0)) { break block18 } $4_1 = $590($0_1, $5_1, $12_1, 1, 1); continue; }; } HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; } $4_1 = 0; } label4 : while (1) { block19 : { if ($4_1) { break block19 } $2_1 = HEAP32[$5_1 + 4 >> 2]; if (($10_1 | 0) <= ($2_1 | 0) & $3 >>> 0 <= HEAPU32[$5_1 >> 2] | ($2_1 | 0) > ($10_1 | 0)) { break block19 } HEAP32[$9_1 >> 2] = 0; $4_1 = $589($0_1, 0, $3, $10_1, $9_1, $9_1 + 12 | 0); $1_1 = HEAP32[$9_1 >> 2]; block20 : { if ($1_1) { break block20 } $1_1 = 0; $7_1 = HEAP32[$0_1 + 92 >> 2]; $11_1 = HEAP32[$0_1 + 156 >> 2]; $2_1 = $11_1 + HEAP32[$0_1 + 88 >> 2] | 0; $7_1 = $2_1 >>> 0 < $11_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; if (($2_1 | 0) != HEAP32[$0_1 + 80 >> 2] | ($7_1 | 0) != HEAP32[$0_1 + 84 >> 2]) { break block20 } $11_1 = $3 - $2_1 | 0; $2_1 = $10_1 - ($7_1 + ($2_1 >>> 0 > $3 >>> 0) | 0) | 0; $1_1 = HEAP32[$0_1 + 172 >> 2]; $7_1 = HEAP32[$0_1 + 168 >> 2] + 8 | 0; $1_1 = $7_1 >>> 0 < 8 ? $1_1 + 1 | 0 : $1_1; $1_1 = __wasm_i64_sdiv($11_1, $2_1, $7_1, $1_1); } $2_1 = 0; while (1) { if ($1_1 >>> 0 <= $2_1 >>> 0 | $4_1) { continue label4 } $11_1 = HEAP32[$5_1 + 4 >> 2]; if (($10_1 | 0) <= ($11_1 | 0) & $3 >>> 0 <= HEAPU32[$5_1 >> 2] | ($10_1 | 0) < ($11_1 | 0)) { continue label4 } $2_1 = $2_1 + 1 | 0; $4_1 = $590($0_1, $5_1, $12_1, 1, 1); continue; }; } break; }; block21 : { if ($8_1) { break block21 } $1_1 = HEAP32[$0_1 + 172 >> 2]; $8_1 = HEAP32[$0_1 + 168 >> 2] + 4 | 0; $1_1 = $8_1 >>> 0 < 4 ? $1_1 + 1 | 0 : $1_1; $2_1 = HEAP32[$6_1 + 24 >> 2]; HEAP32[$9_1 >> 2] = __wasm_i64_mul($8_1, $1_1, $2_1, 0); HEAP32[$9_1 + 4 >> 2] = i64toi32_i32$HIGH_BITS; $1_1 = HEAP32[$0_1 + 232 >> 2]; block22 : { if (!$1_1) { break block22 } $4_1 = 0; if (HEAP32[$6_1 + 44 >> 2] == HEAP32[$1_1 + 112 >> 2]) { $8_1 = HEAP32[$6_1 + 32 >> 2] } else { HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[$6_1 + 44 >> 2] = HEAP32[$1_1 + 112 >> 2]; $8_1 = 0; } if ($8_1 >>> 0 >= HEAPU32[$1_1 + 68 >> 2]) { break block22 } HEAP32[$1_1 + 68 >> 2] = $8_1; HEAP32[$1_1 + 76 >> 2] = HEAP32[$6_1 + 36 >> 2]; HEAP32[$1_1 + 80 >> 2] = HEAP32[$6_1 + 40 >> 2]; $564($1_1); $2_1 = HEAP32[$6_1 + 24 >> 2]; } while (1) { if (HEAPU32[$0_1 + 56 >> 2] <= $2_1 >>> 0 | $4_1) { break block21 } $2_1 = $2_1 + 1 | 0; $4_1 = $590($0_1, $9_1, $12_1, 0, 1); continue; }; } $434($12_1); if ($4_1) { break block } HEAP32[$5_1 >> 2] = $3; HEAP32[$5_1 + 4 >> 2] = $10_1; $4_1 = 0; } $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $584($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; while (1) { if (!(HEAP32[$0_1 + 104 >> 2] <= ($1_1 | 0))) { $434(HEAP32[(HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 48) | 0) + 16 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $2_1 = HEAP32[$0_1 + 72 >> 2]; $1_1 = HEAP32[$2_1 >> 2]; block3 : { block2 : { if (HEAPU8[$0_1 + 4 | 0]) { $3 = 33512; if (($1_1 | 0) == 33512) { break block2 } break block3; } $3 = $1_1; if (!$1_1) { break block3 } } FUNCTION_TABLE[HEAP32[$3 + 4 >> 2]]($2_1) | 0; HEAP32[$2_1 >> 2] = 0; } $24(HEAP32[$0_1 + 100 >> 2]); HEAP32[$0_1 + 56 >> 2] = 0; HEAP32[$0_1 + 100 >> 2] = 0; HEAP32[$0_1 + 104 >> 2] = 0; } function $585($0_1, $1_1) { var $2_1 = 0, $3 = 0; if (HEAP32[$0_1 + 52 >> 2]) { $2_1 = HEAP32[$0_1 >> 2]; while (1) { $3 = $2_1; if ($3) { $2_1 = HEAP32[$3 + 40 >> 2]; if (HEAPU32[$3 + 24 >> 2] <= $1_1 >>> 0) { continue } $536($3); continue; } break; }; block2 : { if ($1_1) { break block2 } if (!(HEAP32[$0_1 + 16 >> 2] | HEAP32[$0_1 + 20 >> 2])) { $1_1 = 0; break block2; } $1_1 = 0; $2_1 = FUNCTION_TABLE[HEAP32[18918]](HEAP32[$0_1 + 52 >> 2], 1, 0) | 0; if (!$2_1) { break block2 } $1_1 = HEAP32[$0_1 + 32 >> 2]; if ($1_1) { wasm2js_memory_fill(HEAP32[$2_1 >> 2], 0, $1_1) } $1_1 = 1; } FUNCTION_TABLE[HEAP32[18921]](HEAP32[$0_1 + 52 >> 2], $1_1 + 1 | 0); } } function $586($0_1, $1_1) { if (!$1_1) { if (!HEAPU8[$0_1 + 43 | 0]) { return 0 } HEAP8[$0_1 + 43 | 0] = 0; if (!$567($0_1, HEAP16[$0_1 + 40 >> 1] + 3 | 0)) { return !HEAPU8[$0_1 + 43 | 0] } HEAP8[$0_1 + 43 | 0] = 1; return 0; } if (($1_1 | 0) > 0) { $542($0_1, HEAP16[$0_1 + 40 >> 1] + 3 | 0); HEAP8[$0_1 + 43 | 0] = 1; return 1; } return !HEAPU8[$0_1 + 43 | 0]; } function $587($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$0_1 + 64 >> 2]; $3 = HEAP32[$2_1 >> 2]; block1 : { if (!$3) { break block1 } if (!HEAPU8[$0_1 + 13 | 0]) { $4_1 = FUNCTION_TABLE[HEAP32[$3 + 32 >> 2]]($2_1, $1_1) | 0 } if (HEAPU8[$0_1 + 18 | 0] == 5) { break block1 } HEAP8[$0_1 + 18 | 0] = $1_1; } HEAP8[$0_1 + 19 | 0] = HEAPU8[$0_1 + 12 | 0]; return $4_1; } function $588($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 32 | 0; $7_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $7_1; HEAP8[$1_1 | 0] = 0; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 24 >> 2]]($0_1, $3 + 16 | 0) | 0; block : { if ($5_1) { break block } $7_1 = HEAP32[$3 + 16 >> 2]; $4_1 = HEAP32[$3 + 20 >> 2]; if ($7_1 >>> 0 < 16 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0) { break block } $4_1 = $4_1 - 1 | 0; $7_1 = $7_1 - 16 | 0; $4_1 = $7_1 >>> 0 < 4294967280 ? $4_1 + 1 | 0 : $4_1; $5_1 = $592($0_1, $7_1, $4_1, $3 + 28 | 0); if ($5_1) { break block } $5_1 = 0; $7_1 = HEAP32[$3 + 28 >> 2]; if ($7_1 >>> 0 >= $2_1 >>> 0 | !$7_1) { break block } $2_1 = HEAP32[$3 + 20 >> 2]; $8_1 = $2_1; $2_1 = $2_1 - 1 | 0; $4_1 = HEAP32[$3 + 16 >> 2]; $6_1 = $4_1 - 16 | 0; $2_1 = $6_1 >>> 0 < 4294967280 ? $2_1 + 1 | 0 : $2_1; if (($2_1 | 0) < 0) { $2_1 = 1 } else { $2_1 = $6_1 >>> 0 < $7_1 >>> 0 & ($2_1 | 0) <= 0 } if ($2_1) { break block } $6_1 = $8_1 - 1 | 0; $2_1 = $4_1 - 12 | 0; $6_1 = $2_1 >>> 0 < 4294967284 ? $6_1 + 1 | 0 : $6_1; $5_1 = $592($0_1, $2_1, $6_1, $3 + 12 | 0); if ($5_1) { break block } $2_1 = $3 + 4 | 0; $4_1 = HEAP32[$3 + 20 >> 2] - 1 | 0; $6_1 = HEAP32[$3 + 16 >> 2] - 8 | 0; $4_1 = $6_1 >>> 0 < 4294967288 ? $4_1 + 1 | 0 : $4_1; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]]($0_1, $2_1, 8, $6_1, $4_1) | 0; if ($5_1) { break block } $5_1 = 0; if ((HEAPU8[$3 + 4 | 0] | HEAPU8[$3 + 5 | 0] << 8 | (HEAPU8[$3 + 6 | 0] << 16 | HEAPU8[$3 + 7 | 0] << 24)) != -117058087 | (HEAPU8[$3 + 8 | 0] | HEAPU8[$3 + 9 | 0] << 8 | (HEAPU8[$3 + 10 | 0] << 16 | HEAPU8[$3 + 11 | 0] << 24)) != -681336544) { break block } $4_1 = HEAP32[$3 + 16 >> 2]; $2_1 = $7_1; $5_1 = $4_1 - $2_1 | 0; $6_1 = (HEAP32[$3 + 20 >> 2] - ($2_1 >>> 0 > $4_1 >>> 0) | 0) - 1 | 0; $4_1 = $5_1 - 16 | 0; $6_1 = $4_1 >>> 0 < 4294967280 ? $6_1 + 1 | 0 : $6_1; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]]($0_1, $1_1, $2_1, $4_1, $6_1) | 0; if ($5_1) { break block } $0_1 = 0; $2_1 = HEAP32[$3 + 12 >> 2]; while (1) { if (!(($0_1 | 0) == ($7_1 | 0))) { $2_1 = $2_1 - HEAP8[$0_1 + $1_1 | 0] | 0; $0_1 = $0_1 + 1 | 0; continue; } break; }; $5_1 = 0; $0_1 = ($2_1 ? 0 : $7_1) + $1_1 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; } $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $589($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $6_1 = global$0 - 16 | 0; $7_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $7_1; $9_1 = $170($0_1); HEAP32[$0_1 + 80 >> 2] = $9_1; $7_1 = i64toi32_i32$HIGH_BITS; HEAP32[$0_1 + 84 >> 2] = $7_1; $8_1 = 101; $10_1 = HEAP32[$0_1 + 156 >> 2]; $11_1 = $10_1 + $9_1 | 0; $10_1 = $10_1 >>> 0 > $11_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; block : { if ($2_1 >>> 0 < $11_1 >>> 0 & ($3 | 0) <= ($10_1 | 0) | ($3 | 0) < ($10_1 | 0)) { break block } if (!(!$1_1 & (HEAP32[$0_1 + 88 >> 2] == ($9_1 | 0) & HEAP32[$0_1 + 92 >> 2] == ($7_1 | 0)))) { $1_1 = HEAP32[$0_1 + 68 >> 2]; $8_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 8 >> 2]]($1_1, $6_1 + 8 | 0, 8, $9_1, $7_1) | 0; if ($8_1) { break block } $8_1 = 101; if ((HEAPU8[$6_1 + 8 | 0] | HEAPU8[$6_1 + 9 | 0] << 8 | (HEAPU8[$6_1 + 10 | 0] << 16 | HEAPU8[$6_1 + 11 | 0] << 24)) != -117058087 | (HEAPU8[$6_1 + 12 | 0] | HEAPU8[$6_1 + 13 | 0] << 8 | (HEAPU8[$6_1 + 14 | 0] << 16 | HEAPU8[$6_1 + 15 | 0] << 24)) != -681336544) { break block } } $2_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = $7_1; $3 = $9_1 + 8 | 0; $1_1 = $3 >>> 0 < 8 ? $1_1 + 1 | 0 : $1_1; $8_1 = $592($2_1, $3, $1_1, $4_1); if ($8_1) { break block } $2_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = $7_1; $3 = $9_1 + 12 | 0; $1_1 = $3 >>> 0 < 12 ? $1_1 + 1 | 0 : $1_1; $8_1 = $592($2_1, $3, $1_1, $0_1 + 52 | 0); if ($8_1) { break block } $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = $9_1 + 16 | 0; $10_1 = $2_1 >>> 0 < 16 ? $7_1 + 1 | 0 : $7_1; $8_1 = $592($1_1, $2_1, $10_1, $5_1); if ($8_1) { break block } $1_1 = HEAP32[$0_1 + 84 >> 2]; $3 = $1_1; $2_1 = HEAP32[$0_1 + 80 >> 2]; block4 : { if ($1_1 | $2_1) { $1_1 = HEAP32[$0_1 + 156 >> 2]; $8_1 = 0; break block4; } $2_1 = HEAP32[$0_1 + 68 >> 2]; $1_1 = $7_1; $3 = $9_1 + 20 | 0; $1_1 = $3 >>> 0 < 20 ? $1_1 + 1 | 0 : $1_1; $8_1 = $592($2_1, $3, $1_1, $6_1); if ($8_1) { break block } $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = $9_1 + 24 | 0; $7_1 = $2_1 >>> 0 < 24 ? $7_1 + 1 | 0 : $7_1; $8_1 = $592($1_1, $2_1, $7_1, $6_1 + 4 | 0); if ($8_1) { break block } $4_1 = HEAP32[$6_1 + 4 >> 2]; if (!$4_1) { $4_1 = HEAP32[$0_1 + 168 >> 2]; HEAP32[$6_1 + 4 >> 2] = $4_1; } $8_1 = 101; if ($4_1 - 65537 >>> 0 < 4294902271) { break block } $1_1 = HEAP32[$6_1 >> 2]; if ($4_1 + 131071 & $4_1 | $1_1 - 65537 >>> 0 < 4294901791 | $1_1 + 131071 & $1_1) { break block } $8_1 = $425($0_1, $6_1 + 4 | 0, -1); HEAP32[$0_1 + 156 >> 2] = $1_1; $2_1 = HEAP32[$0_1 + 80 >> 2]; $3 = HEAP32[$0_1 + 84 >> 2]; } $4_1 = $1_1; $1_1 = $1_1 + $2_1 | 0; $10_1 = $4_1 >>> 0 > $1_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$0_1 + 80 >> 2] = $1_1; HEAP32[$0_1 + 84 >> 2] = $10_1; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $590($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $7_1 = global$0 - 16 | 0; $8_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $8_1; $11_1 = HEAP32[$0_1 + 224 >> 2]; $8_1 = HEAP32[($3 ? 68 : 72) + $0_1 >> 2]; $5_1 = $592($8_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], $7_1 + 8 | 0); block : { if ($5_1) { break block } $6_1 = HEAP32[$0_1 + 168 >> 2]; $5_1 = HEAP32[$1_1 + 4 >> 2]; $9_1 = HEAP32[$1_1 >> 2] + 4 | 0; $5_1 = $9_1 >>> 0 < 4 ? $5_1 + 1 | 0 : $5_1; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$8_1 >> 2] + 8 >> 2]]($8_1, $11_1, $6_1, $9_1, $5_1) | 0; if ($5_1) { break block } $5_1 = HEAP32[$0_1 + 172 >> 2]; $6_1 = ($3 << 2) + 4 | 0; $10_1 = $6_1; $6_1 = $6_1 + HEAP32[$0_1 + 168 >> 2] | 0; $9_1 = HEAP32[$1_1 + 4 >> 2] + ($10_1 >>> 0 > $6_1 >>> 0 ? $5_1 + 1 | 0 : $5_1) | 0; $10_1 = $6_1; $6_1 = HEAP32[$1_1 >> 2]; $10_1 = $10_1 + $6_1 | 0; HEAP32[$1_1 >> 2] = $10_1; $9_1 = $6_1 >>> 0 > $10_1 >>> 0 ? $9_1 + 1 | 0 : $9_1; HEAP32[$1_1 + 4 >> 2] = $9_1; $5_1 = 101; $6_1 = HEAP32[$7_1 + 8 >> 2]; if (!$6_1 | HEAP32[$0_1 + 164 >> 2] == ($6_1 | 0)) { break block } $5_1 = 0; if (HEAPU32[$0_1 + 28 >> 2] < $6_1 >>> 0) { break block } if ($429($2_1, $6_1)) { break block } block1 : { if (!$3) { break block1 } $5_1 = $9_1 - 1 | 0; $9_1 = $10_1 - 4 | 0; $5_1 = $9_1 >>> 0 < 4294967292 ? $5_1 + 1 | 0 : $5_1; $5_1 = $592($8_1, $9_1, $5_1, $7_1 + 4 | 0); if ($5_1) { break block } if ($4_1) { break block1 } $5_1 = 101; if (($593($0_1, $11_1) | 0) != HEAP32[$7_1 + 4 >> 2]) { break block } } if ($2_1) { $5_1 = $427($2_1, $6_1); if ($5_1) { break block } } block3 : { if (($6_1 | 0) != 1) { break block3 } $2_1 = HEAPU8[$11_1 + 20 | 0]; if (($2_1 | 0) == HEAP16[$0_1 + 150 >> 1]) { break block3 } HEAP16[$0_1 + 150 >> 1] = $2_1; } block9 : { block7 : { block6 : { block5 : { if (!HEAP32[$0_1 + 232 >> 2]) { $2_1 = $594($0_1, $6_1); HEAP32[$7_1 + 12 >> 2] = $2_1; if (!$3) { break block5 } break block6; } $2_1 = 0; HEAP32[$7_1 + 12 >> 2] = 0; if ($3) { break block6 } break block7; } if (!$2_1) { $2_1 = 0; $1_1 = 1; break block9; } $1_1 = !(HEAPU8[$2_1 + 28 | 0] & 8); break block9; } if (HEAPU8[$0_1 + 7 | 0]) { break block7 } $4_1 = HEAP32[$1_1 + 4 >> 2]; $8_1 = HEAP32[$0_1 + 92 >> 2]; $1_1 = ($4_1 | 0) <= ($8_1 | 0) & HEAPU32[$1_1 >> 2] <= HEAPU32[$0_1 + 88 >> 2] | ($4_1 | 0) < ($8_1 | 0); break block9; } $1_1 = 1; } block14 : { block10 : { $4_1 = HEAP32[$0_1 + 64 >> 2]; $8_1 = HEAP32[$4_1 >> 2]; if (!$8_1) { break block10 } $5_1 = HEAPU8[$0_1 + 17 | 0]; block12 : { if ($5_1 >>> 0 <= 3) { if (!$5_1 & $1_1) { break block12 } break block10; } if (!$1_1) { break block10 } } $1_1 = HEAP32[$0_1 + 168 >> 2]; $3 = __wasm_i64_mul($1_1, HEAP32[$0_1 + 172 >> 2], $6_1 - 1 | 0, 0); $5_1 = FUNCTION_TABLE[HEAP32[$8_1 + 12 >> 2]]($4_1, $11_1, $1_1, $3, i64toi32_i32$HIGH_BITS) | 0; if ($6_1 >>> 0 > HEAPU32[$0_1 + 36 >> 2]) { HEAP32[$0_1 + 36 >> 2] = $6_1 } $1_1 = HEAP32[$0_1 + 96 >> 2]; if (!$1_1) { break block14 } $561($1_1, $6_1, $11_1); break block14; } $5_1 = 0; if ($2_1 | $3) { break block14 } HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] | 2; $5_1 = FUNCTION_TABLE[HEAP32[$0_1 + 220 >> 2]]($0_1, $6_1, $7_1 + 12 | 0, 1) | 0; HEAP8[$0_1 + 21 | 0] = HEAPU8[$0_1 + 21 | 0] & 253; if ($5_1) { break block } $595(HEAP32[$7_1 + 12 >> 2]); $2_1 = HEAP32[$7_1 + 12 >> 2]; $5_1 = 0; } if (!$2_1) { break block } $1_1 = HEAP32[$2_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 + 168 >> 2]; if ($2_1) { wasm2js_memory_copy($1_1, $11_1, $2_1) } FUNCTION_TABLE[HEAP32[$0_1 + 216 >> 2]](HEAP32[$7_1 + 12 >> 2]); if (($6_1 | 0) == 1) { $2_1 = HEAPU8[$1_1 + 28 | 0] | HEAPU8[$1_1 + 29 | 0] << 8 | (HEAPU8[$1_1 + 30 | 0] << 16 | HEAPU8[$1_1 + 31 | 0] << 24); $3 = HEAPU8[$1_1 + 24 | 0] | HEAPU8[$1_1 + 25 | 0] << 8 | (HEAPU8[$1_1 + 26 | 0] << 16 | HEAPU8[$1_1 + 27 | 0] << 24); HEAP8[$0_1 + 112 | 0] = $3; HEAP8[$0_1 + 113 | 0] = $3 >>> 8; HEAP8[$0_1 + 114 | 0] = $3 >>> 16; HEAP8[$0_1 + 115 | 0] = $3 >>> 24; HEAP8[$0_1 + 116 | 0] = $2_1; HEAP8[$0_1 + 117 | 0] = $2_1 >>> 8; HEAP8[$0_1 + 118 | 0] = $2_1 >>> 16; HEAP8[$0_1 + 119 | 0] = $2_1 >>> 24; $1_1 = $1_1 + 32 | 0; $2_1 = HEAPU8[$1_1 + 4 | 0] | HEAPU8[$1_1 + 5 | 0] << 8 | (HEAPU8[$1_1 + 6 | 0] << 16 | HEAPU8[$1_1 + 7 | 0] << 24); $0_1 = $0_1 + 120 | 0; $1_1 = HEAPU8[$1_1 | 0] | HEAPU8[$1_1 + 1 | 0] << 8 | (HEAPU8[$1_1 + 2 | 0] << 16 | HEAPU8[$1_1 + 3 | 0] << 24); HEAP8[$0_1 | 0] = $1_1; HEAP8[$0_1 + 1 | 0] = $1_1 >>> 8; HEAP8[$0_1 + 2 | 0] = $1_1 >>> 16; HEAP8[$0_1 + 3 | 0] = $1_1 >>> 24; HEAP8[$0_1 + 4 | 0] = $2_1; HEAP8[$0_1 + 5 | 0] = $2_1 >>> 8; HEAP8[$0_1 + 6 | 0] = $2_1 >>> 16; HEAP8[$0_1 + 7 | 0] = $2_1 >>> 24; } $501(HEAP32[$7_1 + 12 >> 2]); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $591($0_1, $1_1) { var $2_1 = 0; $1_1 = $594($0_1, $1_1); block : { if (!$1_1) { break block } if (!(HEAP32[$1_1 + 32 >> 2] != 1 | HEAP32[$1_1 + 36 >> 2] != 0)) { $579($1_1); break block; } $2_1 = $578($1_1); if (!$2_1) { FUNCTION_TABLE[HEAP32[$0_1 + 216 >> 2]]($1_1) } $128($1_1); } $165(HEAP32[$0_1 + 96 >> 2]); return $2_1; } function $592($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]]($0_1, $4_1 + 12 | 0, 4, $1_1, $2_1) | 0; if (!$1_1) { $0_1 = HEAPU8[$4_1 + 12 | 0] | HEAPU8[$4_1 + 13 | 0] << 8 | (HEAPU8[$4_1 + 14 | 0] << 16 | HEAPU8[$4_1 + 15 | 0] << 24); HEAP32[$3 >> 2] = $0_1 << 24 | ($0_1 & 65280) << 8 | ($0_1 >>> 8 & 65280 | $0_1 >>> 24); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $593($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 168 >> 2]; $0_1 = HEAP32[$0_1 + 52 >> 2]; while (1) { $2_1 = $2_1 - 200 | 0; if (!(($2_1 | 0) <= 0)) { $0_1 = HEAPU8[$1_1 + $2_1 | 0] + $0_1 | 0; continue; } break; }; return $0_1; } function $594($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = FUNCTION_TABLE[HEAP32[18918]](HEAP32[HEAP32[$0_1 + 228 >> 2] + 52 >> 2], $1_1, 0) | 0; if ($2_1) { $3 = $577(HEAP32[$0_1 + 228 >> 2], $1_1, $2_1) } return $3; } function $595($0_1) { var $1_1 = 0, $2_1 = 0; block : { $1_1 = HEAPU16[$0_1 + 28 >> 1]; if (!($1_1 & 17)) { break block } $2_1 = $1_1 & 65519; HEAP16[$0_1 + 28 >> 1] = $2_1; if (!($1_1 & 1)) { break block } HEAP16[$0_1 + 28 >> 1] = $2_1 ^ 3; $503($0_1, 2); } } function $596($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = global$0 - 48 | 0; $2_1 = $3; block1 : { label : while (1) { $4_1 = HEAP32[$0_1 + 24 >> 2]; while (1) { if (HEAPU32[$1_1 + 24 >> 2] > $4_1 >>> 0) { HEAP32[$2_1 + 16 >> 2] = $0_1; $2_1 = $0_1; $0_1 = HEAP32[$0_1 + 16 >> 2]; if ($0_1) { continue label } break block1; } HEAP32[$2_1 + 16 >> 2] = $1_1; $2_1 = $1_1; $1_1 = HEAP32[$1_1 + 16 >> 2]; if ($1_1) { continue } break; }; break; }; $1_1 = $0_1; } HEAP32[$2_1 + 16 >> 2] = $1_1; return HEAP32[$3 + 16 >> 2]; } function $597($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 52 >> 2]; HEAP8[$0_1 + 11 | 0] = HEAPU8[$2_1 + 21 | 0]; folding_inner1 : { folding_inner0 : { if ($1_1 >>> 0 >= 10) { HEAP8[$0_1 + 8 | 0] = 1; HEAP8[$0_1 + 10 | 0] = 0; block2 : { switch ($1_1 - 10 | 0) { case 3: HEAP32[$0_1 + 80 >> 2] = 23; HEAP32[$0_1 + 76 >> 2] = 24; HEAP8[$0_1 + 1 | 0] = 1; HEAP8[$0_1 + 2 | 0] = 1; break folding_inner0; case 0: HEAP32[$0_1 + 80 >> 2] = 25; HEAP32[$0_1 + 76 >> 2] = 26; break folding_inner1; default: break block2; }; } HEAP32[$0_1 + 80 >> 2] = 25; HEAP32[$0_1 + 76 >> 2] = 26; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; return $181(72832); } HEAP8[$0_1 + 8 | 0] = 0; HEAP8[$0_1 + 10 | 0] = 4; block5 : { switch ($1_1 - 2 | 0) { case 0: HEAP32[$0_1 + 80 >> 2] = 25; HEAP32[$0_1 + 76 >> 2] = 27; break folding_inner1; case 3: HEAP32[$0_1 + 80 >> 2] = 28; HEAP32[$0_1 + 76 >> 2] = 29; HEAP8[$0_1 + 1 | 0] = 1; HEAP8[$0_1 + 2 | 0] = 0; break folding_inner0; default: break block5; }; } HEAP32[$0_1 + 80 >> 2] = 25; HEAP32[$0_1 + 76 >> 2] = 27; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; return $181(72856); } HEAP16[$0_1 + 14 >> 1] = HEAPU16[$2_1 + 30 >> 1]; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$2_1 + 32 >> 1]; return 0; } HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP16[$0_1 + 14 >> 1] = HEAPU16[$2_1 + 26 >> 1]; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$2_1 + 28 >> 1]; return 0; } function $599($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = HEAP8[$1_1 | 0]; $8_1 = $5_1 & 255; block1 : { if (($5_1 | 0) >= 0) { $6_1 = $1_1; break block1; } $8_1 = $8_1 & 127; while (1) { $5_1 = $4_1 + 1 | 0; $6_1 = $5_1 + $1_1 | 0; $3 = HEAP8[$6_1 | 0]; $8_1 = $3 & 127 | $8_1 << 7; if (($3 | 0) >= 0) { break block1 } $3 = $4_1 >>> 0 < 7; $4_1 = $5_1; if ($3) { continue } break; }; } $4_1 = HEAP8[$6_1 + 1 | 0]; $3 = $4_1 & 255; $5_1 = 0; $7_1 = $6_1 + 1 | 0; block3 : { if (($4_1 | 0) >= 0) { break block3 } $5_1 = $3 >>> 25 | 0; $4_1 = HEAP8[$6_1 + 2 | 0]; $3 = $4_1 & 255 ^ $3 << 7; if (($4_1 | 0) < 0) { $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 3 | 0]; $3 = $4_1 & 255 ^ $3 << 7; if (($4_1 | 0) < 0) { $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 4 | 0]; $3 = $4_1 & 255 ^ $3 << 7 ^ 270548992; $7_1 = $6_1 + 4 | 0; if (($4_1 | 0) >= 0) { break block3 } $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 5 | 0]; $3 = $4_1 & 255 ^ $3 << 7 ^ 16384; $7_1 = $6_1 + 5 | 0; if (($4_1 | 0) >= 0) { break block3 } $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 6 | 0]; $3 = $4_1 & 255 ^ $3 << 7 ^ 16384; $7_1 = $6_1 + 6 | 0; if (($4_1 | 0) >= 0) { break block3 } $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 7 | 0]; $3 = $4_1 & 255 ^ $3 << 7 ^ 16384; $7_1 = $6_1 + 7 | 0; if (($4_1 | 0) >= 0) { break block3 } $5_1 = $5_1 << 7 | $3 >>> 25; $4_1 = HEAP8[$6_1 + 8 | 0]; $3 = $4_1 & 255 ^ $3 << 7 ^ 16384; $7_1 = $6_1 + 8 | 0; if (($4_1 | 0) >= 0) { break block3 } $5_1 = $5_1 << 8 | $3 >>> 24; $3 = (HEAPU8[$6_1 + 9 | 0] | $3 << 8) ^ 32768; $7_1 = $6_1 + 9 | 0; break block3; } $3 = $3 ^ 2113536; $7_1 = $6_1 + 3 | 0; break block3; } $3 = $3 & 16383; $5_1 = 0; $7_1 = $6_1 + 2 | 0; } $4_1 = $7_1; HEAP32[$2_1 + 12 >> 2] = $8_1; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $5_1; $5_1 = $4_1 + 1 | 0; HEAP32[$2_1 + 8 >> 2] = $5_1; if ($8_1 >>> 0 <= HEAPU16[$0_1 + 14 >> 1]) { HEAP16[$2_1 + 16 >> 1] = $8_1; $0_1 = ($5_1 - $1_1 | 0) + $8_1 | 0; HEAP16[$2_1 + 18 >> 1] = $0_1 & 65532 ? $0_1 : 4; return; } $606($0_1, $1_1, $2_1); } function $600($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP8[$1_1 | 0]; $4_1 = $2_1 & 255; block1 : { if (($2_1 | 0) >= 0) { $2_1 = $1_1; break block1; } $4_1 = $4_1 & 127; while (1) { $5_1 = $3 + 1 | 0; $2_1 = $5_1 + $1_1 | 0; $6_1 = HEAP8[$2_1 | 0]; $4_1 = $6_1 & 127 | $4_1 << 7; if (($6_1 | 0) >= 0) { break block1 } $6_1 = $3 >>> 0 < 7; $3 = $5_1; if ($6_1) { continue } break; }; } $3 = $2_1 + 2 | 0; block3 : { if (HEAP8[$2_1 + 1 | 0] >= 0) { break block3 } $3 = $2_1 + 3 | 0; if (HEAP8[$2_1 + 2 | 0] >= 0) { break block3 } $3 = $2_1 + 4 | 0; if (HEAP8[$2_1 + 3 | 0] >= 0) { break block3 } $3 = $2_1 + 5 | 0; if (HEAP8[$2_1 + 4 | 0] >= 0) { break block3 } $3 = $2_1 + 6 | 0; if (HEAP8[$2_1 + 5 | 0] >= 0) { break block3 } $3 = $2_1 + 7 | 0; if (HEAP8[$2_1 + 6 | 0] >= 0) { break block3 } $3 = $2_1 + 8 | 0; if (HEAP8[$2_1 + 7 | 0] >= 0) { break block3 } $3 = (HEAP8[$2_1 + 8 | 0] < 0 ? 10 : 9) + $2_1 | 0; } $5_1 = HEAPU16[$0_1 + 14 >> 1]; block11 : { if ($4_1 >>> 0 <= $5_1 >>> 0) { $0_1 = ($4_1 - $1_1 | 0) + $3 | 0; $0_1 = $0_1 >>> 0 <= 4 ? 4 : $0_1; break block11; } $2_1 = HEAPU16[$0_1 + 16 >> 1]; $0_1 = (($4_1 - $2_1 >>> 0) % (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] - 4 >>> 0) | 0) + $2_1 | 0; $0_1 = (($3 - $1_1 | 0) + ($0_1 >>> 0 > $5_1 >>> 0 ? $2_1 : $0_1) | 0) + 4 | 0; } return $0_1 & 65535; } function $601($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = HEAPU8[$0_1 + 10 | 0] + $1_1 | 0; $3 = HEAP8[$6_1 | 0]; $4_1 = $3 & 255; block1 : { if (($3 | 0) >= 0) { $7_1 = $6_1; break block1; } $4_1 = $4_1 & 127; $3 = 0; while (1) { $8_1 = $3 + 1 | 0; $7_1 = $8_1 + $6_1 | 0; $5_1 = HEAP8[$7_1 | 0]; $4_1 = $5_1 & 127 | $4_1 << 7; if (($5_1 | 0) >= 0) { break block1 } $5_1 = $3 >>> 0 < 7; $3 = $8_1; if ($5_1) { continue } break; }; } HEAP32[$2_1 + 12 >> 2] = $4_1; HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = 0; $3 = $7_1 + 1 | 0; HEAP32[$2_1 + 8 >> 2] = $3; if ($4_1 >>> 0 <= HEAPU16[$0_1 + 14 >> 1]) { HEAP16[$2_1 + 16 >> 1] = $4_1; $0_1 = ($3 - $1_1 | 0) + $4_1 | 0; HEAP16[$2_1 + 18 >> 1] = $0_1 & 65532 ? $0_1 : 4; return; } $606($0_1, $1_1, $2_1); } function $602($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP8[$1_1 | 0]; $3 = $2_1 & 255; block1 : { if (($2_1 | 0) >= 0) { $4_1 = $1_1; break block1; } $3 = $3 & 127; $2_1 = 0; while (1) { $5_1 = $2_1 + 1 | 0; $4_1 = $5_1 + $1_1 | 0; $6_1 = HEAP8[$4_1 | 0]; $3 = $6_1 & 127 | $3 << 7; if (($6_1 | 0) >= 0) { break block1 } $6_1 = $2_1 >>> 0 < 7; $2_1 = $5_1; if ($6_1) { continue } break; }; } $2_1 = $4_1 + 1 | 0; $5_1 = HEAPU16[$0_1 + 14 >> 1]; block3 : { if ($3 >>> 0 <= $5_1 >>> 0) { $0_1 = $2_1 + ($3 - $1_1 | 0) | 0; $0_1 = $0_1 >>> 0 <= 4 ? 4 : $0_1; break block3; } $4_1 = HEAPU16[$0_1 + 16 >> 1]; $0_1 = (($3 - $4_1 >>> 0) % (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] - 4 >>> 0) | 0) + $4_1 | 0; $0_1 = (($2_1 - $1_1 | 0) + ($0_1 >>> 0 > $5_1 >>> 0 ? $4_1 : $0_1) | 0) + 4 | 0; } return $0_1 & 65535; } function $603($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP8[$1_1 + 4 | 0]; $4_1 = $2_1 & 255; $3 = 4; block : { if (($2_1 | 0) >= 0) { break block } $4_1 = $4_1 & 127; $2_1 = 4; while (1) { $3 = $2_1 + 1 | 0; $5_1 = HEAP8[$3 + $1_1 | 0]; $4_1 = $5_1 & 127 | $4_1 << 7; if (($5_1 | 0) >= 0) { break block } $5_1 = $2_1 >>> 0 < 11; $2_1 = $3; if ($5_1) { continue } break; }; } $2_1 = ($1_1 + $3 | 0) + 1 | 0; $5_1 = HEAPU16[$0_1 + 14 >> 1]; if ($4_1 >>> 0 <= $5_1 >>> 0) { $0_1 = $2_1 + ($4_1 - $1_1 | 0) | 0 } else { $3 = HEAPU16[$0_1 + 16 >> 1]; $0_1 = (($4_1 - $3 >>> 0) % (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] - 4 >>> 0) | 0) + $3 | 0; $0_1 = (($2_1 - $1_1 | 0) + ($0_1 >>> 0 > $5_1 >>> 0 ? $3 : $0_1) | 0) + 4 | 0; } return $0_1 & 65535; } function $604($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $607($1_1 + 4 | 0, $2_1); HEAP16[$2_1 + 16 >> 1] = 0; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP16[$2_1 + 18 >> 1] = $0_1 + 4 & 255; } function $605($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $0_1 = 4; while (1) { block : { $2_1 = $0_1 + 1 | 0; if (HEAP8[$0_1 + $1_1 | 0] >= 0) { break block } $3 = $0_1 >>> 0 < 12; $0_1 = $2_1; if ($3) { continue } } break; }; return $2_1 & 65535; } function $606($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAPU16[$0_1 + 16 >> 1]; $4_1 = ((HEAP32[$2_1 + 12 >> 2] - $3 >>> 0) % (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] - 4 >>> 0) | 0) + $3 | 0; $0_1 = ($4_1 | 0) > HEAPU16[$0_1 + 14 >> 1] ? $3 : $4_1; HEAP16[$2_1 + 16 >> 1] = $0_1; HEAP16[$2_1 + 18 >> 1] = (($0_1 + HEAP32[$2_1 + 8 >> 2] | 0) - $1_1 | 0) + 4; } function $607($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = HEAPU8[$0_1 | 0]; $3 = $2_1 << 24 >> 24; block1 : { if (($3 | 0) >= 0) { $3 = 0; $0_1 = 1; break block1; } $4_1 = HEAP8[$0_1 + 1 | 0]; if (($4_1 | 0) >= 0) { $0_1 = $3 & 127; $3 = 0; $2_1 = $4_1 & 255 | $0_1 << 7; $0_1 = 2; break block1; } $4_1 = $4_1 & 255; $3 = $2_1 << 14; $2_1 = HEAP8[$0_1 + 2 | 0]; $3 = ($3 | $2_1 & 127) & 2080895; if (($2_1 | 0) >= 0) { $2_1 = $3 | $4_1 << 7 & 16256; $3 = 0; $0_1 = 3; break block1; } $2_1 = $4_1 << 14; $4_1 = HEAP8[$0_1 + 3 | 0]; $2_1 = ($2_1 | $4_1 & 127) & 2080895; if (($4_1 | 0) >= 0) { $2_1 = $2_1 | $3 << 7; $3 = 0; $0_1 = 4; break block1; } $5_1 = HEAPU8[$0_1 + 4 | 0]; $4_1 = $5_1 | $3 << 14; $6_1 = $5_1 << 24 >> 24; if (($6_1 | 0) >= 0) { $3 = $3 >>> 18 | 0; $2_1 = $2_1 << 7 | $4_1; $0_1 = 5; break block1; } $7_1 = HEAP8[$0_1 + 5 | 0]; $5_1 = $7_1 & 255 | $2_1 << 14; $3 = $2_1 | $3 << 7; if (($7_1 | 0) >= 0) { $3 = $3 >>> 18 | 0; $2_1 = $5_1 | $4_1 << 7 & 266354560; $0_1 = 6; break block1; } $2_1 = $4_1 << 14; $4_1 = HEAP8[$0_1 + 6 | 0]; $2_1 = $2_1 | $4_1 & 255; if (($4_1 | 0) >= 0) { $3 = $3 >>> 11 | 0; $2_1 = $2_1 & -266354561 | $5_1 << 7 & 266354560; $0_1 = 7; break block1; } $4_1 = $5_1 << 14; $5_1 = HEAP8[$0_1 + 7 | 0]; $4_1 = $4_1 | $5_1 & 255; $2_1 = $2_1 & 2080895; if (($5_1 | 0) >= 0) { $3 = $3 >>> 4 | 0; $2_1 = $4_1 & -266354561 | $2_1 << 7; $0_1 = 8; break block1; } $3 = $6_1 >>> 3 & 15 | $3 << 4; $2_1 = $4_1 << 8 & 532709120 | (HEAPU8[$0_1 + 8 | 0] | $2_1 << 15); $0_1 = 9; } HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; return $0_1; } function $608($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; block : { while (1) { $5_1 = $539($0_1, $3, $4_1); if (!$1_1 | ($5_1 | 0) != 5) { break block } if (FUNCTION_TABLE[$1_1 | 0]($2_1) | 0) { continue } break; }; $5_1 = 5; } return $5_1; } function $609($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $10_1 = HEAP32[$3 >> 2]; $11_1 = HEAP32[$4_1 >> 2]; while (1) { if (!(($2_1 | 0) <= ($6_1 | 0) & ($7_1 | 0) >= ($11_1 | 0))) { block4 : { block2 : { if (($2_1 | 0) <= ($6_1 | 0)) { break block2 } if (($7_1 | 0) < ($11_1 | 0)) { if (HEAPU32[(HEAPU16[($6_1 << 1) + $1_1 >> 1] << 2) + $0_1 >> 2] >= HEAPU32[(HEAPU16[($7_1 << 1) + $10_1 >> 1] << 2) + $0_1 >> 2]) { break block2 } } $8_1 = ($6_1 << 1) + $1_1 | 0; $6_1 = $6_1 + 1 | 0; break block4; } $8_1 = ($7_1 << 1) + $10_1 | 0; $7_1 = $7_1 + 1 | 0; } $8_1 = HEAPU16[$8_1 >> 1]; $12_1 = HEAP32[($8_1 << 2) + $0_1 >> 2]; HEAP16[($9_1 << 1) + $5_1 >> 1] = $8_1; $9_1 = $9_1 + 1 | 0; if (($2_1 | 0) <= ($6_1 | 0)) { continue } $6_1 = (HEAP32[(HEAPU16[($6_1 << 1) + $1_1 >> 1] << 2) + $0_1 >> 2] == ($12_1 | 0)) + $6_1 | 0; continue; } break; }; HEAP32[$3 >> 2] = $1_1; HEAP32[$4_1 >> 2] = $9_1; $0_1 = $9_1 << 1; if ($0_1) { wasm2js_memory_copy($1_1, $5_1, $0_1) } } function $610($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!HEAPU8[$0_1 + 9 | 0]) { break block } block2 : { $4_1 = HEAP32[$0_1 + 4 >> 2]; if (HEAPU8[$4_1 + 24 | 0] & 64 ? ($0_1 | 0) != HEAP32[$4_1 + 80 >> 2] : 0) { break block2 } $3 = $4_1 + 76 | 0; while (1) { $3 = HEAP32[$3 >> 2]; if (!$3) { break block } if (!(HEAP32[$3 >> 2] == ($0_1 | 0) | HEAP32[$3 + 4 >> 2] != ($1_1 | 0) | HEAPU8[$3 + 8 | 0] == ($2_1 | 0))) { if (($2_1 | 0) != 2) { break block2 } HEAP16[$4_1 + 24 >> 1] = HEAPU16[$4_1 + 24 >> 1] | 128; break block2; } $3 = $3 + 12 | 0; continue; }; } return 262; } return 0; } function $611($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 32 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block31 : { block30 : { $1_1 = HEAP32[$0_1 + 232 >> 2]; block2 : { block23 : { block28 : { if (!$1_1) { block1 : { if (HEAPU8[$0_1 + 17 | 0]) { break block1 } $1_1 = $575($0_1, 1); if ($1_1) { break block2 } block14 : { block5 : { if (HEAPU8[$0_1 + 18 | 0] <= 1) { $3 = HEAP32[$0_1 >> 2]; $5_1 = 1; HEAP32[$2_1 >> 2] = 1; $6_1 = HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2]; if (!$6_1) { $1_1 = FUNCTION_TABLE[HEAP32[$3 + 32 >> 2]]($3, HEAP32[$0_1 + 188 >> 2], 0, $2_1) | 0; if ($1_1 | !HEAP32[$2_1 >> 2]) { break block5 } } HEAP32[$2_1 + 28 >> 2] = 0; $1_1 = HEAP32[$0_1 + 64 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 36 >> 2]]($1_1, $2_1 + 28 | 0) | 0; block6 : { if ($1_1 | HEAP32[$2_1 + 28 >> 2]) { break block6 } $1_1 = $616($0_1, $2_1 + 24 | 0); if ($1_1) { break block6 } if (!(HEAP32[$2_1 + 24 >> 2] | $6_1)) { $1_1 = HEAP32[20678]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]() } block9 : { if ($576($0_1, 2)) { break block9 } $1_1 = HEAP32[$3 + 28 >> 2]; if ($1_1) { FUNCTION_TABLE[$1_1 | 0]($3, HEAP32[$0_1 + 188 >> 2], 0) | 0 } if (HEAPU8[$0_1 + 4 | 0]) { break block9 } $587($0_1, 1); } $1_1 = 0; $3 = HEAP32[20679]; if (!$3) { break block6 } FUNCTION_TABLE[$3 | 0](); break block6; } block12 : { if (!$6_1) { HEAP32[$2_1 + 20 >> 2] = 2049; $1_1 = FUNCTION_TABLE[HEAP32[$3 + 24 >> 2]]($3, HEAP32[$0_1 + 188 >> 2], HEAP32[$0_1 + 68 >> 2], 2049, $2_1 + 20 | 0) | 0; if (($1_1 | 0) == 14) { break block12 } if ($1_1) { break block6 } } HEAP8[$2_1 + 20 | 0] = 0; $1_1 = HEAP32[$0_1 + 68 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 8 >> 2]]($1_1, $2_1 + 20 | 0, 1, 0, 0) | 0; $3 = ($5_1 | 0) == 522; block13 : { if ($6_1) { break block13 } $1_1 = HEAP32[$0_1 + 68 >> 2]; $6_1 = HEAP32[$1_1 >> 2]; if (!$6_1) { break block13 } FUNCTION_TABLE[HEAP32[$6_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } $1_1 = $3 ? 0 : $5_1; $5_1 = !HEAPU8[$2_1 + 20 | 0]; break block6; } $5_1 = 0; $1_1 = 0; } if ($1_1) { break block2 } if ($5_1) { break block14 } } $1_1 = 776; if (HEAPU8[$0_1 + 14 | 0]) { break block2 } $1_1 = $576($0_1, 4); if ($1_1) { break block2 } block19 : { block20 : { block16 : { if (!HEAP32[HEAP32[$0_1 + 68 >> 2] >> 2]) { $1_1 = 0; if (HEAPU8[$0_1 + 5 | 0] == 2) { break block16 } $3 = HEAP32[$0_1 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[$3 + 32 >> 2]]($3, HEAP32[$0_1 + 188 >> 2], 0, $2_1) | 0; $5_1 = HEAP32[$0_1 + 68 >> 2]; if (!(!HEAP32[$2_1 >> 2] | $1_1)) { HEAP32[$2_1 + 28 >> 2] = 0; $1_1 = FUNCTION_TABLE[HEAP32[$3 + 24 >> 2]]($3, HEAP32[$0_1 + 188 >> 2], $5_1, 2050, $2_1 + 28 | 0) | 0; block18 : { if ($1_1) { break block18 } $1_1 = 0; if (!(HEAP8[$2_1 + 28 | 0] & 1)) { break block18 } $1_1 = $75(62640); $5_1 = HEAP32[$0_1 + 68 >> 2]; $3 = HEAP32[$5_1 >> 2]; if (!$3) { break block18 } FUNCTION_TABLE[HEAP32[$3 + 4 >> 2]]($5_1) | 0; HEAP32[$5_1 >> 2] = 0; } $5_1 = HEAP32[$0_1 + 68 >> 2]; } if (!HEAP32[$5_1 >> 2]) { break block16 } } $1_1 = $520($0_1); if ($1_1) { break block19 } $1_1 = $582($0_1, !HEAPU8[$0_1 + 12 | 0]); HEAP8[$0_1 + 17 | 0] = 0; break block20; } if (HEAPU8[$0_1 + 4 | 0]) { break block20 } $587($0_1, 1); } if (!$1_1) { break block14 } } $1_1 = $176($0_1, $1_1); break block2; } if ($1_1) { break block2 } } if (HEAPU8[$0_1 + 12 | 0]) { break block1 } if (HEAPU8[$0_1 + 24 | 0]) { $1_1 = HEAP32[$0_1 + 64 >> 2]; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 8 >> 2]]($1_1, $2_1, 16, 24, 0) | 0; if ($1_1) { if (($1_1 | 0) != 522) { break block23 } HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; } if ($2014($0_1 + 112 | 0, $2_1, 16)) { $516($0_1) } if (HEAPU8[$0_1 + 12 | 0]) { break block1 } } $1_1 = HEAP32[$0_1 >> 2]; $4_1 = FUNCTION_TABLE[HEAP32[$1_1 + 32 >> 2]]($1_1, HEAP32[$0_1 + 236 >> 2], 0, $2_1) | 0; if ($4_1) { break block1 } block27 : { if (HEAP32[$2_1 >> 2]) { $4_1 = $616($0_1, $2_1 + 28 | 0); if ($4_1) { break block1 } if (!HEAP32[$2_1 + 28 >> 2]) { $1_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$1_1 + 28 >> 2]; if ($4_1) { break block27 } $4_1 = 0; break block1; } $4_1 = $612($0_1, 0); break block1; } $4_1 = 0; if (HEAPU8[$0_1 + 5 | 0] != 5) { break block1 } HEAP8[$0_1 + 5 | 0] = 0; break block1; } $4_1 = FUNCTION_TABLE[$4_1 | 0]($1_1, HEAP32[$0_1 + 236 >> 2], 0) | 0; } $1_1 = HEAP32[$0_1 + 232 >> 2]; if (!$1_1) { break block28 } } HEAP32[$2_1 + 28 >> 2] = 0; $569($1_1); $1_1 = HEAP32[$0_1 + 232 >> 2]; HEAP32[$2_1 >> 2] = 0; while (1) { $4_1 = $543($1_1, $2_1 + 28 | 0, 0, $2_1); if (($4_1 | 0) == -1) { continue } break; }; if (!(HEAP32[$2_1 + 28 >> 2] | $4_1)) { break block28 } $516($0_1); } if (!(HEAPU8[$0_1 + 12 | 0] | HEAPU8[$0_1 + 17 | 0])) { $1_1 = $4_1; if ($1_1) { break block23 } $1_1 = $616($0_1, $0_1 + 28 | 0); break block23; } $1_1 = $4_1; } if (!$1_1) { break block30 } } $519($0_1); break block31; } HEAP8[$0_1 + 24 | 0] = 1; HEAP8[$0_1 + 17 | 0] = 1; $1_1 = 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $612($0_1, $1_1) { var $2_1 = 0; block3 : { if (!(HEAPU8[$0_1 + 12 | 0] | HEAP32[$0_1 + 232 >> 2])) { if (!$618($0_1)) { return 14 } $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } $1_1 = $619($0_1); if ($1_1) { break block3 } HEAP8[$0_1 + 17 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 5; return 0; } HEAP32[$1_1 >> 2] = 1; $1_1 = 0; } return $1_1; } function $613($0_1) { var $1_1 = 0; block : { if (HEAPU8[$0_1 + 20 | 0]) { break block } $1_1 = HEAP32[$0_1 + 12 >> 2]; if (!$1_1) { break block } HEAP32[$0_1 + 12 >> 2] = 0; $191($1_1); } } function $615($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = HEAPU8[$0_1 + 9 | 0]; $4_1 = HEAP32[$0_1 + 56 >> 2]; $3 = HEAP32[$0_1 + 52 >> 2]; block : { if (!(HEAPU8[$3 + 24 | 0] & 12)) { break block } $2_1 = HEAP32[$3 + 40 >> 2] - $5_1 | 0; if (!$2_1) { break block } wasm2js_memory_fill($4_1 + $5_1 | 0, 0, $2_1); } $2_1 = $4_1 + $5_1 | 0; HEAP8[$2_1 + 7 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; HEAP8[$2_1 + 4 | 0] = 0; HEAP8[$2_1 | 0] = $1_1; HEAP8[$2_1 + 5 | 0] = HEAP32[$3 + 40 >> 2] >>> 8; HEAP8[$2_1 + 6 | 0] = HEAP32[$3 + 40 >> 2]; $2_1 = ($1_1 & 8 ? 8 : 12) + $5_1 | 0; HEAP32[$0_1 + 20 >> 2] = HEAP32[$3 + 40 >> 2] - $2_1 & 65535; $597($0_1, $1_1); HEAP16[$0_1 + 18 >> 1] = $2_1; $1_1 = HEAP32[$3 + 36 >> 2]; HEAP32[$0_1 + 64 >> 2] = $2_1 + $4_1; HEAP32[$0_1 + 68 >> 2] = HEAPU8[$0_1 + 10 | 0] + $4_1; HEAP8[$0_1 + 12 | 0] = 0; HEAP16[$0_1 + 24 >> 1] = 0; HEAP8[$0_1 | 0] = 1; HEAP32[$0_1 + 60 >> 2] = $1_1 + $4_1; HEAP16[$0_1 + 26 >> 1] = $1_1 - 1; } function $616($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 + 232 >> 2]; block4 : { block3 : { block1 : { if (!(!$2_1 | HEAP16[$2_1 + 40 >> 1] < 0)) { $2_1 = HEAP32[$2_1 + 72 >> 2]; if ($2_1) { break block1 } } $2_1 = HEAP32[$0_1 + 64 >> 2]; $3 = HEAP32[$2_1 >> 2]; if (!$3) { $2_1 = 0; break block3; } HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 0; $2_1 = FUNCTION_TABLE[HEAP32[$3 + 24 >> 2]]($2_1, $4_1 + 8 | 0) | 0; if ($2_1) { break block4 } $2_1 = HEAP32[$0_1 + 168 >> 2]; $5_1 = $2_1 + HEAP32[$4_1 + 8 >> 2] | 0; $6_1 = HEAP32[$0_1 + 172 >> 2]; $3 = $6_1 + HEAP32[$4_1 + 12 >> 2] | 0; $3 = ($2_1 >>> 0 > $5_1 >>> 0 ? $3 + 1 | 0 : $3) - 1 | 0; $5_1 = $5_1 - 1 | 0; $3 = ($5_1 | 0) != -1 ? $3 + 1 | 0 : $3; $2_1 = __wasm_i64_sdiv($5_1, $3, $2_1, $6_1); } if (HEAPU32[$0_1 + 160 >> 2] >= $2_1 >>> 0) { break block3 } HEAP32[$0_1 + 160 >> 2] = $2_1; } HEAP32[$1_1 >> 2] = $2_1; $2_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $617($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 8 >> 2]; if (($1_1 | 0) != HEAP32[$3 + 4 >> 2]) { $4_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 + 72 >> 2] = $0_1; HEAP32[$3 + 56 >> 2] = $4_1; HEAP32[$3 + 52 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $1_1; HEAP8[$3 + 9 | 0] = ($1_1 | 0) == 1 ? 100 : 0; } return $3; } function $618($0_1) { var $1_1 = 0; $1_1 = 0; block : { if (HEAPU8[$0_1 + 13 | 0]) { break block } $1_1 = 1; if (HEAPU8[$0_1 + 4 | 0]) { break block } $0_1 = HEAP32[HEAP32[$0_1 + 64 >> 2] >> 2]; $1_1 = 0; if (HEAP32[$0_1 >> 2] < 2) { break block } $1_1 = HEAP32[$0_1 + 52 >> 2] != 0; } return $1_1; } function $619($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 16 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block1 : { if (HEAPU8[$0_1 + 4 | 0]) { $1_1 = $620($0_1); if ($1_1) { break block1 } $7_1 = HEAPU8[$0_1 + 4 | 0] ? 2 : 0; } $1_1 = HEAP32[$0_1 + 176 >> 2]; $8_1 = HEAP32[$0_1 + 180 >> 2]; $6_1 = HEAP32[$0_1 + 236 >> 2]; $5_1 = HEAP32[$0_1 + 64 >> 2]; $3 = HEAP32[$0_1 >> 2]; HEAP32[$0_1 + 232 >> 2] = 0; $2_1 = $132(HEAP32[$3 + 4 >> 2] + 120 | 0, 0); if (!$2_1) { $1_1 = 7; break block1; } HEAP32[$2_1 >> 2] = $3; HEAP16[$2_1 + 40 >> 1] = 65535; HEAP32[$2_1 + 4 >> 2] = $5_1; HEAP32[$2_1 + 108 >> 2] = $6_1; HEAP32[$2_1 + 16 >> 2] = $1_1; HEAP32[$2_1 + 20 >> 2] = $8_1; HEAP16[$2_1 + 48 >> 1] = 257; HEAP8[$2_1 + 43 | 0] = $7_1; $1_1 = $2_1 + 120 | 0; HEAP32[$2_1 + 8 >> 2] = $1_1; HEAP32[$4_1 + 12 >> 2] = 524294; $1_1 = FUNCTION_TABLE[HEAP32[$3 + 24 >> 2]]($3, $6_1, $1_1, 524294, $4_1 + 12 | 0) | 0; if (!$1_1) { if (HEAP8[$4_1 + 12 | 0] & 1) { HEAP8[$2_1 + 46 | 0] = 1 } $1_1 = HEAP32[$5_1 >> 2]; block5 : { if (!$1_1) { break block5 } $1_1 = FUNCTION_TABLE[HEAP32[$1_1 + 48 >> 2]]($5_1) | 0; if ($1_1 & 1024) { HEAP8[$2_1 + 48 | 0] = 0 } if (!($1_1 & 4096)) { break block5 } HEAP8[$2_1 + 49 | 0] = 0; } HEAP32[$0_1 + 232 >> 2] = $2_1; $1_1 = 0; break block1; } $572($2_1, 0); $0_1 = HEAP32[$2_1 + 8 >> 2]; $3 = HEAP32[$0_1 >> 2]; if ($3) { FUNCTION_TABLE[HEAP32[$3 + 4 >> 2]]($0_1) | 0; HEAP32[$0_1 >> 2] = 0; } $24($2_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $620($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAPU8[$0_1 + 18 | 0]; $1_1 = $576($0_1, 4); if ($1_1) { $587($0_1, $2_1) } return $1_1; } function $623($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; $6_1 = $180($0_1, $1_1); $0_1 = FUNCTION_TABLE[HEAP32[$5_1 + 220 >> 2]]($5_1, $6_1, $4_1 + 12 | 0, 0) | 0; block : { if ($0_1) { break block } $0_1 = HEAP32[$4_1 + 12 >> 2]; $1_1 = Math_imul(($6_1 ^ -1) + $1_1 | 0, 5); block2 : { if (($1_1 | 0) < 0) { $99($0_1); $1_1 = 71919; break block2; } $1_1 = $1_1 + HEAP32[$0_1 + 4 >> 2] | 0; HEAP8[$2_1 | 0] = HEAPU8[$1_1 | 0]; if ($3) { HEAP32[$3 >> 2] = $156($1_1 + 1 | 0) } $99($0_1); $0_1 = 0; $1_1 = 71927; if ((HEAPU8[$2_1 | 0] - 6 & 255) >>> 0 > 250) { break block } } $0_1 = $181($1_1); } $1_1 = $4_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $624($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $11_1 = global$0 - 16 | 0; $5_1 = $11_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$11_1 + 12 >> 2] = 0; $14 = HEAP32[$0_1 + 12 >> 2]; $17_1 = $156(HEAP32[$14 + 56 >> 2] + 36 | 0); $16_1 = HEAP32[$0_1 + 48 >> 2]; block1 : { if ($17_1 >>> 0 >= $16_1 >>> 0) { $6_1 = $181(77239); break block1; } block10 : { block38 : { if ($17_1) { block5 : { block4 : { switch ($4_1 - 1 | 0) { case 0: if ($3 >>> 0 > $16_1 >>> 0) { break block5 } $6_1 = $623($0_1, $3, $11_1 + 11 | 0, 0); if ($6_1) { break block1 } $8_1 = HEAPU8[$11_1 + 11 | 0] == 2; break block5; case 1: break block4; default: break block5; }; } $8_1 = 1; } $6_1 = $150(HEAP32[$14 + 72 >> 2]); if ($6_1) { break block1 } $7_1 = HEAP32[$14 + 56 >> 2]; $5_1 = $17_1 - 1 | 0; $5_1 = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); HEAP8[$7_1 + 36 | 0] = $5_1; HEAP8[$7_1 + 37 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 38 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 39 | 0] = $5_1 >>> 24; while (1) { $7_1 = $16_1; $12_1 = $9_1; block7 : { if ($9_1) { $5_1 = HEAP32[$9_1 + 56 >> 2]; break block7; } $5_1 = HEAP32[$14 + 56 >> 2] + 32 | 0; } $5_1 = $156($5_1); if (!($7_1 >>> 0 >= $5_1 >>> 0 & $17_1 >>> 0 >= $20_1 >>> 0)) { $9_1 = 0; $6_1 = $181(77295); break block10; } $9_1 = 0; $10_1 = $11_1 + 12 | 0; $6_1 = $636($0_1, $5_1, $10_1, 0); if ($6_1) { break block10 } block31 : { block23 : { $18_1 = $8_1 & 255; $9_1 = HEAP32[$11_1 + 12 >> 2]; $15_1 = HEAP32[$9_1 + 56 >> 2]; $13_1 = $156($15_1 + 4 | 0); block12 : { if (!($18_1 | $13_1)) { $6_1 = $150(HEAP32[$9_1 + 72 >> 2]); if ($6_1) { break block10 } HEAP32[$2_1 >> 2] = $5_1; $7_1 = HEAP32[$14 + 56 >> 2]; $5_1 = HEAP32[$9_1 + 56 >> 2]; $5_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$7_1 + 32 | 0] = $5_1; HEAP8[$7_1 + 33 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 34 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 35 | 0] = $5_1 >>> 24; HEAP32[$1_1 >> 2] = $9_1; $9_1 = 0; $6_1 = 0; $7_1 = $10_1; break block12; } if ($13_1 >>> 0 > (HEAP32[$0_1 + 40 >> 2] >>> 2 | 0) - 2 >>> 0) { $6_1 = $181(77324); break block10; } if (!(!$18_1 | !(($4_1 | 0) == 2 & $3 >>> 0 > $5_1 >>> 0) & ($3 | 0) != ($5_1 | 0))) { HEAP32[$2_1 >> 2] = $5_1; HEAP32[$1_1 >> 2] = $9_1; $6_1 = $150(HEAP32[$9_1 + 72 >> 2]); if ($6_1) { break block10 } if (!$13_1) { if (!$12_1) { $7_1 = HEAP32[$14 + 56 >> 2]; $5_1 = HEAP32[$9_1 + 56 >> 2]; $5_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$7_1 + 32 | 0] = $5_1; HEAP8[$7_1 + 33 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 34 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 35 | 0] = $5_1 >>> 24; $9_1 = 0; $6_1 = 0; $7_1 = $11_1 + 12 | 0; break block12; } $6_1 = $150(HEAP32[$12_1 + 72 >> 2]); if ($6_1) { break block10 } $7_1 = HEAP32[$12_1 + 56 >> 2]; $5_1 = HEAP32[$9_1 + 56 >> 2]; $5_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$7_1 | 0] = $5_1; HEAP8[$7_1 + 1 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $5_1 >>> 24; $9_1 = 0; $6_1 = 0; $7_1 = $11_1 + 12 | 0; break block12; } $10_1 = $156(HEAP32[$9_1 + 56 >> 2] + 8 | 0); if ($16_1 >>> 0 < $10_1 >>> 0) { $6_1 = $181(77358); break block10; } $6_1 = $636($0_1, $10_1, $11_1 + 4 | 0, 0); if ($6_1) { break block10 } $8_1 = HEAP32[$11_1 + 4 >> 2]; $6_1 = $150(HEAP32[$8_1 + 72 >> 2]); if ($6_1) { $625($8_1); break block10; } $7_1 = HEAP32[$8_1 + 56 >> 2]; $5_1 = HEAP32[$9_1 + 56 >> 2]; $5_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$7_1 | 0] = $5_1; HEAP8[$7_1 + 1 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $5_1 >>> 24; $7_1 = HEAP32[$8_1 + 56 >> 2]; $6_1 = $13_1 - 1 | 0; $5_1 = $6_1 << 24 | ($6_1 & 65280) << 8 | ($6_1 >>> 8 & 65280 | $6_1 >>> 24); HEAP8[$7_1 + 4 | 0] = $5_1; HEAP8[$7_1 + 5 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 6 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 7 | 0] = $5_1 >>> 24; $5_1 = $6_1 << 2; if ($5_1) { wasm2js_memory_copy(HEAP32[$8_1 + 56 >> 2] + 8 | 0, HEAP32[$9_1 + 56 >> 2] + 12 | 0, $5_1) } $625($8_1); block22 : { if (!$12_1) { $7_1 = HEAP32[$14 + 56 >> 2]; $5_1 = $10_1 << 24 | ($10_1 & 65280) << 8 | ($10_1 >>> 8 & 65280 | $10_1 >>> 24); HEAP8[$7_1 + 32 | 0] = $5_1; HEAP8[$7_1 + 33 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 34 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 35 | 0] = $5_1 >>> 24; break block22; } $6_1 = $150(HEAP32[$12_1 + 72 >> 2]); if ($6_1) { break block10 } $7_1 = HEAP32[$12_1 + 56 >> 2]; $5_1 = $10_1 << 24 | ($10_1 & 65280) << 8 | ($10_1 >>> 8 & 65280 | $10_1 >>> 24); HEAP8[$7_1 | 0] = $5_1; HEAP8[$7_1 + 1 | 0] = $5_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $5_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $5_1 >>> 24; } $9_1 = 0; $6_1 = 0; $7_1 = $11_1 + 12 | 0; break block12; } if (!$13_1) { break block23 } block25 : { if (!$3) { $5_1 = 0; break block25; } $19_1 = $15_1 + 8 | 0; $5_1 = 0; $6_1 = 0; if (($4_1 | 0) == 2) { while (1) { if (($6_1 | 0) == ($13_1 | 0)) { break block25 } if ($156(($6_1 << 2) + $19_1 | 0) >>> 0 <= $3 >>> 0) { $5_1 = $6_1; break block25; } else { $6_1 = $6_1 + 1 | 0; continue; } } } $7_1 = $156($19_1) - $3 | 0; $7_1 = ($7_1 | 0) < 0 ? (($7_1 | 0) == -2147483648 ? 2147483647 : 0 - $7_1 | 0) : $7_1; $6_1 = 1; while (1) { if (($6_1 | 0) == ($13_1 | 0)) { break block25 } $8_1 = $156(($6_1 << 2) + $19_1 | 0) - $3 | 0; $8_1 = ($8_1 | 0) < 0 ? (($8_1 | 0) == -2147483648 ? 2147483647 : 0 - $8_1 | 0) : $8_1; $10_1 = $8_1 >>> 0 < $7_1 >>> 0; $7_1 = $10_1 ? $8_1 : $7_1; $5_1 = $10_1 ? $6_1 : $5_1; $6_1 = $6_1 + 1 | 0; continue; }; } $8_1 = (($5_1 << 2) + $15_1 | 0) + 8 | 0; $7_1 = $156($8_1); if (!($16_1 >>> 0 >= $7_1 >>> 0 & $7_1 >>> 0 > 1)) { $6_1 = $181(77423); break block10; } if (!(!$18_1 | (!(($4_1 | 0) != 2 | $3 >>> 0 <= $7_1 >>> 0) | ($3 | 0) == ($7_1 | 0)))) { $6_1 = 0; $8_1 = 1; break block31; } HEAP32[$2_1 >> 2] = $7_1; $6_1 = $150(HEAP32[$9_1 + 72 >> 2]); if ($6_1) { break block10 } $7_1 = $13_1 - 1 | 0; if ($5_1 >>> 0 < $7_1 >>> 0) { $5_1 = (($13_1 << 2) + $15_1 | 0) + 4 | 0; $5_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$8_1 | 0] = $5_1; HEAP8[$8_1 + 1 | 0] = $5_1 >>> 8; HEAP8[$8_1 + 2 | 0] = $5_1 >>> 16; HEAP8[$8_1 + 3 | 0] = $5_1 >>> 24; } $5_1 = $7_1 << 24 | ($7_1 & 65280) << 8 | ($7_1 >>> 8 & 65280 | $7_1 >>> 24); HEAP8[$15_1 + 4 | 0] = $5_1; HEAP8[$15_1 + 5 | 0] = $5_1 >>> 8; HEAP8[$15_1 + 6 | 0] = $5_1 >>> 16; HEAP8[$15_1 + 7 | 0] = $5_1 >>> 24; $7_1 = HEAP32[$2_1 >> 2]; $5_1 = HEAP32[$0_1 + 64 >> 2]; $10_1 = 1; block34 : { if (!$5_1) { break block34 } $10_1 = 0; if (HEAPU32[$5_1 >> 2] < $7_1 >>> 0) { break block34 } $10_1 = $430($5_1, $7_1) ^ 1; } $6_1 = $636($0_1, $7_1, $1_1, $10_1); if ($6_1) { $8_1 = 0; break block31; } $6_1 = $150(HEAP32[HEAP32[$1_1 >> 2] + 72 >> 2]); if (!$6_1) { $8_1 = 0; break block23; } $625(HEAP32[$1_1 >> 2]); $7_1 = $1_1; } $8_1 = 0; HEAP32[$7_1 >> 2] = 0; break block31; } $6_1 = 0; } $20_1 = $20_1 + 1 | 0; $625($12_1); $5_1 = $8_1 & 255; $8_1 = 1; if ($5_1) { continue } break; }; break block38; } $3 = HEAPU8[$0_1 + 19 | 0]; $6_1 = $150(HEAP32[$14 + 72 >> 2]); if ($6_1) { break block1 } $4_1 = HEAP32[$0_1 + 48 >> 2]; $6_1 = $4_1 + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; if ((HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0) == ($4_1 | 0)) { $6_1 = $4_1 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; } $4_1 = !$3; block40 : { if (!HEAPU8[$0_1 + 17 | 0]) { break block40 } if (($180($0_1, $6_1) | 0) != ($6_1 | 0)) { break block40 } HEAP32[$11_1 >> 2] = 0; $6_1 = $636($0_1, $6_1, $11_1, $4_1); if ($6_1) { break block1 } $3 = HEAP32[$11_1 >> 2]; $6_1 = $150(HEAP32[$3 + 72 >> 2]); $625($3); if ($6_1) { break block1 } $3 = HEAP32[$0_1 + 48 >> 2]; $6_1 = $3 + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; if (($3 | 0) != (HEAPU32[18884] / HEAPU32[$0_1 + 36 >> 2] | 0)) { break block40 } $6_1 = $3 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; } $5_1 = HEAP32[HEAP32[$0_1 + 12 >> 2] + 56 >> 2]; $3 = $6_1 << 24 | ($6_1 & 65280) << 8 | ($6_1 >>> 8 & 65280 | $6_1 >>> 24); HEAP8[$5_1 + 28 | 0] = $3; HEAP8[$5_1 + 29 | 0] = $3 >>> 8; HEAP8[$5_1 + 30 | 0] = $3 >>> 16; HEAP8[$5_1 + 31 | 0] = $3 >>> 24; $3 = $2_1; $2_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$3 >> 2] = $2_1; $6_1 = $636($0_1, $2_1, $1_1, $4_1); if ($6_1) { break block1 } $6_1 = $150(HEAP32[HEAP32[$1_1 >> 2] + 72 >> 2]); if (!$6_1) { $6_1 = 0; break block10; } $625(HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = 0; } $12_1 = 0; } $625($9_1); $625($12_1); } $0_1 = $11_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $625($0_1) { if ($0_1) { $630($0_1) } } function $626($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $7_1 = global$0 - 32 | 0; $6_1 = $7_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $11_1 = HEAP32[$1_1 + 4 >> 2]; block1 : { if ($11_1 >>> 0 <= 2) { $6_1 = $181(74696); break block1; } $8_1 = HEAP32[$1_1 + 72 >> 2]; $9_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$9_1 + 12 | 0]) { $6_1 = $150($8_1); if ($6_1) { break block1 } } $6_1 = HEAPU16[$8_1 + 28 >> 1]; if ($6_1 & 2) { $6_1 = $161($8_1); if ($6_1) { break block1 } $6_1 = HEAPU16[$8_1 + 28 >> 1]; } $10_1 = !($6_1 & 8) | $5_1 ? 0 : HEAP32[$8_1 + 24 >> 2]; HEAP16[$8_1 + 28 >> 1] = $6_1 & 65527; $5_1 = $594($9_1, $4_1); block5 : { if (!$5_1) { break block5 } $6_1 = HEAP32[$5_1 + 32 >> 2]; $12_1 = HEAP32[$5_1 + 36 >> 2]; if (($12_1 | 0) < 0) { $6_1 = 1 } else { $6_1 = $6_1 >>> 0 < 2 & ($12_1 | 0) <= 0 } if (!$6_1) { $128($5_1); $6_1 = $181(64534); break block1; } HEAP16[$8_1 + 28 >> 1] = HEAPU16[$8_1 + 28 >> 1] | HEAPU16[$5_1 + 28 >> 1] & 8; if (HEAPU8[$9_1 + 12 | 0]) { $637($5_1, HEAP32[$9_1 + 28 >> 2] + 1 | 0); break block5; } $579($5_1); } $6_1 = HEAP32[$8_1 + 24 >> 2]; $637($8_1, $4_1); $595($8_1); if (!(!$5_1 | !HEAPU8[$9_1 + 12 | 0])) { $637($5_1, $6_1); $128($5_1); } if ($10_1) { $6_1 = FUNCTION_TABLE[HEAP32[$9_1 + 220 >> 2]]($9_1, $10_1, $7_1 + 8 | 0, 0) | 0; if ($6_1) { if (HEAPU32[$9_1 + 32 >> 2] < $10_1 >>> 0) { break block1 } $3 = HEAP32[$9_1 + 224 >> 2]; $4_1 = 0; __inlined_func$428$86 : { $1_1 = HEAP32[$9_1 + 60 >> 2]; if (!$1_1) { break __inlined_func$428$86 } $0_1 = $10_1 - 1 | 0; while (1) { $2_1 = HEAP32[$1_1 + 8 >> 2]; if ($2_1) { $5_1 = ($0_1 >>> 0) / ($2_1 >>> 0) | 0; $0_1 = $0_1 - Math_imul($2_1, $5_1) | 0; $1_1 = HEAP32[(($5_1 << 2) + $1_1 | 0) + 12 >> 2]; if ($1_1) { continue } break __inlined_func$428$86; } break; }; if (HEAPU32[$1_1 >> 2] <= 4e3) { $1_1 = ($0_1 >>> 3 | 0) + $1_1 | 0; $2_1 = HEAPU8[$1_1 + 12 | 0]; HEAP8[$1_1 + 12 | 0] = __wasm_rotl_i32(-2, $0_1 & 7) & $2_1; break __inlined_func$428$86; } $5_1 = $1_1 + 12 | 0; wasm2js_memory_copy($3, $5_1, 500); wasm2js_memory_fill($5_1, 0, 500); HEAP32[$1_1 + 4 >> 2] = 0; $8_1 = $0_1 + 1 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) == 125) { break __inlined_func$428$86 } $9_1 = ($2_1 << 2) + $3 | 0; $0_1 = HEAP32[$9_1 >> 2]; if (!(!$0_1 | ($0_1 | 0) == ($8_1 | 0))) { $4_1 = $4_1 + 1 | 0; HEAP32[$1_1 + 4 >> 2] = $4_1; $0_1 = ($0_1 - 1 >>> 0) % 125 | 0; while (1) { $11_1 = $5_1 + ($0_1 << 2) | 0; if (HEAP32[$11_1 >> 2]) { $0_1 = $0_1 + 1 | 0; $0_1 = $0_1 >>> 0 <= 124 ? $0_1 : 0; continue; } break; }; HEAP32[$11_1 >> 2] = HEAP32[$9_1 >> 2]; } $2_1 = $2_1 + 1 | 0; continue; }; } break block1; } $5_1 = HEAP32[$7_1 + 8 >> 2]; HEAP16[$5_1 + 28 >> 1] = HEAPU16[$5_1 + 28 >> 1] | 8; $595($5_1); $128(HEAP32[$7_1 + 8 >> 2]); } HEAP32[$7_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $4_1; block12 : { if (($2_1 & 251) == 1) { $6_1 = $638($1_1); if ($6_1) { break block1 } $6_1 = 0; if (($2_1 | 0) != 1) { break block12 } break block1; } $1_1 = $156(HEAP32[$1_1 + 56 >> 2]); if (!$1_1) { break block12 } $639($0_1, $1_1, 4, $4_1, $7_1); $6_1 = HEAP32[$7_1 >> 2]; if ($6_1) { break block1 } } $6_1 = $189($0_1, $3, $7_1 + 4 | 0, 0); if ($6_1) { break block1 } $1_1 = HEAP32[$7_1 + 4 >> 2]; $6_1 = $150(HEAP32[$1_1 + 72 >> 2]); if ($6_1) { $625($1_1); break block1; } block16 : { block17 : { if (($2_1 | 0) == 4) { $5_1 = HEAP32[$1_1 + 56 >> 2]; if (($156($5_1) | 0) != ($11_1 | 0)) { $6_1 = $181(74621); break block16; } $6_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$5_1 | 0] = $6_1; HEAP8[$5_1 + 1 | 0] = $6_1 >>> 8; HEAP8[$5_1 + 2 | 0] = $6_1 >>> 16; HEAP8[$5_1 + 3 | 0] = $6_1 >>> 24; break block17; } if (!HEAPU8[$1_1 | 0]) { $6_1 = $514($1_1); if ($6_1) { break block16 } } $8_1 = HEAPU16[$1_1 + 24 >> 1]; $6_1 = 0; $9_1 = ($2_1 | 0) != 3; block19 : { while (1) { if (($6_1 | 0) == ($8_1 | 0)) { break block19 } $10_1 = HEAP32[$1_1 + 56 >> 2]; $5_1 = HEAP32[$1_1 + 64 >> 2] + ($6_1 << 1) | 0; $5_1 = $10_1 + (HEAPU16[$1_1 + 26 >> 1] & (HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0])) | 0; block24 : { block21 : { if (!$9_1) { FUNCTION_TABLE[HEAP32[$1_1 + 80 >> 2]]($1_1, $5_1, $7_1 + 8 | 0); if (HEAPU32[$7_1 + 20 >> 2] <= HEAPU16[$7_1 + 24 >> 1]) { break block21 } $5_1 = $5_1 + HEAPU16[$7_1 + 26 >> 1] | 0; if ($5_1 >>> 0 > HEAP32[$1_1 + 56 >> 2] + HEAP32[HEAP32[$1_1 + 52 >> 2] + 40 >> 2] >>> 0) { $6_1 = $181(74640); break block16; } $10_1 = $5_1 - 4 | 0; if (($156($10_1) | 0) != ($11_1 | 0)) { break block21 } HEAP8[$10_1 | 0] = $4_1 >>> 24; HEAP8[$5_1 - 1 | 0] = $4_1; HEAP8[$5_1 - 2 | 0] = $4_1 >>> 8; HEAP8[$5_1 - 3 | 0] = $4_1 >>> 16; break block17; } if ($5_1 + 4 >>> 0 > $10_1 + HEAP32[HEAP32[$1_1 + 52 >> 2] + 40 >> 2] >>> 0) { $6_1 = $181(74649); break block16; } if (($156($5_1) | 0) == ($11_1 | 0)) { break block24 } } $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$5_1 | 0] = $6_1; HEAP8[$5_1 + 1 | 0] = $6_1 >>> 8; HEAP8[$5_1 + 2 | 0] = $6_1 >>> 16; HEAP8[$5_1 + 3 | 0] = $6_1 >>> 24; break block17; } block26 : { if (($2_1 | 0) == 5) { $5_1 = HEAP32[$1_1 + 56 >> 2] + HEAPU8[$1_1 + 9 | 0] | 0; if (($156($5_1 + 8 | 0) | 0) == ($11_1 | 0)) { break block26 } } $6_1 = $181(74661); break block16; } $6_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$5_1 + 8 | 0] = $6_1; HEAP8[$5_1 + 9 | 0] = $6_1 >>> 8; HEAP8[$5_1 + 10 | 0] = $6_1 >>> 16; HEAP8[$5_1 + 11 | 0] = $6_1 >>> 24; } $6_1 = 0; } HEAP32[$7_1 >> 2] = $6_1; $625($1_1); if ($6_1) { break block1 } $639($0_1, $4_1, $2_1, $3, $7_1); $6_1 = HEAP32[$7_1 >> 2]; } $0_1 = $7_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $627($0_1) { var $1_1 = 0; $1_1 = 2835; if (!(HEAPU8[$0_1 + 1 | 0] & 64)) { block2 : { if (HEAPU8[$0_1 | 0] == 2) { HEAP8[$0_1 | 0] = 0; break block2; } HEAP32[$0_1 + 4 >> 2] = 0; } $1_1 = $629($0_1); if (!$1_1) { $628($0_1); HEAP8[$0_1 | 0] = 3; } HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 241; } return $1_1; } function $628($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP8[$0_1 + 68 | 0]; if (($1_1 | 0) >= 0) { $3 = $0_1 + 120 | 0; while (1) { if (!($1_1 << 24 >> 24 <= ($2_1 | 0))) { $630(HEAP32[($2_1 << 2) + $3 >> 2]); $2_1 = $2_1 + 1 | 0; $1_1 = HEAPU8[$0_1 + 68 | 0]; continue; } break; }; $630(HEAP32[$0_1 + 116 >> 2]); HEAP8[$0_1 + 68 | 0] = 255; } } function $629($0_1) { var $1_1 = 0, $2_1 = 0; if (HEAPU8[$0_1 + 69 | 0]) { HEAP32[$0_1 + 56 >> 2] = $631($0_1); HEAP32[$0_1 + 60 >> 2] = i64toi32_i32$HIGH_BITS; return 0; } $1_1 = $262($0_1); HEAP32[$0_1 + 56 >> 2] = $1_1; HEAP32[$0_1 + 60 >> 2] = 0; $1_1 = $1_1 + 17 | 0; $2_1 = $1_1 >>> 0 < 17; $2_1 = $30($1_1, $2_1); if (!$2_1) { return 7 } $1_1 = $338($0_1, 0, HEAP32[$0_1 + 56 >> 2], $2_1); if (!$1_1) { $1_1 = HEAP32[$0_1 + 56 >> 2] + $2_1 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = 0; HEAP8[$1_1 + 6 | 0] = 0; HEAP8[$1_1 + 7 | 0] = 0; HEAP8[$1_1 + 16 | 0] = 0; $1_1 = $1_1 + 8 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = 0; HEAP8[$1_1 + 6 | 0] = 0; HEAP8[$1_1 + 7 | 0] = 0; HEAP32[$0_1 + 16 >> 2] = $2_1; return 0; } $24($2_1); return $1_1; } function $630($0_1) { $128(HEAP32[$0_1 + 72 >> 2]); } function $631($0_1) { $633($0_1); i64toi32_i32$HIGH_BITS = HEAP32[$0_1 + 36 >> 2]; return HEAP32[$0_1 + 32 >> 2]; } function $633($0_1) { var $1_1 = 0, $2_1 = 0; if (!HEAPU16[$0_1 + 50 >> 1]) { HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] | 2; $1_1 = HEAP32[$0_1 + 116 >> 2]; $2_1 = HEAP32[$1_1 + 64 >> 2] + (HEAPU16[$0_1 + 70 >> 1] << 1) | 0; FUNCTION_TABLE[HEAP32[$1_1 + 80 >> 2]]($1_1, HEAP32[$1_1 + 56 >> 2] + (HEAPU16[$1_1 + 26 >> 1] & (HEAPU8[$2_1 + 1 | 0] | HEAPU8[$2_1 | 0] << 8)) | 0, $0_1 + 32 | 0); } } function $634($0_1, $1_1, $2_1) { if ($2_1) { wasm2js_memory_copy($1_1, $0_1, $2_1) } return 0; } function $635($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; HEAP32[$4_1 + 12 >> 2] = 0; block2 : { block : { if (!HEAPU8[$0_1 + 17 | 0]) { break block } $7_1 = HEAP32[18884]; $5_1 = $1_1; while (1) { $6_1 = $5_1; $5_1 = $5_1 + 1 | 0; if (($5_1 | 0) == ($180($0_1, $5_1) | 0) | ($6_1 | 0) == (($7_1 >>> 0) / HEAPU32[$0_1 + 36 >> 2] | 0)) { continue } break; }; if (HEAPU32[$0_1 + 48 >> 2] < $5_1 >>> 0) { break block } $6_1 = $623($0_1, $5_1, $4_1 + 7 | 0, $4_1 + 8 | 0); if (!($6_1 | HEAPU8[$4_1 + 7 | 0] != 4)) { if (HEAP32[$4_1 + 8 >> 2] != ($1_1 | 0)) { break block } $6_1 = 101; break block2; } $5_1 = 0; if ($6_1) { break block2 } } $5_1 = 0; $6_1 = $189($0_1, $1_1, $4_1 + 12 | 0, $2_1 ? 0 : 2); if ($6_1) { break block2 } $6_1 = 0; $5_1 = $156(HEAP32[HEAP32[$4_1 + 12 >> 2] + 56 >> 2]); } HEAP32[$3 >> 2] = $5_1; $0_1 = HEAP32[$4_1 + 12 >> 2]; block4 : { if ($2_1) { HEAP32[$2_1 >> 2] = $0_1; break block4; } $625($0_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return ($6_1 | 0) != 101 ? $6_1 : 0; } function $636($0_1, $1_1, $2_1, $3) { $0_1 = $189($0_1, $1_1, $2_1, $3); if (!$0_1) { $0_1 = HEAP32[$2_1 >> 2]; if (HEAP32[HEAP32[$0_1 + 72 >> 2] + 32 >> 2] >= 2) { $625($0_1); HEAP32[$2_1 >> 2] = 0; return $181(73235); } HEAP8[$0_1 | 0] = 0; return 0; } HEAP32[$2_1 >> 2] = 0; return $0_1; } function $637($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = HEAP32[$0_1 + 12 >> 2]; $3 = FUNCTION_TABLE[HEAP32[18918]](HEAP32[$4_1 + 52 >> 2], $1_1, 0) | 0; if ($3) { $6_1 = HEAP32[$3 + 4 >> 2]; $2_1 = $6_1; $5_1 = HEAP32[$2_1 + 36 >> 2]; $3 = HEAP32[$2_1 + 32 >> 2] + 1 | 0; $5_1 = $3 ? $5_1 : $5_1 + 1 | 0; HEAP32[$2_1 + 32 >> 2] = $3; HEAP32[$2_1 + 36 >> 2] = $5_1; $2_1 = HEAP32[$4_1 + 20 >> 2]; $3 = HEAP32[$4_1 + 16 >> 2] + 1 | 0; $2_1 = $3 ? $2_1 : $2_1 + 1 | 0; HEAP32[$4_1 + 16 >> 2] = $3; HEAP32[$4_1 + 20 >> 2] = $2_1; $579($6_1); } FUNCTION_TABLE[HEAP32[18920]](HEAP32[$4_1 + 52 >> 2], HEAP32[$0_1 >> 2], HEAP32[$0_1 + 24 >> 2], $1_1); HEAP32[$0_1 + 24 >> 2] = $1_1; if ((HEAPU16[$0_1 + 28 >> 1] & 10) == 10) { $503($0_1, 3) } } function $638($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $4_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = HEAP32[$0_1 + 52 >> 2]; block2 : { block1 : { if (HEAPU8[$0_1 | 0]) { HEAP32[$1_1 + 12 >> 2] = 0; break block1; } $2_1 = $514($0_1); HEAP32[$1_1 + 12 >> 2] = $2_1; if ($2_1) { break block2 } } $7_1 = HEAPU16[$0_1 + 24 >> 1]; $2_1 = 0; while (1) { if (($2_1 | 0) != ($7_1 | 0)) { $3 = HEAP32[$0_1 + 64 >> 2] + ($2_1 << 1) | 0; $3 = HEAP32[$0_1 + 56 >> 2] + (HEAPU16[$0_1 + 26 >> 1] & (HEAPU8[$3 | 0] << 8 | HEAPU8[$3 + 1 | 0])) | 0; $6_1 = $1_1 + 12 | 0; $640($0_1, $0_1, $3, $6_1); if (!HEAPU8[$0_1 + 8 | 0]) { $639($5_1, $156($3), 5, $4_1, $6_1) } $2_1 = $2_1 + 1 | 0; continue; } break; }; if (!HEAPU8[$0_1 + 8 | 0]) { $639($5_1, $156((HEAP32[$0_1 + 56 >> 2] + HEAPU8[$0_1 + 9 | 0] | 0) + 8 | 0), 5, $4_1, $1_1 + 12 | 0) } $2_1 = HEAP32[$1_1 + 12 >> 2]; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $639($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $6_1 = global$0 - 16 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; block : { if (HEAP32[$4_1 >> 2]) { break block } if (!$1_1) { HEAP32[$4_1 >> 2] = $181(71856); break block; } $5_1 = HEAP32[$0_1 >> 2]; $0_1 = $180($0_1, $1_1); $5_1 = FUNCTION_TABLE[HEAP32[$5_1 + 220 >> 2]]($5_1, $0_1, $6_1 + 12 | 0, 0) | 0; if ($5_1) { HEAP32[$4_1 >> 2] = $5_1; break block; } $5_1 = HEAP32[$6_1 + 12 >> 2]; block4 : { if (HEAPU8[HEAP32[$5_1 + 8 >> 2]]) { HEAP32[$4_1 >> 2] = $181(71869); break block4; } $0_1 = Math_imul(($0_1 ^ -1) + $1_1 | 0, 5); if (($0_1 | 0) < 0) { HEAP32[$4_1 >> 2] = $181(71874); break block4; } $0_1 = $0_1 + HEAP32[$5_1 + 4 >> 2] | 0; if (($2_1 | 0) == HEAPU8[$0_1 | 0]) { if (($156($0_1 + 1 | 0) | 0) == ($3 | 0)) { break block4 } } $1_1 = $150($5_1); HEAP32[$4_1 >> 2] = $1_1; if ($1_1) { break block4 } HEAP8[$0_1 + 4 | 0] = $3; HEAP8[$0_1 | 0] = $2_1; HEAP8[$0_1 + 3 | 0] = $3 >>> 8; HEAP8[$0_1 + 2 | 0] = $3 >>> 16; HEAP8[$0_1 + 1 | 0] = $3 >>> 24; } $99(HEAP32[$6_1 + 12 >> 2]); } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $640($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (HEAP32[$3 >> 2]) { break block } FUNCTION_TABLE[HEAP32[$0_1 + 80 >> 2]]($0_1, $2_1, $4_1 + 8 | 0); $5_1 = HEAPU16[$4_1 + 24 >> 1]; if ($5_1 >>> 0 >= HEAPU32[$4_1 + 20 >> 2]) { break block } $1_1 = HEAP32[$1_1 + 60 >> 2]; if (!($1_1 >>> 0 <= $2_1 >>> 0 | $1_1 >>> 0 >= $2_1 + $5_1 >>> 0)) { HEAP32[$3 >> 2] = $181(72367); break block; } $639(HEAP32[$0_1 + 52 >> 2], $156((HEAPU16[$4_1 + 26 >> 1] + $2_1 | 0) - 4 | 0), 3, HEAP32[$0_1 + 4 >> 2], $3); } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $641($0_1) { $24(HEAP32[$0_1 + 16 >> 2]); HEAP8[$0_1 | 0] = 1; HEAP32[$0_1 + 16 >> 2] = 0; } function $643($0_1) { var $1_1 = 0; block : { if (!$0_1) { break block } $1_1 = HEAP32[$0_1 >> 2] - 1 | 0; HEAP32[$0_1 >> 2] = $1_1; if ($1_1) { break block } $16(HEAP32[$0_1 + 12 >> 2], $0_1); } } function $644($0_1, $1_1) { if (HEAPU8[$1_1 + 4 | 0] & 16) { $16($0_1, $1_1) } } function $646($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2] - 1 | 0; HEAP32[$0_1 + 12 >> 2] = $2_1; if (!$2_1) { $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 16 >> 2]]($1_1) | 0; $1_1 = HEAP32[$0_1 >> 2]; } else { $1_1 = $2_1 } $199($1_1, HEAP32[$0_1 + 4 >> 2]); $13($2_1, $0_1); } } function $647($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 >> 2]; $648($1_1); HEAP32[$1_1 + 104 >> 2] = HEAP32[$0_1 + 8 >> 2]; HEAP32[$1_1 + 108 >> 2] = HEAP32[$0_1 + 52 >> 2]; HEAP32[$1_1 + 88 >> 2] = HEAP32[$0_1 + 12 >> 2]; HEAP32[$1_1 + 20 >> 2] = HEAP32[$0_1 + 56 >> 2]; HEAP32[$1_1 + 96 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$0_1 + 44 >> 2]; $2_1 = HEAP32[$0_1 + 36 >> 2]; $3 = HEAP32[$1_1 >> 2]; HEAP32[$3 + 40 >> 2] = HEAP32[$0_1 + 32 >> 2]; HEAP32[$3 + 44 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 76 >> 2]; HEAP32[$1_1 + 40 >> 2] = HEAP32[$0_1 + 72 >> 2]; HEAP32[$1_1 + 44 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 84 >> 2]; HEAP32[$3 + 104 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$3 + 108 >> 2] = $2_1; $650($3, $1_1 + 236 | 0, -1, 0); HEAP32[$1_1 + 236 >> 2] = HEAP32[$0_1 + 40 >> 2]; HEAP32[$0_1 + 40 >> 2] = 0; return HEAP32[$0_1 + 48 >> 2]; } function $648($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; while (1) { if (($1_1 | 0) < HEAP32[$0_1 + 24 >> 2]) { $2_1 = $1_1 << 2; $3 = HEAP32[$2_1 + HEAP32[$0_1 + 96 >> 2] >> 2]; if ($3) { $649($0_1, $3); HEAP32[HEAP32[$0_1 + 96 >> 2] + $2_1 >> 2] = 0; } $1_1 = $1_1 + 1 | 0; continue; } break; }; } function $649($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if (HEAPU8[$1_1 + 5 | 0] & 16) { $2_1 = HEAP32[$1_1 + 80 >> 2]; HEAP32[$1_1 + 80 >> 2] = 0; HEAP8[$1_1 + 5 | 0] = HEAPU8[$1_1 + 5 | 0] & 239; $3 = HEAP32[$2_1 >> 2]; if ($3) { $249($3); HEAP32[$2_1 >> 2] = 0; } $13(HEAP32[$0_1 >> 2], $2_1); $649($0_1, $1_1); return; } block4 : { block3 : { switch (HEAPU8[$1_1 | 0]) { case 1: $2_1 = HEAP32[$1_1 + 36 >> 2]; if (!$2_1) { break block4 } $0_1 = HEAP32[$0_1 >> 2]; $659($0_1, $2_1); $24(HEAP32[$2_1 + 44 >> 2]); $13($0_1, $2_1); HEAP32[$1_1 + 36 >> 2] = 0; return; case 0: $2_1 = HEAP32[$1_1 + 36 >> 2]; $4_1 = HEAP32[$2_1 + 8 >> 2]; if (!$4_1) { break block4 } $3 = HEAP32[$2_1 + 20 >> 2]; HEAP32[HEAP32[$4_1 + 4 >> 2] + 4 >> 2] = HEAP32[$4_1 >> 2]; $0_1 = HEAP32[$3 + 8 >> 2]; block6 : { if (($0_1 | 0) == ($2_1 | 0)) { HEAP32[$3 + 8 >> 2] = HEAP32[$2_1 + 24 >> 2]; break block6; } while (1) { $1_1 = HEAP32[$0_1 + 24 >> 2]; if (($2_1 | 0) == ($1_1 | 0)) { HEAP32[$0_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2]; break block6; } $0_1 = $1_1; if ($1_1) { continue } break; }; } $628($2_1); $613($3); $24(HEAP32[$2_1 + 12 >> 2]); $24(HEAP32[$2_1 + 16 >> 2]); if (!(HEAP32[$3 + 8 >> 2] | !(HEAPU8[$3 + 16 | 0] & 4))) { $195($4_1) } HEAP32[$2_1 + 8 >> 2] = 0; return; case 2: break block3; default: break block4; }; } $1_1 = HEAP32[$1_1 + 36 >> 2]; $0_1 = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] - 1; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 28 >> 2]]($1_1) | 0; } } function $650($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $6_1 = ($2_1 | 0) < 0; while (1) { $4_1 = HEAP32[$1_1 >> 2]; if ($4_1) { block2 : { block1 : { if ($6_1) { break block1 } if (HEAP32[$4_1 >> 2] != ($2_1 | 0)) { break block2 } $5_1 = HEAP32[$4_1 + 4 >> 2]; if (($5_1 | 0) < 0) { break block2 } if ($5_1 >>> 0 > 31) { break block1 } if ($3 >>> $5_1 & 1) { break block2 } } $5_1 = HEAP32[$4_1 + 12 >> 2]; if ($5_1) { FUNCTION_TABLE[$5_1 | 0](HEAP32[$4_1 + 8 >> 2]) } HEAP32[$1_1 >> 2] = HEAP32[$4_1 + 16 >> 2]; $13($0_1, $4_1); continue; } $1_1 = $4_1 + 16 | 0; continue; } break; }; } function $651($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; block : { $3 = HEAP32[$0_1 + 160 >> 2]; if (!$3) { break block } $0_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$0_1 + 20 >> 2]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $4_1 = HEAP32[$0_1 + 16 >> 2]; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block } block1 : { if (!($3 >>> $1_1 & 1) | ($1_1 | 0) == 1) { break block1 } $0_1 = HEAP32[(($1_1 << 4) + $4_1 | 0) + 4 >> 2]; if (!$0_1) { break block1 } HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2] = HEAP32[$0_1 >> 2]; } $1_1 = $1_1 + 1 | 0; continue; }; } } function $652($0_1, $1_1) { var $2_1 = 0, $3 = 0; block2 : { block1 : { if ($1_1) { $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$2_1 + 520 >> 2]; $1_1 = HEAP32[$2_1 + 524 >> 2] + HEAP32[$2_1 + 516 >> 2] | 0; $2_1 = HEAP32[$2_1 + 512 >> 2]; $3 = $2_1 + $3 | 0; $1_1 = $3 >>> 0 < $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; if (!!$3 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0) { break block1 } break block2; } $1_1 = HEAP32[$0_1 + 64 >> 2]; $2_1 = HEAP32[$0_1 + 68 >> 2]; if (($2_1 | 0) < 0) { $1_1 = 1 } else { $1_1 = !$1_1 & ($2_1 | 0) <= 0 } if ($1_1) { break block2 } } HEAP8[$0_1 + 148 | 0] = 2; HEAP32[$0_1 + 36 >> 2] = 787; $109($0_1, 16106, 0); return HEAP8[$0_1 + 150 | 0] >= 0 ? 1 : 787; } return 0; } function $653($0_1, $1_1) { var $2_1 = 0; if (HEAP32[$1_1 + 8 >> 2]) { $2_1 = HEAP32[$0_1 >> 2]; $10($2_1, HEAP32[$0_1 + 124 >> 2]); HEAP32[$0_1 + 124 >> 2] = $116($2_1, HEAP32[$1_1 + 8 >> 2]); $24(HEAP32[$1_1 + 8 >> 2]); HEAP32[$1_1 + 8 >> 2] = 0; } } function $654($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = $132($5_1, $5_1 >> 31); block3 : { block1 : { if (!$5_1) { $0_1 = 7; break block1; } $0_1 = FUNCTION_TABLE[HEAP32[$0_1 + 24 >> 2]]($0_1, $1_1, $5_1, $3 & 32639, $4_1) | 0; if (!$0_1) { $0_1 = 0; break block3; } $24($5_1); } $5_1 = 0; } HEAP32[$2_1 >> 2] = $5_1; return $0_1; } function $655($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[$1_1 + 4 >> 2]]($0_1) | 0; HEAP32[$0_1 >> 2] = 0; } $24($0_1); } function $659($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $660(HEAP32[$1_1 + 20 >> 2]); HEAP32[$1_1 + 20 >> 2] = 0; $5_1 = $1_1 + 72 | 0; while (1) { if ($4_1 >>> 0 < HEAPU8[$1_1 + 67 | 0]) { $2_1 = Math_imul($4_1, 80) + $5_1 | 0; $10($0_1, HEAP32[$2_1 + 16 >> 2]); $661(0, HEAP32[$2_1 + 24 >> 2]); $3 = HEAP32[$2_1 + 48 >> 2]; if ($3) { $655($3) } $3 = HEAP32[$2_1 + 64 >> 2]; if ($3) { $655($3) } wasm2js_memory_fill($2_1, 0, 80); HEAP32[$2_1 + 12 >> 2] = $1_1; $4_1 = $4_1 + 1 | 0; continue; } break; }; if (!HEAP32[$1_1 + 44 >> 2]) { $661(0, HEAP32[$1_1 + 40 >> 2]) } HEAP8[$1_1 + 64 | 0] = 0; HEAP32[$1_1 + 48 >> 2] = 0; HEAP32[$1_1 + 52 >> 2] = 0; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 56 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 0; $10($0_1, HEAP32[$1_1 + 32 >> 2]); HEAP32[$1_1 + 32 >> 2] = 0; } function $660($0_1) { var $1_1 = 0; block : { if (!$0_1) { break block } while (1) { if (HEAP32[$0_1 >> 2] <= ($1_1 | 0)) { break block } $662(HEAP32[$0_1 + 12 >> 2] + Math_imul($1_1, 56) | 0); $1_1 = $1_1 + 1 | 0; continue; }; } $24($0_1); } function $661($0_1, $1_1) { var $2_1 = 0; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 + 4 >> 2]; $13($0_1, $1_1); $1_1 = $2_1; continue; } break; }; } function $662($0_1) { $24(HEAP32[$0_1 + 28 >> 2]); $24(HEAP32[$0_1 + 36 >> 2]); $663(HEAP32[$0_1 + 48 >> 2]); wasm2js_memory_fill($0_1, 0, 56); } function $663($0_1) { if ($0_1) { $660(HEAP32[$0_1 + 4 >> 2]); $24($0_1); } } function $664($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP32[$0_1 + 408 >> 2]; if ($2_1) { HEAP32[$0_1 + 408 >> 2] = 0; while (1) { if (!(HEAP32[$0_1 + 384 >> 2] <= ($3 | 0))) { $4_1 = HEAP32[($3 << 2) + $2_1 >> 2]; $5_1 = HEAP32[$4_1 + 8 >> 2]; block2 : { if (!$5_1) { break block2 } $6_1 = HEAP32[HEAP32[$5_1 >> 2] + $1_1 >> 2]; if (!$6_1) { break block2 } FUNCTION_TABLE[$6_1 | 0]($5_1) | 0; } HEAP32[$4_1 + 20 >> 2] = 0; $646($4_1); $3 = $3 + 1 | 0; continue; } break; }; $13($0_1, $2_1); HEAP32[$0_1 + 384 >> 2] = 0; } } function $665($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!$0_1 | HEAPU8[$0_1 + 8 | 0] != 2) { break block } $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$0_1 >> 2]; if (($1_1 | 0) == 2) { $4_1 = $183($3, 0, 0); if ($4_1) { break block } } $4_1 = $583(HEAP32[$3 >> 2], $1_1, $2_1); if ($4_1) { break block } if (!(!(HEAPU8[$3 + 24 | 0] & 16) | ($2_1 | 0) >= 0)) { HEAP32[$3 + 48 >> 2] = 0 } $4_1 = $146($3); $190($3, HEAP32[$3 + 12 >> 2]); } return $4_1; } function $666($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block1 : { block : { if (!HEAP32[$0_1 + 408 >> 2]) { break block } $9_1 = $2_1 + 1 | 0; while (1) { if ($5_1) { break block1 } if (HEAP32[$0_1 + 384 >> 2] <= ($6_1 | 0)) { break block } $5_1 = 0; $4_1 = HEAP32[HEAP32[$0_1 + 408 >> 2] + ($6_1 << 2) >> 2]; $7_1 = HEAP32[$4_1 + 8 >> 2]; block2 : { if (!$7_1) { break block2 } $3 = HEAP32[HEAP32[$4_1 + 4 >> 2] >> 2]; if (HEAP32[$3 >> 2] < 2) { break block2 } HEAP32[$4_1 + 12 >> 2] = HEAP32[$4_1 + 12 >> 2] + 1; block6 : { block4 : { switch ($1_1 | 0) { case 0: $3 = HEAP32[$3 + 80 >> 2]; HEAP32[$4_1 + 20 >> 2] = $9_1; break block6; case 2: $3 = HEAP32[$3 + 88 >> 2]; break block6; default: break block4; }; } $3 = HEAP32[$3 + 84 >> 2]; } if (!(!$3 | HEAP32[$4_1 + 20 >> 2] <= ($2_1 | 0))) { $5_1 = HEAP32[$0_1 + 36 >> 2]; $8_1 = HEAP32[$0_1 + 32 >> 2]; HEAP32[$0_1 + 32 >> 2] = $8_1 & -268435457; HEAP32[$0_1 + 36 >> 2] = $5_1; $5_1 = FUNCTION_TABLE[$3 | 0]($7_1, $2_1) | 0; $3 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] | $8_1 & 268435456; HEAP32[$0_1 + 36 >> 2] = $3; } $646($4_1); } $6_1 = $6_1 + 1 | 0; continue; }; } $5_1 = 0; } return $5_1; } function $667($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 80 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = $2_1 + 68 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$2_1 + 76 >> 2] = 0; HEAP32[$2_1 + 60 >> 2] = 0; HEAP32[$2_1 + 64 >> 2] = 0; $4_1 = $2_1 + 8 | 0; wasm2js_memory_fill($4_1, 0, 40); HEAP16[$2_1 + 24 >> 1] = 1; $3 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$2_1 + 56 >> 2] = $0_1; HEAP32[$2_1 + 28 >> 2] = $3; HEAP32[$2_1 + 48 >> 2] = $4_1; HEAP32[$2_1 + 52 >> 2] = $1_1; HEAP8[$2_1 + 72 | 0] = HEAPU8[$3 + 84 | 0]; FUNCTION_TABLE[HEAP32[$1_1 + 20 >> 2]]($2_1 + 48 | 0); if (HEAP32[$0_1 + 24 >> 2] > 0) { $13(HEAP32[$0_1 + 20 >> 2], HEAP32[$0_1 + 32 >> 2]) } wasm2js_memory_copy($0_1, $2_1 + 8 | 0, 40); $1_1 = HEAP32[$2_1 + 68 >> 2]; $0_1 = $2_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $668($0_1, $1_1, $2_1, $3) { $2_1 = $55($0_1, $1_1, $2_1, $3); if (!$2_1) { $10($0_1, $1_1) } return $2_1; } function $669($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0.0, $11_1 = 0; $4_1 = global$0 - 48 | 0; $3 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $3; block1 : { if ($237($0_1, 32)) { HEAP8[$0_1 + 18 | 0] = 0; $5_1 = 7; break block1; } $9_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAPU16[$0_1 + 16 >> 1]; block6 : { if ($3 & 4) { $6_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$0_1 + 4 >> 2]; $11_1 = $3; HEAP8[$4_1 + 37 | 0] = 0; $7_1 = $3; $8_1 = $6_1; $3 = $3 >> 31; $6_1 = $3; $5_1 = $8_1 ^ $3; $3 = $5_1 - $3 | 0; $7_1 = ($6_1 ^ $7_1) - (($5_1 >>> 0 < $6_1 >>> 0) + $6_1 | 0) | 0; $5_1 = 20; while (1) { $6_1 = __wasm_i64_udiv($3, $7_1, 10, 0); $8_1 = i64toi32_i32$HIGH_BITS; HEAP8[($4_1 + 16 | 0) + $5_1 | 0] = $3 - __wasm_i64_mul($6_1, $8_1, 10, 0) | 48; if (!(!$7_1 & $3 >>> 0 < 10)) { $5_1 = $5_1 - 1 | 0; $3 = $6_1; $7_1 = $8_1; continue; } break; }; if (($11_1 | 0) < 0) { $5_1 = $5_1 - 1 | 0; HEAP8[$5_1 + ($4_1 + 16 | 0) | 0] = 45; } $3 = 22 - $5_1 | 0; if ($3) { wasm2js_memory_copy($9_1, ($4_1 + 16 | 0) + $5_1 | 0, $3) } $5_1 = 21 - $5_1 | 0; break block6; } HEAP16[$4_1 + 36 >> 1] = 0; HEAP32[$4_1 + 28 >> 2] = 0; HEAP32[$4_1 + 32 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 20 >> 2] = $9_1; HEAP32[$4_1 + 24 >> 2] = 32; if ($3 & 32) { $10_1 = +HEAPU32[$0_1 >> 2] + +HEAP32[$0_1 + 4 >> 2] * 4294967296.0 } else { $10_1 = HEAPF64[$0_1 >> 3] } HEAPF64[$4_1 >> 3] = $10_1; $46($4_1 + 16 | 0, 12702, $4_1); $5_1 = HEAP32[$4_1 + 32 >> 2]; HEAP8[$9_1 + $5_1 | 0] = 0; } HEAP32[$0_1 + 12 >> 2] = $5_1; HEAP8[$0_1 + 18 | 0] = 1; $3 = HEAPU16[$0_1 + 16 >> 1] | 514; HEAP16[$0_1 + 16 >> 1] = $2_1 ? $3 & 65491 : $3; $228($0_1, $1_1); $5_1 = 0; } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $670($0_1, $1_1) { $0_1 = HEAP32[$0_1 + 88 >> 2] + Math_imul(HEAP32[$1_1 + 8 >> 2], 40) | 0; if (HEAPU8[$0_1 + 17 | 0] & 144) { $112($0_1); HEAP16[$0_1 + 16 >> 1] = 4; return $0_1; } HEAP16[$0_1 + 16 >> 1] = 4; return $0_1; } function $671($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; if (HEAPU8[$0_1 + 17 | 0] & 144) { $242($0_1); $671($0_1, $1_1, $2_1); return; } $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$0_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = $3; HEAP32[$0_1 + 16 >> 2] = HEAP32[$1_1 + 16 >> 2]; $3 = $1_1 + 8 | 0; $5_1 = HEAP32[$3 + 4 >> 2]; $4_1 = $0_1 + 8 | 0; HEAP32[$4_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$4_1 + 4 >> 2] = $5_1; if (!(HEAPU8[$1_1 + 17 | 0] & 32)) { HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 36863 | $2_1 } } function $672($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAPU16[$0_1 + 16 >> 1] & 45; if ($1_1) { $0_1 = $1_1 } else { $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block3 : { block1 : { if (HEAPU8[$0_1 + 17 | 0] & 4) { $2_1 = 0; if ($207($0_1)) { break block1 } } $2_1 = $303(HEAP32[$0_1 + 8 >> 2], $0_1, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]); block4 : { if (($2_1 | 0) <= 0) { $3 = 8; if ($2_1) { break block3 } if (($305(HEAP32[$0_1 + 8 >> 2], $1_1 + 8 | 0, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]) | 0) <= 1) { break block4 } break block3; } $3 = 8; if (($2_1 | 0) != 1) { break block3 } if ($305(HEAP32[$0_1 + 8 >> 2], $1_1 + 8 | 0, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0])) { break block3 } } $3 = HEAP32[$1_1 + 12 >> 2]; $2_1 = HEAP32[$1_1 + 8 >> 2]; } HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $3; $3 = 4; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $0_1 = $3; } return $0_1; } function $673($0_1) { HEAP32[$0_1 >> 2] = $50($0_1); HEAP32[$0_1 + 4 >> 2] = i64toi32_i32$HIGH_BITS; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 62016 | 4; } function $674($0_1, $1_1, $2_1) { block1 : { if (($1_1 | 0) >= 67) { $2_1 = HEAPU16[$0_1 + 16 >> 1]; if ($2_1 & 4) { break block1 } if (!($2_1 & 40)) { if (!($2_1 & 2)) { break block1 } $302($0_1, 1); return; } if ($1_1 >>> 0 > 69) { break block1 } $306($0_1); return; } if (($1_1 | 0) != 66) { break block1 } $1_1 = HEAPU16[$0_1 + 16 >> 1]; if (!($1_1 & 2 | !($1_1 & 44))) { $669($0_1, $2_1, 1); $1_1 = HEAPU16[$0_1 + 16 >> 1]; } HEAP16[$0_1 + 16 >> 1] = $1_1 & 65491; } } function $675($0_1) { HEAPF64[$0_1 >> 3] = $39($0_1); HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 62016 | 8; } function $676($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAPU16[$0_1 + 16 >> 1]; block : { if ($3 & 1) { break block } block7 : { block2 : { switch ($1_1 - 65 | 0) { case 0: if (!($3 & 16)) { $674($0_1, 66, $2_1); $1_1 = HEAPU16[$0_1 + 16 >> 1]; if (!($1_1 & 2)) { break block } HEAP16[$0_1 + 16 >> 1] = $1_1 & 62016 | 16; break block7; } HEAP16[$0_1 + 16 >> 1] = $3 & 62032; break block7; case 2: $745($0_1); break block7; case 3: $673($0_1); break block7; case 4: $675($0_1); break block7; default: break block2; }; } HEAP16[$0_1 + 16 >> 1] = $3 >>> 3 & 2 | $3; $674($0_1, 66, $2_1); HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] & 64451; if (($2_1 | 0) != 1) { HEAP32[$0_1 + 12 >> 2] = HEAP32[$0_1 + 12 >> 2] & -2 } $4_1 = $228($0_1, $2_1); if ($4_1) { break block } $248($0_1); } $4_1 = 0; } return $4_1; } function $677($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0.0, $8_1 = 0.0; $3 = HEAPU16[$1_1 + 16 >> 1]; $4_1 = HEAPU16[$0_1 + 16 >> 1]; $5_1 = $3 | $4_1; if ($5_1 & 1) { return ($3 & 1) - ($4_1 & 1) | 0 } folding_inner0 : { block3 : { block8 : { block7 : { if ($5_1 & 44) { $2_1 = $3 & $4_1; if ($2_1 & 36) { $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 >> 2]; $0_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($2_1 >>> 0 < $3 >>> 0 & ($0_1 | 0) <= ($1_1 | 0) | ($0_1 | 0) < ($1_1 | 0)) { break block3 } break folding_inner0; } if ($2_1 & 8) { $7_1 = HEAPF64[$0_1 >> 3]; $8_1 = HEAPF64[$1_1 >> 3]; if ($7_1 < $8_1) { break block3 } return $7_1 > $8_1; } if ($4_1 & 36) { if ($3 & 8) { return $734(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2], HEAPF64[$1_1 >> 3]) } $4_1 = -1; if (!($3 & 36)) { break block7 } $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 >> 2]; $0_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($2_1 >>> 0 < $3 >>> 0 & ($0_1 | 0) <= ($1_1 | 0) | ($0_1 | 0) < ($1_1 | 0)) { break block7 } break folding_inner0; } if (!($4_1 & 8)) { break block8 } if (!($3 & 36)) { break block3 } return 0 - $734(HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], HEAPF64[$0_1 >> 3]) | 0; } block9 : { if (!($5_1 & 2)) { break block9 } if (!($4_1 & 2)) { break block8 } if (!($3 & 2)) { break block3 } if (!$2_1) { break block9 } return $746($0_1, $1_1, $2_1, 0); } $2_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAPU16[$1_1 + 16 >> 1]; $5_1 = HEAPU16[$0_1 + 16 >> 1]; __inlined_func$747$92 : { if (($4_1 | $5_1) & 1024) { $5_1 = $5_1 & 1024; $6_1 = HEAP32[$0_1 >> 2] - HEAP32[$1_1 >> 2] | 0; if ($4_1 & $5_1) { break __inlined_func$747$92 } if ($5_1) { $6_1 = -1; if (!$773(HEAP32[$1_1 + 8 >> 2], $2_1)) { break __inlined_func$747$92 } $6_1 = HEAP32[$0_1 >> 2] - $2_1 | 0; break __inlined_func$747$92; } $6_1 = 1; if (!$773(HEAP32[$0_1 + 8 >> 2], $3)) { break __inlined_func$747$92 } $6_1 = $3 - HEAP32[$1_1 >> 2] | 0; break __inlined_func$747$92; } $0_1 = $2014(HEAP32[$0_1 + 8 >> 2], HEAP32[$1_1 + 8 >> 2], ($2_1 | 0) > ($3 | 0) ? $3 : $2_1); $6_1 = $0_1 ? $0_1 : $3 - $2_1 | 0; } $4_1 = $6_1; } return $4_1; } return 1; } return -1; } return $2_1 >>> 0 > $3 >>> 0 & ($0_1 | 0) >= ($1_1 | 0) | ($0_1 | 0) > ($1_1 | 0); } function $678($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAPU16[$0_1 + 16 >> 1]; if ($2_1 & 36) { return (HEAP32[$0_1 >> 2] | HEAP32[$0_1 + 4 >> 2]) != 0 } if (!($2_1 & 1)) { $1_1 = $39($0_1) != 0.0 } return $1_1; } function $679($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = $733(HEAP32[$0_1 + 36 >> 2], HEAP32[$0_1 + 56 >> 2], HEAP32[$0_1 + 60 >> 2], 0, $1_1 + 12 | 0); block : { if ($2_1) { break block } if (HEAP32[$1_1 + 12 >> 2]) { $2_1 = $181(88896); break block; } $2_1 = 0; HEAP32[$0_1 + 24 >> 2] = 0; HEAP8[$0_1 + 3 | 0] = 0; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $680($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 36 >> 2]; $2_1 = HEAPU8[$1_1 | 0]; block3 : { block2 : { if ($2_1 >>> 0 >= 3) { $3 = $340($1_1); if ($3) { HEAP32[$0_1 + 24 >> 2] = 0; break block2; } $2_1 = HEAPU8[$1_1 | 0]; } $3 = 0; HEAP32[$0_1 + 24 >> 2] = 0; if (!$2_1) { break block3 } } HEAP8[$0_1 + 2 | 0] = 1; } return $3; } function $681($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = HEAP32[$1_1 + 12 >> 2]; $1_1 = $4_1 + HEAP32[$1_1 + 16 >> 2] | 0; $6_1 = ($1_1 | 0) < ($4_1 | 0) ? $4_1 : $1_1; $1_1 = 0; while (1) { if (!(($4_1 | 0) == ($6_1 | 0))) { $2_1 = Math_imul($4_1, 40) + $0_1 | 0; $5_1 = HEAPU16[$2_1 + 16 >> 1]; block2 : { if ($5_1 & 36) { $1_1 = $1_1 + HEAP32[$2_1 + 4 >> 2] | 0; $5_1 = $3; $3 = $3 + HEAP32[$2_1 >> 2] | 0; $1_1 = $5_1 >>> 0 > $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; break block2; } if ($5_1 & 8) { $2_1 = $50($2_1); $1_1 = $1_1 + i64toi32_i32$HIGH_BITS | 0; $5_1 = $3; $3 = $3 + $2_1 | 0; $1_1 = $5_1 >>> 0 > $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; break block2; } $2_1 = $5_1 & 18; if (!$2_1) { break block2 } $2_1 = $2_1 + 4093 | 0; $3 = $3 + $2_1 | 0; $1_1 = $2_1 >>> 0 > $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; } $4_1 = $4_1 + 1 | 0; continue; } break; }; i64toi32_i32$HIGH_BITS = $1_1; return $3; } function $682($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = HEAP32[$0_1 + 88 >> 2]; $5_1 = ($1_1 | 0) > 0 ? Math_imul(HEAP32[$0_1 + 20 >> 2] - $1_1 | 0, 40) + $5_1 | 0 : $5_1; $8_1 = ($2_1 << 3) + 88 | 0; $7_1 = $8_1 + ($3 ? 0 : 200) | 0; $6_1 = HEAP32[$0_1 + 96 >> 2]; $4_1 = $1_1 << 2; $9_1 = HEAP32[$6_1 + $4_1 >> 2]; if ($9_1) { $649($0_1, $9_1); $6_1 = HEAP32[$0_1 + 96 >> 2]; HEAP32[$4_1 + $6_1 >> 2] = 0; } $4_1 = HEAP32[$5_1 + 24 >> 2]; block3 : { if (($7_1 | 0) <= ($4_1 | 0)) { $4_1 = HEAP32[$5_1 + 32 >> 2]; break block3; } if (($4_1 | 0) > 0) { $13(HEAP32[$5_1 + 20 >> 2], HEAP32[$5_1 + 32 >> 2]) } $4_1 = $51(HEAP32[$5_1 + 20 >> 2], $7_1, $7_1 >> 31); HEAP32[$5_1 + 8 >> 2] = $4_1; HEAP32[$5_1 + 32 >> 2] = $4_1; if (!$4_1) { HEAP32[$5_1 + 24 >> 2] = 0; return 0; } HEAP32[$5_1 + 24 >> 2] = $7_1; $6_1 = HEAP32[$0_1 + 96 >> 2]; } HEAP32[($1_1 << 2) + $6_1 >> 2] = $4_1; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $0_1 = $4_1 + 24 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $0_1 = $4_1 + 16 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $0_1 = $4_1 + 8 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$4_1 + 64 >> 2] = (($2_1 << 2) + $4_1 | 0) + 84; HEAP16[$4_1 + 52 >> 1] = $2_1; HEAP8[$4_1 | 0] = $3; if (!$3) { $0_1 = HEAP32[$5_1 + 8 >> 2] + $8_1 | 0; HEAP32[$4_1 + 36 >> 2] = $0_1; HEAP32[$0_1 + 16 >> 2] = 0; $1_1 = $0_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; } return $4_1; } function $683($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP32[$1_1 + 52 >> 2]; HEAP32[$1_1 + 52 >> 2] = 0; while (1) { if ($2_1) { $5_1 = HEAP32[$2_1 + 24 >> 2]; $3 = HEAP32[$2_1 >> 2]; block2 : { if (($0_1 | 0) == ($3 | 0)) { HEAP32[$1_1 + 52 >> 2] = $2_1; $4_1 = 0; $6_1 = $2_1; break block2; } $4_1 = HEAP32[$3 + 412 >> 2]; HEAP32[$3 + 412 >> 2] = $2_1; } HEAP32[$2_1 + 24 >> 2] = $4_1; $2_1 = $5_1; continue; } break; }; return $6_1; } function $684($0_1, $1_1) { $1_1 = $1_1 + 52 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!(!$1_1 | HEAP32[$1_1 >> 2] == ($0_1 | 0))) { $1_1 = $1_1 + 24 | 0; continue; } break; }; return $1_1; } function $685($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 + 384 >> 2]; if (($2_1 | 0) % 5 | 0) { return 0 } $1_1 = $2_1 >> 31 << 2 | $2_1 >>> 30; $2_1 = ($2_1 << 2) + 20 | 0; $1_1 = $2_1 >>> 0 < 20 ? $1_1 + 1 | 0 : $1_1; $2_1 = $55($0_1, HEAP32[$0_1 + 408 >> 2], $2_1, $1_1); if (!$2_1) { return 7 } $1_1 = $2_1 + (HEAP32[$0_1 + 384 >> 2] << 2) | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$1_1 + 16 >> 2] = 0; $1_1 = $1_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$0_1 + 408 >> 2] = $2_1; return 0; } function $686($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 384 >> 2]; HEAP32[$0_1 + 384 >> 2] = $2_1 + 1; HEAP32[HEAP32[$0_1 + 408 >> 2] + ($2_1 << 2) >> 2] = $1_1; HEAP32[$1_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2] + 1; } function $688($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAPU8[$0_1 + 5 | 0]; block1 : { block : { if (!HEAPU8[$0_1 + 15 | 0]) { break block } switch ($1_1 - 2 | 0) { case 0: case 2: break block; default: break block1; }; } if (($1_1 | 0) == ($2_1 | 0)) { break block1 } HEAP8[$0_1 + 5 | 0] = $1_1; if (!(HEAPU8[$0_1 + 4 | 0] | ($1_1 & 1 | ($2_1 & 5) != 1))) { $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } if (HEAPU8[$0_1 + 18 | 0] >= 2) { $1_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$1_1 + 28 >> 2]; if (!$2_1) { break block1 } FUNCTION_TABLE[$2_1 | 0]($1_1, HEAP32[$0_1 + 188 >> 2], 0) | 0; break block1; } $1_1 = 0; $2_1 = HEAPU8[$0_1 + 17 | 0]; block7 : { if ($2_1) { $3 = $2_1 } else { $1_1 = $611($0_1); $3 = HEAPU8[$0_1 + 17 | 0]; } if (($3 & 255) == 1) { $1_1 = $576($0_1, 2) } if ($1_1) { break block7 } $1_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 + 28 >> 2]; if ($3) { FUNCTION_TABLE[$3 | 0]($1_1, HEAP32[$0_1 + 188 >> 2], 0) | 0 } if (($2_1 | 0) != 1) { break block7 } $587($0_1, 1); break block1; } if ($2_1) { break block1 } $519($0_1); break block1; } block9 : { switch ($1_1 - 2 | 0) { case 0: case 2: break block9; default: break block1; }; } $1_1 = HEAP32[$0_1 + 68 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block1 } FUNCTION_TABLE[HEAP32[$2_1 + 4 >> 2]]($1_1) | 0; HEAP32[$1_1 >> 2] = 0; } return HEAPU8[$0_1 + 5 | 0]; } function $689($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$0_1 + 4 >> 2]; block2 : { block1 : { if (($2_1 | 0) >= 0) { if (!$5_1 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0) { break block1 } $3 = $4_1 ^ 2147483647; if (($2_1 | 0) == ($3 | 0) & $1_1 >>> 0 <= ($5_1 ^ -1) >>> 0 | $2_1 >>> 0 < $3 >>> 0) { break block1 } break block2; } if (($4_1 | 0) >= 0) { break block1 } $6_1 = -2147483648 - ($4_1 + ($5_1 >>> 0 > 1) | 0) | 0; $7_1 = $1_1 + 1 | 0; $3 = $7_1 ? $2_1 : $2_1 + 1 | 0; if (($3 | 0) <= ($6_1 | 0) & 1 - $5_1 >>> 0 > $7_1 >>> 0 | ($3 | 0) < ($6_1 | 0)) { break block2 } } $2_1 = $2_1 + $4_1 | 0; $3 = $1_1; $1_1 = $1_1 + $5_1 | 0; $2_1 = $3 >>> 0 > $1_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1; return 0; } return 1; } function $690($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$1_1 + 220 >> 2]; HEAP32[$1_1 + 220 >> 2] = $0_1; } function $691($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; $204($0_1); $1_1 = $325($2_1, 32, 0); if (!$1_1) { return 7 } $3 = $43($2_1, $1_1); HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 28 >> 2] = 0; HEAP16[$1_1 + 26 >> 1] = 1; HEAP32[$1_1 + 16 >> 2] = $1_1 + 32; HEAP16[$1_1 + 24 >> 1] = $3 + 1048544 >>> 4; HEAP32[$0_1 + 36 >> 2] = 30; HEAP16[$0_1 + 16 >> 1] = 4112; HEAP32[$0_1 + 8 >> 2] = $1_1; return 0; } function $692($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 160 | 0; $1_1 = $3; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; wasm2js_memory_fill($3, 0, 160); while (1) { if ($0_1) { $1_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = 0; HEAP32[$0_1 + 8 >> 2] = 0; while (1) { $4_1 = ($2_1 << 2) + $3 | 0; $5_1 = HEAP32[$4_1 >> 2]; if ($5_1) { $0_1 = $694($5_1, $0_1); HEAP32[$4_1 >> 2] = 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$4_1 >> 2] = $0_1; $0_1 = $1_1; continue; } break; }; $0_1 = HEAP32[$3 >> 2]; $2_1 = 1; while (1) { if (!(($2_1 | 0) == 40)) { $1_1 = HEAP32[($2_1 << 2) + $3 >> 2]; block4 : { if (!$1_1) { break block4 } if (!$0_1) { $0_1 = $1_1; break block4; } $0_1 = $694($0_1, $1_1); } $2_1 = $2_1 + 1 | 0; continue; } break; }; $1_1 = $3 + 160 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $693($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; while (1) { $3 = $0_1; $0_1 = HEAP32[$3 + 12 >> 2]; block1 : { if ($0_1) { $693($0_1, $1_1, $4_1 + 12 | 0); HEAP32[HEAP32[$4_1 + 12 >> 2] + 8 >> 2] = $3; break block1; } HEAP32[$1_1 >> 2] = $3; } $1_1 = $3 + 8 | 0; $0_1 = HEAP32[$3 + 8 >> 2]; if ($0_1) { continue } break; }; HEAP32[$2_1 >> 2] = $3; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $694($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $3 = $6_1; block2 : { label : while (1) { $7_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = $1_1; while (1) { $1_1 = $2_1; $2_1 = HEAP32[$1_1 >> 2]; $5_1 = HEAP32[$1_1 + 4 >> 2]; $8_1 = ($4_1 | 0) > ($5_1 | 0); if (!($2_1 >>> 0 < $7_1 >>> 0 & ($5_1 | 0) <= ($4_1 | 0) | $8_1)) { if (!($8_1 | $2_1 >>> 0 <= $7_1 >>> 0 & ($4_1 | 0) >= ($5_1 | 0))) { HEAP32[$3 + 8 >> 2] = $0_1; $3 = $0_1; } $0_1 = HEAP32[$0_1 + 8 >> 2]; if ($0_1) { continue label } break block2; } HEAP32[$3 + 8 >> 2] = $1_1; $3 = $1_1; $2_1 = HEAP32[$1_1 + 8 >> 2]; if ($2_1) { continue } break; }; break; }; $1_1 = $0_1; } HEAP32[$3 + 8 >> 2] = $1_1; return HEAP32[$6_1 + 8 >> 2]; } function $695($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $4_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; $3 = 1; while (1) { $1_1 = $4_1; if ($1_1) { HEAP32[$2_1 + 12 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$1_1 + 8 >> 2] = $834($2_1 + 12 | 0, $3); $3 = $3 + 1 | 0; $4_1 = HEAP32[$2_1 + 12 >> 2]; $0_1 = $1_1; continue; } break; }; $1_1 = $2_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $696($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAPU16[$0_1 + 24 >> 1]; block1 : { if ($1_1) { $2_1 = $1_1 - 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; break block1; } $1_1 = $325(HEAP32[$0_1 + 4 >> 2], 1016, 0); if (!$1_1) { return 0 } HEAP32[$1_1 >> 2] = HEAP32[$0_1 >> 2]; HEAP32[$0_1 >> 2] = $1_1; $2_1 = 62; $1_1 = $1_1 + 8 | 0; } HEAP16[$0_1 + 24 >> 1] = $2_1; HEAP32[$0_1 + 16 >> 2] = $1_1 + 16; return $1_1; } function $697($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = $696($0_1); if ($3) { HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $2_1; $4_1 = HEAP32[$0_1 + 12 >> 2]; block3 : { if ($4_1) { $5_1 = HEAPU32[$4_1 >> 2] < $1_1 >>> 0; $1_1 = HEAP32[$4_1 + 4 >> 2]; if (!($5_1 & ($1_1 | 0) <= ($2_1 | 0) | ($1_1 | 0) < ($2_1 | 0))) { HEAP16[$0_1 + 26 >> 1] = HEAPU16[$0_1 + 26 >> 1] & 65534 } HEAP32[$4_1 + 8 >> 2] = $3; break block3; } HEAP32[$0_1 + 8 >> 2] = $3; } HEAP32[$0_1 + 12 >> 2] = $3; } } function $698($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 >> 2]; $13(HEAP32[$0_1 + 4 >> 2], $1_1); $1_1 = $2_1; continue; } break; }; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 65536; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; } function $699($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $4_1 = global$0 - 48 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; $10_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = $3; block2 : { while (1) { block : { if (!$2_1 | !HEAP32[$0_1 + 16 >> 2]) { break block } if ($831($0_1, $2_1)) { break block } $7_1 = $5_1 - 1 | 0; $6_1 = HEAP32[$0_1 + 4 >> 2]; if (FUNCTION_TABLE[HEAP32[$6_1 + 220 >> 2]]($6_1, $2_1, $4_1 + 44 | 0, 0) | 0) { HEAP32[$4_1 + 32 >> 2] = $2_1; $700($0_1, 1973, $4_1 + 32 | 0); break block2; } else { $6_1 = HEAP32[HEAP32[$4_1 + 44 >> 2] + 4 >> 2]; block8 : { block9 : { block5 : { if ($1_1) { $9_1 = $156($6_1 + 4 | 0); $8_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$8_1 + 17 | 0]) { $701($0_1, $2_1, 2, 0); $8_1 = HEAP32[$0_1 >> 2]; } if ($9_1 >>> 0 > (HEAP32[$8_1 + 40 >> 2] >>> 2 | 0) - 2 >>> 0) { break block5 } $2_1 = 0; $8_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $11_1 = $6_1 + 8 | 0; while (1) { if (($2_1 | 0) != ($8_1 | 0)) { $5_1 = $156(($2_1 << 2) + $11_1 | 0); if (HEAPU8[HEAP32[$0_1 >> 2] + 17 | 0]) { $701($0_1, $5_1, 2, 0) } $831($0_1, $5_1); $2_1 = $2_1 + 1 | 0; continue; } break; }; $5_1 = $7_1 - $9_1 | 0; break block8; } if (!HEAPU8[HEAP32[$0_1 >> 2] + 17 | 0] | !$7_1) { break block9 } $701($0_1, $156($6_1), 4, $2_1); break block9; } HEAP32[$4_1 + 16 >> 2] = $2_1; $700($0_1, 2072, $4_1 + 16 | 0); $5_1 = $5_1 - 2 | 0; break block8; } $5_1 = $7_1; } $2_1 = $156($6_1); $99(HEAP32[$4_1 + 44 >> 2]); continue; } } break; }; $7_1 = $5_1; } if (!(!$7_1 | HEAP32[$0_1 + 20 >> 2] != ($10_1 | 0))) { HEAP32[$4_1 >> 2] = $1_1 ? 12933 : 12329; HEAP32[$4_1 + 8 >> 2] = $3; HEAP32[$4_1 + 4 >> 2] = $3 - $7_1; $700($0_1, 2148, $4_1); } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $700($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $832($0_1); $4_1 = HEAP32[$0_1 + 16 >> 2]; block : { if (!$4_1) { break block } HEAP32[$0_1 + 16 >> 2] = $4_1 - 1; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + 1; HEAP32[$3 + 12 >> 2] = $2_1; $2_1 = $0_1 + 48 | 0; if (HEAP32[$0_1 + 64 >> 2]) { $36($2_1, 30821, 1) } $4_1 = HEAP32[$0_1 + 32 >> 2]; if ($4_1) { $5_1 = HEAP32[$0_1 + 40 >> 2]; $6_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$3 + 8 >> 2] = HEAP32[$0_1 + 44 >> 2]; HEAP32[$3 >> 2] = $6_1; HEAP32[$3 + 4 >> 2] = $5_1; $46($2_1, $4_1, $3); } $35($2_1, $1_1, HEAP32[$3 + 12 >> 2]); if (HEAPU8[$0_1 + 68 | 0] != 7) { break block } HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 7; if (HEAP32[$0_1 + 20 >> 2]) { break block } HEAP32[$0_1 + 20 >> 2] = 1; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $701($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 48 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = $623(HEAP32[$0_1 >> 2], $1_1, $4_1 + 47 | 0, $4_1 + 40 | 0); block3 : { if ($5_1) { block2 : { if (($5_1 | 0) != 3082 & ($5_1 | 0) != 7) { break block2 } HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 7; if (HEAP32[$0_1 + 20 >> 2]) { break block2 } HEAP32[$0_1 + 20 >> 2] = 1; } HEAP32[$4_1 >> 2] = $1_1; $700($0_1, 1883, $4_1); break block3; } $5_1 = HEAP32[$4_1 + 40 >> 2]; $6_1 = HEAPU8[$4_1 + 47 | 0]; if (($2_1 | 0) == ($6_1 | 0) & ($3 | 0) == ($5_1 | 0)) { break block3 } HEAP32[$4_1 + 32 >> 2] = $5_1; HEAP32[$4_1 + 28 >> 2] = $6_1; HEAP32[$4_1 + 24 >> 2] = $3; HEAP32[$4_1 + 20 >> 2] = $2_1; HEAP32[$4_1 + 16 >> 2] = $1_1; $700($0_1, 25146, $4_1 + 16 | 0); } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $702($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0; $5_1 = global$0 - 144 | 0; $7_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $7_1; HEAP32[$5_1 + 136 >> 2] = $3; HEAP32[$5_1 + 140 >> 2] = $4_1; HEAP32[$5_1 + 132 >> 2] = 0; $25 = HEAP32[$0_1 + 44 >> 2]; $26_1 = HEAP32[$0_1 + 40 >> 2]; $27 = HEAP32[$0_1 + 32 >> 2]; $832($0_1); $14 = -1; block1 : { block : { if (!HEAP32[$0_1 + 16 >> 2]) { break block } if (!$1_1) { break block1 } $15_1 = HEAP32[$0_1 >> 2]; $17_1 = HEAP32[$15_1 + 40 >> 2]; if ($831($0_1, $1_1)) { break block1 } HEAP32[$0_1 + 40 >> 2] = $1_1; HEAP32[$0_1 + 32 >> 2] = 30703; $7_1 = $189($15_1, $1_1, $5_1 + 132 | 0, 0); if ($7_1) { HEAP32[$5_1 + 96 >> 2] = $7_1; $700($0_1, 16798, $5_1 + 96 | 0); if (($7_1 | 0) != 3082) { break block } HEAP32[$0_1 + 24 >> 2] = 7; break block; } $8_1 = HEAP32[$5_1 + 132 >> 2]; $28_1 = HEAPU8[$8_1 | 0]; HEAP8[$8_1 | 0] = 0; $7_1 = $514($8_1); if ($7_1) { HEAP32[$5_1 + 80 >> 2] = $7_1; $700($0_1, 17261, $5_1 + 80 | 0); break block; } $7_1 = $765($8_1); if ($7_1) { HEAP32[$5_1 + 64 >> 2] = $7_1; $700($0_1, 10351, $5_1 - -64 | 0); break block; } $12_1 = HEAPU8[$8_1 + 9 | 0]; $16_1 = HEAP32[$8_1 + 56 >> 2]; HEAP32[$0_1 + 32 >> 2] = 30677; $13_1 = $12_1 + $16_1 | 0; $9_1 = HEAPU8[$13_1 + 3 | 0] << 8 | HEAPU8[$13_1 + 4 | 0]; $14 = (HEAPU8[$13_1 + 6 | 0] | HEAPU8[$13_1 + 5 | 0] << 8) - 1 | 0; $6_1 = HEAPU8[$8_1 + 8 | 0]; if (HEAPU8[$8_1 + 1 | 0] ? $6_1 : 1) { $7_1 = HEAP32[$0_1 + 84 >> 2]; $10_1 = $9_1 + HEAP32[$0_1 + 80 >> 2] | 0; $7_1 = $9_1 >>> 0 > $10_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; HEAP32[$0_1 + 80 >> 2] = $10_1; HEAP32[$0_1 + 84 >> 2] = $7_1; } $7_1 = $14 & 65535; $14 = -1; $18_1 = 1; $10_1 = $9_1 - 1 | 0; $11_1 = $10_1 << 1; $24_1 = ($16_1 + ($12_1 - ($6_1 << 2) | 0) | 0) + 12 | 0; block9 : { if (!$6_1) { $9_1 = $156($13_1 + 8 | 0); if (HEAPU8[$15_1 + 17 | 0]) { HEAP32[$0_1 + 32 >> 2] = 30732; $701($0_1, $9_1, 5, $1_1); } $6_1 = 0; $14 = $702($0_1, $9_1, $5_1 + 136 | 0, $3, $4_1); $18_1 = 0; break block9; } $6_1 = HEAP32[$0_1 + 72 >> 2]; HEAP32[$6_1 >> 2] = 0; } $29_1 = $7_1 + 1 | 0; $19_1 = $11_1 + $24_1 | 0; $30_1 = $17_1 - 5 | 0; $21_1 = $17_1 - 4 | 0; $22_1 = 1; $9_1 = $10_1; while (1) { if (!(!HEAP32[$0_1 + 16 >> 2] | ($9_1 | 0) < 0)) { HEAP32[$0_1 + 44 >> 2] = $9_1; $11_1 = HEAPU8[$19_1 + 1 | 0] | HEAPU8[$19_1 | 0] << 8; block13 : { if (!($7_1 >>> 0 < $11_1 >>> 0 & $11_1 >>> 0 <= $21_1 >>> 0)) { HEAP32[$5_1 + 40 >> 2] = $21_1; HEAP32[$5_1 + 36 >> 2] = $29_1; HEAP32[$5_1 + 32 >> 2] = $11_1; $700($0_1, 1920, $5_1 + 32 | 0); $22_1 = 0; break block13; } $23_1 = $11_1 + $16_1 | 0; FUNCTION_TABLE[HEAP32[$8_1 + 80 >> 2]]($8_1, $23_1, $5_1 + 104 | 0); if ($17_1 >>> 0 < $11_1 + HEAPU16[$5_1 + 122 >> 1] >>> 0) { $22_1 = 0; $700($0_1, 14685, 0); break block13; } if (HEAPU8[$8_1 + 1 | 0]) { $12_1 = HEAP32[$5_1 + 136 >> 2]; $20_1 = HEAP32[$5_1 + 140 >> 2]; $3 = HEAP32[$5_1 + 104 >> 2]; $4_1 = HEAP32[$5_1 + 108 >> 2]; block18 : { block17 : { if ($18_1) { if ($3 >>> 0 > $12_1 >>> 0 & ($4_1 | 0) >= ($20_1 | 0) | ($4_1 | 0) > ($20_1 | 0)) { break block17 } break block18; } if ($3 >>> 0 < $12_1 >>> 0 & ($4_1 | 0) <= ($20_1 | 0) | ($4_1 | 0) < ($20_1 | 0)) { break block18 } } HEAP32[$5_1 + 48 >> 2] = $3; HEAP32[$5_1 + 52 >> 2] = $4_1; $700($0_1, 9746, $5_1 + 48 | 0); $3 = HEAP32[$5_1 + 104 >> 2]; $4_1 = HEAP32[$5_1 + 108 >> 2]; } HEAP32[$5_1 + 136 >> 2] = $3; HEAP32[$5_1 + 140 >> 2] = $4_1; $18_1 = 0; } $3 = HEAP32[$5_1 + 116 >> 2]; $4_1 = HEAPU16[$5_1 + 120 >> 1]; if ($3 >>> 0 > $4_1 >>> 0) { $4_1 = (($3 + $30_1 | 0) - $4_1 >>> 0) / ($21_1 >>> 0) | 0; $3 = $156((HEAPU16[$5_1 + 122 >> 1] + $23_1 | 0) - 4 | 0); if (HEAPU8[$15_1 + 17 | 0]) { $701($0_1, $3, 3, $1_1) } $699($0_1, 0, $3, $4_1); } if (!HEAPU8[$8_1 + 8 | 0]) { $3 = $156($23_1); if (HEAPU8[$15_1 + 17 | 0]) { $701($0_1, $3, 5, $1_1) } $18_1 = 0; $3 = $702($0_1, $3, $5_1 + 136 | 0, HEAP32[$5_1 + 136 >> 2], HEAP32[$5_1 + 140 >> 2]); if (($3 | 0) == ($14 | 0)) { break block13 } $700($0_1, 4768, 0); $14 = $3; break block13; } $833($6_1, ($11_1 + HEAPU16[$5_1 + 122 >> 1] | 0) - 1 | $11_1 << 16); } $19_1 = $19_1 - 2 | 0; $9_1 = $9_1 - 1 | 0; continue; } break; }; $3 = HEAP32[$5_1 + 140 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$5_1 + 136 >> 2]; HEAP32[$2_1 + 4 >> 2] = $3; HEAP32[$0_1 + 32 >> 2] = 0; if ($22_1) { if (HEAP32[$0_1 + 16 >> 2] <= 0) { break block } block24 : { if (HEAPU8[$8_1 + 8 | 0]) { break block24 } $6_1 = HEAP32[$0_1 + 72 >> 2]; HEAP32[$6_1 >> 2] = 0; while (1) { if (($10_1 | 0) < 0) { break block24 } $2_1 = ($10_1 << 1) + $24_1 | 0; $2_1 = HEAPU8[$2_1 | 0] << 8 | HEAPU8[$2_1 + 1 | 0]; $833($6_1, ((FUNCTION_TABLE[HEAP32[$8_1 + 76 >> 2]]($8_1, $2_1 + $16_1 | 0) | 0) + $2_1 | 0) - 1 | $2_1 << 16); $10_1 = $10_1 - 1 | 0; continue; }; } $3 = $13_1 + 2 | 0; $2_1 = $13_1 + 1 | 0; while (1) { $3 = HEAPU8[$3 | 0] | HEAPU8[$2_1 | 0] << 8; if ($3) { $2_1 = $3 + $16_1 | 0; $833($6_1, ($3 + (HEAPU8[$2_1 + 2 | 0] << 8 | HEAPU8[$2_1 + 3 | 0]) | 0) - 1 | $3 << 16); $3 = $2_1 + 1 | 0; continue; } else { $9_1 = HEAP32[$6_1 >> 2]; $10_1 = 0; block29 : { block26 : { while (1) { if (!$9_1) { break block26 } $4_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = ($9_1 << 2) + $6_1 | 0; HEAP32[$6_1 + 4 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = -1; $9_1 = $9_1 - 1 | 0; HEAP32[$6_1 >> 2] = $9_1; $3 = 1; while (1) { block27 : { $2_1 = $3 << 1; if ($2_1 >>> 0 > $9_1 >>> 0) { break block27 } $12_1 = ($3 << 2) + $6_1 | 0; $8_1 = HEAP32[$12_1 >> 2]; $3 = $2_1 | 1; $3 = HEAPU32[($2_1 << 2) + $6_1 >> 2] > HEAPU32[($3 << 2) + $6_1 >> 2] ? $3 : $2_1; $2_1 = ($3 << 2) + $6_1 | 0; $11_1 = HEAP32[$2_1 >> 2]; if ($8_1 >>> 0 < $11_1 >>> 0) { break block27 } HEAP32[$12_1 >> 2] = $11_1; HEAP32[$2_1 >> 2] = $8_1; $9_1 = HEAP32[$6_1 >> 2]; continue; } break; }; $2_1 = $7_1 & 65535; $3 = $4_1 >>> 16 | 0; if ($2_1 >>> 0 < $3 >>> 0) { $10_1 = $3 + (($2_1 ^ -1) + $10_1 | 0) | 0; $7_1 = $4_1; continue; } break; }; HEAP32[$5_1 + 20 >> 2] = $1_1; HEAP32[$5_1 + 16 >> 2] = $3; $700($0_1, 2111, $5_1 + 16 | 0); if (!HEAP32[$6_1 >> 2]) { break block29 } break block; } $2_1 = $7_1 & 65535; } $2_1 = (($2_1 ^ -1) + $17_1 | 0) + $10_1 | 0; $3 = HEAPU8[$13_1 + 7 | 0]; if (($2_1 | 0) == ($3 | 0)) { break block } HEAP32[$5_1 + 8 >> 2] = $1_1; HEAP32[$5_1 + 4 >> 2] = $3; HEAP32[$5_1 >> 2] = $2_1; $700($0_1, 2020, $5_1); break block; } }; } HEAP8[$8_1 | 0] = $28_1; } $625(HEAP32[$5_1 + 132 >> 2]); HEAP32[$0_1 + 44 >> 2] = $25; HEAP32[$0_1 + 40 >> 2] = $26_1; HEAP32[$0_1 + 32 >> 2] = $27; $6_1 = $14 + 1 | 0; } $0_1 = $5_1 + 144 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $703($0_1) { return $320(HEAP32[$0_1 + 24 >> 2] + 8 | 0, HEAP32[$0_1 + 4 >> 2]); } function $704($0_1, $1_1) { $11($0_1, HEAP32[$1_1 + 36 >> 2]); $358($0_1, HEAP32[$1_1 + 40 >> 2]); $10($0_1, HEAP32[$1_1 + 16 >> 2]); if (HEAPU8[$1_1 + 55 | 0] & 16) { $10($0_1, HEAP32[$1_1 + 32 >> 2]) } $13($0_1, $1_1); } function $705($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]; $4_1 = $2_1 + 16 | 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $5_1 = HEAP32[$4_1 + 8 >> 2]; HEAP32[$5_1 + 28 >> 2] = HEAP32[$5_1 + 28 >> 2] & -17; continue; } break; }; $4_1 = $2_1 + 32 | 0; $2_1 = $4_1; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $5_1 = HEAP32[$2_1 + 8 >> 2]; $6_1 = (HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8) & 65407; HEAP8[$5_1 + 55 | 0] = $6_1; HEAP8[$5_1 + 56 | 0] = $6_1 >>> 8; continue; } break; }; HEAP32[$3 + 8 >> 2] = $0_1; $2_1 = HEAP32[HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) >> 2]; HEAP32[$3 + 12 >> 2] = $2_1; $1_1 = 0; $5_1 = $319($0_1, 23814, $2_1); block2 : { if (!$5_1 | HEAPU8[$5_1 + 43 | 0]) { break block2 } HEAP32[$3 >> 2] = $2_1; $2_1 = $310($0_1, 23786, $3); if (!$2_1) { $1_1 = 7; break block2; } $1_1 = $97($0_1, $2_1, 31, $3 + 8 | 0, 0); $13($0_1, $2_1); } while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $2_1 = HEAP32[$4_1 + 8 >> 2]; if (HEAPU8[$2_1 + 55 | 0] & 128) { continue } $781($2_1); continue; } break; }; if (($1_1 | 0) == 7) { $106($0_1) } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $706($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; $1_1 = $5_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $4_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAP32[$0_1 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] | 64; $3 = 0; block : { if (!$2_1) { break block } $3 = 1; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + 1; if (HEAPU8[$1_1 + 87 | 0]) { $776($0_1, $2_1, 0); break block; } block2 : { $7_1 = HEAP32[$2_1 + 12 >> 2]; if (!$7_1) { break block2 } $3 = HEAP32[$2_1 + 16 >> 2]; block12 : { if ($3) { $6_1 = HEAPU8[$3 | 0]; if (!(($6_1 & 223) != 67 | (HEAPU8[$3 + 1 | 0] & 223) != 82)) { $6_1 = HEAPU8[$1_1 + 176 | 0]; HEAP8[$1_1 + 176 | 0] = $4_1; $3 = $1_1 + 172 | 0; block6 : { block7 : { if ($777($7_1, $3)) { $4_1 = HEAP32[$3 >> 2]; $3 = HEAP32[$0_1 + 24 >> 2]; if ($4_1 >>> 0 <= $3 >>> 0 | !$3) { break block6 } if (HEAPU8[75553]) { break block7 } break block6; } if (!HEAPU8[75553]) { break block6 } } $776($0_1, $2_1, 14668); } HEAP32[$1_1 + 180 >> 2] = $2_1; HEAP8[$1_1 + 178 | 0] = HEAPU8[$1_1 + 178 | 0] & 254; $3 = 0; HEAP32[$5_1 + 12 >> 2] = 0; $350($1_1, HEAP32[$2_1 + 16 >> 2], -1, 0, 0, $5_1 + 12 | 0, 0); HEAP8[$1_1 + 176 | 0] = $6_1; $4_1 = HEAP32[$1_1 + 64 >> 2]; block8 : { if (!$4_1 | HEAP8[$1_1 + 178 | 0] & 1) { break block8 } if (HEAP32[$0_1 + 12 >> 2] < ($4_1 | 0)) { HEAP32[$0_1 + 12 >> 2] = $4_1 } block11 : { switch ($4_1 - 7 | 0) { case 0: $106($1_1); break block8; case 2: break block8; default: break block11; }; } if (($4_1 & 255) == 6) { break block8 } $776($0_1, $2_1, $127($1_1)); } HEAP32[$1_1 + 180 >> 2] = 76320; $100(HEAP32[$5_1 + 12 >> 2]); break block; } $3 = HEAP32[$2_1 + 4 >> 2]; if ($6_1 | !$3) { break block2 } break block12; } $3 = HEAP32[$2_1 + 4 >> 2]; if (!$3) { break block2 } } $1_1 = $778($1_1, $3, HEAP32[HEAP32[$1_1 + 16 >> 2] + ($4_1 << 4) >> 2]); block14 : { if (!$1_1) { $776($0_1, $2_1, 1574); break block14; } block16 : { block15 : { $3 = $1_1 + 44 | 0; if (!$777(HEAP32[$2_1 + 12 >> 2], $3)) { break block15 } $3 = HEAP32[$3 >> 2]; if ($3 >>> 0 < 2 | $3 >>> 0 > HEAPU32[$0_1 + 24 >> 2]) { break block15 } $3 = 0; if (!$779($1_1)) { break block } if (HEAPU8[75553]) { break block16 } break block; } $3 = 0; if (!HEAPU8[75553]) { break block } } $776($0_1, $2_1, 14668); } $3 = 0; break block; } $3 = 0; $776($0_1, $2_1, 0); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $707($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 32 | 0; $5_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$6_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; block2 : { block7 : { block1 : { block9 : { if (HEAPU8[$6_1 + 17 | 0]) { $179($6_1); $709($0_1, 4, $3 + 24 | 0); $5_1 = HEAP32[$3 + 24 >> 2]; if ($5_1 >>> 0 > HEAPU32[$6_1 + 48 >> 2]) { break block1 } $7_1 = HEAP32[18884]; while (1) { $4_1 = $5_1; $5_1 = $4_1 + 1 | 0; if (($5_1 | 0) == ($180($6_1, $5_1) | 0) | ($4_1 | 0) == (($7_1 >>> 0) / HEAPU32[$6_1 + 36 >> 2] | 0)) { continue } break; }; HEAP32[$3 + 24 >> 2] = $5_1; $4_1 = $624($6_1, $3 + 12 | 0, $3 + 16 | 0, $5_1, 1); HEAP32[$3 + 20 >> 2] = $4_1; if ($4_1) { break block2 } $7_1 = HEAP32[$3 + 16 >> 2]; block8 : { if (($5_1 | 0) != ($7_1 | 0)) { HEAP8[$3 + 11 | 0] = 0; HEAP32[$3 + 4 >> 2] = 0; $4_1 = $183($6_1, 0, 0); $625(HEAP32[$3 + 12 >> 2]); if ($4_1) { break block2 } $4_1 = $189($6_1, $5_1, $3 + 28 | 0, 0); if ($4_1) { break block2 } $4_1 = $623($6_1, $5_1, $3 + 11 | 0, $3 + 4 | 0); block6 : { $8_1 = HEAPU8[$3 + 11 | 0]; block5 : { if (($8_1 - 1 & 255) >>> 0 <= 1) { $4_1 = $181(80827); break block5; } if (!$4_1) { break block6 } } $7_1 = HEAP32[$3 + 28 >> 2]; break block7; } $9_1 = HEAP32[$3 + 28 >> 2]; $4_1 = $626($6_1, $9_1, $8_1, HEAP32[$3 + 4 >> 2], $7_1, 0); $625($9_1); if ($4_1) { break block2 } $4_1 = $189($6_1, $5_1, $3 + 28 | 0, 0); if ($4_1) { break block2 } $7_1 = HEAP32[$3 + 28 >> 2]; $4_1 = $150(HEAP32[$7_1 + 72 >> 2]); HEAP32[$3 + 20 >> 2] = $4_1; if (!$4_1) { break block8 } break block7; } $7_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$3 + 28 >> 2] = $7_1; } $639($6_1, $5_1, 1, 0, $3 + 20 | 0); $4_1 = HEAP32[$3 + 20 >> 2]; if ($4_1) { break block7 } $4_1 = $147($0_1, 4, $5_1); HEAP32[$3 + 20 >> 2] = $4_1; if ($4_1) { break block7 } break block9; } $4_1 = $624($6_1, $3 + 28 | 0, $3 + 24 | 0, 1, 0); HEAP32[$3 + 20 >> 2] = $4_1; if ($4_1) { break block2 } $7_1 = HEAP32[$3 + 28 >> 2]; } $615($7_1, $2_1 & 1 ? 13 : 10); $99(HEAP32[$7_1 + 72 >> 2]); HEAP32[$1_1 >> 2] = HEAP32[$3 + 24 >> 2]; $4_1 = 0; break block2; } $4_1 = $181(80779); break block2; } $625($7_1); } $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $708($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$0_1 >> 2]; $4_1 = $183($3, $1_1, 0); if (!$4_1) { if (HEAPU8[$0_1 + 11 | 0]) { $753($0_1, $1_1, 0, 0, 1) } $4_1 = $754($3, $1_1, 0, $2_1); } return $4_1; } function $709($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$0_1 >> 2]; if (($1_1 | 0) == 15) { $0_1 = HEAP32[$0_1 + 20 >> 2] + HEAP32[HEAP32[$3 >> 2] + 108 >> 2] | 0 } else { $0_1 = $156((HEAP32[HEAP32[$3 + 12 >> 2] + 56 >> 2] + ($1_1 << 2) | 0) + 36 | 0) } HEAP32[$2_1 >> 2] = $0_1; } function $710($0_1, $1_1) { if (!HEAP32[$1_1 >> 2]) { HEAP32[$1_1 >> 2] = $800(HEAP32[$0_1 + 52 >> 2], $0_1, HEAP32[$0_1 + 4 >> 2]) } } function $711($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0.0, $19_1 = 0.0, $20_1 = 0; $7_1 = global$0 + -64 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $11_1 = HEAP32[$2_1 + 4 >> 2]; block49 : { block11 : { block13 : { block23 : { block5 : { if ($3) { $3 = HEAP8[$1_1 + 1 | 0]; block2 : { if (($3 | 0) >= 0) { $12_1 = 2; $3 = $3 & 255; break block2; } $12_1 = $264($1_1 + 1 | 0, $7_1 + 16 | 0) + 1 & 255; $3 = HEAP32[$7_1 + 16 >> 2]; } $15_1 = HEAPU8[$1_1 | 0]; $11_1 = $11_1 + 40 | 0; $14 = 1; if ($3 >>> 0 >= 128) { $3 = $3 - 12 >>> 1 | 0 } else { $3 = HEAPU8[$3 + 34576 | 0] } $10_1 = $3 + $15_1 | 0; break block5; } $3 = HEAP8[$1_1 | 0]; block7 : { if (($3 | 0) >= 0) { $12_1 = 1; $15_1 = $3 & 255; break block7; } $12_1 = $264($1_1, $7_1 + 60 | 0); $15_1 = HEAP32[$7_1 + 60 >> 2]; } $10_1 = $15_1; } block36 : { if ($0_1 >>> 0 >= $10_1 >>> 0) { $17_1 = $2_1 + 23 | 0; while (1) { block22 : { block29 : { block44 : { block27 : { block12 : { $5_1 = HEAPU16[$11_1 + 16 >> 1]; if ($5_1 & 36) { $3 = HEAPU8[$1_1 + $12_1 | 0]; if ($3 >>> 0 >= 10) { $9_1 = ($3 | 0) == 10 ? -1 : 1; $10_1 = 0; break block11; } if (($3 | 0) == 7) { break block12 } $9_1 = -1; if (!$3) { break block13 } $6_1 = $1_1 + $10_1 | 0; block21 : { block20 : { switch ($3 - 1 | 0) { case 0: $4_1 = HEAP8[$6_1 | 0]; $8_1 = $4_1 >> 31; break block21; case 1: $4_1 = HEAPU8[$6_1 + 1 | 0] | HEAP8[$6_1 | 0] << 8; $8_1 = $4_1 >> 31; break block21; case 2: $4_1 = HEAPU8[$6_1 + 2 | 0] | (HEAPU8[$6_1 + 1 | 0] << 8 | HEAP8[$6_1 | 0] << 16); $8_1 = $4_1 >> 31; break block21; case 3: $4_1 = HEAPU8[$6_1 | 0] | HEAPU8[$6_1 + 1 | 0] << 8 | (HEAPU8[$6_1 + 2 | 0] << 16 | HEAPU8[$6_1 + 3 | 0] << 24); $4_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); $8_1 = $4_1 >> 31; break block21; case 4: $8_1 = HEAPU8[$6_1 + 1 | 0] | HEAP8[$6_1 | 0] << 8; $4_1 = HEAPU8[$6_1 + 3 | 0]; $5_1 = 0; $16_1 = $4_1 << 16; $4_1 = HEAPU8[$6_1 + 2 | 0]; $16_1 = $4_1 << 24 | $16_1; $13_1 = $5_1 | $5_1; $4_1 = HEAPU8[$6_1 + 4 | 0]; $4_1 = HEAPU8[$6_1 + 5 | 0] | ($4_1 << 8 | $16_1); $8_1 = $5_1 | $13_1 | $8_1; break block21; case 5: $4_1 = HEAPU8[$6_1 + 4 | 0] | HEAPU8[$6_1 + 5 | 0] << 8 | (HEAPU8[$6_1 + 6 | 0] << 16 | HEAPU8[$6_1 + 7 | 0] << 24); $5_1 = 0; $8_1 = HEAPU8[$6_1 | 0] | HEAPU8[$6_1 + 1 | 0] << 8 | (HEAPU8[$6_1 + 2 | 0] << 16 | HEAPU8[$6_1 + 3 | 0] << 24); $16_1 = $8_1 << 24 | ($8_1 & 65280) << 8; $6_1 = $8_1 & 16711680; $13_1 = $6_1 >>> 8 | 0; $20_1 = $5_1; $5_1 = $8_1 & -16777216; $4_1 = $20_1 | ($6_1 << 24 | $5_1 << 8) | ((($4_1 & 255) << 24 | $8_1 >>> 8) & -16777216 | (($4_1 & 16777215) << 8 | $8_1 >>> 24) & 16711680 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24)); $8_1 = $16_1 | ($5_1 >>> 24 | $13_1); break block21; default: break block20; }; } $4_1 = $3 - 8 | 0; $8_1 = 0; } $5_1 = HEAP32[$11_1 >> 2]; $13_1 = HEAP32[$11_1 + 4 >> 2]; $6_1 = ($8_1 | 0) < ($13_1 | 0); if ($5_1 >>> 0 > $4_1 >>> 0 & ($13_1 | 0) >= ($8_1 | 0) | $6_1) { break block13 } if ($6_1 | ($8_1 | 0) <= ($13_1 | 0) & $4_1 >>> 0 <= $5_1 >>> 0) { break block22 } break block23; } block28 : { if ($5_1 & 8) { $3 = HEAPU8[$1_1 + $12_1 | 0]; if ($3 >>> 0 >= 10) { $9_1 = ($3 | 0) == 10 ? -1 : 1; $10_1 = 0; break block11; } $9_1 = -1; if (($3 | 0) != 7) { if (!$3) { break block13 } $265($1_1 + $10_1 | 0, $3, $7_1 + 16 | 0); $9_1 = $734(HEAP32[$7_1 + 16 >> 2], HEAP32[$7_1 + 20 >> 2], HEAPF64[$11_1 >> 3]); break block27; } $3 = 1; if ($772($1_1 + $10_1 | 0, $7_1 + 16 | 0)) { break block13 } $18_1 = HEAPF64[$7_1 + 16 >> 3]; $19_1 = HEAPF64[$11_1 >> 3]; if ($18_1 < $19_1) { break block13 } if ($18_1 > $19_1) { break block28 } break block29; } if ($5_1 & 2) { $4_1 = $1_1 + $12_1 | 0; $3 = HEAP8[$4_1 | 0]; block32 : { if (($3 | 0) >= 0) { $4_1 = $3 & 255; break block32; } $264($4_1, $7_1 + 12 | 0); $4_1 = HEAP32[$7_1 + 12 >> 2]; } if ($4_1 >>> 0 < 12) { $9_1 = -1; $3 = $4_1; break block13; } $3 = 1; if (!($4_1 & 1)) { break block23 } $8_1 = $4_1 - 12 >>> 1 | 0; HEAP32[$7_1 + 28 >> 2] = $8_1; block35 : { if ($0_1 >>> 0 >= $8_1 + $10_1 >>> 0) { $13_1 = HEAP32[$2_1 >> 2]; if (HEAPU16[$13_1 + 8 >> 1] > $14 >>> 0) { break block35 } } HEAP8[$17_1 | 0] = $181(89935); break block36; } $5_1 = HEAP32[($13_1 + ($14 << 2) | 0) + 20 >> 2]; if ($5_1) { HEAP8[$7_1 + 34 | 0] = HEAPU8[$13_1 + 4 | 0]; $3 = HEAP32[$13_1 + 12 >> 2]; HEAP16[$7_1 + 32 >> 1] = 2; HEAP32[$7_1 + 36 >> 2] = $3; HEAP32[$7_1 + 24 >> 2] = $1_1 + $10_1; $9_1 = $746($7_1 + 16 | 0, $11_1, $5_1, $17_1); $3 = $4_1; break block27; } $5_1 = HEAP32[$11_1 + 12 >> 2]; $9_1 = $2014($1_1 + $10_1 | 0, HEAP32[$11_1 + 8 >> 2], ($5_1 | 0) > ($8_1 | 0) ? $8_1 : $5_1); if ($9_1) { break block13 } $9_1 = $8_1 - $5_1 | 0; $3 = $4_1; break block27; } $4_1 = $1_1 + $12_1 | 0; $3 = HEAPU8[$4_1 | 0]; if ($5_1 & 16) { $9_1 = -1; if ($3 << 24 >> 24 < 0) { $264($4_1, $7_1 + 12 | 0); $3 = HEAP32[$7_1 + 12 >> 2]; } if ($3 & 1 | $3 >>> 0 < 12) { break block13 } $5_1 = $3 - 12 >>> 1 | 0; if ($0_1 >>> 0 >= $5_1 + $10_1 >>> 0) { if (HEAPU8[$11_1 + 17 | 0] & 4) { if (!$773($1_1 + $10_1 | 0, $5_1)) { break block28 } $9_1 = $5_1 - HEAP32[$11_1 >> 2] | 0; break block27; } $4_1 = HEAP32[$11_1 + 12 >> 2]; $9_1 = $2014($1_1 + $10_1 | 0, HEAP32[$11_1 + 8 >> 2], ($4_1 | 0) > ($5_1 | 0) ? $5_1 : $4_1); if ($9_1) { $3 = 1; break block13; } $9_1 = $5_1 - $4_1 | 0; break block27; } HEAP8[$17_1 | 0] = $181(89965); break block36; } $9_1 = 1; block43 : { switch ($3 - 7 | 0) { case 1: case 2: break block13; case 3: break block22; case 0: break block43; default: break block44; }; } if ($772($1_1 + $10_1 | 0, $7_1 + 16 | 0)) { break block29 } } $3 = 1; break block23; } $772($1_1 + $10_1 | 0, $7_1 + 16 | 0); $9_1 = 0 - $734(HEAP32[$11_1 >> 2], HEAP32[$11_1 + 4 >> 2], HEAPF64[$7_1 + 16 >> 3]) | 0; $3 = 7; } if (!$9_1) { break block22 } break block13; } if ($3) { break block13 } break block22; } $3 = 7; } block45 : { $14 = $14 + 1 | 0; if (($14 | 0) == HEAPU16[$2_1 + 20 >> 1]) { break block45 } if ($3 >>> 0 >= 128) { $4_1 = $3 - 12 >>> 1 | 0 } else { $4_1 = HEAPU8[$3 + 34576 | 0] } $10_1 = $4_1 + $10_1 | 0; if ($10_1 >>> 0 > $0_1 >>> 0) { break block45 } $12_1 = $716($3, 0) + $12_1 | 0; if ($12_1 >>> 0 >= $15_1 >>> 0) { HEAP8[$17_1 | 0] = $181(90016); break block36; } $11_1 = $11_1 + 40 | 0; continue; } break; }; HEAP8[$2_1 + 26 | 0] = 1; $9_1 = HEAP8[$2_1 + 22 | 0]; break block49; } HEAP8[$2_1 + 23 | 0] = $181(89854); } $9_1 = 0; break block49; } $9_1 = 1; } $10_1 = !$3; } $0_1 = HEAPU8[HEAP32[HEAP32[$2_1 >> 2] + 16 >> 2] + $14 | 0]; if (!$0_1) { break block49 } if ($0_1 & 2) { $12_1 = 1; $0_1 = $0_1 & 1; if (($0_1 | 0) == (($10_1 ? $12_1 : HEAP16[$11_1 + 16 >> 1] & 1) | 0)) { break block49 } } $9_1 = 0 - $9_1 | 0; } $0_1 = $7_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1; } function $712($0_1) { if (HEAP32[$0_1 + 24 >> 2]) { $205($0_1) } } function $713($0_1) { if (!HEAPU8[HEAP32[$0_1 + 36 >> 2]]) { return 0 } return $680($0_1); } function $714($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $10_1 = 32; $4_1 = HEAP32[$1_1 >> 2]; block : { if (HEAPU16[$4_1 + 8 >> 1] > 13) { break block } $3 = HEAP32[$1_1 + 4 >> 2]; $5_1 = HEAPU16[$3 + 16 >> 1]; $7_1 = HEAPU8[HEAP32[$4_1 + 16 >> 2]]; block2 : { if (!$7_1) { $8_1 = 1; $7_1 = 255; break block2; } if ($7_1 & 2) { break block } $8_1 = 255; $7_1 = 1; } HEAP8[$1_1 + 25 | 0] = $8_1; HEAP8[$1_1 + 24 | 0] = $7_1; if ($5_1 & 4) { $4_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$1_1 + 8 >> 2] = HEAP32[$3 >> 2]; HEAP32[$1_1 + 12 >> 2] = $4_1; $10_1 = 33; break block; } if (HEAP32[$4_1 + 20 >> 2] | $5_1 & 57) { break block } HEAP32[$1_1 + 8 >> 2] = HEAP32[$3 + 8 >> 2]; HEAP32[$1_1 + 16 >> 2] = HEAP32[$3 + 12 >> 2]; $10_1 = 34; } HEAP8[$1_1 + 23 | 0] = 0; block9 : { block10 : { block8 : { block4 : { if (HEAPU8[$0_1 | 0]) { break block4 } $3 = HEAP32[$0_1 + 116 >> 2]; if (!HEAPU8[$3 + 8 | 0]) { break block4 } $4_1 = 0; $5_1 = HEAP8[$0_1 + 68 | 0]; $5_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $7_1 = $0_1 + 72 | 0; $6_1 = $0_1 + 120 | 0; while (1) { if (($4_1 | 0) != ($5_1 | 0)) { $8_1 = $4_1 << 1; $9_1 = $4_1 << 2; $4_1 = $4_1 + 1 | 0; if (HEAPU16[$7_1 + $8_1 >> 1] >= HEAPU16[HEAP32[$6_1 + $9_1 >> 2] + 24 >> 1]) { continue } break block4; } break; }; block6 : { $7_1 = HEAPU16[$3 + 24 >> 1] - 1 | 0; $3 = HEAPU16[$0_1 + 70 >> 1]; if (($7_1 | 0) != ($3 | 0)) { break block6 } $3 = $758($0_1, $3, $1_1, $10_1); if (($3 | 0) > 0 | HEAPU8[$1_1 + 23 | 0]) { break block6 } HEAP32[$2_1 >> 2] = $3; return 0; } block7 : { if (HEAP8[$0_1 + 68 | 0] <= 0) { break block7 } if (($758($0_1, 0, $1_1, $10_1) | 0) > 0 | HEAPU8[$1_1 + 23 | 0]) { break block7 } HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 243; $4_1 = HEAP32[$0_1 + 116 >> 2]; if (HEAPU8[$4_1 | 0]) { break block8 } return $181(76794); } HEAP8[$1_1 + 23 | 0] = 0; } $5_1 = $737($0_1); if (($5_1 | 0) == 16) { break block9 } if ($5_1) { break block10 } $4_1 = HEAP32[$0_1 + 116 >> 2]; } $13_1 = $0_1 + 120 | 0; $16_1 = $0_1 + 72 | 0; $14 = $0_1 + 32 | 0; $15_1 = $0_1 + 116 | 0; $3 = HEAPU16[$4_1 + 24 >> 1]; block16 : { block27 : { while (1) { $3 = ($3 & 65535) - 1 | 0; $8_1 = $3; $7_1 = 0; block22 : { while (1) { $5_1 = HEAP32[$4_1 + 64 >> 2] + ($3 & -2) | 0; $5_1 = HEAP32[$4_1 + 68 >> 2] + (HEAPU16[$4_1 + 26 >> 1] & (HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0])) | 0; $6_1 = $5_1 + 1 | 0; $9_1 = $3 >> 1; $3 = HEAPU8[$5_1 | 0]; block12 : { if ($3 >>> 0 <= HEAPU8[$4_1 + 11 | 0]) { $3 = FUNCTION_TABLE[$10_1 | 0]($3, $6_1, $1_1) | 0; break block12; } block13 : { $6_1 = HEAP8[$6_1 | 0]; if (($6_1 | 0) < 0) { break block13 } $3 = $6_1 | $3 << 7 & 16256; if ($3 >>> 0 > HEAPU16[$4_1 + 14 >> 1]) { break block13 } $3 = FUNCTION_TABLE[$10_1 | 0]($3, $5_1 + 2 | 0, $1_1) | 0; break block12; } FUNCTION_TABLE[HEAP32[$4_1 + 80 >> 2]]($4_1, $5_1 - HEAPU8[$4_1 + 10 | 0] | 0, $14); block15 : { $3 = HEAP32[$14 >> 2]; $12_1 = $3; if (($3 | 0) >= 2) { $5_1 = HEAP32[$0_1 + 20 >> 2]; if (($3 >>> 0) / HEAPU32[$5_1 + 40 >> 2] >>> 0 <= HEAPU32[$5_1 + 48 >> 2]) { break block15 } } $5_1 = $181(76881); break block16; } $3 = $3 + 18 | 0; $11_1 = $30($3, 0); if (!$11_1) { $5_1 = 7; break block16; } HEAP16[$0_1 + 70 >> 1] = $9_1; $5_1 = $338($0_1, 0, $12_1, $11_1); $3 = $11_1 + $12_1 | 0; $6_1 = $3 + 16 | 0; HEAP8[$6_1 | 0] = 0; HEAP8[$6_1 + 1 | 0] = 0; $6_1 = $3 + 8 | 0; HEAP8[$6_1 | 0] = 0; HEAP8[$6_1 + 1 | 0] = 0; HEAP8[$6_1 + 2 | 0] = 0; HEAP8[$6_1 + 3 | 0] = 0; HEAP8[$6_1 + 4 | 0] = 0; HEAP8[$6_1 + 5 | 0] = 0; HEAP8[$6_1 + 6 | 0] = 0; HEAP8[$6_1 + 7 | 0] = 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 251; if ($5_1) { $24($11_1); break block16; } $3 = $731($12_1, $11_1, $1_1); $24($11_1); } block21 : { block20 : { if (($3 | 0) < 0) { $7_1 = $9_1 + 1 | 0; break block20; } if (!$3) { break block21 } $8_1 = $9_1 - 1 | 0; } if (($7_1 | 0) > ($8_1 | 0)) { break block22 } $3 = $7_1 + $8_1 | 0; continue; } break; }; $5_1 = 0; HEAP32[$2_1 >> 2] = 0; HEAP16[$0_1 + 70 >> 1] = $9_1; if (!HEAPU8[$1_1 + 23 | 0]) { break block16 } $5_1 = $181(76913); break block16; } if (HEAPU8[$4_1 + 8 | 0]) { HEAP16[$0_1 + 70 >> 1] = $9_1; HEAP32[$2_1 >> 2] = $3; $5_1 = 0; break block16; } $3 = HEAP32[$4_1 + 56 >> 2]; if (($7_1 | 0) >= HEAPU16[$4_1 + 24 >> 1]) { $3 = ($3 + HEAPU8[$4_1 + 9 | 0] | 0) + 8 | 0 } else { $5_1 = HEAP32[$4_1 + 64 >> 2] + ($7_1 << 1) | 0; $3 = $3 + (HEAPU16[$4_1 + 26 >> 1] & (HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0])) | 0; } $4_1 = $156($3); HEAP16[$0_1 + 50 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; $3 = HEAP8[$0_1 + 68 | 0]; if (($3 | 0) >= 19) { return $181(76944) } HEAP16[($3 << 1) + $16_1 >> 1] = $7_1; HEAP32[($3 << 2) + $13_1 >> 2] = HEAP32[$0_1 + 116 >> 2]; HEAP8[$0_1 + 68 | 0] = $3 + 1; HEAP16[$0_1 + 70 >> 1] = 0; $5_1 = $759(HEAP32[$0_1 + 20 >> 2], $4_1, $15_1, HEAPU8[$0_1 + 2 | 0]); if ($5_1) { break block27 } $4_1 = HEAP32[$15_1 >> 2]; $3 = HEAPU16[$4_1 + 24 >> 1]; if (!!$3 & HEAPU8[$4_1 + 1 | 0] == HEAPU8[$0_1 + 69 | 0]) { continue } break; }; $625($4_1); $5_1 = $181(76955); } $1_1 = HEAPU8[$0_1 + 68 | 0] - 1 | 0; HEAP8[$0_1 + 68 | 0] = $1_1; HEAP32[$0_1 + 116 >> 2] = HEAP32[($1_1 << 24 >> 24 << 2) + $13_1 >> 2]; } HEAP16[$0_1 + 50 >> 1] = 0; } return $5_1; } HEAP32[$2_1 >> 2] = -1; return 0; } function $715($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $4_1 = global$0 - 32 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $8_1 = HEAP32[$0_1 + 8 >> 2]; $6_1 = HEAP32[$8_1 + 4 >> 2]; block2 : { block5 : { block1 : { $2_1 = HEAPU8[$0_1 | 0]; if ($2_1) { if ($2_1 >>> 0 < 3) { break block1 } $2_1 = $340($0_1); if ($2_1) { break block2 } $2_1 = 0; if (HEAPU8[$0_1 | 0]) { break block2 } } $3 = HEAP32[$0_1 + 116 >> 2]; $2_1 = HEAPU16[$3 + 24 >> 1]; $9_1 = HEAPU16[$0_1 + 70 >> 1]; if ($2_1 >>> 0 <= $9_1 >>> 0) { $2_1 = $181(80565); break block2; } $10_1 = HEAP8[$0_1 + 68 | 0]; $7_1 = HEAP32[$3 + 64 >> 2]; $5_1 = $7_1 + ($9_1 << 1) | 0; $11_1 = HEAPU8[$5_1 | 0]; $5_1 = HEAPU8[$5_1 + 1 | 0]; $12_1 = HEAPU16[$3 + 26 >> 1]; $13_1 = HEAP32[$3 + 56 >> 2]; if (HEAP32[$3 + 20 >> 2] < 0) { if ($765($3)) { break block5 } $7_1 = HEAP32[$3 + 64 >> 2]; $2_1 = HEAPU16[$3 + 24 >> 1]; } $5_1 = ($12_1 & ($5_1 | $11_1 << 8)) + $13_1 | 0; if ($5_1 >>> 0 < ($2_1 & 65535) + $7_1 >>> 0) { $2_1 = $181(80572); break block2; } $7_1 = 0; $11_1 = $1_1 & 2; block7 : { if (!$11_1) { break block7 } block8 : { if (!HEAPU8[$3 + 8 | 0]) { break block8 } $7_1 = 1; if (((HEAP32[$3 + 20 >> 2] + (FUNCTION_TABLE[HEAP32[$3 + 76 >> 2]]($3, $5_1) | 0) | 0) + 2 | 0) > ((HEAP32[$6_1 + 40 >> 2] << 1 >>> 0) / 3 | 0)) { break block8 } if (HEAPU16[$3 + 24 >> 1] != 1) { break block7 } } $2_1 = $629($0_1); HEAP32[$4_1 + 28 >> 2] = $2_1; $7_1 = 0; if ($2_1) { break block2 } } if (!HEAPU8[$3 + 8 | 0]) { $2_1 = $719($0_1); if ($2_1) { break block2 } } if (HEAPU8[$0_1 + 1 | 0] & 32) { $2_1 = $183($6_1, HEAP32[$0_1 + 64 >> 2], $0_1); if ($2_1) { break block2 } } if (!(HEAP32[$0_1 + 112 >> 2] | !HEAPU8[$8_1 + 11 | 0])) { $753($8_1, HEAP32[$0_1 + 64 >> 2], HEAP32[$0_1 + 32 >> 2], HEAP32[$0_1 + 36 >> 2], 0) } $2_1 = $150(HEAP32[$3 + 72 >> 2]); if ($2_1) { break block2 } FUNCTION_TABLE[HEAP32[$3 + 80 >> 2]]($3, $5_1, $4_1); $2_1 = 0; if (HEAP32[$4_1 + 12 >> 2] != HEAPU16[$4_1 + 16 >> 1]) { $2_1 = $766($3, $5_1, $4_1) } HEAP32[$4_1 + 28 >> 2] = $2_1; $767($3, $9_1, HEAPU16[$4_1 + 18 >> 1], $4_1 + 28 | 0); $2_1 = HEAP32[$4_1 + 28 >> 2]; if ($2_1) { break block2 } if (!HEAPU8[$3 + 8 | 0]) { $5_1 = $0_1 + 116 | 0; $1_1 = HEAP32[$5_1 >> 2]; if (HEAP32[$1_1 + 20 >> 2] < 0) { $2_1 = $765($1_1); if ($2_1) { break block2 } } $2_1 = HEAP32[$1_1 + 64 >> 2] + (HEAPU16[$1_1 + 24 >> 1] << 1) | 0; $2_1 = HEAPU16[$1_1 + 26 >> 1] & (HEAPU8[$2_1 - 2 | 0] << 8 | HEAPU8[$2_1 - 1 | 0]); if ($2_1 >>> 0 <= 3) { $2_1 = $181(80663); break block2; } $5_1 = HEAP32[HEAP32[((HEAP8[$0_1 + 68 | 0] - 1 | 0) > ($10_1 | 0) ? (($10_1 << 2) + $0_1 | 0) + 124 | 0 : $5_1) >> 2] + 4 >> 2]; $8_1 = $2_1 + HEAP32[$1_1 + 56 >> 2] | 0; $2_1 = FUNCTION_TABLE[HEAP32[$1_1 + 76 >> 2]]($1_1, $8_1) | 0; $6_1 = HEAP32[$6_1 + 84 >> 2]; $12_1 = $150(HEAP32[$1_1 + 72 >> 2]); HEAP32[$4_1 + 28 >> 2] = $12_1; if (!$12_1) { HEAP32[$4_1 + 28 >> 2] = $771($3, $9_1, $8_1 - 4 | 0, $2_1 + 4 | 0, $6_1, $5_1) } $767($1_1, HEAPU16[$1_1 + 24 >> 1] - 1 | 0, $2_1, $4_1 + 28 | 0); $2_1 = HEAP32[$4_1 + 28 >> 2]; if ($2_1) { break block2 } } if ((Math_imul(HEAP32[HEAP32[$0_1 + 116 >> 2] + 20 >> 2], 3) | 0) > HEAP32[HEAP32[$0_1 + 20 >> 2] + 40 >> 2] << 1) { $2_1 = $770($0_1); if ($2_1) { break block2 } } if (($10_1 | 0) < HEAP8[$0_1 + 68 | 0]) { $630(HEAP32[$0_1 + 116 >> 2]); $2_1 = HEAPU8[$0_1 + 68 | 0] - 1 | 0; HEAP8[$0_1 + 68 | 0] = $2_1; $1_1 = $0_1 + 120 | 0; while (1) { $6_1 = $2_1 << 24 >> 24; if (!(($6_1 | 0) <= ($10_1 | 0))) { HEAP8[$0_1 + 68 | 0] = $2_1 - 1; $625(HEAP32[$1_1 + ($6_1 << 2) >> 2]); $2_1 = HEAPU8[$0_1 + 68 | 0]; continue; } break; }; HEAP32[$0_1 + 116 >> 2] = HEAP32[$1_1 + ($6_1 << 2) >> 2]; $2_1 = $770($0_1); if ($2_1) { break block2 } } if ($7_1) { HEAP8[$0_1 | 0] = 2; $1_1 = HEAPU16[$3 + 24 >> 1]; if ($9_1 >>> 0 >= $1_1 >>> 0) { HEAP32[$0_1 + 4 >> 2] = -1; HEAP16[$0_1 + 70 >> 1] = $1_1 - 1; $2_1 = 0; break block2; } HEAP32[$0_1 + 4 >> 2] = 1; $2_1 = 0; break block2; } $1_1 = $737($0_1); if ($11_1) { $628($0_1); HEAP8[$0_1 | 0] = 3; } $2_1 = ($1_1 | 0) != 16 ? $1_1 : 0; break block2; } $2_1 = $181(80556); break block2; } $2_1 = $181(80569); } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $716($0_1, $1_1) { var $2_1 = 0; $2_1 = 1; while (1) { if (!(!$1_1 & $0_1 >>> 0 < 128)) { $2_1 = $2_1 + 1 | 0; $0_1 = ($1_1 & 127) << 25 | $0_1 >>> 7; $1_1 = $1_1 >>> 7 | 0; continue; } break; }; return $2_1; } function $717($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = global$0 - 48 | 0; $1_1 = $2_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP8[$0_1 + 64 | 0] = 1; block1 : { if (!HEAP32[$0_1 + 120 >> 2]) { $1_1 = $815(HEAP32[HEAP32[$0_1 + 84 >> 2] + 24 >> 2], $0_1 + 120 | 0); if ($1_1) { break block1 } } $4_1 = $0_1 + 40 | 0; $1_1 = $721($0_1 + 72 | 0, $4_1); if ($1_1) { break block1 } $3 = $2_1 + 8 | 0; $816(HEAP32[$0_1 + 120 >> 2], $3, HEAP32[HEAP32[$0_1 + 84 >> 2] + 12 >> 2], HEAP32[$0_1 + 128 >> 2], HEAP32[$0_1 + 132 >> 2]); HEAP32[$0_1 + 80 >> 2] = HEAP32[$0_1 + 80 >> 2] + 1; $817($3, HEAP32[$0_1 + 48 >> 2], HEAP32[$0_1 + 52 >> 2]); $7_1 = $0_1 + 128 | 0; $3 = HEAP32[$0_1 + 40 >> 2]; while (1) { $1_1 = $3; if ($1_1) { $3 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $2_1 + 8 | 0; $6_1 = HEAP32[$1_1 >> 2]; $817($5_1, $6_1, $6_1 >> 31); $818($5_1, $1_1 + 8 | 0, HEAP32[$1_1 >> 2]); if (HEAP32[$0_1 + 44 >> 2]) { continue } $24($1_1); continue; } break; }; HEAP32[$4_1 >> 2] = 0; $1_1 = $819($2_1 + 8 | 0, $7_1); } $0_1 = $2_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $718($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $5_1 = global$0 + -64 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$5_1 + 48 >> 2] = $3; $16_1 = HEAP32[$0_1 + 8 >> 2]; block1 : { block : { if (!(HEAPU8[$0_1 + 1 | 0] & 32)) { break block } $4_1 = $183(HEAP32[$16_1 + 4 >> 2], HEAP32[$0_1 + 64 >> 2], $0_1); HEAP32[$5_1 + 52 >> 2] = $4_1; if ($4_1) { break block1 } if (!$3 | HEAP8[$0_1 + 68 | 0] >= 0) { break block } $4_1 = $181(80138); break block1; } if (HEAPU8[$0_1 | 0] >= 3) { $4_1 = $737($0_1); HEAP32[$5_1 + 52 >> 2] = $4_1; if ($4_1 & -17) { break block1 } } block6 : { $7_1 = HEAP32[$0_1 + 112 >> 2]; if (!$7_1) { if (HEAPU8[$16_1 + 11 | 0]) { $753($16_1, HEAP32[$0_1 + 64 >> 2], HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2], 0) } if (!(!(HEAPU8[$0_1 + 1 | 0] & 2) | (HEAP32[$1_1 + 8 >> 2] != HEAP32[$0_1 + 32 >> 2] | HEAP32[$1_1 + 12 >> 2] != HEAP32[$0_1 + 36 >> 2]))) { if (!HEAPU16[$0_1 + 50 >> 1] | HEAP32[$0_1 + 44 >> 2] != (HEAP32[$1_1 + 32 >> 2] + HEAP32[$1_1 + 28 >> 2] | 0)) { break block6 } $4_1 = $763($0_1, $1_1); break block1; } if ($3) { break block6 } $4_1 = $733($0_1, HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2], $2_1 >>> 3 & 1, $5_1 + 48 | 0); HEAP32[$5_1 + 52 >> 2] = $4_1; if ($4_1) { break block1 } break block6; } if (!($2_1 & 2 | $3)) { $4_1 = HEAPU16[$1_1 + 24 >> 1]; block9 : { if ($4_1) { HEAP32[$5_1 + 8 >> 2] = $7_1; $3 = HEAP32[$1_1 + 20 >> 2]; HEAP8[$5_1 + 34 | 0] = 0; HEAP8[$5_1 + 30 | 0] = 0; HEAP16[$5_1 + 28 >> 1] = $4_1; HEAP32[$5_1 + 12 >> 2] = $3; $4_1 = $714($0_1, $5_1 + 8 | 0, $5_1 + 48 | 0); break block9; } $4_1 = $764($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2], $2_1 >>> 3 & 1, $5_1 + 48 | 0); } HEAP32[$5_1 + 52 >> 2] = $4_1; if ($4_1) { break block1 } $3 = HEAP32[$5_1 + 48 >> 2]; } if ($3) { break block6 } $633($0_1); $3 = HEAP32[$0_1 + 32 >> 2]; if (($3 | 0) != HEAP32[$1_1 + 8 >> 2] | HEAP32[$0_1 + 36 >> 2] != HEAP32[$1_1 + 12 >> 2]) { break block6 } $1_1 = HEAP32[$1_1 >> 2]; HEAP32[$5_1 + 40 >> 2] = 0; HEAP32[$5_1 + 36 >> 2] = $3; HEAP32[$5_1 + 24 >> 2] = $1_1; $4_1 = $763($0_1, $5_1 + 8 | 0); break block1; } $6_1 = HEAP32[$0_1 + 116 >> 2]; if (HEAP32[$6_1 + 20 >> 2] < 0) { if (HEAPU8[$0_1 | 0] >= 2) { $4_1 = $181(80261); break block1; } $4_1 = $765($6_1); HEAP32[$5_1 + 52 >> 2] = $4_1; if ($4_1) { break block1 } } $4_1 = HEAP32[$16_1 + 4 >> 2]; $11_1 = HEAP32[$4_1 + 84 >> 2]; block31 : { block14 : { if ($2_1 >>> 0 >= 128) { HEAP32[$5_1 + 52 >> 2] = 0; $10_1 = HEAP32[$4_1 + 88 >> 2]; if (($10_1 | 0) <= 3) { HEAP8[$11_1 + 3 | 0] = 0; $10_1 = 4; $4_1 = HEAP32[$16_1 + 4 >> 2]; } if (!HEAPU8[$4_1 + 17 | 0] | HEAPU16[$6_1 + 14 >> 1] >= $10_1 >>> 0) { break block14 } FUNCTION_TABLE[HEAP32[$6_1 + 80 >> 2]]($6_1, $11_1, $5_1 + 8 | 0); if (HEAP32[$5_1 + 20 >> 2] == HEAPU16[$5_1 + 24 >> 1]) { break block14 } $639(HEAP32[$16_1 + 4 >> 2], $156(($11_1 + $10_1 | 0) - 4 | 0), 3, HEAP32[$6_1 + 4 >> 2], $5_1 + 52 | 0); $4_1 = HEAP32[$5_1 + 52 >> 2]; if (!$4_1) { break block14 } break block1; } $4_1 = HEAPU8[$6_1 + 10 | 0]; block18 : { if (HEAPU8[$6_1 + 1 | 0]) { $17_1 = HEAP32[$1_1 + 16 >> 2]; $3 = HEAP32[$1_1 + 28 >> 2]; $8_1 = $3 + HEAP32[$1_1 + 32 >> 2] | 0; block17 : { if ($8_1 >>> 0 <= 127) { HEAP8[$4_1 + $11_1 | 0] = $8_1; $7_1 = 1; break block17; } $7_1 = $732($4_1 + $11_1 | 0, $8_1, $8_1 >> 31) & 255; } $4_1 = $7_1 + $4_1 | 0; $4_1 = $732($4_1 + $11_1 | 0, HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2]) + $4_1 | 0; break block18; } $17_1 = HEAP32[$1_1 >> 2]; $3 = HEAP32[$1_1 + 8 >> 2]; block20 : { if ($3 >>> 0 <= 127) { HEAP8[$4_1 + $11_1 | 0] = $3; $8_1 = 1; break block20; } $8_1 = $732($4_1 + $11_1 | 0, $3, $3 >> 31) & 255; } $4_1 = $8_1 + $4_1 | 0; $8_1 = $3; } $13_1 = $4_1 + $11_1 | 0; $14 = HEAPU16[$6_1 + 14 >> 1]; if (($8_1 | 0) <= ($14 | 0)) { $10_1 = $4_1 + $8_1 | 0; if (($10_1 | 0) <= 3) { HEAP8[$8_1 + $13_1 | 0] = 0; $10_1 = 4; } if ($3) { wasm2js_memory_copy($13_1, $17_1, $3) } $4_1 = $8_1 - $3 | 0; if (!$4_1) { break block14 } wasm2js_memory_fill($3 + $13_1 | 0, 0, $4_1); break block14; } $15_1 = HEAP32[$6_1 + 52 >> 2]; $7_1 = HEAP32[$15_1 + 40 >> 2]; $12_1 = HEAPU16[$6_1 + 16 >> 1]; HEAP32[$5_1 + 60 >> 2] = 0; $10_1 = $4_1; $4_1 = $12_1 + (($8_1 - $12_1 >>> 0) % ($7_1 - 4 >>> 0) | 0) | 0; $9_1 = ($4_1 | 0) > ($14 | 0) ? $12_1 : $4_1; $4_1 = $10_1 + $9_1 | 0; $7_1 = $4_1 + $11_1 | 0; $10_1 = $4_1 + 4 | 0; while (1) { $4_1 = ($8_1 | 0) < ($9_1 | 0) ? $8_1 : $9_1; block25 : { if (($3 | 0) >= ($4_1 | 0)) { if (!$4_1) { break block25 } wasm2js_memory_copy($13_1, $17_1, $4_1); break block25; } if (($3 | 0) > 0) { $4_1 = $3; if (!$4_1) { break block25 } wasm2js_memory_copy($13_1, $17_1, $4_1); break block25; } if (!$4_1) { break block25 } wasm2js_memory_fill($13_1, 0, $4_1); } $8_1 = $8_1 - $4_1 | 0; if (($8_1 | 0) > 0) { $3 = $3 - $4_1 | 0; $17_1 = $4_1 + $17_1 | 0; $13_1 = $4_1 + $13_1 | 0; $9_1 = $9_1 - $4_1 | 0; if ($9_1) { continue } HEAP32[$5_1 + 56 >> 2] = 0; $13_1 = HEAP32[$5_1 + 60 >> 2]; $4_1 = $13_1; if (HEAPU8[$15_1 + 17 | 0]) { $12_1 = HEAP32[18884]; while (1) { $14 = $4_1; $4_1 = $4_1 + 1 | 0; if (($4_1 | 0) == ($180($15_1, $4_1) | 0) | ($14 | 0) == (($12_1 >>> 0) / HEAPU32[$15_1 + 36 >> 2] | 0)) { continue } break; }; HEAP32[$5_1 + 60 >> 2] = $4_1; } $4_1 = $624($15_1, $5_1 + 56 | 0, $5_1 + 60 | 0, $4_1, 0); HEAP32[$5_1 + 8 >> 2] = $4_1; block30 : { if (!($4_1 | !HEAPU8[$15_1 + 17 | 0])) { $9_1 = HEAP32[$5_1 + 60 >> 2]; $639($15_1, $9_1, $13_1 ? 4 : 3, $13_1, $5_1 + 8 | 0); $4_1 = HEAP32[$5_1 + 8 >> 2]; if (!$4_1) { break block30 } $625(HEAP32[$5_1 + 56 >> 2]); break block31; } if ($4_1) { break block31 } $9_1 = HEAP32[$5_1 + 60 >> 2]; } $4_1 = $9_1 << 24 | ($9_1 & 65280) << 8 | ($9_1 >>> 8 & 65280 | $9_1 >>> 24); HEAP8[$7_1 | 0] = $4_1; HEAP8[$7_1 + 1 | 0] = $4_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $4_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $4_1 >>> 24; $625($18_1); $18_1 = HEAP32[$5_1 + 56 >> 2]; $7_1 = HEAP32[$18_1 + 56 >> 2]; $4_1 = $7_1; HEAP8[$4_1 | 0] = 0; HEAP8[$4_1 + 1 | 0] = 0; HEAP8[$4_1 + 2 | 0] = 0; HEAP8[$4_1 + 3 | 0] = 0; $9_1 = HEAP32[$15_1 + 40 >> 2] - 4 | 0; $13_1 = HEAP32[$18_1 + 56 >> 2] + 4 | 0; continue; } break; }; $625($18_1); } HEAP16[$0_1 + 50 >> 1] = 0; $3 = HEAPU16[$0_1 + 70 >> 1]; $4_1 = HEAP32[$5_1 + 48 >> 2]; block41 : { if (!$4_1) { if ($3 >>> 0 >= HEAPU16[$6_1 + 24 >> 1]) { $4_1 = $181(80303); break block1; } $4_1 = $150(HEAP32[$6_1 + 72 >> 2]); if ($4_1) { break block1 } $4_1 = HEAP32[$6_1 + 64 >> 2] + ($3 << 1) | 0; $7_1 = HEAP32[$6_1 + 56 >> 2] + (HEAPU16[$6_1 + 26 >> 1] & (HEAPU8[$4_1 | 0] << 8 | HEAPU8[$4_1 + 1 | 0])) | 0; if (!HEAPU8[$6_1 + 8 | 0]) { $4_1 = HEAPU8[$7_1 | 0] | HEAPU8[$7_1 + 1 | 0] << 8 | (HEAPU8[$7_1 + 2 | 0] << 16 | HEAPU8[$7_1 + 3 | 0] << 24); HEAP8[$11_1 | 0] = $4_1; HEAP8[$11_1 + 1 | 0] = $4_1 >>> 8; HEAP8[$11_1 + 2 | 0] = $4_1 >>> 16; HEAP8[$11_1 + 3 | 0] = $4_1 >>> 24; } $4_1 = $5_1 + 8 | 0; FUNCTION_TABLE[HEAP32[$6_1 + 80 >> 2]]($6_1, $7_1, $4_1); $8_1 = 0; if (HEAP32[$5_1 + 20 >> 2] != HEAPU16[$5_1 + 24 >> 1]) { $8_1 = $766($6_1, $7_1, $4_1) } HEAP32[$5_1 + 52 >> 2] = $8_1; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 251; $4_1 = HEAPU16[$5_1 + 26 >> 1]; if (!(!!HEAPU8[HEAP32[$16_1 + 4 >> 2] + 17 | 0] & HEAPU16[$6_1 + 16 >> 1] <= $10_1 >>> 0 | (($4_1 | 0) != ($10_1 | 0) | HEAP32[$5_1 + 20 >> 2] != HEAPU16[$5_1 + 24 >> 1]))) { if ((HEAP32[$6_1 + 56 >> 2] + HEAPU8[$6_1 + 9 | 0] | 0) + 10 >>> 0 > $7_1 >>> 0) { $4_1 = $181(80330); break block1; } if (HEAPU32[$6_1 + 60 >> 2] < $7_1 + $10_1 >>> 0) { $4_1 = $181(80333); break block1; } if ($10_1) { wasm2js_memory_copy($7_1, $11_1, $10_1) } $4_1 = 0; break block1; } $767($6_1, $3, $4_1, $5_1 + 52 | 0); $4_1 = HEAP32[$5_1 + 52 >> 2]; if (!$4_1) { break block41 } break block1; } if (!HEAPU16[$6_1 + 24 >> 1] | ($4_1 | 0) >= 0) { break block41 } $3 = $3 + 1 | 0; HEAP16[$0_1 + 70 >> 1] = $3; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; $3 = $3 & 65535; } block44 : { block46 : { block52 : { $14 = $10_1 + 2 | 0; block43 : { if (($14 | 0) > HEAP32[$6_1 + 20 >> 2]) { $4_1 = HEAPU8[$6_1 + 12 | 0]; HEAP8[$6_1 + 12 | 0] = $4_1 + 1; HEAP32[(($4_1 << 2) + $6_1 | 0) + 36 >> 2] = $11_1; HEAP16[(($4_1 << 1) + $6_1 | 0) + 28 >> 1] = $3; break block43; } $4_1 = $150(HEAP32[$6_1 + 72 >> 2]); if ($4_1) { break block44 } $4_1 = HEAPU8[$6_1 + 9 | 0]; $8_1 = HEAP32[$6_1 + 56 >> 2]; HEAP32[$5_1 + 8 >> 2] = 0; $12_1 = $4_1 + $8_1 | 0; $9_1 = HEAPU8[$12_1 + 5 | 0] << 8 | HEAPU8[$12_1 + 6 | 0]; $7_1 = HEAPU16[$6_1 + 18 >> 1] + (HEAPU16[$6_1 + 24 >> 1] << 1) | 0; block47 : { if ($9_1 >>> 0 < $7_1 >>> 0) { $4_1 = 72625; if ($9_1) { break block46 } $9_1 = 65536; if (HEAP32[HEAP32[$6_1 + 52 >> 2] + 40 >> 2] == 65536) { break block47 } break block46; } $4_1 = 72628; if (HEAP32[HEAP32[$6_1 + 52 >> 2] + 40 >> 2] < ($9_1 | 0)) { break block46 } } block53 : { block49 : { block50 : { if (!HEAPU8[$12_1 + 2 | 0]) { if (!HEAPU8[$12_1 + 1 | 0]) { break block49 } if ($7_1 + 2 >>> 0 <= $9_1 >>> 0) { break block50 } break block49; } if ($7_1 + 2 >>> 0 > $9_1 >>> 0) { break block49 } } $4_1 = $768($6_1, $10_1, $5_1 + 8 | 0); if ($4_1) { $4_1 = $4_1 - $8_1 | 0; if (($7_1 | 0) >= ($4_1 | 0)) { break block52 } break block53; } $4_1 = HEAP32[$5_1 + 8 >> 2]; if ($4_1) { break block44 } } if (($9_1 | 0) < ($7_1 + $14 | 0)) { $4_1 = HEAP32[$6_1 + 20 >> 2] - $14 | 0; $4_1 = $769($6_1, ($4_1 | 0) >= 4 ? 4 : $4_1); if ($4_1) { break block44 } $9_1 = ((HEAPU8[$12_1 + 6 | 0] | HEAPU8[$12_1 + 5 | 0] << 8) - 1 & 65535) + 1 | 0; } $4_1 = $9_1 - $10_1 | 0; $7_1 = $4_1 << 8 | ($4_1 & 65280) >>> 8; HEAP8[$12_1 + 5 | 0] = $7_1; HEAP8[$12_1 + 6 | 0] = $7_1 >>> 8; } $9_1 = $4_1 >>> 8 | 0; HEAP32[$6_1 + 20 >> 2] = HEAP32[$6_1 + 20 >> 2] - ($14 & 65535); if ($10_1) { wasm2js_memory_copy($4_1 + $8_1 | 0, $11_1, $10_1) } $7_1 = HEAP32[$6_1 + 64 >> 2] + ($3 << 1) | 0; $3 = HEAPU16[$6_1 + 24 >> 1] - $3 << 1; if ($3) { wasm2js_memory_copy($7_1 + 2 | 0, $7_1, $3) } HEAP8[$7_1 + 1 | 0] = $4_1; HEAP8[$7_1 | 0] = $9_1; HEAP16[$6_1 + 24 >> 1] = HEAPU16[$6_1 + 24 >> 1] + 1; $3 = $8_1 + HEAPU8[$6_1 + 9 | 0] | 0; $4_1 = HEAPU8[$3 + 4 | 0] + 1 | 0; HEAP8[$3 + 4 | 0] = $4_1; if (($4_1 & 255) != ($4_1 | 0)) { $3 = $8_1 + HEAPU8[$6_1 + 9 | 0] | 0; HEAP8[$3 + 3 | 0] = HEAPU8[$3 + 3 | 0] + 1; } if (!HEAPU8[HEAP32[$6_1 + 52 >> 2] + 17 | 0]) { break block43 } HEAP32[$5_1 + 8 >> 2] = 0; $640($6_1, $6_1, $11_1, $5_1 + 8 | 0); $4_1 = HEAP32[$5_1 + 8 >> 2]; if ($4_1) { break block44 } } $4_1 = 0; break block44; } $4_1 = $181(72645); break block44; } $4_1 = $181($4_1); } if (!HEAPU8[$6_1 + 12 | 0]) { break block1 } HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; $4_1 = $770($0_1); HEAP8[HEAP32[$0_1 + 116 >> 2] + 12 | 0] = 0; HEAP8[$0_1 | 0] = 1; if ($4_1 | !($2_1 & 2)) { break block1 } $628($0_1); $4_1 = 0; block58 : { if (!HEAP32[$0_1 + 112 >> 2]) { break block58 } $3 = $30(HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2]); HEAP32[$0_1 + 16 >> 2] = $3; if (!$3) { $4_1 = 7; break block58; } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!$2_1) { break block58 } wasm2js_memory_copy($3, HEAP32[$1_1 >> 2], $2_1); } HEAP8[$0_1 | 0] = 3; $2_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$0_1 + 56 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$0_1 + 60 >> 2] = $2_1; break block1; } $625($18_1); } $0_1 = $5_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $719($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; HEAP16[$0_1 + 50 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 241; block1 : { block : { if (HEAPU8[$0_1 | 0]) { break block } $1_1 = HEAPU16[$0_1 + 70 >> 1]; if (!$1_1) { break block } if (HEAPU8[HEAP32[$0_1 + 116 >> 2] + 8 | 0]) { break block1 } } $2_1 = HEAPU8[$0_1 | 0]; __inlined_func$762$93 : { block2 : { block0 : { if (!$2_1) { break block0 } if ($2_1 >>> 0 >= 3) { $1_1 = $340($0_1); if ($1_1) { break block2 } $2_1 = HEAPU8[$0_1 | 0]; } $1_1 = 101; block3 : { switch ($2_1 - 1 | 0) { case 0: break block2; case 1: break block3; default: break block0; }; } $1_1 = 0; HEAP8[$0_1 | 0] = 0; if (HEAP32[$0_1 + 4 >> 2] < 0) { break block2 } } $1_1 = HEAP32[$0_1 + 116 >> 2]; block6 : { block5 : { block4 : { $2_1 = HEAP32[18950]; if (!$2_1) { break block4 } if (!(FUNCTION_TABLE[$2_1 | 0](412) | 0)) { break block4 } HEAP8[$1_1 | 0] = 0; break block5; } if (HEAPU8[$1_1 | 0]) { break block6 } } $1_1 = $181(77149); break __inlined_func$762$93; } if (!HEAPU8[$1_1 + 8 | 0]) { $2_1 = HEAP32[$1_1 + 56 >> 2]; $3 = HEAPU16[$1_1 + 26 >> 1]; $1_1 = HEAP32[$1_1 + 64 >> 2] + (HEAPU16[$0_1 + 70 >> 1] << 1) | 0; $1_1 = $739($0_1, $156($2_1 + ($3 & (HEAPU8[$1_1 | 0] << 8 | HEAPU8[$1_1 + 1 | 0])) | 0)); if ($1_1) { break block2 } $1_1 = $801($0_1); break __inlined_func$762$93; } block8 : { while (1) { $1_1 = HEAPU16[$0_1 + 70 >> 1]; if ($1_1) { break block8 } if (HEAPU8[$0_1 + 68 | 0]) { $738($0_1); continue; } break; }; HEAP8[$0_1 | 0] = 1; $1_1 = 101; break __inlined_func$762$93; } HEAP16[$0_1 + 70 >> 1] = $1_1 - 1; $1_1 = 0; $2_1 = HEAP32[$0_1 + 116 >> 2]; if (!HEAPU8[$2_1 + 1 | 0] | HEAPU8[$2_1 + 8 | 0]) { break block2 } $1_1 = $719($0_1); } } return $1_1; } HEAP16[$0_1 + 70 >> 1] = $1_1 - 1; return 0; } function $720($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $8_1 = HEAP32[$0_1 + 4 >> 2]; $7_1 = HEAP32[HEAP32[$0_1 + 8 >> 2] + 4 >> 2]; $2_1 = $821(HEAP32[$0_1 + 12 >> 2] + Math_imul($7_1, 56) | 0); if (!$2_1) { HEAP32[$6_1 + 12 >> 2] = 0; $3 = HEAP32[$0_1 + 12 >> 2]; $4_1 = $3 + Math_imul($7_1 | 1, 56) | 0; $5_1 = Math_imul($7_1 & 65534, 56) + $3 | 0; $2_1 = (HEAP32[$0_1 >> 2] + $7_1 | 0) / 2 | 0; while (1) { if (!(($2_1 | 0) <= 0)) { block5 : { block2 : { if (!HEAP32[$5_1 + 24 >> 2]) { break block2 } block4 : { block3 : { if (!HEAP32[$4_1 + 24 >> 2]) { break block3 } $3 = FUNCTION_TABLE[HEAP32[$8_1 + 40 >> 2]]($8_1, $6_1 + 12 | 0, HEAP32[$5_1 + 32 >> 2], HEAP32[$5_1 + 20 >> 2], HEAP32[$4_1 + 32 >> 2], HEAP32[$4_1 + 20 >> 2]) | 0; if (($3 | 0) < 0) { break block3 } if ($4_1 >>> 0 <= $5_1 >>> 0 | $3) { break block4 } } $4_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$4_1 + ($2_1 << 2) >> 2] = ($5_1 - $3 | 0) / 56; $4_1 = HEAP32[$4_1 + (($2_1 ^ 1) << 2) >> 2]; HEAP32[$6_1 + 12 >> 2] = 0; $4_1 = Math_imul($4_1, 56) + $3 | 0; break block5; } if (!HEAP32[$5_1 + 24 >> 2]) { break block2 } HEAP32[$6_1 + 12 >> 2] = 0; } $5_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$5_1 + ($2_1 << 2) >> 2] = ($4_1 - $3 | 0) / 56; $5_1 = Math_imul(HEAP32[$5_1 + (($2_1 ^ 1) << 2) >> 2], 56) + $3 | 0; } $2_1 = $2_1 >>> 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = !HEAP32[(Math_imul(HEAP32[HEAP32[$0_1 + 8 >> 2] + 4 >> 2], 56) + $3 | 0) + 24 >> 2]; $2_1 = HEAPU8[HEAP32[$8_1 + 16 >> 2] + 23 | 0]; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $721($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = global$0 - 256 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 + 12 >> 2]; block2 : { if (!HEAP32[$0_1 + 16 >> 2]) { $2_1 = $729(HEAP32[$3 + 28 >> 2]); HEAP32[$0_1 + 16 >> 2] = $2_1; if (!$2_1) { $3 = 7; break block2; } $3 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAPU16[HEAP32[$3 + 28 >> 2] + 6 >> 1]; HEAP8[$2_1 + 23 | 0] = 0; HEAP16[$2_1 + 20 >> 1] = $4_1; } $2_1 = HEAP32[$1_1 >> 2]; $4_1 = HEAPU8[$3 + 68 | 0]; HEAP32[$0_1 + 40 >> 2] = ($4_1 | 0) == 1 ? 35 : ($4_1 | 0) == 2 ? 36 : 37; wasm2js_memory_fill($6_1, 0, 256); while (1) { if ($2_1) { $4_1 = HEAP32[$1_1 + 4 >> 2]; block10 : { if ($4_1) { $5_1 = 0; if (($2_1 | 0) == ($4_1 | 0)) { break block10 } $5_1 = $4_1 + HEAP32[$2_1 + 4 >> 2] | 0; break block10; } $5_1 = HEAP32[$2_1 + 4 >> 2]; } $4_1 = $5_1; $3 = 0; HEAP32[$2_1 + 4 >> 2] = 0; while (1) { $7_1 = ($3 << 2) + $6_1 | 0; $5_1 = HEAP32[$7_1 >> 2]; if ($5_1) { $2_1 = $814($0_1, $2_1, $5_1); HEAP32[$7_1 >> 2] = 0; $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$7_1 >> 2] = $2_1; $2_1 = $4_1; continue; } else { $3 = 0; $2_1 = 0; while (1) { if (!(($3 | 0) == 64)) { $4_1 = HEAP32[($3 << 2) + $6_1 >> 2]; block6 : { if (!$4_1) { break block6 } if (!$2_1) { $2_1 = $4_1; break block6; } $2_1 = $814($0_1, $2_1, $4_1); } $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = $2_1; $3 = HEAPU8[HEAP32[$0_1 + 16 >> 2] + 23 | 0]; } break; }; } $0_1 = $6_1 + 256 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $722($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $4_1 = global$0 - 16 | 0; $6_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $6_1; $6_1 = HEAP32[$2_1 >> 2]; $8_1 = HEAP32[$2_1 + 4 >> 2]; $9_1 = $723($1_1); HEAP32[$3 >> 2] = $9_1; $7_1 = $9_1 ? 0 : 7; $12_1 = $0_1 + 48 | 0; while (1) { if (!($7_1 | ($1_1 | 0) <= ($10_1 | 0))) { $5_1 = HEAP32[$9_1 + 12 >> 2] + Math_imul($10_1, 56) | 0; $7_1 = $822($0_1, $5_1, $12_1, $6_1, $8_1); block1 : { if ($7_1) { break block1 } HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 0; $7_1 = $823($5_1, $4_1 + 8 | 0); $6_1 = HEAP32[$4_1 + 12 >> 2] + HEAP32[$5_1 + 4 >> 2] | 0; $11_1 = HEAP32[$5_1 >> 2]; $8_1 = $11_1 + HEAP32[$4_1 + 8 >> 2] | 0; HEAP32[$5_1 + 8 >> 2] = $8_1; HEAP32[$5_1 + 12 >> 2] = $8_1 >>> 0 < $11_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; if ($7_1) { break block1 } $7_1 = $821($5_1); } $10_1 = $10_1 + 1 | 0; $6_1 = HEAP32[$5_1 + 8 >> 2]; $8_1 = HEAP32[$5_1 + 12 >> 2]; continue; } break; }; if ($7_1) { $660($9_1); HEAP32[$3 >> 2] = 0; } HEAP32[$2_1 >> 2] = $6_1; HEAP32[$2_1 + 4 >> 2] = $8_1; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $723($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = 2; while (1) { $2_1 = $1_1; $1_1 = $1_1 << 1; if (($0_1 | 0) > ($2_1 | 0)) { continue } break; }; $0_1 = 0; $1_1 = HEAP32[18950]; block1 : { if ($1_1) { if (FUNCTION_TABLE[$1_1 | 0](100) | 0) { break block1 } } $1_1 = Math_imul($2_1, 60) + 16 | 0; $1_1 = $132($1_1, $1_1 >> 31); if (!$1_1) { break block1 } HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$1_1 >> 2] = $2_1; $0_1 = $1_1 + 16 | 0; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$1_1 + 8 >> 2] = $0_1 + Math_imul($2_1, 56); $0_1 = $1_1; } return $0_1; } function $724($0_1, $1_1, $2_1) { var $3 = 0; block1 : { block : { $3 = HEAP32[18950]; if (!$3) { break block } if (!(FUNCTION_TABLE[$3 | 0](100) | 0)) { break block } HEAP32[$2_1 >> 2] = 0; break block1; } $3 = $2_1; $2_1 = $132(64, 0); HEAP32[$3 >> 2] = $2_1; if (!$2_1) { break block1 } HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $1_1; $3 = $2_1; $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = HEAP32[$1_1 + 8 >> 2] + 9 | 0; $1_1 = HEAP32[$1_1 + 4 >> 2] / 2 | 0; $1_1 = ($1_1 | 0) < ($2_1 | 0) ? $2_1 : $1_1; HEAP32[$3 + 16 >> 2] = $1_1; $2_1 = HEAP32[$0_1 + 76 >> 2] + ($1_1 >> 31) | 0; $3 = HEAP32[$0_1 + 72 >> 2] + $1_1 | 0; $2_1 = $1_1 >>> 0 > $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; HEAP32[$0_1 + 72 >> 2] = $3; HEAP32[$0_1 + 76 >> 2] = $2_1; return 0; } $660($1_1); return 7; } function $725($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $9_1 = global$0 - 16 | 0; $2_1 = $9_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$1_1 + 4 >> 2] = $0_1; $2_1 = HEAP32[$1_1 >> 2]; $11_1 = ($2_1 | 0) > 0 ? $2_1 : 0; block2 : { while (1) { if (($8_1 | 0) != ($11_1 | 0)) { $10_1 = HEAP32[$1_1 + 12 >> 2] + Math_imul($8_1, 56) | 0; $5_1 = HEAP32[$10_1 + 48 >> 2]; if ($5_1) { $2_1 = HEAP32[$5_1 >> 2]; $4_1 = HEAP32[HEAP32[$2_1 + 12 >> 2] + 24 >> 2]; $3 = $725($2_1, HEAP32[$5_1 + 4 >> 2]); if ($3) { break block2 } $6_1 = HEAP32[$5_1 + 16 >> 2]; $12_1 = $6_1 >> 31; $3 = HEAP32[$2_1 + 64 >> 2]; block4 : { if ($3) { $7_1 = HEAP32[$2_1 + 76 >> 2]; $4_1 = HEAP32[$2_1 + 72 >> 2]; break block4; } $7_1 = $4_1; $4_1 = $2_1 - -64 | 0; $3 = $815($7_1, $4_1); HEAP32[$2_1 + 72 >> 2] = 0; HEAP32[$2_1 + 76 >> 2] = 0; if ($3) { break block2 } $3 = HEAP32[$4_1 >> 2]; $7_1 = 0; $4_1 = 0; } HEAP32[$5_1 + 8 >> 2] = $4_1; HEAP32[$5_1 + 12 >> 2] = $7_1; HEAP32[$5_1 + 48 >> 2] = $3; $3 = $7_1 + $12_1 | 0; $4_1 = $4_1 + $6_1 | 0; $3 = $4_1 >>> 0 < $6_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$2_1 + 72 >> 2] = $4_1; HEAP32[$2_1 + 76 >> 2] = $3; $3 = $821($10_1); if ($3) { break block2 } } $8_1 = $8_1 + 1 | 0; continue; } break; }; $2_1 = HEAP32[$1_1 >> 2]; while (1) { if (!(($2_1 | 0) < 2)) { $4_1 = $2_1 - 1 | 0; $7_1 = $2_1; $2_1 = HEAP32[$1_1 >> 2] / 2 | 0; block7 : { if (($7_1 | 0) > ($2_1 | 0)) { $6_1 = $4_1 - $2_1 << 1; $2_1 = $6_1 | 1; break block7; } $2_1 = HEAP32[$1_1 + 8 >> 2] + ($4_1 << 3) | 0; $6_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; } $5_1 = HEAP32[$1_1 + 12 >> 2]; $3 = $5_1 + Math_imul($6_1, 56) | 0; block8 : { if (!HEAP32[$3 + 24 >> 2]) { break block8 } $5_1 = $5_1 + Math_imul($2_1, 56) | 0; if (!HEAP32[$5_1 + 24 >> 2]) { $2_1 = $6_1; break block8; } $8_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$9_1 + 12 >> 2] = 0; $2_1 = (FUNCTION_TABLE[HEAP32[$8_1 + 40 >> 2]]($8_1, $9_1 + 12 | 0, HEAP32[$3 + 32 >> 2], HEAP32[$3 + 20 >> 2], HEAP32[$5_1 + 32 >> 2], HEAP32[$5_1 + 20 >> 2]) | 0) <= 0 ? $6_1 : $2_1; } HEAP32[HEAP32[$1_1 + 8 >> 2] + ($4_1 << 2) >> 2] = $2_1; $2_1 = $4_1; continue; } break; }; $3 = HEAPU8[HEAP32[$0_1 + 16 >> 2] + 23 | 0]; } $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $726($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; if (HEAPU8[$0_1 | 0]) { i64toi32_i32$HIGH_BITS = 0; return 0; } block2 : { $1_1 = HEAP32[$0_1 + 116 >> 2]; if (!HEAPU8[$1_1 + 8 | 0]) { $1_1 = -1; $2_1 = -1; break block2; } $4_1 = $0_1 + 120 | 0; $5_1 = HEAP8[$0_1 + 68 | 0]; $1_1 = HEAPU16[$1_1 + 24 >> 1]; $0_1 = 0; while (1) { $3 = $0_1 & 255; if (($3 | 0) >= ($5_1 | 0)) { break block2 } $0_1 = $0_1 + 1 | 0; $1_1 = __wasm_i64_mul($1_1, $2_1, HEAPU16[HEAP32[($3 << 2) + $4_1 >> 2] + 24 >> 1], 0); $2_1 = i64toi32_i32$HIGH_BITS; continue; }; } i64toi32_i32$HIGH_BITS = $2_1; return $1_1; } function $727($0_1, $1_1) { var $2_1 = 0; if (!(HEAPU8[$0_1 | 0] | !(HEAPU8[$0_1 + 1 | 0] & 8))) { HEAP32[$1_1 >> 2] = 0; return 0; } $2_1 = $737($0_1); __inlined_func$755$94 : { block1 : { if (($2_1 | 0) != 16) { if ($2_1) { break block1 } HEAP32[$1_1 >> 2] = 0; $1_1 = $801($0_1); $2_1 = HEAPU8[$0_1 + 1 | 0]; if (!$1_1) { HEAP8[$0_1 + 1 | 0] = $2_1 | 8; $1_1 = 0; break __inlined_func$755$94; } HEAP8[$0_1 + 1 | 0] = $2_1 & 247; break __inlined_func$755$94; } HEAP32[$1_1 >> 2] = 1; $2_1 = 0; } $1_1 = $2_1; } return $1_1; } function $728($0_1, $1_1) { var $2_1 = 0; block1 : { if (HEAPU8[$0_1 + 64 | 0]) { $0_1 = HEAP32[$0_1 + 20 >> 2]; $2_1 = HEAP32[$0_1 + 12 >> 2] + Math_imul(HEAP32[HEAP32[$0_1 + 8 >> 2] + 4 >> 2], 56) | 0; $0_1 = $2_1 + 20 | 0; $2_1 = HEAP32[$2_1 + 32 >> 2]; break block1; } $0_1 = HEAP32[$0_1 + 40 >> 2]; $2_1 = $0_1 + 8 | 0; } HEAP32[$1_1 >> 2] = HEAP32[$0_1 >> 2]; return $2_1; } function $729($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 + 12 >> 2]; $2_1 = __wasm_i64_mul(HEAPU16[$0_1 + 6 >> 1], 0, 40, 0); $1_1 = i64toi32_i32$HIGH_BITS; $2_1 = $2_1 + 72 | 0; $1_1 = $2_1 >>> 0 < 72 ? $1_1 + 1 | 0 : $1_1; $1_1 = $51($3, $2_1, $1_1); if ($1_1) { HEAP32[$1_1 >> 2] = $0_1; HEAP32[$1_1 + 4 >> 2] = $1_1 + 32; HEAP16[$1_1 + 20 >> 1] = HEAPU16[$0_1 + 6 >> 1] + 1; } return $1_1; } function $730($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $4_1 = global$0 - 16 | 0; $7_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $7_1; HEAP8[$3 + 22 | 0] = 0; $6_1 = HEAP32[$3 + 4 >> 2]; $10_1 = HEAP8[$2_1 | 0]; block1 : { if (($10_1 | 0) >= 0) { $8_1 = 1; break block1; } $8_1 = $264($2_1, $4_1 + 12 | 0); $10_1 = HEAP32[$4_1 + 12 >> 2]; } $7_1 = $10_1; while (1) { if (!($1_1 >>> 0 < $7_1 >>> 0 | $8_1 >>> 0 >= $10_1 >>> 0)) { $9_1 = $2_1 + $8_1 | 0; $5_1 = HEAP8[$9_1 | 0]; block4 : { if (($5_1 | 0) >= 0) { $9_1 = 1; break block4; } $9_1 = $264($9_1, $4_1 + 8 | 0); $5_1 = HEAP32[$4_1 + 8 >> 2]; } HEAP8[$6_1 + 18 | 0] = HEAPU8[$0_1 + 4 | 0]; $12_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = $12_1; HEAP32[$6_1 + 8 >> 2] = 0; $265($2_1 + $7_1 | 0, $5_1, $6_1); $8_1 = $8_1 + $9_1 | 0; $6_1 = $6_1 + 40 | 0; if ($5_1 >>> 0 >= 128) { $5_1 = $5_1 - 12 >>> 1 | 0 } else { $5_1 = HEAPU8[$5_1 + 34576 | 0] } $7_1 = $5_1 + $7_1 | 0; $11_1 = $11_1 + 1 | 0; if (HEAPU16[$3 + 20 >> 1] > ($11_1 & 65535) >>> 0) { continue } } break; }; if (!(!($11_1 & 65535) | $1_1 >>> 0 >= $7_1 >>> 0)) { $112($6_1 - 40 | 0) } HEAP16[$3 + 20 >> 1] = $11_1; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $731($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return $711($0_1, $1_1, $2_1, 0) | 0; } function $732($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; if (!(!$2_1 & $1_1 >>> 0 > 127 | ($2_1 | 0) != 0)) { HEAP8[$0_1 | 0] = $1_1; return 1; } if (!(!$2_1 & $1_1 >>> 0 > 16383 | ($2_1 | 0) != 0)) { HEAP8[$0_1 + 1 | 0] = $1_1 & 127; HEAP8[$0_1 | 0] = $1_1 >>> 7 | 128; return 2; } $5_1 = $0_1; $4_1 = global$0 - 16 | 0; block1 : { if (!(($2_1 | 0) == 16777216 | $2_1 >>> 0 > 16777216)) { $3 = 1; while (1) { $0_1 = $6_1; HEAP8[$0_1 + ($4_1 + 6 | 0) | 0] = $1_1 | 128; $7_1 = $3; $3 = $3 + 1 | 0; $6_1 = $0_1 + 1 | 0; $8_1 = !$2_1 & $1_1 >>> 0 > 127 | ($2_1 | 0) != 0; $1_1 = ($2_1 & 127) << 25 | $1_1 >>> 7; $2_1 = $2_1 >>> 7 | 0; if ($8_1) { continue } break; }; HEAP8[$4_1 + 6 | 0] = HEAPU8[$4_1 + 6 | 0] & 127; $3 = 0; while (1) { if (($3 | 0) == ($7_1 | 0)) { break block1 } HEAP8[$3 + $5_1 | 0] = HEAPU8[($4_1 + 6 | 0) + $0_1 | 0]; $3 = $3 + 1 | 0; $0_1 = $0_1 - 1 | 0; continue; }; } HEAP8[$5_1 + 8 | 0] = $1_1; $1_1 = ($2_1 & 255) << 24 | $1_1 >>> 8; $2_1 = $2_1 >>> 8 | 0; $0_1 = 7; while (1) { if (($0_1 | 0) < 0) { $6_1 = 9 } else { HEAP8[$0_1 + $5_1 | 0] = $1_1 | 128; $0_1 = $0_1 - 1 | 0; $1_1 = ($2_1 & 127) << 25 | $1_1 >>> 7; $2_1 = $2_1 >>> 7 | 0; continue; } break; }; } return $6_1; } function $733($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0; $9_1 = global$0 - 16 | 0; $5_1 = $9_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block2 : { block : { if (HEAPU8[$0_1 | 0]) { break block } $7_1 = HEAPU8[$0_1 + 1 | 0]; if (!($7_1 & 2)) { break block } $6_1 = HEAP32[$0_1 + 32 >> 2]; $5_1 = HEAP32[$0_1 + 36 >> 2]; if (!(($1_1 | 0) != ($6_1 | 0) | ($2_1 | 0) != ($5_1 | 0))) { $5_1 = 0; HEAP32[$4_1 >> 2] = 0; break block2; } if (($2_1 | 0) <= ($5_1 | 0) & $1_1 >>> 0 <= $6_1 >>> 0 | ($2_1 | 0) < ($5_1 | 0)) { break block } if ($7_1 & 8) { HEAP32[$4_1 >> 2] = -1; $5_1 = 0; break block2; } $6_1 = $6_1 + 1 | 0; $5_1 = $6_1 ? $5_1 : $5_1 + 1 | 0; if (($1_1 | 0) != ($6_1 | 0) | ($2_1 | 0) != ($5_1 | 0)) { break block } HEAP32[$4_1 >> 2] = 0; $5_1 = $260($0_1); if (($5_1 | 0) == 101) { break block } if ($5_1) { break block2 } $633($0_1); $5_1 = 0; if (($1_1 | 0) == HEAP32[$0_1 + 32 >> 2] & ($2_1 | 0) == HEAP32[$0_1 + 36 >> 2]) { break block2 } } $5_1 = $737($0_1); if (($5_1 | 0) != 16) { if ($5_1) { break block2 } $15_1 = $3 ^ 1; while (1) { $8_1 = HEAP32[$0_1 + 116 >> 2]; $12_1 = HEAPU16[$8_1 + 24 >> 1]; $10_1 = $12_1 - 1 | 0; $6_1 = $10_1 >> $15_1; $13_1 = HEAP32[$8_1 + 64 >> 2]; $14 = HEAPU16[$8_1 + 26 >> 1]; $16_1 = HEAP32[$8_1 + 68 >> 2]; $7_1 = 0; $17_1 = HEAPU8[$8_1 + 2 | 0]; block14 : { block13 : { block9 : { block11 : { while (1) { $3 = ($6_1 << 1) + $13_1 | 0; $5_1 = ((HEAPU8[$3 | 0] << 8 | HEAPU8[$3 + 1 | 0]) & $14) + $16_1 | 0; block5 : { if (!$17_1) { break block5 } while (1) { $3 = $5_1 + 1 | 0; if (HEAP8[$5_1 | 0] >= 0) { $5_1 = $3; break block5; } $5_1 = $3; if ($5_1 >>> 0 < HEAPU32[$8_1 + 60 >> 2]) { continue } break; }; $5_1 = $181(76598); break block2; } $607($5_1, $9_1 + 8 | 0); block10 : { $11_1 = HEAP32[$9_1 + 12 >> 2]; $5_1 = $11_1; $3 = HEAP32[$9_1 + 8 >> 2]; block8 : { if (!(($2_1 | 0) <= ($5_1 | 0) & $1_1 >>> 0 <= $3 >>> 0 | ($2_1 | 0) < ($5_1 | 0))) { $7_1 = $6_1 + 1 | 0; if (($6_1 | 0) < ($10_1 | 0)) { break block8 } $5_1 = -1; break block9; } if (($2_1 | 0) >= ($11_1 | 0) & $1_1 >>> 0 >= $3 >>> 0 | ($2_1 | 0) > ($11_1 | 0)) { break block10 } if (($6_1 | 0) <= ($7_1 | 0)) { break block11 } $10_1 = $6_1 - 1 | 0; } $6_1 = $7_1 + $10_1 >> 1; continue; } break; }; HEAP16[$0_1 + 70 >> 1] = $6_1; if (!HEAPU8[$8_1 + 8 | 0]) { $7_1 = $6_1; break block13; } $5_1 = 0; HEAP16[$0_1 + 50 >> 1] = 0; HEAP32[$0_1 + 32 >> 2] = $3; HEAP32[$0_1 + 36 >> 2] = $11_1; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] | 2; HEAP32[$4_1 >> 2] = 0; break block2; } $5_1 = 1; } if (!HEAPU8[$8_1 + 8 | 0]) { break block13 } HEAP16[$0_1 + 70 >> 1] = $6_1; HEAP32[$4_1 >> 2] = $5_1; $5_1 = 0; break block14; } $3 = HEAP32[$8_1 + 56 >> 2]; if (($7_1 | 0) >= ($12_1 | 0)) { $3 = ($3 + HEAPU8[$8_1 + 9 | 0] | 0) + 8 | 0 } else { $5_1 = ($7_1 << 1) + $13_1 | 0; $3 = $3 + ((HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0]) & $14) | 0; } $3 = $156($3); HEAP16[$0_1 + 70 >> 1] = $7_1; $5_1 = $739($0_1, $3); if (!$5_1) { continue } } break; }; HEAP16[$0_1 + 50 >> 1] = 0; break block2; } HEAP32[$4_1 >> 2] = -1; $5_1 = 0; } $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $734($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0.0; $4_1 = 1; block : { if ($2_1 != $2_1 | $2_1 < -9223372036854775808.0) { break block } $4_1 = -1; if ($2_1 >= 9223372036854775808.0) { break block } if (Math_abs($2_1) < 9223372036854775808.0) { $5_1 = ~~$2_1 >>> 0; if (Math_abs($2_1) >= 1.0) { $3 = ~~($2_1 > 0.0 ? Math_min(Math_floor($2_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($2_1 - +(~~$2_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $3 = 0 } } else { $3 = -2147483648 } if ($0_1 >>> 0 < $5_1 >>> 0 & ($1_1 | 0) <= ($3 | 0) | ($1_1 | 0) < ($3 | 0)) { break block } $4_1 = 1; if ($0_1 >>> 0 > $5_1 >>> 0 & ($1_1 | 0) >= ($3 | 0) | ($1_1 | 0) > ($3 | 0)) { break block } $6_1 = +($0_1 >>> 0) + +($1_1 | 0) * 4294967296.0; $4_1 = $2_1 > $6_1 ? -1 : $6_1 > $2_1; } return $4_1; } function $735($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; if (HEAPU8[$0_1 + 9 | 0]) { HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2] = HEAP32[$0_1 >> 2] } $5_1 = HEAP32[$0_1 + 4 >> 2]; __inlined_func$752$96 : { if ($1_1 >>> 0 <= 1) { if (!$1_1) { $0_1 = $181(75456); break __inlined_func$752$96; } $1_1 = HEAP32[$5_1 + 48 >> 2] != 0; } HEAP32[$4_1 + 112 >> 2] = $3; HEAP8[$4_1 + 68 | 0] = 255; HEAP32[$4_1 + 64 >> 2] = $1_1; HEAP32[$4_1 + 20 >> 2] = $5_1; HEAP32[$4_1 + 8 >> 2] = $0_1; $3 = 0; HEAP8[$4_1 + 1 | 0] = 0; $6_1 = $5_1 + 8 | 0; $0_1 = $6_1; while (1) { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { if (($1_1 | 0) == HEAP32[$0_1 + 64 >> 2]) { HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] | 32; HEAP8[$4_1 + 1 | 0] = 32; $3 = 32; } $0_1 = $0_1 + 24 | 0; continue; } break; }; HEAP8[$4_1 | 0] = 1; HEAP32[$4_1 + 24 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$6_1 >> 2] = $4_1; block5 : { if ($2_1) { HEAP8[$4_1 + 2 | 0] = 0; HEAP8[$4_1 + 1 | 0] = $3 | 1; if (HEAP32[$5_1 + 84 >> 2]) { break block5 } $0_1 = $515(HEAP32[$5_1 + 36 >> 2]); HEAP32[$5_1 + 84 >> 2] = $0_1; __inlined_func$798$311 : { if (!$0_1) { $0_1 = HEAP32[$5_1 + 8 >> 2]; HEAP32[$5_1 + 8 >> 2] = HEAP32[$0_1 + 24 >> 2]; wasm2js_memory_fill($0_1, 0, 200); $0_1 = 7; break __inlined_func$798$311; } HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; HEAP32[$5_1 + 84 >> 2] = HEAP32[$5_1 + 84 >> 2] + 4; $0_1 = 0; } break __inlined_func$752$96; } HEAP8[$4_1 + 2 | 0] = 2; } $0_1 = 0; } return $0_1; } function $736($0_1, $1_1) { var $2_1 = 0; if ($1_1) { $2_1 = HEAP32[$1_1 + 28 >> 2]; $11($0_1, HEAP32[$2_1 + 20 >> 2]); $358($0_1, HEAP32[$2_1 + 24 >> 2]); $789($0_1, HEAP32[$2_1 + 8 >> 2]); $11($0_1, HEAP32[$1_1 + 12 >> 2]); $13($0_1, $1_1); } } function $737($0_1) { var $1_1 = 0, $2_1 = 0; block4 : { block9 : { block2 : { $2_1 = HEAP8[$0_1 + 68 | 0]; block1 : { if (($2_1 | 0) >= 0) { $1_1 = HEAP32[$0_1 + 116 >> 2]; if (!$2_1) { break block1 } $630($1_1); $2_1 = $0_1 + 120 | 0; while (1) { $1_1 = HEAPU8[$0_1 + 68 | 0] - 1 | 0; HEAP8[$0_1 + 68 | 0] = $1_1; if (!($1_1 & 255)) { break block2 } $630(HEAP32[$2_1 + ($1_1 << 24 >> 24 << 2) >> 2]); continue; }; } $1_1 = HEAP32[$0_1 + 64 >> 2]; if (!$1_1) { break block4 } $2_1 = HEAPU8[$0_1 | 0]; if ($2_1 >>> 0 >= 3) { if (($2_1 | 0) == 4) { return HEAP32[$0_1 + 4 >> 2] } $641($0_1); $1_1 = HEAP32[$0_1 + 64 >> 2]; } $1_1 = $759(HEAP32[$0_1 + 20 >> 2], $1_1, $0_1 + 116 | 0, HEAPU8[$0_1 + 2 | 0]); if ($1_1) { HEAP8[$0_1 | 0] = 1; return $1_1; } HEAP8[$0_1 + 68 | 0] = 0; $1_1 = HEAP32[$0_1 + 116 >> 2]; HEAP8[$0_1 + 69 | 0] = HEAPU8[$1_1 + 1 | 0]; } if (!!HEAPU8[$1_1 | 0] & HEAPU8[$1_1 + 1 | 0] == (!HEAP32[$0_1 + 112 >> 2] | 0)) { break block9 } return $181(76337); } $1_1 = HEAP32[$0_1 + 120 >> 2]; HEAP32[$0_1 + 116 >> 2] = $1_1; } HEAP16[$0_1 + 50 >> 1] = 0; HEAP16[$0_1 + 70 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 241; if (HEAPU16[$1_1 + 24 >> 1]) { HEAP8[$0_1 | 0] = 0; return 0; } if (!HEAPU8[$1_1 + 8 | 0]) { if (HEAP32[$1_1 + 4 >> 2] != 1) { return $181(76349) } $1_1 = $156((HEAP32[$1_1 + 56 >> 2] + HEAPU8[$1_1 + 9 | 0] | 0) + 8 | 0); HEAP8[$0_1 | 0] = 0; return $739($0_1, $1_1); } } HEAP8[$0_1 | 0] = 1; return 16; } function $738($0_1) { var $1_1 = 0, $2_1 = 0; HEAP16[$0_1 + 50 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; $1_1 = HEAP8[$0_1 + 68 | 0]; HEAP16[$0_1 + 70 >> 1] = HEAPU16[(($1_1 << 1) + $0_1 | 0) + 70 >> 1]; $1_1 = $1_1 - 1 | 0; HEAP8[$0_1 + 68 | 0] = $1_1; $2_1 = HEAP32[$0_1 + 116 >> 2]; HEAP32[$0_1 + 116 >> 2] = HEAP32[(($1_1 << 24 >> 24 << 2) + $0_1 | 0) + 120 >> 2]; $630($2_1); } function $739($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP8[$0_1 + 68 | 0]; if (($2_1 | 0) >= 19) { return $181(76188) } HEAP16[$0_1 + 50 >> 1] = 0; HEAP8[$0_1 + 1 | 0] = HEAPU8[$0_1 + 1 | 0] & 249; HEAP16[(($2_1 << 1) + $0_1 | 0) + 72 >> 1] = HEAPU16[$0_1 + 70 >> 1]; $3 = $0_1 + 120 | 0; HEAP32[$3 + ($2_1 << 2) >> 2] = HEAP32[$0_1 + 116 >> 2]; HEAP8[$0_1 + 68 | 0] = $2_1 + 1; HEAP16[$0_1 + 70 >> 1] = 0; $2_1 = $0_1 + 116 | 0; $1_1 = $759(HEAP32[$0_1 + 20 >> 2], $1_1, $2_1, HEAPU8[$0_1 + 2 | 0]); block3 : { if (!$1_1) { $2_1 = HEAP32[$2_1 >> 2]; if (HEAPU16[$2_1 + 24 >> 1]) { $1_1 = 0; if (HEAPU8[$2_1 + 1 | 0] == HEAPU8[$0_1 + 69 | 0]) { break block3 } } $625($2_1); $1_1 = $181(76202); } $2_1 = HEAPU8[$0_1 + 68 | 0] - 1 | 0; HEAP8[$0_1 + 68 | 0] = $2_1; HEAP32[$0_1 + 116 >> 2] = HEAP32[($2_1 << 24 >> 24 << 2) + $3 >> 2]; } return $1_1; } function $741($0_1, $1_1, $2_1) { var $3 = 0; block1 : { if (!(($1_1 | 0) != 0 | ($2_1 | 0) != -2147483648)) { $1_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2]; $3 = 1; if (($2_1 | 0) >= 0) { break block1 } HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1 & 2147483647; return 0; } $3 = $689($0_1, 0 - $1_1 | 0, 0 - ($2_1 + (($1_1 | 0) != 0) | 0) | 0); } return $3; } function $745($0_1) { var $1_1 = 0, $2_1 = 0.0, $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $1_1 = HEAPU16[$0_1 + 16 >> 1]; if (!($1_1 & 45)) { block6 : { block2 : { block1 : { if ($303(HEAP32[$0_1 + 8 >> 2], $0_1, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]) >>> 0 > 1) { break block1 } if (($305(HEAP32[$0_1 + 8 >> 2], $3 + 8 | 0, HEAP32[$0_1 + 12 >> 2], HEAPU8[$0_1 + 18 | 0]) | 0) > 1) { break block1 } $1_1 = HEAP32[$3 + 8 >> 2]; $4_1 = HEAP32[$3 + 12 >> 2]; break block2; } $2_1 = HEAPF64[$0_1 >> 3]; block4 : { if ($2_1 < -9223372036854774784.0) { $1_1 = 0; $4_1 = -2147483648; break block4; } if ($2_1 > 9223372036854774784.0) { $1_1 = -1; $4_1 = 2147483647; break block4; } if (Math_abs($2_1) < 9223372036854775808.0) { $1_1 = ~~$2_1 >>> 0; if (Math_abs($2_1) >= 1.0) { $4_1 = ~~($2_1 > 0.0 ? Math_min(Math_floor($2_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($2_1 - +(~~$2_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $4_1 = 0 } } else { $1_1 = 0; $4_1 = -2147483648; } } if ($304($2_1, $1_1, $4_1)) { break block2 } $1_1 = 8; break block6; } HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $4_1; $1_1 = 4; } $1_1 = $1_1 | HEAPU16[$0_1 + 16 >> 1] & -3520; } HEAP16[$0_1 + 16 >> 1] = $1_1 & 64493; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $746($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 80 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if (HEAPU8[$0_1 + 18 | 0] == HEAPU8[$2_1 + 4 | 0]) { $6_1 = FUNCTION_TABLE[HEAP32[$2_1 + 12 >> 2]](HEAP32[$2_1 + 8 >> 2], HEAP32[$0_1 + 12 >> 2], HEAP32[$0_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2], HEAP32[$1_1 + 8 >> 2]) | 0; break block1; } $5_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$4_1 + 64 >> 2] = 0; HEAP32[$4_1 + 60 >> 2] = $5_1; HEAP16[$4_1 + 56 >> 1] = 1; HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 20 >> 2] = $5_1; HEAP16[$4_1 + 16 >> 1] = 1; $5_1 = $4_1 + 40 | 0; $671($5_1, $0_1, 16384); $671($4_1, $1_1, 16384); $0_1 = $208($5_1, HEAPU8[$2_1 + 4 | 0]); $1_1 = $208($4_1, HEAPU8[$2_1 + 4 | 0]); block4 : { if ($1_1 ? !$0_1 : 1) { if (!$3) { break block4 } HEAP8[$3 | 0] = 7; break block4; } $6_1 = FUNCTION_TABLE[HEAP32[$2_1 + 12 >> 2]](HEAP32[$2_1 + 8 >> 2], HEAP32[$4_1 + 52 >> 2], $0_1, HEAP32[$4_1 + 12 >> 2], $1_1) | 0; } $712($4_1 + 40 | 0); $712($4_1); } $0_1 = $4_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $748($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; HEAP16[$3 + 16 >> 1] = 1; $4_1 = HEAP32[$0_1 + 20 >> 2]; $4_1 = __wasm_i64_mul(HEAP32[$4_1 + 48 >> 2], 0, HEAP32[$4_1 + 36 >> 2], 0); $5_1 = i64toi32_i32$HIGH_BITS; if (!(!$5_1 & $4_1 >>> 0 >= $1_1 + $2_1 >>> 0 | ($5_1 | 0) != 0)) { return $181(84325) } $4_1 = $237($3, $2_1 + 1 | 0); if (!$4_1) { $4_1 = $338($0_1, $1_1, $2_1, HEAP32[$3 + 8 >> 2]); if (!$4_1) { HEAP8[HEAP32[$3 + 8 >> 2] + $2_1 | 0] = 0; HEAP32[$3 + 12 >> 2] = $2_1; HEAP16[$3 + 16 >> 1] = 16; return 0; } $204($3); } return $4_1; } function $749($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $633($0_1); $1_1 = -1; $2_1 = HEAP32[$0_1 + 116 >> 2]; $3 = HEAP32[$2_1 + 4 >> 2] - 1 | 0; $1_1 = ($3 | 0) == -1 ? $1_1 : 0; $1_1 = __wasm_i64_mul($3, $1_1, HEAP32[HEAP32[$0_1 + 20 >> 2] + 36 >> 2], 0); $0_1 = HEAP32[$0_1 + 40 >> 2] - HEAP32[$2_1 + 56 >> 2] | 0; $2_1 = $0_1; $1_1 = $1_1 + $0_1 | 0; $0_1 = i64toi32_i32$HIGH_BITS + ($0_1 >> 31) | 0; i64toi32_i32$HIGH_BITS = $1_1 >>> 0 < $2_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; return $1_1; } function $750($0_1, $1_1) { $0_1 = $0_1 + 9 | 0; $1_1 = $0_1 >>> 0 < 9 ? $1_1 + 1 | 0 : $1_1; $0_1 = $31($0_1, $1_1); if (!$0_1) { return 0 } HEAP32[$0_1 >> 2] = 1; HEAP32[$0_1 + 4 >> 2] = 0; return $0_1 + 8 | 0; } function $753($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; HEAP8[$0_1 + 11 | 0] = 0; $5_1 = HEAP32[$0_1 + 4 >> 2] + 8 | 0; while (1) { $5_1 = HEAP32[$5_1 >> 2]; if ($5_1) { block1 : { if (!(HEAPU8[$5_1 + 1 | 0] & 16)) { break block1 } HEAP8[$0_1 + 11 | 0] = 1; if (!$4_1 & (HEAP32[$5_1 + 32 >> 2] != ($2_1 | 0) | ($3 | 0) != HEAP32[$5_1 + 36 >> 2]) | HEAP32[$5_1 + 64 >> 2] != ($1_1 | 0)) { break block1 } HEAP8[$5_1 | 0] = 1; } $5_1 = $5_1 + 24 | 0; continue; } break; }; } function $754($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 32 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if ($1_1 >>> 0 > HEAPU32[$0_1 + 48 >> 2]) { $5_1 = $181(80917); break block1; } $5_1 = $759($0_1, $1_1, $6_1 + 28 | 0, 0); if ($5_1) { break block1 } $4_1 = HEAP32[$6_1 + 28 >> 2]; block3 : { if (!(HEAPU8[$0_1 + 16 | 0] & 4 | HEAP32[HEAP32[$4_1 + 72 >> 2] + 32 >> 2] == ((($1_1 | 0) == 1 ? 2 : 1) | 0))) { $5_1 = $181(80924); break block3; } $8_1 = HEAPU8[$4_1 + 9 | 0]; $1_1 = 0; while (1) { $5_1 = HEAPU16[$4_1 + 24 >> 1]; if ($1_1 >>> 0 < $5_1 >>> 0) { $5_1 = HEAP32[$4_1 + 64 >> 2] + ($1_1 << 1) | 0; $7_1 = HEAP32[$4_1 + 56 >> 2] + (HEAPU16[$4_1 + 26 >> 1] & (HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0])) | 0; if (!HEAPU8[$4_1 + 8 | 0]) { $5_1 = $754($0_1, $156($7_1), 1, $3); if ($5_1) { break block3 } } FUNCTION_TABLE[HEAP32[$4_1 + 80 >> 2]]($4_1, $7_1, $6_1); if (HEAP32[$6_1 + 12 >> 2] != HEAPU16[$6_1 + 16 >> 1]) { $5_1 = $766($4_1, $7_1, $6_1); if ($5_1) { break block3 } } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$6_1 + 24 >> 2] = 0; block8 : { block9 : { if (!HEAPU8[$4_1 + 8 | 0]) { $5_1 = $754($0_1, $156((HEAP32[$4_1 + 56 >> 2] + $8_1 | 0) + 8 | 0), 1, $3); HEAP32[$6_1 + 24 >> 2] = $5_1; if ($5_1) { break block3 } if (HEAPU8[$4_1 + 1 | 0] | !$3) { break block8 } $5_1 = HEAPU16[$4_1 + 24 >> 1]; break block9; } if (!$3) { break block8 } } $0_1 = HEAP32[$3 + 4 >> 2]; $1_1 = $5_1 + HEAP32[$3 >> 2] | 0; $0_1 = $5_1 >>> 0 > $1_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; HEAP32[$3 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $0_1; } if ($2_1) { $710($4_1, $6_1 + 24 | 0); $5_1 = HEAP32[$6_1 + 24 >> 2]; break block3; } $5_1 = $150(HEAP32[$4_1 + 72 >> 2]); if ($5_1) { break block3 } $615($4_1, HEAPU8[HEAP32[$4_1 + 56 >> 2] + $8_1 | 0] | 8); $5_1 = 0; } $625($4_1); } $0_1 = $6_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $756($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = (HEAPU8[$1_1 | 0] & 63) + $1_1 | 0; block7 : { block1 : { switch (HEAPU8[$1_1 + 1 | 0] - 1 | 0) { case 1: $3 = HEAPU8[$4_1 + 1 | 0] | HEAP8[$4_1 | 0] << 8; $5_1 = $3 >> 31; break block7; case 2: $3 = HEAPU8[$4_1 + 2 | 0] | (HEAPU8[$4_1 + 1 | 0] << 8 | HEAP8[$4_1 | 0] << 16); $5_1 = $3 >> 31; break block7; case 3: $3 = HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8 | (HEAPU8[$4_1 + 2 | 0] << 16 | HEAPU8[$4_1 + 3 | 0] << 24); $3 = $3 << 24 | ($3 & 65280) << 8 | ($3 >>> 8 & 65280 | $3 >>> 24); $5_1 = $3 >> 31; break block7; case 4: $5_1 = HEAPU8[$4_1 + 1 | 0] | HEAP8[$4_1 | 0] << 8; $3 = HEAPU8[$4_1 + 3 | 0]; $8_1 = $3 << 16; $3 = HEAPU8[$4_1 + 2 | 0]; $8_1 = $3 << 24 | $8_1; $6_1 = $7_1 | $6_1; $3 = HEAPU8[$4_1 + 4 | 0]; $3 = HEAPU8[$4_1 + 5 | 0] | ($3 << 8 | $8_1); $5_1 = $7_1 | $6_1 | $5_1; break block7; case 5: $3 = HEAPU8[$4_1 + 4 | 0] | HEAPU8[$4_1 + 5 | 0] << 8 | (HEAPU8[$4_1 + 6 | 0] << 16 | HEAPU8[$4_1 + 7 | 0] << 24); $5_1 = HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8 | (HEAPU8[$4_1 + 2 | 0] << 16 | HEAPU8[$4_1 + 3 | 0] << 24); $8_1 = $5_1 << 24 | ($5_1 & 65280) << 8; $4_1 = $5_1 & 16711680; $6_1 = $4_1 >>> 8 | 0; $9_1 = $7_1; $7_1 = $5_1 & -16777216; $3 = $9_1 | ($4_1 << 24 | $7_1 << 8) | ((($3 & 255) << 24 | $5_1 >>> 8) & -16777216 | (($3 & 16777215) << 8 | $5_1 >>> 24) & 16711680 | ($3 >>> 8 & 65280 | $3 >>> 24)); $5_1 = $8_1 | ($7_1 >>> 24 | $6_1); break block7; case 8: $3 = 1; break block7; default: return $731($0_1, $1_1, $2_1) | 0; case 0: break block1; case 7: break block7; }; } $3 = HEAP8[$4_1 | 0]; $5_1 = $3 >> 31; } $6_1 = HEAP32[$2_1 + 12 >> 2]; $7_1 = HEAP32[$2_1 + 8 >> 2]; if (!(($5_1 | 0) >= ($6_1 | 0) & $3 >>> 0 >= $7_1 >>> 0 | ($5_1 | 0) > ($6_1 | 0))) { return HEAP8[$2_1 + 24 | 0] } if (!(($5_1 | 0) <= ($6_1 | 0) & $3 >>> 0 <= $7_1 >>> 0 | ($5_1 | 0) < ($6_1 | 0))) { return HEAP8[$2_1 + 25 | 0] } if (HEAPU16[$2_1 + 20 >> 1] >= 2) { return $711($0_1, $1_1, $2_1, 1) | 0 } HEAP8[$2_1 + 26 | 0] = 1; return HEAP8[$2_1 + 22 | 0]; } function $757($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $1_1 + 1 | 0; $3 = HEAP8[$1_1 + 1 | 0]; block4 : { block2 : { block1 : { while (1) { if (($3 | 0) <= 11) { if (($3 | 0) >= 0) { break block1 } $264($4_1, $5_1 + 12 | 0); $3 = HEAP32[$5_1 + 12 >> 2]; if (($3 | 0) > 11) { continue } break block1; } break; }; if (!($3 & 1)) { break block2 } $3 = $3 - 12 >>> 1 | 0; $4_1 = HEAPU8[$1_1 | 0]; if (($0_1 | 0) < ($3 + $4_1 | 0)) { HEAP8[$2_1 + 23 | 0] = $181(90179); $3 = 0; break block4; } $6_1 = $1_1 + $4_1 | 0; $4_1 = HEAP32[$2_1 + 16 >> 2]; $6_1 = $2014($6_1, HEAP32[$2_1 + 8 >> 2], ($3 | 0) > ($4_1 | 0) ? $4_1 : $3); if (($6_1 | 0) > 0) { break block2 } if (($6_1 | 0) < 0) { break block1 } if (($3 | 0) == ($4_1 | 0)) { if (HEAPU16[$2_1 + 20 >> 1] >= 2) { $3 = $711($0_1, $1_1, $2_1, 1); break block4; } HEAP8[$2_1 + 26 | 0] = 1; $3 = HEAP8[$2_1 + 22 | 0]; break block4; } if (($3 | 0) > ($4_1 | 0)) { break block2 } } $3 = HEAP8[$2_1 + 24 | 0]; break block4; } $3 = HEAP8[$2_1 + 25 | 0]; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $758($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $0_1 = HEAP32[$0_1 + 116 >> 2]; $1_1 = HEAP32[$0_1 + 64 >> 2] + ($1_1 << 1) | 0; $1_1 = HEAP32[$0_1 + 68 >> 2] + (HEAPU16[$0_1 + 26 >> 1] & (HEAPU8[$1_1 + 1 | 0] | HEAPU8[$1_1 | 0] << 8)) | 0; $4_1 = $1_1 + 1 | 0; $5_1 = HEAPU8[$1_1 | 0]; if ($5_1 >>> 0 <= HEAPU8[$0_1 + 11 | 0]) { return FUNCTION_TABLE[$3 | 0]($5_1, $4_1, $2_1) | 0 } $6_1 = 99; $4_1 = HEAP8[$4_1 | 0]; block1 : { if (($4_1 | 0) < 0) { break block1 } $7_1 = HEAPU16[$0_1 + 14 >> 1]; $0_1 = $4_1 | $5_1 << 7 & 16256; if ($7_1 >>> 0 < $0_1 >>> 0) { break block1 } $6_1 = FUNCTION_TABLE[$3 | 0]($0_1, $1_1 + 2 | 0, $2_1) | 0; } return $6_1; } function $759($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if ($1_1 >>> 0 > HEAPU32[$0_1 + 48 >> 2]) { HEAP32[$2_1 >> 2] = 0; $3 = $181(73163); break block1; } $5_1 = HEAP32[$0_1 >> 2]; $3 = FUNCTION_TABLE[HEAP32[$5_1 + 220 >> 2]]($5_1, $1_1, $4_1 + 12 | 0, $3) | 0; if ($3) { HEAP32[$2_1 >> 2] = 0; break block1; } block3 : { $3 = HEAP32[$4_1 + 12 >> 2]; $5_1 = HEAP32[$3 + 8 >> 2]; if (HEAPU8[$5_1 | 0]) { break block3 } $617($3, $1_1, $0_1); $3 = $514($5_1); if (!$3) { break block3 } $630($5_1); HEAP32[$2_1 >> 2] = 0; break block1; } HEAP32[$2_1 >> 2] = $5_1; $3 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $760($0_1) { var $1_1 = 0, $2_1 = 0; while (1) { block : { if ($1_1) { break block } $2_1 = HEAP32[$0_1 + 116 >> 2]; if (HEAPU8[$2_1 + 8 | 0]) { break block } $1_1 = HEAP32[$2_1 + 64 >> 2] + (HEAPU16[$0_1 + 70 >> 1] << 1) | 0; $1_1 = $739($0_1, $156(HEAP32[$2_1 + 56 >> 2] + (HEAPU16[$2_1 + 26 >> 1] & (HEAPU8[$1_1 | 0] << 8 | HEAPU8[$1_1 + 1 | 0])) | 0)); continue; } break; }; return $1_1; } function $763($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = HEAP32[$0_1 + 116 >> 2]; $5_1 = HEAP32[$0_1 + 40 >> 2]; $3 = HEAPU16[$0_1 + 48 >> 1]; if (!(HEAPU32[$2_1 + 60 >> 2] >= $5_1 + $3 >>> 0 & HEAP32[$2_1 + 56 >> 2] + HEAPU16[$2_1 + 18 >> 1] >>> 0 <= $5_1 >>> 0)) { return $181(80057) } $4_1 = HEAP32[$1_1 + 32 >> 2] + HEAP32[$1_1 + 28 >> 2] | 0; if (($3 | 0) == ($4_1 | 0)) { return $802($2_1, $5_1, $1_1, 0, $4_1) } $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$1_1 + 32 >> 2]; $6_1 = HEAP32[$1_1 + 28 >> 2]; $4_1 = HEAP32[$0_1 + 116 >> 2]; HEAP32[$5_1 + 12 >> 2] = $4_1; $2_1 = $802($4_1, HEAP32[$0_1 + 40 >> 2], $1_1, 0, HEAPU16[$0_1 + 48 >> 1]); block : { if ($2_1) { break block } $6_1 = $3 + $6_1 | 0; $3 = HEAPU16[$0_1 + 48 >> 1]; $7_1 = $156($3 + HEAP32[$0_1 + 40 >> 2] | 0); $8_1 = HEAP32[$4_1 + 52 >> 2]; $4_1 = HEAP32[$8_1 + 40 >> 2] - 4 | 0; while (1) { $2_1 = $189($8_1, $7_1, $5_1 + 12 | 0, 0); if ($2_1) { break block } $0_1 = HEAP32[$5_1 + 12 >> 2]; block3 : { if (!(HEAP32[HEAP32[$0_1 + 72 >> 2] + 32 >> 2] == 1 & !HEAPU8[$0_1 | 0])) { $2_1 = $181(80029); break block3; } block5 : { if ($3 + $4_1 >>> 0 < $6_1 >>> 0) { $2_1 = HEAP32[$0_1 + 56 >> 2]; $7_1 = $156($2_1); break block5; } $4_1 = $6_1 - $3 | 0; $2_1 = HEAP32[$0_1 + 56 >> 2]; } $2_1 = $802($0_1, $2_1 + 4 | 0, $1_1, $3, $4_1); } $99(HEAP32[$0_1 + 72 >> 2]); if ($2_1) { break block } $3 = $3 + $4_1 | 0; if (($6_1 | 0) > ($3 | 0)) { continue } break; }; $2_1 = 0; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $764($0_1, $1_1, $2_1, $3, $4_1, $5_1) { if ($1_1) { $4_1 = HEAP32[$0_1 + 112 >> 2]; $3 = $729($4_1); if (!$3) { return 7 } $730($4_1, $2_1, $1_1, $3); $1_1 = HEAPU16[$3 + 20 >> 1]; block4 : { if (!(!!$1_1 & $1_1 >>> 0 <= HEAPU16[$4_1 + 8 >> 1])) { $1_1 = $181(71658); break block4; } $1_1 = $714($0_1, $3, $5_1); } $13(HEAP32[HEAP32[$0_1 + 112 >> 2] + 12 >> 2], $3); return $1_1; } return $733($0_1, $2_1, $3, $4_1, $5_1); } function $765($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = HEAPU16[$0_1 + 24 >> 1]; $9_1 = HEAPU8[$0_1 + 10 | 0]; $5_1 = HEAP32[$0_1 + 56 >> 2]; $6_1 = HEAPU8[$0_1 + 9 | 0]; $1_1 = $5_1 + $6_1 | 0; $2_1 = (HEAPU8[$1_1 + 5 | 0] << 8 | HEAPU8[$1_1 + 6 | 0]) - 1 & 65535; $3 = ($2_1 + HEAPU8[$1_1 + 7 | 0] | 0) + 1 | 0; $4_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; block1 : { block : { $1_1 = HEAPU8[$1_1 + 2 | 0] | HEAPU8[$1_1 + 1 | 0] << 8; if (!$1_1) { break block } if ($1_1 >>> 0 <= $2_1 >>> 0) { break block1 } $10_1 = $4_1 - 4 | 0; while (1) { if (($1_1 | 0) > ($10_1 | 0)) { return $181(72912) } $2_1 = $1_1; $1_1 = $1_1 + $5_1 | 0; $7_1 = HEAPU8[$1_1 + 2 | 0] << 8 | HEAPU8[$1_1 + 3 | 0]; $2_1 = $2_1 + $7_1 | 0; $3 = $3 + $7_1 | 0; $1_1 = HEAPU8[$1_1 + 1 | 0] | HEAPU8[$1_1 | 0] << 8; if ($1_1 >>> 0 > $2_1 + 3 >>> 0) { continue } break; }; if ($1_1) { return $181(72922) } if ($2_1 >>> 0 <= $4_1 >>> 0) { break block } return $181(72926); } block5 : { if (($3 | 0) <= ($4_1 | 0)) { $1_1 = (($9_1 + $6_1 | 0) + ($8_1 << 1) | 0) + 8 | 0; if (($1_1 | 0) <= ($3 | 0)) { break block5 } } return $181(72938); } HEAP32[$0_1 + 20 >> 2] = $3 - $1_1 & 65535; return 0; } return $181(72907); } function $766($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block1 : { $1_1 = HEAPU16[$2_1 + 18 >> 1] + $1_1 | 0; if ($1_1 >>> 0 > HEAPU32[$0_1 + 60 >> 2]) { $2_1 = $181(77697); break block1; } $1_1 = $156($1_1 - 4 | 0); $4_1 = HEAP32[$0_1 + 52 >> 2]; $0_1 = HEAP32[$4_1 + 40 >> 2] - 4 | 0; $0_1 = (($0_1 + HEAP32[$2_1 + 12 >> 2] | 0) + (HEAPU16[$2_1 + 16 >> 1] ^ -1) >>> 0) / ($0_1 >>> 0) | 0; while (1) { if (!$0_1) { $2_1 = 0; break block1; } HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; if (!($1_1 >>> 0 >= 2 & HEAPU32[$4_1 + 48 >> 2] >= $1_1 >>> 0)) { $2_1 = $181(77714); break block1; } block8 : { block7 : { block6 : { $0_1 = $0_1 - 1 | 0; if ($0_1) { $2_1 = $635($4_1, $1_1, $3 + 8 | 0, $3 + 12 | 0); if ($2_1) { break block1 } $2_1 = HEAP32[$3 + 8 >> 2]; if ($2_1) { break block6 } } $2_1 = $799($4_1, $1_1); HEAP32[$3 + 8 >> 2] = $2_1; if ($2_1) { break block6 } $2_1 = 0; break block7; } if (HEAP32[HEAP32[$2_1 + 72 >> 2] + 32 >> 2] == 1) { break block7 } $2_1 = $181(77734); break block8; } $2_1 = $800($4_1, $2_1, $1_1); } $1_1 = HEAP32[$3 + 8 >> 2]; if ($1_1) { $99(HEAP32[$1_1 + 72 >> 2]) } if ($2_1) { break block1 } $1_1 = HEAP32[$3 + 12 >> 2]; continue; }; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $767($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; if (!HEAP32[$3 >> 2]) { $4_1 = HEAP32[$0_1 + 64 >> 2] + ($1_1 << 1) | 0; $5_1 = HEAPU8[$4_1 | 0] << 8 | HEAPU8[$4_1 + 1 | 0]; if (HEAPU32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] < $5_1 + $2_1 >>> 0) { HEAP32[$3 >> 2] = $181(77990); return; } $6_1 = HEAPU8[$0_1 + 9 | 0]; $7_1 = HEAP32[$0_1 + 56 >> 2]; $2_1 = $804($0_1, $5_1, $2_1 & 65535); if ($2_1) { HEAP32[$3 >> 2] = $2_1; return; } $2_1 = HEAPU16[$0_1 + 24 >> 1] - 1 | 0; HEAP16[$0_1 + 24 >> 1] = $2_1; if (!($2_1 & 65535)) { $1_1 = $6_1 + $7_1 | 0; HEAP8[$1_1 + 7 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] >>> 8; HEAP8[$1_1 + 6 | 0] = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; HEAP32[$0_1 + 20 >> 2] = (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] - (HEAPU8[$0_1 + 9 | 0] + HEAPU8[$0_1 + 10 | 0] | 0) | 0) - 8; return; } $1_1 = ($2_1 & 65535) - $1_1 << 1; if ($1_1) { wasm2js_memory_copy($4_1, $4_1 + 2 | 0, $1_1) } $1_1 = $6_1 + $7_1 | 0; HEAP8[$1_1 + 3 | 0] = HEAPU8[$0_1 + 25 | 0]; HEAP8[$1_1 + 4 | 0] = HEAPU8[$0_1 + 24 | 0]; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + 2; } } function $768($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = HEAP32[$0_1 + 56 >> 2]; $7_1 = HEAPU8[$0_1 + 9 | 0]; $6_1 = $7_1 + 1 | 0; $3 = $5_1 + $6_1 | 0; $3 = HEAPU8[$3 | 0] << 8 | HEAPU8[$3 + 1 | 0]; $8_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; $9_1 = $8_1 - $1_1 | 0; block3 : { block : { while (1) { $0_1 = $3; if (($0_1 | 0) > ($9_1 | 0)) { break block } $3 = $0_1 + $5_1 | 0; $4_1 = (HEAPU8[$3 + 2 | 0] << 8 | HEAPU8[$3 + 3 | 0]) - $1_1 | 0; if (($4_1 | 0) >= 0) { if ($4_1 >>> 0 <= 3) { $0_1 = $5_1 + $7_1 | 0; if (HEAPU8[$0_1 + 7 | 0] > 57) { break block3 } $1_1 = $5_1 + $6_1 | 0; $2_1 = HEAPU8[$3 | 0] | HEAPU8[$3 + 1 | 0] << 8; HEAP8[$1_1 | 0] = $2_1; HEAP8[$1_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$0_1 + 7 | 0] = HEAPU8[$0_1 + 7 | 0] + $4_1; return $3; } $0_1 = $0_1 + $4_1 | 0; if ($9_1 >>> 0 < $0_1 >>> 0) { HEAP32[$2_1 >> 2] = $181(72555); return 0; } $1_1 = $3 + 2 | 0; $2_1 = $4_1 << 8 | ($4_1 & 65280) >>> 8; HEAP8[$1_1 | 0] = $2_1; HEAP8[$1_1 + 1 | 0] = $2_1 >>> 8; return $0_1 + $5_1 | 0; } $6_1 = $0_1; $3 = HEAPU8[$3 + 1 | 0] | HEAPU8[$3 | 0] << 8; if ($0_1 >>> 0 < $3 >>> 0) { continue } break; }; if (!$3) { break block3 } HEAP32[$2_1 >> 2] = $181(72570); return 0; } if (($0_1 | 0) <= ($8_1 - 4 | 0)) { break block3 } HEAP32[$2_1 >> 2] = $181(72577); } return 0; } function $769($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $8_1 = HEAPU16[$0_1 + 18 >> 1]; $11_1 = HEAPU16[$0_1 + 24 >> 1]; $13_1 = $8_1 + ($11_1 << 1) | 0; $5_1 = HEAP32[$0_1 + 52 >> 2]; $3 = HEAP32[$5_1 + 40 >> 2]; block15 : { block1 : { $6_1 = HEAP32[$0_1 + 56 >> 2]; $7_1 = $6_1 + HEAPU8[$0_1 + 9 | 0] | 0; if (($1_1 | 0) < HEAPU8[$7_1 + 7 | 0]) { $9_1 = $3 - 4 | 0; break block1; } $9_1 = $3 - 4 | 0; $10_1 = HEAPU8[$7_1 + 2 | 0] | HEAPU8[$7_1 + 1 | 0] << 8; if (($9_1 | 0) < ($10_1 | 0)) { return $181(72425) } if (!$10_1) { break block1 } $1_1 = $6_1 + $10_1 | 0; $4_1 = HEAPU8[$1_1 | 0] << 8 | HEAPU8[$1_1 + 1 | 0]; if ($9_1 >>> 0 < $4_1 >>> 0) { return $181(72428) } if ($4_1) { $2_1 = $6_1 + $4_1 | 0; if (HEAPU8[$2_1 | 0] | HEAPU8[$2_1 + 1 | 0]) { break block1 } } $2_1 = HEAPU8[$7_1 + 6 | 0] | HEAPU8[$7_1 + 5 | 0] << 8; if ($10_1 >>> 0 <= $2_1 >>> 0) { return $181(72436) } $5_1 = HEAPU8[$1_1 + 3 | 0] | HEAPU8[$1_1 + 2 | 0] << 8; $1_1 = $10_1 + $5_1 | 0; block10 : { if ($4_1) { if ($1_1 >>> 0 > $4_1 >>> 0) { return $181(72439) } $12_1 = $3; $3 = $6_1 + $4_1 | 0; $9_1 = HEAPU8[$3 + 2 | 0] << 8 | HEAPU8[$3 + 3 | 0]; if (($12_1 | 0) < ($4_1 + $9_1 | 0)) { return $181(72441) } $3 = $4_1 - $1_1 | 0; if ($3) { $1_1 = $1_1 + $6_1 | 0; wasm2js_memory_copy($1_1 + $9_1 | 0, $1_1, $3); } $5_1 = $5_1 + $9_1 | 0; break block10; } $9_1 = 0; if (($1_1 | 0) <= ($3 | 0)) { break block10 } return $181(72445); } $3 = $2_1 + $5_1 | 0; $1_1 = $10_1 - $2_1 | 0; if ($1_1) { wasm2js_memory_copy($3 + $6_1 | 0, $2_1 + $6_1 | 0, $1_1) } $14 = $6_1 + $13_1 | 0; $2_1 = $6_1 + $8_1 | 0; while (1) { if (!($2_1 >>> 0 >= $14 >>> 0)) { $1_1 = $5_1; $11_1 = HEAPU8[$2_1 + 1 | 0] | HEAPU8[$2_1 | 0] << 8; block14 : { if ($10_1 >>> 0 <= $11_1 >>> 0) { $1_1 = $9_1; if ($4_1 >>> 0 <= $11_1 >>> 0) { break block14 } } $1_1 = $1_1 + $11_1 | 0; $1_1 = $1_1 << 8 | ($1_1 & 65280) >>> 8; HEAP8[$2_1 | 0] = $1_1; HEAP8[$2_1 + 1 | 0] = $1_1 >>> 8; } $2_1 = $2_1 + 2 | 0; continue; } break; }; $12_1 = HEAPU8[$7_1 + 7 | 0]; break block15; } block16 : { if (!$11_1) { break block16 } $1_1 = HEAPU8[$7_1 + 5 | 0] << 8; $2_1 = HEAPU8[$7_1 + 6 | 0]; $10_1 = HEAP32[HEAP32[$5_1 >> 2] + 224 >> 2]; if ($3) { wasm2js_memory_copy($10_1, $6_1, $3) } $14 = $1_1 | $2_1; $12_1 = $6_1 + $8_1 | 0; $2_1 = 0; $1_1 = $3; while (1) { if (($2_1 | 0) == ($11_1 | 0)) { $3 = $1_1; break block16; } $5_1 = ($2_1 << 1) + $12_1 | 0; $8_1 = HEAPU8[$5_1 | 0] << 8 | HEAPU8[$5_1 + 1 | 0]; if (($9_1 | 0) < ($8_1 | 0)) { return $181(72478) } $15_1 = $10_1 + $8_1 | 0; $4_1 = FUNCTION_TABLE[HEAP32[$0_1 + 76 >> 2]]($0_1, $15_1) | 0; $1_1 = $1_1 - $4_1 | 0; if (!(($1_1 | 0) >= ($14 | 0) & ($4_1 + $8_1 | 0) <= ($3 | 0))) { return $181(72484) } $8_1 = $1_1 << 8 | ($1_1 & 65280) >>> 8; HEAP8[$5_1 | 0] = $8_1; HEAP8[$5_1 + 1 | 0] = $8_1 >>> 8; if ($4_1) { wasm2js_memory_copy($1_1 + $6_1 | 0, $15_1, $4_1) } $2_1 = $2_1 + 1 | 0; continue; }; } HEAP8[$7_1 + 7 | 0] = 0; $12_1 = 0; } $1_1 = $3 - $13_1 | 0; if (($12_1 + $1_1 | 0) != HEAP32[$0_1 + 20 >> 2]) { return $181(72498) } HEAP8[$7_1 + 1 | 0] = 0; HEAP8[$7_1 + 2 | 0] = 0; $0_1 = $3 << 8 | ($3 & 65280) >>> 8; HEAP8[$7_1 + 5 | 0] = $0_1; HEAP8[$7_1 + 6 | 0] = $0_1 >>> 8; if ($1_1) { wasm2js_memory_fill($6_1 + $13_1 | 0, 0, $1_1) } return 0; } function $770($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0; $3 = global$0 - 288 | 0; $2_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $2_1; $41_1 = $0_1 + 72 | 0; $39_1 = $0_1 + 120 | 0; $12_1 = HEAP32[$0_1 + 116 >> 2]; $37_1 = $3 - -64 | 0; $35_1 = $3 + 88 | 0; $42_1 = $3 + 15 | 0; while (1) { block1 : { block : { if (HEAP32[$12_1 + 20 >> 2] >= 0) { break block } if (!$765($12_1)) { break block } $1_1 = 0; break block1; } block13 : { block3 : { if (!HEAPU8[$12_1 + 12 | 0]) { $1_1 = 0; if ((Math_imul(HEAP32[$12_1 + 20 >> 2], 3) | 0) <= HEAP32[HEAP32[$0_1 + 20 >> 2] + 40 >> 2] << 1) { break block1 } $33_1 = HEAPU8[$0_1 + 68 | 0]; if (!$33_1) { break block1 } break block3; } $33_1 = HEAPU8[$0_1 + 68 | 0]; if ($33_1) { break block3 } $1_1 = HEAP32[$0_1 + 20 >> 2] + 8 | 0; block4 : { while (1) { $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block4 } if (!(!(HEAPU8[$2_1 | 0] | ($0_1 | 0) == ($2_1 | 0)) & HEAP32[$2_1 + 116 >> 2] == HEAP32[$0_1 + 116 >> 2])) { $1_1 = $2_1 + 24 | 0; continue; } break; }; $1_1 = $181(79805); break block1; } HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 240 >> 2] = 0; $4_1 = HEAP32[$12_1 + 52 >> 2]; block10 : { $1_1 = $150(HEAP32[$12_1 + 72 >> 2]); block8 : { if ($1_1) { $2_1 = 0; break block8; } HEAP32[$3 + 48 >> 2] = $624($4_1, $3 + 24 | 0, $3 + 240 | 0, HEAP32[$12_1 + 4 >> 2], 0); $2_1 = HEAP32[$3 + 24 >> 2]; $1_1 = $3 + 48 | 0; $805($12_1, $2_1, $1_1); if (HEAPU8[$4_1 + 17 | 0]) { $639($4_1, HEAP32[$3 + 240 >> 2], 5, HEAP32[$12_1 + 4 >> 2], $1_1) } $1_1 = HEAP32[$3 + 48 >> 2]; if (!$1_1) { break block10 } } HEAP32[$0_1 + 124 >> 2] = 0; $625($2_1); break block1; } $1_1 = HEAPU8[$12_1 + 12 | 0] << 1; if ($1_1) { wasm2js_memory_copy($2_1 + 28 | 0, $12_1 + 28 | 0, $1_1) } $1_1 = HEAPU8[$12_1 + 12 | 0] << 2; if ($1_1) { wasm2js_memory_copy($2_1 + 36 | 0, $12_1 + 36 | 0, $1_1) } HEAP8[$2_1 + 12 | 0] = HEAPU8[$12_1 + 12 | 0]; $615($12_1, HEAPU8[HEAP32[$2_1 + 56 >> 2]] & 247); $1_1 = HEAP32[$12_1 + 56 >> 2] + HEAPU8[$12_1 + 9 | 0] | 0; $4_1 = HEAP32[$3 + 240 >> 2]; $4_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$1_1 + 8 | 0] = $4_1; HEAP8[$1_1 + 9 | 0] = $4_1 >>> 8; HEAP8[$1_1 + 10 | 0] = $4_1 >>> 16; HEAP8[$1_1 + 11 | 0] = $4_1 >>> 24; HEAP32[$0_1 + 124 >> 2] = $2_1; HEAP32[$0_1 + 120 >> 2] = $12_1; $1_1 = 0; HEAP16[$0_1 + 70 >> 1] = 0; HEAP16[$0_1 + 72 >> 1] = 0; HEAP8[$0_1 + 68 | 0] = 1; break block13; } if (HEAP32[HEAP32[$12_1 + 72 >> 2] + 32 >> 2] >= 2) { $1_1 = $181(79865); break block1; } $2_1 = ($33_1 << 24 >> 24) - 1 | 0; $17_1 = HEAPU16[($2_1 << 1) + $41_1 >> 1]; $11_1 = HEAP32[($2_1 << 2) + $39_1 >> 2]; $1_1 = $150(HEAP32[$11_1 + 72 >> 2]); block15 : { if ($1_1) { break block15 } if (HEAP32[$11_1 + 20 >> 2] < 0) { $1_1 = $765($11_1); if ($1_1) { break block15 } } block17 : { if (!HEAPU8[$12_1 + 2 | 0] | HEAPU8[$12_1 + 12 | 0] != 1) { break block17 } $2_1 = HEAPU16[$12_1 + 28 >> 1]; if (HEAP32[$11_1 + 4 >> 2] == 1 | ($2_1 | 0) != HEAPU16[$12_1 + 24 >> 1] | ($17_1 | 0) != HEAPU16[$11_1 + 24 >> 1]) { break block17 } if (!$2_1) { $1_1 = $181(78713); break block15; } $2_1 = HEAP32[$12_1 + 52 >> 2]; $1_1 = $624($2_1, $3 + 24 | 0, $3 + 208 | 0, 0, 0); if ($1_1) { break block15 } $1_1 = HEAP32[$12_1 + 36 >> 2]; HEAP32[$3 + 176 >> 2] = $1_1; HEAP16[$3 + 144 >> 1] = FUNCTION_TABLE[HEAP32[$12_1 + 76 >> 2]]($12_1, $1_1); $7_1 = HEAP32[$3 + 24 >> 2]; $615($7_1, 13); HEAP32[$3 + 52 >> 2] = $12_1; HEAP32[$3 + 48 >> 2] = 1; HEAP32[$3 + 60 >> 2] = $3 + 144; HEAP32[$3 + 56 >> 2] = $3 + 176; $1_1 = HEAP32[$12_1 + 60 >> 2]; HEAP32[$3 + 108 >> 2] = 2147483647; HEAP32[$3 + 88 >> 2] = 2; HEAP32[$3 + 64 >> 2] = $1_1; $1_1 = $806($3 + 48 | 0, 0, 1, $7_1); HEAP32[$3 + 240 >> 2] = $1_1; if (!$1_1) { HEAP32[$7_1 + 20 >> 2] = (HEAP32[$2_1 + 40 >> 2] - (HEAPU16[$7_1 + 18 >> 1] + HEAPU16[$3 + 144 >> 1] | 0) | 0) - 2; block20 : { if (!HEAPU8[$2_1 + 17 | 0]) { break block20 } $4_1 = $3 + 240 | 0; $639($2_1, HEAP32[$3 + 208 >> 2], 5, HEAP32[$11_1 + 4 >> 2], $4_1); if (HEAPU16[$3 + 144 >> 1] <= HEAPU16[$7_1 + 16 >> 1]) { break block20 } $640($7_1, $7_1, HEAP32[$3 + 176 >> 2], $4_1); } $2_1 = HEAP32[$12_1 + 64 >> 2] + (HEAPU16[$12_1 + 24 >> 1] << 1) | 0; $5_1 = HEAP32[$12_1 + 56 >> 2] + (HEAPU16[$12_1 + 26 >> 1] & (HEAPU8[$2_1 - 2 | 0] << 8 | HEAPU8[$2_1 - 1 | 0])) | 0; $1_1 = 0; while (1) { block21 : { $4_1 = $1_1 + 1 | 0; $2_1 = $4_1 + $5_1 | 0; HEAP32[$3 + 176 >> 2] = $2_1; $9_1 = $1_1 + $5_1 | 0; if (HEAP8[$9_1 | 0] >= 0) { break block21 } $6_1 = $1_1 >>> 0 < 8; $1_1 = $4_1; if ($6_1) { continue } } break; }; $4_1 = $9_1 + 10 | 0; $6_1 = $42_1; while (1) { block22 : { $1_1 = $2_1 + 1 | 0; HEAP32[$3 + 176 >> 2] = $1_1; $2_1 = HEAP8[$2_1 | 0]; HEAP8[$6_1 | 0] = $2_1; $6_1 = $6_1 + 1 | 0; if (($2_1 | 0) >= 0) { break block22 } $2_1 = $1_1; if ($1_1 >>> 0 < $4_1 >>> 0) { continue } } break; }; $1_1 = HEAP32[$3 + 240 >> 2]; if (!$1_1) { $4_1 = $3 + 11 | 0; $1_1 = $771($11_1, HEAPU16[$11_1 + 24 >> 1], $4_1, $6_1 - $4_1 | 0, 0, HEAP32[$12_1 + 4 >> 2]); } $2_1 = HEAP32[$11_1 + 56 >> 2] + HEAPU8[$11_1 + 9 | 0] | 0; $4_1 = HEAP32[$3 + 208 >> 2]; $4_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$2_1 + 8 | 0] = $4_1; HEAP8[$2_1 + 9 | 0] = $4_1 >>> 8; HEAP8[$2_1 + 10 | 0] = $4_1 >>> 16; HEAP8[$2_1 + 11 | 0] = $4_1 >>> 24; $630($7_1); break block15; } $625($7_1); break block15; } $34_1 = $515(HEAP32[HEAP32[$0_1 + 20 >> 2] + 36 >> 2]); $2_1 = HEAPU8[$0_1 + 3 | 0]; HEAP32[$3 + 284 >> 2] = 0; HEAP8[$3 + 136 | 0] = 0; HEAP32[$3 + 132 >> 2] = 0; wasm2js_memory_fill($3 + 48 | 0, 0, 60); HEAP32[$3 + 108 >> 2] = 2147483647; block26 : { if (!$34_1) { $1_1 = 7; break block26; } $23_1 = $2_1 & 1; $14 = 0; $1_1 = HEAPU16[$11_1 + 24 >> 1]; $4_1 = HEAPU8[$11_1 + 12 | 0]; $25 = $1_1 + $4_1 | 0; if ($25 >>> 0 >= 2) { $14 = 0; block29 : { if (!$17_1) { break block29 } $14 = ($17_1 + $23_1 | 0) - 2 | 0; if (($17_1 | 0) == ($25 | 0)) { break block29 } $14 = $17_1 - 1 | 0; } $25 = 2 - $23_1 | 0; } $2_1 = HEAP32[$11_1 + 56 >> 2]; $9_1 = $1_1; $1_1 = ($14 - $4_1 | 0) + $25 | 0; if (($9_1 | 0) == ($1_1 | 0)) { $15_1 = ($2_1 + HEAPU8[$11_1 + 9 | 0] | 0) + 8 | 0 } else { $1_1 = HEAP32[$11_1 + 64 >> 2] + ($1_1 << 1) | 0; $15_1 = $2_1 + (HEAPU16[$11_1 + 26 >> 1] & (HEAPU8[$1_1 | 0] << 8 | HEAPU8[$1_1 + 1 | 0])) | 0; } $20_1 = HEAP32[$11_1 + 52 >> 2]; $28_1 = $25 + 1 | 0; $2_1 = 0; $13_1 = $156($15_1); $1_1 = $25; $4_1 = 0; block73 : { block35 : { while (1) { block34 : { if (!$2_1) { $2_1 = $1_1 << 2; $7_1 = $2_1 + ($3 + 272 | 0) | 0; $5_1 = $759($20_1, $13_1, $7_1, 0); HEAP32[$3 + 284 >> 2] = $5_1; if (!$5_1) { break block34 } } $13_1 = 0; $2_1 = ($1_1 << 2) + 4 | 0; if (!$2_1) { break block35 } wasm2js_memory_fill($3 + 272 | 0, 0, $2_1); break block35; } block36 : { $7_1 = HEAP32[$7_1 >> 2]; if (HEAP32[$7_1 + 20 >> 2] >= 0) { break block36 } $5_1 = $765($7_1); HEAP32[$3 + 284 >> 2] = $5_1; if (!$5_1) { break block36 } $13_1 = 0; if (!$2_1) { break block35 } wasm2js_memory_fill($3 + 272 | 0, 0, $2_1); break block35; } $4_1 = (HEAPU16[$7_1 + 24 >> 1] + $4_1 | 0) + 4 | 0; if ($1_1) { $2_1 = HEAPU8[$11_1 + 12 | 0]; $1_1 = $1_1 - 1 | 0; $5_1 = $14 + $1_1 | 0; if (!(!$2_1 | ($5_1 | 0) != HEAPU16[$11_1 + 28 >> 1])) { $7_1 = $1_1 << 2; $2_1 = HEAP32[$11_1 + 36 >> 2]; HEAP32[$7_1 + ($3 + 232 | 0) >> 2] = $2_1; $13_1 = $156($2_1); HEAP32[$7_1 + ($3 + 144 | 0) >> 2] = FUNCTION_TABLE[HEAP32[$11_1 + 76 >> 2]]($11_1, $2_1); $2_1 = 0; HEAP8[$11_1 + 12 | 0] = 0; continue; } $7_1 = $1_1 << 2; $9_1 = $7_1 + ($3 + 232 | 0) | 0; $2_1 = HEAP32[$11_1 + 64 >> 2] + ($5_1 - $2_1 << 1) | 0; $2_1 = HEAP32[$11_1 + 56 >> 2] + (HEAPU16[$11_1 + 26 >> 1] & (HEAPU8[$2_1 | 0] << 8 | HEAPU8[$2_1 + 1 | 0])) | 0; HEAP32[$9_1 >> 2] = $2_1; $13_1 = $156($2_1); $6_1 = $7_1 + ($3 + 144 | 0) | 0; $7_1 = FUNCTION_TABLE[HEAP32[$11_1 + 76 >> 2]]($11_1, $2_1) | 0; HEAP32[$6_1 >> 2] = $7_1; block39 : { if (!(HEAPU8[$20_1 + 24 | 0] & 12)) { break block39 } $6_1 = $2_1 - HEAP32[$11_1 + 56 >> 2] | 0; if (HEAP32[$20_1 + 40 >> 2] < ($6_1 + $7_1 | 0)) { break block39 } if ($7_1) { wasm2js_memory_copy($6_1 + $34_1 | 0, $2_1, $7_1) } HEAP32[$9_1 >> 2] = ($2_1 - HEAP32[$11_1 + 56 >> 2] | 0) + $34_1; } $767($11_1, $5_1 - HEAPU8[$11_1 + 12 | 0] | 0, $7_1, $3 + 284 | 0); $2_1 = HEAP32[$3 + 284 >> 2]; continue; } break; }; HEAP32[$3 + 140 >> 2] = $13_1; $2_1 = $4_1 + 3 & 2147483644; $1_1 = HEAP32[$20_1 + 36 >> 2] + Math_imul($2_1, 6) | 0; $13_1 = $30($1_1, $1_1 >> 31); HEAP32[$3 + 56 >> 2] = $13_1; if (!$13_1) { HEAP32[$3 + 284 >> 2] = 7; $13_1 = 0; break block35; } $19_1 = HEAP32[$3 + 272 >> 2]; HEAP32[$3 + 52 >> 2] = $19_1; $26_1 = ($2_1 << 2) + $13_1 | 0; HEAP32[$3 + 60 >> 2] = $26_1; $8_1 = $26_1 + ($2_1 << 1) | 0; $38_1 = HEAPU8[$19_1 + 8 | 0]; $31_1 = $38_1 << 2; $24_1 = HEAPU8[$19_1 + 2 | 0]; $2_1 = 0; $10_1 = 0; $5_1 = 0; while (1) { block45 : { if (($5_1 | 0) != ($28_1 | 0)) { $9_1 = $5_1 << 2; $4_1 = HEAP32[$9_1 + ($3 + 272 | 0) >> 2]; $7_1 = HEAP32[$4_1 + 56 >> 2]; if (HEAPU8[$7_1 | 0] != HEAPU8[HEAP32[$19_1 + 56 >> 2]]) { HEAP32[$3 + 284 >> 2] = $181(79137); break block35; } $1_1 = HEAPU16[$4_1 + 18 >> 1]; $16_1 = HEAPU16[$4_1 + 26 >> 1]; $6_1 = HEAPU16[$4_1 + 24 >> 1]; $27 = $6_1 + HEAPU8[$4_1 + 12 | 0] << 1; if ($27) { wasm2js_memory_fill($26_1 + ($2_1 << 1) | 0, 0, $27) } $1_1 = $1_1 + $7_1 | 0; $27 = HEAPU8[$4_1 + 12 | 0]; if (!$27) { break block45 } $18_1 = HEAPU16[$4_1 + 28 >> 1]; if ($6_1 >>> 0 >= $18_1 >>> 0) { $6_1 = 0; while (1) if (($6_1 | 0) == ($18_1 | 0)) { $18_1 = $4_1 + 36 | 0; $6_1 = 0; while (1) { if (!(($6_1 | 0) == ($27 | 0))) { HEAP32[($2_1 << 2) + $13_1 >> 2] = HEAP32[$18_1 + ($6_1 << 2) >> 2]; $6_1 = $6_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$3 + 48 >> 2] = $2_1; break block45; } else { HEAP32[($2_1 << 2) + $13_1 >> 2] = $7_1 + ($16_1 & (HEAPU8[$1_1 + 1 | 0] | HEAPU8[$1_1 | 0] << 8)); $6_1 = $6_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; $1_1 = $1_1 + 2 | 0; continue; }; } HEAP32[$3 + 284 >> 2] = $181(79161); break block35; } $27 = ($31_1 + HEAP32[$20_1 + 40 >> 2] | 0) - 12 | 0; $1_1 = 0; $10_1 = 0; while (1) { block50 : { if (($10_1 | 0) == ($28_1 | 0)) { $9_1 = 0; $16_1 = HEAP32[$3 + 48 >> 2]; $7_1 = $28_1; break block50; } $7_1 = $1_1 << 2; $4_1 = $10_1 << 2; $2_1 = HEAP32[$4_1 + ($3 + 272 | 0) >> 2]; HEAP32[$7_1 + $37_1 >> 2] = HEAP32[$2_1 + 60 >> 2]; $9_1 = $7_1 + $35_1 | 0; $7_1 = HEAP32[$4_1 + ($3 + 176 | 0) >> 2]; HEAP32[$9_1 >> 2] = $7_1; if ($1_1) { $5_1 = $1_1 - 1 | 0; $16_1 = ($7_1 | 0) == HEAP32[($5_1 << 2) + $35_1 >> 2] ? $5_1 : $1_1; } else { $16_1 = 0 } if (!$24_1) { $16_1 = $16_1 + 1 | 0; $1_1 = $16_1 << 2; HEAP32[$1_1 + $37_1 >> 2] = HEAP32[$11_1 + 60 >> 2]; HEAP32[$1_1 + $35_1 >> 2] = $7_1 + 1; } $5_1 = $4_1 + ($3 + 144 | 0) | 0; $6_1 = $27 - HEAP32[$2_1 + 20 >> 2] | 0; HEAP32[$5_1 >> 2] = $6_1; $9_1 = $2_1 + 36 | 0; $1_1 = 0; while (1) { if (!(HEAPU8[$2_1 + 12 | 0] <= $1_1 >>> 0)) { $6_1 = ((FUNCTION_TABLE[HEAP32[$2_1 + 76 >> 2]]($2_1, HEAP32[$9_1 + ($1_1 << 2) >> 2]) | 0) + $6_1 | 0) + 2 | 0; HEAP32[$5_1 >> 2] = $6_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$4_1 + ($3 + 208 | 0) >> 2] = $7_1; $1_1 = $16_1 + 1 | 0; $10_1 = $10_1 + 1 | 0; continue; } break; }; while (1) { block57 : { if (($7_1 | 0) > ($9_1 | 0)) { $4_1 = $9_1 + 2 | 0; $1_1 = $3 + 208 | 0; $21_1 = $9_1 << 2; $5_1 = $1_1 + $21_1 | 0; $6_1 = $1_1; $2_1 = $9_1 + 1 | 0; $1_1 = $2_1 << 2; $32_1 = $6_1 + $1_1 | 0; $8_1 = $3 + 144 | 0; $10_1 = $1_1 + $8_1 | 0; $18_1 = $8_1 + $21_1 | 0; $1_1 = HEAP32[$18_1 >> 2]; while (1) { block58 : { if (($1_1 | 0) <= ($27 | 0)) { HEAP32[$18_1 >> 2] = $1_1; $6_1 = HEAP32[$5_1 >> 2]; $4_1 = ($6_1 | 0) > ($16_1 | 0) ? $6_1 : $16_1; while (1) { if (($4_1 | 0) == ($6_1 | 0)) { break block57 } $22_1 = $3 + 48 | 0; $8_1 = $807($22_1, $6_1) + 2 | 0; $1_1 = $8_1 + $1_1 | 0; if (($27 | 0) < ($1_1 | 0)) { break block58 } HEAP32[$18_1 >> 2] = $1_1; $6_1 = $6_1 + 1 | 0; block59 : { if ($24_1) { break block59 } $8_1 = 0; if (($6_1 | 0) >= ($16_1 | 0)) { break block59 } $8_1 = $807($22_1, $6_1) + 2 | 0; } HEAP32[$10_1 >> 2] = HEAP32[$10_1 >> 2] - $8_1; continue; }; } if (($2_1 | 0) >= ($7_1 | 0)) { if ($9_1 >>> 0 >= 4) { HEAP32[$18_1 >> 2] = $1_1; HEAP32[$3 + 284 >> 2] = $181(79262); break block35; } HEAP32[$10_1 >> 2] = 0; HEAP32[$32_1 >> 2] = $16_1; $7_1 = $4_1; } $6_1 = $3 + 48 | 0; $8_1 = HEAP32[$5_1 >> 2]; $29_1 = $8_1 - 1 | 0; $30_1 = $807($6_1, $29_1) + 2 | 0; $22_1 = $30_1; block62 : { if ($24_1) { break block62 } $22_1 = 0; if (($8_1 | 0) >= ($16_1 | 0)) { break block62 } $22_1 = $807($6_1, $8_1) + 2 | 0; } $6_1 = $22_1; $1_1 = $1_1 - $30_1 | 0; HEAP32[$10_1 >> 2] = HEAP32[$10_1 >> 2] + $6_1; HEAP32[$5_1 >> 2] = $29_1; continue; } break; }; HEAP32[$5_1 >> 2] = $6_1; if ($9_1) { $1_1 = HEAP32[($21_1 + $3 | 0) + 204 >> 2] } else { $1_1 = 0 } $9_1 = $2_1; if (($1_1 | 0) < ($6_1 | 0)) { continue } HEAP32[$3 + 284 >> 2] = $181(79295); break block35; } $21_1 = $7_1 - 1 | 0; $5_1 = $21_1; while (1) { block69 : { block68 : { if (($5_1 | 0) > 0) { $32_1 = $5_1 << 2; $1_1 = $3 + 144 | 0; $29_1 = $32_1 + $1_1 | 0; $4_1 = HEAP32[$29_1 >> 2]; $10_1 = $5_1 - 1 | 0; $2_1 = $10_1 << 2; $30_1 = $2_1 + $1_1 | 0; $8_1 = HEAP32[$30_1 >> 2]; $40_1 = $2_1 + ($3 + 208 | 0) | 0; $1_1 = HEAP32[$40_1 >> 2]; $6_1 = $1_1 - $24_1 | 0; $807($3 + 48 | 0, $6_1); $22_1 = ($5_1 | 0) != ($21_1 | 0) ? -2 : 0; while (1) { $2_1 = $1_1 - 1 | 0; $18_1 = $807($3 + 48 | 0, $2_1); $9_1 = HEAPU16[$26_1 + ($6_1 << 1) >> 1]; block67 : { if (!$4_1) { $9_1 = $9_1 + 2 | 0; break block67; } if ($23_1) { break block68 } $9_1 = ($4_1 + $9_1 | 0) + 2 | 0; if (($9_1 | 0) > (($8_1 + $22_1 | 0) - $18_1 | 0)) { break block68 } } HEAP32[$40_1 >> 2] = $2_1; $6_1 = $6_1 - 1 | 0; $8_1 = ($8_1 - $18_1 | 0) - 2 | 0; $18_1 = ($1_1 | 0) > 1; $4_1 = $9_1; $1_1 = $2_1; if ($18_1) { continue } break; }; break block69; } $1_1 = 0; $6_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $10_1 = $17_1 - $14 | 0; $9_1 = HEAPU8[HEAP32[$19_1 + 56 >> 2]]; $2_1 = 0; while (1) { if (($2_1 | 0) != ($6_1 | 0)) { block72 : { if ($2_1 >>> 0 <= $25 >>> 0) { $5_1 = $2_1 << 2; $8_1 = $5_1 + ($3 + 272 | 0) | 0; $4_1 = HEAP32[$8_1 >> 2]; HEAP32[$5_1 + ($3 + 240 | 0) >> 2] = $4_1; HEAP32[$8_1 >> 2] = 0; $5_1 = $150(HEAP32[$4_1 + 72 >> 2]); HEAP32[$3 + 284 >> 2] = $5_1; $8_1 = ($2_1 | 0) == ($10_1 | 0); $2_1 = $2_1 + 1 | 0; if ($5_1 | HEAP32[HEAP32[$4_1 + 72 >> 2] + 32 >> 2] == (($8_1 ? 2 : 1) | 0)) { break block72 } HEAP32[$3 + 284 >> 2] = $181(79372); break block73; } $4_1 = $624($20_1, $3 + 24 | 0, $3 + 140 | 0, $23_1 ? 1 : HEAP32[$3 + 140 >> 2], 0); HEAP32[$3 + 284 >> 2] = $4_1; if ($4_1) { break block73 } $4_1 = HEAP32[$3 + 24 >> 2]; $615($4_1, $9_1); $5_1 = $2_1 << 2; HEAP32[$5_1 + ($3 + 176 | 0) >> 2] = $16_1; HEAP32[$5_1 + ($3 + 240 | 0) >> 2] = $4_1; $2_1 = $2_1 + 1 | 0; if (!HEAPU8[$20_1 + 17 | 0]) { continue } $639($20_1, HEAP32[$4_1 + 4 >> 2], 5, HEAP32[$11_1 + 4 >> 2], $3 + 284 | 0); if (!HEAP32[$3 + 284 >> 2]) { continue } break block73; } if (!$5_1) { continue } break block73; } break; }; while (1) { if (!(($1_1 | 0) == ($6_1 | 0))) { $2_1 = $1_1 << 2; HEAP32[$2_1 + ($3 + 112 | 0) >> 2] = HEAP32[HEAP32[$2_1 + ($3 + 240 | 0) >> 2] + 4 >> 2]; $1_1 = $1_1 + 1 | 0; continue; } break; }; $4_1 = 0; $10_1 = $6_1 - 1 | 0; $23_1 = ($10_1 | 0) > 0 ? $10_1 : 0; while (1) { if (($4_1 | 0) != ($23_1 | 0)) { $5_1 = $4_1; $2_1 = $4_1; $4_1 = $2_1 + 1 | 0; $1_1 = $4_1; while (1) { if (!(($1_1 | 0) == ($6_1 | 0))) { $8_1 = $3 + 240 | 0; $2_1 = HEAPU32[HEAP32[$8_1 + ($1_1 << 2) >> 2] + 4 >> 2] < HEAPU32[HEAP32[($2_1 << 2) + $8_1 >> 2] + 4 >> 2] ? $1_1 : $2_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; if (($2_1 | 0) == ($5_1 | 0)) { continue } $1_1 = $3 + 240 | 0; $2_1 = HEAP32[$1_1 + ($2_1 << 2) >> 2]; $13_1 = HEAP32[$2_1 + 4 >> 2]; $1_1 = HEAP32[($5_1 << 2) + $1_1 >> 2]; $5_1 = HEAP32[$1_1 + 4 >> 2]; $8_1 = HEAP32[$1_1 + 72 >> 2]; $17_1 = HEAPU16[$8_1 + 28 >> 1]; $19_1 = HEAP32[$20_1 + 36 >> 2]; $26_1 = HEAP32[18884]; $18_1 = HEAPU16[HEAP32[$2_1 + 72 >> 2] + 28 >> 1]; HEAP16[$8_1 + 28 >> 1] = $18_1; $637($8_1, (($26_1 >>> 0) / ($19_1 >>> 0) | 0) + 1 | 0); $8_1 = HEAP32[$2_1 + 72 >> 2]; HEAP16[$8_1 + 28 >> 1] = $17_1; $637($8_1, $5_1); $8_1 = HEAP32[$1_1 + 72 >> 2]; HEAP16[$8_1 + 28 >> 1] = $18_1; $637($8_1, $13_1); HEAP32[$1_1 + 4 >> 2] = $13_1; HEAP32[$2_1 + 4 >> 2] = $5_1; continue; } break; }; $4_1 = $3 + 240 | 0; $1_1 = HEAP32[$4_1 + ($10_1 << 2) >> 2]; $2_1 = HEAP32[$1_1 + 4 >> 2]; $2_1 = $2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24); HEAP8[$15_1 | 0] = $2_1; HEAP8[$15_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$15_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$15_1 + 3 | 0] = $2_1 >>> 24; if (!($9_1 & 8 | ($7_1 | 0) == ($28_1 | 0))) { $2_1 = HEAP32[$1_1 + 56 >> 2]; $1_1 = HEAP32[HEAP32[($25 << 2) + (($7_1 | 0) > ($28_1 | 0) ? $4_1 : $3 + 272 | 0) >> 2] + 56 >> 2]; $1_1 = HEAPU8[$1_1 + 8 | 0] | HEAPU8[$1_1 + 9 | 0] << 8 | (HEAPU8[$1_1 + 10 | 0] << 16 | HEAPU8[$1_1 + 11 | 0] << 24); HEAP8[$2_1 + 8 | 0] = $1_1; HEAP8[$2_1 + 9 | 0] = $1_1 >>> 8; HEAP8[$2_1 + 10 | 0] = $1_1 >>> 16; HEAP8[$2_1 + 11 | 0] = $1_1 >>> 24; } block91 : { block101 : { block116 : { block85 : { block78 : { if (!HEAPU8[$20_1 + 17 | 0]) { break block78 } $13_1 = HEAP32[$3 + 240 >> 2]; $2_1 = HEAPU8[$13_1 + 12 | 0] + HEAPU16[$13_1 + 24 >> 1] | 0; $8_1 = !$24_1; $5_1 = 0; $10_1 = $13_1; $1_1 = 0; $4_1 = 0; while (1) { if (($4_1 | 0) >= ($16_1 | 0)) { break block78 } $17_1 = $4_1 + $8_1 | 0; $9_1 = HEAP32[HEAP32[$3 + 56 >> 2] + ($4_1 << 2) >> 2]; while (1) { if (!(($2_1 | 0) != ($4_1 | 0))) { $1_1 = $1_1 + 1 | 0; $13_1 = HEAP32[(($6_1 | 0) > ($1_1 | 0) ? $3 + 240 | 0 : $3 + 272 | 0) + ($1_1 << 2) >> 2]; $2_1 = ($17_1 + HEAPU16[$13_1 + 24 >> 1] | 0) + HEAPU8[$13_1 + 12 | 0] | 0; continue; } break; }; block81 : { if (($4_1 | 0) == HEAP32[($3 + 208 | 0) + ($5_1 << 2) >> 2]) { $5_1 = $5_1 + 1 | 0; $10_1 = HEAP32[($3 + 240 | 0) + ($5_1 << 2) >> 2]; if (!$24_1) { break block81 } } if (!(HEAP32[$10_1 + 4 >> 2] != HEAP32[($3 + 112 | 0) + ($1_1 << 2) >> 2] | ($1_1 | 0) >= ($6_1 | 0) | $9_1 >>> 0 < HEAPU32[$13_1 + 56 >> 2])) { if ($9_1 >>> 0 < HEAPU32[$13_1 + 60 >> 2]) { break block81 } } if (!$38_1) { $639($20_1, $156($9_1), 5, HEAP32[$10_1 + 4 >> 2], $3 + 284 | 0) } if ($807($3 + 48 | 0, $4_1) >>> 0 > HEAPU16[$10_1 + 16 >> 1]) { $640($10_1, $13_1, $9_1, $3 + 284 | 0) } if (HEAP32[$3 + 284 >> 2]) { break block85 } $16_1 = HEAP32[$3 + 48 >> 2]; } $4_1 = $4_1 + 1 | 0; continue; }; } $17_1 = 0; $26_1 = HEAP32[$3 + 60 >> 2]; $13_1 = HEAP32[$3 + 56 >> 2]; $10_1 = 0; while (1) { block90 : { if (($10_1 | 0) != ($23_1 | 0)) { $9_1 = $17_1 + $34_1 | 0; $2_1 = $10_1 << 2; $4_1 = HEAP32[$2_1 + ($3 + 208 | 0) >> 2]; $1_1 = HEAPU16[$26_1 + ($4_1 << 1) >> 1]; $8_1 = $1_1 + $31_1 | 0; $5_1 = HEAP32[($4_1 << 2) + $13_1 >> 2]; $2_1 = HEAP32[$2_1 + ($3 + 240 | 0) >> 2]; block88 : { if (!HEAPU8[$2_1 + 8 | 0]) { $1_1 = HEAP32[$2_1 + 56 >> 2]; $15_1 = HEAPU8[$5_1 | 0] | HEAPU8[$5_1 + 1 | 0] << 8 | (HEAPU8[$5_1 + 2 | 0] << 16 | HEAPU8[$5_1 + 3 | 0] << 24); HEAP8[$1_1 + 8 | 0] = $15_1; HEAP8[$1_1 + 9 | 0] = $15_1 >>> 8; HEAP8[$1_1 + 10 | 0] = $15_1 >>> 16; HEAP8[$1_1 + 11 | 0] = $15_1 >>> 24; break block88; } if ($24_1) { $4_1 = $4_1 - 1 | 0; FUNCTION_TABLE[HEAP32[$2_1 + 80 >> 2]]($2_1, HEAP32[($4_1 << 2) + $13_1 >> 2], $3 + 24 | 0); $8_1 = $732($9_1 + 4 | 0, HEAP32[$3 + 24 >> 2], HEAP32[$3 + 28 >> 2]) + 4 | 0; $5_1 = $9_1; $9_1 = 0; break block88; } $5_1 = $5_1 - 4 | 0; if (($1_1 | 0) != 4) { break block88 } $8_1 = FUNCTION_TABLE[HEAP32[$11_1 + 76 >> 2]]($11_1, $5_1) | 0; } $1_1 = 0; while (1) { $15_1 = $1_1 << 2; $1_1 = $1_1 + 1 | 0; if (HEAP32[$15_1 + $35_1 >> 2] <= ($4_1 | 0)) { continue } break; }; $1_1 = HEAP32[$15_1 + $37_1 >> 2]; if ($1_1 >>> 0 <= $5_1 >>> 0 | $1_1 >>> 0 >= $5_1 + $8_1 >>> 0) { break block90 } HEAP32[$3 + 284 >> 2] = $181(79573); break block91; } $9_1 = 1 - $6_1 | 0; $31_1 = !$24_1; $18_1 = HEAP32[$3 + 52 >> 2]; $24_1 = HEAP32[$3 + 208 >> 2]; block114 : { while (1) { if (($6_1 | 0) > ($9_1 | 0)) { $2_1 = $9_1 >> 31; $1_1 = ($2_1 ^ $9_1) - $2_1 | 0; $32_1 = $1_1 + ($3 + 132 | 0) | 0; block93 : { if (HEAPU8[$32_1 | 0]) { break block93 } block97 : { block95 : { if (($9_1 | 0) < 0) { $2_1 = $1_1 - 1 | 0; $4_1 = $2_1 << 2; if (HEAP32[$4_1 + ($3 + 176 | 0) >> 2] >= HEAP32[$4_1 + ($3 + 208 | 0) >> 2]) { break block95 } break block93; } if (!$9_1) { $5_1 = 0; $8_1 = 0; $10_1 = $24_1; break block97; } $2_1 = $1_1 - 1 | 0; } $8_1 = $16_1; $8_1 = $1_1 >>> 0 <= $25 >>> 0 ? $31_1 + HEAP32[($3 + 176 | 0) + ($2_1 << 2) >> 2] | 0 : $8_1; $4_1 = $3 + 208 | 0; $5_1 = $31_1 + HEAP32[($2_1 << 2) + $4_1 >> 2] | 0; $10_1 = HEAP32[$4_1 + ($1_1 << 2) >> 2] - $5_1 | 0; } $29_1 = $1_1 << 2; $14 = HEAP32[$29_1 + ($3 + 240 | 0) >> 2]; $17_1 = HEAP32[$14 + 64 >> 2]; $15_1 = HEAPU8[$14 + 9 | 0]; $23_1 = HEAP32[$14 + 56 >> 2]; $19_1 = HEAPU8[$14 + 12 | 0]; $2_1 = HEAPU16[$14 + 24 >> 1]; $4_1 = $2_1; if (($5_1 | 0) > ($8_1 | 0)) { $1_1 = $808($14, $8_1, $5_1 - $8_1 | 0, $3 + 48 | 0); if (($2_1 | 0) < ($1_1 | 0)) { $1_1 = 78599; break block101; } $4_1 = $2_1 << 1; if ($4_1) { $21_1 = HEAP32[$14 + 64 >> 2]; wasm2js_memory_copy($21_1, $21_1 + ($1_1 << 1) | 0, $4_1); } $4_1 = $2_1 - $1_1 | 0; } $17_1 = $17_1 + ($10_1 << 1) | 0; $1_1 = $19_1 + ($2_1 + $8_1 | 0) | 0; $2_1 = $5_1 + $10_1 | 0; if (($1_1 | 0) > ($2_1 | 0)) { $4_1 = $4_1 - $808($14, $2_1, $1_1 - $2_1 | 0, $3 + 48 | 0) | 0 } $2_1 = $15_1 + $23_1 | 0; $1_1 = $23_1 + (HEAPU8[$2_1 + 5 | 0] << 8 | HEAPU8[$2_1 + 6 | 0]) | 0; HEAP32[$3 + 24 >> 2] = $1_1; block110 : { block104 : { if ($1_1 >>> 0 < $17_1 >>> 0 | $1_1 >>> 0 > HEAPU32[$14 + 60 >> 2]) { break block104 } if (($5_1 | 0) < ($8_1 | 0)) { $1_1 = $8_1 - $5_1 | 0; $1_1 = ($1_1 | 0) > ($10_1 | 0) ? $10_1 : $1_1; $15_1 = HEAP32[$14 + 64 >> 2]; $19_1 = $4_1 << 1; if ($19_1) { wasm2js_memory_copy($15_1 + ($1_1 << 1) | 0, $15_1, $19_1) } if ($809($14, $17_1, $3 + 24 | 0, $15_1, $5_1, $1_1, $3 + 48 | 0)) { break block104 } $4_1 = $1_1 + $4_1 | 0; } $30_1 = $14 + 28 | 0; $1_1 = 0; while (1) { if ($1_1 >>> 0 < HEAPU8[$14 + 12 | 0]) { $21_1 = HEAPU16[$30_1 + ($1_1 << 1) >> 1] + $8_1 | 0; $15_1 = $21_1 - $5_1 | 0; if (!(($15_1 | 0) < 0 | ($10_1 | 0) <= ($15_1 | 0))) { $19_1 = HEAP32[$14 + 64 >> 2] + ($15_1 << 1) | 0; block109 : { if (($4_1 | 0) <= ($15_1 | 0)) { break block109 } $15_1 = $4_1 - $15_1 << 1; if (!$15_1) { break block109 } wasm2js_memory_copy($19_1 + 2 | 0, $19_1, $15_1); } $22_1 = $3 + 48 | 0; $807($22_1, $21_1); if ($809($14, $17_1, $3 + 24 | 0, $19_1, $21_1, 1, $22_1)) { break block104 } $4_1 = $4_1 + 1 | 0; } $1_1 = $1_1 + 1 | 0; continue; } break; }; if ($809($14, $17_1, $3 + 24 | 0, HEAP32[$14 + 64 >> 2] + ($4_1 << 1) | 0, $4_1 + $5_1 | 0, $10_1 - $4_1 | 0, $3 + 48 | 0)) { break block104 } HEAP8[$14 + 12 | 0] = 0; HEAP16[$14 + 24 >> 1] = $10_1; HEAP8[$2_1 + 3 | 0] = $10_1 >>> 8; HEAP8[$2_1 + 4 | 0] = HEAPU8[$14 + 24 | 0]; $1_1 = HEAP32[$3 + 24 >> 2] - $23_1 | 0; $1_1 = $1_1 << 8 | ($1_1 & 65280) >>> 8; HEAP8[$2_1 + 5 | 0] = $1_1; HEAP8[$2_1 + 6 | 0] = $1_1 >>> 8; break block110; } $1_1 = $5_1; $2_1 = $10_1; if (($2_1 | 0) <= 0) { $1_1 = 78673; break block101; } while (1) { if (($2_1 | 0) > 0) { $4_1 = $26_1 + ($1_1 << 1) | 0; if (!HEAPU16[$4_1 >> 1]) { HEAP16[$4_1 >> 1] = FUNCTION_TABLE[HEAP32[$18_1 + 76 >> 2]]($18_1, HEAP32[($1_1 << 2) + $13_1 >> 2]) } $2_1 = $2_1 - 1 | 0; $1_1 = $1_1 + 1 | 0; continue; } break; }; $2_1 = $806($3 + 48 | 0, $5_1, $10_1, $14); if ($2_1) { break block114 } } HEAP8[$32_1 | 0] = 1; HEAP32[$14 + 20 >> 2] = $27 - HEAP32[$29_1 + ($3 + 144 | 0) >> 2]; } $9_1 = $9_1 + 1 | 0; continue; } break; }; HEAP32[$3 + 284 >> 2] = 0; block115 : { if (HEAPU16[$11_1 + 24 >> 1] | ($33_1 | 0) != 1) { break block115 } $2_1 = HEAP32[$3 + 240 >> 2]; if (HEAP32[$2_1 + 20 >> 2] < HEAPU8[$11_1 + 9 | 0]) { break block115 } HEAP32[$3 + 284 >> 2] = $769($2_1, -1); $4_1 = $3 + 284 | 0; $805($2_1, $11_1, $4_1); $710($2_1, $4_1); break block116; } if (!HEAPU8[$20_1 + 17 | 0]) { break block116 } $1_1 = 0; if ($38_1) { break block116 } while (1) { if (($1_1 | 0) == ($6_1 | 0)) { break block116 } $2_1 = HEAP32[($3 + 240 | 0) + ($1_1 << 2) >> 2]; $639($20_1, $156(HEAP32[$2_1 + 56 >> 2] + 8 | 0), 5, HEAP32[$2_1 + 4 >> 2], $3 + 284 | 0); $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$3 + 284 >> 2] = $2_1; break block91; } $17_1 = $8_1 + $17_1 | 0; $1_1 = $10_1 + $14 | 0; $10_1 = $10_1 + 1 | 0; $2_1 = $771($11_1, $1_1, $5_1, $8_1, $9_1, HEAP32[$2_1 + 4 >> 2]); if (!$2_1) { continue } break; }; HEAP32[$3 + 284 >> 2] = $2_1; break block91; } $13_1 = HEAP32[$3 + 56 >> 2]; break block91; } $2_1 = ($7_1 | 0) > ($28_1 | 0) ? $7_1 : $28_1; $1_1 = $6_1; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block91 } $710(HEAP32[($3 + 272 | 0) + ($1_1 << 2) >> 2], $3 + 284 | 0); $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$3 + 284 >> 2] = $181($1_1); } $2_1 = $6_1; break block73; } $2_1 = $1_1; $9_1 = $4_1; } HEAP32[$29_1 >> 2] = $9_1; HEAP32[$30_1 >> 2] = $8_1; $1_1 = 0; $1_1 = ($5_1 | 0) != 1 ? HEAP32[($3 + $32_1 | 0) + 200 >> 2] : $1_1; $5_1 = $10_1; if (($1_1 | 0) < ($2_1 | 0)) { continue } break; }; HEAP32[$3 + 284 >> 2] = $181(79339); break block35; } HEAP32[$5_1 >> 2] = $4_1; $7_1 = $2_1; $9_1 = $2_1; continue; }; } $6_1 = ($7_1 + HEAPU16[$4_1 + 18 >> 1] | 0) + (HEAPU16[$4_1 + 24 >> 1] << 1) | 0; while (1) { if (!($1_1 >>> 0 >= $6_1 >>> 0)) { HEAP32[($2_1 << 2) + $13_1 >> 2] = $7_1 + ($16_1 & (HEAPU8[$1_1 + 1 | 0] | HEAPU8[$1_1 | 0] << 8)); $2_1 = $2_1 + 1 | 0; HEAP32[$3 + 48 >> 2] = $2_1; $1_1 = $1_1 + 2 | 0; continue; } break; }; HEAP32[$9_1 + ($3 + 176 | 0) >> 2] = $2_1; if (!($24_1 | $5_1 >>> 0 >= $25 >>> 0)) { $1_1 = $26_1 + ($2_1 << 1) | 0; $6_1 = HEAP32[$9_1 + ($3 + 144 | 0) >> 2]; HEAP16[$1_1 >> 1] = $6_1; $7_1 = $8_1 + $10_1 | 0; $16_1 = $6_1 & 65535; if ($16_1) { wasm2js_memory_copy($7_1, HEAP32[$9_1 + ($3 + 232 | 0) >> 2], $16_1) } $7_1 = $7_1 + $31_1 | 0; HEAP32[($2_1 << 2) + $13_1 >> 2] = $7_1; $6_1 = HEAPU16[$1_1 >> 1] - $31_1 | 0; HEAP16[$1_1 >> 1] = $6_1; $10_1 = $10_1 + $16_1 | 0; block122 : { if (!HEAPU8[$4_1 + 8 | 0]) { $1_1 = HEAP32[$4_1 + 56 >> 2]; $1_1 = HEAPU8[$1_1 + 8 | 0] | HEAPU8[$1_1 + 9 | 0] << 8 | (HEAPU8[$1_1 + 10 | 0] << 16 | HEAPU8[$1_1 + 11 | 0] << 24); HEAP8[$7_1 | 0] = $1_1; HEAP8[$7_1 + 1 | 0] = $1_1 >>> 8; HEAP8[$7_1 + 2 | 0] = $1_1 >>> 16; HEAP8[$7_1 + 3 | 0] = $1_1 >>> 24; break block122; } while (1) { if (($6_1 & 65535) >>> 0 > 3) { break block122 } HEAP8[$8_1 + $10_1 | 0] = 0; $6_1 = HEAPU16[$1_1 >> 1] + 1 | 0; HEAP16[$1_1 >> 1] = $6_1; $10_1 = $10_1 + 1 | 0; continue; }; } $2_1 = $2_1 + 1 | 0; HEAP32[$3 + 48 >> 2] = $2_1; } $5_1 = $5_1 + 1 | 0; continue; }; } $2_1 = 0; } $1_1 = 0; $10(0, $13_1); while (1) { if (($1_1 | 0) == ($28_1 | 0)) { $1_1 = 0; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { if (!(($1_1 | 0) == ($2_1 | 0))) { $625(HEAP32[($3 + 240 | 0) + ($1_1 << 2) >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$3 + 284 >> 2]; } else { $625(HEAP32[($3 + 272 | 0) + ($1_1 << 2) >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; } if ($36_1) { $506($36_1) } $36_1 = $34_1; } HEAP8[$12_1 + 12 | 0] = 0; $625($12_1); $2_1 = HEAPU8[$0_1 + 68 | 0] - 1 | 0; HEAP8[$0_1 + 68 | 0] = $2_1; $2_1 = HEAP32[($2_1 << 24 >> 24 << 2) + $39_1 >> 2]; } $12_1 = $2_1; HEAP32[$0_1 + 116 >> 2] = $12_1; if (!$1_1) { continue } } break; }; if ($36_1) { $506($36_1) } $0_1 = $3 + 288 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $771($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $8_1 = global$0 - 16 | 0; $6_1 = $8_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; block5 : { block7 : { block13 : { block4 : { block1 : { if (!HEAPU8[$0_1 + 12 | 0]) { $11_1 = $3 + 2 | 0; if (($11_1 | 0) <= HEAP32[$0_1 + 20 >> 2]) { break block1 } } block3 : { if (!$4_1) { $4_1 = $2_1; break block3; } if (!$3) { break block3 } wasm2js_memory_copy($4_1, $2_1, $3); } $2_1 = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); HEAP8[$4_1 | 0] = $2_1; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 3 | 0] = $2_1 >>> 24; $2_1 = HEAPU8[$0_1 + 12 | 0]; HEAP8[$0_1 + 12 | 0] = $2_1 + 1; HEAP32[(($2_1 << 2) + $0_1 | 0) + 36 >> 2] = $4_1; HEAP16[(($2_1 << 1) + $0_1 | 0) + 28 >> 1] = $1_1; break block4; } $4_1 = $150(HEAP32[$0_1 + 72 >> 2]); if ($4_1) { break block5 } $4_1 = HEAPU8[$0_1 + 9 | 0]; $9_1 = HEAP32[$0_1 + 56 >> 2]; HEAP32[$8_1 + 12 >> 2] = 0; $10_1 = HEAPU16[$0_1 + 18 >> 1] + (HEAPU16[$0_1 + 24 >> 1] << 1) | 0; $7_1 = $4_1 + $9_1 | 0; $6_1 = HEAPU8[$7_1 + 5 | 0] << 8 | HEAPU8[$7_1 + 6 | 0]; block8 : { if ($10_1 >>> 0 > $6_1 >>> 0) { $4_1 = 72625; if ($6_1) { break block7 } $6_1 = 65536; if (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] == 65536) { break block8 } break block7; } $4_1 = 72628; if (HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2] < ($6_1 | 0)) { break block7 } } block14 : { block10 : { block11 : { if (!HEAPU8[$7_1 + 2 | 0]) { if (!HEAPU8[$7_1 + 1 | 0]) { break block10 } if ($10_1 + 2 >>> 0 <= $6_1 >>> 0) { break block11 } break block10; } if ($10_1 + 2 >>> 0 > $6_1 >>> 0) { break block10 } } $4_1 = $768($0_1, $3, $8_1 + 12 | 0); if ($4_1) { $4_1 = $4_1 - $9_1 | 0; if (($10_1 | 0) >= ($4_1 | 0)) { break block13 } break block14; } $4_1 = HEAP32[$8_1 + 12 >> 2]; if ($4_1) { break block5 } } if (($6_1 | 0) < ($10_1 + $11_1 | 0)) { $4_1 = HEAP32[$0_1 + 20 >> 2] - $11_1 | 0; $4_1 = $769($0_1, ($4_1 | 0) >= 4 ? 4 : $4_1); if ($4_1) { break block5 } $6_1 = ((HEAPU8[$7_1 + 6 | 0] | HEAPU8[$7_1 + 5 | 0] << 8) - 1 & 65535) + 1 | 0; } $4_1 = $6_1 - $3 | 0; $6_1 = $4_1 << 8 | ($4_1 & 65280) >>> 8; HEAP8[$7_1 + 5 | 0] = $6_1; HEAP8[$7_1 + 6 | 0] = $6_1 >>> 8; } $6_1 = $4_1 >>> 8 | 0; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] - ($11_1 & 65535); $7_1 = $4_1 + $9_1 | 0; $3 = $3 - 4 | 0; if ($3) { wasm2js_memory_copy($7_1 + 4 | 0, $2_1 + 4 | 0, $3) } $3 = $5_1 << 24 | ($5_1 & 65280) << 8 | ($5_1 >>> 8 & 65280 | $5_1 >>> 24); HEAP8[$7_1 | 0] = $3; HEAP8[$7_1 + 1 | 0] = $3 >>> 8; HEAP8[$7_1 + 2 | 0] = $3 >>> 16; HEAP8[$7_1 + 3 | 0] = $3 >>> 24; $3 = HEAP32[$0_1 + 64 >> 2] + ($1_1 << 1) | 0; $1_1 = HEAPU16[$0_1 + 24 >> 1] - $1_1 << 1; if ($1_1) { wasm2js_memory_copy($3 + 2 | 0, $3, $1_1) } HEAP8[$3 + 1 | 0] = $4_1; HEAP8[$3 | 0] = $6_1; HEAP16[$0_1 + 24 >> 1] = HEAPU16[$0_1 + 24 >> 1] + 1; $3 = HEAPU8[$0_1 + 9 | 0] + $9_1 | 0; $1_1 = HEAPU8[$3 + 4 | 0] + 1 | 0; HEAP8[$3 + 4 | 0] = $1_1; if (($1_1 & 255) != ($1_1 | 0)) { $1_1 = HEAPU8[$0_1 + 9 | 0] + $9_1 | 0; HEAP8[$1_1 + 3 | 0] = HEAPU8[$1_1 + 3 | 0] + 1; } if (!HEAPU8[HEAP32[$0_1 + 52 >> 2] + 17 | 0]) { break block4 } HEAP32[$8_1 + 8 >> 2] = 0; $640($0_1, $0_1, $2_1, $8_1 + 8 | 0); $4_1 = HEAP32[$8_1 + 8 >> 2]; if ($4_1) { break block5 } } $4_1 = 0; break block5; } $4_1 = $181(72645); break block5; } $4_1 = $181($4_1); } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $772($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = HEAPU8[$0_1 + 6 | 0]; $6_1 = HEAPU8[$0_1 + 7 | 0] | $2_1 << 8; $2_1 = HEAPU8[$0_1 + 5 | 0]; $4_1 = $2_1 << 16; $2_1 = HEAPU8[$0_1 + 4 | 0]; $4_1 = $2_1 << 24 | $4_1; $5_1 = $3 | $5_1; $2_1 = HEAPU8[$0_1 + 2 | 0]; $3 = HEAPU8[$0_1 + 3 | 0] | $2_1 << 8; $2_1 = HEAPU8[$0_1 + 1 | 0]; $2_1 = $2_1 << 16; $0_1 = HEAPU8[$0_1 | 0]; $0_1 = $0_1 << 24 | $2_1; $3 = $0_1 | $3; $2_1 = $4_1 | $6_1; HEAP32[$1_1 >> 2] = $2_1; $3 = $3 | $5_1 | $7_1; HEAP32[$1_1 + 4 >> 2] = $3; $0_1 = ($0_1 & 2146435072) == 2146435072 & ($3 & 1048575 | $2_1) != 0; HEAP16[$1_1 + 16 >> 1] = $0_1 ? 1 : 8; return $0_1; } function $773($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = 1; block : { while (1) { if (($2_1 | 0) == ($3 | 0)) { break block } $4_1 = $0_1 + $2_1 | 0; $2_1 = $2_1 + 1 | 0; if (!HEAPU8[$4_1 | 0]) { continue } break; }; $1_1 = 0; } return $1_1; } function $774($0_1, $1_1, $2_1) { $2_1 = $116($1_1, $2_1); $10($1_1, HEAP32[$0_1 >> 2]); HEAP32[$0_1 >> 2] = $2_1; } function $775($0_1) { var $1_1 = 0; HEAP32[HEAP32[$0_1 + 4 >> 2] + 4 >> 2] = HEAP32[$0_1 >> 2]; $1_1 = $154($0_1, 0); if (!$1_1) { $1_1 = $153($0_1, 0) } return $1_1; } function $776($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[$0_1 >> 2]; $4_1 = 7; block1 : { block : { if (HEAPU8[$5_1 + 87 | 0]) { break block } if (HEAP32[HEAP32[$0_1 + 4 >> 2] >> 2]) { break block1 } $4_1 = HEAP32[$0_1 + 16 >> 2] & 3; if ($4_1) { $6_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = HEAP32[$1_1 >> 2]; HEAP32[$3 + 44 >> 2] = $2_1; HEAP32[$3 + 32 >> 2] = $1_1; HEAP32[$3 + 36 >> 2] = $6_1; HEAP32[$3 + 40 >> 2] = HEAP32[($4_1 << 2) + 34748 >> 2]; $1_1 = $310($5_1, 7822, $3 + 32 | 0); HEAP32[HEAP32[$0_1 + 4 >> 2] >> 2] = $1_1; $4_1 = 1; break block; } if (HEAP8[$5_1 + 32 | 0] & 1) { $4_1 = $181(142801); break block; } $1_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 + 16 >> 2] = $1_1 ? $1_1 : 21967; $4_1 = $310($5_1, 25446, $3 + 16 | 0); if (!(!$2_1 | !HEAPU8[$2_1 | 0])) { HEAP32[$3 + 4 >> 2] = $2_1; HEAP32[$3 >> 2] = $4_1; $4_1 = $310($5_1, 8896, $3); } HEAP32[HEAP32[$0_1 + 4 >> 2] >> 2] = $4_1; $4_1 = $181(142808); } HEAP32[$0_1 + 12 >> 2] = $4_1; } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $777($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = $1_1; block2 : { while (1) { $1_1 = HEAPU8[$0_1 + $4_1 | 0]; if ($1_1 - 58 >>> 0 >= 4294967286) { $2_1 = __wasm_i64_mul($3, $2_1, 10, 0); $3 = $1_1 << 24 >> 24; $1_1 = $2_1 + $3 | 0; $2_1 = i64toi32_i32$HIGH_BITS + ($3 >> 31) | 0; $2_1 = ($1_1 >>> 0 < $3 >>> 0 ? $2_1 + 1 | 0 : $2_1) - 1 | 0; $3 = $1_1 - 48 | 0; $2_1 = $3 >>> 0 < 4294967248 ? $2_1 + 1 | 0 : $2_1; if (!(!$2_1 | !$3 & ($2_1 | 0) == 1)) { $0_1 = 0; $1_1 = 0; break block2; } $4_1 = $4_1 + 1 | 0; continue; } break; }; $0_1 = !$1_1 & ($4_1 | 0) != 0; $1_1 = $0_1 ? $3 : 0; } HEAP32[$5_1 >> 2] = $1_1; return $0_1; } function $778($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { block1 : { if (($4_1 | 0) >= HEAP32[$0_1 + 20 >> 2]) { $3 = 0; break block1; } $3 = $4_1 >>> 0 < 2 ^ $4_1; $5_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($3 << 4) | 0) + 12 >> 2]; block3 : { if ($2_1) { if (!$828($0_1, $3, $2_1)) { break block3 } } $3 = $320($5_1 + 24 | 0, $1_1); if ($3) { break block1 } } $4_1 = $4_1 + 1 | 0; continue; } break; }; return $3; } function $779($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2] + 8 | 0; while (1) { $1_1 = HEAP32[$2_1 >> 2]; if (!$1_1) { return 0 } $2_1 = $1_1 + 20 | 0; if (($0_1 | 0) == ($1_1 | 0) | HEAP32[$0_1 + 44 >> 2] != HEAP32[$1_1 + 44 >> 2]) { continue } break; }; return 1; } function $780($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; $3 = global$0 - 80 | 0; $1_1 = $3; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block : { if (!$2_1) { break block } $1_1 = HEAP32[$2_1 >> 2]; if (!$1_1 | !HEAP32[$2_1 + 8 >> 2]) { break block } $1_1 = $319(HEAP32[$0_1 >> 2], $1_1, HEAP32[$0_1 + 4 >> 2]); if (!$1_1) { break block } block2 : { $4_1 = HEAP32[$2_1 + 4 >> 2]; if (!$4_1) { $2_1 = HEAP32[$2_1 + 8 >> 2]; break block2; } block4 : { if (!$66(HEAP32[$2_1 >> 2], $4_1)) { $0_1 = $359($1_1); break block4; } $0_1 = $778(HEAP32[$0_1 >> 2], $4_1, HEAP32[$0_1 + 4 >> 2]); } $2_1 = HEAP32[$2_1 + 8 >> 2]; if (!$0_1) { break block2 } $4_1 = (HEAPU8[$0_1 + 55 | 0] | HEAPU8[$0_1 + 56 | 0] << 8) & 65531; HEAP8[$0_1 + 55 | 0] = $4_1; HEAP8[$0_1 + 56 | 0] = $4_1 >>> 8; $829($2_1, HEAPU16[$0_1 + 50 >> 1] + 1 | 0, HEAP32[$0_1 + 8 >> 2], $0_1); $2_1 = HEAPU8[$0_1 + 55 | 0] | HEAPU8[$0_1 + 56 | 0] << 8 | 128; HEAP8[$0_1 + 55 | 0] = $2_1; HEAP8[$0_1 + 56 | 0] = $2_1 >>> 8; if (HEAP32[$0_1 + 36 >> 2]) { break block } HEAP16[$1_1 + 38 >> 1] = HEAPU16[HEAP32[$0_1 + 8 >> 2] >> 1]; HEAP32[$1_1 + 28 >> 2] = HEAP32[$1_1 + 28 >> 2] | 16; break block; } HEAP16[$3 + 56 >> 1] = HEAPU16[$1_1 + 40 >> 1]; $829($2_1, 1, $1_1 + 38 | 0, $3 + 8 | 0); HEAP16[$1_1 + 40 >> 1] = HEAPU16[$3 + 56 >> 1]; HEAP32[$1_1 + 28 >> 2] = HEAP32[$1_1 + 28 >> 2] | 16; } $0_1 = $3 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $781($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAPU16[$0_1 + 50 >> 1]; $2_1 = $2_1 >>> 0 >= 5 ? 5 : $2_1; $3 = HEAP32[$0_1 + 8 >> 2]; $4_1 = HEAP32[$0_1 + 12 >> 2]; $1_1 = HEAP16[$4_1 + 38 >> 1]; if (($1_1 | 0) <= 98) { HEAP16[$4_1 + 38 >> 1] = 99; $1_1 = 99; } HEAP16[$3 >> 1] = HEAP32[$0_1 + 36 >> 2] ? $1_1 - 10 | 0 : $1_1; $1_1 = $2_1 << 1; if ($1_1) { wasm2js_memory_copy($3 + 2 | 0, 34764, $1_1) } while (1) { $1_1 = HEAPU16[$0_1 + 50 >> 1]; if (!($1_1 >>> 0 <= $2_1 >>> 0)) { $2_1 = $2_1 + 1 | 0; HEAP16[($2_1 << 1) + $3 >> 1] = 23; continue; } break; }; if (HEAPU8[$0_1 + 54 | 0]) { HEAP16[($1_1 << 1) + $3 >> 1] = 0 } } function $782($0_1) { $0_1 = $0_1 | 0; $698($0_1); $10(HEAP32[$0_1 + 4 >> 2], $0_1); } function $783($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$4_1 + 12 >> 2] = $3; $3 = $135($0_1, $2_1, $3); block1 : { if (!$3) { $2_1 = 7; break block1; } $2_1 = $786($0_1, $1_1, $3); $13($0_1, $3); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $784($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[HEAP32[$2_1 >> 2] + 228 >> 2]; block1 : { if (!$1_1) { $1_1 = HEAP32[$0_1 + 28 >> 2]; break block1; } if (($1_1 | 0) < 0) { $2_1 = $1_1 >> 31 << 10 | $1_1 >>> 22; $1_1 = $1_1 << 10; $3 = 0 - $1_1 | 0; $2_1 = 0 - ($2_1 + (($1_1 | 0) != 0) | 0) | 0; $1_1 = HEAP32[$0_1 + 36 >> 2] + HEAP32[$0_1 + 32 >> 2] | 0; $1_1 = __wasm_i64_sdiv($3, $2_1, $1_1, $1_1 >> 31); } HEAP32[$0_1 + 28 >> 2] = $1_1; } $0_1 = $523($0_1); return ($0_1 | 0) > ($1_1 | 0) ? $0_1 : $1_1; } function $785($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $507(HEAP32[$2_1 >> 2], $1_1); } function $786($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $2_1 = $93($0_1, $2_1, -1, $3 + 12 | 0, 0); if (!$2_1) { $4_1 = HEAP32[$3 + 12 >> 2]; while (1) { $2_1 = $94($4_1); if (($2_1 | 0) == 100) { $2_1 = $124($4_1, 0); if (!$2_1) { continue } $5_1 = HEAPU8[$2_1 | 0]; block3 : { if (($5_1 | 0) != 73) { if (($5_1 | 0) != 67 | HEAPU8[$2_1 + 1 | 0] != 82 | HEAPU8[$2_1 + 2 | 0] != 69) { continue } break block3; } if (HEAPU8[$2_1 + 1 | 0] != 78 | HEAPU8[$2_1 + 2 | 0] != 83) { continue } } $2_1 = $786($0_1, $1_1, $2_1); if (!$2_1) { continue } } break; }; $2_1 = ($2_1 | 0) != 101 ? $2_1 : 0; if ($2_1) { $774($1_1, $0_1, $127($0_1)) } $100($4_1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $787($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; if (!HEAPU8[$1_1 + 17 | 0]) { return 0 } return HEAPU8[$1_1 + 18 | 0] ? 2 : 1; } function $788($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; block1 : { if (HEAPU8[$2_1 + 24 | 0] & 2) { $0_1 = 8; if (HEAPU8[$2_1 + 17 | 0] != (($1_1 | 0) != 0 | 0)) { break block1 } } HEAP8[$2_1 + 18 | 0] = ($1_1 | 0) == 2; HEAP8[$2_1 + 17 | 0] = ($1_1 | 0) != 0; $0_1 = 0; } return $0_1; } function $789($0_1, $1_1) { if ($1_1) { $791($0_1, $1_1, 1) } } function $790($0_1, $1_1) { var $2_1 = 0, $3 = 0; while (1) { block5 : { $3 = HEAP32[$1_1 + 4 >> 2]; block : { if ($3 & 8454144) { break block } $2_1 = HEAP32[$1_1 + 16 >> 2]; block2 : { if ($2_1) { $790($0_1, $2_1); break block2; } $2_1 = HEAP32[$1_1 + 20 >> 2]; if ($3 & 4096) { $789($0_1, $2_1); break block2; } $358($0_1, $2_1); if (!(HEAP8[$1_1 + 7 | 0] & 1)) { break block2 } $792($0_1, HEAP32[$1_1 + 44 >> 2]); } $2_1 = HEAP32[$1_1 + 12 >> 2]; if (!$2_1 | HEAPU8[$1_1 | 0] == 178) { break block } if (!(HEAPU8[$1_1 + 7 | 0] & 8 | HEAPU8[$2_1 + 7 | 0] & 8)) { break block5 } $790($0_1, $2_1); } if (!(HEAPU8[$1_1 + 7 | 0] & 8)) { $16($0_1, $1_1) } return; } $16($0_1, $1_1); $1_1 = $2_1; continue; }; } function $791($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $4_1 = !$2_1; while (1) { $2_1 = $1_1; if ($2_1) { $1_1 = HEAP32[$2_1 + 52 >> 2]; $358($0_1, HEAP32[$2_1 + 28 >> 2]); $794($0_1, HEAP32[$2_1 + 32 >> 2]); $11($0_1, HEAP32[$2_1 + 36 >> 2]); $358($0_1, HEAP32[$2_1 + 40 >> 2]); $11($0_1, HEAP32[$2_1 + 44 >> 2]); $358($0_1, HEAP32[$2_1 + 48 >> 2]); $11($0_1, HEAP32[$2_1 + 60 >> 2]); $3 = HEAP32[$2_1 + 64 >> 2]; if ($3) { $795($0_1, $3) } $3 = HEAP32[$2_1 + 72 >> 2]; if ($3) { $796($0_1, $3) } while (1) { $3 = HEAP32[$2_1 + 68 >> 2]; if ($3) { $793($3); continue; } break; }; $3 = $4_1; $4_1 = 0; if ($3) { continue } $16($0_1, $2_1); continue; } break; }; } function $792($0_1, $1_1) { if ($1_1) { $793($1_1); $11($0_1, HEAP32[$1_1 + 40 >> 2]); $358($0_1, HEAP32[$1_1 + 8 >> 2]); $358($0_1, HEAP32[$1_1 + 12 >> 2]); $11($0_1, HEAP32[$1_1 + 28 >> 2]); $11($0_1, HEAP32[$1_1 + 24 >> 2]); $10($0_1, HEAP32[$1_1 >> 2]); $10($0_1, HEAP32[$1_1 + 4 >> 2]); $13($0_1, $1_1); } } function $793($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 32 >> 2]; if ($1_1) { $2_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$1_1 >> 2] = $2_1; if ($2_1) { HEAP32[$2_1 + 32 >> 2] = $1_1 } HEAP32[$0_1 + 32 >> 2] = 0; } } function $794($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if ($1_1) { $3 = $1_1 + 8 | 0; while (1) { if (($4_1 | 0) < HEAP32[$1_1 >> 2]) { $2_1 = HEAP32[$3 >> 2]; if ($2_1) { $16($0_1, $2_1) } $2_1 = HEAP32[$3 + 4 >> 2]; if ($2_1) { $16($0_1, $2_1) } block5 : { if (HEAPU8[$3 + 13 | 0] & 4) { $2_1 = HEAP32[$3 + 44 >> 2]; $789($0_1, HEAP32[$2_1 >> 2]); $13($0_1, $2_1); break block5; } if (HEAP8[$3 + 15 | 0] & 1) { break block5 } $2_1 = HEAP32[$3 + 44 >> 2]; if (!$2_1) { break block5 } $16($0_1, $2_1); } $2_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; if ($2_1 & 2) { $10($0_1, HEAP32[$3 + 32 >> 2]); $2_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; } if ($2_1 & 8) { $358($0_1, HEAP32[$3 + 32 >> 2]) } $6($0_1, HEAP32[$3 + 8 >> 2]); $2_1 = HEAP32[$3 + 40 >> 2]; block9 : { if (HEAPU8[$3 + 14 | 0] & 8) { $12($0_1, $2_1); break block9; } if (!$2_1) { break block9 } $790($0_1, $2_1); } $3 = $3 + 48 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; $16($0_1, $1_1); } } function $795($0_1, $1_1) { var $2_1 = 0, $3 = 0; if ($1_1) { $3 = $1_1 + 12 | 0; while (1) { if (!(HEAP32[$1_1 >> 2] <= ($2_1 | 0))) { $797($0_1, Math_imul($2_1, 24) + $3 | 0); $2_1 = $2_1 + 1 | 0; continue; } break; }; $13($0_1, $1_1); } } function $796($0_1, $1_1) { var $2_1 = 0; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 + 36 >> 2]; $792($0_1, $1_1); $1_1 = $2_1; continue; } break; }; } function $797($0_1, $1_1) { $358($0_1, HEAP32[$1_1 + 4 >> 2]); $789($0_1, HEAP32[$1_1 + 8 >> 2]); $10($0_1, HEAP32[$1_1 >> 2]); } function $799($0_1, $1_1) { var $2_1 = 0; $2_1 = $594(HEAP32[$0_1 >> 2], $1_1); if (!$2_1) { return 0 } return $617($2_1, $1_1, $0_1); } function $800($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $3 = $6_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$6_1 + 12 >> 2] = 0; block2 : { if (!($2_1 >>> 0 >= 2 & HEAPU32[$0_1 + 48 >> 2] >= $2_1 >>> 0)) { $3 = $181(77550); break block2; } $7_1 = HEAP32[$0_1 + 12 >> 2]; block4 : { if ($1_1) { $3 = HEAP32[$1_1 + 72 >> 2]; $5_1 = HEAP32[$3 + 32 >> 2]; $4_1 = HEAP32[$3 + 36 >> 2]; $5_1 = $5_1 + 1 | 0; $4_1 = $5_1 ? $4_1 : $4_1 + 1 | 0; HEAP32[$3 + 32 >> 2] = $5_1; HEAP32[$3 + 36 >> 2] = $4_1; $3 = HEAP32[$3 + 12 >> 2]; $4_1 = $3; $5_1 = HEAP32[$3 + 16 >> 2]; $3 = HEAP32[$3 + 20 >> 2]; $5_1 = $5_1 + 1 | 0; $3 = $5_1 ? $3 : $3 + 1 | 0; HEAP32[$4_1 + 16 >> 2] = $5_1; HEAP32[$4_1 + 20 >> 2] = $3; break block4; } $1_1 = $799($0_1, $2_1); } HEAP32[$6_1 + 8 >> 2] = $1_1; $3 = $150(HEAP32[$7_1 + 72 >> 2]); HEAP32[$6_1 + 4 >> 2] = $3; block18 : { block8 : { block5 : { if ($3) { break block5 } $3 = HEAP32[$7_1 + 56 >> 2]; $5_1 = $156($3 + 36 | 0); $4_1 = $5_1 + 1 | 0; $4_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$3 + 36 | 0] = $4_1; HEAP8[$3 + 37 | 0] = $4_1 >>> 8; HEAP8[$3 + 38 | 0] = $4_1 >>> 16; HEAP8[$3 + 39 | 0] = $4_1 >>> 24; block6 : { if (!(HEAPU8[$0_1 + 24 | 0] & 4)) { break block6 } if (!$1_1) { $3 = $189($0_1, $2_1, $6_1 + 8 | 0, 0); $1_1 = HEAP32[$6_1 + 8 >> 2]; if ($3) { break block5 } } $3 = $150(HEAP32[$1_1 + 72 >> 2]); HEAP32[$6_1 + 4 >> 2] = $3; if ($3) { break block8 } $3 = HEAP32[HEAP32[$1_1 + 52 >> 2] + 36 >> 2]; if (!$3) { break block6 } wasm2js_memory_fill(HEAP32[$1_1 + 56 >> 2], 0, $3); } if (HEAPU8[$0_1 + 17 | 0]) { $639($0_1, $2_1, 2, 0, $6_1 + 4 | 0); $3 = HEAP32[$6_1 + 4 >> 2]; if ($3) { break block5 } } block11 : { if (!$5_1) { $4_1 = 0; break block11; } $4_1 = $156(HEAP32[$7_1 + 56 >> 2] + 32 | 0); if ($4_1 >>> 0 > HEAPU32[$0_1 + 48 >> 2]) { $3 = $181(77597); break block5; } $3 = $189($0_1, $4_1, $6_1 + 12 | 0, 0); if ($3) { break block5 } $8_1 = HEAP32[$6_1 + 12 >> 2]; $5_1 = $156(HEAP32[$8_1 + 56 >> 2] + 4 | 0); $3 = HEAP32[$0_1 + 40 >> 2] >>> 2 | 0; if ($3 - 2 >>> 0 < $5_1 >>> 0) { $3 = $181(77608); break block5; } if ($5_1 >>> 0 >= $3 - 8 >>> 0) { break block11 } $3 = $150(HEAP32[$8_1 + 72 >> 2]); if ($3) { break block5 } $3 = HEAP32[$8_1 + 56 >> 2]; $4_1 = $5_1 + 1 | 0; $4_1 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$3 + 4 | 0] = $4_1; HEAP8[$3 + 5 | 0] = $4_1 >>> 8; HEAP8[$3 + 6 | 0] = $4_1 >>> 16; HEAP8[$3 + 7 | 0] = $4_1 >>> 24; $3 = (HEAP32[$8_1 + 56 >> 2] + ($5_1 << 2) | 0) + 8 | 0; $4_1 = $2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24); HEAP8[$3 | 0] = $4_1; HEAP8[$3 + 1 | 0] = $4_1 >>> 8; HEAP8[$3 + 2 | 0] = $4_1 >>> 16; HEAP8[$3 + 3 | 0] = $4_1 >>> 24; block14 : { if (!$1_1 | HEAPU8[$0_1 + 24 | 0] & 4) { break block14 } $3 = HEAP32[$1_1 + 72 >> 2]; $4_1 = HEAP32[$3 + 20 >> 2]; if (HEAPU8[$4_1 + 12 | 0]) { break block14 } $7_1 = HEAPU16[$3 + 28 >> 1]; if (HEAP32[$4_1 + 104 >> 2] | !($7_1 & 2)) { break block14 } HEAP16[$3 + 28 >> 1] = $7_1 & 65515 | 16; } block15 : { $3 = HEAP32[$0_1 + 64 >> 2]; if ($3) { break block15 } $3 = $426(HEAP32[$0_1 + 48 >> 2]); HEAP32[$0_1 + 64 >> 2] = $3; if ($3) { break block15 } $3 = 7; break block5; } if ($2_1 >>> 0 > HEAPU32[$3 >> 2]) { $3 = 0; break block5; } $3 = $427($3, $2_1); break block5; } if (!$1_1) { $3 = $189($0_1, $2_1, $6_1 + 8 | 0, 0); $1_1 = HEAP32[$6_1 + 8 >> 2]; if ($3) { break block5 } } $3 = $150(HEAP32[$1_1 + 72 >> 2]); if ($3) { break block8 } $0_1 = HEAP32[$1_1 + 56 >> 2]; $3 = $4_1 << 24 | ($4_1 & 65280) << 8 | ($4_1 >>> 8 & 65280 | $4_1 >>> 24); HEAP8[$0_1 | 0] = $3; HEAP8[$0_1 + 1 | 0] = $3 >>> 8; HEAP8[$0_1 + 2 | 0] = $3 >>> 16; HEAP8[$0_1 + 3 | 0] = $3 >>> 24; $3 = 0; $0_1 = HEAP32[$1_1 + 56 >> 2]; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $0_1 = HEAP32[$7_1 + 56 >> 2]; $2_1 = $2_1 << 24 | ($2_1 & 65280) << 8 | ($2_1 >>> 8 & 65280 | $2_1 >>> 24); HEAP8[$0_1 + 32 | 0] = $2_1; HEAP8[$0_1 + 33 | 0] = $2_1 >>> 8; HEAP8[$0_1 + 34 | 0] = $2_1 >>> 16; HEAP8[$0_1 + 35 | 0] = $2_1 >>> 24; break block8; } if ($1_1) { break block8 } $1_1 = 0; break block18; } HEAP8[$1_1 | 0] = 0; } $625($1_1); $625(HEAP32[$6_1 + 12 >> 2]); } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $801($0_1) { var $1_1 = 0, $2_1 = 0; block1 : { while (1) { $1_1 = HEAP32[$0_1 + 116 >> 2]; if (!HEAPU8[$1_1 + 8 | 0]) { $2_1 = $156((HEAP32[$1_1 + 56 >> 2] + HEAPU8[$1_1 + 9 | 0] | 0) + 8 | 0); HEAP16[$0_1 + 70 >> 1] = HEAPU16[$1_1 + 24 >> 1]; $1_1 = $739($0_1, $2_1); if (!$1_1) { continue } break block1; } break; }; HEAP16[$0_1 + 70 >> 1] = HEAPU16[$1_1 + 24 >> 1] - 1; $1_1 = 0; } return $1_1; } function $802($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = HEAP32[$2_1 + 28 >> 2]; $6_1 = $5_1 - $3 | 0; block3 : { block1 : { if (($6_1 | 0) <= 0) { $2_1 = ($4_1 | 0) > 0 ? $4_1 : 0; while (1) { if (($2_1 | 0) == ($7_1 | 0)) { break block1 } $3 = $1_1 + $7_1 | 0; if (!HEAPU8[$3 | 0]) { $7_1 = $7_1 + 1 | 0; continue; } break; }; $5_1 = $150(HEAP32[$0_1 + 72 >> 2]); if ($5_1) { break block3 } $5_1 = 0; $0_1 = $4_1 - $7_1 | 0; if (!$0_1) { break block3 } wasm2js_memory_fill($3, 0, $0_1); return 0; } block5 : { if (($4_1 | 0) <= ($6_1 | 0)) { $6_1 = $4_1; break block5; } $5_1 = $802($0_1, $1_1 + $6_1 | 0, $2_1, $5_1, $4_1 - $6_1 | 0); if ($5_1) { break block3 } } $5_1 = 0; if (!$2014($1_1, HEAP32[$2_1 + 16 >> 2] + $3 | 0, $6_1)) { break block3 } $5_1 = $150(HEAP32[$0_1 + 72 >> 2]); if ($5_1) { break block3 } if (!$6_1) { break block1 } wasm2js_memory_copy($1_1, HEAP32[$2_1 + 16 >> 2] + $3 | 0, $6_1); } $5_1 = 0; } return $5_1; } function $804($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $4_1 = $1_1 + $2_1 | 0; $6_1 = HEAPU8[$0_1 + 9 | 0]; $12_1 = $6_1 + 1 | 0; block9 : { $8_1 = HEAP32[$0_1 + 56 >> 2]; $9_1 = $6_1 + $8_1 | 0; block1 : { if (!(HEAPU8[$9_1 + 2 | 0] | HEAPU8[$8_1 + $12_1 | 0])) { $6_1 = $12_1; $3 = $2_1; break block1; } $3 = $12_1; block2 : { while (1) { $6_1 = $3; $10_1 = $3 & 65535; $13_1 = $10_1 + $8_1 | 0; $7_1 = HEAPU8[$13_1 | 0]; $14 = HEAPU8[$13_1 + 1 | 0]; $3 = $14 | $7_1 << 8; $5_1 = $3 & 65535; if ($5_1 >>> 0 >= $1_1 >>> 0) { break block2 } if ($5_1 >>> 0 > $10_1 >>> 0) { continue } break; }; if (!($3 & 65535)) { break block2 } return $181(72724); } $3 = $3 & 65535; $15_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; if ($3 >>> 0 > $15_1 - 4 >>> 0) { return $181(72729) } block7 : { if (!(!$3 | $3 >>> 0 > $4_1 + 3 >>> 0)) { if ($3 >>> 0 < $4_1 >>> 0) { return $181(72741) } $7_1 = $3 + $8_1 | 0; $5_1 = $3 + (HEAPU8[$7_1 + 2 | 0] << 8 | HEAPU8[$7_1 + 3 | 0]) | 0; if ($5_1 >>> 0 > $15_1 >>> 0) { return $181(72744) } $11_1 = $3 - $4_1 | 0; $14 = HEAPU8[$7_1 + 1 | 0]; $7_1 = HEAPU8[$7_1 | 0]; $3 = $5_1 - $1_1 | 0; break block7; } $5_1 = $4_1; $3 = $2_1; } block8 : { if ($12_1 >>> 0 >= $10_1 >>> 0) { break block8 } $4_1 = $10_1 + (HEAPU8[$13_1 + 3 | 0] | HEAPU8[$13_1 + 2 | 0] << 8) | 0; if ($4_1 + 3 >>> 0 < $1_1 >>> 0) { break block8 } if ($1_1 >>> 0 < $4_1 >>> 0) { break block9 } $3 = $5_1 - $6_1 | 0; $11_1 = ($1_1 - $4_1 | 0) + $11_1 | 0; $1_1 = $6_1; } $4_1 = HEAPU8[$9_1 + 7 | 0]; if ($4_1 >>> 0 < ($11_1 & 255) >>> 0) { return $181(72763) } HEAP8[$9_1 + 7 | 0] = $4_1 - $11_1; $4_1 = $5_1; } $5_1 = $1_1 & 65535; $11_1 = HEAPU8[$9_1 + 6 | 0] | HEAPU8[$9_1 + 5 | 0] << 8; block11 : { if (!(HEAPU8[HEAP32[$0_1 + 52 >> 2] + 24 | 0] & 12)) { break block11 } $10_1 = $3 & 65535; if (!$10_1) { break block11 } wasm2js_memory_fill($5_1 + $8_1 | 0, 0, $10_1); } block15 : { if ($5_1 >>> 0 <= $11_1 >>> 0) { if ($5_1 >>> 0 < $11_1 >>> 0) { return $181(72777) } if (($12_1 | 0) != ($6_1 & 65535)) { return $181(72778) } $1_1 = $8_1 + $12_1 | 0; HEAP8[$1_1 + 1 | 0] = $14; HEAP8[$1_1 | 0] = $7_1; HEAP8[$9_1 + 6 | 0] = $4_1; HEAP8[$9_1 + 5 | 0] = $4_1 >>> 8; break block15; } $6_1 = ($6_1 & 65535) + $8_1 | 0; $1_1 = $1_1 << 8 | ($1_1 & 65280) >>> 8; HEAP8[$6_1 | 0] = $1_1; HEAP8[$6_1 + 1 | 0] = $1_1 >>> 8; $1_1 = $5_1 + $8_1 | 0; HEAP8[$1_1 + 3 | 0] = $3; HEAP8[$1_1 + 2 | 0] = $3 >>> 8; HEAP8[$1_1 + 1 | 0] = $14; HEAP8[$1_1 | 0] = $7_1; } HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + $2_1; return 0; } return $181(72757); } function $805($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block : { if (HEAP32[$2_1 >> 2]) { break block } $5_1 = HEAP32[$1_1 + 56 >> 2]; $9_1 = HEAP32[$1_1 + 4 >> 2]; $6_1 = HEAP32[$0_1 + 52 >> 2]; $7_1 = HEAP32[$0_1 + 56 >> 2]; $3 = $7_1 + HEAPU8[$0_1 + 9 | 0] | 0; $4_1 = HEAPU8[$3 + 5 | 0] << 8 | HEAPU8[$3 + 6 | 0]; $8_1 = HEAP32[$6_1 + 40 >> 2] - $4_1 | 0; if ($8_1) { wasm2js_memory_copy($5_1 + $4_1 | 0, $4_1 + $7_1 | 0, $8_1) } $0_1 = HEAPU16[$0_1 + 18 >> 1] + (HEAPU16[$0_1 + 24 >> 1] << 1) | 0; if ($0_1) { wasm2js_memory_copy((($9_1 | 0) == 1 ? 100 : 0) + $5_1 | 0, $3, $0_1) } HEAP8[$1_1 | 0] = 0; $0_1 = $514($1_1); block3 : { if ($0_1) { break block3 } $0_1 = $765($1_1); if ($0_1) { break block3 } if (!HEAPU8[$6_1 + 17 | 0]) { break block } $0_1 = $638($1_1); } HEAP32[$2_1 >> 2] = $0_1; } } function $806($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $10_1 = HEAP32[$3 + 56 >> 2]; $6_1 = $10_1 + HEAPU8[$3 + 9 | 0] | 0; $5_1 = HEAPU8[$6_1 + 5 | 0] << 8 | HEAPU8[$6_1 + 6 | 0]; $7_1 = HEAP32[$3 + 52 >> 2]; $8_1 = HEAP32[$7_1 + 40 >> 2]; $5_1 = $8_1 >>> 0 >= $5_1 >>> 0 ? $5_1 : 0; $13_1 = $5_1 + $10_1 | 0; $14 = HEAP32[HEAP32[$7_1 >> 2] + 224 >> 2]; $11_1 = HEAP32[$3 + 64 >> 2]; $7_1 = $8_1 - $5_1 | 0; if ($7_1) { wasm2js_memory_copy($5_1 + $14 | 0, $13_1, $7_1) } $15_1 = $0_1 + 40 | 0; $7_1 = $8_1 + $10_1 | 0; while (1) { $5_1 = $4_1; $4_1 = $4_1 + 1 | 0; if (HEAP32[($5_1 << 2) + $15_1 >> 2] <= ($1_1 | 0)) { continue } break; }; $18_1 = $0_1 + 16 | 0; $19_1 = $1_1 + $2_1 | 0; $8_1 = $7_1; while (1) { $4_1 = $5_1 << 2; $20_1 = $4_1 + $15_1 | 0; $16_1 = HEAP32[$4_1 + $18_1 >> 2]; block6 : { while (1) { $4_1 = HEAP32[HEAP32[$0_1 + 8 >> 2] + ($1_1 << 2) >> 2]; $12_1 = HEAPU16[HEAP32[$0_1 + 12 >> 2] + ($1_1 << 1) >> 1]; $9_1 = $4_1 + $12_1 | 0; block3 : { block2 : { if (!($4_1 >>> 0 < $13_1 >>> 0 | $4_1 >>> 0 >= $7_1 >>> 0)) { if ($7_1 >>> 0 >= $9_1 >>> 0) { break block2 } return $181(78380); } if ($9_1 >>> 0 <= $16_1 >>> 0 | $4_1 >>> 0 >= $16_1 >>> 0) { break block3 } return $181(78385); } $4_1 = ($4_1 - $10_1 | 0) + $14 | 0; } $8_1 = $8_1 - $12_1 | 0; $9_1 = $8_1 - $10_1 | 0; $17_1 = $9_1 << 8 | ($9_1 & 65280) >>> 8; HEAP8[$11_1 | 0] = $17_1; HEAP8[$11_1 + 1 | 0] = $17_1 >>> 8; $11_1 = $11_1 + 2 | 0; if ($8_1 >>> 0 < $11_1 >>> 0) { return $181(78391) } if ($12_1) { wasm2js_memory_copy($8_1, $4_1, $12_1) } $1_1 = $1_1 + 1 | 0; if (($19_1 | 0) <= ($1_1 | 0)) { break block6 } if (HEAP32[$20_1 >> 2] > ($1_1 | 0)) { continue } break; }; $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP8[$3 + 12 | 0] = 0; HEAP16[$3 + 24 >> 1] = $2_1; HEAP8[$6_1 + 1 | 0] = 0; HEAP8[$6_1 + 2 | 0] = 0; HEAP8[$6_1 + 3 | 0] = HEAPU8[$3 + 25 | 0]; $0_1 = HEAPU8[$3 + 24 | 0]; HEAP8[$6_1 + 7 | 0] = 0; HEAP8[$6_1 + 6 | 0] = $9_1; HEAP8[$6_1 + 5 | 0] = $9_1 >>> 8; HEAP8[$6_1 + 4 | 0] = $0_1; return 0; } function $807($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAPU16[HEAP32[$0_1 + 12 >> 2] + ($1_1 << 1) >> 1]; if (!$2_1) { $2_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[$2_1 + 76 >> 2]]($2_1, HEAP32[HEAP32[$0_1 + 8 >> 2] + ($1_1 << 2) >> 2]) | 0; HEAP16[HEAP32[$0_1 + 12 >> 2] + ($1_1 << 1) >> 1] = $2_1; } return $2_1; } function $808($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $4_1 = global$0 - 96 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $2_1 = $1_1 + $2_1 | 0; $14 = ($1_1 | 0) > ($2_1 | 0) ? $1_1 : $2_1; $10_1 = HEAP32[$0_1 + 56 >> 2]; $12_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + 40 >> 2]; $15_1 = $10_1 + $12_1 | 0; $16_1 = (HEAPU8[$0_1 + 10 | 0] + (HEAPU8[$0_1 + 9 | 0] + $10_1 | 0) | 0) + 8 | 0; while (1) { block2 : { block5 : { block8 : { block1 : { if (($1_1 | 0) == ($14 | 0)) { $2_1 = 0; $1_1 = ($5_1 | 0) > 0 ? $5_1 : 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block1 } $3 = $2_1 << 2; $5_1 = HEAP32[$3 + ($4_1 + 48 | 0) >> 2]; $804($0_1, $5_1 & 65535, HEAP32[$3 + $4_1 >> 2] - $5_1 & 65535); $2_1 = $2_1 + 1 | 0; continue; }; } $2_1 = HEAP32[HEAP32[$3 + 8 >> 2] + ($1_1 << 2) >> 2]; if ($2_1 >>> 0 < $16_1 >>> 0 | $2_1 >>> 0 >= $15_1 >>> 0) { break block2 } $7_1 = $2_1 - $10_1 & 65535; $8_1 = $7_1 + HEAPU16[HEAP32[$3 + 12 >> 2] + ($1_1 << 1) >> 1] | 0; $2_1 = 0; $9_1 = ($5_1 | 0) > 0 ? $5_1 : 0; block3 : { while (1) { if (($2_1 | 0) == ($9_1 | 0)) { break block3 } $6_1 = $2_1 << 2; $13_1 = $6_1 + ($4_1 + 48 | 0) | 0; if (HEAP32[$13_1 >> 2] == ($8_1 | 0)) { HEAP32[$13_1 >> 2] = $7_1; break block5; } $2_1 = $2_1 + 1 | 0; $6_1 = $4_1 + $6_1 | 0; if (($7_1 | 0) != HEAP32[$6_1 >> 2]) { continue } break; }; HEAP32[$6_1 >> 2] = $8_1; break block5; } $2_1 = 0; if (($5_1 | 0) >= 10) { while (1) { if (($2_1 | 0) == ($5_1 | 0)) { $5_1 = 0 } else { $9_1 = $2_1 << 2; $6_1 = HEAP32[$9_1 + ($4_1 + 48 | 0) >> 2]; $804($0_1, $6_1 & 65535, HEAP32[$4_1 + $9_1 >> 2] - $6_1 & 65535); $2_1 = $2_1 + 1 | 0; continue; } break; } } $2_1 = $5_1 << 2; HEAP32[$2_1 + $4_1 >> 2] = $8_1; HEAP32[$2_1 + ($4_1 + 48 | 0) >> 2] = $7_1; if ($8_1 >>> 0 <= $12_1 >>> 0) { break block8 } $11_1 = 0; } $0_1 = $4_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $11_1; } $5_1 = $5_1 + 1 | 0; } $11_1 = $11_1 + 1 | 0; } $1_1 = $1_1 + 1 | 0; continue; }; } function $809($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $11_1 = global$0 - 16 | 0; $7_1 = $11_1; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; block6 : { if (($5_1 | 0) > 0) { $16_1 = $4_1 + $5_1 | 0; $9_1 = HEAP32[$2_1 >> 2]; $12_1 = HEAP32[$0_1 + 56 >> 2]; $14 = $6_1 + 40 | 0; $7_1 = 0; while (1) { $5_1 = $7_1; $7_1 = $7_1 + 1 | 0; $8_1 = $5_1 << 2; if (HEAP32[$8_1 + $14 >> 2] <= ($4_1 | 0)) { continue } break; }; $15_1 = $6_1 + 16 | 0; $8_1 = HEAP32[$8_1 + $15_1 >> 2]; while (1) { $7_1 = HEAPU16[HEAP32[$6_1 + 12 >> 2] + ($4_1 << 1) >> 1]; block5 : { block4 : { block3 : { if (HEAPU8[$12_1 + 1 | 0] | HEAPU8[$12_1 + 2 | 0]) { $10_1 = $768($0_1, $7_1, $11_1 + 12 | 0); if ($10_1) { break block3 } } if (($7_1 | 0) > ($9_1 - $1_1 | 0)) { break block4 } $9_1 = $9_1 - $7_1 | 0; $10_1 = $9_1; } $13_1 = HEAP32[HEAP32[$6_1 + 8 >> 2] + ($4_1 << 2) >> 2]; if ($13_1 >>> 0 >= $8_1 >>> 0 | $7_1 + $13_1 >>> 0 <= $8_1 >>> 0) { break block5 } $181(78477); } $4_1 = 1; break block6; } if ($7_1) { wasm2js_memory_copy($10_1, $13_1, $7_1) } $7_1 = $10_1 - $12_1 | 0; $7_1 = $7_1 << 8 | ($7_1 & 65280) >>> 8; HEAP8[$3 | 0] = $7_1; HEAP8[$3 + 1 | 0] = $7_1 >>> 8; $4_1 = $4_1 + 1 | 0; if (($4_1 | 0) < ($16_1 | 0)) { if (($4_1 | 0) >= HEAP32[($5_1 << 2) + $14 >> 2]) { $5_1 = $5_1 + 1 | 0; $8_1 = HEAP32[($5_1 << 2) + $15_1 >> 2]; } $3 = $3 + 2 | 0; continue; } break; }; HEAP32[$2_1 >> 2] = $9_1; } $4_1 = 0; } $0_1 = $11_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $811($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $9_1 = HEAPU8[$4_1 | 0] + $4_1 | 0; $10_1 = HEAPU8[$2_1 | 0] + $2_1 | 0; block5 : { block2 : { block4 : { block1 : { $6_1 = HEAPU8[$2_1 + 1 | 0]; $8_1 = HEAPU8[$4_1 + 1 | 0]; if (($6_1 | 0) == ($8_1 | 0)) { $8_1 = HEAPU8[$6_1 + 34740 | 0]; $6_1 = 0; while (1) { if (($6_1 | 0) == ($8_1 | 0)) { break block1 } $7_1 = $6_1 + $9_1 | 0; $11_1 = $6_1 + $10_1 | 0; $6_1 = $6_1 + 1 | 0; $7_1 = HEAPU8[$11_1 | 0] - HEAPU8[$7_1 | 0] | 0; if (!$7_1) { continue } break; }; $1_1 = HEAP8[$10_1 | 0]; if (($1_1 ^ HEAPU8[$9_1 | 0]) << 24 >> 24 >= 0) { break block2 } $7_1 = $1_1 >> 31 | 1; break block2; } $7_1 = $6_1 - $8_1 | 0; if ($8_1 >>> 0 > 7 & $6_1 >>> 0 >= 8) { break block2 } $1_1 = $6_1 >>> 0 > 7 ? -1 : $7_1; $2_1 = $8_1 >>> 0 > 7 ? 1 : $1_1; if (($2_1 | 0) <= 0) { break block4 } $7_1 = HEAP8[$10_1 | 0] < 0 ? -1 : $2_1; break block2; } $6_1 = 0; if (HEAPU16[HEAP32[HEAP32[$0_1 + 12 >> 2] + 28 >> 2] + 6 >> 1] < 2) { break block5 } return $820($0_1, $1_1, $2_1, $3, $4_1, $5_1) | 0; } $7_1 = HEAP8[$9_1 | 0] < 0 ? 1 : $1_1; } $6_1 = HEAPU8[HEAP32[HEAP32[HEAP32[$0_1 + 12 >> 2] + 28 >> 2] + 16 >> 2]] ? 0 - $7_1 | 0 : $7_1; } return $6_1 | 0; } function $812($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $7_1 = global$0 - 16 | 0; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; $6_1 = HEAPU8[$2_1 | 0]; $9_1 = HEAPU8[$4_1 | 0]; $8_1 = HEAP8[$2_1 + 1 | 0]; HEAP32[$7_1 + 12 >> 2] = $8_1 & 255; if (($8_1 | 0) < 0) { $264($2_1 + 1 | 0, $7_1 + 12 | 0) } $8_1 = $4_1 + $9_1 | 0; $10_1 = $2_1 + $6_1 | 0; $6_1 = HEAP8[$4_1 + 1 | 0]; block2 : { if (($6_1 | 0) >= 0) { $6_1 = $6_1 & 255; break block2; } $264($4_1 + 1 | 0, $7_1 + 8 | 0); $6_1 = HEAP32[$7_1 + 8 >> 2]; } $9_1 = HEAP32[HEAP32[$0_1 + 12 >> 2] + 28 >> 2]; $11_1 = $8_1; $8_1 = HEAP32[$7_1 + 12 >> 2]; $10_1 = $2014($10_1, $11_1, ((($6_1 | 0) > ($8_1 | 0) ? $8_1 : $6_1) - 13 | 0) / 2 | 0); $6_1 = $10_1 ? $10_1 : $8_1 - $6_1 | 0; block4 : { if (!$6_1) { $6_1 = 0; if (HEAPU16[$9_1 + 6 >> 1] < 2) { break block4 } $6_1 = $820($0_1, $1_1, $2_1, $3, $4_1, $5_1); break block4; } $6_1 = HEAPU8[HEAP32[$9_1 + 16 >> 2]] ? 0 - $6_1 | 0 : $6_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1 | 0; } function $813($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0; $6_1 = HEAP32[$0_1 + 16 >> 2]; if (!HEAP32[$1_1 >> 2]) { $730(HEAP32[HEAP32[$0_1 + 12 >> 2] + 28 >> 2], $5_1, $4_1, $6_1); HEAP32[$1_1 >> 2] = 1; } return $731($3, $2_1, $6_1) | 0; } function $814($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; $5_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $5_1; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; $4_1 = $3 + 12 | 0; block1 : { while (1) { $5_1 = $2_1 + 8 | 0; block : { while (1) { if ((FUNCTION_TABLE[HEAP32[$0_1 + 40 >> 2]]($0_1, $3 + 8 | 0, $1_1 + 8 | 0, HEAP32[$1_1 >> 2], $5_1, HEAP32[$2_1 >> 2]) | 0) > 0) { break block } HEAP32[$4_1 >> 2] = $1_1; $4_1 = $1_1 + 4 | 0; $1_1 = HEAP32[$1_1 + 4 >> 2]; if ($1_1) { continue } break; }; HEAP32[$4_1 >> 2] = $2_1; break block1; } HEAP32[$4_1 >> 2] = $2_1; $5_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$3 + 8 >> 2] = 0; $4_1 = $2_1 + 4 | 0; $2_1 = $5_1; if ($2_1) { continue } break; }; HEAP32[$4_1 >> 2] = $1_1; } $1_1 = HEAP32[$3 + 12 >> 2]; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $815($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[18950]; block1 : { if ($4_1) { $3 = 3338; if (FUNCTION_TABLE[$4_1 | 0](202) | 0) { break block1 } } $3 = $654(HEAP32[$0_1 >> 2], 0, $1_1, 4126, $2_1 + 12 | 0); HEAP32[$2_1 + 12 >> 2] = $3; if ($3) { break block1 } HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $0_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$0_1 >> 2]; if (!$1_1) { $3 = 0; break block1; } FUNCTION_TABLE[HEAP32[$1_1 + 40 >> 2]]($0_1, 18, $2_1) | 0; $3 = HEAP32[$2_1 + 12 >> 2]; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $816($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; wasm2js_memory_fill($1_1, 0, 40); $5_1 = $2_1 >> 31; $6_1 = $30($2_1, $5_1); HEAP32[$1_1 + 4 >> 2] = $6_1; if (!$6_1) { HEAP32[$1_1 >> 2] = 7; return; } HEAP32[$1_1 + 32 >> 2] = $0_1; HEAP32[$1_1 + 8 >> 2] = $2_1; $0_1 = __wasm_i64_srem($3, $4_1, $2_1, $5_1); $2_1 = $3 - $0_1 | 0; HEAP32[$1_1 + 24 >> 2] = $2_1; HEAP32[$1_1 + 28 >> 2] = $4_1 - (i64toi32_i32$HIGH_BITS + ($0_1 >>> 0 > $3 >>> 0) | 0); HEAP32[$1_1 + 16 >> 2] = $0_1; HEAP32[$1_1 + 12 >> 2] = $0_1; } function $817($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $0_1; $0_1 = $3 + 6 | 0; $818($4_1, $0_1, $732($0_1, $1_1, $2_1)); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $818($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = $2_1; while (1) { if (!(HEAP32[$0_1 >> 2] | ($6_1 | 0) <= 0)) { $3 = HEAP32[$0_1 + 16 >> 2]; $5_1 = HEAP32[$0_1 + 8 >> 2] - $3 | 0; $5_1 = ($6_1 | 0) < ($5_1 | 0) ? $6_1 : $5_1; if ($5_1) { wasm2js_memory_copy($3 + HEAP32[$0_1 + 4 >> 2] | 0, ($2_1 - $6_1 | 0) + $1_1 | 0, $5_1) } $4_1 = $5_1 + HEAP32[$0_1 + 16 >> 2] | 0; HEAP32[$0_1 + 16 >> 2] = $4_1; if (HEAP32[$0_1 + 8 >> 2] == ($4_1 | 0)) { $7_1 = HEAP32[$0_1 + 32 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; $8_1 = $3 + HEAP32[$0_1 + 4 >> 2] | 0; $9_1 = $4_1 - $3 | 0; $4_1 = HEAP32[$0_1 + 28 >> 2] + ($3 >> 31) | 0; $10_1 = $3; $3 = HEAP32[$0_1 + 24 >> 2] + $3 | 0; $4_1 = $10_1 >>> 0 > $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 >> 2] = FUNCTION_TABLE[HEAP32[HEAP32[$7_1 >> 2] + 12 >> 2]]($7_1, $8_1, $9_1, $3, $4_1); HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; $3 = HEAP32[$0_1 + 8 >> 2]; $7_1 = $3; $4_1 = $3 + HEAP32[$0_1 + 24 >> 2] | 0; $3 = HEAP32[$0_1 + 28 >> 2] + ($3 >> 31) | 0; HEAP32[$0_1 + 24 >> 2] = $4_1; HEAP32[$0_1 + 28 >> 2] = $4_1 >>> 0 < $7_1 >>> 0 ? $3 + 1 | 0 : $3; } $6_1 = $6_1 - $5_1 | 0; continue; } break; }; } function $819($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { if (HEAP32[$0_1 >> 2]) { break block } $3 = HEAP32[$0_1 + 4 >> 2]; if (!$3) { break block } $4_1 = HEAP32[$0_1 + 16 >> 2]; $2_1 = HEAP32[$0_1 + 12 >> 2]; if (($4_1 | 0) <= ($2_1 | 0)) { break block } $5_1 = HEAP32[$0_1 + 32 >> 2]; $6_1 = $2_1 + $3 | 0; $4_1 = $4_1 - $2_1 | 0; $3 = HEAP32[$0_1 + 28 >> 2] + ($2_1 >> 31) | 0; $7_1 = $2_1; $2_1 = HEAP32[$0_1 + 24 >> 2] + $2_1 | 0; $3 = $7_1 >>> 0 > $2_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$0_1 >> 2] = FUNCTION_TABLE[HEAP32[HEAP32[$5_1 >> 2] + 12 >> 2]]($5_1, $6_1, $4_1, $2_1, $3); } $2_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = $2_1; $3 = $2_1 + HEAP32[$0_1 + 24 >> 2] | 0; $2_1 = HEAP32[$0_1 + 28 >> 2] + ($2_1 >> 31) | 0; HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $3 >>> 0 < $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $24(HEAP32[$0_1 + 4 >> 2]); $1_1 = HEAP32[$0_1 >> 2]; wasm2js_memory_fill($0_1, 0, 40); return $1_1; } function $820($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; $6_1 = HEAP32[$0_1 + 16 >> 2]; if (!HEAP32[$1_1 >> 2]) { $730(HEAP32[HEAP32[$0_1 + 12 >> 2] + 28 >> 2], $5_1, $4_1, $6_1); HEAP32[$1_1 >> 2] = 1; } return $711($3, $2_1, $6_1, 1); } function $821($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $6_1 = global$0 + -64 | 0; $3 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $3; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; $3 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 12 >> 2]; block6 : { if (!(HEAPU32[$0_1 >> 2] < HEAPU32[$0_1 + 8 >> 2] & ($3 | 0) <= ($1_1 | 0) | ($1_1 | 0) > ($3 | 0))) { block5 : { $4_1 = HEAP32[$0_1 + 48 >> 2]; block4 : { if ($4_1) { $8_1 = HEAP32[$4_1 + 4 >> 2]; $1_1 = HEAP32[$4_1 + 12 >> 2]; $14 = $1_1; $5_1 = HEAP32[$4_1 + 8 >> 2]; $816(HEAP32[$4_1 + 48 >> 2], $6_1 + 24 | 0, HEAP32[HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2] + 12 >> 2], $5_1, $1_1); $10_1 = $4_1 + 48 | 0; while (1) { block2 : { if ($11_1) { break block2 } $12_1 = HEAP32[$8_1 + 12 >> 2] + Math_imul(HEAP32[HEAP32[$8_1 + 8 >> 2] + 4 >> 2], 56) | 0; if (!HEAP32[$12_1 + 24 >> 2]) { break block2 } $3 = HEAP32[$12_1 + 20 >> 2]; $1_1 = $3 + HEAP32[$6_1 + 48 >> 2] | 0; $13_1 = $3 >> 31; $2_1 = $13_1 + HEAP32[$6_1 + 52 >> 2] | 0; $2_1 = $1_1 >>> 0 < $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; $7_1 = $1_1; $1_1 = HEAP32[$6_1 + 40 >> 2]; $9_1 = $1_1; $7_1 = $7_1 + $1_1 | 0; $1_1 = ($1_1 >> 31) + $2_1 | 0; $1_1 = $7_1 >>> 0 < $9_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $2_1 = $7_1; $7_1 = $716($3, $13_1); $2_1 = $2_1 + $7_1 | 0; $1_1 = ($7_1 >> 31) + $1_1 | 0; $1_1 = $2_1 >>> 0 < $7_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $9_1 = $2_1; $2_1 = HEAP32[$4_1 + 16 >> 2]; $15_1 = $2_1; $7_1 = $2_1 + $5_1 | 0; $2_1 = ($2_1 >> 31) + $14 | 0; $2_1 = $7_1 >>> 0 < $15_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; if ($7_1 >>> 0 < $9_1 >>> 0 & ($2_1 | 0) <= ($1_1 | 0) | ($1_1 | 0) > ($2_1 | 0)) { break block2 } $1_1 = $6_1 + 24 | 0; $817($1_1, $3, $13_1); $818($1_1, HEAP32[$12_1 + 32 >> 2], $3); $11_1 = $720(HEAP32[$4_1 + 4 >> 2], $6_1 + 20 | 0); continue; } break; }; $1_1 = $819($6_1 + 24 | 0, $4_1 + 56 | 0); $5_1 = $10_1 + 8 | 0; $3 = HEAP32[$5_1 >> 2]; $5_1 = HEAP32[$5_1 + 4 >> 2]; $2_1 = $5_1; $8_1 = $4_1 + 40 | 0; HEAP32[$8_1 >> 2] = $3; HEAP32[$8_1 + 4 >> 2] = $2_1; $5_1 = HEAP32[$10_1 + 4 >> 2]; HEAP32[$4_1 + 32 >> 2] = HEAP32[$10_1 >> 2]; HEAP32[$4_1 + 36 >> 2] = $5_1; $5_1 = $11_1 ? $11_1 : $1_1; $1_1 = HEAP32[$4_1 + 8 >> 2]; $9_1 = ($1_1 | 0) != ($3 | 0); $3 = HEAP32[$4_1 + 12 >> 2]; if (!($9_1 | ($3 | 0) != ($2_1 | 0))) { HEAP32[$4_1 + 20 >> 2] = 1 } if ($5_1) { break block4 } if (!HEAP32[$4_1 + 20 >> 2]) { break block5 } } $5_1 = 0; } $662($0_1); break block6; } $5_1 = $822(HEAP32[$4_1 >> 2], $0_1, $4_1 + 32 | 0, $1_1, $3); if ($5_1) { break block6 } } $5_1 = $823($0_1, $6_1 + 8 | 0); if ($5_1) { break block6 } $3 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$0_1 + 20 >> 2] = $3; $5_1 = $824($0_1, $3, $0_1 + 32 | 0); } $0_1 = $6_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $822($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = HEAP32[18950]; block1 : { if ($5_1) { $6_1 = 266; if (FUNCTION_TABLE[$5_1 | 0](201) | 0) { break block1 } } if (HEAP32[$1_1 + 44 >> 2]) { HEAP32[$1_1 + 44 >> 2] = 0 } HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $4_1; $5_1 = HEAP32[$2_1 + 12 >> 2]; $6_1 = HEAP32[$2_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = $6_1; HEAP32[$1_1 + 12 >> 2] = $5_1; $2_1 = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 24 >> 2] = $2_1; $8_1 = $4_1; $4_1 = $6_1; $6_1 = HEAP32[$0_1 + 12 >> 2]; $7_1 = HEAP32[HEAP32[$6_1 + 24 >> 2] + 168 >> 2]; $4_1 = $4_1 >>> 0 > $7_1 >>> 0; $7_1 = $7_1 >> 31; if (!($4_1 & ($7_1 | 0) <= ($5_1 | 0) | ($5_1 | 0) > ($7_1 | 0) | HEAP32[HEAP32[$2_1 >> 2] >> 2] < 3)) { HEAP32[$1_1 + 44 >> 2] = 0; $6_1 = HEAP32[$0_1 + 12 >> 2]; } $5_1 = HEAP32[$6_1 + 12 >> 2]; $4_1 = $5_1 >> 31; $3 = __wasm_i64_srem($3, $8_1, $5_1, $4_1); $6_1 = 0; $0_1 = !(i64toi32_i32$HIGH_BITS | $3); $2_1 = HEAP32[$1_1 + 36 >> 2]; if (!$2_1) { $2_1 = $30($5_1, $4_1); HEAP32[$1_1 + 40 >> 2] = $5_1; HEAP32[$1_1 + 36 >> 2] = $2_1; $6_1 = $2_1 ? 0 : 7; } if ($0_1 | $6_1) { break block1 } $7_1 = HEAP32[$1_1 + 24 >> 2]; $9_1 = $2_1 + $3 | 0; $0_1 = HEAP32[$1_1 + 8 >> 2]; $2_1 = HEAP32[$1_1 >> 2]; $4_1 = $0_1 - $2_1 | 0; $6_1 = HEAP32[$1_1 + 12 >> 2]; $8_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = $8_1; $3 = $5_1 - $3 | 0; $1_1 = ($3 >> 31) + $1_1 | 0; $5_1 = $2_1 + $3 | 0; $1_1 = $5_1 >>> 0 < $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; $6_1 = FUNCTION_TABLE[HEAP32[HEAP32[$7_1 >> 2] + 8 >> 2]]($7_1, $9_1, $0_1 >>> 0 < $5_1 >>> 0 & ($1_1 | 0) >= ($6_1 | 0) | ($1_1 | 0) > ($6_1 | 0) ? $4_1 : $3, $2_1, $8_1) | 0; } return $6_1; } function $823($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 32 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$0_1 + 4 >> 2]; $3 = HEAP32[$0_1 + 44 >> 2]; block3 : { block1 : { if ($3) { $2_1 = $607($2_1 + $3 | 0, $1_1); $1_1 = HEAP32[$0_1 + 4 >> 2]; $3 = $2_1; $2_1 = HEAP32[$0_1 >> 2] + $2_1 | 0; $1_1 = $3 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; break block1; } $3 = HEAP32[$0_1 + 40 >> 2]; $2_1 = __wasm_i64_srem($2_1, $5_1, $3, $3 >> 31); if (!(!($2_1 | i64toi32_i32$HIGH_BITS) | ($3 - $2_1 | 0) < 9)) { $2_1 = $607($2_1 + HEAP32[$0_1 + 36 >> 2] | 0, $1_1); $1_1 = HEAP32[$0_1 + 4 >> 2]; $3 = $2_1; $2_1 = HEAP32[$0_1 >> 2] + $2_1 | 0; $1_1 = $3 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; break block1; } $2_1 = 0; while (1) { $3 = $824($0_1, 1, $4_1 + 12 | 0); if ($3) { break block3 } $5_1 = $4_1 + 16 | 0; $3 = HEAP8[HEAP32[$4_1 + 12 >> 2]]; HEAP8[$5_1 | $2_1 & 15] = $3; $2_1 = $2_1 + 1 | 0; if (($3 | 0) < 0) { continue } break; }; $607($5_1, $1_1); } $3 = 0; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $824($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $10_1 = global$0 - 16 | 0; $3 = $10_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[$0_1 >> 2]; $7_1 = HEAP32[$0_1 + 4 >> 2]; $3 = HEAP32[$0_1 + 44 >> 2]; block3 : { block1 : { if ($3) { HEAP32[$2_1 >> 2] = $3 + $5_1; $4_1 = ($1_1 >> 31) + $7_1 | 0; $2_1 = $1_1; $1_1 = $1_1 + $5_1 | 0; $4_1 = $2_1 >>> 0 > $1_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $4_1; break block1; } $4_1 = HEAP32[$0_1 + 40 >> 2]; $8_1 = $4_1 >> 31; $3 = __wasm_i64_srem($5_1, $7_1, $4_1, $8_1); if (!($3 | i64toi32_i32$HIGH_BITS)) { $6_1 = HEAP32[$0_1 + 8 >> 2]; $9_1 = $6_1 - $5_1 | 0; $11_1 = $4_1; $12_1 = $4_1 >>> 0 > $9_1 >>> 0; $4_1 = HEAP32[$0_1 + 12 >> 2] - ($7_1 + ($5_1 >>> 0 > $6_1 >>> 0) | 0) | 0; $4_1 = $12_1 & ($8_1 | 0) >= ($4_1 | 0) | ($4_1 | 0) < ($8_1 | 0) ? $9_1 : $11_1; $8_1 = HEAP32[$0_1 + 24 >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[HEAP32[$8_1 >> 2] + 8 >> 2]]($8_1, HEAP32[$0_1 + 36 >> 2], $4_1, $5_1, $7_1) | 0; if ($5_1) { break block3 } $4_1 = HEAP32[$0_1 + 40 >> 2]; } $8_1 = $3; $6_1 = $4_1 - $3 | 0; if (($1_1 | 0) <= ($6_1 | 0)) { HEAP32[$2_1 >> 2] = $3 + HEAP32[$0_1 + 36 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2] + ($1_1 >> 31) | 0; $3 = $1_1; $1_1 = $1_1 + HEAP32[$0_1 >> 2] | 0; $2_1 = $3 >>> 0 > $1_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1; break block1; } $3 = HEAP32[$0_1 + 16 >> 2]; block6 : { if (($1_1 | 0) <= ($3 | 0)) { $5_1 = HEAP32[$0_1 + 28 >> 2]; break block6; } $5_1 = $3 >> 31 << 1 | $3 >>> 31; $4_1 = ($3 | 0) < 64; $3 = $4_1 ? 128 : $3 << 1; $5_1 = $4_1 ? 0 : $5_1; $11_1 = $1_1 >> 31; while (1) { $9_1 = $5_1; $7_1 = $3; $4_1 = $5_1 << 1 | $3 >>> 31; $3 = $3 << 1; $5_1 = $4_1; if (($9_1 | 0) <= ($11_1 | 0) & $1_1 >>> 0 > $7_1 >>> 0 | ($9_1 | 0) < ($11_1 | 0)) { continue } break; }; $5_1 = $33(HEAP32[$0_1 + 28 >> 2], $7_1, $9_1); if (!$5_1) { $5_1 = 7; break block3; } HEAP32[$0_1 + 28 >> 2] = $5_1; HEAP32[$0_1 + 16 >> 2] = $7_1; } if ($6_1) { wasm2js_memory_copy($5_1, $8_1 + HEAP32[$0_1 + 36 >> 2] | 0, $6_1) } $3 = HEAP32[$0_1 + 4 >> 2] + ($6_1 >> 31) | 0; $5_1 = $6_1 + HEAP32[$0_1 >> 2] | 0; $3 = $5_1 >>> 0 < $6_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$0_1 >> 2] = $5_1; HEAP32[$0_1 + 4 >> 2] = $3; $4_1 = $1_1 - $6_1 | 0; while (1) { if (($4_1 | 0) > 0) { HEAP32[$10_1 + 12 >> 2] = 0; $3 = HEAP32[$0_1 + 40 >> 2]; $3 = ($3 | 0) > ($4_1 | 0) ? $4_1 : $3; $5_1 = $824($0_1, $3, $10_1 + 12 | 0); if ($5_1) { break block3 } if ($3) { wasm2js_memory_copy(HEAP32[$0_1 + 28 >> 2] + ($1_1 - $4_1 | 0) | 0, HEAP32[$10_1 + 12 >> 2], $3) } $4_1 = $4_1 - $3 | 0; continue; } break; }; HEAP32[$2_1 >> 2] = HEAP32[$0_1 + 28 >> 2]; } $5_1 = 0; } $0_1 = $10_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $825($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 + 12 >> 2]; block1 : { if ($3) { $4_1 = ($826($1_1) >>> 0) % HEAPU32[$0_1 >> 2] | 0; $3 = $3 + ($4_1 << 3) | 0; $0_1 = $3 + 4 | 0; break block1; } $3 = $0_1 + 4 | 0; $0_1 = $0_1 + 8 | 0; } $0_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$3 >> 2]; if ($2_1) { HEAP32[$2_1 >> 2] = $4_1 } while (1) { block4 : { if (!$3) { $0_1 = 82724; break block4; } if (!$67(HEAP32[$0_1 + 12 >> 2], $1_1)) { break block4 } $3 = $3 - 1 | 0; $0_1 = HEAP32[$0_1 >> 2]; continue; } break; }; return $0_1; } function $826($0_1) { var $1_1 = 0, $2_1 = 0; while (1) { $1_1 = HEAPU8[$0_1 | 0]; if ($1_1) { $0_1 = $0_1 + 1 | 0; $2_1 = Math_imul(HEAPU8[$1_1 + 31040 | 0] + $2_1 | 0, -1640531535); continue; } break; }; return $2_1; } function $827($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!$1_1) { break block } $4_1 = HEAP32[$1_1 >> 2]; if ($4_1) { $3 = HEAP32[$1_1 + 4 >> 2] } else { $3 = 0 } HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$1_1 >> 2] = $4_1 + 1; if (!$3) { break block } HEAP32[$2_1 >> 2] = $3; $1_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = $1_1; block4 : { if ($1_1) { HEAP32[$1_1 >> 2] = $2_1; break block4; } HEAP32[$0_1 + 8 >> 2] = $2_1; } HEAP32[$3 + 4 >> 2] = $2_1; return; } $1_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$2_1 >> 2] = $1_1; if ($1_1) { HEAP32[$1_1 + 4 >> 2] = $2_1 } HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = $2_1; } function $828($0_1, $1_1, $2_1) { if (!$67(HEAP32[HEAP32[$0_1 + 16 >> 2] + ($1_1 << 4) >> 2], $2_1)) { return 1 } if ($1_1) { return 0 } return !$67(11378, $2_1); } function $829($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; while (1) { block : { $5_1 = HEAPU8[$0_1 | 0]; if (!$5_1) { break block } $4_1 = 0; $6_1 = 0; if ($1_1 >>> 0 <= $7_1 >>> 0) { break block } while (1) { if (!(($5_1 - 48 & 255) >>> 0 > 9)) { $4_1 = __wasm_i64_mul($4_1, $6_1, 10, 0); $6_1 = $5_1 & 255; $4_1 = $4_1 + $6_1 | 0; $5_1 = i64toi32_i32$HIGH_BITS; $6_1 = ($4_1 >>> 0 < $6_1 >>> 0 ? $5_1 + 1 | 0 : $5_1) - 1 | 0; $4_1 = $4_1 - 48 | 0; $6_1 = $4_1 >>> 0 < 4294967248 ? $6_1 + 1 | 0 : $6_1; $5_1 = HEAPU8[$0_1 + 1 | 0]; $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP16[($7_1 << 1) + $2_1 >> 1] = $433($4_1, $6_1); $7_1 = $7_1 + 1 | 0; $0_1 = (HEAPU8[$0_1 | 0] == 32) + $0_1 | 0; continue; } break; }; $4_1 = (HEAPU8[$3 + 55 | 0] | HEAPU8[$3 + 56 | 0] << 8) & -69; HEAP8[$3 + 55 | 0] = $4_1; HEAP8[$3 + 56 | 0] = $4_1 >>> 8; $7_1 = HEAPU8[$0_1 | 0]; label3 : while (1) { if ($7_1 & 255) { block6 : { if ($343(25101, $0_1)) { if (!$343(25112, $0_1)) { $5_1 = $830($0_1 + 3 | 0); HEAP16[$3 + 48 >> 1] = $433(($5_1 | 0) <= 2 ? 2 : $5_1, 0); break block6; } if ($343(25089, $0_1)) { break block6 } $4_1 = $4_1 | 64; } else { $4_1 = $4_1 | 4 } HEAP8[$3 + 55 | 0] = $4_1; HEAP8[$3 + 56 | 0] = $4_1 >>> 8; } while (1) if ((HEAPU8[$0_1 | 0] | 32) == 32) { $5_1 = $0_1; while (1) { $0_1 = $5_1; $5_1 = $0_1 + 1 | 0; $7_1 = HEAPU8[$0_1 | 0]; if (($7_1 | 0) == 32) { continue } break; }; continue label3; } else { $0_1 = $0_1 + 1 | 0; continue; }; } break; }; $0_1 = HEAP16[$2_1 >> 1]; if (!(($0_1 | 0) < 67 | ($0_1 | 0) > HEAP16[(($1_1 << 1) + $2_1 | 0) - 2 >> 1])) { $0_1 = $4_1 | 256; HEAP8[$3 + 55 | 0] = $0_1; HEAP8[$3 + 56 | 0] = $0_1 >>> 8; } } function $830($0_1) { var $1_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 12 >> 2] = 0; $296($0_1, $1_1 + 12 | 0); $0_1 = HEAP32[$1_1 + 12 >> 2]; $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $831($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (HEAPU32[$0_1 + 12 >> 2] <= $1_1 - 1 >>> 0) { HEAP32[$2_1 + 16 >> 2] = $1_1; $700($0_1, 1950, $2_1 + 16 | 0); $3 = 1; break block1; } $3 = 1; $4_1 = 1 << ($1_1 & 7); $5_1 = HEAP32[$0_1 + 8 >> 2] + ($1_1 >>> 3 | 0) | 0; $6_1 = HEAPU8[$5_1 | 0]; if ($4_1 & $6_1) { HEAP32[$2_1 >> 2] = $1_1; $700($0_1, 1995, $2_1); break block1; } HEAP8[$5_1 | 0] = $4_1 | $6_1; $3 = 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $832($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 76 >> 2]; if (HEAP32[$1_1 + 296 >> 2]) { HEAP32[$0_1 + 24 >> 2] = 9; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + 1; } $2_1 = HEAP32[$1_1 + 372 >> 2]; block1 : { if (!$2_1) { break block1 } $3 = HEAP32[$0_1 + 28 >> 2] + 1 | 0; HEAP32[$0_1 + 28 >> 2] = $3; if (($3 >>> 0) % HEAPU32[$1_1 + 380 >> 2] | 0) { break block1 } if (!(FUNCTION_TABLE[$2_1 | 0](HEAP32[$1_1 + 376 >> 2]) | 0)) { break block1 } HEAP32[$0_1 + 24 >> 2] = 9; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2] + 1; } } function $833($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$0_1 >> 2] + 1 | 0; HEAP32[$0_1 >> 2] = $2_1; HEAP32[($2_1 << 2) + $0_1 >> 2] = $1_1; while (1) { block : { if ($2_1 >>> 0 < 2) { break block } $1_1 = $2_1 >>> 1 | 0; $3 = ($1_1 << 2) + $0_1 | 0; $4_1 = HEAP32[$3 >> 2]; $2_1 = ($2_1 << 2) + $0_1 | 0; $5_1 = HEAP32[$2_1 >> 2]; if ($4_1 >>> 0 <= $5_1 >>> 0) { break block } HEAP32[$3 >> 2] = $5_1; HEAP32[$2_1 >> 2] = $4_1; $2_1 = $1_1; continue; } break; }; } function $834($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; if (!$2_1) { return 0 } if (($1_1 | 0) >= 2) { $3 = $1_1 - 1 | 0; $2_1 = $834($0_1, $3); $1_1 = HEAP32[$0_1 >> 2]; if (!$1_1) { return $2_1 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$0_1 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = $834($0_1, $3); return $1_1; } HEAP32[$0_1 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; return $2_1; } function $835($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = HEAP32[$0_1 + 108 >> 2]; if (($5_1 | 0) >= HEAP32[$0_1 + 112 >> 2]) { if ($328($0_1)) { $0_1 = 1 } else { $0_1 = $835($0_1, $1_1, $2_1, $3, $4_1) } return $0_1; } HEAP32[$0_1 + 108 >> 2] = $5_1 + 1; $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($5_1, 20) | 0; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = $3; HEAP32[$0_1 + 4 >> 2] = $2_1; HEAP16[$0_1 + 2 >> 1] = 0; HEAP8[$0_1 | 0] = $1_1; HEAP8[$0_1 + 1 | 0] = 0; return $5_1; } function $837($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = global$0 - 272 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP16[$2_1 + 268 >> 1] = 0; HEAP32[$2_1 + 260 >> 2] = 0; HEAP32[$2_1 + 264 >> 2] = 0; HEAP32[$2_1 + 256 >> 2] = 200; HEAP32[$2_1 + 248 >> 2] = 0; HEAP32[$2_1 + 252 >> 2] = $2_1 + 48; $44($2_1 + 248 | 0, 1657); $3 = HEAPU8[$1_1 + 6 | 0]; $6_1 = 40; while (1) { if (!(HEAPU8[$1_1 + 7 | 0] <= $8_1 >>> 0)) { HEAP32[$2_1 >> 2] = $6_1; HEAP32[$2_1 + 4 >> 2] = HEAP32[($3 << 2) + 36416 >> 2]; $46($2_1 + 248 | 0, 29490, $2_1); $3 = $3 + 1 | 0; $8_1 = $8_1 + 1 | 0; $6_1 = 44; continue; } break; }; if (!$8_1) { HEAP32[$2_1 + 32 >> 2] = HEAP32[$1_1 >> 2]; $46($2_1 + 248 | 0, 29497, $2_1 + 32 | 0); $8_1 = 1; } $6_1 = 0; $3 = HEAPU8[$1_1 + 5 | 0]; if ($3 & 32) { $44($2_1 + 248 | 0, 20116); $6_1 = 1; $3 = HEAPU8[$1_1 + 5 | 0]; } if (($3 & 255) >>> 0 >= 64) { $44($2_1 + 248 | 0, 20128); $6_1 = $6_1 + 1 | 0; } $3 = $2_1 + 248 | 0; $36($3, 27781, 1); $57($3); $7_1 = $356($0_1, $2_1 + 48 | 0); block7 : { block6 : { if (!$7_1) { $3 = $23(24); if (!$3) { $7_1 = 7; break block6; } $5_1 = $3 + 16 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; $7_1 = $3 + 8 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$5_1 >> 2] = $1_1; HEAP8[$3 + 21 | 0] = $8_1; HEAP32[$3 + 12 >> 2] = $0_1; HEAP8[$3 + 20 | 0] = $6_1; $7_1 = 0; break block7; } HEAP32[$2_1 + 16 >> 2] = $127($0_1); HEAP32[$5_1 >> 2] = $61(8932, $2_1 + 16 | 0); } $3 = 0; } HEAP32[$4_1 >> 2] = $3; $0_1 = $2_1 + 272 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1 | 0; } function $838($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 - 16 | 0; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1072693248; block : { if (!HEAPU8[$0_1 + 20 | 0]) { break block } $2_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; $4_1 = HEAP32[$1_1 >> 2]; $4_1 = ($4_1 | 0) > 0 ? $4_1 : 0; while (1) { if (($5_1 | 0) != ($4_1 | 0)) { $6_1 = HEAPU8[$0_1 + 21 | 0]; $7_1 = HEAP32[$2_1 >> 2]; if (!(HEAPU8[$2_1 + 4 | 0] != 2 | ($6_1 | 0) > ($7_1 | 0))) { if (!HEAPU8[$2_1 + 5 | 0]) { return 19 } HEAP32[($3 + 8 | 0) + ($7_1 - $6_1 << 2) >> 2] = $5_1 + 1; } $2_1 = $2_1 + 12 | 0; $5_1 = $5_1 + 1 | 0; continue; } break; }; $0_1 = HEAP32[$3 + 8 >> 2]; if (!$0_1) { HEAP32[$1_1 + 48 >> 2] = 2147483647; HEAP32[$1_1 + 52 >> 2] = 0; HEAP32[$1_1 + 40 >> 2] = -4194304; HEAP32[$1_1 + 44 >> 2] = 1105199103; break block; } $2_1 = $0_1 << 3; $0_1 = HEAP32[$1_1 + 16 >> 2]; $2_1 = ($2_1 + $0_1 | 0) - 8 | 0; HEAP8[$2_1 + 4 | 0] = 1; HEAP32[$2_1 >> 2] = 1; HEAP32[$1_1 + 48 >> 2] = 20; HEAP32[$1_1 + 52 >> 2] = 0; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1077149696; $1_1 = HEAP32[$3 + 12 >> 2]; if ($1_1) { $0_1 = ($0_1 + ($1_1 << 3) | 0) - 8 | 0; HEAP8[$0_1 + 4 | 0] = 1; HEAP32[$0_1 >> 2] = 2; } return 0; } return 0; } function $839($0_1) { $0_1 = $0_1 | 0; $24($0_1); return 0; } function $840($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = $23(24); if (!$2_1) { return 7 } HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $3 = $2_1 + 16 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $2_1 + 8 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$1_1 >> 2] = $2_1; return 0; } function $841($0_1) { $0_1 = $0_1 | 0; $842($0_1); $24($0_1); return 0; } function $842($0_1) { var $1_1 = 0, $2_1 = 0; $100(HEAP32[$0_1 + 4 >> 2]); HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $2_1 = $0_1 + 16 | 0; $0_1 = 0; while (1) { if (!(($0_1 | 0) == 2)) { $1_1 = ($0_1 << 2) + $2_1 | 0; $24(HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = 0; $0_1 = $0_1 + 1 | 0; continue; } break; }; } function $843($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $1_1 = global$0 - 80 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $5_1 = HEAP32[$0_1 >> 2]; $842($0_1); $2_1 = 0; $8_1 = ($3 | 0) > 0 ? $3 : 0; $7_1 = $0_1 + 16 | 0; $3 = !(HEAPU8[HEAP32[$5_1 + 16 >> 2] + 5 | 0] & 32); block6 : { block2 : { while (1) { if (($2_1 | 0) != ($8_1 | 0)) { $6_1 = $53(HEAP32[($2_1 << 2) + $4_1 >> 2]); if ($6_1) { HEAP32[$1_1 + 48 >> 2] = $6_1; $6_1 = $61(8932, $1_1 + 48 | 0); HEAP32[($3 << 2) + $7_1 >> 2] = $6_1; if (!$6_1) { break block2 } } $3 = $3 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = HEAP32[HEAP32[$5_1 + 12 >> 2] + 124 >> 2]; HEAP16[$1_1 + 76 >> 1] = 0; HEAP32[$1_1 + 72 >> 2] = 0; HEAP32[$1_1 + 68 >> 2] = $2_1; HEAP32[$1_1 + 64 >> 2] = 0; HEAP32[$1_1 + 56 >> 2] = 0; HEAP32[$1_1 + 60 >> 2] = 0; $3 = $1_1 + 56 | 0; $44($3, 30669); $2_1 = HEAP32[$0_1 + 20 >> 2]; if ($2_1) { HEAP32[$1_1 + 32 >> 2] = $2_1; $46($3, 25077, $1_1 + 32 | 0); } $3 = $1_1 + 56 | 0; $44($3, HEAP32[HEAP32[$5_1 + 16 >> 2] >> 2]); $2_1 = HEAP32[$7_1 >> 2]; if ($2_1) { HEAP32[$1_1 + 16 >> 2] = $2_1; $46($3, 19758, $1_1 + 16 | 0); } $3 = $57($1_1 + 56 | 0); if (!$3) { break block2 } $2_1 = $93(HEAP32[$5_1 + 12 >> 2], $3, -1, $0_1 + 4 | 0, 0); $24($3); if ($2_1) { HEAP32[$1_1 >> 2] = $127(HEAP32[$5_1 + 12 >> 2]); HEAP32[$5_1 + 8 >> 2] = $61(8932, $1_1); break block6; } $2_1 = $844($0_1); break block6; } $2_1 = 7; } $0_1 = $1_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $844($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2] + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 + 8 >> 2] = $2_1; HEAP32[$0_1 + 12 >> 2] = $1_1; $1_1 = 0; if (($94(HEAP32[$0_1 + 4 >> 2]) | 0) != 100) { $1_1 = $100(HEAP32[$0_1 + 4 >> 2]); HEAP32[$0_1 + 4 >> 2] = 0; $842($0_1); } return $1_1 | 0; } function $845($0_1) { $0_1 = $0_1 | 0; return !HEAP32[$0_1 + 4 >> 2] | 0; } function $846($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = HEAPU8[HEAP32[$0_1 >> 2] + 21 | 0]; block1 : { if (($2_1 | 0) < ($3 | 0)) { $250($1_1, $276(HEAP32[$0_1 + 4 >> 2], $2_1)); break block1; } $246($1_1, HEAP32[(($2_1 - $3 << 2) + $0_1 | 0) + 16 >> 2], -1, -1); } return 0; } function $847($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 8 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; return 0; } function $848($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!$2_1) { break block } while (1) { if (!(HEAP16[$1_1 + 34 >> 1] <= ($3 | 0))) { $10($0_1, HEAP32[$2_1 >> 2]); $2_1 = $2_1 + 12 | 0; $3 = $3 + 1 | 0; continue; } break; }; $16($0_1, HEAP32[$1_1 + 4 >> 2]); if (!HEAPU8[$1_1 + 43 | 0]) { $358($0_1, HEAP32[$1_1 + 52 >> 2]) } if (HEAP32[$0_1 + 528 >> 2]) { break block } HEAP16[$1_1 + 34 >> 1] = 0; HEAP32[$1_1 + 4 >> 2] = 0; if (HEAPU8[$1_1 + 43 | 0]) { break block } HEAP32[$1_1 + 52 >> 2] = 0; } } function $849($0_1, $1_1) { var $2_1 = 0; if ($1_1) { while (1) { $2_1 = HEAP32[$1_1 + 16 >> 2]; $358($0_1, HEAP32[$1_1 >> 2]); $11($0_1, HEAP32[$1_1 + 4 >> 2]); $358($0_1, HEAP32[$1_1 + 8 >> 2]); $11($0_1, HEAP32[$1_1 + 12 >> 2]); $10($0_1, HEAP32[$1_1 + 24 >> 2]); $13($0_1, $1_1); $1_1 = $2_1; if ($1_1) { continue } break; } } } function $851($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = HEAP32[$0_1 >> 2]; block : { label : while (1) { $2_1 = $1_1; $3 = 0; if (!$2_1) { break block } block8 : { block3 : { block6 : { block5 : { block2 : { block4 : { block7 : { $1_1 = HEAPU8[$2_1 | 0]; if (($1_1 | 0) == 176) { $1_1 = HEAPU8[$2_1 + 2 | 0] } $1_1 = $1_1 & 255; switch ($1_1 - 168 | 0) { case 0: break block2; case 1: case 3: case 4: case 6: case 7: case 8: break block3; case 2: break block4; case 5: break block5; case 9: break block6; default: break block7; }; } if (($1_1 | 0) == 36) { break block5 } if (($1_1 | 0) == 78) { break block2 } if (($1_1 | 0) != 114) { break block3 } $2_1 = $852($0_1, HEAPU8[$5_1 + 84 | 0], 0, HEAP32[$2_1 + 8 >> 2]); break block8; } if (!HEAP32[$2_1 + 44 >> 2]) { break block3 } } $1_1 = HEAP16[$2_1 + 32 >> 1]; $3 = 0; if (($1_1 | 0) < 0) { break block } $2_1 = $414($5_1, HEAPU8[$5_1 + 84 | 0], $419(HEAP32[HEAP32[$2_1 + 44 >> 2] + 4 >> 2] + Math_imul($1_1, 12) | 0), 0); break block8; } $1_1 = HEAP32[$2_1 + 12 >> 2]; continue; } $1_1 = HEAP32[HEAP32[$2_1 + 20 >> 2] + 8 >> 2]; continue; } $4_1 = HEAP32[$2_1 + 4 >> 2]; $3 = 0; if (!($4_1 & 512)) { break block } $1_1 = HEAP32[$2_1 + 12 >> 2]; if (!(HEAPU8[$1_1 + 5 | 0] & 2 ? !$1_1 : 1)) { continue } $3 = HEAP32[$2_1 + 16 >> 2]; $1_1 = $3; if ($4_1 & 4096) { continue } $4_1 = HEAP32[$2_1 + 20 >> 2]; if (HEAPU8[$5_1 + 87 | 0] | !$4_1) { continue } $2_1 = 0; $1_1 = HEAP32[$4_1 >> 2]; $6_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $4_1 = $4_1 + 8 | 0; while (1) { if (($2_1 | 0) == ($6_1 | 0)) { $1_1 = $3; continue label; } $1_1 = $2_1 << 4; $2_1 = $2_1 + 1 | 0; $1_1 = HEAP32[$1_1 + $4_1 >> 2]; if (!(HEAPU8[$1_1 + 5 | 0] & 2)) { continue } break; }; continue; } break; }; $3 = 0; if (!$2_1) { break block } if (HEAP32[$2_1 + 12 >> 2]) { return $2_1 } $3 = $852($0_1, HEAPU8[HEAP32[$0_1 >> 2] + 84 | 0], $2_1, HEAP32[$2_1 >> 2]) ? $2_1 : 0; } return $3; } function $852($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; block2 : { block1 : { if (!$2_1) { $2_1 = $414($5_1, $1_1, $3, 0); if (!$2_1) { break block1 } } if (HEAP32[$2_1 + 12 >> 2]) { break block2 } } block4 : { if (HEAP32[$5_1 + 276 >> 2]) { $2_1 = $116($5_1, $3); if (!$2_1) { break block4 } FUNCTION_TABLE[HEAP32[$5_1 + 276 >> 2]](HEAP32[$5_1 + 284 >> 2], $5_1, $1_1, $2_1); $13($5_1, $2_1); } if (!HEAP32[$5_1 + 280 >> 2]) { break block4 } $2_1 = $134($5_1); $137($2_1, $3, 0); $4_1 = $208($2_1, 2); if ($4_1) { FUNCTION_TABLE[HEAP32[$5_1 + 280 >> 2]](HEAP32[$5_1 + 284 >> 2], $5_1, HEAPU8[$5_1 + 84 | 0], $4_1) } $200($2_1); } $2_1 = 0; block7 : { block6 : { $4_1 = $414($5_1, $1_1, $3, 0); if (!$4_1) { break block6 } if (HEAP32[$4_1 + 12 >> 2]) { break block7 } $8_1 = HEAP32[$4_1 >> 2]; $1_1 = 0; while (1) { if (($1_1 | 0) == 3) { break block6 } $6_1 = $1_1 + 36644 | 0; $1_1 = $1_1 + 1 | 0; $6_1 = $414($5_1, HEAPU8[$6_1 | 0], $8_1, 0); if (!HEAP32[$6_1 + 12 >> 2]) { continue } break; }; $0_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$4_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$4_1 + 4 >> 2] = $0_1; $1_1 = $6_1 + 8 | 0; $2_1 = HEAP32[$1_1 + 4 >> 2]; $0_1 = $4_1 + 8 | 0; HEAP32[$0_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = $2_1; HEAP32[$4_1 + 16 >> 2] = 0; break block7; } HEAP32[$7_1 >> 2] = $3; $257($0_1, 8578, $7_1); HEAP32[$0_1 + 12 >> 2] = 257; break block2; } $2_1 = $4_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $853($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $2_1; $3 = 67; $2_1 = 0; block7 : { block8 : { block10 : { block9 : { label : while (1) { $7_1 = $3 - 67 | 0; while (1) { block6 : { $6_1 = HEAPU8[$0_1 | 0]; if ($6_1) { $0_1 = $0_1 + 1 | 0; block4 : { $4_1 = HEAPU8[$6_1 + 31040 | 0] | $4_1 << 8; if (($4_1 | 0) != 1651273570) { if (($4_1 | 0) == 1667785074) { $3 = 66; $2_1 = $0_1; continue label; } if (($4_1 | 0) != 1952807028 & ($4_1 | 0) != 1668050786) { break block4 } $3 = 66; continue label; } block5 : { switch ($7_1 | 0) { case 0: case 2: break block5; default: break block4; }; } $2_1 = HEAPU8[$0_1 | 0] == 40 ? $0_1 : $2_1; $3 = 65; continue label; } if (($4_1 | 0) != 1919246700 & ($4_1 | 0) != 1718382433 & ($4_1 | 0) != 1685026146 | ($3 | 0) != 67) { break block6 } $3 = 69; continue label; } if (!$1_1) { break block7 } $0_1 = 0; HEAP32[$5_1 + 12 >> 2] = 0; if ($3 >>> 0 > 66) { break block8 } if ($2_1) { break block9 } $0_1 = 4; break block8; } if (($4_1 & 16777215) != 6909556) { continue } break; }; break; }; if ($1_1) { break block10 } $3 = 68; break block7; } while (1) { $6_1 = HEAPU8[$2_1 | 0]; if (!$6_1) { break block8 } if ($6_1 - 58 >>> 0 >= 4294967286) { $296($2_1, $5_1 + 12 | 0); $0_1 = HEAP32[$5_1 + 12 >> 2] / 4 | 0; break block8; } else { $2_1 = $2_1 + 1 | 0; continue; } }; } $0_1 = 0; $3 = 68; } HEAP8[$1_1 + 6 | 0] = (($0_1 | 0) >= 254 ? 254 : $0_1) + 1; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 << 24 >> 24; } function $854($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $0_1 = $325($0_1, (($2_1 | 0) / 2 | 0) + 1 | 0, 0); if ($0_1) { $5_1 = $2_1 - 1 | 0; $2_1 = 0; while (1) { if (!(($2_1 | 0) >= ($5_1 | 0))) { $3 = $1_1 + $2_1 | 0; $4_1 = HEAPU8[$3 + 1 | 0]; $3 = HEAPU8[$3 | 0]; HEAP8[($2_1 >>> 1 | 0) + $0_1 | 0] = $4_1 + ($4_1 << 1 << 24 >> 24 >>> 7 & 9) & 15 | ($3 << 1 << 24 >> 24 >>> 7 & 9) + $3 << 4; $2_1 = $2_1 + 2 | 0; continue; } break; }; HEAP8[($2_1 >>> 1 | 0) + $0_1 | 0] = 0; } return $0_1; } function $855($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[18950]; block1 : { if ($2_1) { if (FUNCTION_TABLE[$2_1 | 0](700) | 0) { break block1 } } $3 = $32($0_1, $1_1); } return $3; } function $856($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; if (!$1_1) { if (!(HEAP32[$0_1 + 132 >> 2] | HEAPU8[HEAP32[$0_1 >> 2] + 80 | 0] & 8)) { HEAP8[$0_1 + 23 | 0] = 1 } $1_1 = $311($0_1); } return $1_1; } function $857($0_1, $1_1) { return $835($0_1, $1_1, 0, 0, 0); } function $858($0_1, $1_1, $2_1) { return $835($0_1, $1_1, $2_1, 0, 0); } function $859($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0; $7_1 = $0_1; $0_1 = $835($0_1, $1_1, $2_1, $3, $4_1); $315($7_1, $0_1, $5_1, $6_1); return $0_1; } function $860($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$0_1 >> 2] + 95 | 0]) { $988($0_1, $2_1, HEAP32[$3 + 20 >> 2], ($4_1 | 0) == 113, HEAP32[$3 >> 2]) } if (!(HEAPU8[$3 + 28 | 0] & 128)) { $312($5_1, $4_1, $1_1, HEAP32[$3 + 20 >> 2], $2_1, HEAP16[$3 + 36 >> 1]); return; } $6_1 = $1_1; $1_1 = $359($3); $835($5_1, $4_1, $6_1, HEAP32[$1_1 + 44 >> 2], $2_1); $1097($0_1, $1_1); } function $861($0_1, $1_1, $2_1) { return $859($0_1, 118, 0, $1_1, 0, $2_1, 0); } function $862($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!HEAP32[$0_1 + 8 >> 2]) { break block } $4_1 = $1129($0_1, $1_1, $2_1); if (($4_1 | 0) == ($2_1 | 0)) { break block } $1_1 = $1063($1_1); block2 : { if ($1_1) { $3 = 80; if (HEAPU8[$1_1 + 6 | 0] & 64 | HEAPU8[$1_1 | 0] == 176) { break block2 } } $3 = 81; } $1_1 = $3; $326(HEAP32[$0_1 + 8 >> 2], $1_1, $4_1, $2_1); } } function $863($0_1, $1_1) { return $835($0_1, 9, 0, $1_1, 0); } function $864($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = HEAP32[$0_1 >> 2]; $7_1 = HEAP32[$6_1 + 364 >> 2]; block : { if (HEAPU8[$0_1 + 224 | 0] | (!$7_1 | HEAPU8[$6_1 + 177 | 0])) { break block } $5_1 = FUNCTION_TABLE[$7_1 | 0](HEAP32[$6_1 + 368 >> 2], $1_1, $2_1, $3, $4_1, HEAP32[$0_1 + 264 >> 2]) | 0; block2 : { if (($5_1 | 0) == 1) { $257($0_1, 15344, 0); HEAP32[$0_1 + 12 >> 2] = 23; break block2; } if (!($5_1 & -3)) { break block } $1223($0_1); } $5_1 = 1; } return $5_1; } function $865($0_1, $1_1, $2_1) { var $3 = 0; $2_1 = $875(HEAP32[$0_1 >> 2], $2_1); if ($2_1) { block2 : { $3 = $856($0_1); if ($3) { if (!$864($0_1, 32, HEAP32[($1_1 << 2) + 50664 >> 2], $2_1, 0)) { break block2 } } $13(HEAP32[$0_1 >> 2], $2_1); return; } $859($3, 0, $1_1, 0, 0, $2_1, -6); } } function $866($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $9_1 = global$0 - 32 | 0; $7_1 = $9_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; $8_1 = HEAP32[$0_1 >> 2]; block2 : { block1 : { if (!(!HEAPU8[$8_1 + 177 | 0] | HEAP32[$8_1 + 172 >> 2] != 1)) { $7_1 = HEAPU8[$8_1 + 176 | 0]; $2_1 = $116($8_1, ($7_1 | 0) == 1 ? 9304 : 9323); break block1; } $1_1 = $910($0_1, $1_1, $2_1, $9_1 + 28 | 0); if (($1_1 | 0) < 0) { break block2 } block4 : { if (!$3) { $7_1 = $1_1; break block4; } $7_1 = 1; if (!HEAP32[$2_1 + 4 >> 2] | ($1_1 | 0) == 1) { break block4 } $257($0_1, 16353, 0); break block2; } $1_1 = HEAP32[$9_1 + 28 >> 2]; $2_1 = $875($8_1, $1_1); if (HEAPU8[$0_1 + 224 | 0] < 2) { break block1 } $2_1 = $934($0_1, $2_1, $1_1); } $10_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$0_1 + 204 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 208 >> 2] = $10_1; if (!$2_1) { break block2 } block5 : { if ($896($0_1, $2_1, $4_1 ? 1856 : 14440, $2_1)) { break block5 } $3 = HEAPU8[$8_1 + 176 | 0] == 1 ? 1 : $3; $10_1 = HEAP32[HEAP32[$8_1 + 16 >> 2] + ($7_1 << 4) >> 2]; if ($864($0_1, 18, ($3 | 0) == 1 ? 9304 : 9323, 0, $10_1)) { break block5 } if (!$5_1) { if ($864($0_1, HEAPU8[($3 + ($4_1 << 1) | 0) + 50676 | 0], $2_1, 0, $10_1)) { break block5 } } block9 : { block7 : { if (HEAPU8[$0_1 + 224 | 0]) { break block7 } $3 = HEAP32[HEAP32[$8_1 + 16 >> 2] + ($7_1 << 4) >> 2]; if ($318($0_1)) { break block5 } $10_1 = $319($8_1, $2_1, $3); if ($10_1) { if ($6_1) { break block9 } $3 = HEAPU8[$10_1 + 43 | 0]; HEAP32[$9_1 + 20 >> 2] = $1_1; HEAP32[$9_1 + 16 >> 2] = ($3 | 0) == 2 ? 1856 : 14440; $257($0_1, 3803, $9_1 + 16 | 0); break block5; } if (!$778($8_1, $2_1, $3)) { break block7 } HEAP32[$9_1 >> 2] = $2_1; $257($0_1, 7174, $9_1); break block5; } $1_1 = $270($8_1, 64, 0); if (!$1_1) { HEAP32[$0_1 + 12 >> 2] = 7; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block5; } HEAP16[$1_1 + 32 >> 1] = 65535; HEAP32[$1_1 >> 2] = $2_1; $2_1 = HEAP32[(HEAP32[$8_1 + 16 >> 2] + ($7_1 << 4) | 0) + 12 >> 2]; HEAP16[$1_1 + 38 >> 1] = 200; HEAP32[$1_1 + 24 >> 2] = 1; HEAP32[$1_1 + 60 >> 2] = $2_1; HEAP32[$0_1 + 252 >> 2] = $1_1; if (HEAPU8[$8_1 + 177 | 0]) { break block2 } $1_1 = $856($0_1); if (!$1_1) { break block2 } $923($0_1, 1, $7_1); if ($5_1) { $857($1_1, 170) } $2_1 = HEAP32[$0_1 + 48 >> 2]; $3 = $2_1 + 2 | 0; HEAP32[$0_1 + 104 >> 2] = $3; $6_1 = $2_1 + 1 | 0; HEAP32[$0_1 + 100 >> 2] = $6_1; $2_1 = $2_1 + 3 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; $835($1_1, 99, $7_1, $2_1, 2); $314($1_1, $7_1); $10_1 = $858($1_1, 16, $2_1); $835($1_1, 100, $7_1, 2, HEAP32[$8_1 + 32 >> 2] & 2 ? 1 : 4); $835($1_1, 100, $7_1, 5, HEAPU8[$8_1 + 84 | 0]); $8_1 = 82740; HEAP32[(HEAPU8[HEAP32[$1_1 >> 2] + 87 | 0] ? $8_1 : HEAP32[$1_1 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = HEAP32[$1_1 + 108 >> 2]; block14 : { if ($4_1 | $5_1) { $326($1_1, 71, 0, $3); break block14; } HEAP32[$0_1 + 148 >> 2] = $835($1_1, 147, $7_1, $3, 1); } $3 = $856($0_1); $988($0_1, $7_1, 1, 1, 9323); $312($3, 113, 0, 1, $7_1, 5); if (!HEAP32[$0_1 + 44 >> 2]) { HEAP32[$0_1 + 44 >> 2] = 1 } $326($1_1, 127, 0, $6_1); $859($1_1, 77, 6, $2_1, 0, 50680, -1); $835($1_1, 128, 0, $2_1, $6_1); $0_1 = HEAP32[$1_1 + 108 >> 2]; if (($0_1 | 0) > 0) { HEAP16[(HEAP32[$1_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = 8 } $857($1_1, 122); break block2; } $917($0_1, $7_1); $928($0_1); } HEAP8[$0_1 + 17 | 0] = 1; $13($8_1, $2_1); } $0_1 = $9_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $867($0_1) { HEAP8[$0_1 + 24 | 0] = HEAPU8[$0_1 + 24 | 0] + 1; $0_1 = HEAP32[$0_1 >> 2]; HEAP16[$0_1 + 308 >> 1] = 0; HEAP32[$0_1 + 304 >> 2] = HEAP32[$0_1 + 304 >> 2] + 1; } function $868($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0; $10_1 = global$0 - 192 | 0; $5_1 = $10_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block : { if (!($2_1 | $4_1)) { break block } $6_1 = HEAP32[$0_1 + 252 >> 2]; if (!$6_1) { break block } $12_1 = HEAP32[$0_1 >> 2]; block3 : { block4 : { block5 : { if (!$4_1) { if ($922($12_1, HEAP32[$6_1 >> 2])) { HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | 4096 } $17_1 = $12_1 + 177 | 0; if (!HEAPU8[$12_1 + 177 | 0]) { break block3 } $5_1 = HEAP32[$12_1 + 172 >> 2]; if (!HEAPU8[$6_1 + 43 | 0]) { break block4 } if ($5_1) { break block5 } HEAP32[$6_1 + 20 >> 2] = 0; break block3; } if (HEAPU8[$12_1 + 177 | 0]) { break block5 } $17_1 = $12_1 + 177 | 0; break block3; } $257($0_1, 30822, 0); break block; } HEAP32[$6_1 + 20 >> 2] = $5_1; if (($5_1 | 0) != 1) { break block3 } HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | 1; } block6 : { if (!($3 & 65536)) { break block6 } HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | 65536; $5_1 = 0; while (1) { if (HEAP16[$6_1 + 34 >> 1] <= ($5_1 | 0)) { break block6 } $9_1 = HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0; $7_1 = HEAPU8[$9_1 + 4 | 0]; if ($7_1 >>> 0 <= 15) { $1_1 = HEAP32[$9_1 >> 2]; $2_1 = HEAP32[$6_1 >> 2]; if (HEAPU8[$9_1 + 10 | 0] & 4) { HEAP32[$10_1 + 152 >> 2] = $418($9_1, 30822); HEAP32[$10_1 + 148 >> 2] = $1_1; HEAP32[$10_1 + 144 >> 2] = $2_1; $257($0_1, 29867, $10_1 + 144 | 0); break block; } HEAP32[$10_1 + 132 >> 2] = $1_1; HEAP32[$10_1 + 128 >> 2] = $2_1; $257($0_1, 6197, $10_1 + 128 | 0); break block; } if (($7_1 & 240) == 16) { HEAP8[$9_1 + 5 | 0] = 65 } if (!($7_1 & 15 | (!(HEAP8[$9_1 + 10 | 0] & 1) | HEAP16[$6_1 + 32 >> 1] == ($5_1 | 0)))) { HEAP8[$9_1 + 4 | 0] = $7_1 | 2; HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | 2048; } $5_1 = $5_1 + 1 | 0; continue; }; } block11 : { if (!($3 & 128)) { break block11 } $5_1 = HEAP32[$6_1 + 28 >> 2]; if ($5_1 & 8) { $257($0_1, 5753, 0); break block; } if (!($5_1 & 4)) { HEAP32[$10_1 + 112 >> 2] = HEAP32[$6_1 >> 2]; $257($0_1, 7018, $10_1 + 112 | 0); break block; } HEAP32[$6_1 + 28 >> 2] = $5_1 | 640; $9_1 = HEAP32[$0_1 + 8 >> 2]; $14 = HEAP32[$0_1 >> 2]; if (!(HEAPU8[$14 + 178 | 0] & 2)) { $5_1 = 0; while (1) { if (!(HEAP16[$6_1 + 34 >> 1] <= ($5_1 | 0))) { $7_1 = HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0; block16 : { if (!(HEAP8[$7_1 + 10 | 0] & 1)) { break block16 } $8_1 = HEAPU8[$7_1 + 4 | 0]; if ($8_1 & 15) { break block16 } HEAP8[$7_1 + 4 | 0] = $8_1 | 2; } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | 2048; } $7_1 = HEAP32[$0_1 + 148 >> 2]; if ($7_1) { $5_1 = 82740; HEAP32[(HEAPU8[HEAP32[$9_1 >> 2] + 87 | 0] ? $5_1 : HEAP32[$9_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 12 >> 2] = 2; } $5_1 = HEAP16[$6_1 + 32 >> 1]; block23 : { if (($5_1 | 0) >= 0) { $5_1 = HEAP32[HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) >> 2]; HEAP32[$10_1 + 164 >> 2] = $5_1; HEAP32[$10_1 + 168 >> 2] = $48($5_1); $5_1 = $951($14, 60, $10_1 + 164 | 0, 0); block22 : { $5_1 = $935(HEAP32[$0_1 >> 2], $5_1); if ($5_1) { if (HEAPU8[$0_1 + 224 | 0] >= 2) { $918($0_1, HEAP32[$5_1 + 8 >> 2], $6_1 + 32 | 0) } HEAP8[$5_1 + 16 | 0] = HEAPU8[$0_1 + 222 | 0]; HEAP16[$6_1 + 32 >> 1] = 65535; $933($0_1, 0, 0, 0, $5_1, HEAPU8[$6_1 + 42 | 0], 0, 0, 0, 0, 2); if (!HEAP32[$0_1 + 40 >> 2]) { break block22 } } HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] & -129; break block11; } $7_1 = $359($6_1); break block23; } $7_1 = $359($6_1); $5_1 = 1; $8_1 = 1; while (1) { if (!(HEAPU16[$7_1 + 50 >> 1] <= $5_1 >>> 0)) { block26 : { if ($989($7_1, $8_1, $7_1, $5_1)) { HEAP16[$7_1 + 52 >> 1] = HEAPU16[$7_1 + 52 >> 1] - 1; break block26; } $11_1 = HEAP32[$7_1 + 32 >> 2]; HEAP32[$11_1 + ($8_1 << 2) >> 2] = HEAP32[$11_1 + ($5_1 << 2) >> 2]; $11_1 = HEAP32[$7_1 + 28 >> 2]; HEAP8[$11_1 + $8_1 | 0] = HEAPU8[$5_1 + $11_1 | 0]; $11_1 = HEAP32[$7_1 + 4 >> 2]; HEAP16[$11_1 + ($8_1 << 1) >> 1] = HEAPU16[$11_1 + ($5_1 << 1) >> 1]; $8_1 = $8_1 + 1 | 0; } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP16[$7_1 + 50 >> 1] = $8_1; } $5_1 = HEAPU8[$7_1 + 55 | 0] | HEAPU8[$7_1 + 56 | 0] << 8; $8_1 = $5_1 | 32; HEAP8[$7_1 + 55 | 0] = $8_1; HEAP8[$7_1 + 56 | 0] = $8_1 >>> 8; if (!(HEAPU8[$14 + 178 | 0] & 2)) { $5_1 = $5_1 | 40; HEAP8[$7_1 + 55 | 0] = $5_1; HEAP8[$7_1 + 56 | 0] = $5_1 >>> 8; } $11_1 = HEAPU16[$7_1 + 50 >> 1]; HEAP16[$7_1 + 52 >> 1] = $11_1; block28 : { if (!$9_1) { break block28 } $8_1 = HEAP32[$7_1 + 44 >> 2]; if (!$8_1) { break block28 } $5_1 = 82740; HEAP8[(HEAPU8[HEAP32[$9_1 >> 2] + 87 | 0] ? $5_1 : HEAP32[$9_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) | 0] = 9; } HEAP32[$7_1 + 44 >> 2] = HEAP32[$6_1 + 20 >> 2]; $5_1 = $6_1 + 8 | 0; while (1) { block33 : { block31 : { $5_1 = HEAP32[$5_1 >> 2]; if (!$5_1) { $5_1 = 0; $9_1 = HEAP16[$6_1 + 34 >> 1]; $8_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $9_1 = 0; while (1) { if (($5_1 | 0) == ($8_1 | 0)) { break block31 } if (!$990(HEAP32[$7_1 + 4 >> 2], $11_1, $5_1)) { $9_1 = !(HEAPU8[(HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) + 10 | 0] & 32) + $9_1 | 0 } $5_1 = $5_1 + 1 | 0; continue; }; } if (((HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8) & 3) == 2) { break block33 } $8_1 = 0; $9_1 = 0; while (1) { if (!(($8_1 | 0) == ($11_1 | 0))) { $9_1 = ($989($5_1, HEAPU16[$5_1 + 50 >> 1], $7_1, $8_1) ^ 1) + $9_1 | 0; $8_1 = $8_1 + 1 | 0; continue; } break; }; $8_1 = HEAPU16[$5_1 + 50 >> 1]; if (!$9_1) { HEAP16[$5_1 + 52 >> 1] = $8_1; break block33; } if ($991($14, $5_1, $8_1 + $9_1 | 0)) { break block11 } $9_1 = HEAPU16[$5_1 + 50 >> 1]; $8_1 = 0; while (1) { if (($8_1 | 0) == ($11_1 | 0)) { break block33 } if (!$989($5_1, HEAPU16[$5_1 + 50 >> 1], $7_1, $8_1)) { HEAP16[HEAP32[$5_1 + 4 >> 2] + ($9_1 << 1) >> 1] = HEAPU16[HEAP32[$7_1 + 4 >> 2] + ($8_1 << 1) >> 1]; HEAP32[HEAP32[$5_1 + 32 >> 2] + ($9_1 << 2) >> 2] = HEAP32[HEAP32[$7_1 + 32 >> 2] + ($8_1 << 2) >> 2]; if (HEAPU8[HEAP32[$7_1 + 28 >> 2] + $8_1 | 0]) { $13_1 = HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8 | 1024; HEAP8[$5_1 + 55 | 0] = $13_1; HEAP8[$5_1 + 56 | 0] = $13_1 >>> 8; } $9_1 = $9_1 + 1 | 0; } $8_1 = $8_1 + 1 | 0; continue; }; } if ($991($14, $7_1, $9_1 + $11_1 | 0)) { break block11 } $5_1 = 0; while (1) { if (!(HEAP16[$6_1 + 34 >> 1] <= ($5_1 | 0))) { $9_1 = HEAP32[$7_1 + 4 >> 2]; if (!($990($9_1, $11_1, $5_1) | HEAPU8[(HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) + 10 | 0] & 32)) { HEAP16[$9_1 + ($11_1 << 1) >> 1] = $5_1; HEAP32[HEAP32[$7_1 + 32 >> 2] + ($11_1 << 2) >> 2] = 33712; $11_1 = $11_1 + 1 | 0; } $5_1 = $5_1 + 1 | 0; continue; } break; }; $992($7_1); break block11; } $5_1 = $5_1 + 20 | 0; continue; }; } $14 = $309($12_1, HEAP32[$6_1 + 60 >> 2]); $5_1 = HEAP32[$6_1 + 16 >> 2]; block40 : { if (!$5_1) { break block40 } $993($0_1, $6_1, 4, 0, $5_1); if (!HEAP32[$0_1 + 40 >> 2]) { break block40 } $358($12_1, HEAP32[$6_1 + 16 >> 2]); HEAP32[$6_1 + 16 >> 2] = 0; } block42 : { if (!(HEAPU8[$6_1 + 28 | 0] & 96)) { $5_1 = HEAP16[$6_1 + 34 >> 1]; break block42; } $9_1 = 0; $8_1 = 0; while (1) { $5_1 = HEAP16[$6_1 + 34 >> 1]; if (!(($8_1 | 0) >= ($5_1 | 0))) { $5_1 = Math_imul($8_1, 12); $7_1 = $5_1 + HEAP32[$6_1 + 4 >> 2] | 0; block45 : { if (HEAPU8[$7_1 + 10 | 0] & 96) { if (!$993($0_1, $6_1, 8, $891($6_1, $7_1), 0)) { break block45 } $994($0_1, $6_1, $5_1 + HEAP32[$6_1 + 4 >> 2] | 0, $951($12_1, 122, 0, 0)); break block45; } $9_1 = $9_1 + 1 | 0; } $8_1 = $8_1 + 1 | 0; continue; } break; }; if ($9_1) { break block42 } $257($0_1, 11129, 0); break block; } $8_1 = HEAP32[$6_1 + 4 >> 2]; $7_1 = 0; while (1) { if (!(($5_1 | 0) <= 0)) { $5_1 = $5_1 - 1 | 0; $7_1 = HEAPU8[$8_1 + 6 | 0] + $7_1 | 0; $8_1 = $8_1 + 12 | 0; continue; } break; }; HEAP16[$6_1 + 40 >> 1] = $433((HEAPU16[$6_1 + 32 >> 1] >>> 15 | 0) + $7_1 << 2, 0); $5_1 = $6_1 + 8 | 0; while (1) { $5_1 = HEAP32[$5_1 >> 2]; if ($5_1) { $995($5_1); $5_1 = $5_1 + 20 | 0; continue; } break; }; block62 : { if (!HEAPU8[$17_1 | 0]) { $11_1 = $856($0_1); if (!$11_1) { break block } $858($11_1, 122, 0); $19_1 = HEAPU8[$6_1 + 43 | 0]; block56 : { if ($4_1) { if (HEAPU8[$0_1 + 224 | 0]) { HEAP32[$0_1 + 12 >> 2] = 1; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block; } $5_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $5_1 + 1; $7_1 = HEAP32[$0_1 + 48 >> 2]; $13_1 = $7_1 + 3 | 0; HEAP32[$0_1 + 48 >> 2] = $13_1; $3 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($3 ? $3 : $0_1) + 21 | 0] = 1; $835($11_1, 113, $5_1, HEAP32[$0_1 + 104 >> 2], $14); $9_1 = $7_1 + 1 | 0; $8_1 = HEAP32[$11_1 + 108 >> 2]; if (($8_1 | 0) > 0) { HEAP16[(HEAP32[$11_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) - 18 >> 1] = 16 } $835($11_1, 11, $9_1, 0, $8_1 + 1 | 0); if (HEAP32[$0_1 + 40 >> 2]) { break block } $3 = $996($0_1, $4_1, 65); if (!$3) { break block } $15_1 = HEAPU16[$3 + 34 >> 1]; HEAP16[$6_1 + 34 >> 1] = $15_1; HEAP16[$6_1 + 36 >> 1] = $15_1; HEAP32[$6_1 + 4 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = 0; HEAP16[$3 + 34 >> 1] = 0; $6($12_1, $3); $3 = $10_1 + 180 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$10_1 + 172 >> 2] = 0; HEAP32[$10_1 + 176 >> 2] = 0; HEAP32[$10_1 + 168 >> 2] = $9_1; HEAP8[$10_1 + 164 | 0] = 13; $974($0_1, $4_1, $10_1 + 164 | 0); if (HEAP32[$0_1 + 40 >> 2]) { break block } $15_1 = $7_1 + 2 | 0; $997($11_1, $9_1); $9_1 = HEAP32[$11_1 + 108 >> 2]; $7_1 = 82740; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$11_1 >> 2] + 87 | 0] ? $3 : HEAP32[$11_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $9_1; $9_1 = $858($11_1, 12, HEAP32[$10_1 + 168 >> 2]); $835($11_1, 97, HEAP32[$10_1 + 176 >> 2], HEAP32[$10_1 + 180 >> 2], $15_1); $3 = 0; $998($11_1, $6_1, 0); $326($11_1, 127, $5_1, $13_1); $835($11_1, 128, $5_1, $15_1, $13_1); $863($11_1, $9_1); $8_1 = HEAP32[$11_1 + 108 >> 2]; HEAP32[(HEAPU8[HEAP32[$11_1 >> 2] + 87 | 0] ? $7_1 : HEAP32[$11_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $8_1; $858($11_1, 122, $5_1); $5_1 = HEAP16[$6_1 + 34 >> 1]; $9_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; $8_1 = 0; while (1) { if (!(($8_1 | 0) == ($9_1 | 0))) { $8_1 = $8_1 + 1 | 0; $3 = ($999(HEAP32[$7_1 >> 2]) + $3 | 0) + 5 | 0; $7_1 = $7_1 + 12 | 0; continue; } break; }; $9_1 = Math_imul($5_1, 6); $5_1 = $999(HEAP32[$6_1 >> 2]) + $3 | 0; $18_1 = ($9_1 + $5_1 | 0) + 35 | 0; $3 = $18_1; $15_1 = $30($3, $3 >> 31); if (!$15_1) { $106($12_1); break block56; } $3 = ($5_1 | 0) < 50; $21_1 = $3 ? 27781 : 27780; $9_1 = $3 ? 25087 : 30788; $13_1 = $63($18_1, $15_1, 30637, 0); HEAP32[$10_1 + 164 >> 2] = $48($13_1); $1000($13_1, $10_1 + 164 | 0, HEAP32[$6_1 >> 2]); $7_1 = HEAP32[$10_1 + 164 >> 2]; HEAP8[$7_1 + $13_1 | 0] = 40; $5_1 = $3 ? 30822 : 30789; $8_1 = $7_1 + 1 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; $3 = 0; while (1) { block57 : { $16_1 = $8_1 + $13_1 | 0; $20_1 = $18_1 - $8_1 | 0; if (HEAP16[$6_1 + 34 >> 1] <= ($3 | 0)) { break block57 } HEAP32[$10_1 + 164 >> 2] = $48($63($20_1, $16_1, $5_1, 0)) + $8_1; $1000($13_1, $10_1 + 164 | 0, HEAP32[$7_1 >> 2]); $5_1 = HEAP32[$10_1 + 164 >> 2]; $16_1 = HEAP32[(HEAP8[$7_1 + 5 | 0] << 2) + 50652 >> 2]; $8_1 = $48($16_1); if ($8_1) { wasm2js_memory_copy($5_1 + $13_1 | 0, $16_1, $8_1) } $8_1 = $5_1 + $8_1 | 0; HEAP32[$10_1 + 164 >> 2] = $8_1; $7_1 = $7_1 + 12 | 0; $3 = $3 + 1 | 0; $5_1 = $9_1; continue; } break; }; HEAP32[$10_1 + 96 >> 2] = $21_1; $63($20_1, $16_1, 8932, $10_1 + 96 | 0); break block56; } $5_1 = $19_1 ? 18826 : 20483; $3 = $3 ? $0_1 + 212 | 0 : $2_1; $9_1 = HEAP32[$3 >> 2]; $7_1 = HEAP32[$0_1 + 204 >> 2]; $8_1 = $9_1 - $7_1 | 0; $8_1 = HEAPU8[$9_1 | 0] != 59 ? HEAP32[$3 + 4 >> 2] + $8_1 | 0 : $8_1; HEAP32[$10_1 + 88 >> 2] = $7_1; HEAP32[$10_1 + 84 >> 2] = $8_1; HEAP32[$10_1 + 80 >> 2] = $5_1; $15_1 = $310($12_1, 6006, $10_1 + 80 | 0); } $5_1 = HEAP32[HEAP32[$12_1 + 16 >> 2] + ($14 << 4) >> 2]; $3 = HEAP32[$6_1 >> 2]; $9_1 = HEAP32[$0_1 + 104 >> 2]; HEAP32[$10_1 + 72 >> 2] = HEAP32[$0_1 + 100 >> 2]; HEAP32[$10_1 + 68 >> 2] = $15_1; HEAP32[$10_1 - -64 >> 2] = $9_1; HEAP32[$10_1 + 60 >> 2] = $3; HEAP32[$10_1 + 56 >> 2] = $3; HEAP32[$10_1 + 52 >> 2] = $19_1 ? 1856 : 14440; HEAP32[$10_1 + 48 >> 2] = $5_1; $884($0_1, 16908, $10_1 + 48 | 0); $10($12_1, $15_1); $924($0_1, $14); block60 : { if (HEAPU8[$0_1 + 224 | 0] | !(HEAPU8[$6_1 + 28 | 0] & 8)) { break block60 } $3 = HEAP32[$12_1 + 16 >> 2] + ($14 << 4) | 0; if (HEAP32[HEAP32[$3 + 12 >> 2] + 72 >> 2]) { break block60 } HEAP32[$10_1 + 32 >> 2] = HEAP32[$3 >> 2]; $884($0_1, 25488, $10_1 + 32 | 0); } HEAP32[$10_1 + 16 >> 2] = HEAP32[$6_1 >> 2]; $925($11_1, $14, $310($12_1, 28292, $10_1 + 16 | 0), 0); if (HEAPU8[$6_1 + 28 | 0] & 96) { $3 = HEAP32[HEAP32[$12_1 + 16 >> 2] + ($14 << 4) >> 2]; HEAP32[$10_1 + 4 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$10_1 >> 2] = $3; $859($11_1, 148, 1, 0, 0, $310($12_1, 29287, $10_1), -6); } if (!HEAPU8[$17_1 | 0]) { break block62 } } if ($395(HEAP32[$6_1 + 60 >> 2] + 8 | 0, HEAP32[$6_1 >> 2], $6_1)) { $106($12_1); break block; } HEAP32[$0_1 + 252 >> 2] = 0; HEAP32[$12_1 + 24 >> 2] = HEAP32[$12_1 + 24 >> 2] | 1; if ($2073(HEAP32[$6_1 >> 2], 14830)) { break block62 } HEAP32[HEAP32[$6_1 + 60 >> 2] + 72 >> 2] = $6_1; } if (HEAPU8[$6_1 + 43 | 0] | $4_1) { break block } HEAP32[$6_1 + 44 >> 2] = (HEAP32[(HEAP32[$1_1 >> 2] ? $1_1 : $2_1) >> 2] - HEAP32[$0_1 + 204 >> 2] | 0) + 13; } $0_1 = $10_1 + 192 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $869($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { $2_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1 >>> 0 < 2) { break block } $3 = HEAP32[$0_1 >> 2]; if (HEAP8[HEAPU8[$3 | 0] + 31424 | 0] >= 0) { break block } $4_1 = $2_1 - 1 | 0; $1_1 = 1; while (1) { if (($1_1 | 0) != ($4_1 | 0)) { $5_1 = $1_1 + $3 | 0; $1_1 = $1_1 + 1 | 0; if (HEAP8[HEAPU8[$5_1 | 0] + 31424 | 0] >= 0) { continue } break block; } break; }; HEAP32[$0_1 >> 2] = $3 + 1; HEAP32[$0_1 + 4 >> 2] = $2_1 - 2; } } function $870($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$2_1 + 4 >> 2]; $3 = $325(HEAP32[$0_1 >> 2], $4_1 + 53 | 0, 0); block : { if (!$3) { break block } HEAP32[$3 + 4 >> 2] = 8388608; HEAP8[$3 | 0] = $1_1; HEAP32[$3 + 40 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 44 >> 2] = 0; HEAP32[$3 + 48 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP16[$3 + 32 >> 1] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; $1_1 = $3 + 52 | 0; HEAP32[$3 + 8 >> 2] = $1_1; $5_1 = HEAP32[$2_1 >> 2]; if ($4_1) { wasm2js_memory_copy($1_1, $5_1, $4_1) } HEAP8[$1_1 + $4_1 | 0] = 0; HEAP32[$3 + 36 >> 2] = $5_1 - HEAP32[$0_1 + 248 >> 2]; if (HEAP8[HEAPU8[$3 + 52 | 0] + 31424 | 0] < 0) { $1004($3) } HEAP32[$3 + 24 >> 2] = 1; if (HEAPU8[$0_1 + 224 | 0] < 2) { break block } $934($0_1, $3, $2_1); } return $3; } function $871($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0; block3 : { block1 : { if (($2_1 | 0) == 86 & ($4_1 | 0) == 89) { break block1 } block2 : { if (($2_1 | 0) != 87) { break block2 } switch ($4_1 - 86 | 0) { case 0: case 3: break block1; default: break block2; }; } $7_1 = $270(HEAP32[$0_1 >> 2], 100, 0); if (!$7_1) { break block3 } $8_1 = !$1_1; HEAP8[$7_1 + 18 | 0] = $4_1; HEAP8[$7_1 + 17 | 0] = $2_1; HEAP8[$7_1 + 16 | 0] = $1_1 ? $1_1 : 90; if (!$6_1) { $6_1 = HEAP32[HEAP32[$0_1 >> 2] + 80 >> 2] << 30 >> 31 & 67 } HEAP8[$7_1 + 19 | 0] = $8_1; HEAP8[$7_1 + 20 | 0] = $6_1; HEAP32[$7_1 + 28 >> 2] = $1163($0_1, $5_1); HEAP32[$7_1 + 24 >> 2] = $1163($0_1, $3); return $7_1; } $257($0_1, 10860, 0); } $11(HEAP32[$0_1 >> 2], $5_1); $11(HEAP32[$0_1 >> 2], $3); return 0; } function $872($0_1, $1_1, $2_1, $3, $4_1) { block1 : { if ($1_1) { HEAP32[$1_1 + 12 >> 2] = $3; HEAP32[$1_1 + 8 >> 2] = $2_1; if (!$4_1) { break block1 } HEAP32[$1_1 + 4 >> 2] = $299(HEAP32[$0_1 >> 2], HEAP32[$4_1 >> 2], HEAP32[$4_1 + 4 >> 2], 0); return $1_1; } $358(HEAP32[$0_1 >> 2], $2_1); $358(HEAP32[$0_1 >> 2], $3); } return $1_1; } function $873($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$1_1 + 4 >> 2]; block : { if (!$4_1) { break block } $5_1 = HEAP32[$0_1 >> 2]; $2_1 = $1162($0_1, $2_1, $4_1); if (!$2_1) { break block } block4 : { $4_1 = 13489; block2 : { if (HEAP32[$1_1 + 8 >> 2]) { break block2 } $4_1 = 13414; if (!(!HEAP32[$2_1 + 12 >> 2] | !HEAP32[$1_1 + 12 >> 2])) { break block2 } if (HEAPU8[$2_1 + 19 | 0]) { break block4 } $4_1 = 10872; } $2_1 = $4_1; HEAP32[$3 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 >> 2] = $2_1; $257($0_1, 7564, $3); break block; } HEAP32[$1_1 + 8 >> 2] = $887($5_1, HEAP32[$2_1 + 8 >> 2], 0); $0_1 = HEAP32[$2_1 + 12 >> 2]; if ($0_1) { HEAP32[$1_1 + 12 >> 2] = $887($5_1, $0_1, 0) } $10($5_1, HEAP32[$1_1 + 4 >> 2]); HEAP32[$1_1 + 4 >> 2] = 0; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $874($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = global$0 - 16 | 0; $3 = $7_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if ($2_1) { $6_1 = HEAP32[$0_1 >> 2]; block5 : { block4 : { block2 : { block1 : { if (!$1_1) { break block1 } $4_1 = HEAP32[$2_1 >> 2]; if (!$4_1) { break block1 } $8_1 = $1_1 + 12 | 0; $3 = 0; while (1) { $5_1 = HEAP32[$1_1 >> 2]; if (($5_1 | 0) <= ($3 | 0)) { break block2 } if (!$67($4_1, HEAP32[Math_imul($3, 24) + $8_1 >> 2])) { HEAP32[$7_1 >> 2] = $4_1; $257($0_1, 8376, $7_1); } $3 = $3 + 1 | 0; continue; }; } if (!$1_1) { break block4 } $5_1 = HEAP32[$1_1 >> 2]; } $3 = $55($6_1, $1_1, Math_imul($5_1, 24) + 36 | 0, 0); break block5; } $3 = $270($6_1, 36, 0); } block7 : { if (HEAPU8[$6_1 + 87 | 0]) { $797($6_1, $2_1); break block7; } $0_1 = HEAP32[$3 >> 2]; HEAP32[$3 >> 2] = $0_1 + 1; $4_1 = $2_1 + 16 | 0; $5_1 = HEAP32[$4_1 + 4 >> 2]; $0_1 = Math_imul($0_1, 24) + $3 | 0; $1_1 = $0_1 + 28 | 0; HEAP32[$1_1 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; $4_1 = $2_1 + 8 | 0; $5_1 = HEAP32[$4_1 + 4 >> 2]; $1_1 = $0_1 + 20 | 0; HEAP32[$1_1 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; $1_1 = HEAP32[$2_1 + 4 >> 2]; $0_1 = $0_1 + 12 | 0; HEAP32[$0_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = $1_1; $1_1 = $3; } $13($6_1, $2_1); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $875($0_1, $1_1) { if (!$1_1) { return 0 } $0_1 = $299($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], 0); $300($0_1); return $0_1; } function $876($0_1, $1_1) { var $2_1 = 0; block : { if (!$1_1) { break block } $1_1 = $1016($0_1, 38, $1_1); if (!$1_1) { break block } if (!HEAP32[$0_1 + 40 >> 2]) { HEAP32[$1_1 + 8 >> 2] = HEAP32[$0_1 + 280 >> 2]; HEAP32[$0_1 + 280 >> 2] = $1_1; } $2_1 = $1_1; } return $2_1; } function $877($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; block : { $1_1 = HEAP32[$0_1 + 268 >> 2]; if (!$1_1) { break block } $2_1 = HEAP32[$0_1 + 252 >> 2]; if (!$2_1) { break block } $3 = $0_1; $4_1 = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$0_1 + 272 >> 2]; $323($3, $2_1, $299($4_1, $1_1, $0_1, $0_1 >> 31)); } } function $878($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $2_1 = global$0 + -64 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[$0_1 + 252 >> 2]; block : { if (!$4_1) { break block } $5_1 = HEAP32[$0_1 >> 2]; $877($0_1); HEAP32[$0_1 + 268 >> 2] = 0; if (HEAP32[$4_1 + 44 >> 2] <= 0) { break block } if (!HEAPU8[$5_1 + 177 | 0]) { $3 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($3 ? $3 : $0_1) + 21 | 0] = 1; if ($1_1) { HEAP32[$0_1 + 208 >> 2] = HEAP32[$1_1 + 4 >> 2] + (HEAP32[$1_1 >> 2] - HEAP32[$0_1 + 204 >> 2] | 0) } HEAP32[$2_1 + 48 >> 2] = $0_1 + 204; $3 = $310($5_1, 19178, $2_1 + 48 | 0); $1_1 = HEAP32[$5_1 + 16 >> 2]; $6_1 = $309($5_1, HEAP32[$4_1 + 60 >> 2]); $7_1 = HEAP32[$1_1 + ($6_1 << 4) >> 2]; $1_1 = HEAP32[$4_1 >> 2]; HEAP32[$2_1 + 32 >> 2] = HEAP32[$0_1 + 100 >> 2]; HEAP32[$2_1 + 28 >> 2] = $3; HEAP32[$2_1 + 24 >> 2] = $1_1; HEAP32[$2_1 + 20 >> 2] = $1_1; HEAP32[$2_1 + 16 >> 2] = $7_1; $884($0_1, 17006, $2_1 + 16 | 0); $1_1 = $856($0_1); $924($0_1, $6_1); $857($1_1, 166); $7_1 = HEAP32[$4_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $3; HEAP32[$2_1 >> 2] = $7_1; $925($1_1, $6_1, $310($5_1, 19698, $2_1), 0); $10($5_1, $3); $3 = $0_1; $0_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$3 + 48 >> 2] = $0_1; $861($1_1, $0_1, HEAP32[$4_1 >> 2]); $326($1_1, 171, $6_1, $0_1); break block; } $9_1 = HEAP32[$4_1 >> 2]; $10_1 = HEAP32[$4_1 + 60 >> 2]; block3 : { $6_1 = $320($5_1 + 388 | 0, HEAP32[HEAP32[$4_1 + 48 >> 2] >> 2]); if (!$6_1) { break block3 } $1_1 = HEAP32[$6_1 >> 2]; if (!$1_1 | HEAP32[$1_1 >> 2] < 3 | !HEAP32[$1_1 + 92 >> 2]) { break block3 } $7_1 = $48(HEAP32[$4_1 >> 2]); $1_1 = HEAP32[$4_1 + 60 >> 2] + 16 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block3 } $3 = HEAP32[$1_1 + 8 >> 2]; if (HEAPU8[$3 + 43 | 0] | HEAPU8[$3 + 29 | 0] & 16) { continue } $8_1 = HEAP32[$3 >> 2]; if ($68($8_1, HEAP32[$4_1 >> 2], $7_1)) { continue } $8_1 = $7_1 + $8_1 | 0; if (HEAPU8[$8_1 | 0] != 95) { continue } if (!(FUNCTION_TABLE[HEAP32[HEAP32[$6_1 >> 2] + 92 >> 2]]($8_1 + 1 | 0) | 0)) { continue } HEAP32[$3 + 28 >> 2] = HEAP32[$3 + 28 >> 2] | 4096; continue; }; } if ($395($10_1 + 8 | 0, $9_1, $4_1)) { $106($5_1); break block; } HEAP32[$0_1 + 252 >> 2] = 0; } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $879($0_1, $1_1, $2_1) { var $3 = 0; block1 : { if (HEAP8[$2_1 + 15 | 0] & 1) { $3 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$3 + 16 >> 2] + ($309($3, HEAP32[$2_1 + 44 >> 2]) << 4) | 0; break block1; } $3 = $2_1 + 44 | 0; } return $308($0_1, $1_1, HEAP32[$2_1 >> 2], HEAP32[$3 >> 2]); } function $880($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$1_1 >> 2]; block1 : { block : { if (!$68($3, 18315, 7)) { break block } $4_1 = HEAP32[$1_1 + 28 >> 2]; if ($4_1 & 32768) { break block } $1_1 = 0; if (!($4_1 & 4096)) { break block1 } if (!$916(HEAP32[$0_1 >> 2])) { break block1 } } HEAP32[$2_1 >> 2] = $3; $257($0_1, 15877, $2_1); $1_1 = 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $881($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAPU8[$1_1 + 43 | 0]; $4_1 = ($4_1 | 0) == 1 ? 14324 : ($4_1 | 0) == 2 ? 1856 : 0; if ($4_1) { HEAP32[$3 + 8 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$3 + 4 >> 2] = $4_1; HEAP32[$3 >> 2] = $2_1 ? 11540 : 12745; $257($0_1, 29503, $3); $5_1 = 1; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $882($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = global$0 - 48 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP8[$0_1 + 16 | 0] = 1; HEAP32[$5_1 + 32 >> 2] = $4_1; HEAP32[$5_1 + 28 >> 2] = $3; HEAP32[$5_1 + 24 >> 2] = $2_1; HEAP32[$5_1 + 20 >> 2] = $1_1; HEAP32[$5_1 + 16 >> 2] = $1_1; $884($0_1, 30258, $5_1 + 16 | 0); if (!$2_1) { HEAP32[$5_1 + 8 >> 2] = $4_1; HEAP32[$5_1 + 4 >> 2] = $3; HEAP32[$5_1 >> 2] = $1_1; $884($0_1, 30433, $5_1); } $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $883($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $1_1; $884($0_1, 28959, $3); if (!$2_1) { $884($0_1, 29106, 0) } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $884($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 80 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (HEAP32[$0_1 + 40 >> 2] | HEAPU8[$0_1 + 224 | 0]) { break block } $4_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$4_1 + 24 >> 2]; HEAP32[$3 + 76 >> 2] = $2_1; $1_1 = $135($4_1, $1_1, $2_1); if (!$1_1) { if (!HEAPU8[$4_1 + 87 | 0]) { HEAP32[$0_1 + 12 >> 2] = 18 } HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block; } HEAP8[$0_1 + 18 | 0] = HEAPU8[$0_1 + 18 | 0] + 1; $2_1 = $0_1 + 212 | 0; wasm2js_memory_copy($3, $2_1, 76); wasm2js_memory_fill($2_1, 0, 76); HEAP32[$4_1 + 24 >> 2] = HEAP32[$4_1 + 24 >> 2] | 2; $357($0_1, $1_1); HEAP32[$4_1 + 24 >> 2] = $5_1; $13($4_1, $1_1); wasm2js_memory_copy($2_1, $3, 76); HEAP8[$0_1 + 18 | 0] = HEAPU8[$0_1 + 18 | 0] - 1; } $0_1 = $3 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $885($0_1, $1_1, $2_1) { block : { if (!HEAP32[$0_1 + 8 >> 2]) { break block } $924($0_1, $1_1); $925(HEAP32[$0_1 + 8 >> 2], $1_1, 0, $2_1); if (($1_1 | 0) == 1) { break block } $925(HEAP32[$0_1 + 8 >> 2], 1, 0, $2_1); } } function $886($0_1) { var $1_1 = 0, $2_1 = 0; block : { if (!$0_1) { break block } while (1) { $1_1 = HEAPU8[$0_1 | 0]; if (!$1_1) { break block } $0_1 = $0_1 + 1 | 0; $2_1 = HEAPU8[$1_1 + 31040 | 0] + $2_1 | 0; continue; }; } return $2_1 & 255; } function $887($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; block : { if (!$1_1) { break block } $5_1 = $43($0_1, $1_1); $5_1 = $325($0_1, $5_1, $5_1 >> 31); if (!$5_1) { break block } $3 = HEAP32[$1_1 >> 2]; HEAP32[$5_1 >> 2] = $3; HEAP32[$5_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2]; $6_1 = $1_1 + 8 | 0; $4_1 = $5_1 + 8 | 0; while (1) { if (($3 | 0) <= ($10_1 | 0)) { $4_1 = $5_1 } else { $7_1 = HEAP32[$6_1 >> 2]; $8_1 = $906($0_1, $7_1, $2_1); HEAP32[$4_1 >> 2] = $8_1; if (!(!$8_1 | (!$7_1 | HEAPU8[$7_1 | 0] != 178))) { $3 = HEAP32[$8_1 + 16 >> 2]; block4 : { if ($3) { $11_1 = HEAP32[$7_1 + 16 >> 2]; $9_1 = $3; break block4; } $3 = HEAP32[$7_1 + 12 >> 2]; if (($3 | 0) == ($11_1 | 0)) { break block4 } $9_1 = $906($0_1, $3, $2_1); HEAP32[$8_1 + 16 >> 2] = $9_1; $11_1 = $3; } HEAP32[$8_1 + 12 >> 2] = $9_1; } HEAP32[$4_1 + 4 >> 2] = $116($0_1, HEAP32[$6_1 + 4 >> 2]); $3 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$4_1 + 8 >> 2] = $3; $3 = $3 >>> 8 & 65531; HEAP8[$4_1 + 9 | 0] = $3; HEAP8[$4_1 + 10 | 0] = $3 >>> 8; HEAP32[$4_1 + 12 >> 2] = HEAP32[$6_1 + 12 >> 2]; $6_1 = $6_1 + 16 | 0; $4_1 = $4_1 + 16 | 0; $10_1 = $10_1 + 1 | 0; $3 = HEAP32[$1_1 >> 2]; continue; } break; }; } return $4_1; } function $888($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = $886($1_1); $2_1 = HEAP16[$0_1 + 34 >> 1]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; while (1) { block1 : { if (($3 | 0) == ($2_1 | 0)) { $3 = -1; break block1; } if (($4_1 | 0) == HEAPU8[$0_1 + 7 | 0]) { if (!$67(HEAP32[$0_1 >> 2], $1_1)) { break block1 } } $3 = $3 + 1 | 0; $0_1 = $0_1 + 12 | 0; continue; } break; }; return $3; } function $889($0_1, $1_1) { var $2_1 = 0, $3 = 0; $3 = HEAPU16[$0_1 + 52 >> 1]; $1_1 = $1_1 & 65535; while (1) { block1 : { if (($2_1 | 0) == ($3 | 0)) { $2_1 = 65535; break block1; } if (($1_1 | 0) == HEAPU16[HEAP32[$0_1 + 4 >> 2] + ($2_1 << 1) >> 1]) { break block1 } $2_1 = $2_1 + 1 | 0; continue; } break; }; return $2_1 << 16 >> 16; } function $890($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = global$0 - 16 | 0; $5_1 = $7_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block2 : { if (!(HEAP16[$1_1 + 32 >> 1] != ($3 | 0) & ($3 | 0) >= 0)) { $326($0_1, 135, $2_1, $4_1); break block2; } $6_1 = 176; $5_1 = $3; block3 : { if (HEAPU8[$1_1 + 43 | 0] == 1) { break block3 } $5_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($3, 12) | 0; $6_1 = HEAPU16[$5_1 + 10 >> 1]; if ($6_1 & 32) { $0_1 = HEAP32[$0_1 + 12 >> 2]; if ($6_1 & 256) { HEAP32[$7_1 >> 2] = HEAP32[$5_1 >> 2]; $257($0_1, 29521, $7_1); break block2; } $3 = HEAP32[$0_1 + 56 >> 2]; HEAP16[$5_1 + 10 >> 1] = $6_1 | 256; HEAP32[$0_1 + 56 >> 2] = $2_1 + 1; $1166($0_1, $1_1, $5_1, $4_1); HEAP32[$0_1 + 56 >> 2] = $3; HEAP16[$5_1 + 10 >> 1] = HEAPU16[$5_1 + 10 >> 1] & 65279; break block2; } if (HEAPU8[$1_1 + 28 | 0] & 128) { $6_1 = 94; $5_1 = $889($359($1_1), $3 << 16 >> 16); break block3; } $6_1 = 94; $5_1 = $1111($1_1, $3 << 16 >> 16); } $835($0_1, $6_1, $2_1, $5_1, $4_1); $1151($0_1, $1_1, $3, $4_1); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $891($0_1, $1_1) { var $2_1 = 0; $1_1 = HEAPU16[$1_1 + 8 >> 1]; block : { if (HEAPU8[$0_1 + 43 | 0] | !$1_1) { break block } $0_1 = HEAP32[$0_1 + 52 >> 2]; if (!$0_1 | ($1_1 | 0) > HEAP32[$0_1 >> 2]) { break block } $2_1 = HEAP32[($0_1 + ($1_1 << 4) | 0) - 8 >> 2]; } return $2_1; } function $892($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$4_1 + 8 >> 2] = $2_1; HEAP32[$4_1 + 4 >> 2] = $1_1; HEAP32[$4_1 >> 2] = $3; $884($0_1, 29308, $4_1); $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $893($0_1) { var $1_1 = 0; $1_1 = HEAPU8[$0_1 + 19 | 0]; if (!$1_1) { $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$1_1 + 48 >> 2] = $0_1; return $0_1; } $1_1 = $1_1 - 1 | 0; HEAP8[$0_1 + 19 | 0] = $1_1; return HEAP32[((($1_1 & 255) << 2) + $0_1 | 0) + 168 >> 2]; } function $894($0_1, $1_1) { var $2_1 = 0; block : { if (!$1_1) { break block } $2_1 = HEAPU8[$0_1 + 19 | 0]; if ($2_1 >>> 0 > 7) { break block } HEAP8[$0_1 + 19 | 0] = $2_1 + 1; HEAP32[(($2_1 << 2) + $0_1 | 0) + 168 >> 2] = $1_1; } } function $895($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (HEAPU8[$1_1 + 43 | 0] != 1) { break block } $3 = HEAP32[$1_1 >> 2]; $4_1 = $48($3); if ($68($2_1, $3, $4_1)) { break block } $2_1 = $2_1 + $4_1 | 0; if (HEAPU8[$2_1 | 0] != 95) { break block } $0_1 = $320($0_1 + 388 | 0, HEAP32[HEAP32[$1_1 + 48 >> 2] >> 2]); if (!$0_1) { break block } $0_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$0_1 >> 2] < 3) { break block } $0_1 = HEAP32[$0_1 + 92 >> 2]; if (!$0_1) { break block } $5_1 = FUNCTION_TABLE[$0_1 | 0]($2_1 + 1 | 0) | 0; } return $5_1; } function $896($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; block : { if ((HEAP32[$5_1 + 32 >> 2] & 268435457) == 1) { break block } if (!HEAPU8[75553] | HEAPU8[$5_1 + 178 | 0] & 2) { break block } block3 : { if (HEAPU8[$5_1 + 177 | 0]) { $6_1 = $2_1; $2_1 = HEAP32[$5_1 + 180 >> 2]; block2 : { if ($66($6_1, HEAP32[$2_1 >> 2])) { break block2 } if ($66($1_1, HEAP32[$2_1 + 4 >> 2])) { break block2 } if (!$66($3, HEAP32[$2_1 + 8 >> 2])) { break block } } $257($0_1, 30822, 0); break block3; } block5 : { if (!HEAPU8[$0_1 + 18 | 0]) { if (!$68($1_1, 18315, 7)) { break block5 } } if (!$916($5_1)) { break block } if (!$922($5_1, $1_1)) { break block } } HEAP32[$4_1 >> 2] = $1_1; $257($0_1, 8179, $4_1); } $7_1 = 1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $897($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; block1 : { if (HEAPU8[$1_1 + 43 | 0] != 1) { $4_1 = 0; if (HEAP16[$1_1 + 34 >> 1] > 0) { break block1 } } $4_1 = global$0 - 48 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 >> 2]; block4 : { if (HEAPU8[$1_1 + 43 | 0] == 1) { HEAP32[$2_1 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2] + 1; block10 : { if ($684($2_1, $1_1)) { break block10 } $3 = $320($2_1 + 388 | 0, HEAP32[HEAP32[$1_1 + 48 >> 2] >> 2]); if (!$3) { HEAP32[$4_1 >> 2] = HEAP32[HEAP32[$1_1 + 48 >> 2] >> 2]; $257($0_1, 8406, $4_1); $3 = 1; break block10; } HEAP32[$4_1 + 44 >> 2] = 0; $3 = $324($2_1, $1_1, $3, HEAP32[HEAP32[$3 >> 2] + 8 >> 2], $4_1 + 44 | 0); $1_1 = HEAP32[$4_1 + 44 >> 2]; if ($3) { HEAP32[$4_1 + 16 >> 2] = $1_1; $257($0_1, 8932, $4_1 + 16 | 0); HEAP32[$0_1 + 12 >> 2] = $3; } $10($2_1, $1_1); } HEAP32[$2_1 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2] - 1; break block4; } if (HEAP16[$1_1 + 34 >> 1] < 0) { HEAP32[$4_1 + 32 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, 16013, $4_1 + 32 | 0); $3 = 1; break block4; } $6_1 = $907($2_1, HEAP32[$1_1 + 44 >> 2], 0); block7 : { if (!$6_1) { $5_1 = 1; break block7; } $8_1 = HEAPU8[$0_1 + 224 | 0]; HEAP8[$0_1 + 224 | 0] = 0; $9_1 = HEAP32[$0_1 + 44 >> 2]; $10_1 = HEAP32[$0_1 + 112 >> 2]; $1026($0_1, HEAP32[$6_1 + 32 >> 2]); $7_1 = $1_1 + 34 | 0; HEAP16[$7_1 >> 1] = 65535; HEAP16[$2_1 + 308 >> 1] = 0; $11_1 = HEAP32[$2_1 + 364 >> 2]; HEAP32[$2_1 + 364 >> 2] = 0; $5_1 = 1; HEAP32[$2_1 + 304 >> 2] = HEAP32[$2_1 + 304 >> 2] + 1; $3 = $996($0_1, $6_1, 64); HEAP32[$2_1 + 364 >> 2] = $11_1; HEAP32[$0_1 + 112 >> 2] = $10_1; HEAP32[$0_1 + 44 >> 2] = $9_1; block9 : { if (!$3) { HEAP16[$7_1 >> 1] = 0; break block9; } $5_1 = HEAP32[$1_1 + 16 >> 2]; if ($5_1) { $1224($0_1, $5_1, $7_1, $1_1 + 4 | 0); $5_1 = 0; if (HEAP32[$0_1 + 40 >> 2] | HEAP32[HEAP32[$6_1 + 28 >> 2] >> 2] != HEAP16[$7_1 >> 1]) { break block9 } $1225($0_1, $1_1, $6_1, 64); break block9; } HEAP16[$1_1 + 34 >> 1] = HEAPU16[$3 + 34 >> 1]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$3 + 4 >> 2]; HEAP32[$1_1 + 28 >> 2] = HEAP32[$1_1 + 28 >> 2] | HEAP32[$3 + 28 >> 2] & 98; $5_1 = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP16[$3 + 34 >> 1] = 0; } HEAP16[$1_1 + 36 >> 1] = HEAPU16[$1_1 + 34 >> 1]; $6($2_1, $3); $789($2_1, $6_1); $3 = HEAP32[$2_1 + 304 >> 2] - 1 | 0; HEAP32[$2_1 + 304 >> 2] = $3; HEAP16[$2_1 + 308 >> 1] = $3 ? 0 : HEAPU16[$2_1 + 310 >> 1]; HEAP8[$0_1 + 224 | 0] = $8_1; } $3 = HEAP32[$1_1 + 60 >> 2]; HEAP16[$3 + 78 >> 1] = HEAPU16[$3 + 78 >> 1] | 2; if (HEAPU8[$2_1 + 87 | 0]) { $848($2_1, $1_1) } $3 = HEAP32[$0_1 + 40 >> 2] + $5_1 | 0; } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $4_1 = $3; } return $4_1; } function $898($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = HEAP32[$0_1 >> 2]; block : { if ($318($0_1)) { break block } block2 : { if (!$1_1) { $1_1 = 0; while (1) { if (HEAP32[$3 + 20 >> 2] <= ($1_1 | 0)) { break block2 } if (($1_1 | 0) != 1) { $1158($0_1, $1_1) } $1_1 = $1_1 + 1 | 0; continue; }; } block4 : { if (HEAP32[$2_1 + 4 >> 2]) { break block4 } $4_1 = $1159($3, $1_1); if (($4_1 | 0) < 0) { break block4 } $1158($0_1, $4_1); break block2; } $4_1 = 0; $1_1 = $910($0_1, $1_1, $2_1, $5_1 + 12 | 0); if (($1_1 | 0) < 0) { break block2 } $4_1 = HEAP32[$2_1 + 4 >> 2] ? HEAP32[HEAP32[$3 + 16 >> 2] + ($1_1 << 4) >> 2] : $4_1; $1_1 = $875($3, HEAP32[$5_1 + 12 >> 2]); if (!$1_1) { break block2 } $2_1 = $778($3, $1_1, $4_1); block7 : { if ($2_1) { $1160($0_1, HEAP32[$2_1 + 12 >> 2], $2_1); break block7; } $2_1 = $308($0_1, 0, $1_1, $4_1); if (!$2_1) { break block7 } $1160($0_1, $2_1, 0); } $13($3, $1_1); } if (HEAPU8[$3 + 96 | 0]) { break block } $0_1 = $856($0_1); if (!$0_1) { break block } $857($0_1, 166); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $899($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = HEAP32[$0_1 >> 2]; block : { if ($318($0_1)) { break block } if (!$1_1) { $1156($0_1, 0); break block; } if (HEAP32[$2_1 >> 2] ? !$2_1 : 1) { $4_1 = $875(HEAP32[$0_1 >> 2], $1_1); if (!$4_1) { break block } if ($414($3, HEAPU8[$3 + 84 | 0], $4_1, 0)) { $1156($0_1, $4_1); $13($3, $4_1); break block; } $13($3, $4_1); } $4_1 = $910($0_1, $1_1, $2_1, $5_1 + 12 | 0); if (($4_1 | 0) < 0) { break block } $1_1 = $875($3, HEAP32[$5_1 + 12 >> 2]); if (!$1_1) { break block } if (HEAP32[$2_1 + 4 >> 2]) { $2_1 = HEAP32[HEAP32[$3 + 16 >> 2] + ($4_1 << 4) >> 2] } else { $2_1 = 0 } $4_1 = $319($3, $1_1, $2_1); if ($4_1) { $1157($0_1, $4_1, 0); $13($3, $1_1); break block; } $2_1 = $778($3, $1_1, $2_1); $13($3, $1_1); if ($2_1) { $923($0_1, 0, $309($3, HEAP32[HEAP32[$2_1 + 12 >> 2] + 60 >> 2])); $1010($0_1, $2_1, -1); break block; } $257($0_1, 15386, 0); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $900($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = global$0 - 48 | 0; if ($8_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $8_1; $9_1 = HEAP32[$0_1 >> 2]; block : { if ($318($0_1) | HEAP32[$0_1 + 40 >> 2]) { break block } $7_1 = $8_1 + 40 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; $7_1 = $8_1 + 32 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; $7_1 = $8_1 + 24 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; HEAP32[$8_1 + 16 >> 2] = 0; HEAP32[$8_1 + 20 >> 2] = 0; HEAP32[$8_1 + 12 >> 2] = $0_1; $7_1 = $8_1 + 12 | 0; if ($1395($7_1, $4_1)) { break block } if ($1395($7_1, $5_1)) { break block } if ($1395($7_1, $6_1)) { break block } if ($3) { $7_1 = 0; if ($864($0_1, $1_1, HEAPU8[$3 | 0] == 118 ? HEAP32[$3 + 8 >> 2] : $7_1, 0, 0)) { break block } } $7_1 = $856($0_1); $3 = $1060($0_1, 4); $862($0_1, $4_1, $3); $862($0_1, $5_1, $3 + 1 | 0); $862($0_1, $6_1, $3 + 2 | 0); if (!$7_1) { break block } $10_1 = $0_1; $0_1 = $3 + 3 | 0; $3 = HEAP16[$2_1 >> 1]; $1178($10_1, 0, $0_1 - $3 | 0, $0_1, $3, $2_1, 0); $858($7_1, 166, ($1_1 | 0) == 24); } $11($9_1, $4_1); $11($9_1, $5_1); $11($9_1, $6_1); $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $901($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = HEAP32[$0_1 >> 2]; while (1) { if (!(HEAP32[$3 + 20 >> 2] <= ($2_1 | 0))) { $4_1 = HEAP32[$3 + 16 >> 2] + ($2_1 << 4) | 0; block1 : { if (!HEAP32[$4_1 + 4 >> 2]) { break block1 } if ($1_1) { if ($67($1_1, HEAP32[$4_1 >> 2])) { break block1 } } $917($0_1, $2_1); } $2_1 = $2_1 + 1 | 0; continue; } break; }; } function $902($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[$0_1 >> 2]; $5_1 = $309($4_1, HEAP32[$1_1 + 20 >> 2]); $3 = $703($1_1); block1 : { if ($3) { $6_1 = ($5_1 | 0) == 1; $7_1 = HEAP32[$3 >> 2]; $3 = HEAP32[HEAP32[$4_1 + 16 >> 2] + ($5_1 << 4) >> 2]; if ($864($0_1, $6_1 ? 14 : 16, HEAP32[$1_1 >> 2], $7_1, $3)) { break block1 } if ($864($0_1, 9, $6_1 ? 9304 : 9323, 0, $3)) { break block1 } } $3 = $856($0_1); if (!$3) { break block1 } $4_1 = HEAP32[HEAP32[$4_1 + 16 >> 2] + ($5_1 << 4) >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$2_1 >> 2] = $4_1; $884($0_1, 28163, $2_1); $924($0_1, $5_1); $859($3, 153, $5_1, 0, 0, HEAP32[$1_1 >> 2], 0); } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $903($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = $325(HEAP32[$0_1 >> 2], 52, 0); if ($4_1) { wasm2js_memory_fill($4_1, 0, 52); HEAP16[$4_1 + 34 >> 1] = 65535; HEAP8[$4_1 | 0] = $1_1; $952(HEAP32[$0_1 >> 2], $4_1, $2_1, $3); $1003($0_1, HEAP32[$4_1 + 24 >> 2]); return $4_1; } $11(HEAP32[$0_1 >> 2], $2_1); $11(HEAP32[$0_1 >> 2], $3); return $4_1; } function $904($0_1, $1_1, $2_1) { var $3 = 0; block : { $0_1 = $969($0_1, $1_1, $2_1); if (!$0_1) { break block } $2_1 = 0; while (1) { $1_1 = $0_1 + $2_1 | 0; $3 = HEAPU8[$1_1 | 0]; if (!$3) { break block } if (HEAP8[$3 + 31424 | 0] & 1) { HEAP8[$1_1 | 0] = 32 } $2_1 = $2_1 + 1 | 0; continue; }; } return $0_1; } function $905($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $8_1 = HEAP32[$0_1 >> 2]; $5_1 = $270($8_1, HEAP32[$2_1 + 4 >> 2] + 49 | 0, 0); if (!$5_1) { break block } $7_1 = $5_1 + 48 | 0; $6_1 = HEAP32[$2_1 + 4 >> 2]; if ($6_1) { wasm2js_memory_copy($7_1, HEAP32[$2_1 >> 2], $6_1) } $300($7_1); HEAP8[$5_1 | 0] = $1_1; HEAP32[$5_1 + 12 >> 2] = $7_1; HEAP32[$5_1 + 36 >> 2] = $904($8_1, $3, $4_1); if (HEAPU8[$0_1 + 224 | 0] >= 2) { $934($0_1, HEAP32[$5_1 + 12 >> 2], $2_1) } $6_1 = $5_1; } return $6_1; } function $906($0_1, $1_1, $2_1) { if (!$1_1) { return 0 } return $1196($0_1, $1_1, $2_1, 0); } function $907($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 - 32 | 0; $7_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $7_1; HEAP32[$4_1 >> 2] = 0; while (1) { block5 : { block : { if (!$1_1) { break block } $3 = $325($0_1, 76, 0); if (!$3) { break block } HEAP32[$3 + 28 >> 2] = $887($0_1, HEAP32[$1_1 + 28 >> 2], $2_1); HEAP32[$3 + 32 >> 2] = $909($0_1, HEAP32[$1_1 + 32 >> 2], $2_1); HEAP32[$3 + 36 >> 2] = $906($0_1, HEAP32[$1_1 + 36 >> 2], $2_1); HEAP32[$3 + 40 >> 2] = $887($0_1, HEAP32[$1_1 + 40 >> 2], $2_1); HEAP32[$3 + 44 >> 2] = $906($0_1, HEAP32[$1_1 + 44 >> 2], $2_1); HEAP32[$3 + 48 >> 2] = $887($0_1, HEAP32[$1_1 + 48 >> 2], $2_1); $8_1 = HEAPU8[$1_1 | 0]; HEAP32[$3 + 56 >> 2] = $5_1; HEAP8[$3 | 0] = $8_1; HEAP32[$3 + 52 >> 2] = 0; $5_1 = $906($0_1, HEAP32[$1_1 + 60 >> 2], $2_1); HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 60 >> 2] = $5_1; $5_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 + 20 >> 2] = -1; HEAP32[$3 + 24 >> 2] = -1; HEAP32[$3 + 4 >> 2] = $5_1 & -33; HEAP16[$3 + 2 >> 1] = HEAPU16[$1_1 + 2 >> 1]; $5_1 = $1214($0_1, HEAP32[$1_1 + 64 >> 2]); HEAP32[$3 + 68 >> 2] = 0; HEAP32[$3 + 64 >> 2] = $5_1; $5_1 = HEAP32[$1_1 + 72 >> 2]; HEAP32[$4_1 + 4 >> 2] = 0; $8_1 = $3 + 52 | 0; $6_1 = $4_1 + 4 | 0; while (1) { block1 : { if (!$5_1) { break block1 } $9_1 = $6_1; $6_1 = $1215($0_1, 0, $5_1); HEAP32[$9_1 >> 2] = $6_1; if (!$6_1) { break block1 } $6_1 = $6_1 + 36 | 0; $5_1 = HEAP32[$5_1 + 36 >> 2]; continue; } break; }; HEAP32[$3 + 72 >> 2] = HEAP32[$4_1 + 4 >> 2]; $5_1 = HEAPU8[$0_1 + 87 | 0]; block4 : { if (HEAP32[$1_1 + 68 >> 2]) { if ($5_1 & 255) { HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 + 16 >> 2]; break block4; } HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 39; HEAP32[$4_1 + 8 >> 2] = 40; HEAP32[$4_1 + 28 >> 2] = $3; HEAP32[$4_1 + 4 >> 2] = 0; $919($4_1 + 4 | 0, $3); $5_1 = HEAPU8[$0_1 + 87 | 0]; } HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 + 16 >> 2]; if (!($5_1 & 255)) { break block5 } } HEAP32[$3 + 56 >> 2] = 0; $789($0_1, $3); } $1_1 = HEAP32[$4_1 >> 2]; $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } HEAP32[$7_1 >> 2] = $3; $1_1 = HEAP32[$1_1 + 52 >> 2]; $7_1 = $8_1; $5_1 = $3; continue; }; } function $908($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!$1_1) { break block1 } $3 = HEAP32[$1_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $5_1 = $1_1 + 16 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($3 | 0)) { break block1 } $4_1 = $1_1 << 4; $1_1 = $1_1 + 1 | 0; $4_1 = $4_1 + $5_1 | 0; if (!(HEAPU8[$4_1 + 1 | 0] & 32)) { continue } break; }; $1_1 = HEAPU8[$4_1 | 0]; HEAP32[$2_1 >> 2] = $1_1 ? (($1_1 | 0) == 3 ? 18865 : 18871) : 18865; $257($0_1, 7335, $2_1); $6_1 = 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $909($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; block1 : { if (!$1_1) { break block1 } $3 = HEAP32[$1_1 >> 2]; $3 = ($3 | 0) <= 0 ? 56 : Math_imul($3, 48) | 8; $7_1 = $325($0_1, $3, $3 >> 31); if (!$7_1) { break block1 } $3 = HEAP32[$1_1 >> 2]; HEAP32[$7_1 >> 2] = $3; HEAP32[$7_1 + 4 >> 2] = $3; $12_1 = $1_1 + 8 | 0; $13_1 = $7_1 + 8 | 0; while (1) { if (($3 | 0) <= ($10_1 | 0)) { return $7_1 } $5_1 = Math_imul($10_1, 48); $3 = $5_1 + $13_1 | 0; $5_1 = $5_1 + $12_1 | 0; HEAP32[$3 + 12 >> 2] = HEAP32[$5_1 + 12 >> 2]; block5 : { if (HEAPU8[$5_1 + 13 | 0] & 4) { $4_1 = $51($0_1, 16, 0); if ($4_1) { $6_1 = HEAP32[$5_1 + 44 >> 2]; $11_1 = HEAP32[$6_1 >> 2]; $8_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$4_1 >> 2] = $11_1; HEAP32[$4_1 + 4 >> 2] = $8_1; $6_1 = $6_1 + 8 | 0; $9_1 = HEAP32[$6_1 + 4 >> 2]; $8_1 = $4_1 + 8 | 0; HEAP32[$8_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$8_1 + 4 >> 2] = $9_1; $6_1 = $907($0_1, $11_1, $2_1); HEAP32[$4_1 >> 2] = $6_1; if ($6_1) { break block5 } $13($0_1, $4_1); } $4_1 = (HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8) & 65531; HEAP8[$3 + 13 | 0] = $4_1; HEAP8[$3 + 14 | 0] = $4_1 >>> 8; $4_1 = 0; break block5; } $4_1 = HEAP32[$5_1 + 44 >> 2]; if (HEAP8[$5_1 + 15 | 0] & 1) { break block5 } $4_1 = $116($0_1, $4_1); } HEAP32[$3 + 44 >> 2] = $4_1; HEAP32[$3 >> 2] = $116($0_1, HEAP32[$5_1 >> 2]); HEAP32[$3 + 4 >> 2] = $116($0_1, HEAP32[$5_1 + 4 >> 2]); HEAP32[$3 + 16 >> 2] = HEAP32[$5_1 + 16 >> 2]; $4_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; block7 : { if ($4_1 & 2) { HEAP32[$3 + 32 >> 2] = $116($0_1, HEAP32[$5_1 + 32 >> 2]); break block7; } if ($4_1 & 8) { HEAP32[$3 + 32 >> 2] = $887($0_1, HEAP32[$5_1 + 32 >> 2], $2_1); break block7; } HEAP32[$3 + 32 >> 2] = HEAP32[$5_1 + 32 >> 2]; } $4_1 = HEAP32[$5_1 + 36 >> 2]; HEAP32[$3 + 36 >> 2] = $4_1; if (HEAPU8[$3 + 14 | 0] & 2) { HEAP32[$4_1 >> 2] = HEAP32[$4_1 >> 2] + 1 } $4_1 = HEAP32[$5_1 + 8 >> 2]; HEAP32[$3 + 8 >> 2] = $4_1; if ($4_1) { HEAP32[$4_1 + 24 >> 2] = HEAP32[$4_1 + 24 >> 2] + 1 } $4_1 = HEAP32[$5_1 + 40 >> 2]; block12 : { if (HEAPU8[$5_1 + 14 | 0] & 8) { $9_1 = $1218($0_1, $4_1); break block12; } $9_1 = $906($0_1, $4_1, $2_1); } HEAP32[$3 + 40 >> 2] = $9_1; $4_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$3 + 24 >> 2] = HEAP32[$5_1 + 24 >> 2]; HEAP32[$3 + 28 >> 2] = $4_1; $10_1 = $10_1 + 1 | 0; $3 = HEAP32[$1_1 >> 2]; continue; }; } return 0; } function $910($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; block2 : { if (HEAP32[$2_1 + 4 >> 2]) { if (HEAPU8[$5_1 + 177 | 0]) { $257($0_1, 13660, 0); $2_1 = -1; break block2; } HEAP32[$3 >> 2] = $2_1; $2_1 = $1159($5_1, $1_1); if (($2_1 | 0) >= 0) { break block2 } HEAP32[$4_1 >> 2] = $1_1; $257($0_1, 19095, $4_1); $2_1 = -1; break block2; } $2_1 = HEAPU8[$5_1 + 176 | 0]; HEAP32[$3 >> 2] = $1_1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $911($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = $1_1 + 8 | 0; $2_1 = $879($0_1, 0, $4_1); $3 = HEAP32[$1_1 + 16 >> 2]; if ($3) { $6(HEAP32[$0_1 >> 2], $3) } HEAP32[$1_1 + 16 >> 2] = $2_1; $3 = HEAPU8[$1_1 + 21 | 0] | HEAPU8[$1_1 + 22 | 0] << 8 | 1024; HEAP8[$1_1 + 21 | 0] = $3; HEAP8[$1_1 + 22 | 0] = $3 >>> 8; if ($2_1) { HEAP32[$2_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2] + 1; if (!(HEAPU8[$1_1 + 21 | 0] & 2)) { return $2_1 } $5_1 = $1255($0_1, $4_1) ? 0 : $2_1; } return $5_1; } function $912($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 + 24 >> 2]; if (!HEAPU8[$3 + 36 | 0]) { HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 1073741824 } $0_1 = 0; block1 : { if (HEAPU8[$1_1 | 0] != 157) { break block1 } $4_1 = HEAP32[$3 >> 2]; if (HEAPU8[HEAP32[$4_1 >> 2] + 177 | 0]) { HEAP8[$1_1 | 0] = 122; break block1; } HEAP32[$2_1 >> 2] = HEAP32[$3 + 44 >> 2]; $257($4_1, 5803, $2_1); $0_1 = 2; } $1_1 = $2_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1 | 0; } function $913($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 - 16 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[$0_1 + 24 >> 2]; $9_1 = HEAP32[HEAP32[$4_1 >> 2] >> 2]; $12_1 = $92($9_1, HEAP32[$4_1 + 40 >> 2]); $10_1 = HEAP32[$1_1 + 32 >> 2]; block1 : { if (!$10_1) { $2_1 = 0; break block1; } $13_1 = $4_1 + 4 | 0; $11_1 = $10_1 + 8 | 0; $2_1 = $11_1; block6 : { while (1) { if (($5_1 | 0) < HEAP32[$10_1 >> 2]) { block3 : { if (HEAPU8[$4_1 + 36 | 0]) { break block3 } $3 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; if ($3 & 4) { break block3 } $8_1 = HEAPU8[$2_1 + 15 | 0]; block4 : { if ($8_1 & 1) { break block4 } $7_1 = HEAP32[$2_1 + 44 >> 2]; if (!$7_1) { break block4 } if (($92($9_1, $7_1) | 0) != ($12_1 | 0)) { $0_1 = HEAP32[$4_1 >> 2]; $1_1 = HEAP32[$4_1 + 48 >> 2]; $2_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$6_1 + 8 >> 2] = $7_1; HEAP32[$6_1 >> 2] = $2_1; HEAP32[$6_1 + 4 >> 2] = $1_1; $257($0_1, 6820, $6_1); break block6; } $10($9_1, $7_1); $3 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8 | 1024; HEAP8[$2_1 + 13 | 0] = $3; HEAP8[$2_1 + 14 | 0] = $3 >>> 8; $8_1 = HEAPU8[$2_1 + 15 | 0] | 2; HEAP8[$2_1 + 15 | 0] = $8_1; } $7_1 = HEAP32[$4_1 + 32 >> 2]; HEAP8[$2_1 + 15 | 0] = $8_1 | 1; $3 = $3 | 256; HEAP8[$2_1 + 13 | 0] = $3; HEAP8[$2_1 + 14 | 0] = $3 >>> 8; HEAP32[$2_1 + 44 >> 2] = $7_1; } $3 = Math_imul($5_1, 48) + $11_1 | 0; if (!(HEAPU8[$3 + 14 | 0] & 8)) { if ($920($13_1, HEAP32[$3 + 40 >> 2])) { break block6 } } $2_1 = $2_1 + 48 | 0; $5_1 = $5_1 + 1 | 0; continue; } break; }; $2_1 = 0; if (!HEAP32[$1_1 + 64 >> 2]) { break block1 } $5_1 = 0; while (1) { $4_1 = HEAP32[$1_1 + 64 >> 2]; if (HEAP32[$4_1 >> 2] <= ($5_1 | 0)) { break block1 } $3 = Math_imul($5_1, 24); $5_1 = $5_1 + 1 | 0; if (!$919($0_1, HEAP32[($4_1 + $3 | 0) + 20 >> 2])) { continue } break; }; } $2_1 = 2; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $914($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; } function $915($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 80 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if ($1_1) { $3 = $2_1 + 4 | 0; wasm2js_memory_fill($3, 0, 76); HEAP32[$2_1 + 36 >> 2] = $1_1; $1_1 = $919($0_1 + 4 | 0, $3); } else { $1_1 = 0 } $0_1 = $2_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $916($0_1) { var $1_1 = 0; block1 : { if (!(HEAP32[$0_1 + 196 >> 2] | (HEAP32[$0_1 + 404 >> 2] | !(HEAPU8[$0_1 + 35 | 0] & 16)))) { $1_1 = 1; if (HEAP32[$0_1 + 408 >> 2] | HEAP32[$0_1 + 384 >> 2] <= 0) { break block1 } } $1_1 = 0; } return $1_1; } function $917($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 132 >> 2]; $1213($2_1 ? $2_1 : $0_1, $1_1); } function $918($0_1, $1_1, $2_1) { $0_1 = $0_1 + 284 | 0; while (1) { block1 : { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { if (HEAP32[$0_1 >> 2] != ($2_1 | 0)) { break block1 } HEAP32[$0_1 >> 2] = $1_1; } return; } $0_1 = $0_1 + 12 | 0; continue; }; } function $919($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (!$1_1 | !HEAP32[$0_1 + 8 >> 2]) { break block } while (1) { $2_1 = FUNCTION_TABLE[HEAP32[$0_1 + 8 >> 2]]($0_1, $1_1) | 0; if ($2_1) { return $2_1 & 2 } $5_1 = 2; if ($921($0_1, HEAP32[$1_1 + 28 >> 2])) { break block } if ($920($0_1, HEAP32[$1_1 + 36 >> 2])) { break block } if ($921($0_1, HEAP32[$1_1 + 40 >> 2])) { break block } if ($920($0_1, HEAP32[$1_1 + 44 >> 2])) { break block } if ($921($0_1, HEAP32[$1_1 + 48 >> 2])) { break block } if ($920($0_1, HEAP32[$1_1 + 60 >> 2])) { break block } $3 = HEAP32[$1_1 + 72 >> 2]; block2 : { if (!$3) { break block2 } $2_1 = HEAP32[$0_1 + 12 >> 2]; block3 : { if (($2_1 | 0) == 13) { break block3 } $4_1 = HEAP32[$0_1 >> 2]; if ($4_1) { if (($2_1 | 0) == 41 | HEAPU8[$4_1 + 224 | 0] > 1) { break block3 } break block2; } if (($2_1 | 0) != 41) { break block2 } } if ($1201($0_1, $3, 0)) { break block } } block5 : { $3 = HEAP32[$1_1 + 32 >> 2]; if (!$3) { break block5 } $2_1 = $3 + 8 | 0; $3 = HEAP32[$3 >> 2]; while (1) { if (($3 | 0) <= 0) { break block5 } $4_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; if ($4_1 & 4) { if ($919($0_1, HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2])) { break block } $4_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; } if ($4_1 & 8) { if ($921($0_1, HEAP32[$2_1 + 32 >> 2])) { break block } } $2_1 = $2_1 + 48 | 0; $3 = $3 - 1 | 0; continue; }; } $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($2_1) { FUNCTION_TABLE[$2_1 | 0]($0_1, $1_1) } $1_1 = HEAP32[$1_1 + 52 >> 2]; if ($1_1) { continue } break; }; $5_1 = 0; } return $5_1; } function $920($0_1, $1_1) { if (!$1_1) { return 0 } return $1187($0_1, $1_1); } function $921($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$1_1) { break block } $2_1 = $1_1 + 8 | 0; $1_1 = HEAP32[$1_1 >> 2]; while (1) { if (($1_1 | 0) <= 0) { break block } if ($920($0_1, HEAP32[$2_1 >> 2])) { $3 = 2 } else { $2_1 = $2_1 + 16 | 0; $1_1 = $1_1 - 1 | 0; continue; } break; }; } return $3; } function $922($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = $2080($1_1) + 1 | 0; __inlined_func$2084$312 : { while (1) { $3 = 0; if (!$2_1) { break __inlined_func$2084$312 } $2_1 = $2_1 - 1 | 0; $3 = $2_1 + $1_1 | 0; if (HEAPU8[$3 | 0] != 95) { continue } break; }; } if (!$3) { return 0 } HEAP8[$3 | 0] = 0; $2_1 = $319($0_1, $1_1, 0); HEAP8[$3 | 0] = 95; if (!$2_1 | HEAPU8[$2_1 + 43 | 0] != 1) { $0_1 = 0 } else { $0_1 = $895($0_1, $2_1, $1_1) } return $0_1; } function $923($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 + 132 >> 2]; $0_1 = $3 ? $3 : $0_1; $1213($0_1, $2_1); HEAP32[$0_1 + 92 >> 2] = HEAP32[$0_1 + 92 >> 2] | 1 << $2_1; HEAP8[$0_1 + 20 | 0] = HEAPU8[$0_1 + 20 | 0] | $1_1; } function $924($0_1, $1_1) { $835(HEAP32[$0_1 + 8 >> 2], 100, $1_1, 1, HEAP32[HEAP32[(HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2] >> 2] + 1 | 0); } function $925($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $859($0_1, 149, $1_1, 0, 0, $2_1, -6); $1_1 = HEAP32[$0_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = $3 } while (1) { if (!(HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] <= ($4_1 | 0))) { $314($0_1, $4_1); $4_1 = $4_1 + 1 | 0; continue; } break; }; $0_1 = HEAP32[$0_1 + 12 >> 2]; $1_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($1_1 ? $1_1 : $0_1) + 21 | 0] = 1; } function $926($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $6_1 = global$0 - 496 | 0; $8_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $8_1; $7_1 = HEAP32[$0_1 >> 2]; $5_1 = $856($0_1); block : { if (!$5_1) { break block } $326($5_1, 166, 1, 1); HEAP32[$0_1 + 48 >> 2] = 2; $1_1 = $910($0_1, $1_1, $2_1, $6_1 + 492 | 0); if (($1_1 | 0) < 0) { break block } $8_1 = HEAP32[$7_1 + 16 >> 2]; if (($1_1 | 0) == 1) { if ($140($0_1)) { break block } } $25 = $875($7_1, HEAP32[$6_1 + 492 >> 2]); if (!$25) { break block } $12_1 = ($1_1 << 4) + $8_1 | 0; block3 : { if ($4_1) { HEAP32[$6_1 + 432 >> 2] = $3; $9_1 = $310($7_1, 19057, $6_1 + 432 | 0); break block3; } $9_1 = $875($7_1, $3); } $4_1 = HEAP32[$2_1 + 4 >> 2] ? HEAP32[$12_1 >> 2] : 0; block6 : { if ($864($0_1, 19, $25, $9_1, $4_1)) { break block6 } HEAP32[$6_1 + 476 >> 2] = 0; HEAP32[$6_1 + 472 >> 2] = $9_1; HEAP32[$6_1 + 468 >> 2] = $25; HEAP32[$6_1 + 464 >> 2] = 0; HEAP32[$7_1 + 456 >> 2] = 0; $10_1 = $6_1 + 464 | 0; block2 : { block1 : { if (!$4_1) { $8_1 = 0; break block1; } $8_1 = $92($7_1, $4_1); $18_1 = 0; if (($8_1 | 0) < 0) { break block2 } } $18_1 = HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($8_1 << 4) | 0) + 4 >> 2]; } $8_1 = $18_1; $18_1 = 1; __inlined_func$101$313 : { if (!$8_1) { break __inlined_func$101$313 } $14 = HEAP32[$8_1 + 4 >> 2]; HEAP32[$14 + 4 >> 2] = HEAP32[$8_1 >> 2]; $8_1 = HEAP32[$7_1 + 456 >> 2]; $14 = HEAP32[HEAP32[$14 >> 2] + 64 >> 2]; $13_1 = HEAP32[$14 >> 2]; if ($13_1) { $10_1 = FUNCTION_TABLE[HEAP32[$13_1 + 40 >> 2]]($14, 14, $10_1) | 0 } else { $10_1 = 12 } HEAP32[$7_1 + 456 >> 2] = $8_1; $18_1 = $10_1; } $8_1 = $18_1; if (($8_1 | 0) != 12) { if (!$8_1) { $1134($5_1, 1); $1135($5_1, 0, 0, HEAP32[$6_1 + 464 >> 2], -1); $1136($5_1, HEAP32[$6_1 + 464 >> 2]); $24(HEAP32[$6_1 + 464 >> 2]); break block6; } $1_1 = HEAP32[$6_1 + 464 >> 2]; if ($1_1) { HEAP32[$6_1 >> 2] = $1_1; $257($0_1, 8932, $6_1); $24(HEAP32[$6_1 + 464 >> 2]); } HEAP32[$0_1 + 12 >> 2] = $8_1; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; break block6; } $8_1 = $321($25); if (!$8_1) { break block6 } $10_1 = HEAPU8[$8_1 + 5 | 0]; if ($10_1 & 1) { if ($318($0_1)) { break block6 } $10_1 = HEAPU8[$8_1 + 5 | 0]; } if (!(!!($9_1 ? $10_1 & 4 : 0) | $10_1 & 2)) { $1137($5_1, $8_1) } $13_1 = -1; $10_1 = 0; block76 : { block48 : { block31 : { block32 : { block23 : { block21 : { block28 : { block39 : { block42 : { block27 : { block26 : { block20 : { block33 : { block25 : { block143 : { block14 : { block22 : { block53 : { block52 : { block44 : { block40 : { block17 : { block45 : { block29 : { block51 : { block13 : { block75 : { block47 : { switch (HEAPU8[$8_1 + 4 | 0] - 1 | 0) { case 12: $314($5_1, $1_1); if (!$9_1) { HEAP32[$0_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2] + 2; $0_1 = $313($5_1, 9, 51264); HEAP32[$0_1 + 124 >> 2] = -2e3; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1; break block6; } $2_1 = $830($9_1); $923($0_1, 0, $1_1); $0_1 = ($2_1 | 0) < 0 ? (($2_1 | 0) == -2147483648 ? 2147483647 : 0 - $2_1 | 0) : $2_1; $835($5_1, 100, $1_1, 3, $0_1); HEAP32[HEAP32[$12_1 + 12 >> 2] + 80 >> 2] = $0_1; $512(HEAP32[$12_1 + 4 >> 2], $0_1); break block6; case 30: $0_1 = HEAP32[$12_1 + 4 >> 2]; if (!$9_1) { block57 : { if (!$0_1) { $2_1 = 0; $0_1 = 0; break block57; } $2_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 36 >> 2]; $0_1 = $2_1 >> 31; } $1138($5_1, $2_1, $0_1); break block6; } $1_1 = $830($9_1); HEAP32[$7_1 + 100 >> 2] = $1_1; if (($144($0_1, $1_1, 0, 0) | 0) != 7) { break block6 } $106($7_1); break block6; case 32: $0_1 = HEAP32[$12_1 + 4 >> 2]; block58 : { if (!$9_1) { break block58 } if (!$67($9_1, 2513)) { $13_1 = 2; break block58; } $13_1 = $436($9_1, 0); } block60 : { if (HEAP32[$2_1 + 4 >> 2]) { break block60 } $2_1 = 0; if (($13_1 | 0) < 0) { break block60 } while (1) { if (HEAP32[$7_1 + 20 >> 2] <= ($2_1 | 0)) { break block60 } $1139(HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($2_1 << 4) | 0) + 4 >> 2], $13_1); $2_1 = $2_1 + 1 | 0; continue; }; } $1138($5_1, $1139($0_1, $13_1), 0); break block6; case 26: HEAP32[$6_1 + 456 >> 2] = 0; HEAP32[$6_1 + 460 >> 2] = 0; $917($0_1, $1_1); $2_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; block62 : { if ((HEAPU8[$25 | 0] & 223) == 80) { $326($5_1, 178, $1_1, $2_1); break block62; } $0_1 = 0; block63 : { if (!$9_1) { break block63 } if ($438($9_1, $6_1 + 456 | 0)) { break block63 } $3 = HEAP32[$6_1 + 460 >> 2]; if (($3 | 0) < 0) { break block63 } $0_1 = HEAP32[$6_1 + 456 >> 2]; $0_1 = !$3 & $0_1 >>> 0 < 4294967294 ? $0_1 : -2; } $835($5_1, 179, $1_1, $2_1, $0_1); } $326($5_1, 84, $2_1, 1); break block6; case 25: block69 : { block67 : { block68 : { block64 : { if (!$9_1) { break block64 } if ($67($9_1, 13074)) { if ($67($9_1, 11926)) { break block64 } $1_1 = 0; } else { $1_1 = 1 } if (HEAP32[$2_1 + 4 >> 2]) { break block67 } $2_1 = 2; while (1) { if (HEAP32[$7_1 + 20 >> 2] <= ($2_1 | 0)) { break block68 } $1140(HEAP32[HEAP32[HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($2_1 << 4) | 0) + 4 >> 2] + 4 >> 2] >> 2], $1_1); $2_1 = $2_1 + 1 | 0; continue; }; } $1_1 = -1; if (HEAP32[$2_1 + 4 >> 2]) { break block67 } $0_1 = HEAPU8[$7_1 + 89 | 0]; break block69; } HEAP8[$7_1 + 89 | 0] = $1_1; } $0_1 = $1140(HEAP32[HEAP32[HEAP32[$12_1 + 4 >> 2] + 4 >> 2] >> 2], $1_1); } $1136($5_1, ($0_1 | 0) == 1 ? 13074 : 11926); break block6; case 22: block72 : { block70 : { if (!$9_1) { break block70 } $3 = 0; $0_1 = $48($9_1); while (1) { if (($3 | 0) == 6) { break block70 } if ($68($9_1, HEAP32[($3 << 2) + 34784 >> 2], $0_1)) { $3 = $3 + 1 | 0; continue; } break; }; if (($3 | 0) != 2) { break block72 } if (HEAPU8[$7_1 + 35 | 0] & 16) { break block70 } $3 = 2; break block72; } $3 = -1; if (HEAP32[$2_1 + 4 >> 2]) { break block72 } HEAP32[$2_1 + 4 >> 2] = 1; $1_1 = 0; } $0_1 = HEAP32[$7_1 + 20 >> 2]; while (1) { if (($0_1 | 0) > 0) { $0_1 = $0_1 - 1 | 0; if (!HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($0_1 << 4) | 0) + 4 >> 2] | (HEAP32[$2_1 + 4 >> 2] ? ($0_1 | 0) != ($1_1 | 0) : 0)) { continue } $314($5_1, $0_1); $835($5_1, 4, $0_1, 1, $3); continue; } break; }; $326($5_1, 84, 1, 1); break block6; case 23: $0_1 = HEAP32[HEAP32[HEAP32[$12_1 + 4 >> 2] + 4 >> 2] >> 2]; HEAP32[$6_1 + 456 >> 2] = -2; HEAP32[$6_1 + 460 >> 2] = -1; if (!$9_1) { break block75 } $438($9_1, $6_1 + 456 | 0); $1_1 = HEAP32[$6_1 + 460 >> 2]; $3 = ($1_1 | 0) >= 0; $2_1 = $3 ? HEAP32[$6_1 + 456 >> 2] : -1; HEAP32[$0_1 + 176 >> 2] = $2_1; $1_1 = $3 ? $1_1 : -1; HEAP32[$0_1 + 180 >> 2] = $1_1; $0_1 = HEAP32[$0_1 + 232 >> 2]; if (!$0_1) { break block76 } HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; break block76; case 2: $0_1 = HEAP32[$12_1 + 4 >> 2]; if (!$9_1) { $1138($5_1, $787($0_1), 0); break block6; } $2_1 = 0; block79 : { if (!$67($9_1, 13940)) { break block79 } $2_1 = 1; if (!$67($9_1, 11766)) { break block79 } $2_1 = 2; if (!$67($9_1, 11891)) { break block79 } $2_1 = $830($9_1); $2_1 = $2_1 >>> 0 < 3 ? $2_1 & 255 : 0; } HEAP8[$7_1 + 90 | 0] = $2_1; if ($788($0_1, $2_1)) { break block6 } $2_1 = $2_1 - 1 | 0; if ($2_1 >>> 0 > 1) { break block6 } $3 = HEAP32[$5_1 + 108 >> 2]; $0_1 = $313($5_1, 5, 51312); HEAP32[$0_1 + 92 >> 2] = $2_1; HEAP32[$0_1 + 84 >> 2] = $1_1; HEAP32[$0_1 + 48 >> 2] = $3 + 4; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1; $314($5_1, $1_1); break block6; case 18: HEAP32[$6_1 + 456 >> 2] = 0; block83 : { block82 : { if (!$9_1) { break block82 } if (!$296($9_1, $6_1 + 456 | 0)) { break block82 } $2_1 = HEAP32[$6_1 + 456 >> 2]; if (($2_1 | 0) > 0) { break block83 } } $2_1 = 2147483647; } $923($0_1, 0, $1_1); $326($5_1, 71, $2_1, 1); $0_1 = $858($5_1, 62, $1_1); $858($5_1, 84, 1); $326($5_1, 86, 1, -1); $326($5_1, 50, 1, $0_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; break block6; case 5: if (!$9_1) { $0_1 = HEAP32[HEAP32[$12_1 + 12 >> 2] + 80 >> 2]; $1138($5_1, $0_1, $0_1 >> 31); break block6; } $0_1 = $830($9_1); HEAP32[HEAP32[$12_1 + 12 >> 2] + 80 >> 2] = $0_1; $512(HEAP32[$12_1 + 4 >> 2], $0_1); break block6; case 6: if (!$9_1) { $2_1 = 0; $1_1 = 0; if (HEAPU8[$7_1 + 32 | 0] & 32) { $2_1 = $784(HEAP32[$12_1 + 4 >> 2], 0); $1_1 = $2_1 >> 31; } $1138($5_1, $2_1, $1_1); break block6; } HEAP32[$6_1 + 456 >> 2] = 1; $1_1 = $296($9_1, $6_1 + 456 | 0); $0_1 = HEAP32[$6_1 + 456 >> 2]; if ($1_1) { $784(HEAP32[$12_1 + 4 >> 2], $0_1) } $0_1 = $436($9_1, ($0_1 | 0) != 0); $1_1 = HEAP32[$7_1 + 36 >> 2]; HEAP32[$7_1 + 32 >> 2] = HEAP32[$7_1 + 32 >> 2] & -33 | ($0_1 ? 32 : 0); HEAP32[$7_1 + 36 >> 2] = $1_1; $1141($7_1); break block6; case 27: $1138($5_1, 0, 0); break block6; case 38: if (!$9_1) { $1138($5_1, HEAPU8[$7_1 + 86 | 0], 0); break block6; } $2_1 = HEAPU8[$9_1 | 0] - 48 & 255; block90 : { if ($2_1 >>> 0 <= 2) { break block90 } if (!$67($9_1, 14222)) { $2_1 = 1; break block90; } $2_1 = $67($9_1, 1207) ? 0 : 2; } $1_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$1_1 + 86 | 0] == ($2_1 | 0)) { break block6 } if ($1142($0_1)) { break block6 } HEAP8[$1_1 + 86 | 0] = $2_1; break block6; case 39: if (!$9_1) { $1136($5_1, HEAP32[20616]); break block6; } block93 : { if (!HEAPU8[$9_1 | 0]) { break block93 } $1_1 = HEAP32[$7_1 >> 2]; if (!(wasm2js_i32$0 = FUNCTION_TABLE[HEAP32[$1_1 + 32 >> 2]]($1_1, $9_1, 1, $6_1 + 456 | 0) | 0, wasm2js_i32$1 = 1, wasm2js_i32$2 = HEAP32[$6_1 + 456 >> 2], wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1)) { break block93 } $257($0_1, 1109, 0); break block6; } if (HEAPU8[$7_1 + 86 | 0] <= 1) { $1142($0_1) } $24(HEAP32[20616]); if (HEAPU8[$9_1 | 0]) { HEAP32[$6_1 + 16 >> 2] = $9_1; HEAP32[20616] = $61(8932, $6_1 + 16 | 0); break block6; } HEAP32[20616] = 0; break block6; case 35: if (!$9_1) { $0_1 = HEAPU8[$12_1 + 8 | 0] - 1 | 0; $1_1 = ($0_1 | 0) == -1 ? -1 : 0; $1138($5_1, $0_1, $1_1); break block6; } if (!HEAPU8[$7_1 + 85 | 0]) { $257($0_1, 10765, 0); break block6; } if (($1_1 | 0) == 1) { break block6 } $0_1 = $437($9_1, 0, 1); HEAP8[$12_1 + 9 | 0] = 1; HEAP8[$12_1 + 8 | 0] = ($0_1 & 7) == 7 ? 1 : $0_1 + 1 & 7; $1141($7_1); break block6; case 3: if (!$9_1) { $1137($5_1, $8_1); $1138($5_1, (HEAP32[$8_1 + 8 >> 2] & HEAP32[$7_1 + 32 >> 2] | HEAP32[$8_1 + 12 >> 2] & HEAP32[$7_1 + 36 >> 2]) != 0, 0); break block6; } $0_1 = HEAP32[$8_1 + 8 >> 2]; $1_1 = HEAPU8[$7_1 + 85 | 0]; $0_1 = $1_1 ? $0_1 : $0_1 & -16385; $2_1 = HEAP32[$8_1 + 12 >> 2]; $1_1 = $1_1 ? $2_1 : $2_1; block102 : { if ($436($9_1, 0)) { $2_1 = HEAP32[$7_1 + 32 >> 2]; if ($2_1 & 268435456 ? $0_1 & 1 : 0) { break block102 } $3 = HEAP32[$7_1 + 36 >> 2]; HEAP32[$7_1 + 32 >> 2] = $0_1 | $2_1; HEAP32[$7_1 + 36 >> 2] = $1_1 | $3; break block102; } $2_1 = HEAP32[$7_1 + 36 >> 2] & ($1_1 ^ -1); HEAP32[$7_1 + 32 >> 2] = HEAP32[$7_1 + 32 >> 2] & ($0_1 ^ -1); HEAP32[$7_1 + 36 >> 2] = $2_1; if (!(($0_1 | 0) != 524288 | ($1_1 | 0) != 0)) { HEAP32[$7_1 + 520 >> 2] = 0; HEAP32[$7_1 + 524 >> 2] = 0; break block102; } if (!($0_1 & 1)) { break block102 } if ($67($9_1, 3303)) { break block102 } $148($7_1); } $857($5_1, 166); $1141($7_1); break block6; case 0: break block13; case 1: break block14; case 7: break block20; case 8: break block21; case 9: break block22; case 11: break block23; case 13: break block25; case 14: break block26; case 15: break block27; case 16: break block28; case 17: break block29; case 19: break block31; case 20: break block32; case 21: break block33; case 28: break block39; case 29: break block40; case 31: break block42; case 33: break block44; case 34: break block45; case 36: break block47; case 37: break block48; case 40: break block51; case 41: break block52; case 42: break block53; default: break block17; }; } if (!$9_1) { break block6 } $901($0_1, $4_1); $3 = $308($0_1, 2, $9_1, $4_1); if (!$3) { break block6 } $10_1 = $359($3); HEAP32[$0_1 + 48 >> 2] = 7; $897($0_1, $3); $4_1 = HEAP32[$3 + 4 >> 2]; $11_1 = $6_1 + 56 | 0; $15_1 = $6_1 + 52 | 0; $16_1 = $6_1 + 48 | 0; $12_1 = 0; $1_1 = 0; while (1) { $14 = HEAP16[$3 + 34 >> 1]; if (($14 | 0) <= ($1_1 | 0)) { break block6 } $0_1 = HEAPU16[$4_1 + 10 >> 1]; block107 : { block105 : { if (!($0_1 & 98)) { $13_1 = 0; $17_1 = 0; break block105; } if (!(HEAP32[$8_1 + 8 >> 2] | HEAP32[$8_1 + 12 >> 2])) { $12_1 = $12_1 + 1 | 0; break block107; } if ($0_1 & 32) { $13_1 = 1; $17_1 = 2; break block105; } $13_1 = ($0_1 & 64) >>> 6 | 0; $17_1 = $13_1 ? 3 : 1; } $0_1 = $0_1 & 1; block109 : { if (!$0_1 | !$10_1) { break block109 } $2_1 = 1; $0_1 = (($14 | 0) > 0 ? $14 : 0) + 1 | 0; while (1) { if (($0_1 | 0) == ($2_1 | 0)) { break block109 } if (($1_1 | 0) == HEAP16[(HEAP32[$10_1 + 4 >> 2] + ($2_1 << 1) | 0) - 2 >> 1]) { $0_1 = $2_1 } else { $2_1 = $2_1 + 1 | 0; continue; } break; }; } $2_1 = $891($3, $4_1); $14 = HEAP32[$8_1 + 8 >> 2] | HEAP32[$8_1 + 12 >> 2] ? 12251 : 12220; $19_1 = HEAP32[$4_1 >> 2]; $21_1 = $418($4_1, 30822); $22_1 = (HEAPU8[$4_1 + 4 | 0] & 15) != 0; $2_1 = !$2_1 | $13_1 ? 0 : HEAP32[$2_1 + 8 >> 2]; HEAP32[$11_1 >> 2] = $17_1; HEAP32[$15_1 >> 2] = $0_1; HEAP32[$16_1 >> 2] = $2_1; HEAP32[$6_1 + 44 >> 2] = $22_1; HEAP32[$6_1 + 40 >> 2] = $21_1; HEAP32[$6_1 + 36 >> 2] = $19_1; HEAP32[$6_1 + 32 >> 2] = $1_1 - $12_1; $1143($5_1, 1, $14, $6_1 + 32 | 0); } $4_1 = $4_1 + 12 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } $2_1 = HEAP32[$0_1 + 176 >> 2]; $1_1 = HEAP32[$0_1 + 180 >> 2]; break block76; } block112 : { if (!$9_1) { break block112 } if ($438($9_1, $6_1 + 456 | 0) | HEAP32[$6_1 + 460 >> 2] < 0) { break block112 } HEAP32[$7_1 + 496 >> 2] = HEAP32[$6_1 + 456 >> 2] & 2147483647; } $0_1 = HEAP32[$7_1 + 496 >> 2]; $1138($5_1, $0_1, $0_1 >> 31); break block6; } block113 : { if (!$9_1) { break block113 } if ($438($9_1, $6_1 + 456 | 0) | HEAP32[$6_1 + 460 >> 2] < 0) { break block113 } HEAP32[$7_1 + 164 >> 2] = 0; } $0_1 = HEAP32[$7_1 + 164 >> 2]; $1138($5_1, $0_1, $0_1 >> 31); break block6; } block114 : { if (!$9_1) { break block114 } if ($438($9_1, $6_1 + 456 | 0)) { break block114 } $1_1 = $29(-1, -1); $2_1 = HEAP32[$6_1 + 456 >> 2]; $0_1 = HEAP32[$6_1 + 460 >> 2]; $3 = i64toi32_i32$HIGH_BITS; if (!$2_1 & ($0_1 | 0) <= 0 | ($0_1 | 0) < 0 | !!($3 | $1_1) & ($1_1 >>> 0 <= $2_1 >>> 0 & ($0_1 | 0) >= ($3 | 0) | ($0_1 | 0) > ($3 | 0))) { break block114 } $29($2_1, $0_1); } $1138($5_1, $29(-1, -1), i64toi32_i32$HIGH_BITS); break block6; } block116 : { if (!$9_1) { break block116 } if ($438($9_1, $6_1 + 456 | 0)) { break block116 } $28(HEAP32[$6_1 + 456 >> 2], HEAP32[$6_1 + 460 >> 2]); } $1138($5_1, $28(-1, -1), i64toi32_i32$HIGH_BITS); break block6; } block118 : { if (!$9_1) { $2_1 = HEAP32[$7_1 + 500 >> 2]; break block118; } $0_1 = $830($9_1); HEAP32[$7_1 + 456 >> 2] = 0; $1_1 = $0_1; $0_1 = ($0_1 | 0) > 0; $2_1 = $0_1 ? $1_1 : 0; HEAP32[$7_1 + 500 >> 2] = $2_1; HEAP32[$7_1 + 452 >> 2] = $0_1 ? $7_1 : 0; HEAP32[$7_1 + 448 >> 2] = $0_1 ? 42 : 0; } $1138($5_1, $2_1, $2_1 >> 31); break block6; } block121 : { block120 : { if (!$9_1) { $2_1 = 65534; break block120; } $2_1 = $830($9_1); if (!($2_1 & 2)) { break block6 } $12_1 = 0; $16_1 = 0; if (!($2_1 & 16)) { break block121 } } $12_1 = 0; $16_1 = 0; if (HEAP32[$7_1 + 496 >> 2] - 1 >>> 0 < 1999) { break block121 } $17_1 = 2e3; $12_1 = 1; $16_1 = 2; } $14 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $14 + 1; $19_1 = $4_1 ? $1_1 : HEAP32[$7_1 + 20 >> 2] - 1 | 0; $21_1 = $2_1 & 65536; $22_1 = $2_1 & 1; $15_1 = $22_1 | 2; $13_1 = 0; while (1) { if (($1_1 | 0) <= ($19_1 | 0)) { block125 : { if (($1_1 | 0) == 1) { break block125 } $917($0_1, $1_1); $23_1 = $1_1 << 4; $8_1 = HEAP32[($23_1 + HEAP32[$7_1 + 16 >> 2] | 0) + 12 >> 2] + 16 | 0; while (1) { $8_1 = HEAP32[$8_1 >> 2]; if (!$8_1) { break block125 } $10_1 = HEAP32[$8_1 + 8 >> 2]; if (HEAPU8[$10_1 + 43 | 0]) { continue } if (!$68(HEAP32[$10_1 >> 2], 18315, 7)) { continue } $3 = HEAPU16[$10_1 + 38 >> 1]; $4_1 = 0; $24_1 = $10_1 + 8 | 0; $2_1 = $24_1; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $3 = HEAPU8[$2_1 + 55 | 0] & 128 ? $3 : -1; $2_1 = $2_1 + 20 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; if (!($21_1 | HEAP32[$10_1 + 28 >> 2] & 256) & (!HEAP32[$24_1 >> 2] | $3 << 16 >> 16 >= 0)) { continue } $13_1 = $13_1 + 1 | 0; if (($13_1 | 0) == 2) { $923($0_1, 0, $1_1) } $860($0_1, $14, $1_1, $10_1, 102); block130 : { if ($3 << 16 >> 16 >= 0) { $2_1 = $3 & 65535; $312($5_1, 33, $14, $15_1 + HEAP32[$5_1 + 108 >> 2] | 0, $2_1 >>> 0 <= 32 ? -1 : $2_1 - 33 | 0, $2_1 + 33 | 0); break block130; } $326($5_1, 36, $14, $15_1 + HEAP32[$5_1 + 108 >> 2] | 0); } $11_1 = ($4_1 + $11_1 | 0) + 1 | 0; $2_1 = HEAP32[$23_1 + HEAP32[$7_1 + 16 >> 2] >> 2]; HEAP32[$6_1 + 420 >> 2] = HEAP32[$10_1 >> 2]; HEAP32[$6_1 + 416 >> 2] = $2_1; $2_1 = $310($7_1, 29346, $6_1 + 416 | 0); if ($22_1) { $3 = $893($0_1); $859($5_1, 118, 0, $3, 0, $2_1, -6); $326($5_1, 84, $3, 1); } else { $859($5_1, 148, $16_1, $17_1, 0, $2_1, -6) } continue; }; } $1_1 = $1_1 + 1 | 0; continue; } break; }; $857($5_1, 166); if (HEAPU8[$7_1 + 87 | 0] | $12_1 ^ 1 | ($11_1 | 0) < 101) { break block6 } $0_1 = (Math_imul($17_1, 100) >>> 0) / ($11_1 >>> 0) | 0; $1_1 = $0_1 >>> 0 > 100; $3 = HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2]; $0_1 = $1_1 ? $0_1 : 100; $2_1 = 0; $1_1 = HEAP32[$5_1 + 108 >> 2]; $1_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block6 } $4_1 = Math_imul($2_1, 20) + $3 | 0; if (HEAPU8[$4_1 | 0] == 148) { HEAP32[$4_1 + 8 >> 2] = $0_1 } $2_1 = $2_1 + 1 | 0; continue; }; } $0_1 = 0; $4($7_1); while (1) { if (($0_1 | 0) < HEAP32[$7_1 + 20 >> 2]) { $1_1 = HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($0_1 << 4) | 0) + 4 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[18923]](HEAP32[HEAP32[HEAP32[HEAP32[$1_1 + 4 >> 2] >> 2] + 228 >> 2] + 52 >> 2]) } $0_1 = $0_1 + 1 | 0; continue; } break; }; break block6; } block138 : { block136 : { block137 : { block135 : { if (!$9_1) { if (HEAP32[$7_1 + 268 >> 2] == 18) { break block135 } break block136; } $2_1 = $830($9_1); $0_1 = ($2_1 | 0) > 0; HEAP32[$7_1 + 272 >> 2] = $0_1 ? $2_1 : 0; HEAP32[$7_1 + 268 >> 2] = $0_1 ? 18 : 0; if (($2_1 | 0) <= 0) { break block136 } break block137; } $2_1 = HEAP32[$7_1 + 272 >> 2]; } $0_1 = $2_1 >> 31; break block138; } $2_1 = 0; $0_1 = 0; } $1138($5_1, $2_1, $0_1); break block6; } $1_1 = HEAP32[$2_1 >> 2] ? $1_1 : 12; $2_1 = 0; block140 : { if (!$9_1) { break block140 } $2_1 = 1; if (!$67($9_1, 11766)) { break block140 } $2_1 = 2; if (!$67($9_1, 2601)) { break block140 } $2_1 = $67($9_1, 13312) ? 0 : 3; } HEAP32[$0_1 + 48 >> 2] = 3; $835($5_1, 3, $1_1, $2_1, 1); $326($5_1, 84, 1, 3); break block6; } HEAP32[$0_1 + 48 >> 2] = 1; $2_1 = 0; while (1) { if (($2_1 | 0) == 42) { break block143 } $0_1 = HEAP32[($2_1 << 2) + 57712 >> 2]; if (!$0_1) { break block143 } $861($5_1, 1, $0_1); $326($5_1, 84, 1, 1); $2_1 = $2_1 + 1 | 0; continue; }; } $2_1 = HEAP32[$8_1 + 8 >> 2]; $314($5_1, $1_1); if (!(!$9_1 | HEAPU8[$8_1 + 5 | 0] & 8)) { $0_1 = $313($5_1, 2, 51464); HEAP32[$0_1 + 28 >> 2] = $2_1; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1; $1_1 = $830($9_1); HEAP16[$0_1 + 22 >> 1] = 1; HEAP32[$0_1 + 32 >> 2] = $1_1; if (!(HEAPU8[$7_1 + 35 | 0] & 16) | ($2_1 | 0) != 1) { break block6 } HEAP8[$0_1 + 20 | 0] = 187; break block6; } $0_1 = $313($5_1, 3, 51472); HEAP32[$0_1 + 32 >> 2] = $2_1; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1; } $0_1 = HEAP32[$5_1 + 108 >> 2]; $1_1 = ($0_1 | 0) <= 1 ? 1 : $0_1; $0_1 = 1; block10 : { while (1) { if (($0_1 | 0) == ($1_1 | 0)) { break block10 } $2_1 = Math_imul($0_1, 20); $0_1 = $0_1 + 1 | 0; $3 = HEAP32[$5_1 + 104 >> 2]; if (HEAPU8[$2_1 + $3 | 0] != 166) { continue } break; }; HEAP8[$3 + 20 | 0] = 187; } break block6; } if (!$9_1) { if ($318($0_1)) { break block6 } $1136($5_1, HEAP32[(HEAPU8[HEAP32[$0_1 >> 2] + 84 | 0] << 3) + 51392 >> 2]); break block6; } if (HEAPU8[$7_1 + 24 | 0] & 64) { break block6 } $2_1 = 51392; block146 : { while (1) { $1_1 = HEAP32[$2_1 >> 2]; if (!$1_1) { break block146 } if ($67($9_1, $1_1)) { $2_1 = $2_1 + 8 | 0; continue; } break; }; $0_1 = HEAPU8[$2_1 + 4 | 0]; $0_1 = $0_1 ? $0_1 : 2; HEAP8[HEAP32[HEAP32[$7_1 + 16 >> 2] + 12 >> 2] + 77 | 0] = $0_1; $412($7_1, $0_1); break block6; } HEAP32[$6_1 + 400 >> 2] = $9_1; $257($0_1, 8060, $6_1 + 400 | 0); break block6; } $4_1 = HEAPU8[$25 | 0]; $31_1 = HEAP32[$2_1 >> 2]; HEAP32[$0_1 + 48 >> 2] = 6; $24_1 = 100; HEAP32[$6_1 + 456 >> 2] = 100; $30_1 = $31_1 ? $1_1 : -1; $1_1 = $4_1 & 223; $13_1 = 0; block148 : { if (!$9_1) { break block148 } if ($296(HEAP32[$3 >> 2], $6_1 + 456 | 0)) { $2_1 = HEAP32[$6_1 + 456 >> 2]; $24_1 = ($2_1 | 0) <= 0 ? 100 : $2_1; HEAP32[$6_1 + 456 >> 2] = $24_1; break block148; } $13_1 = $308($0_1, 0, $9_1, ($30_1 | 0) >= 0 ? HEAP32[HEAP32[$7_1 + 16 >> 2] + ($30_1 << 4) >> 2] : 0); $24_1 = HEAP32[$6_1 + 456 >> 2]; } $28_1 = ($1_1 | 0) == 81; $326($5_1, 71, $24_1 - 1 | 0, 1); $35_1 = $7_1 + 388 | 0; $14 = ($13_1 | 0) != 0; while (1) { block153 : { block151 : { if (HEAP32[$7_1 + 20 >> 2] <= ($21_1 | 0)) { break block151 } if (!!$31_1 & ($21_1 | 0) != ($30_1 | 0)) { break block153 } $917($0_1, $21_1); $1_1 = 0; HEAP8[$0_1 + 23 | 0] = 0; $8_1 = $21_1 << 4; $12_1 = HEAP32[($8_1 + HEAP32[$7_1 + 16 >> 2] | 0) + 12 >> 2] + 16 | 0; $2_1 = $12_1; label12 : while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $3 = HEAP32[$2_1 + 8 >> 2]; if (!!$13_1 & ($3 | 0) != ($13_1 | 0)) { continue } $4_1 = $3 + 8 | 0; $1_1 = ((HEAP32[$3 + 28 >> 2] ^ -1) >>> 7 & 1) + $1_1 | 0; while (1) { $3 = HEAP32[$4_1 >> 2]; if (!$3) { continue label12 } $4_1 = $3 + 20 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } break; }; if (!$1_1) { break block153 } $4_1 = $325($7_1, ($1_1 + $14 << 2) + 4 | 0, 0); if (!$4_1) { break block151 } if ($13_1) { HEAP32[$4_1 + 4 >> 2] = 0; $3 = 1; } else { $3 = 0 } $2_1 = $12_1; label14 : while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $1_1 = HEAP32[$2_1 + 8 >> 2]; if (!!$13_1 & ($1_1 | 0) != ($13_1 | 0)) { continue } if (!(HEAPU8[$1_1 + 28 | 0] & 128)) { $3 = $3 + 1 | 0; HEAP32[$4_1 + ($3 << 2) >> 2] = HEAP32[$1_1 + 20 >> 2]; } $1_1 = $1_1 + 8 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { continue label14 } $3 = $3 + 1 | 0; HEAP32[$4_1 + ($3 << 2) >> 2] = HEAP32[$1_1 + 44 >> 2]; $1_1 = $1_1 + 20 | 0; continue; }; } break; }; HEAP32[$4_1 >> 2] = $3; $1_1 = $3 + 8 | 0; if (($1_1 | 0) > HEAP32[$0_1 + 48 >> 2]) { HEAP32[$0_1 + 48 >> 2] = $1_1 } $835($5_1, 75, 0, 8, $1_1); HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; $859($5_1, 155, 1, $3, 8, $4_1, -14); $1_1 = HEAP32[$5_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = $21_1 } $1_1 = $858($5_1, 51, 2); HEAP32[$6_1 + 384 >> 2] = HEAP32[$8_1 + HEAP32[$7_1 + 16 >> 2] >> 2]; $859($5_1, 118, 0, 3, 0, $310($7_1, 30799, $6_1 + 384 | 0), -6); $835($5_1, 112, 2, 3, 3); $1145($5_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; $861($5_1, 2, 30062); $1_1 = $12_1; $8_1 = $14; label26 : while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { $8_1 = $12_1; label16 : while (1) { $8_1 = HEAP32[$8_1 >> 2]; if ($8_1) { $11_1 = HEAP32[$8_1 + 8 >> 2]; if (HEAPU8[$11_1 + 43 | 0] | !!$13_1 & ($11_1 | 0) != ($13_1 | 0)) { continue } $2_1 = 0; $15_1 = 0; $22_1 = 0; if (!($28_1 | !(HEAPU8[$11_1 + 28 | 0] & 128))) { $15_1 = $359($11_1); $22_1 = $1060($0_1, HEAPU16[$15_1 + 50 >> 1]); $835($5_1, 75, 1, $22_1, (HEAPU16[$15_1 + 50 >> 1] + $22_1 | 0) - 1 | 0); } $1099($0_1, $11_1, 102, 0, 1, 0, $6_1 + 452 | 0, $6_1 + 448 | 0); $326($5_1, 71, 0, 7); $3 = $11_1 + 8 | 0; $1_1 = $3; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $326($5_1, 71, 0, $2_1 + 8 | 0); $2_1 = $2_1 + 1 | 0; $1_1 = $1_1 + 20 | 0; continue; } break; }; $19_1 = HEAP32[$6_1 + 452 >> 2]; $326($5_1, 36, $19_1, 0); $32_1 = $326($5_1, 86, 7, 1); block171 : { if (!(HEAPU8[$11_1 + 28 | 0] & 128)) { $2_1 = 0; $1_1 = HEAP16[$11_1 + 34 >> 1]; $4_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = -1; while (1) { if (($2_1 | 0) != ($4_1 | 0)) { $1_1 = !(HEAPU8[(HEAP32[$11_1 + 4 >> 2] + Math_imul($2_1, 12) | 0) + 10 | 0] & 32) + $1_1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $1_1 = $1_1 - (HEAP16[$11_1 + 32 >> 1] == ($1_1 | 0)) | 0; break block171; } $1_1 = HEAPU16[$359($11_1) + 52 >> 1] - 1 | 0; } if (($1_1 | 0) >= 0) { $835($5_1, 94, $19_1, $1_1, 3); $1146($5_1, 3); } block173 : { if (!$15_1 | $28_1) { break block173 } $2_1 = $312($5_1, 41, $19_1, 0, $22_1, HEAPU16[$15_1 + 50 >> 1]); $858($5_1, 51, $22_1); HEAP32[$6_1 + 368 >> 2] = HEAP32[$11_1 >> 2]; $859($5_1, 118, 0, 3, 0, $310($7_1, 6528, $6_1 + 368 | 0), -6); $1145($5_1); $1_1 = HEAP32[$5_1 + 108 >> 2]; block175 : { if (HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0]) { HEAP32[20687] = $1_1; $2_1 = 82740; break block175; } $2_1 = HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0; HEAP32[$2_1 + 8 >> 2] = $1_1; $2_1 = $2_1 + 20 | 0; } HEAP32[$2_1 + 8 >> 2] = $1_1; $2_1 = 0; while (1) { if (HEAPU16[$15_1 + 50 >> 1] <= $2_1 >>> 0) { break block173 } $1147($0_1, $15_1, $19_1, $2_1, $2_1 + $22_1 | 0); $2_1 = $2_1 + 1 | 0; continue; }; } $33_1 = HEAP32[$11_1 + 28 >> 2] & 65536; $2_1 = 0; while (1) { block177 : { block182 : { block184 : { block183 : { if (($2_1 | 0) < HEAP16[$11_1 + 34 >> 1]) { if (HEAP16[$11_1 + 32 >> 1] == ($2_1 | 0)) { break block177 } $26_1 = Math_imul($2_1, 12); $1_1 = $26_1 + HEAP32[$11_1 + 4 >> 2] | 0; block179 : { if ($33_1) { $10_1 = HEAPU8[$1_1 + 4 | 0]; $16_1 = $10_1 >>> 0 > 31; $4_1 = $16_1; break block179; } $10_1 = HEAPU8[$1_1 + 4 | 0]; $16_1 = 0; $4_1 = HEAP8[$1_1 + 5 | 0] > 65; } $27 = $4_1; if (!($27 | $10_1 & 15)) { break block177 } if (HEAPU8[$1_1 + 10 | 0] & 32) { $23_1 = 3; $890($5_1, $11_1, $19_1, $2_1, 3); $17_1 = 5; $4_1 = -1; break block182; } if (!HEAPU16[$1_1 + 8 >> 1]) { break block183 } HEAP32[$6_1 + 444 >> 2] = 0; $371($7_1, $891($11_1, $1_1), HEAPU8[$7_1 + 84 | 0], HEAPU8[$1_1 + 5 | 0], $6_1 + 444 | 0); $4_1 = HEAP32[$6_1 + 444 >> 2]; if (!$4_1) { break block183 } $10_1 = HEAPU16[$4_1 + 16 >> 1]; $200($4_1); $17_1 = HEAPU8[($10_1 & 63) + 31328 | 0]; break block184; } $1_1 = HEAP32[$11_1 + 16 >> 2]; if (!(!$1_1 | HEAPU8[$7_1 + 33 | 0] & 2)) { $1_1 = $887($7_1, $1_1, 0); if (!HEAPU8[$7_1 + 87 | 0]) { HEAP32[$0_1 + 56 >> 2] = $19_1 + 1; $2_1 = HEAP32[$0_1 + 60 >> 2]; $4_1 = $2_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $4_1; $10_1 = $1_1 + 8 | 0; $16_1 = $2_1 - 1 | 0; $2_1 = HEAP32[$1_1 >> 2]; while (1) { if (($2_1 | 0) >= 2) { $2_1 = $2_1 - 1 | 0; $1059($0_1, HEAP32[$10_1 + ($2_1 << 4) >> 2], $16_1, 0); continue; } break; }; $1148($0_1, HEAP32[$10_1 >> 2], $4_1, 16); $1013($5_1, $16_1); HEAP32[$0_1 + 56 >> 2] = 0; HEAP32[$6_1 + 352 >> 2] = HEAP32[$11_1 >> 2]; $859($5_1, 118, 0, 3, 0, $310($7_1, 6696, $6_1 + 352 | 0), -6); $1145($5_1); $1013($5_1, $4_1); } $358($7_1, $1_1); } block188 : { if ($28_1) { break block188 } $4_1 = -1; $16_1 = 0; $23_1 = HEAP32[$6_1 + 448 >> 2]; $10_1 = 0; while (1) { $1_1 = HEAP32[$3 >> 2]; if (!$1_1) { break block188 } $2_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $2_1; if (($1_1 | 0) != ($15_1 | 0)) { $4_1 = $1149($0_1, $1_1, $19_1, 0, 0, $6_1 + 444 | 0, $10_1, $4_1); $326($5_1, 86, $16_1 + 8 | 0, 1); $10_1 = $16_1 + $23_1 | 0; $2_1 = $312($5_1, 29, $10_1, $2_1, $4_1, HEAPU16[$1_1 + 52 >> 1]); $861($5_1, 3, 30181); $835($5_1, 112, 7, 3, 3); $861($5_1, 4, 30118); $835($5_1, 112, 4, 3, 3); $17_1 = $861($5_1, 4, HEAP32[$1_1 >> 2]); $835($5_1, 112, 4, 3, 3); $20_1 = $1145($5_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; if (!(HEAPU8[$11_1 + 28 | 0] & 128)) { $326($5_1, 142, $10_1, 3); $2_1 = $835($5_1, 54, 3, 0, (HEAPU16[$1_1 + 52 >> 1] + $4_1 | 0) - 1 | 0); $861($5_1, 3, 30150); $835($5_1, 112, 7, 3, 3); $861($5_1, 4, 30139); $863($5_1, $17_1 - 1 | 0); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; } $3 = 0; $2_1 = 0; while (1) { if ($2_1 >>> 0 < HEAPU16[$1_1 + 50 >> 1]) { if (HEAP32[HEAP32[$1_1 + 32 >> 2] + ($2_1 << 2) >> 2] != 33712) { if (!$3) { $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; } $835($5_1, 94, $10_1, $2_1, 3); $835($5_1, 53, 3, $3, $2_1 + $4_1 | 0); } $2_1 = $2_1 + 1 | 0; continue; } break; }; if ($3) { $2_1 = $857($5_1, 9); $1013($5_1, $3); $861($5_1, 3, 30181); $835($5_1, 112, 7, 3, 3); $861($5_1, 4, 30091); $863($5_1, $17_1 - 1 | 0); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; } if (HEAPU8[$1_1 + 54 | 0]) { $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $2_1 = 0; while (1) { if ($2_1 >>> 0 < HEAPU16[$1_1 + 50 >> 1]) { $26_1 = HEAP16[HEAP32[$1_1 + 4 >> 2] + ($2_1 << 1) >> 1]; block201 : { if (($26_1 | 0) >= 0) { if (HEAPU8[(HEAP32[$11_1 + 4 >> 2] + Math_imul($26_1, 12) | 0) + 4 | 0] & 15) { break block201 } } $326($5_1, 51, $2_1 + $4_1 | 0, $3); } $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = $858($5_1, 39, $10_1); $863($5_1, $3); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; $312($5_1, 41, $10_1, $3, $4_1, HEAPU16[$1_1 + 50 >> 1]); $861($5_1, 3, 30035); $863($5_1, $17_1); $1013($5_1, $3); } HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($20_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; $1150($0_1, HEAP32[$6_1 + 444 >> 2]); $10_1 = $1_1; } $16_1 = $16_1 + 1 | 0; $3 = $1_1 + 20 | 0; continue; }; } $326($5_1, 39, $19_1, $32_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : (HEAP32[$5_1 + 104 >> 2] + Math_imul($32_1, 20) | 0) - 20 | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; if (!$15_1) { continue label16 } $1061($0_1, $22_1, HEAPU16[$15_1 + 50 >> 1]); continue label16; } $17_1 = 5; } block206 : { if (HEAPU8[$11_1 + 28 | 0] & 128) { $23_1 = $889($359($11_1), $2_1 << 16 >> 16); break block206; } $23_1 = $1111($11_1, $2_1 << 16 >> 16); } $4_1 = $19_1; } $20_1 = HEAP32[$0_1 + 60 >> 2]; $10_1 = $20_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $34_1 = $20_1 - 1 | 0; block207 : { if (!(HEAPU8[$1_1 + 4 | 0] & 15)) { break block207 } $29_1 = $312($5_1, 18, $4_1, $10_1, $23_1, $17_1); $20_1 = HEAP32[$5_1 + 108 >> 2]; block209 : { if (($4_1 | 0) < 0) { $18_1 = $29_1; if (($20_1 | 0) <= 0) { break block209 } HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($20_1, 20) | 0) - 18 >> 1] = 15; $18_1 = $29_1; break block209; } if (($20_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($20_1, 20) | 0) - 18 >> 1] = 13 } $835($5_1, 94, $4_1, $23_1, 3); $1151($5_1, $11_1, $2_1, 3); $18_1 = $326($5_1, 52, 3, $10_1); } $20_1 = HEAP32[$11_1 >> 2]; HEAP32[$6_1 + 340 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$6_1 + 336 >> 2] = $20_1; $859($5_1, 118, 0, 3, 0, $310($7_1, 6307, $6_1 + 336 | 0), -6); if (!$27) { break block207 } $863($5_1, $34_1); $20_1 = HEAP32[$5_1 + 108 >> 2]; block212 : { if (HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0]) { HEAP32[20687] = $20_1; $18_1 = 82740; break block212; } $27 = HEAP32[$5_1 + 104 >> 2]; HEAP32[($27 + Math_imul($29_1, 20) | 0) + 8 >> 2] = $20_1; $18_1 = $27 + Math_imul($18_1, 20) | 0; } HEAP32[$18_1 + 8 >> 2] = $20_1; } block216 : { block215 : { if ($16_1) { $312($5_1, 18, $4_1, $10_1, $23_1, $17_1); $4_1 = HEAP32[$5_1 + 108 >> 2]; if (($4_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = HEAPU8[(HEAPU8[$1_1 + 4 | 0] >>> 4 | 0) + 51343 | 0] } $1_1 = HEAP32[(HEAPU8[$1_1 + 4 | 0] >>> 2 & 60) + 76316 >> 2]; $4_1 = HEAP32[$11_1 >> 2]; HEAP32[$6_1 + 296 >> 2] = HEAP32[$26_1 + HEAP32[$11_1 + 4 >> 2] >> 2]; HEAP32[$6_1 + 292 >> 2] = $4_1; HEAP32[$6_1 + 288 >> 2] = $1_1; $1_1 = $310($7_1, 6265, $6_1 + 288 | 0); break block215; } if ($33_1) { break block216 } $1_1 = HEAP8[$1_1 + 5 | 0]; if (($1_1 | 0) == 66) { $312($5_1, 18, $4_1, $10_1, $23_1, $17_1); $1_1 = HEAP32[$5_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 28 } $1_1 = HEAP32[$11_1 >> 2]; HEAP32[$6_1 + 308 >> 2] = HEAP32[$26_1 + HEAP32[$11_1 + 4 >> 2] >> 2]; HEAP32[$6_1 + 304 >> 2] = $1_1; $1_1 = $310($7_1, 6327, $6_1 + 304 | 0); break block215; } if (($1_1 | 0) < 67) { break block216 } $312($5_1, 18, $4_1, $10_1, $23_1, $17_1); $1_1 = HEAP32[$5_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 27 } if (($4_1 | 0) >= 0) { $890($5_1, $11_1, $19_1, $2_1, 3) } $859($5_1, 96, 3, 1, 0, 21006, -1); $312($5_1, 18, -1, $10_1, 3, $17_1); $1_1 = HEAP32[$5_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 28 } $1_1 = HEAP32[$11_1 >> 2]; HEAP32[$6_1 + 324 >> 2] = HEAP32[$26_1 + HEAP32[$11_1 + 4 >> 2] >> 2]; HEAP32[$6_1 + 320 >> 2] = $1_1; $1_1 = $310($7_1, 6287, $6_1 + 320 | 0); } $859($5_1, 118, 0, 3, 0, $1_1, -6); } $1013($5_1, $34_1); $1145($5_1); $1013($5_1, $10_1); } $2_1 = $2_1 + 1 | 0; continue; }; } break; }; while (1) { $12_1 = HEAP32[$12_1 >> 2]; if (!$12_1) { break block153 } $1_1 = HEAP32[$12_1 + 8 >> 2]; if (!!$13_1 & ($1_1 | 0) != ($13_1 | 0) | HEAPU8[$1_1 + 43 | 0] != 1) { continue } if (HEAP16[$1_1 + 34 >> 1] <= 0) { if (!$320($35_1, HEAP32[HEAP32[$1_1 + 48 >> 2] >> 2])) { continue } } $897($0_1, $1_1); $2_1 = HEAP32[$1_1 + 52 >> 2]; if (!$2_1) { continue } $2_1 = HEAP32[$2_1 + 8 >> 2]; if (!$2_1) { continue } $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1 | HEAP32[$2_1 >> 2] < 4 | !HEAP32[$2_1 + 96 >> 2]) { continue } $835($5_1, 174, $21_1, 3, $28_1); HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] + 1; $1043($5_1, $1_1, -16); $1_1 = $858($5_1, 51, 3); $1145($5_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; continue; }; } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!!$13_1 & ($2_1 | 0) != ($13_1 | 0)) { continue } block227 : { if (!(HEAPU8[$2_1 + 28 | 0] & 128)) { $3 = $8_1 + 1 | 0; break block227; } $3 = $2_1 + 8 | 0; $4_1 = $8_1; while (1) { $3 = HEAP32[$3 >> 2]; if (!(!$3 | ((HEAPU8[$3 + 55 | 0] | HEAPU8[$3 + 56 | 0] << 8) & 3) == 2)) { $3 = $3 + 20 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; $3 = $8_1; $8_1 = $4_1; } $4_1 = $8_1 + 8 | 0; $2_1 = $2_1 + 8 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { $8_1 = $3; continue label26; } if (!HEAP32[$2_1 + 36 >> 2]) { $8_1 = $835($5_1, 54, $3 + 8 | 0, 0, $4_1); $861($5_1, 4, HEAP32[$2_1 >> 2]); $835($5_1, 112, 4, 2, 3); $1145($5_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; } $2_1 = $2_1 + 20 | 0; $3 = $3 + 1 | 0; continue; }; }; } $0_1 = $313($5_1, 7, 51360); if ($0_1) { HEAP32[$0_1 + 116 >> 2] = 16052; HEAP8[$0_1 + 101 | 0] = 255; HEAP32[$0_1 + 56 >> 2] = 11976; HEAP8[$0_1 + 41 | 0] = 255; HEAP32[$0_1 + 8 >> 2] = 1 - $24_1; } HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2]) + 12 >> 2] = HEAP32[$5_1 + 108 >> 2] - 2; break block6; } $21_1 = $21_1 + 1 | 0; continue; }; } if (!$9_1) { break block6 } $0_1 = $436($9_1, 0); $1_1 = $0_1 ? 12 : 4; $0_1 = $0_1 ? 51568 : 31420; $2_1 = 2; while (1) { if (($2_1 | 0) == 4) { break block6 } $388($7_1, 14573, $2_1, 1, $0_1, 43, 0, 0, 0, 0, 0); $3 = $390($7_1, 14573, $2_1, 1, 0); HEAP32[$3 + 4 >> 2] = $1_1 | HEAP32[$3 + 4 >> 2] & -2097157; $2_1 = $2_1 + 1 | 0; continue; }; } $2_1 = HEAP32[$0_1 + 48 >> 2]; $12_1 = $2_1 + 5 | 0; HEAP32[$0_1 + 48 >> 2] = $12_1; $17_1 = $2_1 + 3 | 0; $19_1 = $2_1 + 2 | 0; $11_1 = $2_1 + 1 | 0; $15_1 = HEAP32[HEAP32[(HEAP32[$7_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2] + 16 >> 2]; while (1) { if (!$15_1) { break block6 } block235 : { if ($9_1) { $3 = $308($0_1, 0, $9_1, $4_1); $15_1 = 0; break block235; } $3 = HEAP32[$15_1 + 8 >> 2]; $15_1 = HEAP32[$15_1 >> 2]; } if (!HEAP32[$3 + 48 >> 2] | (HEAPU8[$3 + 43 | 0] | !$3)) { continue } $2_1 = HEAP32[$7_1 + 16 >> 2]; $1_1 = $309($7_1, HEAP32[$3 + 60 >> 2]); $4_1 = HEAP32[$2_1 + ($1_1 << 4) >> 2]; $917($0_1, $1_1); $988($0_1, $1_1, HEAP32[$3 + 20 >> 2], 0, HEAP32[$3 >> 2]); $2_1 = $12_1 + HEAP16[$3 + 34 >> 1] | 0; if (($2_1 | 0) > HEAP32[$0_1 + 48 >> 2]) { HEAP32[$0_1 + 48 >> 2] = $2_1 } $860($0_1, 0, $1_1, $3, 102); $861($5_1, $11_1, HEAP32[$3 >> 2]); $8_1 = 1; $10_1 = $3 + 48 | 0; $2_1 = $10_1; while (1) { $14 = HEAP32[$2_1 >> 2]; if ($14) { $2_1 = $319($7_1, HEAP32[$14 + 8 >> 2], $4_1); block238 : { if (!$2_1) { break block238 } HEAP32[$6_1 + 456 >> 2] = 0; $988($0_1, $1_1, HEAP32[$2_1 + 20 >> 2], 0, HEAP32[$2_1 >> 2]); if ($1153($0_1, $2_1, $14, $6_1 + 456 | 0, 0)) { break block6 } $13_1 = HEAP32[$6_1 + 456 >> 2]; if (!$13_1) { $860($0_1, $8_1, $1_1, $2_1, 102); break block238; } $835($5_1, 102, $8_1, HEAP32[$13_1 + 44 >> 2], $1_1); $1097($0_1, $13_1); } $2_1 = $14 + 4 | 0; $8_1 = $8_1 + 1 | 0; continue; } break; }; if (($8_1 | 0) > HEAP32[$0_1 + 44 >> 2]) { HEAP32[$0_1 + 44 >> 2] = $8_1 } $16_1 = 1; $13_1 = $858($5_1, 36, 0); while (1) { $8_1 = HEAP32[$10_1 >> 2]; if ($8_1) { $14 = $319($7_1, HEAP32[$8_1 + 8 >> 2], $4_1); HEAP32[$6_1 + 452 >> 2] = 0; HEAP32[$6_1 + 456 >> 2] = 0; if ($14) { $1153($0_1, $14, $8_1, $6_1 + 456 | 0, $6_1 + 452 | 0) } $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $1_1 = HEAP32[$8_1 + 20 >> 2]; $2_1 = $12_1 + $1_1 | 0; if (($2_1 | 0) > HEAP32[$0_1 + 48 >> 2]) { HEAP32[$0_1 + 48 >> 2] = $2_1 } $21_1 = $8_1 + 36 | 0; $2_1 = 0; while (1) { if (($1_1 | 0) > ($2_1 | 0)) { $1_1 = HEAP32[$6_1 + 452 >> 2]; $18_1 = HEAP32[($1_1 ? $1_1 + ($2_1 << 2) | 0 : $21_1 + ($2_1 << 3) | 0) >> 2]; $1_1 = $2_1 + $12_1 | 0; $890($5_1, $3, 0, $18_1, $1_1); $326($5_1, 51, $1_1, $10_1); $2_1 = $2_1 + 1 | 0; $1_1 = HEAP32[$8_1 + 20 >> 2]; continue; } break; }; $2_1 = HEAP32[$6_1 + 456 >> 2]; block246 : { if ($2_1) { $859($5_1, 96, $12_1, $1_1, 0, $1098($7_1, $2_1), HEAP32[$8_1 + 20 >> 2]); $312($5_1, 29, $16_1, $10_1, $12_1, HEAP32[$8_1 + 20 >> 2]); break block246; } if (!$14) { break block246 } $835($5_1, 30, $16_1, HEAP32[$5_1 + 108 >> 2] + 2 | 0, $12_1); $863($5_1, $10_1); } $326($5_1, HEAP32[$3 + 28 >> 2] & 128 ? 75 : 135, 0, $19_1); $1_1 = HEAP32[$8_1 + 8 >> 2]; HEAP32[$6_1 + 276 >> 2] = $16_1 - 1; HEAP32[$6_1 + 272 >> 2] = $1_1; $1143($5_1, $17_1, 18733, $6_1 + 272 | 0); $326($5_1, 84, $11_1, 4); $1013($5_1, $10_1); $10($7_1, HEAP32[$6_1 + 452 >> 2]); $10_1 = $8_1 + 4 | 0; $16_1 = $16_1 + 1 | 0; continue; } break; }; $326($5_1, 39, 0, $13_1 + 1 | 0); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($13_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; continue; }; } if (!$9_1) { break block6 } $3 = $319($7_1, $9_1, $4_1); if (!$3 | HEAPU8[$3 + 43 | 0]) { break block6 } $1_1 = HEAP32[$3 + 48 >> 2]; if (!$1_1) { break block6 } $2_1 = $309($7_1, HEAP32[$3 + 60 >> 2]); HEAP32[$0_1 + 48 >> 2] = 8; $917($0_1, $2_1); $0_1 = $6_1 + 268 | 0; $4_1 = $6_1 + 264 | 0; $8_1 = $6_1 + 260 | 0; $12_1 = $6_1 + 256 | 0; while (1) { if (!$1_1) { break block6 } $14 = $1_1 + 36 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) < HEAP32[$1_1 + 20 >> 2]) { $11_1 = $14 + ($2_1 << 3) | 0; $13_1 = HEAP32[HEAP32[$3 + 4 >> 2] + Math_imul(HEAP32[$11_1 >> 2], 12) >> 2]; $11_1 = HEAP32[$11_1 + 4 >> 2]; $15_1 = HEAP32[$1_1 + 8 >> 2]; $16_1 = $1154(HEAPU8[$1_1 + 26 | 0]); $17_1 = HEAPU8[$1_1 + 25 | 0]; HEAP32[$0_1 >> 2] = 20465; HEAP32[$4_1 >> 2] = $1154($17_1); HEAP32[$8_1 >> 2] = $16_1; HEAP32[$12_1 >> 2] = $11_1; HEAP32[$6_1 + 252 >> 2] = $13_1; HEAP32[$6_1 + 248 >> 2] = $15_1; HEAP32[$6_1 + 244 >> 2] = $2_1; HEAP32[$6_1 + 240 >> 2] = $10_1; $1143($5_1, 1, 4235, $6_1 + 240 | 0); $2_1 = $2_1 + 1 | 0; continue; } break; }; $10_1 = $10_1 + 1 | 0; $1_1 = HEAP32[$1_1 + 4 >> 2]; continue; }; } while (1) { if (($10_1 | 0) == 66) { break block6 } HEAP32[$6_1 + 224 >> 2] = HEAP32[($10_1 << 4) + 35360 >> 2]; $1143($5_1, 1, 8933, $6_1 + 224 | 0); $10_1 = $10_1 + 1 | 0; continue; }; } HEAP32[$0_1 + 48 >> 2] = 1; $2_1 = $7_1 + 396 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block6 } HEAP32[$6_1 + 208 >> 2] = HEAP32[HEAP32[$2_1 + 8 >> 2] + 4 >> 2]; $1143($5_1, 1, 8933, $6_1 + 208 | 0); continue; }; } $1_1 = HEAP32[$7_1 + 24 >> 2]; HEAP32[$0_1 + 48 >> 2] = 6; $1_1 = $1_1 >>> 5 & 1; $0_1 = 0; while (1) { if (($0_1 | 0) != 23) { $2_1 = ($0_1 << 2) + 82468 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $1155($5_1, $2_1, 1, $1_1); $2_1 = $2_1 + 36 | 0; continue; } break; }; $0_1 = $0_1 + 1 | 0; continue; } break; }; $2_1 = $7_1 + 424 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block6 } $1155($5_1, HEAP32[$2_1 + 8 >> 2], 0, $1_1); continue; }; } HEAP32[$0_1 + 48 >> 2] = 2; $2_1 = $7_1 + 440 | 0; $1_1 = 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block6 } HEAP32[$6_1 + 196 >> 2] = HEAP32[HEAP32[$2_1 + 8 >> 2] >> 2]; HEAP32[$6_1 + 192 >> 2] = $1_1; $1143($5_1, 1, 5312, $6_1 + 192 | 0); $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$0_1 + 48 >> 2] = 3; $2_1 = 0; while (1) { if (HEAP32[$7_1 + 20 >> 2] <= ($2_1 | 0)) { break block6 } $0_1 = HEAP32[$7_1 + 16 >> 2] + ($2_1 << 4) | 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; if ($1_1) { $0_1 = HEAP32[$0_1 >> 2]; HEAP32[$6_1 + 184 >> 2] = $439($1_1); HEAP32[$6_1 + 180 >> 2] = $0_1; HEAP32[$6_1 + 176 >> 2] = $2_1; $1143($5_1, 1, 4244, $6_1 + 176 | 0); } $2_1 = $2_1 + 1 | 0; continue; }; } if (!$9_1) { break block6 } $1_1 = $319($7_1, $9_1, $4_1); if (!$1_1) { break block6 } $2_1 = $309($7_1, HEAP32[$1_1 + 60 >> 2]); HEAP32[$0_1 + 48 >> 2] = 5; $917($0_1, $2_1); $2_1 = $1_1 + 8 | 0; $3 = $6_1 + 160 | 0; $1_1 = 0; while (1) { $0_1 = HEAP32[$2_1 >> 2]; if (!$0_1) { break block6 } $2_1 = HEAPU8[$0_1 + 55 | 0] | HEAPU8[$0_1 + 56 | 0] << 8; $4_1 = HEAPU8[$0_1 + 54 | 0]; $8_1 = HEAP32[$0_1 >> 2]; HEAP32[$3 >> 2] = HEAP32[$0_1 + 36 >> 2] != 0; HEAP32[$6_1 + 148 >> 2] = $8_1; HEAP32[$6_1 + 152 >> 2] = ($4_1 | 0) != 0; HEAP32[$6_1 + 156 >> 2] = HEAP32[(($2_1 & 3) << 2) + 51332 >> 2]; HEAP32[$6_1 + 144 >> 2] = $1_1; $1143($5_1, 1, 12227, $6_1 + 144 | 0); $2_1 = $0_1 + 20 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } if (!$9_1) { break block6 } $1_1 = $778($7_1, $9_1, $4_1); if (!$1_1) { $1_1 = $308($0_1, 2, $9_1, $4_1); if (!$1_1 | !(HEAPU8[$1_1 + 28 | 0] & 128)) { break block6 } $1_1 = $359($1_1); if (!$1_1) { break block6 } } $2_1 = $309($7_1, HEAP32[$1_1 + 24 >> 2]); $3 = !(HEAP32[$8_1 + 8 >> 2] | HEAP32[$8_1 + 12 >> 2]); $4_1 = HEAPU16[($3 ? 50 : 52) + $1_1 >> 1]; HEAP32[$0_1 + 48 >> 2] = $3 ? 3 : 6; $12_1 = HEAP32[$1_1 + 12 >> 2]; $917($0_1, $2_1); $2_1 = 0; while (1) { if (($2_1 | 0) == ($4_1 | 0)) { break block6 } $3 = HEAP16[HEAP32[$1_1 + 4 >> 2] + ($2_1 << 1) >> 1]; if (($3 | 0) >= 0) { $10_1 = HEAP32[HEAP32[$12_1 + 4 >> 2] + Math_imul($3, 12) >> 2] } else { $10_1 = 0 } HEAP32[$6_1 + 136 >> 2] = $10_1; HEAP32[$6_1 + 132 >> 2] = $3; HEAP32[$6_1 + 128 >> 2] = $2_1; $1143($5_1, 1, 18727, $6_1 + 128 | 0); if (HEAP32[$8_1 + 8 >> 2] | HEAP32[$8_1 + 12 >> 2]) { $3 = HEAPU8[HEAP32[$1_1 + 28 >> 2] + $2_1 | 0]; $10_1 = HEAP32[HEAP32[$1_1 + 32 >> 2] + ($2_1 << 2) >> 2]; HEAP32[$6_1 + 120 >> 2] = HEAPU16[$1_1 + 50 >> 1] > $2_1 >>> 0; HEAP32[$6_1 + 116 >> 2] = $10_1; HEAP32[$6_1 + 112 >> 2] = $3; $1143($5_1, 4, 18732, $6_1 + 112 | 0); } $326($5_1, 84, 1, HEAP32[$0_1 + 48 >> 2]); $2_1 = $2_1 + 1 | 0; continue; }; } HEAP32[$0_1 + 48 >> 2] = 6; $901($0_1, $4_1); $10_1 = $6_1 + 84 | 0; while (1) { if (HEAP32[$7_1 + 20 >> 2] <= ($15_1 | 0)) { break block6 } $0_1 = HEAP32[$7_1 + 16 >> 2]; block256 : { if ($4_1) { if ($66($4_1, HEAP32[$0_1 + ($15_1 << 4) >> 2])) { break block256 } } $12_1 = $15_1 << 4; $8_1 = HEAP32[($12_1 + $0_1 | 0) + 12 >> 2]; $0_1 = HEAP32[$8_1 + 12 >> 2]; while (1) { $1_1 = $8_1 + 16 | 0; block257 : { label46 : while (1) { $2_1 = $1_1; if (!$0_1) { break block257 } while (1) { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { $0_1 = 0; continue label46; } $3 = HEAP32[$2_1 + 8 >> 2]; if (HEAPU16[$3 + 34 >> 1]) { continue } break; }; break; }; HEAP32[$6_1 + 96 >> 2] = HEAP32[$3 >> 2]; $1_1 = $310($7_1, 29271, $6_1 + 96 | 0); if ($1_1) { $352($7_1, $1_1, 16, $6_1 + 456 | 0); $100(HEAP32[$6_1 + 456 >> 2]); $13($7_1, $1_1); } if (HEAPU8[$7_1 + 87 | 0]) { $257(HEAP32[$7_1 + 264 >> 2], 1162, 0); HEAP32[HEAP32[$7_1 + 264 >> 2] + 12 >> 2] = 7; } $0_1 = $0_1 - 1 | 0; $8_1 = HEAP32[($12_1 + HEAP32[$7_1 + 16 >> 2] | 0) + 12 >> 2]; continue; } break; }; $1_1 = $8_1 + 16 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block256 } $2_1 = HEAP32[$1_1 + 8 >> 2]; if ($9_1) { if ($66($9_1, HEAP32[$2_1 >> 2])) { continue } } $0_1 = 1856; block263 : { block264 : { switch (HEAPU8[$2_1 + 43 | 0] - 1 | 0) { case 0: $0_1 = 11877; break block263; case 1: break block263; default: break block264; }; } $0_1 = HEAPU8[$2_1 + 29 | 0] & 16 ? 1728 : 14440; } $8_1 = HEAP32[$12_1 + HEAP32[$7_1 + 16 >> 2] >> 2]; $3 = HEAP32[$2_1 >> 2]; block265 : { if ($68($3, 18315, 7)) { break block265 } $14 = $3 + 7 | 0; if (!$67($14, 9330)) { $3 = 18220; break block265; } if ($67($14, 9311)) { break block265 } $3 = 18201; } $14 = HEAP16[$2_1 + 34 >> 1]; $2_1 = HEAP32[$2_1 + 28 >> 2]; HEAP32[$10_1 >> 2] = $2_1 >>> 16 & 1; $11_1 = $6_1 - -64 | 0; HEAP32[$11_1 + 16 >> 2] = $2_1 >>> 7 & 1; HEAP32[$6_1 + 76 >> 2] = $14; HEAP32[$6_1 + 72 >> 2] = $0_1; HEAP32[$6_1 + 68 >> 2] = $3; HEAP32[$6_1 + 64 >> 2] = $8_1; $1143($5_1, 1, 12259, $11_1); continue; }; } $15_1 = $15_1 + 1 | 0; continue; }; } $1138($5_1, $2_1, $1_1); } $13($7_1, $25); $10($7_1, $9_1); } $0_1 = $6_1 + 496 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $927($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $6_1 = $856($0_1); block : { if (!$6_1 | HEAP32[$0_1 + 40 >> 2]) { break block } $3 = 0; if ($1_1) { $4_1 = $910($0_1, $1_1, $1_1, $5_1 + 12 | 0); if (($4_1 | 0) < 0 | ($4_1 | 0) == 1) { break block } } block2 : { if (!$2_1) { break block2 } if ($993($0_1, 0, 0, $2_1, 0)) { break block2 } $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; $862($0_1, $2_1, $3); } $326($6_1, 5, $4_1, $3); $314($6_1, $4_1); } $11(HEAP32[$0_1 >> 2], $2_1); $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $928($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $1_1; $0_1 = $856($0_1); if ($0_1) { $835($0_1, 4, 0, $1_1, -1); $314($0_1, 0); } } function $929($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 + -64 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($1_1 << 4) >> 2]; $1_1 = 1; while (1) { if (($1_1 | 0) != 5) { HEAP32[$4_1 + 16 >> 2] = $1_1; $6_1 = $63(24, $4_1 + 32 | 0, 16709, $4_1 + 16 | 0); if ($319(HEAP32[$0_1 >> 2], $6_1, $5_1)) { HEAP32[$4_1 + 12 >> 2] = $3; HEAP32[$4_1 + 8 >> 2] = $2_1; HEAP32[$4_1 + 4 >> 2] = $6_1; HEAP32[$4_1 >> 2] = $5_1; $884($0_1, 19668, $4_1); } $1_1 = $1_1 + 1 | 0; continue; } break; }; $0_1 = $4_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $930($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $856($0_1); $5_1 = $893($0_1); if (($1_1 | 0) <= 1) { $257($0_1, 18265, 0) } $835($4_1, 144, $1_1, $5_1, $2_1); $4_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($4_1 ? $4_1 : $0_1) + 21 | 0] = 1; $2_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($2_1 << 4) >> 2]; HEAP32[$3 + 12 >> 2] = $5_1; HEAP32[$3 + 8 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $2_1; $884($0_1, 16841, $3); $894($0_1, $5_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $931($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $1_1 = $936($0_1, $1_1, 0); if (!(HEAPU8[HEAP32[$0_1 >> 2] + 177 | 0] | !$3 & ($4_1 | 0) == -1)) { HEAP32[$5_1 >> 2] = __wasm_rotl_i64(HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], 32); HEAP32[$5_1 + 4 >> 2] = i64toi32_i32$HIGH_BITS; $257($0_1, 29452, $5_1); } $959($0_1, $1_1, $2_1, 1); $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $932($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; block1 : { block4 : { block3 : { if (!$1_1) { $0_1 = $325($4_1, 56, 0); if (!$0_1) { break block1 } HEAP32[$0_1 >> 2] = 1; HEAP32[$0_1 + 4 >> 2] = 1; wasm2js_memory_fill($0_1 + 8 | 0, 0, 48); HEAP32[$0_1 + 24 >> 2] = -1; $1_1 = 0; break block3; } $0_1 = $1086($0_1, $1_1, 1, HEAP32[$1_1 >> 2]); if (!$0_1) { break block4 } $1_1 = HEAP32[$0_1 >> 2] - 1 | 0; } $1_1 = (Math_imul($1_1, 48) + $0_1 | 0) + 8 | 0; if (!(!$3 | !HEAP32[$3 >> 2])) { HEAP32[$1_1 >> 2] = $875($4_1, $3); HEAP32[$1_1 + 44 >> 2] = $875($4_1, $2_1); return $0_1; } $2_1 = $875($4_1, $2_1); HEAP32[$1_1 + 44 >> 2] = 0; HEAP32[$1_1 >> 2] = $2_1; return $0_1; } $794($4_1, $1_1); } return 0; } function $933($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1) { var $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $12_1 = global$0 - 224 | 0; $13_1 = $12_1; if (global$4 >>> 0 < $12_1 >>> 0 | global$5 >>> 0 > $12_1 >>> 0) { fimport$30($12_1 | 0) } global$0 = $13_1; $14 = HEAP32[$0_1 >> 2]; HEAP32[$12_1 + 168 >> 2] = 0; HEAP32[$12_1 + 164 >> 2] = 0; block : { if (HEAP32[$0_1 + 40 >> 2] | HEAPU8[$0_1 + 224 | 0] == 1 & ($10_1 | 0) != 2) { break block } if ($318($0_1)) { break block } if ($908($0_1, $4_1)) { break block } block11 : { block5 : { block6 : { if ($3) { $1_1 = $910($0_1, $1_1, $2_1, $12_1 + 168 | 0); if (($1_1 | 0) < 0) { break block } block3 : { if (HEAPU8[$14 + 177 | 0]) { break block3 } $13_1 = $911($0_1, $3); if (HEAP32[$2_1 + 4 >> 2] | !$13_1) { break block3 } $1_1 = HEAP32[$13_1 + 60 >> 2] == HEAP32[HEAP32[$14 + 16 >> 2] + 28 >> 2] ? 1 : $1_1; } $2_1 = HEAP32[$0_1 >> 2]; HEAP32[$12_1 + 172 >> 2] = $0_1; $2_1 = HEAP32[$2_1 + 16 >> 2] + ($1_1 << 4) | 0; HEAP32[$12_1 + 212 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$12_1 + 204 >> 2] = HEAP32[$2_1 + 12 >> 2]; HEAP32[$12_1 + 176 >> 2] = $0_1; HEAP32[$12_1 + 180 >> 2] = 11; HEAP32[$12_1 + 184 >> 2] = 12; HEAP32[$12_1 + 188 >> 2] = 13; HEAP32[$12_1 + 192 >> 2] = 0; HEAP16[$12_1 + 196 >> 1] = 0; HEAP8[$12_1 + 208 | 0] = ($1_1 | 0) == 1; HEAP32[$12_1 + 216 >> 2] = 1581; $20_1 = HEAP32[$12_1 + 168 >> 2]; HEAP32[$12_1 + 220 >> 2] = $20_1; $2_1 = $12_1 + 172 | 0; HEAP32[$12_1 + 200 >> 2] = $2_1; $915($2_1, $3); $2_1 = $879($0_1, 0, $3 + 8 | 0); if (!$2_1) { break block } if (!(HEAP32[HEAP32[$14 + 16 >> 2] + 28 >> 2] == HEAP32[$2_1 + 60 >> 2] | ($1_1 | 0) != 1)) { HEAP32[$12_1 + 144 >> 2] = HEAP32[$2_1 >> 2]; $257($0_1, 29797, $12_1 + 144 | 0); break block5; } $17_1 = 0; if (!(HEAPU8[$2_1 + 28 | 0] & 128)) { break block6 } $17_1 = $359($2_1); break block6; } $2_1 = HEAP32[$0_1 + 252 >> 2]; if (!$2_1) { break block } $1_1 = $309($14, HEAP32[$2_1 + 60 >> 2]); $17_1 = 0; } $13_1 = HEAP32[$14 + 16 >> 2]; $11_1 = HEAP32[$2_1 >> 2]; if (!($68($11_1, 18315, 7) | !$3 | HEAPU8[$14 + 177 | 0])) { HEAP32[$12_1 >> 2] = $11_1; $257($0_1, 15491, $12_1); break block5; } block10 : { switch (HEAPU8[$2_1 + 43 | 0] - 1 | 0) { case 1: $257($0_1, 15432, 0); break block11; case 0: $257($0_1, 15457, 0); break block11; default: break block10; }; } $13_1 = $13_1 + ($1_1 << 4) | 0; block13 : { block18 : { block15 : { if ($20_1) { $15_1 = $875($14, $20_1); if (!$15_1) { break block5 } if ($896($0_1, $15_1, 1581, HEAP32[$2_1 >> 2])) { break block11 } if (HEAPU8[$0_1 + 224 | 0] > 1) { break block13 } block14 : { if (HEAPU8[$14 + 177 | 0]) { break block14 } if (!$319($14, $15_1, HEAP32[$13_1 >> 2])) { break block14 } HEAP32[$12_1 + 128 >> 2] = $15_1; $257($0_1, 7241, $12_1 + 128 | 0); break block11; } if (!$778($14, $15_1, HEAP32[$13_1 >> 2])) { break block15 } if (!$9_1) { HEAP32[$12_1 + 112 >> 2] = $15_1; $257($0_1, 3752, $12_1 + 112 | 0); break block11; } $917($0_1, $1_1); $928($0_1); break block11; } $15_1 = $2_1 + 8 | 0; $9_1 = 1; while (1) { $15_1 = HEAP32[$15_1 >> 2]; if ($15_1) { $9_1 = $9_1 + 1 | 0; $15_1 = $15_1 + 20 | 0; continue; } break; }; HEAP32[$12_1 + 100 >> 2] = $9_1; HEAP32[$12_1 + 96 >> 2] = $11_1; $15_1 = $310($14, 16732, $12_1 + 96 | 0); if (!$15_1) { break block5 } if (!HEAPU8[$0_1 + 224 | 0]) { break block18 } HEAP8[$15_1 + 7 | 0] = HEAPU8[$15_1 + 7 | 0] + 1; } if (HEAPU8[$0_1 + 224 | 0] > 1) { break block13 } } $9_1 = ($1_1 | 0) == 1; $11_1 = HEAP32[$13_1 >> 2]; if ($864($0_1, 18, $9_1 ? 9304 : 9323, 0, $11_1)) { break block11 } if ($864($0_1, $9_1 ? 3 : 1, $15_1, HEAP32[$2_1 >> 2], $11_1)) { break block11 } } block21 : { if (!$4_1) { $4_1 = HEAP32[$2_1 + 4 >> 2] + Math_imul(HEAP16[$2_1 + 34 >> 1], 12) | 0; $9_1 = $4_1 - 2 | 0; HEAP16[$9_1 >> 1] = HEAPU16[$9_1 >> 1] | 8; $4_1 = HEAP32[$4_1 - 12 >> 2]; HEAP32[$12_1 + 156 >> 2] = $4_1; HEAP32[$12_1 + 160 >> 2] = $48($4_1); $4_1 = $951($14, 60, $12_1 + 156 | 0, 0); $4_1 = $935(HEAP32[$0_1 >> 2], $4_1); if ($4_1) { HEAP8[(HEAP32[$4_1 >> 2] << 4) + $4_1 | 0] = ($8_1 | 0) != -1 ? $8_1 : 0; break block21; } $4_1 = 0; break block11; } $961($0_1, $4_1, 1581); if (HEAP32[$0_1 + 40 >> 2]) { break block11 } } $11_1 = HEAP32[$4_1 >> 2]; $18_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $9_1 = $4_1 + 8 | 0; $8_1 = 0; while (1) { if (!(($8_1 | 0) == ($18_1 | 0))) { $19_1 = HEAP32[($8_1 << 4) + $9_1 >> 2]; if (HEAPU8[$19_1 | 0] == 114) { $16_1 = ($48(HEAP32[$19_1 + 8 >> 2]) + $16_1 | 0) + 1 | 0 } $8_1 = $8_1 + 1 | 0; continue; } break; }; $18_1 = $48($15_1); $8_1 = 1; $11_1 = $1009($14, $11_1 + ($17_1 ? HEAPU16[$17_1 + 50 >> 1] : $8_1) << 16 >> 16, ($16_1 + $18_1 | 0) + 1 | 0, $12_1 + 164 | 0); block33 : { block44 : { if (!HEAPU8[$14 + 87 | 0]) { $16_1 = HEAP32[$12_1 + 164 >> 2]; HEAP32[$11_1 >> 2] = $16_1; $18_1 = $18_1 + 1 | 0; $8_1 = $18_1 + $16_1 | 0; HEAP32[$12_1 + 164 >> 2] = $8_1; if ($18_1) { wasm2js_memory_copy($16_1, $15_1, $18_1) } HEAP8[$11_1 + 54 | 0] = $5_1; HEAP32[$11_1 + 12 >> 2] = $2_1; $16_1 = (HEAPU8[$11_1 + 55 | 0] | HEAPU8[$11_1 + 56 | 0] << 8) & 65524 | (($5_1 ? 8 : 0) | $10_1); HEAP8[$11_1 + 55 | 0] = $16_1; HEAP8[$11_1 + 56 | 0] = $16_1 >>> 8; HEAP32[$11_1 + 24 >> 2] = HEAP32[(HEAP32[$14 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]; HEAP16[$11_1 + 50 >> 1] = HEAP32[$4_1 >> 2]; if ($7_1) { $993($0_1, $2_1, 2, $7_1, 0); HEAP32[$11_1 + 36 >> 2] = $7_1; } $7_1 = HEAPU8[HEAP32[$13_1 + 12 >> 2] + 76 | 0]; if (HEAPU8[$0_1 + 224 | 0] >= 2) { HEAP32[$11_1 + 40 >> 2] = $4_1; $4_1 = 0; } $18_1 = $7_1 >>> 0 > 3; $7_1 = 0; while (1) { if ($7_1 >>> 0 < HEAPU16[$11_1 + 50 >> 1]) { $1008(HEAP32[$9_1 >> 2]); $993($0_1, $2_1, 32, HEAP32[$9_1 >> 2], 0); block43 : { if (!HEAP32[$0_1 + 40 >> 2]) { $13_1 = $1007(HEAP32[$9_1 >> 2]); block35 : { if (HEAPU8[$13_1 | 0] != 168) { if (($2_1 | 0) == HEAP32[$0_1 + 252 >> 2]) { HEAP32[$12_1 + 164 >> 2] = $8_1; $257($0_1, 3903, 0); $7_1 = 0; break block33; } if (!HEAP32[$11_1 + 40 >> 2]) { HEAP32[$11_1 + 40 >> 2] = $4_1; $4_1 = 0; } HEAP16[HEAP32[$11_1 + 4 >> 2] + ($7_1 << 1) >> 1] = 65534; $13_1 = (HEAPU8[$11_1 + 55 | 0] | HEAPU8[$11_1 + 56 | 0] << 8) & 61431 | 4096; HEAP8[$11_1 + 55 | 0] = $13_1; HEAP8[$11_1 + 56 | 0] = $13_1 >>> 8; $16_1 = -2; break block35; } $16_1 = HEAP16[$13_1 + 32 >> 1]; block37 : { if (($16_1 | 0) < 0) { $16_1 = HEAP16[$2_1 + 32 >> 1]; break block37; } $13_1 = HEAP32[$2_1 + 4 >> 2]; $19_1 = Math_imul($16_1, 12); if (!(HEAPU8[($13_1 + $19_1 | 0) + 4 | 0] & 15)) { $13_1 = (HEAPU8[$11_1 + 55 | 0] | HEAPU8[$11_1 + 56 | 0] << 8) & 65527; HEAP8[$11_1 + 55 | 0] = $13_1; HEAP8[$11_1 + 56 | 0] = $13_1 >>> 8; $13_1 = HEAP32[$2_1 + 4 >> 2]; } if (!(HEAPU8[($13_1 + $19_1 | 0) + 10 | 0] & 32)) { break block37 } $13_1 = HEAPU8[$11_1 + 55 | 0] | HEAPU8[$11_1 + 56 | 0] << 8 | 6144; HEAP8[$11_1 + 55 | 0] = $13_1; HEAP8[$11_1 + 56 | 0] = $13_1 >>> 8; } HEAP16[HEAP32[$11_1 + 4 >> 2] + ($7_1 << 1) >> 1] = $16_1; } $13_1 = HEAP32[$9_1 >> 2]; block41 : { if (HEAPU8[$13_1 | 0] == 114) { $16_1 = HEAP32[$13_1 + 8 >> 2]; $13_1 = $48($16_1) + 1 | 0; if ($13_1) { wasm2js_memory_copy($8_1, $16_1, $13_1) } $13_1 = $8_1 + $13_1 | 0; break block41; } if (($16_1 | 0) < 0) { $13_1 = $8_1; $8_1 = 0; break block41; } $13_1 = $8_1; $8_1 = $419(HEAP32[$2_1 + 4 >> 2] + Math_imul($16_1, 12) | 0); } $8_1 = $8_1 ? $8_1 : 33712; if (HEAPU8[$14 + 177 | 0]) { break block43 } if ($985($0_1, $8_1)) { break block43 } $8_1 = $13_1; } HEAP32[$12_1 + 164 >> 2] = $8_1; break block44; } HEAP32[HEAP32[$11_1 + 32 >> 2] + ($7_1 << 2) >> 2] = $8_1; HEAP8[HEAP32[$11_1 + 28 >> 2] + $7_1 | 0] = $18_1 ? HEAPU8[$9_1 + 8 | 0] : 0; $9_1 = $9_1 + 16 | 0; $7_1 = $7_1 + 1 | 0; $8_1 = $13_1; continue; } break; }; HEAP32[$12_1 + 164 >> 2] = $8_1; block46 : { if ($17_1) { $9_1 = 0; while (1) { if (HEAPU16[$17_1 + 50 >> 1] <= $9_1 >>> 0) { break block46 } block48 : { if ($989($11_1, HEAPU16[$11_1 + 50 >> 1], $17_1, $9_1)) { HEAP16[$11_1 + 52 >> 1] = HEAPU16[$11_1 + 52 >> 1] - 1; break block48; } HEAP16[HEAP32[$11_1 + 4 >> 2] + ($7_1 << 1) >> 1] = HEAPU16[HEAP32[$17_1 + 4 >> 2] + ($9_1 << 1) >> 1]; HEAP32[HEAP32[$11_1 + 32 >> 2] + ($7_1 << 2) >> 2] = HEAP32[HEAP32[$17_1 + 32 >> 2] + ($9_1 << 2) >> 2]; HEAP8[HEAP32[$11_1 + 28 >> 2] + $7_1 | 0] = HEAPU8[HEAP32[$17_1 + 28 >> 2] + $9_1 | 0]; $7_1 = $7_1 + 1 | 0; } $9_1 = $9_1 + 1 | 0; continue; }; } HEAP16[HEAP32[$11_1 + 4 >> 2] + ($7_1 << 1) >> 1] = 65535; HEAP32[HEAP32[$11_1 + 32 >> 2] + ($7_1 << 2) >> 2] = 33712; } $781($11_1); if (!HEAP32[$0_1 + 252 >> 2]) { $995($11_1) } $992($11_1); block50 : { if (!$3 | HEAPU16[$11_1 + 52 >> 1] < HEAP16[$2_1 + 34 >> 1]) { break block50 } $8_1 = HEAPU8[$11_1 + 55 | 0] | HEAPU8[$11_1 + 56 | 0] << 8; $7_1 = $8_1 | 32; HEAP8[$11_1 + 55 | 0] = $7_1; HEAP8[$11_1 + 56 | 0] = $7_1 >>> 8; $7_1 = 0; $9_1 = HEAP16[$2_1 + 34 >> 1]; $9_1 = ($9_1 | 0) > 0 ? $9_1 : 0; while (1) { if (($7_1 | 0) == ($9_1 | 0)) { break block50 } block51 : { if (HEAP16[$2_1 + 32 >> 1] == ($7_1 | 0)) { break block51 } if (($889($11_1, $7_1 << 16 >> 16) | 0) >= 0) { break block51 } $7_1 = $8_1 & 65503; HEAP8[$11_1 + 55 | 0] = $7_1; HEAP8[$11_1 + 56 | 0] = $7_1 >>> 8; break block50; } $7_1 = $7_1 + 1 | 0; continue; }; } block64 : { block71 : { block58 : { block52 : { if (HEAP32[$0_1 + 252 >> 2] != ($2_1 | 0)) { break block52 } $7_1 = $2_1 + 8 | 0; while (1) { $8_1 = HEAP32[$7_1 >> 2]; if (!$8_1) { break block52 } block54 : { $13_1 = HEAPU16[$8_1 + 50 >> 1]; block53 : { if (($13_1 | 0) != HEAPU16[$11_1 + 50 >> 1]) { break block53 } $7_1 = 0; while (1) { if (($7_1 | 0) == ($13_1 | 0)) { break block54 } $9_1 = $7_1 << 1; if (HEAPU16[$9_1 + HEAP32[$8_1 + 4 >> 2] >> 1] != HEAPU16[$9_1 + HEAP32[$11_1 + 4 >> 2] >> 1]) { break block53 } $9_1 = $7_1 << 2; $7_1 = $7_1 + 1 | 0; if (!$67(HEAP32[$9_1 + HEAP32[$8_1 + 32 >> 2] >> 2], HEAP32[$9_1 + HEAP32[$11_1 + 32 >> 2] >> 2])) { continue } break; }; } $7_1 = $8_1 + 20 | 0; continue; } break; }; $7_1 = HEAPU8[$8_1 + 54 | 0]; $1_1 = HEAPU8[$11_1 + 54 | 0]; block55 : { if (($7_1 | 0) == ($1_1 | 0)) { break block55 } if (!(($7_1 | 0) == 11 | ($1_1 | 0) == 11)) { HEAP32[$12_1 + 80 >> 2] = 0; $257($0_1, 16423, $12_1 + 80 | 0); $7_1 = HEAPU8[$8_1 + 54 | 0]; } if (($7_1 & 255) != 11) { break block55 } HEAP8[$8_1 + 54 | 0] = HEAPU8[$11_1 + 54 | 0]; } if (($10_1 | 0) == 2) { $1_1 = (HEAPU8[$8_1 + 55 | 0] | HEAPU8[$8_1 + 56 | 0] << 8) & 65532 | 2; HEAP8[$8_1 + 55 | 0] = $1_1; HEAP8[$8_1 + 56 | 0] = $1_1 >>> 8; } $7_1 = 0; if (HEAPU8[$0_1 + 224 | 0] < 2) { break block33 } HEAP32[$11_1 + 20 >> 2] = HEAP32[$0_1 + 256 >> 2]; break block58; } block59 : { if (HEAPU8[$0_1 + 224 | 0] > 1) { break block59 } if (HEAPU8[$14 + 177 | 0]) { block61 : { if (!$3) { break block61 } HEAP32[$11_1 + 44 >> 2] = HEAP32[$14 + 172 >> 2]; if (!$779($11_1)) { break block61 } $257($0_1, 14668, 0); HEAP32[$0_1 + 12 >> 2] = $181(126495); $7_1 = 0; break block33; } if ($395(HEAP32[$11_1 + 24 >> 2] + 24 | 0, HEAP32[$11_1 >> 2], $11_1)) { $106($14); break block44; } HEAP32[$14 + 24 >> 2] = HEAP32[$14 + 24 >> 2] | 1; break block59; } if (!(HEAP32[$2_1 + 28 >> 2] & 128 ? $3 : 1)) { break block59 } $8_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $8_1; $7_1 = $856($0_1); if (!$7_1) { break block64 } $923($0_1, 1, $1_1); HEAP32[$11_1 + 44 >> 2] = $857($7_1, 187); $835($7_1, 147, $1_1, $8_1, 2); if ($6_1) { $6_1 = HEAP32[$0_1 + 212 >> 2]; $9_1 = HEAP32[$0_1 + 216 >> 2]; $10_1 = HEAPU8[($6_1 + $9_1 | 0) - 1 | 0]; $13_1 = HEAP32[$20_1 >> 2]; HEAP32[$12_1 + 72 >> 2] = $13_1; HEAP32[$12_1 + 64 >> 2] = $5_1 ? 20400 : 30822; HEAP32[$12_1 + 68 >> 2] = ($9_1 + ($6_1 - $13_1 | 0) | 0) - (($10_1 | 0) == 59); $5_1 = $310($14, 6021, $12_1 - -64 | 0); } else { $5_1 = 0 } $6_1 = HEAP32[HEAP32[$14 + 16 >> 2] + ($1_1 << 4) >> 2]; $9_1 = HEAP32[$11_1 >> 2]; $10_1 = HEAP32[$2_1 >> 2]; HEAP32[$12_1 + 48 >> 2] = $5_1; HEAP32[$12_1 + 44 >> 2] = $8_1; HEAP32[$12_1 + 40 >> 2] = $10_1; HEAP32[$12_1 + 36 >> 2] = $9_1; HEAP32[$12_1 + 32 >> 2] = $6_1; $884($0_1, 22035, $12_1 + 32 | 0); $10($14, $5_1); if ($3) { $1010($0_1, $11_1, $8_1); $924($0_1, $1_1); HEAP32[$12_1 + 16 >> 2] = HEAP32[$11_1 >> 2]; $925($7_1, $1_1, $310($14, 27918, $12_1 + 16 | 0), 0); $326($7_1, 166, 0, 1); } $1_1 = HEAP32[$7_1 + 108 >> 2]; $10_1 = 82740; HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? $10_1 : HEAP32[$7_1 + 104 >> 2] + Math_imul(HEAP32[$11_1 + 44 >> 2], 20) | 0) + 8 >> 2] = $1_1; } if (!$3 | HEAPU8[$14 + 177 | 0]) { HEAP32[$11_1 + 20 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP32[$2_1 + 8 >> 2] = $11_1; break block71; } if (HEAPU8[$0_1 + 224 | 0] < 2) { break block64 } } HEAP32[$0_1 + 256 >> 2] = $11_1; } $7_1 = 0; break block11; } $7_1 = 0; } if ($11_1) { break block33 } break block11; } $7_1 = 0; } $704($14, $11_1); break block11; } $15_1 = 0; } $2_1 = $2_1 + 8 | 0; while (1) { $1_1 = $2_1; $5_1 = HEAP32[$2_1 >> 2]; if (!$5_1) { break block } $2_1 = $5_1 + 20 | 0; if (HEAPU8[$5_1 + 54 | 0] != 5) { continue } break; }; while (1) { $0_1 = HEAP32[$2_1 >> 2]; if (!$0_1 | HEAPU8[$0_1 + 54 | 0] == 5) { break block } HEAP32[$1_1 >> 2] = $0_1; HEAP32[$5_1 + 20 >> 2] = HEAP32[$0_1 + 20 >> 2]; HEAP32[$0_1 + 20 >> 2] = $5_1; $1_1 = $0_1 + 20 | 0; continue; }; } $11($14, $7_1); $358($14, $4_1); $794($14, $3); $10($14, $15_1); $0_1 = $12_1 + 224 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $934($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (HEAPU8[$0_1 + 224 | 0] == 3) { break block } $3 = $270(HEAP32[$0_1 >> 2], 16, 0); if (!$3) { break block } HEAP32[$3 >> 2] = $1_1; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$3 + 8 >> 2] = $4_1; HEAP32[$3 + 12 >> 2] = HEAP32[$0_1 + 284 >> 2]; HEAP32[$0_1 + 284 >> 2] = $3; } return $1_1; } function $935($0_1, $1_1) { var $2_1 = 0; $2_1 = $325($0_1, 88, 0); if (!$2_1) { $11($0_1, $1_1); return $2_1; } HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 >> 2] = 1; HEAP32[$2_1 + 4 >> 2] = 4; HEAP32[$2_1 + 8 >> 2] = $1_1; HEAP32[$2_1 + 20 >> 2] = 0; return $2_1; } function $936($0_1, $1_1, $2_1) { var $3 = 0; if (!$1_1) { return $935(HEAP32[$0_1 >> 2], $2_1) } $3 = HEAP32[$1_1 >> 2]; if (($3 | 0) >= HEAP32[$1_1 + 4 >> 2]) { $3 = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = $0_1 << 1; $0_1 = $55($3, $1_1, $0_1 << 5 | 8, 0); __inlined_func$1091$106 : { if (!$0_1) { $333($3, $1_1); $11($3, $2_1); break __inlined_func$1091$106; } $1_1 = HEAP32[$0_1 >> 2]; HEAP32[$0_1 >> 2] = $1_1 + 1; $1_1 = $0_1 + ($1_1 << 4) | 0; HEAP32[$1_1 + 20 >> 2] = 0; $3 = $1_1 + 12 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = $2_1; } return $0_1; } HEAP32[$1_1 >> 2] = $3 + 1; $0_1 = ($3 << 4) + $1_1 | 0; HEAP32[$0_1 + 20 >> 2] = 0; $3 = $0_1 + 12 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = $2_1; return $1_1; } function $937($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!HEAP32[$0_1 + 40 >> 2]) { $2_1 = HEAP32[$1_1 + 12 >> 2]; if ($2_1) { $4_1 = HEAP32[$2_1 + 24 >> 2] } else { $4_1 = 0 } $2_1 = $4_1; HEAP32[$3 + 12 >> 2] = $2_1; $5_1 = HEAP32[$1_1 + 16 >> 2]; block3 : { if (!$5_1) { break block3 } $2_1 = HEAP32[$5_1 + 24 >> 2]; if (($4_1 | 0) >= ($2_1 | 0)) { break block3 } HEAP32[$3 + 12 >> 2] = $2_1; } $2_1 = HEAP32[$1_1 + 20 >> 2]; $6_1 = HEAP32[$1_1 + 4 >> 2]; block5 : { if ($6_1 & 4096) { $1132($2_1, $3 + 12 | 0); break block5; } if (!$2_1) { break block5 } $1133($2_1, $3 + 12 | 0); $5_1 = 0; $4_1 = HEAP32[$2_1 >> 2]; $4_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $7_1 = $2_1 + 8 | 0; $2_1 = 0; while (1) { if (!(($2_1 | 0) == ($4_1 | 0))) { $5_1 = HEAP32[HEAP32[($2_1 << 4) + $7_1 >> 2] + 4 >> 2] | $5_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 + 4 >> 2] = $5_1 & 4194824 | $6_1; } $2_1 = $1_1; $1_1 = HEAP32[$3 + 12 >> 2] + 1 | 0; HEAP32[$2_1 + 24 >> 2] = $1_1; $1003($0_1, $1_1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $938($0_1, $1_1, $2_1) { if ($1_1) { HEAP32[$1_1 + 20 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 4198400; $937($0_1, $1_1); return; } $789(HEAP32[$0_1 >> 2], $2_1); } function $939($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0, $10_1 = 0, $11_1 = 0; $10_1 = global$0 - 80 | 0; $9_1 = $10_1; if (global$4 >>> 0 < $9_1 >>> 0 | global$5 >>> 0 > $9_1 >>> 0) { fimport$30($9_1 | 0) } global$0 = $9_1; $11_1 = $325(HEAP32[$0_1 >> 2], 76, 0); $9_1 = $11_1 ? $11_1 : $10_1 + 4 | 0; if (!$1_1) { $1_1 = $942(HEAP32[$0_1 >> 2], 180, 0); $1_1 = $935(HEAP32[$0_1 >> 2], $1_1); } HEAP32[$9_1 + 28 >> 2] = $1_1; HEAP8[$9_1 | 0] = 139; HEAP32[$9_1 + 8 >> 2] = 0; HEAP32[$9_1 + 12 >> 2] = 0; HEAP32[$9_1 + 4 >> 2] = $7_1; $1_1 = HEAP32[$0_1 + 112 >> 2] + 1 | 0; HEAP32[$0_1 + 112 >> 2] = $1_1; HEAP32[$9_1 + 20 >> 2] = -1; HEAP32[$9_1 + 24 >> 2] = -1; HEAP32[$9_1 + 16 >> 2] = $1_1; HEAP16[$9_1 + 2 >> 1] = 0; if (!$2_1) { $2_1 = $270(HEAP32[$0_1 >> 2], 56, 0) } HEAP32[$9_1 + 72 >> 2] = 0; HEAP32[$9_1 + 64 >> 2] = 0; HEAP32[$9_1 + 68 >> 2] = 0; HEAP32[$9_1 + 60 >> 2] = $8_1; HEAP32[$9_1 + 52 >> 2] = 0; HEAP32[$9_1 + 56 >> 2] = 0; HEAP32[$9_1 + 48 >> 2] = $6_1; HEAP32[$9_1 + 44 >> 2] = $5_1; HEAP32[$9_1 + 40 >> 2] = $4_1; HEAP32[$9_1 + 36 >> 2] = $3; HEAP32[$9_1 + 32 >> 2] = $2_1; $0_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$0_1 + 87 | 0]) { $791($0_1, $9_1, ($10_1 + 4 | 0) != ($9_1 | 0)); $11_1 = 0; } $0_1 = $10_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $11_1; } function $940($0_1, $1_1, $2_1) { if ($1_1) { $0_1 = (Math_imul(HEAP32[$1_1 >> 2], 48) + $1_1 | 0) - 40 | 0; HEAP32[$0_1 + 32 >> 2] = $2_1; $1_1 = HEAPU8[$0_1 + 13 | 0] | HEAPU8[$0_1 + 14 | 0] << 8 | 8; HEAP8[$0_1 + 13 | 0] = $1_1; HEAP8[$0_1 + 14 | 0] = $1_1 >>> 8; return; } $358(HEAP32[$0_1 >> 2], $2_1); } function $941($0_1, $1_1) { if ($1_1) { if (HEAPU8[$0_1 + 224 | 0] >= 2) { $1002($0_1, $1_1) } $790(HEAP32[$0_1 >> 2], $1_1); } } function $942($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = $48($2_1); $1_1 = $951($0_1, $1_1, $3 + 8 | 0, 0); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $943($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 4 >> 2]; block : { if ($1_1 & 67110912) { break block } $2_1 = $1005(HEAP32[$0_1 + 8 >> 2]); if (!$2_1) { break block } HEAP8[$0_1 | 0] = 171; HEAP32[$0_1 + 4 >> 2] = $1_1 | $2_1; $3 = 1; } return $3; } function $944($0_1, $1_1) { return $1001($0_1, $1_1, 1); } function $945($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 16 | 0; $2_1 = $3; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (!HEAP32[$1_1 + 52 >> 2]) { break block } $5_1 = 1; $2_1 = $1_1; block1 : { block3 : { while (1) { $6_1 = $2_1; HEAP32[$2_1 + 56 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 256; $2_1 = HEAP32[$2_1 + 52 >> 2]; if (!$2_1) { break block1 } $5_1 = $5_1 + 1 | 0; $4_1 = 18709; if (HEAP32[$2_1 + 48 >> 2]) { break block3 } $4_1 = $6_1; if (!HEAP32[$2_1 + 60 >> 2]) { continue } break; }; $4_1 = 18935; } $2_1 = $4_1; HEAP32[$3 + 4 >> 2] = $1076(HEAPU8[$6_1 | 0]); HEAP32[$3 >> 2] = $2_1; $257($0_1, 13779, $3); } if (HEAPU8[$1_1 + 5 | 0] & 6) { break block } $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 136 >> 2]; if (($1_1 | 0) <= 0 | ($1_1 | 0) >= ($5_1 | 0)) { break block } $257($0_1, 18993, 0); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $946($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $6_1 = HEAP32[$0_1 >> 2]; $4_1 = $951($6_1, 172, $2_1, 1); block1 : { if (!$4_1) { $358($6_1, $1_1); break block1; } HEAP32[$4_1 + 36 >> 2] = HEAP32[$2_1 >> 2] - HEAP32[$0_1 + 248 >> 2]; if (!(HEAPU8[$0_1 + 18 | 0] | (!$1_1 | HEAP32[$1_1 >> 2] <= HEAP32[HEAP32[$0_1 >> 2] + 144 >> 2]))) { HEAP32[$5_1 >> 2] = $2_1; $257($0_1, 19061, $5_1); } HEAP32[$4_1 + 20 >> 2] = $1_1; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 8; $937($0_1, $4_1); if (($3 | 0) != 1) { break block1 } HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 4; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $947($0_1, $1_1, $2_1, $3) { if (!(!$1_1 | !$2_1 | (HEAPU8[$1_1 | 0] != 122 | HEAPU8[$0_1 + 224 | 0] > 1))) { $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$2_1 | 0] = $3; $11($0_1, HEAP32[$2_1 + 16 >> 2]); HEAP32[$2_1 + 16 >> 2] = 0; } } function $948($0_1, $1_1, $2_1) { var $3 = 0; if ($1_1) { if (!$2_1) { return $1_1 } if (!(((HEAP32[$2_1 + 4 >> 2] | HEAP32[$1_1 + 4 >> 2]) & 536870915) != 536870912 | HEAPU8[$0_1 + 224 | 0] > 1)) { $3 = HEAP32[$0_1 >> 2]; $1131($0_1, $1_1); $1131($0_1, $2_1); return $942($3, 156, 25060); } $2_1 = $903($0_1, 44, $1_1, $2_1); } return $2_1; } function $949($0_1, $1_1, $2_1) { var $3 = 0; block1 : { if ($1_1) { HEAP32[$1_1 + 44 >> 2] = $2_1; $3 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = $3 | 16908288; HEAP32[$2_1 + 72 >> 2] = $1_1; if (!($3 & 4) | HEAPU8[$2_1 + 16 | 0] == 167) { break block1 } $257($0_1, 4888, 0); return; } $792(HEAP32[$0_1 >> 2], $2_1); } } function $950($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block1 : { if ($2_1) { $3 = HEAP32[$0_1 >> 2]; if (!$1_1) { break block1 } $4_1 = HEAP32[$1_1 + 20 >> 2]; if (HEAP32[$4_1 >> 2] ? !$4_1 : 1) { $1016($0_1, 44, $2_1); return; } if (!(!(HEAP8[$1_1 + 7 | 0] & 1) | HEAPU8[HEAP32[$1_1 + 44 >> 2] + 16 | 0] == 167)) { $1130($0_1, $1_1); break block1; } $0_1 = $951($3, 146, 0, 0); if (!$0_1) { break block1 } HEAP32[$0_1 + 20 >> 2] = $2_1; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 131072; } return; } $333($3, $2_1); } function $951($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$4_1 + 12 >> 2] = 0; block : { if (!$2_1) { break block } block1 : { if (($1_1 | 0) != 156) { break block1 } $6_1 = HEAP32[$2_1 >> 2]; if (!$6_1) { break block1 } if ($296($6_1, $4_1 + 12 | 0)) { break block } } $5_1 = HEAP32[$2_1 + 4 >> 2] + 1 | 0; } $0_1 = $325($0_1, $5_1 + 52 | 0, 0); if ($0_1) { wasm2js_memory_fill($0_1, 0, 52); HEAP16[$0_1 + 34 >> 1] = 65535; HEAP8[$0_1 | 0] = $1_1; block4 : { if (!$2_1) { break block4 } if (!$5_1) { $1_1 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$0_1 + 8 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1 ? 276826112 : 545261568; break block4; } $5_1 = $0_1 + 52 | 0; HEAP32[$0_1 + 8 >> 2] = $5_1; $1_1 = 0; $6_1 = HEAP32[$2_1 + 4 >> 2]; if ($6_1) { if ($6_1) { wasm2js_memory_copy($5_1, HEAP32[$2_1 >> 2], $6_1) } $1_1 = HEAP32[$2_1 + 4 >> 2]; } HEAP8[$1_1 + $5_1 | 0] = 0; if (!$3 | HEAP8[HEAPU8[$5_1 | 0] + 31424 | 0] >= 0) { break block4 } $1004($0_1); } HEAP32[$0_1 + 24 >> 2] = 1; } $1_1 = $4_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $952($0_1, $1_1, $2_1, $3) { if (!$1_1) { $11($0_1, $2_1); $11($0_1, $3); return; } if ($3) { HEAP32[$1_1 + 16 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | HEAP32[$3 + 4 >> 2] & 4194824; $3 = HEAP32[$3 + 24 >> 2] + 1 | 0; } else { $3 = 1 } HEAP32[$1_1 + 24 >> 2] = $3; block3 : { if (!$2_1) { break block3 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | HEAP32[$2_1 + 4 >> 2] & 4194824; $0_1 = HEAP32[$2_1 + 24 >> 2]; if (($0_1 | 0) < ($3 | 0)) { break block3 } HEAP32[$1_1 + 24 >> 2] = $0_1 + 1; } } function $953($0_1, $1_1, $2_1, $3) { block : { if (!HEAP32[$2_1 + 4 >> 2]) { break block } $0_1 = $951(HEAP32[$0_1 >> 2], 114, $2_1, $3); if (!$0_1) { break block } HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 8704; return $0_1; } return $1_1; } function $954($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; block2 : { block1 : { if (!$1_1) { $3 = $270($4_1, 8, 0); if ($3) { break block1 } break block2; } $3 = $55($4_1, $1_1, (HEAP32[$1_1 >> 2] << 2) + 8 | 0, 0); if ($3) { break block1 } $12($4_1, $1_1); break block2; } $1_1 = HEAP32[$3 >> 2]; HEAP32[$3 >> 2] = $1_1 + 1; $5_1 = (($1_1 << 2) + $3 | 0) + 4 | 0; $1_1 = $875($4_1, $2_1); HEAP32[$5_1 >> 2] = $1_1; if (!(!$1_1 | HEAPU8[$0_1 + 224 | 0] < 2)) { $934($0_1, $1_1, $2_1) } return $3; } return 0; } function $955($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 >> 2]; if (HEAP32[$0_1 + 260 >> 2]) { $257($0_1, 9487, 0) } HEAP8[$0_1 + 163 | 0] = 1; $2_1 = $270($3, 144, 0); block2 : { if (!$2_1) { $358($3, $1_1); break block2; } HEAP32[$0_1 + 148 >> 2] = $2_1; HEAP32[$2_1 + 4 >> 2] = $1_1; HEAP32[$2_1 >> 2] = $0_1; $1016($0_1, 45, $2_1); if (HEAPU8[$3 + 87 | 0]) { break block2 } HEAP32[$4_1 >> 2] = $0_1; $5_1 = $63(40, $2_1 + 104 | 0, 10048, $4_1); HEAP8[$2_1 + 18 | 0] = 1; HEAP16[$2_1 + 16 >> 1] = 663; HEAP32[$2_1 + 8 >> 2] = $5_1; $0_1 = HEAP32[HEAP32[$3 + 16 >> 2] + 28 >> 2]; HEAP32[$2_1 + 68 >> 2] = $1_1; $1_1 = $2_1 + 8 | 0; HEAP32[$2_1 + 48 >> 2] = $1_1; HEAP8[$2_1 + 44 | 0] = 151; HEAP32[$2_1 + 36 >> 2] = $2_1 + 44; HEAP32[$2_1 + 32 >> 2] = $0_1; HEAP32[$2_1 + 28 >> 2] = $0_1; if (($395($0_1 + 40 | 0, $5_1, $1_1) | 0) != ($1_1 | 0)) { break block2 } $106($3); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $956($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; $6_1 = $270($0_1, 48, 0); if (!$6_1) { $358($0_1, $1_1); $11($0_1, $2_1); $358($0_1, $3); $11($0_1, $4_1); $849($0_1, $5_1); return $6_1; } HEAP32[$6_1 + 12 >> 2] = $4_1; HEAP32[$6_1 + 8 >> 2] = $3; HEAP32[$6_1 + 4 >> 2] = $2_1; HEAP32[$6_1 >> 2] = $1_1; HEAP32[$6_1 + 16 >> 2] = $5_1; HEAP8[$6_1 + 20 | 0] = ($3 | 0) != 0; return $6_1; } function $957($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0; $10_1 = global$0 - 320 | 0; $6_1 = $10_1; if (global$4 >>> 0 < $10_1 >>> 0 | global$5 >>> 0 > $10_1 >>> 0) { fimport$30($10_1 | 0) } global$0 = $6_1; $6_1 = 0; HEAP32[$10_1 + 156 >> 2] = 0; HEAP32[$10_1 + 152 >> 2] = 0; $25 = HEAP32[$0_1 >> 2]; block1 : { if (HEAP32[$0_1 + 40 >> 2]) { $19_1 = $2_1; break block1; } HEAP32[$10_1 + 128 >> 2] = 0; $19_1 = 0; block2 : { if (!$2_1) { break block2 } if (!(HEAP32[$2_1 + 52 >> 2] | !(HEAPU8[$2_1 + 5 | 0] & 2))) { $31_1 = HEAP32[$2_1 + 28 >> 2]; HEAP32[$2_1 + 28 >> 2] = 0; $789($25, $2_1); $19_1 = 0; break block2; } $19_1 = $2_1; } block4 : { $9_1 = $911($0_1, $1_1); if (!$9_1) { break block4 } $2_1 = HEAP32[$9_1 >> 2]; $8_1 = HEAP32[$25 + 16 >> 2]; $20_1 = $309($25, HEAP32[$9_1 + 60 >> 2]); if ($864($0_1, 18, $2_1, 0, HEAP32[$8_1 + ($20_1 << 4) >> 2])) { break block4 } $28_1 = HEAP32[$9_1 + 28 >> 2]; $30_1 = $1092($0_1, $9_1, 128, 0, $10_1 + 120 | 0); $34_1 = HEAPU8[$9_1 + 43 | 0]; if ($897($0_1, $9_1)) { break block4 } if ($1094($0_1, $9_1, $30_1)) { break block4 } $13_1 = $856($0_1); if (!$13_1) { break block4 } if (!HEAPU8[$0_1 + 18 | 0]) { HEAP16[$13_1 + 152 >> 1] = HEAPU16[$13_1 + 152 >> 1] | 16 } $923($0_1, ($19_1 | $30_1) != 0, $20_1); block45 : { block6 : { if (!$19_1 | $3 | (HEAP32[$0_1 + 280 >> 2] | $30_1)) { break block6 } if (HEAP32[$19_1 + 64 >> 2] | HEAPU8[$9_1 + 43 | 0] == 1) { break block6 } $6_1 = $4_1; block7 : { if (($6_1 | 0) != 11) { break block7 } if (HEAP16[$9_1 + 32 >> 1] >= 0) { $6_1 = HEAPU8[$9_1 + 42 | 0]; if (($6_1 | 0) != 11) { break block7 } } $6_1 = 2; } $2_1 = HEAP32[$19_1 + 32 >> 2]; if (HEAP32[$2_1 >> 2] != 1 | HEAPU8[$2_1 + 21 | 0] & 4 | (HEAP32[$19_1 + 36 >> 2] | HEAP32[$19_1 + 48 >> 2])) { break block6 } if (HEAP32[$19_1 + 40 >> 2] | HEAP32[$19_1 + 60 >> 2] | (HEAP32[$19_1 + 52 >> 2] | HEAP8[$19_1 + 4 | 0] & 1)) { break block6 } $11_1 = HEAP32[$19_1 + 28 >> 2]; if (HEAP32[$11_1 >> 2] != 1 | HEAPU8[HEAP32[$11_1 + 8 >> 2]] != 180) { break block6 } $18_1 = HEAP32[$0_1 >> 2]; $7_1 = $879($0_1, 0, $2_1 + 8 | 0); if (!$7_1 | HEAP32[$7_1 + 20 >> 2] == HEAP32[$9_1 + 20 >> 2] & HEAP32[$7_1 + 60 >> 2] == HEAP32[$9_1 + 60 >> 2]) { break block6 } $2_1 = HEAP32[$7_1 + 28 >> 2]; $11_1 = HEAP32[$9_1 + 28 >> 2]; if (HEAPU8[$7_1 + 43 | 0] | ($2_1 ^ $11_1) & 128) { break block6 } $14 = HEAPU16[$9_1 + 34 >> 1]; if (!(!($11_1 & 65536) | $2_1 & 65536) | (($14 | 0) != HEAPU16[$7_1 + 34 >> 1] | HEAPU16[$9_1 + 32 >> 1] != HEAPU16[$7_1 + 32 >> 1])) { break block6 } while (1) { if (($17_1 | 0) < $14 << 16 >> 16) { $11_1 = Math_imul($17_1, 12); $2_1 = $11_1 + HEAP32[$9_1 + 4 >> 2] | 0; $12_1 = HEAPU16[$2_1 + 10 >> 1] & 96; $11_1 = $11_1 + HEAP32[$7_1 + 4 >> 2] | 0; if (($12_1 | 0) != (HEAPU16[$11_1 + 10 >> 1] & 96)) { break block6 } if ($12_1) { if ($1121(0, $891($7_1, $11_1), $891($9_1, $2_1), -1)) { break block6 } } if (HEAPU8[$2_1 + 5 | 0] != HEAPU8[$11_1 + 5 | 0]) { break block6 } if ($66($419($2_1), $419($11_1)) | !(!(HEAPU8[$2_1 + 4 | 0] & 15) | HEAPU8[$11_1 + 4 | 0] & 15)) { break block6 } block14 : { if (!$17_1 | HEAPU16[$2_1 + 10 >> 1] & 96) { break block14 } $2_1 = $891($9_1, $2_1); $11_1 = $891($7_1, $11_1); if ((!$2_1 | 0) == (($11_1 | 0) != 0 | 0)) { break block6 } if (!$2_1) { break block14 } if ($2073(HEAP32[$2_1 + 8 >> 2], HEAP32[$11_1 + 8 >> 2])) { break block6 } } $17_1 = $17_1 + 1 | 0; $14 = HEAPU16[$9_1 + 34 >> 1]; continue; } break; }; $11_1 = $7_1 + 8 | 0; $14 = 0; $2_1 = $9_1 + 8 | 0; $8_1 = $2_1; while (1) { $12_1 = HEAP32[$8_1 >> 2]; if ($12_1) { $14 = HEAPU8[$12_1 + 54 | 0] ? 1 : $14; $8_1 = $11_1; while (1) { $8_1 = HEAP32[$8_1 >> 2]; if (!$8_1) { break block6 } if (!$1122($12_1, $8_1)) { $8_1 = $8_1 + 20 | 0; continue; } break; }; if (!(HEAP32[$8_1 + 44 >> 2] != HEAP32[$12_1 + 44 >> 2] | HEAP32[$7_1 + 60 >> 2] != HEAP32[$9_1 + 60 >> 2])) { $8_1 = HEAP32[18950]; if (!$8_1) { break block6 } if (!(FUNCTION_TABLE[$8_1 | 0](411) | 0)) { break block6 } } $8_1 = $12_1 + 20 | 0; continue; } break; }; $12_1 = HEAP32[$9_1 + 16 >> 2]; if (!(!$12_1 | HEAPU8[$18_1 + 24 | 0] & 4)) { if ($1024(HEAP32[$7_1 + 16 >> 2], $12_1, -1)) { break block6 } } $8_1 = HEAP32[$18_1 + 36 >> 2]; block20 : { if (HEAP32[$18_1 + 32 >> 2] & 16384) { if ($8_1 & 1) { break block6 } if (!HEAP32[$9_1 + 48 >> 2]) { break block20 } break block6; } if ($8_1 & 1) { break block6 } } $22_1 = $309($18_1, HEAP32[$7_1 + 60 >> 2]); $12_1 = $856($0_1); $917($0_1, $22_1); $15_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $15_1 + 2; $8_1 = $1123($0_1, $20_1, $9_1); $23_1 = $893($0_1); $326($12_1, 75, 0, $23_1); $24_1 = $893($0_1); $16_1 = $15_1 + 1 | 0; $860($0_1, $16_1, $20_1, $9_1, 113); block21 : { if (HEAPU8[$18_1 + 24 | 0] & 4) { break block21 } if (!($14 | (HEAP32[$2_1 >> 2] ? HEAP16[$9_1 + 32 >> 1] < 0 : 0))) { if ($6_1 - 3 >>> 0 > 4294967293) { break block21 } } $14 = $326($12_1, 36, $16_1, 0); $21_1 = $857($12_1, 9); $27 = HEAP32[$12_1 + 108 >> 2]; $17_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $17_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($14, 20) | 0) + 8 >> 2] = $27; } block34 : { if (!(HEAPU8[$7_1 + 28 | 0] & 128)) { $860($0_1, $15_1, $22_1, $7_1, 102); $14 = $326($12_1, 36, $15_1, 0); block29 : { if (HEAP16[$9_1 + 32 >> 1] >= 0) { $17_1 = $326($12_1, 135, $15_1, $24_1); if (!(HEAPU8[$18_1 + 24 | 0] & 4)) { $27 = $835($12_1, 31, $16_1, 0, $24_1); $1124($0_1, $6_1, $9_1); $29_1 = HEAP32[$12_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($27, 20) | 0) + 8 >> 2] = $29_1; } $1125($0_1, $8_1, $24_1); break block29; } if (!(HEAP32[$2_1 >> 2] | HEAPU8[$18_1 + 24 | 0] & 8)) { $17_1 = $326($12_1, 127, $16_1, $24_1); break block29; } $17_1 = $326($12_1, 135, $15_1, $24_1); } $6_1 = 169; if (HEAPU8[$18_1 + 24 | 0] & 4) { $858($12_1, 137, $16_1); $6_1 = 152; } $835($12_1, 129, $16_1, $15_1, $24_1); $835($12_1, 128, $16_1, $23_1, $24_1); if (!(HEAPU8[$18_1 + 24 | 0] & 4)) { $315($12_1, -1, $9_1, -5) } $8_1 = HEAP32[$12_1 + 108 >> 2]; if (($8_1 | 0) > 0) { HEAP16[(HEAP32[$12_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) - 18 >> 1] = $6_1 } $326($12_1, 39, $15_1, $17_1); $326($12_1, 122, $15_1, 0); $326($12_1, 122, $16_1, 0); break block34; } $988($0_1, $20_1, HEAP32[$9_1 + 20 >> 2], 1, HEAP32[$9_1 >> 2]); $14 = 0; $988($0_1, $22_1, HEAP32[$7_1 + 20 >> 2], 0, HEAP32[$7_1 >> 2]); } while (1) { $6_1 = $11_1; block47 : { block41 : { block40 : { block39 : { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { while (1) { block36 : { $6_1 = HEAP32[$6_1 >> 2]; if (!$6_1) { break block36 } if ($1122($2_1, $6_1)) { break block36 } $6_1 = $6_1 + 20 | 0; continue; } break; }; $835($12_1, 102, $15_1, HEAP32[$6_1 + 44 >> 2], $22_1); $1097($0_1, $6_1); $835($12_1, 113, $16_1, HEAP32[$2_1 + 44 >> 2], $20_1); $1097($0_1, $2_1); $8_1 = HEAP32[$12_1 + 108 >> 2]; if (($8_1 | 0) > 0) { HEAP16[(HEAP32[$12_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) - 18 >> 1] = 1 } $17_1 = $326($12_1, 36, $15_1, 0); if (HEAPU8[$18_1 + 24 | 0] & 4) { $27 = HEAPU16[$6_1 + 52 >> 1]; $8_1 = 0; while (1) { if (($8_1 | 0) == ($27 | 0)) { break block39 } $29_1 = $8_1 << 2; $8_1 = $8_1 + 1 | 0; if (!$66(33712, HEAP32[$29_1 + HEAP32[$6_1 + 32 >> 2] >> 2])) { continue } break; }; break block40; } if (!(HEAPU8[$7_1 + 28 | 0] & 128)) { break block40 } $8_1 = ((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 3) == 2 ? 9 : 8; break block41; } if ($14) { $2_1 = HEAP32[$12_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($14, 20) | 0) + 8 >> 2] = $2_1; } $894($0_1, $24_1); $894($0_1, $23_1); if (!$21_1) { $6_1 = 0; $28_1 = 0; $23_1 = 0; break block45; } $1103($0_1); $326($12_1, 70, 0, 0); $2_1 = HEAP32[$12_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($21_1, 20) | 0) + 8 >> 2] = $2_1; $326($12_1, 122, $16_1, 0); break block6; } $858($12_1, 137, $16_1); $326($12_1, 129, $16_1, $15_1); $8_1 = 152; break block47; } $8_1 = 8; } $835($12_1, 134, $15_1, $23_1, 1); } $326($12_1, 138, $16_1, $23_1); $6_1 = HEAP32[$12_1 + 108 >> 2]; if (($6_1 | 0) > 0) { HEAP16[(HEAP32[$12_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) - 18 >> 1] = $8_1 } $326($12_1, 39, $15_1, $17_1 + 1 | 0); $8_1 = HEAP32[$12_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($17_1, 20) | 0) + 8 >> 2] = $8_1; $326($12_1, 122, $15_1, 0); $326($12_1, 122, $16_1, 0); $2_1 = $2_1 + 20 | 0; continue; }; } $29_1 = $1123($0_1, $20_1, $9_1); $2_1 = HEAP32[$0_1 + 48 >> 2]; $24_1 = $2_1 + 1 | 0; $6_1 = HEAP16[$9_1 + 34 >> 1]; $11_1 = $24_1 + $6_1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $16_1 = $24_1; if (HEAPU8[$9_1 + 43 | 0] == 1) { HEAP32[$0_1 + 48 >> 2] = $11_1 + 1; $16_1 = $2_1 + 2 | 0; } $36_1 = $28_1 & 128; $15_1 = !(HEAPU16[$9_1 + 28 >> 1] & 1088); block81 : { block82 : { block59 : { block52 : { if (!$3) { $2_1 = -1; $28_1 = 0; break block52; } $28_1 = $270($25, $6_1 << 2 & -4, 0); if (!$28_1) { $6_1 = 0; break block4; } $8_1 = $3 + 4 | 0; $2_1 = -1; $11_1 = 0; while (1) { if (HEAP32[$3 >> 2] <= ($11_1 | 0)) { break block52 } $12_1 = HEAP32[$8_1 + ($11_1 << 2) >> 2]; $14 = $886($12_1); $6_1 = 0; $7_1 = HEAP16[$9_1 + 34 >> 1]; $18_1 = ($7_1 | 0) > 0 ? $7_1 : 0; block58 : { while (1) { if (($6_1 | 0) != ($18_1 | 0)) { block55 : { $7_1 = HEAP32[$9_1 + 4 >> 2] + Math_imul($6_1, 12) | 0; if (($14 | 0) != HEAPU8[$7_1 + 7 | 0]) { break block55 } $17_1 = HEAP32[$7_1 >> 2]; if ($67($12_1, $17_1)) { break block55 } $12_1 = ($6_1 << 2) + $28_1 | 0; if (!HEAP32[$12_1 >> 2]) { HEAP32[$12_1 >> 2] = $11_1 + 1 } if (!(HEAPU8[$7_1 + 10 | 0] & 96)) { $15_1 = ($6_1 | 0) == ($11_1 | 0) ? $15_1 : 0; $2_1 = HEAP16[$9_1 + 32 >> 1] == ($6_1 | 0) ? $11_1 : $2_1; break block58; } HEAP32[$10_1 + 112 >> 2] = $17_1; $257($0_1, 29551, $10_1 + 112 | 0); break block59; } $6_1 = $6_1 + 1 | 0; continue; } break; }; if ($417($12_1)) { $15_1 = 0; $2_1 = $11_1; if (!$36_1) { break block58 } } HEAP32[$10_1 + 100 >> 2] = $12_1; HEAP32[$10_1 + 96 >> 2] = $1_1 + 8; $257($0_1, 7209, $10_1 + 96 | 0); HEAP8[$0_1 + 17 | 0] = 1; break block59; } $11_1 = $11_1 + 1 | 0; continue; }; } $12_1 = $16_1 + 1 | 0; block74 : { block65 : { block73 : { block68 : { if ($19_1) { $6_1 = HEAP32[$19_1 + 32 >> 2]; block63 : { if (!(HEAP32[$19_1 + 52 >> 2] | (HEAP32[$6_1 >> 2] != 1 | !(HEAPU8[$6_1 + 21 | 0] & 64)))) { $11_1 = HEAP32[$6_1 + 52 >> 2]; HEAP32[$10_1 + 128 >> 2] = HEAP32[$11_1 + 8 >> 2]; $18_1 = HEAP32[$11_1 + 12 >> 2]; $22_1 = HEAP32[HEAP32[HEAP32[$11_1 >> 2] + 28 >> 2] >> 2]; HEAP32[$10_1 + 80 >> 2] = $6_1 + 8; $1032($0_1, 0, 19356, $10_1 + 80 | 0); if (!($15_1 & 255) | HEAP16[$9_1 + 34 >> 1] != ($22_1 | 0)) { break block63 } $16_1 = $18_1 - 1 | 0; $24_1 = $16_1 - (HEAPU8[$9_1 + 43 | 0] == 1) | 0; $12_1 = $18_1; break block63; } $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $6_1 = 0; $8_1 = HEAP32[$13_1 + 108 >> 2]; $835($13_1, 11, $11_1, 0, $8_1 + 1 | 0); $7_1 = $10_1 + 140 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; HEAP32[$10_1 + 132 >> 2] = 0; HEAP32[$10_1 + 136 >> 2] = 0; HEAP32[$10_1 + 128 >> 2] = $11_1; HEAP8[$10_1 + 124 | 0] = 13; HEAP32[$10_1 + 136 >> 2] = $15_1 & 255 ? $12_1 : 0; HEAP32[$7_1 >> 2] = HEAP16[$9_1 + 34 >> 1]; if ($974($0_1, $19_1, $10_1 + 124 | 0) | HEAP32[$0_1 + 40 >> 2]) { break block1 } $18_1 = HEAP32[$10_1 + 136 >> 2]; $997($13_1, $11_1); $11_1 = HEAP32[$13_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $11_1; $22_1 = HEAP32[HEAP32[$19_1 + 28 >> 2] >> 2]; } if ($30_1) { break block65 } $15_1 = $856($0_1); $6_1 = HEAP32[$15_1 + 108 >> 2]; $11_1 = 0; if (HEAPU8[$9_1 + 43 | 0] == 1) { $11_1 = $684(HEAP32[$0_1 >> 2], $9_1) } $17_1 = ($6_1 | 0) <= 1 ? 1 : $6_1; $8_1 = $9_1 + 8 | 0; $14 = 1; while (1) { $6_1 = 0; if (($14 | 0) == ($17_1 | 0)) { break block68 } $6_1 = 82740; $6_1 = HEAPU8[HEAP32[$15_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$15_1 + 104 >> 2] + Math_imul($14, 20) | 0; $7_1 = HEAPU8[$6_1 | 0]; block71 : { if (($7_1 | 0) != 173) { if (($7_1 | 0) != 102 | ($20_1 | 0) != HEAP32[$6_1 + 12 >> 2]) { break block71 } $7_1 = $8_1; $23_1 = HEAP32[$6_1 + 8 >> 2]; if (($23_1 | 0) == HEAP32[$9_1 + 20 >> 2]) { break block65 } while (1) { $6_1 = HEAP32[$7_1 >> 2]; if (!$6_1) { break block71 } $7_1 = $6_1 + 20 | 0; if (($23_1 | 0) != HEAP32[$6_1 + 44 >> 2]) { continue } break; }; break block65; } if (HEAP32[$6_1 + 16 >> 2] == ($11_1 | 0)) { break block65 } } $14 = $14 + 1 | 0; continue; }; } $6_1 = $10_1 + 204 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $10_1 + 196 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $10_1 + 188 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$10_1 + 180 >> 2] = 0; HEAP32[$10_1 + 184 >> 2] = 0; HEAP32[$10_1 + 176 >> 2] = $0_1; $18_1 = 0; $22_1 = 0; if ($31_1) { $22_1 = HEAP32[$31_1 >> 2]; if ($1126($10_1 + 176 | 0, $31_1)) { break block73 } } $6_1 = -1; } $20_1 = $6_1; $27 = 1; break block74; } $6_1 = 0; $19_1 = 0; break block1; } $20_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $20_1 + 1; $6_1 = $893($0_1); $11_1 = $893($0_1); $326($13_1, 117, $20_1, $22_1); $7_1 = $858($13_1, 12, HEAP32[$10_1 + 128 >> 2]); $835($13_1, 97, $18_1, $22_1, $6_1); $326($13_1, 127, $20_1, $11_1); $835($13_1, 128, $20_1, $6_1, $11_1); $863($13_1, $7_1); $14 = HEAP32[$13_1 + 108 >> 2]; $8_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $8_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 8 >> 2] = $14; $894($0_1, $6_1); $894($0_1, $11_1); $27 = 0; } block76 : { if (($22_1 | 0) <= 0 | $3) { break block76 } $7_1 = 0; block77 : { $8_1 = HEAP32[$9_1 + 28 >> 2]; $2_1 = HEAP16[$9_1 + 32 >> 1]; if (!($8_1 & 96) | ($2_1 | 0) < 0) { break block77 } $6_1 = $2_1; while (1) { if (($6_1 | 0) <= 0) { break block77 } $2_1 = $2_1 - ((HEAPU8[(HEAP32[$9_1 + 4 >> 2] + Math_imul($6_1, 12) | 0) - 2 | 0] & 96) != 0) | 0; $6_1 = $6_1 - 1 | 0; continue; }; } $11_1 = HEAP16[$9_1 + 34 >> 1]; block78 : { if (!($8_1 & 98)) { break block78 } $8_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $6_1 = 0; while (1) { if (($6_1 | 0) == ($8_1 | 0)) { break block78 } $7_1 = ((HEAPU8[(HEAP32[$9_1 + 4 >> 2] + Math_imul($6_1, 12) | 0) + 10 | 0] & 98) != 0) + $7_1 | 0; $6_1 = $6_1 + 1 | 0; continue; }; } $6_1 = $11_1 - $7_1 | 0; if (($6_1 | 0) == ($22_1 | 0)) { break block76 } HEAP32[$10_1 + 72 >> 2] = $22_1; HEAP32[$10_1 + 68 >> 2] = $6_1; HEAP32[$10_1 + 64 >> 2] = $1_1 + 8; $257($0_1, 16301, $10_1 - -64 | 0); break block59; } block79 : { if (!$3) { break block79 } $6_1 = HEAP32[$3 >> 2]; if (($6_1 | 0) == ($22_1 | 0)) { break block79 } HEAP32[$10_1 + 52 >> 2] = $6_1; HEAP32[$10_1 + 48 >> 2] = $22_1; $257($0_1, 5200, $10_1 + 48 | 0); break block59; } $6_1 = 0; $23_1 = 0; block80 : { if (!(HEAP8[$25 + 36 | 0] & 1)) { break block80 } if (HEAPU8[$0_1 + 18 | 0]) { break block80 } if (HEAP32[$0_1 + 136 >> 2]) { break block80 } if (HEAPU8[$0_1 + 163 | 0]) { break block80 } $23_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $23_1; $326($13_1, 71, 0, $23_1); } if (($34_1 | 0) == 2) { break block81 } $11_1 = $1099($0_1, $9_1, 113, 0, -1, 0, $10_1 + 156 | 0, $10_1 + 152 | 0); $6_1 = $325($25, ($11_1 << 2) + 8 | 0, 0); if ($6_1) { break block82 } } $6_1 = 0; break block1; } $7_1 = 0; $11_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $14 = $9_1 + 8 | 0; while (1) { if (!(($7_1 | 0) == ($11_1 | 0))) { $8_1 = HEAP32[$14 >> 2]; $14 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $14; HEAP32[($7_1 << 2) + $6_1 >> 2] = $14; HEAP32[$0_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2] + HEAPU16[$8_1 + 52 >> 1]; $7_1 = $7_1 + 1 | 0; $14 = $8_1 + 20 | 0; continue; } break; }; $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; HEAP32[($11_1 << 2) + $6_1 >> 2] = $7_1; } if ($5_1) { block87 : { switch (HEAPU8[$9_1 + 43 | 0] - 1 | 0) { case 0: HEAP32[$10_1 + 32 >> 2] = HEAP32[$9_1 >> 2]; $257($0_1, 29718, $10_1 + 32 | 0); break block1; case 1: $257($0_1, 1840, 0); break block1; default: break block87; }; } if ($908($0_1, HEAP32[$5_1 >> 2])) { break block1 } $37_1 = HEAP32[$10_1 + 156 >> 2]; HEAP32[$1_1 + 24 >> 2] = $37_1; $38_1 = $10_1 + 228 | 0; $40_1 = HEAP32[$10_1 + 152 >> 2]; $26_1 = $10_1 + 292 | 0; $41_1 = $26_1 + 24 | 0; $39_1 = $26_1 + 16 | 0; $11_1 = $5_1; while (1) { HEAP32[$11_1 + 44 >> 2] = $40_1; HEAP32[$11_1 + 40 >> 2] = $37_1; HEAP32[$11_1 + 36 >> 2] = $12_1; HEAP32[$11_1 + 32 >> 2] = $1_1; block88 : { if (!HEAP32[$11_1 >> 2]) { break block88 } $32_1 = 0; HEAP32[$41_1 >> 2] = 0; HEAP32[$39_1 >> 2] = 0; HEAP32[$39_1 + 4 >> 2] = 0; $7_1 = $26_1 + 8 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; HEAP32[$26_1 >> 2] = 0; HEAP32[$26_1 + 4 >> 2] = 0; HEAP32[$10_1 + 288 >> 2] = $1_1; HEAP32[$10_1 + 284 >> 2] = $0_1; $14 = $11_1; while (1) { if (!$14) { break block88 } $7_1 = HEAP32[$14 >> 2]; if (!$7_1) { break block88 } $8_1 = $10_1 + 284 | 0; if ($1126($8_1, $7_1)) { break block1 } if ($1096($8_1, HEAP32[$14 + 4 >> 2])) { break block1 } $35_1 = HEAP32[$1_1 + 24 >> 2]; block90 : { $7_1 = HEAP32[$1_1 + 16 >> 2]; $33_1 = HEAP32[$14 >> 2]; block89 : { if (HEAPU8[$7_1 + 28 | 0] & 128 | HEAP32[$33_1 >> 2] != 1) { break block89 } $8_1 = HEAP32[$33_1 + 8 >> 2]; if (HEAPU8[$8_1 | 0] != 168) { break block89 } if (HEAPU16[$8_1 + 32 >> 1] == 65535) { break block90 } } wasm2js_memory_fill($10_1 + 176 | 0, 0, 104); HEAP32[$10_1 + 256 >> 2] = $35_1; HEAP8[$10_1 + 228 | 0] = 168; HEAP32[$10_1 + 188 >> 2] = $38_1; HEAP8[$10_1 + 176 | 0] = 114; $42_1 = $33_1 + 8 | 0; $7_1 = $7_1 + 8 | 0; while (1) { $21_1 = HEAP32[$7_1 >> 2]; if ($21_1) { block93 : { if (!HEAPU8[$21_1 + 54 | 0]) { break block93 } $8_1 = HEAP32[$33_1 >> 2]; if (($8_1 | 0) != HEAPU16[$21_1 + 50 >> 1]) { break block93 } $7_1 = HEAP32[$21_1 + 36 >> 2]; if ($7_1) { $8_1 = HEAP32[$14 + 4 >> 2]; if (!$8_1) { break block93 } if ($1121($0_1, $8_1, $7_1, $35_1)) { break block93 } $8_1 = HEAPU16[$21_1 + 50 >> 1]; } $15_1 = 0; while (1) { if (($8_1 | 0) != ($15_1 | 0)) { HEAP32[$10_1 + 184 >> 2] = HEAP32[HEAP32[$21_1 + 32 >> 2] + ($15_1 << 2) >> 2]; $7_1 = HEAPU16[HEAP32[$21_1 + 4 >> 2] + ($15_1 << 1) >> 1]; block97 : { if (($7_1 | 0) == 65534) { $17_1 = HEAP32[(HEAP32[$21_1 + 40 >> 2] + ($15_1 << 4) | 0) + 8 >> 2]; if (HEAPU8[$17_1 | 0] == 114) { break block97 } HEAP32[$10_1 + 188 >> 2] = $17_1; $17_1 = $10_1 + 176 | 0; break block97; } HEAP16[$10_1 + 260 >> 1] = $7_1; HEAP32[$10_1 + 188 >> 2] = $38_1; $17_1 = $10_1 + 176 | 0; } $7_1 = 0; while (1) { if (($7_1 | 0) == ($8_1 | 0)) { break block93 } $43_1 = $7_1 << 4; $7_1 = $7_1 + 1 | 0; if ($1121(0, HEAP32[$42_1 + $43_1 >> 2], $17_1, $35_1) >>> 0 > 1) { continue } break; }; $15_1 = $15_1 + 1 | 0; continue; } break; }; HEAP32[$14 + 28 >> 2] = $21_1; if (($1127($5_1, $21_1) | 0) == ($14 | 0)) { break block90 } HEAP8[$14 + 21 | 0] = 1; break block90; } $7_1 = $21_1 + 20 | 0; continue; } break; }; if (HEAP32[$14 + 28 >> 2]) { break block90 } block99 : { if (!(HEAP32[$14 + 16 >> 2] | $32_1)) { HEAP8[$10_1 + 160 | 0] = 0; break block99; } HEAP32[$10_1 + 16 >> 2] = $32_1 + 1; $63(16, $10_1 + 160 | 0, 30186, $10_1 + 16 | 0); } HEAP32[$10_1 >> 2] = $10_1 + 160; $257($0_1, 2751, $10_1); break block1; } $32_1 = $32_1 + 1 | 0; $14 = HEAP32[$14 + 16 >> 2]; continue; }; } $11_1 = HEAP32[$11_1 + 16 >> 2]; if ($11_1) { continue } break; }; } block101 : { if (!$27) { $15_1 = $858($13_1, 36, $20_1); $11_1 = HEAP32[$13_1 + 108 >> 2]; break block101; } if (!$19_1) { $11_1 = 0; $15_1 = 0; break block101; } $11_1 = $858($13_1, 12, HEAP32[$10_1 + 128 >> 2]); if (($2_1 | 0) >= 0) { $326($13_1, 80, $2_1 + $18_1 | 0, $16_1) } $15_1 = $11_1; } $21_1 = $31_1 + 8 | 0; $17_1 = 0; $14 = $12_1; $7_1 = 0; while (1) { $8_1 = HEAP16[$9_1 + 34 >> 1]; if (!(($8_1 | 0) <= ($7_1 | 0))) { block106 : { if (($7_1 | 0) == HEAP16[$9_1 + 32 >> 1]) { $858($13_1, 76, $14); break block106; } block113 : { block111 : { $8_1 = HEAP32[$9_1 + 4 >> 2] + Math_imul($7_1, 12) | 0; $26_1 = HEAPU16[$8_1 + 10 >> 1]; block110 : { if ($26_1 & 98) { $17_1 = $17_1 + 1 | 0; if ($26_1 & 32) { $14 = $14 - 1 | 0; break block106; } if ($26_1 & 64) { if (!(HEAP8[$10_1 + 120 | 0] & 1)) { break block106 } $858($13_1, 76, $14); break block106; } if ($3) { break block110 } $1128($0_1, $891($9_1, $8_1), $14); break block106; } if (!$3) { break block111 } } $26_1 = HEAP32[($7_1 << 2) + $28_1 >> 2]; if (!$26_1) { $1128($0_1, $891($9_1, $8_1), $14); break block106; } $8_1 = $26_1 - 1 | 0; break block113; } if (!$22_1) { $1128($0_1, $891($9_1, $8_1), $14); break block106; } $8_1 = $7_1 - $17_1 | 0; } if (!$27) { $835($13_1, 94, $20_1, $8_1, $14); break block106; } if ($19_1) { if (($12_1 | 0) == ($18_1 | 0)) { break block106 } $326($13_1, 81, $8_1 + $18_1 | 0, $14); break block106; } $8_1 = HEAP32[$21_1 + ($8_1 << 4) >> 2]; $26_1 = $1129($0_1, $8_1, $14); if (($26_1 | 0) == ($14 | 0)) { break block106 } $326($13_1, HEAP32[$8_1 + 4 >> 2] & 4194304 ? 80 : 81, $26_1, $14); } $14 = $14 + 1 | 0; $7_1 = $7_1 + 1 | 0; continue; } break; }; $18_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $18_1; if (HEAP8[$10_1 + 120 | 0] & 1) { $7_1 = $1060($0_1, $8_1 + 1 | 0); block119 : { if (($2_1 | 0) < 0) { $326($13_1, 71, -1, $7_1); break block119; } block121 : { if (!$27) { $835($13_1, 94, $20_1, $2_1, $7_1); break block121; } $862($0_1, HEAP32[$21_1 + ($2_1 << 4) >> 2], $7_1); } $14 = $858($13_1, 52, $7_1); $326($13_1, 71, -1, $7_1); $17_1 = HEAP32[$13_1 + 108 >> 2]; $8_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $8_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($14, 20) | 0) + 8 >> 2] = $17_1; $858($13_1, 13, $7_1); } $8_1 = $7_1 + 1 | 0; $835($13_1, 80, $16_1 + 1 | 0, $8_1, HEAP16[$9_1 + 36 >> 1] - 1 | 0); if (HEAPU8[$9_1 + 28 | 0] & 96) { $1112($0_1, $8_1, $9_1) } if (($34_1 | 0) != 2) { $998($13_1, $9_1, $8_1) } $1113($0_1, $30_1, 128, 0, 1, $9_1, $7_1 + (HEAP16[$9_1 + 34 >> 1] ^ -1) | 0, $4_1, $18_1); $1061($0_1, $7_1, HEAP16[$9_1 + 34 >> 1] + 1 | 0); } block125 : { if (($34_1 | 0) == 2) { break block125 } if (HEAPU8[$9_1 + 43 | 0] == 1) { $326($13_1, 75, 0, $24_1) } block131 : { if (($2_1 | 0) >= 0) { block129 : { if (!$27) { $835($13_1, 94, $20_1, $2_1, $16_1); break block129; } if ($19_1) { break block129 } block130 : { $8_1 = HEAP32[$21_1 + ($2_1 << 4) >> 2]; if (HEAPU8[$8_1 | 0] != 122) { break block130 } $7_1 = 1; if (HEAPU8[$9_1 + 43 | 0] == 1) { break block130 } $835($13_1, 127, HEAP32[$10_1 + 156 >> 2], $16_1, $29_1); break block131; } $862($0_1, $8_1, $16_1); } block134 : { if (HEAPU8[$9_1 + 43 | 0] != 1) { $8_1 = $858($13_1, 52, $16_1); $835($13_1, 127, HEAP32[$10_1 + 156 >> 2], $16_1, $29_1); $14 = HEAP32[$13_1 + 108 >> 2]; $7_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $7_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $14; break block134; } $326($13_1, 51, $16_1, HEAP32[$13_1 + 108 >> 2] + 2 | 0); } $858($13_1, 13, $16_1); $7_1 = 0; break block131; } if (!(!$36_1 & HEAPU8[$9_1 + 43 | 0] != 1)) { $7_1 = 0; $326($13_1, 75, 0, $16_1); break block131; } $835($13_1, 127, HEAP32[$10_1 + 156 >> 2], $16_1, $29_1); $7_1 = 1; } $1125($0_1, $29_1, $16_1); if (HEAPU8[$9_1 + 28 | 0] & 96) { $1112($0_1, $16_1 + 1 | 0, $9_1) } if (HEAPU8[$9_1 + 43 | 0] == 1) { $2_1 = $684($25, $9_1); $1101($0_1, $9_1); $859($13_1, 7, 1, HEAP16[$9_1 + 34 >> 1] + 2 | 0, $24_1, $2_1, -11); $2_1 = HEAP32[$13_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$13_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = ($4_1 | 0) == 11 ? 2 : $4_1 } $2_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $0_1) + 21 | 0] = 1; break block125; } HEAP32[$10_1 + 176 >> 2] = 0; $8_1 = HEAP32[$10_1 + 156 >> 2]; $16_1 = HEAP32[$10_1 + 152 >> 2]; $1114($0_1, $9_1, $6_1, $8_1, $16_1, $24_1, 0, ($2_1 ^ -1) >>> 31 | 0, $4_1 & 255, $18_1, $10_1 + 176 | 0, 0, $5_1); if (HEAPU8[$25 + 33 | 0] & 64) { $1115($0_1, $9_1, 0, $24_1, 0, 0) } if (HEAP32[$10_1 + 176 >> 2]) { $2_1 = !HEAP32[$13_1 + 232 >> 2] } else { $2_1 = 1 } $1117($0_1, $9_1, $8_1, $16_1, $24_1, $6_1, 0, $7_1, $2_1); } if ($23_1) { $326($13_1, 86, $23_1, 1) } if ($30_1) { $1113($0_1, $30_1, 128, 0, 2, $9_1, ($12_1 - HEAP16[$9_1 + 34 >> 1] | 0) - 2 | 0, $4_1, $18_1) } $1013($13_1, $18_1); if (!$27) { $326($13_1, 39, $20_1, $11_1); $4_1 = HEAP32[$13_1 + 108 >> 2]; $2_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $2_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($15_1, 20) | 0) + 8 >> 2] = $4_1; $858($13_1, 122, $20_1); break block45; } if (!$19_1) { break block45 } $863($13_1, $11_1); $4_1 = HEAP32[$13_1 + 108 >> 2]; $2_1 = 82740; HEAP32[(HEAPU8[HEAP32[$13_1 >> 2] + 87 | 0] ? $2_1 : HEAP32[$13_1 + 104 >> 2] + Math_imul($15_1, 20) | 0) + 8 >> 2] = $4_1; } if (!(HEAPU8[$0_1 + 18 | 0] | HEAP32[$0_1 + 136 >> 2])) { $1103($0_1) } if (!$23_1) { break block1 } $1104($13_1, $23_1, 15592); break block1; } $28_1 = 0; } $794($25, $1_1); $358($25, $31_1); $849($25, $5_1); $789($25, $19_1); if ($3) { $12($25, $3); $10($25, $28_1); } if ($6_1) { $16($25, $6_1) } $0_1 = $10_1 + 320 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $958($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $6_1 = global$0 - 16 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; if ($1_1) { $7_1 = HEAP32[$1_1 >> 2] } else { $7_1 = 0 } $8_1 = HEAP32[$0_1 >> 2]; block2 : { if (!$2_1 | !$3) { break block2 } block3 : { if (HEAPU8[$3 | 0] == 139) { break block3 } $5_1 = HEAP32[$2_1 >> 2]; $4_1 = $1119($3); if (($5_1 | 0) == ($4_1 | 0)) { break block3 } HEAP32[$6_1 + 4 >> 2] = $4_1; HEAP32[$6_1 >> 2] = $5_1; $257($0_1, 5330, $6_1); break block2; } $9_1 = $2_1 + 4 | 0; $5_1 = 0; while (1) { $4_1 = HEAP32[$2_1 >> 2]; if (!(($4_1 | 0) <= ($5_1 | 0))) { $4_1 = $1120($0_1, $3, $5_1, $4_1); block5 : { if (!$4_1) { break block5 } $1_1 = $936($0_1, $1_1, $4_1); if (!$1_1) { $1_1 = 0; break block5; } $4_1 = ($5_1 << 2) + $9_1 | 0; HEAP32[((HEAP32[$1_1 >> 2] << 4) + $1_1 | 0) - 4 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$4_1 >> 2] = 0; } $5_1 = $5_1 + 1 | 0; continue; } break; }; if (!$1_1 | (HEAPU8[$8_1 + 87 | 0] | HEAPU8[$3 | 0] != 139)) { break block2 } $5_1 = HEAP32[(($7_1 << 4) + $1_1 | 0) + 8 >> 2]; HEAP32[$5_1 + 28 >> 2] = $4_1; HEAP32[$5_1 + 16 >> 2] = $3; $3 = 0; } $941($0_1, $3); $12($8_1, $2_1); $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $959($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block : { if (!$1_1) { break block } $1_1 = ((HEAP32[$1_1 >> 2] << 4) + $1_1 | 0) - 4 | 0; $4_1 = $299(HEAP32[$0_1 >> 2], HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], 0); HEAP32[$1_1 >> 2] = $4_1; if (!$3) { break block } $300($4_1); if (HEAPU8[$0_1 + 224 | 0] < 2) { break block } $934($0_1, HEAP32[$1_1 >> 2], $2_1); } } function $960($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!$1_1) { break block } $3 = HEAP32[$2_1 + 4 >> 2]; if (!$3) { break block } $1_1 = (Math_imul(HEAP32[$1_1 >> 2], 48) + $1_1 | 0) - 40 | 0; $4_1 = 1; if (!(!HEAP32[$2_1 >> 2] & ($3 | 0) == 1)) { HEAP32[$1_1 + 32 >> 2] = $875(HEAP32[$0_1 >> 2], $2_1); $4_1 = 2; } $0_1 = HEAPU8[$1_1 + 13 | 0] | HEAPU8[$1_1 + 14 | 0] << 8 | $4_1; HEAP8[$1_1 + 13 | 0] = $0_1; HEAP8[$1_1 + 14 | 0] = $0_1 >>> 8; } } function $961($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!(!$1_1 | HEAP32[$1_1 >> 2] <= HEAP32[HEAP32[$0_1 >> 2] + 128 >> 2])) { HEAP32[$3 >> 2] = $2_1; $257($0_1, 6653, $3); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $962($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = global$0 - 16 | 0; $7_1 = $8_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; $9_1 = HEAP32[$0_1 >> 2]; block11 : { block13 : { block3 : { block : { if (!$6_1 | $1_1) { break block } if (HEAP32[$6_1 >> 2]) { $1_1 = 20096 } else { if (!HEAP32[$6_1 + 4 >> 2]) { break block } $1_1 = 20377; } HEAP32[$8_1 >> 2] = $1_1; $257($0_1, 6892, $8_1); break block3; } $1_1 = $932($0_1, $1_1, $2_1, $3); if ($1_1) { $7_1 = (Math_imul(HEAP32[$1_1 >> 2], 48) + $1_1 | 0) - 40 | 0; block5 : { if (HEAPU8[$0_1 + 224 | 0] < 2) { break block5 } $10_1 = HEAP32[$7_1 >> 2]; if (!$10_1) { break block5 } if (HEAP32[$3 >> 2] ? !$3 : 1) { $3 = $2_1 } $934($0_1, $10_1, $3); } if (HEAP32[$4_1 + 4 >> 2]) { HEAP32[$7_1 + 4 >> 2] = $875($9_1, $4_1) } block9 : { if (!$5_1) { break block9 } if (!$973($0_1, $7_1, $5_1, 0) | !(HEAPU8[$5_1 + 5 | 0] & 8)) { break block9 } $0_1 = HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8 | 16384; HEAP8[$7_1 + 13 | 0] = $0_1; HEAP8[$7_1 + 14 | 0] = $0_1 >>> 8; } if (!$6_1) { HEAP32[$7_1 + 40 >> 2] = 0; break block11; } if (HEAP32[$6_1 + 4 >> 2]) { $0_1 = HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8 | 2048; HEAP8[$7_1 + 13 | 0] = $0_1; HEAP8[$7_1 + 14 | 0] = $0_1 >>> 8; HEAP32[$7_1 + 40 >> 2] = HEAP32[$6_1 + 4 >> 2]; break block11; } HEAP32[$7_1 + 40 >> 2] = HEAP32[$6_1 >> 2]; break block11; } if (!$6_1) { break block13 } } $0_1 = HEAP32[$6_1 >> 2]; if ($0_1) { $790($9_1, $0_1); break block13; } $0_1 = HEAP32[$6_1 + 4 >> 2]; if (!$0_1) { break block13 } $12($9_1, $0_1); } $789($9_1, $5_1); $1_1 = 0; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $963($0_1, $1_1, $2_1) { var $3 = 0; block : { if (!$2_1) { break block } $3 = $1086($0_1, $1_1, HEAP32[$2_1 >> 2], 1); if (!$3) { $794(HEAP32[$0_1 >> 2], $2_1); break block; } $1_1 = Math_imul(HEAP32[$2_1 >> 2], 48); if ($1_1) { wasm2js_memory_copy($3 + 56 | 0, $2_1 + 8 | 0, $1_1) } $13(HEAP32[$0_1 >> 2], $2_1); HEAP8[$3 + 20 | 0] = HEAPU8[$3 + 20 | 0] | HEAPU8[$3 + 68 | 0] & 64; return $3; } return $1_1; } function $964($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0, $44_1 = 0, $45_1 = 0, $46_1 = 0, $47_1 = 0, $48_1 = 0, $49 = 0, $50_1 = 0, $51_1 = 0; $19_1 = global$0 - 80 | 0; $7_1 = $19_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; $34_1 = HEAP32[$0_1 >> 2]; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $8_1 = $911($0_1, $1_1); if (!$8_1) { break block } $40_1 = $309(HEAP32[$0_1 >> 2], HEAP32[$8_1 + 60 >> 2]); $29_1 = $1092($0_1, $8_1, 130, $2_1, $19_1 + 40 | 0); $10_1 = HEAP32[$1_1 >> 2] >= 2 ? HEAP32[$2_1 >> 2] : $10_1; $35_1 = HEAPU8[$8_1 + 43 | 0]; if ($897($0_1, $8_1)) { break block } if ($1094($0_1, $8_1, $29_1)) { break block } $23_1 = HEAP32[$0_1 + 44 >> 2]; $28_1 = $23_1 + 1 | 0; HEAP32[$0_1 + 44 >> 2] = $28_1; if (HEAPU8[$8_1 + 28 | 0] & 128) { $20_1 = $359($8_1) } $6_1 = $28_1; $12_1 = $23_1; $30_1 = $8_1 + 8 | 0; $17_1 = $30_1; while (1) { $11_1 = HEAP32[$17_1 >> 2]; if ($11_1) { $7_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 44 >> 2] = $7_1; $12_1 = ($11_1 | 0) == ($20_1 | 0) ? $6_1 : $12_1; $41_1 = $41_1 + 1 | 0; $17_1 = $11_1 + 20 | 0; $6_1 = $7_1; continue; } break; }; if ($5_1) { $28_1 = HEAP32[$5_1 + 44 >> 2]; $12_1 = HEAP32[$5_1 + 40 >> 2]; HEAP32[$0_1 + 44 >> 2] = $23_1; } HEAP32[$1_1 + 24 >> 2] = $12_1; $17_1 = $325($34_1, ((HEAP16[$8_1 + 34 >> 1] + $41_1 << 2) + $41_1 | 0) + 6 | 0, 0); if (!$17_1) { $17_1 = 0; break block; } $37_1 = (HEAP16[$8_1 + 34 >> 1] << 2) + $17_1 | 0; $13_1 = $37_1 + ($41_1 << 2) | 0; $38_1 = $13_1 + 4 | 0; $16_1 = $41_1 + 1 | 0; $14 = !$16_1; if (!$14) { wasm2js_memory_fill($38_1, 1, $16_1) } $6_1 = 0; HEAP8[$16_1 + $38_1 | 0] = 0; $7_1 = HEAP16[$8_1 + 34 >> 1]; $7_1 = ($7_1 | 0) > 0 ? $7_1 : 0; while (1) { if (!(($6_1 | 0) == ($7_1 | 0))) { HEAP32[($6_1 << 2) + $17_1 >> 2] = -1; $6_1 = $6_1 + 1 | 0; continue; } break; }; $7_1 = $19_1 - -64 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; $7_1 = $19_1 + 72 | 0; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; HEAP32[$19_1 + 56 >> 2] = 0; HEAP32[$19_1 + 60 >> 2] = 0; HEAP32[$19_1 + 52 >> 2] = $5_1; HEAP32[$19_1 + 48 >> 2] = $1_1; HEAP32[$19_1 + 44 >> 2] = $0_1; HEAP32[$19_1 + 68 >> 2] = 512; $9_1 = $856($0_1); if (!$9_1) { break block } $45_1 = $2_1 + 8 | 0; $15_1 = -1; $11_1 = 0; while (1) { block17 : { block13 : { block15 : { if (($11_1 | 0) < HEAP32[$2_1 >> 2]) { $7_1 = ($11_1 << 4) + $45_1 | 0; $22_1 = $886(HEAP32[$7_1 + 4 >> 2]); if (!$10_1) { if ($1096($19_1 + 44 | 0, HEAP32[$7_1 >> 2])) { break block } } $6_1 = 0; $21_1 = HEAP16[$8_1 + 34 >> 1]; $24_1 = ($21_1 | 0) > 0 ? $21_1 : 0; while (1) { if (($6_1 | 0) != ($24_1 | 0)) { block11 : { $18_1 = HEAP32[$8_1 + 4 >> 2] + Math_imul($6_1, 12) | 0; if (($22_1 | 0) != HEAPU8[$18_1 + 7 | 0]) { break block11 } $21_1 = HEAP32[$18_1 >> 2]; if ($67($21_1, HEAP32[$7_1 + 4 >> 2])) { break block11 } if (($6_1 | 0) == HEAP16[$8_1 + 32 >> 1]) { $42_1 = HEAP32[$7_1 >> 2]; $25 = 1; $15_1 = $11_1; break block13; } if (!$20_1) { $7_1 = HEAPU16[$18_1 + 10 >> 1]; break block15; } $7_1 = HEAPU16[$18_1 + 10 >> 1]; if (!($7_1 & 1)) { break block15 } $48_1 = 1; break block13; } $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = HEAP32[$7_1 + 4 >> 2]; block16 : { if ($20_1) { break block16 } if (!$417($6_1)) { break block16 } $42_1 = HEAP32[$7_1 >> 2]; $21_1 = 20545; $25 = 1; $6_1 = -1; $15_1 = $11_1; break block17; } HEAP32[$19_1 >> 2] = $6_1; $257($0_1, 7984, $19_1); HEAP8[$0_1 + 17 | 0] = 1; break block; } $46_1 = $25 + $48_1 | 0; block18 : { if (!(HEAPU8[$8_1 + 28 | 0] & 96)) { break block18 } $7_1 = 0; $6_1 = 0; while (1) { $11_1 = $7_1; block20 : { if (($6_1 | 0) < HEAP16[$8_1 + 34 >> 1]) { $21_1 = ($6_1 << 2) + $17_1 | 0; if (HEAP32[$21_1 >> 2] >= 0) { break block20 } $18_1 = HEAP32[$8_1 + 4 >> 2] + Math_imul($6_1, 12) | 0; if (!(HEAPU8[$18_1 + 10 | 0] & 96)) { break block20 } if (!$1106($891($8_1, $18_1), $17_1, $25)) { break block20 } HEAP32[$21_1 >> 2] = 99999; $7_1 = 1; break block20; } $7_1 = 0; $6_1 = 0; if ($11_1) { continue } break block18; } $6_1 = $6_1 + 1 | 0; continue; }; } $7_1 = HEAPU8[$8_1 + 43 | 0] == 1; HEAP32[$1_1 + 32 >> 2] = $7_1 ? -1 : 0; HEAP32[$1_1 + 36 >> 2] = $7_1 ? -1 : 0; $47_1 = $46_1 & 255; $31_1 = $1093($0_1, $8_1, $17_1, $47_1); $11_1 = ($47_1 | 0) != 0 | $31_1 >>> 0 > 1; $21_1 = $13_1 + 5 | 0; $27 = ($4_1 | 0) == 5; $18_1 = ($4_1 | 0) != 11; $24_1 = 0; while (1) { block147 : { block143 : { block25 : { block24 : { $7_1 = HEAP32[$30_1 >> 2]; if ($7_1) { if (!($11_1 | ($7_1 | 0) == ($20_1 | 0))) { $6_1 = HEAP32[$7_1 + 36 >> 2]; if (!$6_1) { break block24 } if (!$1106($6_1, $17_1, $25)) { break block24 } } $6_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1 + HEAPU16[$7_1 + 52 >> 1]; break block25; } HEAP32[$19_1 + 36 >> 2] = $27; $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; $49 = ($24_1 << 2) + $37_1 | 0; HEAP32[$49 >> 2] = $7_1; if (!($14 | !$27)) { wasm2js_memory_fill($38_1, 1, $16_1) } if (!HEAPU8[$0_1 + 18 | 0]) { HEAP16[$9_1 + 152 >> 1] = HEAPU16[$9_1 + 152 >> 1] | 16 } $13_1 = 0; $923($0_1, ($29_1 | $31_1) != 0, $40_1); $11_1 = 0; $24_1 = 0; $6_1 = HEAPU8[$8_1 + 43 | 0]; if (($6_1 | 0) != 1) { $11_1 = HEAP32[$0_1 + 48 >> 2]; $13_1 = $11_1 + 1 | 0; $50_1 = HEAP32[$49 >> 2]; block30 : { if (!($29_1 | $48_1)) { $21_1 = $13_1; if (!$31_1) { break block30 } } $24_1 = $11_1 + 2 | 0; $21_1 = HEAP16[$8_1 + 34 >> 1] + $13_1 | 0; } $7_1 = $21_1; $11_1 = $7_1 + 1 | 0; $7_1 = $29_1 | $46_1 & 255 | $31_1; $16_1 = $7_1 ? $11_1 : $21_1; HEAP32[$0_1 + 48 >> 2] = $16_1 + HEAP16[$8_1 + 34 >> 1]; $36_1 = $7_1 ? $11_1 : $13_1; $11_1 = $16_1 + 1 | 0; } block37 : { block33 : { block35 : { block32 : { if (($35_1 | 0) != 2) { $7_1 = 0; $40_1 = 0; $30_1 = 0; $21_1 = 0; if (!$10_1) { break block32 } break block33; } $7_1 = HEAP32[$0_1 + 264 >> 2]; HEAP32[$0_1 + 264 >> 2] = HEAP32[$8_1 >> 2]; $30_1 = 0; if ($10_1) { $21_1 = $0_1; break block35; } $1095($0_1, $8_1, $3, $12_1); $21_1 = $0_1; } if ($1096($19_1 + 44 | 0, $3)) { $40_1 = $7_1; break block37; } $6_1 = HEAPU8[$8_1 + 43 | 0]; $30_1 = 1; } $40_1 = $7_1; } if (($6_1 & 255) == 1) { $5_1 = HEAP32[$0_1 + 8 >> 2]; $15_1 = HEAP32[$0_1 >> 2]; $23_1 = $684($15_1, $8_1); $7_1 = HEAP32[$1_1 + 24 >> 2]; $6_1 = HEAP16[$8_1 + 34 >> 1]; $11_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $11_1 + 1; $16_1 = $6_1 + 2 | 0; $10_1 = $326($5_1, 117, $11_1, $16_1); $12_1 = HEAP32[$0_1 + 48 >> 2]; $14 = $12_1 + $16_1 | 0; HEAP32[$0_1 + 48 >> 2] = $14; $18_1 = $12_1 + 1 | 0; block58 : { block54 : { block55 : { block44 : { if (HEAP32[$1_1 >> 2] >= 2) { block42 : { if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { if ($42_1) { $20_1 = 0; $6_1 = $906($15_1, $42_1, 0); break block42; } $20_1 = 0; $6_1 = $903($0_1, 76, 0, 0); break block42; } $20_1 = $359($8_1); $7_1 = HEAP16[HEAP32[$20_1 + 4 >> 2] >> 1]; $6_1 = HEAP32[($7_1 << 2) + $17_1 >> 2]; if (($6_1 | 0) >= 0) { $6_1 = $906($15_1, HEAP32[($6_1 << 4) + $45_1 >> 2], 0); break block42; } $6_1 = $1107($0_1, $7_1); } $24_1 = $935(HEAP32[$0_1 >> 2], $6_1); $6_1 = 0; while (1) { if (HEAP16[$8_1 + 34 >> 1] <= ($6_1 | 0)) { break block44 } $7_1 = HEAP32[($6_1 << 2) + $17_1 >> 2]; block46 : { if (($7_1 | 0) >= 0) { $7_1 = $906($15_1, HEAP32[($7_1 << 4) + $45_1 >> 2], 0); break block46; } $7_1 = $1107($0_1, $6_1); if (!$7_1) { $7_1 = 0; break block46; } HEAP8[$7_1 + 2 | 0] = 1; } $6_1 = $6_1 + 1 | 0; $24_1 = $936($0_1, $24_1, $7_1); continue; }; } $28_1 = $14 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $28_1; $13_1 = $1044($0_1, $1_1, $3, 0, 0, 0, 4, 0); if (!$13_1) { break block37 } $15_1 = $12_1 + 3 | 0; $6_1 = 0; while (1) { if (!(HEAP16[$8_1 + 34 >> 1] <= ($6_1 | 0))) { $25 = HEAP32[($6_1 << 2) + $17_1 >> 2]; block50 : { if (($25 | 0) >= 0) { $862($0_1, HEAP32[($25 << 4) + $45_1 >> 2], $6_1 + $15_1 | 0); break block50; } $835($5_1, 176, $7_1, $6_1, $6_1 + $15_1 | 0); $25 = HEAP32[$5_1 + 108 >> 2]; if (($25 | 0) <= 0) { break block50 } HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($25, 20) | 0) - 18 >> 1] = 1; } $6_1 = $6_1 + 1 | 0; continue; } break; }; block53 : { if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { $326($5_1, 135, $7_1, $18_1); $6_1 = $12_1 + 2 | 0; if ($42_1) { $862($0_1, $42_1, $6_1); break block53; } $326($5_1, 135, $7_1, $6_1); break block53; } $6_1 = HEAP16[HEAP32[$359($8_1) + 4 >> 2] >> 1]; $835($5_1, 176, $7_1, $6_1, $18_1); $326($5_1, 81, $6_1 + $15_1 | 0, $12_1 + 2 | 0); } if (HEAPU8[$13_1 + 46 | 0]) { break block54 } $7_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($7_1 ? $7_1 : $0_1) + 20 | 0] = 1; $7_1 = $14 + 1 | 0; $835($5_1, 97, $18_1, $16_1, $7_1); $326($5_1, 127, $11_1, $28_1); $835($5_1, 128, $11_1, $7_1, $28_1); break block55; } $1108($0_1, $11_1, $20_1, $24_1, $1_1, $3); $358($15_1, $24_1); $13_1 = 0; } if (HEAP32[$1_1 >> 2] == 1) { $1054($13_1) } $6_1 = 0; $7_1 = ($16_1 | 0) > 0 ? $16_1 : 0; $10_1 = $858($5_1, 36, $11_1); while (1) { $15_1 = 1; if (($6_1 | 0) == ($7_1 | 0)) { break block58 } $835($5_1, 94, $11_1, $6_1, $6_1 + $18_1 | 0); $6_1 = $6_1 + 1 | 0; continue; }; } $1045($5_1, $10_1); $858($5_1, 122, $7_1); $15_1 = 0; } $6_1 = $15_1; $1101($0_1, $8_1); $859($5_1, 7, 0, $16_1, $18_1, $23_1, -11); $7_1 = HEAP32[$5_1 + 108 >> 2]; if (($7_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) - 18 >> 1] = ($4_1 | 0) == 11 ? 2 : $4_1 } $4_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($4_1 ? $4_1 : $0_1) + 21 | 0] = 1; if ($6_1) { $326($5_1, 39, $11_1, $10_1 + 1 | 0); $0_1 = HEAP32[$5_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = $0_1; $326($5_1, 122, $11_1, 0); break block37; } $1054($13_1); break block37; } $18_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $18_1; block62 : { if (HEAP32[$0_1 + 136 >> 2] | !(HEAP8[$34_1 + 36 | 0] & 1) | ($5_1 | HEAPU8[$0_1 + 18 | 0])) { break block62 } if (HEAPU8[$0_1 + 163 | 0]) { break block62 } $43_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $43_1; $326($9_1, 71, 0, $43_1); } block74 : { block76 : { block75 : { block73 : { block71 : { block72 : { block67 : { block64 : { if (!(!$30_1 | HEAPU8[$8_1 + 28 | 0] & 128)) { $7_1 = 0; $835($9_1, 75, 0, $50_1, $13_1); $22_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $22_1 + 1; $32_1 = $835($9_1, 117, $22_1, 0, $50_1); $16_1 = 0; break block64; } if ($20_1) { $44_1 = HEAP16[$20_1 + 50 >> 1] } else { $44_1 = 0 } $26_1 = $44_1 << 16 >> 16; $7_1 = HEAP32[$0_1 + 48 >> 2]; $14 = $26_1 + $7_1 | 0; $16_1 = ($14 + $10_1 | 0) + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $16_1; $7_1 = $7_1 + 1 | 0; if ($5_1) { break block67 } $26_1 = $10_1 + $26_1 | 0; $6_1 = 0; $6_1 = ($35_1 | 0) == 2 ? HEAP16[$8_1 + 34 >> 1] : $6_1; $22_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $22_1 + 1; $6_1 = $6_1 + $26_1 | 0; if ($20_1) { $835($9_1, 75, 0, $7_1, $14) } $32_1 = $326($9_1, 117, $22_1, $6_1); block70 : { if (!$20_1) { break block70 } $14 = $1053($0_1, $20_1); if (!$14) { break block70 } HEAP16[$14 + 8 >> 1] = $6_1; $1043($9_1, $14, -8); } if ($30_1) { break block64 } $1108($0_1, $22_1, $20_1, $2_1, $1_1, $3); $12_1 = ($35_1 | 0) == 2 ? $22_1 : $12_1; } if (!$10_1) { break block71 } $26_1 = $44_1 << 16 >> 16; break block72; } $22_1 = 0; if (!$10_1) { break block73 } } $27 = 1; $6_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($6_1 ? $6_1 : $0_1) + 20 | 0] = 1; $14 = 0; $51_1 = 1; $16_1 = $7_1; break block74; } if (!$5_1) { break block75 } } $1059($0_1, $3, $18_1, 16); $14 = 1; break block76; } $6_1 = 4; block77 : { if ($27 | $29_1 | ($31_1 | HEAPU8[$0_1 + 18 | 0])) { break block77 } if (!(HEAPU8[$3 + 6 | 0] & 64 ? !$3 : 1) | $46_1 & 255) { break block77 } $6_1 = 12; } $39_1 = $1044($0_1, $1_1, $3, 0, 0, 0, $6_1, $28_1); if (!$39_1) { break block37 } $14 = 1; $51_1 = HEAP8[$39_1 + 48 | 0] & 1; $10_1 = HEAP32[$39_1 + 24 >> 2]; $33_1 = HEAP32[$39_1 + 20 >> 2]; $6_1 = HEAPU8[$39_1 + 46 | 0]; if (($6_1 | 0) == 1) { break block76 } $14 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($14 ? $14 : $0_1) + 20 | 0] = 1; $14 = 2; if (($6_1 | 0) != 2) { $14 = $6_1; break block76; } if (($10_1 | 0) == ($12_1 | 0) | ($10_1 | 0) < 0) { break block76 } $14 = HEAPU8[($10_1 - $23_1 | 0) + $38_1 | 0] ? 0 : 2; } block87 : { block86 : { block83 : { block81 : { if (HEAPU8[$8_1 + 28 | 0] & 128) { $6_1 = 0; $26_1 = $44_1 << 16 >> 16; $27 = ($26_1 | 0) > 0 ? $26_1 : 0; while (1) { if (($6_1 | 0) == ($27 | 0)) { break block81 } $890($9_1, $8_1, $12_1, HEAP16[HEAP32[$20_1 + 4 >> 2] + ($6_1 << 1) >> 1], $6_1 + $7_1 | 0); $6_1 = $6_1 + 1 | 0; continue; }; } $326($9_1, 135, $12_1, $13_1); if (!$14) { $6_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; HEAP32[$49 >> 2] = $6_1; $835($9_1, 128, $22_1, $50_1, $13_1); break block83; } if (!$32_1) { break block87 } $1045($9_1, $32_1); break block87; } if ($14) { $27 = 0; if (!$32_1) { break block86 } $1045($9_1, $32_1); break block86; } $859($9_1, 97, $7_1, $26_1, $16_1, $1098($34_1, $20_1), $26_1); $312($9_1, 138, $22_1, $16_1, $7_1, $26_1); } $14 = 0; break block87; } $16_1 = $7_1; break block74; } $27 = 0; $26_1 = 0; } $32_1 = 0; block89 : { if ($5_1) { $10_1 = $18_1; break block89; } if ($30_1 & ($14 | 0) != 2) { $1054($39_1) } block91 : { if (($35_1 | 0) == 2) { break block91 } $6_1 = 0; block92 : { if (!$14) { break block92 } if (($33_1 | 0) >= 0) { HEAP8[($33_1 - $23_1 | 0) + $38_1 | 0] = 0 } if (($10_1 | 0) >= 0) { HEAP8[($10_1 - $23_1 | 0) + $38_1 | 0] = 0 } $6_1 = 0; if (($14 | 0) != 2 | ((($10_1 ^ -1) >> 31) + $41_1 | 0) <= 0) { break block92 } $6_1 = $857($9_1, 15); } $1099($0_1, $8_1, 113, 0, $23_1, $38_1, $19_1 + 32 | 0, $19_1 + 28 | 0); if (!$6_1) { break block91 } $1100($9_1, $6_1); } if ($14) { if (!(($12_1 | 0) == ($33_1 | 0) | ($10_1 | 0) == ($12_1 | 0))) { $312($9_1, 28, $12_1, $18_1, $16_1, $26_1) } $10_1 = $18_1; if (($14 | 0) != 1) { $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; } $326($9_1, 51, $20_1 ? $16_1 : $13_1, $18_1); break block89; } if (!(!$20_1 & ($27 ^ 1))) { $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $326($9_1, 36, $22_1, $18_1); $32_1 = HEAP32[$9_1 + 108 >> 2]; if ($27) { if (($35_1 | 0) == 2) { break block89 } if ($20_1) { $6_1 = 0; $23_1 = $44_1 << 16 >> 16; $33_1 = ($23_1 | 0) > 0 ? $23_1 : 0; while (1) { if (!(($6_1 | 0) == ($33_1 | 0))) { $835($9_1, 94, $22_1, $6_1, $6_1 + $7_1 | 0); $6_1 = $6_1 + 1 | 0; continue; } break; }; $312($9_1, 28, $12_1, $10_1, $7_1, $23_1); break block89; } $326($9_1, 135, $22_1, $13_1); $835($9_1, 31, $12_1, $10_1, $13_1); break block89; } $326($9_1, 134, $22_1, $16_1); $312($9_1, 28, $12_1, $10_1, $16_1, 0); break block89; } $326($9_1, 36, $22_1, $18_1); $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $32_1 = $326($9_1, 135, $22_1, $13_1); $835($9_1, 31, $12_1, $10_1, $13_1); } if ($25) { block104 : { if ($30_1) { $862($0_1, $42_1, $36_1); break block104; } $835($9_1, 94, $22_1, $15_1, $36_1); } $858($9_1, 13, $36_1); } block106 : { if (!($29_1 | $48_1 | $31_1)) { break block106 } $6_1 = 0; if ($31_1) { $7_1 = $1109($0_1, $8_1) } else { $7_1 = $6_1 } $23_1 = $7_1 | $1110($0_1, $29_1, $2_1, 0, 3, $8_1, $4_1); $33_1 = ($23_1 | 0) == -1; while (1) { block112 : { block111 : { if (($6_1 | 0) < HEAP16[$8_1 + 34 >> 1]) { $7_1 = HEAPU16[(HEAP32[$8_1 + 4 >> 2] + Math_imul($6_1, 12) | 0) + 10 >> 1]; $15_1 = $1111($8_1, $6_1 << 16 >> 16) + $24_1 | 0; block109 : { if ($33_1) { break block109 } if ($6_1 >>> 0 <= 31) { if ($23_1 >>> $6_1 & 1 | $7_1 & 1) { break block109 } break block111; } if (!($7_1 & 1)) { break block111 } } $890($9_1, $8_1, $12_1, $6_1, $15_1); break block112; } if ($20_1 | $25) { break block106 } $326($9_1, 80, $13_1, $36_1); break block106; } $326($9_1, 75, 0, $15_1); } $6_1 = $6_1 + 1 | 0; continue; }; } $23_1 = $44_1 << 16 >> 16; $25 = $1110($0_1, $29_1, $2_1, 1, 1, $8_1, $4_1); $33_1 = ($35_1 | 0) == 2; $7_1 = $11_1; $6_1 = 0; while (1) { $24_1 = HEAP16[$8_1 + 34 >> 1]; if (!(($24_1 | 0) <= ($6_1 | 0))) { block115 : { if (($6_1 | 0) == HEAP16[$8_1 + 32 >> 1]) { $326($9_1, 75, 0, $7_1); break block115; } $15_1 = HEAPU16[(HEAP32[$8_1 + 4 >> 2] + Math_imul($6_1, 12) | 0) + 10 >> 1]; if ($15_1 & 96) { $7_1 = ($15_1 << 26 >> 31) + $7_1 | 0; break block115; } $15_1 = HEAP32[($6_1 << 2) + $17_1 >> 2]; if (($15_1 | 0) >= 0) { if ($27) { $835($9_1, 94, $22_1, $15_1 + ($33_1 ? $24_1 : $23_1) | 0, $7_1); break block115; } $862($0_1, HEAP32[($15_1 << 4) + $45_1 >> 2], $7_1); break block115; } if ($25 >>> $6_1 & 1 | (!(HEAP8[$19_1 + 40 | 0] & 1) | $6_1 >>> 0 > 31)) { $890($9_1, $8_1, $12_1, $6_1, $7_1); $51_1 = 0; break block115; } $326($9_1, 75, 0, $7_1); } $7_1 = $7_1 + 1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; if (HEAPU8[$8_1 + 28 | 0] & 96) { $1112($0_1, $11_1, $8_1) } block123 : { block122 : { if (!(HEAP8[$19_1 + 40 | 0] & 1)) { break block122 } $998($9_1, $8_1, $11_1); $1113($0_1, $29_1, 130, $2_1, 1, $8_1, $13_1, $4_1, $10_1); if (($35_1 | 0) == 2) { break block123 } block125 : { if ($20_1) { $312($9_1, 28, $12_1, $10_1, $16_1, $26_1); break block125; } $835($9_1, 31, $12_1, $10_1, $13_1); } $6_1 = 0; $7_1 = $11_1; while (1) { if (!(HEAP16[$8_1 + 34 >> 1] <= ($6_1 | 0))) { $15_1 = HEAPU16[(HEAP32[$8_1 + 4 >> 2] + Math_imul($6_1, 12) | 0) + 10 >> 1]; block128 : { if ($15_1 & 96) { $7_1 = ($15_1 << 26 >> 31) + $7_1 | 0; break block128; } if (HEAP16[$8_1 + 32 >> 1] == ($6_1 | 0) | HEAP32[($6_1 << 2) + $17_1 >> 2] >= 0) { break block128 } $890($9_1, $8_1, $12_1, $6_1, $7_1); } $7_1 = $7_1 + 1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; if (!(HEAPU8[$8_1 + 28 | 0] & 96)) { break block122 } $1112($0_1, $11_1, $8_1); } if (($35_1 | 0) == 2) { break block123 } $7_1 = $46_1 & 255; $1114($0_1, $8_1, $37_1, $12_1, $28_1, $36_1, $13_1, $7_1, $4_1 & 255, $10_1, $19_1 + 36 | 0, $17_1, 0); block130 : { if (!(HEAP32[$19_1 + 36 >> 2] | $7_1)) { break block130 } if ($20_1) { $312($9_1, 28, $12_1, $10_1, $16_1, $26_1); break block130; } $835($9_1, 31, $12_1, $10_1, $13_1); } if ($31_1) { $1115($0_1, $8_1, $13_1, 0, $17_1, $47_1) } $1116($0_1, $8_1, $12_1, $28_1, $37_1, -1); if ($51_1) { $858($9_1, 143, $12_1) } if (!(!($46_1 & 255) & $31_1 >>> 0 <= 1)) { $326($9_1, 130, $12_1, 0) } if ($31_1) { $1115($0_1, $8_1, 0, $36_1, $17_1, $47_1); $1117($0_1, $8_1, $12_1, $28_1, $36_1, $37_1, ($14 | 0) == 2 ? 6 : 4, 0, 0); $1118($0_1, $8_1, $2_1, $13_1, $17_1, $47_1); break block123; } $1117($0_1, $8_1, $12_1, $28_1, $36_1, $37_1, ($14 | 0) == 2 ? 6 : 4, 0, 0); } if ($43_1) { $326($9_1, 86, $43_1, 1) } if ($29_1) { $1113($0_1, $29_1, 130, $2_1, 2, $8_1, $13_1, $4_1, $10_1) } block139 : { block141 : { switch ($14 - 1 | 0) { case 1: $1013($9_1, $10_1); $1054($39_1); break block139; case 0: break block139; default: break block141; }; } $1013($9_1, $10_1); $326($9_1, 39, $22_1, $32_1); } $1013($9_1, $18_1); if (!(HEAPU8[$0_1 + 18 | 0] | (HEAP32[$0_1 + 136 >> 2] | $5_1))) { $1103($0_1) } if (!$43_1) { break block37 } $1104($9_1, $43_1, 15712); } if (!$21_1) { break block } HEAP32[$21_1 + 264 >> 2] = $40_1; break block; } $6_1 = 0; while (1) { if (HEAPU16[$7_1 + 50 >> 1] <= $6_1 >>> 0) { break block143 } block146 : { $13_1 = HEAP16[HEAP32[$7_1 + 4 >> 2] + ($6_1 << 1) >> 1]; block145 : { if (($13_1 | 0) >= 0) { if (HEAP32[($13_1 << 2) + $17_1 >> 2] < 0) { break block145 } break block146; } if ($1106(HEAP32[(HEAP32[$7_1 + 40 >> 2] + ($6_1 << 4) | 0) + 8 >> 2], $17_1, $25)) { break block146 } } $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1 + HEAPU16[$7_1 + 52 >> 1]; if ($18_1) { break block25 } $27 = HEAPU8[$7_1 + 54 | 0] == 5 ? 1 : $27; } if ($6_1) { break block147 } } $6_1 = 0; HEAP8[$24_1 + $21_1 | 0] = 0; } HEAP32[($24_1 << 2) + $37_1 >> 2] = $6_1; $24_1 = $24_1 + 1 | 0; $30_1 = $7_1 + 20 | 0; continue; }; } if (!($7_1 & 96)) { break block13 } HEAP32[$19_1 + 16 >> 2] = $21_1; $257($0_1, 29623, $19_1 + 16 | 0); break block; } HEAP32[($6_1 << 2) + $17_1 >> 2] = $11_1; } block149 : { switch ($864($0_1, 23, HEAP32[$8_1 >> 2], $21_1, HEAP32[HEAP32[$34_1 + 16 >> 2] + ($40_1 << 4) >> 2]) - 1 | 0) { case 1: HEAP32[($6_1 << 2) + $17_1 >> 2] = -1; break; case 0: break block; default: break block149; }; } $11_1 = $11_1 + 1 | 0; continue; }; } $10($34_1, $17_1); $794($34_1, $1_1); $358($34_1, $2_1); $11($34_1, $3); $0_1 = $19_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $965($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0; $8_1 = global$0 - 48 | 0; $4_1 = $8_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$8_1 + 44 >> 2] = 0; HEAP32[$8_1 + 40 >> 2] = 0; $17_1 = HEAP32[$0_1 >> 2]; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $7_1 = $911($0_1, $1_1); if (!$7_1) { break block } $24_1 = $1092($0_1, $7_1, 129, 0, 0); $22_1 = HEAPU8[$7_1 + 43 | 0]; $12_1 = 1; if (!$24_1) { $12_1 = ($1093($0_1, $7_1, 0, 0) | 0) != 0 } if ($897($0_1, $7_1)) { break block } if ($1094($0_1, $7_1, $24_1)) { break block } $3 = HEAP32[$7_1 >> 2]; $10_1 = HEAP32[$17_1 + 16 >> 2]; $4_1 = $309($17_1, HEAP32[$7_1 + 60 >> 2]); $14 = $864($0_1, 9, $3, 0, HEAP32[$10_1 + ($4_1 << 4) >> 2]); if (($14 | 0) == 1) { break block } $13_1 = HEAP32[$0_1 + 44 >> 2]; $10_1 = $13_1 + 1 | 0; HEAP32[$0_1 + 44 >> 2] = $10_1; HEAP32[$1_1 + 24 >> 2] = $13_1; $3 = $10_1; $9_1 = $7_1 + 8 | 0; $6_1 = $9_1; while (1) { $6_1 = HEAP32[$6_1 >> 2]; if ($6_1) { $3 = $3 + 1 | 0; HEAP32[$0_1 + 44 >> 2] = $3; $16_1 = $16_1 + 1 | 0; $6_1 = $6_1 + 20 | 0; continue; } break; }; $6_1 = 0; if (($22_1 | 0) == 2) { $27 = HEAP32[$0_1 + 264 >> 2]; HEAP32[$0_1 + 264 >> 2] = HEAP32[$7_1 >> 2]; $26_1 = $0_1; } $5_1 = $856($0_1); block4 : { if (!$5_1) { break block4 } if (!HEAPU8[$0_1 + 18 | 0]) { HEAP16[$5_1 + 152 >> 1] = HEAPU16[$5_1 + 152 >> 1] | 16 } $923($0_1, $12_1, $4_1); if (($22_1 | 0) == 2) { $1095($0_1, $7_1, $2_1, $13_1); HEAP32[$8_1 + 44 >> 2] = $13_1; HEAP32[$8_1 + 40 >> 2] = $13_1; } HEAP32[$8_1 + 36 >> 2] = 0; $3 = $8_1 + 28 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $8_1 + 20 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$8_1 + 12 >> 2] = 0; HEAP32[$8_1 + 16 >> 2] = 0; HEAP32[$8_1 + 8 >> 2] = $1_1; HEAP32[$8_1 + 4 >> 2] = $0_1; if ($1096($8_1 + 4 | 0, $2_1)) { break block4 } block7 : { if (!(HEAP8[$17_1 + 36 | 0] & 1)) { break block7 } if (HEAPU8[$0_1 + 18 | 0]) { break block7 } if (HEAP32[$0_1 + 136 >> 2]) { break block7 } if (HEAPU8[$0_1 + 163 | 0]) { break block7 } $15_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $15_1; $326($5_1, 71, 0, $15_1); } block11 : { if (!((($2_1 | $14) != 0 | $12_1) & 1 | HEAPU8[$7_1 + 43 | 0] == 1)) { $988($0_1, $4_1, HEAP32[$7_1 + 20 >> 2], 1, HEAP32[$7_1 >> 2]); if (!(HEAPU8[$7_1 + 28 | 0] & 128)) { $859($5_1, 145, HEAP32[$7_1 + 20 >> 2], $4_1, $15_1 ? $15_1 : -1, HEAP32[$7_1 >> 2], -1) } $6_1 = $15_1 ? $15_1 : -1; while (1) { $3 = HEAP32[$9_1 >> 2]; if ($3) { block13 : { if (!(!(HEAPU8[$7_1 + 28 | 0] & 128) | ((HEAPU8[$3 + 55 | 0] | HEAPU8[$3 + 56 | 0] << 8) & 3) != 2)) { $835($5_1, 145, HEAP32[$3 + 44 >> 2], $4_1, $6_1); break block13; } $326($5_1, 145, HEAP32[$3 + 44 >> 2], $4_1); } $9_1 = $3 + 20 | 0; continue; } else { $3 = 0; break block11; } }; } $4_1 = 1; $3 = (HEAPU8[$8_1 + 28 | 0] & 64) >>> 6 | 0 ? 20 : $12_1 & 1 ? 20 : 28; block15 : { if (!(HEAPU8[$7_1 + 28 | 0] & 128)) { $23_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $23_1; $12_1 = 0; $326($5_1, 75, 0, $23_1); $9_1 = 0; break block15; } $6_1 = HEAP32[$0_1 + 48 >> 2]; $12_1 = $359($7_1); $4_1 = HEAP16[$12_1 + 50 >> 1]; HEAP32[$0_1 + 48 >> 2] = $6_1 + $4_1; $19_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $19_1 + 1; $20_1 = $326($5_1, 117, $19_1, $4_1); $1097($0_1, $12_1); $9_1 = $6_1 + 1 | 0; } $6_1 = 0; $18_1 = $1044($0_1, $1_1, $2_1, 0, 0, 0, $3, $10_1); if (!$18_1) { break block4 } $14 = HEAP32[$18_1 + 20 >> 2]; $25 = HEAP32[$18_1 + 24 >> 2]; $21_1 = HEAPU8[$18_1 + 46 | 0]; if (($21_1 | 0) != 1) { $3 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($3 ? $3 : $0_1) + 20 | 0] = 1; } if (HEAP8[$18_1 + 48 | 0] & 1) { $858($5_1, 143, $13_1) } if ($15_1) { $326($5_1, 86, $15_1, 1) } block45 : { block43 : { block37 : { block39 : { block34 : { block30 : { block33 : { block31 : { block23 : { block29 : { block21 : { block22 : { if ($12_1) { $3 = 0; $10_1 = ($4_1 | 0) > 0 ? $4_1 : 0; while (1) { if (!(($3 | 0) == ($10_1 | 0))) { $890($5_1, $7_1, $13_1, HEAP16[HEAP32[$12_1 + 4 >> 2] + ($3 << 1) >> 1], $3 + $9_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; if (!$21_1) { break block21 } $11_1 = $9_1; break block22; } $10_1 = 1; $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $326($5_1, 135, $13_1, $11_1); if (!$21_1) { break block23 } } $3 = $325($17_1, $16_1 + 2 | 0, 0); if (!$3) { $1054($18_1); break block4; } $6_1 = $16_1 + 1 | 0; if ($6_1) { wasm2js_memory_fill($3, 1, $6_1) } HEAP8[$3 + $6_1 | 0] = 0; if (($14 | 0) >= 0) { HEAP8[($14 - $13_1 | 0) + $3 | 0] = 0 } if (($25 | 0) >= 0) { HEAP8[($25 - $13_1 | 0) + $3 | 0] = 0 } if ($20_1) { $1045($5_1, $20_1) } $6_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $6_1; if (($22_1 | 0) != 2) { break block29 } $10_1 = $4_1; break block30; } $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $859($5_1, 97, $9_1, $4_1, $11_1, $1098(HEAP32[$0_1 >> 2], $12_1), $4_1); $312($5_1, 138, $19_1, $11_1, $9_1, $4_1); $10_1 = 0; break block31; } $16_1 = 0; if (($21_1 | 0) != 2) { $9_1 = 0; $10_1 = $4_1; $20_1 = 0; break block33; } $9_1 = 0; $16_1 = 1; $20_1 = $857($5_1, 15); $10_1 = $4_1; break block33; } $326($5_1, 156, $23_1, $11_1); } $1054($18_1); $9_1 = 1; $16_1 = 0; $3 = 0; $20_1 = 0; $4_1 = 0; if (($22_1 | 0) == 2) { break block34 } } $1099($0_1, $7_1, 113, 8, $13_1, $3, $8_1 + 44 | 0, $8_1 + 40 | 0); if ($16_1) { $1100($5_1, $20_1) } $16_1 = $3; $4_1 = $6_1; if ($9_1) { break block34 } } $9_1 = 0; if (HEAPU8[$7_1 + 43 | 0] == 1) { $14 = 0; break block37; } $4_1 = HEAP32[$8_1 + 44 >> 2]; if (HEAPU8[($4_1 - $13_1 | 0) + $3 | 0]) { $312($5_1, 28, $4_1, $6_1, $11_1, $10_1) } $14 = 0; break block39; } block42 : { if ($12_1) { $9_1 = $858($5_1, 36, $19_1); $14 = 1; if (HEAPU8[$7_1 + 43 | 0] == 1) { $835($5_1, 94, $19_1, 0, $11_1); break block42; } $326($5_1, 134, $19_1, $11_1); break block42; } $14 = 1; $9_1 = $835($5_1, 46, $23_1, 0, $11_1); } $3 = $16_1; $6_1 = $4_1; } if (HEAPU8[$7_1 + 43 | 0] != 1) { break block43 } } $4_1 = $684($17_1, $7_1); $1101($0_1, $7_1); $10_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($10_1 ? $10_1 : $0_1) + 21 | 0] = 1; block44 : { if (($21_1 | 0) != 1) { break block44 } $858($5_1, 122, $13_1); if (HEAP32[$0_1 + 132 >> 2]) { break block44 } HEAP8[$0_1 + 20 | 0] = 0; } $859($5_1, 7, 0, 1, $11_1, $4_1, -11); $4_1 = HEAP32[$5_1 + 108 >> 2]; if (($4_1 | 0) <= 0) { break block45 } HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 2; break block45; } $1102($0_1, $7_1, $24_1, HEAP32[$8_1 + 44 >> 2], HEAP32[$8_1 + 40 >> 2], $11_1, $10_1, !HEAPU8[$0_1 + 18 | 0], 11, $21_1, $25); } if (!$14) { $1013($5_1, $6_1); $1054($18_1); break block11; } if ($12_1) { $326($5_1, 39, $19_1, $9_1 + 1 | 0); $4_1 = HEAP32[$5_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $4_1; break block11; } $863($5_1, $9_1); $4_1 = HEAP32[$5_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $4_1; } if (!(HEAPU8[$0_1 + 18 | 0] | HEAP32[$0_1 + 136 >> 2])) { $1103($0_1) } if ($15_1) { $1104($5_1, $15_1, 15689) } $6_1 = $3; } if (!$26_1) { break block } HEAP32[$26_1 + 264 >> 2] = $27; } $794($17_1, $1_1); $11($17_1, $2_1); if ($6_1) { $16($17_1, $6_1) } $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $966($0_1, $1_1, $2_1) { var $3 = 0; block : { if (!$0_1) { break block } $0_1 = (HEAP32[$0_1 >> 2] << 4) + $0_1 | 0; $1_1 = ($1_1 | 0) != -1 ? $1_1 : 0; HEAP8[$0_1 | 0] = $1_1; if (($2_1 | 0) == -1) { break block } $3 = HEAPU8[$0_1 + 1 | 0] | HEAPU8[$0_1 + 2 | 0] << 8 | 32; HEAP8[$0_1 + 1 | 0] = $3; HEAP8[$0_1 + 2 | 0] = $3 >>> 8; if (($1_1 | 0) == ($2_1 | 0)) { break block } HEAP8[$0_1 | 0] = $1_1 | 2; } } function $967($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$4_1 + 28 >> 2] = $3; HEAP32[$4_1 + 24 >> 2] = $2_1; HEAP32[$4_1 + 20 >> 2] = $1_1; block : { while (1) { if (($8_1 | 0) == 3) { break block } $9_1 = HEAP32[($4_1 + 20 | 0) + ($8_1 << 2) >> 2]; if (!$9_1) { break block } $10_1 = HEAP32[$9_1 + 4 >> 2]; $7_1 = 0; block1 : { while (1) { if (($7_1 | 0) == 7) { break block1 } block3 : { $6_1 = Math_imul($7_1, 3); if (($10_1 | 0) == HEAPU8[$6_1 + 51185 | 0]) { $6_1 = $6_1 + 51184 | 0; if (!$68(HEAP32[$9_1 >> 2], HEAPU8[$6_1 | 0] + 51136 | 0, $10_1)) { break block3 } } $7_1 = $7_1 + 1 | 0; continue; } break; }; $8_1 = $8_1 + 1 | 0; $5_1 = HEAPU8[$6_1 + 2 | 0] | $5_1; continue; } break; }; $5_1 = $5_1 | 128; } if (($5_1 & 56) == 32 | ($5_1 & 33) == 33 | $5_1 & 128) { HEAP32[$4_1 + 16 >> 2] = $3; HEAP32[$4_1 >> 2] = $1_1; HEAP32[$4_1 + 12 >> 2] = $3 ? 30791 : 30792; HEAP32[$4_1 + 8 >> 2] = $2_1; HEAP32[$4_1 + 4 >> 2] = $2_1 ? 30791 : 30792; $257($0_1, 19027, $4_1); $5_1 = 1; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $968($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if (!$0_1) { break block } $2_1 = HEAP32[$0_1 >> 2]; if (($2_1 | 0) < 2) { break block } $8_1 = $0_1 - 28 | 0; $4_1 = $0_1 + 8 | 0; $1_1 = $2_1; while (1) { $5_1 = $1_1 - 1 | 0; $6_1 = Math_imul($5_1, 48); $3 = HEAPU8[$6_1 + $8_1 | 0]; HEAP8[($4_1 + $6_1 | 0) + 12 | 0] = $3; $7_1 = $3 | $7_1; $3 = $1_1 >>> 0 > 2; $1_1 = $5_1; if ($3) { continue } break; }; HEAP8[$0_1 + 20 | 0] = 0; if (!($7_1 & 16)) { break block } while (1) { block2 : { $1_1 = $2_1; if (($1_1 | 0) < 2) { $1_1 = 1; break block2; } $2_1 = $1_1 - 1 | 0; if (!(HEAPU8[(Math_imul($1_1, 48) + $4_1 | 0) - 36 | 0] & 16)) { continue } } break; }; $1_1 = $1_1 - 2 | 0; while (1) { $0_1 = (Math_imul($1_1, 48) + $4_1 | 0) + 12 | 0; HEAP8[$0_1 | 0] = HEAPU8[$0_1 | 0] | 64; $0_1 = ($1_1 | 0) > 0; $1_1 = $1_1 - 1 | 0; if ($0_1) { continue } break; }; } } function $969($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; while (1) { $3 = $1_1; $1_1 = $3 + 1 | 0; if (HEAP8[HEAPU8[$3 | 0] + 31424 | 0] & 1) { continue } break; }; $4_1 = $3 - 1 | 0; $1_1 = $2_1 - $3 | 0; while (1) { $2_1 = $1_1; $1_1 = $2_1 - 1 | 0; if (HEAP8[HEAPU8[$2_1 + $4_1 | 0] + 31424 | 0] & 1) { continue } break; }; return $299($0_1, $3, $2_1, $2_1 >> 31); } function $970($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = $1_1 + 8 | 0; $3 = 1; block : { while (1) { if (HEAP32[$1_1 >> 2] <= ($2_1 | 0)) { break block } $5_1 = $2_1 << 4; $2_1 = $2_1 + 1 | 0; if ($944($0_1, HEAP32[$4_1 + $5_1 >> 2])) { continue } break; }; $3 = 0; } return $3; } function $971($0_1) { var $1_1 = 0, $2_1 = 0; block10 : { label : while (1) { $1_1 = HEAPU8[$0_1 | 0]; while (1) { block11 : { block8 : { block1 : { block4 : { block5 : { block7 : { block9 : { block2 : { switch ($1_1 - 168 | 0) { default: block6 : { switch ($1_1 - 177 | 0) { case 0: break block4; case 1: break block5; default: break block6; }; } if (($1_1 | 0) == 36) { break block7 } if (($1_1 | 0) != 139) { break block1 } $0_1 = HEAP32[HEAP32[$0_1 + 20 >> 2] + 28 >> 2] + 8 | 0; break block8; case 0: $2_1 = HEAP32[$0_1 + 44 >> 2]; break block9; case 1: break block1; case 2: break block2; }; } $2_1 = HEAP32[$0_1 + 44 >> 2]; if (!$2_1) { break block1 } } $0_1 = HEAP16[$0_1 + 32 >> 1]; $1_1 = 68; if (($0_1 | 0) < 0 | ($0_1 | 0) >= HEAP16[$2_1 + 34 >> 1]) { break block10 } $1_1 = HEAPU8[(HEAP32[$2_1 + 4 >> 2] + Math_imul($0_1, 12) | 0) + 5 | 0]; break block10; } $1_1 = $853(HEAP32[$0_1 + 8 >> 2], 0); break block10; } $0_1 = (HEAP32[HEAP32[HEAP32[$0_1 + 12 >> 2] + 20 >> 2] + 28 >> 2] + (HEAP16[$0_1 + 32 >> 1] << 4) | 0) + 8 | 0; break block8; } $0_1 = HEAP32[$0_1 + 20 >> 2] + 8 | 0; break block8; } if (!((HEAPU8[$0_1 + 5 | 0] | HEAPU8[$0_1 + 6 | 0] << 8) & 1056)) { break block11 } $0_1 = $0_1 + 12 | 0; } $0_1 = HEAP32[$0_1 >> 2]; continue label; } if (($1_1 | 0) == 176) { $1_1 = HEAPU8[$0_1 + 2 | 0]; if (($1_1 | 0) != 176) { continue } } break; }; break; }; $1_1 = HEAPU8[$0_1 + 1 | 0]; } return $1_1 << 24 >> 24; } function $972($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$1_1) { break block } $1_1 = HEAP32[$1_1 + 32 >> 2]; if (HEAP32[$1_1 >> 2] <= 0 | !(HEAPU8[$1_1 + 21 | 0] & 4)) { break block } $997(HEAP32[$0_1 + 8 >> 2], HEAP32[HEAP32[$1_1 + 52 >> 2] + 8 >> 2]); $0_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$0_1 + 108 >> 2]; $2_1 = 82740; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $2_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[HEAP32[$1_1 + 52 >> 2] + 4 >> 2], 20) | 0) - 20 | 0 } HEAP32[$2_1 + 8 >> 2] = $3; } } function $973($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = HEAPU8[$1_1 + 15 | 0]; block1 : { if ($4_1 & 1) { HEAP32[$1_1 + 44 >> 2] = 0; HEAP8[$1_1 + 15 | 0] = $4_1 & 254; break block1; } $4_1 = HEAP32[$1_1 + 44 >> 2]; if (!$4_1) { break block1 } $13(HEAP32[$0_1 >> 2], $4_1); HEAP32[$1_1 + 44 >> 2] = 0; } block3 : { if ($3) { $2_1 = $907(HEAP32[$0_1 >> 2], $2_1, 0); $3 = 0; if (!$2_1) { break block3 } } $3 = $325(HEAP32[$0_1 >> 2], 16, 0); HEAP32[$1_1 + 44 >> 2] = $3; if (!$3) { $789(HEAP32[$0_1 >> 2], $2_1); return 0; } $0_1 = HEAPU8[$1_1 + 13 | 0] | HEAPU8[$1_1 + 14 | 0] << 8 | 4; HEAP8[$1_1 + 13 | 0] = $0_1; HEAP8[$1_1 + 14 | 0] = $0_1 >>> 8; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; HEAP8[$3 + 8 | 0] = 0; HEAP8[$3 + 9 | 0] = 0; HEAP8[$3 + 10 | 0] = 0; HEAP8[$3 + 11 | 0] = 0; HEAP32[$3 >> 2] = $2_1; $0_1 = $3 + 12 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; $3 = 1; } return $3; } function $974($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0; $7_1 = global$0 - 368 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $28_1 = HEAP32[$0_1 >> 2]; $3 = 1; $16_1 = $856($0_1); block : { if (HEAP32[$0_1 + 40 >> 2] | !$1_1) { break block } if ($864($0_1, 21, 0, 0, 0)) { break block } if (HEAPU8[$2_1 | 0] <= 6) { $4_1 = HEAP32[$1_1 + 48 >> 2]; if ($4_1) { $1016($0_1, 44, $4_1); HEAP32[$1_1 + 48 >> 2] = 0; } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -4194306 | 4194304; } $4_1 = 0; $1017($0_1, $1_1, 0); block348 : { block3 : { if (HEAP32[$0_1 + 40 >> 2]) { break block3 } $5_1 = HEAP32[$1_1 + 4 >> 2]; if ($5_1 & 8388608) { $6_1 = HEAP32[$1_1 + 32 >> 2]; if ($1018($6_1 + 8 | 0, $6_1)) { $1_1 = HEAP32[$6_1 + 12 >> 2]; if (!$1_1) { $1_1 = HEAP32[HEAP32[$6_1 + 16 >> 2] >> 2] } HEAP32[$7_1 + 192 >> 2] = $1_1; $257($0_1, 8125, $7_1 + 192 | 0); break block3; } HEAP32[$1_1 + 4 >> 2] = $5_1 & -8388609; } if (HEAPU8[$2_1 | 0] == 9) { $1019($0_1, $1_1) } block10 : { if (!(HEAP32[$1_1 + 52 >> 2] | !HEAP32[$1_1 + 68 >> 2] | (HEAPU8[$1_1 + 6 | 0] & 16 | HEAPU8[$0_1 + 224 | 0] > 1))) { $20_1 = $856($0_1); $12_1 = HEAP32[$1_1 + 44 >> 2]; $11_1 = HEAP32[$1_1 + 40 >> 2]; $13_1 = HEAP32[$1_1 + 36 >> 2]; $23_1 = HEAP32[$1_1 + 32 >> 2]; $15_1 = HEAP32[$0_1 >> 2]; HEAP32[$7_1 + 208 >> 2] = 0; $9_1 = HEAP32[$1_1 + 68 >> 2]; $10_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $270($15_1, 64, 0); if (!$5_1) { $236($15_1, 7); break block10; } $21_1 = $1_1 + 32 | 0; $4_1 = $7_1 + 300 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 296 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 46; HEAP32[$7_1 + 284 >> 2] = 47; HEAP32[$7_1 + 280 >> 2] = $0_1; $4_1 = $7_1 + 280 | 0; $919($4_1, $1_1); $3 = HEAP32[$1_1 + 4 >> 2]; if (!($3 & 8)) { HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = 48; $921($4_1, HEAP32[$1_1 + 48 >> 2]); $3 = HEAP32[$1_1 + 4 >> 2]; } HEAP32[$21_1 >> 2] = 0; HEAP32[$21_1 + 4 >> 2] = 0; $4_1 = $21_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $3 & -1048585 | 1048576; $3 = 0; $22_1 = $1023($0_1, $1023($0_1, 0, HEAP32[$9_1 + 8 >> 2], 1), HEAP32[$9_1 + 12 >> 2], 1); block12 : { if (!$22_1) { break block12 } $8_1 = HEAP32[$1_1 + 48 >> 2]; if (!$8_1) { break block12 } $6_1 = HEAP32[$8_1 >> 2]; $4_1 = HEAP32[$22_1 >> 2]; if (($6_1 | 0) > ($4_1 | 0)) { break block12 } HEAP32[$22_1 >> 2] = $6_1; if (!$1024($22_1, $8_1, -1)) { $358($15_1, HEAP32[$1_1 + 48 >> 2]); HEAP32[$1_1 + 48 >> 2] = 0; } HEAP32[$22_1 >> 2] = $4_1; } $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$9_1 + 48 >> 2] = $4_1; HEAP32[$0_1 + 44 >> 2] = $4_1 + 4; $4_1 = $7_1 + 208 | 0; $1025($0_1, $9_1, $23_1, HEAP32[$1_1 + 28 >> 2], $5_1, $4_1); $1025($0_1, $9_1, $23_1, HEAP32[$1_1 + 48 >> 2], $5_1, $4_1); $4_1 = HEAP32[$7_1 + 208 >> 2]; if ($4_1) { $3 = HEAP32[$4_1 >> 2] } HEAP32[$9_1 + 76 >> 2] = $3; $4_1 = $1023($0_1, $1023($0_1, $4_1, HEAP32[$9_1 + 8 >> 2], 0), HEAP32[$9_1 + 12 >> 2], 0); HEAP32[$7_1 + 208 >> 2] = $4_1; $3 = $9_1; while (1) { if ($3) { $6_1 = HEAP32[HEAP32[$3 + 72 >> 2] + 20 >> 2]; block19 : { if (HEAPU8[HEAP32[$3 + 44 >> 2] + 6 | 0] & 16) { $1025($0_1, $9_1, $23_1, $6_1, $5_1, $7_1 + 208 | 0); $4_1 = HEAP32[$7_1 + 208 >> 2]; if ($4_1) { $6_1 = HEAP32[$4_1 >> 2] } else { $6_1 = 0 } HEAP8[$3 + 96 | 0] = 1; HEAP32[$3 + 80 >> 2] = $6_1; break block19; } if ($4_1) { $8_1 = HEAP32[$4_1 >> 2] } else { $8_1 = 0 } HEAP32[$3 + 80 >> 2] = $8_1; $4_1 = $1023($0_1, $4_1, $6_1, 0); HEAP32[$7_1 + 208 >> 2] = $4_1; } $6_1 = HEAP32[$3 + 40 >> 2]; if ($6_1) { $4_1 = $936($0_1, $4_1, $906($15_1, $6_1, 0)); HEAP32[$7_1 + 208 >> 2] = $4_1; } $6_1 = HEAP32[$0_1 + 48 >> 2]; $8_1 = $6_1 + 1 | 0; HEAP32[$3 + 52 >> 2] = $8_1; $6_1 = $6_1 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; HEAP32[$3 + 56 >> 2] = $6_1; $326($20_1, 75, 0, $8_1); $3 = HEAP32[$3 + 36 >> 2]; continue; } break; }; if (!$4_1) { $4_1 = $942($15_1, 156, 25060); $4_1 = $935(HEAP32[$0_1 >> 2], $4_1); HEAP32[$7_1 + 208 >> 2] = $4_1; } $8_1 = $939($0_1, $4_1, $23_1, $13_1, $11_1, $12_1, $22_1, 0, 0); $4_1 = $932($0_1, 0, 0, 0); HEAP32[$21_1 >> 2] = $4_1; block28 : { block25 : { if (!$4_1) { $789($15_1, $8_1); $6_1 = 1; break block25; } $6_1 = 1; if (!$973($0_1, $4_1 + 8 | 0, $8_1, 0)) { break block25 } $3 = HEAP32[$21_1 >> 2]; $4_1 = HEAPU8[$3 + 21 | 0] | HEAPU8[$3 + 22 | 0] << 8 | 16; HEAP8[$3 + 21 | 0] = $4_1; HEAP8[$3 + 22 | 0] = $4_1 >>> 8; $1026($0_1, HEAP32[$21_1 >> 2]); HEAP32[$8_1 + 4 >> 2] = HEAP32[$8_1 + 4 >> 2] | 134217792; $4_1 = $996($0_1, $8_1, 64); HEAP32[$8_1 + 4 >> 2] = HEAP32[$8_1 + 4 >> 2] | $10_1 & 8; if (!$4_1) { $6_1 = 0; break block25; } wasm2js_memory_copy($5_1, $4_1, 64); HEAP32[$5_1 + 28 >> 2] = HEAP32[$5_1 + 28 >> 2] | 16384; HEAP32[HEAP32[$21_1 >> 2] + 16 >> 2] = $5_1; $3 = $7_1 + 288 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$7_1 + 304 >> 2] = 0; $5_1 = $7_1 + 296 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$3 >> 2] = 49; HEAP32[$7_1 + 280 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 50; HEAP32[$7_1 + 284 >> 2] = 51; $919($7_1 + 280 | 0, $8_1); break block28; } $4_1 = $5_1; } $5_1 = HEAPU8[$15_1 + 87 | 0]; $1016($0_1, 52, $4_1); if (!$6_1 | $5_1) { break block10 } } $6_1 = HEAP32[$1_1 + 32 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = 0; wasm2js_memory_fill($7_1 + 212 | 0, 0, 36); HEAP32[$7_1 + 208 >> 2] = HEAP32[$1_1 + 48 >> 2]; $30_1 = $4_1 >>> 3 & 1; $13_1 = $7_1 + 348 | 0; $35_1 = $7_1 + 296 | 0; while (1) { block44 : { block38 : { block45 : { block47 : { block77 : { block51 : { block52 : { block72 : { block70 : { block71 : { block31 : { block46 : { $11_1 = HEAP32[$1_1 + 52 >> 2]; if (!$11_1) { if (HEAP32[$6_1 >> 2] <= ($5_1 | 0)) { break block31 } $9_1 = 0; $11_1 = $6_1 + 8 | 0; $24_1 = Math_imul($5_1, 48); $12_1 = $11_1 + $24_1 | 0; if (HEAPU8[$12_1 + 13 | 0] & 4) { $9_1 = HEAP32[HEAP32[$12_1 + 44 >> 2] >> 2] } $10_1 = HEAP32[$12_1 + 8 >> 2]; $4_1 = HEAPU8[$12_1 + 12 | 0]; block33 : { if (!($4_1 & 72)) { break block33 } if (!$1030(HEAP32[$1_1 + 36 >> 2], HEAP32[$12_1 + 16 >> 2], $4_1 & 64) | HEAPU8[$28_1 + 81 | 0] & 32) { break block33 } $4_1 = HEAPU8[$12_1 + 12 | 0]; block34 : { if (!($4_1 & 8)) { break block34 } if ($4_1 & 16) { $4_1 = $4_1 & 247; HEAP8[$12_1 + 12 | 0] = $4_1; break block34; } HEAP8[$12_1 + 12 | 0] = $4_1 & 199; $1031(HEAP32[$1_1 + 36 >> 2], HEAP32[$12_1 + 16 >> 2], 0); $4_1 = HEAPU8[$12_1 + 12 | 0]; } $3 = $5_1; if (!($4_1 & 64)) { break block33 } while (1) { $3 = $3 + 1 | 0; $4_1 = HEAP32[$6_1 >> 2]; if (($3 | 0) < ($4_1 | 0)) { $8_1 = $11_1 + Math_imul($3, 48) | 0; $4_1 = HEAPU8[$8_1 + 12 | 0]; if (!($4_1 & 16)) { continue } if ($4_1 & 8) { HEAP8[$8_1 + 12 | 0] = $4_1 & 239; continue; } else { HEAP8[$8_1 + 12 | 0] = $4_1 & 199; $1031(HEAP32[$1_1 + 36 >> 2], HEAP32[$8_1 + 16 >> 2], 1); continue; } } break; }; while (1) { if (($4_1 | 0) <= 0) { break block33 } $3 = ($11_1 + Math_imul($4_1, 48) | 0) - 36 | 0; $8_1 = HEAPU8[$3 | 0]; HEAP8[$3 | 0] = $8_1 & 191; $4_1 = $4_1 - 1 | 0; if (!($8_1 & 16)) { continue } break; }; } if (!$9_1) { break block38 } $3 = HEAP32[HEAP32[$9_1 + 28 >> 2] >> 2]; $4_1 = HEAP16[$10_1 + 34 >> 1]; if (($3 | 0) != ($4_1 | 0)) { $1_1 = HEAP32[$10_1 >> 2]; HEAP32[$7_1 + 8 >> 2] = $3; HEAP32[$7_1 + 4 >> 2] = $1_1; HEAP32[$7_1 >> 2] = $4_1; $257($0_1, 17178, $7_1); break block10; } if (!(!(HEAPU8[$12_1 + 14 | 0] & 2) | HEAPU8[HEAP32[$12_1 + 36 >> 2] + 18 | 0])) { break block38 } $3 = HEAP32[$9_1 + 4 >> 2]; if ($3 & 8) { break block38 } $4_1 = HEAP32[$9_1 + 48 >> 2]; block41 : { if (!$4_1) { break block41 } block43 : { if (!HEAP32[$1_1 + 48 >> 2] & HEAP32[$6_1 >> 2] < 2 | (HEAP32[$9_1 + 60 >> 2] | $3 & 134225920)) { break block43 } if (HEAPU8[$1_1 + 7 | 0] & 8 | HEAPU8[$28_1 + 82 | 0] & 4) { break block43 } $1016($0_1, 44, $4_1); HEAP32[$9_1 + 48 >> 2] = 0; break block41; } if (!(HEAPU8[$1_1 + 6 | 0] & 4) | $5_1) { break block41 } $3 = 0; if (HEAPU8[$6_1 + 68 | 0] & 34 | HEAP32[$6_1 >> 2] == 1) { break block44 } } $12_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$1_1 + 68 >> 2] | HEAP8[$12_1 + 80 | 0] & 1) { break block45 } $8_1 = HEAP32[$1_1 + 32 >> 2]; $9_1 = $24_1 + $8_1 | 0; $4_1 = HEAP32[HEAP32[$9_1 + 52 >> 2] >> 2]; if (HEAP32[$4_1 + 68 >> 2]) { break block45 } $23_1 = HEAP32[$0_1 + 264 >> 2]; $22_1 = HEAP32[$9_1 + 24 >> 2]; $21_1 = HEAP32[$4_1 + 32 >> 2]; $10_1 = HEAP32[$4_1 + 60 >> 2]; if (!$10_1) { break block46 } if (HEAP32[$1_1 + 60 >> 2] | HEAP32[$10_1 + 16 >> 2]) { break block45 } $15_1 = HEAP32[$1_1 + 4 >> 2]; if ($15_1 & 256) { break block45 } break block47; } $20_1 = HEAP32[$0_1 >> 2]; $6_1 = $7_1 + 248 | 0; HEAP32[$6_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2]; $5_1 = $2_1 + 16 | 0; $4_1 = HEAP32[$5_1 + 4 >> 2]; $3 = $6_1 + 16 | 0; HEAP32[$3 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$3 + 4 >> 2] = $4_1; $5_1 = $2_1 + 8 | 0; $4_1 = HEAP32[$5_1 + 4 >> 2]; $3 = $6_1 + 8 | 0; HEAP32[$3 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$3 + 4 >> 2] = $4_1; $4_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$7_1 + 248 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$7_1 + 252 >> 2] = $4_1; $14 = $856($0_1); $5_1 = HEAPU8[$7_1 + 248 | 0]; if (($5_1 | 0) == 12) { $326($14, 117, HEAP32[$7_1 + 252 >> 2], HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]); HEAP8[$7_1 + 248 | 0] = 14; $5_1 = 14; } block49 : { $10_1 = HEAP32[$1_1 + 4 >> 2]; if (!($10_1 & 1024)) { break block49 } $9_1 = HEAP32[$1_1 + 60 >> 2]; $8_1 = !$9_1; $6_1 = 1; $4_1 = $1_1; while (1) { if (HEAP32[$4_1 + 68 >> 2]) { break block49 } $3 = HEAP32[$4_1 + 52 >> 2]; if ($3) { $6_1 = $6_1 + $8_1 | 0; $4_1 = $3; continue; } break; }; HEAP32[$7_1 + 176 >> 2] = $6_1; HEAP32[$7_1 + 180 >> 2] = ($6_1 | 0) == 1 ? 30822 : 19514; $15_1 = 0; $1032($0_1, 0, 6142, $7_1 + 176 | 0); while (1) { $3 = 0; if (!$4_1) { break block51 } $1033($0_1, $4_1, -1, 0, 0, $7_1 + 248 | 0, 1, 1); if ($9_1) { break block52 } HEAP16[$4_1 + 2 >> 1] = $6_1; $4_1 = HEAP32[$4_1 + 56 >> 2]; continue; }; } block53 : { if (!($10_1 & 8192)) { break block53 } $3 = $1_1; while (1) { if (!$3) { break block53 } if (HEAPU8[$3 + 5 | 0] & 32) { $3 = HEAP32[$3 + 52 >> 2]; continue; } break; }; block56 : { if (HEAP32[$1_1 + 68 >> 2]) { $257($0_1, 5861, 0); break block56; } $21_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$1_1 + 32 >> 2]; $13_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]; $3 = 0; if ($864($0_1, 33, 0, 0, 0)) { break block56 } $12_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $12_1; HEAP16[$1_1 + 2 >> 1] = 320; $1034($0_1, $1_1, $12_1); $9_1 = HEAP32[$1_1 + 60 >> 2]; HEAP32[$1_1 + 60 >> 2] = 0; $8_1 = HEAP32[$1_1 + 12 >> 2]; $10_1 = HEAP32[$1_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; $4_1 = HEAP32[$5_1 >> 2]; $6_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $5_1 = $5_1 + 8 | 0; $22_1 = HEAP32[$1_1 + 48 >> 2]; block58 : { while (1) { $15_1 = 0; if (($3 | 0) == ($6_1 | 0)) { break block58 } $4_1 = Math_imul($3, 48); $3 = $3 + 1 | 0; $4_1 = $4_1 + $5_1 | 0; if (!(HEAPU8[$4_1 + 13 | 0] & 128)) { continue } break; }; $15_1 = HEAP32[$4_1 + 16 >> 2]; } $23_1 = HEAP32[$0_1 + 44 >> 2]; $3 = $23_1 + 1 | 0; HEAP32[$0_1 + 44 >> 2] = $3; block60 : { if (HEAPU8[$1_1 | 0] == 135) { HEAP32[$0_1 + 44 >> 2] = $23_1 + 2; $4_1 = $22_1 ? 6 : 5; break block60; } $3 = 0; $4_1 = $22_1 ? 7 : 8; } $5_1 = $7_1 + 296 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = $23_1; HEAP8[$7_1 + 280 | 0] = $4_1; $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $835($21_1, 121, $15_1, $11_1, $13_1); block62 : { if ($22_1) { $4_1 = $1035($0_1, $1_1); $859($21_1, 117, $23_1, HEAP32[$22_1 >> 2] + 2 | 0, 0, $4_1, -8); HEAP32[$7_1 + 304 >> 2] = $22_1; break block62; } $326($21_1, 117, $23_1, $13_1); } block64 : { if (!$3) { $6_1 = HEAP32[$1_1 + 4 >> 2]; break block64; } HEAP32[$1_1 + 20 >> 2] = $326($21_1, 117, $3, 0); $6_1 = HEAP32[$1_1 + 4 >> 2] | 32; HEAP32[$1_1 + 4 >> 2] = $6_1; } HEAP32[$1_1 + 48 >> 2] = 0; $4_1 = $1_1; block66 : { while (1) { $5_1 = $4_1; if ($6_1 & 8) { $257($0_1, 15536, 0); break block66; } HEAP8[$5_1 | 0] = 136; $4_1 = HEAP32[$5_1 + 52 >> 2]; $6_1 = HEAP32[$4_1 + 4 >> 2]; if ($6_1 & 8192) { continue } break; }; HEAP32[$4_1 + 56 >> 2] = 0; $1032($0_1, 1, 20011, 0); $3 = $974($0_1, $4_1, $7_1 + 280 | 0); HEAP32[$4_1 + 56 >> 2] = $1_1; if ($3) { break block66 } $3 = $326($21_1, 36, $23_1, $12_1); $858($21_1, 136, $15_1); block68 : { if ($22_1) { $835($21_1, 94, $23_1, HEAP32[$22_1 >> 2] + 1 | 0, $11_1); break block68; } $326($21_1, 134, $23_1, $11_1); } $858($21_1, 130, $23_1); $6_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $6_1; $1036($21_1, $8_1, $6_1); $1033($0_1, $1_1, $15_1, 0, 0, $7_1 + 248 | 0, $6_1, $12_1); if ($10_1) { $326($21_1, 61, $10_1, $12_1) } $1013($21_1, $6_1); HEAP32[$5_1 + 52 >> 2] = 0; $1032($0_1, 1, 20023, 0); $974($0_1, $1_1, $7_1 + 280 | 0); HEAP32[$5_1 + 52 >> 2] = $4_1; $863($21_1, $3); $1013($21_1, $12_1); } $358(HEAP32[$0_1 >> 2], HEAP32[$1_1 + 48 >> 2]); HEAP32[$1_1 + 60 >> 2] = $9_1; HEAP32[$1_1 + 48 >> 2] = $22_1; } $15_1 = 0; $3 = 0; break block70; } $15_1 = HEAP32[$1_1 + 48 >> 2]; if (!$15_1) { break block71 } $9_1 = HEAP32[$0_1 + 60 >> 2]; $21_1 = $9_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $21_1; $19_1 = HEAP32[$0_1 + 8 >> 2]; $25 = HEAP32[$0_1 >> 2]; $13_1 = HEAP32[$15_1 >> 2]; $31_1 = HEAPU8[$1_1 | 0]; if (($31_1 | 0) == 136) { break block72 } $6_1 = 1; label8 : while (1) { if (HEAPU8[$25 + 87 | 0] | HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2] < ($6_1 | 0)) { break block72 } $3 = 0; $8_1 = ($13_1 | 0) > 0 ? $13_1 : 0; $4_1 = $15_1 + 8 | 0; while (1) { block74 : { if (($3 | 0) != ($8_1 | 0)) { if (HEAPU16[$4_1 + 12 >> 1] != ($6_1 | 0)) { break block74 } } else { $3 = $8_1 } block75 : { if (($3 | 0) != ($13_1 | 0)) { break block75 } $4_1 = $942($25, 156, 0); if (!$4_1) { $3 = 7; break block77; } HEAP32[$4_1 + 8 >> 2] = $6_1; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 2048; $15_1 = $936($0_1, $15_1, $4_1); HEAP32[$1_1 + 48 >> 2] = $15_1; if (!$15_1) { $15_1 = 0; break block75; } HEAP16[(($13_1 << 4) + $15_1 | 0) + 20 >> 1] = $6_1; $13_1 = $13_1 + 1 | 0; } $6_1 = $6_1 + 1 | 0; continue label8; } $4_1 = $4_1 + 16 | 0; $3 = $3 + 1 | 0; continue; }; }; } $15_1 = HEAP32[$1_1 + 4 >> 2]; break block47; } $4_1 = HEAP32[$1_1 + 36 >> 2]; if (!(HEAPU8[$28_1 + 81 | 0] & 128 | (!$4_1 | HEAPU8[$4_1 | 0] != 44))) { HEAP32[$7_1 + 280 >> 2] = $0_1; HEAP32[$7_1 + 284 >> 2] = HEAP32[$0_1 >> 2] + 87; while (1) { HEAP32[$7_1 + 304 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 296 >> 2] = 0; $4_1 = HEAP32[$1_1 + 32 >> 2]; block81 : { if (!(!$4_1 | HEAP32[$4_1 >> 2] <= 0)) { $3 = 3; if (HEAPU8[$4_1 + 20 | 0] & 64) { break block81 } } $3 = 1; } HEAP32[$7_1 + 300 >> 2] = $3; $3 = $7_1 + 280 | 0; $1037($3, HEAP32[$1_1 + 36 >> 2]); if (HEAP32[$7_1 + 288 >> 2]) { HEAP32[$7_1 + 348 >> 2] = 0; HEAP32[$7_1 + 352 >> 2] = 0; HEAP32[$7_1 + 344 >> 2] = 46; HEAP32[$7_1 + 340 >> 2] = 53; HEAP32[$7_1 + 336 >> 2] = $0_1; HEAP32[$7_1 + 356 >> 2] = 0; HEAP32[$7_1 + 360 >> 2] = $3; $920($7_1 + 336 | 0, HEAP32[$1_1 + 36 >> 2]); $10(HEAP32[HEAP32[$7_1 + 280 >> 2] >> 2], HEAP32[$7_1 + 304 >> 2]); } if (HEAP32[$7_1 + 292 >> 2]) { continue } break; }; } block83 : { if (!(HEAPU8[$1_1 + 4 | 0] & 8) | HEAPU16[$28_1 + 80 >> 1] & 513) { break block83 } $4_1 = HEAP32[$1_1 + 28 >> 2]; if (HEAP32[$1_1 + 36 >> 2] | HEAP32[$4_1 >> 2] != 1 | (HEAP32[$1_1 + 44 >> 2] | HEAP32[$1_1 + 40 >> 2])) { break block83 } if (HEAP32[$1_1 + 48 >> 2]) { break block83 } $9_1 = HEAP32[$4_1 + 8 >> 2]; if (HEAPU8[$9_1 | 0] != 169) { break block83 } if ($66(HEAP32[$9_1 + 8 >> 2], 2660) | HEAP32[$9_1 + 20 >> 2]) { break block83 } $5_1 = HEAP32[$1_1 + 32 >> 2]; if (HEAP8[$9_1 + 7 | 0] & 1 | HEAP32[$5_1 >> 2] != 1 | !(HEAPU8[$5_1 + 21 | 0] & 4)) { break block83 } $4_1 = HEAP32[HEAP32[$5_1 + 52 >> 2] >> 2]; if (!HEAP32[$4_1 + 52 >> 2] | HEAPU8[$4_1 + 7 | 0] & 4) { break block83 } $5_1 = $5_1 + 8 | 0; while (1) { if (HEAP32[$4_1 + 36 >> 2] | HEAP32[$4_1 + 60 >> 2] | (HEAP32[$4_1 + 52 >> 2] ? HEAPU8[$4_1 | 0] != 136 : 0)) { break block83 } if (HEAPU8[$4_1 + 4 | 0] & 8) { break block83 } $4_1 = HEAP32[$4_1 + 52 >> 2]; if ($4_1) { continue } break; }; $6_1 = HEAP32[$0_1 >> 2]; $4_1 = $1039($6_1, $5_1); $794($6_1, HEAP32[$1_1 + 32 >> 2]); HEAP32[$1_1 + 32 >> 2] = $270(HEAP32[$0_1 >> 2], 56, 0); $8_1 = 0; while (1) { block85 : { $3 = $8_1; if (!$4_1) { break block85 } HEAP16[$4_1 + 2 >> 1] = 0; $5_1 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$4_1 + 52 >> 2] = 0; HEAP32[$4_1 + 56 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] & -265 | 8; $1016($0_1, 44, HEAP32[$4_1 + 28 >> 2]); $8_1 = $9_1; if ($5_1) { $8_1 = $906($6_1, $8_1, 0) } HEAP32[$4_1 + 28 >> 2] = $935(HEAP32[$0_1 >> 2], $8_1); $8_1 = $903($0_1, 139, 0, 0); $938($0_1, $8_1, $4_1); $4_1 = $5_1; if (!$3) { continue } $8_1 = $903($0_1, 107, $8_1, $3); continue; } break; }; HEAP32[HEAP32[$1_1 + 28 >> 2] + 8 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -9; if (HEAPU8[$28_1 + 87 | 0]) { break block10 } $6_1 = HEAP32[$1_1 + 32 >> 2]; } $23_1 = $6_1 + 8 | 0; $15_1 = $7_1 + 288 | 0; $13_1 = 0; while (1) { block91 : { block94 : { if (($13_1 | 0) < HEAP32[$6_1 >> 2]) { $12_1 = $23_1 + Math_imul($13_1, 48) | 0; block88 : { if (HEAP32[$12_1 + 24 >> 2] | HEAP32[$12_1 + 28 >> 2]) { break block88 } $5_1 = HEAP32[$12_1 >> 2]; if (!$5_1) { break block88 } block90 : { if (HEAP8[$12_1 + 15 | 0] & 1) { $3 = HEAP32[HEAP32[$28_1 + 16 >> 2] + ($309(HEAP32[$0_1 >> 2], HEAP32[$12_1 + 44 >> 2]) << 4) >> 2]; break block90; } $3 = 0; if (HEAPU8[$12_1 + 13 | 0] & 4) { break block90 } $3 = HEAP32[$12_1 + 44 >> 2]; } $864($0_1, 20, $5_1, 30822, $3); } if (!(HEAPU8[$12_1 + 13 | 0] & 4)) { break block91 } $25 = HEAP32[$12_1 + 44 >> 2]; if (HEAP32[$25 + 4 >> 2]) { break block91 } $26_1 = HEAP32[$25 >> 2]; HEAP32[$0_1 + 232 >> 2] = $1040($1_1) + HEAP32[$0_1 + 232 >> 2]; $3 = HEAP32[$28_1 + 80 >> 2]; block92 : { if ($3 & 4096) { break block92 } if (HEAPU8[$12_1 + 14 | 0] & 2) { $4_1 = HEAP32[$12_1 + 36 >> 2]; if (!HEAPU8[$4_1 + 18 | 0] | HEAP32[$4_1 >> 2] > 1) { break block92 } } $1041($0_1, $26_1, HEAP32[$1_1 + 36 >> 2], $6_1, $13_1); $3 = HEAP32[$28_1 + 80 >> 2]; } if ($3 & 67108864 | (HEAPU8[$12_1 + 13 | 0] | HEAPU8[$12_1 + 14 | 0] << 8) & 528) { break block94 } $20_1 = HEAP32[$12_1 + 8 >> 2]; $9_1 = HEAP32[HEAP32[$12_1 + 44 >> 2] >> 2]; $3 = $9_1; while (1) { if ($3) { if (HEAPU8[$3 + 4 | 0] & 9) { break block94 } $4_1 = HEAP32[$3 + 52 >> 2]; if (!!$4_1 & HEAPU8[$3 | 0] != 136) { break block94 } $5_1 = HEAP32[$3 + 68 >> 2]; $3 = $4_1; if (!$5_1) { continue } break block94; } break; }; $10_1 = HEAP32[$12_1 + 24 >> 2]; $22_1 = HEAP32[$12_1 + 28 >> 2]; block97 : { $5_1 = HEAP32[$9_1 + 48 >> 2]; if (!$5_1) { break block97 } $3 = 0; $4_1 = HEAP32[$5_1 >> 2]; $8_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $5_1 = $5_1 + 20 | 0; while (1) { if (($3 | 0) == ($8_1 | 0)) { break block97 } $4_1 = HEAPU16[$5_1 + ($3 << 4) >> 1]; if ($4_1) { $4_1 = $4_1 - 1 & 65535; $4_1 = $4_1 >>> 0 >= 63 ? 63 : $4_1; $21_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $11_1 = 1 << $21_1; $4_1 = 0; } else { $4_1 = 1 << $21_1; $11_1 = $4_1 - 1 & 1 >>> 32 - $21_1; } $10_1 = $4_1 | $10_1; $22_1 = $11_1 | $22_1; } $3 = $3 + 1 | 0; continue; }; } $4_1 = HEAP16[$20_1 + 34 >> 1]; $8_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $5_1 = 0; $4_1 = 0; while (1) { if (!$4_1 & ($5_1 | 0) == ($8_1 | 0)) { break block94 } $3 = $5_1 & 31; block99 : { if (($5_1 & 63) >>> 0 >= 32) { $11_1 = 1 << $3; $14 = 0; } else { $14 = 1 << $3; $11_1 = $14 - 1 & 1 >>> 32 - $3; } $20_1 = !$4_1 & $5_1 >>> 0 < 63; if ($10_1 & ($20_1 ? $14 : 0) | $22_1 & ($20_1 ? $11_1 : -2147483648)) { break block99 } $11_1 = $5_1 << 4; $3 = $9_1; while (1) { if (!$3) { break block99 } $20_1 = HEAP32[($11_1 + HEAP32[$3 + 28 >> 2] | 0) + 8 >> 2]; if (HEAPU8[$20_1 | 0] != 122) { HEAP8[$20_1 | 0] = 122; HEAP32[$20_1 + 4 >> 2] = HEAP32[$20_1 + 4 >> 2] & -532481; HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] | 16777216; } $3 = HEAP32[$3 + 52 >> 2]; continue; }; } $5_1 = $5_1 + 1 | 0; $4_1 = $5_1 ? $4_1 : $4_1 + 1 | 0; continue; }; } $35_1 = HEAP32[$1_1 + 44 >> 2]; $5_1 = HEAP32[$1_1 + 40 >> 2]; $14 = HEAP32[$1_1 + 36 >> 2]; $37_1 = HEAP32[$1_1 + 28 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; HEAP8[$7_1 + 248 | 0] = $4_1 & 1; block101 : { if (($4_1 & 9) != 1) { break block101 } if ($1024(HEAP32[$7_1 + 208 >> 2], $37_1, -1) | HEAPU8[$28_1 + 80 | 0] & 4 | HEAP32[$1_1 + 68 >> 2]) { break block101 } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -2; $3 = 0; $5_1 = $887($28_1, $37_1, 0); HEAP32[$1_1 + 40 >> 2] = $5_1; block102 : { if (!$5_1) { break block102 } $4_1 = HEAP32[$5_1 >> 2]; $8_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $4_1 = $5_1 + 20 | 0; while (1) { if (($3 | 0) == ($8_1 | 0)) { break block102 } $9_1 = $4_1 + ($3 << 4) | 0; $3 = $3 + 1 | 0; HEAP16[$9_1 >> 1] = $3; continue; }; } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 8; HEAP8[$7_1 + 248 | 0] = 2; } $4_1 = HEAP32[$7_1 + 208 >> 2]; if ($4_1) { $4_1 = $1042($0_1, $4_1, 0, HEAP32[$37_1 >> 2]); $3 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $3 + 1; HEAP32[$7_1 + 216 >> 2] = $3; $3 = $859($16_1, 117, $3, (HEAP32[HEAP32[$7_1 + 208 >> 2] >> 2] + HEAP32[$37_1 >> 2] | 0) + 1 | 0, 0, $4_1, -8); } else { $3 = -1 } HEAP32[$7_1 + 228 >> 2] = $3; block105 : { if (HEAPU8[$2_1 | 0] != 12) { break block105 } $326($16_1, 117, HEAP32[$2_1 + 4 >> 2], HEAP32[$37_1 >> 2]); if (!(HEAPU8[$1_1 + 5 | 0] & 8)) { break block105 } $9_1 = $37_1 + 8 | 0; $13_1 = HEAP32[$37_1 >> 2]; $3 = $13_1; while (1) { block106 : { if (($3 | 0) < 2) { break block106 } $3 = $3 - 1 | 0; $4_1 = $9_1 + ($3 << 4) | 0; if (HEAPU8[$4_1 + 9 | 0] & 64) { break block106 } $11($28_1, HEAP32[$4_1 >> 2]); $10($28_1, HEAP32[$4_1 + 4 >> 2]); $13_1 = HEAP32[$37_1 >> 2] - 1 | 0; HEAP32[$37_1 >> 2] = $13_1; continue; } break; }; $3 = 0; $8_1 = ($13_1 | 0) > 0 ? $13_1 : 0; while (1) { if (($3 | 0) == ($8_1 | 0)) { break block105 } $4_1 = $9_1 + ($3 << 4) | 0; if (!(HEAPU8[$4_1 + 9 | 0] & 64)) { HEAP8[HEAP32[$4_1 >> 2]] = 122 } $3 = $3 + 1 | 0; continue; }; } $25 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $25; if (!(HEAPU8[$1_1 + 5 | 0] & 64)) { HEAP16[$1_1 + 2 >> 1] = 320 } if (HEAP32[$1_1 + 60 >> 2]) { $1034($0_1, $1_1, $25) } block110 : { if (HEAP32[$1_1 + 8 >> 2]) { break block110 } $4_1 = HEAP32[$7_1 + 228 >> 2]; if (($4_1 | 0) < 0) { break block110 } $3 = 82740; HEAP8[(HEAPU8[HEAP32[$16_1 >> 2] + 87 | 0] ? $3 : HEAP32[$16_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) | 0] = 119; HEAP8[$7_1 + 240 | 0] = HEAPU8[$7_1 + 240 | 0] | 1; } $3 = 0; block112 : { if (!(HEAP8[$1_1 + 4 | 0] & 1)) { break block112 } $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $4_1 + 1; HEAP32[$7_1 + 252 >> 2] = $4_1; HEAP32[$7_1 + 256 >> 2] = $859($16_1, 117, $4_1, 0, 0, $1042($0_1, HEAP32[$1_1 + 28 >> 2], 0, 0), -8); $3 = 3; $4_1 = HEAP32[$16_1 + 108 >> 2]; if (($4_1 | 0) <= 0) { break block112 } HEAP16[(HEAP32[$16_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 8; } HEAP8[$7_1 + 249 | 0] = $3; block123 : { block176 : { block135 : { block133 : { block136 : { block184 : { block155 : { block156 : { block157 : { block166 : { block175 : { block178 : { block174 : { block171 : { block130 : { if (!($5_1 | $30_1)) { $4_1 = 0; $10_1 = HEAP32[$1_1 + 4 >> 2] & 16384 | (HEAPU8[$7_1 + 248 | 0] ? 256 : 0); $5_1 = HEAP32[$1_1 + 68 >> 2]; block114 : { if (!$5_1) { break block114 } $3 = HEAP32[HEAP32[HEAP32[HEAP32[HEAP32[$1_1 + 32 >> 2] + 52 >> 2] >> 2] + 28 >> 2] >> 2]; $11_1 = $856($0_1); $326($11_1, 117, HEAP32[$5_1 + 48 >> 2], $3); $3 = HEAP32[$5_1 + 48 >> 2]; $326($11_1, 114, $3 + 1 | 0, $3); $3 = HEAP32[$5_1 + 48 >> 2]; $326($11_1, 114, $3 + 2 | 0, $3); $3 = HEAP32[$5_1 + 48 >> 2]; $326($11_1, 114, $3 + 3 | 0, $3); $3 = HEAP32[$5_1 + 8 >> 2]; if ($3) { $9_1 = HEAP32[$3 >> 2]; $3 = HEAP32[$0_1 + 48 >> 2]; $8_1 = $3 + 1 | 0; HEAP32[$5_1 + 68 >> 2] = $8_1; $3 = $3 + $9_1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; $835($11_1, 75, 0, $8_1, $3); } $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$5_1 + 84 >> 2] = $3; $326($11_1, 71, 1, $3); if (!HEAPU8[$5_1 + 20 | 0]) { $3 = $5_1; while (1) { if (!$3) { break block114 } $8_1 = HEAP32[$3 + 44 >> 2]; block119 : { if (!(!(HEAPU8[$8_1 + 5 | 0] & 16) | HEAPU8[$3 + 17 | 0] == 91)) { $13_1 = $1042($0_1, HEAP32[HEAP32[$3 + 72 >> 2] + 20 >> 2], 0, 0); $9_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $9_1 + 1; HEAP32[$3 + 60 >> 2] = $9_1; $8_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$3 + 64 >> 2] = $8_1 + 1; HEAP32[$0_1 + 48 >> 2] = $8_1 + 3; if (!(!$13_1 | HEAPU8[HEAP32[HEAP32[$3 + 44 >> 2] + 32 >> 2] + 1 | 0] != 105)) { HEAP8[HEAP32[$13_1 + 16 >> 2]] = 1; $9_1 = HEAP32[$3 + 60 >> 2]; } $326($11_1, 117, $9_1, 2); $1043($11_1, $13_1, -8); $326($11_1, 71, 0, HEAP32[$3 + 64 >> 2] + 1 | 0); break block119; } $8_1 = HEAP32[$8_1 + 32 >> 2]; if (!(($8_1 | 0) != 50976 & ($8_1 | 0) != 50986)) { $8_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$3 + 64 >> 2] = $8_1 + 1; $9_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $9_1 + 1; HEAP32[$3 + 60 >> 2] = $9_1; HEAP32[$0_1 + 48 >> 2] = $8_1 + 2; $326($11_1, 114, $9_1, HEAP32[$5_1 + 48 >> 2]); break block119; } if (($8_1 | 0) != 50742 & ($8_1 | 0) != 50747) { break block119 } $8_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $8_1 + 1; HEAP32[$3 + 60 >> 2] = $8_1; $326($11_1, 114, $8_1, HEAP32[$5_1 + 48 >> 2]); } $3 = HEAP32[$3 + 36 >> 2]; continue; }; } $3 = HEAP32[$0_1 + 48 >> 2]; $8_1 = $3 + 1 | 0; HEAP32[$5_1 + 88 >> 2] = $8_1; $3 = $3 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$5_1 + 92 >> 2] = $3; $3 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $3 + 1; HEAP32[$5_1 + 60 >> 2] = $3; $326($11_1, 71, 1, $8_1); $326($11_1, 71, 0, HEAP32[$5_1 + 92 >> 2]); $326($11_1, 114, HEAP32[$5_1 + 60 >> 2], HEAP32[$5_1 + 48 >> 2]); } $17_1 = $1044($0_1, $6_1, $14, HEAP32[$7_1 + 208 >> 2], HEAP32[$1_1 + 28 >> 2], $1_1, $10_1, HEAP16[$1_1 + 2 >> 1]); if (!$17_1) { break block123 } $4_1 = HEAP16[$17_1 + 50 >> 1]; if (($4_1 | 0) < HEAP16[$1_1 + 2 >> 1]) { HEAP16[$1_1 + 2 >> 1] = $4_1 } block125 : { if (!HEAPU8[$7_1 + 248 | 0]) { break block125 } $4_1 = HEAPU8[$17_1 + 47 | 0]; if (!$4_1) { break block125 } HEAP8[$7_1 + 249 | 0] = $4_1; } $8_1 = HEAP32[$7_1 + 208 >> 2]; block129 : { if ($8_1) { $4_1 = HEAP8[$17_1 + 45 | 0]; $3 = ($4_1 | 0) > 0 ? $4_1 : 0; HEAP32[$7_1 + 212 >> 2] = $3; if (HEAPU8[$17_1 + 48 | 0] & 4) { $4_1 = $17_1 + Math_imul(HEAPU8[$17_1 + 44 | 0], 96) | 0; $4_1 = HEAP32[$4_1 + 720 >> 2] ? $17_1 + 28 | 0 : $4_1 + 680 | 0; } else { $4_1 = $17_1 + 28 | 0 } HEAP32[$7_1 + 236 >> 2] = HEAP32[$4_1 >> 2]; if (($3 | 0) != HEAP32[$8_1 >> 2]) { break block129 } HEAP32[$7_1 + 208 >> 2] = 0; } $4_1 = HEAP32[$7_1 + 228 >> 2]; if (($4_1 | 0) < 0) { break block129 } $1045($16_1, $4_1); } if (!$5_1) { break block130 } $23_1 = HEAP32[$0_1 + 60 >> 2]; $19_1 = $23_1 - 3 | 0; HEAP32[$0_1 + 60 >> 2] = $19_1; $26_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $26_1; $5_1 = HEAP32[$1_1 + 68 >> 2]; $34_1 = HEAP32[$5_1 + 12 >> 2]; $18_1 = $856($0_1); $4_1 = HEAP32[$1_1 + 32 >> 2]; $13_1 = HEAP32[$4_1 + 24 >> 2]; $22_1 = HEAP16[HEAP32[$4_1 + 16 >> 2] + 34 >> 1]; $27 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $27; wasm2js_memory_fill($7_1 + 300 | 0, 0, 36); HEAP32[$7_1 + 296 >> 2] = $26_1; HEAP32[$7_1 + 288 >> 2] = $18_1; HEAP32[$7_1 + 284 >> 2] = $5_1; HEAP32[$7_1 + 280 >> 2] = $0_1; $20_1 = $23_1 - 1 | 0; HEAP32[$7_1 + 292 >> 2] = $20_1; $32_1 = HEAP32[$5_1 + 48 >> 2]; HEAP32[$7_1 + 320 >> 2] = $32_1; $24_1 = $32_1 + 3 | 0; HEAP32[$7_1 + 328 >> 2] = $24_1; $3 = 2; $12_1 = $32_1 + 2 | 0; HEAP32[$7_1 + 312 >> 2] = $12_1; block134 : { switch (HEAPU8[$5_1 + 17 | 0] - 87 | 0) { case 0: if (HEAPU8[$5_1 + 16 | 0] == 90) { break block135 } if (!$1046($0_1, HEAP32[$5_1 + 24 >> 2])) { break block135 } break block136; case 4: break block134; default: break block133; }; } if (HEAP32[$5_1 + 88 >> 2]) { break block135 } $3 = $5_1; while (1) { if ($3) { $4_1 = HEAP32[HEAP32[$3 + 44 >> 2] + 32 >> 2]; if (($4_1 | 0) == 50747 | ($4_1 | 0) == 50742 | (($4_1 | 0) == 50976 | ($4_1 | 0) == 50986)) { break block135 } $3 = HEAP32[$3 + 36 >> 2]; continue; } break; }; if (HEAPU8[$5_1 + 18 | 0] != 89) { break block136 } if (HEAPU8[$5_1 + 16 | 0] == 90) { break block135 } if (!$1046($0_1, HEAP32[$5_1 + 28 >> 2])) { break block135 } $3 = 3; break block133; } block142 : { if ($5_1) { $3 = HEAP32[$1_1 + 28 >> 2]; $4_1 = $3 + 8 | 0; $3 = HEAP32[$3 >> 2]; while (1) { if (!(($3 | 0) <= 0)) { HEAP16[$4_1 + 14 >> 1] = 0; $4_1 = $4_1 + 16 | 0; $3 = $3 - 1 | 0; continue; } break; }; $3 = HEAP32[$5_1 >> 2]; $10_1 = $5_1 + 8 | 0; $4_1 = $10_1; while (1) { if (!(($3 | 0) <= 0)) { HEAP16[$4_1 + 14 >> 1] = 0; $4_1 = $4_1 + 16 | 0; $3 = $3 - 1 | 0; continue; } break; }; if (HEAP16[$1_1 + 2 >> 1] >= 67) { HEAP16[$1_1 + 2 >> 1] = 66 } $29_1 = 1; $13_1 = HEAP32[$7_1 + 208 >> 2]; if (!$13_1) { break block142 } $4_1 = HEAP32[$5_1 >> 2]; if (($4_1 | 0) != HEAP32[$13_1 >> 2]) { break block142 } $3 = 0; $9_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $8_1 = $13_1 + 16 | 0; while (1) { if (!(($3 | 0) == ($9_1 | 0))) { $4_1 = $3 << 4; HEAP8[($4_1 + $10_1 | 0) + 8 | 0] = HEAP8[$4_1 + $8_1 | 0] & 1; $3 = $3 + 1 | 0; continue; } break; }; $29_1 = ($1024($5_1, $13_1, -1) | 0) != 0; break block142; } HEAP16[$1_1 + 2 >> 1] = 0; $29_1 = 1; } $34_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $34_1; $17_1 = $270($28_1, 44, 0); if ($17_1) { $1016($0_1, 54, $17_1) } $4_1 = 0; if (HEAPU8[$28_1 + 87 | 0]) { break block123 } HEAP32[$17_1 + 40 >> 2] = HEAP32[$1_1 + 16 >> 2]; $4_1 = $7_1 + 308 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $7_1 + 300 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 296 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = $17_1; HEAP32[$7_1 + 284 >> 2] = $6_1; HEAP32[$7_1 + 280 >> 2] = $0_1; if ($5_1) { $4_1 = HEAP32[$5_1 >> 2] } else { $4_1 = 0 } HEAP32[$17_1 + 16 >> 2] = $5_1; HEAP16[$17_1 + 2 >> 1] = $4_1; $3 = $7_1 + 280 | 0; $1048($3, $37_1); $1048($3, HEAP32[$7_1 + 208 >> 2]); if ($35_1) { if ($5_1) { $4_1 = $7_1 + 352 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$7_1 + 344 >> 2] = 0; HEAP32[$7_1 + 348 >> 2] = 0; HEAP32[$7_1 + 340 >> 2] = 55; HEAP32[$7_1 + 336 >> 2] = $0_1; HEAP32[$7_1 + 360 >> 2] = $1_1; $920($7_1 + 336 | 0, HEAP32[$1_1 + 44 >> 2]); $14 = HEAP32[$1_1 + 36 >> 2]; } $1050($7_1 + 280 | 0, $35_1); } HEAP32[$17_1 + 28 >> 2] = HEAP32[$17_1 + 24 >> 2]; $4_1 = 0; $9_1 = 0; block149 : { if (HEAP32[$1_1 + 40 >> 2]) { break block149 } if (HEAP32[$1_1 + 44 >> 2]) { break block149 } if (HEAP32[$17_1 + 36 >> 2] != 1) { break block149 } $3 = HEAP32[HEAP32[$17_1 + 32 >> 2] >> 2]; $8_1 = HEAP32[$3 + 20 >> 2]; if (!$8_1) { break block149 } if (HEAP32[$8_1 >> 2] != 1) { break block149 } if (HEAP8[$3 + 7 | 0] & 1) { break block149 } if (HEAP8[$28_1 + 82 | 0] & 1) { break block149 } $3 = HEAP32[$3 + 8 >> 2]; block152 : { if (!$67($3, 11360)) { $13_1 = $1051(HEAP32[$8_1 + 8 >> 2]) ? 2 : 0; $9_1 = 1; break block152; } if ($67($3, 1615)) { break block149 } $13_1 = 1; $9_1 = 2; } $4_1 = $887($28_1, $8_1, 0); if (!$4_1) { $4_1 = 0; break block149; } HEAP8[$4_1 + 16 | 0] = $13_1; } $1052($17_1, $7_1 + 280 | 0); if (HEAPU8[$28_1 + 87 | 0]) { break block123 } if ($5_1) { $32_1 = 0; $36_1 = 0; if (HEAP32[$17_1 + 36 >> 2] != 1) { break block155 } $3 = HEAP32[$17_1 + 32 >> 2]; $9_1 = 0; if (HEAP32[$3 + 8 >> 2] < 0) { break block156 } $3 = HEAP32[$3 >> 2]; if (!$3) { break block157 } $36_1 = 0; if (HEAPU8[$3 + 5 | 0] & 16) { break block155 } $3 = HEAP32[$3 + 20 >> 2]; if (!$3) { break block157 } $3 = $906($28_1, HEAP32[$3 + 8 >> 2], 0); $32_1 = $936($0_1, $887($28_1, $5_1, 0), $3); $36_1 = $32_1 ? 1280 : 0; break block155; } block158 : { if (HEAP32[$1_1 + 36 >> 2]) { break block158 } $5_1 = HEAP32[$1_1 + 28 >> 2]; if (HEAP32[$5_1 >> 2] != 1) { break block158 } $3 = HEAP32[$1_1 + 32 >> 2]; if (HEAP32[$3 >> 2] != 1 | HEAPU8[$3 + 21 | 0] & 4 | (HEAP32[$1_1 + 44 >> 2] | HEAP32[$17_1 + 36 >> 2] != 1)) { break block158 } $13_1 = HEAP32[$3 + 16 >> 2]; if (HEAPU8[$13_1 + 43 | 0]) { break block158 } $5_1 = HEAP32[$5_1 + 8 >> 2]; if (HEAPU8[$5_1 | 0] != 169 | ($17_1 | 0) != HEAP32[$5_1 + 40 >> 2] | (!(HEAP8[HEAP32[HEAP32[$17_1 + 32 >> 2] + 4 >> 2] + 5 | 0] & 1) | HEAP32[$5_1 + 4 >> 2] & 16777220)) { break block158 } $9_1 = $309(HEAP32[$0_1 >> 2], HEAP32[$13_1 + 60 >> 2]); $8_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $8_1 + 1; $10_1 = HEAP32[$13_1 + 20 >> 2]; $917($0_1, $9_1); $5_1 = 0; $988($0_1, $9_1, HEAP32[$13_1 + 20 >> 2], 0, HEAP32[$13_1 >> 2]); if (HEAPU8[$13_1 + 28 | 0] & 128) { $5_1 = $359($13_1) } block160 : { if (HEAP8[HEAP32[$1_1 + 32 >> 2] + 21 | 0] & 1) { break block160 } $6_1 = $13_1 + 8 | 0; while (1) { $3 = HEAP32[$6_1 >> 2]; if (!$3) { break block160 } block161 : { if (HEAPU8[$3 + 55 | 0] & 4) { break block161 } $6_1 = HEAP16[$3 + 48 >> 1]; if (HEAP32[$3 + 36 >> 2] | ($6_1 | 0) >= HEAP16[$13_1 + 40 >> 1] | !!$5_1 & ($6_1 | 0) >= HEAP16[$5_1 + 48 >> 1]) { break block161 } $5_1 = $3; } $6_1 = $3 + 20 | 0; continue; }; } if ($5_1) { $10_1 = HEAP32[$5_1 + 44 >> 2]; $6_1 = $1053($0_1, $5_1); } else { $6_1 = 0 } $312($16_1, 102, $8_1, $10_1, $9_1, 1); if ($6_1) { $315($16_1, -1, $6_1, -8) } $3 = HEAP32[$0_1 + 48 >> 2]; $6_1 = $3 + 1 | 0; HEAP32[$17_1 + 12 >> 2] = $6_1; $9_1 = $3; $3 = HEAP32[$17_1 + 24 >> 2]; HEAP32[$0_1 + 48 >> 2] = HEAP32[$17_1 + 36 >> 2] + ($9_1 + $3 | 0); $326($16_1, 98, $8_1, $3 + $6_1 | 0); $858($16_1, 122, $8_1); if (HEAPU8[$0_1 + 223 | 0] != 2) { break block166 } block168 : { if (!$5_1) { $8_1 = HEAP32[$13_1 >> 2]; $6_1 = 30822; $3 = 30822; break block168; } block170 : { if (!(HEAPU8[$13_1 + 28 | 0] & 128)) { $8_1 = HEAP32[$13_1 >> 2]; break block170; } $8_1 = HEAP32[$13_1 >> 2]; $6_1 = 30822; $3 = 30822; if (((HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8) & 3) == 2) { break block168 } } $6_1 = HEAP32[$5_1 >> 2]; $3 = 30213; } HEAP32[$7_1 + 104 >> 2] = $6_1; HEAP32[$7_1 + 100 >> 2] = $3; HEAP32[$7_1 + 96 >> 2] = $8_1; $1032($0_1, 0, 6111, $7_1 + 96 | 0); break block166; } $10_1 = HEAP32[$17_1 + 36 >> 2]; if (!HEAP32[$17_1 + 28 >> 2]) { break block171 } $8_1 = 0; $5_1 = ($10_1 | 0) > 0 ? $10_1 : 0; while (1) { block173 : { if (($5_1 | 0) != ($8_1 | 0)) { $3 = HEAP32[$17_1 + 32 >> 2] + Math_imul($8_1, 24) | 0; if (HEAP8[HEAP32[$3 >> 2] + 7 | 0] & 1 | !(HEAPU8[HEAP32[$3 + 4 >> 2] + 4 | 0] & 32)) { break block173 } $5_1 = $8_1; } if (($5_1 | 0) != ($10_1 | 0)) { break block174 } $13_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $13_1; $5_1 = 0; $326($16_1, 71, 0, $13_1); $10_1 = HEAP32[$17_1 + 36 >> 2]; $29_1 = 0; break block175; } $8_1 = $8_1 + 1 | 0; continue; }; } $1033($0_1, $1_1, -1, $7_1 + 208 | 0, $7_1 + 248 | 0, $2_1, HEAP32[$17_1 + 28 >> 2], HEAP32[$17_1 + 32 >> 2]); $1054($17_1); $4_1 = 0; break block176; } if (($10_1 | 0) != 1) { break block174 } $13_1 = 0; $5_1 = HEAP32[$17_1 + 32 >> 2]; if (HEAP32[$5_1 + 8 >> 2] < 0) { $10_1 = 1; break block178; } $10_1 = 1; $5_1 = HEAP32[HEAP32[$5_1 >> 2] + 20 >> 2]; $29_1 = $5_1 ? 1280 : 0; break block175; } $13_1 = 0; } $5_1 = 0; $29_1 = 0; } $3 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$17_1 + 12 >> 2] = $3 + 1; HEAP32[$0_1 + 48 >> 2] = HEAP32[$17_1 + 24 >> 2] + ($3 + $10_1 | 0); $1055($0_1, $17_1); $8_1 = $1044($0_1, $6_1, $14, $4_1, $5_1, $1_1, $9_1 | $29_1, 0); if (!$8_1) { break block123 } $3 = HEAPU8[$8_1 + 47 | 0]; $1056($0_1, $13_1, $17_1, $3); block179 : { if (!$3) { break block179 } $5_1 = HEAP32[$17_1 + 32 >> 2]; if (!$5_1) { break block179 } $1057($0_1, $3, HEAP32[$5_1 + 8 >> 2], HEAP32[$5_1 + 12 >> 2]); } if ($13_1) { $326($16_1, 71, 1, $13_1) } if (!(!HEAPU8[$8_1 + 45 | 0] | (!$9_1 | !(HEAPU8[$8_1 + 48 | 0] & 4)))) { $3 = $8_1 + 760 | 0; $6_1 = HEAPU8[$8_1 + 44 | 0]; block183 : { block182 : { while (1) { if (($6_1 | 0) <= 0) { break block182 } $6_1 = $6_1 - 1 | 0; $5_1 = $3 + Math_imul($6_1, 96) | 0; if (!(HEAPU8[HEAP32[$5_1 + 80 >> 2] + 40 | 0] & 4)) { continue } break; }; $3 = $5_1 + 16 | 0; break block183; } $3 = $8_1 + 32 | 0; } $863($16_1, HEAP32[$3 >> 2]); } $1054($8_1); $1058($0_1, $17_1); } HEAP32[$7_1 + 208 >> 2] = 0; $1059($0_1, $35_1, $34_1, 16); $1033($0_1, $1_1, -1, 0, 0, $2_1, $34_1, $34_1); break block184; } $9_1 = 0; } $32_1 = $9_1; $36_1 = 0; } $3 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $3 + 1; HEAP32[$17_1 + 4 >> 2] = $3; $27 = $1042($0_1, $5_1, 0, HEAP32[$17_1 + 24 >> 2]); $23_1 = $859($16_1, 119, HEAP32[$17_1 + 4 >> 2], HEAPU16[$17_1 + 2 >> 1], 0, $27, -8); $20_1 = HEAP32[$0_1 + 60 >> 2]; $31_1 = $20_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $31_1; $3 = HEAP32[$5_1 >> 2]; $19_1 = HEAP32[$0_1 + 48 >> 2]; $24_1 = $19_1 + 4 | 0; $21_1 = $3 + $24_1 | 0; HEAP32[$0_1 + 48 >> 2] = $3 + $21_1; $22_1 = $19_1 + 2 | 0; $326($16_1, 71, 0, $22_1); $26_1 = $19_1 + 5 | 0; $835($16_1, 75, 0, $26_1, $24_1 + HEAP32[$5_1 >> 2] | 0); $326($16_1, 10, $24_1, $31_1); $30_1 = $1044($0_1, $6_1, $14, $5_1, $32_1, $1_1, ($29_1 ? 0 : 512) | (HEAPU8[$7_1 + 248 | 0] == 2 ? 128 : 64) | $36_1, 0); if (!$30_1) { $358($28_1, $32_1); break block123; } if (HEAP32[$0_1 + 76 >> 2]) { $3 = HEAP32[$17_1 + 28 >> 2]; HEAP32[$17_1 + 24 >> 2] = $3; if (HEAPU16[$17_1 + 2 >> 1]) { $6_1 = 0; $9_1 = ($3 | 0) > 0 ? $3 : 0; $8_1 = HEAP32[HEAP32[$1_1 + 40 >> 2] >> 2] - 1 | 0; while (1) { if (!(($6_1 | 0) == ($9_1 | 0))) { $3 = HEAP16[(HEAP32[$17_1 + 20 >> 2] + ($6_1 << 4) | 0) + 14 >> 1]; $8_1 = ($3 | 0) < ($8_1 | 0) ? $8_1 : $3; $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP16[$17_1 + 2 >> 1] = $8_1 + 1; } $1052($17_1, $7_1 + 280 | 0); } $3 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$17_1 + 12 >> 2] = $3 + 1; HEAP32[$0_1 + 48 >> 2] = HEAP32[$17_1 + 36 >> 2] + ($3 + HEAP32[$17_1 + 24 >> 2] | 0); $8_1 = 0; $14 = HEAPU8[$30_1 + 47 | 0]; $10_1 = 0; $12_1 = HEAP32[$5_1 >> 2]; $3 = HEAP8[$30_1 + 45 | 0]; $11_1 = ($3 | 0) > 0 ? $3 : 0; $15_1 = ($12_1 | 0) == ($11_1 | 0); if (!$15_1) { if (HEAPU8[$7_1 + 248 | 0]) { $3 = HEAP8[$1_1 + 4 | 0] & 1 ? 18718 : 18965 } else { $3 = 18718 } HEAP32[$7_1 + 112 >> 2] = $3; $6_1 = 0; $1032($0_1, 0, 7379, $7_1 + 112 | 0); $3 = HEAP32[$17_1 + 24 >> 2]; $10_1 = ($3 | 0) > 0 ? $3 : 0; $13_1 = HEAP32[$5_1 >> 2]; $9_1 = $13_1; $8_1 = $9_1; while (1) { if (!(($6_1 | 0) == ($10_1 | 0))) { $3 = HEAP16[(HEAP32[$17_1 + 20 >> 2] + ($6_1 << 4) | 0) + 14 >> 1] >= ($8_1 | 0); $8_1 = $3 + $8_1 | 0; $9_1 = $3 + $9_1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; $6_1 = 0; $8_1 = $1060($0_1, $9_1); $976($0_1, $5_1, $8_1, 0, 0); HEAP8[$17_1 | 0] = 1; while (1) { if (!(HEAP32[$17_1 + 24 >> 2] <= ($6_1 | 0))) { $3 = HEAP32[$17_1 + 20 >> 2] + ($6_1 << 4) | 0; if (($13_1 | 0) <= HEAP16[$3 + 14 >> 1]) { $862($0_1, HEAP32[$3 + 4 >> 2], $8_1 + $13_1 | 0); $13_1 = $13_1 + 1 | 0; } $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP8[$17_1 | 0] = 0; $3 = $893($0_1); $835($16_1, 97, $8_1, $9_1, $3); $326($16_1, 139, HEAP32[$17_1 + 4 >> 2], $3); $894($0_1, $3); $1061($0_1, $8_1, $9_1); $1054($30_1); $10_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $10_1 + 1; HEAP32[$17_1 + 8 >> 2] = $10_1; $8_1 = $893($0_1); $835($16_1, 121, $10_1, $8_1, $9_1); $326($16_1, 34, HEAP32[$17_1 + 4 >> 2], $34_1); HEAP8[$17_1 + 1 | 0] = 1; } block195 : { if (!HEAP32[$0_1 + 76 >> 2]) { break block195 } $6_1 = 0; HEAP32[$7_1 + 360 >> 2] = 0; $3 = $7_1 + 352 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $7_1 + 344 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$7_1 + 336 >> 2] = 0; HEAP32[$7_1 + 340 >> 2] = 0; HEAP32[$7_1 + 340 >> 2] = 56; while (1) { if (HEAP32[$17_1 + 36 >> 2] <= ($6_1 | 0)) { break block195 } $920($7_1 + 336 | 0, HEAP32[HEAP32[$17_1 + 32 >> 2] + Math_imul($6_1, 24) >> 2]); $6_1 = $6_1 + 1 | 0; continue; }; } block198 : { if (!(HEAPU8[$28_1 + 80 | 0] & 4 | $29_1)) { if (!(HEAPU8[$30_1 + 48 | 0] & 8 | ($11_1 | 0) != ($12_1 | 0))) { $29_1 = HEAP32[$16_1 + 108 >> 2]; break block198; } HEAP32[$7_1 + 208 >> 2] = 0; $1045($16_1, HEAP32[$7_1 + 228 >> 2]); } $29_1 = HEAP32[$16_1 + 108 >> 2]; if ($15_1) { break block198 } $835($16_1, 133, HEAP32[$17_1 + 4 >> 2], $8_1, $10_1); } $13_1 = $20_1 - 1 | 0; $20_1 = $19_1 + 3 | 0; $12_1 = $19_1 + 1 | 0; $11_1 = $21_1 + 1 | 0; $9_1 = $5_1 + 8 | 0; $6_1 = 0; while (1) { $3 = HEAP32[$5_1 >> 2]; if (!(($3 | 0) <= ($6_1 | 0))) { $3 = $9_1 + ($6_1 << 4) | 0; $8_1 = HEAPU16[$3 + 12 >> 1]; block201 : { if (!$15_1) { $835($16_1, 94, $10_1, $6_1, $6_1 + $11_1 | 0); break block201; } HEAP8[$17_1 | 0] = 1; $862($0_1, HEAP32[$3 >> 2], $6_1 + $11_1 | 0); } block202 : { if (!$8_1) { break block202 } $8_1 = HEAP32[(HEAP32[$1_1 + 28 >> 2] + ($8_1 << 4) | 0) - 8 >> 2]; $3 = $1063($8_1); if (!$3) { break block202 } $3 = HEAPU8[$3 | 0]; if (($3 | 0) == 170 | ($3 | 0) == 176) { break block202 } $1064($8_1, $6_1 + $26_1 | 0); } $6_1 = $6_1 + 1 | 0; continue; } break; }; if ($27) { HEAP32[$27 >> 2] = HEAP32[$27 >> 2] + 1 } $859($16_1, 90, $26_1, $11_1, $3, $27, -8); $8_1 = HEAP32[$16_1 + 108 >> 2]; $3 = $8_1 + 1 | 0; $835($16_1, 14, $3, 0, $3); $326($16_1, 10, $20_1, $13_1); $1065($0_1, $11_1, $26_1, HEAP32[$5_1 >> 2]); $326($16_1, 50, $22_1, $34_1); $326($16_1, 10, $24_1, $31_1); $5_1 = HEAP32[$16_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$16_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$16_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $5_1; $1056($0_1, $12_1, $17_1, $14); $326($16_1, 71, 1, $12_1); block206 : { if (!$15_1) { $326($16_1, 37, HEAP32[$17_1 + 4 >> 2], $29_1); break block206; } $1054($30_1); $1045($16_1, $23_1); } $358($28_1, $32_1); $326($16_1, 10, $20_1, $13_1); $863($16_1, $34_1); $3 = HEAP32[$16_1 + 108 >> 2]; $326($16_1, 71, 1, $22_1); $858($16_1, 67, $20_1); $1013($16_1, $13_1); $5_1 = HEAP32[$16_1 + 108 >> 2]; $326($16_1, 50, $12_1, $5_1 + 2 | 0); $858($16_1, 67, $20_1); $1058($0_1, $17_1); $5_1 = $5_1 + 1 | 0; $1059($0_1, $35_1, $5_1, 16); $1033($0_1, $1_1, -1, $7_1 + 208 | 0, $7_1 + 248 | 0, $2_1, $5_1, $3); $858($16_1, 67, $20_1); $1013($16_1, $31_1); $1055($0_1, $17_1); $326($16_1, 71, 0, $12_1); $858($16_1, 67, $24_1); if (!$36_1 | !$14) { break block184 } $5_1 = HEAP32[$17_1 + 32 >> 2]; $1057($0_1, $14, HEAP32[$5_1 + 8 >> 2], HEAP32[$5_1 + 12 >> 2]); } $1013($16_1, $34_1); break block176; } $3 = 1; } HEAP32[$7_1 + 304 >> 2] = $3; } $3 = HEAP32[$0_1 + 48 >> 2]; $11_1 = $3 + $22_1 | 0; $4_1 = $11_1 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; HEAP32[$7_1 + 308 >> 2] = $4_1; $10_1 = 0; $6_1 = $4_1; $8_1 = 0; block208 : { switch (HEAPU8[$5_1 + 17 | 0] - 87 | 0) { case 0: case 2: $6_1 = $11_1 + 3 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; $8_1 = $6_1; break; default: break block208; }; } block210 : { switch (HEAPU8[$5_1 + 18 | 0] - 87 | 0) { case 0: case 2: $6_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $6_1; $10_1 = $6_1; break; default: break block210; }; } $30_1 = $3 + 1 | 0; $3 = 0; $14 = 0; $15_1 = 0; if (HEAPU8[$5_1 + 16 | 0] != 77) { if ($34_1) { $33_1 = HEAP32[$34_1 >> 2] } else { $33_1 = 0 } $36_1 = $30_1 + HEAP32[$5_1 + 76 >> 2] | 0; $9_1 = HEAP32[$5_1 + 8 >> 2]; if ($9_1) { $36_1 = HEAP32[$9_1 >> 2] + $36_1 | 0 } $9_1 = $6_1 + $33_1 | 0; $29_1 = $9_1 + 1 | 0; HEAP32[$7_1 + 316 >> 2] = $29_1; $9_1 = $9_1 + $33_1 | 0; $15_1 = $9_1 + 1 | 0; HEAP32[$7_1 + 324 >> 2] = $15_1; $9_1 = $9_1 + $33_1 | 0; $14 = $9_1 + 1 | 0; HEAP32[$7_1 + 332 >> 2] = $14; HEAP32[$0_1 + 48 >> 2] = $9_1 + $33_1; $33_1 = $6_1 + 1 | 0; } $21_1 = $23_1 - 2 | 0; $31_1 = $32_1 + 1 | 0; $11_1 = $11_1 + 1 | 0; $6_1 = ($22_1 | 0) > 0 ? $22_1 : 0; while (1) { if (!(($3 | 0) == ($6_1 | 0))) { $835($18_1, 94, $13_1, $3, $3 + $30_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; $835($18_1, 97, $30_1, $22_1, $11_1); $35_1 = 0; $22_1 = 0; $3 = HEAP32[$5_1 + 8 >> 2]; if ($3) { $13_1 = HEAP32[$3 >> 2]; $6_1 = HEAP32[$5_1 + 76 >> 2]; $3 = $1042($0_1, $3, 0, 0); $35_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $35_1; $6_1 = $6_1 + $30_1 | 0; $9_1 = $835($18_1, 90, $6_1, HEAP32[$5_1 + 68 >> 2], $13_1); $1043($18_1, $3, -8); $3 = $9_1 + 2 | 0; $835($18_1, 14, $3, $9_1 + 4 | 0, $3); $22_1 = $858($18_1, 10, $35_1); $835($18_1, 80, $6_1, HEAP32[$5_1 + 68 >> 2], $13_1 - 1 | 0); } $326($18_1, 127, $31_1, $4_1); $835($18_1, 128, $31_1, $11_1, $4_1); $11_1 = $835($18_1, 53, HEAP32[$5_1 + 84 >> 2], 0, $4_1); $30_1 = $856($0_1); $3 = $5_1; $6_1 = 0; while (1) { if ($3) { $23_1 = HEAP32[$3 + 44 >> 2]; $4_1 = 0; $326($30_1, 75, 0, HEAP32[$3 + 52 >> 2]); $9_1 = HEAP32[HEAP32[$3 + 72 >> 2] + 20 >> 2]; if ($9_1) { $4_1 = HEAP32[$9_1 >> 2] } $13_1 = ($4_1 | 0) < ($6_1 | 0); block219 : { if (HEAP32[$5_1 + 88 >> 2]) { break block219 } $9_1 = HEAP32[$23_1 + 32 >> 2]; if (!(($9_1 | 0) != 50976 & ($9_1 | 0) != 50986)) { $326($30_1, 71, 0, HEAP32[$3 + 64 >> 2]); $326($30_1, 71, 0, HEAP32[$3 + 64 >> 2] + 1 | 0); } if (!(HEAPU8[$23_1 + 5 | 0] & 16)) { break block219 } $9_1 = HEAP32[$3 + 60 >> 2]; if (!$9_1) { break block219 } $858($30_1, 146, $9_1); $326($30_1, 71, 0, HEAP32[$3 + 64 >> 2] + 1 | 0); } $6_1 = $13_1 ? $6_1 : $4_1; $3 = HEAP32[$3 + 36 >> 2]; continue; } break; }; $4_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $4_1 + $6_1; HEAP32[$7_1 + 300 >> 2] = $4_1 + 1; if ($8_1) { $862($0_1, HEAP32[$5_1 + 24 >> 2], $8_1); $1066($0_1, $8_1, HEAPU8[$5_1 + 16 | 0] == 90 ? 3 : 0); } if ($10_1) { $862($0_1, HEAP32[$5_1 + 28 >> 2], $10_1); $1066($0_1, $10_1, HEAPU8[$5_1 + 16 | 0] == 90 ? 4 : 1); } block225 : { if (HEAPU8[$5_1 + 16 | 0] != 90) { $3 = HEAPU8[$5_1 + 17 | 0]; if (!$8_1) { break block225 } $4_1 = $3 & 255; if (($4_1 | 0) != HEAPU8[$5_1 + 18 | 0]) { break block225 } $6_1 = $835($18_1, ($4_1 | 0) == 87 ? 58 : 56, $8_1, 0, $10_1); $3 = $7_1 + 280 | 0; $1067($3, 0); $858($18_1, 36, $32_1); $1068($3); $858($18_1, 146, $32_1); $326($18_1, 9, 0, $27); $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $3 : HEAP32[$18_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) + 8 >> 2] = $4_1; } $3 = HEAPU8[$5_1 + 17 | 0]; } block229 : { block228 : { if (($3 & 255) == 87) { if (!$10_1 | HEAPU8[$5_1 + 16 | 0] == 90) { break block228 } $835($18_1, 108, $8_1, $10_1, $8_1); $3 = HEAPU8[$5_1 + 17 | 0]; } if (($3 & 255) == 91) { break block229 } } $858($18_1, 36, $12_1); } $858($18_1, 36, $32_1); $858($18_1, 36, $24_1); if (!(!$33_1 | !$34_1)) { $835($18_1, 80, $36_1, $33_1, HEAP32[$34_1 >> 2] - 1 | 0); $835($18_1, 80, $33_1, $29_1, HEAP32[$34_1 >> 2] - 1 | 0); $835($18_1, 80, $33_1, $15_1, HEAP32[$34_1 >> 2] - 1 | 0); $835($18_1, 80, $33_1, $14, HEAP32[$34_1 >> 2] - 1 | 0); } $326($18_1, 9, 0, $27); $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $3 : HEAP32[$18_1 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = $4_1; if ($33_1) { $1069($0_1, $34_1, $36_1, $33_1, $27) } $4_1 = HEAPU8[$5_1 + 17 | 0]; block234 : { if (($4_1 | 0) == 87) { $6_1 = $7_1 + 280 | 0; $1070($6_1, 3, 0, 0); if (HEAPU8[$5_1 + 18 | 0] == 91) { break block234 } if (HEAPU8[$5_1 + 16 | 0] == 90) { $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $4_1 = HEAP32[$18_1 + 108 >> 2]; $1071($6_1, 58, $32_1, $10_1, $24_1, $3); $1070($6_1, 2, $8_1, 0); $1070($6_1, 1, 0, 0); $326($18_1, 9, 0, $4_1); $1013($18_1, $3); break block234; } $3 = $7_1 + 280 | 0; $1070($3, 1, $10_1, 0); $1070($3, 2, $8_1, 0); break block234; } if (HEAPU8[$5_1 + 18 | 0] == 89) { block238 : { if (($4_1 | 0) == 89) { $4_1 = HEAPU8[$5_1 + 16 | 0]; $3 = $7_1 + 280 | 0; $1070($3, 3, $10_1, 0); if (($4_1 | 0) != 90) { break block238 } $1070($3, 2, $8_1, 0); $1070($3, 1, 0, 0); break block234; } $1070($7_1 + 280 | 0, 3, $10_1, 0); } $3 = $7_1 + 280 | 0; $1070($3, 1, 0, 0); $1070($3, 2, $8_1, 0); break block234; } $6_1 = $7_1 + 280 | 0; $1070($6_1, 3, 0, 0); if (HEAPU8[$5_1 + 18 | 0] == 91) { break block234 } if (HEAPU8[$5_1 + 16 | 0] == 90) { $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = 0; if ($10_1) { $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $1071($6_1, 58, $32_1, $10_1, $24_1, $3); } $6_1 = $7_1 + 280 | 0; $1070($6_1, 1, 0, 0); $1070($6_1, 2, $8_1, 0); if (!$10_1) { break block234 } $326($18_1, 9, 0, $4_1); $1013($18_1, $3); break block234; } $3 = 0; if ($10_1) { $3 = $835($18_1, 50, $10_1, 0, 1) } $4_1 = $7_1 + 280 | 0; $1070($4_1, 1, 0, 0); $1070($4_1, 2, $8_1, 0); if (!$10_1) { break block234 } $6_1 = HEAP32[$18_1 + 108 >> 2]; $4_1 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$18_1 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = $6_1; } $1013($18_1, $27); $1054($17_1); $13_1 = 0; if (HEAP32[$5_1 + 8 >> 2]) { $13_1 = $326($18_1, 71, 0, $35_1); $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $3 : HEAP32[$18_1 + 104 >> 2] + Math_imul($22_1, 20) | 0) + 8 >> 2] = $4_1; } HEAP32[$7_1 + 308 >> 2] = 0; $11_1 = $858($18_1, 36, $31_1); $4_1 = HEAPU8[$5_1 + 17 | 0]; block248 : { if (HEAPU8[$5_1 + 18 | 0] == 89) { block247 : { if (($4_1 | 0) == 89) { $4_1 = HEAPU8[$5_1 + 16 | 0]; $3 = $7_1 + 280 | 0; $1070($3, 3, $10_1, 0); if (($4_1 | 0) != 90) { break block247 } $1070($3, 2, $8_1, 0); break block247; } $1070($7_1 + 280 | 0, 3, $10_1, 0); } $1070($7_1 + 280 | 0, 1, 0, 0); $3 = HEAP32[$18_1 + 108 >> 2]; $6_1 = HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0]; break block248; } $9_1 = $7_1 + 280 | 0; $1070($9_1, 3, 0, 0); if (($4_1 | 0) == 87) { block251 : { if (HEAPU8[$5_1 + 16 | 0] == 90) { $3 = HEAP32[$18_1 + 108 >> 2]; $6_1 = $1070($9_1, 2, $8_1, 1); $15_1 = $1070($9_1, 1, 0, 1); break block251; } $3 = HEAP32[$18_1 + 108 >> 2]; if (HEAPU8[$5_1 + 18 | 0] == 91) { $4_1 = $7_1 + 280 | 0; $15_1 = $1070($4_1, 1, $8_1, 1); $6_1 = $1070($4_1, 2, 0, 1); break block251; } $4_1 = $7_1 + 280 | 0; $15_1 = $1070($4_1, 1, $10_1, 1); $6_1 = $1070($4_1, 2, $8_1, 1); } $326($18_1, 9, 0, $3); $3 = HEAP32[$18_1 + 108 >> 2]; $4_1 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$18_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) + 8 >> 2] = $3; $8_1 = $1070($7_1 + 280 | 0, 1, 0, 1); $326($18_1, 9, 0, $3); $3 = HEAP32[$18_1 + 108 >> 2]; $6_1 = HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0]; block255 : { if ($6_1) { HEAP32[20687] = $3; $4_1 = 82740; break block255; } $4_1 = HEAP32[$18_1 + 104 >> 2]; HEAP32[($4_1 + Math_imul($15_1, 20) | 0) + 8 >> 2] = $3; $4_1 = $4_1 + Math_imul($8_1, 20) | 0; } HEAP32[$4_1 + 8 >> 2] = $3; break block248; } $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = $7_1 + 280 | 0; $9_1 = $1070($3, 1, 0, 1); $1070($3, 2, $8_1, 0); $326($18_1, 9, 0, $4_1); $3 = HEAP32[$18_1 + 108 >> 2]; $4_1 = 82740; $6_1 = HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0]; HEAP32[($6_1 ? $4_1 : HEAP32[$18_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $3; } $4_1 = 82740; HEAP32[($6_1 & 255 ? $4_1 : HEAP32[$18_1 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = $3; $858($18_1, 146, $32_1); if (HEAP32[$5_1 + 8 >> 2]) { $4_1 = HEAP32[$5_1 + 88 >> 2]; if ($4_1) { $326($18_1, 71, 1, $4_1); $326($18_1, 71, 0, HEAP32[$5_1 + 92 >> 2]); } $4_1 = HEAP32[$18_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$18_1 >> 2] + 87 | 0] ? $3 : HEAP32[$18_1 + 104 >> 2] + Math_imul($13_1, 20) | 0) + 4 >> 2] = $4_1; $858($18_1, 67, $35_1); } $4_1 = 0; $326($16_1, 9, 0, $19_1); $1013($16_1, $20_1); HEAP32[$7_1 + 236 >> 2] = 0; $1033($0_1, $1_1, -1, $7_1 + 208 | 0, $7_1 + 248 | 0, $2_1, $21_1, $19_1); $1013($16_1, $21_1); $858($16_1, 67, $26_1); $1013($16_1, $19_1); } if (HEAPU8[$7_1 + 249 | 0] == 3) { HEAP32[$7_1 + 80 >> 2] = 18965; $1032($0_1, 0, 7379, $7_1 + 80 | 0); } $5_1 = HEAP32[$7_1 + 208 >> 2]; if ($5_1) { $9_1 = HEAP32[$37_1 >> 2]; $22_1 = HEAP32[$7_1 + 232 >> 2]; $12_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $12_1; $3 = HEAP32[$5_1 >> 2]; $5_1 = HEAP32[$7_1 + 212 >> 2]; $23_1 = $3 - $5_1 | 0; $13_1 = HEAP32[$1_1 + 28 >> 2]; $14 = HEAP32[$0_1 + 8 >> 2]; $21_1 = HEAP32[$2_1 + 4 >> 2]; $20_1 = HEAPU8[$2_1 | 0]; block265 : { if (!(!!$5_1 & ($23_1 | 0) != 1)) { HEAP32[$7_1 + 48 >> 2] = $5_1 ? 30615 : 30822; $1032($0_1, 0, 18641, $7_1 + 48 | 0); break block265; } HEAP32[$7_1 + 64 >> 2] = $23_1; $1032($0_1, 0, 18672, $7_1 - -64 | 0); } $5_1 = HEAP32[$7_1 + 224 >> 2]; if ($5_1) { $326($14, 10, HEAP32[$7_1 + 220 >> 2], $5_1); $863($14, $22_1); $1013($14, HEAP32[$7_1 + 224 >> 2]); } $6_1 = HEAP32[$7_1 + 216 >> 2]; block270 : { block269 : { block267 : { block268 : { switch ($20_1 - 9 | 0) { case 0: case 4: break block267; case 1: break block268; default: break block269; }; } if (!HEAP32[$1_1 + 12 >> 2]) { break block267 } $326($14, 75, 0, HEAP32[$2_1 + 12 >> 2]); } $29_1 = 0; $15_1 = HEAP32[$2_1 + 12 >> 2]; break block270; } $29_1 = $893($0_1); if (($20_1 & 253) == 12) { $9_1 = 0; $15_1 = $893($0_1); break block270; } $15_1 = $1060($0_1, $9_1); } $33_1 = 1; block277 : { if (HEAP8[$7_1 + 240 | 0] & 1) { $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $5_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $5_1 + 1; if (HEAP32[$7_1 + 224 >> 2]) { $3 = $857($14, 15) } else { $3 = 0 } $835($14, 121, $5_1, $11_1, ($9_1 + $23_1 | 0) + 1 | 0); if ($3) { $1_1 = HEAP32[$14 + 108 >> 2]; $8_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $8_1 : HEAP32[$14 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = $1_1; } $10_1 = $326($14, 34, $6_1, $22_1); $835($14, 133, $6_1, $11_1, $5_1); $33_1 = 0; break block277; } $10_1 = $326($14, 35, $6_1, $22_1); $1036($14, HEAP32[$1_1 + 12 >> 2], $12_1); if (HEAP32[$1_1 + 12 >> 2] > 0) { $326($14, 86, HEAP32[$1_1 + 8 >> 2], -1) } $5_1 = $6_1; } $11_1 = $13_1 + 8 | 0; $3 = 0; $13_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $8_1 = $23_1 + $33_1 | 0; $1_1 = $8_1 - 1 | 0; while (1) { if (($3 | 0) == ($13_1 | 0)) { $3 = $9_1; while (1) { if (!(($3 | 0) <= 0)) { $3 = $3 - 1 | 0; $13_1 = HEAPU16[($11_1 + ($3 << 4) | 0) + 12 >> 1]; $835($14, 94, $5_1, $13_1 ? $13_1 - 1 | 0 : $1_1, $3 + $15_1 | 0); $1_1 = $1_1 - !$13_1 | 0; continue; } break; }; $3 = $10_1 + 1 | 0; block288 : { block289 : { block283 : { block282 : { block285 : { switch ($20_1 - 9 | 0) { case 3: case 5: $835($14, 94, $5_1, $8_1, $15_1); $326($14, 127, $21_1, $29_1); $835($14, 128, $21_1, $15_1, $29_1); $1_1 = HEAP32[$14 + 108 >> 2]; if (($1_1 | 0) <= 0) { break block282 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 8; break block282; case 6: $2_1 = HEAP32[$2_1 + 8 >> 2]; $1_1 = $2_1 >>> 31 | 0; $5_1 = $1_1 + $15_1 | 0; $9_1 = $9_1 - $1_1 | 0; $1_1 = $893($0_1); $835($14, 97, $5_1, $9_1, $1_1); if (($2_1 | 0) < 0) { $835($14, 128, $21_1, $1_1, $15_1); break block282; } $312($14, 138, $21_1, $1_1, $15_1, $2_1); break block282; case 0: $326($14, 84, HEAP32[$2_1 + 12 >> 2], $9_1); break block282; case 1: break block282; case 2: break block283; default: break block285; }; } $858($14, 12, HEAP32[$2_1 + 4 >> 2]); } if (!$29_1) { break block288 } $894($0_1, $15_1); break block289; } $859($14, 97, $15_1, $9_1, $29_1, HEAP32[$2_1 + 20 >> 2], $9_1); $312($14, 138, $21_1, $29_1, $15_1, $9_1); if (!$29_1) { break block288 } $1061($0_1, $15_1, $9_1); } $894($0_1, $29_1); } $1013($14, $12_1); $326($14, HEAP8[$7_1 + 240 | 0] & 1 ? 37 : 39, $6_1, $3); $1_1 = HEAP32[$7_1 + 220 >> 2]; if ($1_1) { $858($14, 67, $1_1) } $1013($14, $22_1); } else { $1_1 = !HEAPU16[($11_1 + ($3 << 4) | 0) + 12 >> 1] + $1_1 | 0; $3 = $3 + 1 | 0; continue; } break; }; } $1013($16_1, $25); $3 = HEAP32[$0_1 + 40 >> 2] > 0; break block3; } $3 = 1; break block3; } $11_1 = HEAP32[$0_1 + 264 >> 2]; HEAP32[$0_1 + 264 >> 2] = HEAP32[$12_1 >> 2]; $8_1 = HEAP32[$1_1 + 4 >> 2]; block298 : { block295 : { block296 : { $5_1 = (HEAPU8[$12_1 + 13 | 0] | HEAPU8[$12_1 + 14 | 0] << 8) & 512; block292 : { block291 : { if (!$5_1) { break block291 } $3 = HEAP32[$12_1 + 36 >> 2]; $4_1 = HEAPU8[$3 + 18 | 0]; if (!$4_1) { break block292 } if (($4_1 | 0) == 2) { break block291 } if (HEAP32[$3 >> 2] > 1) { break block292 } } block293 : { if (HEAPU8[$6_1 + 20 | 0] & 64 | HEAPU8[HEAP32[$0_1 >> 2] + 83 | 0] & 2) { break block293 } $4_1 = HEAP32[$6_1 >> 2]; if ($1072($6_1, $12_1, $13_1 + 1 | 0, $4_1)) { break block293 } if (!$13_1) { if (HEAPU8[$6_1 + 68 | 0] & 2 | ($4_1 | 0) == 1) { break block295 } if ($8_1 & 268435456) { break block293 } break block295; } $10_1 = $13_1; $3 = $12_1; if ($8_1 & 268435456) { break block293 } while (1) { if (HEAPU8[$3 + 12 | 0] & 34) { break block293 } if (!$10_1) { break block295 } $10_1 = $10_1 - 1 | 0; $4_1 = $3 - 35 | 0; $3 = $3 - 48 | 0; if (!(HEAPU8[$4_1 | 0] & 4)) { continue } break; }; } if (!$5_1) { break block296 } $3 = HEAP32[$12_1 + 36 >> 2]; } $4_1 = HEAP32[$3 + 4 >> 2]; if (($4_1 | 0) <= 0) { break block296 } $326($16_1, 10, HEAP32[$3 + 8 >> 2], $4_1); $5_1 = HEAP32[$12_1 + 16 >> 2]; $4_1 = HEAP32[$3 + 12 >> 2]; if (($5_1 | 0) != ($4_1 | 0)) { $326($16_1, 114, $5_1, $4_1) } HEAP16[$26_1 + 2 >> 1] = HEAPU16[$3 + 16 >> 1]; break block298; } $3 = $1072($6_1, $12_1, 0, $13_1); if ($3) { $5_1 = HEAP32[$3 + 44 >> 2]; $4_1 = HEAP32[$5_1 + 4 >> 2]; if ($4_1) { $326($16_1, 10, HEAP32[$5_1 + 8 >> 2], $4_1) } $326($16_1, 114, HEAP32[$12_1 + 16 >> 2], HEAP32[$3 + 16 >> 2]); HEAP16[$26_1 + 2 >> 1] = HEAPU16[HEAP32[$5_1 >> 2] + 2 >> 1]; break block298; } $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; HEAP32[$25 + 8 >> 2] = $4_1; $9_1 = $857($16_1, 9); $8_1 = $9_1 + 1 | 0; HEAP32[$25 + 4 >> 2] = $8_1; $5_1 = HEAPU8[$12_1 + 13 | 0] | HEAPU8[$12_1 + 14 | 0] << 8; $4_1 = $5_1 | 32; HEAP8[$12_1 + 13 | 0] = $4_1; HEAP8[$12_1 + 14 | 0] = $4_1 >>> 8; $3 = 0; if (!($5_1 & 16)) { $3 = $857($16_1, 15) } HEAP32[$7_1 + 284 >> 2] = HEAP32[$12_1 + 16 >> 2]; HEAP8[$7_1 + 280 | 0] = 12; $4_1 = $15_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$15_1 >> 2] = 0; HEAP32[$15_1 + 4 >> 2] = 0; HEAP32[$7_1 + 32 >> 2] = $12_1; $1032($0_1, 1, 19485, $7_1 + 32 | 0); $974($0_1, $26_1, $7_1 + 280 | 0); HEAP16[HEAP32[$12_1 + 8 >> 2] + 38 >> 1] = HEAPU16[$26_1 + 2 >> 1]; if ($3) { $14 = 82740; HEAP32[(HEAPU8[HEAP32[$16_1 >> 2] + 87 | 0] ? $14 : HEAP32[$16_1 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = HEAP32[$16_1 + 108 >> 2]; } $326($16_1, 67, HEAP32[$25 + 8 >> 2], $8_1); $4_1 = HEAP32[$16_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$16_1 >> 2] + 87 | 0] ? $3 : HEAP32[$16_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $4_1; HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; if (((HEAPU8[$12_1 + 13 | 0] | HEAPU8[$12_1 + 14 | 0] << 8) & 528) != 512) { break block298 } $4_1 = HEAP32[$12_1 + 36 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$25 + 4 >> 2]; HEAP32[$4_1 + 8 >> 2] = HEAP32[$25 + 8 >> 2]; HEAP32[$4_1 + 12 >> 2] = HEAP32[$12_1 + 16 >> 2]; HEAP16[$4_1 + 16 >> 1] = HEAPU16[$26_1 + 2 >> 1]; break block298; } $5_1 = HEAP32[$16_1 + 108 >> 2]; $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; HEAP32[$25 + 8 >> 2] = $4_1; $3 = $4_1; $4_1 = $5_1 + 1 | 0; $835($16_1, 11, $3, 0, $4_1); HEAP32[$25 + 4 >> 2] = $4_1; HEAP32[$7_1 + 284 >> 2] = HEAP32[$25 + 8 >> 2]; HEAP8[$7_1 + 280 | 0] = 13; $4_1 = $15_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$15_1 >> 2] = 0; HEAP32[$15_1 + 4 >> 2] = 0; HEAP32[$7_1 + 16 >> 2] = $12_1; $1032($0_1, 1, 19501, $7_1 + 16 | 0); $974($0_1, $26_1, $7_1 + 280 | 0); HEAP16[HEAP32[$12_1 + 8 >> 2] + 38 >> 1] = HEAPU16[$26_1 + 2 >> 1]; $4_1 = HEAPU8[$12_1 + 13 | 0] | HEAPU8[$12_1 + 14 | 0] << 8 | 64; HEAP8[$12_1 + 13 | 0] = $4_1; HEAP8[$12_1 + 14 | 0] = $4_1 >>> 8; HEAP32[$25 + 12 >> 2] = HEAP32[$7_1 + 292 >> 2]; $997($16_1, HEAP32[$25 + 8 >> 2]); $3 = 82740; HEAP32[(HEAPU8[HEAP32[$16_1 >> 2] + 87 | 0] ? $3 : HEAP32[$16_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = HEAP32[$16_1 + 108 >> 2]; HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; } if (HEAPU8[$28_1 + 87 | 0]) { break block10 } $4_1 = $1040($1_1); HEAP32[$0_1 + 264 >> 2] = $11_1; HEAP32[$0_1 + 232 >> 2] = HEAP32[$0_1 + 232 >> 2] - $4_1; } $13_1 = $13_1 + 1 | 0; continue; }; } if (!HEAP32[$11_1 + 52 >> 2]) { $1032($0_1, 1, 18476, 0); $1032($0_1, 1, 18457, 0); } block312 : { block309 : { switch (HEAPU8[$1_1 | 0] - 135 | 0) { case 1: $15_1 = 0; HEAP32[$7_1 + 280 >> 2] = 0; HEAP32[$11_1 + 8 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$11_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2]; HEAP32[$11_1 + 60 >> 2] = HEAP32[$1_1 + 60 >> 2]; $3 = $974($0_1, $11_1, $7_1 + 248 | 0); HEAP32[$11_1 + 60 >> 2] = 0; if ($3) { break block51 } HEAP32[$1_1 + 52 >> 2] = 0; $5_1 = HEAP32[$11_1 + 8 >> 2]; HEAP32[$1_1 + 8 >> 2] = $5_1; HEAP32[$1_1 + 12 >> 2] = HEAP32[$11_1 + 12 >> 2]; $4_1 = 0; block310 : { if (!$5_1) { break block310 } $4_1 = $858($14, 17, $5_1); $5_1 = HEAP32[$1_1 + 12 >> 2]; if (!$5_1) { break block310 } $835($14, 160, HEAP32[$1_1 + 8 >> 2], $5_1 + 1 | 0, $5_1); } $1032($0_1, 1, 20320, 0); $3 = $974($0_1, $1_1, $7_1 + 248 | 0); $15_1 = HEAP32[$1_1 + 52 >> 2]; HEAP32[$1_1 + 52 >> 2] = $11_1; HEAP16[$1_1 + 2 >> 1] = $1073(HEAP16[$1_1 + 2 >> 1], HEAP16[$11_1 + 2 >> 1]); $5_1 = HEAP32[$1_1 + 60 >> 2]; block311 : { if (!$5_1) { break block311 } if (!$1074(HEAP32[$5_1 + 12 >> 2], $7_1 + 280 | 0, $0_1)) { break block311 } $5_1 = HEAP32[$7_1 + 280 >> 2]; if (($5_1 | 0) <= 0) { break block311 } $6_1 = HEAP16[$1_1 + 2 >> 1]; $5_1 = $433($5_1, 0); if (($6_1 | 0) <= ($5_1 | 0)) { break block311 } HEAP16[$1_1 + 2 >> 1] = $5_1; } if (!$4_1) { break block312 } $5_1 = HEAP32[$14 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $6_1 : HEAP32[$14 + 104 >> 2] + Math_imul($4_1, 20) | 0) + 8 >> 2] = $5_1; break block312; case 0: case 2: block315 : { if (($5_1 | 0) == 1) { $4_1 = HEAP32[$7_1 + 252 >> 2]; break block315; } $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $4_1 + 1; HEAP32[$1_1 + 20 >> 2] = $326($14, 117, $4_1, 0); $3 = $1075($1_1); HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] | 32; } $3 = $7_1 + 296 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = $4_1; HEAP8[$7_1 + 280 | 0] = 1; $9_1 = $7_1 + 280 | 0; $3 = $974($0_1, $11_1, $9_1); if ($3) { break block52 } HEAP32[$1_1 + 52 >> 2] = 0; $6_1 = HEAP32[$1_1 + 60 >> 2]; HEAP32[$1_1 + 60 >> 2] = 0; $3 = HEAPU8[$1_1 | 0]; HEAP8[$7_1 + 280 | 0] = ($3 | 0) == 137 ? 2 : 1; HEAP32[$7_1 + 144 >> 2] = $1076($3); $1032($0_1, 1, 20507, $7_1 + 144 | 0); $3 = $974($0_1, $1_1, $9_1); HEAP32[$1_1 + 48 >> 2] = 0; $15_1 = HEAP32[$1_1 + 52 >> 2]; HEAP32[$1_1 + 52 >> 2] = $11_1; if (HEAPU8[$1_1 | 0] == 135) { HEAP16[$1_1 + 2 >> 1] = $1073(HEAP16[$1_1 + 2 >> 1], HEAP16[$11_1 + 2 >> 1]) } $11($20_1, HEAP32[$1_1 + 60 >> 2]); HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 60 >> 2] = $6_1; if (HEAPU8[$20_1 + 87 | 0] | ($5_1 | 0) == 1) { break block312 } $5_1 = HEAP32[$0_1 + 60 >> 2]; $6_1 = $5_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $6_1; $8_1 = $5_1 - 1 | 0; $1034($0_1, $1_1, $8_1); $326($14, 36, $4_1, $8_1); $5_1 = HEAP32[$14 + 108 >> 2]; $1033($0_1, $1_1, $4_1, 0, 0, $7_1 + 248 | 0, $6_1, $8_1); $1013($14, $6_1); $326($14, 39, $4_1, $5_1); $1013($14, $8_1); $326($14, 122, $4_1, 0); break block312; default: break block309; }; } $10_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $10_1 + 2; $15_1 = 0; HEAP32[$1_1 + 20 >> 2] = $326($14, 117, $10_1, 0); $4_1 = $1075($1_1); HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 32; $4_1 = $7_1 + 296 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = $10_1; HEAP8[$7_1 + 280 | 0] = 1; $6_1 = $7_1 + 280 | 0; $3 = $974($0_1, $11_1, $6_1); if ($3) { break block51 } $9_1 = $10_1 + 1 | 0; $4_1 = $326($14, 117, $9_1, 0); HEAP32[$1_1 + 52 >> 2] = 0; HEAP32[$1_1 + 24 >> 2] = $4_1; $5_1 = HEAP32[$1_1 + 60 >> 2]; HEAP32[$1_1 + 60 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = $9_1; HEAP32[$7_1 + 128 >> 2] = $1076(HEAPU8[$1_1 | 0]); $1032($0_1, 1, 20507, $7_1 + 128 | 0); $3 = $974($0_1, $1_1, $6_1); $15_1 = HEAP32[$1_1 + 52 >> 2]; HEAP32[$1_1 + 52 >> 2] = $11_1; $4_1 = HEAP16[$11_1 + 2 >> 1]; if (($4_1 | 0) < HEAP16[$1_1 + 2 >> 1]) { HEAP16[$1_1 + 2 >> 1] = $4_1 } $11($20_1, HEAP32[$1_1 + 60 >> 2]); HEAP32[$1_1 + 60 >> 2] = $5_1; if ($3) { break block312 } $4_1 = HEAP32[$0_1 + 60 >> 2]; $8_1 = $4_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $8_1; $6_1 = $4_1 - 1 | 0; $1034($0_1, $1_1, $6_1); $326($14, 36, $10_1, $6_1); $5_1 = $893($0_1); $4_1 = $326($14, 134, $10_1, $5_1); $312($14, 28, $9_1, $8_1, $5_1, 0); $894($0_1, $5_1); $1033($0_1, $1_1, $10_1, 0, 0, $7_1 + 248 | 0, $8_1, $6_1); $1013($14, $8_1); $326($14, 39, $10_1, $4_1); $1013($14, $6_1); $326($14, 122, $9_1, 0); $326($14, 122, $10_1, 0); } if (HEAP32[$1_1 + 56 >> 2]) { break block70 } $1077($0_1); } if (HEAP32[$0_1 + 40 >> 2] | !(HEAPU8[$1_1 + 4 | 0] & 32)) { break block51 } $10_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]; $11_1 = $1078($20_1, $10_1, 1); if (!$11_1) { $3 = 7; break block51; } $4_1 = 0; $6_1 = ($10_1 | 0) > 0 ? $10_1 : 0; $8_1 = $11_1 + 20 | 0; while (1) { block320 : { if (($4_1 | 0) == ($6_1 | 0)) { $9_1 = $1_1; break block320; } $5_1 = $1079($0_1, $1_1, $4_1); HEAP32[$8_1 >> 2] = $5_1; if (!$5_1) { HEAP32[$8_1 >> 2] = HEAP32[$20_1 + 8 >> 2] } $8_1 = $8_1 + 4 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; while (1) { block323 : { if ($9_1) { $6_1 = $9_1 + 20 | 0; $4_1 = 0; while (1) { if (($4_1 | 0) == 2) { break block323 } $5_1 = $6_1 + ($4_1 << 2) | 0; $8_1 = HEAP32[$5_1 >> 2]; if (($8_1 | 0) < 0) { break block323 } $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $10_1; HEAP32[$11_1 >> 2] = HEAP32[$11_1 >> 2] + 1; $315($14, $8_1, $11_1, -8); HEAP32[$5_1 >> 2] = -1; $4_1 = $4_1 + 1 | 0; continue; }; } $643($11_1); break block51; } $9_1 = HEAP32[$9_1 + 52 >> 2]; continue; }; } $5_1 = 0; $22_1 = $325($25, ($13_1 << 2) + 4 | 0, 0); if ($22_1) { HEAP32[$22_1 >> 2] = $13_1; $4_1 = $15_1 + 8 | 0; $6_1 = (($13_1 | 0) > 0 ? $13_1 : 0) + 1 | 0; $3 = 1; while (1) { if (!(($3 | 0) == ($6_1 | 0))) { HEAP32[$22_1 + ($3 << 2) >> 2] = HEAPU16[$4_1 + 12 >> 1] - 1; $4_1 = $4_1 + 16 | 0; $3 = $3 + 1 | 0; continue; } break; }; $33_1 = $1035($0_1, $1_1); } else { $33_1 = 0 } $11_1 = $9_1 - 1 | 0; $10_1 = 0; block329 : { if (($31_1 | 0) != 136) { $10_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; $4_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]; HEAP32[$0_1 + 48 >> 2] = $10_1 + $4_1; $326($19_1, 71, 0, $10_1); block328 : { $5_1 = $1078($25, $4_1, 1); if (!$5_1) { break block328 } $6_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $4_1 = $5_1 + 20 | 0; $3 = 0; while (1) { if (($3 | 0) == ($6_1 | 0)) { break block328 } HEAP32[$4_1 + ($3 << 2) >> 2] = $1079($0_1, $1_1, $3); HEAP8[HEAP32[$5_1 + 16 >> 2] + $3 | 0] = 0; $3 = $3 + 1 | 0; continue; }; } $3 = 0; $4_1 = $1_1; if (($31_1 + 121 & 255) >>> 0 > 1) { break block329 } } $3 = 1; block330 : { if (HEAPU8[$25 + 82 | 0] & 32) { break block330 } $4_1 = $1_1; while (1) { $6_1 = HEAP32[$4_1 + 52 >> 2]; if (!(!$6_1 | ($31_1 | 0) != HEAPU8[$4_1 | 0])) { $3 = $3 + 1 | 0; $4_1 = $6_1; continue; } break; }; if ($3 >>> 0 < 4) { $3 = 1; break block330; } $8_1 = 2; $4_1 = $1_1; while (1) if ($3 >>> 0 <= $8_1 >>> 0) { $3 = 1; break block329; } else { $8_1 = $8_1 + 2 | 0; $4_1 = HEAP32[$4_1 + 52 >> 2]; continue; }; } $4_1 = $1_1; } $24_1 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$4_1 + 52 >> 2] = 0; HEAP32[$24_1 + 56 >> 2] = 0; HEAP32[$24_1 + 48 >> 2] = $887(HEAP32[$0_1 >> 2], $15_1, 0); $1080($0_1, $1_1, HEAP32[$1_1 + 48 >> 2], 19657); $1080($0_1, $24_1, HEAP32[$24_1 + 48 >> 2], 19657); $1034($0_1, $1_1, $11_1); $20_1 = 0; $8_1 = 0; block334 : { if (($31_1 | 0) != 136) { break block334 } $12_1 = HEAP32[$1_1 + 8 >> 2]; if (!$12_1) { break block334 } $9_1 = HEAP32[$0_1 + 48 >> 2]; $8_1 = $9_1 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $8_1; $6_1 = HEAP32[$1_1 + 12 >> 2]; $20_1 = $9_1 + 1 | 0; $326($19_1, 80, $6_1 ? $6_1 + 1 | 0 : $12_1, $20_1); $326($19_1, 80, $20_1, $8_1); } $11($25, HEAP32[$1_1 + 60 >> 2]); HEAP32[$1_1 + 60 >> 2] = 0; $9_1 = HEAP32[$0_1 + 48 >> 2]; $23_1 = $9_1 + 4 | 0; HEAP32[$0_1 + 48 >> 2] = $23_1; $14 = $7_1 + 280 | 0; $6_1 = $14 + 16 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $7_1 + 352 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$7_1 + 288 >> 2] = 0; HEAP32[$7_1 + 292 >> 2] = 0; $26_1 = $9_1 + 1 | 0; HEAP32[$7_1 + 284 >> 2] = $26_1; HEAP8[$7_1 + 280 | 0] = 13; HEAP32[$7_1 + 344 >> 2] = 0; HEAP32[$7_1 + 348 >> 2] = 0; $15_1 = $9_1 + 2 | 0; HEAP32[$7_1 + 340 >> 2] = $15_1; HEAP8[$7_1 + 336 | 0] = 13; HEAP32[$7_1 + 160 >> 2] = $1076(HEAPU8[$1_1 | 0]); $1032($0_1, 1, 25477, $7_1 + 160 | 0); $6_1 = $835($19_1, 11, $26_1, 0, HEAP32[$19_1 + 108 >> 2] + 1 | 0); HEAP32[$24_1 + 8 >> 2] = $20_1; $1032($0_1, 1, 18960, 0); $974($0_1, $24_1, $14); $997($19_1, $26_1); $20_1 = $9_1 + 3 | 0; $9_1 = HEAP32[$19_1 + 108 >> 2]; $14 = 82740; HEAP32[(HEAPU8[HEAP32[$19_1 >> 2] + 87 | 0] ? $14 : HEAP32[$19_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) + 8 >> 2] = $9_1; $14 = 0; $12_1 = $835($19_1, 11, $15_1, 0, $9_1 + 1 | 0); $9_1 = HEAP32[$1_1 + 8 >> 2]; $6_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = $8_1; $1032($0_1, 1, 18941, 0); $8_1 = $7_1 + 336 | 0; $974($0_1, $1_1, $8_1); HEAP32[$1_1 + 8 >> 2] = $9_1; HEAP32[$1_1 + 12 >> 2] = $6_1; $997($19_1, $15_1); $9_1 = $1081($0_1, $1_1, $7_1 + 280 | 0, $2_1, $20_1, $10_1, $5_1, $11_1); if ($3) { $14 = $1081($0_1, $1_1, $8_1, $2_1, $23_1, $10_1, $5_1, $11_1) } $643($5_1); block339 : { block338 : { if (($31_1 + 119 & 255) >>> 0 >= 2) { $5_1 = $326($19_1, 10, $23_1, $14); $8_1 = $326($19_1, 12, $15_1, $11_1); $863($19_1, $5_1); HEAP16[$1_1 + 2 >> 1] = $1073(HEAP16[$1_1 + 2 >> 1], HEAP16[$24_1 + 2 >> 1]); break block338; } $5_1 = $11_1; $8_1 = $5_1; if (($31_1 | 0) != 138) { break block338 } $2_1 = $5_1; $6_1 = HEAP16[$24_1 + 2 >> 1]; if (($6_1 | 0) >= HEAP16[$1_1 + 2 >> 1]) { break block339 } HEAP16[$1_1 + 2 >> 1] = $6_1; break block339; } $2_1 = $326($19_1, 10, $20_1, $9_1); $326($19_1, 12, $26_1, $11_1); $863($19_1, $2_1); } $6_1 = $326($19_1, 10, $20_1, $9_1); $326($19_1, 12, $26_1, $5_1); $863($19_1, $21_1); block343 : { block341 : { if (($31_1 | 0) == 136) { $5_1 = $6_1; break block341; } if (($31_1 | 0) == 138) { $5_1 = $6_1; $6_1 = $5_1 + 1 | 0; break block343; } $5_1 = $326($19_1, 12, $26_1, $5_1); $863($19_1, $21_1); } } $9_1 = $6_1; $10_1 = HEAP32[$19_1 + 108 >> 2]; if ($3) { $326($19_1, 10, $23_1, $14) } $326($19_1, 12, $15_1, $2_1); $863($19_1, $21_1); $6_1 = HEAP32[$19_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$19_1 >> 2] + 87 | 0] ? $3 : HEAP32[$19_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) + 8 >> 2] = $6_1; $326($19_1, 12, $26_1, $8_1); $326($19_1, 12, $15_1, $2_1); $1013($19_1, $21_1); $859($19_1, 89, 0, 0, 0, $22_1, -14); $859($19_1, 90, HEAP32[$7_1 + 292 >> 2], HEAP32[$7_1 + 348 >> 2], $13_1, $33_1, -8); $2_1 = HEAP32[$19_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$19_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 1 } $835($19_1, 14, $9_1, $5_1, $10_1); $1013($19_1, $11_1); $2_1 = HEAP32[$4_1 + 52 >> 2]; if ($2_1) { $1016($0_1, 57, $2_1) } HEAP32[$4_1 + 52 >> 2] = $24_1; HEAP32[$24_1 + 56 >> 2] = $4_1; $358($25, HEAP32[$24_1 + 48 >> 2]); HEAP32[$24_1 + 48 >> 2] = 0; $1077($0_1); $3 = HEAP32[$0_1 + 40 >> 2] != 0; break block77; } $15_1 = 0; } HEAP32[$2_1 + 12 >> 2] = HEAP32[$7_1 + 260 >> 2]; HEAP32[$2_1 + 16 >> 2] = HEAP32[$7_1 + 264 >> 2]; if (!$15_1) { break block77 } $1016($0_1, 57, $15_1); } if (!HEAP32[$1_1 + 56 >> 2]) { break block348 } break block; } $6_1 = HEAP32[$21_1 >> 2]; if (!$6_1) { break block45 } $3 = HEAP32[$4_1 + 4 >> 2]; if (!(HEAP32[$8_1 >> 2] > 1 | $30_1 ? !$10_1 : 1) | $3 & 1) { break block45 } $20_1 = HEAP32[$1_1 + 48 >> 2]; if (!(HEAP32[$4_1 + 48 >> 2] ? !$20_1 : 1) | !(HEAP32[$4_1 + 48 >> 2] ? !$30_1 : 1)) { break block45 } block353 : { if ($10_1) { if (HEAP32[$1_1 + 36 >> 2]) { break block45 } if (!($3 & 8192 | $15_1 & 1)) { break block353 } break block45; } if ($3 & 8192) { break block45 } } $27 = $9_1 + 8 | 0; $3 = HEAPU8[$27 + 12 | 0]; $25 = $3 & 96; block355 : { if (!$25) { $26_1 = 0; break block355; } if (HEAPU8[HEAP32[$21_1 + 16 >> 2] + 43 | 0] == 1 | ($6_1 | 0) > 1) { break block45 } $26_1 = 1; if ($3 & 16 | $15_1 & 1) { break block45 } } $11_1 = ($5_1 | 0) <= 0; if (!(HEAPU8[$21_1 + 20 | 0] & 64 ? $11_1 : 1)) { break block45 } $9_1 = 0; $10_1 = 0; block357 : { if (!HEAP32[$4_1 + 52 >> 2]) { break block357 } if (HEAP32[$4_1 + 48 >> 2] | $30_1) { break block45 } $6_1 = $4_1; if ($25 | $15_1 & 1) { break block45 } while (1) { if ($6_1) { if (HEAPU8[$6_1 + 4 | 0] & 9) { break block45 } $3 = HEAP32[$6_1 + 52 >> 2]; if (!!$3 & HEAPU8[$6_1 | 0] != 136) { break block45 } $10_1 = HEAP32[$6_1 + 32 >> 2]; if (HEAP32[$6_1 + 68 >> 2] | HEAP32[$10_1 >> 2] <= 0) { break block45 } $6_1 = $3; if (!(HEAPU8[$10_1 + 20 | 0] & 64) | $11_1) { continue } break block45; } break; }; block360 : { if (!$20_1) { break block360 } $6_1 = 0; $3 = HEAP32[$20_1 >> 2]; $11_1 = ($3 | 0) > 0 ? $3 : 0; $10_1 = $20_1 + 20 | 0; while (1) { if (($6_1 | 0) == ($11_1 | 0)) { break block360 } $3 = $6_1 << 4; $6_1 = $6_1 + 1 | 0; if (HEAPU16[$3 + $10_1 >> 1]) { continue } break; }; break block45; } if ($15_1 & 8192) { break block45 } $20_1 = HEAP32[$4_1 + 28 >> 2]; $11_1 = $20_1 + 8 | 0; $15_1 = 0; while (1) { if (($15_1 | 0) < HEAP32[$20_1 >> 2]) { $10_1 = $15_1 << 4; $3 = $971(HEAP32[$10_1 + $11_1 >> 2]); $6_1 = $4_1; while (1) { $6_1 = HEAP32[$6_1 + 52 >> 2]; if ($6_1) { if (($971(HEAP32[($10_1 + HEAP32[$6_1 + 28 >> 2] | 0) + 8 >> 2]) | 0) == ($3 | 0)) { continue } break block45; } break; }; $15_1 = $15_1 + 1 | 0; continue; } break; }; $10_1 = 0; if (HEAP32[$8_1 >> 2] < 2) { break block357 } if (HEAPU8[$12_1 + 82 | 0] & 128 | HEAP32[$0_1 + 112 >> 2] > 500) { break block45 } $6_1 = $12_1; $3 = HEAP32[$0_1 + 44 >> 2]; $11_1 = $3 >> 31 << 2 | $3 >>> 30; $3 = ($3 << 2) + 4 | 0; $11_1 = $3 >>> 0 < 4 ? $11_1 + 1 | 0 : $11_1; $3 = $270($6_1, $3, $11_1); if (!$3) { break block357 } HEAP32[$3 >> 2] = HEAP32[$0_1 + 44 >> 2]; $10_1 = $3; } HEAP32[$0_1 + 264 >> 2] = HEAP32[$27 >> 2]; $864($0_1, 21, 0, 0, 0); HEAP32[$0_1 + 264 >> 2] = $23_1; if (HEAPU8[$27 + 13 | 0] & 4) { $9_1 = $1039($12_1, $27) } $4_1 = $4_1 + 52 | 0; $10($12_1, HEAP32[$27 >> 2]); $10($12_1, HEAP32[$27 + 4 >> 2]); HEAP32[$27 >> 2] = 0; HEAP32[$27 + 4 >> 2] = 0; while (1) { $23_1 = HEAP32[$4_1 >> 2]; if ($23_1) { $3 = HEAP32[$1_1 + 52 >> 2]; $20_1 = HEAP32[$27 + 8 >> 2]; $11_1 = HEAP32[$1_1 + 60 >> 2]; $6_1 = HEAP32[$1_1 + 48 >> 2]; HEAP32[$27 + 8 >> 2] = 0; HEAP32[$1_1 + 60 >> 2] = 0; HEAP32[$1_1 + 48 >> 2] = 0; HEAP32[$1_1 + 52 >> 2] = 0; $4_1 = $907($12_1, $1_1, 0); HEAP32[$1_1 + 48 >> 2] = $6_1; HEAP32[$1_1 + 60 >> 2] = $11_1; HEAP8[$1_1 | 0] = 136; HEAP32[$27 + 8 >> 2] = $20_1; block366 : { if (!$4_1) { $4_1 = $3; break block366; } $6_1 = HEAP32[$0_1 + 112 >> 2] + 1 | 0; HEAP32[$0_1 + 112 >> 2] = $6_1; HEAP32[$4_1 + 16 >> 2] = $6_1; if (!(HEAPU8[$12_1 + 87 | 0] | !$10_1)) { $1083($0_1, $10_1, HEAP32[$4_1 + 32 >> 2], $5_1); $14 = $7_1 + 280 | 0; $6_1 = $14 + 8 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$35_1 >> 2] = 0; HEAP32[$35_1 + 4 >> 2] = 0; HEAP32[$6_1 >> 2] = 46; HEAP32[$7_1 + 280 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = 0; HEAP32[$7_1 + 304 >> 2] = $10_1; HEAP32[$7_1 + 284 >> 2] = 58; $919($14, $4_1); } HEAP32[$4_1 + 52 >> 2] = $3; if ($3) { HEAP32[$3 + 56 >> 2] = $4_1 } HEAP32[$4_1 + 56 >> 2] = $1_1; } HEAP32[$1_1 + 52 >> 2] = $4_1; $4_1 = $23_1 + 52 | 0; continue; } break; }; $10($12_1, $10_1); block370 : { if (HEAPU8[$12_1 + 87 | 0]) { $973($0_1, $27, $9_1, 0); break block370; } $3 = HEAP32[$27 + 8 >> 2]; if ($3) { $4_1 = HEAP32[$3 + 24 >> 2]; block373 : { if (($4_1 | 0) == 1) { $4_1 = HEAP32[$0_1 + 132 >> 2]; $1016($4_1 ? $4_1 : $0_1, 59, $3); break block373; } HEAP32[$3 + 24 >> 2] = $4_1 - 1; } HEAP32[$27 + 8 >> 2] = 0; } $23_1 = $5_1 + 1 | 0; $20_1 = $24_1 | 12; $3 = $9_1; $10_1 = $1_1; while (1) { block374 : { if (!$10_1) { break block374 } $4_1 = ($8_1 + $24_1 | 0) + 20 | 0; $6_1 = HEAP32[$3 + 32 >> 2]; $11_1 = HEAP32[$6_1 >> 2]; $32_1 = 0; $32_1 = ($1_1 | 0) == ($10_1 | 0) ? HEAPU8[$27 + 12 | 0] : $32_1; $4_1 = HEAPU8[$4_1 | 0]; $8_1 = HEAP32[$10_1 + 32 >> 2]; if (($11_1 | 0) >= 2) { $8_1 = $1086($0_1, $8_1, $11_1 - 1 | 0, $23_1); if (!$8_1) { break block374 } HEAP32[$10_1 + 32 >> 2] = $8_1; } $14 = $4_1 & 64; $4_1 = 0; $15_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $31_1 = $8_1 + 8 | 0; $11_1 = $6_1 + 8 | 0; $21_1 = HEAP32[$6_1 + 24 >> 2]; while (1) { if (($4_1 | 0) != ($15_1 | 0)) { $19_1 = $31_1 + Math_imul($4_1 + $5_1 | 0, 48) | 0; if (HEAPU8[$19_1 + 14 | 0] & 8) { $12($12_1, HEAP32[$19_1 + 40 >> 2]) } $6_1 = $11_1 + Math_imul($4_1, 48) | 0; wasm2js_memory_copy($19_1, $6_1, 48); HEAP8[$19_1 + 12 | 0] = $14 | HEAPU8[$19_1 + 12 | 0]; wasm2js_memory_fill($6_1, 0, 48); $4_1 = $4_1 + 1 | 0; continue; } break; }; $4_1 = $20_1 + $31_1 | 0; HEAP8[$4_1 | 0] = $14 | (HEAPU8[$4_1 | 0] & 64 | $32_1); $14 = HEAP32[$3 + 48 >> 2]; if (!(!$14 | HEAPU8[$10_1 + 6 | 0] & 64)) { $4_1 = 0; $6_1 = HEAP32[$14 >> 2]; $11_1 = ($6_1 | 0) > 0 ? $6_1 : 0; $6_1 = $14 + 20 | 0; while (1) { if (!(($4_1 | 0) == ($11_1 | 0))) { HEAP16[$6_1 + ($4_1 << 4) >> 1] = 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP32[$10_1 + 48 >> 2] = $14; HEAP32[$3 + 48 >> 2] = 0; } $4_1 = HEAP32[$3 + 36 >> 2]; HEAP32[$3 + 36 >> 2] = 0; if ($25) { $1087($4_1, $21_1, 1) } if ($4_1) { $6_1 = HEAP32[$10_1 + 36 >> 2]; if ($6_1) { $4_1 = $903($0_1, 44, $4_1, $6_1) } HEAP32[$10_1 + 36 >> 2] = $4_1; } if (!HEAPU8[$12_1 + 87 | 0]) { HEAP32[$7_1 + 292 >> 2] = $26_1; HEAP32[$7_1 + 288 >> 2] = $21_1; HEAP32[$7_1 + 284 >> 2] = $22_1; HEAP32[$7_1 + 280 >> 2] = $0_1; HEAP32[$7_1 + 296 >> 2] = HEAP32[$3 + 28 >> 2]; HEAP32[$7_1 + 300 >> 2] = $1088($3); $1089($7_1 + 280 | 0, $10_1, 0); } HEAP32[$10_1 + 4 >> 2] = HEAP32[$10_1 + 4 >> 2] | HEAP32[$3 + 4 >> 2] & 256; $4_1 = HEAP32[$3 + 60 >> 2]; if ($4_1) { HEAP32[$10_1 + 60 >> 2] = $4_1; HEAP32[$3 + 60 >> 2] = 0; } $4_1 = 0; while (1) { if (($4_1 | 0) != ($15_1 | 0)) { $11_1 = $31_1 + Math_imul($4_1 + $5_1 | 0, 48) | 0; if (HEAP32[$11_1 + 8 >> 2]) { $14 = $7_1 + 280 | 0; $6_1 = $14 + 8 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$35_1 >> 2] = 0; HEAP32[$35_1 + 4 >> 2] = 0; HEAP32[$6_1 >> 2] = 46; HEAP32[$7_1 + 280 >> 2] = 0; HEAP32[$7_1 + 284 >> 2] = 0; HEAP32[$7_1 + 304 >> 2] = $11_1; HEAP32[$7_1 + 284 >> 2] = 60; HEAP32[$11_1 + 24 >> 2] = 0; HEAP32[$11_1 + 28 >> 2] = 0; $919($14, $10_1); } $4_1 = $4_1 + 1 | 0; continue; } break; }; $3 = HEAP32[$3 + 52 >> 2]; $10_1 = HEAP32[$10_1 + 52 >> 2]; continue; } break; }; HEAP32[$13_1 >> 2] = 0; HEAP32[$13_1 + 4 >> 2] = 0; $4_1 = $13_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$7_1 + 344 >> 2] = 46; HEAP32[$7_1 + 340 >> 2] = 47; HEAP32[$7_1 + 336 >> 2] = $0_1; $919($7_1 + 336 | 0, $9_1); $789($12_1, $9_1); } $5_1 = -1; if (HEAP32[$0_1 + 40 >> 2]) { break block10 } } if (HEAPU8[$28_1 + 87 | 0]) { break block10 } $6_1 = HEAP32[$1_1 + 32 >> 2]; if (HEAPU8[$2_1 | 0] < 9) { break block38 } HEAP32[$7_1 + 208 >> 2] = HEAP32[$1_1 + 48 >> 2]; } $3 = $5_1; } $5_1 = $3 + 1 | 0; continue; }; } $3 = 1; $4_1 = 0; } $358($28_1, $4_1); } $1077($0_1); } $0_1 = $7_1 + 368 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $975($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (HEAPU8[$1_1 + 5 | 0] & 2) { $257($0_1, 5233, 0); break block1; } HEAP32[$2_1 >> 2] = $1076(HEAPU8[$1_1 | 0]); $257($0_1, 5044, $2_1); } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $976($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $12_1 = $3 - 1 | 0; $3 = $1_1 + 8 | 0; $10_1 = $4_1 & 1; $11_1 = $10_1 ^ 81; $4_1 = HEAPU8[$0_1 + 23 | 0] ? $4_1 : $4_1 & 253; $13_1 = $4_1 & 2; $14 = $4_1 & 8; $15_1 = $4_1 & 4; $7_1 = HEAP32[$1_1 >> 2]; $6_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = 0; while (1) { if (!(($4_1 | 0) >= ($7_1 | 0))) { $1_1 = HEAP32[$3 >> 2]; block3 : { block1 : { if (!$15_1) { break block1 } $5_1 = HEAPU16[$3 + 12 >> 1]; if (!$5_1) { break block1 } if ($14) { $7_1 = $7_1 - 1 | 0; $4_1 = $4_1 - 1 | 0; break block3; } $326($6_1, $11_1, $5_1 + $12_1 | 0, $2_1 + $4_1 | 0); break block3; } block4 : { if (!$13_1) { break block4 } if (!$1174($0_1, $1_1)) { break block4 } $1175($0_1, $1_1, $2_1 + $4_1 | 0); break block3; } $5_1 = $2_1 + $4_1 | 0; $8_1 = $1129($0_1, $1_1, $5_1); if (($5_1 | 0) == ($8_1 | 0)) { break block3 } block5 : { if (!$10_1) { break block5 } $1_1 = 82740; if (!HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { $1_1 = (HEAP32[$6_1 + 104 >> 2] + Math_imul(HEAP32[$6_1 + 108 >> 2], 20) | 0) - 20 | 0 } if (HEAPU8[$1_1 | 0] != 80) { break block5 } $9_1 = HEAP32[$1_1 + 12 >> 2] + 1 | 0; if (HEAPU16[$1_1 + 2 >> 1] | (($8_1 | 0) != ($9_1 + HEAP32[$1_1 + 4 >> 2] | 0) | ($5_1 | 0) != (HEAP32[$1_1 + 8 >> 2] + $9_1 | 0))) { break block5 } HEAP32[$1_1 + 12 >> 2] = $9_1; break block3; } $326($6_1, $11_1, $8_1, $5_1); } $3 = $3 + 16 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; } function $977($0_1, $1_1, $2_1) { if ($1_1) { HEAP32[$1_1 + 64 >> 2] = $2_1; $945($0_1, $1_1); return $1_1; } $795(HEAP32[$0_1 >> 2], $2_1); return $1_1; } function $978($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 - 80 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $9_1 = HEAP32[$0_1 >> 2]; block : { if (HEAPU8[$9_1 + 87 | 0]) { break block } if ($318($0_1)) { break block } if ($3) { HEAP8[$9_1 + 91 | 0] = HEAPU8[$9_1 + 91 | 0] + 1 } $4_1 = $879($0_1, $2_1, $1_1 + 8 | 0); block3 : { if (!$3) { if (!$4_1) { break block } break block3; } HEAP8[$9_1 + 91 | 0] = HEAPU8[$9_1 + 91 | 0] - 1; if ($4_1) { break block3 } $901($0_1, HEAP32[$1_1 + 52 >> 2]); $928($0_1); break block; } $7_1 = $309($9_1, HEAP32[$4_1 + 60 >> 2]); if (HEAPU8[$4_1 + 43 | 0] == 1) { if ($897($0_1, $4_1)) { break block } } $3 = ($7_1 | 0) == 1; $5_1 = HEAP32[HEAP32[$9_1 + 16 >> 2] + ($7_1 << 4) >> 2]; if ($864($0_1, 9, $3 ? 9304 : 9323, 0, $5_1)) { break block } block8 : { if ($2_1) { $3 = $3 ? 15 : 17 } else { if (HEAPU8[$4_1 + 43 | 0] == 1) { $3 = 30; $8_1 = HEAP32[HEAP32[$684($9_1, $4_1) + 4 >> 2] + 4 >> 2]; break block8; } $3 = ($7_1 | 0) == 1 ? 13 : 11; } $8_1 = 0; } if ($864($0_1, $3, HEAP32[$4_1 >> 2], $8_1, $5_1)) { break block } if ($864($0_1, 9, HEAP32[$4_1 >> 2], 0, $5_1)) { break block } block10 : { $5_1 = HEAP32[$4_1 >> 2]; block13 : { block11 : { if (!$68($5_1, 18315, 7)) { $3 = $5_1 + 7 | 0; if (!$68($3, 3606, 4)) { break block10 } $3 = $68($3, 4474, 10); break block11; } $3 = HEAP32[$4_1 + 28 >> 2]; if ($3 & 4096) { if ($916($9_1)) { break block13 } } $3 = $3 & 32768; } if (!$3) { break block10 } } HEAP32[$6_1 + 64 >> 2] = $5_1; $257($0_1, 15985, $6_1 - -64 | 0); break block; } $3 = HEAPU8[$4_1 + 43 | 0]; block15 : { if ($2_1) { if (($3 | 0) == 2) { break block15 } HEAP32[$6_1 + 48 >> 2] = $5_1; $257($0_1, 7050, $6_1 + 48 | 0); break block; } if (($3 | 0) != 2) { break block15 } HEAP32[$6_1 >> 2] = $5_1; $257($0_1, 6496, $6_1); break block; } if (!$856($0_1)) { break block } $923($0_1, 1, $7_1); block16 : { if ($2_1) { break block16 } $929($0_1, $7_1, 11869, HEAP32[$4_1 >> 2]); $8_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$4_1 + 43 | 0] | !(HEAPU8[$8_1 + 33 | 0] & 64)) { break block16 } $5_1 = $856($0_1); $3 = 0; if (!$1011($4_1)) { $3 = $4_1 + 48 | 0; while (1) { $3 = HEAP32[$3 >> 2]; if (!$3) { break block16 } if (!HEAPU8[$3 + 24 | 0]) { $3 = $3 + 4 | 0; if (!(HEAPU8[$8_1 + 34 | 0] & 8)) { continue } } break; }; $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $326($5_1, 49, 1, $3); } HEAP8[$0_1 + 165 | 0] = 1; $965($0_1, $909($8_1, $1_1, 0), 0); HEAP8[$0_1 + 165 | 0] = 0; if (!(HEAPU8[$8_1 + 34 | 0] & 8)) { $326($5_1, 49, 0, HEAP32[$5_1 + 108 >> 2] + 2 | 0); $1012($0_1, 787, 2, 0, -1, 4); } if (!$3) { break block16 } $1013($5_1, $3); } $8_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$8_1 + 16 >> 2]; $10_1 = $856($0_1); $923($0_1, 1, $7_1); $5_1 = $7_1 << 4; if (HEAPU8[$4_1 + 43 | 0] == 1) { $857($10_1, 170) } $5_1 = $3 + $5_1 | 0; $3 = $1014($0_1, $4_1); while (1) { if ($3) { $902($0_1, $3); $3 = HEAP32[$3 + 32 >> 2]; continue; } break; }; if (HEAPU8[$4_1 + 28 | 0] & 8) { $3 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 36 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$6_1 + 32 >> 2] = $3; $884($0_1, 19717, $6_1 + 32 | 0); } $3 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 20 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$6_1 + 16 >> 2] = $3; $884($0_1, 28225, $6_1 + 16 | 0); $3 = HEAPU8[$4_1 + 43 | 0]; block27 : { block24 : { if (!$2_1) { if (($3 & 255) == 1) { break block24 } $5_1 = $4_1 + 8 | 0; $12_1 = HEAP32[$4_1 + 20 >> 2]; $3 = 0; while (1) { $13_1 = $3 - 1 | 0; $3 = $13_1 >>> 0 >= $12_1 >>> 0 ? $12_1 : 0; $2_1 = $5_1; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $11_1 = HEAP32[$2_1 + 44 >> 2]; $3 = $11_1 >>> 0 > $13_1 >>> 0 ? $3 : $3 >>> 0 < $11_1 >>> 0 ? $11_1 : $3; $2_1 = $2_1 + 20 | 0; continue; } break; }; if ($3) { $930($0_1, $3, $309(HEAP32[$0_1 >> 2], HEAP32[$4_1 + 60 >> 2])); continue; } break; }; $3 = HEAPU8[$4_1 + 43 | 0]; } if (($3 & 255) != 1) { break block27 } } $859($10_1, 172, $7_1, 0, 0, HEAP32[$4_1 >> 2], 0); $2_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $0_1) + 21 | 0] = 1; } $859($10_1, 151, $7_1, 0, 0, HEAP32[$4_1 >> 2], 0); $924($0_1, $7_1); $0_1 = HEAP32[(HEAP32[$8_1 + 16 >> 2] + ($7_1 << 4) | 0) + 12 >> 2]; if (!(HEAPU8[$0_1 + 78 | 0] & 2)) { break block } $0_1 = $0_1 + 16 | 0; while (1) { $0_1 = HEAP32[$0_1 >> 2]; if ($0_1) { $2_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$2_1 + 43 | 0] != 2) { continue } $848($8_1, $2_1); continue; } break; }; $0_1 = HEAP32[(HEAP32[$8_1 + 16 >> 2] + ($7_1 << 4) | 0) + 12 >> 2]; HEAP16[$0_1 + 78 >> 1] = HEAPU16[$0_1 + 78 >> 1] & 65533; } $794($9_1, $1_1); $0_1 = $6_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $979($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (!$1_1) { break block } HEAP32[$2_1 + 28 >> 2] = 0; $3 = $2_1 + 20 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 61; HEAP32[$2_1 + 4 >> 2] = $0_1; $921($2_1 + 4 | 0, $1_1); $5_1 = $1_1 + 8 | 0; $3 = 0; while (1) { if (HEAP32[$1_1 >> 2] <= ($3 | 0)) { break block } $4_1 = ($3 << 4) + $5_1 | 0; if (!(HEAPU8[$4_1 + 9 | 0] & 3)) { $918($0_1, 0, HEAP32[$4_1 + 4 >> 2]) } $3 = $3 + 1 | 0; continue; }; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $980($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $12_1 = global$0 - 32 | 0; $5_1 = $12_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $14 = HEAP32[$0_1 >> 2]; $10_1 = HEAP32[$0_1 + 252 >> 2]; block : { if (!$10_1 | HEAPU8[$0_1 + 224 | 0] == 1) { break block } block2 : { if (!$1_1) { $9_1 = 1; $5_1 = HEAP16[$10_1 + 34 >> 1]; if (($5_1 | 0) <= 0) { break block } if (!$3) { break block2 } if (HEAP32[$3 >> 2] == 1) { break block2 } $4_1 = HEAP32[(HEAP32[$10_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) - 12 >> 2]; HEAP32[$12_1 + 20 >> 2] = $2_1; HEAP32[$12_1 + 16 >> 2] = $4_1; $257($0_1, 19115, $12_1 + 16 | 0); break block; } $9_1 = HEAP32[$1_1 >> 2]; if (!$3 | ($9_1 | 0) == HEAP32[$3 >> 2]) { break block2 } $257($0_1, 14352, 0); break block; } $6_1 = (HEAP32[$2_1 + 4 >> 2] + ($9_1 << 3) | 0) + 37 | 0; $5_1 = 0; block3 : { if (!$3) { break block3 } $11_1 = HEAP32[$3 >> 2]; $15_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $13_1 = $3 + 12 | 0; while (1) { if (($8_1 | 0) == ($15_1 | 0)) { break block3 } $11_1 = $48(HEAP32[$13_1 + ($8_1 << 4) >> 2]) + 1 | 0; $6_1 = $6_1 + $11_1 | 0; $5_1 = $11_1 >>> 0 > $6_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; $8_1 = $8_1 + 1 | 0; continue; }; } $5_1 = $270($14, $6_1, $5_1); if (!$5_1) { break block } HEAP32[$5_1 >> 2] = $10_1; $7_1 = HEAP32[$10_1 + 48 >> 2]; $11_1 = $5_1 + 36 | 0; $6_1 = $11_1 + ($9_1 << 3) | 0; HEAP32[$5_1 + 8 >> 2] = $6_1; HEAP32[$5_1 + 4 >> 2] = $7_1; if (HEAPU8[$0_1 + 224 | 0] >= 2) { $934($0_1, $6_1, $2_1) } $7_1 = HEAP32[$2_1 + 4 >> 2]; if ($7_1) { wasm2js_memory_copy($6_1, HEAP32[$2_1 >> 2], $7_1) } $7_1 = 0; HEAP8[HEAP32[$2_1 + 4 >> 2] + $6_1 | 0] = 0; $300($6_1); $15_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$5_1 + 20 >> 2] = $9_1; block8 : { block7 : { if ($1_1) { $13_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $17_1 = $1_1 + 12 | 0; while (1) { if (($7_1 | 0) == ($13_1 | 0)) { break block7 } $8_1 = 0; $2_1 = HEAP16[$10_1 + 34 >> 1]; $18_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $2_1 = ($7_1 << 4) + $17_1 | 0; while (1) { if (($8_1 | 0) == ($18_1 | 0)) { break block8 } $16_1 = HEAP32[$2_1 >> 2]; if ($67(HEAP32[HEAP32[$10_1 + 4 >> 2] + Math_imul($8_1, 12) >> 2], $16_1)) { $8_1 = $8_1 + 1 | 0; continue; } break; }; $2_1 = ($7_1 << 3) + $11_1 | 0; HEAP32[$2_1 >> 2] = $8_1; if (HEAPU8[$0_1 + 224 | 0] >= 2) { $918($0_1, $2_1, $16_1) } $7_1 = $7_1 + 1 | 0; continue; }; } HEAP32[$11_1 >> 2] = HEAP16[$10_1 + 34 >> 1] - 1; } block11 : { if (!$3) { break block11 } $6_1 = $6_1 + $15_1 | 0; $9_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $15_1 = $3 + 12 | 0; $8_1 = 0; while (1) { if (($8_1 | 0) == ($9_1 | 0)) { break block11 } $13_1 = $15_1 + ($8_1 << 4) | 0; $7_1 = HEAP32[$13_1 >> 2]; $2_1 = $48($7_1); $6_1 = $6_1 + 1 | 0; HEAP32[(($8_1 << 3) + $11_1 | 0) + 4 >> 2] = $6_1; if (HEAPU8[$0_1 + 224 | 0] >= 2) { $918($0_1, $6_1, $7_1); $7_1 = HEAP32[$13_1 >> 2]; } if ($2_1) { wasm2js_memory_copy($6_1, $7_1, $2_1) } $6_1 = $2_1 + $6_1 | 0; HEAP8[$6_1 | 0] = 0; $8_1 = $8_1 + 1 | 0; continue; }; } HEAP8[$5_1 + 25 | 0] = $4_1; HEAP8[$5_1 + 24 | 0] = 0; HEAP8[$5_1 + 26 | 0] = $4_1 >>> 8; $0_1 = $395(HEAP32[$10_1 + 60 >> 2] + 56 | 0, HEAP32[$5_1 + 8 >> 2], $5_1); if (($5_1 | 0) == ($0_1 | 0)) { $106($14); $7_1 = $5_1; break block; } if ($0_1) { HEAP32[$5_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 16 >> 2] = $5_1; } HEAP32[$10_1 + 48 >> 2] = $5_1; $7_1 = 0; break block; } HEAP32[$12_1 >> 2] = HEAP32[$2_1 >> 2]; $257($0_1, 10393, $12_1); $7_1 = $5_1; } $10($14, $7_1); $358($14, $1_1); $358($14, $3); $0_1 = $12_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $981($0_1, $1_1) { block : { $0_1 = HEAP32[$0_1 + 252 >> 2]; if (!$0_1 | HEAPU8[$0_1 + 43 | 0]) { break block } $0_1 = HEAP32[$0_1 + 48 >> 2]; if (!$0_1) { break block } HEAP8[$0_1 + 24 | 0] = $1_1; } } function $982($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 252 >> 2]; block2 : { if (!(HEAP8[HEAP32[HEAP32[(HEAP32[$5_1 + 16 >> 2] + (HEAPU8[$5_1 + 176 | 0] << 4) | 0) + 4 >> 2] + 4 >> 2] + 24 | 0] & 1 | (!$6_1 | HEAPU8[$0_1 + 224 | 0] == 1))) { $5_1 = $936($0_1, HEAP32[$6_1 + 16 >> 2], $1_1); HEAP32[$6_1 + 16 >> 2] = $5_1; if (HEAP32[$0_1 + 88 >> 2]) { $959($0_1, $5_1, $0_1 + 84 | 0, 1); break block2; } while (1) { $1_1 = HEAPU8[$2_1 + 1 | 0]; $2_1 = $2_1 + 1 | 0; if (HEAP8[$1_1 + 31424 | 0] & 1) { continue } break; }; while (1) { $1_1 = $3; $3 = $1_1 - 1 | 0; if (HEAP8[HEAPU8[$3 | 0] + 31424 | 0] & 1) { continue } break; }; HEAP32[$4_1 + 8 >> 2] = $2_1; HEAP32[$4_1 + 12 >> 2] = $1_1 - $2_1; $959($0_1, $5_1, $4_1 + 8 | 0, 1); break block2; } $11($5_1, $1_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $983($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $9_1 = global$0 - 16 | 0; $5_1 = $9_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 + 252 >> 2]; block : { if (!$6_1) { break block } $5_1 = HEAP32[$6_1 + 28 >> 2]; if ($5_1 & 4) { HEAP32[$9_1 >> 2] = HEAP32[$6_1 >> 2]; $257($0_1, 1305, $9_1); break block; } HEAP32[$6_1 + 28 >> 2] = $5_1 | 4; block3 : { if (!$1_1) { $5_1 = HEAP16[$6_1 + 34 >> 1] - 1 | 0; $10_1 = HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0; $1006($0_1, $10_1); $7_1 = 1; break block3; } $11_1 = HEAP32[$1_1 >> 2]; $13_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $14 = $1_1 + 8 | 0; $5_1 = -1; while (1) { block5 : { if (($12_1 | 0) != ($13_1 | 0)) { $8_1 = $1007(HEAP32[($12_1 << 4) + $14 >> 2]); $1008($8_1); if (HEAPU8[$8_1 | 0] != 60) { break block5 } $5_1 = 0; $7_1 = HEAP16[$6_1 + 34 >> 1]; $7_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $15_1 = HEAP32[$8_1 + 8 >> 2]; while (1) { if (($5_1 | 0) == ($7_1 | 0)) { $5_1 = $7_1; break block5; } $8_1 = HEAP32[$6_1 + 4 >> 2] + Math_imul($5_1, 12) | 0; if ($67($15_1, HEAP32[$8_1 >> 2])) { $5_1 = $5_1 + 1 | 0; continue; } else { $1006($0_1, $8_1); $10_1 = $8_1; break block5; } }; } $7_1 = ($11_1 | 0) == 1; break block3; } $12_1 = $12_1 + 1 | 0; continue; }; } if (!(!$7_1 | !$10_1 | (($4_1 | 0) == 1 | (HEAPU8[$10_1 + 4 | 0] & -16) != 64))) { if (!(!$1_1 | HEAPU8[$0_1 + 224 | 0] < 2)) { $918($0_1, $6_1 + 32 | 0, $1007(HEAP32[$1_1 + 8 >> 2])) } HEAP8[$6_1 + 42 | 0] = $2_1; HEAP16[$6_1 + 32 >> 1] = $5_1; HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] | $3 << 3; if ($1_1) { HEAP8[$0_1 + 222 | 0] = HEAPU8[$1_1 + 16 | 0] } $908($0_1, $1_1); break block; } if ($3) { $257($0_1, 18547, 0); break block; } $933($0_1, 0, 0, 0, $1_1, $2_1, 0, 0, $4_1, 0, 2); $1_1 = 0; } $358(HEAP32[$0_1 >> 2], $1_1); $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $984($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = global$0 - 16 | 0; $3 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $3; block7 : { block6 : { block3 : { $4_1 = HEAP32[$0_1 + 252 >> 2]; block : { if (!$4_1) { break block } if (HEAPU8[$0_1 + 224 | 0] == 1) { $257($0_1, 5126, 0); break block; } $6_1 = HEAP32[$4_1 + 4 >> 2] + Math_imul(HEAP16[$4_1 + 34 >> 1], 12) | 0; $7_1 = $6_1 - 12 | 0; block2 : { if (HEAPU16[$6_1 - 4 >> 1]) { break block2 } if (!$2_1) { break block3 } block5 : { switch (HEAP32[$2_1 + 4 >> 2] - 6 | 0) { case 0: if ($68(15809, HEAP32[$2_1 >> 2], 6)) { break block2 } $2_1 = 64; break block6; case 1: break block5; default: break block2; }; } if (!$68(11877, HEAP32[$2_1 >> 2], 7)) { break block3 } } HEAP32[$5_1 >> 2] = HEAP32[$7_1 >> 2]; $257($0_1, 29592, $5_1); } $2_1 = $1_1; break block7; } HEAP16[$4_1 + 36 >> 1] = HEAPU16[$4_1 + 36 >> 1] - 1; $2_1 = 32; } $8_1 = $6_1 - 2 | 0; $3 = HEAPU16[$8_1 >> 1]; HEAP16[$8_1 >> 1] = $2_1 | $3; HEAP32[$4_1 + 28 >> 2] = HEAP32[$4_1 + 28 >> 2] | $2_1; if ($3 & 1) { $1006($0_1, $7_1) } $2_1 = 0; $3 = 0; block9 : { if (!$1_1) { break block9 } $3 = HEAPU8[$1_1 | 0]; if (($3 | 0) == 60) { $1_1 = $903($0_1, 173, $1_1, 0); $3 = 0; if (!$1_1) { break block9 } $3 = HEAPU8[$1_1 | 0]; } if (($3 & 255) != 72) { HEAP8[$1_1 + 1 | 0] = HEAPU8[$6_1 - 7 | 0] } $3 = $1_1; } $994($0_1, $4_1, $7_1, $3); } $11(HEAP32[$0_1 >> 2], $2_1); $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $985($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAPU8[$2_1 + 84 | 0]; $4_1 = HEAPU8[$2_1 + 177 | 0]; $2_1 = $414($2_1, $3, $1_1, $4_1); if (!(!(HEAP32[$2_1 + 12 >> 2] ? !$2_1 : 1) | $4_1)) { $2_1 = $852($0_1, $3, $2_1, $1_1) } return $2_1; } function $986($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = HEAP32[$1_1 >> 2]; $3 = $48($5_1); $4_1 = $3 + 1 | 0; if (HEAPU8[$1_1 + 10 | 0] & 4) { $4_1 = ($48($4_1 + $5_1 | 0) + $3 | 0) + 2 | 0 } $3 = $48($2_1) + 1 | 0; $6_1 = $3 + $4_1 | 0; $7_1 = $6_1 >>> 0 < $4_1 >>> 0 ? 1 : $7_1; $0_1 = $55($0_1, $5_1, $6_1, $7_1); if ($0_1) { HEAP32[$1_1 >> 2] = $0_1; if ($3) { wasm2js_memory_copy($0_1 + $4_1 | 0, $2_1, $3) } HEAP16[$1_1 + 10 >> 1] = HEAPU16[$1_1 + 10 >> 1] | 512; } } function $987($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 + -64 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; $7_1 = HEAP32[$0_1 + 252 >> 2]; block : { if (!$7_1) { break block } $6_1 = HEAP32[$7_1 + 4 >> 2] + Math_imul(HEAP16[$7_1 + 34 >> 1], 12) | 0; $8_1 = $6_1 - 12 | 0; if (HEAPU8[$5_1 + 177 | 0]) { $9_1 = HEAPU8[$5_1 + 176 | 0] != 1 | 4 } else { $9_1 = 4 } if (!$1001(0, $1_1, $9_1)) { HEAP32[$4_1 >> 2] = HEAP32[$8_1 >> 2]; $257($0_1, 3004, $4_1); break block; } if (HEAPU8[$6_1 - 2 | 0] & 96) { $257($0_1, 11173, 0); break block; } $6_1 = $4_1 + 12 | 0; wasm2js_memory_fill($6_1, 0, 52); HEAP8[$4_1 + 12 | 0] = 181; $2_1 = $969($5_1, $2_1, $3); HEAP32[$4_1 + 24 >> 2] = $1_1; HEAP32[$4_1 + 20 >> 2] = $2_1; HEAP32[$4_1 + 16 >> 2] = 8192; $3 = $906($5_1, $6_1, 1); $10($5_1, $2_1); $994($0_1, $7_1, $8_1, $3); } if (HEAPU8[$0_1 + 224 | 0] >= 2) { $1002($0_1, $1_1) } $11($5_1, $1_1); $0_1 = $4_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $988($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; if (!(!HEAPU8[HEAP32[(HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2] + 9 | 0] | ($1_1 | 0) == 1)) { __inlined_func$1164$107 : { $6_1 = HEAP32[$0_1 + 132 >> 2]; $0_1 = $6_1 ? $6_1 : $0_1; $7_1 = HEAP32[$0_1 + 120 >> 2]; $8_1 = ($7_1 | 0) > 0 ? $7_1 : 0; while (1) { if (($5_1 | 0) != ($8_1 | 0)) { $6_1 = HEAP32[$0_1 + 124 >> 2] + ($5_1 << 4) | 0; if (HEAP32[$6_1 >> 2] != ($1_1 | 0) | HEAP32[$6_1 + 4 >> 2] != ($2_1 | 0)) { $5_1 = $5_1 + 1 | 0; continue; } else { HEAP8[$6_1 + 8 | 0] = (HEAPU8[$6_1 + 8 | 0] | $3) != 0; break __inlined_func$1164$107; } } break; }; $5_1 = ($7_1 << 4) + 16 | 0; $5_1 = $668(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 124 >> 2], $5_1, $5_1 >> 31); HEAP32[$0_1 + 124 >> 2] = $5_1; if ($5_1) { $6_1 = $0_1; $0_1 = HEAP32[$0_1 + 120 >> 2]; HEAP32[$6_1 + 120 >> 2] = $0_1 + 1; $0_1 = $5_1 + ($0_1 << 4) | 0; HEAP32[$0_1 + 12 >> 2] = $4_1; HEAP8[$0_1 + 8 | 0] = $3; HEAP32[$0_1 + 4 >> 2] = $2_1; HEAP32[$0_1 >> 2] = $1_1; break __inlined_func$1164$107; } HEAP32[$0_1 + 120 >> 2] = 0; $106(HEAP32[$0_1 >> 2]); } } } function $989($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $5_1 = HEAPU16[HEAP32[$2_1 + 4 >> 2] + ($3 << 1) >> 1]; $1_1 = 0; while (1) { block1 : { if (($1_1 | 0) != ($4_1 | 0)) { if (HEAPU16[HEAP32[$0_1 + 4 >> 2] + ($1_1 << 1) >> 1] != ($5_1 | 0)) { break block1 } if ($67(HEAP32[HEAP32[$0_1 + 32 >> 2] + ($1_1 << 2) >> 2], HEAP32[HEAP32[$2_1 + 32 >> 2] + ($3 << 2) >> 2])) { break block1 } $6_1 = 1; } return $6_1; } $1_1 = $1_1 + 1 | 0; continue; }; } function $990($0_1, $1_1, $2_1) { var $3 = 0; while (1) { if (($1_1 | 0) <= 0) { return 0 } $1_1 = $1_1 - 1 | 0; $3 = HEAP16[$0_1 >> 1]; $0_1 = $0_1 + 2 | 0; if (($2_1 | 0) != ($3 | 0)) { continue } break; }; return 1; } function $991($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; if (($2_1 | 0) > HEAPU16[$1_1 + 52 >> 1]) { $3 = Math_imul($2_1, 9); $0_1 = $270($0_1, $3, $3 >> 31); if (!$0_1) { return 7 } $3 = HEAPU16[$1_1 + 52 >> 1] << 2; if ($3) { wasm2js_memory_copy($0_1, HEAP32[$1_1 + 32 >> 2], $3) } HEAP32[$1_1 + 32 >> 2] = $0_1; $0_1 = $0_1 + ($2_1 << 2) | 0; $3 = (HEAPU16[$1_1 + 50 >> 1] << 1) + 2 | 0; if ($3) { wasm2js_memory_copy($0_1, HEAP32[$1_1 + 8 >> 2], $3) } HEAP32[$1_1 + 8 >> 2] = $0_1; $3 = $2_1 << 1; $0_1 = $3 + $0_1 | 0; $4_1 = HEAPU16[$1_1 + 52 >> 1] << 1; if ($4_1) { wasm2js_memory_copy($0_1, HEAP32[$1_1 + 4 >> 2], $4_1) } HEAP32[$1_1 + 4 >> 2] = $0_1; $0_1 = $0_1 + $3 | 0; $3 = HEAPU16[$1_1 + 52 >> 1]; if ($3) { wasm2js_memory_copy($0_1, HEAP32[$1_1 + 28 >> 2], $3) } HEAP16[$1_1 + 52 >> 1] = $2_1; HEAP32[$1_1 + 28 >> 2] = $0_1; $0_1 = HEAPU8[$1_1 + 55 | 0] | HEAPU8[$1_1 + 56 | 0] << 8 | 16; HEAP8[$1_1 + 55 | 0] = $0_1; HEAP8[$1_1 + 56 | 0] = $0_1 >>> 8; } return 0; } function $992($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = HEAPU16[$0_1 + 52 >> 1]; $7_1 = HEAP32[$0_1 + 12 >> 2]; while (1) { if (($3 | 0) > 0) { $3 = $3 - 1 | 0; $1_1 = HEAP16[HEAP32[$0_1 + 4 >> 2] + ($3 << 1) >> 1]; if (($1_1 | 0) < 0 | $1_1 >>> 0 > 62) { continue } $2_1 = $1_1 & 65535; if (HEAPU16[(HEAP32[$7_1 + 4 >> 2] + Math_imul($2_1, 12) | 0) + 10 >> 1] & 32) { continue } $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $1_1; $4_1 = 0; } else { $4_1 = 1 << $1_1; $2_1 = $4_1 - 1 & 1 >>> 32 - $1_1; } $5_1 = $4_1 | $5_1; $6_1 = $2_1 | $6_1; continue; } break; }; HEAP32[$0_1 + 64 >> 2] = $5_1 ^ -1; HEAP32[$0_1 + 68 >> 2] = $6_1 ^ -1; } function $993($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 96 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 + 36 >> 2] = 0; $6_1 = $5_1 + 28 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $5_1 + 20 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 16 >> 2] = 0; wasm2js_memory_fill($5_1 + 40 | 0, 0, 56); if ($1_1) { HEAP32[$5_1 + 40 >> 2] = 1; $6_1 = HEAP32[$1_1 >> 2]; HEAP32[$5_1 + 64 >> 2] = -1; HEAP32[$5_1 + 56 >> 2] = $1_1; HEAP32[$5_1 + 48 >> 2] = $6_1; $2_1 = HEAP32[$1_1 + 60 >> 2] == HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + 28 >> 2] ? $2_1 : $2_1 | 262144; } HEAP32[$5_1 + 4 >> 2] = $0_1; HEAP32[$5_1 + 28 >> 2] = $2_1 | 65536; HEAP32[$5_1 + 8 >> 2] = $5_1 + 40; $2_1 = 1; block3 : { if ($1096($5_1 + 4 | 0, $3)) { break block3 } $2_1 = 0; if (!$4_1) { break block3 } $2_1 = $1126($5_1 + 4 | 0, $4_1); } $0_1 = $5_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $994($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = HEAPU16[$2_1 + 8 >> 1]; $5_1 = HEAP32[$1_1 + 52 >> 2]; block3 : { block1 : { if (!(!$4_1 | !$5_1)) { $6_1 = HEAP32[$5_1 >> 2]; if (($4_1 | 0) > ($6_1 | 0)) { break block1 } $1_1 = HEAP32[$0_1 >> 2]; $0_1 = $5_1 + 8 | 0; $11($1_1, HEAP32[($0_1 + ($4_1 << 4) | 0) - 16 >> 2]); HEAP32[($0_1 + (HEAPU16[$2_1 + 8 >> 1] << 4) | 0) - 16 >> 2] = $3; return; } $4_1 = 1; if (!$5_1) { break block3 } $6_1 = HEAP32[$5_1 >> 2]; } $4_1 = $6_1 + 1 | 0; } HEAP16[$2_1 + 8 >> 1] = $4_1; HEAP32[$1_1 + 52 >> 2] = $936($0_1, $5_1, $3); } function $995($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = HEAPU16[$0_1 + 52 >> 1]; $6_1 = HEAP32[HEAP32[$0_1 + 12 >> 2] + 4 >> 2]; while (1) { if (!(($1_1 | 0) == ($5_1 | 0))) { $2_1 = 1; $3 = HEAP16[HEAP32[$0_1 + 4 >> 2] + ($1_1 << 1) >> 1]; if (($3 | 0) >= 0) { $2_1 = HEAPU8[(Math_imul($3, 12) + $6_1 | 0) + 6 | 0] } $1_1 = $1_1 + 1 | 0; $4_1 = $4_1 + $2_1 | 0; continue; } break; }; HEAP16[$0_1 + 48 >> 1] = $433($4_1 << 2, 0); } function $996($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$3 + 32 >> 2]; $5_1 = HEAP32[$3 + 36 >> 2]; HEAP32[$3 + 32 >> 2] = $4_1 & -69 | 64; HEAP32[$3 + 36 >> 2] = $5_1; $1017($0_1, $1_1, 0); HEAP32[$3 + 32 >> 2] = $4_1; HEAP32[$3 + 36 >> 2] = $5_1; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } while (1) { $4_1 = $1_1; $1_1 = HEAP32[$1_1 + 52 >> 2]; if ($1_1) { continue } break; }; $1_1 = $270($3, 64, 0); if (!$1_1) { break block } HEAP16[$1_1 + 38 >> 1] = 200; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 24 >> 2] = 1; $1224($0_1, HEAP32[$4_1 + 28 >> 2], $1_1 + 34 | 0, $1_1 + 4 | 0); $1225($0_1, $1_1, $4_1, $2_1); HEAP16[$1_1 + 32 >> 1] = 65535; if (!HEAPU8[$3 + 87 | 0]) { return $1_1 } $6($3, $1_1); } return 0; } function $997($0_1, $1_1) { $858($0_1, 68, $1_1); $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; } function $998($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (HEAP8[$1_1 + 30 | 0] & 1) { if (!$2_1) { $1043($0_1, $1_1, -5); $4_1 = 82740; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $4_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0) - 20 | 0 } HEAP8[$4_1 | 0] = 95; $835($0_1, 97, HEAP32[$4_1 + 4 >> 2], HEAP32[$4_1 + 8 >> 2], HEAP32[$4_1 + 12 >> 2]); return; } $326($0_1, 95, $2_1, HEAP16[$1_1 + 36 >> 1]); $1043($0_1, $1_1, -5); return; } block3 : { $3 = HEAP32[$1_1 + 12 >> 2]; if ($3) { break block3 } $3 = HEAP16[$1_1 + 34 >> 1]; $4_1 = $3 >> 31; $3 = $3 + 1 | 0; $4_1 = $3 ? $4_1 : $4_1 + 1 | 0; $3 = $30($3, $4_1); if ($3) { $4_1 = 0; while (1) if (($4_1 | 0) >= HEAP16[$1_1 + 34 >> 1]) { while (1) { block6 : { HEAP8[$3 + $5_1 | 0] = 0; if (($5_1 | 0) <= 0) { break block6 } $5_1 = $5_1 - 1 | 0; if (HEAP8[$5_1 + $3 | 0] < 66) { continue } } break; }; HEAP32[$1_1 + 12 >> 2] = $3; break block3; } else { $6_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($4_1, 12) | 0; if (!(HEAPU8[$6_1 + 10 | 0] & 32)) { HEAP8[$3 + $5_1 | 0] = HEAPU8[$6_1 + 5 | 0]; $5_1 = $5_1 + 1 | 0; } $4_1 = $4_1 + 1 | 0; continue; }; } $106(HEAP32[$0_1 >> 2]); return; } $1_1 = $2080($3) & 1073741823; if ($1_1) { if ($2_1) { $859($0_1, 96, $2_1, $1_1, 0, $3, $1_1); return; } $315($0_1, -1, $3, $1_1); } } function $999($0_1) { var $1_1 = 0, $2_1 = 0; while (1) { $2_1 = HEAPU8[$0_1 | 0]; block1 : { if (($2_1 | 0) != 34) { if ($2_1) { break block1 } return $1_1 + 2 | 0; } $1_1 = $1_1 + 1 | 0; } $0_1 = $0_1 + 1 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } function $1000($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = HEAP32[$1_1 >> 2]; while (1) { $6_1 = HEAPU8[$2_1 + $5_1 | 0]; if (!(!$6_1 | !(HEAPU8[$6_1 + 31424 | 0] & 6) & ($6_1 | 0) != 95)) { $5_1 = $5_1 + 1 | 0; continue; } break; }; block3 : { block2 : { if (HEAPU8[$2_1 | 0] - 58 >>> 0 > 4294967285) { break block2 } $3 = $5_1; $7_1 = global$0 - 16 | 0; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; $8_1 = 60; HEAP32[$7_1 + 12 >> 2] = 60; if (($3 | 0) >= 2) { $360($2_1, $3, $7_1 + 12 | 0); $8_1 = HEAP32[$7_1 + 12 >> 2]; } $3 = $7_1 + 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!$5_1 | $6_1) { break block2 } $6_1 = 0; if (($8_1 | 0) == 60) { break block3 } } HEAP8[$0_1 + $4_1 | 0] = 34; $4_1 = $4_1 + 1 | 0; $6_1 = 1; } $5_1 = 0; while (1) { $8_1 = $2_1 + $5_1 | 0; $3 = HEAPU8[$8_1 | 0]; if ($3) { HEAP8[$0_1 + $4_1 | 0] = $3; $3 = $4_1 + 1 | 0; if (!(HEAPU8[$8_1 | 0] != 34)) { HEAP8[$0_1 + $3 | 0] = 34; $3 = $4_1 + 2 | 0; } $4_1 = $3; $5_1 = $5_1 + 1 | 0; continue; } break; }; if ($6_1) { HEAP8[$0_1 + $4_1 | 0] = 34; $4_1 = $4_1 + 1 | 0; } HEAP8[$0_1 + $4_1 | 0] = 0; HEAP32[$1_1 >> 2] = $4_1; } function $1001($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = 62; HEAP32[$3 + 8 >> 2] = 63; HEAP32[$3 + 4 >> 2] = $0_1; HEAP16[$3 + 24 >> 1] = $2_1; $920($3 + 4 | 0, $1_1); $1_1 = HEAPU16[$3 + 24 >> 1]; $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1002($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAPU8[$0_1 + 224 | 0]; $3 = $2_1 + 24 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 64; HEAP32[$2_1 + 8 >> 2] = 61; HEAP32[$2_1 + 4 >> 2] = $0_1; HEAP8[$0_1 + 224 | 0] = 3; $920($2_1 + 4 | 0, $1_1); HEAP8[$0_1 + 224 | 0] = $4_1; $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1003($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = $1_1; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 132 >> 2]; if (($3 | 0) > ($1_1 | 0)) { HEAP32[$2_1 >> 2] = $1_1; $257($0_1, 25789, $2_1); $4_1 = 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1004($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | (HEAPU8[$1_1 | 0] == 34 ? 67108992 : 67108864); $300($1_1); } function $1005($0_1) { if (!$67($0_1, 13084)) { return 268435456 } return $67($0_1, 13617) ? 0 : 536870912; } function $1006($0_1, $1_1) { var $2_1 = 0; $2_1 = $1_1; $1_1 = HEAPU16[$1_1 + 10 >> 1]; HEAP16[$2_1 + 10 >> 1] = $1_1 | 1; if ($1_1 & 96) { $257($0_1, 18495, 0) } } function $1007($0_1) { while (1) { if (!(!$0_1 | !(HEAPU8[$0_1 + 5 | 0] & 32))) { $0_1 = HEAP32[$0_1 + 12 >> 2]; continue; } break; }; return $0_1; } function $1008($0_1) { block1 : { block2 : { switch (HEAPU8[$0_1 | 0] - 114 | 0) { case 0: $0_1 = HEAP32[$0_1 + 12 >> 2]; if (HEAPU8[$0_1 | 0] != 118) { break block1 } break; case 4: break block2; default: break block1; }; } HEAP8[$0_1 | 0] = 60; } } function $1009($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = $2_1; $5_1 = ($1_1 << 2) + 7 & -8; $2_1 = $1_1 << 1; $6_1 = $2_1 + 2 | 0; $7_1 = ($5_1 + (($6_1 + ($1_1 + $2_1 | 0) | 0) + 7 & -8) | 0) + 72 | 0; $4_1 = $4_1 + $7_1 | 0; $0_1 = $270($0_1, $4_1, $4_1 >> 31); if ($0_1) { HEAP16[$0_1 + 52 >> 1] = $1_1; $4_1 = $0_1 + 72 | 0; HEAP32[$0_1 + 32 >> 2] = $4_1; HEAP16[$0_1 + 50 >> 1] = $1_1 - 1; $1_1 = $4_1 + $5_1 | 0; HEAP32[$0_1 + 8 >> 2] = $1_1; $1_1 = $1_1 + $6_1 | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; HEAP32[$0_1 + 28 >> 2] = $1_1 + $2_1; HEAP32[$3 >> 2] = $0_1 + $7_1; } return $0_1; } function $1010($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $12_1 = global$0 - 16 | 0; $4_1 = $12_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $6_1 = HEAP32[$1_1 + 12 >> 2]; $9_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $9_1 + 2; $3 = HEAP32[$1_1 >> 2]; $4_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$4_1 + 16 >> 2]; $10_1 = $309($4_1, HEAP32[$1_1 + 24 >> 2]); block : { if ($864($0_1, 27, $3, 0, HEAP32[$5_1 + ($10_1 << 4) >> 2])) { break block } $988($0_1, $10_1, HEAP32[$6_1 + 20 >> 2], 1, HEAP32[$6_1 >> 2]); $3 = $856($0_1); if (!$3) { break block } $4_1 = $2_1; if (($4_1 | 0) < 0) { $4_1 = HEAP32[$1_1 + 44 >> 2] } $11_1 = $1053($0_1, $1_1); $7_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $7_1 + 1; $5_1 = HEAPU16[$1_1 + 50 >> 1]; if ($11_1) { HEAP32[$11_1 >> 2] = HEAP32[$11_1 >> 2] + 1 } $859($3, 119, $7_1, 0, $5_1, $11_1, -8); $860($0_1, $9_1, $10_1, $6_1, 102); $5_1 = $326($3, 36, $9_1, 0); $6_1 = $893($0_1); $8_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($8_1 ? $8_1 : $0_1) + 20 | 0] = 1; $1149($0_1, $1_1, $9_1, $6_1, 0, $12_1 + 12 | 0, 0, 0); $326($3, 139, $7_1, $6_1); $1150($0_1, HEAP32[$12_1 + 12 >> 2]); $326($3, 39, $9_1, $5_1 + 1 | 0); $8_1 = 82740; $8_1 = HEAPU8[HEAP32[$3 >> 2] + 87 | 0] ? $8_1 : HEAP32[$3 + 104 >> 2] + Math_imul($5_1, 20) | 0; $5_1 = $9_1 + 1 | 0; HEAP32[$8_1 + 8 >> 2] = HEAP32[$3 + 108 >> 2]; if (($2_1 | 0) < 0) { $326($3, 145, $4_1, $10_1) } $859($3, 113, $5_1, $4_1, $10_1, $11_1, -8); $4_1 = HEAP32[$3 + 108 >> 2]; if (($4_1 | 0) > 0) { HEAP16[(HEAP32[$3 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = ($2_1 | 0) >= 0 ? 17 : 1 } $10_1 = $326($3, 34, $7_1, 0); block8 : { if (HEAPU8[$1_1 + 54 | 0]) { $2_1 = $863($3, 1); $4_1 = HEAP32[$3 + 108 >> 2]; $312($3, 132, $7_1, $2_1, $6_1, HEAPU16[$1_1 + 50 >> 1]); $1262($0_1, 2, $1_1); $8_1 = HEAP32[$3 + 108 >> 2]; $11_1 = 82740; HEAP32[(HEAPU8[HEAP32[$3 >> 2] + 87 | 0] ? $11_1 : HEAP32[$3 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = $8_1; break block8; } $2_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $0_1) + 21 | 0] = 1; $4_1 = HEAP32[$3 + 108 >> 2]; } $835($3, 133, $7_1, $6_1, $5_1); if (!(HEAPU8[$1_1 + 56 | 0] & 4)) { $858($3, 137, $5_1) } $326($3, 138, $5_1, $6_1); $1_1 = HEAP32[$3 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$3 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 16 } $894($0_1, $6_1); $326($3, 37, $7_1, $4_1); $1_1 = HEAP32[$3 + 108 >> 2]; $0_1 = 82740; HEAP32[(HEAPU8[HEAP32[$3 >> 2] + 87 | 0] ? $0_1 : HEAP32[$3 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = $1_1; $858($3, 122, $9_1); $858($3, 122, $5_1); $858($3, 122, $7_1); } $0_1 = $12_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1011($0_1) { return $320(HEAP32[$0_1 + 60 >> 2] + 56 | 0, HEAP32[$0_1 >> 2]); } function $1012($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0; $6_1 = $856($0_1); if (($2_1 | 0) == 2) { $7_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($7_1 ? $7_1 : $0_1) + 21 | 0] = 1; } $859($6_1, 70, $1_1, $2_1, 0, $3, $4_1); $0_1 = HEAP32[$6_1 + 108 >> 2]; if (($0_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = $5_1 } } function $1013($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = $1_1 ^ -1; $1_1 = HEAP32[$0_1 + 12 >> 2]; if ((HEAP32[$1_1 + 60 >> 2] + HEAP32[$1_1 + 64 >> 2] | 0) < 0) { $5_1 = $0_1; $0_1 = $1_1; $4_1 = HEAP32[$0_1 + 60 >> 2]; $2_1 = 10 - $4_1 | 0; $1_1 = $668(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 68 >> 2], $2_1 << 2, 0); HEAP32[$0_1 + 68 >> 2] = $1_1; __inlined_func$1195$109 : { if (!$1_1) { HEAP32[$0_1 + 64 >> 2] = 0; break __inlined_func$1195$109; } if (!(($4_1 | 0) > -90 | (HEAP32[$0_1 + 64 >> 2] / 100 | 0) >= (($2_1 >>> 0) / 100 | 0))) { $1220($0_1); $1_1 = HEAP32[$0_1 + 68 >> 2]; } HEAP32[$0_1 + 64 >> 2] = $2_1; HEAP32[($3 << 2) + $1_1 >> 2] = HEAP32[$5_1 + 108 >> 2]; } return; } HEAP32[HEAP32[$1_1 + 68 >> 2] + ($3 << 2) >> 2] = HEAP32[$0_1 + 108 >> 2]; } function $1014($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + 28 >> 2]; $0_1 = $4_1 + 48 | 0; $2_1 = HEAP32[$1_1 + 56 >> 2]; while (1) { $5_1 = $2_1; block : { block2 : { while (1) { $0_1 = HEAP32[$0_1 >> 2]; if (!$0_1) { break block } $6_1 = HEAP32[$1_1 + 60 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = HEAP32[$2_1 + 24 >> 2]; block1 : { if (($6_1 | 0) != ($7_1 | 0)) { break block1 } $3 = HEAP32[$2_1 + 4 >> 2]; if (!$3) { break block1 } if ($67($3, HEAP32[$1_1 >> 2])) { break block1 } if (HEAPU8[$2_1 + 10 | 0] | ($4_1 | 0) != ($7_1 | 0)) { break block2 } } if (HEAPU8[$2_1 + 8 | 0] != 151) { continue } break; }; $3 = HEAP32[$1_1 >> 2]; HEAP32[$2_1 + 24 >> 2] = $6_1; HEAP32[$2_1 + 4 >> 2] = $3; } HEAP32[$2_1 + 32 >> 2] = $5_1; continue; } break; }; return $5_1; } function $1016($0_1, $1_1, $2_1) { var $3 = 0; block1 : { block : { $3 = HEAP32[18950]; if (!$3) { break block } if (!(FUNCTION_TABLE[$3 | 0](300) | 0)) { break block } $106(HEAP32[$0_1 >> 2]); break block1; } $3 = $51(HEAP32[$0_1 >> 2], 12, 0); if (!$3) { break block1 } HEAP32[$3 >> 2] = HEAP32[$0_1 + 144 >> 2]; HEAP32[$0_1 + 144 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $2_1; return $2_1; } FUNCTION_TABLE[$1_1 | 0](HEAP32[$0_1 >> 2], $2_1); return 0; } function $1017($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] | HEAPU8[$1_1 + 4 | 0] & 128) { break block } HEAP32[$3 + 8 >> 2] = 65; HEAP32[$3 + 4 >> 2] = $0_1; if (HEAPU8[$0_1 + 22 | 0]) { HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 66; $919($3 + 4 | 0, $1_1); } HEAP16[$3 + 24 >> 1] = 0; HEAP32[$3 + 16 >> 2] = 41; HEAP32[$3 + 12 >> 2] = 67; $4_1 = $3 + 4 | 0; $919($4_1, $1_1); if (HEAP32[$0_1 + 40 >> 2]) { break block } $1240($0_1, $1_1, $2_1); if (HEAP32[$0_1 + 40 >> 2]) { break block } HEAP32[$3 + 16 >> 2] = 68; HEAP32[$3 + 12 >> 2] = 46; HEAP32[$3 + 8 >> 2] = 65; HEAP32[$3 + 4 >> 2] = $0_1; $919($4_1, $1_1); } $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1018($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$1_1 >> 2]; $3 = ($2_1 | 0) > 0 ? $2_1 : 0; $4_1 = $1_1 + 8 | 0; $1_1 = 0; block : { while (1) { if (($1_1 | 0) == ($3 | 0)) { break block } block3 : { $2_1 = Math_imul($1_1, 48) + $4_1 | 0; block1 : { if (($2_1 | 0) == ($0_1 | 0)) { break block1 } if (HEAP32[$0_1 + 8 >> 2] == HEAP32[$2_1 + 8 >> 2]) { if (!$66(HEAP32[$0_1 + 4 >> 2], HEAP32[$2_1 + 4 >> 2])) { break block3 } } if (!(HEAPU8[$2_1 + 13 | 0] & 4)) { break block1 } $2_1 = HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2]; if (!(HEAPU8[$2_1 + 5 | 0] & 8)) { break block1 } if ($1018($0_1, HEAP32[$2_1 + 32 >> 2])) { break block3 } } $1_1 = $1_1 + 1 | 0; continue; } break; }; $5_1 = 1; } return $5_1; } function $1019($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $3 = global$0 + -64 | 0; $2_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $2_1; block : { if (HEAPU8[$0_1 + 16 | 0]) { break block } $5_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 8 >> 2]; while (1) { $2_1 = $1_1; $1_1 = HEAP32[$1_1 + 52 >> 2]; if ($1_1) { continue } break; }; $10_1 = HEAP32[$2_1 + 32 >> 2]; $7_1 = HEAP32[$2_1 + 28 >> 2]; HEAP8[$0_1 + 16 | 0] = 1; $1_1 = HEAP32[$5_1 + 32 >> 2]; $1134($6_1, HEAP32[$7_1 >> 2]); $9_1 = $7_1 + 8 | 0; $11_1 = $1_1 & 68; $12_1 = $1_1 & 4; $1_1 = 0; while (1) { $2_1 = HEAP32[$7_1 >> 2]; if (!(($2_1 | 0) <= ($1_1 | 0))) { $8_1 = ($1_1 << 4) + $9_1 | 0; $2_1 = HEAP32[$8_1 >> 2]; $4_1 = HEAP32[$8_1 + 4 >> 2]; block3 : { if (!(!$4_1 | HEAPU8[$8_1 + 9 | 0] & 3)) { $1135($6_1, $1_1, 0, $4_1, -1); break block3; } if (!(!($13_1 | $11_1) | HEAPU8[$2_1 | 0] != 168)) { $4_1 = HEAP32[$2_1 + 44 >> 2]; block6 : { block5 : { $2_1 = HEAP16[$2_1 + 32 >> 1]; if (($2_1 | 0) >= 0) { break block5 } $2_1 = HEAP16[$4_1 + 32 >> 1]; if (($2_1 | 0) >= 0) { break block5 } $2_1 = 15209; break block6; } $2_1 = HEAP32[HEAP32[$4_1 + 4 >> 2] + Math_imul($2_1, 12) >> 2]; } if ($13_1 | $12_1) { $4_1 = HEAP32[$4_1 >> 2]; HEAP32[$3 + 20 >> 2] = $2_1; HEAP32[$3 + 16 >> 2] = $4_1; $1135($6_1, $1_1, 0, $310($5_1, 6429, $3 + 16 | 0), 5); break block3; } $1135($6_1, $1_1, 0, $2_1, -1); break block3; } block9 : { if (!$4_1) { HEAP32[$3 >> 2] = $1_1 + 1; $2_1 = $310($5_1, 16723, $3); break block9; } $2_1 = $116($5_1, $4_1); } $1135($6_1, $1_1, 0, $2_1, 5); } $1_1 = $1_1 + 1 | 0; continue; } break; }; $5_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = 0; HEAP32[$3 + 40 >> 2] = 0; HEAP32[$3 + 28 >> 2] = $0_1; HEAP32[$3 + 32 >> 2] = $10_1; while (1) { if (($1_1 | 0) >= ($2_1 | 0)) { break block } $1135($5_1, $1_1, 1, $1258($3 + 28 | 0, HEAP32[($1_1 << 4) + $9_1 >> 2]), -1); $1_1 = $1_1 + 1 | 0; $2_1 = HEAP32[$7_1 >> 2]; continue; }; } $0_1 = $3 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1021($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if ((HEAPU8[$1_1 + 5 | 0] | HEAPU8[$1_1 + 6 | 0] << 8) & 320) { break block } $2_1 = HEAP32[$1_1 + 40 >> 2]; if (!$2_1) { break block } $3 = HEAP16[$1_1 + 34 >> 1]; $0_1 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$1_1 | 0] != 169) { if (HEAP32[(HEAP32[$2_1 + 20 >> 2] + ($3 << 4) | 0) + 4 >> 2] != ($1_1 | 0) | HEAP32[$2_1 + 24 >> 2] <= ($3 | 0)) { break block } $1_1 = $906($4_1, $1_1, 0); if (!$1_1) { break block } if ($1131($0_1, $1_1)) { break block } HEAP32[(HEAP32[$2_1 + 20 >> 2] + ($3 << 4) | 0) + 4 >> 2] = $1_1; break block; } if (HEAP32[HEAP32[$2_1 + 32 >> 2] + Math_imul($3, 24) >> 2] != ($1_1 | 0) | HEAP32[$2_1 + 36 >> 2] <= ($3 | 0)) { break block } $1_1 = $906($4_1, $1_1, 0); if (!$1_1) { break block } if ($1131($0_1, $1_1)) { break block } HEAP32[HEAP32[$2_1 + 32 >> 2] + Math_imul($3, 24) >> 2] = $1_1; } return 0; } function $1022($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if (!(HEAP32[$1_1 + 40 >> 2] | HEAPU8[$1_1 | 0] != 169)) { $0_1 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$1_1 + 8 >> 2]; $257($0_1, 26810, $2_1); } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $1023($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = global$0 - 16 | 0; $4_1 = $6_1; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (!$2_1) { break block } $8_1 = $1_1 ? HEAP32[$1_1 >> 2] : $8_1; $10_1 = $2_1 + 8 | 0; $4_1 = 0; while (1) { if (HEAP32[$2_1 >> 2] <= ($4_1 | 0)) { break block } $5_1 = HEAP32[$0_1 >> 2]; $9_1 = ($4_1 << 4) + $10_1 | 0; $7_1 = $906($5_1, HEAP32[$9_1 >> 2], 0); if (!HEAPU8[$5_1 + 87 | 0]) { block3 : { if (!$3) { break block3 } $5_1 = $1063($7_1); if (!$1074($5_1, $6_1 + 12 | 0, 0)) { break block3 } HEAP8[$5_1 | 0] = 122; HEAP32[$5_1 + 8 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = HEAP32[$5_1 + 4 >> 2] & -805308417; } $1_1 = $936($0_1, $1_1, $7_1); if ($1_1) { HEAP8[(($4_1 + $8_1 << 4) + $1_1 | 0) + 16 | 0] = HEAPU8[$9_1 + 8 | 0] } $4_1 = $4_1 + 1 | 0; continue; } break; }; $11($5_1, $7_1); } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1024($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!($0_1 | $1_1)) { break block } $3 = 1; if (!(!$0_1 | !$1_1 | HEAP32[$0_1 >> 2] != HEAP32[$1_1 >> 2])) { $5_1 = $1_1 + 8 | 0; $6_1 = $0_1 + 8 | 0; $1_1 = 0; while (1) { if (HEAP32[$0_1 >> 2] <= ($1_1 | 0)) { break block } $3 = $1_1 << 4; $4_1 = $3 + $6_1 | 0; $3 = $3 + $5_1 | 0; if (HEAPU8[$4_1 + 8 | 0] != HEAPU8[$3 + 8 | 0]) { return 1 } $1_1 = $1_1 + 1 | 0; $3 = $1121(0, HEAP32[$4_1 >> 2], HEAP32[$3 >> 2], $2_1); if (!$3) { continue } break; }; } return $3; } return 0; } function $1025($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0; $6_1 = global$0 - 48 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$6_1 + 40 >> 2] = 0; HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[$6_1 + 36 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = 0; $7_1 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 12 >> 2] = $4_1; HEAP32[$6_1 + 4 >> 2] = $2_1; HEAP32[$6_1 >> 2] = $1_1; HEAP32[$6_1 + 8 >> 2] = $7_1; HEAP32[$6_1 + 28 >> 2] = 69; HEAP32[$6_1 + 24 >> 2] = 70; HEAP32[$6_1 + 20 >> 2] = $0_1; HEAP32[$6_1 + 44 >> 2] = $6_1; $921($6_1 + 20 | 0, $3); HEAP32[$5_1 >> 2] = HEAP32[$6_1 + 8 >> 2]; $0_1 = $6_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1026($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (!$1_1) { break block } $2_1 = $1_1 + 8 | 0; $3 = HEAP32[$1_1 >> 2]; while (1) { if (($4_1 | 0) >= ($3 | 0)) { break block } block1 : { if (HEAP32[$2_1 + 16 >> 2] >= 0) { break block1 } $5_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $5_1 + 1; HEAP32[$2_1 + 16 >> 2] = $5_1; if (!(HEAPU8[$2_1 + 13 | 0] & 4)) { break block1 } $1026($0_1, HEAP32[HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2] + 32 >> 2]); $3 = HEAP32[$1_1 >> 2]; } $2_1 = $2_1 + 48 | 0; $4_1 = $4_1 + 1 | 0; continue; }; } } function $1027($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] + 1; return 0; } function $1028($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] - 1; } function $1029($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; block : { if (HEAPU8[$1_1 | 0] != 169) { break block } $2_1 = HEAP32[$0_1 + 16 >> 2]; $0_1 = HEAPU8[$1_1 + 2 | 0]; if (($2_1 | 0) > ($0_1 | 0)) { break block } HEAP8[$1_1 + 2 | 0] = $0_1 + 1; } return 0; } function $1030($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $0_1 = $1063($0_1); $4_1 = 0; block1 : { if (!$0_1) { break block1 } $4_1 = HEAPU8[$0_1 | 0]; block3 : { if (($4_1 | 0) != 52) { while (1) { if (($4_1 | 0) != 44) { break block3 } $4_1 = 1; if ($1030(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1)) { break block1 } $0_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = HEAPU8[$0_1 | 0]; continue; } } $0_1 = HEAP32[$0_1 + 12 >> 2]; } HEAP32[$3 + 28 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 71; HEAP16[$3 + 24 >> 1] = 0; HEAP16[$3 + 26 >> 1] = ($2_1 | 0) != 0; $920($3 + 4 | 0, $0_1); $4_1 = HEAPU16[$3 + 24 >> 1]; } $0_1 = $4_1; $1_1 = $3 + 32 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1031($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = ($1_1 | 0) < 0; while (1) { block2 : { block3 : { block1 : { if ($0_1) { $3 = HEAP32[$0_1 + 4 >> 2]; if ($5_1) { break block1 } if (!($3 & 1) | HEAP32[$0_1 + 36 >> 2] != ($1_1 | 0)) { break block2 } $3 = $3 & -4 | 2; break block3; } return; } $3 = $3 & -4; } HEAP32[$0_1 + 4 >> 2] = $3; } block5 : { block6 : { switch (HEAPU8[$0_1 | 0] - 168 | 0) { case 0: if (HEAP32[$0_1 + 28 >> 2] != ($1_1 | 0) | $2_1) { break block5 } HEAP32[$0_1 + 4 >> 2] = $3 & -2097153; break block5; case 4: break block6; default: break block5; }; } $3 = 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; if (!$4_1) { break block5 } while (1) { if (HEAP32[$4_1 >> 2] <= ($3 | 0)) { break block5 } $1031(HEAP32[(($3 << 4) + $4_1 | 0) + 8 >> 2], $1_1, $2_1); $3 = $3 + 1 | 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; continue; }; } $1031(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1); $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; }; } function $1032($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (HEAPU8[$0_1 + 223 | 0] != 2) { break block } HEAP32[$4_1 + 12 >> 2] = $3; $3 = $135(HEAP32[$0_1 >> 2], $2_1, $3); $5_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = HEAP32[$5_1 + 108 >> 2]; $859($5_1, 188, $2_1, HEAP32[$0_1 + 236 >> 2], 0, $3, -6); if (!$1_1) { break block } HEAP32[$0_1 + 236 >> 2] = $2_1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1033($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $17_1 = global$0 - 16 | 0; $9_1 = $17_1; if (global$4 >>> 0 < $9_1 >>> 0 | global$5 >>> 0 > $9_1 >>> 0) { fimport$30($9_1 | 0) } global$0 = $9_1; $16_1 = $4_1 ? HEAPU8[$4_1 + 1 | 0] : $16_1; $12_1 = HEAP32[$5_1 + 4 >> 2]; $14 = HEAPU8[$5_1 | 0]; $8_1 = HEAP32[$0_1 + 8 >> 2]; $11_1 = $3 ? (HEAP32[$3 >> 2] ? $3 : 0) : $11_1; if (!($16_1 | $11_1)) { $1036($8_1, HEAP32[$1_1 + 12 >> 2], $6_1) } $10_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]; $9_1 = HEAP32[$5_1 + 12 >> 2]; block6 : { if (!$9_1) { block5 : { if (!$11_1) { $3 = HEAP32[$0_1 + 48 >> 2]; break block5; } $15_1 = HEAP32[HEAP32[$11_1 >> 2] >> 2] + ((HEAPU8[$11_1 + 32 | 0] ^ -1) & 1) | 0; $3 = $15_1 + HEAP32[$0_1 + 48 >> 2] | 0; } $9_1 = $3 + 1 | 0; HEAP32[$5_1 + 12 >> 2] = $9_1; HEAP32[$0_1 + 48 >> 2] = $3 + $10_1; break block6; } $3 = HEAP32[$0_1 + 48 >> 2]; if (($3 | 0) >= ($9_1 + $10_1 | 0)) { break block6 } HEAP32[$0_1 + 48 >> 2] = $3 + $10_1; } HEAP32[$5_1 + 16 >> 2] = $10_1; $3 = 0; block16 : { block8 : { if (($2_1 | 0) >= 0) { $13_1 = ($10_1 | 0) > 0 ? $10_1 : 0; while (1) { if (($3 | 0) == ($13_1 | 0)) { break block8 } $835($8_1, 94, $2_1, $3, $3 + $9_1 | 0); $3 = $3 + 1 | 0; continue; }; } $13_1 = 1; block9 : { if ($14 - 9 >>> 0 < 2) { break block9 } if (($14 | 0) == 3) { break block8 } if (($14 | 0) == 13) { break block9 } $13_1 = 0; } block14 : { if (!($16_1 | !$11_1 | ($14 & 253) == 12)) { $3 = HEAP32[$11_1 + 4 >> 2]; while (1) { $2_1 = HEAP32[$11_1 >> 2]; if (($3 | 0) < HEAP32[$2_1 >> 2]) { $2_1 = HEAPU16[($2_1 + ($3 << 4) | 0) + 20 >> 1]; if ($2_1) { $3 = $3 + 1 | 0; HEAP16[(HEAP32[$1_1 + 28 >> 2] + ($2_1 << 4) | 0) + 4 >> 1] = $3 - HEAP32[$11_1 + 4 >> 2]; continue; } else { $3 = $3 + 1 | 0; continue; } } break; }; $2_1 = HEAP32[$1_1 + 28 >> 2]; $3 = HEAP32[$2_1 >> 2]; $19_1 = ($3 | 0) > 0 ? $3 : 0; $20_1 = $2_1 + 20 | 0; $2_1 = $9_1; $3 = 0; while (1) { if (!(($3 | 0) == ($19_1 | 0))) { $18_1 = HEAPU16[$20_1 + ($3 << 4) >> 1]; $2_1 = $18_1 ? 0 : $2_1; $3 = $3 + 1 | 0; $10_1 = $10_1 - (($18_1 | 0) != 0) | 0; continue; } break; }; $13_1 = $13_1 | 12; break block14; } $2_1 = $9_1; } HEAP8[$17_1 + 12 | 0] = $13_1; HEAP32[$17_1 + 8 >> 2] = $9_1; if (!(!HEAP32[$1_1 + 8 >> 2] | !($13_1 & 8) | ($15_1 | 0) <= 0)) { HEAP32[$11_1 + 36 >> 2] = $17_1 + 8; $2_1 = 0; break block16; } $1304($0_1, $1_1, $17_1 + 8 | 0); break block16; } $2_1 = $9_1; } block17 : { if (!$16_1) { break block17 } $3 = HEAPU8[$4_1 + 1 | 0]; $13_1 = $1305($0_1, $3, HEAP32[$4_1 + 4 >> 2], $6_1, HEAP32[$1_1 + 28 >> 2], $9_1); $1057($0_1, $3, $13_1, HEAP32[$4_1 + 8 >> 2]); if ($11_1) { break block17 } $1036($8_1, HEAP32[$1_1 + 12 >> 2], $6_1); } block36 : { block32 : { block34 : { block21 : { block23 : { switch ($14 - 1 | 0) { case 0: $2_1 = $893($0_1); $835($8_1, 97, $9_1, $10_1, $2_1); $312($8_1, 138, $12_1, $2_1, $9_1, $10_1); $894($0_1, $2_1); break block21; case 1: $835($8_1, 140, $12_1, $9_1, $10_1); break block21; case 4: case 7: case 11: case 13: $4_1 = $15_1 + 1 | 0; $3 = $1060($0_1, $4_1); $5_1 = $3 + $15_1 | 0; $835($8_1, 97, $9_1, $10_1, $5_1); if (($14 | 0) == 5) { $6_1 = $12_1 + 1 | 0; $312($8_1, 29, $6_1, HEAP32[$8_1 + 108 >> 2] + 4 | 0, $3, 0); $312($8_1, 138, $6_1, $3, $9_1, $10_1); } block30 : { if ($11_1) { $1306($0_1, $11_1, $1_1, $5_1, $2_1, 1, $15_1); break block30; } $2_1 = $893($0_1); $326($8_1, 127, $12_1, $2_1); $835($8_1, 128, $12_1, $3, $2_1); $5_1 = HEAP32[$8_1 + 108 >> 2]; if (($5_1 | 0) > 0) { HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) - 18 >> 1] = 8 } $894($0_1, $2_1); } $1061($0_1, $3, $4_1); break block21; case 14: if ($11_1) { break block32 } $2_1 = HEAP32[$5_1 + 8 >> 2]; $0_1 = $893($0_1); $326($8_1, 51, $9_1, $7_1); $3 = $2_1 >>> 31 | 0; $835($8_1, 97, $3 + $9_1 | 0, $10_1 - $3 | 0, $0_1); if (($2_1 | 0) < 0) { $835($8_1, 128, $12_1, $0_1, $9_1); break block34; } $312($8_1, 138, $12_1, $0_1, $9_1, $2_1); break block34; case 10: if ($11_1) { $1306($0_1, $11_1, $1_1, $9_1, $2_1, $10_1, $15_1); HEAP32[$5_1 + 8 >> 2] = 0; break block36; } $2_1 = $893($0_1); $859($8_1, 97, $9_1, $10_1, $2_1, HEAP32[$5_1 + 20 >> 2], $10_1); $312($8_1, 138, $12_1, $2_1, $9_1, $10_1); $3 = HEAP32[$5_1 + 8 >> 2]; if ($3) { $312($8_1, 183, $3, 0, $9_1, $10_1); $1032($0_1, 0, 19623, 0); } $894($0_1, $2_1); break block34; case 2: $326($8_1, 71, 1, $12_1); break block21; case 9: if ($11_1) { break block32 } break block34; case 8: case 12: if ($11_1) { break block32 } if (($14 | 0) == 13) { $858($8_1, 12, HEAP32[$5_1 + 4 >> 2]); break block34; } $326($8_1, 84, $9_1, $10_1); break block34; case 5: case 6: break block23; default: break block21; }; } $13_1 = HEAP32[$5_1 + 24 >> 2]; $2_1 = HEAP32[$13_1 >> 2]; $5_1 = $893($0_1); $6_1 = $2_1 + 2 | 0; $4_1 = $1060($0_1, $6_1); $16_1 = $4_1 + $2_1 | 0; $3 = $16_1 + 1 | 0; $15_1 = 0; $14 = ($14 | 0) != 6; if (!$14) { $15_1 = $312($8_1, 29, $12_1 + 1 | 0, 0, $9_1, $10_1) } $835($8_1, 97, $9_1, $10_1, $3); block40 : { if ($14) { break block40 } $326($8_1, 138, $12_1 + 1 | 0, $3); $3 = HEAP32[$8_1 + 108 >> 2]; if (($3 | 0) <= 0) { break block40 } HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($3, 20) | 0) - 18 >> 1] = 16; } $3 = 0; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $9_1 = $9_1 - 1 | 0; $10_1 = $13_1 + 20 | 0; while (1) { if (!(($2_1 | 0) == ($3 | 0))) { $326($8_1, 81, $9_1 + HEAPU16[$10_1 + ($3 << 4) >> 1] | 0, $3 + $4_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; $326($8_1, 126, $12_1, $16_1); $835($8_1, 97, $4_1, $6_1, $5_1); $312($8_1, 138, $12_1, $5_1, $4_1, $6_1); if ($15_1) { $2_1 = HEAP32[$8_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$8_1 >> 2] + 87 | 0] ? $3 : HEAP32[$8_1 + 104 >> 2] + Math_imul($15_1, 20) | 0) + 8 >> 2] = $2_1; } $894($0_1, $5_1); $1061($0_1, $4_1, $6_1); } if ($11_1) { break block36 } } $0_1 = HEAP32[$1_1 + 8 >> 2]; if (!$0_1) { break block36 } $326($8_1, 61, $0_1, $7_1); break block36; } $1306($0_1, $11_1, $1_1, $9_1, $2_1, $10_1, $15_1); } $0_1 = $17_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1034($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (HEAP32[$1_1 + 8 >> 2]) { break block } $3 = HEAP32[$1_1 + 60 >> 2]; if (!$3) { break block } $5_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $5_1; HEAP32[$1_1 + 8 >> 2] = $5_1; $6_1 = $856($0_1); block3 : { if ($1074(HEAP32[$3 + 12 >> 2], $4_1 + 12 | 0, $0_1)) { $7_1 = HEAP32[$4_1 + 12 >> 2]; $326($6_1, 71, $7_1, $5_1); if (!$7_1) { $863($6_1, $2_1); break block3; } if (($7_1 | 0) < 0) { break block3 } $8_1 = HEAP16[$1_1 + 2 >> 1]; $2_1 = $433($7_1, 0); if (($8_1 | 0) <= ($2_1 | 0)) { break block3 } HEAP16[$1_1 + 2 >> 1] = $2_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 16384; break block3; } $862($0_1, HEAP32[$3 + 12 >> 2], $5_1); $858($6_1, 13, $5_1); $326($6_1, 17, $5_1, $2_1); } $2_1 = HEAP32[$3 + 16 >> 2]; if (!$2_1) { break block } $7_1 = $1_1; $3 = HEAP32[$0_1 + 48 >> 2]; $1_1 = $3 + 1 | 0; HEAP32[$7_1 + 12 >> 2] = $1_1; $3 = $3 + 2 | 0; HEAP32[$0_1 + 48 >> 2] = $3; $862($0_1, $2_1, $1_1); $858($6_1, 13, $1_1); $835($6_1, 160, $5_1, $3, $1_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1035($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block2 : { $6_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 + 48 >> 2]; if ($3) { $2_1 = HEAP32[$3 >> 2] } else { $2_1 = 0 } $5_1 = $1078($6_1, $2_1 + 1 | 0, 1); if (!$5_1) { break block2 } $7_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $8_1 = $5_1 + 20 | 0; $9_1 = $3 + 8 | 0; while (1) { if (($4_1 | 0) == ($7_1 | 0)) { break block2 } $3 = ($4_1 << 4) + $9_1 | 0; $2_1 = HEAP32[$3 >> 2]; block4 : { if (HEAPU8[$2_1 + 5 | 0] & 2) { $2_1 = $851($0_1, $2_1); break block4; } $10_1 = $2_1; $2_1 = $1079($0_1, $1_1, HEAPU16[$3 + 12 >> 1] - 1 | 0); if (!$2_1) { $2_1 = HEAP32[$6_1 + 8 >> 2] } HEAP32[$3 >> 2] = $1246($0_1, $10_1, HEAP32[$2_1 >> 2]); } HEAP32[($4_1 << 2) + $8_1 >> 2] = $2_1; HEAP8[HEAP32[$5_1 + 16 >> 2] + $4_1 | 0] = HEAPU8[$3 + 8 | 0]; $4_1 = $4_1 + 1 | 0; continue; }; } return $5_1; } function $1036($0_1, $1_1, $2_1) { if (($1_1 | 0) > 0) { $835($0_1, 50, $1_1, $2_1, 1) } } function $1037($0_1, $1_1) { var $2_1 = 0, $3 = 0; while (1) { block1 : { block : { if (!$1_1 | HEAP32[$0_1 + 20 >> 2] & HEAP32[$1_1 + 4 >> 2]) { break block } $2_1 = HEAPU8[$1_1 | 0]; if (($2_1 | 0) == 44) { break block1 } if (($2_1 | 0) != 54) { break block } $2_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$1_1 + 16 >> 2]; block2 : { if (HEAPU8[$3 | 0] != 168) { break block2 } if (!$944(HEAP32[$0_1 >> 2], $2_1)) { break block2 } $1315($0_1, $3, $2_1, $1_1); } if (HEAPU8[$2_1 | 0] != 168) { break block } if (!$944(HEAP32[$0_1 >> 2], $3)) { break block } $1315($0_1, $2_1, $3, $1_1); } return; } $1037($0_1, HEAP32[$1_1 + 16 >> 2]); $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; }; } function $1038($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $0_1 = HEAP32[$0_1 + 24 >> 2]; block1 : { block : { if (!HEAP32[$0_1 + 16 >> 2]) { break block } $2_1 = HEAPU8[$1_1 | 0] - 45 | 0; if ($2_1 >>> 0 > 13) { break block } $3 = 1; if (!(1 << $2_1 & 15873)) { break block } $1316($0_1, HEAP32[$1_1 + 12 >> 2], 0); if (HEAPU8[HEAP32[$0_1 + 4 >> 2]]) { break block1 } if (($971(HEAP32[$1_1 + 12 >> 2]) | 0) == 66) { break block } $1316($0_1, HEAP32[$1_1 + 16 >> 2], 0); } $3 = $1316($0_1, $1_1, HEAP32[$0_1 + 16 >> 2]); } return $3 | 0; } function $1039($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$1_1 + 44 >> 2]; $3 = HEAP32[$2_1 >> 2]; $13($0_1, $2_1); HEAP32[$1_1 + 44 >> 2] = 0; $0_1 = (HEAPU8[$1_1 + 13 | 0] | HEAPU8[$1_1 + 14 | 0] << 8) & 65531; HEAP8[$1_1 + 13 | 0] = $0_1; HEAP8[$1_1 + 14 | 0] = $0_1 >>> 8; return $3; } function $1040($0_1) { var $1_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 12 >> 2] = 0; $1132($0_1, $1_1 + 12 | 0); $0_1 = HEAP32[$1_1 + 12 >> 2]; $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1041($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $7_1 = global$0 - 32 | 0; $5_1 = $7_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $5_1 = 0; block : { if (!$2_1 | HEAP32[$1_1 + 4 >> 2] & 33562624) { break block } $8_1 = (Math_imul($4_1, 48) + $3 | 0) + 8 | 0; if (HEAPU8[$8_1 + 12 | 0] & 80) { break block } block5 : { block6 : { if (HEAP32[$1_1 + 52 >> 2]) { $5_1 = $1_1; while (1) { if ($5_1) { block3 : { switch (HEAPU8[$5_1 | 0] - 136 | 0) { default: $6_1 = 1; break; case 0: case 3: break block3; }; } if (HEAP32[$5_1 + 68 >> 2]) { break block5 } $5_1 = HEAP32[$5_1 + 52 >> 2]; continue; } break; }; if (!$6_1) { break block6 } $6_1 = $1_1; while (1) { if (!$6_1) { break block6 } $9_1 = HEAP32[$6_1 + 28 >> 2]; $11_1 = $9_1 + 8 | 0; $5_1 = 0; while (1) { if (($5_1 | 0) < HEAP32[$9_1 >> 2]) { $10_1 = $851($0_1, HEAP32[($5_1 << 4) + $11_1 >> 2]); if (!!$10_1 & HEAP32[$10_1 + 12 >> 2] != 15) { break block5 } $5_1 = $5_1 + 1 | 0; continue; } break; }; $6_1 = HEAP32[$6_1 + 52 >> 2]; continue; }; } $5_1 = HEAP32[$1_1 + 68 >> 2]; if (!$5_1) { break block6 } if (!HEAP32[$5_1 + 8 >> 2]) { break block5 } } $5_1 = 0; if (HEAP32[$1_1 + 60 >> 2]) { break block } while (1) { if (!(HEAPU8[$2_1 | 0] != 44)) { $5_1 = $1041($0_1, $1_1, HEAP32[$2_1 + 16 >> 2], $3, $4_1) + $5_1 | 0; $2_1 = HEAP32[$2_1 + 12 >> 2]; continue; } break; }; if (!$1264($2_1, $3, $4_1, 1)) { break block } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 16777216; $3 = $5_1 + 1 | 0; while (1) { if (!$1_1) { $5_1 = $3; break block; } $6_1 = $906(HEAP32[$0_1 >> 2], $2_1, 0); $1031($6_1, -1, 1); HEAP32[$7_1 + 8 >> 2] = $0_1; $4_1 = HEAP32[$8_1 + 16 >> 2]; HEAP32[$7_1 + 20 >> 2] = 0; HEAP32[$7_1 + 16 >> 2] = $4_1; HEAP32[$7_1 + 12 >> 2] = $4_1; HEAP32[$7_1 + 24 >> 2] = HEAP32[$1_1 + 28 >> 2]; HEAP32[$7_1 + 28 >> 2] = $1088($1_1); $4_1 = $1265($7_1 + 8 | 0, $6_1); block11 : { $6_1 = HEAP32[$1_1 + 68 >> 2]; if (!$6_1) { break block11 } if ($1266($0_1, $4_1, HEAP32[$6_1 + 8 >> 2])) { break block11 } $11(HEAP32[$0_1 >> 2], $4_1); break block; } $6_1 = ((HEAP32[$1_1 + 4 >> 2] & 8) + $1_1 | 0) + 36 | 0; HEAP32[$6_1 >> 2] = $948($0_1, HEAP32[$6_1 >> 2], $4_1); $1_1 = HEAP32[$1_1 + 52 >> 2]; continue; }; } $5_1 = 0; } $0_1 = $7_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1042($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { $4_1 = HEAP32[$1_1 >> 2]; $5_1 = $1078(HEAP32[$0_1 >> 2], $4_1 - $2_1 | 0, $3 + 1 | 0); if (!$5_1) { break block } $4_1 = ($2_1 | 0) < ($4_1 | 0) ? $4_1 : $2_1; $7_1 = $5_1 + 20 | 0; $3 = (($2_1 << 4) + $1_1 | 0) + 8 | 0; $1_1 = $2_1; while (1) { if (($1_1 | 0) == ($4_1 | 0)) { break block } $6_1 = $1_1 - $2_1 | 0; HEAP32[($6_1 << 2) + $7_1 >> 2] = $1267($0_1, HEAP32[$3 >> 2]); HEAP8[$6_1 + HEAP32[$5_1 + 16 >> 2] | 0] = HEAPU8[$3 + 8 | 0]; $3 = $3 + 16 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } return $5_1; } function $1043($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 >> 2]; if (HEAPU8[$3 + 87 | 0]) { $329($3, $2_1, $1_1); return; } $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0; HEAP32[$0_1 - 4 >> 2] = $1_1; HEAP8[$0_1 - 19 | 0] = $2_1; } function $1044($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0; $20_1 = global$0 - 160 | 0; $8_1 = $20_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $8_1; $14 = HEAP32[$0_1 + 8 >> 2]; $33_1 = HEAP32[$0_1 >> 2]; $8_1 = 0; HEAP32[$20_1 + 60 >> 2] = 0; HEAP32[$20_1 + 52 >> 2] = 0; HEAP32[$20_1 + 56 >> 2] = 0; block : { if (!$3) { break block } if (HEAP32[$3 >> 2] < 64) { $8_1 = $3; break block; } $6_1 = $6_1 & 24319 | 8192; } $3 = HEAP32[$1_1 >> 2]; block102 : { block3 : { if (($3 | 0) >= 65) { HEAP32[$20_1 >> 2] = 64; $257($0_1, 11332, $20_1); break block3; } $26_1 = $6_1 & 32 ? 1 : $3; $15_1 = Math_imul($26_1, 96); $13_1 = ($26_1 | 0) <= 1 ? 856 : $15_1 + 767 & -8; $9_1 = $325($33_1, $13_1 + 72 | 0, 0); if (HEAPU8[$33_1 + 87 | 0]) { $10($33_1, $9_1); break block3; } HEAP32[$9_1 + 12 >> 2] = $4_1; HEAP32[$9_1 + 8 >> 2] = $8_1; HEAP32[$9_1 + 4 >> 2] = $1_1; HEAP32[$9_1 >> 2] = $0_1; HEAP8[$9_1 + 44 | 0] = $26_1; HEAP32[$9_1 + 20 >> 2] = -1; HEAP32[$9_1 + 24 >> 2] = -1; $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; HEAP16[$9_1 + 42 >> 1] = $7_1; HEAP16[$9_1 + 40 >> 1] = $6_1; HEAP32[$9_1 + 32 >> 2] = $3; HEAP32[$9_1 + 28 >> 2] = $3; $3 = HEAP16[$0_1 + 160 >> 1]; HEAP32[$9_1 + 16 >> 2] = $5_1; HEAP32[$9_1 + 36 >> 2] = $3; $10_1 = $9_1 + 45 | 0; wasm2js_memory_fill($10_1, 0, 35); $38_1 = $9_1 + 760 | 0; $3 = $15_1 + 72 | 0; if ($3) { wasm2js_memory_fill($38_1, 0, $3) } HEAP32[$9_1 + 500 >> 2] = 0; HEAP32[$9_1 + 504 >> 2] = -99; $3 = $9_1 + $13_1 | 0; HEAP32[$20_1 + 48 >> 2] = $3; $34_1 = $9_1 + 80 | 0; HEAP32[$20_1 + 44 >> 2] = $34_1; HEAP32[$20_1 + 40 >> 2] = $9_1; HEAP16[$3 + 48 >> 1] = 3; HEAP16[$3 + 44 >> 1] = 0; HEAP32[$3 + 52 >> 2] = $3 + 60; HEAP32[$3 + 40 >> 2] = 0; HEAP8[$9_1 + 89 | 0] = 0; HEAP32[$9_1 + 100 >> 2] = 0; HEAP32[$9_1 + 84 >> 2] = 0; HEAP32[$9_1 + 104 >> 2] = $9_1 + 112; HEAP32[$9_1 + 92 >> 2] = 0; HEAP32[$9_1 + 96 >> 2] = 8; HEAP32[$9_1 + 80 >> 2] = $9_1; $1268($34_1, $2_1, 44); block11 : { if ($26_1) { $12_1 = $9_1 + 504 | 0; $17_1 = $1_1 + 8 | 0; while (1) { $2_1 = $17_1 + Math_imul($11_1, 48) | 0; $3 = HEAP32[$2_1 + 16 >> 2]; $15_1 = HEAP32[$9_1 + 500 >> 2]; HEAP32[$9_1 + 500 >> 2] = $15_1 + 1; HEAP32[$12_1 + ($15_1 << 2) >> 2] = $3; block8 : { if (!(HEAPU8[$2_1 + 13 | 0] & 8)) { break block8 } $10_1 = HEAP32[$2_1 + 32 >> 2]; if (!$10_1) { break block8 } $13_1 = HEAP32[$2_1 + 8 >> 2]; $30_1 = $10_1 + 8 | 0; $3 = 0; $16_1 = 0; while (1) { if (HEAP32[$10_1 >> 2] <= ($16_1 | 0)) { break block8 } $15_1 = HEAP16[$13_1 + 34 >> 1]; $15_1 = ($3 | 0) > ($15_1 | 0) ? $3 : $15_1; block9 : { while (1) { if (($3 | 0) == ($15_1 | 0)) { break block9 } if (!(HEAPU8[(HEAP32[$13_1 + 4 >> 2] + Math_imul($3, 12) | 0) + 10 | 0] & 2)) { $3 = $3 + 1 | 0; continue; } break; }; $15_1 = $951(HEAP32[$0_1 >> 2], 168, 0, 0); if (!$15_1) { break block8 } $21_1 = HEAP32[$2_1 + 16 >> 2]; HEAP32[$15_1 + 44 >> 2] = $13_1; HEAP16[$15_1 + 32 >> 1] = $3; HEAP32[$15_1 + 28 >> 2] = $21_1; $21_1 = HEAP32[$2_1 + 28 >> 2]; HEAP32[$2_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2] | $1238($15_1); HEAP32[$2_1 + 28 >> 2] = i64toi32_i32$HIGH_BITS | $21_1; $15_1 = $903($0_1, 54, $15_1, $903($0_1, 173, $906(HEAP32[$0_1 >> 2], HEAP32[$30_1 + ($16_1 << 4) >> 2], 0), 0)); $1087($15_1, HEAP32[$2_1 + 16 >> 2], HEAPU8[$2_1 + 12 | 0] & 24 ? 1 : 2); $1269($34_1, $15_1, 1); $16_1 = $16_1 + 1 | 0; $3 = $3 + 1 | 0; continue; } break; }; $2_1 = HEAP32[$13_1 >> 2]; HEAP32[$20_1 + 36 >> 2] = $16_1; HEAP32[$20_1 + 32 >> 2] = $2_1; $257($0_1, 17142, $20_1 + 32 | 0); } $11_1 = $11_1 + 1 | 0; if (($11_1 | 0) < HEAP32[$1_1 >> 2]) { continue } break; }; break block11; } if ($8_1) { HEAP8[$10_1 | 0] = HEAP32[$8_1 >> 2] } if (!(!($6_1 & 256) | HEAPU8[$33_1 + 80 | 0] & 16)) { HEAP8[$9_1 + 47 | 0] = 1 } $2_1 = HEAP32[$9_1 + 16 >> 2]; if (!$2_1 | HEAPU8[$2_1 + 5 | 0] & 4) { break block11 } $1032($0_1, 0, 18808, 0); } $1270($1_1, $34_1); if (!(!$5_1 | !HEAP32[$5_1 + 60 >> 2])) { $17_1 = 0; block0 : { if (HEAP32[$5_1 + 40 >> 2]) { break block0 } $13_1 = HEAP32[$5_1 + 4 >> 2]; if ($13_1 & 9) { break block0 } $2_1 = HEAP32[$5_1 + 32 >> 2]; if (HEAP32[$2_1 >> 2] != 1 | HEAPU8[HEAP32[$2_1 + 16 >> 2] + 43 | 0] != 1) { break block0 } $3 = HEAP32[$34_1 + 12 >> 2]; $10_1 = ($3 | 0) > 0 ? $3 : 0; $2_1 = HEAP32[$2_1 + 24 >> 2]; $15_1 = HEAP32[$5_1 + 48 >> 2]; while (1) { if (($10_1 | 0) != ($17_1 | 0)) { $3 = HEAP32[$34_1 + 24 >> 2] + Math_imul($17_1, 48) | 0; if (!(HEAP32[$3 + 32 >> 2] | HEAP32[$3 + 36 >> 2] | HEAP32[$3 + 20 >> 2] != ($2_1 | 0) ? HEAPU8[$3 + 10 | 0] & 4 | HEAPU8[$3 + 14 | 0] : 1)) { break block0 } $17_1 = $17_1 + 1 | 0; continue; } break; }; block34 : { if (!$15_1) { break block34 } $17_1 = 0; $3 = HEAP32[$15_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $15_1 = $15_1 + 8 | 0; while (1) { if (($3 | 0) == ($17_1 | 0)) { break block34 } $10_1 = $15_1 + ($17_1 << 4) | 0; $11_1 = HEAP32[$10_1 >> 2]; if (HEAPU8[$11_1 | 0] != 168 | HEAP32[$11_1 + 28 >> 2] != ($2_1 | 0)) { break block0 } $17_1 = $17_1 + 1 | 0; if (!(HEAPU8[$10_1 + 8 | 0] & 2)) { continue } break; }; break block0; } $3 = HEAP32[$5_1 + 12 >> 2]; block4 : { if (!$3) { break block4 } if ($13_1 & 256) { break block0 } $1320($34_1, $3, HEAP32[HEAP32[$5_1 + 60 >> 2] + 16 >> 2], $2_1, 74); if (!HEAP32[$5_1 + 12 >> 2]) { break block4 } if (HEAP8[$5_1 + 5 | 0] & 1) { break block0 } } $1320($34_1, HEAP32[$5_1 + 8 >> 2], HEAP32[HEAP32[$5_1 + 60 >> 2] + 12 >> 2], $2_1, 73); } } block15 : { if (HEAP32[$0_1 + 40 >> 2]) { break block15 } $39_1 = $9_1 + 496 | 0; $5_1 = $20_1 + 72 | 0; $13_1 = $20_1 + 88 | 0; $2_1 = $34_1; $3 = 0; while (1) { if (($3 | 0) < HEAP32[$2_1 + 20 >> 2]) { $2_1 = HEAP32[$2_1 + 24 >> 2] + Math_imul($3, 48) | 0; block17 : { if (HEAPU8[$2_1 + 10 | 0] & 2 | (HEAP32[$2_1 + 40 >> 2] | HEAP32[$2_1 + 44 >> 2])) { break block17 } $15_1 = HEAP32[$2_1 >> 2]; if ($26_1) { HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; $10_1 = $20_1 - -64 | 0; $11_1 = $10_1 + 16 | 0; HEAP32[$11_1 >> 2] = 0; HEAP32[$11_1 + 4 >> 2] = 0; HEAP32[$13_1 >> 2] = 0; HEAP32[$5_1 >> 2] = 62; HEAP32[$20_1 + 64 >> 2] = 0; HEAP32[$20_1 + 68 >> 2] = 0; HEAP32[$20_1 + 68 >> 2] = 72; HEAP16[$20_1 + 84 >> 1] = 1; $920($10_1, $15_1); if (!HEAPU16[$20_1 + 84 >> 1]) { break block17 } } if (HEAPU8[$1_1 + 20 | 0] & 64 ? HEAPU8[$15_1 + 4 | 0] & 2 : 0) { break block17 } $1059($0_1, $15_1, HEAP32[$9_1 + 32 >> 2], 16); HEAP16[$2_1 + 10 >> 1] = HEAPU16[$2_1 + 10 >> 1] | 4; } $3 = $3 + 1 | 0; $2_1 = HEAP32[$20_1 + 44 >> 2]; continue; } break; }; block20 : { if (!($6_1 & 256)) { break block20 } if (HEAPU8[$33_1 + 80 | 0] & 16) { HEAP16[$9_1 + 40 >> 1] = HEAPU16[$9_1 + 40 >> 1] & 65279; $6_1 = $6_1 & 32511; break block20; } block22 : { if (HEAP32[$1_1 >> 2] != 1) { break block22 } $2_1 = HEAP32[$4_1 >> 2]; $15_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $13_1 = $4_1 + 8 | 0; $10_1 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$1_1 + 24 >> 2]; $3 = 0; block26 : { while (1) { if (($3 | 0) != ($15_1 | 0)) { $2_1 = $1063(HEAP32[$13_1 + ($3 << 4) >> 2]); block24 : { if (!$2_1) { break block24 } block25 : { switch (HEAPU8[$2_1 | 0] - 168 | 0) { case 0: case 2: break block25; default: break block24; }; } if (($5_1 | 0) != HEAP32[$2_1 + 28 >> 2]) { break block24 } if (HEAP16[$2_1 + 32 >> 1] < 0) { break block26 } } $3 = $3 + 1 | 0; continue; } break; }; $3 = $10_1 + 8 | 0; while (1) { $2_1 = HEAP32[$3 >> 2]; if (!$2_1) { break block22 } if (!(HEAP32[$2_1 + 36 >> 2] | !HEAPU8[$2_1 + 54 | 0])) { $16_1 = 0; while (1) { block28 : { if (HEAPU16[$2_1 + 50 >> 1] <= $16_1 >>> 0) { break block28 } if (!$1273($34_1, $5_1, $16_1, -1, -1, 2, $2_1)) { $10_1 = HEAP32[HEAP32[$2_1 + 32 >> 2] + ($16_1 << 2) >> 2]; $3 = 0; while (1) { if (HEAP32[$4_1 >> 2] <= ($3 | 0)) { break block28 } block32 : { $11_1 = HEAP32[$13_1 + ($3 << 4) >> 2]; $15_1 = $1063($11_1); block30 : { if (!$15_1) { break block30 } block31 : { switch (HEAPU8[$15_1 | 0] - 168 | 0) { case 0: case 2: break block31; default: break block30; }; } if (HEAPU16[$15_1 + 32 >> 1] != HEAPU16[HEAP32[$2_1 + 4 >> 2] + ($16_1 << 1) >> 1] | ($5_1 | 0) != HEAP32[$15_1 + 28 >> 2]) { break block30 } if (!$67(HEAP32[$1267($0_1, $11_1) >> 2], $10_1)) { break block32 } } $3 = $3 + 1 | 0; continue; } break; }; if (!$1274($2_1, $16_1)) { break block28 } } $16_1 = $16_1 + 1 | 0; continue; } break; }; if (HEAPU16[$2_1 + 50 >> 1] == ($16_1 | 0)) { break block26 } } $3 = $2_1 + 20 | 0; continue; }; } HEAP8[$9_1 + 47 | 0] = 1; break block20; } if ($8_1) { break block20 } HEAP32[$9_1 + 8 >> 2] = $4_1; HEAP16[$9_1 + 40 >> 1] = HEAPU16[$9_1 + 40 >> 1] | 128; } block62 : { block61 : { block57 : { block45 : { block44 : { block43 : { block35 : { $2_1 = HEAP32[$20_1 + 40 >> 2]; block33 : { if (HEAPU8[$2_1 + 40 | 0] & 32 | ($26_1 | 0) != 1) { break block33 } $13_1 = HEAP32[$2_1 + 4 >> 2]; $8_1 = HEAP32[$13_1 + 16 >> 2]; if (HEAPU8[$8_1 + 43 | 0] == 1 | HEAPU8[$13_1 + 21 | 0] & 3) { break block33 } $10_1 = HEAP32[$13_1 + 24 >> 2]; $5_1 = HEAP32[$20_1 + 48 >> 2]; HEAP16[$5_1 + 46 >> 1] = 0; HEAP32[$5_1 + 40 >> 2] = 0; $11_1 = $2_1 + 80 | 0; $3 = $1275($20_1 - -64 | 0, $11_1, $10_1, -1, 130, 0); while (1) { if ($3) { if (!(HEAP32[$3 + 32 >> 2] | HEAP32[$3 + 36 >> 2])) { break block35 } $3 = $1276($20_1 - -64 | 0); continue; } break; }; $3 = $8_1 + 8 | 0; while (1) { $8_1 = HEAP32[$3 >> 2]; if ($8_1) { block37 : { if (HEAP32[$8_1 + 36 >> 2] | !HEAPU8[$8_1 + 54 | 0]) { break block37 } $3 = HEAPU16[$8_1 + 50 >> 1]; if ($3 >>> 0 > 3) { break block37 } $12_1 = HEAPU8[$8_1 + 55 | 0] & 8 ? 130 : 2; $15_1 = 0; block38 : { while (1) { $3 = $3 & 65535; if ($15_1 >>> 0 >= $3 >>> 0) { break block38 } $3 = $1275($20_1 - -64 | 0, $11_1, $10_1, $15_1, $12_1, $8_1); block39 : { while (1) { if (!$3) { break block39 } if (HEAP32[$3 + 32 >> 2] | HEAP32[$3 + 36 >> 2]) { $3 = $1276($20_1 - -64 | 0); continue; } break; }; HEAP32[HEAP32[$5_1 + 52 >> 2] + ($15_1 << 2) >> 2] = $3; $15_1 = $15_1 + 1 | 0; $3 = HEAPU16[$8_1 + 50 >> 1]; continue; } break; }; $3 = HEAPU16[$8_1 + 50 >> 1]; } if (($3 | 0) != ($15_1 | 0)) { break block37 } $17_1 = 4609; HEAP32[$5_1 + 40 >> 2] = 4609; if (HEAP32[$8_1 + 64 >> 2] & HEAP32[$13_1 + 32 >> 2] | HEAP32[$8_1 + 68 >> 2] & HEAP32[$13_1 + 36 >> 2] ? HEAPU8[$8_1 + 55 | 0] & 32 : 1) { HEAP32[$5_1 + 40 >> 2] = 4673; $17_1 = 4673; } HEAP32[$5_1 + 32 >> 2] = $8_1; HEAP16[$5_1 + 24 >> 1] = $15_1; HEAP16[$5_1 + 44 >> 1] = $15_1; $3 = 39; break block43; } $3 = $8_1 + 20 | 0; continue; } break; }; $17_1 = HEAP32[$5_1 + 40 >> 2]; if ($17_1) { break block44 } $2_1 = HEAP32[$20_1 + 40 >> 2]; } $21_1 = HEAP32[HEAP32[$2_1 >> 2] >> 2]; $3 = HEAP32[$2_1 + 4 >> 2]; $5_1 = HEAPU8[$2_1 + 44 | 0]; HEAP32[$20_1 + 60 >> 2] = 2e4; $11_1 = $3 + 8 | 0; $19_1 = $11_1 + Math_imul($5_1, 48) | 0; $22_1 = $2_1 + 496 | 0; $12_1 = HEAP32[$20_1 + 48 >> 2]; $13_1 = 0; $16_1 = 0; $8_1 = 0; $17_1 = 0; $30_1 = 0; while (1) { if ($11_1 >>> 0 >= $19_1 >>> 0) { break block45 } HEAP8[$12_1 + 16 | 0] = $13_1; HEAP32[$20_1 + 60 >> 2] = HEAP32[$20_1 + 60 >> 2] + 1e3; HEAP32[$12_1 + 8 >> 2] = $1277($22_1, HEAP32[$11_1 + 16 >> 2]); HEAP32[$12_1 + 12 >> 2] = i64toi32_i32$HIGH_BITS; $2_1 = HEAPU8[$11_1 + 12 | 0]; block48 : { if ($8_1 | $2_1 & 98) { $17_1 = $2_1 & 64 ? 1 : $17_1; $30_1 = $16_1 | $30_1; $31_1 = $18_1 | $31_1; $8_1 = $2_1 >>> 4 & 1; break block48; } $30_1 = $17_1 ? $30_1 : 0; $31_1 = $17_1 ? $31_1 : 0; $17_1 = ($17_1 | 0) != 0; $8_1 = 0; } $15_1 = 0; $23_1 = 0; block58 : { block56 : { $2_1 = $11_1; block52 : { if (HEAPU8[HEAP32[$2_1 + 8 >> 2] + 43 | 0] == 1) { while (1) { block50 : { $10_1 = $15_1; $5_1 = $23_1; $3 = $2_1; $2_1 = $3 + 48 | 0; if ($19_1 >>> 0 <= $2_1 >>> 0) { break block50 } if (!($5_1 | $10_1)) { $15_1 = 0; $23_1 = 0; if (!(HEAPU8[$3 + 60 | 0] & 34)) { continue } } $15_1 = $1277($22_1, HEAP32[$3 + 64 >> 2]) | $10_1; $23_1 = $5_1 | i64toi32_i32$HIGH_BITS; continue; } break; }; $3 = $1278($20_1 + 40 | 0, $30_1, $31_1, $10_1, $5_1); break block52; } $10_1 = 0; $5_1 = 0; $3 = $1279($20_1 + 40 | 0, $30_1, $31_1); } block55 : { if (!$3) { if (!HEAPU8[HEAP32[$20_1 + 44 >> 2] + 9 | 0]) { $16_1 = $16_1 | HEAP32[$12_1 + 8 >> 2]; $18_1 = $18_1 | HEAP32[$12_1 + 12 >> 2]; break block55; } $3 = $1280($20_1 + 40 | 0, $30_1, $31_1, $10_1, $5_1); } $16_1 = $16_1 | HEAP32[$12_1 + 8 >> 2]; $18_1 = $18_1 | HEAP32[$12_1 + 12 >> 2]; if (($3 | 0) == 101) { break block56 } if ($3) { break block57 } } if (HEAPU8[$21_1 + 87 | 0]) { break block45 } break block58; } $64(28, 12453, 0); } $11_1 = $11_1 + 48 | 0; $13_1 = $13_1 + 1 | 0; continue; }; } $17_1 = 4353; HEAP32[$5_1 + 40 >> 2] = 4353; HEAP32[HEAP32[$5_1 + 52 >> 2] >> 2] = $3; HEAP16[$5_1 + 24 >> 1] = 1; HEAP16[$5_1 + 44 >> 1] = 1; $3 = 33; } HEAP16[$5_1 + 20 >> 1] = $3; } HEAP16[$5_1 + 22 >> 1] = 1; HEAP32[$2_1 + 840 >> 2] = $5_1; HEAP32[$5_1 + 8 >> 2] = 1; HEAP32[$5_1 + 12 >> 2] = 0; HEAP16[$2_1 + 50 >> 1] = 1; HEAP32[$2_1 + 764 >> 2] = $10_1; $3 = HEAP32[$2_1 + 8 >> 2]; if ($3) { HEAP8[$2_1 + 45 | 0] = HEAP32[$3 >> 2] } if (HEAP8[$2_1 + 41 | 0] & 1) { HEAP8[$2_1 + 47 | 0] = 1 } if (HEAPU8[$20_1 + 89 | 0] < 2) { break block61 } HEAP32[$5_1 + 40 >> 2] = $17_1 | 2097152; break block61; } $3 = 0; } $1281($21_1, $12_1); if ($3) { break block62 } $1282($9_1, 0); if (HEAPU8[$33_1 + 87 | 0]) { break block62 } if (HEAP32[$9_1 + 8 >> 2]) { $13_1 = 0; $2_1 = $9_1 + 60 | 0; $5_1 = $9_1 + 840 | 0; $8_1 = HEAPU8[$9_1 + 44 | 0]; while (1) { block10 : { if (($8_1 | 0) == ($13_1 | 0)) { break block10 } $3 = HEAP32[Math_imul($13_1, 96) + $5_1 >> 2]; if (!$3) { break block10 } block1 : { $15_1 = HEAP32[$3 + 40 >> 2]; if ($15_1 & 1024) { break block1 } if (!($15_1 & 13)) { break block10 } $15_1 = HEAPU8[$3 + 16 | 0]; $3 = $2_1; while (1) { $3 = HEAP32[$3 >> 2]; if (!$3) { break block1 } if (!(HEAPU16[$3 + 40 >> 1] & 16399 | ($15_1 | 0) != HEAPU8[$3 + 16 | 0])) { HEAP32[$3 >> 2] = -1; HEAP32[$3 + 4 >> 2] = -1; } $3 = $3 + 56 | 0; continue; }; } $13_1 = $13_1 + 1 | 0; continue; } break; }; $2_1 = HEAP16[$9_1 + 50 >> 1]; $1282($9_1, (($2_1 | 0) > 0 ? $2_1 : 0) + 1 << 16 >> 16); if (HEAPU8[$33_1 + 87 | 0]) { break block15 } } if (!(HEAP8[$9_1 + 41 | 0] & 1)) { break block61 } HEAP16[$9_1 + 50 >> 1] = HEAPU16[$9_1 + 50 >> 1] - 30; } if (!(HEAP32[$9_1 + 8 >> 2] | !(HEAPU8[$33_1 + 33 | 0] & 16))) { $10_1 = 0; $2_1 = HEAP32[$9_1 + 4 >> 2]; $3 = $2_1 + 8 | 0; $2_1 = HEAP32[$2_1 >> 2]; $5_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $13_1 = 0; while (1) { if (!(!$13_1 & ($5_1 | 0) == ($10_1 | 0))) { $2_1 = Math_imul($10_1, 48) + $3 | 0; $8_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; if (HEAP32[HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2] + 48 >> 2] ? !($8_1 & 512) | !($8_1 & 4) | HEAPU8[HEAP32[$2_1 + 36 >> 2] + 18 | 0] : 1) { $8_1 = HEAP32[$9_1 + 76 >> 2]; $2_1 = $10_1 & 31; if (($10_1 & 63) >>> 0 >= 32) { $15_1 = 1 << $2_1; $11_1 = 0; } else { $11_1 = 1 << $2_1; $15_1 = $11_1 - 1 & 1 >>> 32 - $2_1; } HEAP32[$9_1 + 72 >> 2] = $11_1 | HEAP32[$9_1 + 72 >> 2]; HEAP32[$9_1 + 76 >> 2] = $8_1 | $15_1; } $10_1 = $10_1 + 1 | 0; $13_1 = $10_1 ? $13_1 : $13_1 + 1 | 0; continue; } break; }; } if (HEAP32[$0_1 + 40 >> 2]) { break block15 } $30_1 = -1; $31_1 = -1; $3 = HEAPU8[$9_1 + 44 | 0]; block67 : { block66 : { if (!($6_1 & 9216 | (!$4_1 | $3 >>> 0 < 2))) { $3 = HEAP32[$33_1 + 80 >> 2]; if ($3 & 256) { break block66 } $2_1 = $9_1 + 496 | 0; $13_1 = $1324($2_1, HEAP32[$9_1 + 12 >> 2]); $10_1 = i64toi32_i32$HIGH_BITS; $3 = HEAP32[$9_1 + 8 >> 2]; if ($3) { $13_1 = $1324($2_1, $3) | $13_1; $10_1 = $10_1 | i64toi32_i32$HIGH_BITS; } $16_1 = $9_1 + 760 | 0; $2_1 = HEAP32[$9_1 + 4 >> 2]; $19_1 = $2_1 + 8 | 0; $26_1 = HEAPU8[$9_1 + 44 | 0]; $5_1 = $26_1; $4_1 = 0; $22_1 = HEAPU8[$2_1 + 20 | 0] & 64; $21_1 = -1; $18_1 = -1; label18 : while (1) { $3 = $4_1; if (!($5_1 >>> 0 < 2 & ($3 | 0) <= 0 | ($3 | 0) < 0)) { $2_1 = $3 - 1 | 0; $8_1 = $2_1 + 1 | 0; $4_1 = $2_1; $2_1 = $5_1; $5_1 = $2_1 - 1 | 0; $4_1 = ($5_1 | 0) != -1 ? $8_1 : $4_1; $24_1 = Math_imul($5_1, 96) + $16_1 | 0; $8_1 = HEAP32[$24_1 + 80 >> 2]; $17_1 = Math_imul(HEAPU8[$8_1 + 16 | 0], 48) + $19_1 | 0; if ((HEAPU8[$17_1 + 12 | 0] & 24) != 8 | !(HEAP8[$9_1 + 41 | 0] & 1 | HEAPU8[$8_1 + 41 | 0] & 16)) { continue } $11_1 = HEAP32[$8_1 + 8 >> 2]; $12_1 = HEAP32[$8_1 + 12 >> 2]; if ($13_1 & $11_1 | $10_1 & $12_1) { continue } $8_1 = HEAP32[$9_1 + 104 >> 2]; $30_1 = $8_1 + Math_imul(HEAP32[$9_1 + 92 >> 2], 48) | 0; $15_1 = $8_1; while (1) { if ($15_1 >>> 0 < $30_1 >>> 0) { if ($11_1 & HEAP32[$15_1 + 40 >> 2] | $12_1 & HEAP32[$15_1 + 44 >> 2]) { $23_1 = HEAP32[$15_1 >> 2]; if (!(HEAP8[$23_1 + 4 | 0] & 1) | HEAP32[$23_1 + 36 >> 2] != HEAP32[$17_1 + 16 >> 2]) { continue label18 } } block5 : { if (!$22_1) { break block5 } $23_1 = HEAP32[$15_1 >> 2]; if (!(HEAPU8[$23_1 + 4 | 0] & 2)) { break block5 } if (HEAP32[$23_1 + 36 >> 2] == HEAP32[$17_1 + 16 >> 2]) { continue label18 } } $15_1 = $15_1 + 48 | 0; continue; } break; }; $17_1 = HEAP32[$9_1 + 72 >> 2]; $23_1 = HEAP32[$9_1 + 76 >> 2]; $31_1 = $23_1 >>> 1 | 0; $15_1 = $5_1 & 31; if (($5_1 & 63) >>> 0 >= 32) { $15_1 = -1 << $15_1; $25 = 0; } else { $25 = -1 << $15_1; $15_1 = $25 | (1 << $15_1) - 1 & -1 >>> 32 - $15_1; } HEAP32[$9_1 + 72 >> 2] = $25 & (($23_1 & 1) << 31 | $17_1 >>> 1) | ($25 ^ -1) & $17_1; HEAP32[$9_1 + 76 >> 2] = $15_1 & $31_1 | ($15_1 ^ -1) & $23_1; $15_1 = $11_1 ^ -1; $17_1 = $12_1 ^ -1; while (1) { if ($8_1 >>> 0 < $30_1 >>> 0) { if ($11_1 & HEAP32[$8_1 + 40 >> 2] | $12_1 & HEAP32[$8_1 + 44 >> 2]) { HEAP16[$8_1 + 10 >> 1] = HEAPU16[$8_1 + 10 >> 1] | 4 } $8_1 = $8_1 + 48 | 0; continue; } break; }; $8_1 = !$3; $3 = $26_1 & 255; block822 : { if ($8_1 & ($3 | 0) == ($2_1 | 0)) { break block822 } $3 = Math_imul($3 - $2_1 | 0, 96); if (!$3) { break block822 } wasm2js_memory_copy($24_1, Math_imul($2_1, 96) + $16_1 | 0, $3); } $21_1 = $15_1 & $21_1; $18_1 = $17_1 & $18_1; $26_1 = $26_1 - 1 | 0; HEAP8[$9_1 + 44 | 0] = $26_1; continue; } break; }; i64toi32_i32$HIGH_BITS = $18_1; $3 = HEAPU8[$9_1 + 44 | 0]; $26_1 = $3; $31_1 = i64toi32_i32$HIGH_BITS; $30_1 = $21_1; } if (($3 & 255) >>> 0 < 2) { break block67 } $3 = HEAP32[$33_1 + 80 >> 2]; } if ($3 & 524288) { break block67 } $13_1 = 0; $15_1 = 0; $5_1 = $9_1 + 840 | 0; $8_1 = HEAPU8[$9_1 + 44 | 0]; while (1) { block27 : { if (($8_1 | 0) == ($13_1 | 0)) { break block27 } $2_1 = HEAP32[Math_imul($13_1, 96) + $5_1 >> 2]; $3 = HEAP32[(HEAP32[$9_1 + 4 >> 2] + Math_imul(HEAPU8[$2_1 + 16 | 0], 48) | 0) + 16 >> 2]; $4_1 = HEAP32[$3 + 28 >> 2]; if (!($4_1 & 16)) { break block27 } HEAP32[$3 + 28 >> 2] = $4_1 | 256; block128 : { if (!$13_1) { break block128 } $4_1 = HEAP32[$2_1 + 40 >> 2]; if (($4_1 & 8388609) != 8388609 | !($4_1 & 768) | HEAP16[$3 + 38 >> 1] >= $15_1 << 16 >> 16) { break block128 } HEAP32[$2_1 + 40 >> 2] = $4_1 & -4194369 | 4194304; } $13_1 = $13_1 + 1 | 0; $15_1 = HEAPU16[$2_1 + 22 >> 1] + $15_1 | 0; continue; } break; }; } $2_1 = HEAP32[$9_1 >> 2]; HEAP16[$2_1 + 160 >> 1] = HEAPU16[$2_1 + 160 >> 1] + HEAPU16[$9_1 + 50 >> 1]; $23_1 = 0; block68 : { if (!($6_1 & 4)) { break block68 } $3 = HEAP32[$9_1 + 840 >> 2]; $2_1 = HEAP32[$3 + 40 >> 2]; block70 : { if ($2_1 & 4096) { $5_1 = HEAP32[$1_1 + 16 >> 2]; $15_1 = 1; break block70; } $23_1 = 0; if (!($6_1 & 8)) { break block68 } $5_1 = HEAP32[$1_1 + 16 >> 2]; $23_1 = 0; if (HEAPU8[$5_1 + 43 | 0] == 1) { break block68 } if (!($6_1 & 16)) { $23_1 = 0; if ($2_1 & 8192) { break block68 } } $15_1 = 2; $23_1 = 0; if (HEAPU8[$33_1 + 83 | 0] & 8) { break block68 } } HEAP8[$9_1 + 46 | 0] = $15_1; $23_1 = 0; if (!($2_1 & 64)) { break block68 } $23_1 = 0; if (HEAP32[$5_1 + 28 >> 2] & 128) { break block68 } HEAP32[$3 + 40 >> 2] = $2_1 & -65; $23_1 = $6_1 & 8; } $40_1 = ($26_1 | 0) > 0 ? $26_1 : 0; $41_1 = $1_1 + 8 | 0; $17_1 = $6_1 & 32; $18_1 = !$7_1 | !$17_1; $13_1 = 0; $15_1 = $38_1; while (1) { if (($13_1 | 0) != ($40_1 | 0)) { $4_1 = $41_1 + Math_imul(HEAPU8[$15_1 + 60 | 0], 48) | 0; $8_1 = HEAP32[$4_1 + 8 >> 2]; $16_1 = $309($33_1, HEAP32[$8_1 + 60 >> 2]); $12_1 = HEAP32[$15_1 + 80 >> 2]; block73 : { if (HEAPU8[$8_1 + 29 | 0] & 64) { break block73 } $2_1 = HEAPU8[$8_1 + 43 | 0]; if (($2_1 | 0) == 2) { break block73 } $3 = HEAP32[$12_1 + 40 >> 2]; if ($3 & 1024) { $859($14, 173, HEAP32[$4_1 + 16 >> 2], 0, 0, $684($33_1, $8_1), -11); break block73; } if (($2_1 | 0) == 1) { break block73 } if (!($17_1 | $3 & 64) | HEAPU8[$4_1 + 12 | 0] & 80) { $2_1 = HEAP32[$4_1 + 16 >> 2]; if (HEAPU8[$9_1 + 46 | 0]) { HEAP32[$9_1 + 20 >> 2] = $2_1; $3 = 113; } else { $3 = 102 } $860($0_1, $2_1, $16_1, $8_1, $3); if (!(HEAPU8[$9_1 + 46 | 0] | HEAP16[$8_1 + 34 >> 1] > 63 | (HEAPU8[$8_1 + 28 | 0] & 224 | (HEAPU8[$12_1 + 41 | 0] | HEAPU8[$12_1 + 42 | 0] << 8) & 16448))) { $10_1 = HEAP32[$4_1 + 24 >> 2]; $5_1 = HEAP32[$4_1 + 28 >> 2]; $3 = 0; while (1) { $2_1 = $5_1; if ($2_1 | $10_1) { $3 = $3 + 1 | 0; $5_1 = $2_1 >>> 1 | 0; $10_1 = ($2_1 & 1) << 31 | $10_1 >>> 1; continue; } break; }; $315($14, -1, $3, -3); } $2_1 = HEAP32[$14 + 108 >> 2]; if (($2_1 | 0) <= 0) { break block73 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = $23_1; break block73; } $988($0_1, $16_1, HEAP32[$8_1 + 20 >> 2], 0, HEAP32[$8_1 >> 2]); } block81 : { if (!(HEAPU8[$12_1 + 41 | 0] & 2)) { break block81 } $5_1 = HEAP32[$12_1 + 32 >> 2]; block86 : { block85 : { block83 : { if (!(!(HEAPU8[$8_1 + 28 | 0] & 128) | !$17_1)) { if (((HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8) & 3) == 2) { break block83 } } if (HEAPU8[$9_1 + 46 | 0]) { $3 = HEAP32[$4_1 + 8 >> 2] + 8 | 0; $2_1 = $7_1; while (1) { $3 = HEAP32[$3 >> 2]; if (!$3 | ($3 | 0) == ($5_1 | 0)) { break block85 } $3 = $3 + 20 | 0; $2_1 = $2_1 + 1 | 0; continue; }; } $3 = 101; $2_1 = $7_1; if (!$18_1) { break block86 } $2_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $2_1 + 1; if (!(!(HEAPU8[$5_1 + 56 | 0] & 16) | HEAP8[$33_1 + 83 | 0] & 1)) { $11_1 = 0; $10_1 = $0_1 + 76 | 0; $21_1 = HEAP32[$5_1 + 12 >> 2]; while (1) { block36 : { if (HEAPU16[$5_1 + 52 >> 1] <= $11_1 >>> 0) { break block36 } $3 = HEAP16[HEAP32[$5_1 + 4 >> 2] + ($11_1 << 1) >> 1]; block337 : { if (($3 | 0) == -2) { $19_1 = HEAP32[(HEAP32[$5_1 + 40 >> 2] + ($11_1 << 4) | 0) + 8 >> 2] } else { if (($3 | 0) < 0) { break block337 } $3 = HEAP32[$21_1 + 4 >> 2] + Math_imul($3, 12) | 0; if (!(HEAPU8[$3 + 10 | 0] & 32)) { break block337 } $19_1 = $891($21_1, $3); } if ($944(0, $19_1)) { break block337 } $3 = $51(HEAP32[$0_1 >> 2], 24, 0); if (!$3) { break block36 } HEAP32[$3 + 20 >> 2] = HEAP32[$0_1 + 76 >> 2]; HEAP32[$3 >> 2] = $906(HEAP32[$0_1 >> 2], $19_1, 0); $19_1 = HEAP32[$4_1 + 16 >> 2]; HEAP32[$3 + 12 >> 2] = $11_1; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $19_1; HEAP8[$3 + 16 | 0] = (HEAPU8[$4_1 + 12 | 0] & 88) != 0; if ($1098(HEAP32[$0_1 >> 2], $5_1)) { HEAP8[$3 + 17 | 0] = HEAPU8[HEAP32[$5_1 + 16 >> 2] + $11_1 | 0] } HEAP32[$10_1 >> 2] = $3; if (HEAP32[$3 + 20 >> 2]) { break block337 } $1016($0_1, 91, $10_1); } $11_1 = $11_1 + 1 | 0; continue; } break; }; } $3 = 102; $10_1 = HEAP32[$5_1 + 36 >> 2]; if (!$10_1 | HEAPU8[$4_1 + 12 | 0] & 16) { break block86 } $1288($0_1, $5_1, $10_1, 0, $2_1, $4_1); break block86; } HEAP32[$15_1 + 8 >> 2] = HEAP32[$15_1 + 4 >> 2]; break block81; } HEAP32[$9_1 + 24 >> 2] = $2_1; $3 = 113; } HEAP32[$15_1 + 8 >> 2] = $2_1; $835($14, $3, $2_1, HEAP32[$5_1 + 44 >> 2], $16_1); $1097($0_1, $5_1); $2_1 = HEAP32[$12_1 + 40 >> 2]; if (!($2_1 & 15) | $2_1 & 1605634 | (HEAP8[$9_1 + 40 | 0] & 1 | HEAPU8[$9_1 + 47 | 0] == 2)) { break block81 } $2_1 = HEAP32[$14 + 108 >> 2]; if (($2_1 | 0) <= 0) { break block81 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 2; } if (($16_1 | 0) >= 0) { $917($0_1, $16_1) } block89 : { if (!(HEAPU8[$4_1 + 12 | 0] & 16)) { break block89 } $2_1 = $1289($9_1, 20); HEAP32[$15_1 + 56 >> 2] = $2_1; if (!$2_1) { break block89 } $3 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $3 + 1; HEAP32[$2_1 >> 2] = $3; $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $3; $326($14, 77, 65536, $3); $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$2_1 + 8 >> 2] = $3; $326($14, 75, 0, $3); block91 : { if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { $326($14, 117, HEAP32[$2_1 >> 2], 1); $2_1 = $1078(HEAP32[$0_1 >> 2], 1, 0); if (!$2_1) { break block91 } HEAP32[$2_1 + 20 >> 2] = 0; HEAP8[HEAP32[$2_1 + 16 >> 2]] = 0; $1043($14, $2_1, -8); break block91; } $3 = HEAP32[$2_1 >> 2]; $2_1 = $359($8_1); $326($14, 117, $3, HEAPU16[$2_1 + 50 >> 1]); $1097($0_1, $2_1); } HEAP32[$12_1 + 40 >> 2] = HEAP32[$12_1 + 40 >> 2] & -65; HEAP8[$9_1 + 47 | 0] = 3; HEAP8[$9_1 + 45 | 0] = 0; } $15_1 = $15_1 + 96 | 0; $13_1 = $13_1 + 1 | 0; continue; } break; }; HEAP32[$9_1 + 52 >> 2] = HEAP32[$14 + 108 >> 2]; if (HEAPU8[$33_1 + 87 | 0]) { break block15 } $43_1 = $9_1 + 772 | 0; $15_1 = 0; $23_1 = 0; while (1) { block101 : { if (!(!$23_1 & ($15_1 | 0) == ($40_1 | 0))) { if (HEAP32[$0_1 + 40 >> 2]) { break block15 } $12_1 = Math_imul($15_1, 96) + $38_1 | 0; $2_1 = HEAP32[HEAP32[$12_1 + 80 >> 2] + 40 >> 2]; $3 = $41_1 + Math_imul(HEAPU8[$12_1 + 60 | 0], 48) | 0; $4_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; block93 : { if (!($4_1 & 32)) { break block93 } $3 = HEAP32[$3 + 44 >> 2]; $11_1 = 0; if (!($4_1 & 16)) { $11_1 = $857($14, 15) } $326($14, 10, HEAP32[$3 + 8 >> 2], HEAP32[$3 + 4 >> 2]); if (!$11_1) { break block93 } HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2]; } if ($2_1 & 4210688) { block98 : { if ($2_1 & 16384) { $10_1 = 0; $3 = 0; $11_1 = 0; $16_1 = 0; $13_1 = 0; $26_1 = 0; $24_1 = global$0 - 16 | 0; $2_1 = $24_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $5_1 = HEAP32[$0_1 + 8 >> 2]; $32_1 = $857($5_1, 15); $4_1 = HEAP32[$34_1 + 24 >> 2]; $28_1 = $4_1 + Math_imul(HEAP32[$34_1 + 12 >> 2], 48) | 0; $21_1 = HEAP32[HEAP32[$34_1 >> 2] + 4 >> 2]; $2_1 = $21_1 + Math_imul(HEAPU8[$12_1 + 60 | 0], 48) | 0; $8_1 = $2_1 + 8 | 0; $18_1 = HEAP32[$2_1 + 16 >> 2]; $22_1 = HEAP32[$12_1 + 80 >> 2]; block438 : { while (1) { if ($4_1 >>> 0 < $28_1 >>> 0) { block140 : { if (HEAPU8[$4_1 + 10 | 0] & 2) { break block140 } $2_1 = HEAP32[$4_1 >> 2]; if (!$1264($2_1, $21_1, HEAPU8[$12_1 + 60 | 0], 0)) { break block140 } $13_1 = $948($0_1, $13_1, $906(HEAP32[$0_1 >> 2], $2_1, 0)); } block241 : { if (!$1326($4_1, $8_1, $30_1, $31_1)) { break block241 } $2_1 = HEAP32[$4_1 + 24 >> 2]; $7_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $17_1 = 1 << $7_1; $7_1 = 0; } else { $19_1 = 1 << $7_1; $17_1 = $19_1 - 1 & 1 >>> 32 - $7_1; $7_1 = $19_1; } $19_1 = ($2_1 | 0) > 63; $7_1 = $19_1 ? 0 : $7_1; if (!($10_1 & 255)) { $10_1 = HEAP32[$18_1 >> 2]; HEAP32[$24_1 + 4 >> 2] = HEAP32[HEAP32[$18_1 + 4 >> 2] + Math_imul($2_1, 12) >> 2]; HEAP32[$24_1 >> 2] = $10_1; $64(284, 25340, $24_1); } $10_1 = 1; $17_1 = $19_1 ? -2147483648 : $17_1; if ($7_1 & $16_1 | $17_1 & $11_1) { break block241 } $2_1 = $3 + 1 | 0; if ($1327(HEAP32[$0_1 >> 2], $22_1, $2_1)) { break block438 } HEAP32[HEAP32[$22_1 + 52 >> 2] + ($3 << 2) >> 2] = $4_1; $16_1 = $7_1 | $16_1; $11_1 = $11_1 | $17_1; $3 = $2_1; } $4_1 = $4_1 + 48 | 0; continue; } break; }; HEAP32[$22_1 + 40 >> 2] = 16961; HEAP16[$22_1 + 24 >> 1] = $3; HEAP16[$22_1 + 44 >> 1] = $3; block6 : { if (HEAPU8[$18_1 + 43 | 0] == 2) { $2_1 = $16_1 ^ -1; $25 = $11_1 ^ -1; break block6; } $2_1 = HEAP32[$8_1 + 24 >> 2] & ($16_1 ^ -1); $25 = HEAP32[$8_1 + 28 >> 2] & ($11_1 ^ -1 | -2147483648); } $4_1 = HEAP16[$18_1 + 34 >> 1]; block7 : { $29_1 = HEAP32[$18_1 + 28 >> 2]; if (!($29_1 & 128)) { break block7 } $21_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $19_1 = 0; $7_1 = 0; while (1) { if (!$7_1 & ($19_1 | 0) == ($21_1 | 0)) { break block7 } if (HEAP8[(HEAP32[$18_1 + 4 >> 2] + Math_imul($19_1, 12) | 0) + 10 | 0] & 1) { if (!(!$7_1 & $19_1 >>> 0 < 63)) { $25 = $25 | -2147483648; break block7; } $10_1 = $19_1 & 31; if (($19_1 & 63) >>> 0 >= 32) { $17_1 = 1 << $10_1; $27 = 0; } else { $27 = 1 << $10_1; $17_1 = $27 - 1 & 1 >>> 32 - $10_1; } $10_1 = !($16_1 & $27 | $11_1 & $17_1); $25 = $25 | ($10_1 ? $17_1 : 0); $2_1 = ($10_1 ? $27 : 0) | $2_1; } $19_1 = $19_1 + 1 | 0; $7_1 = $19_1 ? $7_1 : $7_1 + 1 | 0; continue; }; } $7_1 = ($4_1 | 0) >= 63 ? 63 : $4_1; $27 = ($7_1 | 0) > 0 ? $7_1 : 0; $19_1 = 0; $7_1 = 0; while (1) { if (!(!$7_1 & ($19_1 | 0) == ($27 | 0))) { $10_1 = $19_1 & 31; if (($19_1 & 63) >>> 0 >= 32) { $11_1 = $25 >>> $10_1 | 0 } else { $11_1 = ((1 << $10_1) - 1 & $25) << 32 - $10_1 | $2_1 >>> $10_1 } $3 = $3 + ($11_1 & 1) | 0; $19_1 = $19_1 + 1 | 0; $7_1 = $19_1 ? $7_1 : $7_1 + 1 | 0; continue; } break; }; $21_1 = 0; $36_1 = ($4_1 - 63 & HEAP32[$8_1 + 28 >> 2] >> 31) + $3 | 0; $16_1 = $1009(HEAP32[$0_1 >> 2], $36_1 + (($29_1 ^ -1) >>> 7 & 1) << 16 >> 16, 0, $24_1 + 12 | 0); if (!$16_1) { break block438 } HEAP32[$22_1 + 32 >> 2] = $16_1; HEAP32[$16_1 + 12 >> 2] = $18_1; HEAP32[$16_1 >> 2] = 1563; $3 = HEAP32[$34_1 + 24 >> 2]; $19_1 = 0; $7_1 = 0; $11_1 = 0; $4_1 = 0; while (1) { if ($3 >>> 0 >= $28_1 >>> 0) { while (1) { if (!(!$7_1 & ($19_1 | 0) == ($27 | 0))) { $3 = $19_1 & 31; if (($19_1 & 63) >>> 0 >= 32) { $3 = $25 >>> $3 | 0 } else { $3 = ((1 << $3) - 1 & $25) << 32 - $3 | $2_1 >>> $3 } if ($3 & 1) { HEAP16[HEAP32[$16_1 + 4 >> 2] + ($4_1 << 1) >> 1] = $19_1; HEAP32[HEAP32[$16_1 + 32 >> 2] + ($4_1 << 2) >> 2] = 33712; $4_1 = $4_1 + 1 | 0; } $19_1 = $19_1 + 1 | 0; $7_1 = $19_1 ? $7_1 : $7_1 + 1 | 0; continue; } break; } } else { block14 : { if (!$1326($3, $8_1, $30_1, $31_1)) { break block14 } $17_1 = HEAP32[$3 + 24 >> 2]; $10_1 = $17_1 & 31; if (($17_1 & 63) >>> 0 >= 32) { $10_1 = 1 << $10_1; $35_1 = 0; } else { $29_1 = 1 << $10_1; $10_1 = $29_1 - 1 & 1 >>> 32 - $10_1; $35_1 = $29_1; } $29_1 = ($17_1 | 0) > 63; $35_1 = $29_1 ? 0 : $35_1; $29_1 = $29_1 ? -2147483648 : $10_1; if ($11_1 & $35_1 | $26_1 & $29_1) { break block14 } $10_1 = HEAP32[$3 >> 2]; HEAP16[HEAP32[$16_1 + 4 >> 2] + ($4_1 << 1) >> 1] = $17_1; $17_1 = $369($0_1, $10_1); if ($17_1) { $17_1 = HEAP32[$17_1 >> 2] } else { $17_1 = 33712 } $11_1 = $11_1 | $35_1; $26_1 = $26_1 | $29_1; HEAP32[HEAP32[$16_1 + 32 >> 2] + ($4_1 << 2) >> 2] = $17_1; $4_1 = $4_1 + 1 | 0; $10_1 = HEAP32[$10_1 + 12 >> 2]; if (!$10_1) { break block14 } $21_1 = ($971($10_1) | 0) != 66 ? 1 : $21_1; } $3 = $3 + 48 | 0; continue; } break; }; block1746 : { if (HEAP32[$8_1 + 28 >> 2] >= 0) { break block1746 } $3 = 63; while (1) { if (HEAP16[$18_1 + 34 >> 1] <= ($3 | 0)) { break block1746 } HEAP16[HEAP32[$16_1 + 4 >> 2] + ($4_1 << 1) >> 1] = $3; HEAP32[HEAP32[$16_1 + 32 >> 2] + ($4_1 << 2) >> 2] = 33712; $3 = $3 + 1 | 0; $4_1 = $4_1 + 1 | 0; continue; }; } if (!(HEAPU8[$18_1 + 28 | 0] & 128)) { HEAP16[HEAP32[$16_1 + 4 >> 2] + ($4_1 << 1) >> 1] = 65535; HEAP32[HEAP32[$16_1 + 32 >> 2] + ($4_1 << 2) >> 2] = 33712; } $2_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $2_1 + 1; HEAP32[$12_1 + 8 >> 2] = $2_1; $326($5_1, 116, $2_1, $36_1 + 1 | 0); $1097($0_1, $16_1); if (!(!($21_1 & 255) | HEAPU8[HEAP32[$0_1 >> 2] + 82 | 0] & 8)) { $1328($0_1, HEAP32[$34_1 >> 2], $12_1); $2_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; HEAP32[$12_1 + 52 >> 2] = $2_1; $326($5_1, 77, 1e4, $2_1); } block21 : { if (HEAPU8[$8_1 + 13 | 0] & 64) { $3 = HEAP32[$8_1 + 44 >> 2]; $2_1 = HEAP32[$3 + 8 >> 2]; $7_1 = $326($5_1, 71, 0, 0); $835($5_1, 11, $2_1, 0, HEAP32[$3 + 4 >> 2]); $2_1 = $858($5_1, 12, $2_1); break block21; } $7_1 = 0; $2_1 = $858($5_1, 36, HEAP32[$12_1 + 4 >> 2]); } $10_1 = 0; if ($13_1) { $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $1059($0_1, $13_1, $10_1, 16); HEAP32[$22_1 + 40 >> 2] = HEAP32[$22_1 + 40 >> 2] | 131072; } $3 = $893($0_1); $11_1 = $1149($0_1, $16_1, HEAP32[$12_1 + 4 >> 2], $3, 0, 0, 0, 0); $16_1 = HEAP32[$12_1 + 52 >> 2]; if ($16_1) { $312($5_1, 183, $16_1, 0, $11_1, HEAPU16[$22_1 + 24 >> 1]) } $326($5_1, 138, HEAP32[$12_1 + 8 >> 2], $3); $16_1 = HEAP32[$5_1 + 108 >> 2]; if (($16_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($16_1, 20) | 0) - 18 >> 1] = 16 } if ($13_1) { $1013($5_1, $10_1) } block2848 : { if (HEAPU8[$8_1 + 13 | 0] & 64) { HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 8 >> 2] = $4_1 + $11_1; $1308($0_1, $2_1, HEAP32[$12_1 + 4 >> 2], HEAP32[HEAP32[$8_1 + 44 >> 2] + 12 >> 2], HEAP32[$12_1 + 8 >> 2]); $863($5_1, $2_1); $4_1 = (HEAPU8[$8_1 + 13 | 0] | HEAPU8[$8_1 + 14 | 0] << 8) & 65471; HEAP8[$8_1 + 13 | 0] = $4_1; HEAP8[$8_1 + 14 | 0] = $4_1 >>> 8; $7_1 = HEAP32[$5_1 + 108 >> 2]; break block2848; } $326($5_1, 39, HEAP32[$12_1 + 4 >> 2], $2_1 + 1 | 0); $7_1 = HEAP32[$5_1 + 108 >> 2]; if (($7_1 | 0) <= 0) { break block2848 } HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) - 18 >> 1] = 3; } HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = $7_1; $894($0_1, $3); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($32_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; } $11(HEAP32[$0_1 >> 2], $13_1); $2_1 = $24_1 + 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; break block98; } $2_1 = $15_1; $3 = $12_1; $13_1 = HEAP32[$3 + 80 >> 2]; $5_1 = HEAP32[$9_1 >> 2]; $18_1 = HEAP32[$5_1 + 80 >> 2]; HEAP32[$5_1 + 80 >> 2] = 0; $19_1 = HEAP32[$5_1 + 76 >> 2]; HEAP32[$5_1 + 76 >> 2] = 0; $26_1 = $9_1 + 760 | 0; $7_1 = HEAP32[$5_1 + 8 >> 2]; $22_1 = $857($7_1, 15); while (1) { $1328($5_1, $9_1, $3); $17_1 = HEAP32[$5_1 + 60 >> 2] - 1 | 0; HEAP32[$5_1 + 60 >> 2] = $17_1; $16_1 = HEAP32[$3 + 4 >> 2]; $21_1 = HEAP32[$5_1 + 48 >> 2] + 1 | 0; HEAP32[$5_1 + 48 >> 2] = $21_1; HEAP32[$3 + 52 >> 2] = $21_1; $24_1 = HEAP32[$9_1 + 4 >> 2]; $25 = HEAPU8[$3 + 60 | 0]; $8_1 = HEAP16[HEAP32[($24_1 + Math_imul($25, 48) | 0) + 16 >> 2] + 38 >> 1]; $4_1 = ($8_1 | 0) / 10 | 0; $11_1 = -1; __inlined_func$432$314 : { if (($8_1 | 0) <= 609) { $10_1 = $4_1 << 16 >> 16; $11_1 = $8_1 - Math_imul($4_1, 10) | 0; $4_1 = $11_1 << 16 >> 16; $28_1 = $4_1 >> 31; $27 = $28_1 - 1 | 0; $35_1 = $27 + 1 | 0; $29_1 = $27; $27 = $4_1 - 2 | 0; $32_1 = $27 >>> 0 < 4294967294 ? $35_1 : $29_1; $28_1 = $28_1 - 1 | 0; $4_1 = $4_1 - 1 | 0; $28_1 = ($4_1 | 0) != -1 ? $28_1 + 1 | 0 : $28_1; $29_1 = $4_1; $4_1 = $11_1 & 65535; $11_1 = $4_1 >>> 0 > 4; $27 = $11_1 ? $27 : $4_1 ? $29_1 : 0; $4_1 = $11_1 ? $32_1 : $4_1 ? $28_1 : 0; $29_1 = $4_1 + 1 | 0; $11_1 = $4_1; $4_1 = $27 + 8 | 0; $11_1 = $4_1 >>> 0 < 8 ? $29_1 : $11_1; if (($8_1 | 0) >= 30) { $10_1 = $10_1 - 3 | 0; $8_1 = $10_1 & 31; if (($10_1 & 63) >>> 0 >= 32) { $10_1 = $4_1 << $8_1; $4_1 = 0; } else { $10_1 = (1 << $8_1) - 1 & $4_1 >>> 32 - $8_1 | $11_1 << $8_1; $4_1 = $4_1 << $8_1; } i64toi32_i32$HIGH_BITS = $10_1; $11_1 = $4_1; break __inlined_func$432$314; } $10_1 = 3 - $10_1 | 0; $8_1 = $10_1 & 31; if (($10_1 & 63) >>> 0 >= 32) { $10_1 = 0; $11_1 = $11_1 >>> $8_1 | 0; } else { $10_1 = $11_1 >>> $8_1 | 0; $11_1 = ((1 << $8_1) - 1 & $11_1) << 32 - $8_1 | $4_1 >>> $8_1; } } else { $10_1 = 2147483647 } i64toi32_i32$HIGH_BITS = $10_1; } $4_1 = $11_1; $8_1 = i64toi32_i32$HIGH_BITS; $4_1 = !$8_1 & $4_1 >>> 0 < 1e7; $10_1 = $4_1 ? $11_1 : 1e7; $4_1 = $4_1 ? $8_1 : 0; $326($7_1, 77, !$4_1 & $10_1 >>> 0 > 1e4 | $4_1 ? $10_1 : 1e4, $21_1); $10_1 = $858($7_1, 36, $16_1); $11_1 = HEAP32[$9_1 + 104 >> 2]; $4_1 = $11_1 + Math_imul(HEAP32[$9_1 + 92 >> 2], 48) | 0; while (1) { if ($4_1 >>> 0 > $11_1 >>> 0) { block151 : { if (HEAPU8[$11_1 + 10 | 0] & 2) { break block151 } if (!$1264(HEAP32[$11_1 >> 2], $24_1, $25, 0)) { break block151 } $1059($5_1, HEAP32[$11_1 >> 2], $17_1, 16); } $11_1 = $11_1 + 48 | 0; continue; } break; }; block352 : { if (HEAP8[$13_1 + 41 | 0] & 1) { $4_1 = $893($5_1); $326($7_1, 135, $16_1, $4_1); $312($7_1, 183, HEAP32[$3 + 52 >> 2], 0, $4_1, 1); $894($5_1, $4_1); break block352; } $21_1 = HEAP32[$13_1 + 32 >> 2]; $11_1 = 0; $4_1 = HEAPU16[$13_1 + 24 >> 1]; $8_1 = $1060($5_1, $4_1); while (1) { if (($4_1 | 0) != ($11_1 | 0)) { $1147($5_1, $21_1, $16_1, $11_1, $8_1 + $11_1 | 0); $11_1 = $11_1 + 1 | 0; continue; } break; }; $312($7_1, 183, HEAP32[$3 + 52 >> 2], 0, $8_1, $4_1); $1061($5_1, $8_1, $4_1); } $1013($7_1, $17_1); $326($7_1, 39, HEAP32[$3 + 4 >> 2], $10_1 + 1 | 0); $8_1 = HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0]; $3 = $8_1 ? 82740 : HEAP32[$7_1 + 104 >> 2] + Math_imul($10_1, 20) | 0; $10_1 = HEAP32[$7_1 + 108 >> 2]; HEAP32[$3 + 8 >> 2] = $10_1; HEAP32[$13_1 + 40 >> 2] = HEAP32[$13_1 + 40 >> 2] & -4194305; block654 : { if (HEAPU8[HEAP32[$5_1 >> 2] + 82 | 0] & 16) { break block654 } $3 = $2_1 + 1 | 0; $4_1 = HEAPU8[$9_1 + 44 | 0]; $11_1 = (($3 | 0) > ($4_1 | 0) ? $3 : $4_1) - 1 | 0; while (1) { if (($2_1 | 0) == ($11_1 | 0)) { break block654 } $2_1 = $2_1 + 1 | 0; $3 = Math_imul($2_1, 96) + $26_1 | 0; if (HEAPU8[(HEAP32[$9_1 + 4 >> 2] + Math_imul(HEAPU8[$3 + 60 | 0], 48) | 0) + 20 | 0] & 72) { continue } $13_1 = HEAP32[$3 + 80 >> 2]; if (!$13_1 | ($30_1 & HEAP32[$13_1 >> 2] | $31_1 & HEAP32[$13_1 + 4 >> 2] | (HEAP32[$13_1 + 40 >> 2] & 4194308) != 4194304)) { continue } break; }; if (($2_1 | 0) < ($4_1 | 0)) { continue } } break; }; HEAP32[($8_1 ? 82740 : HEAP32[$7_1 + 104 >> 2] + Math_imul($22_1, 20) | 0) + 8 >> 2] = $10_1; HEAP32[$5_1 + 80 >> 2] = $18_1; HEAP32[$5_1 + 76 >> 2] = $19_1; } if (HEAPU8[$33_1 + 87 | 0]) { break block15 } } $1292($0_1, $1_1, $12_1, $6_1); HEAP32[$12_1 + 32 >> 2] = HEAP32[$14 + 108 >> 2]; $18_1 = HEAP32[$12_1 + 80 >> 2]; $25 = HEAP32[$0_1 >> 2]; $5_1 = HEAPU8[$12_1 + 60 | 0]; $3 = HEAP32[$9_1 + 4 >> 2] + Math_imul($5_1, 48) | 0; $22_1 = HEAP32[$3 + 24 >> 2]; HEAP32[$12_1 + 88 >> 2] = ($1277($39_1, $22_1) ^ -1) & $30_1; HEAP32[$12_1 + 92 >> 2] = (i64toi32_i32$HIGH_BITS ^ -1) & $31_1; $7_1 = HEAP32[$9_1 + 72 >> 2]; $4_1 = HEAP32[$9_1 + 76 >> 2]; $8_1 = HEAP32[$0_1 + 60 >> 2]; $2_1 = $8_1 - 1 | 0; HEAP32[$12_1 + 12 >> 2] = $2_1; HEAP32[$12_1 + 16 >> 2] = $2_1; $35_1 = $8_1 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $35_1; HEAP32[$12_1 + 24 >> 2] = $35_1; $29_1 = $3 + 8 | 0; $3 = $15_1 & 31; if (($15_1 & 63) >>> 0 >= 32) { $16_1 = $4_1 >>> $3 | 0 } else { $16_1 = ((1 << $3) - 1 & $4_1) << 32 - $3 | $7_1 >>> $3 } if (!(!$5_1 | !(HEAPU8[$29_1 + 12 | 0] & 8))) { $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$12_1 >> 2] = $3; $326($14, 71, 0, $3); } $24_1 = $16_1 & 1; $3 = $15_1; while (1) { if (($3 | 0) <= 0) { $3 = 0; break block101; } $4_1 = Math_imul($3, 96) + $38_1 | 0; if (HEAP32[$4_1 >> 2] | HEAP32[$4_1 + 56 >> 2]) { break block101 } $3 = $3 - 1 | 0; continue; }; } HEAP32[$9_1 + 56 >> 2] = HEAP32[$14 + 108 >> 2]; break block102; } $4_1 = HEAPU8[$29_1 + 13 | 0] | HEAPU8[$29_1 + 14 | 0] << 8; block15157 : { block104 : { if ($4_1 & 64) { $8_1 = 0; $3 = HEAP32[$29_1 + 44 >> 2]; $4_1 = HEAP32[$3 + 8 >> 2]; $835($14, 11, $4_1, 0, HEAP32[$3 + 4 >> 2]); $2_1 = $326($14, 12, $4_1, $2_1); HEAP8[$12_1 + 61 | 0] = 9; HEAP32[$12_1 + 68 >> 2] = $2_1; break block104; } $5_1 = HEAP32[$18_1 + 40 >> 2]; if ($5_1 & 1024) { $13_1 = HEAPU16[$18_1 + 44 >> 1]; $4_1 = $1060($0_1, $13_1 + 2 | 0); $10_1 = $4_1 + 2 | 0; $8_1 = HEAP32[$12_1 + 12 >> 2]; $3 = 0; while (1) { if (($3 | 0) != ($13_1 | 0)) { $2_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] + ($3 << 2) >> 2]; block107 : { if (!$2_1) { break block107 } $5_1 = $3 + $10_1 | 0; if (HEAP8[$2_1 + 12 | 0] & 1) { if (HEAP32[$18_1 + 36 >> 2] & ($3 >>> 0 < 32 ? 1 << $3 : 0)) { $7_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $7_1 + 1; $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; $1212($0_1, HEAP32[$2_1 >> 2], $7_1); $835($14, 175, $7_1, $5_1, $11_1); break block107; } $1293($0_1, $2_1, $12_1, $3, $24_1, $5_1); $8_1 = HEAP32[$12_1 + 16 >> 2]; break block107; } $1294($0_1, HEAP32[HEAP32[$2_1 >> 2] + 16 >> 2], $5_1, 1); if (!(HEAPU8[$18_1 + 28 | 0] & 2) | HEAPU8[$2_1 + 15 | 0] != 74) { break block107 } $326($14, 71, 0, HEAP32[HEAP32[$9_1 + 16 >> 2] + 12 >> 2]); } $3 = $3 + 1 | 0; continue; } break; }; $326($14, 71, HEAP32[$18_1 + 24 >> 2], $4_1); $326($14, 71, $13_1, $4_1 + 1 | 0); $859($14, 6, $22_1, $8_1, $4_1, HEAP32[$18_1 + 32 >> 2], HEAP8[$18_1 + 28 | 0] & 1 ? -6 : -1); HEAP8[$18_1 + 28 | 0] = HEAPU8[$18_1 + 28 | 0] & 254; if (HEAPU8[$25 + 87 | 0]) { HEAP32[$18_1 + 32 >> 2] = 0 } HEAP32[$12_1 + 64 >> 2] = $22_1; HEAP8[$12_1 + 61 | 0] = HEAPU8[$9_1 + 46 | 0] ? -69 : 63; HEAP32[$12_1 + 68 >> 2] = HEAP32[$14 + 108 >> 2]; $8_1 = 0; $3 = 0; while (1) { if (($3 | 0) == ($13_1 | 0)) { break block104 } $7_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] + ($3 << 2) >> 2]; block112 : { if (!(!(HEAPU16[$18_1 + 30 >> 1] >>> $3 & 1) | $3 >>> 0 > 15)) { $1295($12_1, $7_1); break block112; } if (HEAPU8[$25 + 87 | 0] | (!(HEAP8[$7_1 + 12 | 0] & 1) | HEAP32[$18_1 + 36 >> 2] & ($3 >>> 0 < 32 ? 1 << $3 : 0))) { break block112 } $5_1 = 0; $2_1 = HEAP32[$12_1 + 72 >> 2]; $16_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $2_1 = $3 + $10_1 | 0; while (1) { block116 : { if (($5_1 | 0) != ($16_1 | 0)) { $11_1 = 82740; if (!HEAPU8[HEAP32[$14 >> 2] + 87 | 0]) { $11_1 = HEAP32[$14 + 104 >> 2] + Math_imul(HEAP32[(HEAP32[$12_1 + 76 >> 2] + Math_imul($5_1, 20) | 0) + 4 >> 2], 20) | 0 } $4_1 = HEAPU8[$11_1 | 0]; block117 : { if (($4_1 | 0) != 135) { if (($4_1 | 0) != 94 | ($2_1 | 0) != HEAP32[$11_1 + 12 >> 2]) { break block116 } $5_1 = HEAP32[$11_1 + 8 >> 2]; $16_1 = $2_1; break block117; } if (($2_1 | 0) != HEAP32[$11_1 + 8 >> 2]) { break block116 } $5_1 = $2_1; $16_1 = HEAP32[$11_1 + 12 >> 2]; } $835($14, $4_1, HEAP32[$11_1 + 4 >> 2], $5_1, $16_1); } $4_1 = $903($0_1, 54, 0, 0); if (!HEAPU8[$25 + 87 | 0]) { $5_1 = HEAP32[HEAP32[$7_1 >> 2] + 12 >> 2]; $7_1 = HEAP32[$7_1 + 28 >> 2]; if (($7_1 | 0) > 0) { $5_1 = HEAP32[(HEAP32[$5_1 + 20 >> 2] + ($7_1 << 4) | 0) - 8 >> 2] } HEAP32[$4_1 + 12 >> 2] = $5_1; $5_1 = $942($25, 176, 0); HEAP32[$4_1 + 16 >> 2] = $5_1; if ($5_1) { HEAP32[$5_1 + 28 >> 2] = $2_1; $1059($0_1, $4_1, HEAP32[$12_1 + 24 >> 2], 16); } HEAP32[$4_1 + 12 >> 2] = 0; } $11($25, $4_1); break block112; } $5_1 = $5_1 + 1 | 0; continue; }; } $3 = $3 + 1 | 0; continue; }; } $3 = HEAP32[Math_imul($3, 96) + $43_1 >> 2]; block148 : { block147 : { block185 : { block184 : { block124 : { if (!(!($5_1 & 256) | !($5_1 & 5))) { $3 = HEAP32[HEAP32[$18_1 + 52 >> 2] >> 2]; $2_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; $3 = $1293($0_1, $3, $12_1, 0, $24_1, $2_1); if (($2_1 | 0) != ($3 | 0)) { $894($0_1, $2_1) } $2_1 = HEAP32[$12_1 + 16 >> 2]; if (HEAP32[$12_1 + 52 >> 2]) { $326($14, 13, $3, $2_1); $312($14, 64, HEAP32[$12_1 + 52 >> 2], $2_1, $3, 1); $1296($0_1, $9_1, $15_1, $2_1, $30_1, $31_1); } $835($14, 30, $22_1, $2_1, $3); break block124; } if (($5_1 & 258) == 258) { $13_1 = 0; $8_1 = 0; if ($5_1 & 32) { $13_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] >> 2]; $8_1 = 1; } $5_1 = $5_1 & 16 ? HEAP32[HEAP32[$18_1 + 52 >> 2] + ($8_1 << 2) >> 2] : 0; $4_1 = $24_1 ? $13_1 : $5_1; $7_1 = $24_1 ? $5_1 : $13_1; block131 : { if ($7_1) { $5_1 = HEAP32[$7_1 >> 2]; $3 = HEAP32[$5_1 + 16 >> 2]; block130 : { if ($1182($3)) { $3 = $893($0_1); $1294($0_1, HEAP32[$5_1 + 16 >> 2], $3, 1); $13_1 = $3; $5_1 = HEAPU8[$5_1 | 0] & 2 | 1; break block130; } $13_1 = $1167($0_1, $3, $20_1 - -64 | 0); $1295($12_1, $7_1); $3 = HEAP32[$20_1 + 64 >> 2]; $5_1 = HEAPU8[$5_1 | 0] - 55 | 0; } $835($14, HEAPU8[$5_1 + 51040 | 0], $22_1, $2_1, $13_1); $894($0_1, $3); break block131; } $326($14, $24_1 ? 32 : 36, $22_1, $3); } $8_1 = 0; block133 : { if (!$4_1) { $3 = 187; $5_1 = 0; break block133; } $3 = HEAP32[$4_1 >> 2]; $5_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $5_1; $1294($0_1, HEAP32[$3 + 16 >> 2], $5_1, 1); block137 : { block136 : { if (!$1182(HEAP32[$3 + 16 >> 2])) { block135 : { switch (HEAPU8[$3 | 0] - 55 | 0) { case 0: case 2: break block135; default: break block136; }; } $3 = $24_1 ? 56 : 58; break block137; } $3 = $24_1 ? 57 : 55; break block133; } $3 = $24_1 ? 57 : 55; } $1295($12_1, $4_1); } HEAP32[$12_1 + 68 >> 2] = HEAP32[$14 + 108 >> 2]; HEAP32[$12_1 + 64 >> 2] = $22_1; HEAP8[$12_1 + 61 | 0] = $24_1 ^ 39; if (($3 | 0) == 187) { break block104 } $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; $326($14, 135, $22_1, $4_1); $835($14, $3, $5_1, $2_1, $4_1); $2_1 = HEAP32[$14 + 108 >> 2]; if (($2_1 | 0) <= 0) { break block104 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 83; break block104; } if ($5_1 & 512) { $11_1 = HEAPU16[$18_1 + 26 >> 1]; $28_1 = 0; $13_1 = 0; $10_1 = 0; $3 = HEAPU16[$18_1 + 24 >> 1]; $8_1 = $3; if ($5_1 & 32) { $10_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] + ($3 << 2) >> 2]; $13_1 = $11_1; $8_1 = $3 + 1 | 0; } $2_1 = HEAPU16[$18_1 + 28 >> 1]; $32_1 = HEAP32[$12_1 + 8 >> 2]; $4_1 = HEAP32[$18_1 + 32 >> 2]; block141 : { if (!($5_1 & 16)) { $5_1 = 0; break block141; } $5_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] + ($8_1 << 2) >> 2]; if (HEAP8[$5_1 + 11 | 0] & 1) { $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; HEAP32[$12_1 + 44 >> 2] = $7_1; $326($14, 71, 1, $7_1); HEAP32[$12_1 + 48 >> 2] = HEAP32[$14 + 108 >> 2]; $7_1 = HEAP32[$12_1 + 44 >> 2] << 1; HEAP32[$12_1 + 44 >> 2] = $7_1; HEAP32[$12_1 + 44 >> 2] = $7_1 | $24_1 ^ HEAPU8[$3 + HEAP32[$4_1 + 28 >> 2] | 0] == 1; } $13_1 = $2_1 >>> 0 < $13_1 >>> 0 ? $13_1 : $2_1; if ($10_1) { break block141 } $7_1 = HEAP16[HEAP32[$4_1 + 4 >> 2] + ($3 << 1) >> 1]; block144 : { if (($7_1 | 0) >= 0) { if (!(HEAPU8[(HEAP32[HEAP32[$4_1 + 12 >> 2] + 4 >> 2] + Math_imul($7_1, 12) | 0) + 4 | 0] & 15)) { break block144 } break block141; } if (($7_1 | 0) != -2) { break block141 } } $28_1 = 1; } $7_1 = 0; if ((HEAP32[$18_1 + 40 >> 2] & 524336) == 524288) { $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; HEAP32[$12_1 + 36 >> 2] = $7_1; if (HEAP32[$12_1 >> 2]) { $326($14, 71, 0, $7_1) } $8_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $8_1; HEAP32[$12_1 + 40 >> 2] = $8_1; $28_1 = 1; $13_1 = 1; } $19_1 = 1; if (($16_1 & 1) == (HEAPU8[$3 + HEAP32[$4_1 + 28 >> 2] | 0] != 0 | 0) | $3 >>> 0 >= HEAPU16[$4_1 + 52 >> 1]) { break block147 } $16_1 = $11_1 & 255; $19_1 = !$28_1; $28_1 = 0; $8_1 = $10_1; break block148; } if ($5_1 & 8192) { $28_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $28_1 + 1; $26_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $26_1; $27 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $27; $8_1 = HEAP32[$29_1 + 8 >> 2]; $32_1 = HEAP32[HEAP32[$18_1 + 52 >> 2] >> 2]; $24_1 = HEAP32[$32_1 + 24 >> 2]; HEAP32[$12_1 + 64 >> 2] = $26_1; HEAP8[$12_1 + 61 | 0] = 67; $2_1 = HEAPU8[$9_1 + 44 | 0]; block153 : { if ($2_1 >>> 0 >= 2) { $3 = $2_1 - $15_1 | 0; $10_1 = $325($25, Math_imul($3, 48) | 8, 0); if (!$10_1) { break block15157 } $3 = $3 & 255; HEAP32[$10_1 >> 2] = $3; HEAP32[$10_1 + 4 >> 2] = $3; $4_1 = $10_1 + 8 | 0; wasm2js_memory_copy($4_1, $29_1, 48); $3 = 1; $2_1 = $2_1 + $42_1 | 0; $2_1 = ($2_1 | 0) <= 1 ? 1 : $2_1; $5_1 = HEAP32[$9_1 + 4 >> 2] + 8 | 0; while (1) { if (($2_1 | 0) == ($3 | 0)) { break block153 } wasm2js_memory_copy($4_1 + Math_imul($3, 48) | 0, $5_1 + Math_imul(HEAPU8[($12_1 + Math_imul($3, 96) | 0) + 60 | 0], 48) | 0, 48); $3 = $3 + 1 | 0; continue; }; } $10_1 = HEAP32[$9_1 + 4 >> 2]; } $13_1 = 0; $19_1 = 0; $17_1 = 0; if (!(HEAPU8[$9_1 + 40 | 0] & 16)) { block157 : { if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { $19_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $19_1; $326($14, 75, 0, $19_1); break block157; } $2_1 = $359($8_1); $19_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $19_1 + 1; $326($14, 117, $19_1, HEAPU16[$2_1 + 50 >> 1]); $1097($0_1, $2_1); } $17_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $17_1; } $36_1 = $326($14, 71, 0, $26_1); $3 = 0; $11_1 = HEAP32[$9_1 + 92 >> 2]; block158 : { if (($11_1 | 0) < 2) { break block158 } while (1) { if (($3 | 0) < ($11_1 | 0)) { $2_1 = HEAP32[$9_1 + 104 >> 2] + Math_imul($3, 48) | 0; block160 : { if (($2_1 | 0) == ($32_1 | 0) | HEAPU16[$2_1 + 10 >> 1] & 32774 | !(HEAPU16[$2_1 + 12 >> 1] & 16383)) { break block160 } $2_1 = HEAP32[$2_1 >> 2]; if (HEAPU8[$2_1 + 6 | 0] & 64) { break block160 } $13_1 = $948($0_1, $13_1, $906($25, $2_1, 0)); $11_1 = HEAP32[$9_1 + 92 >> 2]; } $3 = $3 + 1 | 0; continue; } break; }; if (!$13_1) { $13_1 = 0; break block158; } $13_1 = $903($0_1, 65580, 0, $13_1); } $4_1 = 0; $1032($0_1, 1, 19594, 0); $11_1 = 0; $2_1 = 0; while (1) { block164 : { block179 : { block165 : { if (($2_1 | 0) < HEAP32[$24_1 + 12 >> 2]) { $3 = HEAP32[$24_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; if (HEAP32[$3 + 20 >> 2] != ($22_1 | 0) & !(HEAPU8[$3 + 13 | 0] & 4)) { break block164 } $7_1 = $906($25, HEAP32[$3 >> 2], 0); if (HEAPU8[$25 + 87 | 0]) { break block165 } $3 = $7_1; if ($13_1) { HEAP32[$13_1 + 12 >> 2] = $3; $3 = $13_1; } HEAP32[$20_1 + 16 >> 2] = $2_1 + 1; $1032($0_1, 1, 17524, $20_1 + 16 | 0); $21_1 = $1044($0_1, $10_1, $3, 0, 0, 0, 32, $28_1); if (!$21_1) { break block165 } $3 = 0; $1292($0_1, $10_1, $21_1 + 760 | 0, 0); block167 : { if (HEAPU8[$9_1 + 40 | 0] & 16) { break block167 } $18_1 = (HEAP32[$24_1 + 12 >> 2] - 1 | 0) == ($2_1 | 0) ? -1 : $2_1; if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { $326($14, 135, $22_1, $17_1); $3 = $312($14, 47, $19_1, 0, $17_1, $18_1); break block167; } $37_1 = $359($8_1); $5_1 = HEAPU16[$37_1 + 50 >> 1]; $16_1 = $1060($0_1, $5_1); while (1) { if (($3 | 0) != ($5_1 | 0)) { $890($14, $8_1, $22_1, HEAP16[HEAP32[$37_1 + 4 >> 2] + ($3 << 1) >> 1], $3 + $16_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; block172 : { block171 : { if (!$18_1) { $3 = 0; break block171; } $3 = $312($14, 29, $19_1, 0, $16_1, $5_1); if (($18_1 | 0) < 0) { break block172 } } $835($14, 97, $16_1, $5_1, $17_1); $312($14, 138, $19_1, $17_1, $16_1, $5_1); if (!$18_1) { break block172 } $18_1 = HEAP32[$14 + 108 >> 2]; if (($18_1 | 0) <= 0) { break block172 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($18_1, 20) | 0) - 18 >> 1] = 16; } $1061($0_1, $16_1, $5_1); } $326($14, 10, $26_1, $27); if ($3) { HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2] } $16_1 = HEAPU8[$21_1 + 48 | 0]; $3 = 0; $5_1 = HEAP32[$21_1 + 840 >> 2]; block175 : { if (!(HEAPU8[$5_1 + 41 | 0] & 2)) { break block175 } $5_1 = HEAP32[$5_1 + 32 >> 2]; if (!!$2_1 & ($4_1 | 0) != ($5_1 | 0)) { break block175 } if (!(HEAPU8[$8_1 + 28 | 0] & 128)) { $3 = $5_1; break block175; } $3 = ((HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8) & 3) != 2 ? $5_1 : 0; } if ($16_1 & 1) { HEAP8[$9_1 + 48 | 0] = HEAPU8[$9_1 + 48 | 0] | 1 } $11_1 = $16_1 & 2 ? 1 : $11_1; $1054($21_1); $1077($0_1); break block179; } $1077($0_1); HEAP32[$12_1 + 72 >> 2] = $4_1; if ($4_1) { HEAP32[$12_1 + 8 >> 2] = $28_1 } if ($13_1) { HEAP32[$13_1 + 12 >> 2] = 0; $790($25, $13_1); } HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($36_1, 20) | 0) + 4 >> 2] = HEAP32[$14 + 108 >> 2]; $863($14, HEAP32[$12_1 + 12 >> 2]); $1013($14, $27); HEAP32[$12_1 + 68 >> 2] = HEAP32[$14 + 108 >> 2]; if (HEAPU8[$9_1 + 44 | 0] >= 2) { $13($25, $10_1) } $8_1 = 0; if ($11_1) { break block104 } $1295($12_1, $32_1); break block104; } $3 = $4_1; } $11($25, $7_1); $4_1 = $3; } $2_1 = $2_1 + 1 | 0; continue; }; } if (!($4_1 & 128)) { break block184 } } HEAP8[$12_1 + 61 | 0] = 187; break block185; } HEAP32[$12_1 + 64 >> 2] = $22_1; HEAP8[$12_1 + 61 | 0] = HEAPU8[$24_1 + 51056 | 0]; $2_1 = $326($14, HEAPU8[$24_1 + 51058 | 0], $22_1, $3); HEAP8[$12_1 + 63 | 0] = 1; HEAP32[$12_1 + 68 >> 2] = $2_1 + 1; } $8_1 = 0; break block104; } $8_1 = $5_1; $5_1 = $10_1; $16_1 = $2_1; $2_1 = $11_1; } if (!(!($15_1 | $23_1) | !(HEAPU8[$18_1 + 42 | 0] & 16))) { $858($14, 136, $32_1) } $10_1 = 0; $27 = $1297($0_1, $12_1, $24_1, $13_1, $20_1 - -64 | 0); $13_1 = HEAP32[$20_1 + 64 >> 2]; if (!(!$13_1 | !$16_1)) { $10_1 = $116($25, $3 + $13_1 | 0) } $36_1 = HEAP32[$12_1 + ($7_1 ? 40 : 16) >> 2]; $26_1 = $5_1 ? (HEAPU8[$5_1 + 12 | 0] & 40) != 0 : 1; $21_1 = $8_1 ? (HEAPU8[$8_1 + 12 | 0] & 40) != 0 : 1; block194 : { if ($5_1) { $17_1 = HEAP32[HEAP32[$5_1 >> 2] + 16 >> 2]; $11_1 = $3 + $27 | 0; $1294($0_1, $17_1, $11_1, $2_1); $1298($14, $12_1, $5_1); block191 : { if (HEAPU8[$5_1 + 10 | 0] & 128) { break block191 } if (!$1051($17_1)) { break block191 } $326($14, 51, $11_1, $36_1); } if ($13_1) { $1299($17_1, $2_1, $3 + $13_1 | 0) } $2_1 = $2_1 + $3 | 0; $11_1 = 1; $28_1 = 0; if ($1182($17_1)) { $26_1 = 1; break block194; } $1295($12_1, $5_1); $13_1 = HEAP32[$20_1 + 64 >> 2]; break block194; } if ($28_1) { $26_1 = 0; $326($14, 75, 0, $3 + $27 | 0); $28_1 = 1; $2_1 = $3 + 1 | 0; $11_1 = 1; break block194; } if (!$7_1) { $11_1 = ($3 | 0) != 0; $28_1 = 0; $2_1 = $3; break block194; } $28_1 = 0; $326($14, 75, 0, $3 + $27 | 0); $11_1 = 1; $2_1 = $3 + 1 | 0; } $1300($0_1, $27, $2_1 - $28_1 | 0, $13_1); $37_1 = HEAPU16[$18_1 + 46 >> 1]; block198 : { if ($37_1) { $17_1 = 0; if (($2_1 | 0) == ($37_1 | 0)) { break block198 } } if ($7_1) { $326($14, 71, 1, $7_1) } $17_1 = HEAP32[$12_1 + 52 >> 2]; if ($17_1) { $312($14, 64, $17_1, $36_1, $27, $3); $1296($0_1, $9_1, $15_1, $36_1, $30_1, $31_1); } $17_1 = 0; $11_1 = $24_1 | ($26_1 << 1 | ($11_1 ? 4 : 0)); $37_1 = HEAPU8[$11_1 + 51044 | 0]; block201 : { if (!(HEAP32[$18_1 + 40 >> 2] & 1048576) | ($11_1 | 0) != 6) { break block201 } $11_1 = $858($14, 124, (HEAP16[HEAP32[$4_1 + 8 >> 2] >> 1] + 9 | 0) / 10 | 0); if (!($5_1 | $8_1)) { $17_1 = $11_1; break block201; } $5_1 = HEAP32[$14 + 108 >> 2]; if (($5_1 | 0) > 0) { HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($5_1, 20) | 0) - 18 >> 1] = 1 } HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = $5_1 + 1; } $312($14, $37_1, $32_1, $36_1, $27, $2_1); if (!$7_1) { break block198 } $326($14, 9, 0, HEAP32[$14 + 108 >> 2] + 2 | 0); $312($14, HEAPU8[($24_1 | ($2_1 >>> 0 < 2 ? 2 : 6)) + 51044 | 0], $32_1, $36_1, $27, $2_1 - $26_1 | 0); } block209 : { if ($8_1) { $2_1 = HEAP32[HEAP32[$8_1 >> 2] + 16 >> 2]; $5_1 = $3 + $27 | 0; $1294($0_1, $2_1, $5_1, $16_1); $1298($14, $12_1, $8_1); block206 : { if (HEAPU8[$8_1 + 10 | 0] & 128) { break block206 } if (!$1051($2_1)) { break block206 } $326($14, 51, $5_1, $36_1); } if ($10_1) { $1299($2_1, $16_1, $10_1); $1300($0_1, $5_1, $16_1, $10_1); } $5_1 = $3 + $16_1 | 0; if ($1182($2_1)) { $21_1 = 1; break block209; } $1295($12_1, $8_1); $13_1 = HEAP32[$20_1 + 64 >> 2]; break block209; } if ($19_1) { $5_1 = $3; break block209; } if (!$7_1) { $326($14, 75, 0, $3 + $27 | 0); $21_1 = 0; } $5_1 = $3 + 1 | 0; } if ($13_1) { $16($25, $13_1) } if ($10_1) { $16($25, $10_1) } $2_1 = HEAP32[$14 + 108 >> 2]; HEAP32[$12_1 + 68 >> 2] = $2_1; block214 : { if (!$5_1) { break block214 } if ($7_1) { $326($14, 17, $7_1, $2_1 + 3 | 0) } $312($14, HEAPU8[($24_1 << 1 | $21_1) + 51052 | 0], $32_1, $36_1, $27, $5_1); if (!$17_1) { break block214 } HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($17_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2]; } if ($7_1) { $326($14, 16, $7_1, HEAP32[$14 + 108 >> 2] + 2 | 0); $312($14, HEAPU8[($24_1 << 1 | $28_1) + 51052 | 0], $32_1, $36_1, $27, $5_1 + $28_1 | 0); } $2_1 = HEAP32[$18_1 + 40 >> 2]; if ($2_1 & 262144) { $835($14, 125, $32_1, $3, $3); $2_1 = HEAP32[$18_1 + 40 >> 2]; } block220 : { if (!(!($2_1 & 64) | HEAPU16[$9_1 + 40 >> 1] & 4128)) { $8_1 = 0; break block220; } $2_1 = HEAP32[$4_1 + 12 >> 2]; block224 : { if (!(HEAPU8[$2_1 + 28 | 0] & 128)) { $2_1 = HEAP32[$9_1 >> 2]; $5_1 = HEAP32[$2_1 + 8 >> 2]; HEAP8[$9_1 + 48 | 0] = HEAPU8[$9_1 + 48 | 0] | 1; $835($5_1, 141, $32_1, 0, $22_1); $8_1 = $4_1; if (!(HEAPU16[$9_1 + 40 >> 1] & 4128)) { break block220 } $3 = HEAP32[$2_1 + 132 >> 2]; if (HEAP32[($3 ? $3 : $2_1) + 92 >> 2]) { break block220 } $13_1 = HEAP32[$4_1 + 12 >> 2]; $2_1 = $270(HEAP32[$2_1 >> 2], (HEAP16[$13_1 + 34 >> 1] << 2) + 4 & -4, 0); if (!$2_1) { break block220 } HEAP32[$2_1 >> 2] = HEAP16[$13_1 + 34 >> 1]; $10_1 = $2_1 + 4 | 0; $3 = HEAPU16[$4_1 + 52 >> 1]; $8_1 = ($3 >>> 0 <= 1 ? 1 : $3) - 1 | 0; $3 = 0; while (1) { if (($3 | 0) != ($8_1 | 0)) { $11_1 = HEAP16[HEAP32[$4_1 + 4 >> 2] + ($3 << 1) >> 1]; $16_1 = $1111($13_1, $11_1); if (($11_1 | 0) < 0) { $3 = $3 + 1 | 0 } else { $3 = $3 + 1 | 0; HEAP32[$10_1 + ($16_1 << 2) >> 2] = $3; } continue; } break; }; $315($5_1, -1, $2_1, -14); break block224; } $8_1 = $4_1; if (($22_1 | 0) == ($32_1 | 0)) { break block220 } $3 = 0; $2_1 = $359($2_1); $5_1 = $1060($0_1, HEAPU16[$2_1 + 50 >> 1]); while (1) { $8_1 = HEAPU16[$2_1 + 50 >> 1]; if ($3 >>> 0 < $8_1 >>> 0) { $835($14, 94, $32_1, $889($4_1, HEAP16[HEAP32[$2_1 + 4 >> 2] + ($3 << 1) >> 1]), $3 + $5_1 | 0); $3 = $3 + 1 | 0; continue; } break; }; $312($14, 28, $22_1, $35_1, $5_1, $8_1); } $8_1 = $4_1; } block226 : { if (HEAP32[$12_1 >> 2]) { break block226 } $2_1 = HEAP32[$4_1 + 36 >> 2]; if (!$2_1) { break block226 } $1301($2_1, $22_1, $34_1); } block230 : { block227 : { $2_1 = HEAP32[$18_1 + 40 >> 2]; if ($2_1 & 4096) { break block227 } block228 : { if (!HEAP32[$12_1 + 72 >> 2] | $7_1) { break block228 } $3 = HEAP32[$18_1 + 32 >> 2]; if (HEAPU16[$18_1 + 46 >> 1] | !HEAPU8[$3 + 54 | 0]) { break block228 } $4_1 = HEAPU16[$18_1 + 24 >> 1]; if (($4_1 | 0) != HEAPU16[$3 + 50 >> 1]) { break block228 } $5_1 = 0; while (1) { if (($4_1 | 0) == ($5_1 | 0)) { break block227 } $3 = $5_1 << 2; $5_1 = $5_1 + 1 | 0; if (!(HEAPU16[HEAP32[$3 + HEAP32[$18_1 + 52 >> 2] >> 2] + 12 >> 1] & 384)) { continue } break; }; } if ($24_1) { HEAP8[$12_1 + 61 | 0] = 38; break block230; } HEAP8[$12_1 + 61 | 0] = 39; break block230; } HEAP8[$12_1 + 61 | 0] = 187; } HEAP32[$12_1 + 64 >> 2] = $32_1; HEAP8[$12_1 + 62 | 0] = $2_1 >>> 16 & 1; if ($2_1 & 15) { break block104 } HEAP8[$12_1 + 63 | 0] = 1; } $4_1 = $8_1 ? 1 : 2; while (1) { $2_1 = HEAP32[$9_1 + 92 >> 2]; $3 = HEAP32[$9_1 + 104 >> 2]; $13_1 = 0; while (1) { if (($2_1 | 0) > 0) { $5_1 = HEAPU16[$3 + 10 >> 1]; block232 : { if ($5_1 & 6) { break block232 } $10_1 = HEAP32[$12_1 + 88 >> 2]; $11_1 = HEAP32[$12_1 + 92 >> 2]; if ($10_1 & HEAP32[$3 + 40 >> 2] | $11_1 & HEAP32[$3 + 44 >> 2]) { HEAP8[$9_1 + 48 | 0] = HEAPU8[$9_1 + 48 | 0] | 2; break block232; } $7_1 = HEAP32[$3 >> 2]; $16_1 = HEAPU8[$29_1 + 12 | 0]; if ($16_1 & 88) { $17_1 = HEAP32[$7_1 + 4 >> 2]; if (!($17_1 & 3) | !(!($16_1 & 8) | $17_1 & 1)) { break block232 } if ($1277($39_1, HEAP32[$7_1 + 36 >> 2]) & $10_1 | $11_1 & i64toi32_i32$HIGH_BITS) { break block232 } } block239 : { block238 : { if (($4_1 | 0) == 1) { if (!$1302($7_1, HEAP32[$12_1 + 4 >> 2], $8_1)) { $13_1 = 2; break block232; } $5_1 = HEAPU16[$3 + 10 >> 1]; break block238; } if ($4_1 >>> 0 > 2) { break block239 } } if (!($5_1 & 4096)) { break block239 } $13_1 = $13_1 ? $13_1 : 3; break block232; } $16_1 = 0; block240 : { if (!($5_1 & 512)) { break block240 } $5_1 = HEAP32[$12_1 + 44 >> 2]; if (!$5_1) { break block240 } $16_1 = $858($14, $5_1 & 1 | 16, $5_1 >>> 1 | 0); } $1059($0_1, $7_1, $35_1, 16); if ($16_1) { HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($16_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2] } HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] | 4; } $3 = $3 + 48 | 0; $2_1 = $2_1 - 1 | 0; continue; } break; }; $4_1 = $13_1; if (($4_1 | 0) > 0) { continue } break; }; $2_1 = HEAP32[$9_1 + 100 >> 2]; $3 = HEAP32[$9_1 + 104 >> 2]; while (1) { if (($2_1 | 0) > 0) { block244 : { if (HEAPU8[$3 + 10 | 0] & 6) { break block244 } $4_1 = HEAPU16[$3 + 12 >> 1]; if (!($4_1 & 130) | !($4_1 & 2048) | (HEAPU8[$29_1 + 12 | 0] & 88 | ($22_1 | 0) != HEAP32[$3 + 20 >> 2])) { break block244 } $7_1 = HEAP32[$3 >> 2]; $4_1 = $1273($34_1, $22_1, HEAP32[$3 + 24 >> 2], $30_1, $31_1, 131, 0); if (!$4_1 | HEAPU8[$4_1 + 10 | 0] & 4) { break block244 } $5_1 = HEAP32[$4_1 >> 2]; if (!(!(HEAP8[$4_1 + 12 | 0] & 1) | !(HEAPU8[$5_1 + 5 | 0] & 16)) & HEAP32[HEAP32[HEAP32[$5_1 + 20 >> 2] + 28 >> 2] >> 2] > 1) { break block244 } $8_1 = $20_1 - -64 | 0; wasm2js_memory_copy($8_1, $5_1, 52); HEAP32[$20_1 + 76 >> 2] = HEAP32[$7_1 + 12 >> 2]; $1059($0_1, $8_1, $35_1, 16); HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 4; } $3 = $3 + 48 | 0; $2_1 = $2_1 - 1 | 0; continue; } break; }; $4_1 = HEAP32[$12_1 + 56 >> 2]; if ($4_1) { block249 : { $7_1 = HEAP32[(HEAP32[$9_1 + 4 >> 2] + Math_imul(HEAPU8[$12_1 + 60 | 0], 48) | 0) + 16 >> 2]; if (!(HEAPU8[$7_1 + 28 | 0] & 128)) { $2_1 = 1; $8_1 = $1060($0_1, 2); $5_1 = $8_1 + 1 | 0; $326($14, 135, HEAP32[$12_1 + 4 >> 2], $5_1); break block249; } $13_1 = $359($7_1); $2_1 = HEAPU16[$13_1 + 50 >> 1]; $8_1 = $1060($0_1, $2_1 + 1 | 0); $5_1 = $8_1 + 1 | 0; $3 = 0; while (1) { if (($2_1 | 0) == ($3 | 0)) { break block249 } $890($14, $7_1, $22_1, HEAP16[HEAP32[$13_1 + 4 >> 2] + ($3 << 1) >> 1], $3 + $5_1 | 0); $3 = $3 + 1 | 0; continue; }; } $7_1 = $312($14, 29, HEAP32[$4_1 >> 2], 0, $5_1, $2_1); $835($14, 97, $5_1, $2_1, $8_1); $312($14, 138, HEAP32[$4_1 >> 2], $8_1, $5_1, $2_1); $312($14, 183, HEAP32[$4_1 + 4 >> 2], 0, $5_1, $2_1); $3 = HEAP32[$14 + 108 >> 2]; if (($3 | 0) > 0) { HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($3, 20) | 0) - 18 >> 1] = 16 } HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? 82740 : HEAP32[$14 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 8 >> 2] = $3; $1061($0_1, $8_1, $2_1 + 1 | 0); } block255 : { $2_1 = HEAP32[$12_1 >> 2]; block254 : { block253 : { if ($2_1) { HEAP32[$12_1 + 28 >> 2] = HEAP32[$14 + 108 >> 2]; $326($14, 71, 1, $2_1); $3 = HEAP32[$12_1 + 56 >> 2]; if ($3) { break block253 } break block254; } $3 = HEAP32[$12_1 + 56 >> 2]; if (!$3) { break block255 } } $326($14, 74, 0, HEAP32[$3 + 8 >> 2]); HEAP32[$3 + 12 >> 2] = HEAP32[$14 + 108 >> 2]; HEAP8[$0_1 + 26 | 0] = HEAPU8[$0_1 + 26 | 0] + 1; } $3 = HEAP32[$9_1 + 104 >> 2]; $2_1 = 0; while (1) { if (HEAP32[$9_1 + 100 >> 2] <= ($2_1 | 0)) { break block255 } if (!(HEAPU8[$29_1 + 12 | 0] & 64 | (HEAPU8[$3 + 10 | 0] & 6 | (HEAP32[$12_1 + 88 >> 2] & HEAP32[$3 + 40 >> 2] | HEAP32[$12_1 + 92 >> 2] & HEAP32[$3 + 44 >> 2]) != 0))) { $1059($0_1, HEAP32[$3 >> 2], $35_1, 16); HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] | 4; } $3 = $3 + 48 | 0; $2_1 = $2_1 + 1 | 0; continue; }; } $30_1 = HEAP32[$12_1 + 88 >> 2]; $31_1 = HEAP32[$12_1 + 92 >> 2]; } HEAP32[$9_1 + 28 >> 2] = HEAP32[$12_1 + 24 >> 2]; $42_1 = $42_1 - 1 | 0; $15_1 = $15_1 + 1 | 0; $23_1 = $15_1 ? $23_1 : $23_1 + 1 | 0; continue; }; } if (!$9_1) { break block3 } } HEAP16[$0_1 + 160 >> 1] = HEAP32[$9_1 + 36 >> 2]; $1303($33_1, $9_1); } $9_1 = 0; } $0_1 = $20_1 + 160 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1; } function $1045($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; if (!HEAPU8[$2_1 + 87 | 0]) { $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0; $329($2_1, HEAP8[$0_1 + 1 | 0], HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 16 >> 2] = 0; HEAP16[$0_1 >> 1] = 187; } } function $1046($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $0_1 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 12 >> 2] = 0; $371($0_1, $1_1, HEAPU8[$0_1 + 84 | 0], 67, $2_1 + 12 | 0); $0_1 = HEAP32[$2_1 + 12 >> 2]; if ($0_1) { $3 = ($50($0_1) | 0) > 0 } $200($0_1); $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1047($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $10($0_1, HEAP32[$1_1 + 20 >> 2]); $10($0_1, HEAP32[$1_1 + 32 >> 2]); $13($0_1, $1_1); } function $1048($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$1_1) { break block } $2_1 = $1_1 + 8 | 0; while (1) { if (HEAP32[$1_1 >> 2] <= ($3 | 0)) { break block } $1050($0_1, HEAP32[$2_1 >> 2]); $2_1 = $2_1 + 16 | 0; $3 = $3 + 1 | 0; continue; }; } } function $1049($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 + -64 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (HEAPU8[$1_1 | 0] == 44) { break block } $3 = 1; $5_1 = HEAP32[$0_1 + 24 >> 2]; if (!$1266(HEAP32[$0_1 >> 2], $1_1, HEAP32[$5_1 + 40 >> 2]) | (HEAP32[$1_1 + 4 >> 2] & 536870913) == 536870912 | HEAP32[$1_1 + 40 >> 2]) { break block } $4_1 = $942(HEAP32[HEAP32[$0_1 >> 2] >> 2], 156, 24184); if (!$4_1) { break block } $3 = HEAP32[$5_1 + 36 >> 2]; $6_1 = $2_1 + 12 | 0; wasm2js_memory_copy($6_1, $4_1, 52); wasm2js_memory_copy($4_1, $1_1, 52); wasm2js_memory_copy($1_1, $6_1, 52); HEAP32[$5_1 + 36 >> 2] = $948(HEAP32[$0_1 >> 2], $3, $4_1); $3 = 1; HEAP16[$0_1 + 20 >> 1] = 1; } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $1050($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 + 28 >> 2] = $0_1; HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 50; HEAP32[$2_1 + 12 >> 2] = 49; HEAP32[$2_1 + 8 >> 2] = 73; HEAP32[$2_1 + 4 >> 2] = 0; $920($2_1 + 4 | 0, $1_1); $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1051($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; block1 : { while (1) { block2 : { block : { $1_1 = HEAPU8[$0_1 | 0]; switch ($1_1 - 173 | 0) { case 0: case 1: break block; case 3: break block2; default: break block1; }; } $0_1 = HEAP32[$0_1 + 12 >> 2]; continue; } break; }; $1_1 = HEAPU8[$0_1 + 2 | 0]; } block3 : { if (($1_1 | 0) == 118 | $1_1 - 154 >>> 0 < 3) { break block3 } if (($1_1 | 0) == 168) { $2_1 = 1; if (HEAPU8[$0_1 + 6 | 0] & 32) { break block3 } $1_1 = HEAP32[$0_1 + 44 >> 2]; if (!$1_1) { break block3 } $2_1 = 0; $0_1 = HEAP16[$0_1 + 32 >> 1]; if (($0_1 | 0) < 0) { break block3 } $3 = HEAP32[$1_1 + 4 >> 2]; if (!$3 | ($0_1 | 0) >= HEAP16[$1_1 + 34 >> 1]) { break block3 } return !(HEAPU8[(Math_imul($0_1, 12) + $3 | 0) + 4 | 0] & 15); } $2_1 = 1; } return $2_1; } function $1052($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] | 131072; while (1) { if (($3 | 0) < HEAP32[$0_1 + 36 >> 2]) { $2_1 = HEAP32[HEAP32[$0_1 + 32 >> 2] + Math_imul($3, 24) >> 2]; $1048($1_1, HEAP32[$2_1 + 20 >> 2]); $4_1 = HEAP32[$2_1 + 12 >> 2]; if ($4_1) { $1048($1_1, HEAP32[$4_1 + 20 >> 2]) } if (HEAP8[$2_1 + 7 | 0] & 1) { $1050($1_1, HEAP32[HEAP32[$2_1 + 44 >> 2] + 40 >> 2]) } $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] & -131073; } function $1053($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $5_1 = HEAPU16[$1_1 + 52 >> 1]; $2_1 = HEAP32[$0_1 >> 2]; block2 : { if (HEAPU8[$1_1 + 55 | 0] & 8) { $4_1 = $2_1; $2_1 = HEAPU16[$1_1 + 50 >> 1]; $2_1 = $1078($4_1, $2_1, $5_1 - $2_1 | 0); break block2; } $2_1 = $1078($2_1, $5_1, 0); } if (!$2_1) { break block } $7_1 = $2_1 + 20 | 0; while (1) { if (!(($3 | 0) == ($5_1 | 0))) { $6_1 = $3 << 2; $4_1 = HEAP32[$6_1 + HEAP32[$1_1 + 32 >> 2] >> 2]; if (($4_1 | 0) == 33712) { $4_1 = 0 } else { $4_1 = $985($0_1, $4_1) } HEAP32[$7_1 + $6_1 >> 2] = $4_1; HEAP8[HEAP32[$2_1 + 16 >> 2] + $3 | 0] = HEAPU8[HEAP32[$1_1 + 28 >> 2] + $3 | 0]; $3 = $3 + 1 | 0; continue; } break; }; if (!HEAP32[$0_1 + 40 >> 2]) { return $2_1 } $3 = HEAPU8[$1_1 + 55 | 0] | HEAPU8[$1_1 + 56 | 0] << 8; if (!($3 & 512)) { $3 = $3 | 512; HEAP8[$1_1 + 55 | 0] = $3; HEAP8[$1_1 + 56 | 0] = $3 >>> 8; HEAP32[$0_1 + 12 >> 2] = 513; } $643($2_1); } return 0; } function $1054($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0; $7_1 = $0_1 + 760 | 0; $21_1 = HEAP32[$0_1 + 4 >> 2]; $22_1 = $21_1 + 8 | 0; $1_1 = HEAPU8[$0_1 + 44 | 0]; $12_1 = HEAP32[$0_1 >> 2]; $19_1 = HEAP32[$12_1 >> 2]; $4_1 = HEAP32[$12_1 + 8 >> 2]; $25 = HEAP32[$4_1 + 108 >> 2]; while (1) { if (($1_1 | 0) > 0) { $17_1 = $1_1 - 1 | 0; $3 = Math_imul($17_1, 96) + $7_1 | 0; $2_1 = HEAP32[$3 + 56 >> 2]; if ($2_1) { $1013($4_1, HEAP32[$3 + 24 >> 2]); HEAP32[$3 + 24 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = HEAP32[$4_1 + 108 >> 2]; $835($4_1, 67, HEAP32[$2_1 + 8 >> 2], HEAP32[$2_1 + 12 >> 2], 1); $23_1 = $23_1 + 1 | 0; } $10_1 = HEAP32[$3 + 80 >> 2]; block8 : { if (HEAPU8[$3 + 61 | 0] != 187) { $5_1 = 0; block3 : { if (!(HEAPU8[$10_1 + 41 | 0] & 2) | (HEAPU8[$0_1 + 47 | 0] != 2 | HEAPU8[$0_1 + 44 | 0] != ($1_1 | 0))) { break block3 } $1_1 = HEAP32[$10_1 + 32 >> 2]; if (!(HEAPU8[$1_1 + 55 | 0] & 128)) { break block3 } $2_1 = HEAPU16[$10_1 + 30 >> 1]; if (!$2_1 | HEAP16[HEAP32[$1_1 + 8 >> 2] + ($2_1 << 1) >> 1] < 36) { break block3 } $11_1 = HEAP32[$12_1 + 48 >> 2] + 1 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) != ($2_1 | 0)) { $835($4_1, 94, HEAP32[$3 + 8 >> 2], $1_1, $1_1 + $11_1 | 0); $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$12_1 + 48 >> 2] = ($2_1 + HEAP32[$12_1 + 48 >> 2] | 0) + 1; $5_1 = $312($4_1, HEAPU8[$3 + 61 | 0] == 38 ? 21 : 24, HEAP32[$3 + 8 >> 2], 0, $11_1, $2_1); $326($4_1, 9, 1, HEAP32[$3 + 68 >> 2]); } $1_1 = HEAP32[$3 + 24 >> 2]; if ($1_1) { $1013($4_1, $1_1) } $835($4_1, HEAPU8[$3 + 61 | 0], HEAP32[$3 + 64 >> 2], HEAP32[$3 + 68 >> 2], HEAPU8[$3 + 62 | 0]); $1_1 = HEAP32[$4_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$4_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = HEAPU8[$3 + 63 | 0] } if (HEAP32[$3 + 36 >> 2]) { $1013($4_1, HEAP32[$3 + 40 >> 2]); $326($4_1, 61, HEAP32[$3 + 36 >> 2], HEAP32[$3 + 68 >> 2] - 1 | 0); } if (!$5_1) { break block8 } HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; break block8; } $1_1 = HEAP32[$3 + 24 >> 2]; if (!$1_1) { break block8 } $1013($4_1, $1_1); } block10 : { if (!(HEAPU8[$10_1 + 41 | 0] & 8) | HEAP32[$3 + 72 >> 2] <= 0) { break block10 } $1013($4_1, HEAP32[$3 + 16 >> 2]); $5_1 = HEAP32[$3 + 72 >> 2]; $1_1 = HEAP32[$3 + 76 >> 2] + Math_imul($5_1, 20) | 0; while (1) { if (($5_1 | 0) <= 0) { break block10 } $8_1 = $1_1 - 16 | 0; $2_1 = $1_1 - 20 | 0; $6_1 = HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]; if ($6_1) { $9_1 = 82740 } else { $9_1 = (HEAP32[$4_1 + 104 >> 2] + Math_imul(HEAP32[$8_1 >> 2], 20) | 0) + 20 | 0 } $11_1 = HEAP32[$4_1 + 108 >> 2]; HEAP32[$9_1 + 8 >> 2] = $11_1; $9_1 = $1_1 - 4 | 0; if (HEAPU8[$9_1 | 0] != 187) { $13_1 = $1_1 - 8 | 0; block13 : { if (!HEAP32[$13_1 >> 2]) { break block13 } $6_1 = HEAP32[$10_1 + 40 >> 2] & 263168; if (HEAP32[$3 >> 2]) { $326($4_1, 25, HEAP32[$2_1 >> 2], ((($6_1 | 0) == 262144) + $11_1 | 0) + 2 | 0) } if (($6_1 | 0) != 262144) { break block13 } $312($4_1, 26, HEAP32[$3 + 8 >> 2], HEAP32[$4_1 + 108 >> 2] + 2 | 0, HEAP32[$1_1 - 12 >> 2], HEAP32[$13_1 >> 2]); if (HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]) { $1_1 = 82740 } else { $1_1 = (HEAP32[$4_1 + 104 >> 2] + Math_imul(HEAP32[$8_1 >> 2], 20) | 0) + 20 | 0 } HEAP32[$1_1 + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; } $326($4_1, HEAPU8[$9_1 | 0], HEAP32[$2_1 >> 2], HEAP32[$8_1 >> 2]); $6_1 = HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]; $11_1 = HEAP32[$4_1 + 108 >> 2]; } if ($6_1) { $1_1 = 82740 } else { $1_1 = (HEAP32[$4_1 + 104 >> 2] + Math_imul(HEAP32[$8_1 >> 2], 20) | 0) - 20 | 0 } HEAP32[$1_1 + 8 >> 2] = $11_1; $5_1 = $5_1 - 1 | 0; $1_1 = $2_1; continue; }; } $1013($4_1, HEAP32[$3 + 12 >> 2]); $1_1 = HEAP32[$3 + 56 >> 2]; if ($1_1) { $835($4_1, 67, HEAP32[$1_1 + 8 >> 2], 0, 1) } $1_1 = HEAP32[$3 + 20 >> 2]; if ($1_1) { $863($4_1, $1_1); $1_1 = HEAP32[$4_1 + 108 >> 2]; block20 : { if (HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]) { HEAP32[20687] = $1_1; $2_1 = 82740; break block20; } $2_1 = HEAP32[$4_1 + 104 >> 2] + Math_imul(HEAP32[$3 + 20 >> 2], 20) | 0; HEAP32[$2_1 + 8 >> 2] = $1_1; $2_1 = $2_1 - 40 | 0; } HEAP32[$2_1 + 8 >> 2] = $1_1; } $1_1 = HEAP32[$3 + 48 >> 2]; if ($1_1) { $326($4_1, 61, HEAP32[$3 + 44 >> 2] >>> 1 | 0, $1_1) } $1_1 = $17_1; $2_1 = HEAP32[$3 >> 2]; if (!$2_1) { continue } $1_1 = HEAP32[$10_1 + 40 >> 2]; $11_1 = $858($4_1, 50, $2_1); if (!($1_1 & 64)) { $2_1 = Math_imul(HEAPU8[$3 + 60 | 0], 48) + $22_1 | 0; if (HEAPU8[$2_1 + 13 | 0] & 64) { $5_1 = HEAP32[HEAP32[$2_1 + 44 >> 2] + 12 >> 2]; $835($4_1, 75, 0, $5_1, ($5_1 + HEAP16[HEAP32[$2_1 + 8 >> 2] + 34 >> 1] | 0) - 1 | 0); } $858($4_1, 136, HEAP32[$3 + 4 >> 2]); } $2_1 = $1_1 & 8192; block25 : { block27 : { block26 : { if (!($1_1 & 512)) { if (!$2_1) { break block25 } if (HEAP32[$3 + 72 >> 2]) { break block26 } break block25; } if (!$2_1) { break block27 } } $1_1 = HEAP32[$3 + 72 >> 2]; $835($4_1, 101, HEAP32[$3 + 8 >> 2], HEAP32[$1_1 + 44 >> 2], $309($19_1, HEAP32[$1_1 + 24 >> 2])); $1097($12_1, $1_1); } $858($4_1, 136, HEAP32[$3 + 8 >> 2]); } block29 : { if (HEAPU8[$3 + 61 | 0] == 67) { $326($4_1, 10, HEAP32[$3 + 64 >> 2], HEAP32[$3 + 28 >> 2]); break block29; } $863($4_1, HEAP32[$3 + 28 >> 2]); } HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; $1_1 = $17_1; continue; } break; }; $17_1 = $12_1 + 76 | 0; $11_1 = 0; while (1) { if ($11_1 >>> 0 < HEAPU8[$0_1 + 44 | 0]) { block33 : { if (HEAP32[$7_1 + 56 >> 2]) { $6_1 = 0; $9_1 = 0; $3 = global$0 + -64 | 0; $1_1 = $3; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $15_1 = HEAP32[$7_1 + 80 >> 2]; $10_1 = HEAP32[$7_1 + 56 >> 2]; $2_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$2_1 + 8 >> 2]; $1_1 = HEAP32[$0_1 + 4 >> 2] + Math_imul(HEAPU8[$7_1 + 60 | 0], 48) | 0; HEAP32[$3 >> 2] = HEAP32[HEAP32[$1_1 + 16 >> 2] >> 2]; $1032($2_1, 1, 7416, $3); $16_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $20_1 = $0_1 + 760 | 0; $13_1 = $1_1 + 8 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) != ($16_1 | 0)) { $8_1 = $20_1 + Math_imul($1_1, 96) | 0; $14 = HEAP32[$8_1 + 80 >> 2]; $26_1 = HEAP32[$14 + 8 >> 2]; $14 = HEAP32[$14 + 12 >> 2]; $18_1 = HEAP32[$0_1 + 4 >> 2] + Math_imul(HEAPU8[$8_1 + 60 | 0], 48) | 0; if (HEAPU8[$18_1 + 21 | 0] & 64) { $18_1 = HEAP32[($18_1 + 8 | 0) + 44 >> 2]; $24_1 = HEAP32[$18_1 + 12 >> 2]; $835($5_1, 75, 0, $24_1, ($24_1 + HEAP32[HEAP32[HEAP32[$18_1 >> 2] + 28 >> 2] >> 2] | 0) - 1 | 0); } $858($5_1, 136, HEAP32[$8_1 + 4 >> 2]); $8_1 = HEAP32[$8_1 + 8 >> 2]; if ($8_1) { $858($5_1, 136, $8_1) } $6_1 = $6_1 | $26_1; $9_1 = $9_1 | $14; $1_1 = $1_1 + 1 | 0; continue; } break; }; $8_1 = 0; block31 : { if (HEAPU8[$13_1 + 12 | 0] & 64) { break block31 } $16_1 = (HEAP32[$15_1 + 8 >> 2] | $6_1) ^ -1; $9_1 = ($9_1 | HEAP32[$15_1 + 12 >> 2]) ^ -1; $1_1 = 0; while (1) { if (HEAP32[$0_1 + 92 >> 2] <= ($1_1 | 0)) { break block31 } $6_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 48) | 0; if (!!(HEAPU16[$6_1 + 10 >> 1] & 32770) & HEAPU16[$6_1 + 12 >> 1] != 8192) { break block31 } block5 : { if (HEAP32[$6_1 + 40 >> 2] & $16_1 | $9_1 & HEAP32[$6_1 + 44 >> 2]) { break block5 } $6_1 = HEAP32[$6_1 >> 2]; if (HEAPU8[$6_1 + 4 | 0] & 3) { break block5 } $8_1 = $948($2_1, $8_1, $906(HEAP32[$2_1 >> 2], $6_1, 0)); } $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$3 + 8 >> 2] = 1; HEAP32[$3 + 12 >> 2] = 1; wasm2js_memory_copy($3 + 16 | 0, $13_1, 48); HEAP8[$3 + 28 | 0] = 0; HEAP8[$2_1 + 26 | 0] = HEAPU8[$2_1 + 26 | 0] + 1; $15_1 = $1044($2_1, $3 + 8 | 0, $8_1, 0, 0, 0, 4096, 0); if ($15_1) { $16_1 = HEAP32[$7_1 + 4 >> 2]; $1_1 = HEAP32[$2_1 + 48 >> 2]; $6_1 = $1_1 + 1 | 0; HEAP32[$2_1 + 48 >> 2] = $6_1; $20_1 = HEAP32[$15_1 + 28 >> 2]; block9 : { $13_1 = HEAP32[$13_1 + 8 >> 2]; if (!(HEAPU8[$13_1 + 28 | 0] & 128)) { $326($5_1, 135, $16_1, $6_1); $9_1 = 1; break block9; } $14 = $359($13_1); $9_1 = HEAPU16[$14 + 50 >> 1]; HEAP32[$2_1 + 48 >> 2] = $1_1 + $9_1; $1_1 = 0; while (1) { if (($1_1 | 0) == ($9_1 | 0)) { break block9 } $890($5_1, $13_1, $16_1, HEAP16[HEAP32[$14 + 4 >> 2] + ($1_1 << 1) >> 1], $1_1 + $6_1 | 0); $1_1 = $1_1 + 1 | 0; continue; }; } $1_1 = $312($5_1, 64, HEAP32[$10_1 + 4 >> 2], 0, $6_1, $9_1); $312($5_1, 29, HEAP32[$10_1 >> 2], $20_1, $6_1, $9_1); HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$5_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; $326($5_1, 10, HEAP32[$10_1 + 8 >> 2], HEAP32[$10_1 + 12 >> 2]); $1054($15_1); } $11(HEAP32[$2_1 >> 2], $8_1); $1077($2_1); HEAP8[$2_1 + 26 | 0] = HEAPU8[$2_1 + 26 | 0] - 1; $1_1 = $3 - -64 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; break block33; } $1_1 = Math_imul(HEAPU8[$7_1 + 60 | 0], 48) + $22_1 | 0; if (HEAPU8[$1_1 + 13 | 0] & 64) { $1308($12_1, HEAP32[$7_1 + 32 >> 2], HEAP32[$7_1 + 4 >> 2], HEAP32[HEAP32[$1_1 + 44 >> 2] + 12 >> 2], 0); break block33; } $5_1 = HEAPU8[$19_1 + 87 | 0]; $3 = HEAP32[$7_1 + 80 >> 2]; $2_1 = HEAP32[$3 + 40 >> 2]; block36 : { if ($2_1 & 576) { $2_1 = $3 + 32 | 0; break block36; } if (!($2_1 & 8192)) { break block33 } $2_1 = $7_1 + 72 | 0; } $10_1 = HEAP32[$2_1 >> 2]; if ($5_1 | !$10_1) { break block33 } $8_1 = HEAP32[$1_1 + 8 >> 2]; $2_1 = !HEAPU8[$0_1 + 46 | 0] | HEAPU8[HEAP32[$10_1 + 12 >> 2] + 28 | 0] & 128 ? $25 : HEAP32[$0_1 + 56 >> 2]; block38 : { if (!(HEAPU8[$10_1 + 56 | 0] & 16)) { break block38 } $1_1 = $17_1; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block38 } if (HEAP32[$1_1 + 8 >> 2] == HEAP32[$7_1 + 8 >> 2]) { HEAP32[$1_1 + 4 >> 2] = -1; HEAP32[$1_1 + 8 >> 2] = -1; } $1_1 = $1_1 + 20 | 0; continue; }; } $5_1 = HEAP32[$7_1 + 32 >> 2] + 1 | 0; $1_1 = HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($5_1, 20) | 0; $6_1 = $1_1 + Math_imul($2_1 - $5_1 | 0, 20) | 0; while (1) { block41 : { if (HEAP32[$1_1 + 4 >> 2] != HEAP32[$7_1 + 4 >> 2]) { break block41 } block45 : { $2_1 = HEAPU8[$1_1 | 0]; if (($2_1 | 0) != 20) { if (($2_1 | 0) != 135) { if (($2_1 | 0) != 94) { break block41 } $2_1 = HEAP32[$1_1 + 8 >> 2]; $9_1 = HEAP32[$8_1 + 28 >> 2]; if ($9_1 & 128) { $2_1 = HEAPU16[HEAP32[$359($8_1) + 4 >> 2] + ($2_1 << 1) >> 1]; break block45; } $5_1 = 0; if (!($9_1 & 32)) { break block45 } while (1) { if ($2_1 << 16 >> 16 < ($5_1 | 0)) { break block45 } $2_1 = (HEAPU16[(HEAP32[$8_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) + 10 >> 1] >>> 5 & 1) + $2_1 | 0; $5_1 = $5_1 + 1 | 0; continue; }; } $2_1 = HEAP32[$7_1 + 8 >> 2]; HEAP8[$1_1 | 0] = 142; HEAP32[$1_1 + 4 >> 2] = $2_1; break block41; } HEAP32[$1_1 + 4 >> 2] = HEAP32[$7_1 + 8 >> 2]; break block41; } $2_1 = $889($10_1, $2_1 << 16 >> 16); if (($2_1 | 0) >= 0) { HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$7_1 + 8 >> 2]; break block41; } $2_1 = HEAP32[$3 + 40 >> 2]; if (!($2_1 & 67108928)) { break block41 } if ($2_1 & 64) { $257($12_1, 9120, 0); HEAP32[$12_1 + 12 >> 2] = 2; break block41; } HEAP32[$3 + 40 >> 2] = $2_1 & -67108929; $1309($12_1, HEAP32[$7_1 + 32 >> 2] - 1 | 0, $21_1, $7_1, HEAPU16[$0_1 + 40 >> 1]); } $1_1 = $1_1 + 20 | 0; if ($6_1 >>> 0 > $1_1 >>> 0) { continue } break; }; } $7_1 = $7_1 + 96 | 0; $11_1 = $11_1 + 1 | 0; continue; } break; }; $1013($4_1, HEAP32[$0_1 + 32 >> 2]); HEAP16[$12_1 + 160 >> 1] = HEAP32[$0_1 + 36 >> 2]; $1303($19_1, $0_1); HEAP8[$12_1 + 26 | 0] = HEAPU8[$12_1 + 26 | 0] - $23_1; } function $1055($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = global$0 - 32 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { $2_1 = HEAP32[$1_1 + 24 >> 2] + HEAP32[$1_1 + 36 >> 2] | 0; if (HEAP32[$0_1 + 40 >> 2] | !$2_1) { break block } $7_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$1_1 + 12 >> 2]; $835($7_1, 75, 0, $3, ($2_1 + $3 | 0) - 1 | 0); $2_1 = HEAP32[$1_1 + 32 >> 2]; while (1) { if (HEAP32[$1_1 + 36 >> 2] <= ($8_1 | 0)) { break block } block1 : { if (HEAP32[$2_1 + 8 >> 2] < 0) { break block1 } $3 = HEAP32[HEAP32[$2_1 >> 2] + 20 >> 2]; if (!(!!$3 & HEAP32[$3 >> 2] == 1)) { $257($0_1, 2851, 0); HEAP32[$2_1 + 8 >> 2] = -1; break block1; } $3 = $1042($0_1, $3, 0, 0); HEAP32[$2_1 + 12 >> 2] = $859($7_1, 117, HEAP32[$2_1 + 8 >> 2], 0, 0, $3, -8); HEAP32[$5_1 + 16 >> 2] = HEAP32[HEAP32[$2_1 + 4 >> 2] + 32 >> 2]; $1032($0_1, 0, 25877, $5_1 + 16 | 0); } if (HEAP32[$2_1 + 16 >> 2] >= 0) { $3 = !HEAPU8[$2_1 + 21 | 0]; $4_1 = HEAP32[$2_1 >> 2]; $6_1 = HEAP32[$4_1 + 12 >> 2]; $3 = HEAPU8[$2_1 + 20 | 0] ? HEAP32[HEAP32[$4_1 + 20 >> 2] >> 2] + $3 | 0 : $3; $6_1 = HEAP32[$6_1 + 20 >> 2]; $3 = HEAPU8[$2_1 + 22 | 0] ? HEAP32[HEAP32[$4_1 + 20 >> 2] >> 2] + $3 | 0 : $3; $4_1 = $1042($0_1, $6_1, 0, $3); if (!(HEAPU8[$2_1 + 21 | 0] | HEAP32[$0_1 + 40 >> 2])) { HEAP16[$4_1 + 6 >> 1] = HEAPU16[$4_1 + 6 >> 1] + 1 } $859($7_1, 117, HEAP32[$2_1 + 16 >> 2], HEAP32[$6_1 >> 2] + $3 | 0, 0, $4_1, -8); HEAP32[$5_1 >> 2] = HEAP32[HEAP32[$2_1 + 4 >> 2] + 32 >> 2]; $1032($0_1, 0, 25844, $5_1); } $2_1 = $2_1 + 24 | 0; $8_1 = $8_1 + 1 | 0; continue; }; } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1056($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $9_1 = HEAP32[$0_1 + 8 >> 2]; HEAP8[$2_1 | 0] = 1; $6_1 = HEAP32[$2_1 + 32 >> 2]; while (1) { if (($15_1 | 0) < HEAP32[$2_1 + 36 >> 2]) { $4_1 = HEAP32[$6_1 >> 2]; $13_1 = HEAP32[$4_1 + 20 >> 2]; $12_1 = 0; if (HEAP8[$4_1 + 7 | 0] & 1) { $4_1 = HEAP32[HEAP32[$4_1 + 44 >> 2] + 40 >> 2]; if (!(!(HEAP32[HEAP32[$6_1 + 4 >> 2] + 4 >> 2] & 32) | (!HEAP32[$2_1 + 28 >> 2] | !$1_1))) { if (!$11_1) { $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; } $326($9_1, 80, $1_1, $11_1); } $12_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $12_1; $1059($0_1, $4_1, $12_1, 16); } block9 : { if (HEAP32[$6_1 + 16 >> 2] >= 0) { $5_1 = HEAP32[HEAP32[HEAP32[$6_1 >> 2] + 12 >> 2] + 20 >> 2]; $8_1 = HEAP32[$13_1 >> 2]; $14 = (((HEAP32[$5_1 >> 2] + !HEAPU8[$6_1 + 21 | 0] | 0) + (HEAPU8[$6_1 + 20 | 0] ? $8_1 : 0) | 0) + (HEAPU8[$6_1 + 22 | 0] ? $8_1 : 0) | 0) + 1 | 0; $4_1 = $1060($0_1, $14); $976($0_1, $5_1, $4_1, 0, 1); $7_1 = HEAP32[$5_1 >> 2]; if (!HEAPU8[$6_1 + 21 | 0]) { $326($9_1, 126, HEAP32[$6_1 + 16 >> 2], $4_1 + $7_1 | 0); $7_1 = $7_1 + 1 | 0; } block8 : { if (!HEAPU8[$6_1 + 20 | 0]) { $5_1 = $4_1; break block8; } $5_1 = $4_1 + $7_1 | 0; $976($0_1, $13_1, $5_1, 0, 1); $7_1 = $7_1 + $8_1 | 0; } if (!HEAPU8[$6_1 + 22 | 0]) { break block9 } $16_1 = HEAPU8[$6_1 + 20 | 0] ? $5_1 : $4_1; $10_1 = 0; $17_1 = ($8_1 | 0) > 0 ? $8_1 : 0; while (1) { if (($10_1 | 0) == ($17_1 | 0)) { break block9 } $326($9_1, 181, $10_1 + $16_1 | 0, $4_1 + $7_1 | 0); $7_1 = $7_1 + 1 | 0; $10_1 = $10_1 + 1 | 0; continue; }; } if (!$13_1) { $8_1 = 0; $4_1 = 0; $14 = 0; $5_1 = 0; break block9; } $14 = 0; $8_1 = HEAP32[$13_1 >> 2]; $4_1 = $1060($0_1, $8_1); $976($0_1, $13_1, $4_1, 0, 1); $5_1 = $4_1; } $7_1 = HEAP32[$6_1 + 8 >> 2]; if (!(!$13_1 | ($7_1 | 0) < 0)) { if (!$12_1) { $12_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $12_1; } HEAP32[$6_1 + 8 >> 2] = $1305($0_1, $3, $7_1, $12_1, $13_1, $5_1); } block14 : { if (HEAP32[$6_1 + 16 >> 2] >= 0) { $5_1 = $14 - 1 | 0; $8_1 = $5_1 + $4_1 | 0; $835($9_1, 97, $4_1, $5_1, $8_1); $312($9_1, 138, HEAP32[$6_1 + 16 >> 2], $8_1, $4_1, $5_1); break block14; } if (HEAPU8[HEAP32[$6_1 + 4 >> 2] + 4 | 0] & 32) { $7_1 = $13_1 + 8 | 0; $5_1 = 0; $10_1 = 0; while (1) { if (!(($10_1 | 0) >= ($8_1 | 0) | $5_1)) { $10_1 = $10_1 + 1 | 0; $5_1 = $851($0_1, HEAP32[$7_1 >> 2]); $7_1 = $7_1 + 16 | 0; continue; } break; }; $5_1 = $5_1 ? $5_1 : HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]; block18 : { if ($11_1) { break block18 } if (!HEAP32[$2_1 + 28 >> 2]) { $11_1 = 0; break block18; } $11_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $11_1; } $859($9_1, 85, $11_1, 0, 0, $5_1, -2); } $835($9_1, 162, 0, $4_1, HEAP32[$2_1 + 24 >> 2] + (HEAP32[$2_1 + 12 >> 2] + $15_1 | 0) | 0); $1043($9_1, HEAP32[$6_1 + 4 >> 2], -7); $5_1 = HEAP32[$9_1 + 108 >> 2]; if (($5_1 | 0) > 0) { HEAP16[(HEAP32[$9_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) - 18 >> 1] = $8_1 } $14 = $8_1; } $1061($0_1, $4_1, $14); if ($12_1) { $1013($9_1, $12_1) } if (HEAP32[$0_1 + 40 >> 2]) { break block } $6_1 = $6_1 + 24 | 0; $15_1 = $15_1 + 1 | 0; continue; } break; }; block23 : { if (!$11_1) { $4_1 = 0; if (!$1_1) { break block23 } $11_1 = $1_1; if (!HEAP32[$2_1 + 28 >> 2]) { break block23 } } $4_1 = $858($9_1, 16, $11_1); } $7_1 = HEAP32[$2_1 + 20 >> 2]; $10_1 = 0; while (1) { if (($10_1 | 0) < HEAP32[$2_1 + 28 >> 2]) { $862($0_1, HEAP32[$7_1 + 4 >> 2], HEAP32[$2_1 + 12 >> 2] + $10_1 | 0); if (HEAP32[$0_1 + 40 >> 2]) { break block } $7_1 = $7_1 + 16 | 0; $10_1 = $10_1 + 1 | 0; continue; } break; }; HEAP8[$2_1 | 0] = 0; if (!$4_1) { break block } $1100($9_1, $4_1); } } function $1057($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block : { if (HEAP32[$0_1 + 40 >> 2] | $1_1 - 1 >>> 0 > 1) { break block } $0_1 = HEAP32[$0_1 + 8 >> 2]; $1045($0_1, $3); $4_1 = $3 + 1 | 0; if (HEAPU8[(HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$0_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) | 0] == 188) { $1045($0_1, $4_1) } if (($1_1 | 0) != 2) { break block } $1_1 = 82740; $1_1 = HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] ? $1_1 : HEAP32[$0_1 + 104 >> 2] + Math_imul($3, 20) | 0; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = 1; HEAP8[$1_1 | 0] = 75; } } function $1058($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $3 = HEAP32[$1_1 + 32 >> 2]; $4_1 = HEAP32[$0_1 + 8 >> 2]; while (1) { if (!(HEAP32[$0_1 + 40 >> 2] | HEAP32[$1_1 + 36 >> 2] <= ($8_1 | 0))) { $10_1 = HEAP32[HEAP32[$3 >> 2] + 20 >> 2]; if (HEAP32[$3 + 16 >> 2] >= 0) { $7_1 = HEAP32[$10_1 >> 2]; $9_1 = $1060($0_1, $7_1); if (HEAPU8[$3 + 20 | 0]) { $5_1 = HEAP32[HEAP32[HEAP32[HEAP32[$3 >> 2] + 12 >> 2] + 20 >> 2] >> 2] + !HEAPU8[$3 + 21 | 0] | 0 } else { $5_1 = 0 } $11_1 = $858($4_1, 36, HEAP32[$3 + 16 >> 2]); $6_1 = $7_1 - 1 | 0; $2_1 = $6_1; while (1) { if (!(($2_1 | 0) < 0)) { $835($4_1, 94, HEAP32[$3 + 16 >> 2], $2_1 + $5_1 | 0, $2_1 + $9_1 | 0); $2_1 = $2_1 - 1 | 0; continue; } break; }; if (HEAPU8[$3 + 22 | 0]) { $12_1 = $5_1 + $7_1 | 0; $2_1 = $893($0_1); $5_1 = 0; $5_1 = $12_1 + (HEAPU8[$3 + 20 | 0] ? $5_1 : !HEAPU8[$3 + 21 | 0]) | 0; while (1) { if (!(($6_1 | 0) < 0)) { $835($4_1, 94, HEAP32[$3 + 16 >> 2], $5_1 + $6_1 | 0, $2_1); $326($4_1, 182, $2_1, $6_1 + $9_1 | 0); $6_1 = $6_1 - 1 | 0; continue; } break; }; $894($0_1, $2_1); } $835($4_1, 162, 0, $9_1, HEAP32[$1_1 + 24 >> 2] + (HEAP32[$1_1 + 12 >> 2] + $8_1 | 0) | 0); $1043($4_1, HEAP32[$3 + 4 >> 2], -7); $2_1 = HEAP32[$4_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$4_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = $7_1 } $326($4_1, 39, HEAP32[$3 + 16 >> 2], $11_1 + 1 | 0); $5_1 = HEAP32[$4_1 + 108 >> 2]; $2_1 = 82740; HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? $2_1 : HEAP32[$4_1 + 104 >> 2] + Math_imul($11_1, 20) | 0) + 8 >> 2] = $5_1; $1061($0_1, $9_1, $7_1); } $5_1 = HEAP32[$1_1 + 24 >> 2] + (HEAP32[$1_1 + 12 >> 2] + $8_1 | 0) | 0; if ($10_1) { $2_1 = HEAP32[$10_1 >> 2] } else { $2_1 = 0 } $326($4_1, 165, $5_1, $2_1); $1043($4_1, HEAP32[$3 + 4 >> 2], -7); $3 = $3 + 24 | 0; $8_1 = $8_1 + 1 | 0; continue; } break; }; } function $1059($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$7_1 + 12 >> 2] = 0; if (!(!$1_1 | !$5_1)) { $4_1 = HEAPU8[$1_1 | 0]; $6_1 = ($4_1 + 1 ^ 1) - 1 | 0; block11 : { block3 : { block5 : { block4 : { block6 : { block7 : { block2 : { block10 : { block9 : { block1 : { switch ($4_1 - 43 | 0) { default: if (($4_1 | 0) == 19) { break block9 } if (($4_1 | 0) != 175) { break block3 } $4_1 = 0; $6_1 = HEAPU8[$1_1 + 2 | 0] == 46; $3 = $6_1 ? 0 : 16; $5_1 = HEAP32[$1_1 + 12 >> 2]; if (($1179(HEAP32[$1_1 + 16 >> 2]) | 0) == ($6_1 | 0)) { break block10 } $1059($0_1, $5_1, $2_1, $3); break block11; case 0: case 1: break block1; case 2: case 3: break block2; case 4: case 5: break block3; case 6: break block4; case 7: break block5; case 8: case 9: break block6; case 10: case 11: case 12: case 13: case 14: case 15: break block7; }; } $6_1 = $1197($1_1); if (($1_1 | 0) != ($6_1 | 0)) { $1059($0_1, $6_1, $2_1, $3); $4_1 = 0; break block11; } if (($4_1 | 0) == 44) { $1059($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3); $1059($0_1, HEAP32[$1_1 + 16 >> 2], $2_1, $3); $4_1 = 0; break block11; } $4_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $4_1; $1148($0_1, HEAP32[$1_1 + 12 >> 2], $4_1, $3 ^ 16); $1059($0_1, HEAP32[$1_1 + 16 >> 2], $2_1, $3); $1013($5_1, $4_1); $4_1 = 0; break block11; } $1148($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3); $4_1 = 0; break block11; } $1148($0_1, $5_1, $2_1, $3); break block11; } $6_1 = ($4_1 | 0) == 45 ? 53 : 54; $3 = 128; } $4_1 = HEAP32[$1_1 + 12 >> 2]; if ($1182($4_1)) { break block3 } $4_1 = $1167($0_1, $4_1, $7_1 + 12 | 0); $5_1 = $1167($0_1, HEAP32[$1_1 + 16 >> 2], $7_1 + 8 | 0); $1185($0_1, HEAP32[$1_1 + 12 >> 2], HEAP32[$1_1 + 16 >> 2], $6_1, $4_1, $5_1, $2_1, $3, HEAP32[$1_1 + 4 >> 2] >>> 10 & 1); $4_1 = HEAP32[$7_1 + 8 >> 2]; break block11; } $1_1 = $1167($0_1, HEAP32[$1_1 + 12 >> 2], $7_1 + 12 | 0); $1146($5_1, $1_1); $326($5_1, $6_1, $1_1, $2_1); $4_1 = 0; break block11; } $1170($0_1, $1_1, $2_1, 74, $3); $4_1 = 0; break block11; } if ($3) { $1171($0_1, $1_1, $2_1, $2_1); $4_1 = 0; break block11; } $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $1171($0_1, $1_1, $2_1, $3); $1013($5_1, $3); $4_1 = 0; break block11; } $6_1 = HEAP32[$1_1 + 4 >> 2]; if (($6_1 & 536870913) == 536870912) { $863($5_1, $2_1); $4_1 = 0; break block11; } $4_1 = 0; if (($6_1 & 268435457) == 268435456) { break block11 } $835($5_1, 17, $1167($0_1, $1_1, $7_1 + 12 | 0), $2_1, ($3 | 0) != 0); } $894($0_1, HEAP32[$7_1 + 12 >> 2]); $894($0_1, $4_1); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1060($0_1, $1_1) { var $2_1 = 0; if (($1_1 | 0) == 1) { return $893($0_1) } $2_1 = HEAP32[$0_1 + 32 >> 2]; if (($1_1 | 0) <= ($2_1 | 0)) { HEAP32[$0_1 + 32 >> 2] = $2_1 - $1_1; $2_1 = $0_1; $0_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$2_1 + 36 >> 2] = $0_1 + $1_1; return $0_1; } $2_1 = $0_1; $0_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$2_1 + 48 >> 2] = $0_1 + $1_1; return $0_1 + 1 | 0; } function $1061($0_1, $1_1, $2_1) { if (($2_1 | 0) == 1) { $894($0_1, $1_1); return; } if (($2_1 | 0) > HEAP32[$0_1 + 32 >> 2]) { HEAP32[$0_1 + 36 >> 2] = $1_1; HEAP32[$0_1 + 32 >> 2] = $2_1; } } function $1062($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $0_1 = 0; $3 = HEAP32[$1_1 + 40 >> 2]; block : { if (!$3) { break block } $2_1 = HEAPU8[$1_1 | 0] - 169 | 0; if (1 << $2_1 & 1027 ? $2_1 >>> 0 <= 10 : 0) { break block } $2_1 = HEAP16[$1_1 + 34 >> 1]; if (($2_1 | 0) >= HEAP32[$3 + 24 >> 2]) { break block } $0_1 = HEAP32[$3 + 20 >> 2]; HEAP8[$1_1 | 0] = 170; $0_1 = $0_1 + ($2_1 << 4) | 0; HEAP32[$1_1 + 28 >> 2] = HEAP32[$0_1 + 8 >> 2]; HEAP16[$1_1 + 32 >> 1] = HEAPU16[$0_1 + 12 >> 1]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -532993; $0_1 = 1; } return $0_1 | 0; } function $1063($0_1) { var $1_1 = 0; while (1) { block : { if (!$0_1) { break block } $1_1 = HEAP32[$0_1 + 4 >> 2]; if (!($1_1 & 532480)) { break block } if ($1_1 & 524288) { $0_1 = HEAP32[$0_1 + 20 >> 2] + 8 | 0 } else { if (HEAPU8[$0_1 | 0] != 114) { break block } $0_1 = $0_1 + 12 | 0; } $0_1 = HEAP32[$0_1 >> 2]; continue; } break; }; return $0_1; } function $1064($0_1, $1_1) { var $2_1 = 0; block : { $0_1 = $1063($0_1); if (!$0_1) { break block } $2_1 = HEAPU8[$0_1 | 0]; if (($2_1 | 0) == 176) { break block } HEAP32[$0_1 + 28 >> 2] = $1_1; HEAP8[$0_1 | 0] = 176; HEAP8[$0_1 + 2 | 0] = $2_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] & -8193; } } function $1065($0_1, $1_1, $2_1, $3) { $835(HEAP32[$0_1 + 8 >> 2], 79, $1_1, $2_1, $3); } function $1066($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = $856($0_1); $5_1 = $893($0_1); $326($3, 71, 0, $5_1); block1 : { if ($2_1 >>> 0 >= 3) { $4_1 = $893($0_1); $859($3, 118, 0, $4_1, 0, 30822, -1); $835($3, 58, $4_1, HEAP32[$3 + 108 >> 2] + 2 | 0, $1_1); $4_1 = HEAP32[$3 + 108 >> 2]; if (($4_1 | 0) <= 0) { break block1 } HEAP16[(HEAP32[$3 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 83; break block1; } $326($3, 13, $1_1, HEAP32[$3 + 108 >> 2] + 2 | 0); $4_1 = HEAP32[$3 + 108 >> 2]; } $2_1 = $2_1 << 2; $835($3, HEAP32[$2_1 + 51104 >> 2], $5_1, $4_1 + 2 | 0, $1_1); $1_1 = HEAP32[$3 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$3 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 67 } $1_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($1_1 ? $1_1 : $0_1) + 21 | 0] = 1; $326($3, 70, 1, 2); $1043($3, HEAP32[$2_1 + 51072 >> 2], -1); $894($0_1, $5_1); } function $1067($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = $856(HEAP32[$0_1 >> 2]); $0_1 = $5_1; while (1) { if ($0_1) { block3 : { if (!(HEAP32[$5_1 + 88 >> 2] | !(HEAPU8[HEAP32[$0_1 + 44 >> 2] + 5 | 0] & 16) | HEAPU8[$0_1 + 17 | 0] == 91)) { $326($2_1, 75, 0, HEAP32[$0_1 + 56 >> 2]); $858($2_1, 32, HEAP32[$0_1 + 60 >> 2]); $835($2_1, 94, HEAP32[$0_1 + 60 >> 2], 0, HEAP32[$0_1 + 56 >> 2]); $3 = HEAP32[$2_1 + 108 >> 2]; $4_1 = 82740; HEAP32[(HEAPU8[HEAP32[$2_1 >> 2] + 87 | 0] ? $4_1 : (HEAP32[$2_1 + 104 >> 2] + Math_imul($3, 20) | 0) - 40 | 0) + 8 >> 2] = $3; break block3; } if (HEAP32[$0_1 + 64 >> 2]) { break block3 } $3 = HEAP32[HEAP32[$0_1 + 72 >> 2] + 20 >> 2]; if ($3) { $3 = HEAP32[$3 >> 2] } else { $3 = 0 } $4_1 = HEAP32[$0_1 + 52 >> 2]; if ($1_1) { $326($2_1, 165, $4_1, $3); $1043($2_1, HEAP32[$0_1 + 44 >> 2], -7); $326($2_1, 80, HEAP32[$0_1 + 52 >> 2], HEAP32[$0_1 + 56 >> 2]); $326($2_1, 75, 0, HEAP32[$0_1 + 52 >> 2]); break block3; } $835($2_1, 164, $4_1, $3, HEAP32[$0_1 + 56 >> 2]); $1043($2_1, HEAP32[$0_1 + 44 >> 2], -7); } $0_1 = HEAP32[$0_1 + 36 >> 2]; continue; } break; }; } function $1068($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2]; block14 : { $5_1 = HEAP32[$0_1 + 4 >> 2]; if (HEAP32[$5_1 + 88 >> 2]) { $1_1 = HEAP32[$5_1 + 12 >> 2]; if ($1_1) { $3 = HEAP32[$1_1 >> 2] } $6_1 = HEAP32[$5_1 + 60 >> 2]; $1_1 = HEAP32[$4_1 + 60 >> 2]; $9_1 = $1_1 - 2 | 0; HEAP32[$4_1 + 60 >> 2] = $9_1; $10_1 = $893($4_1); $7_1 = $893($4_1); if ($3) { $12_1 = $1060($4_1, $3); $8_1 = $1060($4_1, $3); } $11_1 = $1_1 - 1 | 0; $326($2_1, 135, HEAP32[$5_1 + 48 >> 2], $10_1); $1370($0_1, HEAP32[$5_1 + 48 >> 2], $12_1); $1_1 = $5_1; while (1) { if ($1_1) { $326($2_1, 75, 0, HEAP32[$1_1 + 52 >> 2]); $1_1 = HEAP32[$1_1 + 36 >> 2]; continue; } break; }; $835($2_1, 23, $6_1, $9_1, HEAP32[$5_1 + 88 >> 2]); $14 = HEAP32[$2_1 + 108 >> 2]; $326($2_1, 135, $6_1, $7_1); $835($2_1, 55, HEAP32[$5_1 + 92 >> 2], $9_1, $7_1); $1_1 = HEAPU8[$5_1 + 20 | 0]; block4 : { if (($1_1 | 0) == 67) { break block4 } if (($1_1 | 0) == 86) { $835($2_1, 54, $10_1, $11_1, $7_1); break block4; } $9_1 = 0; $15_1 = HEAP32[$5_1 + 12 >> 2]; if ($15_1) { $13_1 = $1042($4_1, $15_1, 0, 0); $1_1 = HEAPU8[$5_1 + 20 | 0]; } if (($1_1 & 255) == 95) { $9_1 = $835($2_1, 54, $10_1, 0, $7_1) } block9 : { if ($13_1) { $1370($0_1, $6_1, $8_1); $835($2_1, 90, $8_1, $12_1, $3); $1043($2_1, $13_1, -8); $1_1 = HEAP32[$2_1 + 108 >> 2] + 1 | 0; $835($2_1, 14, $1_1, $11_1, $1_1); break block9; } $326($2_1, 9, 0, $11_1); } if (!$9_1) { break block4 } $13_1 = HEAP32[$2_1 + 108 >> 2]; $1_1 = 82740; HEAP32[(HEAPU8[HEAP32[$2_1 >> 2] + 87 | 0] ? $1_1 : HEAP32[$2_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $13_1; } $1371($0_1, $5_1, $6_1, 0, HEAP32[$0_1 + 20 >> 2]); $1013($2_1, $11_1); $326($2_1, 39, $6_1, $14); $1_1 = HEAP32[$2_1 + 108 >> 2]; block12 : { if (HEAPU8[HEAP32[$2_1 >> 2] + 87 | 0]) { HEAP32[20687] = $1_1; $5_1 = 82740; break block12; } $5_1 = HEAP32[$2_1 + 104 >> 2] + Math_imul($14, 20) | 0; HEAP32[$5_1 - 12 >> 2] = $1_1; $5_1 = $5_1 + 20 | 0; } HEAP32[$5_1 + 8 >> 2] = $1_1; $894($4_1, $7_1); $894($4_1, $10_1); if ($3) { $1061($4_1, $8_1, $3); $1061($4_1, $12_1, $3); } $1067($0_1, 1); break block14; } $1_1 = $5_1; while (1) { if (!$1_1) { break block14 } $8_1 = HEAP32[$1_1 + 44 >> 2]; $3 = HEAP32[$8_1 + 32 >> 2]; block21 : { block19 : { if (!(($3 | 0) != 50976 & ($3 | 0) != 50986)) { $7_1 = HEAP32[$1_1 + 60 >> 2]; $6_1 = HEAP32[$4_1 + 60 >> 2] - 1 | 0; HEAP32[$4_1 + 60 >> 2] = $6_1; $3 = $893($4_1); $326($2_1, 75, 0, HEAP32[$1_1 + 56 >> 2]); block18 : { if (HEAP32[$8_1 + 32 >> 2] == 50976) { $835($2_1, 94, HEAP32[$5_1 + 48 >> 2], HEAP32[$1_1 + 80 >> 2] + 1 | 0, $3); $1066($4_1, $3, 2); break block18; } $326($2_1, 71, 1, $3); } $835($2_1, 107, $3, HEAP32[$1_1 + 64 >> 2], $3); $835($2_1, 55, HEAP32[$1_1 + 64 >> 2] + 1 | 0, $6_1, $3); $835($2_1, 30, $7_1, 0, $3); $835($2_1, 94, $7_1, HEAP32[$1_1 + 80 >> 2], HEAP32[$1_1 + 56 >> 2]); break block19; } if (($3 | 0) != 50742 & ($3 | 0) != 50747) { break block21 } $10_1 = HEAP32[$1_1 + 60 >> 2]; $12_1 = HEAP32[HEAP32[HEAP32[$1_1 + 72 >> 2] + 20 >> 2] >> 2]; $6_1 = HEAP32[$4_1 + 60 >> 2] - 1 | 0; HEAP32[$4_1 + 60 >> 2] = $6_1; $3 = $893($4_1); $7_1 = HEAP32[$5_1 + 48 >> 2]; block23 : { if (($12_1 | 0) <= 2) { $326($2_1, 75, 0, HEAP32[$1_1 + 56 >> 2]); break block23; } $835($2_1, 94, $7_1, HEAP32[$1_1 + 80 >> 2] + 2 | 0, HEAP32[$1_1 + 56 >> 2]); } $326($2_1, 135, $7_1, $3); $11_1 = HEAP32[$8_1 + 32 >> 2]; block25 : { if (($12_1 | 0) <= 1) { $326($2_1, 86, $3, ($11_1 | 0) == 50742 ? 1 : -1); break block25; } $8_1 = $893($4_1); $835($2_1, 94, $7_1, HEAP32[$1_1 + 80 >> 2] + 1 | 0, $8_1); $835($2_1, ($11_1 | 0) == 50742 ? 107 : 108, $8_1, $3, $3); $894($4_1, $8_1); } $835($2_1, 30, $10_1, $6_1, $3); $835($2_1, 94, $10_1, HEAP32[$1_1 + 80 >> 2], HEAP32[$1_1 + 56 >> 2]); } $1013($2_1, $6_1); $894($4_1, $3); } $1_1 = HEAP32[$1_1 + 36 >> 2]; continue; }; } $326($2_1, 10, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 12 >> 2]); } function $1069($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = $856($0_1); if ($1_1) { $6_1 = HEAP32[$1_1 >> 2]; $0_1 = $1042($0_1, $1_1, 0, 0); $835($5_1, 90, $3, $2_1, $6_1); $1043($5_1, $0_1, -8); $0_1 = HEAP32[$5_1 + 108 >> 2] + 1 | 0; $835($5_1, 14, $0_1, $4_1, $0_1); $835($5_1, 80, $2_1, $3, $6_1 - 1 | 0); return; } $326($5_1, 9, 0, $4_1); } function $1070($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $4_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = HEAPU8[$5_1 + 16 | 0]; $7_1 = HEAP32[$0_1 >> 2]; $8_1 = HEAP32[$7_1 + 60 >> 2] - 1 | 0; HEAP32[$7_1 + 60 >> 2] = $8_1; block1 : { if (($1_1 | 0) == 2) { if (HEAPU8[$5_1 + 17 | 0] == 91) { break block1 } } block6 : { block2 : { if (($2_1 | 0) <= 0) { break block2 } if (($10_1 | 0) == 90) { $11_1 = HEAP32[$4_1 + 108 >> 2]; if (($1_1 | 0) == 2) { if (HEAPU8[$5_1 + 17 | 0] == 87) { $1071($0_1, 56, HEAP32[$0_1 + 40 >> 2], $2_1, HEAP32[$0_1 + 32 >> 2], $8_1); break block6; } $1071($0_1, 58, HEAP32[$0_1 + 32 >> 2], $2_1, HEAP32[$0_1 + 40 >> 2], $8_1); break block6; } $1071($0_1, 55, HEAP32[$0_1 + 48 >> 2], $2_1, HEAP32[$0_1 + 40 >> 2], $8_1); break block2; } $835($4_1, 50, $2_1, $8_1, 1); } if (HEAP32[$5_1 + 88 >> 2] | ($1_1 | 0) != 1) { break block6 } $1067($0_1, 0); } $12_1 = HEAP32[$4_1 + 108 >> 2]; if (!(!$2_1 | HEAPU8[$5_1 + 17 | 0] != HEAPU8[$5_1 + 18 | 0] | HEAPU8[$5_1 + 16 | 0] != 90)) { $6_1 = $893($7_1); $2_1 = $893($7_1); block10 : { block9 : { if (($1_1 | 0) == 2) { $326($4_1, 135, HEAP32[$0_1 + 32 >> 2], $6_1); $326($4_1, 135, HEAP32[$0_1 + 48 >> 2], $2_1); $9_1 = $2_1; break block9; } if (!HEAP32[$0_1 + 28 >> 2]) { break block10 } $326($4_1, 135, HEAP32[$0_1 + 48 >> 2], $6_1); $9_1 = HEAP32[$0_1 + 28 >> 2]; } $835($4_1, 58, $9_1, $8_1, $6_1); } $894($7_1, $6_1); $894($7_1, $2_1); } block14 : { block13 : { switch ($1_1 - 1 | 0) { case 0: $9_1 = HEAP32[$0_1 + 44 >> 2]; $2_1 = HEAP32[$0_1 + 40 >> 2]; $1068($0_1); break block14; case 1: $9_1 = HEAP32[$0_1 + 36 >> 2]; $2_1 = HEAP32[$0_1 + 32 >> 2]; $6_1 = HEAP32[$5_1 + 88 >> 2]; if ($6_1) { $326($4_1, 86, $6_1, 1); break block14; } $1371($0_1, $5_1, $2_1, 1, HEAP32[$0_1 + 20 >> 2]); break block14; default: break block13; }; } $9_1 = HEAP32[$0_1 + 52 >> 2]; $2_1 = HEAP32[$0_1 + 48 >> 2]; if (HEAP32[$5_1 + 88 >> 2]) { $326($4_1, 86, HEAP32[$5_1 + 92 >> 2], 1); break block14; } $1371($0_1, $5_1, $2_1, 0, HEAP32[$0_1 + 20 >> 2]); } block18 : { if (($1_1 | 0) != HEAP32[$0_1 + 24 >> 2]) { $1_1 = HEAP32[$4_1 + 108 >> 2]; break block18; } $858($4_1, 130, $2_1); $1_1 = HEAP32[$4_1 + 108 >> 2]; if (($1_1 | 0) <= 0) { break block18 } HEAP16[(HEAP32[$4_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 2; } block20 : { block21 : { if (!$3) { $3 = $1_1; $1_1 = ($10_1 | 0) == 77; $326($4_1, 39, $2_1, $3 + ($1_1 ? 1 : 2) | 0); if ($1_1) { break block20 } $326($4_1, 9, 0, $8_1); break block21; } $326($4_1, 39, $2_1, $1_1 + 2 | 0); $13_1 = $857($4_1, 9); if (($10_1 | 0) == 77) { break block20 } } $3 = 0; $6_1 = HEAP32[$5_1 + 12 >> 2]; $1_1 = 0; block23 : { if (!$6_1) { break block23 } $6_1 = HEAP32[$6_1 >> 2]; $1_1 = 0; if (!$6_1) { break block23 } $3 = $6_1; $1_1 = $1060($7_1, $6_1); } $1370($0_1, $2_1, $1_1); $1069($7_1, HEAP32[$5_1 + 12 >> 2], $1_1, $9_1, $12_1); $1061($7_1, $1_1, $3); } if ($11_1) { $326($4_1, 9, 0, $11_1) } $1013($4_1, $8_1); } return $13_1; } function $1071($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $7_1 = HEAP32[$0_1 >> 2]; $6_1 = $856($7_1); $12_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 12 >> 2]; $8_1 = $893($7_1); $9_1 = $893($7_1); $11_1 = HEAP32[$7_1 + 48 >> 2] + 1 | 0; HEAP32[$7_1 + 48 >> 2] = $11_1; $10_1 = HEAP32[$7_1 + 60 >> 2] - 1 | 0; HEAP32[$7_1 + 60 >> 2] = $10_1; $1370($0_1, $2_1, $8_1); $1370($0_1, $4_1, $9_1); $2_1 = HEAPU8[$12_1 + 16 | 0]; $4_1 = $2_1 & 1; $0_1 = $4_1 ? (($1_1 | 0) == 58 ? 56 : ($1_1 | 0) == 55 ? 57 : 58) : $1_1; if ($2_1 & 2) { $13_1 = $858($6_1, 52, $8_1); block3 : { block2 : { switch ($0_1 - 55 | 0) { case 3: $326($6_1, 9, 0, $5_1); break block3; case 0: $326($6_1, 52, $9_1, $5_1); break block3; case 1: break block2; default: break block3; }; } $326($6_1, 51, $9_1, $5_1); } $326($6_1, 9, 0, $10_1); $2_1 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $2_1 : HEAP32[$6_1 + 104 >> 2] + Math_imul($13_1, 20) | 0) + 8 >> 2] = HEAP32[$6_1 + 108 >> 2]; $326($6_1, 51, $9_1, ($0_1 | 0) == 55 ? $10_1 : ($0_1 | 0) == 58 ? $10_1 : $5_1); } $2_1 = $4_1 ? 108 : 107; $859($6_1, 118, 0, $11_1, 0, 30822, -1); $4_1 = $835($6_1, 58, $11_1, 0, $8_1); if (($1_1 | 0) == 58) { $835($6_1, $0_1, $9_1, $5_1, $8_1) } $835($6_1, $2_1, $3, $8_1, $8_1); $2_1 = HEAP32[$6_1 + 108 >> 2]; $1_1 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $1_1 : HEAP32[$6_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) + 8 >> 2] = $2_1; $835($6_1, $0_1, $9_1, $5_1, $8_1); $1043($6_1, $1267($7_1, HEAP32[$12_1 + 8 >> 2]), -2); $0_1 = HEAP32[$6_1 + 108 >> 2]; if (($0_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = 128 } $1013($6_1, $10_1); $894($7_1, $8_1); $894($7_1, $9_1); } function $1072($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block : { $6_1 = HEAP32[HEAP32[$1_1 + 44 >> 2] >> 2]; if (HEAP8[$6_1 + 7 | 0] & 1) { break block } $8_1 = $0_1 + 8 | 0; while (1) { $9_1 = ($2_1 | 0) > ($3 | 0) ? $2_1 : $3; $0_1 = $2_1; while (1) { if (($0_1 | 0) == ($9_1 | 0)) { break block } $4_1 = Math_imul($0_1, 48); $2_1 = $0_1 + 1 | 0; $0_1 = $2_1; $4_1 = $4_1 + $8_1 | 0; if (((HEAPU8[$4_1 + 13 | 0] | HEAPU8[$4_1 + 14 | 0] << 8) & 68) != 4) { continue } $5_1 = HEAP32[$4_1 >> 2]; if (!$5_1) { continue } $7_1 = HEAP32[HEAP32[$4_1 + 8 >> 2] + 60 >> 2]; if (($7_1 | 0) != HEAP32[HEAP32[$1_1 + 8 >> 2] + 60 >> 2]) { continue } if ($66($5_1, HEAP32[$1_1 >> 2])) { continue } $5_1 = HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2]; if (!$7_1 & HEAP32[$6_1 + 16 >> 2] != HEAP32[$5_1 + 16 >> 2]) { continue } break; }; if (HEAP8[$5_1 + 7 | 0] & 1) { continue } break; }; return $4_1; } return 0; } function $1073($0_1, $1_1) { block1 : { if (($0_1 | 0) >= ($1_1 | 0)) { if (($1_1 + 49 | 0) < ($0_1 | 0)) { break block1 } if (($0_1 | 0) > ($1_1 + 31 | 0)) { $0_1 = $0_1 + 1 | 0; break block1; } $0_1 = HEAPU8[($0_1 - $1_1 | 0) + 50944 | 0] + $0_1 | 0; break block1; } if (($1_1 | 0) > ($0_1 + 49 | 0)) { $0_1 = $1_1; break block1; } if (($1_1 | 0) > ($0_1 + 31 | 0)) { $0_1 = $1_1 + 1 | 0; break block1; } $0_1 = HEAPU8[($1_1 - $0_1 | 0) + 50944 | 0] + $1_1 | 0; } return $0_1 << 16 >> 16; } function $1074($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { block2 : { while (1) { if (!$0_1) { break block } if (HEAPU8[$0_1 + 5 | 0] & 8) { HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 8 >> 2]; break block2; } block4 : { block3 : { block5 : { $3 = HEAPU8[$0_1 | 0]; switch ($3 - 173 | 0) { case 0: break block3; case 1: break block4; default: break block5; }; } if (!$2_1 | ($3 | 0) != 157) { break block } $3 = HEAP32[$2_1 + 8 >> 2]; if (!$3 | HEAPU8[HEAP32[$2_1 >> 2] + 34 | 0] & 128) { break block } $0_1 = HEAP16[$0_1 + 32 >> 1]; HEAP32[$3 + 228 >> 2] = HEAP32[$3 + 228 >> 2] | (($0_1 | 0) > 31 ? -2147483648 : 1 << $0_1 - 1); $2_1 = $1200(HEAP32[$2_1 + 244 >> 2], $0_1); if (!$2_1) { break block } $0_1 = HEAPU16[$2_1 + 16 >> 1]; block6 : { if (!((($0_1 & 63) >>> 0 < 32 ? 1 << $0_1 : 0) & 1347440720)) { break block6 } $0_1 = $50($2_1); $3 = i64toi32_i32$HIGH_BITS; if (!$3 & $0_1 >>> 0 > 2147483647 | $3) { break block6 } HEAP32[$1_1 >> 2] = $0_1; $5_1 = 1; } $200($2_1); break block; } $0_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = 0; continue; } break; }; HEAP32[$4_1 + 12 >> 2] = 0; if (!$1074(HEAP32[$0_1 + 12 >> 2], $4_1 + 12 | 0, 0)) { break block } HEAP32[$1_1 >> 2] = 0 - HEAP32[$4_1 + 12 >> 2]; } $5_1 = 1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1075($0_1) { var $1_1 = 0; while (1) { $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 56 >> 2]; if ($0_1) { continue } break; }; return $1_1; } function $1076($0_1) { var $1_1 = 0; $1_1 = 20093; $0_1 = $0_1 + 120 & 255; if ($0_1 >>> 0 <= 2) { $1_1 = HEAP32[($0_1 << 2) + 57880 >> 2] } return $1_1; } function $1077($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = $0_1; $1_1 = HEAP32[$0_1 + 236 >> 2]; if ($1_1) { $3 = 82740; $0_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $0_1 = $3 } else { $0_1 = HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0 } $0_1 = HEAP32[$0_1 + 8 >> 2]; } else { $0_1 = 0 } HEAP32[$2_1 + 236 >> 2] = $0_1; } function $1078($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = $1_1 + $2_1 | 0; $4_1 = Math_imul($3, 5); $2_1 = $325($0_1, $4_1 + 20 | 0, 0); block1 : { if ($2_1) { HEAP16[$2_1 + 8 >> 1] = $3; HEAP16[$2_1 + 6 >> 1] = $1_1; HEAP32[$2_1 + 16 >> 2] = ($2_1 + ($3 << 2) | 0) + 20; $1_1 = HEAPU8[$0_1 + 84 | 0]; HEAP32[$2_1 + 12 >> 2] = $0_1; HEAP8[$2_1 + 4 | 0] = $1_1; HEAP32[$2_1 >> 2] = 1; $0_1 = $4_1 - 4 | 0; if (!$0_1) { break block1 } wasm2js_memory_fill($2_1 + 24 | 0, 0, $0_1); return $2_1; } $106($0_1); } return $2_1; } function $1079($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$1_1 + 52 >> 2]; block1 : { if ($3) { $3 = $1079($0_1, $3, $2_1); if ($3) { break block1 } } $3 = 0; $1_1 = HEAP32[$1_1 + 28 >> 2]; if (HEAP32[$1_1 >> 2] <= ($2_1 | 0)) { break block1 } $3 = $851($0_1, HEAP32[($1_1 + ($2_1 << 4) | 0) + 8 >> 2]); } return $3; } function $1080($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (!$2_1) { break block } $5_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$5_1 + 87 | 0] | HEAPU8[$0_1 + 224 | 0] > 1) { break block } $6_1 = HEAP32[$2_1 >> 2]; if (($6_1 | 0) > HEAP32[$5_1 + 128 >> 2]) { HEAP32[$4_1 >> 2] = $3; $257($0_1, 13365, $4_1); $8_1 = 1; break block; } $5_1 = $2_1 + 8 | 0; $9_1 = HEAP32[$1_1 + 28 >> 2]; $1_1 = 0; while (1) { if (($1_1 | 0) >= ($6_1 | 0)) { break block } $7_1 = HEAPU16[$5_1 + 12 >> 1]; if ($7_1) { $6_1 = HEAP32[$9_1 >> 2]; if (($7_1 | 0) > ($6_1 | 0)) { $8_1 = 1; $1242($0_1, $3, $1_1 + 1 | 0, $6_1, 0); break block; } $1237($0_1, $9_1, $7_1 - 1 | 0, HEAP32[$5_1 >> 2], 0); $6_1 = HEAP32[$2_1 >> 2]; } $5_1 = $5_1 + 16 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $1081($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $8_1 = HEAP32[$0_1 + 8 >> 2]; $12_1 = HEAP32[$8_1 + 108 >> 2]; $9_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $9_1; if ($5_1) { $11_1 = $5_1 + 1 | 0; $13_1 = $858($8_1, 17, $5_1); $10_1 = HEAP32[$2_1 + 16 >> 2]; $14 = HEAP32[$2_1 + 12 >> 2]; if ($6_1) { HEAP32[$6_1 >> 2] = HEAP32[$6_1 >> 2] + 1 } $6_1 = $859($8_1, 90, $14, $11_1, $10_1, $6_1, -8) + 2 | 0; $835($8_1, 14, $6_1, $9_1, $6_1); $10_1 = HEAP32[$8_1 + 108 >> 2]; $6_1 = 82740; HEAP32[(HEAPU8[HEAP32[$8_1 >> 2] + 87 | 0] ? $6_1 : HEAP32[$8_1 + 104 >> 2] + Math_imul($13_1, 20) | 0) + 8 >> 2] = $10_1; $835($8_1, 80, HEAP32[$2_1 + 12 >> 2], $11_1, HEAP32[$2_1 + 16 >> 2] - 1 | 0); $326($8_1, 71, 1, $5_1); } $5_1 = 0; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $1036($8_1, HEAP32[$1_1 + 12 >> 2], $9_1); block10 : { block8 : { switch (HEAPU8[$3 | 0] - 10 | 0) { case 2: $5_1 = $893($0_1); $6_1 = $893($0_1); $835($8_1, 97, HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 16 >> 2], $5_1); $326($8_1, 127, HEAP32[$3 + 4 >> 2], $6_1); $835($8_1, 128, HEAP32[$3 + 4 >> 2], $5_1, $6_1); $2_1 = HEAP32[$8_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 8 } $894($0_1, $6_1); $894($0_1, $5_1); break block10; case 1: $5_1 = $893($0_1); $6_1 = HEAP32[$2_1 + 16 >> 2]; $859($8_1, 97, HEAP32[$2_1 + 12 >> 2], $6_1, $5_1, HEAP32[$3 + 20 >> 2], $6_1); $312($8_1, 138, HEAP32[$3 + 4 >> 2], $5_1, HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 16 >> 2]); $3 = HEAP32[$3 + 8 >> 2]; if (($3 | 0) > 0) { $312($8_1, 183, $3, 0, HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 16 >> 2]); $1032($0_1, 0, 19623, 0); } $894($0_1, $5_1); break block10; case 0: $1065($0_1, HEAP32[$2_1 + 12 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$2_1 + 16 >> 2]); break block10; case 3: $5_1 = HEAP32[$2_1 + 16 >> 2]; $6_1 = HEAP32[$3 + 12 >> 2]; if (!$6_1) { $6_1 = $1060($0_1, $5_1); HEAP32[$3 + 12 >> 2] = $6_1; $5_1 = HEAP32[$2_1 + 16 >> 2]; HEAP32[$3 + 16 >> 2] = $5_1; } $1065($0_1, HEAP32[$2_1 + 12 >> 2], $6_1, $5_1); $858($8_1, 12, HEAP32[$3 + 4 >> 2]); break block10; default: break block8; }; } $326($8_1, 84, HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 16 >> 2]); } $0_1 = HEAP32[$1_1 + 8 >> 2]; if ($0_1) { $326($8_1, 61, $0_1, $7_1) } $1013($8_1, $9_1); $858($8_1, 67, $4_1); $5_1 = $12_1; } return $5_1; } function $1083($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $6_1 = $1_1 + 4 | 0; $5_1 = $2_1 + 8 | 0; while (1) { if (!(HEAP32[$2_1 >> 2] <= ($7_1 | 0))) { block1 : { if (($3 | 0) == ($7_1 | 0)) { break block1 } $9_1 = HEAP32[$5_1 + 16 >> 2]; $4_1 = HEAPU8[$5_1 + 13 | 0] | HEAPU8[$5_1 + 14 | 0] << 8; block3 : { if ($4_1 & 128) { $8_1 = HEAP32[($9_1 << 2) + $6_1 >> 2]; if ($8_1) { break block3 } } $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $4_1 + 1; HEAP32[($9_1 << 2) + $6_1 >> 2] = $4_1; $8_1 = HEAP32[(HEAP32[$5_1 + 16 >> 2] << 2) + $6_1 >> 2]; $4_1 = HEAPU8[$5_1 + 13 | 0] | HEAPU8[$5_1 + 14 | 0] << 8; } HEAP32[$5_1 + 16 >> 2] = $8_1; if (!($4_1 & 4)) { break block1 } $4_1 = HEAP32[$5_1 + 44 >> 2]; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if (!$4_1) { break block1 } $1083($0_1, $1_1, HEAP32[$4_1 + 32 >> 2], -1); $4_1 = $4_1 + 52 | 0; continue; }; } $5_1 = $5_1 + 48 | 0; $7_1 = $7_1 + 1 | 0; continue; } break; }; } function $1084($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAPU8[$1_1 | 0]; if (!(($2_1 | 0) != 179 & ($2_1 | 0) != 168)) { $1314($0_1, $1_1 + 28 | 0) } if (HEAP8[$1_1 + 4 | 0] & 1) { $1314($0_1, $1_1 + 36 | 0) } return 0; } function $1085($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $6($0_1, $1_1); } function $1086($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block4 : { $4_1 = HEAP32[$1_1 >> 2]; $6_1 = $4_1 + $2_1 | 0; if ($6_1 >>> 0 > HEAPU32[$1_1 + 4 >> 2]) { block3 : { block2 : { if (($6_1 | 0) >= 200) { HEAP32[$5_1 >> 2] = 200; $257($0_1, 17533, $5_1); break block2; } $6_1 = HEAP32[$0_1 >> 2]; $0_1 = $4_1 >> 31 << 1 | $4_1 >>> 31; $4_1 = $2_1 + ($4_1 << 1) | 0; $0_1 = ($2_1 >> 31) + $0_1 | 0; $7_1 = $1_1; $0_1 = $2_1 >>> 0 > $4_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; $1_1 = $4_1 >>> 0 < 200 & ($0_1 | 0) <= 0 | ($0_1 | 0) < 0; $4_1 = $1_1 ? $4_1 : 200; $1_1 = $55($6_1, $7_1, __wasm_i64_mul($4_1, $1_1 ? $0_1 : 0, 48, 0) | 8, i64toi32_i32$HIGH_BITS); if ($1_1) { break block3 } } $1_1 = 0; break block4; } HEAP32[$1_1 + 4 >> 2] = $4_1; $4_1 = HEAP32[$1_1 >> 2]; } $0_1 = $1_1 + 8 | 0; while (1) { if (!(($3 | 0) >= ($4_1 | 0))) { $4_1 = $4_1 - 1 | 0; wasm2js_memory_copy($0_1 + Math_imul($4_1 + $2_1 | 0, 48) | 0, $0_1 + Math_imul($4_1, 48) | 0, 48); continue; } break; }; HEAP32[$1_1 >> 2] = HEAP32[$1_1 >> 2] + $2_1; $4_1 = Math_imul($2_1, 48); if ($4_1) { wasm2js_memory_fill($0_1 + Math_imul($3, 48) | 0, 0, $4_1) } $0_1 = $2_1 + $3 | 0; $0_1 = ($0_1 | 0) < ($3 | 0) ? $3 : $0_1; $2_1 = $1_1 + 24 | 0; while (1) { if (($0_1 | 0) == ($3 | 0)) { break block4 } HEAP32[$2_1 + Math_imul($3, 48) >> 2] = -1; $3 = $3 + 1 | 0; continue; }; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1087($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; while (1) { if ($0_1) { HEAP32[$0_1 + 36 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | $2_1; block1 : { if (HEAPU8[$0_1 | 0] != 172) { break block1 } $3 = 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; if (!$4_1) { break block1 } while (1) { if (HEAP32[$4_1 >> 2] <= ($3 | 0)) { break block1 } $1087(HEAP32[(($3 << 4) + $4_1 | 0) + 8 >> 2], $1_1, $2_1); $3 = $3 + 1 | 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; continue; }; } $1087(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1); $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; } function $1088($0_1) { var $1_1 = 0; while (1) { $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 52 >> 2]; if ($0_1) { continue } break; }; return HEAP32[$1_1 + 28 >> 2]; } function $1089($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (!$1_1) { break block } while (1) { $1313($0_1, HEAP32[$1_1 + 28 >> 2]); $1313($0_1, HEAP32[$1_1 + 40 >> 2]); $1313($0_1, HEAP32[$1_1 + 48 >> 2]); HEAP32[$1_1 + 44 >> 2] = $1265($0_1, HEAP32[$1_1 + 44 >> 2]); HEAP32[$1_1 + 36 >> 2] = $1265($0_1, HEAP32[$1_1 + 36 >> 2]); $4_1 = HEAP32[$1_1 + 32 >> 2]; $3 = $4_1 + 8 | 0; $4_1 = HEAP32[$4_1 >> 2]; while (1) { if (($4_1 | 0) > 0) { $5_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; if ($5_1 & 4) { $1089($0_1, HEAP32[HEAP32[$3 + 44 >> 2] >> 2], 1); $5_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8; } if ($5_1 & 8) { $1313($0_1, HEAP32[$3 + 32 >> 2]) } $3 = $3 + 48 | 0; $4_1 = $4_1 - 1 | 0; continue; } break; }; if (!$2_1) { break block } $1_1 = HEAP32[$1_1 + 52 >> 2]; if ($1_1) { continue } break; }; } } function $1090($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; block : { if (HEAPU8[$1_1 | 0] != 168) { break block } $0_1 = HEAP32[$0_1 + 24 >> 2]; if (HEAP32[$0_1 + 16 >> 2] != HEAP32[$1_1 + 28 >> 2] | HEAP16[$1_1 + 32 >> 1] < 0) { break block } $2_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$0_1 + 24 >> 2] = $1238($1_1) | $2_1; HEAP32[$0_1 + 28 >> 2] = i64toi32_i32$HIGH_BITS | $3; } return 0; } function $1092($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; block3 : { block2 : { block1 : { if (!HEAP32[$1_1 + 56 >> 2]) { $7_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + 28 >> 2]; if (!$7_1 | !HEAP32[$7_1 + 48 >> 2]) { break block1 } } if (!HEAPU8[$0_1 + 165 | 0]) { break block2 } } $0_1 = 0; if (!$4_1) { break block3 } HEAP32[$4_1 >> 2] = 0; return 0; } $7_1 = $0_1; $9_1 = $1_1; $8_1 = global$0 - 16 | 0; $0_1 = $8_1; if (global$4 >>> 0 < $0_1 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; block7 : { block : { $1_1 = $1014($7_1, $9_1); if (!$1_1) { break block } block10 : { if (HEAPU8[HEAP32[$7_1 >> 2] + 34 | 0] & 4) { break block10 } $5_1 = HEAP32[$9_1 + 56 >> 2]; if (!$5_1) { break block10 } if (($1_1 | 0) == ($5_1 | 0)) { break block } $0_1 = $1_1; while (1) { block21 : { $6_1 = $0_1; $0_1 = HEAP32[$0_1 + 32 >> 2]; if (!$0_1) { break block21 } if (($0_1 | 0) != ($5_1 | 0)) { continue } } break; }; HEAP32[$6_1 + 32 >> 2] = 0; } $11_1 = ($2_1 | 0) == 129 ? 20408 : 20415; $6_1 = 0; $12_1 = ($2_1 | 0) == 128; $13_1 = ($2_1 | 0) != 130; $0_1 = $1_1; while (1) { block4 : { block32 : { $5_1 = HEAPU8[$0_1 + 8 | 0]; if (($5_1 | 0) != ($2_1 | 0)) { break block32 } if (!$1380(HEAP32[$0_1 + 16 >> 2], $3)) { break block32 } $6_1 = HEAPU8[$0_1 + 9 | 0] | $6_1; break block4; } if (($5_1 | 0) == 151) { HEAP8[$0_1 + 8 | 0] = $2_1; $10_1 = HEAPU8[$9_1 + 43 | 0] != 1; $5_1 = $10_1 ? 2 : 1; if (!($12_1 | $10_1)) { HEAP32[$8_1 >> 2] = $11_1; $257($7_1, 5641, $8_1); $5_1 = 1; } HEAP8[$0_1 + 9 | 0] = $5_1; $6_1 = $6_1 | $5_1; break block4; } if ($13_1 | !HEAPU8[$0_1 + 10 | 0] | (HEAP32[$7_1 + 132 >> 2] | ($5_1 | 0) != 128)) { break block4 } $6_1 = HEAPU8[$0_1 + 9 | 0] | $6_1; } $0_1 = HEAP32[$0_1 + 32 >> 2]; if ($0_1) { continue } break; }; break block7; } $1_1 = 0; } if ($4_1) { HEAP32[$4_1 >> 2] = $6_1 } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $0_1 = $6_1 ? $1_1 : 0; } return $0_1; } function $1093($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; block7 : { if (!(HEAPU8[$1_1 + 43 | 0] | !(HEAPU8[HEAP32[$0_1 >> 2] + 33 | 0] & 64))) { block5 : { block2 : { if (!$2_1) { if (!$1011($1_1)) { break block2 } return 1; } $4_1 = $1_1 + 48 | 0; $5_1 = 1; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { if ($1377($1_1, $4_1, $2_1, $3)) { $6_1 = 1; $5_1 = $66(HEAP32[$1_1 >> 2], HEAP32[$4_1 + 8 >> 2]) ? $5_1 : 2; } $4_1 = $4_1 + 4 | 0; continue; } break; }; $4_1 = $1011($1_1); while (1) { if (!$4_1) { break block5 } block6 : { if (!$1378($1_1, $4_1, $2_1, $3)) { break block6 } $6_1 = 1; if (!HEAPU8[$4_1 + 26 | 0] | HEAPU8[HEAP32[$0_1 >> 2] + 36 | 0] & 8) { break block6 } return 2; } $4_1 = HEAP32[$4_1 + 12 >> 2]; continue; }; } $6_1 = HEAP32[$1_1 + 48 >> 2] != 0; $5_1 = 1; } if ($6_1) { break block7 } } $5_1 = 0; } return $5_1; } function $1094($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block2 : { block5 : { block1 : { $4_1 = HEAPU8[$1_1 + 43 | 0]; block3 : { if (($4_1 | 0) == 1) { $4_1 = HEAP32[$0_1 >> 2]; if (!HEAP32[HEAP32[HEAP32[$684($4_1, $1_1) + 4 >> 2] >> 2] + 52 >> 2]) { break block1 } if (!HEAP32[$0_1 + 132 >> 2] | HEAPU8[HEAP32[$1_1 + 52 >> 2] + 18 | 0] <= (HEAP32[$4_1 + 32 >> 2] >>> 7 & 1) >>> 0) { break block2 } HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, 29764, $3 + 16 | 0); $4_1 = HEAPU8[$1_1 + 43 | 0]; break block3; } $6_1 = HEAP32[$1_1 + 28 >> 2]; if (!($6_1 & 4097)) { break block3 } $5_1 = HEAP32[$0_1 >> 2]; if ($6_1 & 1) { if ((HEAP32[$5_1 + 32 >> 2] & 268435457) == 1) { break block3 } if (!HEAPU8[$0_1 + 18 | 0]) { break block1 } break block3; } if ($916($5_1)) { break block1 } } $5_1 = 0; if (($4_1 & 255) != 2) { break block2 } $4_1 = 1772; if (!$2_1) { break block5 } if (HEAP32[$2_1 + 32 >> 2] | !HEAPU8[$2_1 + 10 | 0]) { break block2 } break block5; } $4_1 = 16394; } HEAP32[$3 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, $4_1, $3); $5_1 = 1; } $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1095($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 >> 2]; $6_1 = $309($5_1, HEAP32[$1_1 + 60 >> 2]); $7_1 = $906($5_1, $2_1, 0); $2_1 = $932($0_1, 0, 0, 0); if ($2_1) { HEAP32[$2_1 + 8 >> 2] = $116($5_1, HEAP32[$1_1 >> 2]); HEAP32[$2_1 + 52 >> 2] = $116($5_1, HEAP32[HEAP32[$5_1 + 16 >> 2] + ($6_1 << 4) >> 2]); } $1_1 = $939($0_1, 0, $2_1, $7_1, 0, 0, 0, 131072, 0); $2_1 = $4_1 + 20 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 8 >> 2] = $3; HEAP8[$4_1 + 4 | 0] = 12; $974($0_1, $1_1, $4_1 + 4 | 0); $789($5_1, $1_1); $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1096($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!$1_1) { break block1 } $5_1 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$0_1 + 24 >> 2] = $5_1 & -134254609; $3 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 28 >> 2] = $0_1; HEAP32[$2_1 + 8 >> 2] = 75; HEAP32[$2_1 + 4 >> 2] = $3; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = $5_1 & 524288 ? 0 : 76; $4_1 = HEAP32[$3 + 232 >> 2] + HEAP32[$1_1 + 24 >> 2] | 0; HEAP32[$3 + 232 >> 2] = $4_1; $6_1 = 1; if ($1003($3, $4_1)) { break block1 } $1187($2_1 + 4 | 0, $1_1); $3 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$3 + 232 >> 2] = HEAP32[$3 + 232 >> 2] - HEAP32[$1_1 + 24 >> 2]; $4_1 = $1_1; $7_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$4_1 + 4 >> 2] = $7_1 | $1_1 & 32784; HEAP32[$0_1 + 24 >> 2] = $1_1 | $5_1 & 134254608; if (HEAP32[$0_1 + 20 >> 2] > 0) { break block1 } $6_1 = HEAP32[$3 + 40 >> 2] > 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1097($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 8 >> 2]; $0_1 = $1053($0_1, $1_1); if ($0_1) { $1043($2_1, $0_1, -8) } } function $1098($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$1_1 + 16 >> 2]; if (!$2_1) { $4_1 = HEAP32[$1_1 + 12 >> 2]; $2_1 = HEAPU16[$1_1 + 52 >> 1] + 1 | 0; $2_1 = $30($2_1, !$2_1); HEAP32[$1_1 + 16 >> 2] = $2_1; __inlined_func$1364$120 : { if ($2_1) { $0_1 = 0; while (1) { if ($0_1 >>> 0 < HEAPU16[$1_1 + 52 >> 1]) { $2_1 = HEAP16[HEAP32[$1_1 + 4 >> 2] + ($0_1 << 1) >> 1]; block3 : { if (($2_1 | 0) >= 0) { $3 = HEAPU8[(HEAP32[$4_1 + 4 >> 2] + Math_imul($2_1, 12) | 0) + 5 | 0]; break block3; } $3 = 68; if (($2_1 | 0) == -1) { break block3 } $3 = $971(HEAP32[(HEAP32[$1_1 + 40 >> 2] + ($0_1 << 4) | 0) + 8 >> 2]); } $2_1 = $3; $2_1 = $2_1 << 24 >> 24; $2_1 = ($2_1 | 0) <= 65 ? 65 : $2_1; HEAP8[HEAP32[$1_1 + 16 >> 2] + $0_1 | 0] = ($2_1 | 0) >= 67 ? 67 : $2_1; $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP8[HEAP32[$1_1 + 16 >> 2] + $0_1 | 0] = 0; $2_1 = HEAP32[$1_1 + 16 >> 2]; break __inlined_func$1364$120; } $106($0_1); $2_1 = 0; } } return $2_1; } function $1099($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; if (HEAPU8[$1_1 + 43 | 0] == 1) { HEAP32[$7_1 >> 2] = -999; HEAP32[$6_1 >> 2] = -999; return 0; } $9_1 = HEAP32[$0_1 >> 2]; $10_1 = $309($9_1, HEAP32[$1_1 + 60 >> 2]); $11_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = ($4_1 | 0) < 0 ? HEAP32[$0_1 + 44 >> 2] : $4_1; HEAP32[$6_1 >> 2] = $4_1; $8_1 = $4_1 + 1 | 0; block4 : { if (!(!(!$5_1 | HEAPU8[$5_1 | 0]) | HEAPU8[$1_1 + 28 | 0] & 128)) { $860($0_1, $4_1, $10_1, $1_1, $2_1); break block4; } if (HEAPU8[$9_1 + 95 | 0]) { break block4 } $988($0_1, $10_1, HEAP32[$1_1 + 20 >> 2], ($2_1 | 0) == 113, HEAP32[$1_1 >> 2]); } HEAP32[$7_1 >> 2] = $8_1; $9_1 = $5_1 + 1 | 0; $4_1 = $1_1 + 8 | 0; $7_1 = 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { if (!(!(HEAPU8[$1_1 + 28 | 0] & 128) | ((HEAPU8[$4_1 + 55 | 0] | HEAPU8[$4_1 + 56 | 0] << 8) & 3) != 2)) { HEAP32[$6_1 >> 2] = $8_1; $3 = 0; } block8 : { if (!(!$5_1 | HEAPU8[$7_1 + $9_1 | 0])) { break block8 } $835($11_1, $2_1, $8_1, HEAP32[$4_1 + 44 >> 2], $10_1); $1097($0_1, $4_1); $12_1 = HEAP32[$11_1 + 108 >> 2]; if (($12_1 | 0) <= 0) { break block8 } HEAP16[(HEAP32[$11_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) - 18 >> 1] = $3 & 255; } $8_1 = $8_1 + 1 | 0; $7_1 = $7_1 + 1 | 0; $4_1 = $4_1 + 20 | 0; continue; } break; }; if (($8_1 | 0) > HEAP32[$0_1 + 44 >> 2]) { HEAP32[$0_1 + 44 >> 2] = $8_1 } return $7_1; } function $1100($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 108 >> 2]; if (($1_1 | 0) == ($2_1 - 1 | 0)) { HEAP32[$0_1 + 108 >> 2] = $1_1; return; } HEAP32[(HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = $2_1; } function $1101($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = HEAP32[$0_1 + 132 >> 2]; $0_1 = $3 ? $3 : $0_1; $3 = HEAP32[$0_1 + 228 >> 2]; $4_1 = ($3 | 0) > 0 ? $3 : 0; block1 : { while (1) { if (($2_1 | 0) != ($4_1 | 0)) { $5_1 = $2_1 << 2; $2_1 = $2_1 + 1 | 0; if (HEAP32[$5_1 + HEAP32[$0_1 + 276 >> 2] >> 2] != ($1_1 | 0)) { continue } break block1; } break; }; $2_1 = ($3 << 2) + 4 | 0; $2_1 = $33(HEAP32[$0_1 + 276 >> 2], $2_1, $2_1 >> 31); if ($2_1) { HEAP32[$0_1 + 276 >> 2] = $2_1; $3 = $0_1; $0_1 = HEAP32[$0_1 + 228 >> 2]; HEAP32[$3 + 228 >> 2] = $0_1 + 1; HEAP32[$2_1 + ($0_1 << 2) >> 2] = $1_1; return; } $106(HEAP32[$0_1 >> 2]); } } function $1102($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1) { var $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $13_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $13_1; $18_1 = HEAPU8[$1_1 + 28 | 0] & 128 ? 28 : 31; $11_1 = HEAP32[$0_1 + 8 >> 2]; if (!$9_1) { $312($11_1, $18_1, $3, $13_1, $5_1, $6_1) } $12_1 = $1093($0_1, $1_1, 0, 0); if ($2_1 | $12_1) { $12_1 = 0; $15_1 = $1110($0_1, $2_1, 0, 0, 3, $1_1, $8_1); $17_1 = $1109($0_1, $1_1); $16_1 = HEAP32[$0_1 + 48 >> 2]; $14 = $16_1 + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $14 + HEAP16[$1_1 + 34 >> 1]; $326($11_1, 80, $5_1, $14); $16_1 = $16_1 + 2 | 0; $15_1 = $15_1 | $17_1; $17_1 = ($15_1 | 0) == -1; while (1) { if (!(HEAP16[$1_1 + 34 >> 1] <= ($12_1 | 0))) { if (!(!$17_1 & (!($15_1 >>> $12_1 & 1) | $12_1 >>> 0 > 31))) { $890($11_1, $1_1, $3, $12_1, $1111($1_1, $12_1 << 16 >> 16) + $16_1 | 0) } $12_1 = $12_1 + 1 | 0; continue; } break; }; $12_1 = HEAP32[$11_1 + 108 >> 2]; $1113($0_1, $2_1, 129, 0, 1, $1_1, $14, $8_1, $13_1); if (HEAP32[$11_1 + 108 >> 2] > ($12_1 | 0)) { $312($11_1, $18_1, $3, $13_1, $5_1, $6_1); $10_1 = -1; } $1115($0_1, $1_1, $14, 0, 0, 0); } block7 : { if (HEAPU8[$1_1 + 43 | 0] == 2) { break block7 } $1116($0_1, $1_1, $3, $4_1, 0, $10_1); $326($11_1, 130, $3, $7_1); block9 : { if (HEAPU8[$0_1 + 18 | 0]) { if ($66(HEAP32[$1_1 >> 2], 23814)) { break block9 } } $1043($11_1, $1_1, -5); } block10 : { if (!$9_1) { break block10 } $4_1 = HEAP32[$11_1 + 108 >> 2]; if (($4_1 | 0) <= 0) { break block10 } HEAP16[(HEAP32[$11_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 4; } if (!(($3 | 0) == ($10_1 | 0) | ($10_1 | 0) < 0)) { $858($11_1, 130, $10_1) } $3 = HEAP32[$11_1 + 108 >> 2]; if (($3 | 0) <= 0) { break block7 } HEAP16[(HEAP32[$11_1 + 104 >> 2] + Math_imul($3, 20) | 0) - 18 >> 1] = ($9_1 | 0) == 2 ? 2 : 0; } $1118($0_1, $1_1, 0, $14, 0, 0); if ($2_1) { $1113($0_1, $2_1, 129, 0, 2, $1_1, $14, $8_1, $13_1) } $1013($11_1, $13_1); } function $1103($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; if (HEAP32[$0_1 + 128 >> 2]) { $2_1 = $0_1 + 128 | 0; $7_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$0_1 + 8 >> 2]; while (1) { block : { $2_1 = HEAP32[$2_1 >> 2]; if (!$2_1) { break block } $4_1 = HEAP32[$2_1 + 12 >> 2]; $1_1 = HEAP32[$7_1 + 16 >> 2]; $3 = HEAP32[$2_1 + 8 >> 2]; $6_1 = $893($0_1); $835($5_1, 56, $4_1 + 2 | 0, HEAP32[$5_1 + 108 >> 2] + 7 | 0, $4_1); $860($0_1, 0, HEAP32[$2_1 + 8 >> 2], HEAP32[HEAP32[($1_1 + ($3 << 4) | 0) + 12 >> 2] + 72 >> 2], 113); $1_1 = $313($5_1, 5, 51232); if (!$1_1) { break block } HEAP32[$1_1 + 68 >> 2] = $6_1; HEAP32[$1_1 + 52 >> 2] = $6_1; HEAP16[$1_1 + 62 >> 1] = 8; $3 = $4_1 + 1 | 0; HEAP32[$1_1 + 72 >> 2] = $3; HEAP32[$1_1 + 44 >> 2] = $4_1 - 1; HEAP32[$1_1 + 28 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $3; $894($0_1, $6_1); continue; } break; }; } } function $1104($0_1, $1_1, $2_1) { $857($0_1, 83); $326($0_1, 84, $1_1, 1); $1134($0_1, 1); $1135($0_1, 0, 0, $2_1, 0); } function $1105($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $395(HEAP32[HEAP32[$0_1 + 16 >> 2] + 28 >> 2] + 40 | 0, $1_1 + 104 | 0, 0); $358($0_1, HEAP32[$1_1 + 4 >> 2]); $10($0_1, $1_1); } function $1106($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $3 + 16 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $3 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$3 + 24 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = 77; $920($3, $0_1); $1_1 = HEAPU16[$3 + 20 >> 1]; $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return (($2_1 ? $1_1 : $1_1 & 65533) | 0) != 0; } function $1107($0_1, $1_1) { $0_1 = $903($0_1, 76, 0, 0); if ($0_1) { HEAP16[$0_1 + 32 >> 1] = $1_1 + 1 } return $0_1; } function $1108($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $6_1 = global$0 - 32 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $7_1 = HEAP32[$4_1 + 16 >> 2]; $9_1 = HEAP32[$0_1 >> 2]; $8_1 = $909($9_1, $4_1, 0); $10_1 = $906($9_1, $5_1, 0); if ($8_1) { HEAP32[$8_1 + 24 >> 2] = -1; $4_1 = HEAP32[$8_1 + 16 >> 2]; HEAP32[$4_1 + 24 >> 2] = HEAP32[$4_1 + 24 >> 2] - 1; HEAP32[$8_1 + 16 >> 2] = 0; } block3 : { if ($2_1) { $4_1 = 0; $5_1 = 0; while (1) { if (!(HEAPU16[$2_1 + 50 >> 1] <= $5_1 >>> 0)) { $4_1 = $936($0_1, $4_1, $1107($0_1, HEAP16[HEAP32[$2_1 + 4 >> 2] + ($5_1 << 1) >> 1])); $5_1 = $5_1 + 1 | 0; continue; } break; }; $7_1 = HEAPU8[$7_1 + 43 | 0] == 1 ? 14 : 15; break block3; } $4_1 = HEAPU8[$7_1 + 43 | 0]; if (($4_1 | 0) == 2) { $4_1 = 0; $5_1 = 0; while (1) if (($5_1 | 0) >= HEAP16[$7_1 + 34 >> 1]) { $7_1 = 14; break block3; } else { $4_1 = $936($0_1, $4_1, $1107($0_1, $5_1)); $5_1 = $5_1 + 1 | 0; continue; }; } $7_1 = ($4_1 | 0) == 1 ? 14 : 15; $4_1 = $903($0_1, 76, 0, 0); $4_1 = $935(HEAP32[$0_1 >> 2], $4_1); } block6 : { if (!$3) { break block6 } $11_1 = $3 + 8 | 0; $5_1 = 0; while (1) { if (HEAP32[$3 >> 2] <= ($5_1 | 0)) { break block6 } $4_1 = $936($0_1, $4_1, $906($9_1, HEAP32[$11_1 + ($5_1 << 4) >> 2], 0)); $5_1 = $5_1 + 1 | 0; continue; }; } $3 = $939($0_1, $4_1, $8_1, $10_1, 0, 0, 0, 276955136, 0); if ($3) { HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] | 134217728 } HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = $1_1; HEAP8[$6_1 + 4 | 0] = $7_1; if ($2_1) { $1_1 = HEAPU16[$2_1 + 50 >> 1] } else { $1_1 = -1 } HEAP32[$6_1 + 12 >> 2] = $1_1; $974($0_1, $3, $6_1 + 4 | 0); $789($9_1, $3); $0_1 = $6_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1109($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (HEAPU8[$1_1 + 43 | 0] | !(HEAPU8[HEAP32[$0_1 >> 2] + 33 | 0] & 64)) { break block } $2_1 = $1_1 + 48 | 0; while (1) { $4_1 = HEAP32[$2_1 >> 2]; if ($4_1) { $2_1 = 0; $5_1 = HEAP32[$4_1 + 20 >> 2]; $5_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $7_1 = $4_1 + 36 | 0; while (1) { if (!(($2_1 | 0) == ($5_1 | 0))) { $8_1 = $3; $3 = HEAP32[$7_1 + ($2_1 << 3) >> 2]; $3 = $8_1 | (($3 | 0) > 31 ? -1 : 1 << $3); $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = $4_1 + 4 | 0; continue; } break; }; $4_1 = $1011($1_1); while (1) { if (!$4_1) { break block } HEAP32[$6_1 + 12 >> 2] = 0; $1153($0_1, $1_1, $4_1, $6_1 + 12 | 0, 0); block3 : { $5_1 = HEAP32[$6_1 + 12 >> 2]; if (!$5_1) { break block3 } $7_1 = HEAPU16[$5_1 + 50 >> 1]; $2_1 = 0; while (1) { if (($2_1 | 0) == ($7_1 | 0)) { break block3 } $8_1 = $3; $3 = HEAP16[HEAP32[$5_1 + 4 >> 2] + ($2_1 << 1) >> 1]; $3 = $8_1 | (($3 | 0) > 31 ? -1 : 1 << $3); $2_1 = $2_1 + 1 | 0; continue; }; } $4_1 = HEAP32[$4_1 + 12 >> 2]; continue; }; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1110($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0; $7_1 = -1; block : { if (HEAPU8[$5_1 + 43 | 0] == 2) { break block } $8_1 = $2_1 ? 130 : 129; $7_1 = 0; $9_1 = $3 << 2; while (1) { if (!$1_1) { break block } block2 : { block1 : { if (!(HEAPU8[$1_1 + 9 | 0] & $4_1) | HEAPU8[$1_1 + 8 | 0] != ($8_1 | 0)) { break block1 } if (!$1380(HEAP32[$1_1 + 16 >> 2], $2_1)) { break block1 } $3 = -1; if (HEAPU8[$1_1 + 10 | 0]) { break block2 } $3 = $1381($0_1, $1_1, $5_1, $6_1); if (!$3) { break block1 } $3 = HEAP32[($3 + $9_1 | 0) + 16 >> 2] | $7_1; break block2; } $3 = $7_1; } $7_1 = $3; $1_1 = HEAP32[$1_1 + 32 >> 2]; continue; }; } return $7_1; } function $1111($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!(HEAP32[$0_1 + 28 >> 2] & 32) | ($1_1 | 0) < 0) { break block } $4_1 = HEAP32[$0_1 + 4 >> 2]; while (1) { if (!(($1_1 | 0) == ($2_1 | 0))) { $3 = ((HEAPU16[(Math_imul($2_1, 12) + $4_1 | 0) + 10 >> 1] ^ -1) >>> 5 & 1) + $3 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; if (!(HEAPU8[(Math_imul($1_1, 12) + $4_1 | 0) + 10 | 0] & 32)) { $1_1 = $3; break block; } $1_1 = HEAPU16[$0_1 + 36 >> 1] + ($1_1 - $3 | 0) | 0; } return $1_1 << 16 >> 16; } function $1112($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = global$0 - 32 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $4_1; $998(HEAP32[$0_1 + 8 >> 2], $2_1, $1_1); block : { if (!(HEAPU8[$2_1 + 28 | 0] & 64)) { break block } $3 = 82740; $4_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]) { $3 = (HEAP32[$4_1 + 104 >> 2] + Math_imul(HEAP32[$4_1 + 108 >> 2], 20) | 0) - 20 | 0 } block2 : { switch (HEAPU8[$3 | 0] - 95 | 0) { case 1: $4_1 = HEAP32[$3 + 16 >> 2]; $3 = 0; while (1) { $7_1 = $4_1 + $6_1 | 0; if (!HEAPU8[$7_1 | 0]) { break block } $8_1 = HEAPU16[(HEAP32[$2_1 + 4 >> 2] + Math_imul($3, 12) | 0) + 10 >> 1]; if (!($8_1 & 32)) { if ($8_1 & 64) { HEAP8[$7_1 | 0] = 64 } $6_1 = $6_1 + 1 | 0; } $3 = $3 + 1 | 0; continue; }; case 0: break block2; default: break block; }; } HEAP32[$3 + 12 >> 2] = 1; } $3 = 0; $7_1 = HEAP16[$2_1 + 34 >> 1]; $4_1 = ($7_1 | 0) > 0 ? $7_1 : 0; while (1) { if (($3 | 0) != ($4_1 | 0)) { $8_1 = HEAP32[$2_1 + 4 >> 2] + Math_imul($3, 12) | 0; $6_1 = HEAPU16[$8_1 + 10 >> 1]; if ($6_1 & 96) { HEAP16[$8_1 + 10 >> 1] = $6_1 | 128 } $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 16 >> 2] = 0; HEAP32[$5_1 + 8 >> 2] = 78; HEAP32[$5_1 + 28 >> 2] = $2_1; HEAP32[$0_1 + 56 >> 2] = 0 - $1_1; $4_1 = 0; $3 = 0; $6_1 = 0; label2 : while (1) { $9_1 = $7_1 << 16 >> 16; while (1) { $8_1 = $3; $7_1 = $4_1; if (($6_1 | 0) < ($9_1 | 0)) { $3 = HEAP32[$2_1 + 4 >> 2] + Math_imul($6_1, 12) | 0; $4_1 = HEAPU16[$3 + 10 >> 1]; block12 : { if ($4_1 & 128) { HEAP16[$3 + 10 >> 1] = $4_1 | 256; HEAP16[$5_1 + 24 >> 1] = 0; $920($5_1 + 4 | 0, $891($2_1, $3)); HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] & 65279; if (HEAPU8[$5_1 + 24 | 0] & 128) { $4_1 = $7_1; break block12; } $1166($0_1, $2_1, $3, $1111($2_1, $6_1 << 16 >> 16) + $1_1 | 0); HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] & 65407; $4_1 = 1; } else { $4_1 = $7_1 } $3 = $8_1; } $6_1 = $6_1 + 1 | 0; $7_1 = HEAPU16[$2_1 + 34 >> 1]; continue label2; } if ($8_1) { $4_1 = 0; $3 = 0; $6_1 = 0; if ($7_1) { continue } } break; }; break; }; if ($8_1) { HEAP32[$5_1 >> 2] = HEAP32[$8_1 >> 2]; $257($0_1, 29521, $5_1); } HEAP32[$0_1 + 56 >> 2] = 0; $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1113($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0; $10_1 = global$0 - 208 | 0; if ($10_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $10_1 >>> 0) { fimport$30($10_1 | 0) } global$0 = $10_1; $20_1 = $10_1 + 192 | 0; $21_1 = ($2_1 | 0) != 130; while (1) { if ($1_1) { $12_1 = HEAPU8[$1_1 + 8 | 0]; block2 : { if (($2_1 | 0) != ($12_1 | 0)) { if ($21_1 | !HEAPU8[$1_1 + 10 | 0] | ($12_1 | 0) != 128) { break block2 } } if (HEAPU8[$1_1 + 9 | 0] != ($4_1 | 0)) { break block2 } if (!$1380(HEAP32[$1_1 + 16 >> 2], $3)) { break block2 } if (!HEAPU8[$1_1 + 10 | 0]) { $1382($0_1, $1_1, $5_1, $6_1, $7_1, $8_1); break block2; } if (HEAP32[$0_1 + 132 >> 2] | !HEAPU8[$0_1 + 163 | 0]) { break block2 } $16_1 = HEAP32[$0_1 + 148 >> 2]; if (($16_1 + 8 | 0) != ($1_1 | 0)) { break block2 } $18_1 = HEAP32[$0_1 >> 2]; $19_1 = HEAP32[$0_1 + 8 >> 2]; $9_1 = $10_1 + 100 | 0; wasm2js_memory_fill($9_1, 0, 76); $12_1 = $10_1 + 40 | 0; wasm2js_memory_fill($12_1, 0, 56); HEAP32[$10_1 + 128 >> 2] = $887($18_1, HEAP32[$16_1 + 4 >> 2], 0); HEAP32[$10_1 + 40 >> 2] = 1; HEAP32[$10_1 + 132 >> 2] = $12_1; HEAP32[$10_1 + 56 >> 2] = $5_1; $12_1 = HEAP32[$5_1 >> 2]; HEAP32[$10_1 + 64 >> 2] = -1; HEAP32[$10_1 + 48 >> 2] = $12_1; $1017($0_1, $9_1, 0); if (!HEAP32[$0_1 + 40 >> 2]) { $1019($0_1, $9_1) } $358($18_1, HEAP32[$10_1 + 128 >> 2]); $17_1 = HEAP32[$16_1 + 4 >> 2]; $22_1 = $17_1 + 8 | 0; $14 = HEAP32[$0_1 >> 2]; $15_1 = 0; $12_1 = 0; while (1) { if (!(HEAP32[$17_1 >> 2] <= ($15_1 | 0))) { $9_1 = ($15_1 << 4) + $22_1 | 0; $11_1 = HEAP32[$9_1 >> 2]; block8 : { if (!$11_1) { break block8 } block10 : { $13_1 = HEAPU8[$11_1 | 0]; if (($13_1 | 0) != 180) { if (($13_1 | 0) != 142 | HEAPU8[HEAP32[$11_1 + 16 >> 2]] != 180) { break block10 } $257($0_1, 5946, 0); } $9_1 = 0; while (1) { if (HEAP16[$5_1 + 34 >> 1] <= ($9_1 | 0)) { break block8 } $11_1 = Math_imul($9_1, 12); $13_1 = $11_1 + HEAP32[$5_1 + 4 >> 2] | 0; block11 : { if (HEAPU8[$13_1 + 10 | 0] & 2) { break block11 } $12_1 = $936($0_1, $12_1, $942($14, 60, HEAP32[$13_1 >> 2])); if (HEAPU8[$14 + 87 | 0]) { break block11 } $13_1 = (HEAP32[$12_1 >> 2] << 4) + $12_1 | 0; HEAP32[$13_1 - 4 >> 2] = $116($14, HEAP32[$11_1 + HEAP32[$5_1 + 4 >> 2] >> 2]); $11_1 = $13_1 + 1 | 0; $13_1 = (HEAPU8[$11_1 | 0] | HEAPU8[$11_1 + 1 | 0] << 8) & 65532; HEAP8[$11_1 | 0] = $13_1; HEAP8[$11_1 + 1 | 0] = $13_1 >>> 8; } $9_1 = $9_1 + 1 | 0; continue; }; } $12_1 = $936($0_1, $12_1, $906($14, $11_1, 0)); if (HEAPU8[$14 + 87 | 0]) { break block8 } $11_1 = HEAP32[$9_1 + 4 >> 2]; if (!$11_1) { break block8 } $13_1 = (HEAP32[$12_1 >> 2] << 4) + $12_1 | 0; HEAP32[$13_1 - 4 >> 2] = $116($14, $11_1); $11_1 = $13_1 + 1 | 0; $9_1 = (HEAPU8[$11_1 | 0] | HEAPU8[$11_1 + 1 | 0] << 8) & 65532 | (HEAPU8[$9_1 + 9 | 0] | HEAPU8[$9_1 + 10 | 0] << 8) & 3; HEAP8[$11_1 | 0] = $9_1; HEAP8[$11_1 + 1 | 0] = $9_1 >>> 8; } $15_1 = $15_1 + 1 | 0; continue; } break; }; block12 : { if (HEAP32[$0_1 + 40 >> 2]) { break block12 } wasm2js_memory_fill($10_1 + 4 | 0, 0, 36); if (!HEAP32[$16_1 + 96 >> 2]) { HEAP32[$16_1 + 96 >> 2] = HEAP32[$12_1 >> 2]; $9_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $9_1 + 1; HEAP32[$16_1 + 92 >> 2] = $9_1; } HEAP32[$10_1 + 28 >> 2] = 1024; HEAP32[$10_1 + 12 >> 2] = $6_1; HEAP32[$10_1 + 4 >> 2] = $0_1; $9_1 = HEAPU8[$1_1 + 8 | 0]; HEAP32[$0_1 + 136 >> 2] = $5_1; HEAP8[$0_1 + 162 | 0] = $9_1; if ($1126($10_1 + 4 | 0, $12_1) | HEAPU8[$18_1 + 87 | 0]) { break block12 } $15_1 = HEAP32[$12_1 >> 2]; $14 = HEAP32[$0_1 + 48 >> 2]; $11_1 = $10_1 + 176 | 0; $9_1 = $11_1 + 8 | 0; HEAP32[$9_1 >> 2] = 0; HEAP32[$9_1 + 4 >> 2] = 0; HEAP32[$20_1 >> 2] = 0; HEAP32[$20_1 + 4 >> 2] = 0; HEAP32[$9_1 >> 2] = 79; HEAP32[$10_1 + 176 >> 2] = 0; HEAP32[$10_1 + 180 >> 2] = 0; HEAP32[$10_1 + 200 >> 2] = $5_1; HEAP32[$10_1 + 180 >> 2] = 65; $921($11_1, $12_1); $14 = $14 + 1 | 0; if (HEAPU16[$10_1 + 196 >> 1]) { HEAP32[$10_1 + 184 >> 2] = 46; HEAP32[$10_1 + 180 >> 2] = 80; $921($11_1, $12_1); } HEAP32[$0_1 + 48 >> 2] = ($15_1 + HEAP32[$0_1 + 48 >> 2] | 0) + 2; HEAP32[$16_1 + 100 >> 2] = $14; $9_1 = 0; $15_1 = ($15_1 | 0) > 0 ? $15_1 : 0; $11_1 = $12_1 + 8 | 0; while (1) { if (($9_1 | 0) != ($15_1 | 0)) { $13_1 = HEAP32[$11_1 + ($9_1 << 4) >> 2]; $17_1 = $9_1 + $14 | 0; $1128($0_1, $13_1, $17_1); if (($971($13_1) | 0) == 69) { $858($19_1, 87, $17_1) } $9_1 = $9_1 + 1 | 0; continue; } break; }; $9_1 = $14 + $15_1 | 0; $835($19_1, 97, $14, $15_1, $9_1); $14 = $9_1 + 1 | 0; $326($19_1, 127, HEAP32[$16_1 + 92 >> 2], $14); $835($19_1, 128, HEAP32[$16_1 + 92 >> 2], $9_1, $14); } $358($18_1, $12_1); HEAP32[$0_1 + 136 >> 2] = 0; HEAP8[$0_1 + 162 | 0] = 0; } $1_1 = HEAP32[$1_1 + 32 >> 2]; continue; } break; }; $0_1 = $10_1 + 208 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1114($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1, $11_1, $12_1) { var $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0, $44_1 = 0, $45_1 = 0, $46_1 = 0, $47_1 = 0, $48_1 = 0, $49 = 0, $50_1 = 0, $51_1 = 0, $52_1 = 0, $53_1 = 0; $32_1 = global$0 - 16 | 0; $13_1 = $32_1; if (global$4 >>> 0 < $13_1 >>> 0 | global$5 >>> 0 > $13_1 >>> 0) { fimport$30($13_1 | 0) } global$0 = $13_1; $13_1 = HEAP16[$1_1 + 34 >> 1]; $14 = HEAP32[$0_1 + 8 >> 2]; $26_1 = HEAP32[$0_1 >> 2]; $15_1 = HEAP32[$1_1 + 28 >> 2]; block1 : { if (!($15_1 & 128)) { $33_1 = 1; break block1; } $24_1 = $359($1_1); $33_1 = HEAPU16[$24_1 + 50 >> 1]; } block2 : { if (!($15_1 & 2048)) { break block2 } $13_1 = $13_1 << 16 >> 16; $20_1 = ($13_1 | 0) > 0 ? $13_1 : 0; $22_1 = $5_1 + 1 | 0; $13_1 = 1; while (1) { $21_1 = $13_1 ^ -1; $13_1 = 0; while (1) { if (!(($13_1 | 0) == ($20_1 | 0))) { $15_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($13_1, 12) | 0; $17_1 = HEAPU8[$15_1 + 4 | 0] & 15; block4 : { if (!$17_1 | HEAP16[$1_1 + 32 >> 1] == ($13_1 | 0)) { break block4 } $16_1 = HEAPU16[$15_1 + 10 >> 1] & 96; $23_1 = !$16_1; if (!(($23_1 | $19_1) & 1)) { $18_1 = $18_1 + 1 | 0; break block4; } if (!($16_1 | !$11_1) & HEAP32[($13_1 << 2) + $11_1 >> 2] < 0) { break block4 } block12 : { block10 : { block11 : { block8 : { $16_1 = ($8_1 | 0) == 11 ? (($17_1 | 0) == 11 ? 2 : $17_1) : $8_1; if (($16_1 | 0) == 5) { if (!HEAPU16[$15_1 + 8 >> 1] | $19_1 & 1) { break block8 } $17_1 = $1111($1_1, $13_1 << 16 >> 16) + $22_1 | 0; $16_1 = $858($14, 52, $17_1); $1188($0_1, $891($1_1, $15_1), $17_1); $15_1 = 82740; $25 = $25 + 1 | 0; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $15_1 : HEAP32[$14 + 104 >> 2] + Math_imul($16_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2]; break block4; } if ($21_1 & $23_1) { break block4 } $28_1 = $1111($1_1, $13_1 << 16 >> 16) + $22_1 | 0; switch ($16_1 - 1 | 0) { case 0: case 2: break block10; case 1: break block11; default: break block12; }; } $28_1 = $1111($1_1, $13_1 << 16 >> 16) + $22_1 | 0; } $17_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($17_1 ? $17_1 : $0_1) + 21 | 0] = 1; $16_1 = 2; } $17_1 = HEAP32[$1_1 >> 2]; HEAP32[$32_1 + 4 >> 2] = HEAP32[$15_1 >> 2]; HEAP32[$32_1 >> 2] = $17_1; $15_1 = $310($26_1, 6429, $32_1); $835($14, 69, 1299, $16_1, $28_1); $1043($14, $15_1, -6); $15_1 = HEAP32[$14 + 108 >> 2]; if (($15_1 | 0) <= 0) { break block4 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($15_1, 20) | 0) - 18 >> 1] = 1; break block4; } $326($14, 51, $28_1, $9_1); } $13_1 = $13_1 + 1 | 0; continue; } break; }; if ((!($18_1 | $25) | $19_1) & 1) { break block2 } $19_1 = 1; $13_1 = 0; if (!(HEAPU8[$1_1 + 28 | 0] & 96) | ($25 | 0) <= 0) { continue } $1112($0_1, $22_1, $1_1); continue; }; } $22_1 = 0; $15_1 = HEAP32[$1_1 + 16 >> 2]; block13 : { if (!$15_1) { break block13 } if (HEAPU8[$26_1 + 33 | 0] & 2) { break block13 } HEAP32[$0_1 + 56 >> 2] = $5_1 ^ -1; $16_1 = ($8_1 | 0) == 11 ? 2 : $8_1; $19_1 = $15_1 + 8 | 0; $20_1 = $5_1 + 1 | 0; $13_1 = 0; while (1) { if (!(HEAP32[$15_1 >> 2] <= ($13_1 | 0))) { $21_1 = $19_1 + ($13_1 << 4) | 0; $18_1 = HEAP32[$21_1 >> 2]; block16 : { if ($11_1) { if (!$1106($18_1, $11_1, $7_1)) { break block16 } } if (!$35_1) { $998($14, $1_1, $20_1); $35_1 = 1; } $17_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $17_1; $18_1 = $906($26_1, $18_1, 0); if (!HEAPU8[$26_1 + 87 | 0]) { $1148($0_1, $18_1, $17_1, 16) } $11($26_1, $18_1); block20 : { if (($16_1 | 0) == 4) { $863($14, $9_1); $16_1 = 4; break block20; } $16_1 = ($16_1 | 0) == 5 ? 2 : $16_1; $1012($0_1, 275, $16_1, HEAP32[$21_1 + 4 >> 2], 0, 3); } $1013($14, $17_1); } $13_1 = $13_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 56 >> 2] = 0; } $18_1 = $1_1 + 8 | 0; $11_1 = HEAP32[$1_1 + 8 >> 2]; $40_1 = 1; block25 : { block22 : { if (!$12_1) { $12_1 = 0; break block22; } if (!HEAP32[$12_1 >> 2]) { $13_1 = HEAPU8[$12_1 + 20 | 0]; $8_1 = $13_1 ? 6 : 4; $12_1 = $13_1 ? $12_1 : 0; break block22; } if (!$11_1) { break block22 } while (1) { if ($11_1) { $22_1 = $22_1 + 1 | 0; $11_1 = HEAP32[$11_1 + 20 >> 2]; continue; } break; }; $17_1 = $270($26_1, Math_imul($22_1, 10), 0); if (!$17_1) { break block25 } HEAP32[$12_1 + 24 >> 2] = $17_1; $20_1 = $17_1 + ($22_1 << 3) | 0; $19_1 = 0; $11_1 = $12_1; while (1) { if (!(!$11_1 | !HEAP32[$11_1 >> 2])) { $15_1 = 0; $13_1 = $18_1; $16_1 = HEAP32[$11_1 + 28 >> 2]; block27 : { if (!$16_1) { break block27 } while (1) { $13_1 = HEAP32[$13_1 >> 2]; if (!(!$13_1 | ($13_1 | 0) == ($16_1 | 0))) { $15_1 = $15_1 + 1 | 0; $13_1 = $13_1 + 20 | 0; continue; } break; }; $16_1 = $15_1 + $20_1 | 0; if (HEAPU8[$16_1 | 0]) { break block27 } HEAP8[$16_1 | 0] = 1; $16_1 = $17_1 + ($19_1 << 3) | 0; HEAP32[$16_1 + 4 >> 2] = $15_1; HEAP32[$16_1 >> 2] = $13_1; $19_1 = $19_1 + 1 | 0; } $11_1 = HEAP32[$11_1 + 16 >> 2]; continue; } break; }; $40_1 = 0; $13_1 = 0; $15_1 = $18_1; while (1) { $11_1 = HEAP32[$15_1 >> 2]; if ($11_1) { if (!HEAPU8[$13_1 + $20_1 | 0]) { $15_1 = $17_1 + ($19_1 << 3) | 0; HEAP32[$15_1 + 4 >> 2] = $13_1; HEAP32[$15_1 >> 2] = $11_1; $19_1 = $19_1 + 1 | 0; } $13_1 = $13_1 + 1 | 0; $15_1 = $11_1 + 20 | 0; continue; } else { $11_1 = $22_1; $22_1 = $17_1; } break; }; } $13_1 = HEAP32[$26_1 + 32 >> 2]; block32 : { if (!($13_1 & 24576)) { $19_1 = 0; $21_1 = 0; break block32; } block34 : { if ($13_1 & 8192) { $31_1 = $1092($0_1, $1_1, 129, 0, 0); if ($31_1) { break block34 } } $31_1 = 0; $19_1 = 0; $21_1 = 0; if (!$1093($0_1, $1_1, 0, 0)) { break block32 } } $21_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $21_1; $326($14, 71, 0, $21_1); $19_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $19_1; } block36 : { if (!$7_1) { $17_1 = 0; break block36; } $17_1 = 0; if ($24_1) { break block36 } $15_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $15_1; $13_1 = $8_1; if (($13_1 | 0) == 11) { $13_1 = HEAPU8[$1_1 + 42 | 0]; $13_1 = ($13_1 | 0) == 11 ? 2 : $13_1; } block39 : { if (!$12_1) { break block39 } $17_1 = $1127($12_1, 0); if ($17_1) { $13_1 = HEAPU8[$17_1 + 20 | 0] ? 6 : 4 } if (($12_1 | 0) == ($17_1 | 0)) { break block39 } $36_1 = $857($14, 9); } if (!(($8_1 | 0) == 5 | ($13_1 | 0) != 5 | ($36_1 | !HEAP32[$18_1 >> 2]))) { $34_1 = $857($14, 9) + 1 | 0 } block42 : { if (!$6_1) { break block42 } $835($14, 54, $5_1, $15_1, $6_1); $20_1 = HEAP32[$14 + 108 >> 2]; if (($20_1 | 0) <= 0) { break block42 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($20_1, 20) | 0) - 18 >> 1] = 144; } $835($14, 31, $3, $15_1, $5_1); block50 : { block48 : { block44 : { switch ($13_1 - 1 | 0) { default: $13_1 = 2; case 0: case 1: case 2: $1124($0_1, $13_1, $1_1); break block48; case 4: if ($21_1) { $13_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($13_1 ? $13_1 : $0_1) + 20 | 0] = 1; $1102($0_1, $1_1, $31_1, $3, $4_1, $5_1, 1, 0, 5, 1, -1); $326($14, 86, $21_1, 1); $37_1 = 1; $13_1 = 1; break block50; } if (!HEAP32[$18_1 >> 2]) { $37_1 = 1; $13_1 = 0; break block50; } $37_1 = 1; $13_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($13_1 ? $13_1 : $0_1) + 20 | 0] = 1; $1116($0_1, $1_1, $3, $4_1, 0, -1); $13_1 = 0; break block50; case 5: $1393($0_1, $12_1, $1_1, 0, $3); break; case 3: break block44; }; } $863($14, $9_1); } $13_1 = 0; } $41_1 = $13_1; $1013($14, $15_1); if (!(!$12_1 | ($12_1 | 0) == ($17_1 | 0))) { $42_1 = $857($14, 9); break block36; } if (!$34_1) { $34_1 = 0; break block36; } $48_1 = $857($14, 9); $15_1 = HEAP32[$14 + 108 >> 2]; $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : (HEAP32[$14 + 104 >> 2] + Math_imul($34_1, 20) | 0) - 20 | 0) + 8 >> 2] = $15_1; } block56 : { if (!$40_1) { $23_1 = HEAP32[$22_1 + 4 >> 2]; $15_1 = HEAP32[$22_1 >> 2]; break block56; } $23_1 = 0; $15_1 = $11_1; } $13_1 = ($6_1 | 0) != 0; $49 = $13_1 & ($31_1 | 0) != 0; $50_1 = $36_1 + 1 | 0; $51_1 = $6_1 + 1 | 0; $45_1 = $5_1 ^ -1; $43_1 = $5_1 + 1 | 0; $52_1 = !($13_1 & !$7_1); $28_1 = 0; $20_1 = $19_1; while (1) { block58 : { block69 : { block76 : { if ($15_1) { $7_1 = ($23_1 << 2) + $2_1 | 0; if (!HEAP32[$7_1 >> 2]) { break block58 } block59 : { if (!$12_1) { break block59 } $17_1 = $1127($12_1, $15_1); if (!$36_1 | ($17_1 | 0) != ($12_1 | 0)) { break block59 } $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($36_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2]; } $29_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $29_1; if (!$35_1) { $998($14, $1_1, $43_1); $35_1 = 1; } if (HEAP32[$15_1 + 36 >> 2]) { $326($14, 75, 0, HEAP32[$7_1 >> 2]); HEAP32[$0_1 + 56 >> 2] = $45_1; $1263($0_1, HEAP32[$15_1 + 36 >> 2], $29_1); HEAP32[$0_1 + 56 >> 2] = 0; } $27 = $4_1 + $23_1 | 0; $46_1 = HEAP32[$7_1 >> 2]; $18_1 = $46_1 + 1 | 0; $13_1 = 0; while (1) { $16_1 = HEAPU16[$15_1 + 52 >> 1]; if (!($16_1 >>> 0 <= $13_1 >>> 0)) { block67 : { block68 : { block65 : { block66 : { block64 : { $16_1 = HEAPU16[HEAP32[$15_1 + 4 >> 2] + ($13_1 << 1) >> 1]; switch ($16_1 - 65534 | 0) { case 0: break block64; case 1: break block65; default: break block66; }; } HEAP32[$0_1 + 56 >> 2] = $45_1; $1188($0_1, HEAP32[(HEAP32[$15_1 + 40 >> 2] + ($13_1 << 4) | 0) + 8 >> 2], $13_1 + $18_1 | 0); HEAP32[$0_1 + 56 >> 2] = 0; break block67; } $16_1 = $16_1 << 16 >> 16; if (HEAPU16[$1_1 + 32 >> 1] != ($16_1 & 65535)) { break block68 } } $326($14, 82, $5_1, $13_1 + $18_1 | 0); break block67; } $326($14, 81, $1111($1_1, $16_1) + $43_1 | 0, $13_1 + $18_1 | 0); } $13_1 = $13_1 + 1 | 0; continue; } break; }; $835($14, 97, $18_1, $16_1, HEAP32[$7_1 >> 2]); $13_1 = ($15_1 | 0) != ($24_1 | 0); if (!($13_1 | $52_1)) { break block69 } $7_1 = HEAPU8[$15_1 + 54 | 0]; if (!$7_1) { break block69 } if ($17_1) { $30_1 = HEAPU8[$17_1 + 20 | 0] ? 6 : 4 } else { $30_1 = ($8_1 | 0) == 11 ? (($7_1 | 0) == 11 ? 2 : $7_1) : $8_1 } block72 : { if (HEAP32[$15_1 + 20 >> 2] | $23_1 | (($30_1 | 0) != 5 | $13_1)) { break block72 } $7_1 = HEAP32[$26_1 + 32 >> 2]; if ($7_1 & 8192) { if ($1092($0_1, $1_1, 129, 0, 0)) { break block72 } $7_1 = HEAP32[$26_1 + 32 >> 2]; } if (!($7_1 & 16384)) { break block69 } if (HEAP32[$1_1 + 48 >> 2]) { break block72 } if (!$1011($1_1)) { break block69 } } $38_1 = $312($14, 27, $27, $29_1, $18_1, HEAPU16[$15_1 + 50 >> 1]); $7_1 = $18_1; $39_1 = ($15_1 | 0) == ($24_1 | 0); if (!$39_1) { $7_1 = $1060($0_1, $33_1) } if (!$6_1 & ($30_1 | 0) != 5) { break block76 } if (!(HEAPU8[$1_1 + 28 | 0] & 128)) { $326($14, 142, $27, $7_1); if (!$6_1) { break block76 } $835($14, 54, $7_1, $29_1, $6_1); $13_1 = HEAP32[$14 + 108 >> 2]; if (($13_1 | 0) <= 0) { break block76 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($13_1, 20) | 0) - 18 >> 1] = 144; break block76; } $13_1 = 0; block78 : { if ($39_1) { break block78 } while (1) { if (HEAPU16[$24_1 + 50 >> 1] <= $13_1 >>> 0) { break block78 } $835($14, 94, $27, $889($15_1, HEAP16[HEAP32[$24_1 + 4 >> 2] + ($13_1 << 1) >> 1]), $7_1 + $13_1 | 0); $13_1 = $13_1 + 1 | 0; continue; }; } if (!$6_1) { break block76 } $53_1 = ((HEAPU8[$15_1 + 55 | 0] | HEAPU8[$15_1 + 56 | 0] << 8) & 3) == 2 ? $18_1 : $7_1; $16_1 = HEAPU16[$24_1 + 50 >> 1]; $25 = $16_1 + HEAP32[$14 + 108 >> 2] | 0; $13_1 = 0; $44_1 = 53; while (1) { if (($16_1 & 65535) >>> 0 <= $13_1 >>> 0) { break block76 } $16_1 = $985($0_1, HEAP32[HEAP32[$24_1 + 32 >> 2] + ($13_1 << 2) >> 2]); $47_1 = (HEAPU16[$24_1 + 50 >> 1] - 1 | 0) == ($13_1 | 0); $44_1 = $47_1 ? 54 : $44_1; $25 = $47_1 ? $29_1 : $25; $859($14, $44_1, $1111($1_1, HEAP16[HEAP32[$24_1 + 4 >> 2] + ($13_1 << 1) >> 1]) + $51_1 | 0, $25, $13_1 + $53_1 | 0, $16_1, -2); $16_1 = HEAP32[$14 + 108 >> 2]; if (($16_1 | 0) > 0) { HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($16_1, 20) | 0) - 18 >> 1] = 144 } $13_1 = $13_1 + 1 | 0; $16_1 = HEAPU16[$24_1 + 50 >> 1]; continue; }; } if ($34_1) { $863($14, $34_1); $4_1 = HEAP32[$14 + 108 >> 2]; $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($48_1, 20) | 0) + 8 >> 2] = $4_1; } if ($41_1) { $326($14, 17, $21_1, $20_1); block85 : { if (!$24_1) { block84 : { if (!$6_1) { break block84 } $835($14, 54, $5_1, $19_1, $6_1); $4_1 = HEAP32[$14 + 108 >> 2]; if (($4_1 | 0) <= 0) { break block84 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 144; } $835($14, 31, $3, $19_1, $5_1); $1124($0_1, 2, $1_1); break block85; } $863($14, $19_1); } $1013($14, $20_1); } block86 : { if (HEAPU8[$1_1 + 28 | 0] & 128) { break block86 } $835($14, 97, $43_1, HEAP16[$1_1 + 36 >> 1], HEAP32[($23_1 << 2) + $2_1 >> 2]); if ($35_1) { break block86 } $998($14, $1_1, 0); } HEAP32[$10_1 >> 2] = $37_1; break block25; } block91 : { block89 : { switch ($30_1 - 1 | 0) { case 0: case 1: case 2: $1262($0_1, $30_1, $15_1); break block91; case 5: $1393($0_1, $12_1, $1_1, $15_1, $27); case 3: $863($14, $9_1); break block91; default: break block89; }; } $13_1 = HEAP32[$14 + 108 >> 2]; if ($21_1) { $16_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($16_1 ? $16_1 : $0_1) + 20 | 0] = 1; $41_1 = $41_1 + 1 | 0; } block94 : { if ($49) { $858($14, 167, $3); $1102($0_1, $1_1, $31_1, $3, $4_1, $7_1, $33_1 << 16 >> 16, 0, 5, $39_1, $27); $858($14, 168, $3); break block94; } $1102($0_1, $1_1, $31_1, $3, $4_1, $7_1, $33_1 << 16 >> 16, 0, 5, $39_1, $27); } $37_1 = 1; if (!$21_1) { break block91 } $326($14, 86, $21_1, 1); $27 = $857($14, 9); $1013($14, $20_1); $20_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $20_1; if (HEAP32[$15_1 + 36 >> 2]) { $326($14, 51, $46_1, $20_1) } $16_1 = $13_1 - $38_1 | 0; while (1) { if (!(($16_1 | 0) <= 0)) { $13_1 = 82740; $13_1 = HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($38_1, 20) | 0; $25 = HEAPU8[$13_1 | 0]; block98 : { if (($25 | 0) == 142) { break block98 } $30_1 = HEAPU16[$13_1 + 2 >> 1]; $859($14, $25, HEAP32[$13_1 + 4 >> 2], HEAP8[$25 + 35056 | 0] & 1 ? $20_1 : HEAP32[$13_1 + 8 >> 2], HEAP32[$13_1 + 12 >> 2], HEAP32[$13_1 + 16 >> 2], HEAP8[$13_1 + 1 | 0]); $13_1 = HEAP32[$14 + 108 >> 2]; if (($13_1 | 0) <= 0) { break block98 } HEAP16[(HEAP32[$14 + 104 >> 2] + Math_imul($13_1, 20) | 0) - 18 >> 1] = $30_1; } $38_1 = $38_1 + 1 | 0; $16_1 = $16_1 - 1 | 0; continue; } break; }; $1262($0_1, 2, $15_1); $15_1 = HEAP32[$14 + 108 >> 2]; $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($27, 20) | 0) + 8 >> 2] = $15_1; } $1013($14, $29_1); if (($7_1 | 0) != ($18_1 | 0)) { $1061($0_1, $7_1, $33_1) } if (!$17_1) { break block58 } $13_1 = $17_1; if (!$42_1) { break block58 } while (1) { $13_1 = HEAP32[$13_1 + 16 >> 2]; if (!(!$13_1 | !HEAP32[$13_1 >> 2] | !HEAP32[$13_1 + 28 >> 2])) { if (HEAPU8[$13_1 + 21 | 0]) { continue } break block58; } break; }; $863($14, $50_1); $13_1 = 82740; HEAP32[(HEAPU8[HEAP32[$14 >> 2] + 87 | 0] ? $13_1 : HEAP32[$14 + 104 >> 2] + Math_imul($42_1, 20) | 0) + 8 >> 2] = HEAP32[$14 + 108 >> 2]; $42_1 = 0; break block58; } $1013($14, $29_1); } if ($40_1) { $23_1 = $23_1 + 1 | 0; $11_1 = HEAP32[$11_1 + 20 >> 2]; $15_1 = $11_1; continue; } else { $15_1 = 0; $28_1 = $28_1 + 1 | 0; $23_1 = $28_1; if (($11_1 | 0) <= ($23_1 | 0)) { continue } $7_1 = ($23_1 << 3) + $22_1 | 0; $15_1 = HEAP32[$7_1 >> 2]; $23_1 = HEAP32[$7_1 + 4 >> 2]; continue; } }; } $0_1 = $32_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1115($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $8_1 = global$0 - 16 | 0; $9_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $9_1; block : { $12_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$1_1 + 43 | 0] | !(HEAPU8[$12_1 + 33 | 0] & 64)) { break block } $19_1 = $2_1 + 1 | 0; $7_1 = $1_1 + 48 | 0; $9_1 = HEAP32[$12_1 + 16 >> 2]; $14 = $309($12_1, HEAP32[$1_1 + 60 >> 2]); $16_1 = HEAP32[$9_1 + ($14 << 4) >> 2]; $17_1 = HEAPU8[$0_1 + 165 | 0]; while (1) { $10_1 = HEAP32[$7_1 >> 2]; if ($10_1) { HEAP32[$8_1 + 12 >> 2] = 0; HEAP32[$8_1 + 8 >> 2] = 0; block3 : { block2 : { if (!$4_1) { break block2 } if (!$66(HEAP32[$1_1 >> 2], HEAP32[$10_1 + 8 >> 2])) { break block2 } if (!$1377($1_1, $10_1, $4_1, $5_1)) { break block3 } } $9_1 = HEAP32[$10_1 + 8 >> 2]; block8 : { block7 : { block5 : { if (HEAPU8[$0_1 + 165 | 0]) { $11_1 = $319($12_1, $9_1, $16_1); break block5; } $11_1 = $308($0_1, 0, $9_1, $16_1); } if ($11_1) { if (!$1153($0_1, $11_1, $10_1, $8_1 + 12 | 0, $8_1 + 8 | 0)) { break block7 } } if (HEAPU8[$12_1 + 87 | 0] | !$17_1) { break block } if ($11_1) { break block3 } $6_1 = $10_1 + 36 | 0; $9_1 = $856($0_1); $11_1 = HEAP32[$10_1 + 20 >> 2]; $13_1 = ($11_1 + HEAP32[$9_1 + 108 >> 2] | 0) + 1 | 0; $7_1 = 0; while (1) { if (($7_1 | 0) >= ($11_1 | 0)) { break block8 } $326($9_1, 51, $1111(HEAP32[$10_1 >> 2], HEAP16[$6_1 + ($7_1 << 3) >> 1]) + $19_1 | 0, $13_1); $7_1 = $7_1 + 1 | 0; $11_1 = HEAP32[$10_1 + 20 >> 2]; continue; }; } $13_1 = HEAP32[$8_1 + 8 >> 2]; if (!$13_1) { HEAP32[$8_1 + 4 >> 2] = HEAP32[$10_1 + 36 >> 2]; $13_1 = $8_1 + 4 | 0; } $6_1 = $11_1 + 32 | 0; $9_1 = 0; $15_1 = HEAP32[$8_1 + 12 >> 2]; $7_1 = 0; while (1) { if (($7_1 | 0) < HEAP32[$10_1 + 20 >> 2]) { $18_1 = ($7_1 << 2) + $13_1 | 0; if (HEAP32[$18_1 >> 2] == HEAP16[$1_1 + 32 >> 1]) { HEAP32[$18_1 >> 2] = -1 } if (HEAP32[$12_1 + 364 >> 2]) { $9_1 = ($1239($0_1, HEAP32[$11_1 >> 2], HEAP32[HEAP32[$11_1 + 4 >> 2] + Math_imul(HEAP16[($15_1 ? HEAP32[$15_1 + 4 >> 2] + ($7_1 << 1) | 0 : $6_1) >> 1], 12) >> 2], $14) | 0) == 2 } $7_1 = $7_1 + 1 | 0; continue; } break; }; $988($0_1, $14, HEAP32[$11_1 + 20 >> 2], 0, HEAP32[$11_1 >> 2]); HEAP32[$0_1 + 44 >> 2] = HEAP32[$0_1 + 44 >> 2] + 1; if ($2_1) { $1385($0_1, $14, $11_1, $15_1, $10_1, $13_1, $2_1, -1, $9_1) } block15 : { if (!$3) { break block15 } $6_1 = HEAP32[$0_1 + 132 >> 2]; $6_1 = HEAP32[($6_1 ? $6_1 : $0_1) + 140 >> 2]; block16 : { if (!$6_1) { break block16 } $6_1 = HEAP32[$6_1 >> 2]; if (($6_1 | 0) == HEAP32[$10_1 + 28 >> 2] & HEAPU8[$10_1 + 25 | 0] == 8) { break block15 } if (($6_1 | 0) != HEAP32[$10_1 + 32 >> 2]) { break block16 } if (HEAPU8[$10_1 + 26 | 0] == 8) { break block15 } } $1385($0_1, $14, $11_1, $15_1, $10_1, $13_1, $3, 1, $9_1); } $10($12_1, HEAP32[$8_1 + 8 >> 2]); break block3; } $326($9_1, 158, HEAPU8[$10_1 + 24 | 0], -1); } $7_1 = $10_1 + 4 | 0; continue; } break; }; $10_1 = ($4_1 | 0) != 0; $7_1 = $1011($1_1); while (1) { if (!$7_1) { break block } HEAP32[$8_1 + 12 >> 2] = 0; HEAP32[$8_1 + 8 >> 2] = 0; block19 : { if ($4_1) { if (!$1378($1_1, $7_1, $4_1, $5_1)) { break block19 } } if (!(HEAP32[$0_1 + 132 >> 2] | (HEAPU8[$7_1 + 24 | 0] | HEAPU8[$12_1 + 34 | 0] & 8))) { if (!HEAPU8[$0_1 + 20 | 0]) { break block19 } } if ($1153($0_1, $1_1, $7_1, $8_1 + 12 | 0, $8_1 + 8 | 0)) { if (!$17_1) { break block } if (!HEAPU8[$12_1 + 87 | 0]) { break block19 } break block; } $9_1 = $932($0_1, 0, 0, 0); if ($9_1) { $6_1 = HEAP32[$7_1 >> 2]; HEAP32[$9_1 + 16 >> 2] = $6_1; HEAP32[$9_1 + 8 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$6_1 + 24 >> 2] = HEAP32[$6_1 + 24 >> 2] + 1; $6_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $6_1 + 1; HEAP32[$9_1 + 24 >> 2] = $6_1; if ($3) { $1386($0_1, $9_1, $1_1, HEAP32[$8_1 + 12 >> 2], $7_1, HEAP32[$8_1 + 8 >> 2], $3, -1) } block24 : { if (!$2_1) { break block24 } $6_1 = HEAPU8[($7_1 + $10_1 | 0) + 25 | 0]; $11_1 = HEAP32[$12_1 + 36 >> 2]; $1386($0_1, $9_1, $1_1, HEAP32[$8_1 + 12 >> 2], $7_1, HEAP32[$8_1 + 8 >> 2], $2_1, 1); if (HEAPU8[$7_1 + 24 | 0] | !(($11_1 & 8) >>> 3 | ($6_1 & 253) != 8)) { break block24 } $6_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($6_1 ? $6_1 : $0_1) + 21 | 0] = 1; } HEAP32[$9_1 + 8 >> 2] = 0; $794($12_1, $9_1); } $10($12_1, HEAP32[$8_1 + 8 >> 2]); } $7_1 = HEAP32[$7_1 + 12 >> 2]; continue; }; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1116($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $6_1 = global$0 - 16 | 0; $7_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $7_1; $8_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$1_1 + 28 | 0] & 128) { $11_1 = $359($1_1) } $1_1 = $1_1 + 8 | 0; $9_1 = -1; $7_1 = 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { block3 : { block4 : { if ($4_1) { if (!HEAP32[($10_1 << 2) + $4_1 >> 2]) { break block3 } if (($1_1 | 0) != ($11_1 | 0)) { break block4 } break block3; } if (($1_1 | 0) == ($11_1 | 0)) { break block3 } } $12_1 = $3 + $10_1 | 0; if (($12_1 | 0) == ($5_1 | 0)) { break block3 } $9_1 = $1149($0_1, $1_1, $2_1, 0, 1, $6_1 + 12 | 0, $7_1, $9_1); $835($8_1, 140, $12_1, $9_1, HEAPU16[$1_1 + ((HEAPU8[$1_1 + 55 | 0] | HEAPU8[$1_1 + 56 | 0] << 8) & 8 ? 50 : 52) >> 1]); $7_1 = HEAP32[$8_1 + 108 >> 2]; if (($7_1 | 0) > 0) { HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) - 18 >> 1] = 1 } $1150($0_1, HEAP32[$6_1 + 12 >> 2]); $7_1 = $1_1; } $1_1 = $1_1 + 20 | 0; $10_1 = $10_1 + 1 | 0; continue; } break; }; $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1117($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $14 = $8_1 ? 16 : 0; $16_1 = $14 | $6_1 & 2 | 1; $9_1 = $1_1 + 8 | 0; $10_1 = HEAP32[$0_1 + 8 >> 2]; while (1) { $12_1 = HEAP32[$9_1 >> 2]; if ($12_1) { $11_1 = ($13_1 << 2) + $5_1 | 0; $9_1 = HEAP32[$11_1 >> 2]; block1 : { if (!$9_1) { break block1 } if (HEAP32[$12_1 + 36 >> 2]) { $326($10_1, 51, $9_1, HEAP32[$10_1 + 108 >> 2] + 2 | 0) } $9_1 = $14; $15_1 = HEAPU8[$12_1 + 55 | 0] | HEAPU8[$12_1 + 56 | 0] << 8; $9_1 = ($15_1 & 3) == 2 ? (HEAPU8[$1_1 + 28 | 0] & 128 ? $16_1 : $9_1) : $9_1; $11_1 = HEAP32[$11_1 >> 2]; $312($10_1, 138, $3 + $13_1 | 0, $11_1, $11_1 + 1 | 0, HEAPU16[$12_1 + ($15_1 & 8 ? 50 : 52) >> 1]); $11_1 = HEAP32[$10_1 + 108 >> 2]; if (($11_1 | 0) <= 0) { break block1 } HEAP16[(HEAP32[$10_1 + 104 >> 2] + Math_imul($11_1, 20) | 0) - 18 >> 1] = $9_1; } $13_1 = $13_1 + 1 | 0; $9_1 = $12_1 + 20 | 0; continue; } break; }; block4 : { if (HEAPU8[$1_1 + 28 | 0] & 128) { break block4 } $3 = HEAPU8[$0_1 + 18 | 0]; $835($10_1, 128, $2_1, HEAP32[($13_1 << 2) + $5_1 >> 2], $4_1); if (!HEAPU8[$0_1 + 18 | 0]) { $1043($10_1, $1_1, -5) } $0_1 = HEAP32[$10_1 + 108 >> 2]; if (($0_1 | 0) <= 0) { break block4 } $1_1 = (HEAP32[$10_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 | 0; $0_1 = $3 ? 0 : $6_1 ? $6_1 | 1 : 33; $0_1 = $7_1 ? $0_1 | 8 : $0_1; HEAP16[$1_1 >> 1] = ($8_1 ? $0_1 | 16 : $0_1) & 255; } } function $1118($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0; $8_1 = global$0 - 48 | 0; $20_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $20_1; block : { if (!(HEAPU8[HEAP32[$0_1 >> 2] + 33 | 0] & 64)) { break block } $23_1 = $2_1 ? -126 : -127; $24_1 = $1_1 + 32 | 0; $25 = HEAP32[12804]; $26_1 = HEAP32[12805]; $20_1 = HEAP32[12802]; $27 = HEAP32[12803]; $11_1 = $1011($1_1); $21_1 = ($2_1 | 0) != 0; $28_1 = $21_1 << 2; while (1) { if (!$11_1) { break block } block2 : { if ($4_1) { if (!$1378($1_1, $11_1, $4_1, $5_1)) { break block2 } } $7_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$7_1 + 32 >> 2]; $15_1 = HEAP32[$7_1 + 36 >> 2] & 8 ? 0 : HEAPU8[($11_1 + $21_1 | 0) + 25 | 0]; if (!!($6_1 & 524288) & ($15_1 | 0) == 7) { break block2 } $6_1 = $11_1 + $28_1 | 0; $9_1 = HEAP32[$6_1 + 28 >> 2]; block4 : { if ($9_1 | !$15_1) { break block4 } $9_1 = 0; HEAP32[$8_1 + 44 >> 2] = 0; HEAP32[$8_1 + 40 >> 2] = 0; if ($1153($0_1, $1_1, $11_1, $8_1 + 44 | 0, $8_1 + 40 | 0)) { break block4 } $29_1 = $6_1 + 28 | 0; $13_1 = 0; $22_1 = ($15_1 | 0) != 7; $16_1 = $22_1 & (($2_1 | 0) != 0 | ($15_1 | 0) != 10); $18_1 = $11_1 + 36 | 0; $17_1 = $15_1 - 9 | 0; $19_1 = 0; $14 = 0; while (1) { if (($9_1 | 0) < HEAP32[$11_1 + 20 >> 2]) { HEAP32[$8_1 + 32 >> 2] = $20_1; HEAP32[$8_1 + 36 >> 2] = $27; HEAP32[$8_1 + 24 >> 2] = $25; HEAP32[$8_1 + 28 >> 2] = $26_1; $6_1 = HEAP32[$8_1 + 40 >> 2]; $12_1 = HEAP32[($6_1 ? $6_1 + ($9_1 << 2) | 0 : $18_1) >> 2]; $10_1 = $24_1; $30_1 = HEAP32[$1_1 + 4 >> 2]; $6_1 = HEAP32[$8_1 + 44 >> 2]; if ($6_1) { $10_1 = HEAP32[$6_1 + 4 >> 2] + ($9_1 << 1) | 0 } $6_1 = HEAP32[$30_1 + Math_imul(HEAP16[$10_1 >> 1], 12) >> 2]; HEAP32[$8_1 + 8 >> 2] = $6_1; HEAP32[$8_1 + 12 >> 2] = $48($6_1); $12_1 = Math_imul($12_1, 12); $6_1 = HEAP32[$12_1 + HEAP32[HEAP32[$11_1 >> 2] + 4 >> 2] >> 2]; HEAP32[$8_1 + 16 >> 2] = $6_1; HEAP32[$8_1 + 20 >> 2] = $48($6_1); $6_1 = $8_1 + 32 | 0; $10_1 = $8_1 + 8 | 0; $13_1 = $948($0_1, $13_1, $903($0_1, 54, $903($0_1, 142, $951($7_1, 60, $6_1, 0), $951($7_1, 60, $10_1, 0)), $951($7_1, 60, $8_1 + 16 | 0, 0))); if ($2_1) { $14 = $948($0_1, $14, $903($0_1, 45, $903($0_1, 142, $951($7_1, 60, $6_1, 0), $951($7_1, 60, $10_1, 0)), $903($0_1, 142, $951($7_1, 60, $8_1 + 24 | 0, 0), $951($7_1, 60, $10_1, 0)))) } if ($16_1) { block12 : { block11 : { block9 : { switch ($17_1 | 0) { case 1: $10_1 = $903($0_1, 142, $951($7_1, 60, $8_1 + 24 | 0, 0), $951($7_1, 60, $8_1 + 8 | 0, 0)); break block12; case 0: break block9; default: break block11; }; } $10_1 = HEAP32[$11_1 >> 2]; $6_1 = $12_1 + HEAP32[$10_1 + 4 >> 2] | 0; if (HEAPU8[$6_1 + 10 | 0] & 96) { break block11 } $6_1 = $891($10_1, $6_1); if (!$6_1) { break block11 } $10_1 = $906($7_1, $6_1, 0); break block12; } $10_1 = $951($7_1, 122, 0, 0); } $19_1 = $936($0_1, $19_1, $10_1); $959($0_1, $19_1, $8_1 + 16 | 0, 0); } $9_1 = $9_1 + 1 | 0; continue; } break; }; $10($7_1, HEAP32[$8_1 + 40 >> 2]); $16_1 = 0; $12_1 = HEAP32[HEAP32[$11_1 >> 2] >> 2]; $18_1 = $48($12_1); block14 : { if ($22_1) { $6_1 = $13_1; $13_1 = 0; break block14; } $6_1 = $309($7_1, HEAP32[$1_1 + 60 >> 2]); $10_1 = $903($0_1, 72, $942($7_1, 118, 16106), 0); if ($10_1) { HEAP8[$10_1 + 1 | 0] = 2 } $17_1 = $932($0_1, 0, 0, 0); if ($17_1) { HEAP32[$17_1 + 8 >> 2] = $116($7_1, $12_1); HEAP32[$17_1 + 52 >> 2] = $116($7_1, HEAP32[HEAP32[$7_1 + 16 >> 2] + ($6_1 << 4) >> 2]); } $6_1 = 0; $13_1 = $939($0_1, $935(HEAP32[$0_1 >> 2], $10_1), $17_1, $13_1, 0, 0, 0, 0, 0); } HEAP16[$7_1 + 308 >> 1] = 0; HEAP32[$7_1 + 304 >> 2] = HEAP32[$7_1 + 304 >> 2] + 1; $9_1 = $270($7_1, $18_1 + 85 | 0, 0); block17 : { if (!$9_1) { break block17 } $10_1 = $9_1 + 84 | 0; HEAP32[$9_1 + 48 >> 2] = $10_1; $16_1 = $9_1 + 36 | 0; HEAP32[$9_1 + 28 >> 2] = $16_1; if ($18_1) { wasm2js_memory_copy($10_1, $12_1, $18_1) } HEAP32[$9_1 + 56 >> 2] = $906($7_1, $6_1, 1); HEAP32[$9_1 + 60 >> 2] = $887($7_1, $19_1, 1); HEAP32[$9_1 + 44 >> 2] = $907($7_1, $13_1, 1); if (!$14) { $14 = 0; break block17; } $14 = $903($0_1, 19, $14, 0); HEAP32[$9_1 + 12 >> 2] = $906($7_1, $14, 1); } $12_1 = HEAP32[$7_1 + 304 >> 2] - 1 | 0; HEAP32[$7_1 + 304 >> 2] = $12_1; $10_1 = 0; HEAP16[$7_1 + 308 >> 1] = $12_1 ? $10_1 : HEAPU16[$7_1 + 310 >> 1]; $11($7_1, $6_1); $11($7_1, $14); $358($7_1, $19_1); $789($7_1, $13_1); if (HEAPU8[$7_1 + 87 | 0] == 1) { $736($7_1, $9_1); $9_1 = 0; break block4; } $6_1 = 139; block22 : { block23 : { block24 : { switch ($15_1 - 7 | 0) { case 0: break block22; case 3: break block24; default: break block23; }; } if ($2_1) { break block23 } $6_1 = 129; break block22; } $6_1 = 130; } HEAP32[$16_1 + 4 >> 2] = $9_1; HEAP8[$16_1 | 0] = $6_1; $6_1 = HEAP32[$1_1 + 60 >> 2]; HEAP32[$9_1 + 24 >> 2] = $6_1; HEAP32[$9_1 + 20 >> 2] = $6_1; HEAP32[$29_1 >> 2] = $9_1; HEAP8[$9_1 + 8 | 0] = $23_1; } if (!$9_1) { break block2 } $1382($0_1, $9_1, $1_1, $3, 2, 0); } $11_1 = HEAP32[$11_1 + 12 >> 2]; continue; }; } $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1119($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAPU8[$0_1 | 0]; if (($1_1 | 0) == 176) { $1_1 = HEAPU8[$0_1 + 2 | 0] } $1_1 = $1_1 & 255; block2 : { block3 : { if (($1_1 | 0) != 139) { $2_1 = 1; if (($1_1 | 0) != 177) { break block2 } $0_1 = $0_1 + 20 | 0; break block3; } $0_1 = HEAP32[$0_1 + 20 >> 2] + 28 | 0; } $2_1 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; } return $2_1; } function $1120($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block3 : { $4_1 = HEAPU8[$1_1 | 0]; block2 : { block1 : { if (($4_1 | 0) != 177) { if (($4_1 | 0) != 139) { break block1 } $0_1 = $903($0_1, 178, 0, 0); $4_1 = 0; if (!$0_1) { break block2 } HEAP16[$0_1 + 32 >> 1] = $2_1; HEAP32[$0_1 + 28 >> 2] = $3; HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 131072; return $0_1; } $2_1 = (HEAP32[$1_1 + 20 >> 2] + ($2_1 << 4) | 0) + 8 | 0; $1_1 = HEAP32[$2_1 >> 2]; if (HEAPU8[$0_1 + 224 | 0] >= 2) { break block3 } } $4_1 = $906(HEAP32[$0_1 >> 2], $1_1, 0); } return $4_1; } HEAP32[$2_1 >> 2] = 0; return $1_1; } function $1121($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; if (!($2_1 ? $1_1 : 0)) { return ($1_1 | 0) != ($2_1 | 0) ? 2 : 0 } if (!(!$0_1 | HEAPU8[$1_1 | 0] != 157)) { $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = 0; block1 : { if (HEAPU8[$2_1 | 0] == 157 & HEAPU16[$1_1 + 32 >> 1] == HEAPU16[$2_1 + 32 >> 1]) { break block1 } $4_1 = 2; $5_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$5_1 + 34 | 0] & 128) { break block1 } $371($5_1, $2_1, 1, 65, $3 + 12 | 0); $2_1 = HEAP32[$3 + 12 >> 2]; if (!$2_1) { break block1 } $4_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAP16[$1_1 + 32 >> 1]; HEAP32[$4_1 + 228 >> 2] = HEAP32[$4_1 + 228 >> 2] | (($1_1 | 0) > 31 ? -2147483648 : 1 << $1_1 - 1); $0_1 = $1200(HEAP32[$0_1 + 244 >> 2], $1_1); if ($0_1) { $4_1 = HEAPU16[$0_1 + 16 >> 1]; $1_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $1_1; $5_1 = 0; } else { $5_1 = 1 << $1_1; $4_1 = $5_1 - 1 & 1 >>> 32 - $1_1; } if ($5_1 & 262148 | $4_1 & 262144) { $53($0_1) } $4_1 = $677($0_1, $2_1, 0) ? 2 : 0; } else { $4_1 = 2 } $200($2_1); $200($0_1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } block4 : { block9 : { $4_1 = HEAP32[$2_1 + 4 >> 2]; $6_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $4_1 | $6_1; block11 : { block5 : { if ($5_1 & 2048) { if (!($4_1 & $6_1 & 2048)) { break block4 } if (HEAP32[$1_1 + 8 >> 2] == HEAP32[$2_1 + 8 >> 2]) { break block5 } break block4; } $4_1 = HEAPU8[$1_1 | 0]; $6_1 = HEAPU8[$2_1 | 0]; if (!(($4_1 | 0) != 72 & ($6_1 | 0) == ($4_1 | 0))) { if (($4_1 | 0) == 114) { if ($1121($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3) >>> 0 < 2) { break block9 } $6_1 = HEAPU8[$2_1 | 0]; } if (($6_1 | 0) == 114) { if ($1121($0_1, $1_1, HEAP32[$2_1 + 12 >> 2], $3) >>> 0 < 2) { break block9 } } $6_1 = 2; if (HEAPU8[$1_1 | 0] != 170 | HEAPU8[$2_1 | 0] != 168 | HEAP32[$2_1 + 28 >> 2] >= 0) { break block11 } $4_1 = 170; if (HEAP32[$1_1 + 28 >> 2] != ($3 | 0)) { break block11 } } $7_1 = HEAP32[$1_1 + 8 >> 2]; block12 : { if (!$7_1) { break block12 } block16 : { block13 : { switch ($4_1 - 169 | 0) { default: if (($4_1 | 0) == 114) { break block16 } if (($4_1 | 0) == 122) { break block5 } case 1: case 2: if (($4_1 & 253) == 168) { break block12 } $4_1 = HEAP32[$2_1 + 8 >> 2]; if (!$4_1) { break block12 } if ($2073($7_1, $4_1)) { break block4 } break block12; case 0: case 3: break block13; }; } $6_1 = 2; if ($67($7_1, HEAP32[$2_1 + 8 >> 2])) { break block11 } $4_1 = HEAP32[$1_1 + 4 >> 2] & 16777216; if ((HEAP8[$2_1 + 7 | 0] & 1) != ($4_1 >>> 24 | 0)) { break block11 } if (!$4_1) { break block12 } if (!$1199($0_1, HEAP32[$1_1 + 44 >> 2], HEAP32[$2_1 + 44 >> 2], 1)) { break block12 } break block11; } if ($66($7_1, HEAP32[$2_1 + 8 >> 2])) { break block4 } } $6_1 = 2; if ((HEAP32[$2_1 + 4 >> 2] ^ HEAP32[$1_1 + 4 >> 2]) & 1028) { break block11 } if ($5_1 & 65536) { break block5 } if ($5_1 & 4096) { break block11 } if (!($5_1 & 32)) { if ($1121($0_1, HEAP32[$1_1 + 12 >> 2], HEAP32[$2_1 + 12 >> 2], $3)) { break block11 } } if ($1121($0_1, HEAP32[$1_1 + 16 >> 2], HEAP32[$2_1 + 16 >> 2], $3)) { break block11 } if ($1024(HEAP32[$1_1 + 20 >> 2], HEAP32[$2_1 + 20 >> 2], $3)) { break block11 } $0_1 = HEAPU8[$1_1 | 0]; if ($5_1 & 16384 | (($0_1 | 0) == 118 | ($0_1 | 0) == 171)) { break block5 } if (($0_1 | 0) == 175 & HEAPU8[$1_1 + 2 | 0] != HEAPU8[$2_1 + 2 | 0] | HEAPU16[$1_1 + 32 >> 1] != HEAPU16[$2_1 + 32 >> 1]) { break block11 } if (($0_1 | 0) == 50) { break block5 } $0_1 = HEAP32[$1_1 + 28 >> 2]; if (($0_1 | 0) == ($3 | 0)) { break block5 } if (($0_1 | 0) != HEAP32[$2_1 + 28 >> 2]) { break block11 } } $6_1 = 0; } return $6_1; } return 1; } return 2; } function $1122($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block2 : { block : { if (HEAPU16[$0_1 + 50 >> 1] != HEAPU16[$1_1 + 50 >> 1] | HEAPU16[$0_1 + 52 >> 1] != HEAPU16[$1_1 + 52 >> 1] | HEAPU8[$0_1 + 54 | 0] != HEAPU8[$1_1 + 54 | 0]) { break block } while (1) { if ($3 >>> 0 < HEAPU16[$1_1 + 50 >> 1]) { $2_1 = $3 << 1; $4_1 = HEAPU16[$2_1 + HEAP32[$1_1 + 4 >> 2] >> 1]; if (($4_1 | 0) != HEAPU16[$2_1 + HEAP32[$0_1 + 4 >> 2] >> 1]) { break block2 } if (($4_1 | 0) == 65534) { $4_1 = 0; $2_1 = $3 << 4; if ($1121(0, HEAP32[($2_1 + HEAP32[$1_1 + 40 >> 2] | 0) + 8 >> 2], HEAP32[($2_1 + HEAP32[$0_1 + 40 >> 2] | 0) + 8 >> 2], -1)) { break block } } if (HEAPU8[HEAP32[$1_1 + 28 >> 2] + $3 | 0] != HEAPU8[HEAP32[$0_1 + 28 >> 2] + $3 | 0]) { break block2 } $2_1 = $3 << 2; $3 = $3 + 1 | 0; $4_1 = 0; if (!$66(HEAP32[$2_1 + HEAP32[$1_1 + 32 >> 2] >> 2], HEAP32[$2_1 + HEAP32[$0_1 + 32 >> 2] >> 2])) { continue } break block; } break; }; $4_1 = !$1121(0, HEAP32[$1_1 + 36 >> 2], HEAP32[$0_1 + 36 >> 2], -1); } return $4_1; } return 0; } function $1123($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!(HEAPU8[$2_1 + 28 | 0] & 8)) { break block } $5_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$5_1 + 24 | 0] & 4) { break block } block2 : { $3 = HEAP32[HEAP32[(HEAP32[$5_1 + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2] + 72 >> 2]; if (!(!$3 | HEAPU8[$3 + 28 | 0] & 128 | HEAPU8[$3 + 43 | 0] == 1)) { if (HEAPU16[$3 + 34 >> 1] == 2) { break block2 } } HEAP32[$0_1 + 12 >> 2] = 523; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; return 0; } $3 = HEAP32[$0_1 + 132 >> 2]; $3 = $3 ? $3 : $0_1; $4_1 = $3 + 128 | 0; block3 : { while (1) { $4_1 = HEAP32[$4_1 >> 2]; if (!$4_1) { break block3 } if (HEAP32[$4_1 + 4 >> 2] != ($2_1 | 0)) { continue } break; }; return HEAP32[$4_1 + 12 >> 2]; } $4_1 = $325($5_1, 16, 0); $1016($3, 52, $4_1); if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { break block } HEAP32[$4_1 >> 2] = HEAP32[$3 + 128 >> 2]; HEAP32[$3 + 128 >> 2] = $4_1; HEAP32[$4_1 + 8 >> 2] = $1_1; HEAP32[$4_1 + 4 >> 2] = $2_1; $0_1 = HEAP32[$3 + 48 >> 2]; $6_1 = $0_1 + 2 | 0; HEAP32[$4_1 + 12 >> 2] = $6_1; HEAP32[$3 + 48 >> 2] = $0_1 + 4; } return $6_1; } function $1124($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = $0_1; $4_1 = HEAP16[$2_1 + 32 >> 1]; block1 : { if (($4_1 | 0) >= 0) { $0_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$2_1 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[HEAP32[$2_1 + 4 >> 2] + Math_imul($4_1, 12) >> 2]; HEAP32[$3 >> 2] = $6_1; $4_1 = $310($0_1, 6429, $3); $0_1 = 1555; break block1; } $4_1 = HEAP32[$0_1 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$2_1 >> 2]; $4_1 = $310($4_1, 15129, $3 + 16 | 0); $0_1 = 2579; } $1012($5_1, $0_1, $1_1, $4_1, -6, 2); $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1125($0_1, $1_1, $2_1) { if (($1_1 | 0) > 0) { $326(HEAP32[$0_1 + 8 >> 2], 159, $1_1, $2_1) } } function $1126($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block3 : { if ($1_1) { $5_1 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 28 >> 2] = $0_1; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 76; HEAP32[$2_1 + 8 >> 2] = 75; HEAP32[$2_1 + 4 >> 2] = $5_1; $4_1 = HEAP32[$0_1 + 24 >> 2]; $3 = $4_1 & -134254609; HEAP32[$0_1 + 24 >> 2] = $3; $10_1 = $1_1 + 8 | 0; $6_1 = $4_1 & 134254608; while (1) { if (($7_1 | 0) < HEAP32[$1_1 >> 2]) { $4_1 = HEAP32[($7_1 << 4) + $10_1 >> 2]; if ($4_1) { $3 = HEAP32[$5_1 + 232 >> 2] + HEAP32[$4_1 + 24 >> 2] | 0; HEAP32[$5_1 + 232 >> 2] = $3; $8_1 = 1; if ($1003($5_1, $3)) { break block3 } $1187($2_1 + 4 | 0, $4_1); $5_1 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$5_1 + 232 >> 2] = HEAP32[$5_1 + 232 >> 2] - HEAP32[$4_1 + 24 >> 2]; $3 = HEAP32[$0_1 + 24 >> 2]; $9_1 = $3 & 134254608; if ($9_1) { HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | $3 & 32784; $3 = $3 & -134254609; HEAP32[$0_1 + 24 >> 2] = $3; $6_1 = $6_1 | $9_1; } if (HEAP32[$5_1 + 40 >> 2] > 0) { break block3 } } $7_1 = $7_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 24 >> 2] = $3 | $6_1; } $8_1 = 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $1127($0_1, $1_1) { while (1) { if (!(!$0_1 | !HEAP32[$0_1 >> 2] | HEAP32[$0_1 + 28 >> 2] == ($1_1 | 0))) { $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; return $0_1; } function $1128($0_1, $1_1, $2_1) { block : { if (!HEAPU8[$0_1 + 23 | 0]) { break block } if (!$1174($0_1, $1_1)) { break block } $1175($0_1, $1_1, $2_1); return; } $1188($0_1, $1_1, $2_1); } function $1129($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $8_1 = global$0 - 128 | 0; $3 = $8_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $7_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$8_1 + 60 >> 2] = 0; HEAP32[$8_1 + 56 >> 2] = 0; block2 : { block35 : { block48 : { block10 : { block16 : { block8 : { block6 : { block9 : { block11 : { block21 : { block26 : { block68 : { block39 : { block114 : { block27 : { block31 : { block3 : { block19 : { block5 : { block20 : { block30 : { block14 : { block17 : { block7 : { block23 : { block29 : { while (1) { block28 : { block18 : { block4 : { block34 : { block22 : { block24 : { block12 : { block33 : { block13 : { block15 : { block : { if (!$1_1) { break block } if (!(!HEAP32[$0_1 + 76 >> 2] | HEAPU8[$1_1 + 6 | 0] & 128)) { __inlined_func$1165$123 : { $3 = $2_1; $11_1 = global$0 - 32 | 0; $4_1 = $11_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = $0_1 + 76 | 0; $13_1 = $11_1 + 12 | 0; $15_1 = $13_1 + 16 | 0; while (1) { block25 : { $9_1 = HEAP32[$4_1 >> 2]; block1 : { if (!$9_1) { $3 = -1; break block1; } $4_1 = HEAP32[$9_1 + 4 >> 2]; if (($4_1 | 0) < 0) { break block25 } $16_1 = HEAP32[$0_1 + 56 >> 2]; block46 : { if (!$16_1) { $6_1 = $4_1; break block46; } $6_1 = -1; if (($4_1 | 0) != ($16_1 - 1 | 0)) { break block25 } } if ($1121(0, $1_1, HEAP32[$9_1 >> 2], $6_1)) { break block25 } $6_1 = $971($1_1); block67 : { if ($6_1 >>> 0 <= 65) { if (HEAPU8[$9_1 + 17 | 0] != 65) { break block25 } break block67; } $4_1 = HEAPU8[$9_1 + 17 | 0]; if (($6_1 | 0) == 66) { if (($4_1 | 0) == 66) { break block67 } break block25; } if (($4_1 | 0) != 67) { break block25 } } if (HEAP32[$1_1 + 4 >> 2] < 0) { HEAP32[$13_1 >> 2] = 0; HEAP32[$13_1 + 4 >> 2] = 0; HEAP32[$15_1 >> 2] = 0; $4_1 = $13_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$11_1 + 8 >> 2] = 83; HEAP32[$11_1 + 4 >> 2] = $0_1; $1187($11_1 + 4 | 0, $1_1); if (HEAPU16[$11_1 + 24 >> 1]) { break block25 } } $4_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$9_1 + 16 | 0]) { $6_1 = HEAP32[$4_1 + 108 >> 2]; $835($4_1, 20, HEAP32[$9_1 + 8 >> 2], $6_1 + 3 | 0, $3); $835($4_1, 94, HEAP32[$9_1 + 8 >> 2], HEAP32[$9_1 + 12 >> 2], $3); $863($4_1, 0); $9_1 = HEAP32[$0_1 + 76 >> 2]; HEAP32[$0_1 + 76 >> 2] = 0; $862($0_1, $1_1, $3); HEAP32[$0_1 + 76 >> 2] = $9_1; HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : (HEAP32[$4_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) + 40 | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; break block1; } $835($4_1, 94, HEAP32[$9_1 + 8 >> 2], HEAP32[$9_1 + 12 >> 2], $3); } $4_1 = $11_1 + 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = $3; break __inlined_func$1165$123; } $4_1 = $9_1 + 20 | 0; continue; }; } if (($4_1 | 0) >= 0) { break block2 } } block258 : { $3 = HEAPU8[$1_1 | 0]; switch ($3 - 103 | 0) { case 10: case 13: case 14: case 16: case 17: case 18: case 19: case 20: case 21: case 22: case 23: case 24: case 25: case 26: case 27: case 28: case 29: case 30: case 31: case 32: case 33: case 34: case 35: case 37: case 38: case 39: case 40: case 41: case 42: case 43: case 44: case 45: case 46: case 47: case 48: case 49: case 50: case 56: case 57: case 58: case 59: case 60: case 61: case 62: case 63: case 64: case 77: break block; case 53: break block10; case 54: break block11; case 55: break block12; case 65: break block13; case 66: break block14; case 67: break block15; case 68: break block16; case 69: break block17; case 70: case 78: break block18; case 71: break block19; case 72: break block20; case 73: break block21; case 74: break block22; case 75: break block23; case 76: break block24; case 0: case 1: case 2: case 3: case 4: case 5: case 6: case 7: case 8: case 9: break block3; case 11: break block4; case 12: break block5; case 15: break block6; case 36: break block7; case 51: break block8; case 52: break block9; default: break block258; }; } block32 : { switch ($3 - 19 | 0) { case 2: case 3: case 4: case 5: case 6: case 7: case 8: case 9: case 10: case 11: case 12: case 13: case 14: case 15: case 16: case 18: case 19: case 20: case 21: case 22: case 23: case 28: case 29: break block; case 17: break block26; case 26: case 27: break block27; case 30: break block28; case 31: break block29; case 24: case 25: break block3; case 32: case 33: break block30; case 34: case 35: case 36: case 37: case 38: case 39: break block31; case 0: break block5; case 1: break block7; default: break block32; }; } if (($3 | 0) == 72) { break block33 } if (($3 | 0) == 78) { break block34 } } $326($7_1, 75, 0, $2_1); break block35; } $3 = HEAP16[$1_1 + 34 >> 1]; $5_1 = HEAP32[$1_1 + 40 >> 2]; if (($3 | 0) < HEAP32[$5_1 + 24 >> 2]) { if (!HEAPU8[$5_1 | 0]) { $4_1 = $3 + HEAP32[$5_1 + 12 >> 2] | 0; break block2; } if (HEAPU8[$5_1 + 1 | 0]) { $0_1 = HEAP32[$5_1 + 20 >> 2] + ($3 << 4) | 0; $1_1 = HEAP32[$0_1 >> 2]; $835($7_1, 94, HEAP32[$5_1 + 8 >> 2], HEAP16[$0_1 + 14 >> 1], $2_1); if (!$1_1) { break block35 } $0_1 = HEAP16[$0_1 + 12 >> 1]; if (($0_1 | 0) < 0 | HEAPU8[(HEAP32[$1_1 + 4 >> 2] + Math_imul($0_1, 12) | 0) + 5 | 0] != 69) { break block35 } $858($7_1, 87, $2_1); break block35; } if (HEAP32[$1_1 + 44 >> 2]) { break block13 } $835($7_1, 94, HEAP32[$1_1 + 28 >> 2], HEAP16[$1_1 + 32 >> 1], $2_1); break block35; } $326($7_1, 75, 0, $2_1); break block39; } if (HEAPU8[$1_1 + 4 | 0] & 32) { $4_1 = $1129($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); $0_1 = 68; $2_1 = HEAP16[$1_1 + 32 >> 1]; block41 : { if (($2_1 | 0) < 0) { break block41 } $1_1 = HEAP32[$1_1 + 44 >> 2]; if (($2_1 | 0) >= HEAP16[$1_1 + 34 >> 1]) { break block41 } $0_1 = HEAP8[(HEAP32[$1_1 + 4 >> 2] + Math_imul($2_1, 12) | 0) + 5 | 0]; if (($0_1 | 0) < 66) { break block2 } } $859($7_1, 96, $4_1, 1, 0, ($0_1 << 1 & 254) + 50492 | 0, -1); break block2; } $5_1 = HEAP32[$1_1 + 28 >> 2]; if (($5_1 | 0) < 0) { $5_1 = HEAP32[$0_1 + 56 >> 2]; if (($5_1 | 0) < 0) { $3 = HEAP16[$1_1 + 32 >> 1]; if (($3 | 0) < 0) { $4_1 = $5_1 ^ -1; break block2; } $6_1 = HEAP32[$1_1 + 44 >> 2]; $4_1 = $1111($6_1, $3) - $5_1 | 0; $1_1 = HEAP32[$6_1 + 4 >> 2] + Math_imul($3, 12) | 0; $5_1 = HEAPU16[$1_1 + 10 >> 1]; if ($5_1 & 96) { if ($5_1 & 256) { HEAP32[$8_1 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, 29521, $8_1); $4_1 = 0; break block2; } $2_1 = $5_1 | 256; HEAP16[$1_1 + 10 >> 1] = $2_1; if ($5_1 & 128) { $1166($0_1, $6_1, $1_1, $4_1); $2_1 = HEAPU16[$1_1 + 10 >> 1]; } HEAP16[$1_1 + 10 >> 1] = $2_1 & 65151; break block2; } if (HEAPU8[$1_1 + 5 | 0] != 69) { break block2 } $326($7_1, 81, $4_1, $2_1); $858($7_1, 87, $2_1); break block35; } $5_1 = $5_1 - 1 | 0; break block48; } $3 = HEAP32[$0_1 + 80 >> 2]; if (!$3) { break block48 } $4_1 = HEAP16[$1_1 + 32 >> 1]; while (1) { if (!$3) { break block48 } if (($4_1 | 0) != HEAP32[$3 + 12 >> 2] | HEAP32[$3 + 4 >> 2] != ($5_1 | 0)) { $3 = HEAP32[$3 + 20 >> 2]; continue; } else { $6_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$3 + 16 | 0]) { $12_1 = $858($6_1, 20, HEAP32[$3 + 8 >> 2]) } $4_1 = $1129($0_1, HEAP32[$3 >> 2], $2_1); $859(HEAP32[$0_1 + 8 >> 2], 96, $4_1, 1, 0, $3 + 17 | 0, 1); if ($12_1) { $3 = HEAP32[$6_1 + 108 >> 2]; block53 : { if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { HEAP32[20687] = $3; $6_1 = 82740; break block53; } $6_1 = HEAP32[$6_1 + 104 >> 2] + Math_imul($12_1, 20) | 0; HEAP32[$6_1 + 8 >> 2] = $3; } HEAP32[$6_1 + 12 >> 2] = $4_1; } if ($4_1) { break block2 } break block48; } }; } if (!(HEAP32[$0_1 + 136 >> 2] | HEAPU8[$0_1 + 18 | 0])) { $4_1 = 0; $257($0_1, 11614, 0); break block2; } block56 : { switch (HEAPU8[$1_1 + 1 | 0] - 2 | 0) { case 2: $326($7_1, 70, 0, 4); break block39; case 0: $5_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($5_1 ? $5_1 : $0_1) + 21 | 0] = 1; break; default: break block56; }; } $5_1 = $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 60 | 0); $835($7_1, 70, HEAP32[$0_1 + 136 >> 2] ? 1811 : 1, HEAP8[$1_1 + 1 | 0], $5_1); break block39; } $9_1 = HEAP32[$1_1 + 20 >> 2]; $6_1 = HEAP32[$9_1 >> 2]; $10_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $10_1; $4_1 = HEAP32[$0_1 >> 2]; $3 = 0; $12_1 = HEAP32[$1_1 + 12 >> 2]; if ($12_1) { $14 = $906($4_1, $12_1, 0); if (HEAPU8[$4_1 + 87 | 0]) { $11($4_1, $14); break block39; } $1064($14, $1168($0_1, $14, $8_1 + 60 | 0)); $5_1 = $8_1 + 72 | 0; wasm2js_memory_fill($5_1, 0, 52); HEAP32[$8_1 + 84 >> 2] = $14; HEAP8[$8_1 + 72 | 0] = 54; HEAP32[$8_1 + 60 >> 2] = 0; } $9_1 = $9_1 + 8 | 0; $11_1 = $6_1 - 1 | 0; while (1) { if (($3 | 0) < ($11_1 | 0)) { $13_1 = $9_1 + ($3 << 4) | 0; $1_1 = HEAP32[$13_1 >> 2]; block63 : { if (!$12_1) { $5_1 = $1_1; break block63; } HEAP32[$8_1 + 88 >> 2] = $1_1; } $1_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $1_1; $1059($0_1, $5_1, $1_1, 16); $862($0_1, HEAP32[$13_1 + 16 >> 2], $2_1); $863($7_1, $10_1); $1013($7_1, $1_1); $3 = $3 + 2 | 0; continue; } break; }; block65 : { if ($6_1 & 1) { $862($0_1, HEAP32[$9_1 + ($11_1 << 4) >> 2], $2_1); break block65; } $326($7_1, 75, 0, $2_1); } $11($4_1, $14); $1169($7_1); $1013($7_1, $10_1); break block39; } $3 = HEAPU8[$0_1 + 23 | 0]; block66 : { $5_1 = HEAP32[$1_1 + 40 >> 2]; if (!$5_1) { break block66 } $4_1 = HEAP32[$5_1 + 12 >> 2] + HEAP16[$1_1 + 34 >> 1] | 0; if (!HEAPU8[$5_1 | 0]) { break block68 } if (!HEAPU8[$5_1 + 1 | 0]) { break block66 } $835($7_1, 94, HEAP32[$5_1 + 8 >> 2], HEAP16[(HEAP32[$5_1 + 20 >> 2] + (HEAP16[$1_1 + 34 >> 1] << 4) | 0) + 14 >> 1], $2_1); break block39; } $5_1 = $835($7_1, 20, HEAP32[$1_1 + 28 >> 2], 0, $2_1); HEAP8[$0_1 + 23 | 0] = 0; $862($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); HEAP8[$0_1 + 23 | 0] = $3; HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$7_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = HEAP32[$7_1 + 108 >> 2]; break block39; } $257($0_1, 15733, 0); break block39; } $5_1 = HEAP32[$1_1 + 44 >> 2]; $3 = HEAP16[$1_1 + 32 >> 1]; $326($7_1, 157, ($1111($5_1, $3) + Math_imul(HEAP32[$1_1 + 28 >> 2], HEAP16[$5_1 + 34 >> 1] + 1 | 0) | 0) + 1 | 0, $2_1); if (HEAPU8[(HEAP32[$5_1 + 4 >> 2] + Math_imul($3, 12) | 0) + 5 | 0] != 69 | ($3 | 0) < 0) { break block39 } $858($7_1, 87, $2_1); break block39; } if (HEAPU8[$1_1 + 5 | 0] & 2) { break block18 } $862($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); $858($7_1, 180, $2_1); break block35; } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; } break; }; $1170($0_1, $1_1, $2_1, 0, 0); break block35; } $3 = HEAP32[$0_1 + 60 >> 2]; $5_1 = $3 - 2 | 0; HEAP32[$0_1 + 60 >> 2] = $5_1; $326($7_1, 75, 0, $2_1); $4_1 = $0_1; $0_1 = $3 - 1 | 0; $1171($4_1, $1_1, $0_1, $5_1); $326($7_1, 71, 1, $2_1); $1013($7_1, $0_1); $326($7_1, 86, $2_1, 0); $1013($7_1, $5_1); break block35; } $2_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$2_1 + 28 >> 2]; if (!(!!$3 & HEAPU8[$0_1 + 26 | 0] <= HEAPU8[$2_1 + 2 | 0])) { $3 = $1172($0_1, $2_1); HEAP32[$2_1 + 28 >> 2] = $3; HEAP8[$2_1 + 2 | 0] = HEAPU8[$0_1 + 26 | 0]; } $5_1 = HEAP32[$1_1 + 28 >> 2]; $4_1 = $1119($2_1); if (($5_1 | 0) != ($4_1 | 0)) { HEAP32[$8_1 + 52 >> 2] = $4_1; HEAP32[$8_1 + 48 >> 2] = $5_1; $257($0_1, 5330, $8_1 + 48 | 0); $3 = HEAP32[$2_1 + 28 >> 2]; } $4_1 = $3 + HEAP16[$1_1 + 32 >> 1] | 0; break block2; } $4_1 = 0; if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { break block2 } block74 : { if (!(!(HEAPU8[$1_1 + 5 | 0] & 16) | ($3 | 0) != 139)) { $5_1 = HEAP32[HEAP32[HEAP32[$1_1 + 20 >> 2] + 28 >> 2] >> 2]; if (($5_1 | 0) != 1) { break block74 } } $4_1 = $1172($0_1, $1_1); break block2; } $1173($0_1, $5_1, 1); break block39; } if (HEAP8[$1_1 + 7 | 0] & 1) { $4_1 = HEAP32[HEAP32[$1_1 + 44 >> 2] + 56 >> 2]; break block2; } $9_1 = HEAP32[$0_1 >> 2]; $3 = HEAPU8[$9_1 + 84 | 0]; block76 : { if (!HEAPU8[$0_1 + 23 | 0]) { break block76 } if (!$1174($0_1, $1_1)) { break block76 } $4_1 = $1175($0_1, $1_1, -1); break block2; } $6_1 = HEAP32[$1_1 + 20 >> 2]; if ($6_1) { $10_1 = HEAP32[$6_1 >> 2] } block105 : { block102 : { block101 : { $4_1 = $390($9_1, HEAP32[$1_1 + 8 >> 2], $10_1, $3, 0); if (!(!$4_1 | HEAP32[$4_1 + 20 >> 2])) { $3 = HEAP32[$4_1 + 4 >> 2]; if (!(!$6_1 | !($3 & 4194304))) { $5_1 = HEAP32[$0_1 + 8 >> 2]; block84 : { switch (HEAP32[$4_1 + 8 >> 2]) { case 0: $1_1 = HEAP32[$6_1 >> 2]; $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; $862($0_1, HEAP32[$6_1 + 8 >> 2], $2_1); $4_1 = ($1_1 | 0) <= 1 ? 1 : $1_1; $6_1 = $6_1 + 8 | 0; $1_1 = 1; while (1) { if (($1_1 | 0) != ($4_1 | 0)) { $326($5_1, 52, $2_1, $3); $862($0_1, HEAP32[$6_1 + ($1_1 << 4) >> 2], $2_1); $1_1 = $1_1 + 1 | 0; continue; } break; }; $1169($5_1); $1013($5_1, $3); break block35; case 5: $1_1 = $8_1 + 72 | 0; wasm2js_memory_fill($1_1, 0, 52); HEAP32[$8_1 + 92 >> 2] = $6_1; HEAP8[$8_1 + 72 | 0] = 158; $4_1 = $1129($0_1, $1_1, $2_1); break block2; default: $4_1 = $1129($0_1, HEAP32[$6_1 + 8 >> 2], $2_1); break block2; case 3: $326($5_1, 71, $1121(0, HEAP32[$6_1 + 8 >> 2], HEAP32[$6_1 + 24 >> 2], -1), $2_1); break block35; case 2: $326($5_1, 71, $1176($0_1, HEAP32[$6_1 + 8 >> 2], HEAP32[$6_1 + 24 >> 2], -1), $2_1); break block35; case 1: $0_1 = HEAP32[$6_1 + 24 >> 2]; if (HEAPU8[$0_1 | 0] == 168) { $326($5_1, 71, $1030(HEAP32[$6_1 + 8 >> 2], HEAP32[$0_1 + 28 >> 2], 1), $2_1); break block35; } $326($5_1, 75, 0, $2_1); break block35; case 4: break block84; }; } $0_1 = $971(HEAP32[$6_1 + 8 >> 2]); if (($0_1 | 0) >= 65) { $0_1 = HEAP32[($0_1 << 2) + 50380 >> 2] } else { $0_1 = 13940 } $861($5_1, $2_1, $0_1); break block35; } if ($3 & 2621440) { $1177($0_1, $1_1, $4_1) } $11_1 = ($10_1 | 0) > 0 ? $10_1 : 0; $12_1 = $6_1 + 8 | 0; $3 = 0; while (1) { if (($3 | 0) != ($11_1 | 0)) { block93 : { if ($3 >>> 0 > 31) { break block93 } if (!$944($0_1, HEAP32[($3 << 4) + $12_1 >> 2])) { break block93 } $14 = 1 << $3 | $14; } if (!($5_1 | !(HEAPU8[$4_1 + 4 | 0] & 32))) { $5_1 = $851($0_1, HEAP32[($3 << 4) + $12_1 >> 2]) } $3 = $3 + 1 | 0; continue; } break; }; block96 : { if (!$6_1) { $11_1 = 0; break block96; } block98 : { if ($14) { $3 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $3 + $10_1; $11_1 = $3 + 1 | 0; break block98; } $11_1 = $1060($0_1, $10_1); } $3 = HEAP32[$4_1 + 4 >> 2] & 192; block99 : { if (!$3) { break block99 } $13_1 = HEAP32[$12_1 >> 2]; if ((HEAPU8[$13_1 | 0] & 253) != 168) { break block99 } HEAP8[$13_1 + 2 | 0] = $3; } $976($0_1, $6_1, $11_1, 0, 2); } if (($10_1 | 0) >= 2) { $12_1 = HEAP8[$1_1 + 5 | 0] & 1 ? $6_1 + 24 | 0 : $12_1; break block101; } if (($10_1 | 0) == 1) { break block101 } break block102; } HEAP32[$8_1 + 32 >> 2] = $1_1; $257($0_1, 27026, $8_1 + 32 | 0); break block39; } $3 = HEAP32[$12_1 >> 2]; HEAP32[$8_1 + 72 >> 2] = 0; HEAP32[$8_1 + 124 >> 2] = 0; if (!$3 | HEAPU8[$3 | 0] != 168) { break block102 } $3 = HEAP32[$3 + 44 >> 2]; if (!$3 | HEAPU8[$3 + 43 | 0] != 1) { break block102 } $3 = HEAP32[$684($9_1, $3) + 8 >> 2]; $6_1 = HEAP32[HEAP32[$3 >> 2] + 72 >> 2]; if (!$6_1) { break block102 } if (!(FUNCTION_TABLE[$6_1 | 0]($3, $10_1, HEAP32[$4_1 + 32 >> 2], $8_1 + 72 | 0, $8_1 + 124 | 0) | 0)) { break block102 } $3 = $270($9_1, $48(HEAP32[$4_1 + 32 >> 2]) + 41 | 0, 0); if (!$3) { break block102 } wasm2js_memory_copy($3, $4_1, 40); $6_1 = $3 + 40 | 0; HEAP32[$3 + 32 >> 2] = $6_1; $4_1 = HEAP32[$4_1 + 32 >> 2]; $12_1 = $48($4_1) + 1 | 0; if ($12_1) { wasm2js_memory_copy($6_1, $4_1, $12_1) } HEAP32[$3 + 16 >> 2] = HEAP32[$8_1 + 72 >> 2]; HEAP32[$3 + 8 >> 2] = HEAP32[$8_1 + 124 >> 2]; HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] | 16; break block105; } $3 = $4_1; } if (HEAPU8[$3 + 4 | 0] & 32) { $859($7_1, 85, 0, 0, 0, $5_1 ? $5_1 : HEAP32[$9_1 + 8 >> 2], -2) } $1178($0_1, $14, $11_1, $2_1, $10_1, $3, HEAPU8[$1_1 + 2 | 0]); if ($14 | !$10_1) { break block35 } $1061($0_1, $11_1, $10_1); break block35; } block109 : { $5_1 = HEAP32[$1_1 + 40 >> 2]; block108 : { if (!$5_1) { break block108 } $3 = HEAP16[$1_1 + 34 >> 1]; if (($3 | 0) < 0) { break block108 } if (($3 | 0) < HEAP32[$5_1 + 36 >> 2]) { break block109 } } HEAP32[$8_1 + 16 >> 2] = $1_1; $257($0_1, 27050, $8_1 + 16 | 0); break block39; } $4_1 = HEAP32[$5_1 + 24 >> 2] + ($3 + HEAP32[$5_1 + 12 >> 2] | 0) | 0; break block2; } $326($7_1, 71, 1, $2_1); $1_1 = $858($7_1, $3, $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 60 | 0)); $326($7_1, 71, 0, $2_1); HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$7_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = HEAP32[$7_1 + 108 >> 2]; break block39; } $4_1 = $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 60 | 0); $5_1 = $1179(HEAP32[$1_1 + 16 >> 2]); $312($7_1, 91, $4_1, $2_1, $5_1 ^ 1, $5_1 ^ HEAPU8[$1_1 + 2 | 0] == 45); break block39; } $326($7_1, $3, $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 60 | 0), $2_1); break block39; } block112 : { block111 : { block113 : { $5_1 = HEAP32[$1_1 + 12 >> 2]; switch (HEAPU8[$5_1 | 0] - 154 | 0) { case 0: break block111; case 2: break block113; default: break block112; }; } $1180($0_1, $5_1, 1, $2_1); break block35; } $1181($7_1, HEAP32[$5_1 + 8 >> 2], 1, $2_1); break block35; } HEAP32[$8_1 + 76 >> 2] = 67584; HEAP32[$8_1 + 80 >> 2] = 0; HEAP8[$8_1 + 72 | 0] = 156; $5_1 = $1167($0_1, $8_1 + 72 | 0, $8_1 + 60 | 0); $835($7_1, 108, $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 56 | 0), $5_1, $2_1); break block39; } $5_1 = $1167($0_1, HEAP32[$1_1 + 12 >> 2], $8_1 + 60 | 0); $835($7_1, $3, $1167($0_1, HEAP32[$1_1 + 16 >> 2], $8_1 + 56 | 0), $5_1, $2_1); break block39; } $17_1 = 1; $10_1 = 0; break block114; } $3 = ($3 | 0) == 45 ? 54 : 53; $12_1 = 128; $10_1 = 1; } $6_1 = HEAP32[$1_1 + 12 >> 2]; if ($1182($6_1)) { $9_1 = HEAP32[$1_1 + 16 >> 2]; $4_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = $1119($6_1); $7_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $7_1; if (HEAP32[$0_1 + 40 >> 2]) { break block39 } $1_1 = HEAP32[$1_1 + 4 >> 2]; if (($1119($9_1) | 0) != ($5_1 | 0)) { $257($0_1, 15733, 0); break block39; } $16_1 = $1_1 >>> 10 & 1; $18_1 = $1183($0_1, $6_1); $19_1 = $1183($0_1, $9_1); $326($4_1, 71, 1, $2_1); $10_1 = ($3 | 0) == 53 ? 54 : ($3 | 0) == 58 ? 55 : ($3 | 0) == 56 ? 57 : $3; $20_1 = $5_1 - 2 | 0; $14 = $5_1 - 1 | 0; $5_1 = 0; $1_1 = 0; while (1) { HEAP32[$8_1 + 72 >> 2] = 0; HEAP32[$8_1 + 124 >> 2] = 0; HEAP32[$8_1 + 68 >> 2] = 0; HEAP32[$8_1 + 64 >> 2] = 0; if ($5_1) { HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2] } $11_1 = $1184($0_1, $6_1, $1_1, $18_1, $8_1 + 68 | 0, $8_1 + 72 | 0); $13_1 = $1184($0_1, $9_1, $1_1, $19_1, $8_1 - -64 | 0, $8_1 + 124 | 0); $5_1 = HEAP32[$4_1 + 108 >> 2]; $15_1 = $10_1 & 255; $1185($0_1, HEAP32[$8_1 + 68 >> 2], HEAP32[$8_1 + 64 >> 2], $15_1, $11_1, $13_1, $7_1, $12_1, $16_1); $894($0_1, HEAP32[$8_1 + 72 >> 2]); $894($0_1, HEAP32[$8_1 + 124 >> 2]); block120 : { block119 : { switch ($15_1 - 55 | 0) { case 0: case 2: break block119; default: break block120; }; } if (($1_1 | 0) >= ($14 | 0)) { break block120 } $5_1 = $857($4_1, 59); } block122 : { if (!$17_1) { $326($4_1, 71, 0, $2_1); break block122; } $835($4_1, 92, $11_1, $2_1, $13_1); } if (($1_1 | 0) != ($14 | 0)) { block125 : { if (($15_1 | 0) == 54) { $326($4_1, 52, $2_1, $7_1); $10_1 = 54; break block125; } $326($4_1, 9, 0, $7_1); $10_1 = ($1_1 | 0) == ($20_1 | 0) ? $3 : $10_1; } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$4_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = HEAP32[$4_1 + 108 >> 2]; $1013($4_1, $7_1); if (($3 | 0) != 53) { break block39 } $326($4_1, 19, $2_1, $2_1); break block39; } $5_1 = $1167($0_1, $6_1, $8_1 + 60 | 0); $4_1 = $1167($0_1, HEAP32[$1_1 + 16 >> 2], $8_1 + 56 | 0); $326($7_1, 71, 1, $2_1); $1185($0_1, $6_1, HEAP32[$1_1 + 16 >> 2], $3, $5_1, $4_1, HEAP32[$7_1 + 108 >> 2] + 2 | 0, $12_1, HEAP32[$1_1 + 4 >> 2] >>> 10 & 1); if ($10_1) { $326($7_1, 71, 0, $2_1); break block39; } $835($7_1, 92, $5_1, $2_1, $4_1); } $4_1 = $2_1; } $894($0_1, HEAP32[$8_1 + 60 >> 2]); $894($0_1, HEAP32[$8_1 + 56 >> 2]); break block2; } $862($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); $326($7_1, 88, $2_1, $853(HEAP32[$1_1 + 8 >> 2], 0)); break block35; } $4_1 = HEAP32[$1_1 + 28 >> 2]; break block2; } $326($7_1, 78, HEAP16[$1_1 + 32 >> 1], $2_1); break block35; } $0_1 = HEAP32[$1_1 + 8 >> 2] + 2 | 0; $1_1 = $48($0_1) - 1 | 0; $859($7_1, 77, ($1_1 | 0) / 2 | 0, $2_1, 0, $854(HEAP32[$7_1 >> 2], $0_1, $1_1), -6); break block35; } $861($7_1, $2_1, HEAP32[$1_1 + 8 >> 2]); break block35; } $1181($7_1, HEAP32[$1_1 + 8 >> 2], 0, $2_1); break block35; } $326($7_1, 71, $1179($1_1), $2_1); break block35; } $1180($0_1, $1_1, 0, $2_1); break block35; } $3 = HEAPU8[$1_1 + 2 | 0]; $890(HEAP32[$0_1 + 8 >> 2], HEAP32[$1_1 + 44 >> 2], $5_1, HEAP16[$1_1 + 32 >> 1], $2_1); if (!$3) { break block35 } $1_1 = 82740; $0_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $1_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0) - 20 | 0 } $0_1 = HEAPU8[$1_1 | 0]; if (($0_1 | 0) != 176) { if (($0_1 | 0) != 94) { break block35 } HEAP16[$1_1 + 2 >> 1] = $3; break block35; } HEAP16[$1_1 + 2 >> 1] = $3 & 1; } $4_1 = $2_1; } $0_1 = $8_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1130($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 >> 2] = $1_1; $257($0_1, 26928, $2_1); $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1131($0_1, $1_1) { return !$1016($0_1, 81, $1_1); } function $1132($0_1, $1_1) { var $2_1 = 0; while (1) { if ($0_1) { $2_1 = HEAP32[$0_1 + 36 >> 2]; block1 : { if (!$2_1) { break block1 } $2_1 = HEAP32[$2_1 + 24 >> 2]; if (($2_1 | 0) <= HEAP32[$1_1 >> 2]) { break block1 } HEAP32[$1_1 >> 2] = $2_1; } $2_1 = HEAP32[$0_1 + 44 >> 2]; block2 : { if (!$2_1) { break block2 } $2_1 = HEAP32[$2_1 + 24 >> 2]; if (($2_1 | 0) <= HEAP32[$1_1 >> 2]) { break block2 } HEAP32[$1_1 >> 2] = $2_1; } $2_1 = HEAP32[$0_1 + 60 >> 2]; block3 : { if (!$2_1) { break block3 } $2_1 = HEAP32[$2_1 + 24 >> 2]; if (($2_1 | 0) <= HEAP32[$1_1 >> 2]) { break block3 } HEAP32[$1_1 >> 2] = $2_1; } $1133(HEAP32[$0_1 + 28 >> 2], $1_1); $1133(HEAP32[$0_1 + 40 >> 2], $1_1); $1133(HEAP32[$0_1 + 48 >> 2], $1_1); $0_1 = HEAP32[$0_1 + 52 >> 2]; continue; } break; }; } function $1133($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!$0_1) { break block } $4_1 = $0_1 + 8 | 0; while (1) { if (HEAP32[$0_1 >> 2] <= ($3 | 0)) { break block } $2_1 = HEAP32[($3 << 4) + $4_1 >> 2]; block1 : { if (!$2_1) { break block1 } $2_1 = HEAP32[$2_1 + 24 >> 2]; if (($2_1 | 0) <= HEAP32[$1_1 >> 2]) { break block1 } HEAP32[$1_1 >> 2] = $2_1; } $3 = $3 + 1 | 0; continue; }; } } function $1134($0_1, $1_1) { var $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 >> 2]; $2_1 = HEAPU16[$0_1 + 146 >> 1]; if ($2_1) { $15(HEAP32[$0_1 + 116 >> 2], $2_1 << 1); $10($3, HEAP32[$0_1 + 116 >> 2]); } HEAP16[$0_1 + 144 >> 1] = $1_1; HEAP16[$0_1 + 146 >> 1] = $1_1; $2_1 = $0_1; $0_1 = $325($3, Math_imul($1_1, 80), 0); HEAP32[$2_1 + 116 >> 2] = $0_1; if ($0_1) { $332($0_1, $1_1 << 1, $3, 1) } } function $1135($0_1, $1_1, $2_1, $3, $4_1) { if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $111((HEAP32[$0_1 + 116 >> 2] + Math_imul($1_1, 40) | 0) + Math_imul(Math_imul(HEAPU16[$0_1 + 146 >> 1], $2_1), 40) | 0, $3, -1, -1, 1, $4_1) } } function $1136($0_1, $1_1) { if ($1_1) { $861($0_1, 1, $1_1); $326($0_1, 84, 1, 1); } } function $1137($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAPU8[$1_1 + 7 | 0]; $1134($0_1, $2_1 ? $2_1 : 1); block1 : { if (!$2_1) { $1135($0_1, 0, 0, HEAP32[$1_1 >> 2], 0); break block1; } $3 = HEAPU8[$1_1 + 6 | 0]; $1_1 = 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block1 } $1135($0_1, $1_1, 0, HEAP32[($3 << 2) + 36416 >> 2], 0); $3 = $3 + 1 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } } function $1138($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 8 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = $2_1; $1189($0_1, 72, 1, $3 + 8 | 0, -13); $326($0_1, 84, 1, 1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1139($0_1, $1_1) { var $2_1 = 0; if (!$0_1) { return 0 } $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$0_1 >> 2]; $0_1 = HEAPU16[$2_1 + 24 >> 1]; if (($1_1 | 0) >= 0) { $0_1 = $0_1 & -13 | $1_1 << 2; HEAP16[$2_1 + 24 >> 1] = $0_1; } return $0_1 >>> 2 & 3; } function $1140($0_1, $1_1) { var $2_1 = 0; block : { if (HEAPU8[$0_1 + 12 | 0] | ($1_1 | 0) < 0) { break block } $2_1 = HEAP32[$0_1 + 232 >> 2]; if (!!$2_1 & HEAPU8[$2_1 + 43 | 0] == 2) { break block } HEAP8[$0_1 + 4 | 0] = $1_1; } return HEAPU8[$0_1 + 4 | 0]; } function $1141($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; block : { if (!HEAPU8[$0_1 + 85 | 0]) { break block } $2_1 = HEAP32[$0_1 + 20 >> 2]; $1_1 = HEAP32[$0_1 + 16 >> 2]; while (1) { if (($2_1 | 0) <= 0) { break block } $3 = HEAP32[$1_1 + 4 >> 2]; if ($3) { $785($3, HEAPU8[$1_1 + 8 | 0] | HEAP32[$0_1 + 32 >> 2] & 56) } $2_1 = $2_1 - 1 | 0; $1_1 = $1_1 + 16 | 0; continue; }; } } function $1142($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[HEAP32[$1_1 + 16 >> 2] + 20 >> 2]; if (!$2_1) { return 0 } if (!HEAPU8[$1_1 + 85 | 0] | HEAPU8[$2_1 + 8 | 0]) { $257($0_1, 10663, 0); return 1; } $195($2_1); HEAP32[HEAP32[$1_1 + 16 >> 2] + 20 >> 2] = 0; $148($1_1); return 0; } function $1143($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 + 12 >> 2] = $3; $3 = 0; while (1) { $4_1 = HEAPU8[$2_1 + $3 | 0]; block3 : { if (($4_1 | 0) != 105) { if (($4_1 | 0) != 115) { if (!$4_1) { $326($0_1, 84, $1_1, $3) } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return; } $4_1 = HEAP32[$5_1 + 12 >> 2]; HEAP32[$5_1 + 12 >> 2] = $4_1 + 4; $4_1 = HEAP32[$4_1 >> 2]; $859($0_1, $4_1 ? 118 : 75, 0, $1_1 + $3 | 0, 0, $4_1, 0); break block3; } $4_1 = HEAP32[$5_1 + 12 >> 2]; HEAP32[$5_1 + 12 >> 2] = $4_1 + 4; $326($0_1, 71, HEAP32[$4_1 >> 2], $1_1 + $3 | 0); } $3 = $3 + 1 | 0; continue; }; } function $1145($0_1) { var $1_1 = 0; $326($0_1, 84, 3, 1); $1_1 = $835($0_1, 50, 1, HEAP32[$0_1 + 108 >> 2] + 2 | 0, 1); $857($0_1, 70); return $1_1; } function $1146($0_1, $1_1) { var $2_1 = 0; $2_1 = 82740; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $2_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0) - 20 | 0 } if (!(HEAP32[$2_1 + 12 >> 2] != ($1_1 | 0) | HEAPU8[$2_1 | 0] != 94)) { HEAP16[$2_1 + 2 >> 1] = HEAPU16[$2_1 + 2 >> 1] | 128 } } function $1147($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = HEAP16[HEAP32[$1_1 + 4 >> 2] + ($3 << 1) >> 1]; if (($5_1 | 0) == -2) { HEAP32[$0_1 + 56 >> 2] = $2_1 + 1; $1188($0_1, HEAP32[(HEAP32[$1_1 + 40 >> 2] + ($3 << 4) | 0) + 8 >> 2], $4_1); HEAP32[$0_1 + 56 >> 2] = 0; return; } $890(HEAP32[$0_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2], $2_1, $5_1, $4_1); } function $1148($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$7_1 + 12 >> 2] = 0; if (!(!$1_1 | !$5_1)) { block11 : { block3 : { block5 : { block4 : { block6 : { block7 : { block2 : { block10 : { block9 : { block1 : { block8 : { $4_1 = HEAPU8[$1_1 | 0]; switch ($4_1 - 43 | 0) { case 0: case 1: break block1; case 2: case 3: break block2; case 4: case 5: break block3; case 6: break block4; case 7: break block5; case 8: case 9: break block6; case 10: case 11: case 12: case 13: case 14: case 15: break block7; default: break block8; }; } if (($4_1 | 0) == 19) { break block9 } if (($4_1 | 0) != 175) { break block3 } $4_1 = 0; $6_1 = HEAPU8[$1_1 + 2 | 0] == 46; $3 = $6_1 ? 16 : 0; $5_1 = HEAP32[$1_1 + 12 >> 2]; if (($1179(HEAP32[$1_1 + 16 >> 2]) | 0) == ($6_1 | 0)) { break block10 } $1148($0_1, $5_1, $2_1, $3); break block11; } $6_1 = $1197($1_1); if (($1_1 | 0) != ($6_1 | 0)) { $1148($0_1, $6_1, $2_1, $3); $4_1 = 0; break block11; } if (($4_1 | 0) == 44) { $4_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $4_1; $1059($0_1, HEAP32[$1_1 + 12 >> 2], $4_1, $3 ^ 16); $1148($0_1, HEAP32[$1_1 + 16 >> 2], $2_1, $3); $1013($5_1, $4_1); $4_1 = 0; break block11; } $1148($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3); $1148($0_1, HEAP32[$1_1 + 16 >> 2], $2_1, $3); $4_1 = 0; break block11; } $1059($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3); $4_1 = 0; break block11; } $1059($0_1, $5_1, $2_1, $3); break block11; } $4_1 = ($4_1 | 0) == 45 ? 54 : 53; $3 = 128; } $6_1 = HEAP32[$1_1 + 12 >> 2]; if ($1182($6_1)) { break block3 } $5_1 = $1167($0_1, $6_1, $7_1 + 12 | 0); $6_1 = $1167($0_1, HEAP32[$1_1 + 16 >> 2], $7_1 + 8 | 0); $1185($0_1, HEAP32[$1_1 + 12 >> 2], HEAP32[$1_1 + 16 >> 2], $4_1, $5_1, $6_1, $2_1, $3, HEAP32[$1_1 + 4 >> 2] >>> 10 & 1); $4_1 = HEAP32[$7_1 + 8 >> 2]; break block11; } $1_1 = $1167($0_1, HEAP32[$1_1 + 12 >> 2], $7_1 + 12 | 0); $1146($5_1, $1_1); $326($5_1, $4_1, $1_1, $2_1); $4_1 = 0; break block11; } $1170($0_1, $1_1, $2_1, 82, $3); $4_1 = 0; break block11; } $4_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $4_1; $1171($0_1, $1_1, $4_1, $3 ? $2_1 : $4_1); $863($5_1, $2_1); $1013($5_1, $4_1); $4_1 = 0; break block11; } $6_1 = HEAP32[$1_1 + 4 >> 2]; if (($6_1 & 268435457) == 268435456) { $863($5_1, $2_1); $4_1 = 0; break block11; } $4_1 = 0; if (($6_1 & 536870913) == 536870912) { break block11 } $835($5_1, 16, $1167($0_1, $1_1, $7_1 + 12 | 0), $2_1, ($3 | 0) != 0); } $894($0_1, HEAP32[$7_1 + 12 >> 2]); $894($0_1, $4_1); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1149($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0; $9_1 = HEAP32[$0_1 + 8 >> 2]; block : { if (!$5_1) { break block } $8_1 = HEAP32[$1_1 + 36 >> 2]; if ($8_1) { $6_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $6_1; HEAP32[$5_1 >> 2] = $6_1; HEAP32[$0_1 + 56 >> 2] = $2_1 + 1; $1263($0_1, $8_1, HEAP32[$5_1 >> 2]); $6_1 = 0; HEAP32[$0_1 + 56 >> 2] = 0; break block; } HEAP32[$5_1 >> 2] = 0; } block3 : { if ($4_1) { $4_1 = 50; if (HEAPU8[$1_1 + 55 | 0] & 8) { break block3 } } $4_1 = 52; } $8_1 = HEAPU16[$4_1 + $1_1 >> 1]; $4_1 = $1060($0_1, $8_1); $5_1 = 0; block4 : { if (!$6_1) { break block4 } if (($4_1 | 0) == ($7_1 | 0)) { $5_1 = $6_1; if (!HEAP32[$6_1 + 36 >> 2]) { break block4 } } $5_1 = 0; } $6_1 = 0; while (1) { if (!(($6_1 | 0) == ($8_1 | 0))) { block8 : { block7 : { if (!$5_1) { break block7 } $7_1 = $6_1 << 1; $10_1 = HEAPU16[$7_1 + HEAP32[$5_1 + 4 >> 2] >> 1]; if (($10_1 | 0) == 65534) { break block7 } if (($10_1 | 0) == HEAPU16[$7_1 + HEAP32[$1_1 + 4 >> 2] >> 1]) { break block8 } } $1147($0_1, $1_1, $2_1, $6_1, $4_1 + $6_1 | 0); if (HEAP16[HEAP32[$1_1 + 4 >> 2] + ($6_1 << 1) >> 1] < 0) { break block8 } $7_1 = HEAP32[$9_1 + 108 >> 2]; if (($7_1 | 0) <= 0) { break block8 } $7_1 = $7_1 - 1 | 0; if (HEAPU8[HEAP32[$9_1 + 104 >> 2] + Math_imul($7_1, 20) | 0] != 87) { break block8 } $1045($9_1, $7_1); } $6_1 = $6_1 + 1 | 0; continue; } break; }; if ($3) { $835($9_1, 97, $4_1, $8_1, $3) } $1061($0_1, $4_1, $8_1); return $4_1; } function $1150($0_1, $1_1) { if ($1_1) { $1013(HEAP32[$0_1 + 8 >> 2], $1_1) } } function $1151($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $2_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($2_1, 12) | 0; block : { if (!HEAPU16[$2_1 + 8 >> 1]) { break block } HEAP32[$4_1 + 12 >> 2] = 0; $5_1 = HEAP32[$0_1 >> 2]; $371($5_1, $891($1_1, $2_1), HEAPU8[$5_1 + 84 | 0], HEAPU8[$2_1 + 5 | 0], $4_1 + 12 | 0); $5_1 = HEAP32[$4_1 + 12 >> 2]; if (!$5_1) { break block } $1043($0_1, $5_1, -10); } if (!(HEAPU8[$1_1 + 43 | 0] == 1 | HEAPU8[$2_1 + 5 | 0] != 69)) { $858($0_1, 87, $3) } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1152($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $3 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; $5_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; block1 : { if (($209(HEAP32[$2_1 >> 2]) | 0) > HEAP32[$5_1 + 152 >> 2]) { $235($0_1, 1484, -1); break block1; } block5 : { if (($1_1 | 0) == 3) { $1_1 = $53(HEAP32[$2_1 + 8 >> 2]); HEAP32[$4_1 + 8 >> 2] = $1_1; if (!$1_1) { break block1 } if (($353($1_1) | 0) != 1) { $235($0_1, 9429, -1); break block1; } $1_1 = $345($4_1 + 8 | 0); if (($1_1 | 0) != HEAPU8[$3 | 0] & HEAPU8[$3 + 1 | 0] != ($1_1 | 0)) { break block5 } $3 = HEAPU8[$3 | 0] | HEAPU8[$3 + 1 | 0] << 8 | (HEAPU8[$3 + 2 | 0] << 16 | HEAPU8[$3 + 3 | 0] << 24); HEAP32[$4_1 + 12 >> 2] = $3; $5_1 = $3 >>> 8 | 0; if (($1_1 | 0) == ($3 & 255)) { HEAP8[$4_1 + 12 | 0] = 0 } $3 = $4_1 + 12 | 0; if (($5_1 & 255) != ($1_1 | 0)) { break block5 } HEAP8[$4_1 + 13 | 0] = 0; break block5; } $1_1 = HEAPU8[$3 + 2 | 0]; } $5_1 = $53(HEAP32[$2_1 >> 2]); $2_1 = $53(HEAP32[$2_1 + 4 >> 2]); if (!$2_1 | !$5_1) { break block1 } $238($0_1, !$344($5_1, $2_1, $3, $1_1)); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1153($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $8_1 = global$0 - 16 | 0; $7_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $7_1; $12_1 = HEAP32[$2_1 + 40 >> 2]; block3 : { block5 : { $9_1 = HEAP32[$2_1 + 20 >> 2]; block2 : { block1 : { if (($9_1 | 0) == 1) { $4_1 = HEAP16[$1_1 + 32 >> 1]; if (($4_1 | 0) < 0) { break block1 } if (!$12_1) { break block2 } if ($67(HEAP32[HEAP32[$1_1 + 4 >> 2] + Math_imul($4_1, 12) >> 2], $12_1)) { break block1 } break block3; } if (!$4_1) { break block1 } $5_1 = $325(HEAP32[$0_1 >> 2], $9_1 << 2, 0); if (!$5_1) { break block5 } HEAP32[$4_1 >> 2] = $5_1; } $14 = $2_1 + 36 | 0; $13_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $4_1 = $1_1 + 8 | 0; while (1) { block13 : { block7 : { block10 : { block8 : { $6_1 = HEAP32[$4_1 >> 2]; if ($6_1) { if (HEAP32[$6_1 + 36 >> 2] | (!HEAPU8[$6_1 + 54 | 0] | HEAPU16[$6_1 + 50 >> 1] != ($9_1 | 0))) { break block7 } if (!$12_1) { break block8 } $7_1 = 0; while (1) { if (($7_1 | 0) == ($13_1 | 0)) { $7_1 = $13_1; break block10; } $4_1 = HEAP16[HEAP32[$6_1 + 4 >> 2] + ($7_1 << 1) >> 1]; if (($4_1 | 0) < 0) { break block10 } $15_1 = $7_1 << 2; $10_1 = HEAP32[$15_1 + HEAP32[$6_1 + 32 >> 2] >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($4_1, 12) | 0; $11_1 = $419($4_1); if ($67($10_1, $11_1 ? $11_1 : 33712)) { break block10 } $11_1 = HEAP32[$4_1 >> 2]; $4_1 = 0; while (1) { if (($4_1 | 0) == ($9_1 | 0)) { break block10 } $10_1 = $4_1 << 3; $4_1 = $4_1 + 1 | 0; $10_1 = $10_1 + $14 | 0; if ($67(HEAP32[$10_1 + 4 >> 2], $11_1)) { continue } break; }; if ($5_1) { HEAP32[$5_1 + $15_1 >> 2] = HEAP32[$10_1 >> 2] } $7_1 = $7_1 + 1 | 0; continue; }; } if (!HEAPU8[$0_1 + 165 | 0]) { $1_1 = HEAP32[HEAP32[$2_1 >> 2] >> 2]; HEAP32[$8_1 + 4 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP32[$8_1 >> 2] = $1_1; $257($0_1, 29364, $8_1); } $10(HEAP32[$0_1 >> 2], $5_1); break block5; } if (((HEAPU8[$6_1 + 55 | 0] | HEAPU8[$6_1 + 56 | 0] << 8) & 3) != 2) { break block7 } if (!$5_1) { break block13 } $4_1 = 0; while (1) { if (($4_1 | 0) == ($13_1 | 0)) { break block13 } HEAP32[($4_1 << 2) + $5_1 >> 2] = HEAP32[($4_1 << 3) + $14 >> 2]; $4_1 = $4_1 + 1 | 0; continue; }; } if (($7_1 | 0) == ($9_1 | 0)) { break block13 } } $4_1 = $6_1 + 20 | 0; continue; } break; }; HEAP32[$3 >> 2] = $6_1; } $5_1 = 0; break block3; } $5_1 = 1; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1154($0_1) { var $1_1 = 0; $1_1 = 20063; $0_1 = $0_1 - 7 & 255; if ($0_1 >>> 0 <= 3) { $1_1 = HEAP32[($0_1 << 2) + 57892 >> 2] } return $1_1; } function $1155($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $7_1 = $3 ? -1 : 3934208; $8_1 = $4_1 + 16 | 0; $9_1 = $4_1 + 20 | 0; while (1) { if ($1_1) { block1 : { if (!HEAP32[$1_1 + 16 >> 2]) { break block1 } $5_1 = HEAP32[$1_1 + 4 >> 2]; if (!($5_1 & 262144 ? $3 : 1)) { break block1 } $6_1 = 1859; $6_1 = HEAP32[$1_1 + 24 >> 2] ? $6_1 : HEAP32[$1_1 + 20 >> 2] ? 18313 : 8933; $10_1 = HEAP32[$1_1 + 32 >> 2]; HEAP32[$8_1 >> 2] = HEAP16[$1_1 >> 1]; HEAP32[$9_1 >> 2] = $5_1 & $7_1 ^ 2097152; HEAP32[$4_1 + 8 >> 2] = $6_1; HEAP32[$4_1 + 4 >> 2] = $2_1; HEAP32[$4_1 >> 2] = $10_1; HEAP32[$4_1 + 12 >> 2] = HEAP32[(($5_1 & 3) << 2) + 51552 >> 2]; $1143($0_1, 1, 12244, $4_1); } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; } break; }; $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1156($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$4_1 + 16 >> 2]; while (1) { if (!(HEAP32[$4_1 + 20 >> 2] <= ($5_1 | 0))) { $2_1 = HEAP32[$3 + 12 >> 2] + 16 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $1157($0_1, HEAP32[$2_1 + 8 >> 2], $1_1); continue; } break; }; $3 = $3 + 16 | 0; $5_1 = $5_1 + 1 | 0; continue; } break; }; } function $1157($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (HEAPU8[$1_1 + 43 | 0] == 1) { break block } $3 = $1_1 + 8 | 0; while (1) { $4_1 = HEAP32[$3 >> 2]; if (!$4_1) { break block } block2 : { block1 : { if (!$2_1) { break block1 } $5_1 = HEAPU16[$4_1 + 52 >> 1]; $3 = 0; while (1) { if (($3 | 0) == ($5_1 | 0)) { break block2 } if (HEAP16[HEAP32[$4_1 + 4 >> 2] + ($3 << 1) >> 1] >= 0) { if (!$67(HEAP32[HEAP32[$4_1 + 32 >> 2] + ($3 << 2) >> 2], $2_1)) { break block1 } } $3 = $3 + 1 | 0; continue; }; } $923($0_1, 0, $309(HEAP32[$0_1 >> 2], HEAP32[$1_1 + 60 >> 2])); $1010($0_1, $4_1, -1); } $3 = $4_1 + 20 | 0; continue; }; } } function $1158($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[(HEAP32[HEAP32[$0_1 >> 2] + 16 >> 2] + ($1_1 << 4) | 0) + 12 >> 2]; $923($0_1, 0, $1_1); $3 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $3 + 3; $1397($0_1, $1_1, $3, 0, 0); $2_1 = $2_1 + 16 | 0; $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; $5_1 = HEAP32[$0_1 + 44 >> 2]; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $1398($0_1, HEAP32[$2_1 + 8 >> 2], 0, $3, $4_1, $5_1); continue; } break; }; $1399($0_1, $1_1); } function $1159($0_1, $1_1) { var $2_1 = 0; $1_1 = $875($0_1, $1_1); $2_1 = $92($0_1, $1_1); $10($0_1, $1_1); return $2_1; } function $1160($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = $309(HEAP32[$0_1 >> 2], HEAP32[$1_1 + 60 >> 2]); $923($0_1, 0, $3); $4_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $4_1 + 3; block1 : { if ($2_1) { $1397($0_1, $3, $4_1, HEAP32[$2_1 >> 2], 1597); break block1; } $1397($0_1, $3, $4_1, HEAP32[$1_1 >> 2], 11869); } $1398($0_1, $1_1, $2_1, $4_1, HEAP32[$0_1 + 48 >> 2] + 1 | 0, HEAP32[$0_1 + 44 >> 2]); $1399($0_1, $3); } function $1161($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $795($0_1, $1_1); } function $1162($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block1 : { while (1) { if ($1_1) { if (!$67(HEAP32[$1_1 >> 2], $2_1)) { break block1 } $1_1 = HEAP32[$1_1 + 36 >> 2]; continue; } break; }; HEAP32[$3 >> 2] = $2_1; $257($0_1, 7545, $3); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1163($0_1, $1_1) { if (!$944(0, $1_1)) { if (HEAPU8[$0_1 + 224 | 0] >= 2) { $1002($0_1, $1_1) } $11(HEAP32[$0_1 >> 2], $1_1); $1_1 = $951(HEAP32[$0_1 >> 2], 122, 0, 0); } return $1_1; } function $1166($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $6_1 = HEAP32[$0_1 + 40 >> 2]; $5_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = HEAP32[$0_1 + 56 >> 2]; if (($4_1 | 0) <= 0) { $4_1 = 0 } else { $4_1 = $835($5_1, 20, $4_1 - 1 | 0, 0, $3) } $1188($0_1, $891($1_1, $2_1), $3); if (HEAP8[$2_1 + 5 | 0] >= 66) { $859($5_1, 96, $3, 1, 0, $2_1 + 5 | 0, 1) } if ($4_1) { $1_1 = HEAP32[$5_1 + 108 >> 2]; $2_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $2_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) + 8 >> 2] = $1_1; } if (($6_1 | 0) < HEAP32[$0_1 + 40 >> 2]) { HEAP32[HEAP32[$0_1 >> 2] + 68 >> 2] = -1 } } function $1167($0_1, $1_1, $2_1) { var $3 = 0; $1_1 = $1063($1_1); block : { if (!HEAPU8[$0_1 + 23 | 0] | !$1_1 | HEAPU8[$1_1 | 0] == 176) { break block } if (!$1174($0_1, $1_1)) { break block } HEAP32[$2_1 >> 2] = 0; return $1175($0_1, $1_1, -1); } $3 = $1_1; $1_1 = $893($0_1); $3 = $1129($0_1, $3, $1_1); if (($1_1 | 0) != ($3 | 0)) { $894($0_1, $1_1); $1_1 = 0; } HEAP32[$2_1 >> 2] = $1_1; return $3; } function $1168($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = $1119($1_1); if (($3 | 0) == 1) { return $1167($0_1, $1_1, $2_1) } HEAP32[$2_1 >> 2] = 0; block2 : { if (HEAPU8[$1_1 | 0] == 139) { $2_1 = $1172($0_1, $1_1); break block2; } $2_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $2_1 + $3; $3 = ($3 | 0) > 0 ? $3 : 0; $2_1 = $2_1 + 1 | 0; while (1) { if (($3 | 0) == ($4_1 | 0)) { break block2 } $1128($0_1, HEAP32[(HEAP32[$1_1 + 20 >> 2] + ($4_1 << 4) | 0) + 8 >> 2], $2_1 + $4_1 | 0); $4_1 = $4_1 + 1 | 0; continue; }; } return $2_1; } function $1169($0_1) { var $1_1 = 0; $1_1 = 82740; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $1_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0) - 20 | 0 } block1 : { if (HEAPU8[$1_1 | 0] != 80) { break block1 } $1_1 = HEAP32[$0_1 + 108 >> 2]; if (($1_1 | 0) <= 0) { break block1 } HEAP16[(HEAP32[$0_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = 1; } } function $1170($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $5_1 = global$0 - 160 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 >> 2] = 0; $8_1 = HEAP32[$0_1 >> 2]; $7_1 = $5_1 + 56 | 0; wasm2js_memory_fill($7_1, 0, 52); $9_1 = $5_1 + 4 | 0; wasm2js_memory_fill($9_1, 0, 52); $10_1 = $5_1 + 108 | 0; wasm2js_memory_fill($10_1, 0, 52); $6_1 = $906($8_1, HEAP32[$1_1 + 12 >> 2], 0); if (!HEAPU8[$8_1 + 87 | 0]) { HEAP8[$5_1 + 108 | 0] = 44; HEAP32[$5_1 + 68 >> 2] = $6_1; HEAP8[$5_1 + 56 | 0] = 58; HEAP32[$5_1 + 124 >> 2] = $9_1; HEAP32[$5_1 + 120 >> 2] = $7_1; $1_1 = HEAP32[$1_1 + 20 >> 2]; $7_1 = HEAP32[$1_1 + 8 >> 2]; HEAP32[$5_1 + 16 >> 2] = $6_1; HEAP8[$5_1 + 4 | 0] = 56; HEAP32[$5_1 + 72 >> 2] = $7_1; HEAP32[$5_1 + 20 >> 2] = HEAP32[$1_1 + 24 >> 2]; $1064($6_1, $1168($0_1, $6_1, $5_1)); block5 : { if ($3) { FUNCTION_TABLE[$3 | 0]($0_1, $10_1, $2_1, $4_1); break block5; } HEAP32[$6_1 + 4 >> 2] = HEAP32[$6_1 + 4 >> 2] | 1; $1129($0_1, $5_1 + 108 | 0, $2_1); } $894($0_1, HEAP32[$5_1 >> 2]); } $11($8_1, $6_1); $0_1 = $5_1 + 160 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1171($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $7_1 = global$0 - 16 | 0; $9_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $9_1; HEAP32[$7_1 + 12 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = 0; $14 = HEAP32[$1_1 + 12 >> 2]; $11_1 = HEAPU8[$0_1 + 23 | 0]; if (!$1191($0_1, $1_1)) { $16_1 = $1192($0_1, $1_1); $9_1 = HEAP32[$0_1 >> 2]; $10_1 = $1119(HEAP32[$1_1 + 12 >> 2]); $17_1 = $270($9_1, $10_1 << 2, 0); block1 : { if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { break block1 } $5_1 = HEAP32[$0_1 + 8 >> 2]; $18_1 = ($2_1 | 0) != ($3 | 0); $12_1 = $1193($0_1, $1_1, 3, $18_1 ? $7_1 + 12 | 0 : 0, $17_1, $7_1 + 4 | 0); HEAP8[$0_1 + 23 | 0] = 0; $19_1 = $1168($0_1, $14, $7_1 + 8 | 0); HEAP8[$0_1 + 23 | 0] = $11_1; $8_1 = ($10_1 | 0) > 0 ? $10_1 : 0; while (1) { block3 : { if (($4_1 | 0) == ($8_1 | 0)) { $4_1 = $8_1; break block3; } if (HEAP32[($4_1 << 2) + $17_1 >> 2] != ($4_1 | 0)) { break block3 } $4_1 = $4_1 + 1 | 0; continue; } break; }; $6_1 = $19_1; block4 : { if (($4_1 | 0) == ($10_1 | 0)) { break block4 } $6_1 = $1060($0_1, $10_1); $4_1 = 0; while (1) { if (($4_1 | 0) == ($8_1 | 0)) { break block4 } $835($5_1, 80, $4_1 + $19_1 | 0, HEAP32[($4_1 << 2) + $17_1 >> 2] + $6_1 | 0, 0); $4_1 = $4_1 + 1 | 0; continue; }; } block14 : { if (($12_1 | 0) == 5) { $14 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $14; $13_1 = HEAP32[$1_1 + 20 >> 2]; $4_1 = 0; $12_1 = $851($0_1, HEAP32[$1_1 + 12 >> 2]); $1_1 = 0; if (($2_1 | 0) != ($3 | 0)) { $1_1 = $893($0_1); $835($5_1, 103, $6_1, $6_1, $1_1); } $11_1 = $13_1 + 8 | 0; while (1) { if (!(HEAP32[$13_1 >> 2] <= ($4_1 | 0))) { $9_1 = $11_1 + ($4_1 << 4) | 0; $8_1 = $1167($0_1, HEAP32[$9_1 >> 2], $7_1); block8 : { if (!$1_1) { break block8 } if (!$1051(HEAP32[$9_1 >> 2])) { break block8 } $835($5_1, 103, $1_1, $8_1, $1_1); } $894($0_1, HEAP32[$7_1 >> 2]); block11 : { block12 : { if (!(!$18_1 & (HEAP32[$13_1 >> 2] - 1 | 0) <= ($4_1 | 0))) { $859($5_1, ($6_1 | 0) == ($8_1 | 0) ? 52 : 54, $6_1, $14, $8_1, $12_1, -2); $8_1 = HEAP32[$5_1 + 108 >> 2]; if (($8_1 | 0) <= 0) { break block11 } $9_1 = HEAPU8[$16_1 | 0]; break block12; } $859($5_1, ($6_1 | 0) == ($8_1 | 0) ? 51 : 53, $6_1, $2_1, $8_1, $12_1, -2); $8_1 = HEAP32[$5_1 + 108 >> 2]; if (($8_1 | 0) <= 0) { break block11 } $9_1 = HEAPU8[$16_1 | 0] | 16; } HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) - 18 >> 1] = $9_1 << 24 >> 24; } $4_1 = $4_1 + 1 | 0; continue; } break; }; if ($1_1) { $326($5_1, 51, $1_1, $3); $863($5_1, $2_1); } $1013($5_1, $14); $894($0_1, $1_1); break block14; } $4_1 = 0; $11_1 = 0; $9_1 = $2_1; if (($2_1 | 0) != ($3 | 0)) { $11_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $11_1; $9_1 = $11_1; } while (1) { if (($4_1 | 0) != ($8_1 | 0)) { if (HEAP32[$0_1 + 40 >> 2]) { break block1 } if ($1051($1194(HEAP32[$1_1 + 12 >> 2], $4_1))) { $326($5_1, 51, $4_1 + $6_1 | 0, $9_1) } $4_1 = $4_1 + 1 | 0; continue; } break; }; block19 : { if (($12_1 | 0) == 1) { $15_1 = HEAP32[$7_1 + 4 >> 2]; $835($5_1, 30, $15_1, $2_1, $6_1); $12_1 = $857($5_1, 9); break block19; } $859($5_1, 96, $6_1, $10_1, 0, $16_1, $10_1); if (!$18_1) { block21 : { if (!(HEAPU8[$1_1 + 7 | 0] & 2)) { break block21 } $4_1 = 82740; $4_1 = HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul(HEAP32[$1_1 + 44 >> 2], 20) | 0; if (HEAPU8[$4_1 | 0] != 15) { break block21 } $1_1 = HEAP32[$4_1 + 12 >> 2]; if (($1_1 | 0) <= 0) { break block21 } $312($5_1, 64, $1_1, $2_1, $6_1, $10_1); } $312($5_1, 28, HEAP32[$7_1 + 4 >> 2], $2_1, $6_1, $10_1); break block14; } $15_1 = HEAP32[$7_1 + 4 >> 2]; $12_1 = $312($5_1, 29, $15_1, 0, $6_1, $10_1); } block23 : { if (($10_1 | 0) != 1) { break block23 } $1_1 = HEAP32[$7_1 + 12 >> 2]; if (!$1_1) { break block23 } $326($5_1, 52, $1_1, $2_1); } if (!$18_1) { $863($5_1, $2_1) } if ($11_1) { $1013($5_1, $11_1) } $11_1 = $326($5_1, 36, $15_1, $2_1); $1_1 = $2_1; if (($10_1 | 0) >= 2) { $1_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $1_1; } $4_1 = 0; while (1) { if (!(($4_1 | 0) == ($8_1 | 0))) { $13_1 = $893($0_1); $9_1 = $851($0_1, $1194($14, $4_1)); $835($5_1, 94, $15_1, $4_1, $13_1); $859($5_1, 53, $4_1 + $6_1 | 0, $1_1, $13_1, $9_1, -2); $894($0_1, $13_1); $4_1 = $4_1 + 1 | 0; continue; } break; }; $326($5_1, 9, 0, $3); if (($10_1 | 0) >= 2) { $1013($5_1, $1_1); $326($5_1, 39, $15_1, $11_1 + 1 | 0); $326($5_1, 9, 0, $2_1); } $1_1 = HEAP32[$5_1 + 108 >> 2]; $4_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) + 8 >> 2] = $1_1; } if (($6_1 | 0) == ($19_1 | 0)) { break block1 } $894($0_1, $6_1); } $10(HEAP32[$0_1 >> 2], $17_1); $10(HEAP32[$0_1 >> 2], $16_1); } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1172($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } $6_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$1_1 + 20 >> 2]; $2_1 = HEAP32[$1_1 + 4 >> 2]; if ($2_1 & 33554432) { HEAP32[$3 + 16 >> 2] = HEAP32[$5_1 + 16 >> 2]; $1032($0_1, 0, 17506, $3 + 16 | 0); $326($6_1, 10, HEAP32[$1_1 + 48 >> 2], HEAP32[$1_1 + 44 >> 2]); $2_1 = HEAP32[$1_1 + 28 >> 2]; break block; } HEAP32[$1_1 + 4 >> 2] = $2_1 | 33554432; $2_1 = 1; $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; HEAP32[$1_1 + 48 >> 2] = $4_1; HEAP32[$1_1 + 44 >> 2] = $326($6_1, 74, 0, $4_1) + 1; if (!(HEAPU8[$1_1 + 4 | 0] & 64)) { $8_1 = $857($6_1, 15) } HEAP32[$3 + 4 >> 2] = HEAP32[$5_1 + 16 >> 2]; HEAP32[$3 >> 2] = $8_1 ? 30822 : 30657; $1032($0_1, 1, 17485, $3); $9_1 = HEAPU8[$1_1 | 0] != 139; $2_1 = $9_1 ? $2_1 : HEAP32[HEAP32[$5_1 + 28 >> 2] >> 2]; $7_1 = HEAP32[$0_1 + 48 >> 2]; $4_1 = $3 + 36 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 32 >> 2] = 0; $4_1 = $7_1 + 1 | 0; HEAP32[$3 + 24 >> 2] = $4_1; $7_1 = $2_1 + $7_1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; block5 : { if (!$9_1) { HEAP32[$3 + 36 >> 2] = $2_1; HEAP32[$3 + 32 >> 2] = $4_1; $835($6_1, 75, 0, $4_1, $7_1); $2_1 = 10; break block5; } $326($6_1, 71, 0, $4_1); $2_1 = 3; } HEAP8[$3 + 20 | 0] = $2_1; $2_1 = HEAP32[$0_1 >> 2]; block9 : { if (HEAP32[$5_1 + 60 >> 2]) { $4_1 = $942($2_1, 156, 25060); if ($4_1) { HEAP8[$4_1 + 1 | 0] = 67; $2_1 = $903($0_1, 53, $906($2_1, HEAP32[HEAP32[$5_1 + 60 >> 2] + 12 >> 2], 0), $4_1); } else { $2_1 = 0 } $1131($0_1, HEAP32[HEAP32[$5_1 + 60 >> 2] + 12 >> 2]); HEAP32[HEAP32[$5_1 + 60 >> 2] + 12 >> 2] = $2_1; break block9; } HEAP32[$5_1 + 60 >> 2] = $903($0_1, 149, $942($2_1, 156, 24184), 0); } $2_1 = 0; HEAP32[$5_1 + 8 >> 2] = 0; if ($974($0_1, $5_1, $3 + 20 | 0)) { HEAP8[$1_1 + 2 | 0] = HEAPU8[$1_1 | 0]; HEAP8[$1_1 | 0] = 182; break block; } $2_1 = HEAP32[$3 + 24 >> 2]; HEAP32[$1_1 + 28 >> 2] = $2_1; if ($8_1) { $4_1 = HEAP32[$6_1 + 108 >> 2]; $5_1 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $5_1 : HEAP32[$6_1 + 104 >> 2] + Math_imul($8_1, 20) | 0) + 8 >> 2] = $4_1; } $835($6_1, 67, HEAP32[$1_1 + 48 >> 2], HEAP32[$1_1 + 44 >> 2], 1); HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1173($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!HEAP32[$0_1 + 40 >> 2]) { HEAP32[$3 + 4 >> 2] = $2_1; HEAP32[$3 >> 2] = $1_1; $257($0_1, 17355, $3); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1174($0_1, $1_1) { return $1001($0_1, $1_1, 2); } function $1175($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; block : { $4_1 = HEAP32[$0_1 + 72 >> 2]; if (!$4_1 | ($2_1 | 0) >= 0) { break block } $3 = $4_1 + 8 | 0; $5_1 = HEAP32[$4_1 >> 2]; while (1) { if (($5_1 | 0) <= 0) { break block } block2 : { if (HEAPU8[$3 + 9 | 0] & 8) { if (!$1121(0, HEAP32[$3 >> 2], $1_1, -1)) { break block2 } } $5_1 = $5_1 - 1 | 0; $3 = $3 + 16 | 0; continue; } break; }; return HEAP32[$3 + 12 >> 2]; } $3 = $906(HEAP32[$0_1 >> 2], $1_1, 0); if (!(!$3 | !(HEAPU8[$3 + 4 | 0] & 8))) { $4_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = $857($4_1, 15); HEAP8[$0_1 + 23 | 0] = 0; $1_1 = HEAP32[$0_1 >> 2]; if (!HEAPU8[$1_1 + 87 | 0]) { if (($2_1 | 0) < 0) { $2_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; } $862($0_1, $3, $2_1); $1_1 = HEAP32[$0_1 >> 2]; } HEAP8[$0_1 + 23 | 0] = 1; $790($1_1, $3); $0_1 = HEAP32[$4_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0] ? $3 : HEAP32[$4_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) + 8 >> 2] = $0_1; return $2_1; } $1_1 = $936($0_1, $4_1, $3); if ($1_1) { $5_1 = $1_1 + (HEAP32[$1_1 >> 2] << 4) | 0; $3 = $5_1 + 1 | 0; $4_1 = (HEAPU8[$3 | 0] | HEAPU8[$3 + 1 | 0] << 8) & 65527 | $2_1 >>> 28 & 8; HEAP8[$3 | 0] = $4_1; HEAP8[$3 + 1 | 0] = $4_1 >>> 8; $3 = $5_1 - 8 | 0; if (($2_1 | 0) < 0) { $2_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $2_1; } HEAP32[$3 + 12 >> 2] = $2_1; } HEAP32[$0_1 + 72 >> 2] = $1_1; return $2_1; } function $1176($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; block4 : { while (1) { block : { if (!$1121($0_1, $1_1, $2_1, $3)) { break block } $5_1 = HEAPU8[$2_1 | 0]; if (($5_1 | 0) == 43) { if ($1176($0_1, $1_1, HEAP32[$2_1 + 12 >> 2], $3)) { break block } if ($1176($0_1, $1_1, HEAP32[$2_1 + 16 >> 2], $3)) { break block } $5_1 = HEAPU8[$2_1 | 0]; } if (($5_1 | 0) == 52) { if ($1206($0_1, $1_1, HEAP32[$2_1 + 12 >> 2], $3, 0)) { break block } } $5_1 = 0; $4_1 = HEAPU8[$1_1 | 0]; block5 : { if (($4_1 | 0) != 158) { if (($4_1 | 0) != 172) { break block4 } $4_1 = HEAP32[$1_1 + 8 >> 2]; if ((HEAPU8[$4_1 | 0] | 32) != 105) { break block4 } $7_1 = HEAP32[$1_1 + 20 >> 2]; if (!$7_1) { break block4 } $8_1 = HEAP32[$0_1 >> 2]; $4_1 = $390($8_1, $4_1, HEAP32[$7_1 >> 2], HEAPU8[$8_1 + 84 | 0], 0); if (!$4_1 | !(HEAPU8[$4_1 + 6 | 0] & 64)) { break block4 } if (HEAP32[$4_1 + 8 >> 2] == 5) { break block5 } break block4; } if (HEAP32[$1_1 + 12 >> 2]) { break block4 } } block6 : { block7 : { $4_1 = HEAP32[$1_1 + 20 >> 2]; switch (HEAP32[$4_1 >> 2] - 2 | 0) { case 0: break block6; case 1: break block7; default: break block4; }; } $7_1 = HEAP32[$4_1 + 40 >> 2]; $5_1 = HEAPU8[$7_1 | 0]; if (($5_1 | 0) == 122) { break block6 } if (($5_1 | 0) == 171) { if (!$1179($7_1)) { break block6 } } HEAP32[$6_1 + 12 >> 2] = 1; $5_1 = 0; if (!$1074($7_1, $6_1 + 12 | 0, 0) | HEAP32[$6_1 + 12 >> 2]) { break block4 } $4_1 = HEAP32[$1_1 + 20 >> 2]; } $1_1 = HEAP32[$4_1 + 8 >> 2]; continue; } break; }; $5_1 = 1; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1177($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!(!(HEAPU8[$1_1 + 7 | 0] & 64) | !(HEAPU8[HEAP32[$0_1 >> 2] + 32 | 0] & 128 ? HEAPU8[$2_1 + 6 | 0] & 8 : 1))) { HEAP32[$3 >> 2] = $1_1; $257($0_1, 26908, $3); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1178($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0; $8_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = ($4_1 << 2) + 28 | 0; $7_1 = $325(HEAP32[$0_1 >> 2], $7_1, $7_1 >> 31); if (!$7_1) { $644(HEAP32[$0_1 >> 2], $5_1); return; } HEAP16[$7_1 + 26 >> 1] = $4_1; HEAP32[$7_1 + 20 >> 2] = 0; HEAP32[$7_1 + 12 >> 2] = 0; HEAP32[$7_1 + 4 >> 2] = $5_1; HEAP32[$7_1 >> 2] = 0; HEAP32[$7_1 + 16 >> 2] = HEAP32[$8_1 + 108 >> 2]; $859($8_1, $6_1 ? 65 : 66, $1_1, $2_1, $3, $7_1, -15); $1_1 = HEAP32[$8_1 + 108 >> 2]; if (($1_1 | 0) > 0) { HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) - 18 >> 1] = $6_1 & 46 } $1_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($1_1 ? $1_1 : $0_1) + 21 | 0] = 1; } function $1179($0_1) { return !HEAPU8[HEAP32[$1063($0_1) + 8 >> 2] + 4 | 0]; } function $1180($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 - 16 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 + 8 >> 2]; block1 : { if (HEAPU8[$1_1 + 5 | 0] & 8) { $0_1 = HEAP32[$1_1 + 8 >> 2]; $326($6_1, 71, $2_1 ? 0 - $0_1 | 0 : $0_1, $3); break block1; } block3 : { $7_1 = HEAP32[$1_1 + 8 >> 2]; $8_1 = $438($7_1, $4_1 + 8 | 0); if (!(($8_1 | 0) == 2 | !(($2_1 | 0) != 0 | ($8_1 | 0) != 3))) { $5_1 = HEAP32[$4_1 + 8 >> 2]; $9_1 = HEAP32[$4_1 + 12 >> 2]; if (!$2_1 | ($5_1 | ($9_1 | 0) != -2147483648)) { break block3 } } if (!$68($7_1, 1631, 2)) { HEAP32[$4_1 + 4 >> 2] = $1_1; HEAP32[$4_1 >> 2] = $2_1 ? 25085 : 30822; $257($0_1, 19202, $4_1); break block1; } $1181($6_1, $7_1, $2_1, $3); break block1; } if ($2_1) { $0_1 = ($8_1 | 0) == 3; HEAP32[$4_1 + 8 >> 2] = $0_1 ? 0 : 0 - $5_1 | 0; HEAP32[$4_1 + 12 >> 2] = $0_1 ? -2147483648 : 0 - ($9_1 + (($5_1 | 0) != 0) | 0) | 0; } $1189($6_1, 72, $3, $4_1 + 8 | 0, -13); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1181($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; if ($1_1) { $303($1_1, $4_1 + 8 | 0, $48($1_1), 1); if ($2_1) { HEAPF64[$4_1 + 8 >> 3] = -HEAPF64[$4_1 + 8 >> 3] } $1189($0_1, 154, $3, $4_1 + 8 | 0, -12); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1182($0_1) { return ($1119($0_1) | 0) > 1; } function $1183($0_1, $1_1) { var $2_1 = 0; if (HEAPU8[$1_1 | 0] == 139) { $2_1 = $1172($0_1, $1_1) } return $2_1; } function $1184($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; block3 : { block1 : { block2 : { block : { $6_1 = HEAPU8[$1_1 | 0]; switch ($6_1 - 176 | 0) { case 0: break block; case 1: break block1; default: break block2; }; } HEAP32[$4_1 >> 2] = $1194($1_1, $2_1); return HEAP32[$1_1 + 28 >> 2] + $2_1 | 0; } $0_1 = 0; if (($6_1 | 0) != 139) { break block3 } HEAP32[$4_1 >> 2] = HEAP32[(HEAP32[HEAP32[$1_1 + 20 >> 2] + 28 >> 2] + ($2_1 << 4) | 0) + 8 >> 2]; return $2_1 + $3 | 0; } $1_1 = HEAP32[(HEAP32[$1_1 + 20 >> 2] + ($2_1 << 4) | 0) + 8 >> 2]; HEAP32[$4_1 >> 2] = $1_1; $0_1 = $1167($0_1, $1_1, $5_1); } return $0_1; } function $1185($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { block : { if (HEAP32[$0_1 + 40 >> 2]) { break block } block2 : { if ($8_1) { $8_1 = $370($0_1, $2_1, $1_1); break block2; } $8_1 = $370($0_1, $1_1, $2_1); } $1_1 = $1190($1_1, $971($2_1)); $859(HEAP32[$0_1 + 8 >> 2], $3, $5_1, $6_1, $4_1, $8_1, -2); $0_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = HEAP32[$0_1 + 108 >> 2]; if (($2_1 | 0) <= 0) { break block } HEAP16[(HEAP32[$0_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = ($1_1 | $7_1) & 255; } } function $1186($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; if (HEAPU8[$1_1 | 0] != 172) { return 1 } $2_1 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; $3 = HEAP32[$1_1 + 8 >> 2]; $1_1 = HEAP32[$1_1 + 20 >> 2]; if ($1_1) { $1_1 = HEAP32[$1_1 >> 2] } else { $1_1 = $4_1 } $1_1 = $390($2_1, $3, $1_1, HEAPU8[$2_1 + 84 | 0], 0); if (!(!$1_1 | HEAP8[$1_1 + 7 | 0] & 1)) { return 0 } HEAP16[$0_1 + 20 >> 1] = 1; return 1; } function $1187($0_1, $1_1) { var $2_1 = 0, $3 = 0; block3 : { block1 : { while (1) { $2_1 = $1_1; $1_1 = FUNCTION_TABLE[HEAP32[$0_1 + 4 >> 2]]($0_1, $1_1) | 0; if ($1_1) { return $1_1 & 2 } if (HEAPU8[$2_1 + 6 | 0] & 129) { break block1 } $1_1 = HEAP32[$2_1 + 12 >> 2]; if ($1_1) { if ($1187($0_1, $1_1)) { break block3 } } $1_1 = HEAP32[$2_1 + 16 >> 2]; if ($1_1) { continue } break; }; $1_1 = HEAP32[$2_1 + 20 >> 2]; $3 = HEAP32[$2_1 + 4 >> 2]; if ($3 & 4096) { if ($919($0_1, $1_1)) { break block3 } break block1; } if ($1_1) { if ($921($0_1, $1_1)) { break block3 } $3 = HEAP32[$2_1 + 4 >> 2]; } if (!($3 & 16777216)) { break block1 } if ($1201($0_1, HEAP32[$2_1 + 44 >> 2], 1)) { break block3 } } return 0; } return 2; } function $1188($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 >> 2]; $1_1 = $906($3, $1_1, 0); if (!HEAPU8[$3 + 87 | 0]) { $862($0_1, $1_1, $2_1) } $11($3, $1_1); } function $1189($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = $325(HEAP32[$0_1 >> 2], 8, 0); if ($5_1) { $6_1 = HEAPU8[$3 | 0] | HEAPU8[$3 + 1 | 0] << 8 | (HEAPU8[$3 + 2 | 0] << 16 | HEAPU8[$3 + 3 | 0] << 24); $3 = HEAPU8[$3 + 4 | 0] | HEAPU8[$3 + 5 | 0] << 8 | (HEAPU8[$3 + 6 | 0] << 16 | HEAPU8[$3 + 7 | 0] << 24); HEAP8[$5_1 | 0] = $6_1; HEAP8[$5_1 + 1 | 0] = $6_1 >>> 8; HEAP8[$5_1 + 2 | 0] = $6_1 >>> 16; HEAP8[$5_1 + 3 | 0] = $6_1 >>> 24; HEAP8[$5_1 + 4 | 0] = $3; HEAP8[$5_1 + 5 | 0] = $3 >>> 8; HEAP8[$5_1 + 6 | 0] = $3 >>> 16; HEAP8[$5_1 + 7 | 0] = $3 >>> 24; } $859($0_1, $1_1, 0, $2_1, 0, $5_1, $4_1); } function $1190($0_1, $1_1) { $0_1 = $971($0_1); if (!(($1_1 | 0) < 65 | ($0_1 | 0) < 65)) { return $1_1 >>> 0 > 66 ? 67 : $0_1 >>> 0 > 66 ? 67 : 65 } return (($0_1 | 0) < 65 ? $1_1 : $0_1) | 64; } function $1191($0_1, $1_1) { var $2_1 = 0, $3 = 0; $3 = HEAP32[$1_1 + 12 >> 2]; $2_1 = $1119($3); block1 : { if (!(HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] | !(HEAPU8[$1_1 + 5 | 0] & 16))) { $1_1 = HEAP32[HEAP32[HEAP32[$1_1 + 20 >> 2] + 28 >> 2] >> 2]; if (($1_1 | 0) == ($2_1 | 0)) { break block1 } $1173($0_1, $1_1, $2_1); return 1; } if (($2_1 | 0) == 1) { break block1 } $1210($0_1, $3); return 1; } return 0; } function $1192($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = HEAP32[$1_1 + 12 >> 2]; $2_1 = $1119($5_1); $4_1 = HEAPU8[$1_1 + 5 | 0] & 16 ? HEAP32[$1_1 + 20 >> 2] : $4_1; $1_1 = $2_1 + 1 | 0; $3 = $51(HEAP32[$0_1 >> 2], $1_1, $1_1 >> 31); if ($3) { $1_1 = 0; $6_1 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { if (!(($1_1 | 0) == ($6_1 | 0))) { $0_1 = $971($1194($5_1, $1_1)); $7_1 = $1_1 + $3 | 0; if ($4_1) { $0_1 = $1190(HEAP32[(HEAP32[$4_1 + 28 >> 2] + ($1_1 << 4) | 0) + 8 >> 2], $0_1) } HEAP8[$7_1 | 0] = $0_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP8[$2_1 + $3 | 0] = 0; } return $3; } function $1193($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0; $15_1 = global$0 - 32 | 0; $6_1 = $15_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $12_1 = $856($0_1); $14 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 44 >> 2] = $14 + 1; block1 : { if (!$3) { $3 = 0; break block1; } if (!(HEAPU8[$1_1 + 5 | 0] & 16)) { break block1 } $9_1 = HEAP32[HEAP32[$1_1 + 20 >> 2] + 28 >> 2]; $8_1 = HEAP32[$9_1 >> 2]; $6_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $9_1 = $9_1 + 8 | 0; while (1) { block3 : { if (($7_1 | 0) != ($6_1 | 0)) { if (!$1051(HEAP32[$9_1 + ($7_1 << 4) >> 2])) { break block3 } $6_1 = $7_1; } $3 = ($6_1 | 0) != ($8_1 | 0) ? $3 : 0; break block1; } $7_1 = $7_1 + 1 | 0; continue; }; } block8 : { block4 : { if (HEAP32[$0_1 + 40 >> 2] | (HEAP32[$1_1 + 4 >> 2] & 4160) != 4096) { break block4 } $7_1 = HEAP32[$1_1 + 20 >> 2]; if (HEAP32[$7_1 + 52 >> 2] | HEAPU8[$7_1 + 4 | 0] & 9 | (HEAP32[$7_1 + 60 >> 2] | HEAP32[$7_1 + 36 >> 2])) { break block4 } $6_1 = HEAP32[$7_1 + 32 >> 2]; if (HEAP32[$6_1 >> 2] != 1 | HEAPU8[$6_1 + 21 | 0] & 4) { break block4 } $10_1 = HEAP32[$6_1 + 16 >> 2]; if (HEAPU8[$10_1 + 43 | 0] == 1) { break block4 } $6_1 = 0; $9_1 = HEAP32[$7_1 + 28 >> 2]; $13_1 = HEAP32[$9_1 >> 2]; $20_1 = ($13_1 | 0) > 0 ? $13_1 : 0; $17_1 = $9_1 + 8 | 0; while (1) { if (($6_1 | 0) != ($20_1 | 0)) { $9_1 = $6_1 << 4; $6_1 = $6_1 + 1 | 0; if (HEAPU8[HEAP32[$9_1 + $17_1 >> 2]] == 168) { continue } break block4; } break; }; if (!$7_1) { break block4 } $18_1 = $309(HEAP32[$0_1 >> 2], HEAP32[$10_1 + 60 >> 2]); $917($0_1, $18_1); $988($0_1, $18_1, HEAP32[$10_1 + 20 >> 2], 0, HEAP32[$10_1 >> 2]); if (!(($13_1 | 0) != 1 | HEAP16[HEAP32[$17_1 >> 2] + 32 >> 1] >= 0)) { $2_1 = $857($12_1, 15); $860($0_1, $14, $18_1, $10_1, 102); HEAP32[$15_1 >> 2] = HEAP32[$10_1 >> 2]; $1032($0_1, 0, 19547, $15_1); $0_1 = HEAP32[$12_1 + 108 >> 2]; $7_1 = 82740; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $7_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) + 8 >> 2] = $0_1; $6_1 = 1; break block8; } $7_1 = 0; $6_1 = 1; while (1) { if (!(!($6_1 & 1) | ($7_1 | 0) >= ($13_1 | 0))) { $9_1 = $1194(HEAP32[$1_1 + 12 >> 2], $7_1); $6_1 = 68; $8_1 = HEAP16[HEAP32[($7_1 << 4) + $17_1 >> 2] + 32 >> 1]; if (!(($8_1 | 0) < 0 | ($8_1 | 0) >= HEAP16[$10_1 + 34 >> 1])) { $6_1 = HEAPU8[(HEAP32[$10_1 + 4 >> 2] + Math_imul($8_1, 12) | 0) + 5 | 0] } $6_1 = $6_1 << 24 >> 24; $6_1 = ($6_1 | 0) > 66 | ($1190($9_1, $6_1) - 65 & 255) >>> 0 < 2; $7_1 = $7_1 + 1 | 0; continue; } break; }; if (!($6_1 & 1)) { break block4 } $7_1 = $10_1 + 8 | 0; $6_1 = $13_1 & 31; if (($13_1 & 63) >>> 0 >= 32) { $9_1 = -1 << $6_1; $6_1 = 0; } else { $8_1 = (1 << $6_1) - 1 & -1 >>> 32 - $6_1; $6_1 = -1 << $6_1; $9_1 = $8_1 | $6_1; } $22_1 = $6_1; $23_1 = $2_1 >>> 0 < 4; $6_1 = 0; while (1) { $11_1 = HEAP32[$7_1 >> 2]; if (!($6_1 | !$11_1)) { $6_1 = 0; $7_1 = HEAPU16[$11_1 + 52 >> 1]; block12 : { if (HEAP32[$11_1 + 36 >> 2] | (($7_1 | 0) < ($13_1 | 0) | $7_1 >>> 0 > 62)) { break block12 } block13 : { if ($23_1) { break block13 } if (($13_1 | 0) < HEAPU16[$11_1 + 50 >> 1]) { break block12 } if ($7_1 >>> 0 <= $13_1 >>> 0) { break block13 } if (!HEAPU8[$11_1 + 54 | 0]) { break block12 } } $16_1 = 0; $19_1 = 0; $10_1 = 0; while (1) { block14 : { if (($16_1 | 0) == ($20_1 | 0)) { break block14 } $7_1 = 0; $8_1 = $1194(HEAP32[$1_1 + 12 >> 2], $16_1); $6_1 = HEAP32[($16_1 << 4) + $17_1 >> 2]; $8_1 = $370($0_1, $8_1, $6_1); while (1) { if (($7_1 | 0) == ($13_1 | 0)) { break block14 } block16 : { if (HEAPU16[HEAP32[$11_1 + 4 >> 2] + ($7_1 << 1) >> 1] == HEAPU16[$6_1 + 32 >> 1]) { if (!$8_1) { break block16 } if (!$67(HEAP32[$8_1 >> 2], HEAP32[HEAP32[$11_1 + 32 >> 2] + ($7_1 << 2) >> 2])) { break block16 } } $7_1 = $7_1 + 1 | 0; continue; } break; }; $8_1 = $7_1 & 31; if (($7_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $8_1; $8_1 = 0; } else { $21_1 = 1 << $8_1; $6_1 = $21_1 - 1 & 1 >>> 32 - $8_1; $8_1 = $21_1; } if ($19_1 & $8_1 | $6_1 & $10_1) { break block14 } if ($4_1) { HEAP32[($16_1 << 2) + $4_1 >> 2] = $7_1 } $19_1 = $8_1 | $19_1; $10_1 = $6_1 | $10_1; $16_1 = $16_1 + 1 | 0; continue; } break; }; $6_1 = 0; if ((($19_1 ^ $22_1) & ($10_1 ^ $9_1)) != -1) { break block12 } $10_1 = $857($12_1, 15); HEAP32[$15_1 + 16 >> 2] = HEAP32[$11_1 >> 2]; $1032($0_1, 0, 19516, $15_1 + 16 | 0); $835($12_1, 102, $14, HEAP32[$11_1 + 44 >> 2], $18_1); $1097($0_1, $11_1); $6_1 = HEAPU8[HEAP32[$11_1 + 28 >> 2]]; block18 : { if (!$3) { break block18 } $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; HEAP32[$3 >> 2] = $7_1; if (($13_1 | 0) != 1) { break block18 } $1211($12_1, $14, $7_1); } $8_1 = HEAP32[$12_1 + 108 >> 2]; $7_1 = 82740; $6_1 = $6_1 + 3 | 0; HEAP32[(HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0] ? $7_1 : HEAP32[$12_1 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = $8_1; } $7_1 = $11_1 + 20 | 0; continue; } break; }; if ($6_1) { break block8 } } block20 : { if (!($2_1 & 1) | HEAPU8[$1_1 + 5 | 0] & 16) { break block20 } $9_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$1_1 + 12 >> 2] = 0; $6_1 = $944($0_1, $1_1); HEAP32[$1_1 + 12 >> 2] = $9_1; if (!!$6_1 & HEAP32[HEAP32[$1_1 + 20 >> 2] >> 2] > 2) { break block20 } $14 = -1; HEAP32[$0_1 + 44 >> 2] = HEAP32[$0_1 + 44 >> 2] - 1; $6_1 = 5; break block8; } $6_1 = HEAPU16[$0_1 + 160 >> 1]; block23 : { if ($2_1 >>> 0 >= 4) { $7_1 = 0; HEAP16[$0_1 + 160 >> 1] = 0; break block23; } if (!$3) { $7_1 = 0; break block23; } $7_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $7_1; HEAP32[$3 >> 2] = $7_1; } $1212($0_1, $1_1, $14); if ($7_1) { $1211($12_1, $14, $7_1) } HEAP16[$0_1 + 160 >> 1] = $6_1; $6_1 = 2; } block26 : { if (!$4_1 | $6_1 - 5 >>> 0 > 4294967293) { break block26 } $7_1 = 0; $0_1 = $1119(HEAP32[$1_1 + 12 >> 2]); $0_1 = ($0_1 | 0) > 0 ? $0_1 : 0; while (1) { if (($0_1 | 0) == ($7_1 | 0)) { break block26 } HEAP32[($7_1 << 2) + $4_1 >> 2] = $7_1; $7_1 = $7_1 + 1 | 0; continue; }; } HEAP32[$5_1 >> 2] = $14; $0_1 = $15_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1194($0_1, $1_1) { if ($1182($0_1)) { block3 : { if (!(HEAPU8[$0_1 | 0] != 139 & HEAPU8[$0_1 + 2 | 0] != 139)) { $0_1 = HEAP32[$0_1 + 20 >> 2] + 28 | 0; break block3; } $0_1 = $0_1 + 20 | 0; } $0_1 = HEAP32[(HEAP32[$0_1 >> 2] + ($1_1 << 4) | 0) + 8 >> 2]; } return $0_1; } function $1196($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $8_1 = global$0 - 16 | 0; $4_1 = $8_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if ($3) { $11_1 = 134217728; $5_1 = -1; $4_1 = HEAP32[$3 >> 2]; break block1; } block3 : { if ($2_1) { $5_1 = -1; $4_1 = $1221($1_1); break block3; } $4_1 = 56; if (HEAPU8[$1_1 + 5 | 0] & 8) { break block3 } $6_1 = HEAP32[$1_1 + 8 >> 2]; if (!$6_1) { break block3 } $4_1 = $2080($6_1) & 1073741823; $5_1 = $4_1 + 1 | 0; $4_1 = $4_1 + 60 & 2147483640; } $4_1 = $325($0_1, $4_1, $4_1 >> 31); } HEAP32[$8_1 + 12 >> 2] = $4_1; block4 : { if (!$4_1) { break block4 } $10_1 = $1222($1_1, $2_1); block5 : { if (($5_1 | 0) >= 0) { break block5 } $5_1 = 0; if (HEAPU8[$1_1 + 5 | 0] & 8) { break block5 } $6_1 = HEAP32[$1_1 + 8 >> 2]; if (!$6_1) { break block5 } $5_1 = $48($6_1) + 1 | 0; } block7 : { if ($2_1) { $6_1 = $10_1 & 4095; if (!$6_1) { break block7 } wasm2js_memory_copy($4_1, $1_1, $6_1); break block7; } $6_1 = 52; $7_1 = HEAP32[$1_1 + 4 >> 2]; $7_1 = $7_1 & 65536 ? 12 : $7_1 & 16384 ? 28 : 52; if ($7_1) { wasm2js_memory_copy($4_1, $1_1, $7_1) } if ($7_1 >>> 0 > 51) { break block7 } $9_1 = 52 - $7_1 | 0; if (!$9_1) { break block7 } wasm2js_memory_fill($4_1 + $7_1 | 0, 0, $9_1); } $7_1 = HEAP32[$4_1 + 4 >> 2] & -134299649 | ($10_1 & 81920 | $11_1); HEAP32[$4_1 + 4 >> 2] = $7_1; $9_1 = !!$5_1; if ($9_1) { $7_1 = $4_1 + $6_1 | 0; HEAP32[$4_1 + 8 >> 2] = $7_1; if ($9_1) { wasm2js_memory_copy($7_1, HEAP32[$1_1 + 8 >> 2], $5_1) } $7_1 = HEAP32[$4_1 + 4 >> 2]; $6_1 = $5_1 + $6_1 | 0; } HEAP32[$8_1 + 12 >> 2] = ($6_1 + 7 & -8) + $4_1; $6_1 = HEAP32[$1_1 + 4 >> 2]; if (($6_1 | $7_1) & 8454144) { break block4 } $5_1 = HEAP32[$1_1 + 20 >> 2]; block12 : { if ($6_1 & 4096) { $5_1 = $907($0_1, $5_1, $2_1); break block12; } $5_1 = $887($0_1, $5_1, HEAPU8[$1_1 | 0] != 146 ? $2_1 : 0); } HEAP32[$4_1 + 20 >> 2] = $5_1; if (HEAP8[$1_1 + 7 | 0] & 1) { HEAP32[$4_1 + 44 >> 2] = $1215($0_1, $4_1, HEAP32[$1_1 + 44 >> 2]) } $5_1 = HEAP32[$1_1 + 12 >> 2]; $6_1 = HEAPU8[$1_1 | 0]; block18 : { if ($2_1) { block15 : { if (($6_1 | 0) == 178) { break block15 } if (!$5_1) { $5_1 = 0; break block15; } $5_1 = $1196($0_1, $5_1, 1, $8_1 + 12 | 0); } HEAP32[$4_1 + 12 >> 2] = $5_1; $1_1 = HEAP32[$1_1 + 16 >> 2]; $2_1 = 0; if (!$1_1) { break block18 } $2_1 = $1196($0_1, $1_1, 1, $8_1 + 12 | 0); break block18; } $2_1 = $4_1; if (($6_1 | 0) != 178) { $5_1 = $906($0_1, $5_1, 0) } HEAP32[$2_1 + 12 >> 2] = $5_1; $2_1 = $906($0_1, HEAP32[$1_1 + 16 >> 2], 0); } HEAP32[$4_1 + 16 >> 2] = $2_1; } if ($3) { HEAP32[$3 >> 2] = HEAP32[$8_1 + 12 >> 2] } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1197($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = HEAPU8[$0_1 | 0]; block : { if (($1_1 - 43 & 255) >>> 0 > 1) { break block } $2_1 = $1197(HEAP32[$0_1 + 16 >> 2]); block2 : { $3 = $1197(HEAP32[$0_1 + 12 >> 2]); $4_1 = HEAP32[$3 + 4 >> 2]; if (($4_1 & 268435457) != 268435456) { $5_1 = HEAP32[$2_1 + 4 >> 2]; if (($5_1 & 536870913) != 536870912) { break block2 } } return ($1_1 | 0) == 44 ? $2_1 : $3; } if (($4_1 & 536870913) != 536870912 & ($5_1 & 268435457) != 268435456) { break block } $0_1 = ($1_1 | 0) == 44 ? $3 : $2_1; } return $0_1; } function $1199($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = 1; block : { if (!$1_1 | !$2_1 | (HEAPU8[$1_1 + 16 | 0] != HEAPU8[$2_1 + 16 | 0] | HEAPU8[$1_1 + 17 | 0] != HEAPU8[$2_1 + 17 | 0])) { break block } if (HEAPU8[$1_1 + 18 | 0] != HEAPU8[$2_1 + 18 | 0] | HEAPU8[$1_1 + 20 | 0] != HEAPU8[$2_1 + 20 | 0]) { break block } if ($1121($0_1, HEAP32[$1_1 + 24 >> 2], HEAP32[$2_1 + 24 >> 2], -1)) { break block } if ($1121($0_1, HEAP32[$1_1 + 28 >> 2], HEAP32[$2_1 + 28 >> 2], -1)) { break block } $4_1 = $1024(HEAP32[$1_1 + 8 >> 2], HEAP32[$2_1 + 8 >> 2], -1); if ($4_1) { break block } $4_1 = $1024(HEAP32[$1_1 + 12 >> 2], HEAP32[$2_1 + 12 >> 2], -1); if ($4_1) { break block } if ($3) { $4_1 = $1121($0_1, HEAP32[$1_1 + 40 >> 2], HEAP32[$2_1 + 40 >> 2], -1); if ($4_1) { break block } } $4_1 = 0; } return $4_1; } function $1200($0_1, $1_1) { var $2_1 = 0; block : { if (!$0_1) { break block } $1_1 = HEAP32[$0_1 + 100 >> 2] + Math_imul($1_1, 40) | 0; if (HEAP8[$1_1 - 24 | 0] & 1) { break block } $0_1 = $134(HEAP32[$0_1 >> 2]); if (!$0_1) { break block } $251($0_1, $1_1 - 40 | 0); $2_1 = $0_1; } return $2_1; } function $1201($0_1, $1_1, $2_1) { var $3 = 0; block1 : { while (1) { if (!$1_1) { return 0 } $3 = 2; if ($921($0_1, HEAP32[$1_1 + 12 >> 2])) { break block1 } if ($921($0_1, HEAP32[$1_1 + 8 >> 2])) { break block1 } if ($920($0_1, HEAP32[$1_1 + 40 >> 2])) { break block1 } if ($920($0_1, HEAP32[$1_1 + 24 >> 2])) { break block1 } $3 = $920($0_1, HEAP32[$1_1 + 28 >> 2]); if (!($3 | $2_1)) { $1_1 = HEAP32[$1_1 + 36 >> 2]; continue; } break; }; $3 = $3 ? 2 : 0; } return $3; } function $1202($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; block : { $0_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$1_1 + 52 >> 2] | !HEAP32[$0_1 + 280 >> 2]) { break block } $1_1 = HEAP32[$1075($1_1) + 64 >> 2]; if (!$1_1) { break block } HEAP32[$0_1 + 280 >> 2] = HEAP32[$1_1 + 8 >> 2]; } } function $1203($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP16[$0_1 + 20 >> 1] = 0; return 2; } function $1204($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; block9 : { $4_1 = HEAPU16[$0_1 + 20 >> 1]; block3 : { block1 : { if (!(!(HEAP8[$1_1 + 4 | 0] & 1) | ($4_1 | 0) != 2)) { break block1 } block8 : { block2 : { block7 : { block4 : { block6 : { $2_1 = HEAPU8[$1_1 | 0]; switch ($2_1 - 168 | 0) { case 8: case 11: break block1; case 0: case 1: case 2: break block2; case 3: case 5: case 6: case 7: case 9: case 10: break block3; case 4: break block4; default: break block6; }; } if (($2_1 | 0) == 60) { break block7 } if (($2_1 | 0) == 72 | ($2_1 | 0) == 142) { break block1 } if (($2_1 | 0) == 157) { break block8 } break block9; } $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!(!($2_1 & 1048576) & $4_1 >>> 0 <= 3 | $2_1 & 16777216)) { if (($4_1 | 0) != 5) { break block9 } HEAP32[$1_1 + 4 >> 2] = $2_1 | 1073741824; break block9; } if (HEAP32[$0_1 >> 2]) { $2_1 = 0; block30 : { block11 : { block : { if (HEAP8[$1_1 + 6 | 0] & 1) { break block } $3 = HEAP32[$1_1 + 20 >> 2]; if (!$3) { break block } $2_1 = HEAP32[$3 >> 2]; $921($0_1, $3); if (!HEAPU16[$0_1 + 20 >> 1]) { break block11 } } $3 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; $2_1 = $390($3, HEAP32[$1_1 + 8 >> 2], $2_1, HEAPU8[$3 + 84 | 0], 0); if (!(!$2_1 | HEAP32[$2_1 + 20 >> 2] | !(HEAPU8[$2_1 + 5 | 0] & 40))) { $2_1 = 1; if (!(HEAP8[$1_1 + 7 | 0] & 1)) { break block30 } } HEAP16[$0_1 + 20 >> 1] = 0; } $2_1 = 2; } return $2_1 | 0; } break block1; } $3 = 1; if ($943($1_1)) { break block3 } } $2_1 = HEAPU16[$0_1 + 20 >> 1]; if (HEAPU8[$1_1 + 4 | 0] & 32) { $3 = 0; if (($2_1 | 0) == 2) { break block1 } break block3; } if (($2_1 | 0) != 3) { break block1 } $3 = 0; if (HEAP32[$1_1 + 28 >> 2] == HEAP32[$0_1 + 24 >> 2]) { break block3 } break block1; } block14 : { switch ($4_1 - 4 | 0) { case 1: HEAP8[$1_1 | 0] = 122; break block9; case 0: break block14; default: break block3; }; } } HEAP16[$0_1 + 20 >> 1] = 0; $3 = 2; } return $3 | 0; } return 0; } function $1206($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; while (1) { if (!$1121($0_1, $1_1, $2_1, $3)) { return HEAPU8[$2_1 | 0] != 122 } $6_1 = 0; block4 : { block5 : { block3 : { block11 : { block10 : { block1 : { block2 : { block6 : { $5_1 = HEAPU8[$1_1 | 0]; switch ($5_1 - 103 | 0) { case 0: case 6: case 7: case 8: break block1; case 1: case 2: case 3: case 4: case 5: case 9: break block2; case 10: break block3; case 11: break block4; case 12: break block5; default: break block6; }; } block7 : { switch ($5_1 - 49 | 0) { default: switch ($5_1 - 173 | 0) { case 2: break block10; case 3: case 4: case 5: case 6: case 7: break block3; case 0: case 1: case 8: break block4; default: break block11; }; case 1: if (!$4_1) { break block5 } $4_1 = 1; if (HEAPU8[$1_1 + 5 | 0] & 16) { break block3 } break block4; case 4: case 5: case 6: case 7: case 8: case 9: break block2; case 2: case 3: break block3; case 0: break block7; }; } if ($4_1) { break block3 } $6_1 = 1; $5_1 = HEAP32[$1_1 + 20 >> 2]; if ($1206($0_1, HEAP32[$5_1 + 8 >> 2], $2_1, $3, 1)) { break block3 } $4_1 = 1; if (!$1206($0_1, HEAP32[$5_1 + 24 >> 2], $2_1, $3, 1)) { break block4 } break block3; } $4_1 = 1; } if (!$1206($0_1, HEAP32[$1_1 + 16 >> 2], $2_1, $3, $4_1)) { break block4 } return 1; } if ($4_1) { break block3 } $4_1 = 1; if (HEAPU8[$1_1 + 2 | 0] == 45) { break block4 } break block3; } if (($5_1 | 0) == 19) { break block5 } } return $6_1; } $4_1 = 1; } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; }; } function $1207($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = 1; $2_1 = HEAP32[$1_1 + 4 >> 2]; block : { if ($2_1 & 1 | !(HEAPU16[$0_1 + 22 >> 1] ? !($2_1 & 2) : 1)) { break block } block3 : { block6 : { block4 : { block5 : { block2 : { block7 : { $3 = HEAPU8[$1_1 | 0]; switch ($3 - 43 | 0) { case 2: case 3: case 8: case 9: break block; case 0: case 1: break block2; case 4: case 5: break block3; case 6: break block4; case 7: break block5; case 10: case 11: case 12: case 13: case 14: case 15: break block6; default: break block7; }; } block8 : { switch ($3 - 168 | 0) { default: if (($3 | 0) != 158) { break block3 } break block; case 4: case 7: case 9: break block; case 1: case 2: case 3: case 5: case 6: case 8: break block3; case 0: break block8; }; } if (HEAP32[$0_1 + 24 >> 2] != HEAP32[$1_1 + 28 >> 2]) { break block } HEAP16[$0_1 + 20 >> 1] = 1; return 2; } $1208($0_1, HEAP32[$1_1 + 12 >> 2], HEAP32[$1_1 + 16 >> 2]); return 1; } if ($2_1 & 4096) { break block } if (HEAP32[HEAP32[$1_1 + 20 >> 2] >> 2] <= 0) { break block } $920($0_1, HEAP32[$1_1 + 12 >> 2]); return 1; } $920($0_1, HEAP32[$1_1 + 12 >> 2]); $2_1 = $0_1; $0_1 = HEAP32[$1_1 + 20 >> 2]; $1208($2_1, HEAP32[$0_1 + 8 >> 2], HEAP32[$0_1 + 24 >> 2]); return 1; } $0_1 = HEAP32[$1_1 + 16 >> 2]; $1_1 = HEAP32[$1_1 + 12 >> 2]; block10 : { if (HEAPU8[$1_1 | 0] != 168) { break block10 } $1_1 = HEAP32[$1_1 + 44 >> 2]; if (!$1_1) { break block10 } if (HEAPU8[$1_1 + 43 | 0] == 1) { break block } } if (HEAPU8[$0_1 | 0] != 168) { break block3 } $0_1 = HEAP32[$0_1 + 44 >> 2]; if (!$0_1) { break block3 } if (HEAPU8[$0_1 + 43 | 0] == 1) { break block } } $4_1 = 0; } return $4_1 | 0; } function $1208($0_1, $1_1, $2_1) { block : { if (HEAPU16[$0_1 + 20 >> 1]) { break block } $920($0_1, $1_1); if (!HEAPU16[$0_1 + 20 >> 1]) { break block } HEAP16[$0_1 + 20 >> 1] = 0; $920($0_1, $2_1); } } function $1210($0_1, $1_1) { if (HEAPU8[$1_1 + 5 | 0] & 16) { $1173($0_1, HEAP32[HEAP32[HEAP32[$1_1 + 20 >> 2] + 28 >> 2] >> 2], 1); return; } $257($0_1, 15733, 0); } function $1211($0_1, $1_1, $2_1) { var $3 = 0; $326($0_1, 71, 0, $2_1); $3 = $858($0_1, 36, $1_1); $835($0_1, 94, $1_1, 0, $2_1); $2_1 = HEAP32[$0_1 + 108 >> 2]; if (($2_1 | 0) > 0) { HEAP16[(HEAP32[$0_1 + 104 >> 2] + Math_imul($2_1, 20) | 0) - 18 >> 1] = 128 } $1_1 = 82740; HEAP32[(HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0] ? $1_1 : HEAP32[$0_1 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = $2_1; } function $1212($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $7_1 = global$0 - 48 | 0; $9_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $9_1; $6_1 = HEAP32[$0_1 + 8 >> 2]; $9_1 = 0; $3 = HEAP32[$1_1 + 4 >> 2]; $4_1 = 0; block9 : { block : { if ($3 & 64) { break block } $4_1 = 0; if (HEAP32[$0_1 + 56 >> 2]) { break block } block1 : { if (!($3 & 4096) | HEAPU8[HEAP32[$1_1 + 20 >> 2] + 4 | 0] & 2) { break block1 } $3 = $325(HEAP32[$0_1 >> 2], 24, 0); if (!$3) { break block1 } HEAP32[$3 >> 2] = HEAP32[HEAP32[$1_1 + 20 >> 2] + 16 >> 2]; HEAP32[$3 + 8 >> 2] = $1192($0_1, $1_1); $9_1 = $3; } block3 : { $5_1 = HEAP32[$1_1 + 4 >> 2]; if (!($5_1 & 33554432)) { if (!$9_1) { break block3 } $10_1 = HEAP32[$9_1 >> 2]; if (!(HEAPU8[$0_1 + 28 | 0] >>> ($10_1 & 7) & 1)) { break block3 } $3 = 82740; $8_1 = 82740; $4_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$4_1 >> 2] + 87 | 0]) { $8_1 = HEAP32[$4_1 + 104 >> 2]; $3 = $8_1 + 20 | 0; $8_1 = ($8_1 + Math_imul(HEAP32[$4_1 + 108 >> 2], 20) | 0) - 20 | 0; } while (1) { if ($3 >>> 0 >= $8_1 >>> 0) { break block3 } block6 : { block5 : { if (HEAPU8[$3 + 1 | 0] != 239) { break block5 } $4_1 = HEAP32[$3 + 16 >> 2]; if (!HEAPU8[$4_1 + 4 | 0] | ($10_1 | 0) != HEAP32[$4_1 >> 2]) { break block5 } if (!$2073(HEAP32[$9_1 + 8 >> 2], HEAP32[$4_1 + 8 >> 2])) { break block6 } } $3 = $3 + 20 | 0; continue; } break; }; HEAP32[$1_1 + 44 >> 2] = HEAP32[$4_1 + 16 >> 2]; HEAP32[$1_1 + 48 >> 2] = HEAP32[$4_1 + 20 >> 2]; $3 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1 | 33554432; HEAP32[$1_1 + 28 >> 2] = $3; } $4_1 = $857($6_1, 15); if (HEAPU8[$1_1 + 5 | 0] & 16) { HEAP32[$7_1 + 16 >> 2] = HEAP32[HEAP32[$1_1 + 20 >> 2] + 16 >> 2]; $1032($0_1, 0, 17462, $7_1 + 16 | 0); } $326($6_1, 10, HEAP32[$1_1 + 48 >> 2], HEAP32[$1_1 + 44 >> 2]); $326($6_1, 114, $2_1, HEAP32[$1_1 + 28 >> 2]); $1_1 = HEAP32[$6_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $3 : HEAP32[$6_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) + 8 >> 2] = $1_1; if (!$9_1) { break block9 } $10(HEAP32[$0_1 >> 2], HEAP32[$9_1 + 8 >> 2]); $13(HEAP32[$0_1 >> 2], $9_1); break block9; } HEAP32[$1_1 + 4 >> 2] = $5_1 | 33554432; $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; HEAP32[$1_1 + 48 >> 2] = $3; HEAP32[$1_1 + 44 >> 2] = $326($6_1, 74, 0, $3) + 1; if ($9_1) { HEAP8[$9_1 + 4 | 0] = 0; HEAP32[$9_1 + 16 >> 2] = HEAP32[$1_1 + 44 >> 2]; $3 = HEAP32[$1_1 + 48 >> 2]; HEAP32[$9_1 + 12 >> 2] = $2_1; HEAP32[$9_1 + 20 >> 2] = $3; HEAP8[$0_1 + 28 | 0] = 1 << (HEAP32[$9_1 >> 2] & 7); $315($6_1, -1, $9_1, -17); } $4_1 = $857($6_1, 15); } $12_1 = HEAP32[$1_1 + 12 >> 2]; $8_1 = $1119($12_1); HEAP32[$1_1 + 28 >> 2] = $2_1; $14 = $326($6_1, 117, $2_1, $8_1); $10_1 = $1078(HEAP32[$0_1 >> 2], $8_1, 1); $5_1 = HEAP32[$1_1 + 20 >> 2]; block26 : { block12 : { block16 : { block19 : { if (HEAPU8[$1_1 + 5 | 0] & 16) { $13_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$7_1 + 4 >> 2] = HEAP32[$5_1 + 16 >> 2]; HEAP32[$7_1 >> 2] = $4_1 ? 30822 : 30657; $1032($0_1, 1, 17443, $7_1); if (($8_1 | 0) != HEAP32[$13_1 >> 2]) { break block12 } HEAP32[$7_1 + 36 >> 2] = 0; HEAP32[$7_1 + 28 >> 2] = 0; HEAP32[$7_1 + 32 >> 2] = 0; HEAP32[$7_1 + 24 >> 2] = $2_1; HEAP8[$7_1 + 20 | 0] = 11; HEAP32[$7_1 + 40 >> 2] = $1192($0_1, $1_1); HEAP32[$5_1 + 8 >> 2] = 0; $3 = HEAP32[$0_1 >> 2]; block14 : { if (!$4_1) { break block14 } if (HEAPU8[$3 + 82 | 0] & 8) { break block14 } $3 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $3; $11_1 = $326($6_1, 77, 1e4, $3); HEAP32[$7_1 + 28 >> 2] = $3; $3 = HEAP32[$0_1 >> 2]; } $5_1 = $907($3, $5_1, 0); $3 = HEAP32[$0_1 >> 2]; if (!HEAPU8[$3 + 87 | 0]) { $15_1 = !$974($0_1, $5_1, $7_1 + 20 | 0); $3 = HEAP32[$0_1 >> 2]; } $789($3, $5_1); $10(HEAP32[$0_1 >> 2], HEAP32[$7_1 + 40 >> 2]); if (!$11_1) { break block16 } $5_1 = HEAP32[$7_1 + 28 >> 2]; block18 : { if (!HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { $3 = HEAP32[$6_1 + 104 >> 2] + Math_imul($4_1, 20) | 0; HEAP32[$3 + 12 >> 2] = $5_1; if (!$5_1) { break block18 } break block19; } HEAP32[20688] = $5_1; $3 = 82740; if ($5_1) { break block19 } } $1045($6_1, $11_1); break block16; } if (!$5_1) { break block12 } $3 = $971($12_1); HEAP8[$7_1 + 20 | 0] = $3; $8_1 = 65; block21 : { if (($3 | 0) >= 65) { $8_1 = 67; if (($3 | 0) != 69) { break block21 } } HEAP8[$7_1 + 20 | 0] = $8_1; } if ($10_1) { HEAP32[$10_1 + 20 >> 2] = $851($0_1, HEAP32[$1_1 + 12 >> 2]) } $11_1 = $5_1 + 8 | 0; $3 = $893($0_1); $12_1 = $893($0_1); $8_1 = HEAP32[$5_1 >> 2]; while (1) { if (!(($8_1 | 0) <= 0)) { $5_1 = HEAP32[$11_1 >> 2]; block25 : { if ($4_1) { if ($944($0_1, $5_1)) { break block25 } $1045($6_1, $4_1 - 1 | 0); $1045($6_1, $4_1); HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -33554433; } $4_1 = 0; } $862($0_1, $5_1, $3); $859($6_1, 97, $3, 1, $12_1, $7_1 + 20 | 0, 1); $312($6_1, 138, $2_1, $12_1, $3, 1); $11_1 = $11_1 + 16 | 0; $8_1 = $8_1 - 1 | 0; continue; } break; }; $894($0_1, $3); $894($0_1, $12_1); break block12; } HEAP32[$3 + 12 >> 2] = $5_1; } if (!$15_1) { break block26 } $3 = 0; $8_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $5_1 = $10_1 + 20 | 0; $11_1 = $13_1 + 8 | 0; while (1) { if (($3 | 0) == ($8_1 | 0)) { break block12 } HEAP32[$5_1 + ($3 << 2) >> 2] = $370($0_1, $1194($12_1, $3), HEAP32[$11_1 + ($3 << 4) >> 2]); $3 = $3 + 1 | 0; continue; }; } if ($9_1) { HEAP8[$9_1 + 4 | 0] = 1 } if ($10_1) { $315($6_1, $14, $10_1, -8) } if (!$4_1) { break block9 } $858($6_1, 136, $2_1); $2_1 = HEAP32[$6_1 + 108 >> 2]; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $3 : HEAP32[$6_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) + 8 >> 2] = $2_1; $835($6_1, 67, HEAP32[$1_1 + 48 >> 2], HEAP32[$1_1 + 44 >> 2], 1); HEAP32[$0_1 + 32 >> 2] = 0; HEAP8[$0_1 + 19 | 0] = 0; break block9; } $643($10_1); } $0_1 = $7_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1213($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { $2_1 = HEAP32[$0_1 + 96 >> 2]; $3 = 1 << $1_1; if ($2_1 & $3) { break block } HEAP32[$0_1 + 96 >> 2] = $2_1 | $3; if (($1_1 | 0) != 1) { break block } $140($0_1); } } function $1214($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { if (!$1_1) { break block } $4_1 = $270($0_1, Math_imul(HEAP32[$1_1 >> 2], 24) + 12 | 0, 0); if (!$4_1) { break block } $2_1 = HEAP32[$1_1 >> 2]; HEAP32[$4_1 >> 2] = $2_1; $6_1 = $4_1 + 12 | 0; $7_1 = $1_1 + 12 | 0; while (1) { if (($2_1 | 0) <= ($3 | 0)) { $3 = $4_1 } else { $2_1 = Math_imul($3, 24); $5_1 = $2_1 + $6_1 | 0; $2_1 = $2_1 + $7_1 | 0; HEAP32[$5_1 + 8 >> 2] = $907($0_1, HEAP32[$2_1 + 8 >> 2], 0); HEAP32[$5_1 + 4 >> 2] = $887($0_1, HEAP32[$2_1 + 4 >> 2], 0); HEAP32[$5_1 >> 2] = $116($0_1, HEAP32[$2_1 >> 2]); HEAP8[$5_1 + 20 | 0] = HEAPU8[$2_1 + 20 | 0]; $3 = $3 + 1 | 0; $2_1 = HEAP32[$1_1 >> 2]; continue; } break; }; } return $3; } function $1215($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block : { if (!$2_1) { break block } $3 = $270($0_1, 100, 0); if (!$3) { break block } HEAP32[$3 >> 2] = $116($0_1, HEAP32[$2_1 >> 2]); HEAP32[$3 + 4 >> 2] = $116($0_1, HEAP32[$2_1 + 4 >> 2]); HEAP32[$3 + 40 >> 2] = $906($0_1, HEAP32[$2_1 + 40 >> 2], 0); HEAP32[$3 + 44 >> 2] = HEAP32[$2_1 + 44 >> 2]; HEAP32[$3 + 8 >> 2] = $887($0_1, HEAP32[$2_1 + 8 >> 2], 0); HEAP32[$3 + 12 >> 2] = $887($0_1, HEAP32[$2_1 + 12 >> 2], 0); HEAP8[$3 + 16 | 0] = HEAPU8[$2_1 + 16 | 0]; HEAP8[$3 + 18 | 0] = HEAPU8[$2_1 + 18 | 0]; HEAP8[$3 + 17 | 0] = HEAPU8[$2_1 + 17 | 0]; HEAP8[$3 + 20 | 0] = HEAPU8[$2_1 + 20 | 0]; HEAP32[$3 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2]; HEAP32[$3 + 52 >> 2] = HEAP32[$2_1 + 52 >> 2]; HEAP32[$3 + 80 >> 2] = HEAP32[$2_1 + 80 >> 2]; HEAP32[$3 + 48 >> 2] = HEAP32[$2_1 + 48 >> 2]; HEAP8[$3 + 96 | 0] = HEAPU8[$2_1 + 96 | 0]; HEAP32[$3 + 24 >> 2] = $906($0_1, HEAP32[$2_1 + 24 >> 2], 0); $0_1 = $906($0_1, HEAP32[$2_1 + 28 >> 2], 0); HEAP32[$3 + 72 >> 2] = $1_1; HEAP32[$3 + 28 >> 2] = $0_1; HEAP8[$3 + 19 | 0] = HEAPU8[$2_1 + 19 | 0]; $4_1 = $3; } return $4_1; } function $1216($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return HEAP32[$0_1 + 24 >> 2] != ($1_1 | 0) | 0; } function $1217($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (!(!(HEAP8[$1_1 + 7 | 0] & 1) | HEAPU8[$1_1 | 0] != 172)) { $1219(HEAP32[$0_1 + 24 >> 2], HEAP32[$1_1 + 44 >> 2]) } return 0; } function $1218($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!$1_1) { break block } $4_1 = $325($0_1, (HEAP32[$1_1 >> 2] << 2) + 4 | 0, 0); if (!$4_1) { break block } $2_1 = HEAP32[$1_1 >> 2]; HEAP32[$4_1 >> 2] = $2_1; $5_1 = $1_1 + 4 | 0; $6_1 = $4_1 + 4 | 0; while (1) { if (($3 | 0) >= ($2_1 | 0)) { $3 = $4_1 } else { $2_1 = $3 << 2; HEAP32[$2_1 + $6_1 >> 2] = $116($0_1, HEAP32[$2_1 + $5_1 >> 2]); $3 = $3 + 1 | 0; $2_1 = HEAP32[$1_1 >> 2]; continue; } break; }; } return $3; } function $1219($0_1, $1_1) { var $2_1 = 0, $3 = 0; block : { if (!$0_1) { break block } $2_1 = $0_1 + 68 | 0; block3 : { $3 = HEAP32[$0_1 + 68 >> 2]; block2 : { if (!$3) { HEAP32[$1_1 + 36 >> 2] = 0; break block2; } if ($1199(0, $3, $1_1, 0)) { break block3 } $0_1 = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 36 >> 2] = $0_1; if (!$0_1) { break block2 } HEAP32[$0_1 + 32 >> 2] = $1_1 + 36; } HEAP32[$2_1 >> 2] = $1_1; HEAP32[$1_1 + 32 >> 2] = $2_1; return; } if (!$1024(HEAP32[$1_1 + 8 >> 2], HEAP32[HEAP32[$2_1 >> 2] + 8 >> 2], -1)) { break block } HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 33554432; } } function $1220($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$1_1 + 296 >> 2]) { HEAP32[$0_1 + 12 >> 2] = 9; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; } $2_1 = HEAP32[$1_1 + 372 >> 2]; block1 : { if (!$2_1) { break block1 } block2 : { if (HEAP32[$0_1 + 12 >> 2] == 9) { break block2 } $3 = HEAP32[$0_1 + 116 >> 2] + 1 | 0; HEAP32[$0_1 + 116 >> 2] = $3; if (HEAPU32[$1_1 + 380 >> 2] > $3 >>> 0) { break block1 } if (!(FUNCTION_TABLE[$2_1 | 0](HEAP32[$1_1 + 376 >> 2]) | 0)) { break block2 } HEAP32[$0_1 + 12 >> 2] = 9; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + 1; } HEAP32[$0_1 + 116 >> 2] = 0; } } function $1221($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; while (1) { $1_1 = $1222($0_1, 1) & 4095; block : { if (HEAPU8[$0_1 + 5 | 0] & 8) { break block } $2_1 = HEAP32[$0_1 + 8 >> 2]; if (!$2_1) { break block } $1_1 = (($2080($2_1) & 1073741823) + $1_1 | 0) + 1 | 0; } $1_1 = $1_1 + 7 & -8; $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($2_1) { $1_1 = $1221($2_1) + $1_1 | 0 } $3 = $1_1 + $3 | 0; $0_1 = HEAP32[$0_1 + 16 >> 2]; if ($0_1) { continue } break; }; return $3; } function $1222($0_1, $1_1) { var $2_1 = 0; $2_1 = 52; block : { if (!$1_1 | HEAPU8[$0_1 + 6 | 0] & 2) { break block } $2_1 = 16412; if (HEAP32[$0_1 + 12 >> 2]) { break block } $2_1 = HEAP32[$0_1 + 20 >> 2] ? 16412 : 65548; } return $2_1; } function $1223($0_1) { $257($0_1, 10465, 0); HEAP32[$0_1 + 12 >> 2] = 1; } function $1224($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $5_1 = global$0 - 48 | 0; $6_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $6_1; $8_1 = HEAP32[$0_1 >> 2]; $6_1 = $5_1 + 32 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$5_1 + 24 >> 2] = 0; HEAP32[$5_1 + 28 >> 2] = 0; block1 : { if (!$1_1) { $10_1 = 0; break block1; } $6_1 = HEAP32[$1_1 >> 2]; $4_1 = ($6_1 | 0) >= 32767 ? 32767 : $6_1; $10_1 = $270($8_1, Math_imul($6_1, 12), 0); } HEAP16[$2_1 >> 1] = $4_1; HEAP32[$3 >> 2] = $10_1; $12_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $14 = $1_1 + 8 | 0; $6_1 = $10_1; while (1) { block13 : { block12 : { block7 : { block4 : { block5 : { block3 : { if (($11_1 | 0) != ($12_1 | 0)) { if (!HEAP32[$0_1 + 40 >> 2]) { break block3 } $12_1 = $11_1; } $197($5_1 + 24 | 0); if (!HEAP32[$0_1 + 40 >> 2]) { break block4 } $4_1 = 0; while (1) { if (($4_1 | 0) == ($12_1 | 0)) { break block5 } $10($8_1, HEAP32[Math_imul($4_1, 12) + $10_1 >> 2]); $4_1 = $4_1 + 1 | 0; continue; }; } $9_1 = ($11_1 << 4) + $14 | 0; $7_1 = HEAP32[$9_1 + 4 >> 2]; if (!(!$7_1 | HEAPU8[$9_1 + 9 | 0] & 3)) { break block7 } $4_1 = $1063(HEAP32[$9_1 >> 2]); while (1) { $1_1 = HEAPU8[$4_1 | 0]; if (($1_1 | 0) != 142) { block10 : { if (($1_1 | 0) != 60) { if (HEAPU8[$4_1 + 7 | 0] & 3 | ($1_1 | 0) != 168) { break block10 } $1_1 = HEAP32[$4_1 + 44 >> 2]; if (!$1_1) { break block10 } block11 : { $4_1 = HEAP16[$4_1 + 32 >> 1]; if (($4_1 | 0) >= 0) { break block11 } $4_1 = HEAP16[$1_1 + 32 >> 1]; if (($4_1 | 0) >= 0) { break block11 } $7_1 = 15209; break block7; } $7_1 = HEAP32[HEAP32[$1_1 + 4 >> 2] + Math_imul($4_1, 12) >> 2]; break block10; } $7_1 = HEAP32[$4_1 + 8 >> 2]; } if (!$7_1) { break block12 } break block7; } else { $4_1 = HEAP32[$4_1 + 16 >> 2]; continue; } }; } $10($8_1, $10_1); HEAP32[$3 >> 2] = 0; HEAP16[$2_1 >> 1] = 0; } $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return; } if ($1005($7_1)) { break block12 } $1_1 = $116($8_1, $7_1); break block13; } HEAP32[$5_1 + 16 >> 2] = $11_1 + 1; $1_1 = $310($8_1, 16723, $5_1 + 16 | 0); } HEAP32[$5_1 + 44 >> 2] = 0; while (1) { block14 : { if (!$1_1) { break block14 } $4_1 = $320($5_1 + 24 | 0, $1_1); if (!$4_1) { break block14 } if (HEAPU8[$4_1 + 9 | 0] & 128) { HEAP16[$6_1 + 10 >> 1] = HEAPU16[$6_1 + 10 >> 1] | 1024 } $13_1 = $48($1_1); $4_1 = $13_1; if ($4_1) { while (1) { block19 : { if ($4_1 >>> 0 <= 1) { $7_1 = HEAPU8[$1_1 | 0]; $4_1 = 0; break block19; } $4_1 = $4_1 - 1 | 0; $7_1 = HEAPU8[$4_1 + $1_1 | 0]; if ($7_1 - 58 >>> 0 > 4294967285) { continue } } break; }; $4_1 = ($7_1 & 255) == 58 ? $4_1 : $13_1; } else { $4_1 = 0 } HEAP32[$5_1 >> 2] = $4_1; HEAP32[$5_1 + 4 >> 2] = $1_1; $1_1 = HEAP32[$5_1 + 44 >> 2] + 1 | 0; HEAP32[$5_1 + 44 >> 2] = $1_1; HEAP32[$5_1 + 8 >> 2] = $1_1; $1_1 = $310($8_1, 1912, $5_1); $1220($0_1); if (HEAPU32[$5_1 + 44 >> 2] < 4) { continue } $65(4, $5_1 + 44 | 0); continue; } break; }; HEAP32[$6_1 >> 2] = $1_1; HEAP8[$6_1 + 7 | 0] = $886($1_1); if (HEAP8[$9_1 + 10 | 0] & 1) { HEAP16[$6_1 + 10 >> 1] = HEAPU16[$6_1 + 10 >> 1] | 1024 } block21 : { if (!$1_1) { break block21 } if (($395($5_1 + 24 | 0, $1_1, $9_1) | 0) != ($9_1 | 0)) { break block21 } $106($8_1); } $6_1 = $6_1 + 12 | 0; $11_1 = $11_1 + 1 | 0; continue; }; } function $1225($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $8_1 = global$0 - 48 | 0; $10_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $10_1; $13_1 = HEAP32[$0_1 >> 2]; if (!(HEAPU8[$13_1 + 87 | 0] | HEAPU8[$0_1 + 224 | 0] > 1)) { while (1) { $10_1 = $2_1; $2_1 = HEAP32[$2_1 + 52 >> 2]; if ($2_1) { continue } break; }; $2_1 = HEAP32[$10_1 + 28 >> 2]; wasm2js_memory_fill($8_1 + 12 | 0, 0, 36); HEAP32[$8_1 + 16 >> 2] = HEAP32[$10_1 + 32 >> 2]; $15_1 = $2_1 + 8 | 0; $5_1 = HEAP32[$1_1 + 4 >> 2]; while (1) { if (($14 | 0) < HEAP16[$1_1 + 34 >> 1]) { HEAP32[$1_1 + 28 >> 2] = HEAP32[$1_1 + 28 >> 2] | HEAPU16[$5_1 + 10 >> 1] & 98; $11_1 = 0; $9_1 = $14 << 4; $12_1 = HEAP32[$9_1 + $15_1 >> 2]; $4_1 = $971($12_1); $2_1 = $10_1; block6 : { block5 : { while (1) { block3 : { HEAP8[$5_1 + 5 | 0] = $4_1; if ($4_1 << 24 >> 24 > 64) { break block3 } if (HEAP32[$2_1 + 56 >> 2]) { $11_1 = $1257(HEAP32[($9_1 + HEAP32[$2_1 + 28 >> 2] | 0) + 8 >> 2]) | $11_1; $2_1 = HEAP32[$2_1 + 56 >> 2]; $4_1 = $971(HEAP32[($9_1 + HEAP32[$2_1 + 28 >> 2] | 0) + 8 >> 2]); continue; } else { $2_1 = $3; break block5; } } break; }; $6_1 = 65; if (($4_1 & 255) == 65) { break block6 } $7_1 = HEAP32[$2_1 + 56 >> 2]; if (($2_1 | 0) == ($10_1 | 0)) { $6_1 = $4_1; if (!$7_1) { break block6 } } while (1) { if ($7_1) { $11_1 = $1257(HEAP32[($9_1 + HEAP32[$7_1 + 28 >> 2] | 0) + 8 >> 2]) | $11_1; $7_1 = HEAP32[$7_1 + 56 >> 2]; continue; } break; }; $2_1 = 65; $6_1 = HEAP8[$5_1 + 5 | 0]; if ($11_1 & 1 & ($6_1 | 0) == 66) { break block5 } $4_1 = ($6_1 | 0) < 67; if (!($11_1 & 2 ? $4_1 : 1)) { break block5 } if ($4_1) { break block6 } $2_1 = 70; if (HEAPU8[$12_1 | 0] != 36) { break block6 } } HEAP8[$5_1 + 5 | 0] = $2_1; $6_1 = $2_1; } $4_1 = $1258($8_1 + 12 | 0, $12_1); block14 : { block12 : { if ($4_1) { if (($6_1 & 255) == ($853($4_1, 0) & 255)) { break block12 } $6_1 = HEAPU8[$5_1 + 5 | 0]; } $4_1 = 20168; $2_1 = 1; block13 : { $6_1 = $6_1 & 255; switch ($6_1 - 67 | 0) { case 0: case 3: break block12; default: break block13; }; } while (1) { if (($2_1 | 0) == 6) { break block14 } if (HEAPU8[$2_1 + 50880 | 0] != ($6_1 | 0)) { $2_1 = $2_1 + 1 | 0; continue; } break; }; $4_1 = HEAP32[($2_1 << 2) + 76320 >> 2]; if (!$4_1) { break block14 } } $7_1 = HEAP32[$5_1 >> 2]; $9_1 = $48($4_1); $6_1 = $48($7_1); $7_1 = $668($13_1, $7_1, ($9_1 + $6_1 | 0) + 2 | 0, 0); HEAP32[$5_1 >> 2] = $7_1; HEAP16[$5_1 + 10 >> 1] = HEAPU16[$5_1 + 10 >> 1] & 65019; if (!$7_1) { break block14 } $2_1 = $9_1 + 1 | 0; if ($2_1) { wasm2js_memory_copy(($6_1 + $7_1 | 0) + 1 | 0, $4_1, $2_1) } HEAP16[$5_1 + 10 >> 1] = HEAPU16[$5_1 + 10 >> 1] | 4; } $2_1 = $851($0_1, $12_1); if ($2_1) { $986($13_1, $5_1, HEAP32[$2_1 >> 2]) } $5_1 = $5_1 + 12 | 0; $14 = $14 + 1 | 0; continue; } break; }; HEAP16[$1_1 + 40 >> 1] = 1; } $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1226($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0.0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0; $5_1 = global$0 - 288 | 0; $8_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $8_1; $8_1 = HEAP32[$0_1 + 24 >> 2]; $6_1 = HEAP32[$8_1 >> 2]; $14 = $1_1; block16 : { block144 : { block153 : { block152 : { block137 : { block43 : { block23 : { block64 : { block61 : { block1 : { block68 : { block67 : { block53 : { block63 : { block57 : { block62 : { block56 : { block55 : { block54 : { block50 : { block14 : { block13 : { block3 : { block10 : { block2 : { block : { block5 : { block8 : { block4 : { block6 : { block7 : { $2_1 = HEAPU8[$1_1 | 0]; switch ($2_1 - 45 | 0) { case 0: case 1: break block; case 2: case 3: case 14: case 16: case 17: case 18: case 19: case 20: case 21: case 22: case 23: case 24: case 25: case 26: case 27: case 28: case 29: case 30: break block1; case 4: case 8: case 9: case 10: case 11: case 12: case 13: break block2; case 5: break block3; case 6: case 7: break block4; case 15: break block5; case 31: break block6; default: break block7; }; } block9 : { switch ($2_1 - 139 | 0) { case 1: case 2: break block1; case 0: break block3; case 3: break block8; default: break block9; }; } if (($2_1 | 0) == 20) { break block3 } if (($2_1 | 0) == 157) { break block10 } if (($2_1 | 0) != 172) { break block1 } $2_1 = HEAP32[$6_1 >> 2]; if (HEAP8[$1_1 + 7 | 0] & 1) { $4_1 = HEAP32[$1_1 + 44 >> 2]; $7_1 = HEAPU8[$4_1 + 16 | 0] != 167 ? $4_1 : 0; } $4_1 = HEAPU8[$2_1 + 84 | 0]; $12_1 = HEAP32[$8_1 + 24 >> 2]; $11_1 = HEAP32[$1_1 + 20 >> 2]; if ($11_1) { $3 = HEAP32[$11_1 >> 2] } $14 = $2_1; $2_1 = HEAP32[$1_1 + 8 >> 2]; $10_1 = $390($14, $2_1, $3, $4_1, 0); if ($10_1) { break block13 } $10_1 = $390(HEAP32[$6_1 >> 2], $2_1, -2, $4_1, 0); $2_1 = ($10_1 | 0) != 0; $4_1 = !$10_1; break block14; } $0_1 = HEAP32[$8_1 + 4 >> 2]; HEAP8[$1_1 | 0] = 168; HEAP32[$1_1 + 44 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 28 >> 2] = HEAP32[$0_1 + 24 >> 2]; HEAP16[$1_1 + 32 >> 1] = HEAPU16[$1_1 + 32 >> 1] - 1; HEAP8[$1_1 + 1 | 0] = 68; break block1; } $2_1 = $8_1; while (1) { if (!(!$2_1 | $3 >>> 0 > 7)) { HEAP32[($5_1 + 224 | 0) + ($3 << 2) >> 2] = HEAP32[$2_1 + 16 >> 2]; $3 = $3 + 1 | 0; $2_1 = HEAP32[$2_1 + 12 >> 2]; continue; } break; }; $920($0_1, HEAP32[$1_1 + 12 >> 2]); $2_1 = 1; if (HEAPU8[$6_1 + 224 | 0] > 1) { break block16 } $0_1 = HEAP32[$1_1 + 12 >> 2]; if ($1051($0_1)) { break block16 } $3 = $8_1; while (1) { if ($3) { if (!(HEAPU8[$3 + 26 | 0] & 16)) { break block16 } $3 = HEAP32[$3 + 12 >> 2]; continue; } break; }; $3 = HEAPU8[$1_1 | 0]; HEAP8[$1_1 | 0] = 156; HEAP32[$1_1 + 8 >> 2] = ($3 | 0) == 52; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 2048; $3 = 0; while (1) { if (!(!$8_1 | $3 >>> 0 > 7)) { HEAP32[$8_1 + 16 >> 2] = HEAP32[($5_1 + 224 | 0) + ($3 << 2) >> 2]; $3 = $3 + 1 | 0; $8_1 = HEAP32[$8_1 + 12 >> 2]; continue; } break; }; $11(HEAP32[$6_1 >> 2], $0_1); HEAP32[$1_1 + 12 >> 2] = 0; break block16; } $4_1 = HEAP32[$1_1 + 12 >> 2]; if (HEAPU8[$8_1 + 24 | 0] & 40) { $1228($6_1, $8_1, 9068, 0, $1_1) } $2_1 = HEAP32[$1_1 + 16 >> 2]; block21 : { if (HEAPU8[$2_1 | 0] == 60) { $14 = $2_1; $0_1 = $4_1; break block21; } $14 = HEAP32[$2_1 + 16 >> 2]; $3 = HEAP32[$4_1 + 8 >> 2]; $0_1 = HEAP32[$2_1 + 12 >> 2]; } $10_1 = HEAP32[$0_1 + 8 >> 2]; if (HEAPU8[$6_1 + 224 | 0] < 2) { break block5 } $918($6_1, $1_1, $14); $918($6_1, $1_1 + 44 | 0, $0_1); } $15_1 = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 224 >> 2] = 0; $13_1 = HEAP32[$14 + 8 >> 2]; HEAP32[$1_1 + 28 >> 2] = -1; if (!$3) { break block23 } if (HEAPU8[$8_1 + 24 | 0] & 6) { break block23 } $4_1 = HEAP32[$15_1 + 20 >> 2]; $0_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $2_1 = 0; while (1) { block26 : { block25 : { if (($0_1 | 0) == ($2_1 | 0)) { $2_1 = $0_1; break block25; } $7_1 = $2_1 << 4; $11_1 = HEAP32[$15_1 + 16 >> 2]; if ($67(HEAP32[$7_1 + $11_1 >> 2], $3)) { break block26 } $18_1 = HEAP32[($7_1 + $11_1 | 0) + 12 >> 2]; } if (($2_1 | 0) != ($4_1 | 0)) { $11_1 = $3; break block23; } $11_1 = $3; if ($67(11378, $3)) { break block23 } $0_1 = HEAP32[$15_1 + 16 >> 2]; $11_1 = HEAP32[$0_1 >> 2]; $18_1 = HEAP32[$0_1 + 12 >> 2]; break block23; } $2_1 = $2_1 + 1 | 0; continue; }; } $8_1 = $1063(HEAP32[$1_1 + 16 >> 2]); if (!$8_1) { break block2 } $2_1 = HEAPU8[$8_1 | 0]; if (($2_1 | 0) != 171 & ($2_1 | 0) != 60) { break block2 } $2_1 = 2; if (($1226($0_1, $8_1) | 0) == 2) { break block16 } if (HEAPU8[$8_1 | 0] != 171) { break block2 } HEAP8[$1_1 + 2 | 0] = HEAPU8[$1_1 | 0]; HEAP8[$1_1 | 0] = 175; $2_1 = 0; break block16; } if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { break block1 } $0_1 = $1119(HEAP32[$1_1 + 12 >> 2]); block30 : { block31 : { if (HEAPU8[$1_1 | 0] == 49) { $8_1 = HEAP32[$1_1 + 20 >> 2]; $3 = $1119(HEAP32[$8_1 + 8 >> 2]); if (($0_1 | 0) != ($3 | 0)) { break block30 } $2_1 = $8_1 + 24 | 0; break block31; } $2_1 = $1_1 + 16 | 0; } $3 = $1119(HEAP32[$2_1 >> 2]); } if (($0_1 | 0) == ($3 | 0)) { break block1 } $257($6_1, 15733, 0); $45(HEAP32[$6_1 >> 2], $1_1); break block1; } if (!(HEAPU8[$8_1 + 24 | 0] & 46)) { break block1 } $1228($6_1, $8_1, 4474, $1_1, $1_1); break block1; } if (!(HEAPU8[$1_1 + 5 | 0] & 16)) { break block1 } $2_1 = HEAP32[$8_1 + 16 >> 2]; block33 : { if (HEAPU8[$8_1 + 24 | 0] & 46) { $1228($6_1, $8_1, 5850, $1_1, $1_1); break block33; } $919($0_1, HEAP32[$1_1 + 20 >> 2]); } if (HEAP32[$8_1 + 16 >> 2] != ($2_1 | 0)) { HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 64; $0_1 = HEAP32[$1_1 + 20 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 536870912; } HEAP32[$8_1 + 24 >> 2] = HEAP32[$8_1 + 24 >> 2] | 64; break block1; } $14 = HEAP32[$10_1 + 20 >> 2]; block35 : { if (!(HEAPU8[$10_1 + 5 | 0] & 4)) { break block35 } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 524288; if (($3 | 0) == 2) { block39 : { block38 : { $2_1 = HEAP32[$11_1 + 24 >> 2]; if (HEAPU8[$2_1 | 0] == 154) { $2_1 = HEAP32[$2_1 + 8 >> 2]; $303($2_1, $5_1 + 224 | 0, $48($2_1), 1); $19_1 = HEAPF64[$5_1 + 224 >> 3]; if (!($19_1 > 1.0)) { break block38 } } HEAP32[$1_1 + 28 >> 2] = -1; break block39; } $19_1 = $19_1 * 134217728.0; if (Math_abs($19_1) < 2147483647.0) { $2_1 = ~~$19_1 } else { $2_1 = -2147483648 } HEAP32[$1_1 + 28 >> 2] = $2_1; if (($2_1 | 0) >= 0) { break block35 } } HEAP32[$5_1 + 96 >> 2] = $1_1; $257($6_1, 24976, $5_1 + 96 | 0); HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; break block35; } HEAP32[$1_1 + 28 >> 2] = HEAPU8[HEAP32[$10_1 + 32 >> 2]] == 117 ? 8388608 : 125829120; } block40 : { switch ($864($6_1, 31, 0, HEAP32[$10_1 + 32 >> 2], 0) | 0) { case 1: HEAP32[$5_1 + 80 >> 2] = $1_1; $257($6_1, 19251, $5_1 + 80 | 0); HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; default: HEAP8[$1_1 | 0] = 122; break block43; case 0: break block40; }; } block45 : { $4_1 = HEAP32[$10_1 + 4 >> 2]; if (!($4_1 & 1048576) & HEAP32[$1_1 + 4 >> 2] >= 0) { break block45 } $2_1 = 0; $3 = ($3 | 0) > 0 ? $3 : 0; $9_1 = $11_1 + 8 | 0; while (1) { if (($2_1 | 0) == ($3 | 0)) { break block45 } $16_1 = HEAP32[$9_1 + ($2_1 << 4) >> 2]; HEAP32[$16_1 + 4 >> 2] = HEAP32[$16_1 + 4 >> 2] | -2147483648; $2_1 = $2_1 + 1 | 0; continue; }; } if ($4_1 & 10240) { HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 1048576 } $2_1 = HEAP32[$8_1 + 24 >> 2]; block48 : { if (!($4_1 & 2048)) { if (!($2_1 & 42)) { break block48 } $1228($6_1, $8_1, 4998, 0, $1_1); $4_1 = HEAP32[$10_1 + 4 >> 2]; break block48; } HEAP8[$1_1 + 2 | 0] = $2_1 & 46; if (!($2_1 & 262144)) { break block48 } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 1073741824; } $9_1 = ($14 | 0) != 0; if (!(HEAPU8[$6_1 + 18 | 0] | !($4_1 & 262144) | HEAPU8[HEAP32[$6_1 >> 2] + 24 | 0] & 32)) { break block50 } block52 : { if (!($4_1 & 2621440)) { $4_1 = 1; break block52; } $4_1 = 1; if (HEAPU8[$6_1 + 224 | 0] > 1) { break block52 } $1177($6_1, $1_1, $10_1); } $2_1 = 1; } $3 = $6_1 + 224 | 0; if (HEAPU8[$6_1 + 224 | 0] >= 2) { break block53 } if ($10_1) { break block54 } $10_1 = 0; break block55; } $3 = $6_1 + 224 | 0; $10_1 = 0; if (HEAPU8[$6_1 + 224 | 0] >= 2) { break block53 } $4_1 = 1; $9_1 = 0; break block56; } if (!$7_1) { break block55 } if (!HEAP32[$10_1 + 24 >> 2]) { break block57 } } block58 : { if (!$9_1) { break block58 } $14 = HEAP32[$10_1 + 4 >> 2] & 65536; $16_1 = HEAP32[$8_1 + 24 >> 2]; if (!(!($16_1 & 1) | !($14 ? $7_1 : 1))) { if (!$7_1 | $16_1 & 16384) { break block58 } } HEAP32[$5_1 + 4 >> 2] = $1_1; HEAP32[$5_1 >> 2] = $7_1 | $14 ? 1721 : 13252; $257($6_1, 26836, $5_1); break block61; } if ($2_1) { break block62 } } if (HEAPU8[HEAP32[$6_1 >> 2] + 177 | 0]) { break block62 } HEAP32[$5_1 + 48 >> 2] = $1_1; $257($6_1, 19229, $5_1 + 48 | 0); HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; if ($9_1) { break block63 } break block64; } if (!$4_1) { HEAP32[$5_1 + 32 >> 2] = $1_1; $257($6_1, 26864, $5_1 + 32 | 0); HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; if (!$9_1) { break block64 } break block63; } if ($9_1) { break block63 } if (HEAP8[$1_1 + 7 | 0] & 1) { HEAP32[$5_1 + 16 >> 2] = $1_1; $257($6_1, 26978, $5_1 + 16 | 0); break block61; } if (!HEAP32[$1_1 + 12 >> 2]) { break block64 } $1130($6_1, $1_1); break block61; } HEAP32[$5_1 + 64 >> 2] = $1_1; $257($6_1, 10488, $5_1 - -64 | 0); HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; if (!$9_1) { break block64 } } HEAP32[$8_1 + 24 >> 2] = HEAP32[$8_1 + 24 >> 2] & (!$7_1 ^ -16385); break block67; } if (HEAP32[$1_1 + 12 >> 2] | HEAP8[$1_1 + 7 | 0] & 1) { break block67 } $921($0_1, $11_1); $2_1 = 1; if (!$9_1) { break block16 } break block68; } $921($0_1, $11_1); } $2_1 = HEAP32[$1_1 + 12 >> 2]; if ($2_1) { $921($0_1, HEAP32[$2_1 + 20 >> 2]) } block83 : { block71 : { block75 : { block80 : { block81 : { if (!(HEAP32[$6_1 + 40 >> 2] | !$7_1)) { $4_1 = HEAP32[$8_1 + 32 >> 2]; if (HEAPU8[$3 | 0] > 1) { break block71 } if ($4_1) { $2_1 = HEAP32[$4_1 + 72 >> 2] } else { $2_1 = 0 } $1_1 = HEAP32[$7_1 >> 2]; block76 : { if (!(HEAPU8[$7_1 + 16 | 0] | !$1_1)) { $1_1 = $1162($6_1, $2_1, $1_1); $2_1 = HEAP32[$6_1 >> 2]; if (!$1_1) { break block75 } HEAP32[$7_1 + 8 >> 2] = $887($2_1, HEAP32[$1_1 + 8 >> 2], 0); HEAP32[$7_1 + 12 >> 2] = $887(HEAP32[$6_1 >> 2], HEAP32[$1_1 + 12 >> 2], 0); HEAP32[$7_1 + 24 >> 2] = $906(HEAP32[$6_1 >> 2], HEAP32[$1_1 + 24 >> 2], 0); HEAP32[$7_1 + 28 >> 2] = $906(HEAP32[$6_1 >> 2], HEAP32[$1_1 + 28 >> 2], 0); HEAP8[$7_1 + 17 | 0] = HEAPU8[$1_1 + 17 | 0]; HEAP8[$7_1 + 18 | 0] = HEAPU8[$1_1 + 18 | 0]; $2_1 = HEAPU8[$1_1 + 16 | 0]; HEAP8[$7_1 + 16 | 0] = $2_1; HEAP8[$7_1 + 20 | 0] = HEAPU8[$1_1 + 20 | 0]; break block76; } $873($6_1, $7_1, $2_1); $2_1 = HEAPU8[$7_1 + 16 | 0]; } block77 : { if (!(HEAP32[$7_1 + 24 >> 2] | HEAP32[$7_1 + 28 >> 2]) | ($2_1 & 255) != 90) { break block77 } $1_1 = HEAP32[$7_1 + 12 >> 2]; if (!!$1_1 & HEAP32[$1_1 >> 2] == 1) { break block77 } $257($6_1, 10892, 0); break block80; } if (!(HEAP8[$10_1 + 6 | 0] & 1)) { break block80 } if (HEAP32[$7_1 + 40 >> 2]) { break block81 } $1_1 = HEAP32[$6_1 >> 2]; $11_1 = HEAP32[$10_1 + 32 >> 2]; $2_1 = 0; while (1) { if (($2_1 | 0) == 8) { break block80 } $3 = $2_1 << 4; $2_1 = $2_1 + 1 | 0; $3 = $3 + 50752 | 0; if (($11_1 | 0) != HEAP32[$3 >> 2]) { continue } break; }; $11($1_1, HEAP32[$7_1 + 24 >> 2]); $11($1_1, HEAP32[$7_1 + 28 >> 2]); HEAP8[$7_1 + 20 | 0] = 0; HEAP8[$7_1 + 18 | 0] = HEAP32[$3 + 12 >> 2]; $2_1 = HEAPU8[$3 + 8 | 0]; HEAP8[$7_1 + 17 | 0] = $2_1; HEAP8[$7_1 + 16 | 0] = HEAP32[$3 + 4 >> 2]; HEAP32[$7_1 + 24 >> 2] = 0; HEAP32[$7_1 + 28 >> 2] = 0; if (($2_1 | 0) != 87) { break block80 } HEAP32[$7_1 + 24 >> 2] = $942($1_1, 156, 24184); break block80; } HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 | 0] = 169; if (HEAP8[$1_1 + 7 | 0] & 1) { $920($0_1, HEAP32[HEAP32[$1_1 + 44 >> 2] + 40 >> 2]) } $0_1 = $5_1 + 272 | 0; $3 = $5_1 + 240 | 0; $2_1 = $8_1; while (1) { if (!$2_1) { break block83 } $11_1 = HEAP32[$2_1 + 4 >> 2]; $7_1 = $5_1 + 224 | 0; $4_1 = $7_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$5_1 + 224 >> 2] = 0; HEAP32[$5_1 + 228 >> 2] = 0; $14 = $0_1 + 8 | 0; HEAP32[$14 >> 2] = 0; HEAP32[$14 + 4 >> 2] = 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$4_1 >> 2] = 84; HEAP32[$5_1 + 236 >> 2] = 85; HEAP32[$5_1 + 228 >> 2] = 86; HEAP32[$5_1 + 248 >> 2] = $5_1 + 264; $4_1 = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 268 >> 2] = $11_1; HEAP32[$5_1 + 264 >> 2] = $4_1; $921($7_1, HEAP32[$1_1 + 20 >> 2]); $4_1 = HEAP32[$1_1 + 12 >> 2]; if ($4_1) { $921($7_1, HEAP32[$4_1 + 20 >> 2]) } if (HEAP8[$1_1 + 7 | 0] & 1) { $920($5_1 + 224 | 0, HEAP32[HEAP32[$1_1 + 44 >> 2] + 40 >> 2]) } $4_1 = HEAP32[$5_1 + 280 >> 2]; if ($4_1) { $16(HEAP32[$6_1 >> 2], $4_1) } $4_1 = HEAPU16[$5_1 + 244 >> 1]; if (!(!$4_1 | $4_1 & 1)) { HEAP8[$1_1 + 2 | 0] = (HEAPU8[$2_1 + 28 | 0] + HEAPU8[$1_1 + 2 | 0] | 0) + 1; $2_1 = HEAP32[$2_1 + 12 >> 2]; continue; } break; }; if (!$10_1) { break block83 } HEAP8[$1_1 + 2 | 0] = HEAPU8[$1_1 + 2 | 0] + HEAPU8[$2_1 + 28 | 0]; HEAP32[$2_1 + 24 >> 2] = HEAP32[$2_1 + 24 >> 2] | HEAP32[$10_1 + 4 >> 2] & 134221824 ^ 134217744; break block83; } $257($6_1, 4935, 0); } HEAP32[$7_1 + 44 >> 2] = $10_1; $2_1 = HEAP32[$6_1 >> 2]; } if (HEAPU8[$2_1 + 87 | 0]) { break block1 } } $921($0_1, HEAP32[$7_1 + 8 >> 2]); $921($0_1, HEAP32[$7_1 + 12 >> 2]); $920($0_1, HEAP32[$7_1 + 40 >> 2]); $1219($4_1, $7_1); HEAP32[$8_1 + 24 >> 2] = HEAP32[$8_1 + 24 >> 2] | 32768; } HEAP32[$8_1 + 24 >> 2] = HEAP32[$8_1 + 24 >> 2] | $12_1 & 16385; break block43; } $2_1 = HEAP32[$6_1 + 40 >> 2] ? 2 : 0; break block16; } HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; } $921($0_1, $11_1); break block43; } $26_1 = $6_1 + 136 | 0; $27 = $1_1 + 44 | 0; $20_1 = 168; $0_1 = 0; $12_1 = $8_1; while (1) { block89 : { $21_1 = HEAP32[$12_1 + 4 >> 2]; if (!$21_1) { $9_1 = 0; break block89; } $4_1 = $21_1 + 8 | 0; $9_1 = 0; $17_1 = 0; while (1) { block100 : { block104 : { block101 : { block91 : { if (($17_1 | 0) < HEAP32[$21_1 >> 2]) { $7_1 = HEAP32[$4_1 + 8 >> 2]; if (!(HEAPU8[$4_1 + 14 | 0] & 64)) { break block91 } $23_1 = HEAP32[HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2] + 28 >> 2]; $24_1 = $23_1 + 8 | 0; $25 = 0; $2_1 = 0; while (1) { block93 : { if (($2_1 | 0) < HEAP32[$23_1 >> 2]) { HEAP32[$5_1 + 264 >> 2] = 0; $3 = $24_1 + ($2_1 << 4) | 0; if (!$1232($3, $13_1, $10_1, $11_1, $5_1 + 264 | 0)) { break block93 } block99 : { if (!HEAP32[$5_1 + 264 >> 2]) { block95 : { if (($9_1 | 0) <= 0) { break block95 } block97 : { if (HEAPU8[$4_1 + 14 | 0] & 8) { if (($1233(HEAP32[$4_1 + 40 >> 2], $13_1) | 0) >= 0) { break block97 } } $358($15_1, HEAP32[$5_1 + 224 >> 2]); HEAP32[$5_1 + 224 >> 2] = 0; break block95; } $22_1 = HEAPU8[$4_1 + 12 | 0]; if (!($22_1 & 16)) { break block93 } if (!($22_1 & 8)) { $358($15_1, HEAP32[$5_1 + 224 >> 2]); $9_1 = 0; HEAP32[$5_1 + 224 >> 2] = 0; break block95; } $1234($6_1, $5_1 + 224 | 0, $0_1, HEAP16[$1_1 + 32 >> 1]); } $25 = 1; $9_1 = $9_1 + 1 | 0; break block99; } if (($9_1 | 0) > 0) { break block93 } } HEAP16[$1_1 + 32 >> 1] = $2_1; $22_1 = HEAPU8[$3 + 9 | 0] | HEAPU8[$3 + 10 | 0] << 8; $0_1 = $22_1 | 64; HEAP8[$3 + 9 | 0] = $0_1; HEAP8[$3 + 10 | 0] = $0_1 >>> 8; $16_1 = $16_1 + 1 | 0; $0_1 = $4_1; if (!($22_1 & 128)) { break block93 } } if (!$10_1) { break block100 } if (!$25) { break block101 } break block100; } $2_1 = $2_1 + 1 | 0; continue; }; } if (!$0_1) { $0_1 = 0; break block89; } HEAP32[$1_1 + 28 >> 2] = HEAP32[$0_1 + 16 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$1_1 + 44 >> 2] = $2_1; if (HEAPU8[$0_1 + 12 | 0] & 72) { HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 2097152 } $18_1 = HEAP32[$2_1 + 60 >> 2]; break block89; } if (!$10_1) { break block104 } } block105 : { if (!$11_1) { break block105 } if (HEAP32[$7_1 + 60 >> 2] != ($18_1 | 0)) { break block100 } if ($18_1) { break block105 } if (HEAPU8[$11_1 + 1 | 0] | HEAPU8[$11_1 | 0] != 42) { break block100 } } $2_1 = HEAP32[$4_1 + 4 >> 2]; if ($2_1) { if ($67($10_1, $2_1)) { break block100 } if (HEAPU8[$6_1 + 224 | 0] < 2) { break block104 } $918($6_1, 0, $27); break block104; } if (!$67($10_1, HEAP32[$7_1 >> 2])) { break block104 } if (HEAP32[$7_1 + 20 >> 2] != 1) { break block100 } if (!$1235($10_1, $7_1, $11_1)) { break block100 } } $25 = $886($13_1); $3 = 0; $2_1 = HEAP16[$7_1 + 34 >> 1]; $23_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $2_1 = HEAP32[$7_1 + 4 >> 2]; block107 : { while (1) { if (($3 | 0) == ($23_1 | 0)) { break block107 } block113 : { block108 : { if (($25 | 0) != HEAPU8[$2_1 + 7 | 0]) { break block108 } if ($67(HEAP32[$2_1 >> 2], $13_1)) { break block108 } block109 : { if (($9_1 | 0) <= 0) { break block109 } block111 : { if (HEAPU8[$4_1 + 14 | 0] & 8) { if (($1233(HEAP32[$4_1 + 40 >> 2], $13_1) | 0) >= 0) { break block111 } } $358($15_1, HEAP32[$5_1 + 224 >> 2]); HEAP32[$5_1 + 224 >> 2] = 0; break block109; } $24_1 = HEAPU8[$4_1 + 12 | 0]; if (!($24_1 & 16)) { break block108 } if (!($24_1 & 8)) { $358($15_1, HEAP32[$5_1 + 224 >> 2]); $9_1 = 0; HEAP32[$5_1 + 224 >> 2] = 0; break block109; } $1234($6_1, $5_1 + 224 | 0, $0_1, HEAP16[$1_1 + 32 >> 1]); } HEAP16[$1_1 + 32 >> 1] = HEAP16[$7_1 + 32 >> 1] == ($3 | 0) ? -1 : $3; $9_1 = $9_1 + 1 | 0; if (!(HEAPU8[$4_1 + 14 | 0] & 64)) { break block113 } $1236($4_1, $3); break block113; } $2_1 = $2_1 + 12 | 0; $3 = $3 + 1 | 0; continue; } break; }; $0_1 = $4_1; } if ($9_1) { break block100 } $2_1 = HEAP32[$7_1 + 28 >> 2] & 512; $0_1 = $2_1 ? $0_1 : $4_1; $16_1 = ($2_1 >>> 9 ^ 1) + $16_1 | 0; $9_1 = 0; } $4_1 = $4_1 + 48 | 0; $17_1 = $17_1 + 1 | 0; continue; }; } block114 : { if ($9_1 | $11_1) { break block114 } $7_1 = 0; $2_1 = HEAP32[$26_1 >> 2]; block115 : { if (!$2_1) { break block115 } $3 = HEAPU8[$6_1 + 162 | 0]; block118 : { if (HEAPU8[$6_1 + 163 | 0]) { if (!(HEAPU8[$12_1 + 25 | 0] & 4)) { break block115 } block117 : { if (!$10_1) { break block117 } if (!$67($10_1, HEAP32[$2_1 >> 2])) { break block117 } if (!$1235($10_1, $2_1, 0)) { break block115 } } $7_1 = ($3 | 0) != 129; break block118; } block119 : { if (!$10_1 | ($3 | 0) == 129) { break block119 } if ($67(1755, $10_1)) { break block119 } $7_1 = 1; break block118; } if (!$10_1 | ($3 | 0) == 128) { break block115 } if ($67(15063, $10_1)) { break block115 } } HEAP32[$1_1 + 28 >> 2] = $7_1; $7_1 = $2_1; } block120 : { if (!$10_1 | !(HEAP32[$12_1 + 24 >> 2] & 512)) { break block120 } $2_1 = HEAP32[$12_1 + 8 >> 2]; if (!$2_1) { break block120 } if ($67(16542, $10_1)) { break block120 } $7_1 = HEAP32[HEAP32[$2_1 + 32 >> 2] + 16 >> 2]; HEAP32[$1_1 + 28 >> 2] = 2; } block121 : { if (!$7_1) { break block121 } $17_1 = $886($13_1); $3 = 0; $9_1 = HEAP16[$7_1 + 34 >> 1]; $4_1 = ($9_1 | 0) > 0 ? $9_1 : 0; $16_1 = $16_1 + 1 | 0; $2_1 = HEAP32[$7_1 + 4 >> 2]; $18_1 = HEAP32[$7_1 + 60 >> 2]; block125 : { block122 : { while (1) { if (($3 | 0) == ($4_1 | 0)) { break block122 } block124 : { if (HEAPU8[$2_1 + 7 | 0] == ($17_1 | 0)) { if (!$67(HEAP32[$2_1 >> 2], $13_1)) { break block124 } } $2_1 = $2_1 + 12 | 0; $3 = $3 + 1 | 0; continue; } break; }; $4_1 = HEAP16[$7_1 + 32 >> 1] == ($3 | 0) ? -1 : $3; if (($9_1 | 0) > ($4_1 | 0)) { break block125 } } if (!$417($13_1)) { break block125 } $4_1 = HEAPU8[$7_1 + 29 | 0] & 2 ? $4_1 : -1; } if (($4_1 | 0) >= ($9_1 | 0)) { break block121 } block128 : { $0_1 = HEAP32[$1_1 + 28 >> 2]; if (($0_1 | 0) == 2) { if (HEAPU8[$6_1 + 224 | 0] >= 2) { HEAP32[$1_1 + 44 >> 2] = $7_1; HEAP16[$1_1 + 32 >> 1] = $4_1; $9_1 = 1; $0_1 = 0; $20_1 = 168; break block114; } HEAP32[$1_1 + 28 >> 2] = HEAP32[HEAP32[$12_1 + 8 >> 2] + 36 >> 2] + $1111($7_1, $4_1 << 16 >> 16); $9_1 = 1; break block128; } HEAP32[$27 >> 2] = $7_1; if (HEAPU8[$6_1 + 163 | 0]) { HEAP16[$1_1 + 32 >> 1] = $4_1; HEAP8[$1_1 + 2 | 0] = 168; $9_1 = 1; HEAP32[$1_1 + 28 >> 2] = ((HEAP32[$12_1 + 8 >> 2] + $1111($7_1, $4_1 << 16 >> 16) | 0) + Math_imul($0_1, HEAP16[$7_1 + 34 >> 1] + 1 | 0) | 0) + 1; break block128; } HEAP16[$1_1 + 32 >> 1] = $4_1; block131 : { if (($4_1 | 0) < 0) { HEAP8[$1_1 + 1 | 0] = 68; break block131; } $2_1 = $4_1 >>> 0 > 31 ? -1 : 1 << $4_1; if (!$0_1) { HEAP32[$6_1 + 152 >> 2] = $2_1 | HEAP32[$6_1 + 152 >> 2]; break block131; } HEAP32[$6_1 + 156 >> 2] = $2_1 | HEAP32[$6_1 + 156 >> 2]; } $9_1 = 1; $0_1 = 0; $20_1 = 78; break block114; } $0_1 = 0; $20_1 = 176; break block114; } $9_1 = 0; } block134 : { if (!(!$0_1 | (($16_1 | 0) <= 0 | $9_1))) { $4_1 = HEAP32[$12_1 + 24 >> 2]; if ($4_1 & 40) { break block134 } if (!$417($13_1)) { break block134 } $2_1 = HEAPU8[$0_1 + 13 | 0] | HEAPU8[$0_1 + 14 | 0] << 8; if (!(!(HEAPU8[HEAP32[$0_1 + 8 >> 2] + 29 | 0] & 2) | $2_1 & 16384)) { break block134 } if (!($2_1 & 16384)) { HEAP16[$1_1 + 32 >> 1] = 65535 } HEAP8[$1_1 + 1 | 0] = 68; $9_1 = $16_1; break block137; } if ($9_1) { break block137 } $4_1 = HEAP32[$12_1 + 24 >> 2]; } block138 : { if (!($4_1 & 128) | $10_1) { break block138 } $2_1 = 0; $3 = HEAP32[$12_1 + 8 >> 2]; $7_1 = HEAP32[$3 >> 2]; $17_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $21_1 = $3 + 8 | 0; while (1) { if (($2_1 | 0) == ($17_1 | 0)) { break block138 } block139 : { $7_1 = $21_1 + ($2_1 << 4) | 0; if (HEAPU8[$7_1 + 9 | 0] & 3) { break block139 } $9_1 = HEAP32[$7_1 + 4 >> 2]; if ($66($9_1, $13_1)) { break block139 } $11_1 = HEAP32[$7_1 >> 2]; $0_1 = HEAP32[$11_1 + 4 >> 2]; if (!(!($0_1 & 16) | $4_1 & 1)) { HEAP32[$5_1 + 208 >> 2] = $9_1; $257($6_1, 6789, $5_1 + 208 | 0); $2_1 = 2; break block16; } if (!(!($0_1 & 32768) | ($4_1 & 16384 ? ($8_1 | 0) == ($12_1 | 0) : 0))) { HEAP32[$5_1 + 192 >> 2] = $9_1; $257($6_1, 6593, $5_1 + 192 | 0); $2_1 = 2; break block16; } if (($1119($11_1) | 0) != 1) { $257($6_1, 15733, 0); $2_1 = 2; break block16; } $1237($6_1, $3, $2_1, $1_1, $28_1); if (HEAPU8[$6_1 + 224 | 0] < 2) { break block144 } $918($6_1, 0, $1_1); break block144; } $2_1 = $2_1 + 1 | 0; continue; }; } $28_1 = $28_1 + 1 | 0; $12_1 = HEAP32[$12_1 + 12 >> 2]; if ($12_1) { continue } break; }; block146 : { if ($10_1) { $2_1 = 1; break block146; } block147 : { if (!(HEAPU8[$1_1 + 4 | 0] & 128)) { break block147 } block148 : { if (HEAPU8[$15_1 + 177 | 0]) { break block148 } $3 = HEAP32[$15_1 + 32 >> 2]; if (HEAP8[$8_1 + 26 | 0] & 1) { if (($3 & 1342177281) == 1073741825) { break block148 } $2_1 = 29; } else { $2_1 = 30 } if (!($3 >>> $2_1 & 1)) { break block147 } } HEAP32[$5_1 + 176 >> 2] = $13_1; $64(28, 29409, $5_1 + 176 | 0); $8_1 = HEAP32[$6_1 + 8 >> 2]; block151 : { if (!$8_1) { break block151 } $2_1 = $48($13_1); $0_1 = $325($15_1, $2_1 + 5 | 0, 0); if (!$0_1) { break block151 } HEAP32[$0_1 >> 2] = HEAP32[$8_1 + 208 >> 2]; HEAP32[$8_1 + 208 >> 2] = $0_1; $8_1 = $2_1 + 1 | 0; if (!$8_1) { break block151 } wasm2js_memory_copy($0_1 + 4 | 0, $13_1, $8_1); } HEAP32[$1_1 + 44 >> 2] = 0; HEAP32[$1_1 + 48 >> 2] = 0; HEAP8[$1_1 | 0] = 118; break block43; } $2_1 = 1; if ($943($1_1)) { break block16 } } $12_1 = 0; $9_1 = 0; break block152; } $2_1 = 1; break block16; } $3 = 1; $2_1 = 0; if (($9_1 | 0) == 1) { break block153 } } block157 : { block156 : { $3 = HEAP32[$5_1 + 224 >> 2]; if ($3) { if (HEAP32[$3 >> 2] == ($9_1 - 1 | 0)) { $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!($2_1 & 8388608)) { break block156 } HEAP32[$1_1 + 4 >> 2] = $2_1 & -8388609; break block157; } $333($15_1, $3); } $3 = $2_1 ? 11114 : 14063; block159 : { if ($11_1) { HEAP32[$5_1 + 172 >> 2] = $13_1; HEAP32[$5_1 + 168 >> 2] = $10_1; HEAP32[$5_1 + 164 >> 2] = $11_1; HEAP32[$5_1 + 160 >> 2] = $3; $257($6_1, 6184, $5_1 + 160 | 0); break block159; } if ($10_1) { HEAP32[$5_1 + 152 >> 2] = $13_1; HEAP32[$5_1 + 148 >> 2] = $10_1; HEAP32[$5_1 + 144 >> 2] = $3; $257($6_1, 6397, $5_1 + 144 | 0); break block159; } if (!(!$2_1 | !(HEAPU8[$14 + 4 | 0] & 128))) { HEAP32[$5_1 + 132 >> 2] = $13_1; HEAP32[$5_1 + 128 >> 2] = 11114; $257($6_1, 21019, $5_1 + 128 | 0); break block159; } HEAP32[$5_1 + 116 >> 2] = $13_1; HEAP32[$5_1 + 112 >> 2] = $3; $257($6_1, 7843, $5_1 + 112 | 0); } $45(HEAP32[$6_1 >> 2], $1_1); HEAP8[$6_1 + 17 | 0] = 1; HEAP32[$8_1 + 20 >> 2] = HEAP32[$8_1 + 20 >> 2] + 1; $3 = 0; $20_1 = 122; break block153; } $11($15_1, HEAP32[$1_1 + 12 >> 2]); HEAP32[$1_1 + 12 >> 2] = 0; $11($15_1, HEAP32[$1_1 + 16 >> 2]); HEAP32[$1_1 + 16 >> 2] = 0; } $1234($6_1, $5_1 + 224 | 0, $0_1, HEAP16[$1_1 + 32 >> 1]); HEAP32[$1_1 + 8 >> 2] = 14821; HEAP8[$1_1 | 0] = 172; HEAP32[$1_1 + 20 >> 2] = HEAP32[$5_1 + 224 >> 2]; break block144; } if (!(HEAPU8[$1_1 + 6 | 0] & 129)) { $11($15_1, HEAP32[$1_1 + 12 >> 2]); HEAP32[$1_1 + 12 >> 2] = 0; $11($15_1, HEAP32[$1_1 + 16 >> 2]); HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 8388608; } block163 : { if (!$0_1) { break block163 } if (HEAP16[$1_1 + 32 >> 1] >= 0) { $2_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] | $1238($1_1); HEAP32[$0_1 + 28 >> 2] = i64toi32_i32$HIGH_BITS | $2_1; break block163; } $2_1 = HEAPU8[$0_1 + 13 | 0] | HEAPU8[$0_1 + 14 | 0] << 8 | 32768; HEAP8[$0_1 + 13 | 0] = $2_1; HEAP8[$0_1 + 14 | 0] = $2_1 >>> 8; } HEAP8[$1_1 | 0] = $20_1; $2_1 = 2; if (!$3) { break block16 } } $2_1 = HEAP32[$6_1 >> 2]; block165 : { if (!HEAP32[$2_1 + 364 >> 2]) { break block165 } $0_1 = HEAPU8[$1_1 | 0]; if (($0_1 | 0) != 168 & ($0_1 | 0) != 78) { break block165 } $3 = HEAP32[$12_1 + 4 >> 2]; $4_1 = $309($2_1, $18_1); if (($4_1 | 0) < 0) { break block165 } if (($0_1 | 0) != 78) { $2_1 = 0; $0_1 = HEAP32[$3 >> 2]; $0_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $3 = $3 + 8 | 0; while (1) { if (($0_1 | 0) == ($2_1 | 0)) { break block165 } $11_1 = Math_imul($2_1, 48); $2_1 = $2_1 + 1 | 0; $11_1 = $3 + $11_1 | 0; if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$11_1 + 16 >> 2]) { continue } break; }; $26_1 = $11_1 + 8 | 0; } $0_1 = HEAP32[$26_1 >> 2]; if (!$0_1) { break block165 } $2_1 = HEAP32[$0_1 >> 2]; block169 : { block168 : { $3 = HEAP16[$1_1 + 32 >> 1]; if (($3 | 0) >= 0) { break block168 } $3 = HEAP16[$0_1 + 32 >> 1]; if (($3 | 0) >= 0) { break block168 } $0_1 = 20545; break block169; } $0_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + Math_imul($3, 12) >> 2]; } if (($1239($6_1, $2_1, $0_1, $4_1) | 0) != 2) { break block165 } HEAP8[$1_1 | 0] = 122; } while (1) { $2_1 = 1; HEAP32[$8_1 + 16 >> 2] = HEAP32[$8_1 + 16 >> 2] + 1; if (($8_1 | 0) == ($12_1 | 0)) { break block16 } $8_1 = HEAP32[$8_1 + 12 >> 2]; continue; }; } $0_1 = $5_1 + 288 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $1227($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $3 = global$0 - 48 | 0; $2_1 = $3; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $10_1 = 1; $2_1 = HEAP32[$1_1 + 4 >> 2]; block : { if ($2_1 & 4) { break block } $7_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 24 >> 2]; if (!($2_1 & 64)) { $1017($7_1, $1_1, $6_1); $10_1 = HEAP32[$7_1 + 40 >> 2] ? 2 : 1; break block; } $11_1 = HEAP32[$1_1 + 52 >> 2]; $12_1 = HEAP32[$7_1 >> 2]; $8_1 = $3 + 12 | 0; $17_1 = $8_1 + 24 | 0; $14 = $8_1 + 16 | 0; $15_1 = $8_1 + 8 | 0; $2_1 = $1_1; while (1) { if ($2_1) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 4; HEAP32[$17_1 >> 2] = 0; HEAP32[$14 >> 2] = 0; HEAP32[$14 + 4 >> 2] = 0; HEAP32[$15_1 >> 2] = 0; HEAP32[$15_1 + 4 >> 2] = 0; HEAP32[$8_1 >> 2] = 0; HEAP32[$8_1 + 4 >> 2] = 0; HEAP32[$3 + 40 >> 2] = $2_1; HEAP32[$3 + 8 >> 2] = $7_1; $10_1 = 2; if ($1096($3 + 8 | 0, HEAP32[$2_1 + 60 >> 2])) { break block } if (HEAP8[$2_1 + 6 | 0] & 1) { HEAP32[HEAP32[HEAP32[HEAP32[$2_1 + 32 >> 2] + 52 >> 2] >> 2] + 48 >> 2] = HEAP32[$2_1 + 48 >> 2]; HEAP32[$2_1 + 48 >> 2] = 0; } if ($6_1) { HEAP32[$6_1 + 28 >> 2] = HEAP32[$6_1 + 28 >> 2] + 1 } $0_1 = 0; while (1) { $4_1 = HEAP32[$2_1 + 32 >> 2]; if (($0_1 | 0) < HEAP32[$4_1 >> 2]) { $4_1 = $4_1 + Math_imul($0_1, 48) | 0; block6 : { if (!(HEAPU8[$4_1 + 21 | 0] & 4)) { break block6 } $5_1 = $4_1 + 8 | 0; $4_1 = HEAP32[HEAP32[$5_1 + 44 >> 2] >> 2]; if (HEAPU8[$4_1 + 4 | 0] & 4) { break block6 } if ($6_1) { $9_1 = HEAP32[$6_1 + 16 >> 2] } else { $9_1 = 0 } $18_1 = HEAP32[$7_1 + 264 >> 2]; $16_1 = HEAP32[$5_1 >> 2]; if ($16_1) { HEAP32[$7_1 + 264 >> 2] = $16_1; $4_1 = HEAP32[HEAP32[$5_1 + 44 >> 2] >> 2]; } $1240($7_1, $4_1, $6_1); HEAP32[$7_1 + 264 >> 2] = $18_1; if (HEAP32[$7_1 + 40 >> 2]) { break block } if (!$6_1) { break block6 } $4_1 = (HEAPU8[$5_1 + 13 | 0] | HEAPU8[$5_1 + 14 | 0] << 8) & 65519 | (HEAP32[$6_1 + 16 >> 2] > ($9_1 | 0) ? 16 : 0); HEAP8[$5_1 + 13 | 0] = $4_1; HEAP8[$5_1 + 14 | 0] = $4_1 >>> 8; } $0_1 = $0_1 + 1 | 0; continue; } break; }; block10 : { if (!$6_1) { break block10 } $0_1 = HEAP32[$6_1 + 28 >> 2]; if (!$0_1) { break block10 } HEAP32[$6_1 + 28 >> 2] = $0_1 - 1; } HEAP32[$3 + 20 >> 2] = $6_1; HEAP32[$3 + 12 >> 2] = $4_1; HEAP32[$3 + 32 >> 2] = 16385; if ($1126($3 + 8 | 0, HEAP32[$2_1 + 28 >> 2])) { break block } $0_1 = HEAP32[$3 + 32 >> 2]; $4_1 = HEAP32[$2_1 + 40 >> 2]; block13 : { if ($4_1 | $0_1 & 16) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | $0_1 & 134221824 | 8; $0_1 = $0_1 & -16385; break block13; } $0_1 = $0_1 & -16402; } $5_1 = HEAP32[$2_1 + 28 >> 2]; $0_1 = $0_1 | 128; HEAP32[$3 + 32 >> 2] = $0_1; HEAP32[$3 + 16 >> 2] = $5_1; $5_1 = HEAP32[$2_1 + 44 >> 2]; if ($5_1) { if (!(HEAPU8[$2_1 + 4 | 0] & 8)) { $257($7_1, 1214, 0); break block; } if ($1096($3 + 8 | 0, $5_1)) { break block } $0_1 = HEAP32[$3 + 32 >> 2]; } HEAP32[$3 + 32 >> 2] = $0_1 | 1048576; if ($1096($3 + 8 | 0, HEAP32[$2_1 + 36 >> 2])) { break block } HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 32 >> 2] & -1048577; $0_1 = 0; while (1) { $5_1 = HEAP32[$2_1 + 32 >> 2]; if (($0_1 | 0) < HEAP32[$5_1 >> 2]) { $5_1 = $5_1 + Math_imul($0_1, 48) | 0; if (HEAPU8[$5_1 + 21 | 0] & 8) { if ($1126($3 + 8 | 0, HEAP32[($5_1 + 8 | 0) + 32 >> 2])) { break block } } $0_1 = $0_1 + 1 | 0; continue; } break; }; block18 : { if (HEAPU8[$7_1 + 224 | 0] < 2) { break block18 } $9_1 = $2_1 + 72 | 0; while (1) { $0_1 = HEAP32[$9_1 >> 2]; if (!$0_1) { break block18 } $5_1 = $3 + 8 | 0; if ($1126($5_1, HEAP32[$0_1 + 12 >> 2])) { break block } $9_1 = $0_1 + 36 | 0; if (!$1126($5_1, HEAP32[$0_1 + 8 >> 2])) { continue } break; }; break block; } HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 32 >> 2] | 16385; if (HEAP8[$2_1 + 6 | 0] & 1) { $0_1 = HEAP32[HEAP32[HEAP32[$2_1 + 32 >> 2] + 52 >> 2] >> 2]; HEAP32[$2_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = 0; } $0_1 = HEAP32[$2_1 + 48 >> 2]; if (!(!$0_1 | !$13_1 & ($11_1 | 0) != 0)) { if ($1241($3 + 8 | 0, $2_1, $0_1, 19657)) { break block } } if (HEAPU8[$12_1 + 87 | 0]) { break block } HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 32 >> 2] & -16385; block21 : { if (!$4_1) { break block21 } if ($1241($3 + 8 | 0, $2_1, $4_1, 20017) | HEAPU8[$12_1 + 87 | 0]) { break block } $0_1 = 0; $5_1 = HEAP32[$4_1 >> 2]; $5_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $9_1 = $4_1 + 8 | 0; while (1) { if (($0_1 | 0) == ($5_1 | 0)) { break block21 } if (HEAPU8[HEAP32[$9_1 >> 2] + 4 | 0] & 16) { $257($7_1, 13430, 0); break block; } else { $9_1 = $9_1 + 16 | 0; $0_1 = $0_1 + 1 | 0; continue; } }; } $0_1 = HEAP32[$2_1 + 56 >> 2]; if (!$0_1 | HEAP32[HEAP32[$2_1 + 28 >> 2] >> 2] == HEAP32[HEAP32[$0_1 + 28 >> 2] >> 2]) { $13_1 = $13_1 + 1 | 0; $2_1 = HEAP32[$2_1 + 52 >> 2]; continue; } else { $975($7_1, $0_1); break block; } } break; }; $10_1 = 1; if (!$11_1) { break block } $13_1 = HEAP32[$1_1 + 48 >> 2]; if (!$13_1) { break block } $0_1 = HEAP32[$13_1 >> 2]; $11_1 = HEAP32[$7_1 >> 2]; block28 : { if (($0_1 | 0) <= HEAP32[$11_1 + 128 >> 2]) { $2_1 = 0; $10_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $14 = $13_1 + 17 | 0; $0_1 = 0; while (1) { if (!(($0_1 | 0) == ($10_1 | 0))) { $4_1 = $14 + ($0_1 << 4) | 0; $6_1 = (HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8) & 65531; HEAP8[$4_1 | 0] = $6_1; HEAP8[$4_1 + 1 | 0] = $6_1 >>> 8; $0_1 = $0_1 + 1 | 0; continue; } break; }; while (1) { $6_1 = $1_1; HEAP32[$6_1 + 56 >> 2] = $2_1; $2_1 = $6_1; $1_1 = HEAP32[$2_1 + 52 >> 2]; if ($1_1) { continue } break; }; $10_1 = $13_1 + 8 | 0; $4_1 = 1; label9 : while (1) { if ($4_1 ? !$6_1 : 1) { $0_1 = 0; $1_1 = HEAP32[$13_1 >> 2]; $1_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $10_1 = 1; while (1) { if (($0_1 | 0) == ($1_1 | 0)) { break block } $2_1 = $0_1 << 4; $0_1 = $0_1 + 1 | 0; if (HEAPU8[$2_1 + $14 | 0] & 4) { continue } break; }; HEAP32[$3 >> 2] = $0_1; $257($7_1, 3359, $3); break block28; } $15_1 = HEAP32[$6_1 + 28 >> 2]; $0_1 = 0; $2_1 = $10_1; $9_1 = 0; while (1) { $4_1 = $0_1; block36 : { block30 : { if (($9_1 | 0) < HEAP32[$13_1 >> 2]) { HEAP32[$3 + 44 >> 2] = -1; if (HEAPU8[$2_1 + 9 | 0] & 4) { break block30 } $8_1 = $1063(HEAP32[$2_1 >> 2]); if (!$8_1) { break block30 } block33 : { if ($1074($8_1, $3 + 44 | 0, 0)) { $0_1 = HEAP32[$15_1 >> 2]; $1_1 = HEAP32[$3 + 44 >> 2]; if (($1_1 | 0) > 0 & ($0_1 | 0) >= ($1_1 | 0)) { break block33 } $1242($7_1, 19657, $9_1 + 1 | 0, $0_1, $8_1); break block28; } $1_1 = $1243($15_1, $8_1); if (!$1_1) { $1_1 = 0; $0_1 = $906($11_1, $8_1, 0); block35 : { if (HEAPU8[$11_1 + 87 | 0]) { break block35 } $1_1 = $1244($7_1, $6_1, $0_1); if (HEAPU8[$7_1 + 224 | 0] < 2 | ($1_1 | 0) <= 0) { break block35 } $1244($7_1, $6_1, $8_1); } $11($11_1, $0_1); } $0_1 = 1; if (($1_1 | 0) <= 0) { break block36 } } if (HEAPU8[$7_1 + 224 | 0] <= 1) { $12_1 = $942($11_1, 156, 0); if (!$12_1) { break block28 } HEAP32[$12_1 + 8 >> 2] = $1_1; HEAP32[$12_1 + 4 >> 2] = HEAP32[$12_1 + 4 >> 2] | 2048; $0_1 = HEAP32[$2_1 >> 2]; block39 : { if (($0_1 | 0) == ($8_1 | 0)) { HEAP32[$2_1 >> 2] = $12_1; break block39; } while (1) { $5_1 = $0_1; $0_1 = HEAP32[$0_1 + 12 >> 2]; if (HEAPU8[$0_1 | 0] == 114) { continue } break; }; HEAP32[$5_1 + 12 >> 2] = $12_1; } $790($11_1, $8_1); HEAP16[$2_1 + 12 >> 1] = $1_1; } $0_1 = HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8 | 4; HEAP8[$2_1 + 9 | 0] = $0_1; HEAP8[$2_1 + 10 | 0] = $0_1 >>> 8; break block30; } $6_1 = HEAP32[$6_1 + 56 >> 2]; continue label9; } $0_1 = $4_1; } $2_1 = $2_1 + 16 | 0; $9_1 = $9_1 + 1 | 0; continue; }; }; } $257($7_1, 13396, 0); } $10_1 = 2; } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $10_1 | 0; } function $1228($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $1_1 = HEAP32[$1_1 + 24 >> 2]; $6_1 = 5026; block1 : { if ($1_1 & 32) { break block1 } $6_1 = 3885; if ($1_1 & 4) { break block1 } $6_1 = $1_1 & 8 ? 5169 : 5425; } HEAP32[$5_1 + 4 >> 2] = $6_1; HEAP32[$5_1 >> 2] = $2_1; $257($0_1, 6676, $5_1); if ($3) { HEAP8[$3 | 0] = 122 } $45(HEAP32[$0_1 >> 2], $4_1); $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1229($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block : { $6_1 = HEAP32[$1_1 + 32 >> 2]; $4_1 = HEAP32[$6_1 >> 2]; if (!$4_1) { break block } $2_1 = HEAP32[$0_1 + 24 >> 2]; $5_1 = HEAP32[$2_1 + 8 >> 2]; $1_1 = HEAP32[$2_1 + 12 >> 2]; $3 = $1_1 + ($4_1 >> 31) | 0; $0_1 = $4_1 + $5_1 | 0; $3 = $0_1 >>> 0 < $4_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$2_1 + 8 >> 2] = $0_1; HEAP32[$2_1 + 12 >> 2] = $3; $3 = $55(HEAP32[$2_1 >> 2], HEAP32[$2_1 + 16 >> 2], $0_1 << 2, $3 << 2 | $0_1 >>> 30); if (!$3) { HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; $9_1 = 2; break block; } HEAP32[$2_1 + 16 >> 2] = $3; $4_1 = $6_1 + 24 | 0; $2_1 = 0; $0_1 = 0; while (1) { $7_1 = HEAP32[$6_1 >> 2]; $8_1 = $7_1 >> 31; if (($8_1 | 0) <= ($0_1 | 0) & $2_1 >>> 0 >= $7_1 >>> 0 | ($0_1 | 0) > ($8_1 | 0)) { break block } HEAP32[$3 + ($5_1 << 2) >> 2] = HEAP32[$4_1 + Math_imul($2_1, 48) >> 2]; $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; $0_1 = $2_1 ? $0_1 : $0_1 + 1 | 0; continue; }; } return $9_1 | 0; } function $1230($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 24 >> 2]; $0_1 = HEAP32[$2_1 + 8 >> 2]; $3 = HEAP32[$2_1 + 12 >> 2]; if ($0_1 | $3) { $1_1 = HEAP32[HEAP32[$1_1 + 32 >> 2] >> 2]; HEAP32[$2_1 + 8 >> 2] = $0_1 - $1_1; HEAP32[$2_1 + 12 >> 2] = $3 - (($1_1 >> 31) + ($0_1 >>> 0 < $1_1 >>> 0) | 0); } } function $1231($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block1 : { block : { switch (HEAPU8[$1_1 | 0] - 168 | 0) { case 0: case 2: break block; default: break block1; }; } $7_1 = HEAP32[$0_1 + 24 >> 2]; $2_1 = HEAP32[$7_1 + 4 >> 2]; if ($2_1) { $3 = HEAP32[$2_1 >> 2] } $3 = ($3 | 0) > 0 ? $3 : 0; $2_1 = $2_1 + 24 | 0; while (1) { block4 : { if (($3 | 0) == ($4_1 | 0)) { $4_1 = 0; $3 = 0; $2_1 = HEAP32[$7_1 + 8 >> 2]; $5_1 = HEAP32[$7_1 + 12 >> 2]; $6_1 = !!$2_1 & ($5_1 | 0) >= 0 | ($5_1 | 0) > 0; $2_1 = $6_1 ? $2_1 : 0; $8_1 = $6_1 ? $5_1 : 0; $6_1 = 2; while (1) { if (($4_1 | 0) == ($2_1 | 0) & ($3 | 0) == ($8_1 | 0)) { break block4 } $5_1 = $4_1; $4_1 = $4_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; if (HEAP32[HEAP32[$7_1 + 16 >> 2] + ($5_1 << 2) >> 2] != HEAP32[$1_1 + 28 >> 2]) { continue } break; }; break block1; } $6_1 = 1; $5_1 = Math_imul($4_1, 48); $4_1 = $4_1 + 1 | 0; if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$2_1 + $5_1 >> 2]) { continue } } break; }; HEAP16[$0_1 + 20 >> 1] = HEAPU16[$0_1 + 20 >> 1] | $6_1; } return 0; } function $1232($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = (HEAPU8[$0_1 + 9 | 0] | HEAPU8[$0_1 + 10 | 0] << 8) & 3; block1 : { if (($7_1 | 0) != 2) { if (!$4_1 | ($7_1 | 0) != 3) { break block1 } } $6_1 = HEAP32[$0_1 + 4 >> 2]; $0_1 = 0; while (1) { $8_1 = $0_1 + $6_1 | 0; $5_1 = HEAPU8[$8_1 | 0]; if (!(!$5_1 | ($5_1 | 0) == 46)) { $0_1 = $0_1 + 1 | 0; continue; } break; }; if ($3) { $5_1 = 0; if ($68($6_1, $3, $0_1) | HEAPU8[$0_1 + $3 | 0]) { break block1 } } $3 = $8_1 + 1 | 0; $0_1 = 0; while (1) { $6_1 = $0_1 + $3 | 0; $5_1 = HEAPU8[$6_1 | 0]; if (!(!$5_1 | ($5_1 | 0) == 46)) { $0_1 = $0_1 + 1 | 0; continue; } break; }; if ($2_1) { $5_1 = 0; if ($68($3, $2_1, $0_1) | HEAPU8[$0_1 + $2_1 | 0]) { break block1 } } $5_1 = 1; block9 : { if ($1_1) { block8 : { switch ($7_1 - 2 | 0) { case 0: return !$67($6_1 + 1 | 0, $1_1); case 1: break block8; default: break block1; }; } if ($417($1_1)) { break block9 } return 0; } if (($7_1 | 0) != 3) { break block1 } } HEAP32[$4_1 >> 2] = 1; } return $5_1; } function $1233($0_1, $1_1) { var $2_1 = 0, $3 = 0; $3 = HEAP32[$0_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $0_1 = $0_1 + 4 | 0; while (1) { block1 : { if (($2_1 | 0) == ($3 | 0)) { $2_1 = -1; break block1; } if (!$67(HEAP32[$0_1 + ($2_1 << 2) >> 2], $1_1)) { break block1 } $2_1 = $2_1 + 1 | 0; continue; } break; }; return $2_1; } function $1234($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = $951(HEAP32[$0_1 >> 2], 168, 0, 0); if ($4_1) { $5_1 = HEAP32[$2_1 + 16 >> 2]; HEAP16[$4_1 + 32 >> 1] = $3; HEAP32[$4_1 + 28 >> 2] = $5_1; HEAP32[$4_1 + 44 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 2097152; HEAP32[$1_1 >> 2] = $936($0_1, HEAP32[$1_1 >> 2], $4_1); } } function $1235($0_1, $1_1, $2_1) { block : { if ($68($0_1, 18315, 7)) { break block } $0_1 = $0_1 + 7 | 0; block2 : { if (!$2073(HEAP32[$1_1 >> 2] + 7 | 0, 9311)) { if (!$67($0_1, 18208)) { break block2 } if (!$2_1) { break block } if (!$67($0_1, 9330)) { break block2 } if (!$67($0_1, 18227)) { break block2 } break block; } if ($67($0_1, 18227)) { break block } } return 1; } return 0; } function $1236($0_1, $1_1) { if (HEAPU8[$0_1 + 14 | 0] & 64) { $0_1 = (HEAP32[HEAP32[HEAP32[$0_1 + 44 >> 2] >> 2] + 28 >> 2] + ($1_1 << 4) | 0) + 17 | 0; $1_1 = HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8 | 64; HEAP8[$0_1 | 0] = $1_1; HEAP8[$0_1 + 1 | 0] = $1_1 >>> 8; } } function $1237($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 + -64 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block : { if (HEAP32[$3 + 40 >> 2]) { break block } $6_1 = HEAP32[$0_1 >> 2]; $2_1 = $906($6_1, HEAP32[(($2_1 << 4) + $1_1 | 0) + 8 >> 2], 0); if (HEAPU8[$6_1 + 87 | 0]) { $11($6_1, $2_1); break block; } if (($4_1 | 0) > 0) { $1_1 = $5_1 + 24 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $5_1 + 16 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$5_1 + 8 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 32 >> 2] = $4_1; HEAP32[$5_1 + 12 >> 2] = 87; $920($5_1 + 8 | 0, $2_1); } if (HEAPU8[$3 | 0] == 114) { $2_1 = $1246($0_1, $2_1, HEAP32[$3 + 8 >> 2]) } $1_1 = $5_1 + 8 | 0; wasm2js_memory_copy($1_1, $2_1, 52); wasm2js_memory_copy($2_1, $3, 52); wasm2js_memory_copy($3, $1_1, 52); block7 : { if (!(HEAP8[$3 + 7 | 0] & 1)) { break block7 } $1_1 = HEAP32[$3 + 44 >> 2]; if (!$1_1) { break block7 } HEAP32[$1_1 + 72 >> 2] = $3; } $1131($0_1, $2_1); } $0_1 = $5_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1238($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP16[$0_1 + 32 >> 1]; $0_1 = HEAP32[$0_1 + 44 >> 2]; if (!(!(HEAPU8[$0_1 + 28 | 0] & 96) | !(HEAPU8[(HEAP32[$0_1 + 4 >> 2] + Math_imul($1_1, 12) | 0) + 10 | 0] & 96))) { $0_1 = HEAP16[$0_1 + 34 >> 1]; $1_1 = $0_1 >> 31; $2_1 = $0_1 & 31; if (($0_1 & 63) >>> 0 >= 32) { $3 = -1 << $2_1; $2_1 = 0; } else { $3 = (1 << $2_1) - 1 & -1 >>> 32 - $2_1; $2_1 = -1 << $2_1; $3 = $3 | $2_1; } $2_1 = $2_1 ^ -1; $3 = $3 ^ -1; $0_1 = $0_1 >>> 0 > 63 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0; $1_1 = $0_1 ? -1 : $2_1; i64toi32_i32$HIGH_BITS = $0_1 ? -1 : $3; return $1_1; } $1_1 = ($1_1 | 0) >= 63 ? 63 : $1_1; $0_1 = $1_1 & 31; if (($1_1 & 63) >>> 0 >= 32) { $1_1 = 1 << $0_1; $0_1 = 0; } else { $2_1 = 1 << $0_1; $1_1 = $2_1 - 1 & 1 >>> 32 - $0_1; $0_1 = $2_1; } i64toi32_i32$HIGH_BITS = $1_1; return $0_1; } function $1239($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 48 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $6_1 = HEAP32[$0_1 >> 2]; block : { if (HEAPU8[$6_1 + 177 | 0]) { break block } $7_1 = HEAP32[HEAP32[$6_1 + 16 >> 2] + ($3 << 4) >> 2]; $5_1 = FUNCTION_TABLE[HEAP32[$6_1 + 364 >> 2]](HEAP32[$6_1 + 368 >> 2], 20, $1_1, $2_1, $7_1, HEAP32[$0_1 + 264 >> 2]) | 0; if (($5_1 | 0) == 1) { HEAP32[$4_1 + 36 >> 2] = $2_1; HEAP32[$4_1 + 32 >> 2] = $1_1; $5_1 = $61(6429, $4_1 + 32 | 0); if (!(!$3 & HEAP32[$6_1 + 20 >> 2] < 3)) { HEAP32[$4_1 + 20 >> 2] = $5_1; HEAP32[$4_1 + 16 >> 2] = $7_1; $5_1 = $61(1034, $4_1 + 16 | 0); } HEAP32[$4_1 >> 2] = $5_1; $257($0_1, 15631, $4_1); HEAP32[$0_1 + 12 >> 2] = 23; $5_1 = 1; break block; } if (!($5_1 & -3)) { break block } $1223($0_1); } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1240($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 76; HEAP32[$3 + 8 >> 2] = 75; HEAP32[$3 + 28 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $0_1; $919($3 + 4 | 0, $1_1); $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1241($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $5_1 = global$0 - 48 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $7_1 = $2_1 + 8 | 0; $11_1 = HEAP32[$0_1 >> 2]; $12_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] >> 2]; block5 : { while (1) { if (($9_1 | 0) < HEAP32[$2_1 >> 2]) { $8_1 = HEAP32[$7_1 >> 2]; $4_1 = $1063($8_1); block1 : { if (!$4_1) { break block1 } block3 : { if (HEAPU8[$3 | 0] != 71) { $6_1 = $1243(HEAP32[$1_1 + 28 >> 2], $4_1); HEAP32[$5_1 + 12 >> 2] = $6_1; if (($6_1 | 0) > 0) { break block3 } } if ($1074($4_1, $5_1 + 12 | 0, 0)) { $6_1 = HEAP32[$5_1 + 12 >> 2]; if ($6_1 - 65536 >>> 0 > 4294901760) { break block3 } $1242($11_1, $3, $9_1 + 1 | 0, $12_1, $4_1); $4_1 = 1; break block5; } $6_1 = 0; HEAP16[$7_1 + 12 >> 1] = 0; $4_1 = 1; if ($1096($0_1, $8_1)) { break block5 } while (1) { $4_1 = HEAP32[$1_1 + 28 >> 2]; if (HEAP32[$4_1 >> 2] <= ($6_1 | 0)) { break block1 } if (!$1121(0, $8_1, HEAP32[($4_1 + ($6_1 << 4) | 0) + 8 >> 2], -1)) { if (HEAP32[$1_1 + 68 >> 2]) { $10_1 = $5_1 + 16 | 0; $4_1 = $10_1 + 16 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $10_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$5_1 + 16 >> 2] = 0; HEAP32[$5_1 + 20 >> 2] = 0; HEAP32[$5_1 + 40 >> 2] = $1_1; HEAP32[$5_1 + 20 >> 2] = 88; $920($10_1, $8_1); } HEAP16[$7_1 + 12 >> 1] = $6_1 + 1; } $6_1 = $6_1 + 1 | 0; continue; }; } HEAP16[$7_1 + 12 >> 1] = $6_1; } $7_1 = $7_1 + 16 | 0; $9_1 = $9_1 + 1 | 0; continue; } break; }; $4_1 = $1080($11_1, $1_1, $2_1, $3); } $6_1 = $4_1; $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1242($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 + 8 >> 2] = $3; HEAP32[$5_1 + 4 >> 2] = $1_1; HEAP32[$5_1 >> 2] = $2_1; $257($0_1, 17299, $5_1); $45(HEAP32[$0_1 >> 2], $4_1); $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1243($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (HEAPU8[$1_1 | 0] != 60) { break block } $2_1 = HEAP32[$0_1 >> 2]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $0_1 = $0_1 + 8 | 0; $4_1 = HEAP32[$1_1 + 8 >> 2]; $1_1 = 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block } block1 : { $3 = ($1_1 << 4) + $0_1 | 0; if (HEAPU8[$3 + 9 | 0] & 3) { break block1 } if ($66(HEAP32[$3 + 4 >> 2], $4_1)) { break block1 } $5_1 = $1_1 + 1 | 0; break block; } $1_1 = $1_1 + 1 | 0; continue; }; } return $5_1; } function $1244($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 48 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; $5_1 = HEAP32[$1_1 + 28 >> 2]; $4_1 = $3 + 40 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $3 + 32 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 12 >> 2] = $0_1; $1_1 = HEAP32[$1_1 + 32 >> 2]; HEAP32[$3 + 36 >> 2] = 524417; HEAP32[$3 + 20 >> 2] = $5_1; HEAP32[$3 + 16 >> 2] = $1_1; $4_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAPU8[$4_1 + 91 | 0]; HEAP8[$4_1 + 91 | 0] = 1; $0_1 = $1096($3 + 12 | 0, $2_1); HEAP8[$4_1 + 91 | 0] = $1_1; $1_1 = 0; block : { if ($0_1) { break block } $4_1 = $5_1 + 8 | 0; while (1) { if (($1_1 | 0) >= HEAP32[$5_1 >> 2]) { $1_1 = 0; break block; } $0_1 = $1_1 << 4; $1_1 = $1_1 + 1 | 0; if ($1121(0, HEAP32[$0_1 + $4_1 >> 2], $2_1, -1) >>> 0 > 1) { continue } break; }; } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1245($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (HEAPU8[$1_1 | 0] == 169) { HEAP8[$1_1 + 2 | 0] = HEAPU8[$1_1 + 2 | 0] + HEAPU8[$0_1 + 24 | 0] } return 0; } function $1246($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = $48($2_1); $1_1 = $953($0_1, $1_1, $3 + 8 | 0, 0); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1248($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (!HEAP32[$1_1 + 52 >> 2]) { break block } $3 = HEAP32[$1_1 + 48 >> 2]; if (!$3) { break block } $2_1 = $1_1; while (1) { if (!$2_1) { break block } block2 : { switch (HEAPU8[$2_1 | 0] - 136 | 0) { case 0: case 3: $2_1 = HEAP32[$2_1 + 52 >> 2]; continue; default: break block2; }; } break; }; if (HEAPU16[$3 + 20 >> 1]) { break block } $5_1 = $3 + 8 | 0; $2_1 = HEAP32[$3 >> 2]; while (1) { if (($2_1 | 0) <= 0) { break block } $2_1 = $2_1 - 1 | 0; if (!(HEAPU8[HEAP32[$5_1 + ($2_1 << 4) >> 2] + 5 | 0] & 2)) { continue } break; }; $6_1 = 2; $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$2_1 >> 2]; $0_1 = $270($3, 76, 0); if (!$0_1) { break block } HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 0; $5_1 = $962($2_1, 0, 0, 0, $4_1 + 8 | 0, $0_1, 0); if (HEAP32[$2_1 + 40 >> 2]) { $794($3, $5_1); break block; } wasm2js_memory_copy($0_1, $1_1, 76); HEAP32[$1_1 + 32 >> 2] = $5_1; $6_1 = 0; $3 = $942($3, 180, 0); $2_1 = $935(HEAP32[$2_1 >> 2], $3); HEAP32[$1_1 + 36 >> 2] = 0; HEAP8[$1_1 | 0] = 139; HEAP32[$1_1 + 28 >> 2] = $2_1; HEAP32[$0_1 + 48 >> 2] = 0; HEAP32[$0_1 + 40 >> 2] = 0; HEAP32[$0_1 + 44 >> 2] = 0; HEAP32[$1_1 + 72 >> 2] = 0; HEAP32[$1_1 + 64 >> 2] = 0; HEAP32[$1_1 + 52 >> 2] = 0; HEAP32[$1_1 + 56 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -65793 | 65536; HEAP32[HEAP32[$0_1 + 52 >> 2] + 56 >> 2] = $0_1; HEAP32[$0_1 + 60 >> 2] = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1 | 0; } function $1249($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0; $8_1 = global$0 - 240 | 0; $2_1 = $8_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $6_1 = HEAP32[$0_1 >> 2]; $15_1 = HEAP32[$6_1 >> 2]; $18_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = $18_1 | 64; $16_1 = 2; block : { if (HEAPU8[$15_1 + 87 | 0]) { break block } if ($18_1 & 64) { $16_1 = 1; break block; } if (HEAPU16[$0_1 + 20 >> 1]) { $2_1 = HEAP32[$6_1 + 112 >> 2] + 1 | 0; HEAP32[$6_1 + 112 >> 2] = $2_1; HEAP32[$1_1 + 16 >> 2] = $2_1; } $2_1 = HEAP32[$1_1 + 64 >> 2]; $23_1 = HEAP32[$1_1 + 28 >> 2]; $22_1 = HEAP32[$1_1 + 32 >> 2]; block6 : { block5 : { if (!(!HEAP32[$6_1 + 280 >> 2] | !($18_1 & 2097152))) { if (!$2_1) { $2_1 = $270($15_1, 36, 0); HEAP32[$1_1 + 64 >> 2] = $2_1; if (!$2_1) { break block } } HEAP32[$2_1 + 4 >> 2] = 1; break block5; } if (!$2_1) { break block6 } } if (HEAP32[$6_1 + 40 >> 2]) { break block6 } HEAP32[$2_1 + 8 >> 2] = HEAP32[$6_1 + 280 >> 2]; HEAP32[$6_1 + 280 >> 2] = $2_1; } $1026($6_1, $22_1); $26_1 = $22_1 + 8 | 0; $4_1 = $26_1; while (1) { block30 : { block8 : { block17 : { block12 : { block32 : { block45 : { block44 : { block26 : { if (($9_1 | 0) < HEAP32[$22_1 >> 2]) { if (HEAP32[$4_1 + 8 >> 2]) { break block8 } $5_1 = HEAP32[$4_1 >> 2]; if (!$5_1) { if ($919($0_1, HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2])) { break block } $2_1 = HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2]; $3 = $270(HEAP32[$6_1 >> 2], 64, 0); HEAP32[$4_1 + 8 >> 2] = $3; if (!$3) { break block } HEAP32[$3 + 24 >> 2] = 1; $5_1 = HEAP32[$6_1 >> 2]; $10_1 = HEAP32[$4_1 + 4 >> 2]; block11 : { if ($10_1) { $5_1 = $116($5_1, $10_1); break block11; } HEAP32[$8_1 >> 2] = $4_1; $5_1 = $310($5_1, 19512, $8_1); } HEAP32[$3 >> 2] = $5_1; while (1) { $5_1 = $2_1; $2_1 = HEAP32[$2_1 + 52 >> 2]; if ($2_1) { continue } break; }; $1224($6_1, HEAP32[$5_1 + 28 >> 2], $3 + 34 | 0, $3 + 4 | 0); HEAP8[$3 + 43 | 0] = 2; HEAP16[$3 + 32 >> 1] = 65535; HEAP16[$3 + 38 >> 1] = 200; HEAP32[$3 + 28 >> 2] = HEAP32[$3 + 28 >> 2] | 16896; if (!HEAP32[$6_1 + 40 >> 2]) { break block12 } break block; } block13 : { $14 = HEAP32[$6_1 + 280 >> 2]; if (!(HEAP32[$4_1 + 44 >> 2] ? HEAP8[$4_1 + 15 | 0] & 1 : 1) | (HEAP32[$6_1 + 40 >> 2] | !$14)) { break block13 } if (HEAPU8[$4_1 + 14 | 0] & 4) { break block13 } while (1) { if (!$14) { break block13 } $2_1 = 0; $3 = HEAP32[$14 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $10_1 = $14 + 12 | 0; block16 : { block15 : { while (1) { if (($2_1 | 0) == ($3 | 0)) { break block15 } $12_1 = Math_imul($2_1, 24); $2_1 = $2_1 + 1 | 0; $12_1 = $10_1 + $12_1 | 0; $13_1 = HEAP32[$12_1 >> 2]; if ($67($5_1, $13_1)) { continue } break; }; $2_1 = HEAP32[$12_1 + 12 >> 2]; if (!$2_1) { break block16 } HEAP32[$8_1 + 112 >> 2] = $13_1; $257($6_1, $2_1, $8_1 + 112 | 0); break block17; } if (HEAP32[$14 + 4 >> 2]) { break block13 } $14 = HEAP32[$14 + 8 >> 2]; continue; } break; }; $5_1 = HEAP32[$6_1 >> 2]; if ($1252($6_1, $4_1)) { break block } $13_1 = $270($5_1, 64, 0); if (!$13_1) { break block } $2_1 = HEAP32[$12_1 + 16 >> 2]; if (!$2_1) { $2_1 = $270($5_1, 20, 0); HEAP32[$12_1 + 16 >> 2] = $2_1; block20 : { if ($2_1) { if ($1016($6_1, 52, $2_1)) { break block20 } } $13($5_1, $13_1); break block; } HEAP8[$2_1 + 18 | 0] = HEAPU8[$12_1 + 20 | 0]; } HEAP32[$4_1 + 8 >> 2] = $13_1; HEAP32[$13_1 + 24 >> 2] = 1; $3 = $116($5_1, HEAP32[$12_1 >> 2]); HEAP16[$13_1 + 38 >> 1] = 200; HEAP16[$13_1 + 32 >> 1] = 65535; HEAP32[$13_1 >> 2] = $3; HEAP32[$13_1 + 28 >> 2] = HEAP32[$13_1 + 28 >> 2] | 16896; $973($6_1, $4_1, HEAP32[$12_1 + 8 >> 2], 1); if (HEAPU8[$5_1 + 87 | 0]) { break block } $5_1 = HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2]; HEAP32[$5_1 + 4 >> 2] = HEAP32[$5_1 + 4 >> 2] | 67108864; $3 = HEAPU8[$4_1 + 13 | 0] | HEAPU8[$4_1 + 14 | 0] << 8; if ($3 & 2) { HEAP32[$8_1 + 96 >> 2] = HEAP32[$4_1 + 32 >> 2]; $257($6_1, 29847, $8_1 + 96 | 0); break block; } HEAP32[$4_1 + 36 >> 2] = $2_1; $3 = $3 | 512; HEAP8[$4_1 + 13 | 0] = $3; HEAP8[$4_1 + 14 | 0] = $3 >>> 8; HEAP32[$2_1 >> 2] = HEAP32[$2_1 >> 2] + 1; $19_1 = -1; $2_1 = HEAPU8[$5_1 | 0]; $11_1 = $2_1; $10_1 = $5_1; block22 : { $21_1 = ($2_1 + 121 & 255) >>> 0 > 1; if ($21_1) { break block22 } while (1) { if (($11_1 & 255) != ($2_1 & 255)) { break block22 } $2_1 = 0; $3 = HEAP32[$10_1 + 32 >> 2]; $7_1 = HEAP32[$3 >> 2]; $7_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $11_1 = $3 + 8 | 0; while (1) { if (($2_1 | 0) != ($7_1 | 0)) { $3 = $11_1 + Math_imul($2_1, 48) | 0; $17_1 = HEAP32[$3 >> 2]; block24 : { if (!$17_1) { break block24 } $20_1 = HEAPU8[$3 + 15 | 0]; if ($20_1 & 2 | HEAPU8[$3 + 13 | 0] & 4 | !(HEAP32[$3 + 44 >> 2] ? $20_1 & 1 : 1)) { break block24 } if ($67($17_1, HEAP32[$12_1 >> 2])) { break block24 } HEAP32[$3 + 8 >> 2] = $13_1; HEAP32[$13_1 + 24 >> 2] = HEAP32[$13_1 + 24 >> 2] + 1; $17_1 = HEAPU8[$3 + 13 | 0] | HEAPU8[$3 + 14 | 0] << 8 | 128; HEAP8[$3 + 13 | 0] = $17_1; HEAP8[$3 + 14 | 0] = $17_1 >>> 8; $17_1 = HEAP32[$10_1 + 4 >> 2]; if ($17_1 & 8192) { break block26 } HEAP32[$10_1 + 4 >> 2] = $17_1 | 8192; if (($19_1 | 0) < 0) { $19_1 = HEAP32[$6_1 + 44 >> 2]; HEAP32[$6_1 + 44 >> 2] = $19_1 + 1; } HEAP32[$3 + 16 >> 2] = $19_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; if (!(HEAPU8[$10_1 + 5 | 0] & 32)) { break block22 } $2_1 = HEAPU8[$5_1 | 0]; $10_1 = HEAP32[$10_1 + 52 >> 2]; $11_1 = HEAPU8[$10_1 | 0]; continue; }; } HEAP32[$12_1 + 12 >> 2] = 8609; $7_1 = HEAP32[$6_1 + 280 >> 2]; HEAP32[$6_1 + 280 >> 2] = $14; block29 : { if (HEAPU8[$5_1 + 5 | 0] & 32) { HEAP32[$10_1 + 64 >> 2] = HEAP32[$5_1 + 64 >> 2]; $2_1 = $919($0_1, $10_1); HEAP32[$10_1 + 64 >> 2] = 0; if (!$2_1) { break block29 } break block30; } if ($919($0_1, $5_1)) { break block30 } } HEAP32[$6_1 + 280 >> 2] = $14; $2_1 = $5_1; while (1) { $3 = $2_1; $2_1 = HEAP32[$2_1 + 52 >> 2]; if ($2_1) { continue } break; }; $3 = HEAP32[$3 + 28 >> 2]; $2_1 = HEAP32[$12_1 + 4 >> 2]; if (!$2_1) { $2_1 = $3; break block32; } if (!$3) { break block32 } $3 = HEAP32[$3 >> 2]; $10_1 = HEAP32[$2_1 >> 2]; if (($3 | 0) == ($10_1 | 0)) { break block32 } $0_1 = HEAP32[$12_1 >> 2]; HEAP32[$8_1 + 72 >> 2] = $10_1; HEAP32[$8_1 + 68 >> 2] = $3; HEAP32[$8_1 + 64 >> 2] = $0_1; $257($6_1, 5187, $8_1 - -64 | 0); break block30; } $2_1 = $879($6_1, 0, $4_1); HEAP32[$4_1 + 8 >> 2] = $2_1; if (!$2_1) { break block } $5_1 = HEAP32[$2_1 + 24 >> 2]; if ($5_1 >>> 0 >= 65535) { HEAP32[$8_1 + 16 >> 2] = HEAP32[$2_1 >> 2]; $257($6_1, 23401, $8_1 + 16 | 0); HEAP32[$4_1 + 8 >> 2] = 0; break block; } HEAP32[$2_1 + 24 >> 2] = $5_1 + 1; if (HEAPU8[$2_1 + 43 | 0] != 1) { if ($1252($6_1, $4_1)) { break block } if (!HEAPU8[$2_1 + 43 | 0]) { break block12 } } $5_1 = HEAPU8[$0_1 + 20 | 0]; if ($897($6_1, $2_1)) { break block } block37 : { block35 : { switch (HEAPU8[$2_1 + 43 | 0] - 1 | 0) { case 1: if (!(HEAPU8[$15_1 + 35 | 0] & 128 | HEAP32[$2_1 + 60 >> 2] == HEAP32[HEAP32[$15_1 + 16 >> 2] + 28 >> 2])) { HEAP32[$8_1 + 32 >> 2] = HEAP32[$2_1 >> 2]; $257($6_1, 15658, $8_1 + 32 | 0); } $973($6_1, $4_1, HEAP32[$2_1 + 44 >> 2], 1); break block37; case 0: break block35; default: break block37; }; } if (!(HEAP8[$4_1 + 14 | 0] & 1)) { break block37 } $3 = HEAP32[$2_1 + 52 >> 2]; if (!$3 | HEAPU8[$3 + 18 | 0] <= (HEAP32[$15_1 + 32 >> 2] >>> 7 & 1) >>> 0) { break block37 } HEAP32[$8_1 + 48 >> 2] = HEAP32[$2_1 >> 2]; $257($6_1, 29764, $8_1 + 48 | 0); } $3 = HEAPU16[$2_1 + 34 >> 1]; HEAP16[$2_1 + 34 >> 1] = 65535; HEAP16[$0_1 + 20 >> 1] = 1; if (HEAPU8[$4_1 + 13 | 0] & 4) { $919($0_1, HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2]) } HEAP16[$0_1 + 20 >> 1] = $5_1; HEAP16[$2_1 + 34 >> 1] = $3; break block12; } if (HEAP32[$6_1 + 40 >> 2]) { break block17 } $5_1 = HEAP32[$1_1 + 32 >> 2]; $7_1 = $5_1 + 56 | 0; $10_1 = $5_1 + 8 | 0; $12_1 = $10_1; $0_1 = 0; while (1) { if (($0_1 | 0) >= (HEAP32[$5_1 >> 2] - 1 | 0)) { $20_1 = 0; $11_1 = HEAP32[$23_1 >> 2]; $5_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $27 = $23_1 + 8 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) != ($5_1 | 0)) { $0_1 = HEAP32[($2_1 << 4) + $27 >> 2]; $3 = HEAPU8[$0_1 | 0]; block43 : { if (($3 | 0) != 142) { if (($3 | 0) != 180) { break block43 } break block44; } if (HEAPU8[HEAP32[$0_1 + 16 >> 2]] == 180) { break block44 } } $2_1 = $2_1 + 1 | 0; $20_1 = HEAP32[$0_1 + 4 >> 2] | $20_1; continue; } break; }; $7_1 = HEAP32[$1_1 + 28 >> 2]; break block45; } block46 : { if (!HEAP32[$12_1 + 8 >> 2]) { break block46 } $13_1 = HEAP32[$7_1 + 8 >> 2]; if (!$13_1) { break block46 } block52 : { block48 : { $3 = HEAPU8[$7_1 + 12 | 0]; if ($3 & 4) { if (HEAP32[$7_1 + 40 >> 2] | HEAPU8[$7_1 + 14 | 0] & 8) { break block48 } $9_1 = 0; $4_1 = 0; while (1) { if (!(HEAP16[$13_1 + 34 >> 1] <= ($4_1 | 0))) { $2_1 = HEAP32[$13_1 + 4 >> 2] + Math_imul($4_1, 12) | 0; block50 : { if (HEAPU8[$2_1 + 10 | 0] & 2) { break block50 } $11_1 = HEAP32[$2_1 >> 2]; if (!$1253($5_1, 0, $0_1, $11_1, 0, 0, 1)) { break block50 } $2_1 = $954($6_1, $9_1, 0); $9_1 = 0; if (!$2_1) { break block50 } $9_1 = $116(HEAP32[$6_1 >> 2], $11_1); HEAP32[$2_1 + (HEAP32[$2_1 >> 2] << 2) >> 2] = $9_1; $9_1 = $2_1; } $4_1 = $4_1 + 1 | 0; continue; } break; }; if ($9_1) { HEAP32[$7_1 + 40 >> 2] = $9_1; $2_1 = HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8 | 10240; HEAP8[$7_1 + 13 | 0] = $2_1; HEAP8[$7_1 + 14 | 0] = $2_1 >>> 8; } if (HEAP32[$6_1 + 40 >> 2]) { break block17 } } $16_1 = $3 & 32 ? 1 : 2; $3 = HEAP32[$7_1 + 40 >> 2]; if (!(HEAPU8[$7_1 + 14 | 0] & 8)) { break block52 } $21_1 = $0_1 + 1 | 0; $17_1 = $3 + 4 | 0; $14 = HEAP32[$6_1 >> 2]; $4_1 = 0; while (1) { if (HEAP32[$3 >> 2] <= ($4_1 | 0)) { break block46 } block54 : { $2_1 = HEAP32[$17_1 + ($4_1 << 2) >> 2]; $19_1 = $888($13_1, $2_1); if (($19_1 | 0) >= 0) { if ($1253($5_1, 0, $0_1, $2_1, $8_1 + 236 | 0, $8_1 + 232 | 0, (HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8) >>> 13 & 1)) { break block54 } } HEAP32[$8_1 + 128 >> 2] = $2_1; $257($6_1, 5689, $8_1 + 128 | 0); break block17; } $9_1 = HEAP32[$8_1 + 232 >> 2]; $11_1 = $1254($14, $5_1, HEAP32[$8_1 + 236 >> 2], $9_1); $1236($10_1 + Math_imul(HEAP32[$8_1 + 236 >> 2], 48) | 0, $9_1); $9_1 = 0; block55 : { if (!(HEAPU8[$5_1 + 20 | 0] & 64)) { break block55 } while (1) { block58 : { if ($1253($5_1, HEAP32[$8_1 + 236 >> 2] + 1 | 0, $0_1, $2_1, $8_1 + 236 | 0, $8_1 + 232 | 0, (HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8) >>> 13 & 1)) { $20_1 = $10_1 + Math_imul(HEAP32[$8_1 + 236 >> 2], 48) | 0; if (HEAPU8[$20_1 + 14 | 0] & 8) { if (($1233(HEAP32[$20_1 + 40 >> 2], $2_1) | 0) >= 0) { break block58 } } HEAP32[$8_1 + 144 >> 2] = $2_1; $257($6_1, 27077, $8_1 + 144 | 0); } if (!$9_1) { break block55 } $11_1 = $946($6_1, $936($6_1, $9_1, $11_1), 50888, 0); break block55; } $9_1 = $936($6_1, $9_1, $11_1); $20_1 = HEAP32[$8_1 + 232 >> 2]; $11_1 = $1254($14, $5_1, HEAP32[$8_1 + 236 >> 2], $20_1); $1236($10_1 + Math_imul(HEAP32[$8_1 + 236 >> 2], 48) | 0, $20_1); continue; }; } $9_1 = $1254($14, $5_1, $21_1, $19_1); $1236($7_1, $19_1); $2_1 = $903($6_1, 54, $11_1, $9_1); if ($2_1) { HEAP32[$2_1 + 4 >> 2] = $16_1 | HEAP32[$2_1 + 4 >> 2]; HEAP32[$2_1 + 36 >> 2] = HEAP32[$9_1 + 28 >> 2]; } HEAP32[$1_1 + 36 >> 2] = $948($6_1, HEAP32[$1_1 + 36 >> 2], $2_1); $4_1 = $4_1 + 1 | 0; continue; }; } HEAP32[$8_1 + 160 >> 2] = 0; $257($6_1, 13506, $8_1 + 160 | 0); break block17; } if (!$3) { break block46 } $1087($3, HEAP32[$7_1 + 16 >> 2], $16_1); HEAP32[$1_1 + 36 >> 2] = $948($6_1, HEAP32[$1_1 + 36 >> 2], HEAP32[$7_1 + 40 >> 2]); HEAP32[$7_1 + 40 >> 2] = 0; $2_1 = HEAPU8[$7_1 + 13 | 0] | HEAPU8[$7_1 + 14 | 0] << 8 | 4096; HEAP8[$7_1 + 13 | 0] = $2_1; HEAP8[$7_1 + 14 | 0] = $2_1 >>> 8; } $12_1 = $12_1 + 48 | 0; $7_1 = $7_1 + 48 | 0; $0_1 = $0_1 + 1 | 0; continue; }; } HEAP32[$8_1 + 80 >> 2] = HEAP32[$12_1 >> 2]; $257($6_1, 8500, $8_1 + 80 | 0); break block; } $21_1 = $18_1 & 2048; $29_1 = HEAP32[HEAP32[$6_1 >> 2] + 32 >> 2] & 68; $7_1 = 0; while (1) { block65 : { if (($11_1 | 0) > ($24_1 | 0)) { $2_1 = ($24_1 << 4) + $27 | 0; $12_1 = HEAP32[$2_1 >> 2]; $30_1 = HEAP32[$12_1 + 4 >> 2]; $0_1 = 0; $18_1 = 0; $4_1 = $12_1; $5_1 = HEAPU8[$4_1 | 0]; if (($5_1 | 0) != 180) { block63 : { if (($5_1 | 0) == 142) { $4_1 = HEAP32[$4_1 + 16 >> 2]; if (HEAPU8[$4_1 | 0] == 180) { break block63 } } $7_1 = $936($6_1, $7_1, $12_1); if ($7_1) { $0_1 = (HEAP32[$7_1 >> 2] << 4) + $7_1 | 0; HEAP32[$0_1 - 4 >> 2] = HEAP32[$2_1 + 4 >> 2]; $5_1 = (HEAPU8[$0_1 + 1 | 0] | HEAPU8[$0_1 + 2 | 0] << 8) & 65532 | (HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8) & 3; HEAP8[$0_1 + 1 | 0] = $5_1; HEAP8[$0_1 + 2 | 0] = $5_1 >>> 8; HEAP32[$2_1 + 4 >> 2] = 0; } HEAP32[$2_1 >> 2] = 0; break block65; } $18_1 = HEAP32[HEAP32[$12_1 + 12 >> 2] + 8 >> 2]; } $28_1 = HEAP32[$4_1 + 36 >> 2]; $5_1 = $26_1; $3 = 0; while (1) { block71 : { block74 : { block73 : { block66 : { $2_1 = HEAP32[$22_1 >> 2]; if (($2_1 | 0) <= ($3 | 0)) { break block66 } $16_1 = HEAP32[$5_1 + 8 >> 2]; $10_1 = HEAP32[$5_1 + 4 >> 2]; if (!$10_1) { $10_1 = HEAP32[$16_1 >> 2] } if (HEAPU8[$15_1 + 87 | 0]) { break block66 } block69 : { if (HEAPU8[$5_1 + 14 | 0] & 64) { $17_1 = HEAP32[HEAP32[HEAP32[$5_1 + 44 >> 2] >> 2] + 28 >> 2]; $14 = 0; break block69; } block70 : { if (!$18_1) { break block70 } if (!$67($18_1, $10_1)) { break block70 } $3 = $3 + 1 | 0; break block71; } $17_1 = 0; $4_1 = $309($15_1, HEAP32[$16_1 + 60 >> 2]); $14 = 25120; if (($4_1 | 0) < 0) { break block69 } $14 = HEAP32[HEAP32[$15_1 + 16 >> 2] + ($4_1 << 4) >> 2]; } $11_1 = 0; $13_1 = $3 + 1 | 0; if (!$21_1 | (!(HEAPU8[$5_1 + 62 | 0] & 8) | ($2_1 | 0) <= ($13_1 | 0))) { break block73 } $19_1 = HEAP32[$5_1 + 88 >> 2]; $25 = $19_1 + 4 | 0; $2_1 = 0; while (1) { if (HEAP32[$19_1 >> 2] <= ($2_1 | 0)) { break block74 } $9_1 = HEAP32[$25 + ($2_1 << 2) >> 2]; $4_1 = $942($15_1, 60, $9_1); if (!(!$4_1 | HEAPU8[$4_1 + 4 | 0] & 3)) { HEAP32[$4_1 + 36 >> 2] = $28_1 } $7_1 = $936($6_1, $7_1, $4_1); if ($7_1) { $4_1 = HEAP32[$7_1 >> 2]; HEAP32[$8_1 + 208 >> 2] = $9_1; $4_1 = ($4_1 << 4) + $7_1 | 0; HEAP32[$4_1 - 4 >> 2] = $310($15_1, 6435, $8_1 + 208 | 0); $4_1 = $4_1 + 1 | 0; $9_1 = (HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8) & 65404 | 130; HEAP8[$4_1 | 0] = $9_1; HEAP8[$4_1 + 1 | 0] = $9_1 >>> 8; } $2_1 = $2_1 + 1 | 0; continue; }; } if ($0_1) { break block65 } if ($18_1) { HEAP32[$8_1 + 224 >> 2] = $18_1; $257($6_1, 8482, $8_1 + 224 | 0); break block65; } $257($6_1, 16465, 0); break block65; } $19_1 = 0; } $2_1 = HEAP16[$16_1 + 34 >> 1] + (!(HEAPU8[$16_1 + 29 | 0] & 2) & ($21_1 | 0) != 0) | 0; $25 = ($2_1 | 0) > 0 ? $2_1 : 0; $31_1 = !($18_1 | $21_1) & ($3 | 0) != 0; $32_1 = $17_1 + 12 | 0; $33_1 = $3 ^ -1; $34_1 = $17_1 + 8 | 0; $35_1 = $17_1 + 17 | 0; while (1) { block78 : { if (($11_1 | 0) == ($25 | 0)) { break block78 } $3 = 0; block80 : { block81 : { if (($11_1 | 0) == HEAP16[$16_1 + 34 >> 1]) { while (1) { if (($3 | 0) == 3) { break block80 } $9_1 = HEAP32[($3 << 2) + 50896 >> 2]; $2_1 = 0; while (1) { if (($2_1 | 0) == ($11_1 | 0)) { break block81 } $4_1 = Math_imul($2_1, 12); $2_1 = $2_1 + 1 | 0; if ($66($9_1, HEAP32[$4_1 + HEAP32[$16_1 + 4 >> 2] >> 2])) { continue } break; }; $3 = $3 + 1 | 0; continue; } } $2_1 = HEAP32[$16_1 + 4 >> 2] + Math_imul($11_1, 12) | 0; $9_1 = HEAP32[$2_1 >> 2]; block82 : { if (!$17_1) { break block82 } $3 = $11_1 << 4; $4_1 = $3 + $35_1 | 0; if (((HEAPU8[$4_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8) & 3) == 3) { break block80 } if (!$18_1) { break block82 } if (!$1232($3 + $34_1 | 0, 0, $18_1, 0, 0)) { break block80 } } $2_1 = HEAPU16[$2_1 + 10 >> 1]; if (!($2_1 & 2 ? HEAPU8[$1_1 + 6 | 0] & 2 : 1)) { break block80 } if ($18_1 | !($2_1 & 1024)) { break block81 } if (!$21_1) { break block80 } } if (!(!$31_1 | !(HEAPU8[$5_1 + 14 | 0] & 8))) { $0_1 = 1; if (($1233(HEAP32[$5_1 + 40 >> 2], $9_1) | 0) >= 0) { break block80 } } $0_1 = $942($15_1, 60, $9_1); $2_1 = HEAP32[$22_1 >> 2]; block87 : { block86 : { if (($2_1 | 0) >= 2) { if ($21_1 | !(HEAPU8[$5_1 + 12 | 0] & 64)) { break block86 } $4_1 = $2_1 + $33_1 | 0; $3 = $5_1; while (1) { if (($4_1 | 0) <= 0) { break block86 } $2_1 = $3; $3 = $2_1 + 48 | 0; $4_1 = $4_1 - 1 | 0; if (!(HEAPU8[$2_1 + 62 | 0] & 8)) { continue } $2_1 = HEAP32[$2_1 + 88 >> 2]; if (!$2_1) { continue } if (($1233($2_1, $9_1) | 0) < 0) { continue } break; }; } if (HEAPU8[$6_1 + 224 | 0] < 2) { break block87 } } $2_1 = $942($15_1, 60, $10_1); $0_1 = $903($6_1, 142, $2_1, $0_1); block88 : { if (HEAPU8[$6_1 + 224 | 0] < 2) { break block88 } $3 = HEAP32[$12_1 + 12 >> 2]; if (!$3) { break block88 } $918($6_1, $2_1, $3); } if (!$14) { break block87 } $0_1 = $903($6_1, 142, $942($15_1, 60, $14), $0_1); } if (!(!$0_1 | HEAPU8[$0_1 + 4 | 0] & 3)) { HEAP32[$0_1 + 36 >> 2] = $28_1 } $7_1 = $936($6_1, $7_1, $0_1); if (!$7_1) { $0_1 = 1; $7_1 = 0; break block78; } $2_1 = ((HEAP32[$7_1 >> 2] << 4) + $7_1 | 0) - 8 | 0; block97 : { if (!(!$21_1 | HEAPU8[$6_1 + 224 | 0] > 1)) { block93 : { if ($17_1) { $0_1 = $116($15_1, HEAP32[($11_1 << 4) + $32_1 >> 2]); break block93; } HEAP32[$8_1 + 200 >> 2] = $9_1; HEAP32[$8_1 + 196 >> 2] = $10_1; HEAP32[$8_1 + 192 >> 2] = $14; $0_1 = $310($15_1, 6188, $8_1 + 192 | 0); } HEAP32[$2_1 + 4 >> 2] = $0_1; $3 = (HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8) & -4 | (HEAP16[$16_1 + 34 >> 1] == ($11_1 | 0) ? 3 : 2); HEAP8[$2_1 + 9 | 0] = $3; HEAP8[$2_1 + 10 | 0] = $3 >>> 8; block95 : { if (HEAPU8[$5_1 + 14 | 0] & 8) { if (($1233(HEAP32[$5_1 + 40 >> 2], $9_1) | 0) >= 0) { break block95 } } if ($19_1) { if (($1233($19_1, $9_1) | 0) >= 0) { break block95 } } $0_1 = 1; if (!(HEAPU8[(HEAP32[$16_1 + 4 >> 2] + Math_imul($11_1, 12) | 0) + 11 | 0] & 4) | HEAP16[$16_1 + 34 >> 1] <= ($11_1 | 0)) { break block80 } } $0_1 = $3 | 256; HEAP8[$2_1 + 9 | 0] = $0_1; HEAP8[$2_1 + 10 | 0] = $0_1 >>> 8; break block97; } if (!(($29_1 | 0) != 4 | ($36_1 | 0) != 0)) { HEAP32[$8_1 + 180 >> 2] = $9_1; HEAP32[$8_1 + 176 >> 2] = $10_1; HEAP32[$2_1 + 4 >> 2] = $310($15_1, 6429, $8_1 + 176 | 0); $0_1 = (HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8) & 65532; HEAP8[$2_1 + 9 | 0] = $0_1; HEAP8[$2_1 + 10 | 0] = $0_1 >>> 8; break block97; } HEAP32[$2_1 + 4 >> 2] = $116($15_1, $9_1); $0_1 = (HEAPU8[$2_1 + 9 | 0] | HEAPU8[$2_1 + 10 | 0] << 8) & 65532; HEAP8[$2_1 + 9 | 0] = $0_1; HEAP8[$2_1 + 10 | 0] = $0_1 >>> 8; } $0_1 = 1; } $11_1 = $11_1 + 1 | 0; continue; } break; }; $3 = $13_1; } $5_1 = $5_1 + 48 | 0; continue; }; } $333($15_1, $23_1); HEAP32[$1_1 + 28 >> 2] = $7_1; break block45; } $20_1 = $20_1 | $30_1; $24_1 = $24_1 + 1 | 0; $11_1 = HEAP32[$23_1 >> 2]; continue; }; } $16_1 = 0; if (!$7_1) { break block } if (HEAP32[$7_1 >> 2] > HEAP32[$15_1 + 128 >> 2]) { $257($6_1, 3328, 0); break block17; } if (!($20_1 & 4194312)) { break block } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 262144; break block; } $1224($6_1, $2_1, $13_1 + 34 | 0, $13_1 + 4 | 0); if (!$21_1) { HEAP32[$12_1 + 12 >> 2] = HEAP32[$5_1 + 4 >> 2] & 8192 ? 7701 : 7447; $919($0_1, $5_1); } HEAP32[$12_1 + 12 >> 2] = 0; HEAP32[$6_1 + 280 >> 2] = $7_1; } if (!(HEAPU8[$4_1 + 13 | 0] & 2)) { break block8 } if (!$1255($6_1, $4_1)) { break block8 } } $16_1 = 2; break block; } $4_1 = $4_1 + 48 | 0; $9_1 = $9_1 + 1 | 0; continue; } break; }; HEAP32[$6_1 + 280 >> 2] = $7_1; } $0_1 = $8_1 + 240 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $16_1 | 0; } function $1250($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; block : { $2_1 = HEAP32[$1_1 + 4 >> 2]; if ($2_1 & 128) { break block } HEAP32[$1_1 + 4 >> 2] = $2_1 | 128; $2_1 = HEAP32[$1_1 + 32 >> 2]; $1_1 = $2_1 + 8 | 0; $4_1 = HEAP32[$0_1 >> 2]; $0_1 = 0; while (1) { if (HEAP32[$2_1 >> 2] <= ($0_1 | 0)) { break block } $3 = HEAP32[$1_1 + 8 >> 2]; if (!(!(HEAPU8[$3 + 29 | 0] & 64) | !(HEAPU8[$1_1 + 13 | 0] & 4))) { $1225($4_1, $3, HEAP32[HEAP32[$1_1 + 44 >> 2] >> 2], 64) } $1_1 = $1_1 + 48 | 0; $0_1 = $0_1 + 1 | 0; continue; }; } } function $1251($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (HEAP8[$1_1 + 7 | 0] & 1) { $793(HEAP32[$1_1 + 44 >> 2]) } return 0; } function $1252($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if (HEAPU8[$1_1 + 13 | 0] & 8) { HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; $257($0_1, 10531, $2_1); $3 = 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1253($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $9_1 = $0_1 + 8 | 0; while (1) { block1 : { block : { if (($1_1 | 0) > ($2_1 | 0)) { break block } $7_1 = Math_imul($1_1, 48) + $9_1 | 0; $8_1 = HEAP32[$7_1 + 8 >> 2]; $0_1 = $888($8_1, $3); if (($0_1 | 0) < 0) { break block1 } if ($6_1) { if (HEAPU8[(HEAP32[$8_1 + 4 >> 2] + Math_imul($0_1, 12) | 0) + 10 | 0] & 2) { break block1 } } $10_1 = 1; if (!$4_1) { break block } $1236($7_1, $0_1); HEAP32[$4_1 >> 2] = $1_1; HEAP32[$5_1 >> 2] = $0_1; } return $10_1; } $1_1 = $1_1 + 1 | 0; continue; }; } function $1254($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = $951($0_1, 168, 0, 0); if ($4_1) { $0_1 = Math_imul($2_1, 48) + $1_1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$4_1 + 44 >> 2] = $1_1; HEAP32[$4_1 + 28 >> 2] = HEAP32[$0_1 + 24 >> 2]; if (($3 | 0) == HEAP16[$1_1 + 32 >> 1]) { HEAP16[$4_1 + 32 >> 1] = 65535; return $4_1; } $0_1 = $0_1 + 8 | 0; HEAP16[$4_1 + 32 >> 1] = $3; if (!(!(HEAPU8[$1_1 + 28 | 0] & 96) | !(HEAPU8[(HEAP32[$1_1 + 4 >> 2] + Math_imul($3, 12) | 0) + 10 | 0] & 96))) { $1_1 = HEAP16[$1_1 + 34 >> 1]; $2_1 = $1_1 >> 31; $3 = $1_1 & 31; if (($1_1 & 63) >>> 0 >= 32) { $5_1 = -1 << $3; $3 = 0; } else { $5_1 = (1 << $3) - 1 & -1 >>> 32 - $3; $3 = -1 << $3; $5_1 = $5_1 | $3; } $3 = $3 ^ -1; $5_1 = $5_1 ^ -1; $1_1 = $1_1 >>> 0 > 63 & ($2_1 | 0) >= 0 | ($2_1 | 0) > 0; HEAP32[$0_1 + 24 >> 2] = $1_1 ? -1 : $3; HEAP32[$0_1 + 28 >> 2] = $1_1 ? -1 : $5_1; return $4_1; } $5_1 = HEAP32[$0_1 + 28 >> 2]; $2_1 = ($3 | 0) >= 63 ? 63 : $3; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $1_1; $3 = 0; } else { $3 = 1 << $1_1; $2_1 = $3 - 1 & 1 >>> 32 - $1_1; } HEAP32[$0_1 + 24 >> 2] = $3 | HEAP32[$0_1 + 24 >> 2]; HEAP32[$0_1 + 28 >> 2] = $2_1 | $5_1; } return $4_1; } function $1255($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $2_1 = HEAP32[$1_1 + 8 >> 2] + 8 | 0; $4_1 = HEAP32[$1_1 + 32 >> 2]; block2 : { block1 : { while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { if (!$67(HEAP32[$2_1 >> 2], $4_1)) { break block1 } $2_1 = $2_1 + 20 | 0; continue; } break; }; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$3 >> 2] = $4_1; $257($0_1, 7527, $3); HEAP8[$0_1 + 17 | 0] = 1; $2_1 = 1; break block2; } HEAP32[$1_1 + 36 >> 2] = $2_1; $2_1 = 0; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1257($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { block7 : { $1_1 = $0_1; block1 : { if (!$1_1) { $0_1 = 0; break block1; } block3 : { block4 : { block9 : { block2 : { block5 : { block6 : { block8 : { $2_1 = HEAPU8[$1_1 | 0]; switch ($2_1 - 155 | 0) { case 0: break block2; case 1: case 4: case 5: case 6: case 7: case 8: case 9: case 10: case 11: case 12: case 16: case 19: case 20: case 21: break block3; case 2: case 14: case 17: break block4; case 3: break block5; case 13: case 15: case 22: case 23: break block6; case 18: case 24: break block7; default: break block8; }; } $0_1 = 2; block10 : { switch ($2_1 - 112 | 0) { case 6: break block1; case 1: case 3: case 4: case 5: break block3; case 2: break block7; case 0: break block9; default: break block10; }; } $0_1 = 0; if (($2_1 | 0) == 122) { continue } if (($2_1 | 0) == 36) { break block6 } if (($2_1 | 0) != 139) { break block3 } } $0_1 = $971($1_1); $0_1 = ($0_1 | 0) > 66 ? 5 : ($0_1 | 0) == 66 ? 6 : 7; break block1; } $4_1 = HEAP32[$1_1 + 20 >> 2]; $2_1 = $4_1 + 8 | 0; $1_1 = 1; $0_1 = 0; while (1) { $3 = HEAP32[$4_1 >> 2]; if (!(($3 | 0) <= ($1_1 | 0))) { $0_1 = $1257(HEAP32[($1_1 << 4) + $2_1 >> 2]) | $0_1; $1_1 = $1_1 + 2 | 0; continue; } break; }; if (!($3 & 1)) { break block1 } $5_1 = $0_1 | $5_1; $0_1 = HEAP32[(($3 << 4) + $2_1 | 0) - 16 >> 2]; continue; } $0_1 = 4; break block1; } $0_1 = 6; break block1; } $0_1 = 7; break block1; } $0_1 = 1; } return $0_1 | $5_1; } $0_1 = HEAP32[$1_1 + 12 >> 2]; continue; }; } function $1258($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $2_1 = HEAPU8[$1_1 | 0]; block2 : { if (($2_1 | 0) != 139) { if (($2_1 | 0) != 168) { break block2 } while (1) { $2_1 = 0; block3 : { while (1) { if ($2_1 | !$0_1) { break block3 } $2_1 = 0; $4_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = HEAP32[$4_1 >> 2]; $5_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $8_1 = $4_1 + 24 | 0; block4 : { while (1) { if (($2_1 | 0) == ($5_1 | 0)) { break block4 } $7_1 = Math_imul($2_1, 48); if (HEAP32[$8_1 + $7_1 >> 2] != HEAP32[$1_1 + 28 >> 2]) { $2_1 = $2_1 + 1 | 0; continue; } break; }; $4_1 = $4_1 + $7_1 | 0; $2_1 = HEAP32[$4_1 + 16 >> 2]; $6_1 = 0; if (!(HEAPU8[$4_1 + 21 | 0] & 4)) { continue } $6_1 = HEAP32[HEAP32[($4_1 + 8 | 0) + 44 >> 2] >> 2]; continue; } break; }; $0_1 = HEAP32[$0_1 + 12 >> 2]; continue; } break; }; $4_1 = 0; if (!$2_1) { break block2 } $1_1 = HEAP16[$1_1 + 32 >> 1]; if ($6_1) { $2_1 = HEAP32[$6_1 + 28 >> 2]; if (HEAP32[$2_1 >> 2] <= ($1_1 | 0)) { break block2 } $1_1 = HEAP32[($2_1 + ($1_1 << 4) | 0) + 8 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$6_1 + 32 >> 2]; HEAP32[$3 + 24 >> 2] = $0_1; HEAP32[$3 + 12 >> 2] = HEAP32[$0_1 >> 2]; $4_1 = $1258($3 + 12 | 0, $1_1); break block2; } if (($1_1 | 0) < 0) { $4_1 = 19649; break block2; } $4_1 = $418(HEAP32[$2_1 + 4 >> 2] + Math_imul($1_1, 12) | 0, 0); break block2; } $1_1 = HEAP32[$1_1 + 20 >> 2]; $2_1 = HEAP32[HEAP32[$1_1 + 28 >> 2] + 8 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 + 32 >> 2]; HEAP32[$3 + 24 >> 2] = $0_1; HEAP32[$3 + 12 >> 2] = HEAP32[$0_1 >> 2]; $4_1 = $1258($3 + 12 | 0, $2_1); } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1259($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$6_1 + 40 >> 2]) { return 2 } if (HEAPU16[$1_1 + 6 >> 1] & 1056) { return 1 } block2 : { $3 = HEAP32[$1_1 + 28 >> 2]; if (!$3) { break block2 } $5_1 = $3 + 8 | 0; while (1) { if (HEAP32[$3 >> 2] <= ($2_1 | 0)) { break block2 } $4_1 = $5_1 + ($2_1 << 4) | 0; $7_1 = HEAP32[$4_1 + 4 >> 2]; if (!(!$7_1 | HEAPU8[$4_1 + 9 | 0] & 3)) { $918($6_1, 0, $7_1) } $2_1 = $2_1 + 1 | 0; continue; }; } block4 : { $4_1 = HEAP32[$1_1 + 32 >> 2]; if (!$4_1) { break block4 } $7_1 = $4_1 + 8 | 0; $3 = 0; while (1) { if (HEAP32[$4_1 >> 2] <= ($3 | 0)) { break block4 } $2_1 = Math_imul($3, 48) + $7_1 | 0; $918($6_1, 0, HEAP32[$2_1 >> 2]); $5_1 = HEAP32[$2_1 + 40 >> 2]; block6 : { if (!(HEAPU8[$2_1 + 14 | 0] & 8)) { $920($0_1, $5_1); break block6; } $8_1 = $5_1 + 4 | 0; $2_1 = 0; while (1) { if (HEAP32[$5_1 >> 2] <= ($2_1 | 0)) { break block6 } $918($6_1, 0, HEAP32[$8_1 + ($2_1 << 2) >> 2]); $2_1 = $2_1 + 1 | 0; continue; }; } $3 = $3 + 1 | 0; continue; }; } $1261($0_1, $1_1); return 0; } function $1260($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 >> 2]; $918($0_1, 0, $1_1); if (!(HEAPU8[$1_1 + 7 | 0] & 3)) { $918($0_1, 0, $1_1 + 44 | 0) } return 0; } function $1261($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $3 = global$0 - 48 | 0; $2_1 = $3; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = HEAP32[$1_1 + 64 >> 2]; block : { if (!$4_1) { break block } $2_1 = HEAP32[$0_1 >> 2]; $1_1 = 0; if (!(HEAPU8[HEAP32[$4_1 + 20 >> 2] + 4 | 0] & 64)) { $7_1 = $876($2_1, $1214(HEAP32[$2_1 >> 2], $4_1)) } $12_1 = $4_1 + 12 | 0; $5_1 = $3 + 16 | 0; $8_1 = $5_1 + 16 | 0; $9_1 = $5_1 + 8 | 0; while (1) { if (($1_1 | 0) < HEAP32[$4_1 >> 2]) { $10_1 = Math_imul($1_1, 24) + $12_1 | 0; $11_1 = HEAP32[$10_1 + 8 >> 2]; $6_1 = $5_1 + 24 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$8_1 >> 2] = 0; HEAP32[$8_1 + 4 >> 2] = 0; HEAP32[$9_1 >> 2] = 0; HEAP32[$9_1 + 4 >> 2] = 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$3 + 12 >> 2] = $2_1; $6_1 = $2_1; if ($7_1) { $1017($2_1, $11_1, $3 + 12 | 0); $6_1 = HEAP32[$3 + 12 >> 2]; } if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { break block } $919($0_1, $11_1); $979($2_1, HEAP32[$10_1 + 4 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; if (!$7_1 | HEAP32[$2_1 + 280 >> 2] != ($7_1 | 0)) { break block } HEAP32[$2_1 + 280 >> 2] = HEAP32[$7_1 + 8 >> 2]; } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1262($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $7_1 = HEAP32[$2_1 + 12 >> 2]; $6_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$6_1 + 120 >> 2]; HEAP16[$3 + 28 >> 1] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 20 >> 2] = $5_1; HEAP32[$3 + 8 >> 2] = $6_1; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; block1 : { if (!HEAP32[$2_1 + 40 >> 2]) { while (1) { if (HEAPU16[$2_1 + 50 >> 1] <= $4_1 >>> 0) { break block1 } $6_1 = HEAP32[HEAP32[$7_1 + 4 >> 2] + Math_imul(HEAP16[HEAP32[$2_1 + 4 >> 2] + ($4_1 << 1) >> 1], 12) >> 2]; if ($4_1) { $36($3 + 8 | 0, 30770, 2) } $5_1 = $3 + 8 | 0; $44($5_1, HEAP32[$7_1 >> 2]); $36($5_1, 25082, 1); $44($5_1, $6_1); $4_1 = $4_1 + 1 | 0; continue; } } HEAP32[$3 >> 2] = HEAP32[$2_1 >> 2]; $46($3 + 8 | 0, 28383, $3); } $4_1 = $57($3 + 8 | 0); $1012($0_1, ((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 3) == 2 ? 1555 : 2067, $1_1, $4_1, -6, 2); $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1263($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 >> 2]; $1_1 = $906($3, $1_1, 0); if (!HEAPU8[$3 + 87 | 0]) { $1059($0_1, $1_1, $2_1, 16) } $11($3, $1_1); } function $1264($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $7_1 = $1_1 + 8 | 0; $6_1 = $7_1 + Math_imul($2_1, 48) | 0; $8_1 = HEAPU8[$6_1 + 12 | 0]; block : { if ($8_1 & 64) { break block } $9_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = $9_1 & 1; block2 : { if ($8_1 & 8) { if (!$10_1) { break block } if (HEAP32[$0_1 + 36 >> 2] == HEAP32[$6_1 + 16 >> 2]) { break block2 } break block; } if ($10_1) { break block } } block3 : { if (!($9_1 & 3) | !(HEAPU8[$1_1 + 20 | 0] & 64)) { break block3 } $1_1 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { if (($1_1 | 0) == ($5_1 | 0)) { break block3 } $2_1 = Math_imul($5_1, 48); $5_1 = $5_1 + 1 | 0; $2_1 = $2_1 + $7_1 | 0; if (HEAP32[$0_1 + 36 >> 2] != HEAP32[$2_1 + 16 >> 2]) { continue } break; }; $5_1 = 0; if (HEAPU8[$2_1 + 12 | 0] & 64) { break block } } HEAP32[$4_1 + 28 >> 2] = HEAP32[$6_1 + 16 >> 2]; HEAP32[$4_1 + 12 >> 2] = $3 ? 89 : 62; HEAP32[$4_1 + 8 >> 2] = 63; HEAP32[$4_1 + 4 >> 2] = 0; HEAP16[$4_1 + 24 >> 1] = 3; $920($4_1 + 4 | 0, $0_1); $5_1 = HEAPU16[$4_1 + 24 >> 1]; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1265($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 + -64 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!$1_1) { $2_1 = 0; break block1; } $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!(!($2_1 & 3) | HEAP32[$1_1 + 36 >> 2] != HEAP32[$0_1 + 4 >> 2])) { HEAP32[$1_1 + 36 >> 2] = HEAP32[$0_1 + 8 >> 2] } $3 = HEAPU8[$1_1 | 0]; block6 : { block4 : { if (($3 | 0) != 179) { if ($2_1 & 32 | ($3 | 0) != 168 | HEAP32[$1_1 + 28 >> 2] != HEAP32[$0_1 + 4 >> 2]) { break block4 } $3 = HEAP32[$0_1 >> 2]; $7_1 = HEAP16[$1_1 + 32 >> 1]; $2_1 = HEAP32[(HEAP32[$0_1 + 16 >> 2] + ($7_1 << 4) | 0) + 8 >> 2]; if ($1182($2_1)) { $1210($3, $2_1); break block6; } $3 = HEAP32[$3 >> 2]; block7 : { if (!HEAP32[$0_1 + 12 >> 2]) { break block7 } block9 : { if (HEAPU8[$2_1 | 0] != 168) { $4_1 = HEAP32[$0_1 + 8 >> 2]; break block9; } $4_1 = HEAP32[$0_1 + 8 >> 2]; if (($4_1 | 0) == HEAP32[$2_1 + 28 >> 2]) { break block7 } } $6_1 = $5_1 + 12 | 0; wasm2js_memory_fill($6_1, 0, 52); HEAP16[$5_1 + 44 >> 1] = 65437; HEAP32[$5_1 + 40 >> 2] = $4_1; HEAP32[$5_1 + 24 >> 2] = $2_1; HEAP8[$5_1 + 12 | 0] = 179; HEAP32[$5_1 + 16 >> 2] = 262144; $2_1 = $6_1; } $2_1 = $906($3, $2_1, 0); if (!HEAPU8[$3 + 87 | 0]) { if (HEAP32[$0_1 + 12 >> 2]) { HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 2097152 } if (HEAPU8[$2_1 | 0] == 171) { $4_1 = $1179($2_1); HEAP8[$2_1 | 0] = 156; HEAP32[$2_1 + 8 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 2048; } $6_1 = $851(HEAP32[$0_1 >> 2], $2_1); $4_1 = $851(HEAP32[$0_1 >> 2], HEAP32[(HEAP32[$0_1 + 20 >> 2] + ($7_1 << 4) | 0) + 8 >> 2]); block15 : { if (($6_1 | 0) == ($4_1 | 0)) { $7_1 = HEAPU8[$2_1 | 0]; if (($7_1 | 0) == 114 | ($7_1 | 0) == 168) { break block15 } } $6_1 = HEAP32[$0_1 >> 2]; if ($4_1) { $0_1 = HEAP32[$4_1 >> 2] } else { $0_1 = 33712 } $2_1 = $1246($6_1, $2_1, $0_1); } HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] & -513; $0_1 = HEAP32[$1_1 + 4 >> 2] & 3; if ($0_1) { $1087($2_1, HEAP32[$1_1 + 36 >> 2], $0_1) } $790($3, $1_1); break block1; } $11($3, $2_1); break block6; } if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$0_1 + 4 >> 2]) { break block4 } HEAP32[$1_1 + 28 >> 2] = HEAP32[$0_1 + 8 >> 2]; } HEAP32[$1_1 + 12 >> 2] = $1265($0_1, HEAP32[$1_1 + 12 >> 2]); HEAP32[$1_1 + 16 >> 2] = $1265($0_1, HEAP32[$1_1 + 16 >> 2]); $2_1 = HEAP32[$1_1 + 20 >> 2]; block20 : { if (HEAPU8[$1_1 + 5 | 0] & 16) { $1089($0_1, $2_1, 1); break block20; } $1313($0_1, $2_1); } if (!(HEAP8[$1_1 + 7 | 0] & 1)) { break block6 } $2_1 = HEAP32[$1_1 + 44 >> 2]; HEAP32[$2_1 + 40 >> 2] = $1265($0_1, HEAP32[$2_1 + 40 >> 2]); $1313($0_1, HEAP32[$2_1 + 8 >> 2]); $1313($0_1, HEAP32[$2_1 + 12 >> 2]); } $2_1 = $1_1; } $0_1 = $5_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1266($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 28 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 90; HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 4 >> 2] = $0_1; $920($3 + 4 | 0, $1_1); $1_1 = HEAPU16[$3 + 24 >> 1]; $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1267($0_1, $1_1) { $1_1 = $851($0_1, $1_1); if (!$1_1) { $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] } return $1_1; } function $1268($0_1, $1_1, $2_1) { var $3 = 0; while (1) { $3 = $1063($1_1); HEAP8[$0_1 + 8 | 0] = $2_1; block1 : { if ($3) { if (HEAPU8[$3 | 0] == ($2_1 | 0)) { break block1 } $1269($0_1, $1_1, 0); } return; } $1268($0_1, HEAP32[$3 + 12 >> 2], $2_1); $1_1 = HEAP32[$3 + 16 >> 2]; continue; }; } function $1269($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; if (($3 | 0) >= ($4_1 | 0)) { $5_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[HEAP32[$3 >> 2] >> 2]; $3 = $1289($3, Math_imul($4_1, 96)); HEAP32[$0_1 + 24 >> 2] = $3; if (!$3) { if ($2_1 & 1) { $11($6_1, $1_1) } HEAP32[$0_1 + 24 >> 2] = $5_1; return 0; } $4_1 = Math_imul(HEAP32[$0_1 + 12 >> 2], 48); if ($4_1) { wasm2js_memory_copy($3, $5_1, $4_1) } HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] << 1; $3 = HEAP32[$0_1 + 12 >> 2]; } $4_1 = 1; $5_1 = $3 + 1 | 0; HEAP32[$0_1 + 12 >> 2] = $5_1; $6_1 = Math_imul($3, 48); $7_1 = HEAP32[$0_1 + 24 >> 2]; if (!($2_1 & 2)) { HEAP32[$0_1 + 20 >> 2] = $5_1 } $5_1 = $6_1 + $7_1 | 0; if (!(!$1_1 | !(HEAPU8[$1_1 + 6 | 0] & 8))) { $4_1 = HEAP32[$1_1 + 28 >> 2]; $4_1 = $433($4_1, $4_1 >> 31) - 270 | 0; } HEAP16[$5_1 + 8 >> 1] = $4_1; $1_1 = $1063($1_1); HEAP16[$5_1 + 10 >> 1] = $2_1; HEAP32[$5_1 >> 2] = $1_1; HEAP32[$5_1 + 4 >> 2] = $0_1; wasm2js_memory_fill($5_1 + 12 | 0, 0, 36); return $3; } function $1270($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$1_1 + 12 >> 2]; while (1) { if (!(($2_1 | 0) <= 0)) { $2_1 = $2_1 - 1 | 0; $1319($0_1, $1_1, $2_1); continue; } break; }; } function $1272($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; if (!(HEAPU8[$1_1 + 6 | 0] & 16 | HEAPU8[$1_1 | 0] != 172)) { HEAP16[$0_1 + 20 >> 1] = 0; $2_1 = 2; } return $2_1 | 0; } function $1273($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0; $7_1 = global$0 - 96 | 0; $8_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $8_1; $9_1 = $5_1 & 130; $8_1 = 0; $5_1 = $1275($7_1, $0_1, $1_1, $2_1, $5_1, $6_1); while (1) { block1 : { block2 : { if ($5_1) { $0_1 = HEAP32[$5_1 + 32 >> 2]; $1_1 = HEAP32[$5_1 + 36 >> 2]; if ($3 & $0_1 | $4_1 & $1_1) { break block1 } if (!(HEAPU16[$5_1 + 12 >> 1] & $9_1) | ($0_1 | $1_1)) { break block2 } $8_1 = $5_1; } $0_1 = $7_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } $8_1 = $8_1 ? $8_1 : $5_1; } $5_1 = $1276($7_1); continue; }; } function $1274($0_1, $1_1) { $1_1 = HEAP16[HEAP32[$0_1 + 4 >> 2] + ($1_1 << 1) >> 1]; if (($1_1 | 0) >= 0) { return HEAPU8[(HEAP32[HEAP32[$0_1 + 12 >> 2] + 4 >> 2] + Math_imul($1_1, 12) | 0) + 4 | 0] & 15 } return ($1_1 | 0) == -1; } function $1275($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; HEAP8[$0_1 + 24 | 0] = 0; HEAP32[$0_1 + 4 >> 2] = $1_1; HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 28 >> 2] = $2_1; HEAP32[$0_1 + 16 >> 2] = 0; HEAP8[$0_1 + 25 | 0] = 1; HEAP8[$0_1 + 26 | 0] = 1; block3 : { block1 : { if ($5_1) { $1_1 = -1; $2_1 = HEAPU16[HEAP32[$5_1 + 4 >> 2] + ($3 << 1) >> 1]; $4_1 = HEAP32[$5_1 + 12 >> 2]; if (($2_1 | 0) == HEAPU16[$4_1 + 32 >> 1]) { break block1 } $1_1 = $2_1 << 16 >> 16; if (($1_1 | 0) >= 0) { HEAP8[$0_1 + 24 | 0] = HEAPU8[(HEAP32[$4_1 + 4 >> 2] + Math_imul($1_1, 12) | 0) + 5 | 0]; HEAP32[$0_1 + 8 >> 2] = HEAP32[HEAP32[$5_1 + 32 >> 2] + ($3 << 2) >> 2]; break block1; } if (($1_1 | 0) != -2) { break block1 } HEAP32[$0_1 + 12 >> 2] = HEAP32[(HEAP32[$5_1 + 40 >> 2] + ($3 << 4) | 0) + 8 >> 2]; $1_1 = HEAP32[HEAP32[$5_1 + 32 >> 2] + ($3 << 2) >> 2]; HEAP16[$0_1 + 72 >> 1] = 65534; HEAP32[$0_1 + 8 >> 2] = $1_1; HEAP8[$0_1 + 24 | 0] = $971(HEAP32[$0_1 + 12 >> 2]); return $1276($0_1); } $1_1 = $3; if (($1_1 | 0) == -2) { break block3 } } HEAP16[$0_1 + 72 >> 1] = $1_1; $6_1 = $1276($0_1); } return $6_1; } function $1276($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $9_1 = $0_1 + 28 | 0; $10_1 = $0_1 + 72 | 0; $2_1 = HEAPU8[$0_1 + 25 | 0]; $7_1 = HEAP32[$0_1 + 4 >> 2]; $8_1 = HEAP32[$0_1 + 16 >> 2]; label2 : while (1) { $2_1 = ($2_1 & 255) - 1 | 0; $11_1 = HEAP32[($2_1 << 2) + $9_1 >> 2]; $12_1 = HEAP16[($2_1 << 1) + $10_1 >> 1]; $14 = ($12_1 | 0) != -2; label1 : while (1) { $2_1 = HEAP32[$7_1 + 24 >> 2] + Math_imul($8_1, 48) | 0; while (1) { block1 : { if (($8_1 | 0) < HEAP32[$7_1 + 12 >> 2]) { if (HEAP32[$2_1 + 20 >> 2] != ($11_1 | 0) | HEAP32[$2_1 + 24 >> 2] != ($12_1 | 0)) { break block1 } if (!$14) { if ($1342(HEAP32[HEAP32[$2_1 >> 2] + 12 >> 2], HEAP32[$0_1 + 12 >> 2], $11_1)) { break block1 } } if (HEAP8[HEAP32[$2_1 >> 2] + 4 | 0] & 1 & HEAPU8[$0_1 + 25 | 0] >= 2) { break block1 } $3 = HEAPU16[$2_1 + 12 >> 1]; block4 : { if (!($3 & 2048)) { break block4 } $5_1 = HEAPU8[$0_1 + 26 | 0]; if ($5_1 >>> 0 > 10) { break block4 } $4_1 = $1063(HEAP32[HEAP32[$2_1 >> 2] + 16 >> 2]); if (!$4_1 | HEAPU8[$4_1 | 0] != 168 | HEAPU8[$4_1 + 4 | 0] & 32) { break block4 } $1_1 = 0; while (1) { if (($1_1 | 0) != ($5_1 | 0)) { if (HEAP32[($1_1 << 2) + $9_1 >> 2] == HEAP32[$4_1 + 28 >> 2] & HEAPU16[($1_1 << 1) + $10_1 >> 1] == HEAPU16[$4_1 + 32 >> 1]) { break block4 } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[($5_1 << 2) + $9_1 >> 2] = HEAP32[$4_1 + 28 >> 2]; HEAP16[($5_1 << 1) + $10_1 >> 1] = HEAPU16[$4_1 + 32 >> 1]; HEAP8[$0_1 + 26 | 0] = $5_1 + 1; $3 = HEAPU16[$2_1 + 12 >> 1]; } if (!($3 & HEAP32[$0_1 + 20 >> 2])) { break block1 } if (!(!HEAP32[$0_1 + 8 >> 2] | $3 & 256)) { $1_1 = HEAPU8[$0_1 + 24 | 0]; $4_1 = HEAP32[HEAP32[$7_1 >> 2] >> 2]; block9 : { if ($3 & 1) { $3 = global$0 + -64 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[$2_1 >> 2]; $13_1 = HEAP32[$5_1 + 12 >> 2]; if ($1182($13_1)) { $6_1 = HEAP32[$2_1 + 28 >> 2]; HEAP8[$3 + 12 | 0] = 54; HEAP32[$3 + 16 >> 2] = 0; $6_1 = ($6_1 << 4) - 16 | 0; HEAP32[$3 + 24 >> 2] = HEAP32[($6_1 + HEAP32[$13_1 + 20 >> 2] | 0) + 8 >> 2]; HEAP32[$3 + 28 >> 2] = HEAP32[($6_1 + HEAP32[HEAP32[$5_1 + 20 >> 2] + 28 >> 2] | 0) + 8 >> 2]; $5_1 = $3 + 12 | 0; } $6_1 = 0; block2 : { if (!$1345($5_1, $1_1 << 24 >> 24)) { break block2 } $1_1 = $369($4_1, $5_1); $6_1 = 33712; if (!$1_1) { break block2 } $6_1 = HEAP32[$1_1 >> 2]; } $4_1 = $6_1; $1_1 = $3 - -64 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = $4_1; if ($1_1) { break block9 } break block1; } $3 = HEAP32[$2_1 >> 2]; if (!$1345($3, $1_1 << 24 >> 24)) { break block1 } $1_1 = $369($4_1, $3); if (!$1_1) { $1_1 = 33712; break block9; } $1_1 = HEAP32[$1_1 >> 2]; } if ($67($1_1, HEAP32[$0_1 + 8 >> 2])) { break block1 } $3 = HEAPU16[$2_1 + 12 >> 1]; } block11 : { if (!($3 & 130)) { break block11 } $1_1 = HEAP32[HEAP32[$2_1 >> 2] + 16 >> 2]; if (!$1_1 | HEAPU8[$1_1 | 0] != 168 | HEAP32[$1_1 + 28 >> 2] != HEAP32[$9_1 >> 2]) { break block11 } if (HEAPU16[$1_1 + 32 >> 1] == HEAPU16[$10_1 >> 1]) { break block1 } } HEAP32[$0_1 + 4 >> 2] = $7_1; HEAP32[$0_1 + 16 >> 2] = $8_1 + 1; return $2_1; } $8_1 = 0; $7_1 = HEAP32[$7_1 + 4 >> 2]; if ($7_1) { continue label1 } $2_1 = HEAPU8[$0_1 + 25 | 0]; if ($2_1 >>> 0 >= HEAPU8[$0_1 + 26 | 0]) { return 0 } $2_1 = $2_1 + 1 | 0; HEAP8[$0_1 + 25 | 0] = $2_1; $7_1 = HEAP32[$0_1 >> 2]; continue label2; } $2_1 = $2_1 + 48 | 0; $8_1 = $8_1 + 1 | 0; continue; }; }; }; } function $1277($0_1, $1_1) { var $2_1 = 0, $3 = 0; if (($1_1 | 0) == HEAP32[$0_1 + 8 >> 2]) { i64toi32_i32$HIGH_BITS = 0; return 1; } $2_1 = $0_1 + 8 | 0; $0_1 = HEAP32[$0_1 + 4 >> 2]; $3 = ($0_1 | 0) <= 1 ? 1 : $0_1; $0_1 = 1; while (1) { if (($0_1 | 0) == ($3 | 0)) { i64toi32_i32$HIGH_BITS = 0; return 0; } if (($1_1 | 0) == HEAP32[($0_1 << 2) + $2_1 >> 2]) { $1_1 = $0_1 & 31; if (($0_1 & 63) >>> 0 >= 32) { $0_1 = 1 << $1_1; $1_1 = 0; } else { $2_1 = 1 << $1_1; $0_1 = $2_1 - 1 & 1 >>> 32 - $1_1; $1_1 = $2_1; } i64toi32_i32$HIGH_BITS = $0_1; } else { $0_1 = $0_1 + 1 | 0; continue; } break; }; return $1_1; } function $1278($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0; $14 = global$0 - 16 | 0; $6_1 = $14; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$14 + 8 >> 2] = 0; $10_1 = HEAP32[$0_1 >> 2]; $15_1 = HEAP32[$0_1 + 8 >> 2]; $6_1 = HEAP32[$10_1 + 4 >> 2] + Math_imul(HEAPU8[$15_1 + 16 | 0], 48) | 0; $8_1 = $6_1 + 8 | 0; $12_1 = HEAP32[$6_1 + 16 >> 2]; $16_1 = HEAP32[$10_1 + 8 >> 2]; $18_1 = HEAP32[$10_1 >> 2]; $21_1 = HEAP32[$0_1 + 4 >> 2]; $7_1 = $21_1; while (1) { if ($7_1) { $6_1 = 0; $5_1 = HEAP32[$7_1 + 12 >> 2]; $11_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $5_1 = HEAP32[$7_1 + 24 >> 2]; while (1) { if (!(($6_1 | 0) == ($11_1 | 0))) { $9_1 = HEAPU16[$5_1 + 10 >> 1]; HEAP16[$5_1 + 10 >> 1] = $9_1 & 65471; block2 : { if (!(HEAPU16[$5_1 + 12 >> 1] & 63487) | ($3 & HEAP32[$5_1 + 32 >> 2] | $4_1 & HEAP32[$5_1 + 36 >> 2]) | HEAP32[$5_1 + 20 >> 2] != HEAP32[$8_1 + 16 >> 2]) { break block2 } if ($9_1 & 128) { break block2 } if (HEAPU8[$8_1 + 12 | 0] & 88) { if (!$1346($5_1, $8_1)) { break block2 } } HEAP16[$5_1 + 10 >> 1] = $9_1 | 64; $13_1 = $13_1 + 1 | 0; } $5_1 = $5_1 + 48 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; $7_1 = HEAP32[$7_1 + 4 >> 2]; continue; } break; }; block10 : { block4 : { if (!$16_1) { break block4 } $11_1 = HEAP32[$16_1 >> 2]; $9_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $6_1 = $16_1 + 8 | 0; $5_1 = 0; block5 : { while (1) { if (($5_1 | 0) == ($9_1 | 0)) { break block5 } block7 : { $4_1 = $6_1 + ($5_1 << 4) | 0; $3 = HEAP32[$4_1 >> 2]; block6 : { if ($944(0, $3)) { break block6 } if (HEAPU8[$4_1 + 8 | 0] & 2) { break block7 } $4_1 = HEAPU8[$3 | 0]; if (($4_1 | 0) != 114) { if (($4_1 | 0) != 168 | HEAP32[$3 + 28 >> 2] != HEAP32[$8_1 + 16 >> 2]) { break block7 } break block6; } $4_1 = HEAP32[$3 + 12 >> 2]; if (HEAPU8[$4_1 | 0] != 168 | HEAP32[$4_1 + 28 >> 2] != HEAP32[$8_1 + 16 >> 2]) { break block7 } $4_1 = HEAP16[$4_1 + 32 >> 1]; HEAP16[$3 + 32 >> 1] = $4_1; if (($4_1 | 0) < 0) { break block6 } $7_1 = HEAP32[$3 + 8 >> 2]; $3 = $419(HEAP32[$12_1 + 4 >> 2] + Math_imul($4_1 & 65535, 12) | 0); if ($66($7_1, $3 ? $3 : 33712)) { break block7 } } $5_1 = $5_1 + 1 | 0; continue; } break; }; $9_1 = $5_1; } if (($11_1 | 0) != ($9_1 | 0)) { break block4 } $3 = HEAPU16[$10_1 + 40 >> 1]; if (!(!($3 & 128) | (HEAPU8[$8_1 + 13 | 0] | HEAPU8[$8_1 + 14 | 0] << 8) << 16 >> 16 < 0)) { $9_1 = $3 >>> 9 & 1 | 2; break block10; } $9_1 = $3 >>> 6 & 1; break block10; } $11_1 = 0; $9_1 = 0; } $3 = $11_1 << 3; $7_1 = $270(HEAP32[$18_1 >> 2], ($3 + Math_imul($13_1, 24) | 0) + 96 | 0, 0); block12 : { if (!$7_1) { $257($18_1, 1162, 0); $5_1 = 7; break block12; } $19_1 = (($13_1 << 2) + $7_1 | 0) + 92 | 0; HEAP32[$7_1 + 4 >> 2] = $19_1; $17_1 = Math_imul($13_1, 12) + $19_1 | 0; HEAP32[$7_1 + 12 >> 2] = $17_1; HEAP32[$7_1 + 16 >> 2] = $3 + $17_1; $4_1 = HEAP32[$8_1 + 28 >> 2]; $3 = HEAP32[$8_1 + 24 >> 2]; HEAP32[$7_1 + 64 >> 2] = $3; HEAP32[$7_1 + 68 >> 2] = $4_1; block13 : { if (!(HEAPU8[$12_1 + 28 | 0] & 128)) { break block13 } $13_1 = $359($12_1); $10_1 = HEAPU16[$13_1 + 50 >> 1]; $5_1 = 0; while (1) { if (($5_1 | 0) == ($10_1 | 0)) { break block13 } $6_1 = HEAP16[HEAP32[$13_1 + 4 >> 2] + ($5_1 << 1) >> 1]; $8_1 = ($6_1 | 0) >= 63 ? 63 : $6_1; $6_1 = $8_1 & 31; if (($8_1 & 63) >>> 0 >= 32) { $8_1 = 1 << $6_1; $12_1 = 0; } else { $12_1 = 1 << $6_1; $8_1 = $12_1 - 1 & 1 >>> 32 - $6_1; } $3 = $12_1 | $3; HEAP32[$7_1 + 64 >> 2] = $3; $4_1 = $4_1 | $8_1; HEAP32[$7_1 + 68 >> 2] = $4_1; $5_1 = $5_1 + 1 | 0; continue; }; } HEAP32[$7_1 + 84 >> 2] = 0; HEAP32[$7_1 + 80 >> 2] = $9_1; HEAP32[$7_1 + 76 >> 2] = $18_1; HEAP32[$7_1 + 72 >> 2] = $21_1; $12_1 = 0; $4_1 = $21_1; $13_1 = 0; $8_1 = 0; $6_1 = 0; while (1) { if ($4_1) { $3 = HEAP32[$4_1 + 12 >> 2] + $6_1 | 0; $3 = ($3 | 0) < ($6_1 | 0) ? $6_1 : $3; $5_1 = HEAP32[$4_1 + 24 >> 2]; while (1) { if (!(($3 | 0) == ($6_1 | 0))) { $20_1 = HEAPU16[$5_1 + 10 >> 1]; if ($20_1 & 64) { $10_1 = HEAP32[$5_1 + 24 >> 2]; $9_1 = Math_imul($8_1, 12) + $19_1 | 0; HEAP32[$9_1 + 8 >> 2] = $6_1; HEAP32[$9_1 >> 2] = $10_1; $22_1 = HEAPU16[$5_1 + 12 >> 1]; $10_1 = $22_1 & 16383; block19 : { if (($10_1 | 0) == 1) { if ($20_1 << 16 >> 16 >= 0) { $12_1 = (($8_1 | 0) < 32 ? 1 << $8_1 : 0) | $12_1; HEAP32[$7_1 + 84 >> 2] = $12_1; } HEAP8[$9_1 + 4 | 0] = 2; break block19; } if (($10_1 | 0) == 64) { HEAP8[$9_1 + 4 | 0] = HEAPU8[$5_1 + 15 | 0]; break block19; } if ($10_1 & 384) { if (($10_1 | 0) == 256) { HEAP8[$9_1 + 4 | 0] = 71; break block19; } HEAP8[$9_1 + 4 | 0] = 72; break block19; } HEAP8[$9_1 + 4 | 0] = $22_1; if (!($10_1 & 60)) { break block19 } if (!$1182(HEAP32[HEAP32[$5_1 >> 2] + 16 >> 2])) { break block19 } $13_1 = (($8_1 | 0) < 16 ? 1 << $8_1 : 0) | $13_1; if (($10_1 | 0) != 4) { if (($10_1 | 0) != 16) { break block19 } HEAP8[$9_1 + 4 | 0] = 8; break block19; } HEAP8[$9_1 + 4 | 0] = 32; } $8_1 = $8_1 + 1 | 0; } $5_1 = $5_1 + 48 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; $4_1 = HEAP32[$4_1 + 4 >> 2]; $6_1 = $3; continue; } break; }; HEAP32[$7_1 >> 2] = $8_1; $3 = ($11_1 | 0) > 0 ? $11_1 : 0; $4_1 = $16_1 + 8 | 0; $11_1 = 0; $5_1 = 0; while (1) { if (!(($3 | 0) == ($5_1 | 0))) { $6_1 = $4_1 + ($5_1 << 4) | 0; $8_1 = HEAP32[$6_1 >> 2]; if (!$944(0, $8_1)) { $9_1 = ($11_1 << 3) + $17_1 | 0; HEAP32[$9_1 >> 2] = HEAP16[$8_1 + 32 >> 1]; HEAP8[$9_1 + 4 | 0] = HEAP8[$6_1 + 8 | 0] & 1; $11_1 = $11_1 + 1 | 0; } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP32[$7_1 + 8 >> 2] = $11_1; HEAP16[$15_1 + 44 >> 1] = 0; HEAP32[$15_1 + 40 >> 2] = 1024; HEAP16[$15_1 + 18 >> 1] = 0; HEAP8[$15_1 + 28 | 0] = HEAPU8[$15_1 + 28 | 0] & 254; $3 = HEAP32[$7_1 >> 2]; if ($1327(HEAP32[$18_1 >> 2], $15_1, $3)) { $1347(HEAP32[$18_1 >> 2], $7_1); $5_1 = 7; break block12; } $4_1 = $13_1 & 65535; $11_1 = $14 + 12 | 0; $5_1 = $1348($0_1, $1_1, $2_1, -1, -1, 0, $7_1, $4_1, $11_1, $14 + 8 | 0); if (HEAP32[$14 + 8 >> 2]) { $5_1 = $1348($0_1, $1_1, $2_1, -1, -1, 0, $7_1, $4_1, $11_1, 0) } block28 : { if ($5_1) { break block28 } $12_1 = 0; $19_1 = 0; $4_1 = HEAP32[$14 + 12 >> 2]; $17_1 = $2_1 ^ -1; $6_1 = $17_1 & HEAP32[$15_1 + 4 >> 2]; $22_1 = $6_1; $20_1 = $1_1 ^ -1; $23_1 = $20_1 & HEAP32[$15_1 >> 2]; if (!($6_1 | $23_1)) { $5_1 = 0; if (!$4_1) { break block28 } } $11_1 = 0; $5_1 = 0; $25 = ($3 | 0) > 0 ? $3 : 0; if ($4_1) { $5_1 = $1348($0_1, $1_1, $2_1, -1, -1, 1, $7_1, $13_1 & 65535, $14 + 12 | 0, 0); $6_1 = $17_1 & HEAP32[$15_1 + 4 >> 2]; $19_1 = $6_1; $12_1 = $20_1 & HEAP32[$15_1 >> 2]; $11_1 = !($6_1 | $12_1); } $9_1 = !$11_1; $8_1 = 0; $6_1 = 0; $26_1 = $13_1 & 65535; while (1) { if ($5_1) { break block28 } $3 = -1; $4_1 = -1; $5_1 = 0; while (1) { if (!(($5_1 | 0) == ($25 | 0))) { $10_1 = $368($21_1, HEAP32[(HEAP32[$7_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) + 8 >> 2]); $16_1 = $20_1 & HEAP32[$10_1 + 32 >> 2]; $10_1 = $17_1 & HEAP32[$10_1 + 36 >> 2]; $24_1 = ($4_1 | 0) == ($10_1 | 0) & $3 >>> 0 > $16_1 >>> 0 | $4_1 >>> 0 > $10_1 >>> 0; $27 = $24_1 ? $16_1 : $3; $16_1 = ($6_1 | 0) == ($10_1 | 0) & $8_1 >>> 0 < $16_1 >>> 0 | $6_1 >>> 0 < $10_1 >>> 0; $3 = $16_1 ? $27 : $3; $4_1 = $16_1 ? ($24_1 ? $10_1 : $4_1) : $4_1; $5_1 = $5_1 + 1 | 0; continue; } break; }; if (($3 & $4_1) != -1) { $5_1 = 0; $8_1 = $3; $6_1 = $4_1; if (($3 | 0) == ($23_1 | 0) & ($4_1 | 0) == ($22_1 | 0) | ($3 | 0) == ($12_1 | 0) & ($4_1 | 0) == ($19_1 | 0)) { continue } $5_1 = $1348($0_1, $1_1, $2_1, $1_1 | $3, $2_1 | $4_1, 0, $7_1, $26_1, $14 + 12 | 0, 0); if (($1_1 | 0) != HEAP32[$15_1 >> 2] | ($2_1 | 0) != HEAP32[$15_1 + 4 >> 2]) { continue } $11_1 = HEAP32[$14 + 12 >> 2] ? $11_1 : 1; $9_1 = 0; continue; } break; }; $5_1 = 0; if ($9_1 & 1) { $5_1 = $1348($0_1, $1_1, $2_1, $1_1, $2_1, 0, $7_1, $13_1 & 65535, $14 + 12 | 0, 0); $11_1 = HEAP32[$14 + 12 >> 2] ? $11_1 : 1; } if ($5_1 | $11_1) { break block28 } $5_1 = $1348($0_1, $1_1, $2_1, $1_1, $2_1, 1, $7_1, $13_1 & 65535, $14 + 12 | 0, 0); } $1347(HEAP32[$18_1 >> 2], $7_1); } $0_1 = $14 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1279($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $7_1 = global$0 - 96 | 0; $5_1 = $7_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP16[$7_1 + 18 >> 1] = 65535; $13_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 8 >> 2]; $5_1 = HEAP32[$13_1 + 4 >> 2] + Math_imul(HEAPU8[$6_1 + 16 | 0], 48) | 0; $11_1 = $5_1 + 8 | 0; $12_1 = HEAP32[$5_1 + 16 >> 2]; $18_1 = HEAP32[$0_1 + 4 >> 2]; $3 = HEAPU8[$5_1 + 21 | 0] | HEAPU8[$5_1 + 22 | 0] << 8; block1 : { if ($3 & 2) { $5_1 = HEAP32[$11_1 + 36 >> 2]; break block1; } if (HEAPU8[$12_1 + 28 | 0] & 128) { $5_1 = HEAP32[$12_1 + 8 >> 2]; break block1; } $5_1 = $7_1 + 24 | 0; wasm2js_memory_fill($5_1, 0, 72); HEAP32[$7_1 + 72 >> 2] = 65539; HEAP8[$7_1 + 78 | 0] = 5; HEAP8[$7_1 + 79 | 0] = 3; HEAP8[$7_1 + 80 | 0] = 0; HEAP32[$7_1 + 32 >> 2] = $7_1 + 20; HEAP32[$7_1 + 28 >> 2] = $7_1 + 18; HEAP16[$7_1 + 76 >> 1] = 1; HEAP32[$7_1 + 36 >> 2] = $12_1; $14 = HEAPU16[$12_1 + 38 >> 1]; HEAP16[$7_1 + 22 >> 1] = 0; HEAP16[$7_1 + 20 >> 1] = $14; if ($3 & 1) { break block1 } HEAP32[$7_1 + 44 >> 2] = HEAP32[$12_1 + 8 >> 2]; } block4 : { if (HEAPU8[$11_1 + 12 | 0] & 16 | (HEAP32[$0_1 + 12 >> 2] | HEAPU16[$13_1 + 40 >> 1] & 4128 | (!(HEAPU8[HEAP32[HEAP32[$13_1 >> 2] >> 2] + 33 | 0] & 128) | $3 & 147))) { break block4 } $3 = HEAP32[$18_1 + 24 >> 2]; $9_1 = $3 + Math_imul(HEAP32[$18_1 + 12 >> 2], 48) | 0; $4_1 = HEAP16[$12_1 + 38 >> 1]; $14 = $1322($4_1); $4_1 = $4_1 + $14 | 0; $8_1 = $4_1 - 25 | 0; $15_1 = $4_1 + 28 | 0; $4_1 = 0; while (1) { if ($3 >>> 0 >= $9_1 >>> 0 | $4_1) { break block4 } $4_1 = 0; block5 : { if (HEAP32[$6_1 + 8 >> 2] & HEAP32[$3 + 32 >> 2] | HEAP32[$6_1 + 12 >> 2] & HEAP32[$3 + 36 >> 2]) { break block5 } if (!$1326($3, $11_1, 0, 0)) { break block5 } HEAP16[$6_1 + 24 >> 1] = 1; HEAP32[$6_1 + 44 >> 2] = 1; HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[HEAP32[$6_1 + 52 >> 2] >> 2] = $3; block7 : { if (HEAPU8[$12_1 + 43 | 0] != 2) { $4_1 = $15_1; if (!(HEAPU8[$12_1 + 29 | 0] & 64)) { break block7 } } $4_1 = $8_1; } HEAP16[$6_1 + 22 >> 1] = 43; $4_1 = $4_1 << 16 >> 16; HEAP16[$6_1 + 18 >> 1] = ($4_1 | 0) > 0 ? $4_1 : 0; HEAP32[$6_1 + 40 >> 2] = 16384; HEAP16[$6_1 + 20 >> 1] = $1073($14, 43); $4_1 = $2_1 | HEAP32[$3 + 36 >> 2]; HEAP32[$6_1 >> 2] = $1_1 | HEAP32[$3 + 32 >> 2]; HEAP32[$6_1 + 4 >> 2] = $4_1; $4_1 = $1349($0_1, $6_1); } $3 = $3 + 48 | 0; continue; }; } $14 = 1; while (1) { block31 : { block10 : { block27 : { if (!(!$5_1 | $4_1)) { $3 = HEAP32[$5_1 + 36 >> 2]; if ($3) { if (!$1350(HEAP32[$11_1 + 16 >> 2], HEAPU8[$11_1 + 12 | 0], $18_1, $3)) { break block10 } } if (HEAPU8[$5_1 + 56 | 0] & 2) { break block10 } $15_1 = HEAPU16[HEAP32[$5_1 + 8 >> 2] >> 1]; HEAP16[$6_1 + 28 >> 1] = 0; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 44 >> 2] = 0; HEAP16[$6_1 + 18 >> 1] = 0; HEAP8[$6_1 + 17 | 0] = 0; HEAP32[$6_1 + 36 >> 2] = 0; HEAP32[$6_1 + 32 >> 2] = $5_1; HEAP16[$6_1 + 22 >> 1] = $15_1; HEAP32[$6_1 >> 2] = $1_1; HEAP32[$6_1 + 4 >> 2] = $2_1; $4_1 = 1; block11 : { if (HEAPU8[$5_1 + 55 | 0] & 4) { break block11 } $8_1 = HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]; if (!$8_1) { break block11 } $10_1 = HEAP32[$11_1 + 16 >> 2]; $19_1 = $8_1 + 8 | 0; $3 = 0; while (1) { $4_1 = HEAP32[$8_1 >> 2] <= ($3 | 0); if ($4_1) { break block11 } block15 : { block12 : { $9_1 = $1063(HEAP32[($3 << 4) + $19_1 >> 2]); if (!$9_1) { break block12 } block14 : { block13 : { switch (HEAPU8[$9_1 | 0] - 168 | 0) { case 0: case 2: break block13; default: break block14; }; } if (($10_1 | 0) != HEAP32[$9_1 + 28 >> 2]) { break block14 } $9_1 = HEAP16[$9_1 + 32 >> 1]; if (($9_1 | 0) < 0) { break block11 } $16_1 = HEAPU16[$5_1 + 50 >> 1]; $4_1 = 0; $9_1 = $9_1 & 65535; while (1) { if (($4_1 | 0) == ($16_1 | 0)) { break block12 } $17_1 = $4_1 << 1; $4_1 = $4_1 + 1 | 0; if (($9_1 | 0) != HEAPU16[$17_1 + HEAP32[$5_1 + 4 >> 2] >> 1]) { continue } break; }; break block15; } $4_1 = HEAP32[$5_1 + 40 >> 2]; if (!$4_1) { break block12 } $16_1 = $4_1 + 8 | 0; $4_1 = 0; while (1) { if (HEAPU16[$5_1 + 50 >> 1] <= $4_1 >>> 0) { break block12 } if (HEAPU16[HEAP32[$5_1 + 4 >> 2] + ($4_1 << 1) >> 1] == 65534) { if (!$1342($9_1, HEAP32[$16_1 + ($4_1 << 4) >> 2], $10_1)) { break block15 } } $4_1 = $4_1 + 1 | 0; continue; }; } $3 = $3 + 1 | 0; continue; } break; }; $4_1 = 0; } $9_1 = $15_1 << 16 >> 16; block18 : { $3 = HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8; if (($3 & 3) == 3) { HEAP32[$6_1 + 40 >> 2] = 256; HEAP16[$6_1 + 20 >> 1] = $9_1 + 16; HEAP8[$6_1 + 17 | 0] = $4_1 ? 0 : $14; $1351($18_1, $6_1, $9_1); $3 = HEAPU8[$11_1 + 13 | 0] | HEAPU8[$11_1 + 14 | 0] << 8; if (!($3 & 4)) { break block18 } if ($3 & 64) { HEAP32[$6_1 + 40 >> 2] = HEAP32[$6_1 + 40 >> 2] | 33554432 } HEAP32[$6_1 + 36 >> 2] = HEAP32[HEAP32[HEAP32[$11_1 + 44 >> 2] >> 2] + 48 >> 2]; break block18; } block25 : { block21 : { if ($3 & 32) { HEAP32[$7_1 + 8 >> 2] = 0; HEAP32[$7_1 + 12 >> 2] = 0; $3 = 576; break block21; } $8_1 = HEAP32[$5_1 + 68 >> 2] & HEAP32[$11_1 + 28 >> 2]; $3 = HEAP32[$5_1 + 64 >> 2] & HEAP32[$11_1 + 24 >> 2]; HEAP32[$7_1 + 8 >> 2] = $3; HEAP32[$7_1 + 12 >> 2] = $8_1; $10_1 = HEAP32[$5_1 + 36 >> 2]; if ($10_1) { $1288(HEAP32[$13_1 >> 2], $5_1, $10_1, $7_1 + 8 | 0, 0, 0); $8_1 = HEAP32[$7_1 + 12 >> 2]; $3 = HEAP32[$7_1 + 8 >> 2]; } HEAP32[$6_1 + 40 >> 2] = 512; block24 : { if (!(!$3 & ($8_1 | 0) == -2147483648)) { $10_1 = HEAPU8[$5_1 + 55 | 0] | HEAPU8[$5_1 + 56 | 0] << 8; if (!($10_1 & 4096) | !($3 | $8_1) | $10_1 & 2048) { break block24 } } $19_1 = HEAP32[$11_1 + 16 >> 2]; $10_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $16_1 = HEAP32[$13_1 + 16 >> 2]; block16 : { if (!$16_1) { break block16 } if (!(HEAPU8[$5_1 + 56 | 0] & 16)) { $17_1 = HEAPU16[$5_1 + 52 >> 1]; $8_1 = 0; while (1) { if (($8_1 | 0) == ($17_1 | 0)) { break block16 } $20_1 = $8_1 << 1; $8_1 = $8_1 + 1 | 0; if (HEAP16[HEAP32[$5_1 + 4 >> 2] + $20_1 >> 1] < 63) { continue } break; }; } $8_1 = $3 + 16 | 0; HEAP32[$8_1 >> 2] = 0; HEAP32[$8_1 + 4 >> 2] = 0; $10_1 = $3 + 8 | 0; $17_1 = $10_1 + 16 | 0; HEAP32[$17_1 >> 2] = 0; HEAP32[$17_1 + 4 >> 2] = 0; HEAP32[$8_1 >> 2] = 46; HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 40 >> 2] = $19_1; HEAP32[$3 + 36 >> 2] = $5_1; HEAP32[$3 + 12 >> 2] = 93; HEAP32[$3 + 32 >> 2] = $3 + 36; HEAP16[$3 + 44 >> 1] = 0; $919($10_1, $16_1); $10_1 = HEAPU8[$3 + 45 | 0] ? 0 : HEAPU8[$3 + 44 | 0] ? 67108864 : 64; } $3 = $3 + 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!$10_1) { break block25 } HEAP32[$7_1 + 8 >> 2] = 0; HEAP32[$7_1 + 12 >> 2] = 0; $3 = $10_1 | HEAP32[$6_1 + 40 >> 2]; break block21; } if ($3 | $8_1) { break block25 } $3 = 576; if (HEAP32[$13_1 + 16 >> 2] | !(HEAPU8[$12_1 + 28 | 0] & 128)) { break block21 } $8_1 = HEAP32[18950]; if (!$8_1) { break block25 } if (!(FUNCTION_TABLE[$8_1 | 0](700) | 0)) { break block25 } } HEAP32[$6_1 + 40 >> 2] = $3; } $3 = $14; block26 : { if (!$4_1) { break block26 } $3 = 0; if (HEAPU8[$11_1 + 13 | 0] & 2 | (HEAP32[$5_1 + 36 >> 2] | HEAPU8[$12_1 + 28 | 0] & 128)) { break block26 } if (HEAPU8[$5_1 + 55 | 0] & 4 | (HEAP32[$7_1 + 8 >> 2] | HEAP32[$7_1 + 12 >> 2]) | (HEAPU8[$13_1 + 40 | 0] & 4 | HEAP16[$5_1 + 48 >> 1] >= HEAP16[$12_1 + 40 >> 1]) | (!HEAPU8[75551] | HEAPU8[HEAP32[HEAP32[$13_1 >> 2] >> 2] + 80 | 0] & 32)) { break block27 } } HEAP8[$6_1 + 17 | 0] = $3; HEAP16[$6_1 + 20 >> 1] = (((Math_imul(HEAP16[$5_1 + 48 >> 1], 15) | 0) / HEAP16[$12_1 + 40 >> 1] | 0) + $15_1 | 0) + 1; if (HEAP32[$7_1 + 8 >> 2] | HEAP32[$7_1 + 12 >> 2]) { $3 = $9_1 + 16 | 0; $15_1 = HEAP32[$11_1 + 16 >> 2]; $4_1 = 0; while (1) { block29 : { if (HEAP32[$13_1 + 92 >> 2] <= ($4_1 | 0)) { break block29 } $8_1 = HEAP32[$13_1 + 104 >> 2] + Math_imul($4_1, 48) | 0; if (!$1302(HEAP32[$8_1 >> 2], $15_1, $5_1)) { break block29 } $4_1 = $4_1 + 1 | 0; $10_1 = HEAP16[$8_1 + 8 >> 1]; if (($10_1 | 0) > 0) { $10_1 = HEAPU8[$8_1 + 12 | 0] & 130 ? -20 : -1 } $3 = $10_1 + $3 | 0; continue; } break; }; HEAP16[$6_1 + 20 >> 1] = $1073(HEAP16[$6_1 + 20 >> 1], $3 << 16 >> 16); } $1351($18_1, $6_1, $9_1); if (!(HEAPU8[$11_1 + 12 | 0] & 16) | !HEAP32[$5_1 + 40 >> 2]) { break block18 } HEAP16[$6_1 + 22 >> 1] = $9_1; break block27; } $4_1 = $1349($0_1, $6_1); HEAP16[$6_1 + 22 >> 1] = $9_1; if (!$4_1) { break block27 } } $0_1 = $7_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } HEAP8[$0_1 + 16 | 0] = 0; $4_1 = $1353($0_1, $11_1, $5_1, 0); if (HEAPU8[$0_1 + 16 | 0] != 1) { break block31 } HEAP32[$12_1 + 28 >> 2] = HEAP32[$12_1 + 28 >> 2] | 256; break block31; } $4_1 = 0; } $14 = $14 + 1 | 0; $5_1 = HEAPU8[$11_1 + 13 | 0] & 2 ? 0 : HEAP32[$5_1 + 20 >> 2]; continue; }; } function $1280($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0; $6_1 = global$0 - 608 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $5_1 = HEAP32[$0_1 >> 2]; $9_1 = HEAP32[$0_1 + 8 >> 2]; $14 = HEAP32[$0_1 + 4 >> 2]; $12_1 = HEAP32[$14 + 24 >> 2]; $7_1 = HEAP32[$14 + 12 >> 2]; $10_1 = $6_1 + 112 | 0; wasm2js_memory_fill($10_1, 0, 56); block1 : { $5_1 = HEAP32[$5_1 + 4 >> 2] + Math_imul(HEAPU8[$9_1 + 16 | 0], 48) | 0; if (HEAPU8[$5_1 + 20 | 0] & 16) { break block1 } $21_1 = Math_imul($7_1, 48) + $12_1 | 0; $22_1 = $5_1 + 8 | 0; $23_1 = HEAP32[$5_1 + 24 >> 2]; $16_1 = $9_1 + 24 | 0; $18_1 = $6_1 + 8 | 0; $19_1 = $6_1 - -64 | 0; $17_1 = $10_1 + 8 | 0; while (1) { if ($12_1 >>> 0 >= $21_1 >>> 0 | $8_1) { break block1 } $8_1 = 0; block2 : { if (!(HEAPU8[$12_1 + 13 | 0] & 2)) { break block2 } $5_1 = HEAP32[$12_1 + 24 >> 2]; if (!(HEAP32[$9_1 + 8 >> 2] & HEAP32[$5_1 + 416 >> 2] | HEAP32[$9_1 + 12 >> 2] & HEAP32[$5_1 + 420 >> 2])) { break block2 } $10_1 = HEAP32[$5_1 + 24 >> 2]; $5_1 = HEAP32[$5_1 + 12 >> 2]; $8_1 = $0_1 + 8 | 0; $11_1 = HEAP32[$8_1 + 4 >> 2]; $13_1 = $6_1 + 168 | 0; $7_1 = $13_1 + 8 | 0; HEAP32[$7_1 >> 2] = HEAP32[$8_1 >> 2]; HEAP32[$7_1 + 4 >> 2] = $11_1; $8_1 = $0_1 + 16 | 0; $11_1 = HEAP32[$8_1 + 4 >> 2]; $7_1 = $13_1 + 16 | 0; HEAP32[$7_1 >> 2] = HEAP32[$8_1 >> 2]; HEAP32[$7_1 + 4 >> 2] = $11_1; $7_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$6_1 + 168 >> 2] = HEAP32[$0_1 >> 2]; HEAP32[$6_1 + 172 >> 2] = $7_1; $24_1 = Math_imul($5_1, 48) + $10_1 | 0; HEAP32[$6_1 + 180 >> 2] = $6_1 + 56; $7_1 = 1; $8_1 = 0; while (1) { block6 : { block13 : { block11 : { if ($10_1 >>> 0 < $24_1 >>> 0) { if (HEAPU8[$10_1 + 13 | 0] & 4) { $5_1 = HEAP32[$10_1 + 24 >> 2] } else { if (HEAP32[$10_1 + 20 >> 2] != ($23_1 | 0)) { break block6 } $5_1 = HEAP32[$14 >> 2]; HEAP32[$6_1 + 216 >> 2] = $10_1; HEAP32[$6_1 + 212 >> 2] = 1; HEAP32[$6_1 + 204 >> 2] = 1; HEAP8[$6_1 + 200 | 0] = 44; HEAP32[$6_1 + 196 >> 2] = $14; HEAP32[$6_1 + 192 >> 2] = $5_1; $5_1 = $6_1 + 192 | 0; } HEAP16[$6_1 + 56 >> 1] = 0; HEAP32[$6_1 + 172 >> 2] = $5_1; block8 : { if (HEAPU8[HEAP32[$22_1 + 8 >> 2] + 43 | 0] == 1) { $8_1 = $1278($6_1 + 168 | 0, $1_1, $2_1, $3, $4_1); break block8; } $8_1 = $1279($6_1 + 168 | 0, $1_1, $2_1); } if (!$8_1) { $8_1 = $1280($6_1 + 168 | 0, $1_1, $2_1, $3, $4_1) } $13_1 = HEAPU16[$6_1 + 56 >> 1]; if (!$13_1) { HEAP16[$6_1 + 112 >> 1] = 0; $10_1 = 0; break block11; } if ($7_1) { HEAP16[$6_1 + 112 >> 1] = $13_1; $5_1 = $13_1 << 4; if (!$5_1) { break block13 } wasm2js_memory_copy($17_1, $19_1, $5_1); break block13; } $20_1 = HEAPU16[$6_1 + 112 >> 1]; $5_1 = $20_1 << 4; if ($5_1) { wasm2js_memory_copy($18_1, $17_1, $5_1) } $11_1 = 0; HEAP16[$6_1 + 112 >> 1] = 0; while (1) { if (($11_1 | 0) == ($20_1 | 0)) { break block13 } $7_1 = ($11_1 << 4) + $18_1 | 0; $25 = HEAP16[$7_1 + 10 >> 1]; $26_1 = HEAP16[$7_1 + 8 >> 1]; $5_1 = HEAP32[$7_1 >> 2]; $27 = HEAP32[$7_1 + 4 >> 2]; $7_1 = 0; while (1) { if (!(($7_1 | 0) == ($13_1 | 0))) { $15_1 = ($7_1 << 4) + $19_1 | 0; $1354($6_1 + 112 | 0, HEAP32[$15_1 >> 2] | $5_1, $27 | HEAP32[$15_1 + 4 >> 2], $1073($26_1, HEAP16[$15_1 + 8 >> 1]), $1073($25, HEAP16[$15_1 + 10 >> 1])); $7_1 = $7_1 + 1 | 0; continue; } break; }; $11_1 = $11_1 + 1 | 0; continue; }; } $10_1 = HEAPU16[$6_1 + 112 >> 1]; } HEAP16[$9_1 + 44 >> 1] = 1; HEAP32[HEAP32[$9_1 + 52 >> 2] >> 2] = $12_1; $7_1 = 0; HEAP16[$9_1 + 18 >> 1] = 0; HEAP32[$9_1 + 40 >> 2] = 8192; HEAP8[$9_1 + 17 | 0] = 0; $5_1 = $16_1 + 8 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$16_1 >> 2] = 0; HEAP32[$16_1 + 4 >> 2] = 0; while (1) { if ($7_1 >>> 0 >= $10_1 >>> 0 | $8_1) { break block2 } $5_1 = ($7_1 << 4) + $17_1 | 0; HEAP16[$9_1 + 20 >> 1] = HEAPU16[$5_1 + 8 >> 1] + 1; HEAP16[$9_1 + 22 >> 1] = HEAPU16[$5_1 + 10 >> 1]; $8_1 = HEAP32[$5_1 + 4 >> 2]; HEAP32[$9_1 >> 2] = HEAP32[$5_1 >> 2]; HEAP32[$9_1 + 4 >> 2] = $8_1; $7_1 = $7_1 + 1 | 0; $8_1 = $1349($0_1, $9_1); continue; }; } $7_1 = 0; } $10_1 = $10_1 + 48 | 0; continue; }; } $12_1 = $12_1 + 48 | 0; continue; }; } $0_1 = $6_1 + 608 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $1281($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$1_1 + 52 >> 2]; $3 = $1_1 + 60 | 0; if (($2_1 | 0) != ($3 | 0)) { $13($0_1, $2_1); HEAP16[$1_1 + 48 >> 1] = 3; HEAP32[$1_1 + 52 >> 2] = $3; } $1355($0_1, $1_1); HEAP32[$1_1 + 40 >> 2] = 0; HEAP16[$1_1 + 44 >> 1] = 0; } function $1282($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0; $8_1 = global$0 - 16 | 0; $2_1 = $8_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $21_1 = HEAP32[$0_1 >> 2]; $12_1 = HEAPU8[$0_1 + 44 | 0]; $13_1 = 1; block : { if ($12_1 >>> 0 < 2) { break block } $13_1 = 5; if (($12_1 | 0) == 2) { break block } $13_1 = 1; if (HEAP32[$21_1 + 40 >> 2]) { break block } block1 : { if ($12_1 >>> 0 < 5) { break block1 } $2_1 = HEAPU8[$0_1 + 48 | 0]; if ($2_1 & 16 | HEAPU8[HEAP32[$21_1 >> 2] + 83 | 0] & 32) { break block1 } HEAP8[$0_1 + 48 | 0] = $2_1 | 16; $17_1 = HEAP32[$0_1 + 4 >> 2] + 8 | 0; $3 = HEAP32[$0_1 + 60 >> 2]; $9_1 = 1; while (1) { if (($4_1 | 0) == ($12_1 | 0)) { break block1 } block2 : { $16_1 = $17_1 + Math_imul($4_1, 48) | 0; if (!(HEAPU8[$16_1 + 12 | 0] & 34)) { break block2 } if ($4_1 + 4 >>> 0 > $12_1 >>> 0) { break block1 } $2_1 = $4_1 & 255; while (1) { if (!$3) { $3 = 0; break block2; } if ($2_1 >>> 0 < HEAPU8[$3 + 16 | 0]) { break block2 } $3 = HEAP32[$3 + 56 >> 2]; continue; }; } $15_1 = 0; $18_1 = 0; $7_1 = 0; $2_1 = $3; while (1) { block4 : { if (!$2_1) { break block4 } $10_1 = $17_1 + Math_imul(HEAPU8[$2_1 + 16 | 0], 48) | 0; if (HEAPU8[$10_1 + 12 | 0] & 34) { break block4 } block5 : { if (!($9_1 & HEAP32[$2_1 >> 2] | $6_1 & HEAP32[$2_1 + 4 >> 2])) { break block5 } $14 = HEAP32[$2_1 + 8 >> 2]; $13_1 = HEAP32[$2_1 + 12 >> 2]; if ($14 & ($5_1 | $15_1) | $13_1 & ($11_1 | $18_1)) { break block5 } if (HEAP32[$10_1 + 8 >> 2] == HEAP32[$16_1 + 8 >> 2]) { $5_1 = $5_1 | $9_1; $11_1 = $6_1 | $11_1; break block5; } $15_1 = $15_1 | $14; $18_1 = $18_1 | $13_1; $7_1 = $7_1 + 1 | 0; } $2_1 = HEAP32[$2_1 + 56 >> 2]; continue; } break; }; block7 : { if (($7_1 | 0) < 4) { break block7 } HEAP8[$0_1 + 48 | 0] = HEAPU8[$0_1 + 48 | 0] | 32; $7_1 = 32768; $2_1 = $3; while (1) { block8 : { if (!$2_1) { break block8 } $16_1 = HEAPU8[$2_1 + 16 | 0]; if ($4_1 >>> 0 <= $16_1 >>> 0) { if ($4_1 >>> 0 < $16_1 >>> 0) { break block8 } $16_1 = HEAP16[$2_1 + 20 >> 1]; $7_1 = $7_1 << 16 >> 16; $7_1 = ($7_1 | 0) < ($16_1 | 0) ? $16_1 : $7_1; } $2_1 = HEAP32[$2_1 + 56 >> 2]; continue; } break; }; $7_1 = (($7_1 & 65535) == 32767 ? 32767 : $7_1 + 1 | 0) << 16 >> 16; $2_1 = $3; while (1) { if (!$2_1) { break block7 } if (!(HEAPU16[$2_1 + 44 >> 1] | !($15_1 & HEAP32[$2_1 + 8 >> 2] | $18_1 & HEAP32[$2_1 + 12 >> 2]) | ($7_1 | 0) <= HEAP16[$2_1 + 20 >> 1])) { HEAP16[$2_1 + 20 >> 1] = $7_1 } $2_1 = HEAP32[$2_1 + 56 >> 2]; continue; }; } $6_1 = $6_1 << 1 | $9_1 >>> 31; $9_1 = $9_1 << 1; $4_1 = $4_1 + 1 | 0; continue; }; } $13_1 = HEAPU8[$0_1 + 48 | 0] & 32 ? 18 : 12; } block11 : { if (!$1_1) { break block11 } $2_1 = HEAP32[$0_1 + 8 >> 2]; if (!$2_1) { break block11 } $19_1 = HEAP32[$2_1 >> 2]; } $9_1 = $12_1 << 2; $2_1 = Math_imul($9_1 + 32 | 0, $13_1) + $19_1 << 1; $17_1 = $325(HEAP32[$21_1 >> 2], $2_1, $2_1 >> 31); if ($17_1) { $6_1 = $19_1 << 1; $3 = $13_1 << 5; $4_1 = $3 + $17_1 | 0; $2_1 = $4_1; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $2_1 = $2_1 + 24 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $2_1 = $4_1 + 16 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $2_1 = $4_1 + 8 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $22_1 = $3 + $4_1 | 0; $2_1 = $13_1 << 1; $3 = $17_1; while (1) { if (($2_1 | 0) > 0) { HEAP32[$3 + 24 >> 2] = $22_1; $3 = $3 + 32 | 0; $2_1 = $2_1 - 1 | 0; $22_1 = $9_1 + $22_1 | 0; continue; } break; }; block15 : { if (!$19_1) { $22_1 = 0; break block15; } if (!$6_1) { break block15 } wasm2js_memory_fill($22_1, 0, $6_1); } $2_1 = HEAP16[$21_1 + 160 >> 1]; HEAP16[$4_1 + 16 >> 1] = ($2_1 | 0) >= 48 ? 48 : $2_1; if ($19_1) { HEAP8[$4_1 + 22 | 0] = $12_1 ? -1 : $19_1 } $31_1 = $1_1 - 10 | 0; $32_1 = $1_1 - 66 | 0; $16_1 = $0_1 + 60 | 0; $33_1 = ($1_1 | 0) > 10; $2_1 = 1; $6_1 = $17_1; $7_1 = 0; $18_1 = 0; while (1) { $9_1 = $4_1; if (($12_1 | 0) != ($25 | 0)) { $15_1 = 0; $34_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $26_1 = $25 << 2; $35_1 = $25 & 65535; $29_1 = 0; while (1) { if (($29_1 | 0) != ($34_1 | 0)) { $2_1 = $16_1; while (1) { $10_1 = HEAP32[$2_1 >> 2]; if ($10_1) { block20 : { $20_1 = HEAP32[$4_1 >> 2]; $2_1 = HEAP32[$4_1 + 4 >> 2]; if (HEAP32[$10_1 >> 2] & ($20_1 ^ -1) | HEAP32[$10_1 + 4 >> 2] & ($2_1 ^ -1)) { break block20 } $23_1 = HEAP32[$10_1 + 8 >> 2]; $27 = HEAP32[$10_1 + 12 >> 2]; if ($20_1 & $23_1 | $2_1 & $27) { break block20 } $3 = HEAP16[$4_1 + 16 >> 1]; if (!!(HEAPU8[$10_1 + 41 | 0] & 64) & ($3 | 0) < 3) { break block20 } $11_1 = $3 + HEAPU16[$10_1 + 20 >> 1] << 16 >> 16; $5_1 = HEAP16[$10_1 + 18 >> 1]; if ($5_1) { $11_1 = $1073($5_1, $11_1) } $11_1 = $1073($11_1, HEAP16[$4_1 + 20 >> 1]); $5_1 = HEAPU16[$10_1 + 22 >> 1]; $14 = HEAP8[$4_1 + 22 | 0]; block24 : { if (($14 | 0) < 0) { HEAP32[$8_1 + 8 >> 2] = 0; HEAP32[$8_1 + 12 >> 2] = 0; $14 = $1321($0_1, HEAP32[$0_1 + 8 >> 2], $4_1, HEAPU16[$0_1 + 40 >> 1], $35_1, $10_1, $8_1 + 8 | 0); break block24; } $24_1 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$8_1 + 8 >> 2] = HEAP32[$4_1 + 8 >> 2]; HEAP32[$8_1 + 12 >> 2] = $24_1; } $24_1 = $3 + $5_1 | 0; block31 : { if (!(($14 | 0) < 0 | ($14 | 0) >= ($19_1 | 0))) { $5_1 = ($14 << 1) + $22_1 | 0; $3 = HEAPU16[$5_1 >> 1]; if (!$3) { $3 = (HEAP32[HEAP32[HEAP32[$0_1 + 16 >> 2] + 28 >> 2] >> 2] + 59 | 0) / 30 | 0; $3 = $433($3, $3 >> 31); if ($14) { $28_1 = (Math_imul($19_1 - $14 | 0, 100) | 0) / ($19_1 | 0) | 0; $3 = $433($28_1, $28_1 >> 31) + ($3 + $32_1 | 0) | 0; } else { $3 = $1_1 + $3 | 0 } $28_1 = $5_1; $5_1 = HEAPU16[$0_1 + 40 >> 1]; block30 : { if ($5_1 & 16384) { $3 = ($14 ? 16 : 10) + $3 | 0; $5_1 = HEAP16[$0_1 + 42 >> 1]; $5_1 = ($1_1 | 0) > ($5_1 | 0) ? $5_1 : $1_1; break block30; } $5_1 = $33_1 ? (($5_1 & 256) >>> 8 | 0 ? $31_1 : $1_1) : $1_1; } $3 = $1322($5_1 << 16 >> 16) + $3 | 0; HEAP16[$28_1 >> 1] = $3; } $5_1 = $1073($11_1, $3 << 16 >> 16) + 3 | 0; break block31; } $5_1 = $11_1; $11_1 = $5_1 - 2 | 0; } $23_1 = $20_1 | $23_1; $27 = $2_1 | $27; $20_1 = $24_1 << 16 >> 16; $3 = 0; $24_1 = ($15_1 | 0) > 0 ? $15_1 : 0; $2_1 = $6_1; block36 : { block34 : { while (1) { if (($3 | 0) != ($24_1 | 0)) { if (!(($23_1 | 0) != HEAP32[$2_1 >> 2] | ($27 | 0) != HEAP32[$2_1 + 4 >> 2]) & (HEAPU8[$2_1 + 22 | 0] ^ $14) << 24 >> 24 >= 0) { break block34 } $2_1 = $2_1 + 32 | 0; $3 = $3 + 1 | 0; continue; } break; }; $2_1 = $15_1; $3 = ($2_1 | 0) < ($13_1 | 0); block35 : { if ($3) { break block35 } if ($5_1 << 16 >> 16 > $7_1 << 16 >> 16) { break block20 } $2_1 = $18_1; if (($5_1 & 65535) != ($7_1 & 65535)) { break block35 } if ($11_1 << 16 >> 16 >= $30_1 << 16 >> 16) { break block20 } } $2_1 = ($2_1 << 5) + $6_1 | 0; $15_1 = $3 + $15_1 | 0; break block36; } $3 = HEAP16[$2_1 + 18 >> 1]; if (($3 | 0) < $5_1 << 16 >> 16) { break block20 } if (($3 & 65535) != ($5_1 & 65535)) { break block36 } $3 = HEAP16[$2_1 + 16 >> 1]; if (($3 | 0) < ($20_1 | 0)) { break block20 } if (($3 | 0) != ($20_1 | 0)) { break block36 } if (HEAP16[$2_1 + 20 >> 1] < $11_1 << 16 >> 16) { break block20 } if (HEAPU16[$2_1 + 20 >> 1] != ($11_1 & 65535)) { break block36 } $3 = HEAP32[HEAP32[$2_1 + 24 >> 2] + $26_1 >> 2]; if (!(HEAPU8[$10_1 + 41 | 0] & 2) | !(HEAPU8[$3 + 41 | 0] & 2) | HEAP16[HEAP32[$10_1 + 32 >> 2] + 48 >> 1] >= HEAP16[HEAP32[$3 + 32 >> 2] + 48 >> 1]) { break block20 } } $3 = HEAP32[$10_1 + 12 >> 2] | HEAP32[$4_1 + 4 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$10_1 + 8 >> 2] | HEAP32[$4_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $3; $3 = HEAP32[$8_1 + 8 >> 2]; $23_1 = HEAP32[$8_1 + 12 >> 2]; HEAP8[$2_1 + 22 | 0] = $14; HEAP16[$2_1 + 20 >> 1] = $11_1; HEAP16[$2_1 + 18 >> 1] = $5_1; HEAP16[$2_1 + 16 >> 1] = $20_1; HEAP32[$2_1 + 8 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = $23_1; if ($26_1) { wasm2js_memory_copy(HEAP32[$2_1 + 24 >> 2], HEAP32[$4_1 + 24 >> 2], $26_1) } HEAP32[HEAP32[$2_1 + 24 >> 2] + $26_1 >> 2] = $10_1; if (($15_1 | 0) < ($13_1 | 0)) { break block20 } $30_1 = HEAP16[$6_1 + 16 >> 1]; $7_1 = HEAPU16[$6_1 + 18 >> 1]; $3 = 1; $18_1 = 0; $2_1 = $6_1; while (1) { if (($3 | 0) == ($13_1 | 0)) { break block20 } $11_1 = HEAP16[$2_1 + 50 >> 1]; block40 : { if (($11_1 | 0) > $7_1 << 16 >> 16) { $5_1 = HEAP16[$2_1 + 52 >> 1] } else { if (($11_1 & 65535) != ($7_1 & 65535)) { break block40 } $5_1 = HEAP16[$2_1 + 52 >> 1]; if (($5_1 | 0) <= $30_1 << 16 >> 16) { break block40 } } $30_1 = $5_1; $7_1 = $11_1; $18_1 = $3; } $2_1 = $2_1 + 32 | 0; $3 = $3 + 1 | 0; continue; }; } $2_1 = $10_1 + 56 | 0; continue; } break; }; $4_1 = $4_1 + 32 | 0; $29_1 = $29_1 + 1 | 0; continue; } break; }; $25 = $25 + 1 | 0; $2_1 = $15_1; $4_1 = $6_1; $6_1 = $9_1; continue; } break; }; block50 : { if ($2_1) { $6_1 = ($2_1 | 0) <= 1 ? 1 : $2_1; $3 = $9_1; $2_1 = 1; while (1) if (($2_1 | 0) == ($6_1 | 0)) { $9_1 = $0_1 + 760 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) != ($12_1 | 0)) { $6_1 = $9_1 + Math_imul($2_1, 96) | 0; $4_1 = HEAP32[HEAP32[$3 + 24 >> 2] + ($2_1 << 2) >> 2]; HEAP32[$6_1 + 80 >> 2] = $4_1; $4_1 = HEAPU8[$4_1 + 16 | 0]; HEAP8[$6_1 + 60 | 0] = $4_1; HEAP32[$6_1 + 4 >> 2] = HEAP32[(HEAP32[$0_1 + 4 >> 2] + Math_imul($4_1, 48) | 0) + 24 >> 2]; $2_1 = $2_1 + 1 | 0; continue; } break; }; block44 : { if (HEAPU8[$0_1 + 47 | 0] | (!$1_1 | (HEAPU16[$0_1 + 40 >> 1] & 384) != 256)) { break block44 } $1_1 = $12_1 - 1 | 0; if (($1321($0_1, HEAP32[$0_1 + 12 >> 2], $3, 128, $1_1 & 65535, HEAP32[HEAP32[$3 + 24 >> 2] + ($1_1 << 2) >> 2], $8_1 + 8 | 0) | 0) != HEAP32[HEAP32[$0_1 + 12 >> 2] >> 2]) { break block44 } HEAP8[$0_1 + 47 | 0] = 2; } $6_1 = HEAPU8[$0_1 + 48 | 0]; HEAP8[$0_1 + 48 | 0] = $6_1 & 251; $2_1 = HEAP32[$0_1 + 8 >> 2]; block45 : { if (!$2_1) { break block45 } $1_1 = HEAP8[$3 + 22 | 0]; HEAP8[$0_1 + 45 | 0] = $1_1; $4_1 = HEAPU16[$0_1 + 40 >> 1]; block47 : { if ($4_1 & 128) { if (($1_1 | 0) != HEAP32[$2_1 >> 2]) { break block47 } HEAP8[$0_1 + 47 | 0] = 2; break block47; } $9_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$0_1 + 72 >> 2] = HEAP32[$3 + 8 >> 2]; HEAP32[$0_1 + 76 >> 2] = $9_1; if (($1_1 | 0) <= 0) { HEAP8[$0_1 + 45 | 0] = 0; if (!$12_1) { break block47 } $1_1 = $12_1 - 1 | 0; $6_1 = HEAP32[HEAP32[$3 + 24 >> 2] + ($1_1 << 2) >> 2]; $9_1 = HEAP32[$6_1 + 40 >> 2]; if ($9_1 & 4096 | ($9_1 & 260) == 260) { break block47 } HEAP32[$8_1 + 8 >> 2] = 0; HEAP32[$8_1 + 12 >> 2] = 0; $1_1 = $1321($0_1, $2_1, $3, 2048, $1_1, $6_1, $8_1 + 8 | 0); $2_1 = HEAP32[$0_1 + 8 >> 2]; if (($1_1 | 0) == HEAP32[$2_1 >> 2]) { HEAP8[$0_1 + 48 | 0] = HEAPU8[$0_1 + 48 | 0] | 4; $1_1 = HEAP32[$8_1 + 12 >> 2]; HEAP32[$0_1 + 72 >> 2] = HEAP32[$8_1 + 8 >> 2]; HEAP32[$0_1 + 76 >> 2] = $1_1; } $4_1 = HEAPU16[$0_1 + 40 >> 1]; break block47; } if (!($4_1 & 3) | (!$12_1 | ($1_1 | 0) != 1)) { break block47 } HEAP8[$0_1 + 48 | 0] = $6_1 | 4; } if (!($4_1 & 512) | !$12_1 | HEAP32[$2_1 >> 2] != HEAP8[$0_1 + 45 | 0]) { break block45 } HEAP32[$8_1 + 8 >> 2] = 0; HEAP32[$8_1 + 12 >> 2] = 0; $1_1 = $12_1 - 1 | 0; if (($1321($0_1, $2_1, $3, 0, $1_1, HEAP32[HEAP32[$3 + 24 >> 2] + ($1_1 << 2) >> 2], $8_1 + 8 | 0) | 0) != HEAP32[HEAP32[$0_1 + 8 >> 2] >> 2]) { break block45 } HEAP8[$0_1 + 48 | 0] = HEAPU8[$0_1 + 48 | 0] | 8; $1_1 = HEAP32[$8_1 + 12 >> 2]; HEAP32[$0_1 + 72 >> 2] = HEAP32[$8_1 + 8 >> 2]; HEAP32[$0_1 + 76 >> 2] = $1_1; } HEAP16[$0_1 + 50 >> 1] = HEAPU16[$3 + 16 >> 1]; break block50; } else { $4_1 = ($2_1 << 5) + $9_1 | 0; $3 = HEAP16[$3 + 18 >> 1] > HEAP16[$4_1 + 18 >> 1] ? $4_1 : $3; $2_1 = $2_1 + 1 | 0; continue; }; } $257($21_1, 10296, 0); } $13(HEAP32[$21_1 >> 2], $17_1); } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1288($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0; block2 : { $6_1 = HEAPU8[$2_1 | 0]; if (($6_1 | 0) == 44) { $1288($0_1, $1_1, HEAP32[$2_1 + 16 >> 2], $3, $4_1, $5_1); $2_1 = HEAP32[$2_1 + 12 >> 2]; $6_1 = HEAPU8[$2_1 | 0]; } if (($6_1 | 0) != 54 & ($6_1 | 0) != 45) { break block2 } $6_1 = HEAP32[$2_1 + 12 >> 2]; if (HEAPU8[$6_1 | 0] != 168) { break block2 } $7_1 = HEAP32[$2_1 + 16 >> 2]; if (!$944(0, $7_1)) { break block2 } $2_1 = $369($0_1, $2_1); if (!!$2_1 & HEAP32[$2_1 + 12 >> 2] != 15) { break block2 } $2_1 = HEAP16[$6_1 + 32 >> 1]; if (($2_1 | 0) < 0) { break block2 } $8_1 = HEAPU8[(HEAP32[HEAP32[$1_1 + 12 >> 2] + 4 >> 2] + Math_imul($2_1, 12) | 0) + 5 | 0]; if ($8_1 >>> 0 < 66) { break block2 } if ($5_1) { $2_1 = HEAP32[$0_1 >> 2]; $1_1 = $51($2_1, 24, 0); if (!$1_1) { break block2 } $3 = HEAPU8[$5_1 + 12 | 0]; HEAP32[$1_1 >> 2] = $906($2_1, $7_1, 0); $2_1 = HEAP32[$5_1 + 16 >> 2]; HEAP32[$1_1 + 8 >> 2] = $4_1; HEAP32[$1_1 + 4 >> 2] = $2_1; $2_1 = HEAP16[$6_1 + 32 >> 1]; HEAP8[$1_1 + 16 | 0] = ($3 & 72) != 0; HEAP32[$1_1 + 12 >> 2] = $2_1; $2_1 = HEAP32[$0_1 + 80 >> 2]; HEAP8[$1_1 + 17 | 0] = $8_1; HEAP32[$1_1 + 20 >> 2] = $2_1; HEAP32[$0_1 + 80 >> 2] = $1_1; if ($2_1) { break block2 } $1016($0_1, 91, $0_1 + 80 | 0); return; } if ($2_1 >>> 0 > 62) { break block2 } $0_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$3 >> 2] = HEAP32[$3 >> 2] & __wasm_rotl_i64(-2, -1, $2_1); HEAP32[$3 + 4 >> 2] = i64toi32_i32$HIGH_BITS & $0_1; } } function $1289($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = $1_1 + 16 | 0; $3 = $2_1 >>> 0 < 16; $2_1 = $325(HEAP32[HEAP32[$0_1 >> 2] >> 2], $2_1, $3); if (!$2_1) { return 0 } $3 = HEAP32[$0_1 + 64 >> 2]; HEAP32[$2_1 + 8 >> 2] = $1_1; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 >> 2] = $3; HEAP32[$0_1 + 64 >> 2] = $2_1; return $2_1 + 16 | 0; } function $1292($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { $4_1 = HEAP32[$0_1 + 132 >> 2]; if ($3 & 32 | HEAPU8[($4_1 ? $4_1 : $0_1) + 223 | 0] != 2) { break block } $5_1 = HEAP32[$2_1 + 80 >> 2]; if (HEAP32[$5_1 + 40 >> 2] & 8192) { break block } $6_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = HEAP32[$6_1 + 108 >> 2]; $835($6_1, 188, $4_1, HEAP32[$0_1 + 236 >> 2], HEAP16[$5_1 + 20 >> 1]); $1309($0_1, $4_1, $1_1, $2_1, $3); } } function $1293($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0; block4 : { block1 : { block : { block2 : { block3 : { $9_1 = HEAP32[$1_1 >> 2]; $6_1 = HEAPU8[$9_1 | 0]; switch ($6_1 - 51 | 0) { case 0: break block; case 1: case 2: break block1; case 3: break block2; default: break block3; }; } if (($6_1 | 0) != 45) { break block1 } } $5_1 = $1129($0_1, HEAP32[$9_1 + 16 >> 2], $5_1); break block4; } $326(HEAP32[$0_1 + 8 >> 2], 75, 0, $5_1); break block4; } $9_1 = $0_1; $15_1 = global$0 - 16 | 0; $0_1 = $15_1; if (global$4 >>> 0 < $0_1 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $12_1 = HEAP32[$2_1 + 80 >> 2]; block0 : { if (HEAPU8[$12_1 + 41 | 0] & 4) { break block0 } $0_1 = HEAP32[$12_1 + 32 >> 2]; if (!$0_1) { break block0 } $4_1 = HEAPU8[HEAP32[$0_1 + 28 >> 2] + $3 | 0] != 0 ^ $4_1; } $13_1 = HEAP32[$1_1 >> 2]; $20_1 = HEAP32[$9_1 + 8 >> 2]; $0_1 = 0; $6_1 = ($3 | 0) > 0 ? $3 : 0; block41 : { while (1) { block22 : { if (($0_1 | 0) == ($6_1 | 0)) { $0_1 = HEAPU16[$12_1 + 44 >> 1]; $7_1 = ($0_1 | 0) < ($3 | 0) ? $3 : $0_1; $6_1 = 0; $0_1 = $3; while (1) { if (($0_1 | 0) == ($7_1 | 0)) { break block22 } $6_1 = (HEAP32[HEAP32[HEAP32[$12_1 + 52 >> 2] + ($0_1 << 2) >> 2] >> 2] == ($13_1 | 0)) + $6_1 | 0; $0_1 = $0_1 + 1 | 0; continue; }; } $7_1 = HEAP32[HEAP32[$12_1 + 52 >> 2] + ($0_1 << 2) >> 2]; if (!$7_1 | HEAP32[$7_1 >> 2] != ($13_1 | 0)) { $0_1 = $0_1 + 1 | 0; continue; } else { $1295($2_1, $1_1); break block41; } } break; }; HEAP32[$15_1 + 12 >> 2] = 0; $0_1 = HEAP32[$13_1 + 4 >> 2]; block7 : { if (!(!!($0_1 & 4096) & HEAP32[HEAP32[HEAP32[$13_1 + 20 >> 2] + 28 >> 2] >> 2] != 1)) { $17_1 = $1193($9_1, $13_1, 4, 0, 0, $15_1 + 12 | 0); break block7; } if (!(HEAP32[$13_1 + 28 >> 2] ? $0_1 & 33554432 : 0)) { $14 = HEAP32[$9_1 >> 2]; $10_1 = $906($14, $13_1, 0); $17_1 = 5; block10 : { if (HEAPU8[$14 + 87 | 0]) { break block10 } $18_1 = $10_1 + 20 | 0; $0_1 = $18_1; while (1) { $11_1 = HEAP32[$0_1 >> 2]; if ($11_1) { $7_1 = 0; $19_1 = ($11_1 | 0) == HEAP32[$18_1 >> 2] ? HEAP32[HEAP32[$10_1 + 12 >> 2] + 20 >> 2] : 0; $25 = $19_1 + 8 | 0; $21_1 = HEAP32[$11_1 + 28 >> 2]; $26_1 = $21_1 + 8 | 0; $8_1 = 0; $0_1 = $3; while (1) { if (($0_1 | 0) < HEAPU16[$12_1 + 44 >> 1]) { $16_1 = HEAP32[HEAP32[$12_1 + 52 >> 2] + ($0_1 << 2) >> 2]; block14 : { if (HEAP32[$16_1 >> 2] != ($13_1 | 0)) { break block14 } $16_1 = HEAP32[$16_1 + 28 >> 2]; $22_1 = $16_1 - 1 << 4; $23_1 = $22_1 + $26_1 | 0; $24_1 = HEAP32[$23_1 >> 2]; if (!$24_1) { break block14 } $7_1 = $936($9_1, $7_1, $24_1); HEAP32[$23_1 >> 2] = 0; if ($7_1) { HEAP16[((HEAP32[$7_1 >> 2] << 4) + $7_1 | 0) + 4 >> 1] = $16_1 } if (!$19_1) { break block14 } $16_1 = $25 + $22_1 | 0; $8_1 = $936($9_1, $8_1, HEAP32[$16_1 >> 2]); HEAP32[$16_1 >> 2] = 0; } $0_1 = $0_1 + 1 | 0; continue; } break; }; $358($14, $21_1); if ($19_1) { $333($14, $19_1); HEAP32[HEAP32[$10_1 + 12 >> 2] + 20 >> 2] = $8_1; } HEAP32[$11_1 + 28 >> 2] = $7_1; $0_1 = HEAP32[$9_1 + 112 >> 2] + 1 | 0; HEAP32[$9_1 + 112 >> 2] = $0_1; HEAP32[$11_1 + 16 >> 2] = $0_1; if (!(!$8_1 | HEAP32[$8_1 >> 2] != 1)) { $0_1 = HEAP32[$8_1 + 8 >> 2]; HEAP32[$8_1 + 8 >> 2] = 0; $11($14, HEAP32[$10_1 + 12 >> 2]); HEAP32[$10_1 + 12 >> 2] = $0_1; } block18 : { if (!$7_1) { break block18 } $1369(HEAP32[$11_1 + 48 >> 2], $7_1); $1369(HEAP32[$11_1 + 40 >> 2], $7_1); $0_1 = 0; $8_1 = HEAP32[$7_1 >> 2]; $8_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $7_1 = $7_1 + 20 | 0; while (1) { if (($0_1 | 0) == ($8_1 | 0)) { break block18 } HEAP16[$7_1 + ($0_1 << 4) >> 1] = 0; $0_1 = $0_1 + 1 | 0; continue; }; } $0_1 = $11_1 + 52 | 0; continue; } break; }; $8_1 = 0; if (HEAPU8[$14 + 87 | 0]) { break block10 } $8_1 = $270(HEAP32[$9_1 >> 2], $6_1 << 2, 0); $17_1 = $1193($9_1, $10_1, 4, 0, $8_1, $15_1 + 12 | 0); HEAP32[$13_1 + 28 >> 2] = HEAP32[$15_1 + 12 >> 2]; } $11($14, $10_1); break block7; } $18_1 = HEAP32[$9_1 >> 2]; $0_1 = $1119(HEAP32[$13_1 + 12 >> 2]); $8_1 = $270($18_1, (($0_1 | 0) < ($6_1 | 0) ? $6_1 : $0_1) << 2, 0); $17_1 = $1193($9_1, $13_1, 4, 0, $8_1, $15_1 + 12 | 0); } $7_1 = (($17_1 | 0) == 4 | 0) == ($4_1 | 0); $4_1 = HEAP32[$15_1 + 12 >> 2]; $326($20_1, $7_1 ? 36 : 32, $4_1, 0); $0_1 = HEAP32[$12_1 + 40 >> 2]; HEAP32[$12_1 + 40 >> 2] = $0_1 | 2048; if (!HEAP32[$2_1 + 72 >> 2]) { $10_1 = HEAP32[$9_1 + 60 >> 2] - 1 | 0; HEAP32[$9_1 + 60 >> 2] = $10_1; HEAP32[$2_1 + 16 >> 2] = $10_1; } if (!($0_1 & 1048576 | ($3 | 0) <= 0)) { HEAP32[$12_1 + 40 >> 2] = $0_1 | 264192 } $10_1 = HEAP32[$2_1 + 72 >> 2]; $0_1 = $6_1 + $10_1 | 0; HEAP32[$2_1 + 72 >> 2] = $0_1; block34 : { block24 : { $6_1 = HEAP32[$2_1 + 76 >> 2]; $0_1 = $1289(HEAP32[HEAP32[$1_1 + 4 >> 2] >> 2], Math_imul($0_1, 20)); block23 : { if (!(!$6_1 | !$0_1)) { $11_1 = HEAP32[$6_1 - 8 >> 2]; if ($11_1) { wasm2js_memory_copy($0_1, $6_1, $11_1) } HEAP32[$2_1 + 76 >> 2] = $0_1; break block23; } HEAP32[$2_1 + 76 >> 2] = $0_1; if (!$0_1) { break block24 } } $19_1 = $7_1 ? 39 : 38; $14 = $5_1 - $3 | 0; $6_1 = $0_1 + Math_imul($10_1, 20) | 0; $17_1 = ($17_1 | 0) != 1; $0_1 = $3; $10_1 = 0; while (1) { if (($0_1 | 0) < HEAPU16[$12_1 + 44 >> 1]) { if (($13_1 | 0) == HEAP32[HEAP32[HEAP32[$12_1 + 52 >> 2] + ($0_1 << 2) >> 2] >> 2]) { $11_1 = $0_1 + $14 | 0; block28 : { if (!$17_1) { $18_1 = $326($20_1, 135, $4_1, $11_1); break block28; } block30 : { if (!$8_1) { $7_1 = 0; break block30; } $7_1 = HEAP32[($10_1 << 2) + $8_1 >> 2]; $10_1 = $10_1 + 1 | 0; } $18_1 = $835($20_1, 94, $4_1, $7_1, $11_1); } HEAP32[$6_1 + 4 >> 2] = $18_1; $858($20_1, 51, $11_1); block33 : { if (($0_1 | 0) == ($3 | 0)) { HEAP8[$6_1 + 16 | 0] = $19_1; HEAP32[$6_1 >> 2] = $4_1; if (($3 | 0) > 0) { HEAP32[$6_1 + 12 >> 2] = $3; HEAP32[$6_1 + 8 >> 2] = $14; break block33; } HEAP32[$6_1 + 12 >> 2] = 0; break block33; } HEAP8[$6_1 + 16 | 0] = 187; } $6_1 = $6_1 + 20 | 0; } $0_1 = $0_1 + 1 | 0; continue; } break; }; if ((HEAPU8[$12_1 + 41 | 0] | HEAPU8[$12_1 + 42 | 0] << 8) & 4100 | ($3 | 0) <= 0) { break block34 } $835($20_1, 125, HEAP32[$2_1 + 8 >> 2], 0, $3); break block34; } HEAP32[$2_1 + 72 >> 2] = 0; } $10(HEAP32[$9_1 >> 2], $8_1); } $0_1 = $15_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } if (!(HEAPU8[$1_1 + 13 | 0] & 8 ? HEAPU8[HEAP32[$2_1 + 80 >> 2] + 42 | 0] & 32 : 0)) { $1295($2_1, $1_1) } return $5_1; } function $1294($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block2 : { block : { if (!$1_1) { break block } if (!$1182($1_1)) { break block } if (HEAPU8[$1_1 + 5 | 0] & 16) { $835(HEAP32[$0_1 + 8 >> 2], 80, $1172($0_1, $1_1), $2_1, $3 - 1 | 0); return; } $4_1 = HEAP32[$1_1 + 20 >> 2] + 8 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($3 | 0)) { break block2 } $862($0_1, HEAP32[($1_1 << 4) + $4_1 >> 2], $1_1 + $2_1 | 0); $1_1 = $1_1 + 1 | 0; continue; }; } $862($0_1, $1_1, $2_1); } } function $1295($0_1, $1_1) { var $2_1 = 0, $3 = 0; while (1) { block : { $2_1 = HEAPU16[$1_1 + 10 >> 1]; if (!(!HEAP32[$0_1 >> 2] | HEAP8[HEAP32[$1_1 >> 2] + 4 | 0] & 1) | $2_1 & 4) { break block } if (HEAP32[$1_1 + 40 >> 2] & HEAP32[$0_1 + 88 >> 2] | HEAP32[$1_1 + 44 >> 2] & HEAP32[$0_1 + 92 >> 2]) { break block } HEAP16[$1_1 + 10 >> 1] = $2_1 | ($3 ? ($2_1 & 1024 ? 512 : 4) : 4); $2_1 = HEAP32[$1_1 + 16 >> 2]; if (($2_1 | 0) < 0) { break block } $1_1 = HEAP32[HEAP32[$1_1 + 4 >> 2] + 24 >> 2] + Math_imul($2_1, 48) | 0; $2_1 = HEAPU8[$1_1 + 14 | 0] - 1 | 0; HEAP8[$1_1 + 14 | 0] = $2_1; $3 = $3 + 1 | 0; if (!($2_1 & 255)) { continue } } break; }; } function $1296($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $8_1 = global$0 - 16 | 0; $6_1 = $8_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $11_1 = $1_1 + 760 | 0; while (1) { $2_1 = $2_1 + 1 | 0; if (($2_1 | 0) < HEAPU8[$1_1 + 44 | 0]) { $6_1 = Math_imul($2_1, 96) + $11_1 | 0; if (!HEAP32[$6_1 + 52 >> 2]) { continue } $7_1 = HEAP32[$6_1 + 80 >> 2]; if (HEAPU16[$7_1 + 46 >> 1] | (HEAP32[$7_1 >> 2] & $4_1 | $5_1 & HEAP32[$7_1 + 4 >> 2])) { continue } HEAP32[$6_1 + 12 >> 2] = $3; block2 : { if (HEAP8[$7_1 + 41 | 0] & 1) { $7_1 = $1293($0_1, HEAP32[HEAP32[$7_1 + 52 >> 2] >> 2], $6_1, 0, 0, $893($0_1)); $326(HEAP32[$0_1 + 8 >> 2], 13, $7_1, $3); $312(HEAP32[$0_1 + 8 >> 2], 64, HEAP32[$6_1 + 52 >> 2], $3, $7_1, 1); break block2; } $7_1 = HEAPU16[$7_1 + 24 >> 1]; $9_1 = $1297($0_1, $6_1, 0, 0, $8_1 + 12 | 0); $10_1 = HEAP32[$8_1 + 12 >> 2]; $1300($0_1, $9_1, $7_1, $10_1); $10(HEAP32[$0_1 >> 2], $10_1); $312(HEAP32[$0_1 + 8 >> 2], 64, HEAP32[$6_1 + 52 >> 2], $3, $9_1, $7_1); } HEAP32[$6_1 + 12 >> 2] = 0; HEAP32[$6_1 + 52 >> 2] = 0; continue; } break; }; $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1297($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $12_1 = HEAP32[$1_1 + 80 >> 2]; $5_1 = HEAPU16[$12_1 + 46 >> 1]; $11_1 = HEAP32[$12_1 + 32 >> 2]; $7_1 = HEAPU16[$12_1 + 24 >> 1]; $13_1 = $7_1 + $3 | 0; $10_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $13_1 + $10_1; $9_1 = $10_1 + 1 | 0; $8_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$0_1 >> 2]; $11_1 = $116($3, $1098($3, $11_1)); block1 : { if (!$5_1) { $5_1 = 0; break block1; } $6_1 = HEAP32[$1_1 + 8 >> 2]; $3 = 0; $835($8_1, 75, 0, $9_1, $5_1 + $10_1 | 0); $858($8_1, $2_1 ? 32 : 36, $6_1); $14 = $857($8_1, 9); HEAP32[$1_1 + 20 >> 2] = $312($8_1, $2_1 ? 21 : 24, $6_1, 0, $9_1, $5_1); $10_1 = 82740; HEAP32[(HEAPU8[HEAP32[$8_1 >> 2] + 87 | 0] ? $10_1 : HEAP32[$8_1 + 104 >> 2] + Math_imul($14, 20) | 0) + 8 >> 2] = HEAP32[$8_1 + 108 >> 2]; while (1) { if (($3 | 0) == ($5_1 | 0)) { break block1 } $835($8_1, 94, $6_1, $3, $3 + $9_1 | 0); $3 = $3 + 1 | 0; continue; }; } $10_1 = $5_1 >>> 0 > $7_1 >>> 0 ? $5_1 : $7_1; while (1) { if (!(($5_1 | 0) == ($10_1 | 0))) { $6_1 = HEAP32[HEAP32[$12_1 + 52 >> 2] + ($5_1 << 2) >> 2]; $7_1 = $5_1 + $9_1 | 0; $3 = $1293($0_1, $6_1, $1_1, $5_1, $2_1, $7_1); block4 : { if (($3 | 0) == ($7_1 | 0)) { break block4 } if (($13_1 | 0) == 1) { $894($0_1, $9_1); $9_1 = $3; break block4; } $326($8_1, 80, $3, $7_1); } $3 = HEAPU16[$6_1 + 12 >> 1]; block7 : { if ($3 & 1) { if (!(HEAPU8[HEAP32[$6_1 >> 2] + 5 | 0] & 16) | !$11_1) { break block7 } HEAP8[$5_1 + $11_1 | 0] = 65; break block7; } if ($3 & 256) { break block7 } $3 = HEAP32[HEAP32[$6_1 >> 2] + 16 >> 2]; block8 : { if (HEAPU8[$6_1 + 11 | 0] & 8) { break block8 } if (!$1051($3)) { break block8 } $326($8_1, 51, $5_1 + $9_1 | 0, HEAP32[$1_1 + 12 >> 2]); } if (HEAP32[$0_1 + 40 >> 2]) { break block7 } $6_1 = $5_1 + $11_1 | 0; block10 : { if (($1190($3, HEAP8[$6_1 | 0]) | 0) != 65) { $7_1 = HEAP8[$6_1 | 0]; break block10; } HEAP8[$6_1 | 0] = 65; $7_1 = 65; } if (!$1368($3, $7_1 << 24 >> 24)) { break block7 } HEAP8[$6_1 | 0] = 65; } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP32[$4_1 >> 2] = $11_1; return $9_1; } function $1298($0_1, $1_1, $2_1) { if (HEAP8[$2_1 + 11 | 0] & 1) { $2_1 = 82740; if (!HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { $2_1 = (HEAP32[$0_1 + 104 >> 2] + Math_imul(HEAP32[$0_1 + 108 >> 2], 20) | 0) - 20 | 0 } $0_1 = HEAP32[$1_1 + 44 >> 2]; HEAP16[$2_1 + 2 >> 1] = $0_1 & 1; HEAP32[$2_1 + 12 >> 2] = $0_1 >>> 1; } } function $1299($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { if (!(($1_1 | 0) == ($3 | 0))) { $5_1 = $1194($0_1, $3); $4_1 = $2_1 + $3 | 0; block2 : { if (($1190($5_1, HEAP8[$4_1 | 0]) | 0) != 65) { if (!$1368($5_1, HEAP8[$4_1 | 0])) { break block2 } } HEAP8[$4_1 | 0] = 65; } $3 = $3 + 1 | 0; continue; } break; }; } function $1300($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; block : { if (!$3) { break block } $4_1 = HEAP32[$0_1 + 8 >> 2]; $0_1 = $2_1 >> 31 & $2_1; while (1) { block2 : { if (($2_1 | 0) > 0) { if (HEAP8[$3 | 0] <= 65) { break block2 } $0_1 = $2_1; } $5_1 = $3 - 1 | 0; $2_1 = $0_1; block4 : { while (1) { if (($2_1 | 0) >= 2) { if (HEAP8[$2_1 + $5_1 | 0] > 65) { break block4 } $2_1 = $2_1 - 1 | 0; continue; } break; }; $2_1 = 1; if (($0_1 | 0) <= 0) { break block } } $859($4_1, 96, $1_1, $2_1, 0, $3, $2_1); break block; } $3 = $3 + 1 | 0; $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; continue; }; } } function $1301($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; while (1) { if (!(HEAPU8[$0_1 | 0] != 44)) { $1301(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1); $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; $3 = HEAP32[$2_1 + 24 >> 2]; while (1) { if (!(HEAP32[$2_1 + 12 >> 2] <= ($4_1 | 0))) { block2 : { if (HEAPU8[$3 + 10 | 0] & 4) { break block2 } if ($1121(0, HEAP32[$3 >> 2], $0_1, $1_1)) { break block2 } HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] | 4; } $3 = $3 + 48 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; } function $1302($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $3 + 24 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $3 + 32 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 92; HEAP32[$3 + 12 >> 2] = $1_1; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 40 >> 2] = $3 + 8; $920($3 + 16 | 0, $0_1); $1_1 = HEAPU16[$3 + 36 >> 1]; $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return !$1_1; } function $1303($0_1, $1_1) { var $2_1 = 0, $3 = 0; $1329($1_1 + 80 | 0); while (1) { $2_1 = HEAP32[$1_1 + 60 >> 2]; if ($2_1) { HEAP32[$1_1 + 60 >> 2] = HEAP32[$2_1 + 56 >> 2]; $1330($0_1, $2_1); continue; } else { $3 = HEAP32[$1_1 + 64 >> 2]; while (1) { if ($3) { $2_1 = HEAP32[$3 >> 2]; $16($0_1, $3); HEAP32[$1_1 + 64 >> 2] = $2_1; $3 = $2_1; continue; } break; }; $16($0_1, $1_1); } break; }; } function $1304($0_1, $1_1, $2_1) { $976($0_1, HEAP32[$1_1 + 28 >> 2], HEAP32[$2_1 >> 2], 0, HEAPU8[$2_1 + 4 | 0]); } function $1305($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $6_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = HEAP32[$4_1 >> 2]; block : { switch ($1_1 - 1 | 0) { case 1: $2_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $2_1 + $7_1; $1_1 = 0; $9_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $8_1 = $7_1 - 1 | 0; $10_1 = $4_1 + 8 | 0; $2_1 = $2_1 + 1 | 0; $11_1 = $7_1 + HEAP32[$6_1 + 108 >> 2] | 0; while (1) { if (($1_1 | 0) != ($9_1 | 0)) { $4_1 = $1_1 + $2_1 | 0; $7_1 = $1_1 + $5_1 | 0; $12_1 = $851($0_1, HEAP32[($1_1 << 4) + $10_1 >> 2]); block5 : { if (($1_1 | 0) < ($8_1 | 0)) { $835($6_1, 53, $7_1, $11_1, $4_1); break block5; } $835($6_1, 54, $7_1, $3, $4_1); } $315($6_1, -1, $12_1, -2); $4_1 = HEAP32[$6_1 + 108 >> 2]; if (($4_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($4_1, 20) | 0) - 18 >> 1] = 128 } $1_1 = $1_1 + 1 | 0; continue; } break; }; $835($6_1, 80, $5_1, $2_1, $8_1); return $2_1; default: $1_1 = $893($0_1); $312($6_1, 29, $2_1, $3, $5_1, $7_1); $835($6_1, 97, $5_1, $7_1, $1_1); $312($6_1, 138, $2_1, $1_1, $5_1, $7_1); $3 = HEAP32[$6_1 + 108 >> 2]; if (($3 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($3, 20) | 0) - 18 >> 1] = 16 } $894($0_1, $1_1); $8_1 = $2_1; break; case 0: break block; }; } return $8_1; } function $1306($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $12_1 = HEAP32[$1_1 >> 2]; $15_1 = HEAP32[$12_1 >> 2]; $10_1 = HEAP8[$1_1 + 32 | 0] & 1; $9_1 = $15_1 + !$10_1 | 0; $13_1 = $9_1 + $5_1 | 0; $11_1 = HEAP32[$1_1 + 4 >> 2]; if ($6_1) { $8_1 = $3 - $6_1 | 0 } else { $7_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $7_1 + $13_1; $8_1 = $7_1 + 1 | 0; } $7_1 = HEAP32[$2_1 + 12 >> 2]; block3 : { if ($7_1) { $14 = $7_1 + 1 | 0; break block3; } $14 = HEAP32[$2_1 + 8 >> 2]; } $7_1 = HEAP32[$0_1 + 8 >> 2]; $16_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $16_1; HEAP32[$1_1 + 24 >> 2] = $16_1; $976($0_1, $12_1, $8_1, $4_1, $4_1 ? 5 : 1); if (!$10_1) { $326($7_1, 126, HEAP32[$1_1 + 8 >> 2], $8_1 + $15_1 | 0) } if (!($6_1 | ($5_1 | 0) <= 0)) { $1065($0_1, $3, $8_1 + $9_1 | 0, $5_1) } $6_1 = 0; $5_1 = 0; block10 : { if (($11_1 | 0) > 0) { $5_1 = $1373($0_1, $1_1, $2_1, $8_1, $13_1); $3 = HEAP32[$1_1 + 4 >> 2]; $4_1 = HEAP32[$0_1 + 48 >> 2]; HEAP32[$0_1 + 48 >> 2] = $3 + $4_1; $12_1 = $4_1 + 1 | 0; block8 : { if (!$10_1) { $10_1 = $858($7_1, 17, $8_1 + $15_1 | 0); break block8; } $10_1 = $858($7_1, 120, HEAP32[$1_1 + 8 >> 2]); } $835($7_1, 90, $12_1, $8_1, HEAP32[$1_1 + 4 >> 2]); $4_1 = 82740; $4_1 = HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$7_1 + 104 >> 2] + Math_imul(HEAP32[$1_1 + 20 >> 2], 20) | 0; if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { break block10 } HEAP32[$4_1 + 8 >> 2] = $13_1 - $3; $3 = HEAP32[$4_1 + 16 >> 2]; $9_1 = HEAPU16[$3 + 6 >> 1]; if ($9_1) { wasm2js_memory_fill(HEAP32[$3 + 16 >> 2], 0, $9_1) } $315($7_1, -1, $3, -8); HEAP32[$4_1 + 16 >> 2] = $1042($0_1, HEAP32[$1_1 >> 2], $11_1, HEAPU16[$3 + 8 >> 1] + (HEAPU16[$3 + 6 >> 1] ^ -1) | 0); $9_1 = HEAP32[$7_1 + 108 >> 2]; $3 = $9_1 + 1 | 0; $835($7_1, 14, $3, 0, $3); $3 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $3; HEAP32[$1_1 + 16 >> 2] = $3; $4_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $4_1; HEAP32[$1_1 + 12 >> 2] = $4_1; $326($7_1, 10, $4_1, $3); $858($7_1, 146, HEAP32[$1_1 + 8 >> 2]); if ($14) { $326($7_1, 17, $14, HEAP32[$1_1 + 24 >> 2]) } $16_1 = HEAP32[$7_1 + 108 >> 2]; $4_1 = 82740; $3 = 82740; HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? $3 : HEAP32[$7_1 + 104 >> 2] + Math_imul($10_1, 20) | 0) + 8 >> 2] = $16_1; $1065($0_1, $8_1, $12_1, HEAP32[$1_1 + 4 >> 2]); $3 = HEAP32[$7_1 + 108 >> 2]; HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? $4_1 : HEAP32[$7_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) + 8 >> 2] = $3; } if ($14) { $3 = HEAP32[$1_1 + 8 >> 2]; $326($7_1, 60, $14, HEAP32[$7_1 + 108 >> 2] + 4 | 0); $326($7_1, 32, $3, 0); $6_1 = $312($7_1, 40, $3, 0, $8_1 + $11_1 | 0, $15_1 - $11_1 | 0); $858($7_1, 130, $3); } if (!$5_1) { $5_1 = $1373($0_1, $1_1, $2_1, $8_1, $13_1) } $312($7_1, HEAP8[$1_1 + 32 | 0] & 1 ? 139 : 138, HEAP32[$1_1 + 8 >> 2], $5_1, $8_1 + $11_1 | 0, $13_1 - $11_1 | 0); if (!$6_1) { break block10 } $1_1 = HEAP32[$1_1 + 28 >> 2]; if (!$1_1) { $1_1 = HEAP32[$7_1 + 108 >> 2] } $0_1 = 82740; HEAP32[(HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0] ? $0_1 : HEAP32[$7_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) + 8 >> 2] = $1_1; } } function $1308($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = 82740; $6_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { $5_1 = HEAP32[$6_1 + 104 >> 2] + Math_imul($1_1, 20) | 0 } block1 : { if (HEAPU8[HEAP32[$0_1 >> 2] + 87 | 0]) { break block1 } $0_1 = HEAP32[$6_1 + 108 >> 2]; $0_1 = ($0_1 | 0) > ($1_1 | 0) ? $0_1 : $1_1; while (1) { if (($0_1 | 0) == ($1_1 | 0)) { break block1 } block2 : { if (HEAP32[$5_1 + 4 >> 2] != ($2_1 | 0)) { break block2 } $6_1 = HEAPU8[$5_1 | 0]; if (($6_1 | 0) != 135) { if (($6_1 | 0) != 94) { break block2 } HEAP8[$5_1 | 0] = 80; HEAP16[$5_1 + 2 >> 1] = 2; $6_1 = HEAP32[$5_1 + 8 >> 2]; HEAP32[$5_1 + 8 >> 2] = HEAP32[$5_1 + 12 >> 2]; HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = $3 + $6_1; break block2; } HEAP32[$5_1 + 4 >> 2] = $4_1; HEAP8[$5_1 | 0] = 126; } $5_1 = $5_1 + 20 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } } function $1309($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = global$0 - 240 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 + 132 >> 2]; block : { if (HEAPU8[($6_1 ? $6_1 : $0_1) + 223 | 0] != 2) { break block } $6_1 = 82740; $7_1 = HEAP32[$0_1 + 8 >> 2]; if (!HEAPU8[HEAP32[$7_1 >> 2] + 87 | 0]) { $6_1 = HEAP32[$7_1 + 104 >> 2] + Math_imul($1_1, 20) | 0 } $8_1 = HEAP32[$0_1 >> 2]; if (HEAPU8[$8_1 + 87 | 0]) { break block } $7_1 = (Math_imul(HEAPU8[$3 + 60 | 0], 48) + $2_1 | 0) + 8 | 0; $1_1 = 1; $3 = HEAP32[$3 + 80 >> 2]; $0_1 = HEAP32[$3 + 40 >> 2]; $2_1 = $0_1 & 48; if (!($2_1 | !(HEAPU16[$3 + 24 >> 1] ? $0_1 & 1024 : 1))) { $1_1 = ($4_1 & 3) != 0 } HEAP16[$5_1 + 236 >> 1] = 256; HEAP32[$5_1 + 232 >> 2] = 0; HEAP32[$5_1 + 224 >> 2] = 100; HEAP32[$5_1 + 228 >> 2] = 1e9; HEAP32[$5_1 + 216 >> 2] = $8_1; HEAP32[$5_1 + 100 >> 2] = $7_1; HEAP32[$5_1 + 96 >> 2] = $1_1 ? 20370 : 20143; HEAP32[$5_1 + 220 >> 2] = $5_1 + 112; $46($5_1 + 216 | 0, 19350, $5_1 + 96 | 0); block10 : { if (!($0_1 & 1280)) { $2_1 = HEAP32[$3 + 32 >> 2]; block8 : { block6 : { if (HEAPU8[HEAP32[$7_1 + 8 >> 2] + 28 | 0] & 128) { if (((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 3) == 2) { break block6 } } $1_1 = 18737; if ($0_1 & 131072) { break block8 } $1_1 = 18770; if ($0_1 & 16384) { break block8 } $1_1 = $0_1 & 67108928 ? 7307 : 7316; break block8; } if (!$1_1) { break block10 } $1_1 = 18617; } $0_1 = $1_1; $1_1 = $5_1 + 216 | 0; $36($1_1, 30607, 7); HEAP32[$5_1 + 16 >> 2] = HEAP32[$2_1 >> 2]; $46($1_1, $0_1, $5_1 + 16 | 0); $1_1 = HEAPU16[$3 + 46 >> 1]; $4_1 = HEAP32[$3 + 32 >> 2]; $2_1 = HEAPU16[$3 + 24 >> 1]; if (!($2_1 | HEAPU8[$3 + 40 | 0] & 48)) { break block10 } $36($5_1 + 216 | 0, 27801, 2); $0_1 = 0; while (1) { if (($0_1 | 0) != ($2_1 | 0)) { $9_1 = $1365($4_1, $0_1); if ($0_1) { $36($5_1 + 216 | 0, 30651, 5) } HEAP32[$5_1 >> 2] = $9_1; $46($5_1 + 216 | 0, $0_1 >>> 0 < $1_1 >>> 0 ? 25366 : 21211, $5_1); $0_1 = $0_1 + 1 | 0; continue; } break; }; $1_1 = $2_1; $0_1 = HEAP32[$3 + 40 >> 2]; if ($0_1 & 32) { $1366($5_1 + 216 | 0, $4_1, HEAPU16[$3 + 26 >> 1], $2_1, $2_1, 21996); $1_1 = 1; $0_1 = HEAP32[$3 + 40 >> 2]; } if ($0_1 & 16) { $1366($5_1 + 216 | 0, $4_1, HEAPU16[$3 + 28 >> 1], $2_1, $1_1, 22033) } $36($5_1 + 216 | 0, 27781, 1); break block10; } if (!(!($0_1 & 256) | !($0_1 & 15))) { HEAP32[$5_1 + 80 >> 2] = 15209; $1_1 = $5_1 + 216 | 0; $46($1_1, 6465, $5_1 + 80 | 0); $3 = 61; block17 : { if ($0_1 & 5) { break block17 } if (($2_1 | 0) == 48) { HEAP32[$5_1 + 64 >> 2] = 15209; $46($1_1, 7430, $5_1 - -64 | 0); $3 = 60; break block17; } $3 = $0_1 & 32 ? 62 : 60; } HEAP32[$5_1 + 48 >> 2] = $3; $46($5_1 + 216 | 0, 26305, $5_1 + 48 | 0); break block10; } if (!($0_1 & 1024)) { break block10 } $2_1 = $5_1 + 216 | 0; $44($2_1, 30236); $0_1 = HEAPU8[$3 + 28 | 0]; $1_1 = HEAP32[$3 + 24 >> 2]; HEAP32[$5_1 + 36 >> 2] = HEAP32[$3 + 32 >> 2]; HEAP32[$5_1 + 32 >> 2] = $1_1; $46($2_1, $0_1 & 4 ? 6170 : 6178, $5_1 + 32 | 0); } if (HEAPU8[$7_1 + 12 | 0] & 8) { $46($5_1 + 216 | 0, 20099, 0) } $10($8_1, HEAP32[$6_1 + 16 >> 2]); HEAP8[$6_1 + 1 | 0] = 250; HEAP32[$6_1 + 16 >> 2] = $57($5_1 + 216 | 0); } $0_1 = $5_1 + 240 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1310($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = global$0 + -64 | 0; $2_1 = $7_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 + 24 >> 2]; $8_1 = HEAP32[$2_1 + 8 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; $5_1 = HEAP32[$2_1 >> 2]; block6 : { block8 : { block1 : { block9 : { block3 : { block : { block2 : { $3 = HEAPU8[$1_1 | 0]; switch ($3 - 168 | 0) { case 0: case 2: break block; case 1: break block1; default: break block2; }; } if (($3 | 0) == 179) { break block } if (!(HEAPU8[$2_1 + 26 | 0] & 2)) { break block3 } $2_1 = HEAP32[$5_1 + 76 >> 2]; if (!$2_1) { break block3 } while (1) { if (!$2_1) { break block3 } block5 : { $0_1 = HEAP32[$2_1 + 4 >> 2]; if (($0_1 | 0) >= 0) { if (!$1121(0, $1_1, HEAP32[$2_1 >> 2], $0_1)) { break block5 } } $2_1 = HEAP32[$2_1 + 20 >> 2]; continue; } break; }; if (HEAPU8[$1_1 + 7 | 0] & 3) { break block3 } $0_1 = 0; $3 = HEAP32[$4_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; while (1) { if (($0_1 | 0) == ($3 | 0)) { break block3 } $0_1 = $0_1 + 1 | 0; if (HEAP32[$4_1 + 24 >> 2] != HEAP32[$2_1 + 4 >> 2]) { continue } break; }; if (HEAP32[$1_1 + 40 >> 2]) { break block3 } $3 = 2; if (HEAP32[$5_1 + 40 >> 2]) { break block6 } $0_1 = $7_1 + 12 | 0; wasm2js_memory_fill($0_1, 0, 52); HEAP8[$7_1 + 12 | 0] = 170; HEAP32[$7_1 + 40 >> 2] = HEAP32[$2_1 + 8 >> 2]; HEAP16[$7_1 + 44 >> 1] = HEAP32[$2_1 + 12 >> 2]; $1374($5_1, $8_1, $0_1); if (HEAP32[$5_1 + 40 >> 2]) { break block6 } $0_1 = HEAP16[$7_1 + 46 >> 1]; HEAP32[(HEAP32[$8_1 + 20 >> 2] + ($0_1 << 4) | 0) + 4 >> 2] = $1_1; HEAP16[$1_1 + 34 >> 1] = $0_1; HEAP32[$1_1 + 40 >> 2] = $8_1; break block8; } if ($4_1) { break block9 } } $3 = 0; break block6; } $3 = 0; $0_1 = HEAP32[$4_1 >> 2]; $6_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $0_1 = $4_1 + 8 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) == ($6_1 | 0)) { break block6 } if (HEAP32[$1_1 + 28 >> 2] == HEAP32[$0_1 + 16 >> 2]) { $1374($5_1, $8_1, $1_1); break block6; } else { $0_1 = $0_1 + 48 | 0; $2_1 = $2_1 + 1 | 0; continue; } }; } $3 = 0; if (HEAP32[$1_1 + 40 >> 2] | (HEAPU8[$2_1 + 26 | 0] & 2 | HEAP32[$0_1 + 16 >> 2] != HEAPU8[$1_1 + 2 | 0])) { break block6 } $4_1 = $8_1 + 36 | 0; $0_1 = HEAP32[$8_1 + 32 >> 2]; $2_1 = 0; while (1) { block12 : { $3 = HEAP32[$4_1 >> 2]; block11 : { if (($3 | 0) <= ($2_1 | 0)) { break block11 } $6_1 = HEAP32[$0_1 >> 2]; if (($6_1 | 0) == ($1_1 | 0)) { break block11 } if ($1121(0, $6_1, $1_1, -1)) { break block12 } $3 = HEAP32[$4_1 >> 2]; } block13 : { if (($2_1 | 0) < ($3 | 0)) { break block13 } $0_1 = HEAP32[$5_1 >> 2]; $3 = HEAPU8[$0_1 + 84 | 0]; $4_1 = $1375($0_1, HEAP32[$8_1 + 32 >> 2], 24, $4_1, $7_1 + 12 | 0); HEAP32[$8_1 + 32 >> 2] = $4_1; $0_1 = 0; $2_1 = HEAP32[$7_1 + 12 >> 2]; if (($2_1 | 0) < 0) { break block13 } $4_1 = $4_1 + Math_imul($2_1, 24) | 0; HEAP32[$4_1 >> 2] = $1_1; $6_1 = HEAP32[$1_1 + 20 >> 2]; if ($6_1) { $0_1 = HEAP32[$6_1 >> 2] } $3 = $390(HEAP32[$5_1 >> 2], HEAP32[$1_1 + 8 >> 2], $0_1, $3, 0); HEAP32[$4_1 + 4 >> 2] = $3; $6_1 = HEAP32[$1_1 + 12 >> 2]; block18 : { if (!(!$6_1 | HEAPU8[$3 + 4 | 0] & 32)) { $3 = HEAP32[$5_1 + 44 >> 2]; HEAP32[$5_1 + 44 >> 2] = $3 + 1; HEAP32[$4_1 + 16 >> 2] = $3; block17 : { block16 : { if (($0_1 | 0) != 1) { break block16 } $0_1 = HEAP32[$6_1 + 20 >> 2]; if (HEAP32[$0_1 >> 2] != 1) { break block16 } if ($1121(0, HEAP32[$0_1 + 8 >> 2], HEAP32[HEAP32[$1_1 + 20 >> 2] + 8 >> 2], 0)) { break block16 } HEAP8[$4_1 + 20 | 0] = 0; HEAP8[$4_1 + 21 | 0] = HEAPU8[$1_1 + 4 | 0] >>> 2 & 1; break block17; } HEAP8[$4_1 + 20 | 0] = 1; } HEAP8[$4_1 + 22 | 0] = HEAP32[HEAP32[$4_1 + 4 >> 2] + 4 >> 2] >>> 20 & 1; break block18; } HEAP32[$4_1 + 16 >> 2] = -1; } $0_1 = -1; if (!(HEAPU8[$4_1 + 21 | 0] | !(HEAPU8[$1_1 + 4 | 0] & 4))) { $0_1 = HEAP32[$5_1 + 44 >> 2]; HEAP32[$5_1 + 44 >> 2] = $0_1 + 1; } HEAP32[$4_1 + 8 >> 2] = $0_1; } HEAP32[$1_1 + 40 >> 2] = $8_1; HEAP16[$1_1 + 34 >> 1] = $2_1; break block8; } $0_1 = $0_1 + 24 | 0; $2_1 = $2_1 + 1 | 0; continue; }; } $3 = 1; } $0_1 = $7_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $1311($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAP32[$2_1 + 16 >> 2]; if (($1_1 | 0) == ($3 | 0)) { return 0 } HEAP32[$2_1 + 16 >> 2] = $1_1; $919($0_1, $1_1); HEAP32[$2_1 + 16 >> 2] = $3; return 1; } function $1312($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAPU8[$1_1 | 0]; $6_1 = HEAP32[$0_1 >> 2]; block7 : { block1 : { block : { $3 = HEAP32[$0_1 + 24 >> 2]; if (!HEAP32[$3 + 16 >> 2]) { break block } if (($4_1 | 0) != 168) { break block1 } $0_1 = 0; $7_1 = HEAP32[$3 + 4 >> 2]; $5_1 = HEAP32[$7_1 >> 2]; $2_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $7_1 = $7_1 + 24 | 0; while (1) { block3 : { if (($0_1 | 0) != ($2_1 | 0)) { if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$7_1 + Math_imul($0_1, 48) >> 2]) { break block3 } } else { $0_1 = $2_1 } if (($0_1 | 0) == ($5_1 | 0)) { break block1 } break block; } $0_1 = $0_1 + 1 | 0; continue; }; } block4 : { block6 : { switch ($4_1 - 168 | 0) { case 4: if (!(HEAP8[$1_1 + 7 | 0] & 1)) { break block1 } $2_1 = $3; while (1) { $0_1 = HEAP32[$2_1 >> 2]; if (!$0_1) { break block4 } $2_1 = $0_1 + 36 | 0; if (($0_1 | 0) != HEAP32[$1_1 + 44 >> 2]) { continue } break; }; return 1; case 2: case 3: break block1; case 0: case 1: break block4; default: break block6; }; } if (($4_1 | 0) != 179) { break block1 } } $4_1 = 2; $0_1 = HEAP32[$6_1 >> 2]; if (HEAPU8[$0_1 + 87 | 0]) { break block7 } block12 : { block10 : { $2_1 = HEAP32[$3 + 8 >> 2]; if ($2_1) { $0_1 = 0; while (1) { if (($0_1 | 0) < HEAP32[$2_1 >> 2]) { if (!$1121(0, HEAP32[(($0_1 << 4) + $2_1 | 0) + 8 >> 2], $1_1, -1)) { break block10 } $0_1 = $0_1 + 1 | 0; $2_1 = HEAP32[$3 + 8 >> 2]; continue; } break; }; $0_1 = HEAP32[$6_1 >> 2]; } $0_1 = $906($0_1, $1_1, 0); if (!(!$0_1 | HEAPU8[$0_1 | 0] != 169)) { HEAP8[$0_1 | 0] = 172 } $2_1 = $936($6_1, HEAP32[$3 + 8 >> 2], $0_1); HEAP32[$3 + 8 >> 2] = $2_1; $0_1 = -1; $5_1 = 1; break block12; } $2_1 = HEAP32[$3 + 8 >> 2]; $5_1 = 0; } if ($2_1) { $2_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1 | 134217728; $790(HEAP32[$6_1 >> 2], $1_1); wasm2js_memory_fill($1_1, 0, 52); HEAP8[$1_1 | 0] = 168; $2_1 = $2_1 & 512; HEAP16[$1_1 + 32 >> 1] = $5_1 ? HEAP32[HEAP32[$3 + 8 >> 2] >> 2] - 1 | 0 : $0_1; HEAP32[$1_1 + 28 >> 2] = HEAP32[HEAP32[$3 >> 2] + 48 >> 2]; $0_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$1_1 + 44 >> 2] = $0_1; } if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { break block7 } } $4_1 = 0; } return $4_1 | 0; } function $1313($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!$1_1) { break block } $4_1 = $1_1 + 8 | 0; while (1) { if (HEAP32[$1_1 >> 2] <= ($2_1 | 0)) { break block } $3 = ($2_1 << 4) + $4_1 | 0; HEAP32[$3 >> 2] = $1265($0_1, HEAP32[$3 >> 2]); $2_1 = $2_1 + 1 | 0; continue; }; } } function $1314($0_1, $1_1) { var $2_1 = 0; block : { $2_1 = HEAP32[$1_1 >> 2]; $0_1 = HEAP32[$0_1 + 24 >> 2]; if (($2_1 | 0) >= HEAP32[$0_1 >> 2]) { break block } $0_1 = HEAP32[($0_1 + ($2_1 << 2) | 0) + 4 >> 2]; if (($0_1 | 0) <= 0) { break block } HEAP32[$1_1 >> 2] = $0_1; } } function $1315($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; block : { if (HEAPU8[$1_1 + 4 | 0] & 32) { break block } if ($971($2_1)) { break block } $3 = $369(HEAP32[$0_1 >> 2], $3); if (!!$3 & HEAP32[$3 + 12 >> 2] != 15) { break block } $3 = 0; $4_1 = HEAP32[$0_1 + 8 >> 2]; $4_1 = ($4_1 | 0) > 0 ? $4_1 : 0; while (1) { if (($3 | 0) != ($4_1 | 0)) { $5_1 = HEAP32[HEAP32[$0_1 + 24 >> 2] + ($3 << 3) >> 2]; if (HEAP32[$5_1 + 28 >> 2] == HEAP32[$1_1 + 28 >> 2] & HEAPU16[$5_1 + 32 >> 1] == HEAPU16[$1_1 + 32 >> 1]) { break block } $3 = $3 + 1 | 0; continue; } break; }; if (($971($1_1) | 0) == 65) { HEAP32[$0_1 + 16 >> 2] = 1 } $3 = HEAP32[$0_1 + 8 >> 2] + 1 | 0; HEAP32[$0_1 + 8 >> 2] = $3; $3 = $668(HEAP32[HEAP32[$0_1 >> 2] >> 2], HEAP32[$0_1 + 24 >> 2], $3 << 3, 0); HEAP32[$0_1 + 24 >> 2] = $3; if (!$3) { HEAP32[$0_1 + 8 >> 2] = 0; return; } $0_1 = $3 + (HEAP32[$0_1 + 8 >> 2] << 3) | 0; HEAP32[$0_1 - 4 >> 2] = $2_1; HEAP32[$0_1 - 8 >> 2] = $1_1; } } function $1316($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = 1; block : { if (HEAPU8[HEAP32[$0_1 + 4 >> 2]]) { break block } $3 = 0; if (HEAPU8[$1_1 | 0] != 168) { break block } $6_1 = HEAP32[$1_1 + 4 >> 2]; if ($6_1 & (HEAP32[$0_1 + 20 >> 2] | 32)) { break block } $3 = HEAP32[$0_1 + 8 >> 2]; $8_1 = ($3 | 0) > 0 ? $3 : 0; $3 = 1; while (1) { if (($4_1 | 0) == ($8_1 | 0)) { break block } $7_1 = HEAP32[$0_1 + 24 >> 2]; $5_1 = HEAP32[$7_1 + ($4_1 << 3) >> 2]; if (!(($5_1 | 0) == ($1_1 | 0) | HEAP32[$5_1 + 28 >> 2] != HEAP32[$1_1 + 28 >> 2] | HEAPU16[$5_1 + 32 >> 1] != HEAPU16[$1_1 + 32 >> 1])) { if ($2_1) { if (($971($5_1) | 0) == 65) { break block } $7_1 = HEAP32[$0_1 + 24 >> 2]; $6_1 = HEAP32[$1_1 + 4 >> 2]; } HEAP32[$0_1 + 12 >> 2] = HEAP32[$0_1 + 12 >> 2] + 1; HEAP32[$1_1 + 4 >> 2] = $6_1 & -8388641 | 32; HEAP32[$1_1 + 12 >> 2] = $906(HEAP32[HEAP32[$0_1 >> 2] >> 2], HEAP32[(($4_1 << 3) + $7_1 | 0) + 4 >> 2], 0); break block; } $4_1 = $4_1 + 1 | 0; continue; }; } return $3; } function $1317($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = 1; if (HEAPU8[$1_1 + 7 | 0] & 32) { HEAP16[$0_1 + 20 >> 1] = 0; $2_1 = 2; } return $2_1 | 0; } function $1318($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = HEAP32[$0_1 + 24 >> 2]; $6_1 = $5_1 + 8 | 0; block2 : { while (1) { if (($3 | 0) < HEAP32[$5_1 >> 2]) { $2_1 = HEAP32[($3 << 4) + $6_1 >> 2]; if ($1121(0, $1_1, $2_1, -1) >>> 0 <= 1) { $2_1 = $1267(HEAP32[$0_1 >> 2], $2_1); $4_1 = 1; if (!$2_1 | HEAP32[$2_1 + 12 >> 2] == 15) { break block2 } } $3 = $3 + 1 | 0; continue; } break; }; if (HEAPU8[$1_1 + 5 | 0] & 16) { HEAP16[$0_1 + 20 >> 1] = 0; return 2; } $4_1 = $1204($0_1, $1_1); } return $4_1 | 0; } function $1319($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0; $16_1 = global$0 - 16 | 0; $3 = $16_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = HEAP32[$1_1 >> 2]; $12_1 = HEAP32[$3 >> 2]; $17_1 = HEAP32[$12_1 >> 2]; block : { if (HEAPU8[$17_1 + 87 | 0]) { break block } $4_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; $10_1 = HEAP32[$4_1 >> 2]; HEAP32[$3 + 496 >> 2] = 0; $20_1 = $3 + 496 | 0; $14 = $1331($20_1, HEAP32[$10_1 + 12 >> 2]); $13_1 = i64toi32_i32$HIGH_BITS; $6_1 = HEAPU8[$10_1 | 0]; block4 : { if (($6_1 | 0) == 50) { if ($1191($12_1, $10_1)) { break block } $3 = HEAP32[$10_1 + 20 >> 2]; block3 : { if (HEAPU8[$10_1 + 5 | 0] & 16) { $5_1 = $1332($20_1, $3); break block3; } $5_1 = $1324($20_1, $3); } $9_1 = i64toi32_i32$HIGH_BITS; HEAP32[$4_1 + 32 >> 2] = $5_1; HEAP32[$4_1 + 36 >> 2] = $9_1; $5_1 = $5_1 | $14; $9_1 = $9_1 | $13_1; break block4; } $3 = $1331($20_1, HEAP32[$10_1 + 16 >> 2]); $5_1 = i64toi32_i32$HIGH_BITS; $7_1 = $5_1; HEAP32[$4_1 + 32 >> 2] = $3; HEAP32[$4_1 + 36 >> 2] = $5_1; if (!HEAP32[$10_1 + 12 >> 2] | (HEAPU8[$10_1 + 5 | 0] | HEAPU8[$10_1 + 6 | 0] << 8) & 1040 | HEAP32[$10_1 + 20 >> 2]) { $5_1 = $1333($20_1, $10_1); $9_1 = i64toi32_i32$HIGH_BITS; break block4; } $5_1 = $3 | $14; $9_1 = $7_1 | $13_1; } if (HEAP32[$20_1 >> 2]) { HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 4096 } $3 = HEAP32[$10_1 + 4 >> 2]; block8 : { if (!($3 & 3)) { break block8 } $7_1 = $1277($20_1, HEAP32[$10_1 + 36 >> 2]); $8_1 = i64toi32_i32$HIGH_BITS; if ($3 & 1) { $9_1 = $8_1 | $9_1; $24_1 = $9_1 >>> 1 | 0; $5_1 = $5_1 | $7_1; $23_1 = ($9_1 & 1) << 31 | $5_1 >>> 1; if (!(($8_1 | 0) == ($24_1 | 0) & $7_1 >>> 0 <= $23_1 >>> 0 | $8_1 >>> 0 < $24_1 >>> 0)) { $23_1 = $8_1 - 1 | 0; $24_1 = $7_1 - 1 | 0; $23_1 = ($24_1 | 0) != -1 ? $23_1 + 1 | 0 : $23_1; break block8; } $257($12_1, 3229, 0); break block; } $11_1 = $9_1 >>> 1 | 0; if (($8_1 | 0) == ($11_1 | 0) & $7_1 >>> 0 > (($9_1 & 1) << 31 | $5_1 >>> 1) >>> 0 | $8_1 >>> 0 > $11_1 >>> 0) { break block8 } if (!(!(HEAPU8[$0_1 + 20 | 0] & 64) | HEAP32[$0_1 >> 2] <= 0)) { $257($12_1, 3229, 0); break block; } $3 = $3 & -4; HEAP32[$10_1 + 4 >> 2] = $3; } HEAP32[$4_1 + 40 >> 2] = $5_1; HEAP32[$4_1 + 44 >> 2] = $9_1; HEAP32[$4_1 + 16 >> 2] = -1; HEAP32[$4_1 + 20 >> 2] = -1; HEAP16[$4_1 + 12 >> 1] = 0; block28 : { block26 : { if ($1334($6_1)) { $3 = $1007(HEAP32[$10_1 + 12 >> 2]); $7_1 = $1007(HEAP32[$10_1 + 16 >> 2]); $8_1 = !($14 & HEAP32[$4_1 + 32 >> 2] | $13_1 & HEAP32[$4_1 + 36 >> 2]); $11_1 = HEAP32[$4_1 + 28 >> 2]; if (($11_1 | 0) > 0) { $3 = HEAP32[(HEAP32[$3 + 20 >> 2] + ($11_1 << 4) | 0) - 8 >> 2] } $11_1 = $8_1 ? 16383 : 2048; if ($1335($0_1, $16_1, $3, $6_1)) { HEAP32[$4_1 + 20 >> 2] = HEAP32[$16_1 >> 2]; HEAP32[$4_1 + 24 >> 2] = HEAP32[$16_1 + 4 >> 2]; HEAP16[$4_1 + 12 >> 1] = $1336($6_1) & $11_1; } if (($6_1 | 0) == 45) { HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 2048 } block16 : { if (!$7_1) { break block16 } if (!$1335($0_1, $16_1, $7_1, $6_1) | HEAPU8[$7_1 + 4 | 0] & 32) { break block16 } $8_1 = 0; $3 = $10_1; $7_1 = $4_1; block17 : { if (HEAP32[$4_1 + 20 >> 2] < 0) { break block17 } $3 = $906($17_1, $3, 0); if (HEAPU8[$17_1 + 87 | 0]) { $11($17_1, $3); break block; } $4_1 = $1269($1_1, $3, 3); if (!$4_1) { break block } $7_1 = HEAP32[$1_1 + 24 >> 2]; $1337($1_1, $4_1, $2_1); $4_1 = $7_1 + Math_imul($4_1, 48) | 0; if (($6_1 | 0) == 45) { HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 2048 } $7_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; HEAP16[$7_1 + 10 >> 1] = HEAPU16[$7_1 + 10 >> 1] | 8; if (HEAPU8[HEAP32[$12_1 >> 2] + 80 | 0] & 128) { break block17 } $6_1 = HEAPU8[$3 | 0]; if (($6_1 | 0) != 54 & ($6_1 | 0) != 45 | HEAP8[$3 + 4 | 0] & 1) { break block17 } $6_1 = $971(HEAP32[$3 + 12 >> 2]); $15_1 = $971(HEAP32[$3 + 16 >> 2]); if (($6_1 | 0) != ($15_1 | 0) & (($6_1 | 0) < 67 | ($15_1 | 0) < 67)) { break block17 } $6_1 = $369($12_1, $3); if (!(!$6_1 | HEAP32[$6_1 + 12 >> 2] == 15)) { $6_1 = HEAP32[$3 + 16 >> 2]; $15_1 = $1267($12_1, HEAP32[$3 + 12 >> 2]); $6_1 = $1267($12_1, $6_1); if ($67(HEAP32[$15_1 >> 2], HEAP32[$6_1 >> 2])) { break block17 } } $8_1 = 2048; HEAP16[$7_1 + 12 >> 1] = HEAPU16[$7_1 + 12 >> 1] | 2048; } $6_1 = HEAP32[$3 + 12 >> 2]; block24 : { block23 : { if (HEAPU8[$6_1 | 0] == 177) { break block23 } $15_1 = HEAP32[$3 + 16 >> 2]; if (HEAPU8[$15_1 | 0] == 177) { break block23 } if (($370($12_1, $6_1, $15_1) | 0) == ($370($12_1, HEAP32[$3 + 16 >> 2], HEAP32[$3 + 12 >> 2]) | 0)) { break block24 } } HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] ^ 1024; } HEAP32[$3 + 12 >> 2] = __wasm_rotl_i64(HEAP32[$3 + 12 >> 2], HEAP32[$3 + 16 >> 2], 32); HEAP32[$3 + 16 >> 2] = i64toi32_i32$HIGH_BITS; $6_1 = HEAPU8[$3 | 0]; if ($6_1 >>> 0 >= 55) { HEAP8[$3 | 0] = ($6_1 - 55 ^ 2) + 55 } HEAP32[$4_1 + 20 >> 2] = HEAP32[$16_1 >> 2]; $6_1 = HEAP32[$16_1 + 4 >> 2]; HEAP32[$4_1 + 40 >> 2] = $5_1; HEAP32[$4_1 + 44 >> 2] = $9_1; HEAP32[$4_1 + 32 >> 2] = $14 | $24_1; HEAP32[$4_1 + 36 >> 2] = $13_1 | $23_1; HEAP32[$4_1 + 24 >> 2] = $6_1; HEAP16[$4_1 + 12 >> 1] = $11_1 & $1336(HEAPU8[$3 | 0]) + $8_1; $4_1 = $7_1; break block26; } if (($6_1 | 0) != 51) { break block26 } $5_1 = HEAP32[$10_1 + 4 >> 2]; if ($5_1 & 1) { break block26 } if ($1051($3)) { break block26 } HEAP32[$10_1 + 8 >> 2] = 13617; HEAP8[$10_1 | 0] = 171; HEAP32[$10_1 + 4 >> 2] = $5_1 | 536870912; HEAP16[$4_1 + 12 >> 1] = 0; HEAP32[$4_1 + 40 >> 2] = 0; HEAP32[$4_1 + 44 >> 2] = 0; break block26; } block78 : { block71 : { block65 : { block35 : { block63 : { block33 : { block34 : { block29 : { block31 : { block27 : { block30 : { $7_1 = HEAPU8[$10_1 | 0]; switch ($7_1 - 49 | 0) { case 0: break block27; case 1: case 2: break block28; case 3: break block29; default: break block30; }; } if (($7_1 | 0) == 43) { break block31 } if (($7_1 | 0) != 172) { break block28 } if (HEAPU8[$1_1 + 8 | 0] != 44) { break block26 } $3 = HEAP32[$10_1 + 20 >> 2]; if (!$3) { break block26 } $15_1 = HEAP32[$12_1 >> 2]; $7_1 = HEAP32[$3 >> 2]; $5_1 = $390($15_1, HEAP32[$10_1 + 8 >> 2], $7_1, 1, 0); if (!$5_1) { break block26 } $25 = HEAP32[$5_1 + 4 >> 2]; if (!($25 & 4)) { break block26 } $3 = HEAP32[$10_1 + 20 >> 2]; $5_1 = HEAP32[$5_1 + 8 >> 2]; $9_1 = HEAPU8[$5_1 + 2 | 0]; $11_1 = HEAPU8[$5_1 + 1 | 0]; $5_1 = HEAPU8[$5_1 | 0]; $13_1 = 0; if (($7_1 | 0) >= 3) { $7_1 = HEAP32[$3 + 40 >> 2]; if (HEAPU8[$7_1 | 0] != 118) { break block26 } $7_1 = HEAP32[$7_1 + 8 >> 2]; $13_1 = HEAPU8[$7_1 | 0]; if (!$13_1 | HEAPU8[$7_1 + 1 | 0] | (($5_1 | 0) == ($13_1 | 0) | ($11_1 | 0) == ($13_1 | 0))) { break block26 } } $18_1 = HEAP32[$3 + 24 >> 2]; $19_1 = $1007(HEAP32[$3 + 8 >> 2]); $22_1 = HEAPU8[$19_1 | 0]; if (($22_1 | 0) != 157) { break block33 } if (!(HEAPU8[$15_1 + 34 | 0] & 128)) { break block34 } break block35; } if (HEAPU8[$1_1 + 8 | 0] != 44) { break block26 } $3 = HEAP32[$10_1 + 20 >> 2] + 8 | 0; $5_1 = Math_imul($2_1, 48); $6_1 = 0; while (1) { if (($6_1 | 0) == 2) { break block26 } $4_1 = $903($12_1, HEAPU8[$6_1 + 50998 | 0], $906($17_1, HEAP32[$10_1 + 12 >> 2], 0), $906($17_1, HEAP32[$3 + ($6_1 << 4) >> 2], 0)); $1338($4_1, $10_1); $4_1 = $1269($1_1, $4_1, 3); $1319($0_1, $1_1, $4_1); $7_1 = HEAP32[$1_1 + 24 >> 2]; $1337($1_1, $4_1, $2_1); $6_1 = $6_1 + 1 | 0; $4_1 = $5_1 + $7_1 | 0; continue; }; } $26_1 = Math_imul($2_1, 48); $18_1 = $26_1 + HEAP32[$1_1 + 24 >> 2] | 0; $27 = HEAP32[$18_1 >> 2]; $22_1 = HEAP32[$1_1 >> 2]; $25 = HEAP32[$22_1 >> 2]; $15_1 = HEAP32[$25 >> 2]; $8_1 = $270($15_1, 424, 0); HEAP32[$18_1 + 24 >> 2] = $8_1; block36 : { if (!$8_1) { break block36 } HEAP16[$18_1 + 10 >> 1] = HEAPU16[$18_1 + 10 >> 1] | 16; $3 = $8_1 + 32 | 0; wasm2js_memory_fill($3, 0, 384); HEAP8[$8_1 + 9 | 0] = 0; HEAP32[$8_1 >> 2] = $22_1; HEAP32[$8_1 + 20 >> 2] = 0; HEAP32[$8_1 + 4 >> 2] = 0; HEAP32[$8_1 + 24 >> 2] = $3; HEAP32[$8_1 + 12 >> 2] = 0; HEAP32[$8_1 + 16 >> 2] = 8; $1268($8_1, $27, 43); $1270($0_1, $8_1); if (HEAPU8[$15_1 + 87 | 0]) { break block36 } $21_1 = $22_1 + 496 | 0; $3 = HEAP32[$8_1 + 24 >> 2]; $7_1 = HEAP32[$8_1 + 12 >> 2]; $13_1 = -1; $11_1 = -1; $14 = -1; $19_1 = -1; while (1) { if (!(!($11_1 | $13_1) | ($7_1 | 0) <= 0)) { $4_1 = HEAPU16[$3 + 12 >> 1]; block41 : { if (!($4_1 & 511)) { $4_1 = $325($15_1, 416, 0); if (!$4_1) { $14 = 0; $19_1 = 0; break block41; } HEAP32[$3 + 24 >> 2] = $4_1; HEAP32[$3 + 20 >> 2] = -1; HEAP16[$3 + 12 >> 1] = 1024; HEAP16[$3 + 10 >> 1] = HEAPU16[$3 + 10 >> 1] | 32; $5_1 = $4_1 + 32 | 0; wasm2js_memory_fill($5_1, 0, 384); $9_1 = HEAP32[$1_1 >> 2]; HEAP8[$4_1 + 9 | 0] = 0; HEAP32[$4_1 >> 2] = $9_1; HEAP32[$4_1 + 20 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$4_1 + 24 >> 2] = $5_1; HEAP32[$4_1 + 12 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = 8; $1268($4_1, HEAP32[$3 >> 2], 44); $1270($0_1, $4_1); HEAP32[$4_1 + 4 >> 2] = $1_1; $14 = 0; $19_1 = 0; $5_1 = 0; $9_1 = 0; block43 : { if (HEAPU8[$15_1 + 87 | 0]) { break block43 } $6_1 = 0; $5_1 = HEAP32[$4_1 + 12 >> 2]; $28_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $4_1 = HEAP32[$4_1 + 24 >> 2]; $5_1 = 0; while (1) { if (($6_1 | 0) == ($28_1 | 0)) { break block43 } if (!(!$1334(HEAPU8[HEAP32[$4_1 >> 2]]) & HEAPU16[$4_1 + 12 >> 1] != 64)) { $5_1 = $1277($21_1, HEAP32[$4_1 + 20 >> 2]) | $5_1; $9_1 = $9_1 | i64toi32_i32$HIGH_BITS; } $4_1 = $4_1 + 48 | 0; $6_1 = $6_1 + 1 | 0; continue; }; } $13_1 = $5_1 & $13_1; $11_1 = $9_1 & $11_1; break block41; } $6_1 = HEAPU16[$3 + 10 >> 1]; if ($6_1 & 8) { break block41 } $5_1 = $1277($21_1, HEAP32[$3 + 20 >> 2]); $9_1 = i64toi32_i32$HIGH_BITS; if ($6_1 & 2) { $5_1 = $1277($21_1, HEAP32[(HEAP32[$8_1 + 24 >> 2] + Math_imul(HEAP32[$3 + 16 >> 2], 48) | 0) + 20 >> 2]) | $5_1; $9_1 = $9_1 | i64toi32_i32$HIGH_BITS; } $4_1 = $4_1 & 2; $14 = $4_1 ? $5_1 & $14 : 0; $19_1 = $4_1 ? $9_1 & $19_1 : 0; $13_1 = $5_1 & $13_1; $11_1 = $9_1 & $11_1; } $7_1 = $7_1 - 1 | 0; $3 = $3 + 48 | 0; continue; } break; }; HEAP32[$8_1 + 416 >> 2] = $13_1; HEAP32[$8_1 + 420 >> 2] = $11_1; $5_1 = -1; HEAP32[$18_1 + 20 >> 2] = -1; HEAP16[$18_1 + 12 >> 1] = 512; block47 : { if (!($11_1 | $13_1)) { break block47 } HEAP8[$1_1 + 9 | 0] = 1; if (HEAP32[$8_1 + 12 >> 2] != 2) { break block47 } $7_1 = HEAP32[$8_1 + 24 >> 2]; $13_1 = 0; label3 : while (1) { $9_1 = $1339($7_1, $13_1); if (!$9_1) { break block47 } $13_1 = $13_1 + 1 | 0; $6_1 = 0; while (1) { $4_1 = $1339($7_1 + 48 | 0, $6_1); if (!$4_1) { continue label3 } block48 : { if ((HEAPU16[$4_1 + 10 >> 1] | HEAPU16[$9_1 + 10 >> 1]) & 128) { break block48 } $3 = HEAPU16[$9_1 + 12 >> 1]; if (!($3 & 62)) { break block48 } $7_1 = HEAPU16[$4_1 + 12 >> 1]; if (!($7_1 & 62)) { break block48 } $3 = $3 | $7_1; if (!($3 & 65497 ? !($3 & 65509) : 1)) { break block48 } if ($1121(0, HEAP32[HEAP32[$9_1 >> 2] + 12 >> 2], HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2], -1)) { break block48 } if ($1121(0, HEAP32[HEAP32[$9_1 >> 2] + 16 >> 2], HEAP32[HEAP32[$4_1 >> 2] + 16 >> 2], -1)) { break block48 } $7_1 = $906(HEAP32[HEAP32[HEAP32[$1_1 >> 2] >> 2] >> 2], HEAP32[$9_1 >> 2], 0); if (!$7_1) { break block48 } $11_1 = $3 & $3 + 63 ? ($3 & 24 ? 8 : 32) : $3; $4_1 = 54; while (1) { $3 = $4_1; $4_1 = $3 + 1 | 0; if (($11_1 | 0) != 2 << $3 - 54) { continue } break; }; HEAP8[$7_1 | 0] = $3; $1319($0_1, $1_1, $1269($1_1, $7_1, 3)); } $6_1 = $6_1 + 1 | 0; $7_1 = HEAP32[$8_1 + 24 >> 2]; continue; }; }; } if (!($14 | $19_1)) { break block36 } $7_1 = 0; $9_1 = 0; while (1) { if (!($9_1 >>> 0 > 1 | $7_1)) { $6_1 = HEAP32[$8_1 + 12 >> 2]; $4_1 = HEAP32[$8_1 + 24 >> 2]; while (1) { if (($6_1 | 0) <= 0) { break block36 } $6_1 = $6_1 - 1 | 0; HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] & 65471; block52 : { $3 = HEAP32[$4_1 + 20 >> 2]; if (($5_1 | 0) != ($3 | 0)) { if ($1277($21_1, $3) & $14 | $19_1 & i64toi32_i32$HIGH_BITS) { break block52 } } $4_1 = $4_1 + 48 | 0; continue; } break; }; $13_1 = HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2]; $7_1 = 1; $11_1 = HEAP32[$4_1 + 24 >> 2]; $18_1 = ($11_1 | 0) != -2; while (1) { if (!(!$7_1 | ($6_1 | 0) < 0)) { block56 : { block55 : { if (HEAP32[$4_1 + 20 >> 2] != ($3 | 0)) { HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] & 65471; break block55; } $7_1 = 0; if (($11_1 | 0) != HEAP32[$4_1 + 24 >> 2]) { break block56 } $5_1 = HEAP32[$4_1 >> 2]; if (!$18_1) { if ($1121($25, HEAP32[$5_1 + 12 >> 2], $13_1, -1)) { break block56 } $5_1 = HEAP32[$4_1 >> 2]; } $5_1 = $971(HEAP32[$5_1 + 16 >> 2]); $28_1 = $971(HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2]); if (!!$5_1 & ($5_1 | 0) != ($28_1 | 0)) { break block56 } HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 64; } $7_1 = 1; } $4_1 = $4_1 + 48 | 0; $6_1 = $6_1 - 1 | 0; continue; } break; }; $9_1 = $9_1 + 1 | 0; $5_1 = $3; continue; } break; }; if (!$7_1) { break block36 } $4_1 = HEAP32[$8_1 + 24 >> 2]; $6_1 = HEAP32[$8_1 + 12 >> 2]; $3 = 0; $7_1 = 0; while (1) { if (!(($6_1 | 0) <= 0)) { if (HEAPU8[$4_1 + 10 | 0] & 64) { $5_1 = $906($15_1, HEAP32[HEAP32[$4_1 >> 2] + 16 >> 2], 0); $3 = $936(HEAP32[$22_1 >> 2], $3, $5_1); $7_1 = HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2]; } $6_1 = $6_1 - 1 | 0; $4_1 = $4_1 + 48 | 0; continue; } break; }; $5_1 = $903($25, 50, $906($15_1, $7_1, 0), 0); if ($5_1) { $1338($5_1, $27); HEAP32[$5_1 + 20 >> 2] = $3; $3 = $1269($1_1, $5_1, 3); $1319($0_1, $1_1, $3); $1337($1_1, $3, $2_1); break block36; } $358($15_1, $3); } $4_1 = $26_1 + HEAP32[$1_1 + 24 >> 2] | 0; break block26; } $5_1 = HEAP32[$10_1 + 12 >> 2]; if ($3 & 1 | (HEAPU8[$5_1 | 0] != 168 | HEAP16[$5_1 + 32 >> 1] < 0)) { break block26 } $7_1 = $1269($1_1, $903($12_1, 55, $906($17_1, $5_1, 0), $951($17_1, 122, 0, 0)), 131); if (!$7_1) { break block26 } $3 = HEAP32[$1_1 + 24 >> 2] + Math_imul($7_1, 48) | 0; HEAP32[$3 + 32 >> 2] = 0; HEAP32[$3 + 36 >> 2] = 0; HEAP32[$3 + 20 >> 2] = HEAP32[$5_1 + 28 >> 2]; $5_1 = HEAP16[$5_1 + 32 >> 1]; HEAP16[$3 + 12 >> 1] = 4; HEAP32[$3 + 24 >> 2] = $5_1; $1337($1_1, $7_1, $2_1); $4_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 8; $5_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$3 + 40 >> 2] = HEAP32[$4_1 + 40 >> 2]; HEAP32[$3 + 44 >> 2] = $5_1; break block26; } $8_1 = 0; $7_1 = HEAP16[$19_1 + 32 >> 1]; $14 = $1200(HEAP32[$12_1 + 244 >> 2], $7_1); block62 : { if (!$14) { break block62 } $6_1 = HEAPU16[$14 + 16 >> 1]; $3 = $6_1 & 31; if (($6_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $3; $26_1 = 0; } else { $26_1 = 1 << $3; $6_1 = $26_1 - 1 & 1 >>> 32 - $3; } if (!($26_1 & 262148 | $6_1 & 262144)) { break block62 } $8_1 = $53($14); } $3 = HEAP32[$12_1 + 8 >> 2]; HEAP32[$3 + 228 >> 2] = HEAP32[$3 + 228 >> 2] | (($7_1 | 0) > 31 ? -2147483648 : 1 << $7_1 - 1); break block63; } if (($22_1 | 0) != 118) { break block35 } $8_1 = HEAP32[$19_1 + 8 >> 2]; $14 = 0; } if (!$8_1) { $6_1 = 1; break block65; } $3 = 0; $7_1 = $5_1; while (1) { $5_1 = $3; $21_1 = $3 + $8_1 | 0; $6_1 = HEAPU8[$21_1 | 0]; $3 = ($6_1 | 0) == ($7_1 | 0); block69 : { block66 : { if (!$6_1) { break block66 } $27 = $6_1 << 24 >> 24; $6_1 = $27 & 255; if (($6_1 | 0) == ($7_1 | 0) | ($6_1 | 0) == ($11_1 | 0) | ($6_1 | 0) == ($9_1 | 0)) { break block66 } $3 = $5_1 + 1 | 0; if (!(($6_1 | 0) != ($13_1 | 0) | HEAP8[$8_1 + $3 | 0] <= 0)) { $3 = $5_1 + 2 | 0; continue; } if (($27 | 0) >= 0) { continue } HEAP32[$16_1 >> 2] = $21_1; block68 : { if (($27 | 0) == -1) { break block68 } if (($345($16_1) | 0) == 65533) { break block68 } if (HEAPU8[$15_1 + 84 | 0] != 2) { break block69 } } $3 = 0; } $6_1 = 1; if (($5_1 | 0) <= 1) { $9_1 = 0; if (($5_1 | 0) != 1) { break block71 } if (HEAPU8[$8_1 | 0] == ($13_1 | 0)) { break block71 } } if (HEAPU8[$21_1 - 1 | 0] == 255) { break block65 } $11_1 = 0; $11_1 = HEAPU8[$21_1 + 1 | 0] | !$3 ? $11_1 : HEAPU8[$15_1 + 84 | 0] != 2; block73 : { $9_1 = $942($15_1, 118, $8_1); if (!$9_1) { break block73 } $6_1 = 0; $7_1 = HEAP32[$9_1 + 8 >> 2]; HEAP8[$7_1 + $5_1 | 0] = 0; $3 = 0; while (1) { if (!(($5_1 | 0) <= ($6_1 | 0))) { $6_1 = (HEAP8[$6_1 + $7_1 | 0] == ($13_1 | 0)) + $6_1 | 0; HEAP8[$3 + $7_1 | 0] = HEAPU8[$6_1 + $7_1 | 0]; $3 = $3 + 1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; $5_1 = $3 + $7_1 | 0; HEAP8[$5_1 | 0] = 0; block75 : { if (HEAPU8[$18_1 | 0] != 168) { break block75 } if (($971($18_1) | 0) != 66) { break block75 } if (HEAPU8[$18_1 + 7 | 0] & 3) { break block73 } $6_1 = HEAP32[$18_1 + 44 >> 2]; if (!$6_1 | HEAPU8[$6_1 + 43 | 0] != 1) { break block73 } } if (!(($303($7_1, $16_1, $3, 1) | 0) > 0 | ($3 | 0) == 1 & HEAPU8[$7_1 | 0] == 45)) { $5_1 = $5_1 - 1 | 0; $6_1 = HEAPU8[$5_1 | 0]; HEAP8[$5_1 | 0] = $6_1 + 1; $3 = $303($7_1, $16_1, $3, 1); HEAP8[$5_1 | 0] = $6_1; if (($3 | 0) <= 0) { break block73 } } $790($15_1, $9_1); $200($14); break block26; } $6_1 = 0; if (($22_1 | 0) != 157) { break block78 } $3 = HEAP32[$12_1 + 8 >> 2]; $5_1 = HEAP16[$19_1 + 32 >> 1]; HEAP32[$3 + 228 >> 2] = HEAP32[$3 + 228 >> 2] | (($5_1 | 0) > 31 ? -2147483648 : 1 << $5_1 - 1); if (!$11_1) { break block71 } if (!HEAPU8[HEAP32[$19_1 + 8 >> 2] + 1 | 0]) { break block78 } $5_1 = $893($12_1); $1129($12_1, $19_1, $5_1); $7_1 = 82740; if (!HEAPU8[HEAP32[$3 >> 2] + 87 | 0]) { $7_1 = (HEAP32[$3 + 104 >> 2] + Math_imul(HEAP32[$3 + 108 >> 2], 20) | 0) - 20 | 0 } HEAP32[$7_1 + 12 >> 2] = 0; $894($12_1, $5_1); break block78; } $3 = HEAP32[$16_1 >> 2] - $8_1 | 0; continue; }; } $6_1 = 1; $14 = 0; } $9_1 = 0; } $11_1 = 0; } $200($14); if ($6_1) { break block26 } $7_1 = HEAP32[HEAP32[$10_1 + 20 >> 2] + 24 >> 2]; $3 = $906($17_1, $9_1, 0); block80 : { $14 = $25 & 8; if ($14 | HEAPU8[HEAP32[$12_1 >> 2] + 87 | 0]) { break block80 } HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 1024; $4_1 = 0; while (1) { $6_1 = HEAP32[$9_1 + 8 >> 2] + $4_1 | 0; $5_1 = HEAPU8[$6_1 | 0]; if (!$5_1) { break block80 } HEAP8[$6_1 | 0] = $5_1 & (HEAPU8[$5_1 + 31424 | 0] ^ -1 | 223); HEAP8[HEAP32[$3 + 8 >> 2] + $4_1 | 0] = HEAPU8[$5_1 + 31040 | 0]; $4_1 = $4_1 + 1 | 0; continue; }; } if (!HEAPU8[$17_1 + 87 | 0]) { $5_1 = HEAP32[$3 + 8 >> 2]; $4_1 = ($48($5_1) + $5_1 | 0) - 1 | 0; if (!$14) { $5_1 = HEAPU8[$4_1 | 0]; HEAP8[$4_1 | 0] = HEAPU8[$5_1 + 31040 | 0]; $11_1 = ($5_1 | 0) != 64 ? $11_1 : 0; } while (1) { $5_1 = HEAPU8[$4_1 | 0]; if (!(($5_1 | 0) != 191 | HEAPU32[$3 + 8 >> 2] >= $4_1 >>> 0)) { HEAP8[$4_1 | 0] = 128; $4_1 = $4_1 - 1 | 0; continue; } break; }; HEAP8[$4_1 | 0] = $5_1 + 1; } $4_1 = $14 ? 33712 : 20451; $5_1 = $903($12_1, 58, $1246($12_1, $906($17_1, $7_1, 0), $4_1), $9_1); $1338($5_1, $10_1); $5_1 = $1269($1_1, $5_1, 259); $3 = $903($12_1, 57, $1246($12_1, $906($17_1, $7_1, 0), $4_1), $3); $1338($3, $10_1); $3 = $1269($1_1, $3, 259); $1319($0_1, $1_1, $5_1); $1319($0_1, $1_1, $3); $4_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; if (!$11_1) { break block26 } $1337($1_1, $5_1, $2_1); $1337($1_1, $3, $2_1); } $7_1 = HEAPU8[$10_1 | 0]; } block92 : { block96 : { block97 : { block94 : { block100 : { block101 : { block90 : { block85 : { block84 : { block86 : { block87 : { $3 = $7_1 & 255; switch ($3 - 50 | 0) { case 0: break block84; case 1: case 2: case 3: break block85; case 4: break block86; default: break block87; }; } if (($3 | 0) != 45) { break block85 } } block88 : { $5_1 = HEAP32[$10_1 + 12 >> 2]; $3 = $1119($5_1); if (($3 | 0) < 2) { break block88 } $9_1 = HEAP32[$10_1 + 16 >> 2]; if (($1119($9_1) | 0) != ($3 | 0) | !(HEAPU8[$9_1 + 5 | 0] & 16 ? !(HEAPU8[$5_1 + 5 | 0] & 16) : 1)) { break block88 } if (HEAPU8[$1_1 + 8 | 0] != 44) { break block88 } $4_1 = 0; while (1) { if (($3 | 0) == ($4_1 | 0)) { break block90 } $5_1 = $1120($12_1, HEAP32[$10_1 + 12 >> 2], $4_1, $3); $7_1 = $1120($12_1, HEAP32[$10_1 + 16 >> 2], $4_1, $3); $5_1 = $903($12_1, HEAPU8[$10_1 | 0], $5_1, $7_1); $1338($5_1, $10_1); $1319($0_1, $1_1, $1269($1_1, $5_1, 32769)); $4_1 = $4_1 + 1 | 0; continue; }; } if (($7_1 & 255) != 50) { break block85 } } if (HEAP32[$4_1 + 28 >> 2]) { break block85 } $4_1 = HEAP32[$10_1 + 12 >> 2]; if (!(HEAPU8[$10_1 + 5 | 0] & 16) | HEAPU8[$4_1 | 0] != 177) { break block85 } $3 = HEAP32[$10_1 + 20 >> 2]; if (!(!HEAP32[$3 + 52 >> 2] | HEAPU8[$3 + 5 | 0] & 2) | (HEAP32[$3 + 68 >> 2] | HEAPU8[$1_1 + 8 | 0] != 44)) { break block85 } $6_1 = 0; while (1) { if (($1119($4_1) | 0) <= ($6_1 | 0)) { break block92 } $3 = $1269($1_1, $10_1, 32770); $6_1 = $6_1 + 1 | 0; HEAP32[(HEAP32[$1_1 + 24 >> 2] + Math_imul($3, 48) | 0) + 28 >> 2] = $6_1; $1319($0_1, $1_1, $3); $1337($1_1, $3, $2_1); $4_1 = HEAP32[$10_1 + 12 >> 2]; continue; }; } if (HEAPU8[$1_1 + 8 | 0] != 44) { break block92 } $0_1 = $7_1 & 255; if (($0_1 | 0) == 172) { $3 = HEAP32[$10_1 + 20 >> 2]; if (!$3 | HEAP32[$3 >> 2] != 2) { break block94 } block95 : { $0_1 = HEAP32[$3 + 24 >> 2]; if (HEAPU8[$0_1 | 0] != 168 | HEAPU8[HEAP32[$0_1 + 44 >> 2] + 43 | 0] != 1) { break block95 } $5_1 = HEAP32[$10_1 + 8 >> 2]; $4_1 = 0; while (1) { if (($4_1 | 0) == 4) { break block95 } $7_1 = $4_1 << 3; $4_1 = $4_1 + 1 | 0; $7_1 = $7_1 + 51008 | 0; if ($67($5_1, HEAP32[$7_1 >> 2])) { continue } break; }; $3 = HEAP32[$3 + 8 >> 2]; $8_1 = HEAPU8[$7_1 + 4 | 0]; $6_1 = 1; break block96; } $0_1 = HEAP32[$3 + 8 >> 2]; if (HEAPU8[$0_1 | 0] != 168) { break block94 } $5_1 = HEAP32[$0_1 + 44 >> 2]; if (HEAPU8[$5_1 + 43 | 0] != 1) { break block94 } $5_1 = HEAP32[$684($17_1, $5_1) + 8 >> 2]; $4_1 = HEAP32[HEAP32[$5_1 >> 2] + 72 >> 2]; if (!$4_1) { break block94 } $8_1 = FUNCTION_TABLE[$4_1 | 0]($5_1, 2, HEAP32[$10_1 + 8 >> 2], $16_1, $16_1 + 12 | 0) | 0; if (($8_1 | 0) < 150) { break block94 } $3 = HEAP32[$3 + 24 >> 2]; $6_1 = 1; break block96; } if ($0_1 >>> 0 > 53) { break block94 } $8_1 = 0; $5_1 = ($7_1 & 255) - 46 | 0; if ($5_1 >>> 0 > 7) { break block97 } $3 = 0; $0_1 = 0; $6_1 = 0; if (!(1 << $5_1 & 193)) { break block96 } $5_1 = HEAP32[$10_1 + 16 >> 2]; $3 = HEAP32[$10_1 + 12 >> 2]; if (HEAPU8[$3 | 0] == 168) { $6_1 = HEAPU8[HEAP32[$3 + 44 >> 2] + 43 | 0] == 1 } if (!$5_1) { $0_1 = $3; $3 = 0; break block100; } if (HEAPU8[$5_1 | 0] != 168 | HEAPU8[HEAP32[$5_1 + 44 >> 2] + 43 | 0] != 1) { break block101 } $6_1 = $6_1 + 1 | 0; $0_1 = $5_1; break block100; } $0_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; HEAP16[$0_1 + 12 >> 1] = 8192; HEAP16[$0_1 + 10 >> 1] = HEAPU16[$0_1 + 10 >> 1] | 6; break block92; } $0_1 = $3; $3 = $5_1; } $8_1 = 68; block103 : { block102 : { $5_1 = $7_1 & 255; switch ($5_1 - 52 | 0) { case 0: break block102; case 1: break block96; default: break block103; }; } $8_1 = 70; break block96; } if (($5_1 | 0) != 46) { $8_1 = 0; break block96; } $8_1 = 69; break block96; } $8_1 = 0; } $3 = 0; $0_1 = 0; $6_1 = 0; } while (1) { $5_1 = $0_1; $0_1 = $3; if (($6_1 | 0) <= 0) { break block92 } $6_1 = $6_1 - 1 | 0; $3 = $1331($20_1, $3); $7_1 = i64toi32_i32$HIGH_BITS; $4_1 = $3; $3 = $5_1; if ($4_1 & $1331($20_1, $3) | i64toi32_i32$HIGH_BITS & $7_1) { continue } $3 = $903($12_1, 47, 0, $906($17_1, $0_1, 0)); if (!(!(HEAP8[$10_1 + 4 | 0] & 1) | !$3)) { HEAP32[$3 + 4 >> 2] = HEAP32[$3 + 4 >> 2] | 1; HEAP32[$3 + 36 >> 2] = HEAP32[$10_1 + 36 >> 2]; } $9_1 = $1269($1_1, $3, 3); $3 = HEAP32[$1_1 + 24 >> 2] + Math_imul($9_1, 48) | 0; HEAP32[$3 + 32 >> 2] = $4_1; HEAP32[$3 + 36 >> 2] = $7_1; HEAP32[$3 + 20 >> 2] = HEAP32[$5_1 + 28 >> 2]; $4_1 = HEAP16[$5_1 + 32 >> 1]; HEAP8[$3 + 15 | 0] = $8_1; HEAP16[$3 + 12 >> 1] = 64; HEAP32[$3 + 24 >> 2] = $4_1; $1337($1_1, $9_1, $2_1); $4_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 8; $7_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$3 + 40 >> 2] = HEAP32[$4_1 + 40 >> 2]; HEAP32[$3 + 44 >> 2] = $7_1; $3 = $5_1; continue; }; } $0_1 = HEAP32[$1_1 + 24 >> 2] + Math_imul($2_1, 48) | 0; $1_1 = HEAP32[$0_1 + 32 >> 2]; $2_1 = $23_1 | HEAP32[$0_1 + 36 >> 2]; HEAP32[$0_1 + 32 >> 2] = $1_1 | $24_1; HEAP32[$0_1 + 36 >> 2] = $2_1; } $0_1 = $16_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1320($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; $7_1 = HEAP32[$6_1 >> 2]; HEAP32[$5_1 + 12 >> 2] = 0; block1 : { block2 : { block : { if (!$1074($2_1, $5_1 + 12 | 0, $6_1)) { break block } $8_1 = HEAP32[$5_1 + 12 >> 2]; if (($8_1 | 0) < 0) { break block } $2_1 = $942($7_1, 156, 0); if (!$2_1) { break block1 } HEAP32[$2_1 + 8 >> 2] = $8_1; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 2048; break block2; } $2_1 = $942($7_1, 176, 0); if (!$2_1) { break block1 } HEAP32[$2_1 + 28 >> 2] = $1_1; } $1_1 = $903($6_1, 47, 0, $2_1); if (!$1_1) { break block1 } $1_1 = $1269($0_1, $1_1, 3); $0_1 = HEAP32[$0_1 + 24 >> 2] + Math_imul($1_1, 48) | 0; HEAP8[$0_1 + 15 | 0] = $4_1; HEAP16[$0_1 + 12 >> 1] = 64; HEAP32[$0_1 + 20 >> 2] = $3; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1321($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0, $44_1 = 0, $45_1 = 0, $46_1 = 0, $47_1 = 0, $48_1 = 0, $49 = 0, $50_1 = 0, $51_1 = 0; $20_1 = global$0 - 16 | 0; $7_1 = $20_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; block19 : { block1 : { $35_1 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; if (HEAPU8[$35_1 + 80 | 0] & 64 ? $4_1 : 0) { break block1 } $19_1 = HEAPU16[$1_1 >> 1]; if ($19_1 >>> 0 > 63) { break block1 } $36_1 = $3 & 2051 ? 387 : 386; $44_1 = $0_1 + 496 | 0; $31_1 = $1_1 + 16 | 0; $45_1 = $3 & 64; $46_1 = $3 & 192; $47_1 = $0_1 + 80 | 0; $32_1 = $1_1 + 8 | 0; $37_1 = $3 & 128; $48_1 = $3 & 2048; $7_1 = $19_1 & 31; if (($19_1 & 63) >>> 0 >= 32) { $7_1 = -1 << $7_1; $15_1 = 0; } else { $15_1 = -1 << $7_1; $7_1 = $15_1 | (1 << $7_1) - 1 & -1 >>> 32 - $7_1; } $33_1 = $15_1 ^ -1; $30_1 = $7_1 ^ -1; $38_1 = $4_1; $15_1 = 1; while (1) { block8 : { block5 : { block40 : { block39 : { block15 : { block38 : { block28 : { block7 : { if (!(!($15_1 & 255) | (($16_1 | 0) == ($30_1 | 0) & $11_1 >>> 0 >= $33_1 >>> 0 | $16_1 >>> 0 > $30_1 >>> 0) | (!$25 & $22_1 >>> 0 > $38_1 >>> 0 | ($25 | 0) != 0))) { if ($22_1 | $25) { $39_1 = $39_1 | HEAP32[$14 + 8 >> 2]; $40_1 = $40_1 | HEAP32[$14 + 12 >> 2]; } $14 = $5_1; if (!(!$25 & $22_1 >>> 0 >= $38_1 >>> 0 | ($25 | 0) != 0)) { $14 = HEAP32[HEAP32[$2_1 + 24 >> 2] + ($22_1 << 2) >> 2]; if ($48_1) { break block5 } } if (HEAPU8[$14 + 41 | 0] & 4) { if (($3 & 640) != 128 & HEAPU8[$14 + 29 | 0] != 0 | ($11_1 | 0) == ($33_1 | 0) & ($16_1 | 0) == ($30_1 | 0)) { break block7 } break block8; } if ($37_1) { HEAP16[$14 + 30 >> 1] = 0 } $13_1 = $39_1 ^ -1; $17_1 = $40_1 ^ -1; $26_1 = HEAP32[(HEAP32[$0_1 + 4 >> 2] + Math_imul(HEAPU8[$14 + 16 | 0], 48) | 0) + 24 >> 2]; $9_1 = 0; $12_1 = 0; while (1) { if (!(!$12_1 & ($9_1 | 0) == ($19_1 | 0))) { $4_1 = $9_1 & 31; if (($9_1 & 63) >>> 0 >= 32) { $7_1 = 1 << $4_1; $8_1 = 0; } else { $8_1 = 1 << $4_1; $7_1 = $8_1 - 1 & 1 >>> 32 - $4_1; } $10_1 = $8_1; block11 : { if ($10_1 & $11_1 | $7_1 & $16_1) { break block11 } $23_1 = ($9_1 << 4) + $32_1 | 0; $8_1 = $1063(HEAP32[$23_1 >> 2]); if (!$8_1) { break block11 } block12 : { switch (HEAPU8[$8_1 | 0] - 168 | 0) { case 0: case 2: break block12; default: break block11; }; } if (HEAP32[$8_1 + 28 >> 2] != ($26_1 | 0)) { break block11 } $18_1 = $1273($47_1, $26_1, HEAP16[$8_1 + 32 >> 1], $13_1, $17_1, $36_1, 0); if (!$18_1) { break block11 } $24_1 = HEAPU16[$18_1 + 12 >> 1]; if (($24_1 | 0) == 1) { $27 = HEAPU16[$14 + 44 >> 1]; $4_1 = 0; while (1) { if (($4_1 | 0) == ($27 | 0)) { break block11 } $21_1 = $4_1 << 2; $4_1 = $4_1 + 1 | 0; if (($18_1 | 0) != HEAP32[$21_1 + HEAP32[$14 + 52 >> 2] >> 2]) { continue } break; }; } if (!(!($24_1 & 130) | HEAP16[$8_1 + 32 >> 1] < 0)) { $4_1 = HEAP32[$0_1 >> 2]; $8_1 = $1267($4_1, HEAP32[$23_1 >> 2]); $4_1 = $369($4_1, HEAP32[$18_1 >> 2]); if (!$4_1) { break block11 } if ($67(HEAP32[$8_1 >> 2], HEAP32[$4_1 >> 2])) { break block11 } } $11_1 = $11_1 | $10_1; $16_1 = $7_1 | $16_1; } $9_1 = $9_1 + 1 | 0; $12_1 = $9_1 ? $12_1 : $12_1 + 1 | 0; continue; } break; }; HEAP32[$20_1 + 8 >> 2] = $11_1; HEAP32[$20_1 + 12 >> 2] = $16_1; $4_1 = HEAP32[$14 + 40 >> 2]; if ($4_1 & 4096) { break block15 } block18 : { if ($4_1 & 256) { block17 : { if (!HEAP32[$14 + 36 >> 2] | HEAPU8[$35_1 + 83 | 0] & 16) { break block17 } $4_1 = 0; $8_1 = 0; $17_1 = 0; $12_1 = $20_1 + 8 | 0; $18_1 = HEAP32[$12_1 >> 2]; $13_1 = HEAP32[$12_1 + 4 >> 2]; $10_1 = HEAP32[$14 + 36 >> 2]; while (1) { $9_1 = $4_1; $11_1 = $8_1; $8_1 = $8_1 + 1 | 0; $4_1 = $8_1 ? $4_1 : $4_1 + 1 | 0; $7_1 = $11_1 & 31; if (($11_1 & 63) >>> 0 >= 32) { $7_1 = $13_1 >>> $7_1 | 0 } else { $7_1 = ((1 << $7_1) - 1 & $13_1) << 32 - $7_1 | $18_1 >>> $7_1 } if ($7_1 & 1) { continue } break; }; $4_1 = HEAP32[$10_1 >> 2]; $16_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $23_1 = $1_1 + 8 | 0; $24_1 = $10_1 + 8 | 0; $4_1 = $22_1 & 31; if (($22_1 & 63) >>> 0 >= 32) { $8_1 = 1 << $4_1; $7_1 = 0; } else { $7_1 = 1 << $4_1; $8_1 = $7_1 - 1 & 1 >>> 32 - $4_1; } $27 = $7_1; $4_1 = 0; block13 : { while (1) { if (($4_1 | 0) == ($16_1 | 0)) { $7_1 = $16_1; break block13; } block2 : { $7_1 = HEAP32[$1_1 >> 2]; $10_1 = $7_1 >> 31; if (($10_1 | 0) <= ($9_1 | 0) & $7_1 >>> 0 <= $11_1 >>> 0 | ($9_1 | 0) > ($10_1 | 0)) { break block2 } $21_1 = ($4_1 << 4) + $24_1 | 0; $29_1 = HEAPU16[$21_1 + 12 >> 1]; if (!$29_1) { break block2 } $7_1 = $4_1; block3 : { $28_1 = ($11_1 << 4) + $23_1 | 0; $10_1 = HEAP32[$28_1 >> 2]; switch (HEAPU8[$10_1 | 0] - 168 | 0) { case 0: case 2: break block3; default: break block13; }; } if (HEAP32[$10_1 + 28 >> 2] != ($26_1 | 0) | HEAP16[$10_1 + 32 >> 1] != ($29_1 - 1 | 0)) { break block2 } block4 : { if (HEAPU8[$0_1 + 40 | 0] & 64) { break block4 } $10_1 = HEAPU8[$21_1 + 8 | 0]; $21_1 = HEAPU8[$28_1 + 8 | 0]; $7_1 = $10_1 ^ $21_1; if ($7_1 & 2) { break block2 } if ($4_1) { $7_1 = 1; if (($21_1 & 1) == ($17_1 ^ $10_1 & 1)) { break block4 } break block13; } $17_1 = 0; if (!($7_1 & 1)) { break block4 } if (HEAPU8[$14 + 43 | 0] & 2) { $7_1 = 0; break block13; } $7_1 = $8_1 | HEAP32[$6_1 + 4 >> 2]; HEAP32[$6_1 >> 2] = $27 | HEAP32[$6_1 >> 2]; HEAP32[$6_1 + 4 >> 2] = $7_1; $18_1 = HEAP32[$12_1 >> 2]; $13_1 = HEAP32[$12_1 + 4 >> 2]; $17_1 = 1; } $7_1 = $11_1 & 31; if (($11_1 & 63) >>> 0 >= 32) { $7_1 = 1 << $7_1; $10_1 = 0; } else { $10_1 = 1 << $7_1; $7_1 = $10_1 - 1 & 1 >>> 32 - $7_1; } $18_1 = $10_1 | $18_1; $7_1 = $7_1 | $13_1; $13_1 = $7_1; HEAP32[$12_1 >> 2] = $18_1; HEAP32[$12_1 + 4 >> 2] = $7_1; $11_1 = $11_1 + 1 | 0; $9_1 = $11_1 ? $9_1 : $9_1 + 1 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; $7_1 = $4_1; } if (!$7_1) { break block17 } $13_1 = 0; $23_1 = 0; $15_1 = 0; $4_1 = 0; break block18; } $13_1 = 0; $23_1 = 0; $4_1 = 1; break block18; } $13_1 = HEAP32[$14 + 32 >> 2]; $7_1 = 0; if (!$13_1 | HEAPU8[$13_1 + 55 | 0] & 4) { break block19 } $15_1 = !($4_1 & 32768) & HEAPU8[$13_1 + 54 | 0] != 0; $23_1 = HEAPU16[$13_1 + 50 >> 1]; $4_1 = HEAPU16[$13_1 + 52 >> 1]; } $49 = $4_1; $4_1 = $22_1 & 31; if (($22_1 & 63) >>> 0 >= 32) { $7_1 = 1 << $4_1; $11_1 = 0; } else { $11_1 = 1 << $4_1; $7_1 = $11_1 - 1 & 1 >>> 32 - $4_1; } $50_1 = $11_1; $18_1 = $7_1; $7_1 = 0; $11_1 = HEAP32[$20_1 + 8 >> 2]; $16_1 = HEAP32[$20_1 + 12 >> 2]; $24_1 = 0; $29_1 = 0; $27 = 0; while (1) { block23 : { if (($7_1 | 0) != ($49 | 0)) { $4_1 = 1; $9_1 = HEAPU16[$14 + 24 >> 1]; block21 : { if ($9_1 >>> 0 <= $7_1 >>> 0 | HEAPU16[$14 + 46 >> 1] > $7_1 >>> 0) { break block21 } $12_1 = HEAP32[$14 + 52 >> 2]; $17_1 = HEAP32[$12_1 + ($7_1 << 2) >> 2]; $8_1 = HEAPU16[$17_1 + 12 >> 1]; if ($8_1 & $36_1) { $15_1 = $8_1 & 384 ? 0 : $15_1; break block23; } if (!($8_1 & 1)) { break block21 } $10_1 = $9_1 - 1 | 0; $17_1 = HEAP32[$17_1 >> 2]; $8_1 = $7_1; while (1) { if (($8_1 | 0) == ($10_1 | 0)) { break block21 } $8_1 = $8_1 + 1 | 0; if (($17_1 | 0) != HEAP32[HEAP32[$12_1 + ($8_1 << 2) >> 2] >> 2]) { continue } break; }; $4_1 = 0; } block25 : { if (!$13_1) { $8_1 = -1; $17_1 = 0; break block25; } $8_1 = HEAPU16[HEAP32[$13_1 + 4 >> 2] + ($7_1 << 1) >> 1]; $12_1 = HEAP32[$13_1 + 12 >> 2]; $8_1 = (($8_1 | 0) == HEAPU16[$12_1 + 32 >> 1] ? -1 : $8_1) << 16 >> 16; $17_1 = HEAP8[HEAP32[$13_1 + 28 >> 2] + $7_1 | 0] & 1; if (!($15_1 & 255)) { $15_1 = 0; break block25; } if (($8_1 | 0) >= 0) { if ($7_1 >>> 0 < $9_1 >>> 0) { break block25 } $15_1 = HEAPU8[(HEAP32[$12_1 + 4 >> 2] + Math_imul($8_1, 12) | 0) + 4 | 0] & 15 ? $15_1 : 0; break block25; } $15_1 = ($8_1 | 0) != -2 ? $15_1 : 0; } $9_1 = 0; $12_1 = 0; while (1) { if (!($4_1 & 255)) { break block28 } $41_1 = !$12_1 & $9_1 >>> 0 >= $19_1 >>> 0 | ($12_1 | 0) != 0; if ($41_1) { break block28 } $10_1 = $9_1 & 31; block29 : { if (($9_1 & 63) >>> 0 >= 32) { $10_1 = $16_1 >>> $10_1 | 0 } else { $10_1 = ((1 << $10_1) - 1 & $16_1) << 32 - $10_1 | $11_1 >>> $10_1 } if ($10_1 & 1) { break block29 } $21_1 = $9_1 << 4; $42_1 = $21_1 + $32_1 | 0; $28_1 = HEAP32[$42_1 >> 2]; $10_1 = $1063($28_1); if (!$10_1) { break block29 } $4_1 = $46_1 ? $4_1 : 0; block33 : { block32 : { if (($8_1 | 0) >= -1) { block31 : { switch (HEAPU8[$10_1 | 0] - 168 | 0) { case 0: case 2: break block31; default: break block29; }; } if (HEAP32[$10_1 + 28 >> 2] != ($26_1 | 0) | HEAP16[$10_1 + 32 >> 1] != ($8_1 | 0)) { break block29 } if (($8_1 | 0) != -1) { break block32 } break block33; } if ($1342($10_1, HEAP32[(HEAP32[$13_1 + 40 >> 2] + ($7_1 << 4) | 0) + 8 >> 2], $26_1)) { break block29 } $28_1 = HEAP32[$42_1 >> 2]; } if ($67(HEAP32[$1267(HEAP32[$0_1 >> 2], $28_1) >> 2], HEAP32[HEAP32[$13_1 + 32 >> 2] + ($7_1 << 2) >> 2])) { break block29 } } if ($37_1) { HEAP16[$14 + 30 >> 1] = $7_1 + 1 } block35 : { if ($45_1 | $41_1) { break block35 } if ($27) { $27 = 1; if ((($17_1 ^ $29_1) & 255) == (HEAP8[$21_1 + $31_1 | 0] & 1)) { break block35 } break block28; } $27 = 1; $4_1 = HEAP8[$21_1 + $31_1 | 0] & 1; $29_1 = $4_1 ^ $17_1; if (($4_1 | 0) == ($17_1 | 0)) { break block35 } $4_1 = $18_1 | HEAP32[$6_1 + 4 >> 2]; HEAP32[$6_1 >> 2] = $50_1 | HEAP32[$6_1 >> 2]; HEAP32[$6_1 + 4 >> 2] = $4_1; } if (HEAPU8[$21_1 + $31_1 | 0] & 2) { if (HEAPU16[$14 + 24 >> 1] != ($7_1 | 0)) { break block28 } HEAP32[$14 + 40 >> 2] = HEAP32[$14 + 40 >> 2] | 524288; } $24_1 = ($8_1 | 0) == -1 ? 1 : $24_1; $4_1 = $9_1 & 31; if (($9_1 & 63) >>> 0 >= 32) { $12_1 = 1 << $4_1; $8_1 = 0; } else { $8_1 = 1 << $4_1; $12_1 = $8_1 - 1 & 1 >>> 32 - $4_1; } $11_1 = $8_1 | $11_1; $16_1 = $12_1 | $16_1; break block23; } $9_1 = $9_1 + 1 | 0; $12_1 = $9_1 ? $12_1 : $12_1 + 1 | 0; continue; }; } HEAP32[$20_1 + 8 >> 2] = $11_1; HEAP32[$20_1 + 12 >> 2] = $16_1; break block38; } $7_1 = $7_1 + 1 | 0; continue; }; } if (($11_1 | 0) != ($33_1 | 0) | ($16_1 | 0) != ($30_1 | 0)) { break block8 } } $7_1 = $19_1; break block19; } HEAP32[$20_1 + 8 >> 2] = $11_1; HEAP32[$20_1 + 12 >> 2] = $16_1; $15_1 = $7_1 ? ($7_1 >>> 0 >= $23_1 >>> 0 ? $15_1 : 0) : 0; } $4_1 = 1; if ($24_1 & 255) { break block39 } } if (!($15_1 & 255)) { break block40 } $4_1 = $15_1; } $15_1 = $4_1; $4_1 = $51_1 | HEAP32[$14 + 12 >> 2]; $51_1 = $4_1; $43_1 = $43_1 | HEAP32[$14 + 8 >> 2]; $8_1 = $43_1 ^ -1; $26_1 = $4_1 ^ -1; $9_1 = 0; $12_1 = 0; while (1) { if (!(!$12_1 & ($9_1 | 0) == ($19_1 | 0))) { $4_1 = $9_1 & 31; if (($9_1 & 63) >>> 0 >= 32) { $7_1 = 1 << $4_1; $4_1 = 0; } else { $18_1 = 1 << $4_1; $7_1 = $18_1 - 1 & 1 >>> 32 - $4_1; $4_1 = $18_1; } block42 : { if ($4_1 & $11_1 | $7_1 & $16_1) { break block42 } $18_1 = HEAP32[($9_1 << 4) + $32_1 >> 2]; $13_1 = $1331($44_1, $18_1); $17_1 = i64toi32_i32$HIGH_BITS; block44 : { if (!($13_1 | $17_1)) { if ($944(0, $18_1)) { break block44 } break block42; } if ($8_1 & $13_1 | $17_1 & $26_1) { break block42 } } $11_1 = $4_1 | $11_1; $16_1 = $7_1 | $16_1; } $9_1 = $9_1 + 1 | 0; $12_1 = $9_1 ? $12_1 : $12_1 + 1 | 0; continue; } break; }; HEAP32[$20_1 + 8 >> 2] = $11_1; HEAP32[$20_1 + 12 >> 2] = $16_1; break block5; } $15_1 = 0; } $22_1 = $22_1 + 1 | 0; $25 = $22_1 ? $25 : $25 + 1 | 0; continue; } break; }; $7_1 = 255; if ($15_1 & 255) { break block19 } while (1) { if ($19_1 >>> 0 < 2 & ($34_1 | 0) <= 0 | ($34_1 | 0) < 0) { break block1 } $0_1 = $34_1 - 1 | 0; $19_1 = $19_1 - 1 | 0; $34_1 = ($19_1 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; $0_1 = $19_1 & 31; if (($19_1 & 63) >>> 0 >= 32) { $1_1 = -1 << $0_1; $2_1 = 0; } else { $2_1 = -1 << $0_1; $1_1 = $2_1 | (1 << $0_1) - 1 & -1 >>> 32 - $0_1; } if ((($2_1 | $11_1) & ($1_1 | $16_1)) != -1) { continue } break; }; $7_1 = $19_1; break block19; } $7_1 = 0; } $1_1 = $7_1; $0_1 = $20_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 << 24 >> 24; } function $1322($0_1) { var $1_1 = 0; if (($0_1 | 0) >= 11) { $1_1 = $433($0_1, $0_1 >> 31) - 33 | 0 } return $1_1 << 16 >> 16; } function $1324($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block1 : { if (!$1_1) { break block1 } $5_1 = $1_1 + 8 | 0; while (1) { if (HEAP32[$1_1 >> 2] <= ($2_1 | 0)) { break block1 } $3 = $1331($0_1, HEAP32[($2_1 << 4) + $5_1 >> 2]) | $3; $4_1 = $4_1 | i64toi32_i32$HIGH_BITS; $2_1 = $2_1 + 1 | 0; continue; }; } i64toi32_i32$HIGH_BITS = $4_1; return $3; } function $1325($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; while (1) { $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { HEAP32[$1_1 >> 2] = HEAP32[$2_1 + 20 >> 2]; $11($0_1, HEAP32[$2_1 >> 2]); $13($0_1, $2_1); continue; } break; }; } function $1326($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block : { if (!(HEAPU8[$0_1 + 12 | 0] & 130) | HEAP32[$0_1 + 20 >> 2] != HEAP32[$1_1 + 16 >> 2]) { break block } if (HEAPU8[$1_1 + 12 | 0] & 88) { if (!$1346($0_1, $1_1)) { break block } } if (HEAP32[$0_1 + 32 >> 2] & $2_1 | $3 & HEAP32[$0_1 + 36 >> 2]) { break block } $2_1 = HEAP32[$0_1 + 24 >> 2]; if (($2_1 | 0) < 0) { break block } if (!$1345(HEAP32[$0_1 >> 2], HEAP8[(HEAP32[HEAP32[$1_1 + 8 >> 2] + 4 >> 2] + Math_imul($2_1, 12) | 0) + 5 | 0])) { break block } $0_1 = HEAP32[$1_1 + 8 >> 2] + 8 | 0; label : while (1) { block1 : { $1_1 = HEAP32[$0_1 >> 2]; if (!$1_1) { $3 = 1; break block1; } $3 = HEAPU16[$1_1 + 50 >> 1]; $0_1 = 0; while (1) { block3 : { block2 : { if (($0_1 | 0) == ($3 | 0)) { break block2 } $4_1 = $0_1 << 1; if (HEAP16[$4_1 + HEAP32[$1_1 + 4 >> 2] >> 1] != ($2_1 | 0)) { break block3 } $3 = 0; if (!$0_1) { break block1 } if (!(HEAPU8[$1_1 + 55 | 0] & 128)) { break block2 } if (HEAP16[(HEAP32[$1_1 + 8 >> 2] + $4_1 | 0) + 2 >> 1] > 20) { break block1 } } $0_1 = $1_1 + 20 | 0; continue label; } $0_1 = $0_1 + 1 | 0; continue; }; } break; }; $4_1 = $3; } return $4_1; } function $1327($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = 0; block : { if (HEAPU16[$1_1 + 48 >> 1] >= ($2_1 | 0)) { break block } $4_1 = $2_1 + 7 & -8; $2_1 = $325($0_1, $4_1 << 2, 0); $3 = 7; if (!$2_1) { break block } $3 = HEAPU16[$1_1 + 48 >> 1] << 2; if ($3) { wasm2js_memory_copy($2_1, HEAP32[$1_1 + 52 >> 2], $3) } $3 = HEAP32[$1_1 + 52 >> 2]; if (($3 | 0) != ($1_1 + 60 | 0)) { $13($0_1, $3) } HEAP16[$1_1 + 48 >> 1] = $4_1; HEAP32[$1_1 + 52 >> 2] = $2_1; $3 = 0; } return $3; } function $1328($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 176 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $6_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = HEAPU8[$2_1 + 60 | 0]; $5_1 = HEAP32[$0_1 >> 2]; HEAP16[$3 + 172 >> 1] = 256; HEAP32[$3 + 168 >> 2] = 0; HEAP32[$3 + 160 >> 2] = 100; HEAP32[$3 + 164 >> 2] = 1e9; HEAP32[$3 + 152 >> 2] = $5_1; $4_1 = ($1_1 + Math_imul($4_1, 48) | 0) + 8 | 0; HEAP32[$3 + 32 >> 2] = $4_1; HEAP32[$3 + 156 >> 2] = $3 + 48; $5_1 = $3 + 152 | 0; $46($5_1, 27783, $3 + 32 | 0); block2 : { block1 : { $1_1 = HEAP32[$2_1 + 80 >> 2]; if (HEAP8[$1_1 + 41 | 0] & 1) { $1_1 = HEAP32[$4_1 + 8 >> 2]; $2_1 = HEAP16[$1_1 + 32 >> 1]; if (($2_1 | 0) < 0) { break block1 } HEAP32[$3 + 16 >> 2] = HEAP32[HEAP32[$1_1 + 4 >> 2] + Math_imul($2_1, 12) >> 2]; $46($5_1, 21211, $3 + 16 | 0); break block2; } $2_1 = HEAPU16[$1_1 + 46 >> 1]; while (1) { if (HEAPU16[$1_1 + 24 >> 1] <= $2_1 >>> 0) { break block2 } $4_1 = $1365(HEAP32[$1_1 + 32 >> 2], $2_1); if ($2_1 >>> 0 > HEAPU16[$1_1 + 46 >> 1]) { $36($3 + 152 | 0, 30651, 5) } HEAP32[$3 >> 2] = $4_1; $46($3 + 152 | 0, 21211, $3); $2_1 = $2_1 + 1 | 0; continue; }; } $46($3 + 152 | 0, 21232, 0); } $1_1 = $3 + 152 | 0; $36($1_1, 27781, 1); $1_1 = $57($1_1); $859($6_1, 188, HEAP32[$6_1 + 108 >> 2], HEAP32[$0_1 + 236 >> 2], 0, $1_1, -6); $0_1 = $3 + 176 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1329($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 12 >> 2]; if (($1_1 | 0) > 0) { $2_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] >> 2] >> 2]; $0_1 = HEAP32[$0_1 + 24 >> 2]; $3 = ($0_1 + Math_imul($1_1, 48) | 0) - 48 | 0; while (1) { $1_1 = HEAPU16[$0_1 + 10 >> 1]; if ($1_1 & 1) { $11($2_1, HEAP32[$0_1 >> 2]); $1_1 = HEAPU16[$0_1 + 10 >> 1]; } if ($1_1 & 48) { $1_1 = HEAP32[$0_1 + 24 >> 2]; $1329($1_1); $10($2_1, $1_1); } $1_1 = ($0_1 | 0) != ($3 | 0); $0_1 = $0_1 + 48 | 0; if ($1_1) { continue } break; }; } } function $1330($0_1, $1_1) { $1281($0_1, $1_1); $16($0_1, $1_1); } function $1331($0_1, $1_1) { if (!$1_1) { i64toi32_i32$HIGH_BITS = 0; return 0; } $0_1 = $1333($0_1, $1_1); return $0_1; } function $1332($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; while (1) { if ($1_1) { $7_1 = HEAP32[$1_1 + 32 >> 2]; $2_1 = $1324($0_1, HEAP32[$1_1 + 28 >> 2]); $3 = i64toi32_i32$HIGH_BITS; $2_1 = $1324($0_1, HEAP32[$1_1 + 40 >> 2]) | $2_1; $3 = i64toi32_i32$HIGH_BITS | $3; $2_1 = $1324($0_1, HEAP32[$1_1 + 48 >> 2]) | $2_1; $3 = i64toi32_i32$HIGH_BITS | $3; $2_1 = $1331($0_1, HEAP32[$1_1 + 36 >> 2]) | $2_1; $3 = i64toi32_i32$HIGH_BITS | $3; $4_1 = $4_1 | ($1331($0_1, HEAP32[$1_1 + 44 >> 2]) | $2_1); $5_1 = $5_1 | (i64toi32_i32$HIGH_BITS | $3); block1 : { if (!$7_1) { break block1 } $8_1 = $7_1 + 8 | 0; $3 = 0; while (1) { if (HEAP32[$7_1 >> 2] <= ($3 | 0)) { break block1 } $2_1 = Math_imul($3, 48) + $8_1 | 0; $6_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; if ($6_1 & 4) { $4_1 = $1332($0_1, HEAP32[HEAP32[$2_1 + 44 >> 2] >> 2]) | $4_1; $6_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; $5_1 = $5_1 | i64toi32_i32$HIGH_BITS; } if (!($6_1 & 2048)) { $4_1 = $1331($0_1, HEAP32[$2_1 + 40 >> 2]) | $4_1; $6_1 = HEAPU8[$2_1 + 13 | 0] | HEAPU8[$2_1 + 14 | 0] << 8; $5_1 = $5_1 | i64toi32_i32$HIGH_BITS; } if ($6_1 & 8) { $4_1 = $1324($0_1, HEAP32[$2_1 + 32 >> 2]) | $4_1; $5_1 = $5_1 | i64toi32_i32$HIGH_BITS; } $3 = $3 + 1 | 0; continue; }; } $1_1 = HEAP32[$1_1 + 52 >> 2]; continue; } break; }; i64toi32_i32$HIGH_BITS = $5_1; return $4_1; } function $1333($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$1_1 + 4 >> 2]; if (!($2_1 & 32 | HEAPU8[$1_1 | 0] != 168)) { return $1277($0_1, HEAP32[$1_1 + 28 >> 2]) } if ($2_1 & 8454144) { $0_1 = 0 } else { $2_1 = 0; if (HEAPU8[$1_1 | 0] == 179) { $4_1 = $1277($0_1, HEAP32[$1_1 + 28 >> 2]); $2_1 = i64toi32_i32$HIGH_BITS; } $3 = HEAP32[$1_1 + 12 >> 2]; if ($3) { $4_1 = $1333($0_1, $3) | $4_1; $2_1 = $2_1 | i64toi32_i32$HIGH_BITS; } $3 = HEAP32[$1_1 + 16 >> 2]; block3 : { if ($3) { $4_1 = $1333($0_1, $3) | $4_1; $2_1 = $2_1 | i64toi32_i32$HIGH_BITS; break block3; } $3 = HEAP32[$1_1 + 4 >> 2]; if ($3 & 4096) { if ($3 & 64) { HEAP32[$0_1 >> 2] = 1 } $4_1 = $1332($0_1, HEAP32[$1_1 + 20 >> 2]) | $4_1; $2_1 = $2_1 | i64toi32_i32$HIGH_BITS; break block3; } $3 = HEAP32[$1_1 + 20 >> 2]; if (!$3) { break block3 } $4_1 = $1324($0_1, $3) | $4_1; $2_1 = $2_1 | i64toi32_i32$HIGH_BITS; } block7 : { block6 : { switch (HEAPU8[$1_1 | 0] - 169 | 0) { case 0: case 3: break block6; default: break block7; }; } if (!(HEAP8[$1_1 + 7 | 0] & 1)) { break block7 } $3 = $1324($0_1, HEAP32[HEAP32[$1_1 + 44 >> 2] + 8 >> 2]); $5_1 = i64toi32_i32$HIGH_BITS; $3 = $1324($0_1, HEAP32[HEAP32[$1_1 + 44 >> 2] + 12 >> 2]) | $3; $5_1 = i64toi32_i32$HIGH_BITS | $5_1; $4_1 = $1331($0_1, HEAP32[HEAP32[$1_1 + 44 >> 2] + 40 >> 2]) | $3 | $4_1; $2_1 = $2_1 | (i64toi32_i32$HIGH_BITS | $5_1); } i64toi32_i32$HIGH_BITS = $2_1; $0_1 = i64toi32_i32$HIGH_BITS; } i64toi32_i32$HIGH_BITS = $0_1; return $4_1; } function $1334($0_1) { if ($0_1 >>> 0 > 58) { return 0 } if ($0_1 >>> 0 > 53) { return 1 } return ($0_1 | 0) == 45 | ($0_1 & 62) == 50; } function $1335($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = HEAPU8[$2_1 | 0]; if (!(($5_1 | 0) != 177 | $3 - 55 >>> 0 > 3)) { $2_1 = HEAP32[HEAP32[$2_1 + 20 >> 2] + 8 >> 2]; $5_1 = HEAPU8[$2_1 | 0]; } block2 : { if (($5_1 | 0) != 168) { $3 = HEAP32[$0_1 >> 2]; $6_1 = ($3 | 0) > 0 ? $3 : 0; $8_1 = $0_1 + 16 | 0; $5_1 = 0; while (1) { if (($5_1 | 0) == ($6_1 | 0)) { break block2 } $3 = HEAP32[Math_imul($5_1, 48) + $8_1 >> 2] + 8 | 0; block3 : { while (1) { $4_1 = HEAP32[$3 >> 2]; if (!$4_1) { break block3 } $3 = $4_1 + 20 | 0; if (!HEAP32[$4_1 + 40 >> 2]) { continue } break; }; $8_1 = $0_1 + 8 | 0; __inlined_func$1341$133 : { while (1) { $4_1 = Math_imul($5_1, 48) + $8_1 | 0; $3 = HEAP32[$4_1 + 8 >> 2] + 8 | 0; $6_1 = HEAP32[$4_1 + 16 >> 2]; while (1) { $4_1 = HEAP32[$3 >> 2]; if ($4_1) { block1 : { if (!HEAP32[$4_1 + 40 >> 2]) { break block1 } $3 = 0; while (1) { if (HEAPU16[$4_1 + 50 >> 1] <= $3 >>> 0) { break block1 } block24 : { if (HEAPU16[HEAP32[$4_1 + 4 >> 2] + ($3 << 1) >> 1] != 65534) { break block24 } $7_1 = $3 << 4; if ($1342($2_1, HEAP32[($7_1 + HEAP32[$4_1 + 40 >> 2] | 0) + 8 >> 2], $6_1)) { break block24 } if ($944(0, HEAP32[(HEAP32[$4_1 + 40 >> 2] + $7_1 | 0) + 8 >> 2])) { break block24 } HEAP32[$1_1 + 4 >> 2] = -2; HEAP32[$1_1 >> 2] = $6_1; $0_1 = 1; break __inlined_func$1341$133; } $3 = $3 + 1 | 0; continue; }; } $3 = $4_1 + 20 | 0; continue; } break; }; $5_1 = $5_1 + 1 | 0; if (($5_1 | 0) < HEAP32[$0_1 >> 2]) { continue } break; }; $0_1 = 0; } return $0_1; } $5_1 = $5_1 + 1 | 0; continue; }; } HEAP32[$1_1 >> 2] = HEAP32[$2_1 + 28 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP16[$2_1 + 32 >> 1]; $7_1 = 1; } return $7_1; } function $1336($0_1) { if ($0_1 >>> 0 >= 54) { $0_1 = 2 << $0_1 - 54 } else { $0_1 = ($0_1 | 0) == 50 ? 1 : ($0_1 | 0) == 51 ? 256 : 128 } return $0_1 & 65535; } function $1337($0_1, $1_1, $2_1) { $0_1 = HEAP32[$0_1 + 24 >> 2]; $1_1 = $0_1 + Math_imul($1_1, 48) | 0; HEAP32[$1_1 + 16 >> 2] = $2_1; $0_1 = $0_1 + Math_imul($2_1, 48) | 0; HEAP16[$1_1 + 8 >> 1] = HEAPU16[$0_1 + 8 >> 1]; HEAP8[$0_1 + 14 | 0] = HEAPU8[$0_1 + 14 | 0] + 1; } function $1338($0_1, $1_1) { var $2_1 = 0; block : { if (!$0_1) { break block } $2_1 = HEAP32[$1_1 + 4 >> 2] & 3; if (!$2_1) { break block } HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | $2_1; HEAP32[$0_1 + 36 >> 2] = HEAP32[$1_1 + 36 >> 2]; } } function $1339($0_1, $1_1) { var $2_1 = 0; if (HEAPU16[$0_1 + 12 >> 1] != 1024) { return $1_1 ? 0 : $0_1 } $0_1 = HEAP32[$0_1 + 24 >> 2]; if (($1_1 | 0) < HEAP32[$0_1 + 12 >> 2]) { $2_1 = HEAP32[$0_1 + 24 >> 2] + Math_imul($1_1, 48) | 0 } return $2_1; } function $1342($0_1, $1_1, $2_1) { return $1121(0, $1007($0_1), $1007($1_1), $2_1); } function $1345($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = $971(HEAP32[$0_1 + 12 >> 2]); block4 : { block3 : { block2 : { block1 : { $3 = HEAP32[$0_1 + 16 >> 2]; if (!$3) { if (!(HEAPU8[$0_1 + 5 | 0] & 16)) { break block1 } $3 = HEAP32[HEAP32[HEAP32[$0_1 + 20 >> 2] + 28 >> 2] + 8 >> 2]; } $2_1 = $1190($3, $2_1); break block2; } if (!$2_1) { break block3 } } if (($2_1 | 0) < 66) { break block3 } if (($2_1 | 0) != 66) { break block4 } return ($1_1 | 0) == 66; } return 1; } return ($1_1 | 0) > 66; } function $1346($0_1, $1_1) { var $2_1 = 0, $3 = 0; $0_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2]; if (!(!($2_1 & 3) | HEAP32[$0_1 + 36 >> 2] != HEAP32[$1_1 + 16 >> 2])) { $3 = !($2_1 & 2) | !(HEAPU8[$1_1 + 12 | 0] & 24) } return $3; } function $1347($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = $1_1 + 92 | 0; while (1) { if (!(HEAP32[$1_1 >> 2] <= ($2_1 | 0))) { $3 = ($2_1 << 2) + $4_1 | 0; $200(HEAP32[$3 >> 2]); HEAP32[$3 >> 2] = 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $1356($1_1); $13($0_1, $1_1); } function $1348($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1) { var $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0.0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0; $14 = global$0 + -64 | 0; $10_1 = $14; if (global$4 >>> 0 < $10_1 >>> 0 | global$5 >>> 0 > $10_1 >>> 0) { fimport$30($10_1 | 0) } global$0 = $10_1; $19_1 = HEAP32[$6_1 + 16 >> 2]; $20_1 = HEAP32[$0_1 + 4 >> 2]; $10_1 = HEAP32[$0_1 + 8 >> 2]; $15_1 = HEAPU8[$10_1 + 16 | 0]; $11_1 = HEAP32[$0_1 >> 2]; $17_1 = HEAP32[$11_1 + 4 >> 2]; $11_1 = HEAP32[$11_1 >> 2]; $16_1 = HEAP32[$6_1 >> 2]; HEAP32[$8_1 >> 2] = 0; HEAP32[$10_1 >> 2] = $1_1; HEAP32[$10_1 + 4 >> 2] = $2_1; $21_1 = ($16_1 | 0) > 0 ? $16_1 : 0; $1_1 = HEAP32[$6_1 + 4 >> 2]; $2_1 = 0; while (1) { if (($2_1 | 0) != ($21_1 | 0)) { $12_1 = $368($20_1, HEAP32[$1_1 + 8 >> 2]); HEAP8[$1_1 + 5 | 0] = 0; $22_1 = !$9_1 & (HEAPU8[$12_1 + 15 | 0] - 75 & 255) >>> 0 > 253; $23_1 = HEAPU16[$12_1 + 12 >> 1] & $5_1; $18_1 = HEAP32[$12_1 + 32 >> 2]; $12_1 = HEAP32[$12_1 + 36 >> 2]; if (!($22_1 | ($23_1 | (($3 & $18_1) != ($18_1 | 0) | ($12_1 | 0) != ($4_1 & $12_1))))) { HEAP8[$1_1 + 5 | 0] = 1 } $1_1 = $1_1 + 12 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $1_1 = $16_1 << 3; if ($1_1) { wasm2js_memory_fill($19_1, 0, $1_1) } HEAP32[$6_1 + 88 >> 2] = 0; HEAP32[$6_1 + 56 >> 2] = 0; HEAP32[$6_1 + 48 >> 2] = 25; HEAP32[$6_1 + 52 >> 2] = 0; HEAP32[$6_1 + 40 >> 2] = -1568170194; HEAP32[$6_1 + 44 >> 2] = 1416446638; HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 24 >> 2] = 0; $1_1 = HEAP32[$11_1 >> 2]; $12_1 = ($17_1 + Math_imul($15_1, 48) | 0) + 16 | 0; $2_1 = HEAP32[$12_1 >> 2]; $4_1 = HEAP32[$684($1_1, $2_1) + 8 >> 2]; HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] + 1; $3 = FUNCTION_TABLE[HEAP32[HEAP32[$4_1 >> 2] + 12 >> 2]]($4_1, $6_1) | 0; $1_1 = HEAP32[$11_1 >> 2]; HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] - 1; block4 : { if (!$3 | ($3 | 0) == 19) { break block4 } if (($3 | 0) == 7) { $106($1_1); break block4; } $1_1 = HEAP32[$4_1 + 8 >> 2]; if (!$1_1) { HEAP32[$14 + 32 >> 2] = $256($3); $257($11_1, 8932, $14 + 32 | 0); break block4; } HEAP32[$14 + 48 >> 2] = $1_1; $257($11_1, 8932, $14 + 48 | 0); } block7 : { if (!HEAPU8[HEAP32[$2_1 + 52 >> 2] + 17 | 0]) { break block7 } $1_1 = 0; $2_1 = HEAP32[HEAP32[$11_1 >> 2] + 20 >> 2]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { if (($1_1 | 0) != ($2_1 | 0)) { $917($11_1, $1_1); $1_1 = $1_1 + 1 | 0; continue; } break; }; if (!HEAP32[$11_1 + 92 >> 2]) { break block7 } $1_1 = 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block7 } $923($11_1, 0, $1_1); $1_1 = $1_1 + 1 | 0; continue; }; } $24(HEAP32[$4_1 + 8 >> 2]); $2_1 = 0; HEAP32[$4_1 + 8 >> 2] = 0; block10 : { if ($3) { if (($3 | 0) != 19) { break block10 } $1356($6_1); $3 = 0; break block10; } $1_1 = $16_1 << 2; if ($1_1) { wasm2js_memory_fill(HEAP32[$10_1 + 52 >> 2], 0, $1_1) } $1_1 = $10_1 + 32 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$10_1 + 24 >> 2] = 0; HEAP32[$10_1 + 28 >> 2] = 0; $5_1 = HEAP32[$6_1 + 4 >> 2]; $3 = -1; block22 : { block16 : { while (1) { if (($2_1 | 0) != ($21_1 | 0)) { block13 : { $15_1 = ($2_1 << 3) + $19_1 | 0; $4_1 = HEAP32[$15_1 >> 2]; if (($4_1 | 0) <= 0) { break block13 } block15 : { block14 : { if (($4_1 | 0) > ($16_1 | 0)) { break block14 } $1_1 = HEAP32[$5_1 + 8 >> 2]; if (($1_1 | 0) < 0) { break block14 } $1_1 = $368($20_1, $1_1); if (!$1_1) { break block14 } $4_1 = $4_1 - 1 | 0; $17_1 = HEAP32[$10_1 + 52 >> 2] + ($4_1 << 2) | 0; if (HEAP32[$17_1 >> 2]) { break block14 } if (HEAPU8[$5_1 + 5 | 0]) { break block15 } } HEAP32[$14 + 16 >> 2] = HEAP32[HEAP32[$12_1 >> 2] >> 2]; $257($11_1, 10439, $14 + 16 | 0); break block16; } $18_1 = HEAP32[$10_1 + 4 >> 2] | HEAP32[$1_1 + 36 >> 2]; HEAP32[$10_1 >> 2] = HEAP32[$1_1 + 32 >> 2] | HEAP32[$10_1 >> 2]; HEAP32[$10_1 + 4 >> 2] = $18_1; HEAP32[$17_1 >> 2] = $1_1; block17 : { if (!HEAPU8[$15_1 + 4 | 0]) { break block17 } if (!($7_1 >>> $2_1 & 1 | $2_1 >>> 0 > 15)) { HEAP16[$10_1 + 30 >> 1] = HEAPU16[$10_1 + 30 >> 1] | 1 << $4_1 } if (HEAPU8[$1_1 + 15 | 0] != 74) { break block17 } HEAP8[$10_1 + 28 | 0] = HEAPU8[$10_1 + 28 | 0] | 2; } $15_1 = ($3 | 0) < ($4_1 | 0); block20 : { if (HEAP32[$6_1 + 88 >> 2] & ($2_1 >>> 0 < 32 ? 1 << $2_1 : 0)) { HEAP32[$10_1 + 36 >> 2] = HEAP32[$10_1 + 36 >> 2] | 1 << $4_1; break block20; } if (!(HEAP8[$1_1 + 12 | 0] & 1)) { break block20 } HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[$6_1 + 56 >> 2] = HEAP32[$6_1 + 56 >> 2] & -2; HEAP32[$8_1 >> 2] = 1; } $3 = $15_1 ? $4_1 : $3; if ((HEAPU8[$1_1 + 15 | 0] - 75 & 255) >>> 0 < 254) { break block13 } $1_1 = 0; if (!HEAP32[$8_1 >> 2]) { while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block13 } $4_1 = $1_1 << 3; $1_1 = $1_1 + 1 | 0; if (HEAP32[$4_1 + $19_1 >> 2] > 0) { continue } break; } } $1356($6_1); HEAP32[$9_1 >> 2] = 1; $3 = 0; break block10; } $5_1 = $5_1 + 12 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP16[$10_1 + 44 >> 1] = $3 + 1; $2_1 = (($3 | 0) < 0 ? -1 : $3) + 1 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { break block22 } $3 = $1_1 << 2; $1_1 = $1_1 + 1 | 0; if (HEAP32[$3 + HEAP32[$10_1 + 52 >> 2] >> 2]) { continue } break; }; HEAP32[$14 >> 2] = HEAP32[HEAP32[$12_1 >> 2] >> 2]; $257($11_1, 10439, $14); } $1356($6_1); $3 = 1; break block10; } HEAP32[$10_1 + 24 >> 2] = HEAP32[$6_1 + 20 >> 2]; HEAP8[$10_1 + 28 | 0] = HEAPU8[$10_1 + 28 | 0] & 254 | HEAP8[$6_1 + 28 | 0] & 1; HEAP32[$6_1 + 28 >> 2] = 0; HEAP32[$10_1 + 32 >> 2] = HEAP32[$6_1 + 24 >> 2]; HEAP8[$10_1 + 29 | 0] = HEAP32[$6_1 + 32 >> 2] ? HEAP32[$6_1 + 8 >> 2] : 0; $1_1 = HEAPU8[$6_1 + 56 | 0]; HEAP16[$10_1 + 18 >> 1] = 0; HEAP8[$10_1 + 28 | 0] = $1_1 << 1 & 4 | HEAPU8[$10_1 + 28 | 0] & 251; $1_1 = 0; $13_1 = HEAPF64[$6_1 + 40 >> 3]; $1_1 = 0; block : { if ($13_1 <= 1.0) { break block } if ($13_1 <= 2.0e9) { if ($13_1 < 18446744073709551615.0 & $13_1 >= 0.0) { $1_1 = ~~$13_1 >>> 0; if (Math_abs($13_1) >= 1.0) { $2_1 = ~~($13_1 > 0.0 ? Math_min(Math_floor($13_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($13_1 - +(~~$13_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $2_1 = 0 } } else { $2_1 = 0 } $1_1 = $433($1_1, $2_1); break block; } wasm2js_scratch_store_f64(+$13_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $1_1 = Math_imul($1_1 >>> 20 | 0, 10) - 10220 | 0; } HEAP16[$10_1 + 20 >> 1] = $1_1 << 16 >> 16; HEAP16[$10_1 + 22 >> 1] = $433(HEAP32[$6_1 + 48 >> 2], HEAP32[$6_1 + 52 >> 2]); HEAP32[$10_1 + 40 >> 2] = HEAP32[$10_1 + 40 >> 2] & -4097 | HEAP32[$6_1 + 56 >> 2] << 12 & 4096; $3 = $1349($0_1, $10_1); if (!(HEAP8[$10_1 + 28 | 0] & 1)) { break block10 } $24(HEAP32[$10_1 + 32 >> 2]); HEAP8[$10_1 + 28 | 0] = HEAPU8[$10_1 + 28 | 0] & 254; } $0_1 = $14 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1349($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = HEAP32[$0_1 + 20 >> 2]; block1 : { if (!$3) { $3 = 101; $0_1 = HEAP32[$0_1 + 12 >> 2]; if (!$0_1) { break block1 } HEAP16[$0_1 >> 1] = 0; return 101; } $6_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[HEAP32[$6_1 >> 2] >> 2]; HEAP32[$0_1 + 20 >> 2] = $3 - 1; $3 = HEAP32[$6_1 + 60 >> 2]; if (!(!$3 | !(HEAP32[$1_1 + 40 >> 2] & 512))) { $7_1 = HEAPU8[$1_1 + 16 | 0]; while (1) { block3 : { if (!(HEAPU8[$3 + 41 | 0] & 2) | ($7_1 | 0) != HEAPU8[$3 + 16 | 0]) { break block3 } block5 : { if ($1357($3, $1_1)) { $2_1 = HEAP16[$3 + 20 >> 1]; $4_1 = HEAP16[$1_1 + 20 >> 1]; HEAP16[$1_1 + 20 >> 1] = ($2_1 | 0) < ($4_1 | 0) ? $2_1 : $4_1; $2_1 = HEAP16[$1_1 + 22 >> 1]; $4_1 = HEAP16[$3 + 22 >> 1]; $2_1 = ($2_1 | 0) < ($4_1 | 0) ? $2_1 : $4_1 - 1 | 0; break block5; } if (!$1357($1_1, $3)) { break block3 } $2_1 = HEAP16[$3 + 20 >> 1]; $4_1 = HEAP16[$1_1 + 20 >> 1]; HEAP16[$1_1 + 20 >> 1] = ($2_1 | 0) > ($4_1 | 0) ? $2_1 : $4_1; $2_1 = HEAP16[$1_1 + 22 >> 1]; $4_1 = HEAP16[$3 + 22 >> 1]; $2_1 = ($2_1 | 0) > ($4_1 | 0) ? $2_1 : $4_1 + 1 | 0; } HEAP16[$1_1 + 22 >> 1] = $2_1; } $3 = HEAP32[$3 + 56 >> 2]; if ($3) { continue } break; }; } $0_1 = HEAP32[$0_1 + 12 >> 2]; if ($0_1) { $3 = 0; if (!HEAPU16[$1_1 + 44 >> 1]) { break block1 } $1354($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], HEAP16[$1_1 + 20 >> 1], HEAP16[$1_1 + 22 >> 1]); return 0; } $0_1 = $1358($6_1 + 60 | 0, $1_1); if (!$0_1) { return 0 } block10 : { block9 : { $2_1 = HEAP32[$0_1 >> 2]; if (!$2_1) { $2_1 = $325($5_1, 72, 0); HEAP32[$0_1 >> 2] = $2_1; if ($2_1) { break block9 } return 7; } $3 = $2_1 + 56 | 0; while (1) { if (!HEAP32[$3 >> 2]) { break block10 } $3 = $1358($3, $1_1); if (!$3) { break block10 } $0_1 = HEAP32[$3 >> 2]; if (!$0_1) { break block10 } HEAP32[$3 >> 2] = HEAP32[$0_1 + 56 >> 2]; $1330($5_1, $0_1); continue; }; } HEAP16[$2_1 + 48 >> 1] = 3; HEAP16[$2_1 + 44 >> 1] = 0; HEAP32[$2_1 + 56 >> 2] = 0; HEAP32[$2_1 + 40 >> 2] = 0; HEAP32[$2_1 + 52 >> 2] = $2_1 + 60; } $1355($5_1, $2_1); block13 : { block11 : { $0_1 = HEAPU16[$1_1 + 44 >> 1]; if ($0_1 >>> 0 <= HEAPU16[$2_1 + 48 >> 1]) { break block11 } if (!$1327($5_1, $2_1, $0_1)) { break block11 } wasm2js_memory_fill($2_1, 0, 48); $3 = 7; break block13; } wasm2js_memory_copy($2_1, $1_1, 48); $0_1 = HEAPU16[$2_1 + 44 >> 1] << 2; if ($0_1) { wasm2js_memory_copy(HEAP32[$2_1 + 52 >> 2], HEAP32[$1_1 + 52 >> 2], $0_1) } $0_1 = HEAP32[$1_1 + 40 >> 2]; if ($0_1 & 1024) { HEAP8[$1_1 + 28 | 0] = HEAPU8[$1_1 + 28 | 0] & 254; $3 = 0; break block13; } $3 = 0; if (!($0_1 & 16384)) { break block13 } HEAP32[$1_1 + 32 >> 2] = 0; $3 = 0; } if (HEAPU8[$2_1 + 41 | 0] & 4) { break block1 } $0_1 = HEAP32[$2_1 + 32 >> 2]; if (!$0_1 | ((HEAPU8[$0_1 + 55 | 0] | HEAPU8[$0_1 + 56 | 0] << 8) & 3) != 3) { break block1 } HEAP32[$2_1 + 32 >> 2] = 0; } return $3; } function $1350($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if ($1_1 & 64) { break block } $6_1 = HEAP32[HEAP32[$2_1 >> 2] >> 2]; while (1) { if (HEAPU8[$3 | 0] == 44) { if (!$1350($0_1, $1_1, $2_1, HEAP32[$3 + 12 >> 2])) { break block } $3 = HEAP32[$3 + 16 >> 2]; continue; } break; }; $7_1 = $1_1 & 32; $1_1 = HEAP32[$2_1 + 24 >> 2]; while (1) { if (HEAP32[$2_1 + 12 >> 2] <= ($5_1 | 0)) { break block } block4 : { $4_1 = HEAP32[$1_1 >> 2]; block3 : { if (HEAP8[$4_1 + 4 | 0] & 1) { if (HEAP32[$4_1 + 36 >> 2] == ($0_1 | 0)) { break block3 } break block4; } if ($7_1) { break block4 } } if (!$1176($6_1, $4_1, $3, $0_1) | HEAPU8[$1_1 + 10 | 0] & 128) { break block4 } $8_1 = 1; break block; } $1_1 = $1_1 + 48 | 0; $5_1 = $5_1 + 1 | 0; continue; }; } return $8_1; } function $1351($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = global$0 - 16 | 0; $7_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $7_1; $9_1 = (HEAP32[$1_1 + 8 >> 2] | HEAP32[$1_1 >> 2]) ^ -1; $10_1 = (HEAP32[$1_1 + 12 >> 2] | HEAP32[$1_1 + 4 >> 2]) ^ -1; $4_1 = HEAP32[$0_1 + 24 >> 2]; $8_1 = HEAP32[$0_1 + 20 >> 2]; $7_1 = 0; while (1) { if (!(($8_1 | 0) <= 0)) { $3 = HEAP32[$4_1 + 40 >> 2]; $5_1 = HEAP32[$4_1 + 44 >> 2]; block1 : { if ($9_1 & $3 | $10_1 & $5_1 | (!($3 & HEAP32[$1_1 + 8 >> 2] | $5_1 & HEAP32[$1_1 + 12 >> 2]) | HEAPU8[$4_1 + 10 | 0] & 2)) { break block1 } $3 = HEAPU16[$1_1 + 44 >> 1]; while (1) { if ($3) { $3 = $3 - 1 | 0; $5_1 = HEAP32[HEAP32[$1_1 + 52 >> 2] + ($3 << 2) >> 2]; if (!$5_1) { continue } if (($4_1 | 0) == ($5_1 | 0)) { break block1 } $5_1 = HEAP32[$5_1 + 16 >> 2]; if (($5_1 | 0) < 0 | (HEAP32[$0_1 + 24 >> 2] + Math_imul($5_1, 48) | 0) != ($4_1 | 0)) { continue } break block1; } break; }; $1220(HEAP32[HEAP32[$0_1 >> 2] >> 2]); block3 : { if (HEAP32[$1_1 + 8 >> 2] != HEAP32[$4_1 + 40 >> 2] | HEAP32[$1_1 + 12 >> 2] != HEAP32[$4_1 + 44 >> 2]) { break block3 } if (!(HEAPU8[$4_1 + 12 | 0] & 63)) { if (HEAPU8[(HEAP32[HEAP32[$0_1 >> 2] + 4 >> 2] + Math_imul(HEAPU8[$1_1 + 16 | 0], 48) | 0) + 20 | 0] & 72) { break block3 } } HEAP32[$1_1 + 40 >> 2] = HEAP32[$1_1 + 40 >> 2] | 8388608; } $3 = HEAPU16[$1_1 + 22 >> 1]; $5_1 = HEAP16[$4_1 + 8 >> 1]; if (($5_1 | 0) <= 0) { HEAP16[$1_1 + 22 >> 1] = $3 + $5_1; break block1; } HEAP16[$1_1 + 22 >> 1] = $3 - 1; if (!(HEAPU8[$4_1 + 12 | 0] & 130)) { break block1 } $3 = HEAP32[HEAP32[$4_1 >> 2] + 16 >> 2]; HEAP32[$6_1 + 12 >> 2] = 0; $3 = $1074($3, $6_1 + 12 | 0, 0); $3 = $3 ? (HEAP32[$6_1 + 12 >> 2] + 1 >>> 0 < 3 ? 10 : 20) : 20; if ($3 >>> 0 <= ($7_1 & 65535) >>> 0) { break block1 } HEAP16[$4_1 + 10 >> 1] = HEAPU16[$4_1 + 10 >> 1] | 8192; $7_1 = $3; } $4_1 = $4_1 + 48 | 0; $8_1 = $8_1 - 1 | 0; continue; } break; }; $0_1 = $2_1 - ($7_1 & 65535) | 0; if (($0_1 | 0) < HEAP16[$1_1 + 22 >> 1]) { HEAP16[$1_1 + 22 >> 1] = $0_1 } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1353($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0; $16_1 = global$0 - 96 | 0; $5_1 = $16_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $17_1 = HEAP32[HEAP32[$0_1 >> 2] >> 2]; block1 : { if (HEAP32[$17_1 + 40 >> 2]) { $8_1 = HEAP32[$17_1 + 12 >> 2]; break block1; } $4_1 = HEAP32[$0_1 + 8 >> 2]; $20_1 = HEAP32[$4_1 + 40 >> 2]; $5_1 = $20_1 & 32 ? 24 : 447; $9_1 = HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8; block2 : { if (!($9_1 & 260)) { break block2 } $5_1 = $9_1 & 4 ? $5_1 & 387 : $5_1; if (!($9_1 & 256)) { break block2 } $5_1 = HEAPU8[$1_1 + 13 | 0] & 2 ? $5_1 : $5_1 & 316; } $18_1 = HEAP32[$17_1 >> 2]; $21_1 = HEAPU16[$4_1 + 22 >> 1]; $24_1 = HEAP32[$4_1 >> 2]; $25 = HEAP32[$4_1 + 4 >> 2]; $26_1 = HEAPU16[$4_1 + 46 >> 1]; $27 = HEAPU16[$4_1 + 28 >> 1]; $28_1 = HEAPU16[$4_1 + 26 >> 1]; $19_1 = HEAPU16[$4_1 + 44 >> 1]; $11_1 = HEAPU16[$4_1 + 24 >> 1]; $5_1 = $1275($16_1, HEAP32[$0_1 + 4 >> 2], HEAP32[$1_1 + 16 >> 2], $11_1, $5_1, $2_1); HEAP16[$4_1 + 18 >> 1] = 0; $29_1 = $19_1 + 1 | 0; $30_1 = HEAP16[HEAP32[$2_1 + 8 >> 2] >> 1]; $23_1 = $1322($30_1); $32_1 = ($23_1 | 0) > 9; $9_1 = 0; block3 : { while (1) { if (!$5_1 | $8_1) { break block3 } block12 : { $13_1 = HEAPU16[$5_1 + 12 >> 1]; block6 : { if (!(!(HEAPU8[$5_1 + 10 | 0] & 128) & ($13_1 | 0) != 256)) { $8_1 = 0; if ($1274($2_1, $11_1)) { break block6 } } $8_1 = 0; $7_1 = HEAP32[$4_1 + 8 >> 2]; $10_1 = HEAP32[$4_1 + 12 >> 2]; if ($7_1 & HEAP32[$5_1 + 32 >> 2] | $10_1 & HEAP32[$5_1 + 36 >> 2] | (HEAPU16[$5_1 + 10 >> 1] & 256 ? ($13_1 | 0) == 16 : 0)) { break block6 } if (HEAPU8[$1_1 + 12 | 0] & 88) { if (!$1346($5_1, $1_1)) { break block6 } } block10 : { if (HEAPU8[$2_1 + 54 | 0]) { $6_1 = 2; if ((HEAPU16[$2_1 + 50 >> 1] - 1 | 0) == ($11_1 | 0)) { break block10 } } $6_1 = 1; } HEAP8[$0_1 + 16 | 0] = $6_1 | HEAPU8[$0_1 + 16 | 0]; HEAP16[$4_1 + 44 >> 1] = $19_1; HEAP16[$4_1 + 28 >> 1] = $27; HEAP16[$4_1 + 26 >> 1] = $28_1; HEAP16[$4_1 + 24 >> 1] = $11_1; HEAP32[$4_1 + 40 >> 2] = $20_1; $6_1 = $19_1; if ($6_1 >>> 0 >= HEAPU16[$4_1 + 48 >> 1]) { if ($1327($18_1, $4_1, $29_1)) { break block12 } $7_1 = HEAP32[$4_1 + 8 >> 2]; $10_1 = HEAP32[$4_1 + 12 >> 2]; $6_1 = HEAPU16[$4_1 + 44 >> 1]; } $15_1 = $6_1 + 1 | 0; HEAP16[$4_1 + 44 >> 1] = $15_1; $14 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$14 + ($6_1 << 2) >> 2] = $5_1; $10_1 = ($25 | HEAP32[$5_1 + 36 >> 2]) & ($10_1 ^ -1); HEAP32[$4_1 >> 2] = ($24_1 | HEAP32[$5_1 + 32 >> 2]) & ($7_1 ^ -1); HEAP32[$4_1 + 4 >> 2] = $10_1; block19 : { if ($13_1 & 1) { $7_1 = HEAP32[$5_1 >> 2]; block15 : { if (HEAPU8[$7_1 + 5 | 0] & 16) { $6_1 = $15_1 & 65535; $15_1 = ($6_1 >>> 0 <= 1 ? 1 : $6_1) - 1 | 0; $6_1 = 0; $10_1 = 46; while (1) { if (($6_1 | 0) == ($15_1 | 0)) { break block15 } $22_1 = HEAP32[$14 + ($6_1 << 2) >> 2]; if ($22_1) { $10_1 = ($7_1 | 0) != HEAP32[$22_1 >> 2] ? $10_1 : 0 } $6_1 = $6_1 + 1 | 0; continue; }; } $10_1 = 0; $6_1 = HEAP32[$7_1 + 20 >> 2]; if (!$6_1) { break block15 } $6_1 = HEAP32[$6_1 >> 2]; if (!$6_1) { break block15 } $10_1 = $433($6_1, $6_1 >> 31) & 65535; } block18 : { if (!(!(HEAPU8[$2_1 + 55 | 0] & 128) | !$32_1)) { $7_1 = $10_1 << 16 >> 16; if (!(((HEAPU16[HEAP32[$2_1 + 8 >> 2] + ($11_1 << 1) >> 1] - ($10_1 + $23_1 | 0) | 0) + $1322($7_1) | 0) + 10 & 32768)) { break block18 } if (HEAPU8[$18_1 + 82 | 0] & 2 | ($3 | 0) > 1) { break block6 } HEAP32[$4_1 + 40 >> 2] = HEAP32[$4_1 + 40 >> 2] | 1048576; } $7_1 = $10_1; } $8_1 = HEAP32[$4_1 + 40 >> 2] | 4; HEAP32[$4_1 + 40 >> 2] = $8_1; break block19; } if ($13_1 & 130) { $6_1 = HEAP16[HEAP32[$2_1 + 4 >> 2] + ($11_1 << 1) >> 1]; $10_1 = HEAP32[$4_1 + 40 >> 2]; $8_1 = $10_1 | 1; HEAP32[$4_1 + 40 >> 2] = $8_1; $7_1 = 4097; block22 : { block21 : { if (($6_1 | 0) == -1) { break block21 } if (($6_1 | 0) < 0 | $3) { break block22 } $6_1 = HEAPU16[$2_1 + 50 >> 1]; if (($6_1 - 1 | 0) != ($11_1 | 0)) { break block22 } if (!(HEAPU8[$2_1 + 54 | 0] ? !($13_1 & 2) | ($6_1 | 0) != 1 : 1) | HEAPU8[$2_1 + 55 | 0] & 8) { break block21 } $7_1 = 65537; } $8_1 = $7_1 | $10_1; HEAP32[$4_1 + 40 >> 2] = $8_1; } $7_1 = 0; if (HEAPU8[$16_1 + 25 | 0] < 2) { break block19 } $8_1 = $8_1 | 2097152; HEAP32[$4_1 + 40 >> 2] = $8_1; break block19; } if ($13_1 & 256) { $8_1 = HEAP32[$4_1 + 40 >> 2] | 8; HEAP32[$4_1 + 40 >> 2] = $8_1; $7_1 = 0; break block19; } $15_1 = HEAP32[$1_1 + 16 >> 2]; $6_1 = 1; $9_1 = $1119(HEAP32[HEAP32[$5_1 >> 2] + 12 >> 2]); $7_1 = HEAPU16[$2_1 + 52 >> 1] - $11_1 | 0; $9_1 = ($7_1 | 0) > ($9_1 | 0) ? $9_1 : $7_1; $9_1 = ($9_1 | 0) <= 1 ? 1 : $9_1; block25 : { while (1) { if (($6_1 | 0) == ($9_1 | 0)) { break block25 } $12_1 = HEAP32[$5_1 >> 2]; $10_1 = HEAP32[$12_1 + 16 >> 2]; $7_1 = $10_1 + 20 | 0; $8_1 = $6_1 << 4; $12_1 = HEAP32[($8_1 + HEAP32[HEAP32[$12_1 + 12 >> 2] + 20 >> 2] | 0) + 8 >> 2]; $7_1 = HEAPU8[$10_1 + 5 | 0] & 16 ? HEAP32[$7_1 >> 2] + 28 | 0 : $7_1; block27 : { if (HEAPU8[$12_1 | 0] != 168 | ($15_1 | 0) != HEAP32[$12_1 + 28 >> 2]) { break block27 } $10_1 = $6_1 + $11_1 | 0; if (HEAPU16[$12_1 + 32 >> 1] != HEAPU16[HEAP32[$2_1 + 4 >> 2] + ($10_1 << 1) >> 1]) { break block27 } $14 = HEAP32[$2_1 + 28 >> 2]; if (HEAPU8[$14 + $10_1 | 0] != HEAPU8[$11_1 + $14 | 0]) { break block27 } $14 = HEAP32[($8_1 + HEAP32[$7_1 >> 2] | 0) + 8 >> 2]; $22_1 = $1190($14, $971($12_1)); $7_1 = 68; $8_1 = HEAP16[$12_1 + 32 >> 1]; block28 : { if (($8_1 | 0) < 0) { break block28 } $31_1 = HEAP32[$2_1 + 12 >> 2]; if (($8_1 | 0) >= HEAP16[$31_1 + 34 >> 1]) { break block28 } $7_1 = HEAPU8[(HEAP32[$31_1 + 4 >> 2] + Math_imul($8_1, 12) | 0) + 5 | 0]; } if (($22_1 & 255) != ($7_1 & 255)) { break block27 } $7_1 = $370($17_1, $12_1, $14); if (!$7_1) { break block27 } if ($67(HEAP32[$7_1 >> 2], HEAP32[HEAP32[$2_1 + 32 >> 2] + ($10_1 << 2) >> 2])) { break block27 } $6_1 = $6_1 + 1 | 0; continue; } break; }; $9_1 = $6_1; } $6_1 = HEAP32[$4_1 + 40 >> 2]; if ($13_1 & 36) { HEAP16[$4_1 + 26 >> 1] = $9_1; $8_1 = $6_1 | 34; HEAP32[$4_1 + 40 >> 2] = $8_1; $7_1 = 0; $9_1 = $5_1; $12_1 = 0; if (!(HEAP8[$5_1 + 11 | 0] & 1)) { break block19 } if ($1327($18_1, $4_1, HEAPU16[$4_1 + 44 >> 1] + 1 | 0)) { break block12 } $9_1 = HEAPU16[$4_1 + 44 >> 1]; HEAP16[$4_1 + 44 >> 1] = $9_1 + 1; $12_1 = $5_1 + 48 | 0; HEAP32[HEAP32[$4_1 + 52 >> 2] + ($9_1 << 2) >> 2] = $12_1; HEAP16[$4_1 + 28 >> 1] = 1; $8_1 = HEAP32[$4_1 + 40 >> 2] | 16; HEAP32[$4_1 + 40 >> 2] = $8_1; $9_1 = $5_1; break block19; } HEAP16[$4_1 + 28 >> 1] = $9_1; $8_1 = $6_1 | 18; HEAP32[$4_1 + 40 >> 2] = $8_1; $7_1 = 0; if ($6_1 & 32) { $9_1 = HEAP32[(HEAP32[$4_1 + 52 >> 2] + (HEAPU16[$4_1 + 44 >> 1] << 2) | 0) - 8 >> 2] } else { $9_1 = 0 } $12_1 = $5_1; } block36 : { block34 : { if ($8_1 & 2) { $6_1 = HEAP16[$4_1 + 22 >> 1]; $5_1 = $1362($12_1, $1362($9_1, $6_1)); if (!(!$9_1 | !$12_1 | HEAP16[$9_1 + 8 >> 1] <= 0)) { $5_1 = HEAP16[$12_1 + 8 >> 1] > 0 ? $5_1 - 20 | 0 : $5_1 } $6_1 = $6_1 + (($9_1 ? -1 : 0) - (($12_1 | 0) != 0) | 0) | 0; $5_1 = $5_1 << 16 >> 16; $5_1 = ($5_1 | 0) <= 10 ? 10 : $5_1; $5_1 = ($5_1 | 0) > ($6_1 | 0) ? $6_1 : $5_1; break block34; } $6_1 = HEAPU16[$4_1 + 24 >> 1] + 1 | 0; HEAP16[$4_1 + 24 >> 1] = $6_1; $5_1 = HEAP16[$5_1 + 8 >> 1]; if (!(HEAP16[HEAP32[$2_1 + 4 >> 2] + ($11_1 << 1) >> 1] < 0 | ($5_1 | 0) > 0)) { $5_1 = HEAPU16[$4_1 + 22 >> 1] + ($5_1 - $7_1 | 0) | 0; break block34; } $5_1 = HEAP32[$2_1 + 8 >> 2] + (($6_1 & 65535) << 1) | 0; $5_1 = HEAPU16[$4_1 + 22 >> 1] + (HEAPU16[$5_1 >> 1] - HEAPU16[$5_1 - 2 >> 1] | 0) | 0; HEAP16[$4_1 + 22 >> 1] = $5_1; if (!($13_1 & 256)) { break block36 } $5_1 = $5_1 + 10 | 0; } HEAP16[$4_1 + 22 >> 1] = $5_1; } if (((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 3) == 3) { $6_1 = $5_1 + 16 | 0 } else { $6_1 = (((Math_imul(HEAP16[$2_1 + 48 >> 1], 15) | 0) / HEAP16[HEAP32[$1_1 + 8 >> 2] + 40 >> 1] | 0) + ($5_1 & 65535) | 0) + 1 | 0 } $6_1 = $1073($23_1, $6_1 << 16 >> 16); if (!($8_1 & 67109184)) { $6_1 = $1073($6_1, $5_1 + 16 << 16 >> 16) } $7_1 = $3 + $7_1 | 0; HEAP16[$4_1 + 22 >> 1] = $7_1 + $5_1; HEAP16[$4_1 + 20 >> 1] = $6_1 + $7_1; $1351(HEAP32[$0_1 + 4 >> 2], $4_1, $30_1); $8_1 = $1349($0_1, $4_1); $6_1 = $5_1; $5_1 = HEAP32[$4_1 + 40 >> 2]; HEAP16[$4_1 + 22 >> 1] = $5_1 & 2 ? $21_1 : $6_1; block40 : { if ($5_1 & 16) { break block40 } $5_1 = HEAPU16[$4_1 + 24 >> 1]; if ($5_1 >>> 0 >= HEAPU16[$2_1 + 52 >> 1]) { break block40 } if (HEAPU16[$2_1 + 50 >> 1] <= $5_1 >>> 0) { if (((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 3) == 2) { break block40 } } $6_1 = $7_1 << 16 >> 16; if ($5_1 >>> 0 >= 4) { $1220($17_1) } $1353($0_1, $1_1, $2_1, $6_1); } HEAP16[$4_1 + 22 >> 1] = $21_1; } $5_1 = $1276($16_1); continue; } break; }; $8_1 = 0; } HEAP16[$4_1 + 46 >> 1] = $26_1; HEAP16[$4_1 + 28 >> 1] = $27; HEAP16[$4_1 + 26 >> 1] = $28_1; HEAP16[$4_1 + 24 >> 1] = $11_1; HEAP32[$4_1 >> 2] = $24_1; HEAP32[$4_1 + 4 >> 2] = $25; HEAP32[$4_1 + 40 >> 2] = $20_1; HEAP16[$4_1 + 44 >> 1] = $19_1; HEAP16[$4_1 + 22 >> 1] = $21_1; if (($11_1 | 0) != ($26_1 | 0)) { break block1 } $5_1 = $11_1 + 1 | 0; if (($11_1 | 0) != ($19_1 | 0) | $5_1 >>> 0 >= HEAPU16[$2_1 + 50 >> 1] | (HEAPU8[$18_1 + 81 | 0] & 64 | ((HEAPU8[$2_1 + 55 | 0] | HEAPU8[$2_1 + 56 | 0] << 8) & 192) != 128)) { break block1 } $6_1 = $5_1 << 1; if (HEAP16[$6_1 + HEAP32[$2_1 + 8 >> 2] >> 1] < 42) { break block1 } $8_1 = $1327($18_1, $4_1, $29_1); if ($8_1) { break block1 } HEAP16[$4_1 + 24 >> 1] = HEAPU16[$4_1 + 24 >> 1] + 1; HEAP16[$4_1 + 46 >> 1] = HEAPU16[$4_1 + 46 >> 1] + 1; $9_1 = HEAPU16[$4_1 + 44 >> 1]; HEAP16[$4_1 + 44 >> 1] = $9_1 + 1; $8_1 = 0; HEAP32[HEAP32[$4_1 + 52 >> 2] + ($9_1 << 2) >> 2] = 0; HEAP32[$4_1 + 40 >> 2] = HEAP32[$4_1 + 40 >> 2] | 32768; $9_1 = HEAP32[$2_1 + 8 >> 2]; $5_1 = HEAPU16[$9_1 + ($11_1 << 1) >> 1] - HEAPU16[$6_1 + $9_1 >> 1] | 0; HEAP16[$4_1 + 22 >> 1] = HEAPU16[$4_1 + 22 >> 1] - $5_1; $1353($0_1, $1_1, $2_1, ($3 + $5_1 | 0) + 5 << 16 >> 16); HEAP16[$4_1 + 46 >> 1] = $11_1; HEAP16[$4_1 + 24 >> 1] = $11_1; HEAP16[$4_1 + 22 >> 1] = $21_1; HEAP32[$4_1 + 40 >> 2] = $20_1; } $0_1 = $16_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $1354($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = HEAPU16[$0_1 >> 1]; $7_1 = $8_1; $9_1 = $0_1 + 8 | 0; $5_1 = $9_1; block4 : { block2 : { while (1) { if ($7_1 & 65535) { $6_1 = HEAP16[$5_1 + 8 >> 1]; if (($1_1 | 0) == ($1_1 & HEAP32[$5_1 >> 2]) & ($2_1 & HEAP32[$5_1 + 4 >> 2]) == ($2_1 | 0) & ($3 | 0) <= ($6_1 | 0)) { break block2 } if (($3 | 0) >= ($6_1 | 0)) { $6_1 = HEAP32[$5_1 >> 2]; $10_1 = ($6_1 & $1_1) == ($6_1 | 0); $6_1 = HEAP32[$5_1 + 4 >> 2]; if ($10_1 & ($2_1 & $6_1) == ($6_1 | 0)) { break block4 } } $5_1 = $5_1 + 16 | 0; $7_1 = $7_1 - 1 | 0; continue; } break; }; if ($8_1 >>> 0 > 2) { $7_1 = 1; $5_1 = $9_1; while (1) { $6_1 = HEAP16[$5_1 + 8 >> 1]; if (!(($7_1 | 0) == ($8_1 | 0))) { $0_1 = ($7_1 << 4) + $9_1 | 0; $5_1 = ($6_1 | 0) > HEAP16[$0_1 + 8 >> 1] ? $0_1 : $5_1; $7_1 = $7_1 + 1 | 0; continue; } break; }; if (($3 | 0) >= ($6_1 | 0)) { break block4 } break block2; } HEAP16[$0_1 >> 1] = $8_1 + 1; $5_1 = ($8_1 << 4) + $9_1 | 0; HEAP16[$5_1 + 10 >> 1] = $4_1; } HEAP16[$5_1 + 8 >> 1] = $3; HEAP32[$5_1 >> 2] = $1_1; HEAP32[$5_1 + 4 >> 2] = $2_1; if (HEAP16[$5_1 + 10 >> 1] <= ($4_1 | 0)) { break block4 } HEAP16[$5_1 + 10 >> 1] = $4_1; } } function $1355($0_1, $1_1) { var $2_1 = 0; block : { $2_1 = HEAP32[$1_1 + 40 >> 2]; if (!($2_1 & 17408)) { break block } if (!(!($2_1 & 1024) | !(HEAP8[$1_1 + 28 | 0] & 1))) { $24(HEAP32[$1_1 + 32 >> 2]); HEAP32[$1_1 + 32 >> 2] = 0; HEAP8[$1_1 + 28 | 0] = HEAPU8[$1_1 + 28 | 0] & 254; return; } if (!($2_1 & 16384)) { break block } $2_1 = HEAP32[$1_1 + 32 >> 2]; if (!$2_1) { break block } $10($0_1, HEAP32[$2_1 + 16 >> 2]); $13($0_1, HEAP32[$1_1 + 32 >> 2]); HEAP32[$1_1 + 32 >> 2] = 0; } } function $1356($0_1) { if (HEAP32[$0_1 + 28 >> 2]) { $24(HEAP32[$0_1 + 24 >> 2]); HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 28 >> 2] = 0; } } function $1357($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (!(HEAP16[$0_1 + 20 >> 1] <= HEAP16[$1_1 + 20 >> 1] | HEAP16[$0_1 + 22 >> 1] <= HEAP16[$1_1 + 22 >> 1])) { return 0 } block3 : { block2 : { if (!(HEAPU16[$0_1 + 46 >> 1] | (HEAP32[$0_1 + 32 >> 2] != HEAP32[$1_1 + 32 >> 2] | HEAPU16[$0_1 + 24 >> 1] >= HEAPU16[$1_1 + 24 >> 1]))) { if (!HEAPU16[$1_1 + 46 >> 1]) { break block2 } } $2_1 = HEAPU16[$1_1 + 46 >> 1]; $3 = HEAPU16[$0_1 + 46 >> 1]; if ($2_1 >>> 0 > $3 >>> 0) { break block3 } $4_1 = HEAPU16[$0_1 + 44 >> 1]; $5_1 = $4_1 - $3 | 0; $3 = HEAPU16[$1_1 + 44 >> 1]; if (($5_1 | 0) >= ($3 - $2_1 | 0)) { break block3 } while (1) { if (($4_1 | 0) > 0) { $2_1 = $3; $4_1 = $4_1 - 1 | 0; $5_1 = HEAP32[HEAP32[$0_1 + 52 >> 2] + ($4_1 << 2) >> 2]; if (!$5_1) { continue } while (1) { if (($2_1 | 0) <= 0) { break block3 } $2_1 = $2_1 - 1 | 0; if (HEAP32[HEAP32[$1_1 + 52 >> 2] + ($2_1 << 2) >> 2] != ($5_1 | 0)) { continue } break; }; continue; } break; }; if (!(HEAPU8[$0_1 + 40 | 0] & 64)) { break block2 } if (!(HEAPU8[$1_1 + 40 | 0] & 64)) { break block3 } } $6_1 = 1; } return $6_1; } function $1358($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; while (1) { block : { $2_1 = HEAP32[$0_1 >> 2]; if (!$2_1) { break block } block1 : { if (HEAPU8[$2_1 + 16 | 0] != HEAPU8[$1_1 + 16 | 0] | HEAPU8[$2_1 + 17 | 0] != HEAPU8[$1_1 + 17 | 0]) { break block1 } if (!(HEAPU16[$1_1 + 46 >> 1] | !(HEAPU8[$2_1 + 41 | 0] & 64) | (HEAP32[$1_1 + 40 >> 2] & 513) != 513)) { $3 = HEAP32[$1_1 >> 2]; $4_1 = ($3 & HEAP32[$2_1 >> 2]) == ($3 | 0); $3 = HEAP32[$1_1 + 4 >> 2]; if ($4_1 & ($3 & HEAP32[$2_1 + 4 >> 2]) == ($3 | 0)) { break block } } $4_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = HEAP32[$2_1 + 4 >> 2]; $6_1 = $4_1 & $5_1; $3 = HEAP32[$1_1 >> 2]; $7_1 = HEAP32[$2_1 >> 2]; $8_1 = $3 & $7_1; if (!(($8_1 | 0) != ($7_1 | 0) | ($6_1 | 0) != ($5_1 | 0) | HEAP16[$2_1 + 18 >> 1] > HEAP16[$1_1 + 18 >> 1] | (HEAP16[$2_1 + 20 >> 1] > HEAP16[$1_1 + 20 >> 1] | HEAP16[$2_1 + 22 >> 1] > HEAP16[$1_1 + 22 >> 1]))) { $0_1 = 0; break block; } if (($3 | 0) != ($8_1 | 0) | ($6_1 | 0) != ($4_1 | 0) | HEAP16[$2_1 + 20 >> 1] < HEAP16[$1_1 + 20 >> 1]) { break block1 } if (HEAP16[$2_1 + 22 >> 1] >= HEAP16[$1_1 + 22 >> 1]) { break block } } $0_1 = $2_1 + 56 | 0; continue; } break; }; return $0_1; } function $1360($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = HEAP32[$0_1 + 24 >> 2]; $2_1 = HEAP32[$3 >> 2]; block2 : { block1 : { switch (HEAPU8[$1_1 | 0] - 168 | 0) { case 0: case 2: if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$3 + 4 >> 2]) { break block2 } $4_1 = HEAPU16[$2_1 + 52 >> 1]; $2_1 = HEAP32[$2_1 + 4 >> 2]; $0_1 = 0; while (1) { if (($0_1 | 0) != ($4_1 | 0)) { $5_1 = $0_1 << 1; $0_1 = $0_1 + 1 | 0; if (HEAPU16[$2_1 + $5_1 >> 1] != HEAPU16[$1_1 + 32 >> 1]) { continue } break block2; } break; }; HEAP8[$3 + 9 | 0] = 1; return 2; default: break block1; }; } if (!(HEAPU8[$2_1 + 56 | 0] & 16)) { break block2 } $5_1 = HEAP32[$3 + 4 >> 2]; $0_1 = 0; block4 : { while (1) { if (HEAPU16[$2_1 + 52 >> 1] <= $0_1 >>> 0) { break block4 } block6 : { if (HEAPU16[HEAP32[$2_1 + 4 >> 2] + ($0_1 << 1) >> 1] == 65534) { if (!$1121(0, $1_1, HEAP32[(HEAP32[$2_1 + 40 >> 2] + ($0_1 << 4) | 0) + 8 >> 2], $5_1)) { break block6 } } $0_1 = $0_1 + 1 | 0; continue; } break; }; $4_1 = 1; HEAP8[$3 + 8 | 0] = 1; } return $4_1 | 0; } return 0; } function $1361($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; block : { if (HEAPU8[$1_1 | 0] != 168) { break block } $2_1 = HEAP32[$0_1 + 24 >> 2]; if (HEAP32[$1_1 + 28 >> 2] != HEAP32[$2_1 + 4 >> 2]) { break block } if (($889(HEAP32[$2_1 >> 2], HEAP16[$1_1 + 32 >> 1]) | 0) >= 0) { break block } HEAP16[$0_1 + 20 >> 1] = 1; $3 = 2; } return $3 | 0; } function $1362($0_1, $1_1) { var $2_1 = 0; block : { if (!$0_1) { break block } $2_1 = HEAP16[$0_1 + 8 >> 1]; if (($2_1 | 0) <= 0) { $1_1 = $1_1 + $2_1 | 0; break block; } $1_1 = HEAPU8[$0_1 + 10 | 0] & 128 ? $1_1 : $1_1 - 20 | 0; } return $1_1 << 16 >> 16; } function $1365($0_1, $1_1) { var $2_1 = 0; $2_1 = 21969; block : { block2 : { block1 : { $1_1 = HEAPU16[HEAP32[$0_1 + 4 >> 2] + ($1_1 << 1) >> 1]; switch ($1_1 - 65534 | 0) { case 0: break block; case 1: break block1; default: break block2; }; } return 15209; } $2_1 = HEAP32[HEAP32[HEAP32[$0_1 + 12 >> 2] + 4 >> 2] + Math_imul($1_1 << 16 >> 16, 12) >> 2]; } return $2_1; } function $1366($0_1, $1_1, $2_1, $3, $4_1, $5_1) { if ($4_1) { $36($0_1, 30651, 5) } if ($2_1 >>> 0 >= 2) { $36($0_1, 27802, 1) } $4_1 = 0; while (1) { if (($2_1 | 0) != ($4_1 | 0)) { if ($4_1) { $36($0_1, 25087, 1) } $44($0_1, $1365($1_1, $3 + $4_1 | 0)); $4_1 = $4_1 + 1 | 0; continue; } break; }; if ($2_1 >>> 0 >= 2) { $36($0_1, 27781, 1); $36($0_1, $5_1, 1); $5_1 = 27802; } $36($0_1, $5_1, 1); $4_1 = 0; while (1) { if (($2_1 | 0) != ($4_1 | 0)) { if ($4_1) { $36($0_1, 25087, 1) } $36($0_1, 21967, 1); $4_1 = $4_1 + 1 | 0; continue; } break; }; if ($2_1 >>> 0 >= 2) { $36($0_1, 27781, 1) } } function $1368($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $3 = 1; block : { if (($1_1 | 0) == 65) { break block } block2 : { while (1) { block3 : { block1 : { $2_1 = HEAPU8[$0_1 | 0]; switch ($2_1 - 173 | 0) { case 0: case 1: break block1; case 3: break block3; default: break block2; }; } $4_1 = ($2_1 | 0) == 174 ? 1 : $4_1; $0_1 = HEAP32[$0_1 + 12 >> 2]; continue; } break; }; $2_1 = HEAPU8[$0_1 + 2 | 0]; } block5 : { block8 : { block4 : { switch ($2_1 - 154 | 0) { default: if (($2_1 | 0) == 118) { break block8 } $3 = 0; if (($2_1 | 0) != 168 | ($1_1 | 0) < 67) { break block } return HEAPU16[$0_1 + 32 >> 1] >>> 15 | 0; case 2: return ($1_1 | 0) > 66; case 0: break block4; case 1: break block5; }; } return ($1_1 | 0) > 66; } return !$4_1 & ($1_1 | 0) == 66; } $3 = $4_1 ^ 1; } return $3; } function $1369($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if (!$0_1) { break block } $2_1 = HEAP32[$0_1 >> 2]; $6_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $7_1 = $1_1 + 20 | 0; $8_1 = $0_1 + 20 | 0; $2_1 = 0; while (1) { if (($2_1 | 0) == ($6_1 | 0)) { break block } $4_1 = ($2_1 << 4) + $8_1 | 0; $5_1 = HEAPU16[$4_1 >> 1]; block1 : { if (!$5_1) { break block1 } $0_1 = 0; $3 = HEAP32[$1_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; block2 : { while (1) { if (($0_1 | 0) == ($3 | 0)) { break block2 } if (HEAPU16[($0_1 << 4) + $7_1 >> 1] != ($5_1 | 0)) { $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP16[$4_1 >> 1] = $0_1 + 1; if (HEAP32[$1_1 >> 2] > ($0_1 | 0)) { break block1 } } HEAP16[$4_1 >> 1] = 0; } $2_1 = $2_1 + 1 | 0; continue; }; } } function $1370($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { $3 = HEAP32[$0_1 + 4 >> 2]; $4_1 = HEAP32[$3 + 12 >> 2]; if (!$4_1) { break block } $5_1 = $856(HEAP32[$0_1 >> 2]); $0_1 = 0; $6_1 = HEAP32[$3 + 76 >> 2]; $3 = HEAP32[$3 + 8 >> 2]; if ($3) { $3 = HEAP32[$3 >> 2] } else { $3 = $0_1 } $3 = $6_1 + $3 | 0; while (1) { if (HEAP32[$4_1 >> 2] <= ($0_1 | 0)) { break block } $835($5_1, 94, $1_1, $0_1 + $3 | 0, $0_1 + $2_1 | 0); $0_1 = $0_1 + 1 | 0; continue; }; } } function $1371($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $13_1 = $3 ? 161 : 162; $14 = $3 ^ 1; $15_1 = $4_1 + 1 | 0; $10_1 = HEAP32[$0_1 >> 2]; $5_1 = $856($10_1); $6_1 = $1_1; while (1) { if ($6_1) { $0_1 = 0; $11_1 = HEAP32[$6_1 + 44 >> 2]; $7_1 = 0; block1 : { if (HEAPU8[$6_1 + 96 | 0]) { break block1 } $8_1 = HEAP32[HEAP32[$6_1 + 72 >> 2] + 20 >> 2]; $7_1 = 0; if (!$8_1) { break block1 } $7_1 = HEAP32[$8_1 >> 2]; } $8_1 = ($7_1 | 0) > 0 ? $7_1 : 0; while (1) { if (!(($0_1 | 0) == ($8_1 | 0))) { block5 : { if (!(($0_1 | 0) == 1 & HEAP32[$11_1 + 32 >> 2] == 50976)) { $835($5_1, 94, $2_1, HEAP32[$6_1 + 80 >> 2] + $0_1 | 0, $0_1 + $4_1 | 0); break block5; } $835($5_1, 94, HEAP32[$1_1 + 48 >> 2], HEAP32[$6_1 + 80 >> 2] + 1 | 0, $15_1); } $0_1 = $0_1 + 1 | 0; continue; } break; }; block7 : { if (!HEAP32[$6_1 + 40 >> 2]) { $12_1 = 0; break block7; } $0_1 = $893($10_1); $835($5_1, 94, $2_1, HEAP32[$6_1 + 80 >> 2] + $7_1 | 0, $0_1); $12_1 = $835($5_1, 17, $0_1, 0, 1); $894($10_1, $0_1); } block13 : { if (!(HEAP32[$1_1 + 88 >> 2] | !(HEAPU8[$11_1 + 5 | 0] & 16) | HEAPU8[$6_1 + 17 | 0] == 91)) { $7_1 = $858($5_1, 51, $4_1); block10 : { if (!$3) { $326($5_1, 86, HEAP32[$6_1 + 64 >> 2] + 1 | 0, 1); $326($5_1, 81, $4_1, HEAP32[$6_1 + 64 >> 2]); $0_1 = HEAP32[$6_1 + 64 >> 2]; $835($5_1, 97, $0_1, 2, $0_1 + 2 | 0); $326($5_1, 138, HEAP32[$6_1 + 60 >> 2], HEAP32[$6_1 + 64 >> 2] + 2 | 0); $0_1 = HEAP32[$5_1 + 108 >> 2]; $8_1 = HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0]; break block10; } $312($5_1, 23, HEAP32[$6_1 + 60 >> 2], 0, $4_1, 1); $858($5_1, 130, HEAP32[$6_1 + 60 >> 2]); $0_1 = HEAP32[$5_1 + 108 >> 2]; $9_1 = 82740; $8_1 = HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0]; HEAP32[($8_1 ? $9_1 : (HEAP32[$5_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 40 | 0) + 8 >> 2] = $0_1; } $9_1 = 82740; HEAP32[($8_1 ? $9_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 8 >> 2] = $0_1; break block13; } $0_1 = HEAP32[$6_1 + 64 >> 2]; if ($0_1) { $326($5_1, 86, $0_1 + $14 | 0, 1); break block13; } if (HEAP32[$11_1 + 16 >> 2] == 94) { break block13 } $8_1 = $4_1; block15 : { if (!HEAPU8[$6_1 + 96 | 0]) { break block15 } $0_1 = HEAP32[$5_1 + 108 >> 2]; $7_1 = HEAP32[HEAP32[HEAP32[$6_1 + 72 >> 2] + 20 >> 2] >> 2]; $8_1 = $1060($10_1, $7_1); $976($10_1, HEAP32[HEAP32[$6_1 + 72 >> 2] + 20 >> 2], $8_1, 0, 0); $9_1 = HEAP32[$5_1 + 108 >> 2]; $16_1 = ($0_1 | 0) > ($9_1 | 0) ? $0_1 : $9_1; while (1) { if (($0_1 | 0) == ($16_1 | 0)) { break block15 } $9_1 = 82740; $9_1 = HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $9_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($0_1, 20) | 0; if (!(HEAPU8[$9_1 | 0] != 94 | HEAP32[$9_1 + 4 >> 2] != HEAP32[$1_1 + 48 >> 2])) { HEAP32[$9_1 + 4 >> 2] = $2_1 } $0_1 = $0_1 + 1 | 0; continue; }; } if (HEAPU8[$11_1 + 4 | 0] & 32) { $859($5_1, 85, 0, 0, 0, $1267($10_1, HEAP32[HEAP32[HEAP32[$6_1 + 72 >> 2] + 20 >> 2] + 8 >> 2]), -2) } $835($5_1, $13_1, $3, $8_1, HEAP32[$6_1 + 52 >> 2]); $1043($5_1, $11_1, -7); $0_1 = HEAP32[$5_1 + 108 >> 2]; if (($0_1 | 0) > 0) { HEAP16[(HEAP32[$5_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = $7_1 } if (!HEAPU8[$6_1 + 96 | 0]) { break block13 } $1061($10_1, $8_1, $7_1); } if ($12_1) { $0_1 = 82740; HEAP32[(HEAPU8[HEAP32[$5_1 >> 2] + 87 | 0] ? $0_1 : HEAP32[$5_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) + 8 >> 2] = HEAP32[$5_1 + 108 >> 2]; } $6_1 = HEAP32[$6_1 + 36 >> 2]; continue; } break; }; } function $1372($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; } function $1373($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$0_1 + 48 >> 2] = $5_1; $7_1 = HEAP32[$0_1 + 8 >> 2]; $1_1 = HEAP32[$1_1 + 36 >> 2]; if ($1_1) { $1304($0_1, $2_1, $1_1) } $835($7_1, 97, $3 + $6_1 | 0, $4_1 - $6_1 | 0, $5_1); return $5_1; } function $1374($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $9_1 = global$0 - 16 | 0; $3 = $9_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = HEAP32[$1_1 + 24 >> 2]; $5_1 = ($3 | 0) > 0 ? $3 : 0; $6_1 = $1_1 + 24 | 0; $8_1 = HEAP32[$1_1 + 20 >> 2]; $3 = $8_1; block1 : { block3 : { while (1) { if (($5_1 | 0) != ($7_1 | 0)) { if (HEAP32[$3 + 4 >> 2] == ($2_1 | 0)) { break block1 } if (!(HEAP32[$3 + 8 >> 2] != HEAP32[$2_1 + 28 >> 2] | HEAPU16[$3 + 12 >> 1] != HEAPU16[$2_1 + 32 >> 1])) { $4_1 = HEAPU8[$2_1 | 0]; if (($4_1 | 0) != 179) { break block3 } } $3 = $3 + 16 | 0; $7_1 = $7_1 + 1 | 0; continue; } break; }; $0_1 = $1375(HEAP32[$0_1 >> 2], $8_1, 16, $6_1, $9_1 + 12 | 0); HEAP32[$1_1 + 20 >> 2] = $0_1; $7_1 = HEAP32[$9_1 + 12 >> 2]; if (($7_1 | 0) < 0) { break block1 } $4_1 = $0_1 + ($7_1 << 4) | 0; HEAP32[$4_1 >> 2] = HEAP32[$2_1 + 44 >> 2]; $8_1 = HEAP32[$2_1 + 28 >> 2]; HEAP32[$4_1 + 8 >> 2] = $8_1; $0_1 = HEAPU16[$2_1 + 32 >> 1]; HEAP32[$4_1 + 4 >> 2] = $2_1; HEAP16[$4_1 + 12 >> 1] = $0_1; $5_1 = HEAP32[$1_1 + 16 >> 2]; block7 : { block4 : { if (!$5_1 | HEAPU8[$2_1 | 0] == 179) { break block4 } $3 = 0; $6_1 = HEAP32[$5_1 >> 2]; $10_1 = ($6_1 | 0) > 0 ? $6_1 : 0; $5_1 = $5_1 + 8 | 0; while (1) { if (($3 | 0) == ($10_1 | 0)) { break block4 } $6_1 = HEAP32[$5_1 >> 2]; if (!(!(HEAPU8[$6_1 | 0] != 168 | ($8_1 | 0) != HEAP32[$6_1 + 28 >> 2]) & HEAPU16[$6_1 + 32 >> 1] == ($0_1 | 0))) { $5_1 = $5_1 + 16 | 0; $3 = $3 + 1 | 0; continue; } break; }; HEAP16[$4_1 + 14 >> 1] = $3; if ($3 << 16 >> 16 >= 0) { break block7 } } $0_1 = HEAPU16[$1_1 + 2 >> 1]; HEAP16[$1_1 + 2 >> 1] = $0_1 + 1; HEAP16[$4_1 + 14 >> 1] = $0_1; } $4_1 = HEAPU8[$2_1 | 0]; } HEAP32[$2_1 + 40 >> 2] = $1_1; if (($4_1 | 0) == 168) { HEAP8[$2_1 | 0] = 170 } HEAP16[$2_1 + 34 >> 1] = $7_1; } $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1375($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = HEAP32[$3 >> 2]; HEAP32[$4_1 >> 2] = $5_1; $7_1 = $5_1 >> 31; $6_1 = $7_1 - 1 | 0; $8_1 = $5_1 - 1 | 0; $6_1 = ($8_1 | 0) != -1 ? $6_1 + 1 | 0 : $6_1; block1 : { if ($5_1 & $8_1 | $6_1 & $7_1) { $0_1 = $1_1; break block1; } $6_1 = $7_1 << 1 | $5_1 >>> 31; $7_1 = $5_1 ? $5_1 << 1 : 1; $0_1 = $55($0_1, $1_1, __wasm_i64_mul($7_1, $5_1 ? $6_1 : 0, $2_1, 0), i64toi32_i32$HIGH_BITS); if ($0_1) { break block1 } HEAP32[$4_1 >> 2] = -1; return $1_1; } if ($2_1) { wasm2js_memory_fill(Math_imul($2_1, $5_1) + $0_1 | 0, 0, $2_1) } HEAP32[$3 >> 2] = HEAP32[$3 >> 2] + 1; return $0_1; } function $1377($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = HEAP32[$1_1 + 20 >> 2]; $4_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $1_1 = $1_1 + 36 | 0; while (1) { if (($5_1 | 0) == ($4_1 | 0)) { return 0 } $6_1 = HEAP32[($5_1 << 3) + $1_1 >> 2]; if (HEAP32[($6_1 << 2) + $2_1 >> 2] < 0) { $5_1 = $5_1 + 1 | 0; if (!$3 | HEAP16[$0_1 + 32 >> 1] != ($6_1 | 0)) { continue } } break; }; return 1; } function $1378($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = HEAP32[$1_1 + 20 >> 2]; $7_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $8_1 = $1_1 + 40 | 0; while (1) { if (($5_1 | 0) == ($7_1 | 0)) { return 0 } $1_1 = 0; $4_1 = HEAP16[$0_1 + 34 >> 1]; $9_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $4_1 = HEAP32[($5_1 << 3) + $8_1 >> 2]; block5 : { while (1) { if (($1_1 | 0) != ($9_1 | 0)) { block3 : { if ((!$3 | HEAP16[$0_1 + 32 >> 1] != ($1_1 | 0)) & HEAP32[($1_1 << 2) + $2_1 >> 2] < 0) { break block3 } $6_1 = HEAP32[$0_1 + 4 >> 2] + Math_imul($1_1, 12) | 0; if ($4_1) { if ($67(HEAP32[$6_1 >> 2], $4_1)) { break block3 } break block5; } if (HEAP8[$6_1 + 10 | 0] & 1) { break block5 } } $1_1 = $1_1 + 1 | 0; continue; } break; }; $5_1 = $5_1 + 1 | 0; continue; } break; }; return 1; } function $1380($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if (!(!$0_1 | !$1_1)) { $2_1 = HEAP32[$1_1 >> 2]; $2_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $3 = $1_1 + 12 | 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($2_1 | 0)) { return 0 } $4_1 = $1_1 << 4; $1_1 = $1_1 + 1 | 0; if (($1233($0_1, HEAP32[$3 + $4_1 >> 2]) | 0) < 0) { continue } break; }; } return 1; } function $1381($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $5_1 = global$0 - 384 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $4_1; $4_1 = HEAP32[$0_1 + 132 >> 2]; $10_1 = $4_1 ? $4_1 : $0_1; $7_1 = $10_1 + 140 | 0; $4_1 = $7_1; block2 : { while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { if (($1_1 | 0) == HEAP32[$4_1 >> 2] & HEAP32[$4_1 + 12 >> 2] == ($3 | 0)) { break block2 } $4_1 = $4_1 + 4 | 0; continue; } break; }; $4_1 = 0; $6_1 = HEAP32[$0_1 >> 2]; $9_1 = $270($6_1, 24, 0); block3 : { if (!$9_1) { break block3 } HEAP32[$9_1 + 4 >> 2] = HEAP32[$7_1 >> 2]; HEAP32[$7_1 >> 2] = $9_1; $7_1 = $270($6_1, 28, 0); HEAP32[$9_1 + 8 >> 2] = $7_1; if (!$7_1) { break block3 } $4_1 = HEAP32[$10_1 + 8 >> 2]; HEAP32[$7_1 + 24 >> 2] = HEAP32[$4_1 + 232 >> 2]; HEAP32[$4_1 + 232 >> 2] = $7_1; HEAP32[$9_1 + 16 >> 2] = -1; HEAP32[$9_1 + 20 >> 2] = -1; HEAP32[$9_1 + 12 >> 2] = $3; HEAP32[$9_1 >> 2] = $1_1; $8_1 = $5_1 + 32 | 0; $139($8_1, $6_1); $4_1 = $5_1 + 348 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $5_1 + 340 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $5_1 + 332 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$5_1 + 324 >> 2] = 0; HEAP32[$5_1 + 328 >> 2] = 0; HEAP32[$5_1 + 168 >> 2] = $2_1; HEAP32[$5_1 + 164 >> 2] = $10_1; HEAP32[$5_1 + 320 >> 2] = $8_1; HEAP32[$5_1 + 296 >> 2] = HEAP32[$1_1 >> 2]; HEAP8[$5_1 + 194 | 0] = HEAPU8[$1_1 + 8 | 0]; HEAP16[$5_1 + 192 >> 1] = HEAPU16[$0_1 + 160 >> 1]; HEAP8[$5_1 + 57 | 0] = HEAPU8[$0_1 + 25 | 0]; $8_1 = $856($8_1); block18 : { if ($8_1) { $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { HEAP32[$5_1 + 16 >> 2] = $2_1; $315($8_1, -1, $310($6_1, 7402, $5_1 + 16 | 0), -6); } $2_1 = HEAP32[$1_1 + 12 >> 2]; if ($2_1) { $2_1 = $906($6_1, $2_1, 0); block7 : { if (HEAPU8[$6_1 + 87 | 0]) { break block7 } if ($1096($5_1 + 320 | 0, $2_1)) { break block7 } $11_1 = HEAP32[$5_1 + 92 >> 2] - 1 | 0; HEAP32[$5_1 + 92 >> 2] = $11_1; $1059($5_1 + 32 | 0, $2_1, $11_1, 16); } $11($6_1, $2_1); } $4_1 = $1_1 + 28 | 0; $6_1 = HEAP32[$5_1 + 32 >> 2]; $12_1 = HEAP32[$5_1 + 40 >> 2]; $15_1 = ($3 | 0) != 11; $13_1 = $5_1 + 360 | 0; $16_1 = $13_1 + 16 | 0; $14 = $13_1 + 8 | 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $2_1 = $3; HEAP8[$5_1 + 196 | 0] = $15_1 ? $2_1 : HEAPU8[$4_1 + 1 | 0]; $2_1 = HEAP32[$4_1 + 36 >> 2]; if ($2_1) { HEAP32[$5_1 >> 2] = $2_1; $859($12_1, 184, 2147483647, 1, 0, $310($6_1, 8890, $5_1), -6); } block15 : { block14 : { switch (HEAPU8[$4_1 | 0] - 128 | 0) { case 2: $2_1 = $5_1 + 32 | 0; $964($2_1, $1387($2_1, $4_1), $887($6_1, HEAP32[$4_1 + 24 >> 2], 0), $906($6_1, HEAP32[$4_1 + 20 >> 2], 0), HEAPU8[$5_1 + 196 | 0], 0); $857($12_1, 131); break block15; case 0: $2_1 = $5_1 + 32 | 0; $957($2_1, $1387($2_1, $4_1), $907($6_1, HEAP32[$4_1 + 8 >> 2], 0), $1218($6_1, HEAP32[$4_1 + 28 >> 2]), HEAPU8[$5_1 + 196 | 0], $1388($6_1, HEAP32[$4_1 + 32 >> 2])); $857($12_1, 131); break block15; case 1: $2_1 = $5_1 + 32 | 0; $965($2_1, $1387($2_1, $4_1), $906($6_1, HEAP32[$4_1 + 20 >> 2], 0)); $857($12_1, 131); break block15; default: break block14; }; } $2_1 = $907($6_1, HEAP32[$4_1 + 8 >> 2], 0); HEAP8[$5_1 + 356 | 0] = 4; HEAP32[$16_1 >> 2] = 0; HEAP32[$14 >> 2] = 0; HEAP32[$14 + 4 >> 2] = 0; HEAP32[$13_1 >> 2] = 0; HEAP32[$13_1 + 4 >> 2] = 0; $974($5_1 + 32 | 0, $2_1, $5_1 + 356 | 0); $789($6_1, $2_1); } $4_1 = $4_1 + 40 | 0; continue; } break; }; if ($11_1) { $1013($8_1, $11_1) } $857($8_1, 70); $1389($0_1, $5_1 + 32 | 0); if (!HEAP32[$0_1 + 40 >> 2]) { $2_1 = HEAP32[$8_1 + 104 >> 2]; $331($8_1, $10_1 + 108 | 0); HEAP32[$7_1 + 4 >> 2] = HEAP32[$8_1 + 108 >> 2]; HEAP32[$8_1 + 104 >> 2] = 0; HEAP32[$7_1 >> 2] = $2_1; } HEAP32[$7_1 + 8 >> 2] = HEAP32[$5_1 + 80 >> 2]; $2_1 = HEAP32[$5_1 + 76 >> 2]; HEAP32[$7_1 + 20 >> 2] = $1_1; HEAP32[$7_1 + 12 >> 2] = $2_1; HEAP32[$9_1 + 16 >> 2] = HEAP32[$5_1 + 184 >> 2]; HEAP32[$9_1 + 20 >> 2] = HEAP32[$5_1 + 188 >> 2]; $7($8_1); break block18; } $1389($0_1, $5_1 + 32 | 0); } $141($5_1 + 32 | 0); $4_1 = $9_1; } HEAP32[HEAP32[$0_1 >> 2] + 68 >> 2] = -1; } $0_1 = $5_1 + 384 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1382($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; $6_1 = $856($0_1); $4_1 = $1381($0_1, $1_1, $2_1, $4_1); block : { if (!$4_1) { break block } if (HEAP32[$1_1 >> 2]) { $2_1 = !(HEAPU8[HEAP32[$0_1 >> 2] + 33 | 0] & 32) } else { $2_1 = 0 } $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 48 >> 2] + 1 | 0; HEAP32[$1_1 + 48 >> 2] = $0_1; $859($6_1, 48, $3, $5_1, $0_1, HEAP32[$4_1 + 8 >> 2], -4); $0_1 = HEAP32[$6_1 + 108 >> 2]; if (($0_1 | 0) <= 0) { break block } HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = $2_1; } } function $1383($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$1_1 + 32 >> 2]; $3 = HEAP32[$2_1 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $2_1 = $2_1 + 16 | 0; block : { while (1) { if (($4_1 | 0) == ($3 | 0)) { break block } $5_1 = Math_imul($4_1, 48); $4_1 = $4_1 + 1 | 0; if (HEAP32[$2_1 + $5_1 >> 2] != HEAP32[$0_1 + 24 >> 2]) { continue } break; }; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 536870912; HEAP16[$0_1 + 20 >> 1] = 1; } return 0; } function $1384($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$1_1 + 4 >> 2]; if (!(!($0_1 & 4096) | !(HEAPU8[HEAP32[$1_1 + 20 >> 2] + 7 | 0] & 32))) { HEAP32[$1_1 + 4 >> 2] = $0_1 | 64 } return 0; } function $1385($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $9_1 = $856($0_1); $12_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $12_1; $10_1 = HEAP32[$0_1 + 44 >> 2]; if (($7_1 | 0) < 0) { $326($9_1, 49, HEAPU8[$4_1 + 24 | 0], $12_1) } $13_1 = $10_1 - 1 | 0; $14 = $6_1 + 1 | 0; $10_1 = 0; while (1) { $11_1 = HEAP32[$4_1 + 20 >> 2]; if (!(($11_1 | 0) <= ($10_1 | 0))) { $326($9_1, 51, $1111(HEAP32[$4_1 >> 2], HEAP16[($10_1 << 2) + $5_1 >> 1]) + $14 | 0, $12_1); $10_1 = $10_1 + 1 | 0; continue; } break; }; block2 : { if ($8_1) { break block2 } if (!$3) { $3 = $893($0_1); $326($9_1, 81, $1111(HEAP32[$4_1 >> 2], HEAP16[$5_1 >> 1]) + $14 | 0, $3); $5_1 = $326($9_1, 13, $3, 0); block4 : { if (($7_1 | 0) != 1 | HEAP32[$4_1 >> 2] != ($2_1 | 0)) { break block4 } $835($9_1, 54, $6_1, $12_1, $3); $6_1 = HEAP32[$9_1 + 108 >> 2]; if (($6_1 | 0) <= 0) { break block4 } HEAP16[(HEAP32[$9_1 + 104 >> 2] + Math_imul($6_1, 20) | 0) - 18 >> 1] = 144; } $860($0_1, $13_1, $1_1, $2_1, 102); $835($9_1, 31, $13_1, 0, $3); $863($9_1, $12_1); $1_1 = HEAP32[$9_1 + 108 >> 2]; block6 : { if (HEAPU8[HEAP32[$9_1 >> 2] + 87 | 0]) { HEAP32[20687] = $1_1; $2_1 = 82740; break block6; } $2_1 = HEAP32[$9_1 + 104 >> 2]; HEAP32[($2_1 + Math_imul($1_1, 20) | 0) - 32 >> 2] = $1_1; $2_1 = $2_1 + Math_imul($5_1, 20) | 0; } HEAP32[$2_1 + 8 >> 2] = $1_1; $894($0_1, $3); break block2; } $8_1 = $1060($0_1, $11_1); $835($9_1, 102, $13_1, HEAP32[$3 + 44 >> 2], $1_1); $1097($0_1, $3); $10_1 = 0; $1_1 = ($11_1 | 0) > 0 ? $11_1 : 0; while (1) { $16_1 = HEAP32[$4_1 >> 2]; if (!(($1_1 | 0) == ($10_1 | 0))) { $326($9_1, 80, $1111($16_1, HEAP16[($10_1 << 2) + $5_1 >> 1]) + $14 | 0, $8_1 + $10_1 | 0); $10_1 = $10_1 + 1 | 0; continue; } break; }; if (!(($7_1 | 0) != 1 | ($2_1 | 0) != ($16_1 | 0))) { $16_1 = ($11_1 + HEAP32[$9_1 + 108 >> 2] | 0) + 1 | 0; $10_1 = 0; while (1) { if (($1_1 | 0) != ($10_1 | 0)) { $17_1 = $1111(HEAP32[$4_1 >> 2], HEAP16[($10_1 << 2) + $5_1 >> 1]) + $14 | 0; $15_1 = HEAPU16[HEAP32[$3 + 4 >> 2] + ($10_1 << 1) >> 1]; $835($9_1, 53, $17_1, $16_1, (wasm2js_i32$0 = $6_1, wasm2js_i32$1 = $1111(HEAP32[$3 + 12 >> 2], $15_1 << 16 >> 16) + $14 | 0, wasm2js_i32$2 = ($15_1 | 0) == HEAPU16[$2_1 + 32 >> 1], wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1)); $15_1 = HEAP32[$9_1 + 108 >> 2]; if (($15_1 | 0) > 0) { HEAP16[(HEAP32[$9_1 + 104 >> 2] + Math_imul($15_1, 20) | 0) - 18 >> 1] = 16 } $10_1 = $10_1 + 1 | 0; continue; } break; }; $863($9_1, $12_1); } $859($9_1, 96, $8_1, $11_1, 0, $1098(HEAP32[$0_1 >> 2], $3), $11_1); $312($9_1, 29, $13_1, $12_1, $8_1, $11_1); $1061($0_1, $8_1, $11_1); } $1_1 = HEAPU8[$4_1 + 24 | 0]; block13 : { block11 : { if ($1_1) { break block11 } if (!(HEAPU8[$0_1 + 20 | 0] | (HEAP32[$0_1 + 132 >> 2] | HEAPU8[HEAP32[$0_1 >> 2] + 34 | 0] & 8))) { $1012($0_1, 787, 2, 0, -1, 4); break block13; } if (($7_1 | 0) <= 0) { break block11 } $2_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($2_1 ? $2_1 : $0_1) + 21 | 0] = 1; } $326($9_1, 158, $1_1, $7_1); } $1013($9_1, $12_1); $858($9_1, 122, $13_1); } function $1386($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $8_1 = global$0 - 48 | 0; $9_1 = $8_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $9_1; $11_1 = HEAP32[$0_1 >> 2]; $13_1 = $856($0_1); if (($7_1 | 0) < 0) { $14 = $326($13_1, 49, HEAPU8[$4_1 + 24 | 0], 0) } $15_1 = $4_1 + 36 | 0; $9_1 = 0; while (1) { if (!(HEAP32[$4_1 + 20 >> 2] <= ($9_1 | 0))) { if ($3) { $12_1 = HEAP16[HEAP32[$3 + 4 >> 2] + ($9_1 << 1) >> 1] } else { $12_1 = 65535 } $10_1 = $948($0_1, $10_1, $903($0_1, 54, $1390($0_1, $2_1, $6_1, $12_1 << 16 >> 16), $942($11_1, 60, HEAP32[HEAP32[HEAP32[$4_1 >> 2] + 4 >> 2] + Math_imul(HEAP16[($5_1 ? ($9_1 << 2) + $5_1 | 0 : $15_1) >> 1], 12) >> 2]))); $9_1 = $9_1 + 1 | 0; continue; } break; }; if (!(HEAP32[$4_1 >> 2] != ($2_1 | 0) | ($7_1 | 0) <= 0)) { $12_1 = $10_1; block8 : { block6 : { if (HEAPU8[$2_1 + 28 | 0] & 128) { $5_1 = 0; $9_1 = 0; while (1) { if (HEAPU16[$3 + 50 >> 1] <= $9_1 >>> 0) { break block6 } $10_1 = $5_1; $5_1 = HEAP16[HEAP32[$3 + 4 >> 2] + ($9_1 << 1) >> 1]; $5_1 = $948($0_1, $10_1, $903($0_1, 45, $1390($0_1, $2_1, $6_1, $5_1), $942($11_1, 60, HEAP32[HEAP32[$2_1 + 4 >> 2] + Math_imul($5_1, 12) >> 2]))); $9_1 = $9_1 + 1 | 0; continue; }; } $5_1 = $1390($0_1, $2_1, $6_1, -1); $6_1 = HEAP32[$1_1 + 24 >> 2]; $3 = $942($11_1, 168, 0); if ($3) { HEAP16[$3 + 32 >> 1] = 65535; HEAP32[$3 + 28 >> 2] = $6_1; HEAP32[$3 + 44 >> 2] = $2_1; } $2_1 = $903($0_1, 53, $5_1, $3); break block8; } $2_1 = $903($0_1, 19, $5_1, 0); } $10_1 = $948($0_1, $12_1, $2_1); } HEAP32[$8_1 + 44 >> 2] = 0; $2_1 = $8_1 + 36 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $2_1 = $8_1 + 28 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$8_1 + 20 >> 2] = 0; HEAP32[$8_1 + 24 >> 2] = 0; HEAP32[$8_1 + 16 >> 2] = $1_1; HEAP32[$8_1 + 12 >> 2] = $0_1; $1096($8_1 + 12 | 0, $10_1); block9 : { if (HEAP32[$0_1 + 40 >> 2]) { break block9 } $0_1 = $1044($0_1, $1_1, $10_1, 0, 0, 0, 0, 0); $326($13_1, 158, HEAPU8[$4_1 + 24 | 0], $7_1); if (!$0_1) { break block9 } $1054($0_1); } $11($11_1, $10_1); if ($14) { $1100($13_1, $14) } $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1387($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[$0_1 >> 2]; $6_1 = $116($5_1, HEAP32[$1_1 + 12 >> 2]); block3 : { block4 : { block5 : { $3 = $932($0_1, 0, 0, 0); if ($3) { $2_1 = HEAP32[HEAP32[$1_1 + 4 >> 2] + 20 >> 2]; HEAP32[$3 + 8 >> 2] = $6_1; if (HEAP32[HEAP32[$5_1 + 16 >> 2] + 28 >> 2] != ($2_1 | 0)) { HEAP32[$3 + 52 >> 2] = $2_1; HEAP8[$3 + 23 | 0] = HEAPU8[$3 + 23 | 0] | 1; } $2_1 = HEAP32[$1_1 + 16 >> 2]; if (!$2_1) { $2_1 = $3; break block3; } $2_1 = $909($5_1, $2_1, 0); $1_1 = 0; if (!$2_1) { break block4 } if (HEAP32[$2_1 >> 2] < 2 | HEAPU8[$0_1 + 224 | 0] > 1) { break block5 } $1_1 = $939($0_1, 0, $2_1, 0, 0, 0, 0, 2048, 0); HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 0; $1_1 = $962($0_1, 0, 0, 0, $4_1 + 8 | 0, $1_1, 0); break block4; } $10($5_1, $6_1); break block3; } $1_1 = $2_1; } $2_1 = $963($0_1, $3, $1_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1388($0_1, $1_1) { if (!$1_1) { return 0 } return $956($0_1, $887($0_1, HEAP32[$1_1 >> 2], 0), $906($0_1, HEAP32[$1_1 + 4 >> 2], 0), $887($0_1, HEAP32[$1_1 + 8 >> 2], 0), $906($0_1, HEAP32[$1_1 + 12 >> 2], 0), $1388($0_1, HEAP32[$1_1 + 16 >> 2])); } function $1389($0_1, $1_1) { if (!HEAP32[$0_1 + 40 >> 2]) { HEAP32[$0_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2]; HEAP32[$0_1 + 40 >> 2] = HEAP32[$1_1 + 40 >> 2]; HEAP32[$0_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2]; return; } $10(HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); } function $1390($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = HEAP32[$0_1 >> 2]; $4_1 = $942($5_1, 176, 0); if ($4_1) { if (!(HEAPU16[$1_1 + 32 >> 1] == ($3 & 65535) | ($3 | 0) < 0)) { $6_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$4_1 + 28 >> 2] = ($1111($1_1, $3) + $2_1 | 0) + 1; $1_1 = $6_1 + Math_imul($3, 12) | 0; HEAP8[$4_1 + 1 | 0] = HEAPU8[$1_1 + 5 | 0]; $3 = $419($1_1); if (!$3) { $3 = HEAP32[HEAP32[$5_1 + 8 >> 2] >> 2] } return $1246($0_1, $4_1, $3); } HEAP8[$4_1 + 1 | 0] = 68; HEAP32[$4_1 + 28 >> 2] = $2_1; } else { $4_1 = $6_1 } return $4_1; } function $1391($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; block : { if (HEAPU8[$1_1 | 0] != 168) { break block } $1_1 = HEAP16[$1_1 + 32 >> 1]; if (($1_1 | 0) < 0) { $1_1 = 2 } else { if (HEAP32[HEAP32[$0_1 + 24 >> 2] + ($1_1 << 2) >> 2] < 0) { break block } $1_1 = 1; } HEAP16[$0_1 + 20 >> 1] = $1_1 | HEAPU16[$0_1 + 20 >> 1]; } return 0; } function $1392($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; block : { if (HEAPU8[$1_1 | 0] != 168) { break block } $1_1 = HEAP16[$1_1 + 32 >> 1]; if (($1_1 | 0) < 0) { break block } HEAP16[$0_1 + 20 >> 1] = HEAPU16[$0_1 + 20 >> 1] | HEAPU16[(HEAP32[HEAP32[$0_1 + 24 >> 2] + 4 >> 2] + Math_imul($1_1, 12) | 0) + 10 >> 1]; } return 0; } function $1393($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $7_1 = HEAP32[$1_1 + 40 >> 2]; $8_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 8 >> 2]; $9_1 = $1127($1_1, $3); block : { if (!$3 | ($4_1 | 0) == ($7_1 | 0)) { break block } if (!(HEAPU8[$2_1 + 28 | 0] & 128)) { $3 = $893($0_1); $326($6_1, 142, $4_1, $3); $835($6_1, 30, $7_1, 0, $3); $894($0_1, $3); break block; } $5_1 = HEAP32[$0_1 + 48 >> 2]; $11_1 = $359($2_1); $10_1 = HEAPU16[$11_1 + 50 >> 1]; HEAP32[$0_1 + 48 >> 2] = $5_1 + $10_1; $12_1 = $5_1 + 1 | 0; $5_1 = 0; while (1) { if (!(($5_1 | 0) == ($10_1 | 0))) { $835($6_1, 94, $4_1, $889($3, HEAP16[HEAP32[$11_1 + 4 >> 2] + ($5_1 << 1) >> 1]), $5_1 + $12_1 | 0); $5_1 = $5_1 + 1 | 0; continue; } break; }; $3 = $312($6_1, 29, $7_1, 0, $12_1, $10_1); $859($6_1, 70, 11, 2, 0, 13660, -1); $4_1 = HEAP32[$0_1 + 132 >> 2]; HEAP8[($4_1 ? $4_1 : $0_1) + 21 | 0] = 1; $4_1 = HEAP32[$6_1 + 108 >> 2]; $5_1 = 82740; HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? $5_1 : HEAP32[$6_1 + 104 >> 2] + Math_imul($3, 20) | 0) + 8 >> 2] = $4_1; } $5_1 = 0; $3 = $909($8_1, HEAP32[$1_1 + 32 >> 2], 0); while (1) { if (($5_1 | 0) < HEAP16[$2_1 + 34 >> 1]) { if (HEAPU8[(HEAP32[$2_1 + 4 >> 2] + Math_imul($5_1, 12) | 0) + 5 | 0] == 69) { $858($6_1, 87, HEAP32[$1_1 + 36 >> 2] + $5_1 | 0) } $5_1 = $5_1 + 1 | 0; continue; } break; }; $964($0_1, $3, $887($8_1, HEAP32[$9_1 + 8 >> 2], 0), $906($8_1, HEAP32[$9_1 + 12 >> 2], 0), 2, $9_1); } function $1394($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $5_1 = global$0 + -64 | 0; $1_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $1_1; $3 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; HEAP32[$5_1 + 60 >> 2] = 0; HEAP32[$5_1 + 56 >> 2] = 0; HEAP32[$5_1 + 48 >> 2] = 0; $1_1 = $53(HEAP32[$2_1 >> 2]); $9_1 = $1_1 ? $1_1 : 30822; $2_1 = $53(HEAP32[$2_1 + 4 >> 2]); block1 : { block2 : { block28 : { block27 : { block9 : { block20 : { block17 : { block16 : { block5 : { if (HEAPU8[$3 + 178 | 0] & 4) { HEAP32[$5_1 + 52 >> 2] = 0; $1_1 = $18(18148); HEAP32[$5_1 + 44 >> 2] = $1_1; if (!$1_1) { break block1 } $2_1 = $410($1_1, 51612, $3, $5_1 + 52 | 0, 0, 256); if ($2_1) { break block2 } $2_1 = HEAP32[$5_1 + 52 >> 2]; $1_1 = $411($3, $2_1); if ($1_1) { $4_1 = HEAP32[$3 + 16 >> 2] + (HEAPU8[$3 + 176 | 0] << 4) | 0; $7_1 = HEAP32[$4_1 + 4 >> 2]; if ($7_1) { $195($7_1) } HEAP32[$4_1 + 12 >> 2] = $1_1; HEAP32[$4_1 + 4 >> 2] = $2_1; HEAP8[$3 + 95 | 0] = 0; break block5; } $195($2_1); $2_1 = 7; break block2; } block7 : { $1_1 = HEAP32[$3 + 20 >> 2]; $4_1 = HEAP32[$3 + 148 >> 2]; block8 : { if (($1_1 | 0) < ($4_1 + 2 | 0)) { $7_1 = $2_1 ? $2_1 : 30822; $2_1 = 0; $4_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (($2_1 | 0) == ($4_1 | 0)) { break block7 } $6_1 = $828($3, $2_1, $7_1); $2_1 = $2_1 + 1 | 0; if (!$6_1) { continue } break; }; HEAP32[$5_1 + 16 >> 2] = $7_1; $4_1 = $310($3, 13556, $5_1 + 16 | 0); break block8; } HEAP32[$5_1 + 32 >> 2] = $4_1; $4_1 = $310($3, 17105, $5_1 + 32 | 0); } HEAP32[$5_1 + 48 >> 2] = $4_1; $2_1 = 0; break block9; } $2_1 = HEAP32[$3 + 16 >> 2]; block11 : { if (($2_1 | 0) == ($3 + 460 | 0)) { $2_1 = $325($3, 48, 0); if (!$2_1) { break block1 } $1_1 = HEAP32[$3 + 16 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = $4_1; $6_1 = $1_1 + 24 | 0; $8_1 = HEAP32[$6_1 + 4 >> 2]; $4_1 = $2_1 + 24 | 0; HEAP32[$4_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$4_1 + 4 >> 2] = $8_1; $6_1 = $1_1 + 16 | 0; $8_1 = HEAP32[$6_1 + 4 >> 2]; $4_1 = $2_1 + 16 | 0; HEAP32[$4_1 >> 2] = HEAP32[$6_1 >> 2]; HEAP32[$4_1 + 4 >> 2] = $8_1; $1_1 = $1_1 + 8 | 0; $6_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = $2_1 + 8 | 0; HEAP32[$4_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$4_1 + 4 >> 2] = $6_1; break block11; } $2_1 = $55($3, $2_1, ($1_1 << 4) + 16 | 0, 0); if (!$2_1) { break block1 } } HEAP32[$3 + 16 >> 2] = $2_1; $4_1 = (HEAP32[$3 + 20 >> 2] << 4) + $2_1 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $1_1 = $4_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$5_1 + 52 >> 2] = HEAP32[$3 + 60 >> 2]; $1_1 = $409(HEAP32[HEAP32[$3 >> 2] + 16 >> 2], $9_1, $5_1 + 52 | 0, $5_1 + 44 | 0, $5_1 + 60 | 0, $5_1 + 56 | 0); if ($1_1) { if (($1_1 | 0) == 7) { $106($3) } $1_1 = $0_1; $0_1 = HEAP32[$5_1 + 56 >> 2]; $235($1_1, $0_1, -1); $24($0_1); break block1; } $1_1 = HEAP32[$3 + 36 >> 2]; block15 : { if (!($1_1 & 32)) { $1_1 = HEAP32[$5_1 + 52 >> 2] & -8 | 1; break block15; } $2_1 = HEAP32[$5_1 + 52 >> 2]; $1_1 = !($1_1 & 16) ? $2_1 & -5 : $2_1; } $1_1 = $1_1 | 256; HEAP32[$5_1 + 52 >> 2] = $1_1; $6_1 = HEAP32[$5_1 + 60 >> 2]; $8_1 = $4_1 + 4 | 0; $2_1 = $410(HEAP32[$5_1 + 44 >> 2], $6_1, $3, $8_1, 0, $1_1); HEAP32[$3 + 20 >> 2] = HEAP32[$3 + 20 >> 2] + 1; HEAP32[$4_1 >> 2] = $116($3, $7_1); HEAP8[$3 + 95 | 0] = 0; if (($2_1 | 0) == 19) { break block16 } if ($2_1) { break block17 } $2_1 = HEAP32[$8_1 >> 2]; } $1_1 = $411($3, $2_1); HEAP32[$4_1 + 12 >> 2] = $1_1; block19 : { if (!$1_1) { $7_1 = 0; $2_1 = 7; break block19; } $7_1 = 1; $2_1 = 0; if (!HEAPU8[$1_1 + 76 | 0] | HEAPU8[$1_1 + 77 | 0] == HEAPU8[$3 + 84 | 0]) { break block19 } $7_1 = 0; HEAP32[$5_1 + 48 >> 2] = $310($3, 13677, 0); $2_1 = 1; } $1_1 = HEAP32[$4_1 + 4 >> 2]; $8_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$8_1 + 4 >> 2] = HEAP32[$1_1 >> 2]; $1140(HEAP32[$8_1 >> 2], HEAPU8[$3 + 89 | 0]); $1139(HEAP32[$4_1 + 4 >> 2], $1139(HEAP32[HEAP32[$3 + 16 >> 2] + 4 >> 2], -1)); $785(HEAP32[$4_1 + 4 >> 2], HEAP32[$3 + 32 >> 2] & 56 | 3); HEAP8[$4_1 + 8 | 0] = 3; if (!$7_1) { break block20 } $2_1 = HEAP32[$4_1 >> 2] ? 0 : 7; break block20; } HEAP32[$5_1 + 48 >> 2] = $310($3, 16485, 0); $2_1 = 1; } HEAP8[$4_1 + 8 | 0] = 3; } $413($6_1); if (!$2_1) { $4($3); HEAP8[$3 + 176 | 0] = 0; HEAP32[$3 + 24 >> 2] = HEAP32[$3 + 24 >> 2] & -17; if (HEAPU8[$3 + 178 | 0] & 4) { break block1 } $2_1 = $416($3, $5_1 + 48 | 0); if (!$2_1) { break block1 } } if (HEAPU8[$3 + 178 | 0] & 4) { $4_1 = HEAP32[$5_1 + 48 >> 2]; break block9; } $1_1 = HEAP32[$3 + 20 >> 2] - 1 | 0; $4_1 = HEAP32[(HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0) + 4 >> 2]; if ($4_1) { $195($4_1); $4_1 = HEAP32[$3 + 16 >> 2] + ($1_1 << 4) | 0; HEAP32[$4_1 + 12 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; } $148($3); HEAP32[$3 + 20 >> 2] = $1_1; block26 : { if (!(($2_1 | 0) != 3082 & ($2_1 | 0) != 7)) { $106($3); $10($3, HEAP32[$5_1 + 48 >> 2]); $4_1 = $310($3, 1162, 0); break block26; } $4_1 = HEAP32[$5_1 + 48 >> 2]; if ($4_1) { break block27 } HEAP32[$5_1 >> 2] = $9_1; $4_1 = $310($3, 8242, $5_1); } HEAP32[$5_1 + 48 >> 2] = $4_1; } if (!$4_1) { break block28 } } $235($0_1, $4_1, -1); $10($3, HEAP32[$5_1 + 48 >> 2]); } if (!$2_1) { break block1 } } $255($0_1, $2_1); } $0_1 = $5_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1395($0_1, $1_1) { if ($1_1) { if (HEAPU8[$1_1 | 0] != 60) { return $1096($0_1, $1_1) } HEAP8[$1_1 | 0] = 118; } return 0; } function $1396($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $1_1 = global$0 - 144 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $3 = $53(HEAP32[$2_1 >> 2]); $2_1 = 0; $5_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $4_1 = HEAP32[$5_1 + 20 >> 2]; $8_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $6_1 = $3 ? $3 : 30822; block6 : { block1 : { while (1) { if (($2_1 | 0) == ($8_1 | 0)) { $2_1 = 8270; break block1; } block3 : { $7_1 = HEAP32[$5_1 + 16 >> 2]; $3 = $7_1 + ($2_1 << 4) | 0; $4_1 = HEAP32[$3 + 4 >> 2]; if ($4_1) { if ($828($5_1, $2_1, $6_1)) { break block3 } } $2_1 = $2_1 + 1 | 0; continue; } break; }; if ($2_1 >>> 0 < 2) { $2_1 = 6866; break block1; } $2_1 = 16189; if (HEAPU8[$4_1 + 8 | 0] | HEAP32[$4_1 + 16 >> 2]) { break block1 } $2_1 = HEAP32[$7_1 + 28 >> 2] + 48 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $0_1 = HEAP32[$2_1 + 8 >> 2]; if (HEAP32[$0_1 + 24 >> 2] != HEAP32[$3 + 12 >> 2]) { continue } HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 20 >> 2]; continue; } break; }; $195($4_1); HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $160($5_1); break block6; } HEAP32[$1_1 >> 2] = $6_1; $235($0_1, $63(128, $1_1 + 16 | 0, $2_1, $1_1), -1); } $0_1 = $1_1 + 144 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1397($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $5_1 = global$0 - 48 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $12_1 = HEAP32[$0_1 >> 2]; $8_1 = $856($0_1); block : { if (!$8_1) { break block } $11_1 = HEAP32[$12_1 + 16 >> 2] + ($1_1 << 4) | 0; while (1) { if (!(($7_1 | 0) == 3)) { $6_1 = ($5_1 + 33 | 0) + $7_1 | 0; HEAP8[$6_1 | 0] = 0; $13_1 = ($7_1 << 3) + 51728 | 0; $9_1 = HEAP32[$13_1 >> 2]; $10_1 = $319($12_1, $9_1, HEAP32[$11_1 >> 2]); block3 : { if (!$10_1) { if ($7_1) { break block3 } $10_1 = HEAP32[$11_1 >> 2]; HEAP32[$5_1 + 8 >> 2] = HEAP32[$13_1 + 4 >> 2]; HEAP32[$5_1 + 4 >> 2] = $9_1; HEAP32[$5_1 >> 2] = $10_1; $884($0_1, 25317, $5_1); HEAP32[$5_1 + 36 >> 2] = HEAP32[$0_1 + 104 >> 2]; HEAP8[$6_1 | 0] = 16; break block3; } $6_1 = HEAP32[$10_1 + 20 >> 2]; HEAP32[($5_1 + 36 | 0) + ($7_1 << 2) >> 2] = $6_1; $988($0_1, $1_1, $6_1, 1, $9_1); if ($3) { $6_1 = HEAP32[$11_1 >> 2]; HEAP32[$5_1 + 28 >> 2] = $3; HEAP32[$5_1 + 24 >> 2] = $4_1; HEAP32[$5_1 + 20 >> 2] = $9_1; HEAP32[$5_1 + 16 >> 2] = $6_1; $884($0_1, 19668, $5_1 + 16 | 0); break block3; } $326($8_1, 145, $6_1, $1_1); } $7_1 = $7_1 + 1 | 0; continue; } break; }; $312($8_1, 113, $2_1, HEAP32[$5_1 + 36 >> 2], $1_1, 3); $0_1 = HEAP32[$8_1 + 108 >> 2]; if (($0_1 | 0) <= 0) { break block } HEAP16[(HEAP32[$8_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = HEAPU8[$5_1 + 33 | 0]; } $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1398($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0; $16_1 = $4_1 + 9 | 0; if (($16_1 | 0) > HEAP32[$0_1 + 48 >> 2]) { HEAP32[$0_1 + 48 >> 2] = $16_1 } $17_1 = HEAP32[$0_1 >> 2]; $6_1 = $856($0_1); block1 : { if (!$1_1 | !$6_1 | HEAPU8[$1_1 + 43 | 0]) { break block1 } $7_1 = HEAP32[$1_1 >> 2]; if ($7_1) { $9_1 = $344(29257, $7_1, 31420, 92) } else { $9_1 = 1 } if (!$9_1) { break block1 } $9_1 = HEAP32[$17_1 + 16 >> 2]; $19_1 = $309($17_1, HEAP32[$1_1 + 60 >> 2]); if ($864($0_1, 28, $7_1, 0, HEAP32[$9_1 + ($19_1 << 4) >> 2])) { break block1 } $21_1 = $4_1 + 8 | 0; $25 = $4_1 + 7 | 0; $26_1 = $4_1 + 5 | 0; $11_1 = $4_1 + 4 | 0; $27 = $4_1 + 3 | 0; $18_1 = $4_1 + 2 | 0; $22_1 = $4_1 + 1 | 0; $988($0_1, $19_1, HEAP32[$1_1 + 20 >> 2], 0, HEAP32[$1_1 >> 2]); $7_1 = HEAP32[$0_1 + 44 >> 2]; $8_1 = $5_1 + 2 | 0; HEAP32[$0_1 + 44 >> 2] = ($7_1 | 0) > ($8_1 | 0) ? $7_1 : $8_1; $860($0_1, $5_1, $19_1, $1_1, 102); $23_1 = $4_1 + 6 | 0; $861($6_1, $23_1, HEAP32[$1_1 >> 2]); $7_1 = $1_1 + 8 | 0; $14 = $5_1 + 1 | 0; $24_1 = 1; while (1) { $8_1 = HEAP32[$7_1 >> 2]; if ($8_1) { block4 : { if (!!$2_1 & ($2_1 | 0) != ($8_1 | 0)) { break block4 } block8 : { block7 : { $12_1 = HEAPU8[$8_1 + 55 | 0] | HEAPU8[$8_1 + 56 | 0] << 8; block6 : { if (!(!(HEAPU8[$1_1 + 28 | 0] & 128) | ($12_1 & 3) != 2)) { $10_1 = HEAP32[$1_1 >> 2]; $7_1 = HEAPU16[$8_1 + 50 >> 1]; break block6; } $10_1 = HEAP32[$8_1 >> 2]; $7_1 = HEAPU16[$8_1 + 52 >> 1]; if ($12_1 & 8) { break block7 } } $9_1 = $7_1; break block8; } $9_1 = HEAPU16[$8_1 + 50 >> 1]; } $12_1 = HEAP32[$8_1 + 36 >> 2]; $861($6_1, $25, $10_1); $10_1 = $9_1 - 1 | 0; $13_1 = $10_1 + $16_1 | 0; if (($13_1 | 0) > HEAP32[$0_1 + 48 >> 2]) { HEAP32[$0_1 + 48 >> 2] = $13_1 } $24_1 = $12_1 ? $24_1 : 0; $835($6_1, 102, $14, HEAP32[$8_1 + 44 >> 2], $19_1); $1097($0_1, $8_1); $326($6_1, 71, HEAP32[$17_1 + 496 >> 2], $26_1); $326($6_1, 71, $7_1, $18_1); $326($6_1, 71, HEAPU16[$8_1 + 50 >> 1], $27); $835($6_1, 98, $14, $11_1, HEAP32[$17_1 + 80 >> 2] >>> 11 & 1); $1178($0_1, 0, $18_1, $22_1, 4, 51752, 0); $12_1 = $858($6_1, 36, $14); $326($6_1, 71, 0, $18_1); block11 : { if ($9_1 >>> 0 < 2) { $9_1 = HEAP32[$6_1 + 108 >> 2]; break block11; } $13_1 = HEAP32[$0_1 + 60 >> 2] - 1 | 0; HEAP32[$0_1 + 60 >> 2] = $13_1; $20_1 = $325($17_1, $10_1 << 2, 0); if (!$20_1) { break block4 } $857($6_1, 9); $9_1 = HEAP32[$6_1 + 108 >> 2]; if (!(!HEAPU8[$8_1 + 54 | 0] | (($10_1 | 0) != 1 | HEAPU16[$8_1 + 50 >> 1] != 1))) { $326($6_1, 52, $16_1, $13_1) } $7_1 = 0; while (1) { if (($7_1 | 0) != ($10_1 | 0)) { $15_1 = $7_1 << 2; $28_1 = $985($0_1, HEAP32[$15_1 + HEAP32[$8_1 + 32 >> 2] >> 2]); $326($6_1, 71, $7_1, $18_1); $835($6_1, 94, $14, $7_1, $11_1); HEAP32[$20_1 + $15_1 >> 2] = $859($6_1, 53, $11_1, 0, $7_1 + $16_1 | 0, $28_1, -2); $15_1 = HEAP32[$6_1 + 108 >> 2]; if (($15_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($15_1, 20) | 0) - 18 >> 1] = 128 } $7_1 = $7_1 + 1 | 0; continue; } break; }; $326($6_1, 71, $10_1, $18_1); $863($6_1, $13_1); HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? 82740 : (HEAP32[$6_1 + 104 >> 2] + Math_imul($9_1, 20) | 0) - 20 | 0) + 8 >> 2] = HEAP32[$6_1 + 108 >> 2]; $7_1 = 0; while (1) { if (($7_1 | 0) != ($10_1 | 0)) { if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { $15_1 = 82740 } else { $15_1 = HEAP32[$6_1 + 104 >> 2] + Math_imul(HEAP32[$20_1 + ($7_1 << 2) >> 2], 20) | 0 } HEAP32[$15_1 + 8 >> 2] = HEAP32[$6_1 + 108 >> 2]; $835($6_1, 94, $14, $7_1, $7_1 + $16_1 | 0); $7_1 = $7_1 + 1 | 0; continue; } break; }; $1013($6_1, $13_1); $13($17_1, $20_1); } $1178($0_1, 1, $22_1, $11_1, 2, 51792, 0); block22 : { if (HEAP32[$17_1 + 496 >> 2]) { $7_1 = $858($6_1, 51, $11_1); $10_1 = $858($6_1, 16, $11_1); $13_1 = $312($6_1, 24, $14, 0, $16_1, 1); HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$6_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) + 8 >> 2] = HEAP32[$6_1 + 108 >> 2]; $326($6_1, 39, $14, $9_1); $7_1 = HEAP32[$6_1 + 108 >> 2]; block21 : { if (HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0]) { HEAP32[20687] = $7_1; $9_1 = 82740; break block21; } $9_1 = HEAP32[$6_1 + 104 >> 2]; HEAP32[($9_1 + Math_imul($10_1, 20) | 0) + 8 >> 2] = $7_1; $9_1 = $9_1 + Math_imul($13_1, 20) | 0; } HEAP32[$9_1 + 8 >> 2] = $7_1; break block22; } $326($6_1, 39, $14, $9_1); } if (HEAP32[$8_1 + 36 >> 2]) { HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$6_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) + 8 >> 2] = HEAP32[$6_1 + 108 >> 2]; $12_1 = 0; } $1178($0_1, 0, $22_1, $21_1, 1, 51832, 0); $859($6_1, 97, $23_1, 3, $11_1, 21013, 0); $326($6_1, 127, $3, $4_1); $835($6_1, 128, $3, $11_1, $4_1); $7_1 = HEAP32[$6_1 + 108 >> 2]; if (($7_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($7_1, 20) | 0) - 18 >> 1] = 8 } if (!$12_1) { break block4 } HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$6_1 + 104 >> 2] + Math_imul($12_1, 20) | 0) + 8 >> 2] = $7_1; } $7_1 = $8_1 + 20 | 0; continue; } break; }; if (!($24_1 & 255) | $2_1) { break block1 } $326($6_1, 98, $5_1, $21_1); $1_1 = $858($6_1, 17, $21_1); $326($6_1, 75, 0, $25); $859($6_1, 97, $23_1, 3, $11_1, 21013, 0); $326($6_1, 127, $3, $4_1); $835($6_1, 128, $3, $11_1, $4_1); $0_1 = HEAP32[$6_1 + 108 >> 2]; if (($0_1 | 0) > 0) { HEAP16[(HEAP32[$6_1 + 104 >> 2] + Math_imul($0_1, 20) | 0) - 18 >> 1] = 8 } HEAP32[(HEAPU8[HEAP32[$6_1 >> 2] + 87 | 0] ? 82740 : HEAP32[$6_1 + 104 >> 2] + Math_imul($1_1, 20) | 0) + 8 >> 2] = $0_1; } } function $1399($0_1, $1_1) { $0_1 = $856($0_1); if ($0_1) { $858($0_1, 150, $1_1) } } function $1400($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $1_1 = $50(HEAP32[$2_1 >> 2]); $5_1 = $50(HEAP32[$2_1 + 4 >> 2]); $3 = ($1_1 << 3) + 48 | 0; $3 = $270($4_1, $3, $3 >> 31); if (!$3) { $227($0_1); return; } HEAP32[$3 >> 2] = $4_1; $4_1 = $50(HEAP32[$2_1 + 8 >> 2]); HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = $4_1; HEAP32[$3 + 12 >> 2] = i64toi32_i32$HIGH_BITS; $2_1 = $50(HEAP32[$2_1 + 12 >> 2]); HEAP32[$3 + 40 >> 2] = $3 + 48; HEAP8[$3 + 36 | 0] = 0; HEAP32[$3 + 32 >> 2] = $5_1; HEAP32[$3 + 28 >> 2] = $1_1; HEAP32[$3 + 24 >> 2] = $2_1; $225($0_1, $3, 48, 95); } function $1401($0_1) { $0_1 = $0_1 | 0; $13(HEAP32[$0_1 >> 2], $0_1); } function $1402($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = $206(HEAP32[$2_1 >> 2]); $2_1 = $50(HEAP32[$2_1 + 4 >> 2]); block1 : { if (!(HEAP32[$3 + 16 >> 2] | HEAP32[$3 + 20 >> 2])) { $1_1 = 1; $2_1 = 0; break block1; } $1_1 = HEAP32[$3 + 28 >> 2]; $6_1 = ($1_1 | 0) > ($2_1 | 0) ? $1_1 : $2_1; while (1) { if (!(($2_1 | 0) == ($6_1 | 0))) { $1_1 = HEAP32[$3 + 40 >> 2] + ($2_1 << 3) | 0; $5_1 = $1_1; $4_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = $4_1 + 1 | 0; $1_1 = $4_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$5_1 >> 2] = $4_1; HEAP32[$5_1 + 4 >> 2] = $1_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = HEAP32[$3 + 20 >> 2]; $1_1 = HEAP32[$3 + 16 >> 2] + 1 | 0; $2_1 = $1_1 ? $2_1 : $2_1 + 1 | 0; } HEAP32[$3 + 16 >> 2] = $1_1; HEAP32[$3 + 20 >> 2] = $2_1; $5_1 = HEAP32[$3 + 24 >> 2]; block3 : { if (!$5_1) { break block3 } $4_1 = 0; $6_1 = HEAPU8[$3 + 36 | 0]; $7_1 = $6_1 + 1 | 0; $4_1 = $7_1 ? $4_1 : 1; $5_1 = __wasm_i64_mul($7_1, $4_1, $5_1, $5_1 >> 31); $4_1 = i64toi32_i32$HIGH_BITS; if (($4_1 | 0) == ($2_1 | 0) & $1_1 >>> 0 <= $5_1 >>> 0 | $2_1 >>> 0 < $4_1 >>> 0) { break block3 } HEAP8[$3 + 36 | 0] = $6_1 + 1; $1_1 = HEAP32[$3 + 40 >> 2]; $238($0_1, (HEAP32[$1_1 >> 2] | HEAP32[$1_1 + 4 >> 2]) != 0); } } function $1403($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $3 = global$0 - 48 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $5_1 = $206(HEAP32[$2_1 >> 2]); $1_1 = HEAP32[$5_1 + 32 >> 2]; $2_1 = 0; HEAP16[$3 + 44 >> 1] = 0; HEAP32[$3 + 40 >> 2] = 0; HEAP32[$3 + 32 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 36 >> 2] = Math_imul($1_1, 100) + 100; $1_1 = (HEAPU8[$5_1 + 36 | 0] ? 8 : 16) + $5_1 | 0; $4_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$3 + 20 >> 2] = $4_1; $46($3 + 24 | 0, 1873, $3 + 16 | 0); while (1) { if (!(HEAP32[$5_1 + 32 >> 2] <= ($2_1 | 0))) { $4_1 = HEAP32[$5_1 + 20 >> 2]; $7_1 = $4_1; $11_1 = HEAP32[$5_1 + 16 >> 2]; $8_1 = __wasm_i64_mul($11_1, $4_1, 10, 0); $6_1 = i64toi32_i32$HIGH_BITS; $1_1 = HEAP32[$5_1 + 40 >> 2] + ($2_1 << 3) | 0; $4_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $13_1 = $1_1; $9_1 = $4_1 + 1 | 0; $1_1 = $9_1 ? $1_1 : $1_1 + 1 | 0; $10_1 = __wasm_i64_mul($9_1, $1_1, 11, 0); $12_1 = i64toi32_i32$HIGH_BITS; $8_1 = ($12_1 | 0) == ($6_1 | 0) & $8_1 >>> 0 > $10_1 >>> 0 | $6_1 >>> 0 > $12_1 >>> 0 ? 2 : 1; $10_1 = 0; $6_1 = $7_1 + $13_1 | 0; $7_1 = $4_1; $4_1 = $4_1 + $11_1 | 0; $6_1 = $7_1 >>> 0 > $4_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $1_1 = __wasm_i64_udiv($4_1, $6_1, $9_1, $1_1); $7_1 = $1_1; $4_1 = i64toi32_i32$HIGH_BITS; $1_1 = !$4_1 & ($1_1 | 0) == 2; HEAP32[$3 >> 2] = $1_1 ? $8_1 : $7_1; HEAP32[$3 + 4 >> 2] = $1_1 ? $10_1 : $4_1; $46($3 + 24 | 0, 1872, $3); $2_1 = $2_1 + 1 | 0; continue; } break; }; $1404($0_1, $3 + 24 | 0); $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1404($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAPU8[$1_1 + 20 | 0]; block1 : { if ($2_1) { $255($0_1, $2_1); break block1; } if (HEAPU8[$1_1 + 21 | 0] & 4) { $246($0_1, HEAP32[$1_1 + 4 >> 2], HEAP32[$1_1 + 16 >> 2], 5); return; } $246($0_1, 30822, 0, 0); } $54($1_1); } function $1405($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $246($0_1, 1024, -1, 0); } function $1406($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $1_1 = $53(HEAP32[$2_1 >> 2]); if ($1_1) { $4_1 = $0_1; __inlined_func$440$136 : { $2_1 = ($68($1_1, 18331, 7) ? 0 : 7) + $1_1 | 0; $1_1 = $48($2_1); $0_1 = 0; while (1) { block1 : { if (($0_1 | 0) != 42) { $3 = HEAP32[($0_1 << 2) + 57712 >> 2]; if ($68($2_1, $3, $1_1) | HEAPU8[HEAPU8[$1_1 + $3 | 0] + 31424 | 0] & 70) { break block1 } $0_1 = 1; } else { $0_1 = 0 } break __inlined_func$440$136; } $0_1 = $0_1 + 1 | 0; continue; }; } $238($4_1, $0_1); } } function $1407($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $2_1 = $50(HEAP32[$2_1 >> 2]); if ($2_1 >>> 0 > 41) { $1_1 = 0 } else { $1_1 = HEAP32[($2_1 << 2) + 57712 >> 2] } $246($0_1, $1_1, -1, 0); } function $1408($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block : { $3 = HEAP32[$2_1 >> 2]; $4_1 = HEAPU16[$3 + 16 >> 1]; $5_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $5_1; $6_1 = 0; } else { $6_1 = 1 << $5_1; $4_1 = $6_1 - 1 & 1 >>> 32 - $5_1; } if ($6_1 & -1431655766 | $4_1 & -1431655766) { break block } $9_1 = $53($3); if (!$9_1) { break block } $4_1 = $209(HEAP32[$2_1 >> 2]); block5 : { block2 : { if (($1_1 | 0) == 1) { $10_1 = 52700; $7_1 = 52704; $6_1 = 1; break block2; } $5_1 = $53(HEAP32[$2_1 + 4 >> 2]); if (!$5_1) { break block } $6_1 = 0; $2_1 = $5_1; while (1) { $7_1 = HEAPU8[$2_1 | 0]; if ($7_1) { $3 = $2_1 + 1 | 0; $2_1 = $3; if ($7_1 >>> 0 >= 192) { while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; if (HEAP8[$2_1 | 0] < -64) { continue } break; } } $6_1 = $6_1 + 1 | 0; continue; } break; }; if (!$6_1) { break block5 } $7_1 = $1409($0_1, $6_1 << 3, $6_1 >>> 29 | 0); if (!$7_1) { break block } $10_1 = ($6_1 << 2) + $7_1 | 0; $6_1 = 0; while (1) { if (HEAPU8[$5_1 | 0]) { $8_1 = $6_1 << 2; HEAP32[$8_1 + $7_1 >> 2] = $5_1; $3 = $5_1 + 1 | 0; $2_1 = $3; if (HEAPU8[$5_1 | 0] >= 192) { while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; if (HEAP8[$2_1 | 0] < -64) { continue } break; } } HEAP32[$8_1 + $10_1 >> 2] = $2_1 - $5_1; $6_1 = $6_1 + 1 | 0; $5_1 = $2_1; continue; } break; }; if (!$6_1) { break block5 } } $5_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; block8 : { if (!($5_1 & 1) | !$4_1) { break block8 } while (1) { $2_1 = 0; $3 = 0; while (1) { block9 : { if (($2_1 | 0) == ($6_1 | 0)) { break block9 } $8_1 = $2_1 << 2; $3 = HEAP32[$8_1 + $10_1 >> 2]; if ($3 >>> 0 <= $4_1 >>> 0) { if (!$2014($9_1, HEAP32[$7_1 + $8_1 >> 2], $3)) { break block9 } } $2_1 = $2_1 + 1 | 0; continue; } break; }; if ($2_1 >>> 0 >= $6_1 >>> 0) { break block8 } $9_1 = $3 + $9_1 | 0; $4_1 = $4_1 - $3 | 0; if ($4_1) { continue } break; }; $4_1 = 0; } block11 : { if (!($5_1 & 2) | !$4_1) { break block11 } while (1) { $5_1 = $4_1; $2_1 = 0; while (1) { if (($2_1 | 0) == ($6_1 | 0)) { $4_1 = $5_1; break block11; } block14 : { $8_1 = $2_1 << 2; $3 = HEAP32[$8_1 + $10_1 >> 2]; if ($5_1 >>> 0 >= $3 >>> 0) { $4_1 = $5_1 - $3 | 0; if (!$2014($4_1 + $9_1 | 0, HEAP32[$7_1 + $8_1 >> 2], $3)) { break block14 } } $2_1 = $2_1 + 1 | 0; continue; } break; }; if ($4_1) { continue } break; }; $4_1 = 0; } if (($1_1 | 0) == 1) { break block5 } $24($7_1); } $246($0_1, $9_1, $4_1, -1); } } function $1409($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] + 120 >> 2]; $4_1 = $3 >> 31; block2 : { block1 : { if (!(($4_1 | 0) >= ($2_1 | 0) & $1_1 >>> 0 <= $3 >>> 0 | ($2_1 | 0) < ($4_1 | 0))) { $230($0_1); break block1; } $1_1 = $30($1_1, $2_1); if ($1_1) { break block2 } $227($0_1); } $1_1 = 0; } return $1_1; } function $1410($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block : { $3 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $5_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $5_1; $4_1 = 0; } else { $4_1 = 1 << $5_1; $3 = $4_1 - 1 & 1 >>> 32 - $5_1; } if ($4_1 & -1431655766 | $3 & -1431655766) { break block } $8_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2] ? -1 : 0; $9_1 = HEAP32[(HEAP32[HEAP32[$0_1 + 12 >> 2] + 104 >> 2] + Math_imul(HEAP32[$0_1 + 16 >> 2], 20) | 0) - 4 >> 2]; $10_1 = ($1_1 | 0) <= 1 ? 1 : $1_1; $5_1 = 0; $1_1 = 1; while (1) { if (($1_1 | 0) != ($10_1 | 0)) { $6_1 = HEAP32[($1_1 << 2) + $2_1 >> 2]; $3 = HEAPU16[$6_1 + 16 >> 1]; $4_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $4_1; $4_1 = 0; } else { $7_1 = 1 << $4_1; $3 = $7_1 - 1 & 1 >>> 32 - $4_1; $4_1 = $7_1; } if ($4_1 & -1431655766 | $3 & -1431655766) { break block } $5_1 = ($677(HEAP32[($5_1 << 2) + $2_1 >> 2], $6_1, $9_1) ^ $8_1) < 0 ? $5_1 : $1_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; $250($0_1, HEAP32[($5_1 << 2) + $2_1 >> 2]); } } function $1411($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP32[$2_1 >> 2]; folding_inner0 : { $1_1 = $266($0_1, 40); block : { if (!$1_1) { break block } $3 = HEAPU16[$1_1 + 16 >> 1]; $4_1 = HEAPU16[$2_1 + 16 >> 1]; $5_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $5_1; $6_1 = 0; } else { $6_1 = 1 << $5_1; $4_1 = $6_1 - 1 & 1 >>> 32 - $5_1; } if ($6_1 & -1431655766 | $4_1 & -1431655766) { if (!$3) { break block } break folding_inner0; } if ($3) { $5_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; $3 = $677($1_1, $2_1, HEAP32[(HEAP32[HEAP32[$0_1 + 12 >> 2] + 104 >> 2] + Math_imul(HEAP32[$0_1 + 16 >> 2], 20) | 0) - 4 >> 2]); if (!($5_1 ? ($3 | 0) >= 0 : ($3 | 0) <= 0)) { $251($1_1, $2_1); return; } break folding_inner0; } HEAP32[$1_1 + 20 >> 2] = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $251($1_1, $2_1); } return; } HEAP8[$0_1 + 25 | 0] = 1; HEAP32[$0_1 + 20 >> 2] = -1; } function $1412($0_1) { $0_1 = $0_1 | 0; $1413($0_1, 0); } function $1413($0_1, $1_1) { var $2_1 = 0; block : { $2_1 = $266($0_1, 0); if (!$2_1) { break block } if (HEAPU16[$2_1 + 16 >> 1]) { $250($0_1, $2_1) } if ($1_1) { break block } $204($2_1); } } function $1414($0_1) { $0_1 = $0_1 | 0; $1413($0_1, 1); } function $1415($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $246($0_1, HEAP32[(HEAPU8[(HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1] & 63) + 31328 | 0] << 2) + 52716 >> 2], -1, 0); } function $1416($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = 0; $2_1 = HEAP32[$2_1 >> 2]; if (HEAPU8[$2_1 + 17 | 0] & 8) { $1_1 = HEAPU8[$2_1 + 19 | 0] } $238($0_1, $1_1); } function $1417($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; block3 : { block2 : { block1 : { block : { $1_1 = HEAP32[$2_1 >> 2]; switch (HEAPU8[(HEAPU16[$1_1 + 16 >> 1] & 63) + 31328 | 0] - 1 | 0) { case 0: case 1: case 3: break block; case 2: break block1; default: break block2; }; } $238($0_1, $209($1_1)); return; } $1_1 = $53($1_1); if (!$1_1) { break block3 } $2_1 = $1_1; label : while (1) { $3 = HEAPU8[$2_1 | 0]; if ($3) { $2_1 = $2_1 + 1 | 0; if ($3 >>> 0 < 192) { continue } while (1) { if (HEAP8[$2_1 | 0] > -65) { continue label } $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; }; } break; }; $238($0_1, $2_1 - $1_1 | 0); return; } $241($0_1); } } function $1418($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; block3 : { block1 : { block : { block2 : { $2_1 = HEAP32[$2_1 >> 2]; switch (HEAPU8[(HEAPU16[$2_1 + 16 >> 1] & 63) + 31328 | 0] - 1 | 0) { case 0: case 1: break block; case 2: break block1; case 3: break block2; default: break block3; }; } $238($0_1, $209($2_1)); return; } $3 = $0_1; $1_1 = HEAPU8[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] + 84 | 0] > 1; $0_1 = $209($2_1); $2_1 = $0_1 >> 31; $2_1 = (1 << $1_1) - 1 & $0_1 >>> 32 - $1_1 | $2_1 << $1_1; $240($3, $0_1 << $1_1, $2_1); return; } if (HEAPU8[$2_1 + 18 | 0] <= 1) { $238($0_1, $209($2_1)); return; } $238($0_1, $210($2_1, 2)); return; } $241($0_1); } function $1419($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block : { $6_1 = HEAP32[$2_1 >> 2]; $1_1 = HEAPU16[$6_1 + 16 >> 1]; $5_1 = $1_1 & 31; if (($1_1 & 63) >>> 0 >= 32) { $1_1 = 1 << $5_1; $3 = 0; } else { $3 = 1 << $5_1; $1_1 = $3 - 1 & 1 >>> 32 - $5_1; } $5_1 = $1_1; $8_1 = $3; $1_1 = HEAPU16[HEAP32[$2_1 + 4 >> 2] + 16 >> 1]; $3 = $1_1 & 31; if (($1_1 & 63) >>> 0 >= 32) { $1_1 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $1_1 = $4_1 - 1 & 1 >>> 32 - $3; } $4_1 = $8_1 | $4_1; $1_1 = $1_1 | $5_1; if ($4_1 & -1431655766 | $1_1 & -1431655766) { break block } $5_1 = $209($6_1); $3 = 1; block16 : { block2 : { $7_1 = $209(HEAP32[$2_1 + 4 >> 2]); if (($7_1 | 0) <= 0) { $4_1 = 0; $2_1 = 0; break block2; } block9 : { block11 : { block6 : { block8 : { block7 : { block5 : { $3 = $1_1 & -65537; $8_1 = $3; $9_1 = $4_1 & -65538; block4 : { if (!($3 | $9_1)) { $1_1 = $206(HEAP32[$2_1 >> 2]); $6_1 = $206(HEAP32[$2_1 + 4 >> 2]); break block4; } $3 = HEAP32[$2_1 >> 2]; if ($4_1 & 65537 | $1_1 & 65536) { break block5 } $1_1 = $53($3); $6_1 = $53(HEAP32[$2_1 + 4 >> 2]); } if ($6_1) { break block6 } $4_1 = 0; break block7; } $4_1 = $222($3); $1_1 = $53($4_1); if ($1_1) { break block8 } } $2_1 = 0; break block9; } $5_1 = $209($4_1); $2_1 = $222(HEAP32[$2_1 + 4 >> 2]); $6_1 = $53($2_1); if (!$6_1) { break block9 } $7_1 = $209($2_1); break block11; } $4_1 = 0; if (!$5_1) { $2_1 = 0; break block11; } $2_1 = 0; if (!$1_1) { break block9 } } $10_1 = HEAPU8[$6_1 | 0]; $3 = 1; label : while (1) { if (($5_1 | 0) < ($7_1 | 0)) { $3 = 0; break block2; } block15 : { if (($10_1 | 0) != HEAPU8[$1_1 | 0]) { break block15 } if ($2014($1_1, $6_1, $7_1)) { break block15 } break block2; } $3 = $3 + 1 | 0; while (1) { $1_1 = $1_1 + 1 | 0; $5_1 = $5_1 - 1 | 0; if (!($8_1 | $9_1)) { continue label } if (HEAP8[$1_1 | 0] < -64) { continue } break; }; continue; }; } $227($0_1); break block16; } $238($0_1, $3); } $200($4_1); $200($2_1); } } function $1420($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (($1_1 | 0) <= 0) { break block } $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $5_1 = $53(HEAP32[$2_1 >> 2]); if (!$5_1) { break block } HEAP32[$3 + 40 >> 2] = 0; HEAP32[$3 + 44 >> 2] = $2_1 + 4; HEAP32[$3 + 36 >> 2] = $1_1 - 1; $1_1 = HEAP32[$4_1 + 120 >> 2]; HEAP16[$3 + 32 >> 1] = 512; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 24 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = $4_1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 >> 2] = $3 + 36; $2_1 = $3 + 12 | 0; $46($2_1, $5_1, $3); $1_1 = HEAP32[$3 + 28 >> 2]; $246($0_1, $57($2_1), $1_1, 5); } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1421($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = $53(HEAP32[$2_1 >> 2]); HEAP32[$1_1 + 12 >> 2] = $2_1; if (!(!$2_1 | !HEAPU8[$2_1 | 0])) { $238($0_1, $345($1_1 + 12 | 0)) } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1422($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = $1_1 << 2 | 1; $4_1 = $31($4_1, $4_1 >> 31); if ($4_1) { $7_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = $4_1; while (1) { if (!(($5_1 | 0) == ($7_1 | 0))) { $3 = $50(HEAP32[($5_1 << 2) + $2_1 >> 2]); $6_1 = i64toi32_i32$HIGH_BITS; $3 = !$6_1 & $3 >>> 0 > 1114111 | $6_1 ? 65533 : $3 & 2097151; block3 : { if ($3 >>> 0 <= 127) { HEAP8[$1_1 | 0] = $3; $1_1 = $1_1 + 1 | 0; break block3; } if ($3 >>> 0 <= 2047) { HEAP8[$1_1 + 1 | 0] = $3 & 63 | 128; HEAP8[$1_1 | 0] = $3 >>> 6 | 192; $1_1 = $1_1 + 2 | 0; break block3; } if ($3 >>> 0 <= 65535) { HEAP8[$1_1 + 2 | 0] = $3 & 63 | 128; HEAP8[$1_1 | 0] = $3 >>> 12 | 224; HEAP8[$1_1 + 1 | 0] = $3 >>> 6 & 63 | 128; $1_1 = $1_1 + 3 | 0; break block3; } HEAP8[$1_1 + 3 | 0] = $3 & 63 | 128; HEAP8[$1_1 | 0] = $3 >>> 18 | 240; HEAP8[$1_1 + 2 | 0] = $3 >>> 6 & 63 | 128; HEAP8[$1_1 + 1 | 0] = $3 >>> 12 & 63 | 128; $1_1 = $1_1 + 4 | 0; } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP8[$1_1 | 0] = 0; $1_1 = $1_1 - $4_1 | 0; $247($0_1, $4_1, $1_1, $1_1 >> 31, 1); return; } $227($0_1); } function $1423($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0.0; block1 : { block2 : { block : { $1_1 = HEAP32[$2_1 >> 2]; switch (HEAPU8[(HEAPU16[$1_1 + 16 >> 1] & 63) + 31328 | 0] - 1 | 0) { case 0: break block; case 4: break block2; default: break block1; }; } $1_1 = $50($1_1); $2_1 = i64toi32_i32$HIGH_BITS; $3 = $2_1; if (($2_1 | 0) < 0) { if (!(($1_1 | 0) != 0 | ($2_1 | 0) != -2147483648)) { $235($0_1, 1704, -1); return; } $2_1 = $1_1; $1_1 = 0 - $1_1 | 0; $3 = 0 - ((($2_1 | 0) != 0) + $3 | 0) | 0; } $240($0_1, $1_1, $3); return; } $241($0_1); return; } $4_1 = $39($1_1); $233($0_1, $4_1 < 0.0 ? -$4_1 : $4_1); } function $1424($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $7_1 = global$0 - 32 | 0; $3 = $7_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = 0; block1 : { if (($1_1 | 0) == 2) { $5_1 = HEAP32[$2_1 + 4 >> 2]; $3 = HEAPU16[$5_1 + 16 >> 1]; $1_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $1_1; $6_1 = 0; } else { $6_1 = 1 << $1_1; $3 = $6_1 - 1 & 1 >>> 32 - $1_1; } if ($6_1 & -1431655766 | $3 & -1431655766) { break block1 } $1_1 = $50($5_1); $3 = i64toi32_i32$HIGH_BITS; $5_1 = $1_1 >>> 0 < 30 & ($3 | 0) <= 0 | ($3 | 0) < 0; $1_1 = $5_1 ? $1_1 : 30; $3 = $5_1 ? $3 : 0; $5_1 = $3; $6_1 = $1_1; $1_1 = !!$1_1 & ($3 | 0) >= 0 | ($3 | 0) > 0; $3 = $1_1 ? $6_1 : 0; $5_1 = $1_1 ? $5_1 : 0; } $6_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAPU16[$6_1 + 16 >> 1]; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $1_1; $1_1 = 0; } else { $8_1 = 1 << $1_1; $2_1 = $8_1 - 1 & 1 >>> 32 - $1_1; $1_1 = $8_1; } if ($1_1 & -1431655766 | $2_1 & -1431655766) { break block1 } $4_1 = $39($6_1); block2 : { if (Math_abs($4_1) > 4503599627370496.0) { break block2 } if (!($3 | $5_1)) { $4_1 = $4_1 + ($4_1 < 0.0 ? -.5 : .5); if (Math_abs($4_1) < 9223372036854775808.0) { $1_1 = ~~$4_1 >>> 0; if (Math_abs($4_1) >= 1.0) { $2_1 = ~~($4_1 > 0.0 ? Math_min(Math_floor($4_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($4_1 - +(~~$4_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $2_1 = 0 } } else { $1_1 = 0; $2_1 = -2147483648; } $4_1 = +($1_1 >>> 0) + +($2_1 | 0) * 4294967296.0; break block2; } HEAPF64[$7_1 + 8 >> 3] = $4_1; HEAP32[$7_1 >> 2] = $3; $1_1 = $61(12863, $7_1); if (!$1_1) { $227($0_1); break block1; } $303($1_1, $7_1 + 24 | 0, $48($1_1), 1); $24($1_1); $4_1 = HEAPF64[$7_1 + 24 >> 3]; } $233($0_1, $4_1); } $0_1 = $7_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1425($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = $53(HEAP32[$2_1 >> 2]); $1_1 = $209(HEAP32[$2_1 >> 2]); block : { if (!$4_1) { break block } $2_1 = $1_1 >> 31; $3 = $1_1 + 1 | 0; $2_1 = $3 ? $2_1 : $2_1 + 1 | 0; $3 = $1409($0_1, $3, $2_1); if (!$3) { break block } $2_1 = 0; $6_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (!(($2_1 | 0) == ($6_1 | 0))) { $5_1 = HEAPU8[$2_1 + $4_1 | 0]; HEAP8[$2_1 + $3 | 0] = $5_1 & (HEAPU8[$5_1 + 31424 | 0] ^ -1 | 223); $2_1 = $2_1 + 1 | 0; continue; } break; }; $246($0_1, $3, $1_1, 1); } } function $1426($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = $53(HEAP32[$2_1 >> 2]); $1_1 = $209(HEAP32[$2_1 >> 2]); block : { if (!$4_1) { break block } $2_1 = $1_1 >> 31; $3 = $1_1 + 1 | 0; $2_1 = $3 ? $2_1 : $2_1 + 1 | 0; $3 = $1409($0_1, $3, $2_1); if (!$3) { break block } $2_1 = 0; $5_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (!(($2_1 | 0) == ($5_1 | 0))) { HEAP8[$2_1 + $3 | 0] = HEAPU8[HEAPU8[$2_1 + $4_1 | 0] + 31040 | 0]; $2_1 = $2_1 + 1 | 0; continue; } break; }; $246($0_1, $3, $1_1, 1); } } function $1427($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = $206(HEAP32[$2_1 >> 2]); $2_1 = $209(HEAP32[$2_1 >> 2]); $1_1 = $2_1 >> 31 << 1 | $2_1 >>> 31; $1_1 = $1409($0_1, $2_1 << 1 | 1, $1_1); if ($1_1) { $6_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $2_1 = $1_1; while (1) { if (!(($4_1 | 0) == ($6_1 | 0))) { $5_1 = HEAPU8[$3 | 0]; HEAP8[$2_1 + 1 | 0] = HEAPU8[($5_1 & 15) + 52752 | 0]; HEAP8[$2_1 | 0] = HEAPU8[($5_1 >>> 4 | 0) + 52752 | 0]; $3 = $3 + 1 | 0; $4_1 = $4_1 + 1 | 0; $2_1 = $2_1 + 2 | 0; continue; } break; }; HEAP8[$2_1 | 0] = 0; $2_1 = $2_1 - $1_1 | 0; $247($0_1, $1_1, $2_1, $2_1 >> 31, 1); } } function $1428($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $3; $3 = $53(HEAP32[$2_1 >> 2]); HEAP32[$4_1 + 8 >> 2] = $3; $5_1 = $209(HEAP32[$2_1 >> 2]); block1 : { if (($1_1 | 0) != 2) { $7_1 = 30822; $2_1 = 0; break block1; } $7_1 = $53(HEAP32[$2_1 + 4 >> 2]); $2_1 = $209(HEAP32[$2_1 + 4 >> 2]); } block2 : { if (!$3 | !$7_1) { break block2 } block4 : { $1_1 = (($5_1 | 0) / 2 | 0) + 1 | 0; $6_1 = $1409($0_1, $1_1, $1_1 >> 31); if (!$6_1) { $5_1 = 0; break block4; } $8_1 = $2_1 + $7_1 | 0; $5_1 = $6_1; while (1) { $1_1 = HEAPU8[$3 | 0]; if (!$1_1) { break block4 } block8 : { if (!(HEAPU8[$1_1 + 31424 | 0] & 8)) { block7 : { if ($1_1 << 24 >> 24 >= 0) { HEAP32[$4_1 + 8 >> 2] = $3 + 1; break block7; } $1_1 = $345($4_1 + 8 | 0); } HEAP32[$4_1 + 12 >> 2] = $7_1; while (1) { $2_1 = HEAP32[$4_1 + 12 >> 2]; if ($2_1 >>> 0 >= $8_1 >>> 0) { break block8 } $3 = HEAP8[$2_1 | 0]; block10 : { if (($3 | 0) >= 0) { HEAP32[$4_1 + 12 >> 2] = $2_1 + 1; break block10; } $3 = $345($4_1 + 12 | 0); } if (($1_1 | 0) != ($3 | 0)) { continue } break; }; $3 = HEAP32[$4_1 + 8 >> 2]; continue; } $2_1 = $3 + 2 | 0; HEAP32[$4_1 + 8 >> 2] = $2_1; $3 = HEAPU8[$3 + 1 | 0]; if (!(HEAPU8[$3 + 31424 | 0] & 8)) { break block8 } HEAP8[$5_1 | 0] = $3 + ($3 << 25 >> 31 & 9) & 15 | $1_1 + ($1_1 << 25 >> 31 & 9) << 4; $5_1 = $5_1 + 1 | 0; $3 = $2_1; continue; } break; }; $24($6_1); break block2; } $225($0_1, $6_1, $5_1 - $6_1 | 0, 1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1429($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1430($0_1, $1_1, $2_1, 0, 30822); } function $1430($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $10_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (!(($7_1 | 0) == ($10_1 | 0))) { $8_1 = $209(HEAP32[($7_1 << 2) + $2_1 >> 2]); $6_1 = $8_1 + $6_1 | 0; $5_1 = ($8_1 >> 31) + $5_1 | 0; $5_1 = $6_1 >>> 0 < $8_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; $7_1 = $7_1 + 1 | 0; continue; } break; }; $11_1 = $3 >> 31; $1_1 = $1_1 - 1 | 0; $7_1 = __wasm_i64_mul($3, $11_1, $1_1, $1_1 >> 31); $1_1 = $5_1 + i64toi32_i32$HIGH_BITS | 0; $5_1 = $6_1 + $7_1 | 0; $1_1 = $5_1 >>> 0 < $6_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; $8_1 = $31($5_1, $1_1); if ($8_1) { $6_1 = 0; $5_1 = 0; $7_1 = 0; while (1) { if (!(($7_1 | 0) == ($10_1 | 0))) { $9_1 = ($7_1 << 2) + $2_1 | 0; $1_1 = $209(HEAP32[$9_1 >> 2]); block3 : { if (($1_1 | 0) <= 0) { break block3 } $9_1 = $53(HEAP32[$9_1 >> 2]); if (!$9_1) { break block3 } if (!(!$6_1 & ($5_1 | 0) <= 0 | ($5_1 | 0) < 0 | ($3 | 0) <= 0)) { if ($3) { wasm2js_memory_copy($6_1 + $8_1 | 0, $4_1, $3) } $5_1 = $5_1 + $11_1 | 0; $6_1 = $3 + $6_1 | 0; $5_1 = $6_1 >>> 0 < $3 >>> 0 ? $5_1 + 1 | 0 : $5_1; } $12_1 = $1_1 >> 31; if ($1_1) { wasm2js_memory_copy($6_1 + $8_1 | 0, $9_1, $1_1) } $5_1 = $5_1 + $12_1 | 0; $6_1 = $1_1 + $6_1 | 0; $5_1 = $6_1 >>> 0 < $1_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; } $7_1 = $7_1 + 1 | 0; continue; } break; }; HEAP8[$6_1 + $8_1 | 0] = 0; $247($0_1, $8_1, $6_1, $5_1, 1); return; } $227($0_1); } function $1431($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $4_1 = $209(HEAP32[$2_1 >> 2]); $3 = $53(HEAP32[$2_1 >> 2]); if ($3) { $1430($0_1, $1_1 - 1 | 0, $2_1 + 4 | 0, $4_1, $3) } } function $1432($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = global$0 - 16 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $65(8, $3 + 8 | 0); $1_1 = HEAP32[$3 + 8 >> 2]; $2_1 = HEAP32[$3 + 12 >> 2]; if (($2_1 | 0) < 0) { $2_1 = 0 - (($2_1 & 2147483647) + (($1_1 | 0) != 0) | 0) | 0; $1_1 = 0 - $1_1 | 0; HEAP32[$3 + 8 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = $2_1; } $240($0_1, $1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1433($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $1_1 = $50(HEAP32[$2_1 >> 2]); $2_1 = i64toi32_i32$HIGH_BITS; $3 = $1_1 >>> 0 > 1 & ($2_1 | 0) >= 0 | ($2_1 | 0) > 0; $1_1 = $3 ? $1_1 : 1; $2_1 = $1409($0_1, $1_1, $3 ? $2_1 : 0); if ($2_1) { $65($1_1, $2_1); $225($0_1, $2_1, $1_1, 1); } } function $1434($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; if ($677(HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], HEAP32[(HEAP32[HEAP32[$0_1 + 12 >> 2] + 104 >> 2] + Math_imul(HEAP32[$0_1 + 16 >> 2], 20) | 0) - 4 >> 2])) { $250($0_1, HEAP32[$2_1 >> 2]) } } function $1435($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $246($0_1, 24565, -1, 0); } function $1436($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $1_1 = $50(HEAP32[$2_1 >> 2]); HEAP32[$0_1 >> 2] = $53(HEAP32[$2_1 + 4 >> 2]); $64($1_1, 8932, $0_1); $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1437($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0.0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 96 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $4_1 = HEAP32[$1_1 + 120 >> 2]; HEAP16[$3 + 84 >> 1] = 0; HEAP32[$3 + 80 >> 2] = 0; HEAP32[$3 + 76 >> 2] = $4_1; HEAP32[$3 + 64 >> 2] = $1_1; HEAP32[$3 + 68 >> 2] = 0; HEAP32[$3 + 72 >> 2] = 0; block5 : { block4 : { block2 : { block3 : { block : { block1 : { $1_1 = HEAP32[$2_1 >> 2]; switch (HEAPU8[(HEAPU16[$1_1 + 16 >> 1] & 63) + 31328 | 0] - 1 | 0) { case 0: break block; case 1: break block1; case 2: break block2; case 3: break block3; default: break block4; }; } $6_1 = $39($1_1); HEAPF64[$3 + 16 >> 3] = $6_1; $4_1 = $3 - -64 | 0; $46($4_1, 12694, $3 + 16 | 0); $1_1 = HEAP32[$3 + 80 >> 2]; if (!$1_1) { break block5 } $2_1 = HEAP32[$3 + 68 >> 2]; HEAP8[$2_1 + $1_1 | 0] = 0; $303($2_1, $3 + 88 | 0, $1_1, 1); if (HEAPF64[$3 + 88 >> 3] == $6_1) { break block5 } $54($4_1); HEAPF64[$3 >> 3] = $6_1; $46($4_1, 14963, $3); break block5; } HEAP32[$3 + 32 >> 2] = $50($1_1); HEAP32[$3 + 36 >> 2] = i64toi32_i32$HIGH_BITS; $46($3 - -64 | 0, 15092, $3 + 32 | 0); break block5; } $9_1 = $206($1_1); $2_1 = $3 - -64 | 0; $4_1 = $209($1_1); $1_1 = $4_1 >> 31 << 1 | $4_1 >>> 31; $7_1 = $4_1 << 1; $5_1 = $7_1 + 4 | 0; $1_1 = $5_1 >>> 0 < 4 ? $1_1 + 1 | 0 : $1_1; $42($2_1, $5_1, $1_1); if (HEAPU8[$3 + 84 | 0]) { break block5 } $2_1 = 0; $4_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $1_1 = HEAP32[$3 + 68 >> 2]; while (1) { if (!(($2_1 | 0) == ($4_1 | 0))) { $5_1 = ($2_1 << 1) + $1_1 | 0; $8_1 = $2_1 + $9_1 | 0; HEAP8[$5_1 + 2 | 0] = HEAPU8[(HEAPU8[$8_1 | 0] >>> 4 | 0) + 52752 | 0]; HEAP8[$5_1 + 3 | 0] = HEAPU8[(HEAPU8[$8_1 | 0] & 15) + 52752 | 0]; $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = ($1_1 + $7_1 | 0) + 2 | 0; HEAP8[$2_1 | 0] = 39; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$1_1 | 0] = 88; HEAP8[$1_1 + 1 | 0] = 39; HEAP32[$3 + 80 >> 2] = $7_1 + 3; break block5; } HEAP32[$3 + 48 >> 2] = $53($1_1); $46($3 - -64 | 0, 20008, $3 + 48 | 0); break block5; } $36($3 - -64 | 0, 20315, 4); } $246($0_1, $57($3 - -64 | 0), HEAP32[$3 + 80 >> 2], 5); $1_1 = HEAPU8[$3 + 84 | 0]; if ($1_1) { $241($0_1); $255($0_1, $1_1); } $0_1 = $3 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1438($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $240($0_1, HEAP32[$1_1 + 40 >> 2], HEAP32[$1_1 + 44 >> 2]); } function $1439($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $240($0_1, HEAP32[$1_1 + 104 >> 2], HEAP32[$1_1 + 108 >> 2]); } function $1440($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $240($0_1, HEAP32[$1_1 + 112 >> 2], HEAP32[$1_1 + 116 >> 2]); } function $1441($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0; $19_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; block : { $11_1 = $53(HEAP32[$2_1 >> 2]); if (!$11_1) { break block } $8_1 = $209(HEAP32[$2_1 >> 2]); $12_1 = $53(HEAP32[$2_1 + 4 >> 2]); if (!$12_1) { break block } if (!HEAPU8[$12_1 | 0]) { $246($0_1, $11_1, $8_1, -1); return; } $9_1 = $209(HEAP32[$2_1 + 4 >> 2]); $16_1 = $53(HEAP32[$2_1 + 8 >> 2]); if (!$16_1) { break block } $10_1 = $209(HEAP32[$2_1 + 8 >> 2]); $4_1 = $8_1 + 1 | 0; $6_1 = $4_1 >> 31; $1_1 = $1409($0_1, $4_1, $6_1); if (!$1_1) { break block } $20_1 = $9_1 - 1 | 0; $21_1 = $8_1 - $9_1 | 0; $13_1 = $8_1 ^ -1; $22_1 = $13_1 >> 31; $14 = $10_1 - $9_1 | 0; $23_1 = $14 >> 31; $2_1 = 0; while (1) { block5 : { block10 : { if (($2_1 | 0) <= ($21_1 | 0)) { block4 : { $3 = $2_1 + $11_1 | 0; $5_1 = HEAPU8[$3 | 0]; if (($5_1 | 0) == HEAPU8[$12_1 | 0]) { if (!$2014($3, $12_1, $9_1)) { break block4 } } HEAP8[$1_1 + $7_1 | 0] = $5_1; $7_1 = $7_1 + 1 | 0; break block5; } block9 : { if (($9_1 | 0) < ($10_1 | 0)) { $6_1 = $6_1 + $23_1 | 0; $4_1 = $4_1 + $14 | 0; $6_1 = $4_1 >>> 0 < $14 >>> 0 ? $6_1 + 1 | 0 : $6_1; $3 = $6_1 - 1 | 0; $5_1 = $4_1 - 1 | 0; $3 = ($5_1 | 0) != -1 ? $3 + 1 | 0 : $3; $17_1 = HEAP32[$19_1 + 120 >> 2]; $18_1 = $17_1 >> 31; if (!(($3 | 0) <= ($18_1 | 0) & $5_1 >>> 0 <= $17_1 >>> 0 | ($3 | 0) < ($18_1 | 0))) { $230($0_1); $24($1_1); return; } $3 = $15_1; $15_1 = $15_1 + 1 | 0; if (!($3 & $15_1)) { break block9 } } $3 = $1_1; break block10; } $3 = $6_1 + $22_1 | 0; $5_1 = $4_1 + $13_1 | 0; $3 = ($4_1 >> 31) + ($5_1 >>> 0 < $13_1 >>> 0 ? $3 + 1 | 0 : $3) | 0; $5_1 = $4_1 + $5_1 | 0; $3 = $5_1 >>> 0 < $4_1 >>> 0 ? $3 + 1 | 0 : $3; $3 = $33($1_1, $5_1, $3); if ($3) { break block10 } $227($0_1); $24($1_1); return; } $4_1 = $8_1 - $2_1 | 0; if ($4_1) { wasm2js_memory_copy($1_1 + $7_1 | 0, $2_1 + $11_1 | 0, $4_1) } $2_1 = $4_1 + $7_1 | 0; HEAP8[$2_1 + $1_1 | 0] = 0; $246($0_1, $1_1, $2_1, 1); break block; } if ($10_1) { wasm2js_memory_copy($3 + $7_1 | 0, $16_1, $10_1) } $2_1 = $2_1 + $20_1 | 0; $1_1 = $3; $7_1 = $7_1 + $10_1 | 0; } $2_1 = $2_1 + 1 | 0; continue; }; } } function $1442($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = $50(HEAP32[$2_1 >> 2]); $2_1 = $1_1; $3 = !!$1_1; $1_1 = i64toi32_i32$HIGH_BITS; $3 = $3 & ($1_1 | 0) >= 0 | ($1_1 | 0) > 0; $2_1 = $3 ? $2_1 : 0; $1_1 = $3 ? $1_1 : 0; $3 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[HEAP32[$3 + 20 >> 2] + 120 >> 2]; $5_1 = $4_1 >> 31; __inlined_func$253$138 : { if (!(($1_1 | 0) == ($5_1 | 0) & $2_1 >>> 0 <= $4_1 >>> 0 | $1_1 >>> 0 < $5_1 >>> 0)) { $230($0_1); $1_1 = 18; break __inlined_func$253$138; } $254($3, $2_1); $1_1 = 0; } if ($1_1) { $255($0_1, $1_1) } } function $1443($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $5_1 = HEAP32[$2_1 + 4 >> 2]; $4_1 = HEAPU16[$5_1 + 16 >> 1]; $3 = $4_1 & 31; block14 : { if (($4_1 & 63) >>> 0 >= 32) { $3 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $3 = $4_1 - 1 & 1 >>> 32 - $3; } block : { if ($4_1 & -1431655766 | $3 & -1431655766) { break block } if (($1_1 | 0) == 3) { $4_1 = HEAPU16[HEAP32[$2_1 + 8 >> 2] + 16 >> 1]; $3 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $3 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $3 = $4_1 - 1 & 1 >>> 32 - $3; } if ($4_1 & -1431655766 | $3 & -1431655766) { break block } } $4_1 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $10_1 = $50($5_1); $9_1 = i64toi32_i32$HIGH_BITS; $5_1 = HEAP32[$2_1 >> 2]; $3 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $7_1 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $7_1 = $4_1 - 1 & 1 >>> 32 - $3; } $12_1 = $4_1 & 65537; $3 = $7_1 & 65536; $11_1 = $3; block3 : { if ($3 | $12_1) { $8_1 = $209($5_1); $5_1 = $206(HEAP32[$2_1 >> 2]); if (!$5_1) { break block } break block3; } $5_1 = $53($5_1); if (!$5_1) { break block } if (($9_1 | 0) >= 0) { break block3 } $3 = $5_1; while (1) { $7_1 = HEAPU8[$3 | 0]; if (!$7_1) { break block3 } $4_1 = $3 + 1 | 0; $3 = $4_1; if ($7_1 >>> 0 >= 192) { while (1) { $3 = $4_1; $4_1 = $3 + 1 | 0; if (HEAP8[$3 | 0] < -64) { continue } break; } } $8_1 = $8_1 + 1 | 0; continue; }; } block6 : { if (($1_1 | 0) == 3) { $1_1 = $50(HEAP32[$2_1 + 8 >> 2]); $6_1 = i64toi32_i32$HIGH_BITS; break block6; } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] + 120 >> 2]; $6_1 = $1_1 >> 31; } block11 : { block9 : { if (($9_1 | 0) < 0) { $2_1 = ($8_1 >> 31) + $9_1 | 0; $4_1 = $2_1 + 1 | 0; $3 = $2_1; $2_1 = $8_1 + $10_1 | 0; $3 = $2_1 >>> 0 < $8_1 >>> 0 ? $4_1 : $3; if (!(($3 | 0) < 0 | ($3 | 0) < -1)) { $4_1 = $2_1; $7_1 = $3; break block9; } $4_1 = 0; $7_1 = 0; if (!(($6_1 | 0) > 0 | ($6_1 | 0) >= 0)) { $1_1 = 0; $6_1 = 0; break block11; } $3 = $3 + $6_1 | 0; $1_1 = $1_1 + $2_1 | 0; $6_1 = $1_1 >>> 0 < $2_1 >>> 0 ? $3 + 1 | 0 : $3; break block9; } if ($9_1 | $10_1) { $2_1 = $9_1 - 1 | 0; $4_1 = $10_1 - 1 | 0; $7_1 = ($4_1 | 0) != -1 ? $2_1 + 1 | 0 : $2_1; break block9; } $4_1 = 0; $7_1 = 0; $2_1 = $1_1; $3 = !!$2_1 & ($6_1 | 0) >= 0 | ($6_1 | 0) > 0; $1_1 = $2_1 - $3 | 0; $6_1 = $6_1 - ($2_1 >>> 0 < $3 >>> 0) | 0; } if (($6_1 | 0) >= 0) { break block11 } $2_1 = 0 - ((($4_1 | 0) != 0) + $7_1 | 0) | 0; $3 = 0 - $4_1 >>> 0 > $1_1 >>> 0 & ($2_1 | 0) >= ($6_1 | 0) | ($2_1 | 0) > ($6_1 | 0); $2_1 = $3 ? $4_1 : 0 - $1_1 | 0; $6_1 = $3 ? $7_1 : 0 - ((($1_1 | 0) != 0) + $6_1 | 0) | 0; $3 = $4_1; $1_1 = $2_1; $4_1 = $3 - $2_1 | 0; $7_1 = $7_1 - (($2_1 >>> 0 > $3 >>> 0) + $6_1 | 0) | 0; } if (!($12_1 | $11_1)) { while (1) { $2_1 = HEAPU8[$5_1 | 0]; if (!$2_1 | !($4_1 | $7_1)) { break block14 } $3 = $5_1 + 1 | 0; $5_1 = $3; if ($2_1 >>> 0 >= 192) { while (1) { $5_1 = $3; $3 = $3 + 1 | 0; if (HEAP8[$5_1 | 0] < -64) { continue } break; } } $2_1 = $7_1 - 1 | 0; $4_1 = $4_1 - 1 | 0; $7_1 = ($4_1 | 0) != -1 ? $2_1 + 1 | 0 : $2_1; continue; } } $3 = $5_1; $5_1 = $8_1 >> 31; $2_1 = $5_1; $2_1 = $4_1 >>> 0 < $8_1 >>> 0 & ($7_1 | 0) <= ($2_1 | 0) | ($2_1 | 0) > ($7_1 | 0); $3 = $3 + ($2_1 ? $4_1 : 0) | 0; $11_1 = $1_1; $9_1 = $8_1 - $4_1 | 0; $10_1 = $1_1 >>> 0 < $9_1 >>> 0; $1_1 = $5_1 - (($4_1 >>> 0 > $8_1 >>> 0) + $7_1 | 0) | 0; $5_1 = $10_1 & ($1_1 | 0) >= ($6_1 | 0) | ($1_1 | 0) > ($6_1 | 0); $4_1 = $2_1 ? ($5_1 ? $11_1 : $9_1) : 0; __inlined_func$231$139 : { if (!(!($2_1 ? ($5_1 ? $6_1 : $1_1) : 0) & $4_1 >>> 0 < 2147483648)) { $232($3, -1, $0_1); break __inlined_func$231$139; } $226($0_1, $3, $4_1, 0, -1); } } return; } $3 = $5_1; while (1) { $2_1 = $2_1 & 255; if (!(!$2_1 | !($1_1 | $6_1))) { $3 = $3 + 1 | 0; block18 : { if ($2_1 >>> 0 > 191) { $4_1 = $3; while (1) { $3 = $4_1; $4_1 = $3 + 1 | 0; $2_1 = HEAP8[$3 | 0]; if (($2_1 | 0) < -64) { continue } break; }; break block18; } $2_1 = HEAPU8[$3 | 0]; } $4_1 = $6_1 - 1 | 0; $1_1 = $1_1 - 1 | 0; $6_1 = ($1_1 | 0) != -1 ? $4_1 + 1 | 0 : $4_1; continue; } break; }; $1_1 = $0_1; $0_1 = $3 - $5_1 | 0; $247($1_1, $5_1, $0_1, $0_1 >> 31, -1); } function $1444($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $0_1 = $266($0_1, 40); $3 = $301(HEAP32[$2_1 >> 2]); block : { if (!$0_1 | ($3 | 0) == 5) { break block } $4_1 = HEAP32[$0_1 + 28 >> 2]; $5_1 = HEAP32[$0_1 + 24 >> 2] + 1 | 0; $4_1 = $5_1 ? $4_1 : $4_1 + 1 | 0; HEAP32[$0_1 + 24 >> 2] = $5_1; HEAP32[$0_1 + 28 >> 2] = $4_1; if (!HEAPU8[$0_1 + 32 | 0]) { if (($3 | 0) != 1) { $1445($0_1, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2]); HEAP8[$0_1 + 32 | 0] = 1; $1446($0_1, $39(HEAP32[$2_1 >> 2])); break block; } $3 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$1_1 + 8 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 12 >> 2] = $3; if (!$689($1_1 + 8 | 0, $50(HEAP32[$2_1 >> 2]), i64toi32_i32$HIGH_BITS)) { $2_1 = HEAP32[$1_1 + 12 >> 2]; HEAP32[$0_1 + 16 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$0_1 + 20 >> 2] = $2_1; break block; } HEAP8[$0_1 + 33 | 0] = 1; $1445($0_1, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2]); HEAP8[$0_1 + 32 | 0] = 1; $1447($0_1, $50(HEAP32[$2_1 >> 2]), i64toi32_i32$HIGH_BITS); break block; } if (($3 | 0) == 1) { $1447($0_1, $50(HEAP32[$2_1 >> 2]), i64toi32_i32$HIGH_BITS); break block; } HEAP8[$0_1 + 33 | 0] = 0; $1446($0_1, $39(HEAP32[$2_1 >> 2])); } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1445($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0.0, $5_1 = 0; $3 = $2_1 + -1048576 | 0; block1 : { if (!(($3 | 0) == -2097152 & ($1_1 | 0) != 0 | $3 >>> 0 > 4292870144)) { $3 = __wasm_i64_srem($1_1, $2_1, 16384, 0); $4_1 = +($1_1 - $3 >>> 0); $5_1 = $1_1 >>> 0 < $3 >>> 0; $1_1 = i64toi32_i32$HIGH_BITS; HEAPF64[$0_1 >> 3] = $4_1 + +($2_1 - ($5_1 + $1_1 | 0) | 0) * 4294967296.0; $4_1 = +($3 >>> 0) + +($1_1 | 0) * 4294967296.0; break block1; } HEAPF64[$0_1 >> 3] = +($1_1 >>> 0) + +($2_1 | 0) * 4294967296.0; $4_1 = 0.0; } HEAPF64[$0_1 + 8 >> 3] = $4_1; } function $1446($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 32 | 0; HEAPF64[$2_1 + 24 >> 3] = $1_1; HEAPF64[$2_1 + 16 >> 3] = HEAPF64[$0_1 >> 3]; HEAPF64[$2_1 + 8 >> 3] = HEAPF64[$2_1 + 16 >> 3] + HEAPF64[$2_1 + 24 >> 3]; $3 = $2_1 + 24 | 0; $4_1 = $2_1 + 16 | 0; $5_1 = Math_abs(HEAPF64[$2_1 + 16 >> 3]) > Math_abs(HEAPF64[$2_1 + 24 >> 3]); HEAPF64[$0_1 + 8 >> 3] = HEAPF64[$0_1 + 8 >> 3] + (HEAPF64[($5_1 ? $3 : $4_1) >> 3] + (HEAPF64[($5_1 ? $4_1 : $3) >> 3] - HEAPF64[$2_1 + 8 >> 3])); HEAPF64[$0_1 >> 3] = HEAPF64[$2_1 + 8 >> 3]; } function $1447($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = $2_1 + -1048576 | 0; block1 : { if (!(!$1_1 & ($3 | 0) == -2097152 | $3 >>> 0 < 4292870144)) { $3 = $1_1; break block1; } $3 = __wasm_i64_srem($1_1, $2_1, 16384, 0); $4_1 = $2_1; $2_1 = i64toi32_i32$HIGH_BITS; $1446($0_1, +($1_1 - $3 >>> 0) + +($4_1 - ($2_1 + ($1_1 >>> 0 < $3 >>> 0) | 0) | 0) * 4294967296.0); } $1446($0_1, +($3 >>> 0) + +($2_1 | 0) * 4294967296.0); } function $1448($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0.0, $4_1 = 0.0, $5_1 = 0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $5_1 = HEAP32[$1_1 + 24 >> 2]; $2_1 = HEAP32[$1_1 + 28 >> 2]; if (($2_1 | 0) < 0) { $2_1 = 1 } else { $2_1 = !$5_1 & ($2_1 | 0) <= 0 } if ($2_1) { break block } if (HEAPU8[$1_1 + 32 | 0]) { if (HEAPU8[$1_1 + 33 | 0]) { $235($0_1, 1704, -1); return; } $3 = HEAPF64[$1_1 >> 3]; $4_1 = HEAPF64[$1_1 + 8 >> 3]; wasm2js_scratch_store_f64(+$4_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; if (($1_1 & 2147483647) >>> 0 <= 2146435071) { $233($0_1, $4_1 + $3); return; } $233($0_1, $3); return; } $240($0_1, HEAP32[$1_1 + 16 >> 2], HEAP32[$1_1 + 20 >> 2]); } } function $1449($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; block : { $0_1 = $266($0_1, 40); $3 = $301(HEAP32[$2_1 >> 2]); if (!$0_1 | ($3 | 0) == 5) { break block } $1_1 = HEAP32[$0_1 + 28 >> 2] - 1 | 0; $4_1 = HEAP32[$0_1 + 24 >> 2] - 1 | 0; $1_1 = ($4_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 24 >> 2] = $4_1; HEAP32[$0_1 + 28 >> 2] = $1_1; $1_1 = HEAP32[$2_1 >> 2]; if (!HEAPU8[$0_1 + 32 | 0]) { if (!$741($0_1 + 16 | 0, $50($1_1), i64toi32_i32$HIGH_BITS)) { break block } HEAP16[$0_1 + 32 >> 1] = 257; return; } if (($3 | 0) == 1) { $1_1 = $50($1_1); $2_1 = i64toi32_i32$HIGH_BITS; if (!(!$1_1 & ($2_1 | 0) == -2147483648)) { $1447($0_1, 0 - $1_1 | 0, 0 - ($2_1 + (($1_1 | 0) != 0) | 0) | 0); return; } $1447($0_1, -1, 2147483647); $1446($0_1, 1.0); return; } $1446($0_1, -$39($1_1)); } } function $1450($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0.0, $2_1 = 0.0, $3 = 0; $3 = $0_1; $0_1 = $266($0_1, 0); $1_1 = 0.0; block1 : { if (!$0_1) { break block1 } if (HEAPU8[$0_1 + 32 | 0]) { $1_1 = HEAPF64[$0_1 >> 3]; $2_1 = HEAPF64[$0_1 + 8 >> 3]; wasm2js_scratch_store_f64(+$2_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $1_1 = ($0_1 & 2147483647) >>> 0 < 2146435072 ? $1_1 + $2_1 : $1_1; break block1; } $1_1 = +HEAPU32[$0_1 + 16 >> 2] + +HEAP32[$0_1 + 20 >> 2] * 4294967296.0; } $233($3, $1_1); } function $1451($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0.0, $3 = 0, $4_1 = 0, $5_1 = 0.0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $4_1 = HEAP32[$1_1 + 24 >> 2]; $3 = HEAP32[$1_1 + 28 >> 2]; if (!$4_1 & ($3 | 0) <= 0 | ($3 | 0) < 0) { break block } block2 : { if (HEAPU8[$1_1 + 32 | 0]) { $2_1 = HEAPF64[$1_1 >> 3]; $5_1 = HEAPF64[$1_1 + 8 >> 3]; wasm2js_scratch_store_f64(+$5_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $2_1 = ($1_1 & 2147483647) >>> 0 < 2146435072 ? $2_1 + $5_1 : $2_1; break block2; } $2_1 = +HEAPU32[$1_1 + 16 >> 2] + +HEAP32[$1_1 + 20 >> 2] * 4294967296.0; } $233($0_1, $2_1 / (+($4_1 >>> 0) + +($3 >>> 0) * 4294967296.0)); } } function $1452($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $0_1 = $266($0_1, 8); block1 : { if ($1_1) { $2_1 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $1_1; $3 = 0; } else { $3 = 1 << $1_1; $2_1 = $3 - 1 & 1 >>> 32 - $1_1; } if (!($3 & 1431655765 | $2_1 & 1431655765)) { break block1 } } if (!$0_1) { break block1 } $1_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 >> 2] + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; } } function $1453($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = $266($0_1, 0); block1 : { if (!$1_1) { $1_1 = 0; break block1; } $2_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; } $240($0_1, $2_1, $1_1); } function $1454($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $0_1 = $266($0_1, 8); block1 : { if ($1_1) { $2_1 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $1_1; $3 = 0; } else { $3 = 1 << $1_1; $2_1 = $3 - 1 & 1 >>> 32 - $1_1; } if (!($3 & 1431655765 | $2_1 & 1431655765)) { break block1 } } if (!$0_1) { break block1 } $1_1 = HEAP32[$0_1 + 4 >> 2] - 1 | 0; $2_1 = HEAP32[$0_1 >> 2] - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; } } function $1455($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { $4_1 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $3 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $3; $5_1 = 0; } else { $5_1 = 1 << $3; $4_1 = $5_1 - 1 & 1 >>> 32 - $3; } if ($5_1 & -1431655766 | $4_1 & -1431655766) { break block } $3 = $266($0_1, 36); if (!$3) { break block } $4_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$3 + 12 >> 2] = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] + 120 >> 2]; block3 : { if (($1_1 | 0) == 1) { if ($4_1) { $41($3, 1, 44); break block3; } HEAP32[$3 + 28 >> 2] = 1; break block3; } $0_1 = HEAP32[$2_1 + 4 >> 2]; block9 : { block10 : { block8 : { if ($4_1) { $0_1 = $53($0_1); $4_1 = $209(HEAP32[$2_1 + 4 >> 2]); block6 : { if (!$0_1) { $4_1 = 0; break block6; } $36($3, $0_1, $4_1); } $0_1 = HEAP32[$3 + 32 >> 2]; if (($4_1 | 0) == HEAP32[$3 + 28 >> 2]) { if (!$0_1) { break block3 } $5_1 = $3 + 32 | 0; break block8; } $5_1 = $3 + 32 | 0; if ($0_1) { break block8 } $1_1 = $31((HEAP32[$3 + 24 >> 2] << 2) + 4 | 0, 0); if (!$1_1) { break block9 } $0_1 = HEAP32[$3 + 24 >> 2]; $6_1 = (($0_1 | 0) <= 1 ? 1 : $0_1) - 1 | 0; $0_1 = 0; while (1) { if (($0_1 | 0) == ($6_1 | 0)) { break block10 } HEAP32[($0_1 << 2) + $1_1 >> 2] = HEAP32[$3 + 28 >> 2]; $0_1 = $0_1 + 1 | 0; continue; }; } HEAP32[$3 + 28 >> 2] = $209($0_1); break block3; } $1_1 = $34($0_1, HEAP32[$3 + 24 >> 2] << 2, 0); if (!$1_1) { break block9 } } $0_1 = HEAP32[$3 + 24 >> 2]; if (($0_1 | 0) > 0) { HEAP32[(($0_1 << 2) + $1_1 | 0) - 4 >> 2] = $4_1 } HEAP32[$5_1 >> 2] = $1_1; break block3; } $52($3, 7); } HEAP32[$3 + 24 >> 2] = HEAP32[$3 + 24 >> 2] + 1; $0_1 = $53(HEAP32[$2_1 >> 2]); $1_1 = $209(HEAP32[$2_1 >> 2]); if (!$0_1) { break block } $36($3, $0_1, $1_1); } } function $1456($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { $1404($0_1, $1_1); $24(HEAP32[$1_1 + 32 >> 2]); } } function $1457($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { block2 : { $2_1 = HEAPU8[$1_1 + 20 | 0]; if (($2_1 | 0) != 7) { if (($2_1 | 0) != 18) { break block2 } $230($0_1); return; } $227($0_1); return; } $2_1 = HEAP32[$1_1 + 16 >> 2]; block5 : { block4 : { if (HEAP32[$1_1 + 24 >> 2] > 0) { if ($2_1) { break block4 } $246($0_1, 30822, 1, 0); return; } if ($2_1) { break block4 } $2_1 = 0; $1_1 = 0; break block5; } HEAP8[$2_1 + HEAP32[$1_1 + 4 >> 2] | 0] = 0; $2_1 = HEAP32[$1_1 + 16 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; } $246($0_1, $1_1, $2_1, -1); } } function $1458($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; block : { $3 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $1_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $1_1; $4_1 = 0; } else { $4_1 = 1 << $1_1; $3 = $4_1 - 1 & 1 >>> 32 - $1_1; } if ($4_1 & -1431655766 | $3 & -1431655766) { break block } $0_1 = $266($0_1, 36); if (!$0_1) { break block } $53(HEAP32[$2_1 >> 2]); $2_1 = $209(HEAP32[$2_1 >> 2]); $3 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$0_1 + 24 >> 2] = $3 - 1; $1_1 = HEAP32[$0_1 + 32 >> 2]; block2 : { if ($1_1) { if (($3 | 0) < 2) { break block2 } $4_1 = HEAP32[$1_1 >> 2]; $3 = ($3 << 2) - 8 | 0; if ($3) { wasm2js_memory_copy($1_1, $1_1 + 4 | 0, $3) } $2_1 = $2_1 + $4_1 | 0; break block2; } $2_1 = HEAP32[$0_1 + 28 >> 2] + $2_1 | 0; } $1_1 = HEAP32[$0_1 + 16 >> 2]; block5 : { if (($2_1 | 0) >= ($1_1 | 0)) { HEAP32[$0_1 + 16 >> 2] = 0; break block5; } $1_1 = $1_1 - $2_1 | 0; HEAP32[$0_1 + 16 >> 2] = $1_1; if ($1_1) { $3 = HEAP32[$0_1 + 4 >> 2]; wasm2js_memory_copy($3, $2_1 + $3 | 0, $1_1); } if (HEAP32[$0_1 + 16 >> 2]) { break block } } HEAP32[$0_1 + 12 >> 2] = 0; $24(HEAP32[$0_1 + 32 >> 2]); HEAP32[$0_1 + 32 >> 2] = 0; } } function $1459($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if ($301(HEAP32[$2_1 >> 2]) - 3 >>> 0 >= 4294967294) { $3 = $39(HEAP32[$2_1 >> 2]); $238($0_1, $3 < 0.0 ? -1 : $3 > 0.0); } } function $1460($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $3 = global$0 - 352 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $7_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $12_1 = $53(HEAP32[$2_1 >> 2]); $8_1 = $53(HEAP32[$2_1 + 12 >> 2]); $11_1 = $53(HEAP32[$2_1 + 16 >> 2]); $1_1 = $50(HEAP32[$2_1 + 20 >> 2]); $13_1 = $53(HEAP32[$2_1 + 24 >> 2]); $14 = $50(HEAP32[$2_1 + 28 >> 2]); $4_1 = $50(HEAP32[$2_1 + 32 >> 2]); block : { if (!$13_1 | (!$12_1 | !$11_1)) { break block } if (($1_1 | 0) < 0) { break block } $15_1 = HEAP32[$7_1 + 364 >> 2]; $4($7_1); $6_1 = $319($7_1, $11_1, $8_1); if (!$6_1 | HEAP16[$6_1 + 34 >> 1] <= ($1_1 | 0)) { break block } $9_1 = HEAP32[HEAP32[$6_1 + 4 >> 2] + Math_imul($1_1, 12) >> 2]; HEAP32[$3 + 344 >> 2] = 0; $5_1 = $3 + 336 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$3 + 328 >> 2] = 0; HEAP32[$3 + 332 >> 2] = 0; HEAP32[$5_1 >> 2] = HEAP16[$6_1 + 32 >> 1] == ($1_1 | 0) ? -1 : $1_1; HEAP32[$7_1 + 364 >> 2] = 0; $5_1 = $3 + 40 | 0; $4_1 = $1461($5_1, $8_1, $7_1, $12_1, $4_1); HEAP32[$3 + 32 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 96; HEAP32[$3 + 16 >> 2] = 97; HEAP32[$3 + 340 >> 2] = $6_1; HEAP32[$3 + 36 >> 2] = $3 + 328; HEAP32[$3 + 12 >> 2] = $5_1; block1 : { if ($4_1) { break block1 } block4 : { block6 : { $5_1 = HEAP32[$3 + 292 >> 2]; if ($5_1) { block3 : { switch (HEAPU8[$5_1 + 43 | 0]) { case 2: $1_1 = HEAP32[$5_1 + 44 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -2097153; HEAP32[$3 + 52 >> 2] = 0; $1017($3 + 40 | 0, $1_1, 0); $4_1 = HEAPU8[$7_1 + 87 | 0] ? 7 : HEAP32[$3 + 52 >> 2]; if ($4_1) { break block1 } $919($3 + 12 | 0, $1_1); break block4; case 0: break block3; default: break block4; }; } $6_1 = $66($11_1, HEAP32[$5_1 >> 2]); HEAP32[$3 + 340 >> 2] = $5_1; if ($6_1) { break block6 } if (($1_1 | 0) < HEAP16[$5_1 + 34 >> 1]) { $1464($3 + 40 | 0, $3 + 328 | 0, HEAP32[HEAP32[$5_1 + 4 >> 2] + Math_imul($1_1, 12) >> 2]); $5_1 = HEAP32[$3 + 292 >> 2]; } $4_1 = $3 + 12 | 0; if (HEAP32[$3 + 336 >> 2] < 0) { $1464($3 + 40 | 0, $3 + 328 | 0, $5_1 + 32 | 0); $5_1 = HEAP32[$3 + 292 >> 2]; } $921($4_1, HEAP32[$5_1 + 16 >> 2]); $4_1 = HEAP32[$3 + 292 >> 2] + 8 | 0; while (1) { $4_1 = HEAP32[$4_1 >> 2]; if ($4_1) { $921($3 + 12 | 0, HEAP32[$4_1 + 40 >> 2]); $4_1 = $4_1 + 20 | 0; continue; } break; }; $4_1 = HEAP32[$3 + 296 >> 2]; while (1) if ($4_1) { $921($3 + 12 | 0, HEAP32[$4_1 + 40 >> 2]); $4_1 = HEAP32[$4_1 + 20 >> 2]; continue; } else { $4_1 = 0; while (1) { $5_1 = HEAP32[$3 + 292 >> 2]; if (HEAP16[$5_1 + 34 >> 1] <= ($4_1 | 0)) { break block6 } $920($3 + 12 | 0, $891($5_1, HEAP32[$5_1 + 4 >> 2] + Math_imul($4_1, 12) | 0)); $4_1 = $4_1 + 1 | 0; continue; }; }; } $1_1 = HEAP32[$3 + 296 >> 2]; if ($1_1) { $5_1 = $3 + 12 | 0; $921($5_1, HEAP32[$1_1 + 40 >> 2]); $920($5_1, HEAP32[HEAP32[$3 + 296 >> 2] + 36 >> 2]); break block4; } $4_1 = $1465($3 + 40 | 0); if ($4_1) { break block1 } $1_1 = HEAP32[$3 + 300 >> 2] + 28 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if ($1_1) { $4_1 = HEAP32[$1_1 + 12 >> 2]; block13 : { if (!$4_1) { break block13 } $5_1 = $3 + 40 | 0; if (($308($5_1, 0, $4_1, $8_1) | 0) != ($6_1 | 0)) { break block13 } $4_1 = HEAP32[$1_1 + 32 >> 2]; if ($4_1) { $1466($5_1, $3 + 328 | 0, HEAP32[$4_1 + 8 >> 2], $9_1) } $5_1 = $3 + 40 | 0; $4_1 = $3 + 328 | 0; $1467($5_1, $4_1, HEAP32[$1_1 + 28 >> 2], $9_1); $1466($5_1, $4_1, HEAP32[$1_1 + 24 >> 2], $9_1); } $1_1 = $1_1 + 40 | 0; continue; } break; }; $4_1 = HEAP32[$3 + 300 >> 2]; $1_1 = $3 + 12 | 0; if (HEAP32[$3 + 176 >> 2] == ($6_1 | 0)) { $1467($3 + 40 | 0, $3 + 328 | 0, HEAP32[$4_1 + 16 >> 2], $9_1); $4_1 = HEAP32[$3 + 300 >> 2]; } $1468($1_1, $4_1); break block4; } $4_1 = $5_1 + 48 | 0; while (1) { $5_1 = HEAP32[$4_1 >> 2]; if (!$5_1) { break block4 } $8_1 = $5_1 + 40 | 0; $16_1 = $5_1 + 36 | 0; $4_1 = 0; while (1) { if (!(HEAP32[$5_1 + 20 >> 2] <= ($4_1 | 0))) { block17 : { if ($6_1) { break block17 } $10_1 = ($4_1 << 3) + $16_1 | 0; if (HEAP32[$10_1 >> 2] != ($1_1 | 0)) { break block17 } $1464($3 + 40 | 0, $3 + 328 | 0, $10_1); } block18 : { if ($66(HEAP32[$5_1 + 8 >> 2], $11_1)) { break block18 } $10_1 = HEAP32[($4_1 << 3) + $8_1 >> 2]; if ($66($10_1, $9_1)) { break block18 } $1464($3 + 40 | 0, $3 + 328 | 0, $10_1); } $4_1 = $4_1 + 1 | 0; continue; } break; }; $4_1 = $5_1 + 4 | 0; continue; }; } $4_1 = $1469($0_1, $3 + 328 | 0, $12_1, $13_1, $14); } block19 : { block21 : { block20 : { switch ($4_1 | 0) { case 0: break block19; case 1: break block20; default: break block21; }; } if ((HEAP32[$7_1 + 32 >> 2] & 268435457) != 1) { break block21 } $250($0_1, HEAP32[$2_1 >> 2]); break block19; } if (HEAP32[$3 + 44 >> 2]) { $1470($0_1, 30822, HEAP32[$2_1 + 4 >> 2], HEAP32[$2_1 + 8 >> 2], $3 + 40 | 0); break block19; } $255($0_1, $4_1); } $1471($3 + 40 | 0); $1472($7_1, HEAP32[$3 + 328 >> 2]); HEAP32[$7_1 + 364 >> 2] = $15_1; } $0_1 = $3 + 352 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1461($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $139($0_1, $2_1); if (!$3) { return 7 } if ($68($3, 30629, 7)) { return $181(118068) } $5_1 = 1; if (!$4_1) { $5_1 = $92($2_1, $1_1) } HEAP8[$2_1 + 176 | 0] = $5_1; HEAP16[$0_1 + 160 >> 1] = 1; HEAP32[$0_1 >> 2] = $2_1; HEAP8[$0_1 + 224 | 0] = 2; $3 = (wasm2js_i32$0 = 7, wasm2js_i32$1 = $357($0_1, $3), wasm2js_i32$2 = HEAPU8[$2_1 + 87 | 0], wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); block3 : { if ($3) { break block3 } $3 = 0; if (HEAP32[$0_1 + 260 >> 2] | (HEAP32[$0_1 + 252 >> 2] | HEAP32[$0_1 + 256 >> 2])) { break block3 } $3 = $181(118079); } HEAP8[$2_1 + 176 | 0] = 0; return $3; } function $1462($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = 1; if (!(HEAPU16[$1_1 + 6 >> 1] & 1056)) { $1261($0_1, $1_1); $2_1 = 0; } return $2_1 | 0; } function $1463($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 24 >> 2]; $3 = HEAPU8[$1_1 | 0]; block1 : { block2 : { if (($3 | 0) != 168) { if (($3 | 0) != 78 | HEAP32[$2_1 + 8 >> 2] != HEAP16[$1_1 + 32 >> 1]) { break block1 } $0_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$0_1 + 136 >> 2] == HEAP32[$2_1 + 12 >> 2]) { break block2 } break block1; } if (HEAPU8[$1_1 + 7 | 0] & 3 | HEAP32[$2_1 + 8 >> 2] != HEAP16[$1_1 + 32 >> 1] | HEAP32[$2_1 + 12 >> 2] != HEAP32[$1_1 + 44 >> 2]) { break block1 } $0_1 = HEAP32[$0_1 >> 2]; } $1464($0_1, $2_1, $1_1); } return 0; } function $1464($0_1, $1_1, $2_1) { var $3 = 0; block : { if (!$2_1) { break block } $3 = $0_1 + 284 | 0; while (1) { $0_1 = HEAP32[$3 >> 2]; if (!$0_1) { break block } if (($2_1 | 0) == HEAP32[$0_1 >> 2]) { if ($1_1) { HEAP32[$3 >> 2] = HEAP32[$0_1 + 12 >> 2]; HEAP32[$0_1 + 12 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$1_1 >> 2] = $0_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] + 1; } return $0_1; } else { $3 = $0_1 + 12 | 0; continue; } }; } return 0; } function $1465($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = global$0 - 48 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $7_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 260 >> 2]; $3 = $4_1 + 40 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $4_1 + 32 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $3 = $4_1 + 24 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 20 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = $0_1; $3 = $319($7_1, HEAP32[$1_1 + 4 >> 2], HEAP32[HEAP32[$7_1 + 16 >> 2] + ($309($7_1, HEAP32[$1_1 + 24 >> 2]) << 4) >> 2]); HEAP32[$0_1 + 136 >> 2] = $3; HEAP8[$0_1 + 162 | 0] = HEAPU8[$1_1 + 8 | 0]; block1 : { block : { if (!$3) { break block } if (!$897($0_1, $3)) { break block } $2_1 = 1; break block1; } $3 = HEAP32[$1_1 + 12 >> 2]; $2_1 = 0; if (!$3) { break block1 } $2_1 = $1096($4_1 + 12 | 0, $3); } $6_1 = $1_1 + 28 | 0; while (1) { block3 : { if ($2_1) { break block3 } $5_1 = HEAP32[$6_1 >> 2]; if (!$5_1) { break block3 } $1_1 = HEAP32[$5_1 + 8 >> 2]; block5 : { block4 : { if (!$1_1) { break block4 } $1017($0_1, $1_1, $4_1 + 12 | 0); if (!HEAP32[$0_1 + 40 >> 2]) { break block4 } $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($2_1) { break block5 } } if (!HEAP32[$5_1 + 12 >> 2]) { $2_1 = 0; break block5; } $8_1 = $1387($0_1, $5_1); if (!$8_1) { $2_1 = 7; break block5; } $1_1 = $939($0_1, HEAP32[$5_1 + 24 >> 2], $8_1, 0, 0, 0, 0, 0, 0); block10 : { if ($1_1) { $1480(HEAP32[$5_1 + 24 >> 2], 1); $1017($0_1, $1_1, 0); $1480(HEAP32[$5_1 + 24 >> 2], 0); $9_1 = HEAP32[$0_1 + 40 >> 2]; $3 = ($9_1 | 0) != 0; if (HEAP32[$5_1 + 24 >> 2]) { HEAP32[$1_1 + 28 >> 2] = 0 } $2_1 = 0; HEAP32[$1_1 + 32 >> 2] = 0; $789($7_1, $1_1); $6_1 = HEAP32[$5_1 + 16 >> 2]; $1_1 = $6_1 ? 1 : $3; if ($9_1 | !$6_1) { break block10 } while (1) if (($2_1 | 0) >= HEAP32[$6_1 >> 2]) { $1_1 = $3; break block10; } else { $1_1 = Math_imul($2_1, 48) + $6_1 | 0; if (HEAPU8[$1_1 + 21 | 0] & 4) { $1017($0_1, HEAP32[HEAP32[($1_1 + 8 | 0) + 44 >> 2] >> 2], 0); $6_1 = HEAP32[$5_1 + 16 >> 2]; } $2_1 = $2_1 + 1 | 0; continue; }; } $8_1 = 0; HEAP32[$5_1 + 24 >> 2] = 0; $1_1 = 7; } $3 = HEAPU8[$7_1 + 87 | 0]; HEAP32[$4_1 + 16 >> 2] = $8_1; $2_1 = $3 ? 7 : $1_1; block13 : { if ($2_1) { break block13 } $1_1 = HEAP32[$5_1 + 20 >> 2]; if ($1_1) { $2_1 = 1; if ($1096($4_1 + 12 | 0, $1_1)) { break block13 } } $2_1 = $1126($4_1 + 12 | 0, HEAP32[$5_1 + 24 >> 2]); } $1_1 = HEAP32[$5_1 + 32 >> 2]; if (!($2_1 | !$1_1)) { HEAP32[$1_1 + 32 >> 2] = $8_1; HEAP32[$4_1 + 36 >> 2] = 512; HEAP32[$4_1 + 20 >> 2] = $1_1; $2_1 = 1; $6_1 = $4_1 + 12 | 0; block16 : { if ($1126($6_1, HEAP32[$1_1 >> 2])) { break block16 } if ($1126($6_1, HEAP32[$1_1 + 8 >> 2])) { break block16 } if ($1096($6_1, HEAP32[$1_1 + 12 >> 2])) { break block16 } $2_1 = $1096($6_1, HEAP32[$1_1 + 4 >> 2]); } HEAP32[$4_1 + 36 >> 2] = 0; } HEAP32[$4_1 + 16 >> 2] = 0; $794($7_1, $8_1); } $6_1 = $5_1 + 40 | 0; continue; } break; }; $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1466($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!$2_1) { break block } $6_1 = $2_1 + 8 | 0; while (1) { if (HEAP32[$2_1 >> 2] <= ($5_1 | 0)) { break block } $4_1 = ($5_1 << 4) + $6_1 | 0; block1 : { if (HEAPU8[$4_1 + 9 | 0] & 3) { break block1 } $4_1 = HEAP32[$4_1 + 4 >> 2]; if (!$4_1) { break block1 } if ($66($4_1, $3)) { break block1 } $1464($0_1, $1_1, $4_1); } $5_1 = $5_1 + 1 | 0; continue; }; } } function $1467($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (!$2_1) { break block } $6_1 = $2_1 + 4 | 0; while (1) { if (HEAP32[$2_1 >> 2] <= ($4_1 | 0)) { break block } $5_1 = HEAP32[($4_1 << 2) + $6_1 >> 2]; if (!$66($5_1, $3)) { $1464($0_1, $1_1, $5_1) } $4_1 = $4_1 + 1 | 0; continue; }; } } function $1468($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $920($0_1, HEAP32[$1_1 + 12 >> 2]); $1_1 = $1_1 + 28 | 0; while (1) { $2_1 = HEAP32[$1_1 >> 2]; if ($2_1) { $919($0_1, HEAP32[$2_1 + 8 >> 2]); $920($0_1, HEAP32[$2_1 + 20 >> 2]); $921($0_1, HEAP32[$2_1 + 24 >> 2]); $1_1 = HEAP32[$2_1 + 32 >> 2]; if ($1_1) { $921($0_1, HEAP32[$1_1 >> 2]); $921($0_1, HEAP32[$1_1 + 8 >> 2]); $920($0_1, HEAP32[$1_1 + 12 >> 2]); $920($0_1, HEAP32[$1_1 + 4 >> 2]); } block2 : { $3 = HEAP32[$2_1 + 16 >> 2]; if (!$3) { break block2 } $5_1 = $3 + 8 | 0; $1_1 = 0; while (1) { if (HEAP32[$3 >> 2] <= ($1_1 | 0)) { break block2 } $4_1 = Math_imul($1_1, 48) + $5_1 | 0; if (HEAPU8[$4_1 + 13 | 0] & 4) { $919($0_1, HEAP32[HEAP32[$4_1 + 44 >> 2] >> 2]) } $1_1 = $1_1 + 1 | 0; continue; }; } $1_1 = $2_1 + 40 | 0; continue; } break; }; } function $1469($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0; $11_1 = global$0 - 32 | 0; $5_1 = $11_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $18_1 = $48($3); $10_1 = $48($2_1); $5_1 = $10_1; $12_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; block2 : { block4 : { block6 : { block3 : { block1 : { if ($3) { HEAP32[$11_1 + 16 >> 2] = $3; $15_1 = $310($12_1, 30773, $11_1 + 16 | 0); if ($15_1) { break block1 } $6_1 = 7; break block2; } $7_1 = $5_1 >>> 31 | 0; $5_1 = $5_1 << 1 | 1; $8_1 = $270($12_1, __wasm_i64_mul($5_1, $7_1, 3, 0), i64toi32_i32$HIGH_BITS); if ($8_1) { break block3 } $6_1 = 7; break block4; } $7_1 = HEAP32[$1_1 + 4 >> 2]; $16_1 = $48($15_1) - 1 | 0; $6_1 = $16_1; $6_1 = __wasm_i64_mul($7_1, $7_1 >> 31, $6_1, $6_1 >> 31); $7_1 = $6_1 + $5_1 | 0; $5_1 = i64toi32_i32$HIGH_BITS; $5_1 = $6_1 >>> 0 > $7_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; $7_1 = $7_1 + 1 | 0; $5_1 = $7_1 ? $5_1 : $5_1 + 1 | 0; $8_1 = $270($12_1, $7_1, $5_1); if ($8_1) { $13_1 = 0; break block6; } $6_1 = 7; break block4; } $19_1 = (($10_1 << 2) + $8_1 | 0) + 2 | 0; $13_1 = $5_1 + $8_1 | 0; } if ($10_1) { wasm2js_memory_copy($8_1, $2_1, $10_1) } $20_1 = $10_1 << 1; label1 : while (1) { block8 : { $6_1 = HEAP32[$1_1 >> 2]; $5_1 = $6_1; if (!$5_1) { break block8 } while (1) { $5_1 = HEAP32[$5_1 + 12 >> 2]; if ($5_1) { $6_1 = HEAPU32[$5_1 + 4 >> 2] > HEAPU32[$6_1 + 4 >> 2] ? $5_1 : $6_1; continue; } else { $5_1 = $1_1; while (1) { $7_1 = $5_1; $9_1 = HEAP32[$5_1 >> 2]; $5_1 = $9_1 + 12 | 0; if (($6_1 | 0) != ($9_1 | 0)) { continue } break; }; HEAP32[$7_1 >> 2] = HEAP32[$6_1 + 12 >> 2]; $9_1 = HEAP32[$6_1 + 4 >> 2]; block12 : { if ($3) { if (!(!(HEAPU8[HEAPU8[$9_1 | 0] + 31424 | 0] & 70) | $4_1)) { $5_1 = $18_1; $7_1 = $3; break block12; } $5_1 = (HEAPU8[HEAP32[$6_1 + 8 >> 2] + $9_1 | 0] == 34) + $16_1 | 0; $7_1 = $15_1; break block12; } $5_1 = HEAP32[$6_1 + 8 >> 2]; if ($5_1) { wasm2js_memory_copy($13_1, $9_1, $5_1) } HEAP8[HEAP32[$6_1 + 8 >> 2] + $13_1 | 0] = 0; $300($13_1); $5_1 = HEAPU8[HEAP32[$6_1 + 4 >> 2] + HEAP32[$6_1 + 8 >> 2] | 0]; HEAP32[$11_1 >> 2] = $13_1; HEAP32[$11_1 + 4 >> 2] = ($5_1 | 0) == 39 ? 30791 : 30822; $7_1 = $63($20_1, $19_1, 6165, $11_1); $5_1 = $48($7_1); $9_1 = HEAP32[$6_1 + 4 >> 2]; } $9_1 = $9_1 - $2_1 | 0; $14 = HEAP32[$6_1 + 8 >> 2]; if (($5_1 | 0) != ($14 | 0)) { $14 = $9_1 + $14 | 0; $17_1 = $10_1 - $14 | 0; if ($17_1) { wasm2js_memory_copy(($9_1 + $8_1 | 0) + $5_1 | 0, $8_1 + $14 | 0, $17_1) } $10_1 = ($5_1 - HEAP32[$6_1 + 8 >> 2] | 0) + $10_1 | 0; HEAP8[$8_1 + $10_1 | 0] = 0; } if ($5_1) { wasm2js_memory_copy($9_1 + $8_1 | 0, $7_1, $5_1) } $10($12_1, $6_1); continue label1; } }; } break; }; $246($0_1, $8_1, -1, -1); $13($12_1, $8_1); $6_1 = 0; } $24($15_1); } $0_1 = $11_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1470($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 32 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $2_1 = $53($2_1); $3 = $53($3); $6_1 = HEAP32[$4_1 >> 2]; $7_1 = HEAPU8[$1_1 | 0]; HEAP32[$5_1 + 16 >> 2] = HEAP32[$4_1 + 4 >> 2]; HEAP32[$5_1 + 12 >> 2] = $1_1; HEAP32[$5_1 + 4 >> 2] = $3; HEAP32[$5_1 >> 2] = $2_1; HEAP32[$5_1 + 8 >> 2] = $7_1 ? 30791 : 30822; $1_1 = $0_1; $0_1 = $310($6_1, 7735, $5_1); $235($1_1, $0_1, -1); $10(HEAP32[$4_1 >> 2], $0_1); $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1471($0_1) { var $1_1 = 0, $2_1 = 0; $2_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($1_1) { $126($1_1) } $6($2_1, HEAP32[$0_1 + 252 >> 2]); while (1) { $1_1 = HEAP32[$0_1 + 256 >> 2]; if ($1_1) { HEAP32[$0_1 + 256 >> 2] = HEAP32[$1_1 + 20 >> 2]; $704($2_1, $1_1); continue; } break; }; $5($2_1, HEAP32[$0_1 + 260 >> 2]); $10($2_1, HEAP32[$0_1 + 4 >> 2]); $1472($2_1, HEAP32[$0_1 + 284 >> 2]); $141($0_1); } function $1472($0_1, $1_1) { var $2_1 = 0; while (1) { if ($1_1) { $2_1 = HEAP32[$1_1 + 12 >> 2]; $13($0_1, $1_1); $1_1 = $2_1; continue; } break; }; } function $1473($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $3 = global$0 - 384 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $8_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $4_1 = $53(HEAP32[$2_1 >> 2]); $10_1 = $53(HEAP32[$2_1 + 12 >> 2]); $5_1 = $53(HEAP32[$2_1 + 16 >> 2]); $11_1 = $53(HEAP32[$2_1 + 20 >> 2]); $1_1 = $50(HEAP32[$2_1 + 24 >> 2]); if (!(!$11_1 | (!$10_1 | !$5_1))) { $12_1 = HEAP32[$8_1 + 364 >> 2]; HEAP32[$8_1 + 364 >> 2] = 0; $4($8_1); HEAP32[$3 + 88 >> 2] = 0; $6_1 = $3 + 80 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$3 + 72 >> 2] = 0; HEAP32[$3 + 76 >> 2] = 0; $6_1 = $319($8_1, $5_1, $4_1); HEAP32[$3 - -64 >> 2] = 0; HEAP32[$3 + 56 >> 2] = 0; HEAP32[$3 + 60 >> 2] = 0; HEAP32[$3 + 84 >> 2] = $6_1; HEAP32[$3 + 52 >> 2] = 98; HEAP32[$3 + 48 >> 2] = 99; HEAP32[$3 + 68 >> 2] = $3 + 72; $9_1 = $3 + 96 | 0; HEAP32[$3 + 44 >> 2] = $9_1; $1_1 = $1461($9_1, $4_1, $8_1, $10_1, $1_1); block1 : { if ($1_1) { break block1 } $1_1 = HEAP32[$8_1 + 32 >> 2]; $6_1 = $1_1 & 67108864; block4 : { block5 : { $4_1 = HEAP32[$3 + 348 >> 2]; if ($4_1) { $7_1 = HEAPU8[$4_1 + 43 | 0]; if (($7_1 | 0) == 2) { if ($6_1) { break block4 } $1_1 = HEAP32[$4_1 + 44 >> 2]; $5_1 = $3 + 36 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; $5_1 = $3 + 28 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; $5_1 = $3 + 20 | 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$5_1 + 4 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 8 >> 2] = $9_1; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -2097153; $1017($9_1, HEAP32[$4_1 + 44 >> 2], $3 + 8 | 0); if (HEAP32[$3 + 136 >> 2]) { break block5 } $919($3 + 44 | 0, HEAP32[$4_1 + 44 >> 2]); break block4; } block6 : { if (!($1_1 & 16384) & ($6_1 | 0) != 0 | ($7_1 | 0) == 1) { break block6 } $1_1 = $4_1 + 48 | 0; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block6 } $7_1 = HEAP32[$1_1 + 8 >> 2]; if (!$66($7_1, $5_1)) { $1464($3 + 96 | 0, $3 + 72 | 0, $7_1) } $1_1 = $1_1 + 4 | 0; continue; }; } $1_1 = HEAP32[$4_1 >> 2]; if ($66($5_1, $1_1)) { break block4 } HEAP32[$3 + 84 >> 2] = $4_1; $5_1 = $3 + 96 | 0; $7_1 = $3 + 72 | 0; if (!$6_1) { $921($3 + 44 | 0, HEAP32[$4_1 + 16 >> 2]); $1_1 = HEAP32[$4_1 >> 2]; } $1464($5_1, $7_1, $1_1); break block4; } $1_1 = HEAP32[$3 + 352 >> 2]; if ($1_1) { $1464($3 + 96 | 0, $3 + 72 | 0, HEAP32[$1_1 >> 2]); if ($6_1) { break block4 } $920($3 + 44 | 0, HEAP32[HEAP32[$3 + 352 >> 2] + 36 >> 2]); break block4; } $4_1 = HEAP32[$3 + 356 >> 2]; $1_1 = HEAP32[$4_1 + 4 >> 2]; if (!($66($1_1, $5_1) | HEAP32[HEAP32[$3 + 84 >> 2] + 60 >> 2] != HEAP32[$4_1 + 24 >> 2])) { $1464($3 + 96 | 0, $3 + 72 | 0, $1_1) } if ($6_1) { break block4 } $1_1 = $1465($3 + 96 | 0); if ($1_1) { break block1 } $1468($3 + 44 | 0, $4_1); $1_1 = $4_1 + 28 | 0; while (1) { $4_1 = HEAP32[$1_1 >> 2]; if (!$4_1) { break block4 } $1_1 = HEAP32[$4_1 + 12 >> 2]; block11 : { if (!$1_1) { break block11 } if ($67($1_1, $5_1)) { break block11 } $1464($3 + 96 | 0, $3 + 72 | 0, $1_1); } $1_1 = 0; block12 : { $6_1 = HEAP32[$4_1 + 16 >> 2]; if (!$6_1) { break block12 } while (1) { if (HEAP32[$6_1 >> 2] <= ($1_1 | 0)) { break block12 } $7_1 = HEAP32[(Math_imul($1_1, 48) + $6_1 | 0) + 8 >> 2]; if (!$66($7_1, $5_1)) { $1464($3 + 96 | 0, $3 + 72 | 0, $7_1); $6_1 = HEAP32[$4_1 + 16 >> 2]; } $1_1 = $1_1 + 1 | 0; continue; }; } $1_1 = $4_1 + 40 | 0; continue; }; } $1_1 = HEAP32[$3 + 108 >> 2]; if ($1_1) { break block1 } } $1_1 = $1469($0_1, $3 + 72 | 0, $10_1, $11_1, 1); } block14 : { block16 : { block15 : { switch ($1_1 | 0) { case 0: break block14; case 1: break block15; default: break block16; }; } if ((HEAP32[$8_1 + 32 >> 2] & 268435457) != 1) { break block16 } $250($0_1, HEAP32[$2_1 + 12 >> 2]); break block14; } if (HEAP32[$3 + 100 >> 2]) { $1470($0_1, 30822, HEAP32[$2_1 + 4 >> 2], HEAP32[$2_1 + 8 >> 2], $3 + 96 | 0); break block14; } $255($0_1, $1_1); } $1471($3 + 96 | 0); $1472($8_1, HEAP32[$3 + 72 >> 2]); HEAP32[$8_1 + 364 >> 2] = $12_1; } $0_1 = $3 + 384 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1474($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (HEAPU16[$1_1 + 6 >> 1] & 1056) { return 1 } $2_1 = HEAP32[$1_1 + 32 >> 2]; if (!$2_1) { return 2 } $4_1 = HEAP32[$0_1 + 24 >> 2]; $6_1 = $2_1 + 8 | 0; while (1) { if (($3 | 0) < HEAP32[$2_1 >> 2]) { $5_1 = Math_imul($3, 48) + $6_1 | 0; if (HEAP32[$5_1 + 8 >> 2] == HEAP32[$4_1 + 12 >> 2]) { $1464(HEAP32[$0_1 >> 2], $4_1, HEAP32[$5_1 >> 2]) } $3 = $3 + 1 | 0; continue; } break; }; $1261($0_1, $1_1); return 0; } function $1475($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; block : { if (HEAPU8[$1_1 + 7 | 0] & 3 | HEAPU8[$1_1 | 0] != 168) { break block } $2_1 = HEAP32[$0_1 + 24 >> 2]; if (HEAP32[$2_1 + 12 >> 2] != HEAP32[$1_1 + 44 >> 2]) { break block } $1464(HEAP32[$0_1 >> 2], $2_1, $1_1 + 44 | 0); } return 0; } function $1476($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $3 = global$0 - 336 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $9_1 = $53(HEAP32[$2_1 >> 2]); $10_1 = $53(HEAP32[$2_1 + 4 >> 2]); $1_1 = $50(HEAP32[$2_1 + 16 >> 2]); $5_1 = HEAP32[$4_1 + 32 >> 2]; $11_1 = $53(HEAP32[$2_1 + 20 >> 2]); $6_1 = $50(HEAP32[$2_1 + 24 >> 2]); $12_1 = HEAP32[$4_1 + 364 >> 2]; HEAP32[$4_1 + 364 >> 2] = 0; if (!(!$9_1 | !$10_1)) { $7_1 = $1_1; $1_1 = HEAP32[$4_1 + 32 >> 2]; $8_1 = HEAP32[$4_1 + 36 >> 2]; if ($6_1) { HEAP32[$4_1 + 32 >> 2] = $1_1 & -1610612737; HEAP32[$4_1 + 36 >> 2] = $8_1; } $8_1 = $3 + 48 | 0; $6_1 = $1461($8_1, $9_1, $4_1, $10_1, $7_1); $7_1 = HEAP32[$4_1 + 36 >> 2]; HEAP32[$4_1 + 32 >> 2] = HEAP32[$4_1 + 32 >> 2] | $1_1 & 1610612736; HEAP32[$4_1 + 36 >> 2] = $7_1; $1_1 = 1; block4 : { block2 : { if ($6_1) { break block2 } block3 : { $7_1 = $5_1 & 67108864; $6_1 = 0; if ($7_1 | $6_1) { break block3 } $5_1 = HEAP32[$3 + 300 >> 2]; if (!$5_1 | HEAPU8[$5_1 + 43 | 0] != 2) { break block3 } $1_1 = $3 + 40 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $3 + 32 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $3 + 24 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 12 >> 2] = $8_1; $1017($8_1, HEAP32[$5_1 + 44 >> 2], $3 + 12 | 0); $1_1 = HEAP32[$3 + 88 >> 2] != 0 & HEAP32[$3 + 60 >> 2] != 0; break block2; } $5_1 = HEAP32[$3 + 308 >> 2]; if (!$5_1) { break block4 } if (!($6_1 | $7_1)) { if ($1465($3 + 48 | 0)) { break block2 } $5_1 = HEAP32[$3 + 308 >> 2]; } if (($309($4_1, HEAP32[$5_1 + 24 >> 2]) | 0) != ($92($4_1, $9_1) | 0)) { break block4 } $238($0_1, 1); break block4; } if (!$1_1 | !$11_1 | (HEAP32[$4_1 + 32 >> 2] & 268435457) == 1) { break block4 } $1470($0_1, $11_1, HEAP32[$2_1 + 8 >> 2], HEAP32[$2_1 + 12 >> 2], $3 + 48 | 0); } $1471($3 + 48 | 0); } HEAP32[$4_1 + 364 >> 2] = $12_1; $0_1 = $3 + 336 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1477($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 304 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $5_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $4_1 = $50(HEAP32[$2_1 >> 2]); $7_1 = $53(HEAP32[$2_1 + 4 >> 2]); $1_1 = $50(HEAP32[$2_1 + 8 >> 2]); $2_1 = HEAP32[HEAP32[$5_1 + 16 >> 2] + ($4_1 << 4) >> 2]; $9_1 = HEAP32[$5_1 + 364 >> 2]; HEAP32[$5_1 + 364 >> 2] = 0; $2_1 = $1461($3 + 16 | 0, $2_1, $5_1, $7_1, ($4_1 | 0) == 1); block : { if ($2_1) { break block } block2 : { $2_1 = HEAP32[$3 + 268 >> 2]; block1 : { if (!$2_1) { break block1 } $4_1 = HEAP16[$2_1 + 34 >> 1]; if (($4_1 | 0) == 1) { break block1 } if (($1_1 | 0) < ($4_1 | 0)) { break block2 } } $2_1 = $181(119043); break block; } $8_1 = $3 + 16 | 0; $6_1 = Math_imul($1_1, 12); $4_1 = $1464($8_1, 0, HEAP32[$6_1 + HEAP32[$2_1 + 4 >> 2] >> 2]); block4 : { if ((HEAP16[$2_1 + 34 >> 1] - 1 | 0) > ($1_1 | 0)) { $1_1 = HEAP32[$1464($8_1, 0, HEAP32[($6_1 + HEAP32[$2_1 + 4 >> 2] | 0) + 12 >> 2]) + 4 >> 2]; $2_1 = HEAP32[$4_1 + 4 >> 2]; break block4; } $1_1 = HEAP32[$2_1 + 44 >> 2] + $7_1 | 0; $2_1 = HEAP32[$4_1 + 4 >> 2]; while (1) { $6_1 = HEAPU8[$2_1 | 0]; if (!$6_1 | ($6_1 | 0) == 44) { break block4 } $2_1 = $2_1 - 1 | 0; HEAP32[$4_1 + 4 >> 2] = $2_1; continue; }; } HEAP32[$3 + 8 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $7_1; HEAP32[$3 >> 2] = $2_1 - $7_1; $1_1 = $310($5_1, 6096, $3); $246($0_1, $1_1, -1, -1); $24($1_1); $2_1 = 0; } $1471($3 + 16 | 0); HEAP32[$5_1 + 364 >> 2] = $9_1; if ($2_1) { $255($0_1, $2_1) } $0_1 = $3 + 304 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1478($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $1_1 = global$0 - 352 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $5_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $3 = $53(HEAP32[$2_1 >> 2]); $6_1 = $53(HEAP32[$2_1 + 4 >> 2]); $8_1 = HEAP32[$5_1 + 364 >> 2]; HEAP32[$5_1 + 364 >> 2] = 0; $4($5_1); if (!(!$3 | !$6_1)) { $7_1 = $1_1 - -64 | 0; $3 = $1461($7_1, $3, $5_1, $6_1, 0); block7 : { if (!$3) { $3 = $1_1 + 48 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$1_1 + 56 >> 2] = 0; HEAP32[$1_1 + 32 >> 2] = 0; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 0; HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 28 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = 96; HEAP32[$1_1 + 16 >> 2] = 100; HEAP32[$1_1 + 36 >> 2] = $1_1 + 40; HEAP32[$1_1 + 12 >> 2] = $7_1; $3 = HEAP32[$1_1 + 316 >> 2]; block4 : { block5 : { if ($3) { if (HEAPU8[$3 + 43 | 0] == 2) { $4_1 = HEAP32[$3 + 44 >> 2]; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] & -2097153; HEAP32[$1_1 + 76 >> 2] = 0; $1017($7_1, $4_1, 0); $3 = HEAPU8[$5_1 + 87 | 0] ? 7 : HEAP32[$1_1 + 76 >> 2]; if ($3) { break block4 } $919($1_1 + 12 | 0, $4_1); break block5; } $921($1_1 + 12 | 0, HEAP32[$3 + 16 >> 2]); $3 = 0; while (1) { $4_1 = HEAP32[$1_1 + 316 >> 2]; if (HEAP16[$4_1 + 34 >> 1] <= ($3 | 0)) { break block5 } $920($1_1 + 12 | 0, $891($4_1, HEAP32[$4_1 + 4 >> 2] + Math_imul($3, 12) | 0)); $3 = $3 + 1 | 0; continue; }; } $3 = HEAP32[$1_1 + 320 >> 2]; if ($3) { $4_1 = $1_1 + 12 | 0; $921($4_1, HEAP32[$3 + 40 >> 2]); $920($4_1, HEAP32[HEAP32[$1_1 + 320 >> 2] + 36 >> 2]); break block5; } $3 = $1465($1_1 - -64 | 0); if ($3) { break block4 } $1468($1_1 + 12 | 0, HEAP32[$1_1 + 324 >> 2]); } $3 = $1469($0_1, $1_1 + 40 | 0, $6_1, 0, 0); } $1472($5_1, HEAP32[$1_1 + 40 >> 2]); if (!$3) { break block7 } } if (!(($3 | 0) != 1 | (HEAP32[$5_1 + 32 >> 2] & 268435457) != 1)) { $250($0_1, HEAP32[$2_1 + 4 >> 2]); break block7; } $255($0_1, $3); } $1471($1_1 - -64 | 0); } HEAP32[$5_1 + 364 >> 2] = $8_1; $0_1 = $1_1 + 352 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1479($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (!(!(HEAPU8[$1_1 + 4 | 0] & 128) | HEAPU8[$1_1 | 0] != 118)) { $1464(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 24 >> 2], $1_1) } return 0; } function $1480($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block : { if (!$0_1) { break block } $2_1 = HEAP32[$0_1 >> 2]; $4_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $5_1 = $0_1 + 17 | 0; while (1) { if (($3 | 0) == ($4_1 | 0)) { break block } $0_1 = ($3 << 4) + $5_1 | 0; $2_1 = (HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0] << 8) & 65532 | $1_1; HEAP8[$0_1 | 0] = $2_1; HEAP8[$0_1 + 1 | 0] = $2_1 >>> 8; $3 = $3 + 1 | 0; continue; }; } } function $1481($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $266($0_1, 8); if ($0_1) { $1_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 >> 2] + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; } } function $1482($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = $266($0_1, 8); block1 : { if (!$1_1) { $1_1 = 0; break block1; } $2_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; } $240($0_1, $2_1, $1_1); } function $1483($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $266($0_1, 24); if ($0_1) { HEAP32[$0_1 + 8 >> 2] = 1; HEAP32[$0_1 + 12 >> 2] = 0; } } function $1484($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = $266($0_1, 24); if ($1_1) { $2_1 = HEAP32[$1_1 >> 2]; $3 = HEAP32[$1_1 + 4 >> 2]; if (HEAP32[$1_1 + 8 >> 2] | HEAP32[$1_1 + 12 >> 2]) { HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; $2_1 = $2_1 + 1 | 0; $3 = $2_1 ? $3 : $3 + 1 | 0; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; } $240($0_1, $2_1, $3); } } function $1485($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; block : { $0_1 = $266($0_1, 24); if (!$0_1) { break block } $1_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = HEAP32[$0_1 + 8 >> 2] + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 + 8 >> 2] = $2_1; HEAP32[$0_1 + 12 >> 2] = $1_1; if (HEAP32[$0_1 >> 2] | HEAP32[$0_1 + 4 >> 2]) { break block } HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; } } function $1486($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 24); if ($1_1) { $240($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; } } function $1487($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $266($0_1, 24); if ($0_1) { $1_1 = HEAP32[$0_1 + 20 >> 2]; $2_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; } } function $1488($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0.0, $5_1 = 0; $1_1 = $266($0_1, 24); if ($1_1) { $5_1 = HEAP32[$1_1 + 12 >> 2]; $2_1 = $1_1; $3 = HEAP32[$2_1 + 8 >> 2]; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $5_1; $1_1 = HEAP32[$2_1 + 16 >> 2]; $2_1 = HEAP32[$2_1 + 20 >> 2]; if ($1_1 >>> 0 < 2 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0) { $4_1 = 0.0 } else { $4_1 = +($3 >>> 0) + +($5_1 | 0) * 4294967296.0; $3 = $2_1 - 1 | 0; $1_1 = $1_1 - 1 | 0; $3 = ($1_1 | 0) != -1 ? $3 + 1 | 0 : $3; $4_1 = $4_1 / (+($1_1 >>> 0) + +($3 >>> 0) * 4294967296.0); } $233($0_1, $4_1); } } function $1489($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $266($0_1, 24); $1_1 = $0_1; $2_1 = HEAP32[$0_1 + 8 >> 2]; $0_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = $2_1 + 1 | 0; $0_1 = $2_1 ? $0_1 : $0_1 + 1 | 0; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$1_1 + 12 >> 2] = $0_1; } function $1491($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { $233($0_1, (+HEAPU32[$1_1 + 8 >> 2] + +HEAP32[$1_1 + 12 >> 2] * 4294967296.0) / (+HEAPU32[$1_1 + 16 >> 2] + +HEAP32[$1_1 + 20 >> 2] * 4294967296.0)) } } function $1493($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $1_1 = $266($0_1, 24); if ($1_1) { block1 : { if (HEAP32[$1_1 >> 2] | HEAP32[$1_1 + 4 >> 2]) { break block1 } $2_1 = $50(HEAP32[$2_1 >> 2]); HEAP32[$1_1 + 8 >> 2] = $2_1; $3 = i64toi32_i32$HIGH_BITS; HEAP32[$1_1 + 12 >> 2] = $3; if (!!$2_1 & ($3 | 0) >= 0 | ($3 | 0) > 0) { break block1 } $235($0_1, 9589, -1); } $0_1 = HEAP32[$1_1 + 4 >> 2]; $2_1 = HEAP32[$1_1 >> 2] + 1 | 0; $0_1 = $2_1 ? $0_1 : $0_1 + 1 | 0; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $0_1; } } function $1494($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block : { $3 = $266($0_1, 24); if (!$3) { break block } $1_1 = HEAP32[$3 + 8 >> 2]; $2_1 = $1_1; $4_1 = HEAP32[$3 + 12 >> 2]; $5_1 = $4_1; if (!$1_1 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0) { break block } $6_1 = HEAP32[$3 >> 2]; $7_1 = HEAP32[$3 + 4 >> 2]; $1_1 = __wasm_i64_sdiv($6_1, $7_1, $1_1, $4_1); block2 : { if (!$1_1) { $2_1 = HEAP32[$3 + 20 >> 2]; $1_1 = HEAP32[$3 + 16 >> 2] + 1 | 0; $2_1 = $1_1 ? $2_1 : $2_1 + 1 | 0; break block2; } $4_1 = HEAP32[$3 + 16 >> 2]; $3 = HEAP32[$3 + 20 >> 2]; $9_1 = $1_1; $8_1 = $1_1 >> 31; $5_1 = __wasm_i64_mul($1_1, $8_1, $2_1, $5_1); $2_1 = $6_1 - $5_1 | 0; $6_1 = $7_1 - (i64toi32_i32$HIGH_BITS + ($5_1 >>> 0 > $6_1 >>> 0) | 0) | 0; $5_1 = $2_1; $1_1 = $1_1 + 1 | 0; $2_1 = $1_1 >> 31; $10_1 = $1_1; $1_1 = __wasm_i64_mul($5_1, $6_1, $1_1, $2_1); $7_1 = i64toi32_i32$HIGH_BITS; if (!(($7_1 | 0) <= ($3 | 0) & $1_1 >>> 0 <= $4_1 >>> 0 | ($3 | 0) > ($7_1 | 0))) { $1_1 = __wasm_i64_sdiv($4_1, $3, $10_1, $2_1); $2_1 = i64toi32_i32$HIGH_BITS; $1_1 = $1_1 + 1 | 0; $2_1 = $1_1 ? $2_1 : $2_1 + 1 | 0; break block2; } $4_1 = __wasm_i64_sdiv($4_1 - $1_1 | 0, $3 - (($1_1 >>> 0 > $4_1 >>> 0) + $7_1 | 0) | 0, $9_1, $8_1); $1_1 = $4_1 + $5_1 | 0; $2_1 = i64toi32_i32$HIGH_BITS + $6_1 | 0; $2_1 = $1_1 >>> 0 < $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $1_1 = $1_1 + 1 | 0; $2_1 = $1_1 ? $2_1 : $2_1 + 1 | 0; } $240($0_1, $1_1, $2_1); } } function $1495($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $266($0_1, 24); $1_1 = $0_1; $2_1 = HEAP32[$0_1 + 16 >> 2]; $0_1 = HEAP32[$0_1 + 20 >> 2]; $2_1 = $2_1 + 1 | 0; $0_1 = $2_1 ? $0_1 : $0_1 + 1 | 0; HEAP32[$1_1 + 16 >> 2] = $2_1; HEAP32[$1_1 + 20 >> 2] = $0_1; } function $1496($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = $266($0_1, 8); if ($1_1) { $200(HEAP32[$1_1 >> 2]); $2_1 = $222(HEAP32[$2_1 >> 2]); HEAP32[$1_1 >> 2] = $2_1; if (!$2_1) { $227($0_1); return; } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] + 1; } } function $1497($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; block : { $1_1 = $266($0_1, 8); if (!$1_1) { break block } $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block } $250($0_1, $2_1); $200(HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = 0; } } function $1498($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $1_1 = HEAP32[$1_1 >> 2]; if (!$1_1) { break block } $250($0_1, $1_1); } } function $1499($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; block : { $0_1 = $266($0_1, 8); if (!$0_1) { break block } $1_1 = HEAP32[$0_1 + 4 >> 2] - 1 | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; if ($1_1) { break block } $200(HEAP32[$0_1 >> 2]); HEAP32[$0_1 >> 2] = 0; } } function $1500($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { $4_1 = $266($0_1, 16); if (!$4_1) { break block } block3 : { block4 : { block2 : { switch ($301(HEAP32[$2_1 + 4 >> 2]) - 1 | 0) { case 0: $6_1 = $50(HEAP32[$2_1 + 4 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; break block4; case 1: break block2; default: break block3; }; } $3 = $39(HEAP32[$2_1 + 4 >> 2]); if (Math_abs($3) < 9223372036854775808.0) { $6_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $1_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $1_1 = 0 } } else { $1_1 = -2147483648 } if (+($6_1 >>> 0) + +($1_1 | 0) * 4294967296.0 != $3) { break block3 } } if (!$6_1 & ($1_1 | 0) <= 0 | ($1_1 | 0) < 0) { break block3 } $5_1 = HEAP32[$4_1 + 4 >> 2]; $7_1 = HEAP32[$4_1 >> 2] + 1 | 0; $5_1 = $7_1 ? $5_1 : $5_1 + 1 | 0; HEAP32[$4_1 >> 2] = $7_1; HEAP32[$4_1 + 4 >> 2] = $5_1; if (($6_1 | 0) != ($7_1 | 0) | ($1_1 | 0) != ($5_1 | 0)) { break block } $1_1 = $222(HEAP32[$2_1 >> 2]); HEAP32[$4_1 + 8 >> 2] = $1_1; if ($1_1) { break block } $227($0_1); return; } $235($0_1, 9533, -1); } } function $1501($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!$2_1) { break block } $250($0_1, $2_1); $200(HEAP32[$1_1 + 8 >> 2]); HEAP32[$1_1 + 8 >> 2] = 0; } } function $1503($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; block : { $1_1 = $266($0_1, 16); if (!$1_1 | HEAP32[$1_1 + 8 >> 2]) { break block } $3 = $1_1; $1_1 = $222(HEAP32[$2_1 >> 2]); HEAP32[$3 + 8 >> 2] = $1_1; if ($1_1) { break block } $227($0_1); } } function $1504($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; block : { $1_1 = $266($0_1, 16); if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!$2_1) { break block } $250($0_1, $2_1); $200(HEAP32[$1_1 + 8 >> 2]); HEAP32[$1_1 + 8 >> 2] = 0; } } function $1505($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!$1506($0_1, $1_1, $2_1, $3)) { $1507($3); $233($0_1, (+HEAPU32[$3 >> 2] + +HEAP32[$3 + 4 >> 2] * 4294967296.0) / 864.0e5); } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1506($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0.0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = Math_fround(0), $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0.0; $7_1 = global$0 - 176 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; wasm2js_memory_fill($3, 0, 48); block3 : { block2 : { if (!$1_1) { if (!$1521($0_1)) { break block2 } $13_1 = $1522($0_1, $3); break block3; } $13_1 = 1; $4_1 = HEAP32[$2_1 >> 2]; block5 : { if ((HEAPU8[(HEAPU16[$4_1 + 16 >> 1] & 63) + 31328 | 0] - 1 & 255) >>> 0 <= 1) { $1523($3, $39($4_1)); break block5; } $6_1 = $53($4_1); if (!$6_1) { break block3 } $8_1 = HEAPU8[$6_1 | 0]; HEAP32[$7_1 + 88 >> 2] = $7_1 + 112; HEAP32[$7_1 + 84 >> 2] = $7_1 + 116; HEAP32[$7_1 + 80 >> 2] = $7_1 + 168; block6 : { $4_1 = $6_1 + (($8_1 | 0) == 45) | 0; if (($1524($4_1, 16673, $7_1 + 80 | 0) | 0) != 3) { break block6 } $5_1 = $4_1 + 10 | 0; while (1) { $4_1 = $5_1; $5_1 = $4_1 + 1 | 0; $12_1 = HEAPU8[$4_1 | 0]; if (($12_1 | 0) == 84 | HEAP8[$12_1 + 31424 | 0] & 1) { continue } break; }; if ($1525($4_1, $3)) { if (HEAPU8[$4_1 | 0]) { break block6 } HEAP8[$3 + 42 | 0] = 0; } HEAP16[$3 + 40 >> 1] = 256; $4_1 = HEAP32[$7_1 + 168 >> 2]; HEAP32[$3 + 8 >> 2] = ($8_1 | 0) == 45 ? 0 - $4_1 | 0 : $4_1; HEAP32[$3 + 12 >> 2] = HEAP32[$7_1 + 116 >> 2]; HEAP32[$3 + 16 >> 2] = HEAP32[$7_1 + 112 >> 2]; $1526($3); if (!HEAP32[$3 + 28 >> 2]) { break block5 } $1507($3); break block5; } if (!$1525($6_1, $3)) { break block5 } block9 : { if (!$67($6_1, 1700)) { if ($1521($0_1)) { break block9 } } if (($303($6_1, $7_1 + 120 | 0, $48($6_1), 1) | 0) > 0) { $1523($3, HEAPF64[$7_1 + 120 >> 3]); break block5; } if ($67($6_1, 17958)) { if ($67($6_1, 15031)) { break block2 } } if (!$1521($0_1)) { break block2 } HEAP8[$3 + 44 | 0] = HEAPU8[$3 + 44 | 0] | 4; } if ($1522($0_1, $3)) { break block3 } } $17_1 = ($1_1 | 0) <= 1 ? 1 : $1_1; $18_1 = $3 + 8 | 0; $19_1 = $7_1 + 128 | 0; $15_1 = 1; while (1) { block50 : { block22 : { block13 : { if (($15_1 | 0) != ($17_1 | 0)) { $4_1 = ($15_1 << 2) + $2_1 | 0; $6_1 = $53(HEAP32[$4_1 >> 2]); $209(HEAP32[$4_1 >> 2]); $13_1 = 1; if (!$6_1) { break block3 } $12_1 = HEAPU8[$6_1 | 0]; $4_1 = HEAPU8[$12_1 + 31040 | 0]; $5_1 = $4_1 - 43 | 0; if ($5_1 >>> 0 > 14 | !(1 << $5_1 & 32741)) { break block13 } $5_1 = 1; $4_1 = $6_1 + 1 | 0; while (1) { block15 : { $10_1 = $5_1 + $6_1 | 0; $8_1 = HEAPU8[$10_1 | 0]; block14 : { if (!$8_1 | ($8_1 | 0) == 58 | HEAP8[$8_1 + 31424 | 0] & 1) { break block14 } if (($8_1 | 0) != 45) { break block15 } block16 : { switch ($5_1 - 5 | 0) { case 1: HEAP32[$7_1 + 64 >> 2] = $7_1 + 116; if (($1524($4_1, 12855, $7_1 - -64 | 0) | 0) == 1) { break block14 } break block15; case 0: break block16; default: break block15; }; } HEAP32[$7_1 + 48 >> 2] = $7_1 + 116; if (($1524($4_1, 12859, $7_1 + 48 | 0) | 0) != 1) { break block15 } } block18 : { if (($303($6_1, $7_1 + 168 | 0, $5_1, 1) | 0) <= 0) { break block18 } block20 : { if (HEAPU8[$10_1 | 0] != 45) { $4_1 = $6_1; break block20; } $8_1 = 1; block21 : { switch ($12_1 - 43 | 0) { case 0: case 2: break block21; default: break block22; }; } block24 : { if (($5_1 | 0) == 5) { HEAP32[$7_1 + 24 >> 2] = $7_1 + 108; HEAP32[$7_1 + 20 >> 2] = $7_1 + 112; HEAP32[$7_1 + 16 >> 2] = $7_1 + 116; if (($1524($4_1, 16697, $7_1 + 16 | 0) | 0) != 3) { break block18 } break block24; } HEAP32[$7_1 + 40 >> 2] = $7_1 + 108; HEAP32[$7_1 + 36 >> 2] = $7_1 + 112; HEAP32[$7_1 + 32 >> 2] = $7_1 + 116; $6_1 = $4_1; if (($1524($4_1, 16685, $7_1 + 32 | 0) | 0) != 3) { break block18 } } $4_1 = HEAP32[$7_1 + 112 >> 2]; if (($4_1 | 0) > 11) { break block18 } $5_1 = HEAP32[$7_1 + 108 >> 2]; if (($5_1 | 0) > 30) { break block18 } $1514($3); HEAP8[$3 + 40 | 0] = 0; $8_1 = HEAP32[$3 + 12 >> 2]; $10_1 = HEAP32[$3 + 8 >> 2]; $11_1 = HEAP32[$7_1 + 116 >> 2]; block26 : { if (($12_1 | 0) == 45) { $5_1 = 0 - $5_1 | 0; HEAP32[$7_1 + 108 >> 2] = $5_1; $10_1 = $10_1 - $11_1 | 0; $4_1 = $8_1 - $4_1 | 0; break block26; } $10_1 = $10_1 + $11_1 | 0; $4_1 = $4_1 + $8_1 | 0; } block28 : { if (($4_1 | 0) > 0) { $8_1 = ($4_1 - 1 >>> 0) / 12 | 0; break block28; } $8_1 = 0 - ((12 - $4_1 >>> 0) / 12 | 0) | 0; } HEAP32[$3 + 8 >> 2] = $8_1 + $10_1; HEAP32[$3 + 12 >> 2] = Math_imul($8_1, -12) + $4_1; $1526($3); $1507($3); $8_1 = 0; HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; $4_1 = HEAP32[$3 + 4 >> 2]; $14 = HEAP32[$3 >> 2]; $10_1 = __wasm_i64_mul($5_1, $5_1 >> 31, 864e5, 0); $5_1 = $14 + $10_1 | 0; $4_1 = i64toi32_i32$HIGH_BITS + $4_1 | 0; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $5_1 >>> 0 < $10_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $4_1 = HEAPU8[$6_1 + 11 | 0]; if (!$4_1) { break block22 } $8_1 = 1; if (!(HEAP8[$4_1 + 31424 | 0] & 1)) { break block22 } HEAP32[$7_1 + 4 >> 2] = $7_1 + 100; HEAP32[$7_1 >> 2] = $7_1 + 104; $5_1 = 2; $4_1 = $6_1 + 12 | 0; if (($1524($4_1, 14947, $7_1) | 0) != 2) { break block22 } } if (HEAPU8[$4_1 + $5_1 | 0] == 58) { $5_1 = HEAPU8[$4_1 | 0]; $11_1 = $7_1 + 120 | 0; wasm2js_memory_fill($11_1, 0, 48); $8_1 = 1; if ($1525(($5_1 - 58 >>> 0 < 4294967286) + $4_1 | 0, $11_1)) { break block22 } $1507($11_1); $4_1 = HEAP32[$7_1 + 120 >> 2]; $5_1 = HEAP32[$7_1 + 124 >> 2]; $1507($3); $8_1 = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; $6_1 = HEAP32[$3 >> 2]; $10_1 = HEAP32[$3 + 4 >> 2]; $5_1 = $5_1 - 1 | 0; $4_1 = $4_1 - 432e5 | 0; $5_1 = $4_1 >>> 0 < 4251767296 ? $5_1 + 1 | 0 : $5_1; $14 = $6_1; $4_1 = __wasm_i64_srem($4_1, $5_1, 864e5, 0); $6_1 = ($12_1 | 0) == 45; $12_1 = $6_1 ? 0 - $4_1 | 0 : $4_1; $5_1 = $14 + $12_1 | 0; $14 = $10_1; $10_1 = i64toi32_i32$HIGH_BITS; $11_1 = $14 + ($6_1 ? 0 - ($10_1 + (($4_1 | 0) != 0) | 0) | 0 : $10_1) | 0; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $5_1 >>> 0 < $12_1 >>> 0 ? $11_1 + 1 | 0 : $11_1; break block22; } $5_1 = $5_1 + $6_1 | 0; while (1) { $4_1 = $5_1; $5_1 = $4_1 + 1 | 0; if (HEAP8[HEAPU8[$4_1 | 0] + 31424 | 0] & 1) { continue } break; }; $8_1 = 1; $6_1 = $48($4_1); if ($6_1 - 11 >>> 0 < 4294967288) { break block22 } $8_1 = HEAPU8[($4_1 + $6_1 | 0) - 1 | 0]; $1507($3); $9_1 = HEAPF64[$7_1 + 168 >> 3]; $5_1 = 0; HEAP8[$3 + 43 | 0] = 0; $20_1 = $9_1 < 0.0 ? -.5 : .5; $8_1 = $6_1 - (($8_1 & 223) == 83) | 0; while (1) { block33 : { if (($5_1 | 0) == 6) { $8_1 = 1 } else { $6_1 = ($5_1 << 4) + 52800 | 0; if (($8_1 | 0) != HEAPU8[$6_1 | 0]) { break block33 } if ($68($6_1 + 1 | 0, $4_1, $8_1)) { break block33 } $16_1 = HEAPF32[$6_1 + 8 >> 2]; if (!(+Math_fround(-$16_1) < $9_1) | !(+$16_1 > $9_1)) { break block33 } block36 : { block39 : { block35 : { switch ($5_1 - 4 | 0) { case 0: $1514($3); $5_1 = HEAP32[$3 + 12 >> 2]; $4_1 = Math_abs($9_1) < 2147483647.0 ? ~~$9_1 : -2147483648; $8_1 = $5_1 + $4_1 | 0; block38 : { if (($8_1 | 0) > 0) { $5_1 = ($8_1 - 1 >>> 0) / 12 | 0; break block38; } $5_1 = 0 - ((12 - $8_1 >>> 0) / 12 | 0) | 0; } HEAP32[$3 + 12 >> 2] = Math_imul($5_1, -12) + $8_1; HEAP32[$3 + 8 >> 2] = HEAP32[$3 + 8 >> 2] + $5_1; break block39; case 1: break block35; default: break block36; }; } $1514($3); $5_1 = HEAP32[$3 + 8 >> 2]; $4_1 = Math_abs($9_1) < 2147483647.0 ? ~~$9_1 : -2147483648; HEAP32[$3 + 8 >> 2] = $5_1 + $4_1; } $1526($3); HEAP8[$3 + 40 | 0] = 0; $9_1 = $9_1 - +($4_1 | 0); } $1507($3); $8_1 = HEAP32[$3 >> 2]; $9_1 = $9_1 * 1.0e3 * +HEAPF32[$6_1 + 12 >> 2] + $20_1; if (Math_abs($9_1) < 9223372036854775808.0) { $5_1 = ~~$9_1 >>> 0; if (Math_abs($9_1) >= 1.0) { $4_1 = ~~($9_1 > 0.0 ? Math_min(Math_floor($9_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($9_1 - +(~~$9_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $4_1 = 0 } } else { $5_1 = 0; $4_1 = -2147483648; } $4_1 = $4_1 + HEAP32[$3 + 4 >> 2] | 0; $10_1 = $5_1; $5_1 = $5_1 + $8_1 | 0; $4_1 = $10_1 >>> 0 > $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $4_1; $8_1 = 0; } HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; break block22; } $5_1 = $5_1 + 1 | 0; continue; }; } $8_1 = 1; break block22; } $5_1 = $5_1 + 1 | 0; continue; }; } $1507($3); $13_1 = 1; if (HEAPU8[$3 + 44 | 0] & 2) { break block3 } $2_1 = HEAP32[$3 + 4 >> 2]; if (($2_1 | 0) == 108096 & HEAPU32[$3 >> 2] > 275971583 | $2_1 >>> 0 > 108096) { break block3 } $13_1 = 0; if (!HEAPU8[$3 + 41 | 0] | ($1_1 | 0) != 1 | HEAP32[$3 + 16 >> 2] < 29) { break block3 } HEAP8[$3 + 41 | 0] = 0; break block3; } block46 : { block48 : { block47 : { block44 : { switch ($4_1 - 97 | 0) { default: switch ($4_1 - 115 | 0) { case 0: break block46; case 2: break block47; case 4: break block48; default: break block3; }; case 0: if ($67($6_1, 10090) | $15_1 >>> 0 > 1) { break block3 } $6_1 = HEAPU8[$3 + 44 | 0]; if (!(HEAPU8[$3 + 40 | 0] | !($6_1 & 1))) { $9_1 = HEAPF64[$3 + 32 >> 3]; if (!($9_1 >= -21086676.0e4) | !($9_1 <= 253402300799.0)) { break block50 } HEAP8[$3 + 42 | 0] = 0; HEAP16[$3 + 40 >> 1] = 1; HEAP32[$3 + 28 >> 2] = 0; $9_1 = $9_1 * 1.0e3 + 21086676.0e7 + .5; if (Math_abs($9_1) < 9223372036854775808.0) { $4_1 = ~~$9_1 >>> 0; if (Math_abs($9_1) >= 1.0) { $5_1 = ~~($9_1 > 0.0 ? Math_min(Math_floor($9_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($9_1 - +(~~$9_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $5_1 = 0 } } else { $4_1 = 0; $5_1 = -2147483648; } HEAP32[$3 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $5_1; } HEAP8[$3 + 44 | 0] = $6_1 & 254; break block50; case 2: if ($67($6_1, 12626)) { break block3 } $1507($3); HEAP8[$3 + 43 | 0] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; break block50; case 5: if ($67($6_1, 9234)) { break block3 } $1507($3); HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; HEAP32[$3 + 28 >> 2] = 0; $4_1 = HEAP32[$3 >> 2]; $8_1 = HEAP32[$3 + 4 >> 2]; $5_1 = HEAP8[$3 + 43 | 0]; __wasm_i64_mul($5_1, $5_1 >> 31, 0, 864e5); $6_1 = i64toi32_i32$HIGH_BITS; $5_1 = $6_1 >> 31; HEAP32[$3 >> 2] = $4_1 - $6_1; HEAP32[$3 + 4 >> 2] = $8_1 - (($4_1 >>> 0 < $6_1 >>> 0) + $5_1 | 0); break block50; case 9: if ($67($6_1, 1416) | $15_1 >>> 0 > 1 | !HEAPU8[$3 + 40 | 0]) { break block3 } $4_1 = HEAPU8[$3 + 44 | 0]; if (!($4_1 & 1)) { break block3 } HEAP8[$3 + 44 | 0] = $4_1 & 254; break block50; case 1: case 3: case 4: case 6: case 7: case 8: case 10: break block3; case 11: break block44; }; } if ($67($6_1, 13977)) { break block3 } if (!$1521($0_1)) { break block3 } $8_1 = 0; $4_1 = HEAPU8[$3 + 44 | 0]; if (!($4_1 & 16)) { $8_1 = $1527($3, $0_1); $4_1 = HEAPU8[$3 + 44 | 0]; } HEAP8[$3 + 44 | 0] = $4_1 & 231 | 16; break block22; } block52 : { if ($67($6_1, 12488)) { break block52 } $4_1 = HEAPU8[$3 + 44 | 0]; if (!($4_1 & 1)) { break block52 } if ($15_1 >>> 0 > 1) { break block3 } $9_1 = HEAPF64[$3 + 32 >> 3] * 1.0e3 + 21086676.0e7; if (!($9_1 >= 0.0) | !($9_1 < 4642690608.0e5)) { break block3 } HEAP8[$3 + 42 | 0] = 0; HEAP16[$3 + 40 >> 1] = 1; HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 44 | 0] = $4_1 & 254; $9_1 = $9_1 + .5; if (Math_abs($9_1) < 9223372036854775808.0) { $4_1 = ~~$9_1 >>> 0; if (Math_abs($9_1) >= 1.0) { $5_1 = ~~($9_1 > 0.0 ? Math_min(Math_floor($9_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($9_1 - +(~~$9_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $5_1 = 0 } } else { $4_1 = 0; $5_1 = -2147483648; } HEAP32[$3 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $5_1; break block50; } if ($67($6_1, 17573)) { break block3 } if (!$1521($0_1)) { break block3 } if (HEAPU8[$3 + 44 | 0] & 8) { break block50 } $1507($3); $6_1 = 0; $11_1 = 0; $4_1 = 0; $8_1 = HEAP32[$3 + 4 >> 2]; $14 = $8_1; $12_1 = HEAP32[$3 >> 2]; $5_1 = $12_1; while (1) { wasm2js_memory_fill($19_1, 0, 40); HEAP8[$7_1 + 160 | 0] = 1; $10_1 = $5_1 - $6_1 | 0; $6_1 = $8_1 - (($5_1 >>> 0 < $6_1 >>> 0) + $11_1 | 0) | 0; $8_1 = $6_1; $5_1 = $10_1; HEAP32[$7_1 + 120 >> 2] = $5_1; HEAP32[$7_1 + 124 >> 2] = $6_1; $11_1 = $7_1 + 120 | 0; if ($1527($11_1, $0_1)) { break block3 } $1507($11_1); $10_1 = HEAP32[$7_1 + 120 >> 2]; $6_1 = $10_1 - $12_1 | 0; $10_1 = HEAP32[$7_1 + 124 >> 2] - (($10_1 >>> 0 < $12_1 >>> 0) + $14 | 0) | 0; $11_1 = $10_1; if ($6_1 | $10_1) { $10_1 = $4_1 >>> 0 < 3; $4_1 = $4_1 + 1 | 0; if ($10_1) { continue } } break; }; wasm2js_memory_fill($18_1, 0, 40); HEAP8[$3 + 44 | 0] = 8; HEAP8[$3 + 40 | 0] = 1; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $8_1; break block50; } if ($68($6_1, 30026, 8)) { break block3 } $4_1 = $6_1 + 8 | 0; if (($303($4_1, $7_1 + 168 | 0, $48($4_1), 1) | 0) <= 0) { break block3 } $9_1 = HEAPF64[$7_1 + 168 >> 3]; if (!($9_1 >= 0.0) | !($9_1 < 7.0)) { break block3 } $4_1 = Math_abs($9_1) < 2147483647.0 ? ~~$9_1 : -2147483648; if (+($4_1 | 0) != $9_1) { break block3 } $1514($3); HEAP8[$3 + 40 | 0] = 0; HEAP32[$3 + 28 >> 2] = 0; $1507($3); HEAP8[$3 + 41 | 0] = 0; HEAP8[$3 + 42 | 0] = 0; HEAP32[$3 + 28 >> 2] = 0; $6_1 = $4_1 >> 31; $5_1 = HEAP32[$3 + 4 >> 2]; $14 = $5_1; $8_1 = HEAP32[$3 >> 2]; $10_1 = $8_1 + 1296e5 | 0; $5_1 = $10_1 >>> 0 < 1296e5 ? $5_1 + 1 | 0 : $5_1; $5_1 = __wasm_i64_srem(__wasm_i64_sdiv($10_1, $5_1, 864e5, 0), i64toi32_i32$HIGH_BITS, 7, 0); $11_1 = i64toi32_i32$HIGH_BITS; $13_1 = $11_1; $10_1 = $4_1; $11_1 = $11_1 - 1 | 0; $4_1 = $5_1; $5_1 = $4_1 - 7 | 0; $11_1 = $5_1 >>> 0 < 4294967289 ? $11_1 + 1 | 0 : $11_1; $12_1 = $4_1; $4_1 = ($6_1 | 0) <= ($13_1 | 0) & $4_1 >>> 0 > $10_1 >>> 0 | ($6_1 | 0) < ($13_1 | 0); $5_1 = $4_1 ? $5_1 : $12_1; $4_1 = __wasm_i64_mul($10_1 - $5_1 | 0, $6_1 - (($5_1 >>> 0 > $10_1 >>> 0) + ($4_1 ? $11_1 : $13_1) | 0) | 0, 864e5, 0); $11_1 = $14 + i64toi32_i32$HIGH_BITS | 0; $4_1 = $4_1 + $8_1 | 0; $11_1 = $4_1 >>> 0 < $8_1 >>> 0 ? $11_1 + 1 | 0 : $11_1; HEAP32[$3 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $11_1; break block50; } if ($68($6_1, 30190, 9)) { if ($67($6_1, 17958)) { if ($67($6_1, 15031)) { break block3 } } HEAP8[$3 + 44 | 0] = HEAPU8[$3 + 44 | 0] | 4; break block50; } if (!(HEAPU8[$3 + 40 | 0] | HEAPU8[$3 + 41 | 0] | HEAPU8[$3 + 42 | 0])) { break block3 } $1510($3); HEAP8[$3 + 42 | 0] = 1; HEAP32[$3 + 32 >> 2] = 0; HEAP32[$3 + 36 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP8[$3 + 40 | 0] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP8[$3 + 44 | 0] = HEAPU8[$3 + 44 | 0] & 254; $4_1 = $6_1 + 9 | 0; if (!$67($4_1, 12292)) { HEAP32[$3 + 16 >> 2] = 1; break block50; } if (!$67($4_1, 9897)) { HEAP32[$3 + 12 >> 2] = 1; HEAP32[$3 + 16 >> 2] = 1; break block50; } $8_1 = ($67($4_1, 1422) | 0) != 0; } if ($8_1) { break block3 } } $15_1 = $15_1 + 1 | 0; continue; }; } $13_1 = 1; } $0_1 = $7_1 + 176 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $13_1; } function $1507($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block : { if (HEAPU8[$0_1 + 40 | 0]) { break block } block4 : { block3 : { block2 : { if (!HEAPU8[$0_1 + 41 | 0]) { $1_1 = 2e3; $3 = 1; $2_1 = 1; break block2; } $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($1_1 - 1e4 >>> 0 < 4294952583) { break block3 } $3 = HEAP32[$0_1 + 16 >> 2]; $2_1 = HEAP32[$0_1 + 12 >> 2]; } $6_1 = HEAPU8[$0_1 + 44 | 0]; if (!($6_1 & 1)) { break block4 } } wasm2js_memory_fill($0_1, 0, 48); HEAP8[$0_1 + 44 | 0] = 2; return; } HEAP8[$0_1 + 40 | 0] = 1; $5_1 = ($2_1 | 0) < 3; $7_1 = $1_1 - $5_1 | 0; $1_1 = $7_1 + 4800 & 65535; $4_1 = (+(((((((Math_imul($5_1 ? $2_1 + 12 | 0 : $2_1, 306001) + 306001 | 0) / 1e4 | 0) + $3 | 0) + ((Math_imul($7_1, 36525) + 172251900 >>> 0) / 100 | 0) | 0) - (($1_1 >>> 0) / 100 | 0) | 0) + (($1_1 >>> 0) / 400 | 0) | 0) + 38 | 0) + -1524.5) * 864.0e5; if (Math_abs($4_1) < 9223372036854775808.0) { $2_1 = ~~$4_1 >>> 0; if (Math_abs($4_1) >= 1.0) { $1_1 = ~~($4_1 > 0.0 ? Math_min(Math_floor($4_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($4_1 - +(~~$4_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $1_1 = 0 } } else { $2_1 = 0; $1_1 = -2147483648; } HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $1_1; if (!HEAPU8[$0_1 + 42 | 0]) { break block } $4_1 = HEAPF64[$0_1 + 32 >> 3] * 1.0e3 + .5; if (Math_abs($4_1) < 9223372036854775808.0) { $3 = ~~$4_1 >>> 0; if (Math_abs($4_1) >= 1.0) { $5_1 = ~~($4_1 > 0.0 ? Math_min(Math_floor($4_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($4_1 - +(~~$4_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $5_1 = 0 } } else { $3 = 0; $5_1 = -2147483648; } $1_1 = $5_1 + $1_1 | 0; $5_1 = $2_1; $2_1 = $2_1 + $3 | 0; $1_1 = $5_1 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $3 = Math_imul(HEAP32[$0_1 + 24 >> 2], 6e4) + Math_imul(HEAP32[$0_1 + 20 >> 2], 36e5) | 0; $2_1 = $3 + $2_1 | 0; $1_1 = ($3 >> 31) + $1_1 | 0; HEAP32[$0_1 >> 2] = $2_1; $1_1 = $2_1 >>> 0 < $3 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1; $3 = HEAP32[$0_1 + 28 >> 2]; if (!$3) { break block } HEAP8[$0_1 + 41 | 0] = 0; HEAP8[$0_1 + 42 | 0] = 0; HEAP32[$0_1 + 28 >> 2] = 0; HEAP8[$0_1 + 44 | 0] = $6_1 & 230 | 8; $3 = Math_imul($3, 6e4); HEAP32[$0_1 >> 2] = $2_1 - $3; HEAP32[$0_1 + 4 >> 2] = $1_1 - (($3 >> 31) + ($2_1 >>> 0 < $3 >>> 0) | 0); } } function $1508($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = global$0 - 48 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if ($1506($0_1, $1_1, $2_1, $3)) { break block } $1507($3); $1_1 = HEAP32[$3 >> 2]; $2_1 = HEAP32[$3 + 4 >> 2]; if (HEAPU8[$3 + 44 | 0] & 4) { $2_1 = $2_1 - 49097 | 0; $1_1 = $1_1 - 1045635584 | 0; $2_1 = $1_1 >>> 0 < 3249331712 ? $2_1 + 1 | 0 : $2_1; $233($0_1, (+($1_1 >>> 0) + +($2_1 | 0) * 4294967296.0) / 1.0e3); break block; } $2_1 = __wasm_i64_sdiv($1_1, $2_1, 1e3, 0); $1_1 = i64toi32_i32$HIGH_BITS - 50 | 0; $2_1 = $2_1 - 413362496 | 0; $1_1 = $2_1 >>> 0 < 3881604800 ? $1_1 + 1 | 0 : $1_1; $240($0_1, $2_1, $1_1); } $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1509($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 + -64 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $1_1; $1_1 = $3 + 16 | 0; block : { if ($1506($0_1, $4_1, $2_1, $1_1)) { break block } $1510($1_1); HEAP8[$3 + 5 | 0] = 45; HEAP8[$3 + 8 | 0] = 45; HEAP8[$3 + 11 | 0] = 0; $1_1 = HEAP32[$3 + 28 >> 2]; $2_1 = ($1_1 | 0) / 10 | 0; HEAP8[$3 + 6 | 0] = (($2_1 | 0) % 10 | 0) + 48; $4_1 = HEAP32[$3 + 32 >> 2]; $5_1 = ($4_1 | 0) / 10 | 0; HEAP8[$3 + 9 | 0] = (($5_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 7 | 0] = ($1_1 - Math_imul($2_1, 10) | 0) + 48; HEAP8[$3 + 10 | 0] = ($4_1 - Math_imul($5_1, 10) | 0) + 48; $2_1 = HEAP32[$3 + 24 >> 2]; $1_1 = $2_1 >> 31; $1_1 = ($1_1 ^ $2_1) - $1_1 | 0; $4_1 = ($1_1 >>> 0) / 10 | 0; HEAP8[$3 + 3 | 0] = ($4_1 >>> 0) % 10 | 48; HEAP8[$3 + 2 | 0] = (($1_1 >>> 0) / 100 >>> 0) % 10 | 48; HEAP8[$3 + 1 | 0] = (($1_1 >>> 0) / 1e3 >>> 0) % 10 | 48; HEAP8[$3 + 4 | 0] = $1_1 - Math_imul($4_1, 10) | 48; if (($2_1 | 0) < 0) { HEAP8[$3 | 0] = 45; $246($0_1, $3, 11, -1); break block; } $246($0_1, $3 | 1, 10, -1); } $0_1 = $3 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1510($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0.0, $4_1 = 0, $5_1 = 0; if (!HEAPU8[$0_1 + 41 | 0]) { block2 : { if (!HEAPU8[$0_1 + 40 | 0]) { HEAP32[$0_1 + 8 >> 2] = 2e3; HEAP32[$0_1 + 12 >> 2] = 1; $1_1 = 1; $2_1 = 16; break block2; } $1_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 >> 2]; if (!(($1_1 | 0) == 108096 & $2_1 >>> 0 < 275971584 | $1_1 >>> 0 < 108096)) { wasm2js_memory_fill($0_1, 0, 48); HEAP8[$0_1 + 44 | 0] = 2; return; } $2_1 = $2_1 + 432e5 | 0; $1_1 = $2_1 >>> 0 < 432e5 ? $1_1 + 1 | 0 : $1_1; $2_1 = __wasm_i64_udiv($2_1, $1_1, 864e5, 0); $3 = (+($2_1 >>> 0) + 32044.75) / 36524.25; if (Math_abs($3) < 2147483647.0) { $1_1 = ~~$3 } else { $1_1 = -2147483648 } $2_1 = (($1_1 + $2_1 | 0) + (($1_1 + 48 | 0) / -4 | 0) | 0) + 1498 | 0; $3 = (+($2_1 | 0) + -122.1) / 365.25; if (Math_abs($3) < 2147483647.0) { $1_1 = ~~$3 } else { $1_1 = -2147483648 } $2_1 = $2_1 - ((Math_imul($1_1 & 32767, 36525) >>> 0) / 100 | 0) | 0; $3 = +($2_1 | 0) / 30.6001; if (Math_abs($3) < 2147483647.0) { $4_1 = ~~$3 } else { $4_1 = -2147483648 } $5_1 = (($4_1 | 0) < 14 ? -1 : -13) + $4_1 | 0; HEAP32[$0_1 + 12 >> 2] = $5_1; $3 = +($4_1 | 0) * 30.6001; if (Math_abs($3) < 2147483647.0) { $4_1 = ~~$3 } else { $4_1 = -2147483648 } HEAP32[$0_1 + 16 >> 2] = $2_1 - $4_1; $1_1 = $1_1 + (($5_1 | 0) > 2 ? -4716 : -4715) | 0; $2_1 = 8; } HEAP32[$2_1 + $0_1 >> 2] = $1_1; HEAP8[$0_1 + 41 | 0] = 1; } } function $1511($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0.0, $6_1 = 0; $3 = global$0 + -64 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $1_1; $1_1 = $3 + 16 | 0; if (!$1506($0_1, $4_1, $2_1, $1_1)) { $1512($1_1); HEAP8[$3 + 2 | 0] = 58; HEAP8[$3 + 5 | 0] = 58; $1_1 = HEAP32[$3 + 36 >> 2]; $2_1 = ($1_1 | 0) / 10 | 0; HEAP8[$3 | 0] = (($2_1 | 0) % 10 | 0) + 48; $4_1 = HEAP32[$3 + 40 >> 2]; $6_1 = ($4_1 | 0) / 10 | 0; HEAP8[$3 + 3 | 0] = (($6_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 1 | 0] = ($1_1 - Math_imul($2_1, 10) | 0) + 48; HEAP8[$3 + 4 | 0] = ($4_1 - Math_imul($6_1, 10) | 0) + 48; $5_1 = HEAPF64[$3 + 48 >> 3]; block2 : { if (HEAPU8[$3 + 60 | 0] & 4) { HEAP8[$3 + 12 | 0] = 0; $5_1 = $5_1 * 1.0e3 + .5; if (Math_abs($5_1) < 2147483647.0) { $2_1 = ~~$5_1 } else { $2_1 = -2147483648 } HEAP8[$3 + 9 | 0] = ((($2_1 | 0) / 100 | 0) % 10 | 0) + 48; $1_1 = ($2_1 | 0) / 10 | 0; HEAP8[$3 + 10 | 0] = (($1_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 11 | 0] = ($2_1 - Math_imul($1_1, 10) | 0) + 48; $1_1 = ($2_1 | 0) / 1e3 | 0; $4_1 = 12; $6_1 = 46; $2_1 = ($2_1 | 0) / 1e4 | 0; break block2; } $4_1 = 8; $6_1 = 0; $1_1 = Math_abs($5_1) < 2147483647.0 ? ~~$5_1 : -2147483648; $2_1 = ($1_1 | 0) / 10 | 0; } HEAP8[$3 + 8 | 0] = $6_1; HEAP8[$3 + 7 | 0] = (($1_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 6 | 0] = (($2_1 | 0) % 10 | 0) + 48; $246($0_1, $3, $4_1, -1); } $0_1 = $3 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1512($0_1) { var $1_1 = 0, $2_1 = 0; if (!HEAPU8[$0_1 + 42 | 0]) { $1507($0_1); HEAP8[$0_1 + 42 | 0] = 1; HEAP8[$0_1 + 44 | 0] = HEAPU8[$0_1 + 44 | 0] & 254; $1_1 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAP32[$0_1 >> 2] + 432e5 | 0; $1_1 = $2_1 >>> 0 < 432e5 ? $1_1 + 1 | 0 : $1_1; $1_1 = __wasm_i64_srem($2_1, $1_1, 864e5, 0); HEAP32[$0_1 + 20 >> 2] = ($1_1 | 0) / 36e5; $2_1 = ($1_1 | 0) / 6e4 | 0; HEAP32[$0_1 + 24 >> 2] = ($2_1 << 16 >> 16) % 60; HEAPF64[$0_1 + 32 >> 3] = +($1_1 - Math_imul($2_1, 6e4) | 0) / 1.0e3; } } function $1513($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0.0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 80 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $1_1; $1_1 = $3 + 32 | 0; block : { if ($1506($0_1, $4_1, $2_1, $1_1)) { break block } $1514($1_1); HEAP8[$3 + 5 | 0] = 45; HEAP8[$3 + 8 | 0] = 45; HEAP8[$3 + 11 | 0] = 32; HEAP8[$3 + 14 | 0] = 58; $1_1 = HEAP32[$3 + 44 >> 2]; $2_1 = ($1_1 | 0) / 10 | 0; HEAP8[$3 + 6 | 0] = (($2_1 | 0) % 10 | 0) + 48; $4_1 = HEAP32[$3 + 48 >> 2]; $5_1 = ($4_1 | 0) / 10 | 0; HEAP8[$3 + 9 | 0] = (($5_1 | 0) % 10 | 0) + 48; $7_1 = HEAP32[$3 + 52 >> 2]; $8_1 = ($7_1 | 0) / 10 | 0; HEAP8[$3 + 12 | 0] = (($8_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 7 | 0] = ($1_1 - Math_imul($2_1, 10) | 0) + 48; HEAP8[$3 + 10 | 0] = ($4_1 - Math_imul($5_1, 10) | 0) + 48; HEAP8[$3 + 13 | 0] = ($7_1 - Math_imul($8_1, 10) | 0) + 48; $5_1 = HEAP32[$3 + 40 >> 2]; $1_1 = $5_1 >> 31; $1_1 = ($1_1 ^ $5_1) - $1_1 | 0; $2_1 = ($1_1 >>> 0) / 10 | 0; HEAP8[$3 + 3 | 0] = ($2_1 >>> 0) % 10 | 48; HEAP8[$3 + 2 | 0] = (($1_1 >>> 0) / 100 >>> 0) % 10 | 48; HEAP8[$3 + 1 | 0] = (($1_1 >>> 0) / 1e3 >>> 0) % 10 | 48; HEAP8[$3 + 4 | 0] = $1_1 - Math_imul($2_1, 10) | 48; $1_1 = HEAP32[$3 + 56 >> 2]; HEAP8[$3 + 17 | 0] = 58; $2_1 = $1_1; $1_1 = ($1_1 | 0) / 10 | 0; HEAP8[$3 + 16 | 0] = ($2_1 - Math_imul($1_1, 10) | 0) + 48; HEAP8[$3 + 15 | 0] = (($1_1 | 0) % 10 | 0) + 48; $6_1 = HEAPF64[$3 + 64 >> 3]; block2 : { if (HEAPU8[$3 + 76 | 0] & 4) { HEAP8[$3 + 24 | 0] = 0; $6_1 = $6_1 * 1.0e3 + .5; if (Math_abs($6_1) < 2147483647.0) { $1_1 = ~~$6_1 } else { $1_1 = -2147483648 } HEAP8[$3 + 21 | 0] = ((($1_1 | 0) / 100 | 0) % 10 | 0) + 48; $2_1 = ($1_1 | 0) / 10 | 0; HEAP8[$3 + 22 | 0] = (($2_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 23 | 0] = ($1_1 - Math_imul($2_1, 10) | 0) + 48; $4_1 = ($1_1 | 0) / 1e3 | 0; $2_1 = ($1_1 | 0) / 1e4 | 0; $7_1 = 46; $1_1 = 24; break block2; } $4_1 = Math_abs($6_1) < 2147483647.0 ? ~~$6_1 : -2147483648; $2_1 = ($4_1 | 0) / 10 | 0; $7_1 = 0; $1_1 = 20; } HEAP8[$3 + 20 | 0] = $7_1; HEAP8[$3 + 19 | 0] = (($4_1 | 0) % 10 | 0) + 48; HEAP8[$3 + 18 | 0] = (($2_1 | 0) % 10 | 0) + 48; if (($5_1 | 0) < 0) { HEAP8[$3 | 0] = 45; $246($0_1, $3, $1_1, -1); break block; } $246($0_1, $3 | 1, $1_1 - 1 | 0, -1); } $0_1 = $3 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1514($0_1) { $1510($0_1); $1512($0_1); } function $1515($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0.0, $9_1 = 0, $10_1 = 0; $3 = global$0 - 432 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (!$1_1) { break block } $10_1 = $53(HEAP32[$2_1 >> 2]); if (!$10_1) { break block } $4_1 = $2_1 + 4 | 0; $2_1 = $3 + 384 | 0; if ($1506($0_1, $1_1 - 1 | 0, $4_1, $2_1)) { break block } $1_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] + 120 >> 2]; HEAP16[$3 + 380 >> 1] = 0; HEAP32[$3 + 376 >> 2] = 0; HEAP32[$3 + 372 >> 2] = $1_1; HEAP32[$3 + 368 >> 2] = 0; HEAP32[$3 + 360 >> 2] = 0; HEAP32[$3 + 364 >> 2] = 0; $1507($2_1); $1514($2_1); $2_1 = 0; $1_1 = 0; while (1) { $4_1 = HEAPU8[$1_1 + $10_1 | 0]; block2 : { if (($4_1 | 0) != 37) { if ($4_1) { break block2 } if ($1_1 >>> 0 > $2_1 >>> 0) { $36($3 + 360 | 0, $2_1 + $10_1 | 0, $1_1 - $2_1 | 0) } $1404($0_1, $3 + 360 | 0); break block; } if ($1_1 >>> 0 > $2_1 >>> 0) { $36($3 + 360 | 0, $2_1 + $10_1 | 0, $1_1 - $2_1 | 0) } $2_1 = $1_1 + 2 | 0; block32 : { block20 : { block10 : { block26 : { block19 : { block18 : { block17 : { block16 : { block25 : { block15 : { block14 : { block24 : { block13 : { block12 : { block11 : { block23 : { block9 : { block22 : { block8 : { block7 : { block6 : { block5 : { block21 : { $1_1 = $1_1 + 1 | 0; $5_1 = HEAPU8[$10_1 + $1_1 | 0]; switch ($5_1 - 70 | 0) { case 5: case 6: case 8: case 9: case 11: case 18: case 20: case 21: case 22: case 23: case 24: case 25: case 26: case 27: case 28: case 29: case 34: case 35: case 40: case 41: case 43: case 44: case 46: case 48: break block10; case 7: break block11; case 10: case 42: break block12; case 12: break block13; case 13: break block14; case 14: break block15; case 15: break block16; case 16: break block17; case 17: break block18; case 19: break block19; case 30: case 31: break block20; case 32: break block21; case 36: break block22; case 39: break block23; case 45: break block24; case 47: case 49: break block25; case 0: break block5; case 1: case 33: break block6; case 2: case 37: break block7; case 3: case 38: break block8; case 4: break block9; default: break block26; }; } $8_1 = HEAPF64[$3 + 416 >> 3]; HEAPF64[$3 + 16 >> 3] = $8_1 > 59.999 ? 59.999 : $8_1; $46($3 + 360 | 0, 12843, $3 + 16 | 0); break block2; } HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 392 >> 2]; $4_1 = HEAP32[$3 + 400 >> 2]; HEAP32[$3 + 36 >> 2] = HEAP32[$3 + 396 >> 2]; HEAP32[$3 + 40 >> 2] = $4_1; $46($3 + 360 | 0, 16654, $3 + 32 | 0); break block2; } wasm2js_memory_copy($3 + 312 | 0, $3 + 384 | 0, 48); HEAP8[$3 + 353 | 0] = 0; $6_1 = HEAP32[$3 + 312 >> 2]; $7_1 = HEAP32[$3 + 316 >> 2]; $4_1 = HEAP32[$3 + 388 >> 2]; $9_1 = HEAP32[$3 + 384 >> 2] + 432e5 | 0; $4_1 = $9_1 >>> 0 < 432e5 ? $4_1 + 1 | 0 : $4_1; $4_1 = Math_imul(3 - ((__wasm_i64_sdiv($9_1, $4_1, 864e5, 0) | 0) % 7 | 0) | 0, 864e5); $9_1 = $4_1; $6_1 = $4_1 + $6_1 | 0; $4_1 = ($4_1 >> 31) + $7_1 | 0; HEAP32[$3 + 312 >> 2] = $6_1; HEAP32[$3 + 316 >> 2] = $6_1 >>> 0 < $9_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $1510($3 + 312 | 0); $4_1 = HEAP32[$3 + 320 >> 2]; if (($5_1 | 0) == 103) { HEAP32[$3 + 48 >> 2] = ($4_1 | 0) % 100; $46($3 + 360 | 0, 16664, $3 + 48 | 0); break block2; } HEAP32[$3 + 64 >> 2] = $4_1; $46($3 + 360 | 0, 16629, $3 - -64 | 0); break block2; } HEAP32[$3 + 80 >> 2] = HEAP32[$3 + 404 >> 2]; $46($3 + 360 | 0, ($5_1 | 0) == 72 ? 16664 : 16669, $3 + 80 | 0); break block2; } $4_1 = HEAP32[$3 + 404 >> 2]; $4_1 = ($4_1 | 0) > 12 ? $4_1 - 12 | 0 : $4_1; HEAP32[$3 + 96 >> 2] = $4_1 ? $4_1 : 12; $46($3 + 360 | 0, ($5_1 | 0) == 73 ? 16664 : 16669, $3 + 96 | 0); break block2; } HEAP32[$3 + 112 >> 2] = $1516($3 + 384 | 0) + 1; $46($3 + 360 | 0, 16634, $3 + 112 | 0); break block2; } HEAPF64[$3 + 128 >> 3] = (+HEAPU32[$3 + 384 >> 2] + +HEAP32[$3 + 388 >> 2] * 4294967296.0) / 864.0e5; $46($3 + 360 | 0, 12688, $3 + 128 | 0); break block2; } HEAP32[$3 + 144 >> 2] = HEAP32[$3 + 396 >> 2]; $46($3 + 360 | 0, 16664, $3 + 144 | 0); break block2; } HEAP32[$3 + 160 >> 2] = HEAP32[$3 + 408 >> 2]; $46($3 + 360 | 0, 16664, $3 + 160 | 0); break block2; } if (HEAP32[$3 + 404 >> 2] >= 12) { $36($3 + 360 | 0, ($5_1 | 0) == 112 ? 20172 : 11537, 2); break block2; } $36($3 + 360 | 0, ($5_1 | 0) == 112 ? 20181 : 11675, 2); break block2; } $4_1 = HEAP32[$3 + 408 >> 2]; HEAP32[$3 + 176 >> 2] = HEAP32[$3 + 404 >> 2]; HEAP32[$3 + 180 >> 2] = $4_1; $46($3 + 360 | 0, 16644, $3 + 176 | 0); break block2; } $4_1 = HEAP32[$3 + 384 >> 2]; $5_1 = HEAP32[$3 + 388 >> 2]; if (HEAPU8[$3 + 428 | 0] & 4) { $5_1 = $5_1 - 49097 | 0; $4_1 = $4_1 - 1045635584 | 0; $5_1 = $4_1 >>> 0 < 3249331712 ? $5_1 + 1 | 0 : $5_1; HEAPF64[$3 + 208 >> 3] = (+($4_1 >>> 0) + +($5_1 | 0) * 4294967296.0) / 1.0e3; $46($3 + 360 | 0, 12850, $3 + 208 | 0); break block2; } $5_1 = __wasm_i64_sdiv($4_1, $5_1, 1e3, 0); $4_1 = i64toi32_i32$HIGH_BITS - 50 | 0; $5_1 = $5_1 - 413362496 | 0; $4_1 = $5_1 >>> 0 < 3881604800 ? $4_1 + 1 | 0 : $4_1; HEAP32[$3 + 192 >> 2] = $5_1; HEAP32[$3 + 196 >> 2] = $4_1; $46($3 + 360 | 0, 15092, $3 + 192 | 0); break block2; } $8_1 = HEAPF64[$3 + 416 >> 3]; if (Math_abs($8_1) < 2147483647.0) { $4_1 = ~~$8_1 } else { $4_1 = -2147483648 } HEAP32[$3 + 224 >> 2] = $4_1; $46($3 + 360 | 0, 16664, $3 + 224 | 0); break block2; } $4_1 = HEAP32[$3 + 408 >> 2]; HEAP32[$3 + 240 >> 2] = HEAP32[$3 + 404 >> 2]; HEAP32[$3 + 244 >> 2] = $4_1; $8_1 = HEAPF64[$3 + 416 >> 3]; if (Math_abs($8_1) < 2147483647.0) { $4_1 = ~~$8_1 } else { $4_1 = -2147483648 } HEAP32[$3 + 248 >> 2] = $4_1; $46($3 + 360 | 0, 16639, $3 + 240 | 0); break block2; } $6_1 = $3 + 360 | 0; $4_1 = HEAP32[$3 + 388 >> 2]; $7_1 = HEAP32[$3 + 384 >> 2] + 1296e5 | 0; $4_1 = $7_1 >>> 0 < 1296e5 ? $4_1 + 1 | 0 : $4_1; $9_1 = $6_1; $4_1 = (__wasm_i64_sdiv($7_1, $4_1, 864e5, 0) | 0) % 7 | 0; $6_1 = $4_1 + 48 | 0; $41($9_1, 1, (($5_1 | 0) == 117 ? ($4_1 ? $6_1 : 55) : $6_1) << 24 >> 24); break block2; } $5_1 = $1516($3 + 384 | 0); $4_1 = HEAP32[$3 + 388 >> 2]; $6_1 = HEAP32[$3 + 384 >> 2] + 1296e5 | 0; $4_1 = $6_1 >>> 0 < 1296e5 ? $4_1 + 1 | 0 : $4_1; HEAP32[$3 + 256 >> 2] = (($5_1 - ((__wasm_i64_sdiv($6_1, $4_1, 864e5, 0) | 0) % 7 | 0) | 0) + 7 | 0) / 7; $46($3 + 360 | 0, 16664, $3 + 256 | 0); break block2; } wasm2js_memory_copy($3 + 312 | 0, $3 + 384 | 0, 48); HEAP8[$3 + 353 | 0] = 0; $5_1 = HEAP32[$3 + 312 >> 2]; $6_1 = HEAP32[$3 + 316 >> 2]; $4_1 = HEAP32[$3 + 388 >> 2]; $7_1 = HEAP32[$3 + 384 >> 2] + 432e5 | 0; $4_1 = $7_1 >>> 0 < 432e5 ? $4_1 + 1 | 0 : $4_1; $4_1 = Math_imul(3 - ((__wasm_i64_sdiv($7_1, $4_1, 864e5, 0) | 0) % 7 | 0) | 0, 864e5); $7_1 = $4_1; $5_1 = $4_1 + $5_1 | 0; $4_1 = ($4_1 >> 31) + $6_1 | 0; HEAP32[$3 + 312 >> 2] = $5_1; HEAP32[$3 + 316 >> 2] = $5_1 >>> 0 < $7_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $4_1 = $3 + 312 | 0; $1510($4_1); HEAP32[$3 + 272 >> 2] = (($1516($4_1) | 0) / 7 | 0) + 1; $46($3 + 360 | 0, 16664, $3 + 272 | 0); break block2; } $5_1 = $1516($3 + 384 | 0); $4_1 = HEAP32[$3 + 388 >> 2]; $6_1 = HEAP32[$3 + 384 >> 2] + 432e5 | 0; $4_1 = $6_1 >>> 0 < 432e5 ? $4_1 + 1 | 0 : $4_1; HEAP32[$3 + 288 >> 2] = (($5_1 - ((__wasm_i64_sdiv($6_1, $4_1, 864e5, 0) | 0) % 7 | 0) | 0) + 7 | 0) / 7; $46($3 + 360 | 0, 16664, $3 + 288 | 0); break block2; } HEAP32[$3 + 304 >> 2] = HEAP32[$3 + 392 >> 2]; $46($3 + 360 | 0, 16629, $3 + 304 | 0); break block2; } if (($5_1 | 0) == 37) { break block32 } } $54($3 + 360 | 0); break block; } HEAP32[$3 >> 2] = HEAP32[$3 + 400 >> 2]; $46($3 + 360 | 0, ($5_1 | 0) == 100 ? 16664 : 16669, $3); break block2; } $41($3 + 360 | 0, 1, 37); } $1_1 = $1_1 + 1 | 0; continue; }; } $0_1 = $3 + 432 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1516($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = global$0 - 48 | 0; $2_1 = $1_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $2_1; wasm2js_memory_copy($1_1, $0_1, 48); HEAP32[$1_1 + 12 >> 2] = 1; HEAP32[$1_1 + 16 >> 2] = 1; HEAP8[$1_1 + 40 | 0] = 0; $1507($1_1); $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$0_1 + 4 >> 2]; $0_1 = HEAP32[$1_1 >> 2]; $4_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = $1_1 + 48 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = $2_1 - $0_1 | 0; $0_1 = $3 - ($4_1 + ($0_1 >>> 0 > $2_1 >>> 0) | 0) | 0; $2_1 = $1_1 + 432e5 | 0; $0_1 = $2_1 >>> 0 < 432e5 ? $0_1 + 1 | 0 : $0_1; return __wasm_i64_sdiv($2_1, $0_1, 864e5, 0); } function $1517($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 160 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $1_1 = $3 + 112 | 0; block : { if ($1506($0_1, 1, $2_1, $1_1)) { break block } $4_1 = $3 - -64 | 0; if ($1506($0_1, 1, $2_1 + 4 | 0, $4_1)) { break block } $1514($1_1); $1514($4_1); $5_1 = HEAP32[$3 + 112 >> 2]; $8_1 = HEAP32[$3 + 116 >> 2]; $1_1 = $8_1; $2_1 = HEAP32[$3 + 68 >> 2]; block6 : { if (!($5_1 >>> 0 < HEAPU32[$3 + 64 >> 2] & ($1_1 | 0) <= ($2_1 | 0) | ($1_1 | 0) < ($2_1 | 0))) { $1_1 = HEAP32[$3 + 120 >> 2]; $2_1 = HEAP32[$3 + 72 >> 2]; if (($1_1 | 0) != ($2_1 | 0)) { HEAP8[$3 + 104 | 0] = 0; HEAP32[$3 + 72 >> 2] = $1_1; $1507($4_1); } $4_1 = $1_1 - $2_1 | 0; $6_1 = HEAP32[$3 + 124 >> 2]; $1_1 = $6_1 - HEAP32[$3 + 76 >> 2] | 0; $7_1 = $1_1 >> 31; $2_1 = ($1_1 | 0) < 0 ? $1_1 + 12 | 0 : $1_1; if ($2_1) { HEAP8[$3 + 104 | 0] = 0; HEAP32[$3 + 76 >> 2] = $6_1; $1507($3 - -64 | 0); } $6_1 = $4_1 + $7_1 | 0; while (1) { $7_1 = HEAP32[$3 + 68 >> 2]; $1_1 = $7_1; $4_1 = HEAP32[$3 + 64 >> 2]; if (!(($1_1 | 0) <= ($8_1 | 0) & $4_1 >>> 0 <= $5_1 >>> 0 | ($1_1 | 0) < ($8_1 | 0))) { $1_1 = HEAP32[$3 + 76 >> 2]; HEAP32[$3 + 76 >> 2] = $1_1 - 1; if (($1_1 | 0) <= 1) { HEAP32[$3 + 76 >> 2] = 12; HEAP32[$3 + 72 >> 2] = HEAP32[$3 + 72 >> 2] - 1; } $1_1 = ($2_1 | 0) <= 0; $2_1 = $1_1 ? 11 : $2_1 - 1 | 0; $6_1 = $6_1 - $1_1 | 0; HEAP8[$3 + 104 | 0] = 0; $1507($3 - -64 | 0); continue; } break; }; $1_1 = $5_1 - $4_1 | 0; $5_1 = $8_1 - (($5_1 >>> 0 < $4_1 >>> 0) + $7_1 | 0) | 0; $4_1 = 43; break block6; } $2_1 = HEAP32[$3 + 72 >> 2]; $1_1 = HEAP32[$3 + 120 >> 2]; if (($2_1 | 0) != ($1_1 | 0)) { HEAP8[$3 + 104 | 0] = 0; HEAP32[$3 + 72 >> 2] = $1_1; $1507($3 - -64 | 0); } $4_1 = $2_1 - $1_1 | 0; $6_1 = HEAP32[$3 + 124 >> 2]; $1_1 = HEAP32[$3 + 76 >> 2] - $6_1 | 0; $7_1 = $1_1 >> 31; $2_1 = ($1_1 | 0) < 0 ? $1_1 + 12 | 0 : $1_1; if ($2_1) { HEAP8[$3 + 104 | 0] = 0; HEAP32[$3 + 76 >> 2] = $6_1; $1507($3 - -64 | 0); } $6_1 = $4_1 + $7_1 | 0; while (1) { $7_1 = HEAP32[$3 + 68 >> 2]; $1_1 = $7_1; $4_1 = HEAP32[$3 + 64 >> 2]; if (!(($8_1 | 0) <= ($1_1 | 0) & $5_1 >>> 0 <= $4_1 >>> 0 | ($1_1 | 0) > ($8_1 | 0))) { $1_1 = HEAP32[$3 + 76 >> 2]; HEAP32[$3 + 76 >> 2] = $1_1 + 1; if (($1_1 | 0) >= 12) { HEAP32[$3 + 76 >> 2] = 1; HEAP32[$3 + 72 >> 2] = HEAP32[$3 + 72 >> 2] + 1; } $1_1 = ($2_1 | 0) <= 0; $2_1 = $1_1 ? 11 : $2_1 - 1 | 0; $6_1 = $6_1 - $1_1 | 0; HEAP8[$3 + 104 | 0] = 0; $1507($3 - -64 | 0); continue; } break; }; $1_1 = $4_1 - $5_1 | 0; $5_1 = $7_1 - (($5_1 >>> 0 > $4_1 >>> 0) + $8_1 | 0) | 0; $4_1 = 45; } HEAP8[$3 + 153 | 0] = 0; HEAP8[$3 + 154 | 0] = 0; HEAP32[$3 + 140 >> 2] = 0; $5_1 = $5_1 + 34621 | 0; $1_1 = $1_1 - 816922112 | 0; $5_1 = $1_1 >>> 0 < 3478045184 ? $5_1 + 1 | 0 : $5_1; HEAP32[$3 + 112 >> 2] = $1_1; HEAP32[$3 + 116 >> 2] = $5_1; $1514($3 + 112 | 0); $5_1 = HEAP32[$3 + 136 >> 2]; $1_1 = $3 + 16 | 0; HEAP32[$1_1 >> 2] = HEAP32[$3 + 132 >> 2]; HEAP32[$1_1 + 4 >> 2] = $5_1; HEAPF64[$3 + 24 >> 3] = HEAPF64[$3 + 144 >> 3]; HEAP16[$3 + 60 >> 1] = 0; HEAP32[$3 + 56 >> 2] = 0; HEAP32[$3 + 48 >> 2] = 0; HEAP32[$3 + 52 >> 2] = 100; HEAP32[$3 + 40 >> 2] = 0; HEAP32[$3 + 44 >> 2] = 0; HEAP32[$3 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $6_1; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = HEAP32[$3 + 128 >> 2] - 1; $1_1 = $3 + 40 | 0; $46($1_1, 12816, $3); $1404($0_1, $1_1); } $0_1 = $3 + 160 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1518($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1511($0_1, 0, 0); } function $1519($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1513($0_1, 0, 0); } function $1520($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1509($0_1, 0, 0); } function $1521($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = 1; $3 = HEAP32[HEAP32[$0_1 + 12 >> 2] + 104 >> 2] + Math_imul(HEAP32[$0_1 + 16 >> 2], 20) | 0; if (HEAPU8[$3 | 0] == 65) { $2_1 = HEAPU16[$3 + 2 >> 1]; HEAP32[$1_1 >> 2] = HEAP32[HEAP32[$0_1 + 4 >> 2] + 32 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1 & 4 ? 2732 : $2_1 & 8 ? 11195 : 1578; $2_1 = $0_1; $0_1 = $61(6726, $1_1); $235($2_1, $0_1, -1); $24($0_1); $2_1 = 0; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1522($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block2 : { block1 : { $4_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = $4_1; $3 = HEAP32[$2_1 + 56 >> 2]; $2_1 = HEAP32[$2_1 + 60 >> 2]; if (!($3 | $2_1)) { $2_1 = HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2] >> 2]; $0_1 = $4_1 + 56 | 0; if ($105($2_1, $0_1)) { break block1 } $3 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2]; } HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $2_1; if (!$3 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0) { break block2 } HEAP16[$1_1 + 40 >> 1] = 1; HEAP8[$1_1 + 42 | 0] = 0; HEAP32[$1_1 + 28 >> 2] = 0; HEAP8[$1_1 + 44 | 0] = HEAPU8[$1_1 + 44 | 0] & 231 | 8; return 0; } HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; } return 1; } function $1523($0_1, $1_1) { var $2_1 = 0, $3 = 0; HEAPF64[$0_1 + 32 >> 3] = $1_1; HEAP8[$0_1 + 44 | 0] = HEAPU8[$0_1 + 44 | 0] | 1; if (!(!($1_1 >= 0.0) | !($1_1 < 5373484.5))) { HEAP8[$0_1 + 40 | 0] = 1; $1_1 = $1_1 * 864.0e5 + .5; if (Math_abs($1_1) < 9223372036854775808.0) { $3 = ~~$1_1 >>> 0; if (Math_abs($1_1) >= 1.0) { $2_1 = ~~($1_1 > 0.0 ? Math_min(Math_floor($1_1 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($1_1 - +(~~$1_1 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $2_1 = 0 } } else { $2_1 = -2147483648 } HEAP32[$0_1 >> 2] = $3; HEAP32[$0_1 + 4 >> 2] = $2_1; } } function $1524($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 16 | 0; HEAP32[$4_1 + 12 >> 2] = $2_1; while (1) { $9_1 = HEAPU8[$1_1 + 1 | 0] - 48 | 0; $2_1 = HEAPU8[$1_1 | 0] - 48 | 0; $6_1 = ($2_1 & 255) + $0_1 | 0; $10_1 = HEAPU16[(HEAP8[$1_1 + 2 | 0] << 1) + 52586 >> 1]; $5_1 = HEAPU8[$1_1 + 3 | 0]; $3 = 0; block1 : { while (1) { if ($2_1 & 255) { $7_1 = HEAPU8[$0_1 | 0]; if ($7_1 - 58 >>> 0 < 4294967286) { break block1 } $2_1 = $2_1 - 1 | 0; $0_1 = $0_1 + 1 | 0; $3 = (($7_1 << 24 >> 24) + Math_imul($3, 10) | 0) - 48 | 0; continue; } break; }; if (!!$5_1 & ($5_1 | 0) != HEAPU8[$6_1 | 0] | ($9_1 << 24 >> 24 > ($3 | 0) | ($3 | 0) > ($10_1 | 0))) { break block1 } $0_1 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$4_1 + 12 >> 2] = $0_1 + 4; HEAP32[HEAP32[$0_1 >> 2] >> 2] = $3; $1_1 = $1_1 + 4 | 0; $8_1 = $8_1 + 1 | 0; $0_1 = $6_1 + 1 | 0; if ($5_1) { continue } } break; }; return $8_1; } function $1525($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0.0, $6_1 = 0.0, $7_1 = 0, $8_1 = 0; $2_1 = global$0 + -64 | 0; $4_1 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $4_1; HEAP32[$2_1 + 32 >> 2] = $2_1 + 52; HEAP32[$2_1 + 36 >> 2] = $2_1 + 48; $3 = 1; block : { if (($1524($0_1, 14947, $2_1 + 32 | 0) | 0) != 2) { break block } block2 : { if (HEAPU8[$0_1 + 5 | 0] == 58) { HEAP32[$2_1 + 16 >> 2] = $2_1 + 44; $3 = 1; if (($1524($0_1 + 6 | 0, 14967, $2_1 + 16 | 0) | 0) != 1) { break block } $4_1 = $0_1 + 8 | 0; $5_1 = 0.0; if (HEAPU8[$0_1 + 8 | 0] != 46) { break block2 } $3 = HEAPU8[$0_1 + 9 | 0]; $5_1 = 0.0; if ($3 - 58 >>> 0 < 4294967286) { break block2 } $4_1 = $0_1 + 9 | 0; $5_1 = 1.0; while (1) { if (!($3 - 58 >>> 0 < 4294967286)) { $5_1 = $5_1 * 10.0; $6_1 = $6_1 * 10.0 + +($3 << 24 >> 24) + -48.0; $3 = HEAPU8[$4_1 + 1 | 0]; $4_1 = $4_1 + 1 | 0; continue; } break; }; $6_1 = $6_1 / $5_1; $5_1 = $6_1 > .999 ? .999 : $6_1; break block2; } $4_1 = $0_1 + 5 | 0; HEAP32[$2_1 + 44 >> 2] = 0; $5_1 = 0.0; } $6_1 = $5_1; HEAP8[$1_1 + 40 | 0] = 0; HEAP8[$1_1 + 42 | 0] = 1; $7_1 = HEAPU8[$1_1 + 44 | 0]; HEAP8[$1_1 + 44 | 0] = $7_1 & 254; HEAP32[$1_1 + 20 >> 2] = HEAP32[$2_1 + 52 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$2_1 + 48 >> 2]; HEAPF64[$1_1 + 32 >> 3] = $6_1 + +HEAP32[$2_1 + 44 >> 2]; while (1) { $0_1 = $4_1; $4_1 = $0_1 + 1 | 0; if (HEAP8[HEAPU8[$0_1 | 0] + 31424 | 0] & 1) { continue } break; }; HEAP32[$1_1 + 28 >> 2] = 0; $8_1 = -1; block8 : { block6 : { block4 : { block5 : { $3 = HEAPU8[$0_1 | 0]; switch ($3 - 43 | 0) { case 0: break block4; case 2: break block6; default: break block5; }; } if (($3 & 223) == 90) { HEAP8[$1_1 + 44 | 0] = $7_1 & 230 | 8; break block8; } $3 = ($3 | 0) != 0; break block; } $8_1 = 1; } HEAP32[$2_1 + 4 >> 2] = $2_1 + 56; HEAP32[$2_1 >> 2] = $2_1 + 60; $3 = 1; if (($1524($4_1, 14955, $2_1) | 0) != 2) { break block } HEAP32[$1_1 + 28 >> 2] = Math_imul(HEAP32[$2_1 + 56 >> 2] + Math_imul(HEAP32[$2_1 + 60 >> 2], 60) | 0, $8_1); $4_1 = $0_1 + 6 | 0; } while (1) { $0_1 = HEAPU8[$4_1 | 0]; $4_1 = $4_1 + 1 | 0; if (HEAP8[$0_1 + 31424 | 0] & 1) { continue } break; }; $3 = ($0_1 | 0) != 0; } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1526($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 16 >> 2]; block : { if (($2_1 | 0) < 29) { break block } $3 = HEAP32[$0_1 + 12 >> 2]; if (1 << $3 & 5546) { break block } if (($3 | 0) != 2) { $1_1 = ($2_1 | 0) == 31; break block; } block3 : { $1_1 = HEAP32[$0_1 + 8 >> 2]; if (!($1_1 & 3)) { if (!(($1_1 | 0) % 400 | 0) | ($1_1 | 0) % 100) { break block3 } } $1_1 = $2_1 - 28 | 0; break block; } $1_1 = $2_1 - 29 | 0; } HEAP8[$0_1 + 43 | 0] = $1_1; } function $1527($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $2_1 = global$0 - 96 | 0; if ($2_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; wasm2js_memory_fill($2_1 + 52 | 0, 0, 44); $1507($0_1); $3 = HEAP32[$0_1 + 4 >> 2]; $4_1 = $3 - 49597 | 0; $7_1 = $4_1 + 1 | 0; $6_1 = $4_1; $4_1 = HEAP32[$0_1 >> 2]; $5_1 = $4_1 - 947587585 | 0; $6_1 = $5_1 >>> 0 < 3347379711 ? $7_1 : $6_1; block3 : { if (!(($6_1 | 0) == -500 & $5_1 >>> 0 > 98047998 | $6_1 >>> 0 > 4294966796)) { wasm2js_memory_copy($2_1, $0_1, 48); $1514($2_1); HEAP8[$2_1 + 40 | 0] = 0; $3 = HEAP32[$2_1 + 8 >> 2]; $4_1 = (($3 | 0) % 4 | 0) + 2e3 | 0; HEAP32[$2_1 + 8 >> 2] = $4_1; $4_1 = ($3 - $4_1 | 0) + 1900 | 0; $1507($2_1); $3 = __wasm_i64_sdiv(HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], 1e3, 0); $6_1 = i64toi32_i32$HIGH_BITS; break block3; } $3 = __wasm_i64_udiv($4_1, $3, 1e3, 0); $4_1 = 1900; $6_1 = i64toi32_i32$HIGH_BITS; } $5_1 = $6_1 - 50 | 0; $3 = $3 - 413362496 | 0; $5_1 = $3 >>> 0 < 3881604800 ? $5_1 + 1 | 0 : $5_1; HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $5_1; if (!(HEAP8[82860] & 1)) { fimport$18(82816, 82820, 82864, 82896); HEAP32[20707] = 82896; HEAP32[20706] = 82864; HEAP8[82860] = 1; } fimport$33(HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2], 82772); HEAP32[20703] = HEAP32[(HEAP32[20701] ? 82828 : 82824) >> 2]; $3 = 82772; block7 : { block6 : { block5 : { if (HEAP32[18951]) { $5_1 = HEAP32[18952]; if (!$5_1) { break block5 } $3 = $2_1 + 52 | 0; if (FUNCTION_TABLE[$5_1 | 0]($2_1, $3) | 0) { break block5 } break block6; } break block6; } $235($1_1, 14446, -1); $1_1 = 1; break block7; } wasm2js_memory_copy($2_1 + 52 | 0, $3, 44); HEAP32[$0_1 + 8 >> 2] = HEAP32[$2_1 + 72 >> 2] + $4_1; HEAP32[$0_1 + 12 >> 2] = HEAP32[$2_1 + 68 >> 2] + 1; HEAP32[$0_1 + 16 >> 2] = HEAP32[$2_1 + 64 >> 2]; HEAP32[$0_1 + 20 >> 2] = HEAP32[$2_1 + 60 >> 2]; HEAP32[$0_1 + 24 >> 2] = HEAP32[$2_1 + 56 >> 2]; $1_1 = HEAP32[$2_1 + 52 >> 2]; HEAP8[$0_1 + 41 | 0] = 1; HEAP8[$0_1 + 42 | 0] = 1; HEAP8[$0_1 + 40 | 0] = 0; HEAP8[$0_1 + 44 | 0] = HEAPU8[$0_1 + 44 | 0] & 252; HEAP32[$0_1 + 28 >> 2] = 0; HEAPF64[$0_1 + 32 >> 3] = (+(__wasm_i64_srem(HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2], 1e3, 0) >>> 0) + +(i64toi32_i32$HIGH_BITS | 0) * 4294967296.0) * .001 + +($1_1 | 0); $1_1 = 0; } $0_1 = $2_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1528($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block : { if (($1_1 | 0) <= 0) { break block } $3 = $1529($0_1, HEAP32[$2_1 >> 2], ($1_1 | 0) != 1); if (!$3) { break block } $5_1 = 1; block2 : { block3 : { block1 : { while (1) { if (($1_1 | 0) == ($5_1 | 0)) { break block1 } $4_1 = $53(HEAP32[($5_1 << 2) + $2_1 >> 2]); if (!$4_1) { break block2 } if (HEAPU8[$4_1 | 0] != 36) { break block3 } if (!HEAPU8[$4_1 + 1 | 0]) { break block2 } HEAP32[$3 + 40 >> 2] = 0; HEAP8[$3 + 39 | 0] = 1; $5_1 = $5_1 + 1 | 0; $6_1 = $1530($3, 0, $4_1 + 1 | 0, 0); if ($6_1 >>> 0 < 4294967293 | ($6_1 | 0) == -2) { continue } break; }; if (($6_1 | 0) == -3) { break block3 } $235($0_1, 20048, -1); break block2; } $1531($0_1, $3); break block2; } $1532($0_1, $4_1); } $1533($3); } } function $1529($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $12_1 = global$0 - 16 | 0; $3 = $12_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = 0; $6_1 = HEAPU16[$1_1 + 16 >> 1]; $5_1 = $6_1 & 31; if (($6_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $5_1; $6_1 = 0; } else { $6_1 = 1 << $5_1; $4_1 = $6_1 - 1 & 1 >>> 32 - $5_1; } $9_1 = $6_1; block : { if ($9_1 & -1431655766 | $4_1 & -1431655766) { break block } $6_1 = 0; block1 : { if (!($9_1 & 262148 | $4_1 & 262144)) { break block1 } $11_1 = $53($1_1); if (!$11_1) { break block1 } $13_1 = $209($1_1); $3 = $268($0_1); if (!$3) { break block1 } $5_1 = 0; $8_1 = HEAP32[$3 + 4 >> 2]; $7_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $10_1 = $3 + 8 | 0; $3 = 0; block3 : { while (1) { block5 : { if (($3 | 0) == ($7_1 | 0)) { while (1) { if (($5_1 | 0) == ($7_1 | 0)) { break block3 } block4 : { $6_1 = HEAP32[$10_1 + ($5_1 << 2) >> 2]; if (($13_1 | 0) != HEAP32[$6_1 + 20 >> 2]) { break block4 } if ($2014(HEAP32[$6_1 + 12 >> 2], $11_1, $13_1)) { break block4 } $3 = $5_1; break block5; } $5_1 = $5_1 + 1 | 0; continue; } } $6_1 = HEAP32[$10_1 + ($3 << 2) >> 2]; if (($11_1 | 0) == HEAP32[$6_1 + 12 >> 2]) { break block5 } $3 = $3 + 1 | 0; continue; } break; }; if (($3 | 0) >= ($8_1 | 0)) { break block3 } $7_1 = $8_1 - 1 | 0; if (($3 | 0) < ($7_1 | 0)) { $5_1 = $8_1 + ($3 ^ -1) << 2; if ($5_1) { $3 = $10_1 + ($3 << 2) | 0; wasm2js_memory_copy($3, $3 + 4 | 0, $5_1); } HEAP32[$10_1 + ($7_1 << 2) >> 2] = $6_1; } HEAP32[$6_1 + 24 >> 2] = HEAP32[$6_1 + 24 >> 2] + 1; $3 = $6_1; if (!($2_1 & 1)) { break block } break block1; } $6_1 = 0; } $10_1 = $2_1 >>> 0 < 2 ? $0_1 : 0; $8_1 = $2_1 & 1; $11_1 = $9_1 & 65537; $13_1 = $4_1 & 65536; $14 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; block19 : { block8 : { while (1) { $3 = $270($14, 56, 0); if (!$3) { break block8 } wasm2js_memory_fill($3, 0, 56); HEAP32[$3 + 24 >> 2] = 1; HEAP32[$3 + 16 >> 2] = $14; if ($6_1) { $2_1 = HEAP32[$6_1 + 4 >> 2]; $1_1 = $51($14, $2_1, 0); HEAP32[$3 >> 2] = $1_1; if (!$1_1) { break block8 } if ($2_1) { wasm2js_memory_copy($1_1, HEAP32[$6_1 >> 2], $2_1) } HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $2_1; HEAP8[$3 + 37 | 0] = HEAPU8[$6_1 + 37 | 0]; $1533($6_1); break block; } block16 : { block17 : { block18 : { block15 : { block12 : { if (!($11_1 | $13_1)) { break block12 } HEAP32[$3 >> 2] = $206($1_1); $9_1 = $209($1_1); HEAP32[$3 + 4 >> 2] = $9_1; if (!$9_1) { HEAP32[$3 >> 2] = 0; break block12; } $4_1 = HEAP32[$3 >> 2]; if (!$4_1) { break block12 } $7_1 = HEAPU8[$4_1 | 0] & 15; block14 : { if ($7_1 >>> 0 > 12) { break block14 } $5_1 = $1575($3, 0, $12_1 + 12 | 0); if (!$5_1) { break block14 } $4_1 = HEAP32[$12_1 + 12 >> 2]; if (($9_1 | 0) != ($5_1 + $4_1 | 0)) { break block14 } if (!$4_1 | $7_1 >>> 0 > 2) { break block15 } } HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; } HEAP32[$3 + 12 >> 2] = $53($1_1); $4_1 = $209($1_1); HEAP32[$3 + 20 >> 2] = $4_1; if (HEAPU8[$14 + 87 | 0]) { break block8 } if (!$4_1) { break block16 } if (!$1544($3, $10_1)) { break block17 } if ($2_1 >>> 0 < 2) { break block18 } HEAP8[$3 + 34 | 0] = 1; break block; } if (!$8_1) { break block } if ($1576($3, 0)) { break block } break block8; } $1533($3); break block19; } block23 : { block21 : { block20 : { if (!$1_1) { break block20 } $4_1 = HEAPU16[$1_1 + 16 >> 1]; if (!($4_1 & 18) | !($4_1 & 4096)) { break block20 } if (HEAP32[$1_1 + 36 >> 2] == 9) { break block21 } } $4_1 = HEAP32[$3 + 20 >> 2]; $5_1 = $750($4_1, $4_1 >> 31); if (!$5_1) { break block8 } $4_1 = HEAP32[$3 + 20 >> 2]; if ($4_1) { wasm2js_memory_copy($5_1, HEAP32[$3 + 12 >> 2], $4_1) } HEAP32[$3 + 12 >> 2] = $5_1; HEAP8[$5_1 + HEAP32[$3 + 20 >> 2] | 0] = 0; break block23; } $5_1 = HEAP32[$3 + 12 >> 2] - 8 | 0; $4_1 = HEAP32[$5_1 >> 2]; $7_1 = HEAP32[$5_1 + 4 >> 2]; $4_1 = $4_1 + 1 | 0; $7_1 = $4_1 ? $7_1 : $7_1 + 1 | 0; HEAP32[$5_1 >> 2] = $4_1; HEAP32[$5_1 + 4 >> 2] = $7_1; } HEAP8[$3 + 36 | 0] = 1; if (($1577($0_1, $3) | 0) == 7) { break block8 } $6_1 = $3; if ($8_1) { continue } break block; } break; }; if ($2_1 >>> 0 >= 2) { HEAP8[$3 + 34 | 0] = 1; break block; } $1533($3); $235($0_1, 20048, -1); break block19; } $1533($6_1); $1533($3); $227($0_1); } $3 = 0; } $0_1 = $12_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1530($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $6_1 = global$0 - 128 | 0; $7_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $7_1; $7_1 = -3; block2 : { block15 : { block21 : { $4_1 = HEAPU8[$2_1 | 0]; block14 : { if (($4_1 | 0) != 91) { if (($4_1 | 0) != 46) { if ($4_1) { break block2 } block6 : { block3 : { if (!HEAPU8[$0_1 + 39 | 0]) { break block3 } if (!$1576($0_1, HEAP32[$0_1 + 44 >> 2])) { break block3 } $2_1 = $1575($0_1, $1_1, $6_1 + 124 | 0) + HEAP32[$6_1 + 124 >> 2] | 0; $7_1 = $1_1; block5 : { switch (HEAPU8[$0_1 + 39 | 0] - 1 | 0) { case 0: $7_1 = $3 ? $3 : $1_1; $1578($0_1, $7_1, $2_1 + ($3 ? $1_1 - $3 | 0 : 0) | 0, 0, 0); break block6; case 2: break block6; default: break block5; }; } $1578($0_1, $1_1, $2_1, HEAP32[$0_1 + 52 >> 2], HEAP32[$0_1 + 44 >> 2]); } $7_1 = $1_1; } HEAP32[$0_1 + 48 >> 2] = $3; break block2; } $4_1 = $2_1 + 1 | 0; $11_1 = HEAP32[$0_1 >> 2]; $8_1 = HEAPU8[$11_1 + $1_1 | 0]; block11 : { block8 : { $5_1 = HEAPU8[$2_1 + 1 | 0]; if (($5_1 | 0) != 34) { $3 = 0; while (1) { $2_1 = $5_1 & 255; if (!$2_1 | ($2_1 | 0) == 46 | ($2_1 | 0) == 91) { break block8 } $3 = $3 + 1 | 0; $5_1 = HEAPU8[$4_1 + $3 | 0]; continue; }; } $2_1 = $2_1 + 2 | 0; $5_1 = 1; while (1) { $3 = HEAPU8[$5_1 + $4_1 | 0]; block10 : { if (($3 | 0) != 92) { if (!$3) { break block2 } if (($3 | 0) != 34) { break block10 } $9_1 = $5_1 + 1 | 0; $3 = $5_1 - 1 | 0; $14 = !$2013($2_1, 92, $3); break block11; } $3 = $5_1 + 1 | 0; $5_1 = HEAPU8[$3 + $4_1 | 0] ? $3 : $5_1; } $5_1 = $5_1 + 1 | 0; continue; }; } $14 = 1; $2_1 = $4_1; $9_1 = $3; if (!$3) { break block2 } } $7_1 = -2; if (($8_1 & 15) != 12) { break block2 } $5_1 = $1575($0_1, $1_1, $6_1 + 124 | 0) + $1_1 | 0; $12_1 = $5_1 + HEAP32[$6_1 + 124 >> 2] | 0; while (1) { if ($5_1 >>> 0 < $12_1 >>> 0) { $7_1 = -1; $10_1 = HEAPU8[$5_1 + $11_1 | 0] & 15; if ($10_1 - 11 >>> 0 < 4294967292) { break block2 } $15_1 = $6_1 + 124 | 0; $8_1 = $1575($0_1, $5_1, $15_1); if (!$8_1) { break block2 } $13_1 = $5_1 + $8_1 | 0; $16_1 = HEAP32[$6_1 + 124 >> 2]; $8_1 = $13_1 + $16_1 | 0; if ($8_1 >>> 0 >= $12_1 >>> 0) { break block2 } $13_1 = $1579($2_1, $3, $14, $11_1 + $13_1 | 0, $16_1, ($10_1 | 0) == 7 | ($10_1 | 0) == 10); $10_1 = HEAPU8[$8_1 + $11_1 | 0] & 15; if ($13_1) { if ($10_1 >>> 0 > 12) { break block2 } $2_1 = $1575($0_1, $8_1, $15_1); if (!$2_1 | HEAP32[$6_1 + 124 >> 2] + ($2_1 + $8_1 | 0) >>> 0 > $12_1 >>> 0) { break block2 } $7_1 = $1530($0_1, $8_1, $4_1 + $9_1 | 0, $5_1); if (HEAP32[$0_1 + 40 >> 2]) { break block14 } break block2; } if ($10_1 >>> 0 > 12) { break block2 } $5_1 = $1575($0_1, $8_1, $6_1 + 124 | 0); if (!$5_1) { break block2 } $5_1 = HEAP32[$6_1 + 124 >> 2] + ($5_1 + $8_1 | 0) | 0; continue; } break; }; if ($5_1 >>> 0 > $12_1 >>> 0) { break block15 } $7_1 = -2; if (HEAPU8[$0_1 + 39 | 0] < 3) { break block2 } $7_1 = $6_1 + 12 | 0; wasm2js_memory_fill($7_1, 0, 56); HEAP32[$6_1 + 28 >> 2] = HEAP32[$0_1 + 16 >> 2]; $1580($7_1, $14 ? 10 : 9, $3, 0); HEAP8[$0_1 + 35 | 0] = HEAPU8[$0_1 + 35 | 0] | HEAPU8[$6_1 + 47 | 0]; $7_1 = $1581($0_1, $6_1 + 68 | 0, $4_1 + $9_1 | 0); block17 : { if ($7_1 >>> 0 > 4294967292) { break block17 } $4_1 = HEAP32[$6_1 + 16 >> 2]; $9_1 = $4_1 + $3 | 0; if (!$1576($0_1, $9_1 + HEAP32[$6_1 + 72 >> 2] | 0)) { break block17 } $1578($0_1, $5_1, 0, 0, $9_1 + HEAP32[$6_1 + 72 >> 2] | 0); if (HEAPU8[$0_1 + 35 | 0]) { break block17 } if ($4_1) { wasm2js_memory_copy(HEAP32[$0_1 >> 2] + $5_1 | 0, HEAP32[$6_1 + 12 >> 2], $4_1) } $4_1 = $5_1 + $4_1 | 0; if ($3) { wasm2js_memory_copy($4_1 + HEAP32[$0_1 >> 2] | 0, $2_1, $3) } $2_1 = HEAP32[$6_1 + 72 >> 2]; if ($2_1) { wasm2js_memory_copy(($4_1 + HEAP32[$0_1 >> 2] | 0) + $3 | 0, HEAP32[$6_1 + 68 >> 2], $2_1) } if (!HEAP32[$0_1 + 40 >> 2]) { break block17 } $1582($0_1, $1_1); } $1545($6_1 + 68 | 0); $1545($6_1 + 12 | 0); break block2; } if ((HEAPU8[HEAP32[$0_1 >> 2] + $1_1 | 0] & 15) != 11) { break block21 } $3 = 0; $8_1 = $1575($0_1, $1_1, $6_1 + 124 | 0); $5_1 = 1; while (1) { $4_1 = HEAPU8[$2_1 + $5_1 | 0]; if (!($4_1 - 58 >>> 0 < 4294967286)) { $5_1 = $5_1 + 1 | 0; $3 = (($4_1 << 24 >> 24) + Math_imul($3, 10) | 0) - 48 | 0; continue; } break; }; if (!(($4_1 | 0) == 93 & $5_1 >>> 0 >= 2)) { if (HEAPU8[$2_1 + 1 | 0] != 35) { break block2 } $3 = $1540($0_1, $1_1); $5_1 = 2; $4_1 = HEAPU8[$2_1 + 2 | 0]; if (($4_1 | 0) == 45) { $4_1 = HEAPU8[$2_1 + 3 | 0]; if ($4_1 - 58 >>> 0 < 4294967286) { break block2 } $5_1 = 3; while (1) { $9_1 = (($4_1 << 24 >> 24) + Math_imul($9_1, 10) | 0) - 48 | 0; $5_1 = $5_1 + 1 | 0; $4_1 = HEAPU8[$5_1 + $2_1 | 0]; if ($4_1 - 58 >>> 0 > 4294967285) { continue } break; }; if ($3 >>> 0 < $9_1 >>> 0) { break block21 } $3 = $3 - $9_1 | 0; } if (($4_1 | 0) != 93) { break block2 } } $4_1 = $1_1 + $8_1 | 0; $7_1 = $4_1 + HEAP32[$6_1 + 124 >> 2] | 0; while (1) { if ($4_1 >>> 0 < $7_1 >>> 0) { if (!$3) { $7_1 = $1530($0_1, $4_1, ($2_1 + $5_1 | 0) + 1 | 0, 0); if (HEAP32[$0_1 + 40 >> 2]) { break block14 } break block2; } $9_1 = $1575($0_1, $4_1, $6_1 + 124 | 0); if (!$9_1) { break block15 } $3 = $3 - 1 | 0; $4_1 = HEAP32[$6_1 + 124 >> 2] + ($4_1 + $9_1 | 0) | 0; continue; } break; }; if ($4_1 >>> 0 > $7_1 >>> 0) { break block15 } if ($3) { break block21 } $7_1 = -2; if (HEAPU8[$0_1 + 39 | 0] < 3) { break block2 } $7_1 = $1581($0_1, $6_1 + 68 | 0, ($2_1 + $5_1 | 0) + 1 | 0); block28 : { if ($7_1 >>> 0 > 4294967292) { break block28 } if (!$1576($0_1, HEAP32[$6_1 + 72 >> 2])) { break block28 } $1578($0_1, $4_1, 0, HEAP32[$6_1 + 68 >> 2], HEAP32[$6_1 + 72 >> 2]); } $1545($6_1 + 68 | 0); if (!HEAP32[$0_1 + 40 >> 2]) { break block2 } } $1582($0_1, $1_1); break block2; } $7_1 = -2; break block2; } $7_1 = -1; } $0_1 = $6_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $1531($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 128 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (HEAPU8[$1_1 + 35 | 0]) { $227($0_1); break block1; } if (HEAPU8[HEAP32[$0_1 + 4 >> 2] + 8 | 0] & 8) { if (!(HEAPU8[$1_1 + 38 | 0] | !HEAP32[$1_1 + 8 >> 2])) { $225($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], 5); HEAP32[$1_1 + 8 >> 2] = 0; break block1; } $225($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2], -1); break block1; } HEAP32[$2_1 >> 2] = $0_1; HEAP16[$2_1 + 24 >> 1] = 1; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 100; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = $2_1 + 26; HEAP32[$1_1 + 40 >> 2] = 0; $1551($1_1, 0, $2_1); $1538($2_1, $1_1, $0_1); $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; } $0_1 = $2_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1532($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 >> 2] = $1_1; $1_1 = $61(19993, $2_1); block : { if (!$0_1) { break block } if ($1_1) { $235($0_1, $1_1, -1); $24($1_1); break block; } $227($0_1); } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1533($0_1) { var $1_1 = 0; if ($0_1) { $1_1 = HEAP32[$0_1 + 24 >> 2]; if ($1_1 >>> 0 >= 2) { HEAP32[$0_1 + 24 >> 2] = $1_1 - 1; return; } $1545($0_1); $13(HEAP32[$0_1 + 16 >> 2], $0_1); } } function $1534($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = global$0 - 128 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 >> 2] = $0_1; HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = $3 + 26; $1535($3, 91); $1_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (!(($1_1 | 0) == ($4_1 | 0))) { $1536($3); $1537($3, HEAP32[($4_1 << 2) + $2_1 >> 2]); $4_1 = $4_1 + 1 | 0; continue; } break; }; $1535($3, 93); $1538($3, 0, 0); $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; $0_1 = $3 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1535($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; $3 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; if (!(($2_1 | 0) == ($3 | 0) & $4_1 >>> 0 < HEAPU32[$0_1 + 8 >> 2] | $2_1 >>> 0 < $3 >>> 0)) { if (!$1599($0_1, 1)) { $2_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $2_1; $5_1 = $2_1 + 1 | 0; $2_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = $2_1 + 1 | 0; $3 = $4_1 ? $3 : $5_1; HEAP32[$0_1 + 16 >> 2] = $4_1; HEAP32[$0_1 + 20 >> 2] = $3; HEAP8[HEAP32[$0_1 + 4 >> 2] + $2_1 | 0] = $1_1; } return; } $3 = $2_1; $5_1 = $2_1 + 1 | 0; $2_1 = $4_1 + 1 | 0; $3 = $2_1 ? $3 : $5_1; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $3; HEAP8[HEAP32[$0_1 + 4 >> 2] + $4_1 | 0] = $1_1; } function $1536($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; if (!(!($1_1 | HEAP32[$0_1 + 20 >> 2]) | (HEAPU8[($1_1 + HEAP32[$0_1 + 4 >> 2] | 0) - 1 | 0] & 223) == 91)) { $1535($0_1, 44) } } function $1537($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 + -64 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block5 : { block3 : { switch (HEAPU8[(HEAPU16[$1_1 + 16 >> 1] & 63) + 31328 | 0] - 1 | 0) { case 4: $1547($0_1, 11741, 4); break block5; case 1: HEAPF64[$2_1 >> 3] = $39($1_1); $1598(100, $0_1, 12694, $2_1); break block5; case 0: $1548($0_1, $53($1_1), $209($1_1)); break block5; case 2: $3 = $53($1_1); $4_1 = $209($1_1); if (!(!(HEAPU8[$1_1 + 17 | 0] & 8) | HEAPU8[$1_1 + 19 | 0] != 74)) { $1548($0_1, $3, $4_1); break block5; } $1557($0_1, $3, $4_1); break block5; default: break block3; }; } if ($1542($1_1)) { wasm2js_memory_fill($2_1 + 16 | 0, 0, 48); HEAP32[$2_1 + 8 >> 2] = $206($1_1); HEAP32[$2_1 + 12 >> 2] = $209($1_1); $1551($2_1 + 8 | 0, 0, $0_1); break block5; } if (HEAPU8[$0_1 + 25 | 0]) { break block5 } $235(HEAP32[$0_1 >> 2], 5360, -1); HEAP8[$0_1 + 25 | 0] = 4; $1550($0_1); } $0_1 = $2_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1538($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = HEAPU8[$0_1 + 25 | 0]; block2 : { if (!$3) { $3 = HEAP32[$0_1 >> 2]; if (HEAPU8[HEAP32[$3 + 4 >> 2] + 8 | 0] & 8) { $1601($0_1); break block2; } if (HEAPU8[$0_1 + 24 | 0]) { $247($3, HEAP32[$0_1 + 4 >> 2], HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2], -1); break block2; } block6 : { if ($1549($0_1)) { if (!(!HEAP32[$1_1 + 8 >> 2] | (HEAPU8[$1_1 + 36 | 0] | !$1_1))) { $4_1 = HEAP32[$0_1 + 4 >> 2]; $3 = $4_1 - 8 | 0; $5_1 = $3; $6_1 = HEAP32[$3 >> 2]; $3 = HEAP32[$3 + 4 >> 2]; $6_1 = $6_1 + 1 | 0; $3 = $6_1 ? $3 : $3 + 1 | 0; HEAP32[$5_1 >> 2] = $6_1; HEAP32[$5_1 + 4 >> 2] = $3; HEAP32[$1_1 + 12 >> 2] = $4_1; $3 = HEAP32[$0_1 + 16 >> 2]; HEAP8[$1_1 + 36 | 0] = 1; HEAP32[$1_1 + 20 >> 2] = $3; if (($1577($2_1, $1_1) | 0) == 7) { break block6 } } $3 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = $5_1 - 8 | 0; $2_1 = $1_1; $4_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = $4_1 + 1 | 0; $1_1 = $4_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = $1_1; $247($3, $5_1, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2], 9); break block2; } $227(HEAP32[$0_1 >> 2]); break block2; } $227($2_1); break block2; } if ($3 & 1) { $227(HEAP32[$0_1 >> 2]); break block2; } if (!($3 & 2)) { break block2 } $235(HEAP32[$0_1 >> 2], 20048, -1); } $1550($0_1); } function $1539($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = $1529($0_1, HEAP32[$2_1 >> 2], 0); if ($3) { $4_1 = 1; block2 : { block1 : { if (($1_1 | 0) != 2) { break block1 } $2_1 = $53(HEAP32[$2_1 + 4 >> 2]); if (!$2_1) { break block2 } $1_1 = $1530($3, 0, HEAPU8[$2_1 | 0] != 36 ? 21017 : $2_1 + 1 | 0, 0); if ($1_1 >>> 0 < 4294967293) { $5_1 = $1_1; break block1; } $4_1 = 0; block6 : { block5 : { switch ($1_1 + 3 | 0) { case 0: $1532($0_1, $2_1); break block6; case 1: break block1; default: break block5; }; } $235($0_1, 20048, -1); } } $1_1 = 0; if ((HEAPU8[HEAP32[$3 >> 2] + $5_1 | 0] & 15) == 11) { $1_1 = $1540($3, $5_1) } if (!$4_1) { break block2 } $240($0_1, $1_1, 0); } $1533($3); } } function $1540($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = $1575($0_1, $1_1, $2_1 + 12 | 0); $1_1 = $3 + $1_1 | 0; $5_1 = $1_1 + HEAP32[$2_1 + 12 >> 2] | 0; while (1) { if (!(!$3 | $1_1 >>> 0 >= $5_1 >>> 0)) { $4_1 = $4_1 + 1 | 0; $3 = $1575($0_1, $1_1, $2_1 + 12 | 0); $1_1 = ($3 + $1_1 | 0) + HEAP32[$2_1 + 12 >> 2] | 0; continue; } break; }; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1541($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 + -64 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $5_1 = $3 + 8 | 0; wasm2js_memory_fill($5_1, 0, 56); HEAP32[$3 + 24 >> 2] = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $4_1 = $1542(HEAP32[$2_1 >> 2]); $1_1 = HEAP32[$2_1 >> 2]; block3 : { block2 : { if ($4_1) { HEAP32[$3 + 8 >> 2] = $206($1_1); $1_1 = $209(HEAP32[$2_1 >> 2]); HEAP32[$3 + 12 >> 2] = $1_1; $4_1 = $1543($5_1, 0, $1_1, 1); $1_1 = 0; break block2; } $1_1 = $53($1_1); HEAP32[$3 + 20 >> 2] = $1_1; if (!$1_1) { break block3 } HEAP32[$3 + 28 >> 2] = $209(HEAP32[$2_1 >> 2]); if (!$1544($3 + 8 | 0, 0)) { $4_1 = 0; $1_1 = 0; break block2; } if (HEAPU8[$3 + 43 | 0]) { $4_1 = -1; $1_1 = -1; break block2; } $2_1 = 0; $4_1 = 0; $1_1 = 0; $6_1 = HEAP32[$3 + 20 >> 2]; $7_1 = HEAP32[$3 + 36 >> 2]; while (1) { block6 : { if (($2_1 | 0) == ($7_1 | 0)) { break block6 } $5_1 = HEAP8[$2_1 + $6_1 | 0]; if (!$5_1) { break block6 } $2_1 = $2_1 + 1 | 0; $5_1 = ($5_1 | 0) > -65; $4_1 = $4_1 + $5_1 | 0; $1_1 = $5_1 >>> 0 > $4_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; continue; } break; }; $4_1 = $4_1 + 1 | 0; $1_1 = $4_1 ? $1_1 : $1_1 + 1 | 0; } $1545($3 + 8 | 0); if (($1_1 | 0) < 0) { $227($0_1); break block3; } $240($0_1, $4_1, $1_1); } $0_1 = $3 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1542($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = global$0 + -64 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $3 = HEAPU16[$0_1 + 16 >> 1]; $2_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $2_1; $4_1 = 0; } else { $4_1 = 1 << $2_1; $3 = $4_1 - 1 & 1 >>> 32 - $2_1; } block : { if (!($4_1 & 65537 | $3 & 65536)) { break block } $2_1 = $206($0_1); $0_1 = $209($0_1); if (!$2_1 | ($0_1 | 0) <= 0) { break block } $3 = HEAPU8[$2_1 | 0] & 15; if ($3 >>> 0 > 12) { break block } wasm2js_memory_fill($1_1 + 12 | 0, 0, 48); HEAP32[$1_1 + 8 >> 2] = $0_1; HEAP32[$1_1 + 4 >> 2] = $2_1; $2_1 = $1575($1_1 + 4 | 0, 0, $1_1 + 60 | 0); if (!$2_1) { break block } $4_1 = HEAP32[$1_1 + 60 >> 2]; if (($0_1 | 0) != ($2_1 + $4_1 | 0)) { break block } $5_1 = !$4_1 | $3 >>> 0 > 2; } $0_1 = $1_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1543($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = global$0 - 16 | 0; $4_1 = $8_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block1 : { if ($3 >>> 0 >= 1001) { $5_1 = $1_1 + 1 | 0; break block1; } $10_1 = $1575($0_1, $1_1, $8_1 + 12 | 0); if (!$10_1) { $5_1 = $1_1 + 1 | 0; break block1; } $4_1 = $1_1 + $10_1 | 0; $7_1 = HEAP32[$8_1 + 12 >> 2]; if (($2_1 | 0) != ($4_1 + $7_1 | 0)) { $5_1 = $1_1 + 1 | 0; break block1; } block26 : { block27 : { block16 : { block10 : { block11 : { block12 : { block15 : { block24 : { block9 : { block8 : { block7 : { block6 : { block5 : { block4 : { $6_1 = HEAP32[$0_1 >> 2]; $9_1 = HEAPU8[$6_1 + $1_1 | 0] & 15; switch ($9_1 | 0) { case 10: break block1; case 11: break block10; case 12: break block11; case 0: case 1: case 2: break block4; case 3: break block5; case 4: break block6; case 5: case 6: break block7; case 7: break block8; case 8: case 9: break block9; default: break block12; }; } $5_1 = ($7_1 + $10_1 | 0) != 1 ? $1_1 + 1 | 0 : 0; break block1; } if (!$7_1) { $5_1 = $1_1 + 1 | 0; break block1; } if (HEAPU8[$4_1 + $6_1 | 0] == 45) { if (($7_1 | 0) == 1) { break block15 } $4_1 = $4_1 + 1 | 0; } $0_1 = $2_1 >>> 0 < $4_1 >>> 0 ? $4_1 : $2_1; while (1) { if (($0_1 | 0) == ($4_1 | 0)) { break block16 } $1_1 = $4_1 + $6_1 | 0; $5_1 = $4_1 + 1 | 0; $4_1 = $5_1; if (HEAPU8[$1_1 | 0] - 58 >>> 0 >= 4294967286) { continue } break; }; break block1; } if ($7_1 >>> 0 <= 2) { $5_1 = $1_1 + 1 | 0; break block1; } $5_1 = HEAPU8[$4_1 + $6_1 | 0]; if (($5_1 | 0) == 45) { if (($7_1 | 0) == 3) { $5_1 = $1_1 + 1 | 0; break block1; } $4_1 = $4_1 + 1 | 0; $5_1 = HEAPU8[$6_1 + $4_1 | 0]; } if (($5_1 & 255) != 48) { $5_1 = $1_1 + 1 | 0; break block1; } if ((HEAPU8[($4_1 + $6_1 | 0) + 1 | 0] | 32) != 120) { $5_1 = $4_1 + 2 | 0; break block1; } $4_1 = $4_1 + 2 | 0; while (1) { if ($2_1 >>> 0 <= $4_1 >>> 0) { break block16 } $0_1 = $4_1 + $6_1 | 0; $5_1 = $4_1 + 1 | 0; $4_1 = $5_1; if (HEAPU8[HEAPU8[$0_1 | 0] + 31424 | 0] & 8) { continue } break; }; break block1; } if ($7_1 >>> 0 <= 1) { $5_1 = $1_1 + 1 | 0; break block1; } $5_1 = HEAPU8[$4_1 + $6_1 | 0]; if (($5_1 | 0) == 45) { if (($7_1 | 0) == 2) { break block24 } $4_1 = $4_1 + 1 | 0; $5_1 = HEAPU8[$6_1 + $4_1 | 0]; } if (($5_1 & 255) == 46) { $5_1 = $4_1 + 1 | 0; if (($9_1 | 0) == 5 | HEAPU8[$6_1 + $5_1 | 0] - 58 >>> 0 < 4294967286) { break block1 } $5_1 = $4_1 + 2 | 0; $3 = 1; break block26; } $3 = 0; if (($9_1 | 0) != 5 | ($5_1 & 255) != 48) { break block27 } $5_1 = $4_1 + 1 | 0; if ($4_1 + 3 >>> 0 > $2_1 >>> 0) { break block1 } $0_1 = HEAPU8[$5_1 + $6_1 | 0]; if (($0_1 | 0) == 46 | ($0_1 | 0) == 101) { break block26 } if (($0_1 | 0) != 69) { break block1 } break block26; } $1_1 = $2_1 >>> 0 > $4_1 >>> 0 ? $2_1 : $4_1; while (1) { if (($1_1 | 0) == ($4_1 | 0)) { break block16 } $0_1 = HEAPU8[$4_1 + $6_1 | 0]; $5_1 = $4_1 + 1 | 0; $4_1 = $5_1; if (HEAPU8[$0_1 + 52912 | 0] | ($0_1 | 0) == 39) { continue } break; }; break block1; } $1_1 = ($9_1 | 0) != 8; while (1) { if ($2_1 >>> 0 <= $4_1 >>> 0) { break block16 } block31 : { block28 : { $3 = $4_1 + $6_1 | 0; $0_1 = HEAPU8[$3 | 0]; if (($0_1 | 0) == 39 | HEAPU8[$0_1 + 52912 | 0]) { break block28 } if (($0_1 | 0) == 34) { if ($1_1) { break block28 } $5_1 = $4_1 + 1 | 0; break block1; } if ($0_1 >>> 0 <= 31) { if ($1_1) { break block28 } $5_1 = $4_1 + 1 | 0; break block1; } $5_1 = $4_1 + 1 | 0; if (($0_1 | 0) != 92 | $5_1 >>> 0 >= $2_1 >>> 0) { break block1 } $0_1 = HEAPU8[$5_1 + $6_1 | 0]; if ($2013(2544, $0_1, 9)) { break block31 } if (($0_1 | 0) == 117) { if ($4_1 + 5 >>> 0 >= $2_1 >>> 0) { break block1 } if ($1587($3 + 2 | 0)) { break block31 } break block1; } if (($9_1 | 0) != 9) { break block1 } HEAP32[$8_1 + 8 >> 2] = 0; $0_1 = $1596($3, $2_1 - $4_1 | 0, $8_1 + 8 | 0); if (HEAP32[$8_1 + 8 >> 2] == 629145) { break block1 } $5_1 = ($0_1 + $4_1 | 0) - 1 | 0; break block31; } $5_1 = $4_1; } $4_1 = $5_1 + 1 | 0; continue; }; } $5_1 = $1_1 + 1 | 0; break block1; } $5_1 = $1_1 + 1 | 0; break block1; } $5_1 = $1_1 + 1 | 0; break block1; } $7_1 = $3 + 1 | 0; $1_1 = 0; while (1) { if ($2_1 >>> 0 > $4_1 >>> 0) { $3 = $1575($0_1, $4_1, $8_1 + 12 | 0); if (!$3) { $5_1 = $4_1 + 1 | 0; break block1; } $3 = HEAP32[$8_1 + 12 >> 2] + ($3 + $4_1 | 0) | 0; if ($2_1 >>> 0 < $3 >>> 0) { $5_1 = $4_1 + 1 | 0; break block1; } if (!($1_1 & 1 | (HEAPU8[$4_1 + $6_1 | 0] & 15) - 11 >>> 0 > 4294967291)) { $5_1 = $4_1 + 1 | 0; break block1; } $5_1 = $1543($0_1, $4_1, $3, $7_1); if ($5_1) { break block1 } $1_1 = $1_1 + 1 | 0; $4_1 = $3; continue; } break; }; $5_1 = $4_1 + 1 & 0 - ($1_1 & 1); break block1; } $3 = $3 + 1 | 0; while (1) { if ($2_1 >>> 0 <= $4_1 >>> 0) { break block16 } $1_1 = $1575($0_1, $4_1, $8_1 + 12 | 0); if (!$1_1) { $5_1 = $4_1 + 1 | 0; break block1; } $1_1 = HEAP32[$8_1 + 12 >> 2] + ($1_1 + $4_1 | 0) | 0; if ($2_1 >>> 0 < $1_1 >>> 0) { $5_1 = $4_1 + 1 | 0; break block1; } $5_1 = $1543($0_1, $4_1, $1_1, $3); $4_1 = $1_1; if (!$5_1) { continue } break; }; break block1; } $5_1 = 0; break block1; } $5_1 = $4_1; } $0_1 = $2_1 - 1 | 0; $9_1 = ($9_1 | 0) != 5; while (1) { block46 : { block40 : { if ($2_1 >>> 0 > $5_1 >>> 0) { $7_1 = $5_1 + $6_1 | 0; $4_1 = HEAPU8[$7_1 | 0]; if ($4_1 - 58 >>> 0 > 4294967285) { break block40 } block42 : { if (!(($4_1 | 0) == 101 | ($4_1 | 0) == 69)) { if (($4_1 | 0) != 46) { break block42 } if ($3 & 255) { $5_1 = $5_1 + 1 | 0; break block1; } $3 = 1; if ($9_1) { break block40 } block45 : { if (($0_1 | 0) == ($5_1 | 0)) { $5_1 = $0_1; break block45; } $4_1 = $5_1; if (HEAPU8[$7_1 + 1 | 0] - 58 >>> 0 > 4294967285) { break block46 } } $5_1 = $5_1 + 1 | 0; break block1; } if (($3 & 255) == 2) { $5_1 = $5_1 + 1 | 0; break block1; } if (($0_1 | 0) == ($5_1 | 0)) { $5_1 = $2_1; break block1; } $3 = 2; block49 : { $4_1 = $5_1; $7_1 = $4_1 + 1 | 0; switch (HEAPU8[$7_1 + $6_1 | 0] - 43 | 0) { case 0: case 2: break block49; default: break block46; }; } $4_1 = $7_1; if (($0_1 | 0) != ($4_1 | 0)) { break block46 } $5_1 = $5_1 + 2 | 0; break block1; } $5_1 = $5_1 + 1 | 0; break block1; } $5_1 = $3 & 255 ? 0 : $1_1 + 1 | 0; break block1; } $4_1 = $5_1; } $5_1 = $4_1 + 1 | 0; continue; }; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1544($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAP32[$0_1 + 12 >> 2]; $2_1 = $1584($0_1, 0); $5_1 = HEAPU8[$0_1 + 35 | 0]; block4 : { block3 : { if (!($5_1 | ($2_1 | 0) <= 0)) { while (1) { $3 = $2_1; $2_1 = $3 + 1 | 0; $6_1 = $3 + $4_1 | 0; $7_1 = HEAPU8[$6_1 | 0]; if (HEAPU8[$7_1 + 53248 | 0]) { continue } break; }; if (!$7_1) { return 0 } $3 = $1585($6_1) + $3 | 0; if (HEAPU8[$3 + $4_1 | 0]) { if (!$1_1) { break block3 } $235($1_1, 20048, -1); break block3; } HEAP8[$0_1 + 37 | 0] = 1; $2_1 = 0; if (($3 | 0) > 0) { break block4 } } if (!$1_1) { break block3 } if ($5_1) { $227($1_1); break block3; } $235($1_1, 20048, -1); } $1545($0_1); $2_1 = 1; } return $2_1; } function $1545($0_1) { if (HEAPU8[$0_1 + 36 | 0]) { $249(HEAP32[$0_1 + 12 >> 2]); HEAP8[$0_1 + 36 | 0] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; } if (HEAP32[$0_1 + 8 >> 2]) { $10(HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 >> 2]); HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; } } function $1546($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $3 = global$0 - 128 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block : { if (($1_1 | 0) < 2) { break block } $6_1 = $1529($0_1, HEAP32[$2_1 >> 2], 0); if (!$6_1) { break block } $8_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; HEAP32[$3 >> 2] = $0_1; HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 + 12 >> 2] = 0; $10_1 = $3 + 26 | 0; HEAP32[$3 + 4 >> 2] = $10_1; $11_1 = ($1_1 | 0) == 2; if (!$11_1) { $1535($3, 91) } $13_1 = $8_1 & 10; $14 = $8_1 & 1; $15_1 = $8_1 & 3; $9_1 = 1; while (1) { block3 : { block16 : { block14 : { block6 : { block5 : { block12 : { block10 : { block8 : { if (($1_1 | 0) != ($9_1 | 0)) { $4_1 = ($9_1 << 2) + $2_1 | 0; $5_1 = $53(HEAP32[$4_1 >> 2]); if (!$5_1) { break block3 } $7_1 = $48($5_1); if (HEAPU8[$5_1 | 0] == 36) { $4_1 = $1530($6_1, 0, $5_1 + 1 | 0, 0); break block5; } if (!$15_1) { break block6 } HEAP32[$3 >> 2] = $0_1; HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = $10_1; block9 : { $4_1 = HEAPU16[HEAP32[$4_1 >> 2] + 16 >> 1]; if (!((($4_1 & 63) >>> 0 < 32 ? 1 << $4_1 : 0) & 1347440720)) { $4_1 = 0; while (1) { if (($4_1 | 0) == ($7_1 | 0)) { break block8 } $12_1 = HEAPU8[$4_1 + $5_1 | 0]; $4_1 = $4_1 + 1 | 0; if (HEAPU8[$12_1 + 31424 | 0] & 6 | ($12_1 | 0) == 95) { continue } break; }; if (HEAPU8[$5_1 | 0] != 91 | $7_1 >>> 0 < 3 | HEAPU8[($5_1 + $7_1 | 0) - 1 | 0] != 93) { break block9 } break block10; } $1547($3, 18455, 1); if (HEAPU8[$5_1 | 0] == 45) { $1547($3, 29269, 1) } $1548($3, $5_1, $7_1); $1547($3, 18453, 2); break block12; } $1547($3, 30023, 2); $1548($3, $5_1, $7_1); $1547($3, 30024, 1); break block12; } if (($1_1 | 0) == 2) { break block3 } $1535($3, 93); $1538($3, 0, 0); if ($8_1 & 8) { break block3 } $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; break block3; } $1547($3, 25082, 1); } $1548($3, $5_1, $7_1); } $1549($3); $4_1 = $1530($6_1, 0, HEAP32[$3 + 4 >> 2], 0); $1550($3); } if ($4_1 >>> 0 < HEAPU32[$6_1 + 4 >> 2]) { if (($1_1 | 0) != 2) { break block14 } if ($14) { HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = $10_1; HEAP32[$3 >> 2] = $0_1; $1551($6_1, $4_1, $3); $1538($3, 0, 0); $1550($3); $4_1 = HEAP32[$0_1 >> 2]; HEAP8[$4_1 + 19 | 0] = 74; HEAP16[$4_1 + 16 >> 1] = HEAPU16[$4_1 + 16 >> 1] | 2048; break block16; } $1552($6_1, $4_1, $0_1, 0); if ((HEAPU8[HEAP32[$6_1 >> 2] + $4_1 | 0] & 15) >>> 0 < 11 | $13_1) { break block16 } $4_1 = HEAP32[$0_1 >> 2]; HEAP8[$4_1 + 19 | 0] = 74; HEAP16[$4_1 + 16 >> 1] = HEAPU16[$4_1 + 16 >> 1] | 2048; break block16; } block18 : { switch ($4_1 + 2 | 0) { case 0: if ($11_1) { break block3 } $1536($3); $1547($3, 11741, 4); break block16; case 1: break block18; default: break block6; }; } $235($0_1, 20048, -1); break block3; } $1532($0_1, $5_1); break block3; } $1536($3); $1551($6_1, $4_1, $3); } $9_1 = $9_1 + 1 | 0; continue; } break; }; $1550($3); $1533($6_1); } $0_1 = $3 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1547($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; $5_1 = $2_1 + $4_1 | 0; $3 = $5_1 >>> 0 < $2_1 >>> 0 ? $3 + 1 | 0 : $3; $6_1 = HEAP32[$0_1 + 12 >> 2]; if (!(($3 | 0) == ($6_1 | 0) & HEAPU32[$0_1 + 8 >> 2] > $5_1 >>> 0 | $3 >>> 0 < $6_1 >>> 0)) { $1602($0_1, $1_1, $2_1); return; } if ($2_1) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + $4_1 | 0, $1_1, $2_1) } $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $2_1; $2_1 = $2_1 + HEAP32[$0_1 + 16 >> 2] | 0; $1_1 = $3 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; } function $1548($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if ($2_1) { $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; $5_1 = $4_1 + $2_1 | 0; $3 = $5_1 >>> 0 < $2_1 >>> 0 ? $3 + 1 | 0 : $3; $6_1 = HEAP32[$0_1 + 12 >> 2]; if (!(($3 | 0) == ($6_1 | 0) & HEAPU32[$0_1 + 8 >> 2] > $5_1 >>> 0 | $3 >>> 0 < $6_1 >>> 0)) { $1602($0_1, $1_1, $2_1); return; } if ($2_1) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + $4_1 | 0, $1_1, $2_1) } $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $2_1; $2_1 = $2_1 + HEAP32[$0_1 + 16 >> 2] | 0; $1_1 = $3 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; } } function $1549($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1535($0_1, 0); $2_1 = HEAPU8[$0_1 + 25 | 0]; if (!$2_1) { $1_1 = HEAP32[$0_1 + 20 >> 2] - 1 | 0; $3 = HEAP32[$0_1 + 16 >> 2] - 1 | 0; $1_1 = ($3 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 16 >> 2] = $3; HEAP32[$0_1 + 20 >> 2] = $1_1; } return !$2_1; } function $1550($0_1) { if (!HEAPU8[$0_1 + 24 | 0]) { $249(HEAP32[$0_1 + 4 >> 2]) } HEAP8[$0_1 + 24 | 0] = 1; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 100; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = $0_1 + 26; } function $1551($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $7_1 = global$0 - 16 | 0; $3 = $7_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $8_1 = $1575($0_1, $1_1, $7_1 + 12 | 0); block1 : { if (!$8_1) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; $2_1 = HEAP32[$0_1 + 4 >> 2] + 1 | 0; break block1; } block15 : { block53 : { block14 : { block10 : { block11 : { block12 : { block13 : { block25 : { block24 : { block9 : { block8 : { block7 : { block6 : { block5 : { block4 : { block3 : { block2 : { $3 = HEAP32[$0_1 >> 2] + $1_1 | 0; switch (HEAPU8[$3 | 0] & 15) { case 10: break block10; case 11: break block11; case 12: break block12; case 0: break block2; case 1: break block3; case 2: break block4; case 3: case 5: break block5; case 4: break block6; case 6: break block7; case 7: case 8: break block8; case 9: break block9; default: break block13; }; } $1547($2_1, 11741, 4); $2_1 = $1_1 + 1 | 0; break block1; } $1547($2_1, 13084, 4); $2_1 = $1_1 + 1 | 0; break block1; } $1547($2_1, 13617, 5); $2_1 = $1_1 + 1 | 0; break block1; } $5_1 = HEAP32[$7_1 + 12 >> 2]; if (!$5_1) { break block14 } $1548($2_1, $3 + $8_1 | 0, $5_1); break block15; } $5_1 = HEAP32[$7_1 + 12 >> 2]; if (!$5_1) { break block14 } $0_1 = 2; block17 : { block16 : { block18 : { $10_1 = $3 + $8_1 | 0; switch (HEAPU8[$10_1 | 0] - 43 | 0) { case 0: break block16; case 2: break block18; default: break block17; }; } $1535($2_1, 45); } $0_1 = 3; } $11_1 = $0_1 >>> 0 > $5_1 >>> 0 ? $0_1 : $5_1; $3 = 0; while (1) { block20 : { if (($0_1 | 0) != ($11_1 | 0)) { $9_1 = HEAPU8[$0_1 + $10_1 | 0]; if (HEAPU8[$9_1 + 31424 | 0] & 8) { break block20 } HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; } HEAP32[$7_1 >> 2] = $6_1; HEAP32[$7_1 + 4 >> 2] = $3; $1598(100, $2_1, $4_1 ? 23236 : 1873, $7_1); break block15; } block22 : { if (!(($3 | 0) == 268435455 | $3 >>> 0 < 268435455)) { $4_1 = 1; break block22; } $3 = $3 << 4 | $6_1 >>> 28; $6_1 = $9_1 + ($9_1 << 1 << 24 >> 24 >>> 7 & 9) & 15 | $6_1 << 4; } $0_1 = $0_1 + 1 | 0; continue; }; } $5_1 = HEAP32[$7_1 + 12 >> 2]; if (!$5_1) { break block14 } $0_1 = 0; $3 = $3 + $8_1 | 0; $4_1 = HEAPU8[$3 | 0]; if (($4_1 | 0) == 45) { $1535($2_1, 45); $4_1 = HEAPU8[$3 + 1 | 0]; $0_1 = 1; } if (($4_1 & 255) != 46) { break block24 } $4_1 = 0; break block25; } $1535($2_1, 34); $5_1 = HEAP32[$7_1 + 12 >> 2]; $1548($2_1, (HEAP32[$0_1 >> 2] + $1_1 | 0) + $8_1 | 0, $5_1); $1535($2_1, 34); break block15; } $5_1 = HEAP32[$7_1 + 12 >> 2]; $1535($2_1, 34); $6_1 = $3 + $8_1 | 0; $3 = $5_1; while (1) { $0_1 = 0; block33 : { block26 : { if (!$3) { break block26 } block27 : { while (1) { if (($0_1 | 0) == ($3 | 0)) { break block27 } $4_1 = $0_1 + $6_1 | 0; $9_1 = HEAPU8[$4_1 | 0]; if (!(($9_1 | 0) != 39 & !HEAPU8[$9_1 + 52912 | 0])) { $0_1 = $0_1 + 1 | 0; continue; } break; }; block31 : { if (!$0_1) { $4_1 = $6_1; break block31; } $1547($2_1, $6_1, $0_1); $3 = $3 - $0_1 | 0; } $0_1 = HEAP8[$4_1 | 0]; if (($0_1 | 0) == 34) { $1547($2_1, 29974, 2); break block33; } if (($0_1 | 0) <= 31) { $6_1 = HEAP32[$2_1 + 20 >> 2]; $9_1 = HEAP32[$2_1 + 16 >> 2] + 7 | 0; $6_1 = $9_1 >>> 0 < 7 ? $6_1 + 1 | 0 : $6_1; $10_1 = HEAP32[$2_1 + 12 >> 2]; if (!(($6_1 | 0) == ($10_1 | 0) & HEAPU32[$2_1 + 8 >> 2] >= $9_1 >>> 0 | $6_1 >>> 0 < $10_1 >>> 0)) { if ($1599($2_1, 7)) { break block26 } $0_1 = HEAPU8[$4_1 | 0]; } $1600($2_1, $0_1 & 255); break block33; } if ($3 >>> 0 <= 1) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; break block26; } block37 : { block38 : { block44 : { block39 : { block40 : { $0_1 = HEAPU8[$4_1 + 1 | 0]; switch ($0_1 - 10 | 0) { case 0: break block37; case 1: case 2: break block38; case 3: break block39; default: break block40; }; } block45 : { block42 : { switch ($0_1 - 118 | 0) { default: if (($0_1 | 0) == 226) { break block44 } if (($0_1 | 0) == 48) { break block45 } if (($0_1 | 0) != 39) { break block38 } $1535($2_1, 39); break block37; case 0: $1547($2_1, 23260, 6); break block37; case 1: break block38; case 2: break block42; }; } if ($3 >>> 0 <= 3) { $3 = 2; HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; break block37; } $1547($2_1, 24697, 4); $4_1 = $4_1 + 2 | 0; $1547($2_1, $4_1, 2); $3 = $3 - 2 | 0; break block37; } $1547($2_1, 24869, 6); break block37; } if (($3 | 0) == 2) { $3 = 2; break block37; } $0_1 = HEAPU8[$4_1 + 2 | 0] == 10; $4_1 = $0_1 ? $4_1 + 1 | 0 : $4_1; $3 = $3 - $0_1 | 0; break block37; } if (!(!(HEAPU8[$4_1 + 2 | 0] != 128 | $3 >>> 0 < 4) & (HEAPU8[$4_1 + 3 | 0] & 254) == 168)) { $3 = 2; HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; break block37; } $4_1 = $4_1 + 2 | 0; $3 = $3 - 2 | 0; break block37; } $1547($2_1, $4_1, 2); } $3 = $3 - 2 | 0; $6_1 = $4_1 + 2 | 0; continue; } $1547($2_1, $6_1, $3); } $1535($2_1, 34); break block15; } $3 = $3 - 1 | 0; $6_1 = $4_1 + 1 | 0; continue; }; } $4_1 = 1; } while (1) { if (!$4_1) { $1535($2_1, 48); $4_1 = 1; continue; } while (1) { if (($0_1 | 0) == ($5_1 | 0)) { break block15 } $4_1 = $0_1 + $3 | 0; $1535($2_1, HEAP8[$4_1 | 0]); $0_1 = $0_1 + 1 | 0; if (($0_1 | 0) != ($5_1 | 0) & HEAPU8[$0_1 + $3 | 0] - 58 >>> 0 >= 4294967286 | HEAPU8[$4_1 | 0] != 46) { continue } break; }; $4_1 = 0; continue; }; } $5_1 = HEAP32[$7_1 + 12 >> 2]; break block53; } $1535($2_1, 123); $4_1 = $1_1 + $8_1 | 0; $5_1 = HEAP32[$7_1 + 12 >> 2]; $6_1 = $4_1 + $5_1 | 0; $3 = 0; while (1) { if (!(HEAPU8[$2_1 + 25 | 0] | $4_1 >>> 0 >= $6_1 >>> 0)) { $4_1 = $1551($0_1, $4_1, $2_1); $1535($2_1, $3 & 1 ? 44 : 58); $3 = $3 + 1 | 0; continue; } break; }; if (!(!($3 & 1) & $4_1 >>> 0 <= $6_1 >>> 0)) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2 } if (!(HEAPU8[$2_1 + 25 | 0] | !$5_1)) { $0_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $3 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $0_1 = ($3 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $0_1; } $1535($2_1, 125); break block15; } $1535($2_1, 91); $4_1 = $1_1 + $8_1 | 0; $5_1 = HEAP32[$7_1 + 12 >> 2]; $3 = $4_1 + $5_1 | 0; while (1) { if (!(HEAPU8[$2_1 + 25 | 0] | $3 >>> 0 <= $4_1 >>> 0)) { $4_1 = $1551($0_1, $4_1, $2_1); $1535($2_1, 44); continue; } break; }; if ($3 >>> 0 < $4_1 >>> 0) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2 } if (!(HEAPU8[$2_1 + 25 | 0] | !$5_1)) { $0_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $3 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $0_1 = ($3 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $0_1; } $1535($2_1, 93); break block15; } $5_1 = HEAP32[$7_1 + 12 >> 2]; $1557($2_1, $3 + $8_1 | 0, $5_1); break block15; } $5_1 = 0; } HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; } $2_1 = ($1_1 + $8_1 | 0) + $5_1 | 0; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1552($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $4_1 = global$0 - 208 | 0; $6_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $6_1; $9_1 = HEAP32[HEAP32[$2_1 >> 2] + 20 >> 2]; $5_1 = $1575($0_1, $1_1, $4_1 + 20 | 0); block1 : { if (!$5_1) { $235($2_1, 20048, -1); break block1; } block14 : { block10 : { block12 : { block17 : { block16 : { block9 : { block8 : { block7 : { block6 : { block5 : { block4 : { block3 : { block2 : { $7_1 = HEAP32[$0_1 >> 2] + $1_1 | 0; switch (HEAPU8[$7_1 | 0] & 15) { case 0: break block2; case 1: break block3; case 2: break block4; case 3: case 4: break block5; case 5: case 6: break block6; case 7: case 10: break block7; case 8: case 9: break block8; case 11: case 12: break block9; default: break block10; }; } if (HEAP32[$4_1 + 20 >> 2]) { break block10 } $241($2_1); break block1; } if (HEAP32[$4_1 + 20 >> 2]) { break block10 } $238($2_1, 1); break block1; } if (HEAP32[$4_1 + 20 >> 2]) { break block10 } $238($2_1, 0); break block1; } HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 28 >> 2] = 0; $3 = HEAP32[$4_1 + 20 >> 2]; if (!$3) { break block10 } $6_1 = HEAPU8[$5_1 + $7_1 | 0]; if (($6_1 | 0) == 45) { if (($3 | 0) == 1) { break block10 } $5_1 = $5_1 + 1 | 0; $3 = $3 - 1 | 0; } $8_1 = $299($9_1, $5_1 + $7_1 | 0, $3, $3 >> 31); if (!$8_1) { break block12 } $7_1 = $438($8_1, $4_1 + 24 | 0); $13($9_1, $8_1); if (!$7_1) { $0_1 = HEAP32[$4_1 + 24 >> 2]; $1_1 = ($6_1 | 0) == 45; $6_1 = $1_1 ? 0 - $0_1 | 0 : $0_1; $3 = ($0_1 | 0) != 0; $0_1 = HEAP32[$4_1 + 28 >> 2]; $8_1 = $1_1 ? 0 - ($3 + $0_1 | 0) | 0 : $0_1; break block14; } $10_1 = ($6_1 | 0) != 45; if (!$10_1) { $6_1 = 0; $8_1 = -2147483648; if (($7_1 | 0) == 3) { break block14 } } if (($7_1 | 0) == 1 | $10_1) { break block16 } $3 = $3 + 1 | 0; $5_1 = $5_1 - 1 | 0; break block17; } $3 = HEAP32[$4_1 + 20 >> 2]; if (!$3) { break block10 } break block17; } $246($2_1, $5_1 + $7_1 | 0, HEAP32[$4_1 + 20 >> 2], -1); break block1; } $8_1 = HEAP32[$4_1 + 20 >> 2]; $6_1 = $51($9_1, $8_1 + 1 | 0, 0); if (!$6_1) { break block12 } $7_1 = $5_1 + $7_1 | 0; $0_1 = 0; $1_1 = 0; while (1) { if (!($1_1 >>> 0 >= $8_1 >>> 0)) { $3 = $1_1 + $7_1 | 0; $5_1 = HEAPU8[$3 | 0]; block24 : { if (($5_1 | 0) == 92) { $9_1 = $1596($3, $8_1 - $1_1 | 0, $4_1 + 24 | 0); $3 = HEAP32[$4_1 + 24 >> 2]; block21 : { if ($3 >>> 0 <= 127) { HEAP8[$0_1 + $6_1 | 0] = $3; $0_1 = $0_1 + 1 | 0; break block21; } if ($3 >>> 0 <= 2047) { $5_1 = $0_1 + $6_1 | 0; HEAP8[$5_1 + 1 | 0] = $3 & 63 | 128; HEAP8[$5_1 | 0] = $3 >>> 6 | 192; $0_1 = $0_1 + 2 | 0; break block21; } if ($3 >>> 0 <= 65535) { $5_1 = $0_1 + $6_1 | 0; HEAP8[$5_1 + 2 | 0] = $3 & 63 | 128; HEAP8[$5_1 | 0] = $3 >>> 12 | 224; HEAP8[$5_1 + 1 | 0] = $3 >>> 6 & 63 | 128; $0_1 = $0_1 + 3 | 0; break block21; } if (($3 | 0) == 629145) { break block21 } $5_1 = $0_1 + $6_1 | 0; HEAP8[$5_1 + 3 | 0] = $3 & 63 | 128; HEAP8[$5_1 | 0] = $3 >>> 18 | 240; HEAP8[$5_1 + 2 | 0] = $3 >>> 6 & 63 | 128; HEAP8[$5_1 + 1 | 0] = $3 >>> 12 & 63 | 128; $0_1 = $0_1 + 4 | 0; } $1_1 = ($1_1 + $9_1 | 0) - 1 | 0; break block24; } HEAP8[$0_1 + $6_1 | 0] = $5_1; $0_1 = $0_1 + 1 | 0; } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP8[$0_1 + $6_1 | 0] = 0; $246($2_1, $6_1, $0_1, 5); break block1; } if (!(!(HEAPU8[HEAP32[$2_1 + 4 >> 2] + 8 | 0] & 8) | $3)) { $225($2_1, $7_1, HEAP32[$4_1 + 20 >> 2] + $5_1 | 0, -1); break block1; } $0_1 = HEAP32[$4_1 + 20 >> 2]; wasm2js_memory_fill($4_1 + 160 | 0, 0, 48); HEAP32[$4_1 + 156 >> 2] = $0_1 + $5_1; HEAP32[$4_1 + 152 >> 2] = $7_1; HEAP32[$4_1 + 24 >> 2] = $2_1; HEAP16[$4_1 + 48 >> 1] = 1; HEAP32[$4_1 + 40 >> 2] = 0; HEAP32[$4_1 + 44 >> 2] = 0; HEAP32[$4_1 + 32 >> 2] = 100; HEAP32[$4_1 + 36 >> 2] = 0; HEAP32[$4_1 + 28 >> 2] = $4_1 + 50; $0_1 = $4_1 + 24 | 0; $1551($4_1 + 152 | 0, 0, $0_1); $1538($0_1, 0, 0); break block1; } if (($7_1 | 0) == 1) { break block10 } } $0_1 = $299($9_1, (HEAP32[$0_1 >> 2] + $1_1 | 0) + $5_1 | 0, $3, $3 >> 31); if (!$0_1) { break block12 } $1_1 = $303($0_1, $4_1 + 8 | 0, $48($0_1), 1); $13($9_1, $0_1); if (($1_1 | 0) <= 0) { break block10 } $233($2_1, HEAPF64[$4_1 + 8 >> 3]); break block1; } $227($2_1); break block1; } $235($2_1, 20048, -1); break block1; } $240($2_1, $6_1, $8_1); } $0_1 = $4_1 + 208 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1553($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; if (($1_1 | 0) > 0) { $3 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2] & 4; if (!($1_1 & 1)) { $1554($0_1, $3 ? 3416 : 2571); return; } $1555($0_1, $1_1, $2_1, $3 ? 4 : 3); } } function $1554($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 >> 2] = $1_1; $1_1 = $0_1; $0_1 = $61(4015, $2_1); $235($1_1, $0_1, -1); $24($0_1); $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1555($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0.0, $13_1 = 0, $14 = 0; $5_1 = global$0 + -64 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $7_1 = $1529($0_1, HEAP32[$2_1 >> 2], ($1_1 | 0) != 1); block : { if (!$7_1) { break block } $13_1 = $1_1 - 1 | 0; $14 = $3 - 2 | 0; $1_1 = 1; block4 : { while (1) { if ($1_1 >>> 0 < $13_1 >>> 0) { $9_1 = ($1_1 << 2) + $2_1 | 0; $11_1 = HEAP32[$9_1 >> 2]; $6_1 = HEAPU16[$11_1 + 16 >> 1]; $8_1 = $6_1 & 31; if (($6_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $8_1; $10_1 = 0; } else { $10_1 = 1 << $8_1; $6_1 = $10_1 - 1 & 1 >>> 32 - $8_1; } block2 : { if ($10_1 & -1431655766 | $6_1 & -1431655766) { break block2 } $8_1 = $53($11_1); if (!$8_1) { $227($0_1); $1533($7_1); break block; } if (HEAPU8[$8_1 | 0] != 36) { break block4 } $4_1 = HEAP32[$9_1 + 4 >> 2]; $6_1 = HEAPU16[$4_1 + 16 >> 1]; wasm2js_memory_fill($5_1 + 8 | 0, 0, 56); HEAP32[$5_1 + 24 >> 2] = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; block18 : { block10 : { block13 : { block12 : { block6 : { switch (HEAPU8[($6_1 & 63) + 31328 | 0] - 1 | 0) { case 3: if ($1542($4_1)) { HEAP32[$5_1 + 8 >> 2] = $206($4_1); HEAP32[$5_1 + 12 >> 2] = $209($4_1); break block12; } $235($0_1, 5360, -1); break block13; case 2: $6_1 = $53($4_1); $9_1 = $209($4_1); if (!$6_1) { break block13 } if (!(!(HEAPU8[$4_1 + 17 | 0] & 8) | HEAPU8[$4_1 + 19 | 0] != 74)) { HEAP32[$5_1 + 28 >> 2] = $9_1; HEAP32[$5_1 + 20 >> 2] = $6_1; $4_1 = $5_1 + 8 | 0; if (!$1544($4_1, $0_1)) { break block12 } $235($0_1, 20048, -1); $10(HEAP32[$5_1 + 24 >> 2], HEAP32[$5_1 + 8 >> 2]); wasm2js_memory_fill($4_1, 0, 56); break block13; } $1580($5_1 + 8 | 0, 10, $9_1, $6_1); break block12; case 1: $12_1 = $39($4_1); if ($12_1 != $12_1) { $1580($5_1 + 8 | 0, 0, 0, 0); break block12; } $6_1 = $209($4_1); $4_1 = $53($4_1); if (!$4_1) { break block13 } block17 : { $9_1 = HEAPU8[$4_1 | 0]; if (($9_1 | 0) != 45) { if (($9_1 | 0) != 73) { break block17 } $1580($5_1 + 8 | 0, 5, 5, 23230); break block12; } if (HEAPU8[$4_1 + 1 | 0] != 73) { break block17 } $1580($5_1 + 8 | 0, 5, 6, 23229); break block12; } $1580($5_1 + 8 | 0, 5, $6_1, $4_1); break block12; case 0: break block6; default: break block10; }; } $6_1 = $209($4_1); $4_1 = $53($4_1); if (!$4_1) { break block13 } $1580($5_1 + 8 | 0, 3, $6_1, $4_1); } if (!HEAPU8[$5_1 + 43 | 0]) { break block18 } $227($0_1); } $1545($5_1 + 8 | 0); $1533($7_1); break block; } HEAP32[$5_1 + 12 >> 2] = 1; HEAP32[$5_1 + 8 >> 2] = 82760; } block21 : { if (!HEAPU8[$8_1 + 1 | 0]) { $4_1 = 0; block20 : { switch ($14 | 0) { case 0: case 2: break block20; default: break block21; }; } $1578($7_1, 0, HEAP32[$7_1 + 4 >> 2], HEAP32[$5_1 + 8 >> 2], HEAP32[$5_1 + 12 >> 2]); break block21; } HEAP8[$7_1 + 39 | 0] = $3; HEAP32[$7_1 + 44 >> 2] = HEAP32[$5_1 + 12 >> 2]; $4_1 = HEAP32[$5_1 + 8 >> 2]; HEAP32[$7_1 + 40 >> 2] = 0; HEAP32[$7_1 + 52 >> 2] = $4_1; $4_1 = $1530($7_1, 0, $8_1 + 1 | 0, 0); } $1545($5_1 + 8 | 0); if (($4_1 | 0) == -2) { break block2 } if ($4_1 >>> 0 > 4294967292) { break block4 } } $1_1 = $1_1 + 2 | 0; continue; } break; }; $1531($0_1, $7_1); $1533($7_1); break block; } $1533($7_1); if (($4_1 | 0) == -1) { $235($0_1, 20048, -1); break block; } $1532($0_1, $8_1); } $0_1 = $5_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1556($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 128 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block1 : { if ($1_1 & 1) { $235($0_1, 3964, -1); break block1; } HEAP32[$3 >> 2] = $0_1; HEAP16[$3 + 24 >> 1] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = $3 + 26; $1535($3, 123); while (1) { if (($1_1 | 0) > ($6_1 | 0)) { $5_1 = ($6_1 << 2) + $2_1 | 0; $4_1 = HEAPU16[HEAP32[$5_1 >> 2] + 16 >> 1]; $7_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $7_1; $8_1 = 0; } else { $8_1 = 1 << $7_1; $4_1 = $8_1 - 1 & 1 >>> 32 - $7_1; } if ($8_1 & 262148 | $4_1 & 262144) { $1536($3); $1557($3, $53(HEAP32[$5_1 >> 2]), $209(HEAP32[$5_1 >> 2])); $1535($3, 58); $1537($3, HEAP32[$5_1 + 4 >> 2]); $6_1 = $6_1 + 2 | 0; continue; } else { $235($0_1, 18831, -1); $1550($3); break block1; } } break; }; $1535($3, 125); $1538($3, 0, 0); $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; } $0_1 = $3 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1557($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if (!$1_1) { break block } $5_1 = HEAP32[$0_1 + 16 >> 2]; $6_1 = $5_1 + $2_1 | 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $4_1; $3 = $5_1 >>> 0 > $6_1 >>> 0 ? $3 + 1 | 0 : $3; $6_1 = $6_1 + 2 | 0; $3 = $6_1 >>> 0 < 2 ? $3 + 1 | 0 : $3; $7_1 = HEAP32[$0_1 + 12 >> 2]; if (!(($3 | 0) == ($7_1 | 0) & HEAPU32[$0_1 + 8 >> 2] > $6_1 >>> 0 | $3 >>> 0 < $7_1 >>> 0)) { if ($1599($0_1, $2_1 + 2 | 0)) { break block } $5_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = HEAP32[$0_1 + 20 >> 2]; } $3 = $5_1 + 1 | 0; $4_1 = $3 ? $4_1 : $4_1 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $3; HEAP32[$0_1 + 20 >> 2] = $4_1; HEAP8[HEAP32[$0_1 + 4 >> 2] + $5_1 | 0] = 34; while (1) { $6_1 = 0; block8 : { block6 : { block7 : { block4 : { while (1) { block3 : { $5_1 = $6_1 | 3; if ($2_1 >>> 0 <= $5_1 >>> 0) { $3 = $6_1; while (1) { if ($2_1 >>> 0 <= $3 >>> 0) { break block3 } if (!HEAPU8[HEAPU8[$1_1 + $3 | 0] + 52912 | 0]) { break block4 } $3 = $3 + 1 | 0; continue; }; } if (!HEAPU8[HEAPU8[$1_1 + $6_1 | 0] + 52912 | 0]) { $3 = $6_1; break block4; } $3 = $6_1 | 1; if (!HEAPU8[HEAPU8[$3 + $1_1 | 0] + 52912 | 0]) { break block4 } $3 = $6_1 | 2; if (!HEAPU8[HEAPU8[$3 + $1_1 | 0] + 52912 | 0]) { break block4 } $3 = $5_1; if (!HEAPU8[HEAPU8[$3 + $1_1 | 0] + 52912 | 0]) { break block4 } $6_1 = $6_1 + 4 | 0; continue; } break; }; $5_1 = HEAP32[$0_1 + 16 >> 2]; $3 = $2_1 >>> 0 > $6_1 >>> 0 ? $2_1 : $6_1; $2_1 = HEAP32[$0_1 + 20 >> 2]; if (!$3) { break block6 } break block7; } if ($2_1 >>> 0 > $3 >>> 0) { break block8 } $5_1 = HEAP32[$0_1 + 16 >> 2]; } if ($3) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + $5_1 | 0, $1_1, $3) } $4_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = $3 + HEAP32[$0_1 + 16 >> 2] | 0; $2_1 = $5_1 >>> 0 < $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; } $3 = $2_1; $1_1 = $5_1 + 1 | 0; $3 = $1_1 ? $3 : $3 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $3; HEAP8[HEAP32[$0_1 + 4 >> 2] + $5_1 | 0] = 34; break block; } $4_1 = !!$3; if ($4_1) { if ($4_1) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0, $1_1, $3) } $4_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = $3 + HEAP32[$0_1 + 16 >> 2] | 0; $4_1 = $5_1 >>> 0 < $3 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 + 16 >> 2] = $5_1; HEAP32[$0_1 + 20 >> 2] = $4_1; $2_1 = $2_1 - $3 | 0; $1_1 = $1_1 + $3 | 0; } block16 : { block14 : { block13 : { $6_1 = HEAPU8[$1_1 | 0]; if (($6_1 | 0) != 92) { if (($6_1 | 0) == 39) { break block13 } if (($6_1 | 0) != 34) { break block14 } } $5_1 = HEAP32[$0_1 + 16 >> 2]; $7_1 = $5_1 + $2_1 | 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $4_1; $3 = $5_1 >>> 0 > $7_1 >>> 0 ? $3 + 1 | 0 : $3; $7_1 = $7_1 + 3 | 0; $3 = $7_1 >>> 0 < 3 ? $3 + 1 | 0 : $3; $8_1 = HEAP32[$0_1 + 12 >> 2]; if (!(($3 | 0) == ($8_1 | 0) & HEAPU32[$0_1 + 8 >> 2] >= $7_1 >>> 0 | $3 >>> 0 < $8_1 >>> 0)) { if ($1599($0_1, $2_1 + 3 | 0)) { break block } $5_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = HEAP32[$0_1 + 20 >> 2]; } $3 = $5_1 + 1 | 0; $4_1 = $3 ? $4_1 : $4_1 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $3; HEAP32[$0_1 + 20 >> 2] = $4_1; HEAP8[HEAP32[$0_1 + 4 >> 2] + $5_1 | 0] = 92; $4_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = HEAP32[$0_1 + 16 >> 2]; $3 = $5_1 + 1 | 0; $4_1 = $3 ? $4_1 : $4_1 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $3; HEAP32[$0_1 + 20 >> 2] = $4_1; HEAP8[$5_1 + HEAP32[$0_1 + 4 >> 2] | 0] = $6_1; break block16; } $3 = HEAP32[$0_1 + 20 >> 2]; $5_1 = HEAP32[$0_1 + 16 >> 2]; $4_1 = $5_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $4_1; HEAP32[$0_1 + 20 >> 2] = $3; HEAP8[$5_1 + HEAP32[$0_1 + 4 >> 2] | 0] = 39; break block16; } $3 = HEAP32[$0_1 + 16 >> 2]; $5_1 = $3 + $2_1 | 0; $4_1 = HEAP32[$0_1 + 20 >> 2]; $4_1 = $3 >>> 0 > $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $5_1 = $5_1 + 7 | 0; $4_1 = $5_1 >>> 0 < 7 ? $4_1 + 1 | 0 : $4_1; $3 = HEAP32[$0_1 + 12 >> 2]; if (!(($4_1 | 0) == ($3 | 0) & HEAPU32[$0_1 + 8 >> 2] >= $5_1 >>> 0 | $3 >>> 0 > $4_1 >>> 0)) { if ($1599($0_1, $2_1 + 7 | 0)) { break block } } $1600($0_1, $6_1); } $2_1 = $2_1 - 1 | 0; $1_1 = $1_1 + 1 | 0; continue; }; } } function $1558($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = $1529($0_1, HEAP32[$2_1 >> 2], 1); if ($1_1) { $2_1 = $1529($0_1, HEAP32[$2_1 + 4 >> 2], 0); if ($2_1) { block5 : { block3 : { switch ($1559($1_1, 0, $2_1, 0) | 0) { case 0: $1531($0_1, $1_1); break block5; case 3: $227($0_1); break block5; default: break block3; }; } $235($0_1, 20048, -1); } $1533($2_1); } $1533($1_1); } } function $1559($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0; $4_1 = global$0 - 32 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; HEAP32[$4_1 + 28 >> 2] = 0; $5_1 = HEAP32[$2_1 >> 2] + $3 | 0; block1 : { if ((HEAPU8[$5_1 | 0] & 15) != 12) { $6_1 = $4_1 + 28 | 0; $2_1 = $1575($2_1, $3, $6_1); $3 = HEAP32[$4_1 + 28 >> 2]; $1578($0_1, $1_1, $1575($0_1, $1_1, $6_1) + HEAP32[$4_1 + 28 >> 2] | 0, $5_1, $2_1 + $3 | 0); $7_1 = HEAPU8[$0_1 + 35 | 0] ? 3 : 0; break block1; } if ((HEAPU8[HEAP32[$0_1 >> 2] + $1_1 | 0] & 15) != 12) { $1578($0_1, $1575($0_1, $1_1, $4_1 + 28 | 0) + $1_1 | 0, HEAP32[$4_1 + 28 >> 2], 0, 0); $5_1 = HEAP32[$0_1 >> 2] + $1_1 | 0; HEAP8[$5_1 | 0] = HEAPU8[$5_1 | 0] & 240 | 12; } block3 : { $9_1 = $4_1 + 28 | 0; $5_1 = $1575($2_1, $3, $9_1); if (!$5_1) { break block3 } $6_1 = HEAP32[$4_1 + 28 >> 2]; $9_1 = $1575($0_1, $1_1, $9_1); if (!$9_1) { $7_1 = 1; break block1; } $11_1 = $3 + $5_1 | 0; $14 = $6_1 + $11_1 | 0; $9_1 = $1_1 + $9_1 | 0; $27 = $9_1 + HEAP32[$4_1 + 28 >> 2] | 0; block8 : { while (1) { $5_1 = $11_1; if ($14 >>> 0 > $5_1 >>> 0) { $12_1 = HEAP32[$2_1 >> 2]; $3 = HEAPU8[$12_1 + $5_1 | 0] & 15; if ($3 - 11 >>> 0 < 4294967292) { break block3 } $15_1 = $1575($2_1, $5_1, $4_1 + 16 | 0); if (!$15_1) { break block3 } $16_1 = HEAP32[$4_1 + 16 >> 2]; $6_1 = $5_1 + $15_1 | 0; $10_1 = $16_1 + $6_1 | 0; if ($10_1 >>> 0 >= $14 >>> 0) { break block3 } $17_1 = $1575($2_1, $10_1, $4_1 + 12 | 0); if (!$17_1) { break block3 } $22_1 = HEAP32[$4_1 + 12 >> 2]; $11_1 = $22_1 + ($10_1 + $17_1 | 0) | 0; if ($14 >>> 0 < $11_1 >>> 0) { break block3 } $28_1 = ($3 | 0) == 7 | ($3 | 0) == 10; $29_1 = $6_1 + $12_1 | 0; $23_1 = HEAP32[$0_1 + 40 >> 2]; $8_1 = $23_1 + $27 | 0; $3 = $9_1; block6 : { while (1) { $6_1 = $3; if ($3 >>> 0 >= $8_1 >>> 0) { break block6 } $7_1 = 1; $24_1 = HEAP32[$0_1 >> 2]; $18_1 = HEAPU8[$3 + $24_1 | 0] & 15; if ($18_1 - 11 >>> 0 < 4294967292) { break block1 } $19_1 = $1575($0_1, $3, $4_1 + 24 | 0); if (!$19_1) { break block1 } $20_1 = HEAP32[$4_1 + 24 >> 2]; $25 = $3 + $19_1 | 0; $13_1 = $20_1 + $25 | 0; if ($13_1 >>> 0 >= $8_1 >>> 0) { break block1 } $21_1 = $1575($0_1, $13_1, $4_1 + 20 | 0); if (!$21_1) { break block1 } $26_1 = HEAP32[$4_1 + 20 >> 2]; $3 = $26_1 + ($13_1 + $21_1 | 0) | 0; if ($8_1 >>> 0 < $3 >>> 0) { break block1 } if (!$1579($29_1, $16_1, $28_1, $24_1 + $25 | 0, $20_1, ($18_1 | 0) == 7 | ($18_1 | 0) == 10)) { continue } break; }; if (!(HEAPU8[$10_1 + $12_1 | 0] & 15)) { $1578($0_1, $6_1, (($19_1 + $21_1 | 0) + $20_1 | 0) + $26_1 | 0, 0, 0); if (!HEAPU8[$0_1 + 35 | 0]) { continue } break block8; } HEAP32[$0_1 + 40 >> 2] = 0; $7_1 = $1559($0_1, $13_1, $2_1, $10_1); if ($7_1) { break block1 } HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 40 >> 2] + $23_1; continue; } $6_1 = HEAPU8[$10_1 + $12_1 | 0] & 15; if (!$6_1) { continue } $3 = $15_1 + $16_1 | 0; if (($6_1 | 0) != 12) { $6_1 = $17_1 + $22_1 | 0; $1578($0_1, $8_1, 0, 0, $6_1 + $3 | 0); if (HEAPU8[$0_1 + 35 | 0]) { break block8 } if ($3) { wasm2js_memory_copy($8_1 + HEAP32[$0_1 >> 2] | 0, HEAP32[$2_1 >> 2] + $5_1 | 0, $3) } if (!$6_1) { continue } wasm2js_memory_copy($3 + ($8_1 + HEAP32[$0_1 >> 2] | 0) | 0, HEAP32[$2_1 >> 2] + $10_1 | 0, $6_1); continue; } $1578($0_1, $8_1, 0, 0, $3 + 1 | 0); if (HEAPU8[$0_1 + 35 | 0]) { break block8 } if ($3) { wasm2js_memory_copy($8_1 + HEAP32[$0_1 >> 2] | 0, HEAP32[$2_1 >> 2] + $5_1 | 0, $3) } $3 = $3 + $8_1 | 0; HEAP8[$3 + HEAP32[$0_1 >> 2] | 0] = 0; $5_1 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$0_1 + 40 >> 2] = 0; $7_1 = $1559($0_1, $3, $2_1, $10_1); if ($7_1) { break block1 } HEAP32[$0_1 + 40 >> 2] = $5_1 + HEAP32[$0_1 + 40 >> 2]; continue; } break; }; if (HEAP32[$0_1 + 40 >> 2]) { $1582($0_1, $1_1) } $7_1 = HEAPU8[$0_1 + 35 | 0] ? 3 : 0; break block1; } $7_1 = 3; break block1; } $7_1 = 2; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $1560($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = global$0 - 160 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; $4_1 = $1529($0_1, HEAP32[$2_1 >> 2], 0); HEAP32[$3 + 12 >> 2] = $4_1; if ($4_1) { HEAP32[$3 + 32 >> 2] = $0_1; HEAP32[$3 + 48 >> 2] = 0; HEAP32[$3 + 52 >> 2] = 0; HEAP32[$3 + 40 >> 2] = 100; HEAP32[$3 + 44 >> 2] = 0; HEAP32[$3 + 36 >> 2] = $3 + 58; HEAP16[$3 + 56 >> 1] = 1; HEAP32[$3 + 16 >> 2] = $3 + 32; block3 : { block2 : { if (($1_1 | 0) != 1) { $0_1 = $53(HEAP32[$2_1 + 4 >> 2]); HEAP32[$3 + 20 >> 2] = $0_1; if ($0_1) { break block2 } } HEAP32[$3 + 20 >> 2] = 30783; $0_1 = 4; break block3; } $0_1 = $2080($0_1); } HEAP32[$3 + 24 >> 2] = $0_1; $1561($3 + 12 | 0, 0); $1538($3 + 32 | 0, 0, 0); $1533(HEAP32[$3 + 12 >> 2]); } $0_1 = $3 + 160 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1561($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 + 4 >> 2]; $4_1 = HEAP32[$0_1 >> 2]; $3 = $1575($4_1, $1_1, $5_1 + 12 | 0); block1 : { if (!$3) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; $1_1 = HEAP32[$4_1 + 4 >> 2] + 1 | 0; break block1; } block7 : { block8 : { block4 : { switch ((HEAPU8[HEAP32[$4_1 >> 2] + $1_1 | 0] & 15) - 11 | 0) { case 0: $6_1 = HEAP32[$5_1 + 12 >> 2]; $1535($2_1, 91); $4_1 = $1_1 + $3 | 0; $1_1 = $6_1 + $4_1 | 0; if ($1_1 >>> 0 > $4_1 >>> 0) { $1535($2_1, 10); HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] + 1; while (1) { block6 : { if (HEAPU8[$2_1 + 25 | 0]) { break block6 } $1604($0_1); $4_1 = $1561($0_1, $4_1); if ($4_1 >>> 0 >= $1_1 >>> 0) { break block6 } $1547($2_1, 30796, 2); continue; } break; }; $1535($2_1, 10); HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] - 1; $1604($0_1); } $1535($2_1, 93); break block1; case 1: $6_1 = HEAP32[$5_1 + 12 >> 2]; $1535($2_1, 123); $3 = $1_1 + $3 | 0; $1_1 = $6_1 + $3 | 0; if ($1_1 >>> 0 <= $3 >>> 0) { break block7 } $1535($2_1, 10); HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] + 1; while (1) { if (HEAPU8[$2_1 + 25 | 0]) { break block8 } $1604($0_1); $3 = $1551($4_1, $3, $2_1); if ($1_1 >>> 0 < $3 >>> 0) { HEAP8[$2_1 + 25 | 0] = HEAPU8[$2_1 + 25 | 0] | 2; break block8; } $1547($2_1, 30759, 2); $3 = $1561($0_1, $3); if ($3 >>> 0 >= $1_1 >>> 0) { break block8 } $1547($2_1, 30796, 2); continue; }; default: break block4; }; } $1_1 = $1551($4_1, $1_1, $2_1); break block1; } $1535($2_1, 10); HEAP32[$0_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2] - 1; $1604($0_1); } $1535($2_1, 125); } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1562($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $1_1 = global$0 - 128 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP16[$1_1 + 24 >> 1] = 1; HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 100; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $1_1 + 26; HEAP32[$1_1 >> 2] = $0_1; $1537($1_1, HEAP32[$2_1 >> 2]); $1538($1_1, 0, 0); $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; $0_1 = $1_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1563($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; if (($1_1 | 0) > 0) { if (!($1_1 & 1)) { $1554($0_1, 14905); return; } $1555($0_1, $1_1, $2_1, 2); } } function $1564($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = $1529($0_1, HEAP32[$2_1 >> 2], 0); if ($3) { block2 : { block3 : { block1 : { if (($1_1 | 0) != 2) { break block1 } $1_1 = $53(HEAP32[$2_1 + 4 >> 2]); if (!$1_1) { break block2 } if (HEAPU8[$1_1 | 0] != 36) { break block3 } $4_1 = $1530($3, 0, $1_1 + 1 | 0, 0); if ($4_1 >>> 0 < 4294967293) { break block1 } block4 : { switch ($4_1 + 3 | 0) { case 1: break block2; case 0: break block3; default: break block4; }; } $235($0_1, 20048, -1); break block2; } $246($0_1, HEAP32[((HEAPU8[HEAP32[$3 >> 2] + $4_1 | 0] & 15) << 2) + 53552 >> 2], -1, 0); break block2; } $1532($0_1, $1_1); } $1533($3); } } function $1565($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 + -64 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = 1; block3 : { block1 : { if (($1_1 | 0) == 2) { $1_1 = $50(HEAP32[$2_1 + 4 >> 2]); $3 = i64toi32_i32$HIGH_BITS - 1 | 0; $5_1 = $1_1 - 1 | 0; $3 = ($5_1 | 0) != -1 ? $3 + 1 | 0 : $3; if (!$3 & $5_1 >>> 0 > 14 | $3) { break block1 } $3 = $1_1; } block6 : { block4 : { block2 : { $1_1 = HEAP32[$2_1 >> 2]; switch (HEAPU8[(HEAPU16[$1_1 + 16 >> 1] & 63) + 31328 | 0] - 4 | 0) { case 0: break block2; case 1: break block3; default: break block4; }; } if (!$1542($1_1)) { break block4 } if ($3 & 4) { $1_1 = 1; break block6; } if (!($3 & 8)) { $1_1 = 0; break block6; } $3 = $4_1 + 8 | 0; wasm2js_memory_fill($3 + 8 | 0, 0, 48); HEAP32[$4_1 + 8 >> 2] = $206(HEAP32[$2_1 >> 2]); $1_1 = $209(HEAP32[$2_1 >> 2]); HEAP32[$4_1 + 12 >> 2] = $1_1; $1_1 = !$1543($3, 0, $1_1, 1); break block6; } $1_1 = 0; if (!($3 & 3)) { break block6 } $2_1 = $1529($0_1, HEAP32[$2_1 >> 2], 2); if ($2_1) { block11 : { if (HEAPU8[$2_1 + 35 | 0]) { $227($0_1); break block11; } if (HEAPU8[$2_1 + 34 | 0] | !(HEAPU8[$2_1 + 37 | 0] ? $3 & 2 : 1)) { break block11 } $1_1 = 1; } $1533($2_1); break block6; } $227($0_1); } $238($0_1, $1_1); break block3; } $235($0_1, 23440, -1); } $0_1 = $4_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1566($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $1_1 = $266($0_1, 128); if ($1_1) { block3 : { block2 : { if (!HEAP32[$1_1 + 4 >> 2]) { HEAP32[$1_1 >> 2] = $0_1; HEAP16[$1_1 + 24 >> 1] = 1; HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 100; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $1_1 + 26; $3 = 91; break block2; } $3 = 44; if (!HEAP32[$1_1 + 20 >> 2] & HEAPU32[$1_1 + 16 >> 2] < 2) { break block3 } } $1535($1_1, $3); } HEAP32[$1_1 >> 2] = $0_1; $1537($1_1, HEAP32[$2_1 >> 2]); } } function $1567($0_1) { $0_1 = $0_1 | 0; $1568($0_1, 1); } function $1568($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block4 : { $2_1 = $266($0_1, 0); block6 : { if ($2_1) { HEAP32[$2_1 >> 2] = $0_1; $1535($2_1, 93); if (HEAPU8[$2_1 + 25 | 0]) { $1538($2_1, 0, 0); return; } if (HEAPU8[HEAP32[$0_1 + 4 >> 2] + 8 | 0] & 8) { $1601($2_1); if ($1_1) { if (HEAPU8[$2_1 + 24 | 0]) { break block4 } $249(HEAP32[$2_1 + 4 >> 2]); return; } if (HEAPU8[$2_1 + 25 | 0]) { break block4 } $0_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $1_1 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $0_1 = ($1_1 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; HEAP32[$2_1 + 16 >> 2] = $1_1; HEAP32[$2_1 + 20 >> 2] = $0_1; return; } $3 = HEAP32[$2_1 + 16 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; if ($1_1) { $246($0_1, $4_1, $3, HEAPU8[$2_1 + 24 | 0] ? -1 : 9); HEAP8[$2_1 + 24 | 0] = 1; break block6; } $246($0_1, $4_1, $3, -1); if (HEAPU8[$2_1 + 25 | 0]) { break block6 } $1_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $3 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $1_1 = ($3 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $1_1; break block6; } $246($0_1, 18452, 2, 0); } $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; } } function $1569($0_1) { $0_1 = $0_1 | 0; $1568($0_1, 0); } function $1570($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = $266($0_1, 0); if ($3) { $1_1 = HEAP32[$3 + 16 >> 2]; $6_1 = HEAP32[$3 + 20 >> 2]; $5_1 = HEAP32[$3 + 4 >> 2]; $2_1 = 0; $0_1 = 1; block1 : { while (1) { if (!$6_1 & $0_1 >>> 0 >= $1_1 >>> 0) { break block1 } $7_1 = $0_1 + $5_1 | 0; $4_1 = HEAPU8[$7_1 | 0]; if ($2_1 | ($4_1 | 0) != 44 | $8_1) { block6 : { block5 : { if (($4_1 | 0) != 92) { if (($4_1 | 0) != 34) { break block5 } $2_1 = !$2_1; break block6; } $0_1 = $0_1 + 1 | 0; break block6; } if ($2_1) { $2_1 = 1; break block6; } $2_1 = $4_1 & 223; $8_1 = ((($2_1 | 0) == 91) + $8_1 | 0) - (($2_1 | 0) == 93) | 0; $2_1 = 0; } $0_1 = $0_1 + 1 | 0; continue; } break; }; $2_1 = $1_1 - $0_1 | 0; HEAP32[$3 + 16 >> 2] = $2_1; HEAP32[$3 + 20 >> 2] = $6_1 - ($0_1 >>> 0 > $1_1 >>> 0); $0_1 = $2_1 - 1 | 0; if ($0_1) { wasm2js_memory_copy($5_1 + 1 | 0, $7_1 + 1 | 0, $0_1) } HEAP8[HEAP32[$3 + 16 >> 2] + $5_1 | 0] = 0; return; } HEAP32[$3 + 16 >> 2] = 1; HEAP32[$3 + 20 >> 2] = 0; } } function $1571($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $1_1 = $266($0_1, 128); if ($1_1) { block3 : { block2 : { if (!HEAP32[$1_1 + 4 >> 2]) { HEAP32[$1_1 >> 2] = $0_1; HEAP16[$1_1 + 24 >> 1] = 1; HEAP32[$1_1 + 16 >> 2] = 0; HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = 100; HEAP32[$1_1 + 12 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $1_1 + 26; $3 = 123; break block2; } $3 = 44; if (!HEAP32[$1_1 + 20 >> 2] & HEAPU32[$1_1 + 16 >> 2] < 2) { break block3 } } $1535($1_1, $3); } HEAP32[$1_1 >> 2] = $0_1; $0_1 = $53(HEAP32[$2_1 >> 2]); $1557($1_1, $0_1, $48($0_1)); $1535($1_1, 58); $1537($1_1, HEAP32[$2_1 + 4 >> 2]); } } function $1572($0_1) { $0_1 = $0_1 | 0; $1573($0_1, 1); } function $1573($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block4 : { $2_1 = $266($0_1, 0); block6 : { if ($2_1) { $1535($2_1, 125); HEAP32[$2_1 >> 2] = $0_1; if (HEAPU8[$2_1 + 25 | 0]) { $1538($2_1, 0, 0); return; } if (HEAPU8[HEAP32[$0_1 + 4 >> 2] + 8 | 0] & 8) { $1601($2_1); if ($1_1) { if (HEAPU8[$2_1 + 24 | 0]) { break block4 } $249(HEAP32[$2_1 + 4 >> 2]); return; } if (HEAPU8[$2_1 + 25 | 0]) { break block4 } $0_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $1_1 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $0_1 = ($1_1 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; HEAP32[$2_1 + 16 >> 2] = $1_1; HEAP32[$2_1 + 20 >> 2] = $0_1; return; } $3 = HEAP32[$2_1 + 16 >> 2]; $4_1 = HEAP32[$2_1 + 4 >> 2]; if ($1_1) { $246($0_1, $4_1, $3, HEAPU8[$2_1 + 24 | 0] ? -1 : 9); HEAP8[$2_1 + 24 | 0] = 1; break block6; } $246($0_1, $4_1, $3, -1); if (HEAPU8[$2_1 + 25 | 0]) { break block6 } $1_1 = HEAP32[$2_1 + 20 >> 2] - 1 | 0; $3 = HEAP32[$2_1 + 16 >> 2] - 1 | 0; $1_1 = ($3 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $1_1; break block6; } $246($0_1, 1031, 2, 0); } $0_1 = HEAP32[$0_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; } } function $1574($0_1) { $0_1 = $0_1 | 0; $1573($0_1, 0); } function $1575($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block7 : { block : { $6_1 = HEAP32[$0_1 + 4 >> 2]; if ($6_1 >>> 0 < $1_1 >>> 0) { break block } $9_1 = HEAP32[$0_1 >> 2]; $4_1 = $9_1 + $1_1 | 0; $5_1 = HEAPU8[$4_1 | 0]; $3 = $5_1 >>> 4 | 0; $8_1 = 1; block2 : { if ($5_1 >>> 0 <= 191) { break block2 } block6 : { switch ($3 - 12 | 0) { case 0: $5_1 = 0; $3 = $1_1 + 1 | 0; if ($3 >>> 0 >= $6_1 >>> 0) { break block7 } $3 = HEAPU8[$3 + $9_1 | 0]; $8_1 = 2; break block2; case 1: $5_1 = 0; $3 = $1_1 + 2 | 0; if ($3 >>> 0 >= $6_1 >>> 0) { break block7 } $3 = HEAPU8[$3 + $9_1 | 0] | HEAPU8[$4_1 + 1 | 0] << 8; $8_1 = 3; break block2; case 2: $5_1 = 0; $3 = $1_1 + 4 | 0; if ($3 >>> 0 >= $6_1 >>> 0) { break block7 } $3 = HEAPU8[$3 + $9_1 | 0] | (HEAPU8[$4_1 + 2 | 0] << 16 | HEAPU8[$4_1 + 1 | 0] << 24 | HEAPU8[$4_1 + 3 | 0] << 8); $8_1 = 5; break block2; default: break block6; }; } $3 = $1_1 + 8 | 0; if (HEAPU8[$4_1 + 1 | 0] | $3 >>> 0 >= $6_1 >>> 0 | (HEAPU8[$4_1 + 2 | 0] | HEAPU8[$4_1 + 3 | 0])) { break block } $5_1 = 0; if (HEAPU8[$4_1 + 4 | 0]) { break block7 } $3 = HEAPU8[$3 + $9_1 | 0] | (HEAPU8[$4_1 + 6 | 0] << 16 | HEAPU8[$4_1 + 5 | 0] << 24 | HEAPU8[$4_1 + 7 | 0] << 8); $8_1 = 9; } $5_1 = $8_1; $4_1 = $1_1 + $3 | 0; $1_1 = $4_1 >>> 0 < $1_1 >>> 0 ? 1 : $7_1; $7_1 = $4_1 + $5_1 | 0; $1_1 = $7_1 >>> 0 < $5_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; if (!(!$1_1 & $7_1 >>> 0 > $6_1 >>> 0 | ($1_1 | 0) != 0)) { $7_1 = $3; break block7; } $0_1 = !$1_1 & $6_1 - HEAP32[$0_1 + 40 >> 2] >>> 0 < $7_1 >>> 0 | ($1_1 | 0) != 0; $5_1 = $0_1 ? 0 : $5_1; $7_1 = $0_1 ? 0 : $3; break block7; } $5_1 = 0; } HEAP32[$2_1 >> 2] = $7_1; return $5_1; } function $1576($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = 0; block : { if (HEAPU8[$0_1 + 35 | 0]) { break block } $2_1 = 1; if (HEAP32[$0_1 + 8 >> 2]) { break block } $3 = HEAP32[$0_1 >> 2]; HEAP32[$0_1 >> 2] = 0; $2_1 = 0; if ($1583($0_1, HEAP32[$0_1 + 4 >> 2] + $1_1 | 0)) { break block } $1_1 = HEAP32[$0_1 + 4 >> 2]; if ($1_1) { wasm2js_memory_copy(HEAP32[$0_1 >> 2], $3, $1_1) } $2_1 = 1; } return $2_1; } function $1577($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = $268($0_1); block1 : { if (!$3) { $6_1 = 7; $2_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; $3 = $270($2_1, 24, 0); if (!$3) { break block1 } HEAP32[$3 >> 2] = $2_1; $5_1 = HEAP32[$0_1 + 12 >> 2]; $4_1 = $5_1 + 236 | 0; $2_1 = $4_1; __inlined_func$269$142 : { block3 : { block4 : { block2 : { while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { if (HEAP32[$2_1 + 4 >> 2] == -429938) { break block2 } $2_1 = $2_1 + 16 | 0; continue; } break; }; $2_1 = $270(HEAP32[$5_1 >> 2], 20, 0); if (!$2_1) { break block3 } $5_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 4 >> 2] = -429938; HEAP32[$2_1 >> 2] = $5_1; HEAP32[$2_1 + 16 >> 2] = HEAP32[$4_1 >> 2]; HEAP32[$4_1 >> 2] = $2_1; if (HEAP32[$0_1 + 20 >> 2]) { break block4 } HEAP32[$0_1 + 20 >> 2] = -1; break block4; } $4_1 = HEAP32[$2_1 + 12 >> 2]; if (!$4_1) { break block4 } FUNCTION_TABLE[$4_1 | 0](HEAP32[$2_1 + 8 >> 2]); } HEAP32[$2_1 + 12 >> 2] = 101; HEAP32[$2_1 + 8 >> 2] = $3; break __inlined_func$269$142; } FUNCTION_TABLE[101]($3); } $3 = $268($0_1); if (!$3) { break block1 } } $0_1 = HEAP32[$3 + 4 >> 2]; if (($0_1 | 0) >= 4) { $1533(HEAP32[$3 + 8 >> 2]); $0_1 = HEAP32[$3 + 16 >> 2]; HEAP32[$3 + 8 >> 2] = HEAP32[$3 + 12 >> 2]; HEAP32[$3 + 12 >> 2] = $0_1; HEAP32[$3 + 16 >> 2] = HEAP32[$3 + 20 >> 2]; $0_1 = 3; } HEAP16[$1_1 + 38 >> 1] = 1; HEAP32[$1_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2] + 1; HEAP32[(($0_1 << 2) + $3 | 0) + 8 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $0_1 + 1; $6_1 = 0; } return $6_1; } function $1578($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block2 : { if (($2_1 | 0) != ($4_1 | 0)) { $5_1 = $4_1 - $2_1 | 0; $9_1 = $5_1; $6_1 = 0 - ($2_1 >>> 0 > $4_1 >>> 0) | 0; $7_1 = HEAP32[$0_1 + 8 >> 2]; $8_1 = HEAP32[$0_1 + 4 >> 2]; $5_1 = $5_1 + $8_1 | 0; $6_1 = $8_1 >>> 0 > $5_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; if (($6_1 | 0) < 0) { $7_1 = 1 } else { $7_1 = ($6_1 | 0) <= 0 & $5_1 >>> 0 <= $7_1 >>> 0 } if (!$7_1) { $1583($0_1, $5_1); if (HEAPU8[$0_1 + 35 | 0]) { break block2 } $8_1 = HEAP32[$0_1 + 4 >> 2]; } $2_1 = $1_1 + $2_1 | 0; $5_1 = $8_1 - $2_1 | 0; if ($5_1) { $6_1 = HEAP32[$0_1 >> 2]; wasm2js_memory_copy(($6_1 + $1_1 | 0) + $4_1 | 0, $2_1 + $6_1 | 0, $5_1); } HEAP32[$0_1 + 4 >> 2] = $9_1 + HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 40 >> 2] = $9_1 + HEAP32[$0_1 + 40 >> 2]; } if (!$3 | !$4_1) { break block2 } wasm2js_memory_copy(HEAP32[$0_1 >> 2] + $1_1 | 0, $3, $4_1); } } function $1579($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0; block1 : { if (!(!$2_1 | !$5_1)) { $2_1 = 0; if (($1_1 | 0) != ($4_1 | 0)) { break block1 } return !$2014($0_1, $3, $1_1); } $7_1 = global$0 - 16 | 0; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; block11 : { while (1) { block10 : { if (!$1_1) { $1_1 = 0; HEAP32[$7_1 + 12 >> 2] = 0; break block10; } $6_1 = HEAPU8[$0_1 | 0]; if (!(!$2_1 & ($6_1 | 0) == 92)) { HEAP32[$7_1 + 12 >> 2] = $6_1; if ($6_1 >>> 0 >= 192) { $6_1 = $1595($0_1, $1_1, $7_1 + 12 | 0); $1_1 = $1_1 - $6_1 | 0; $0_1 = $0_1 + $6_1 | 0; break block10; } $1_1 = $1_1 - 1 | 0; $0_1 = $0_1 + 1 | 0; break block10; } $6_1 = $1596($0_1, $1_1, $7_1 + 12 | 0); $1_1 = $1_1 - $6_1 | 0; $0_1 = $0_1 + $6_1 | 0; } block6 : { if (!$4_1) { $4_1 = 0; HEAP32[$7_1 + 8 >> 2] = 0; break block6; } $6_1 = HEAPU8[$3 | 0]; if (!(!$5_1 & ($6_1 | 0) == 92)) { HEAP32[$7_1 + 8 >> 2] = $6_1; if ($6_1 >>> 0 >= 192) { $6_1 = $1595($3, $4_1, $7_1 + 8 | 0); $4_1 = $4_1 - $6_1 | 0; $3 = $3 + $6_1 | 0; break block6; } $4_1 = $4_1 - 1 | 0; $3 = $3 + 1 | 0; break block6; } $6_1 = $1596($3, $4_1, $7_1 + 8 | 0); $4_1 = $4_1 - $6_1 | 0; $3 = $3 + $6_1 | 0; } $6_1 = HEAP32[$7_1 + 12 >> 2]; $8_1 = 0; if (($6_1 | 0) != HEAP32[$7_1 + 8 >> 2]) { break block11 } if ($6_1) { continue } break; }; $8_1 = 1; } $1_1 = $8_1; $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $2_1 = $1_1; } return $2_1; } function $1580($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = HEAP32[$0_1 + 4 >> 2]; if (HEAPU32[$0_1 + 8 >> 2] < ($4_1 + $2_1 | 0) + 9 >>> 0) { if (!$1583($0_1, (HEAP32[$0_1 + 4 >> 2] + $2_1 | 0) + 9 | 0)) { $1580($0_1, $1_1, $2_1, $3) } return; } $4_1 = $4_1 + HEAP32[$0_1 >> 2] | 0; block2 : { if ($2_1 >>> 0 <= 11) { HEAP8[$4_1 | 0] = $2_1 << 4 | $1_1; $1_1 = 1; break block2; } if ($2_1 >>> 0 <= 255) { HEAP8[$4_1 + 1 | 0] = $2_1; HEAP8[$4_1 | 0] = $1_1 | 192; $1_1 = 2; break block2; } if ($2_1 >>> 0 <= 65535) { HEAP8[$4_1 + 2 | 0] = $2_1; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$4_1 | 0] = $1_1 | 208; $1_1 = 3; break block2; } HEAP8[$4_1 + 4 | 0] = $2_1; HEAP8[$4_1 + 3 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 24; HEAP8[$4_1 | 0] = $1_1 | 224; $1_1 = 5; } $1_1 = $1_1 + HEAP32[$0_1 + 4 >> 2] | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; block5 : { if (!$3) { break block5 } HEAP32[$0_1 + 4 >> 2] = $1_1 + $2_1; if (!$2_1) { break block5 } wasm2js_memory_copy($1_1 + HEAP32[$0_1 >> 2] | 0, $3, $2_1); } } function $1581($0_1, $1_1, $2_1) { wasm2js_memory_fill($1_1, 0, 56); HEAP32[$1_1 + 16 >> 2] = HEAP32[$0_1 + 16 >> 2]; if (!HEAPU8[$2_1 | 0]) { HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 52 >> 2]; HEAP32[$1_1 + 4 >> 2] = HEAP32[$0_1 + 44 >> 2]; return 0; } HEAP32[$1_1 + 4 >> 2] = 1; HEAP32[$1_1 >> 2] = (HEAPU8[$2_1 | 0] == 46) + 53504; HEAP8[$1_1 + 39 | 0] = HEAPU8[$0_1 + 39 | 0]; HEAP32[$1_1 + 44 >> 2] = HEAP32[$0_1 + 44 >> 2]; HEAP32[$1_1 + 52 >> 2] = HEAP32[$0_1 + 52 >> 2]; $2_1 = $1530($1_1, 0, $2_1, 0); HEAP8[$0_1 + 35 | 0] = HEAPU8[$0_1 + 35 | 0] | HEAPU8[$1_1 + 35 | 0]; return $2_1; } function $1582($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 8 >> 2]; $1575($0_1, $1_1, $2_1 + 12 | 0); HEAP32[$0_1 + 4 >> 2] = $3; HEAP32[$0_1 + 40 >> 2] = $1591($0_1, $1_1, HEAP32[$2_1 + 12 >> 2] + HEAP32[$0_1 + 40 >> 2] | 0) + HEAP32[$0_1 + 40 >> 2]; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1583($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = $2_1 ? $2_1 << 1 : 100; $1_1 = $1_1 >>> 0 > $2_1 >>> 0 ? $1_1 + 100 | 0 : $2_1; $2_1 = $55(HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 >> 2], $1_1, 0); if (!$2_1) { HEAP8[$0_1 + 35 | 0] = 1; return 1; } HEAP32[$0_1 + 8 >> 2] = $1_1; HEAP32[$0_1 >> 2] = $2_1; return 0; } function $1584($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $10_1 = global$0 - 16 | 0; $2_1 = $10_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $6_1 = HEAP32[$0_1 + 12 >> 2]; block : { block83 : { block31 : { block42 : { block1 : { while (1) { block58 : { block3 : { block52 : { block55 : { block46 : { block13 : { block19 : { block36 : { block33 : { block40 : { block9 : { block8 : { block6 : { block7 : { block10 : { block2 : { block12 : { block4 : { block5 : { block11 : { $7_1 = $1_1 + $6_1 | 0; $2_1 = HEAPU8[$7_1 | 0]; switch ($2_1 | 0) { case 0: break block; case 1: case 2: case 3: case 4: case 5: case 6: case 7: case 8: case 14: case 15: case 16: case 17: case 18: case 19: case 20: case 21: case 22: case 23: case 24: case 25: case 26: case 27: case 28: case 29: case 30: case 31: case 33: case 35: case 36: case 37: case 38: case 40: case 41: case 42: break block1; case 58: break block10; case 9: case 10: case 13: case 32: break block2; case 11: case 12: case 47: break block3; case 34: break block4; case 39: break block5; case 43: break block6; case 44: break block7; case 45: case 48: case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: break block8; case 46: break block9; default: break block11; }; } $3 = $2_1 - 225 | 0; if ($3 >>> 0 <= 14) { break block12 } break block13; } HEAP8[$0_1 + 37 | 0] = 1; $2_1 = HEAPU8[$7_1 | 0]; } $8_1 = $2_1 & 255; $9_1 = $1_1 + 1 | 0; $2_1 = $9_1; $5_1 = 7; while (1) { block15 : { $3 = HEAPU8[$2_1 + $6_1 | 0]; if (!HEAPU8[$3 + 52912 | 0]) { $4_1 = $2_1; break block15; } $4_1 = $2_1 + 1 | 0; $3 = HEAPU8[$4_1 + $6_1 | 0]; if (!HEAPU8[$3 + 52912 | 0]) { break block15 } $4_1 = $2_1 + 2 | 0; $3 = HEAPU8[$4_1 + $6_1 | 0]; if (!HEAPU8[$3 + 52912 | 0]) { break block15 } $2_1 = $2_1 + 3 | 0; continue; } if (($3 | 0) != ($8_1 | 0)) { block28 : { if (($3 | 0) == 92) { $7_1 = $4_1 + $6_1 | 0; block24 : { block21 : { block22 : { block18 : { block20 : { block23 : { $2_1 = $4_1 + 1 | 0; $3 = HEAPU8[$2_1 + $6_1 | 0]; switch ($3 - 110 | 0) { case 0: case 4: case 6: break block18; case 1: case 2: case 3: case 5: case 9: break block19; case 7: break block20; case 8: break block21; case 10: break block22; default: break block23; }; } block25 : { switch ($3 - 10 | 0) { case 1: case 2: break block19; case 0: break block21; case 3: break block24; default: break block25; }; } block26 : { switch ($3 - 47 | 0) { case 0: break block18; case 1: break block21; default: break block26; }; } block27 : { switch ($3 - 98 | 0) { case 0: case 4: break block18; case 1: case 2: case 3: break block19; default: break block27; }; } if (($3 | 0) == 34) { break block18 } if (($3 | 0) == 39) { break block21 } if (($3 | 0) == 92) { break block18 } if (($3 | 0) != 226 | HEAPU8[$7_1 + 2 | 0] != 128) { break block19 } if ((HEAPU8[$7_1 + 3 | 0] & 254) == 168) { break block21 } break block19; } if (!$1587($7_1 + 2 | 0)) { break block19 } } $5_1 = ($5_1 & 255) == 7 ? 8 : $5_1; break block28; } if (!$1588($7_1 + 2 | 0)) { break block19 } } HEAP8[$0_1 + 37 | 0] = 1; $5_1 = 9; break block28; } $3 = $4_1 + 2 | 0; $4_1 = HEAPU8[$3 + $6_1 | 0]; HEAP8[$0_1 + 37 | 0] = 1; $2_1 = ($4_1 | 0) == 10 ? $3 : $2_1; $5_1 = 9; break block28; } block32 : { if ($3 << 24 >> 24 <= 31) { if (!$3) { HEAP32[$0_1 + 28 >> 2] = $4_1; break block31; } HEAP8[$0_1 + 37 | 0] = 1; $5_1 = 9; break block32; } $5_1 = ($3 | 0) == 34 ? 9 : $5_1; } $2_1 = $4_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; $1580($0_1, $5_1 & 255, ($1_1 ^ -1) + $4_1 | 0, $6_1 + $9_1 | 0); $2_1 = $4_1 + 1 | 0; break block; } if (!(1 << $3 & 16391)) { break block13 } break block3; } $1_1 = ($2086($7_1 + 1 | 0, 52896) + $1_1 | 0) + 1 | 0; continue; } HEAP32[$0_1 + 28 >> 2] = $1_1; $2_1 = -5; break block; } HEAP32[$0_1 + 28 >> 2] = $1_1; $2_1 = -4; break block; } HEAP8[$0_1 + 37 | 0] = 1; $2_1 = HEAPU8[$7_1 | 0]; } if ($2_1 << 24 >> 24 > 48) { break block33 } $5_1 = $1_1 + 1 | 0; $8_1 = $5_1 + $6_1 | 0; $3 = HEAPU8[$8_1 | 0]; block37 : { if (($2_1 & 255) == 48) { if (!(!(HEAPU8[HEAPU8[$7_1 + 2 | 0] + 31424 | 0] & 8) | ($3 | 32) != 120)) { $4_1 = 1; HEAP8[$0_1 + 37 | 0] = 1; $3 = $1_1 + 3 | 0; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; if (HEAPU8[HEAPU8[$2_1 + $6_1 | 0] + 31424 | 0] & 8) { continue } break; }; break block36; } if ($3 - 58 >>> 0 < 4294967286) { break block33 } break block37; } if ($3 - 58 >>> 0 <= 4294967285) { $4_1 = 1; if (($3 | 0) == 46) { break block40 } if (($3 | 0) != 105 & ($3 | 0) != 73) { break block42 } if ($68($8_1, 12763, 3)) { break block42 } HEAP8[$0_1 + 37 | 0] = 1; block44 : { if (HEAPU8[$7_1 | 0] == 45) { $1580($0_1, 5, 6, 23229); break block44; } $1580($0_1, 5, 5, 23230); } $2_1 = ($68($7_1 + 4 | 0, 1077, 5) ? 4 : 9) + $1_1 | 0; break block; } if (($3 | 0) != 48) { break block33 } $2_1 = HEAPU8[$7_1 + 2 | 0]; if ($2_1 - 58 >>> 0 >= 4294967286) { break block37 } if (!(HEAPU8[HEAPU8[$7_1 + 3 | 0] + 31424 | 0] & 8) | ($2_1 | 32) != 120) { break block33 } $4_1 = 1; HEAP8[$0_1 + 37 | 0] = 1; $3 = $1_1 + 4 | 0; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; if (HEAPU8[HEAPU8[$2_1 + $6_1 | 0] + 31424 | 0] & 8) { continue } break; }; break block36; } HEAP32[$0_1 + 28 >> 2] = $5_1; break block31; } if (HEAPU8[$7_1 + 1 | 0] - 58 >>> 0 <= 4294967285) { break block42 } $4_1 = 3; } HEAP8[$0_1 + 37 | 0] = 1; } $2_1 = $1_1; $8_1 = 1; while (1) { $5_1 = $4_1 | 2; while (1) { $3 = $2_1; $2_1 = $2_1 + 1 | 0; $9_1 = HEAPU8[$2_1 + $6_1 | 0]; if ($9_1 - 58 >>> 0 > 4294967285) { continue } if (($9_1 | 0) == 46) { $3 = $4_1 & 2; $4_1 = $5_1; if (!$3) { continue } break block46; } break; }; $11_1 = $3 + $6_1 | 0; $5_1 = HEAP8[$11_1 | 0]; if (($9_1 & 223) == 69) { if (($5_1 | 0) <= 47) { if (($5_1 | 0) != 46) { break block46 } $5_1 = $3 - 1 | 0; if ($5_1 >>> 0 < $1_1 >>> 0 | HEAPU8[$6_1 + $5_1 | 0] - 58 >>> 0 < 4294967286) { break block46 } HEAP8[$0_1 + 37 | 0] = 1; $4_1 = $4_1 | 1; } if (!$8_1) { break block46 } block50 : { block49 : { $5_1 = $3 + 2 | 0; $3 = HEAPU8[$5_1 + $6_1 | 0]; switch ($3 - 43 | 0) { case 0: case 2: break block49; default: break block50; }; } $3 = HEAPU8[$11_1 + 3 | 0]; $2_1 = $5_1; } $4_1 = $4_1 | 2; $8_1 = 0; if (($3 - 58 & 255) >>> 0 > 245) { continue } break block46; } break; }; if (($5_1 | 0) > 47) { break block36 } if (($5_1 | 0) != 46) { break block46 } $3 = $3 - 1 | 0; if ($3 >>> 0 < $1_1 >>> 0 | HEAPU8[$3 + $6_1 | 0] - 58 >>> 0 < 4294967286) { break block46 } HEAP8[$0_1 + 37 | 0] = 1; $4_1 = $4_1 | 1; } $3 = $0_1; $0_1 = (HEAPU8[$7_1 | 0] == 43) + $1_1 | 0; $1580($3, $4_1 + 3 & 255, $2_1 - $0_1 | 0, $0_1 + $6_1 | 0); break block; } HEAP32[$0_1 + 28 >> 2] = $2_1; break block31; } if (($2_1 | 0) == 194) { break block3 } block57 : { block51 : { switch ($2_1 - 91 | 0) { default: block54 : { switch ($2_1 - 123 | 0) { default: if (($2_1 | 0) == 102) { break block57 } if (($2_1 | 0) == 110) { break block58 } if (($2_1 | 0) != 116) { break block1 } if ($2081($7_1, 13084, 4)) { break block42 } $2_1 = $1_1 + 4 | 0; if (HEAPU8[HEAPU8[$2_1 + $6_1 | 0] + 31424 | 0] & 6) { break block42 } $1589($0_1, 1); break block; case 1: break block1; case 0: break block54; case 2: break block55; }; } $7_1 = HEAP32[$0_1 + 4 >> 2]; $1580($0_1, 12, HEAP32[$0_1 + 20 >> 2] - $1_1 | 0, 0); $2_1 = HEAPU16[$0_1 + 32 >> 1] + 1 | 0; HEAP16[$0_1 + 32 >> 1] = $2_1; if (($2_1 & 65535) >>> 0 >= 1001) { break block42 } $8_1 = $6_1 + 2 | 0; $5_1 = HEAP32[$0_1 + 4 >> 2]; block72 : { while (1) { block75 : { $9_1 = HEAP32[$0_1 + 4 >> 2]; block61 : { block67 : { block66 : { block63 : { $1_1 = $1_1 + 1 | 0; $3 = $1584($0_1, $1_1); if (($3 | 0) <= 0) { if (($3 | 0) == -2) { $1_1 = HEAP32[$0_1 + 28 >> 2]; $4_1 = 4; if (($5_1 | 0) == HEAP32[$0_1 + 4 >> 2]) { break block61 } HEAP8[$0_1 + 37 | 0] = 1; break block61; } $2_1 = $1585($1_1 + $6_1 | 0); HEAP32[$10_1 + 12 >> 2] = 7; $1_1 = $1_1 + $2_1 | 0; $4_1 = $6_1 + $1_1 | 0; $2_1 = HEAPU8[$4_1 | 0]; if (!(HEAPU8[$2_1 + 31424 | 0] & 66)) { if (($2_1 | 0) != 92) { break block63 } if (!$1590($4_1 + 1 | 0, $10_1 + 12 | 0)) { break block63 } } $3 = $1_1; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; $11_1 = $3 + $6_1 | 0; $12_1 = HEAPU8[$11_1 | 0]; if (HEAPU8[$12_1 + 31424 | 0] & 70) { if (!$1585($11_1)) { continue } } if (($12_1 | 0) == 92) { if ($1590($2_1 + $8_1 | 0, $10_1 + 12 | 0)) { continue } } break; }; $1580($0_1, HEAPU8[$10_1 + 12 | 0], $3 - $1_1 | 0, $4_1); HEAP8[$0_1 + 37 | 0] = 1; } $2_1 = -1; if (HEAPU8[$0_1 + 35 | 0]) { break block } if ((HEAPU8[$9_1 + HEAP32[$0_1 >> 2] | 0] & 15) - 11 >>> 0 <= 4294967291) { break block42 } $1_1 = HEAPU8[$3 + $6_1 | 0]; if (($1_1 | 0) != 58) { break block66 } $3 = $3 + 1 | 0; break block67; } $4_1 = 1; if (($3 | 0) == -1) { break block61 } HEAP32[$0_1 + 28 >> 2] = $1_1; break block61; } block68 : { if (!HEAPU8[$1_1 + 53248 | 0]) { break block68 } while (1) { $1_1 = $3; $3 = $3 + 1 | 0; $2_1 = HEAPU8[$3 + $6_1 | 0]; if (HEAPU8[$2_1 + 53248 | 0]) { continue } break; }; if (($2_1 | 0) != 58) { break block68 } $3 = $1_1 + 2 | 0; break block67; } block69 : { block70 : { $2_1 = $1584($0_1, $3); switch ($2_1 + 5 | 0) { case 4: break block; case 0: break block69; default: break block70; }; } HEAP32[$0_1 + 28 >> 2] = $3; break block31; } $3 = HEAP32[$0_1 + 28 >> 2] + 1 | 0; } $1_1 = $1584($0_1, $3); if (($1_1 | 0) <= 0) { $2_1 = -1; if (($1_1 | 0) == -1) { break block } HEAP32[$0_1 + 28 >> 2] = $3; break block; } $4_1 = 6; $3 = $1_1 + $6_1 | 0; $2_1 = HEAPU8[$3 | 0]; if (($2_1 | 0) == 44) { break block61 } if (($2_1 | 0) == 125) { break block72 } if (HEAPU8[$2_1 + 53248 | 0]) { $1_1 = ($2086($3 + 1 | 0, 52896) + $1_1 | 0) + 1 | 0; $2_1 = HEAPU8[$6_1 + $1_1 | 0]; if (($2_1 | 0) == 44) { break block61 } if (($2_1 | 0) == 125) { break block72 } } block74 : { switch ($1584($0_1, $1_1) + 4 | 0) { case 0: break block74; case 2: break block75; default: break block42; }; } $1_1 = HEAP32[$0_1 + 28 >> 2]; } $2_1 = -1; switch ($4_1 - 4 | 0) { case 0: break block72; case 2: continue; default: break block; }; } break; }; $1_1 = HEAP32[$0_1 + 28 >> 2]; } $1591($0_1, $7_1, HEAP32[$0_1 + 4 >> 2] - $5_1 | 0); HEAP16[$0_1 + 32 >> 1] = HEAPU16[$0_1 + 32 >> 1] - 1; $2_1 = $1_1 + 1 | 0; break block; case 1: break block1; case 0: break block51; case 2: break block52; }; } $4_1 = HEAP32[$0_1 + 4 >> 2]; $1580($0_1, 11, HEAP32[$0_1 + 20 >> 2] - $1_1 | 0, 0); $2_1 = -1; if (HEAPU8[$0_1 + 35 | 0]) { break block } $3 = HEAP32[$0_1 + 4 >> 2]; $2_1 = HEAPU16[$0_1 + 32 >> 1] + 1 | 0; HEAP16[$0_1 + 32 >> 1] = $2_1; if (($2_1 & 65535) >>> 0 >= 1001) { break block42 } $2_1 = $1_1; block79 : { while (1) { $1_1 = $2_1 + 1 | 0; $2_1 = $1584($0_1, $1_1); if (($2_1 | 0) <= 0) { block78 : { switch ($2_1 + 3 | 0) { case 0: $2_1 = HEAP32[$0_1 + 28 >> 2]; if (($3 | 0) == HEAP32[$0_1 + 4 >> 2]) { break block79 } HEAP8[$0_1 + 37 | 0] = 1; break block79; case 2: break block; default: break block78; }; } HEAP32[$0_1 + 28 >> 2] = $1_1; break block31; } $5_1 = $2_1 + $6_1 | 0; $1_1 = HEAPU8[$5_1 | 0]; if (($1_1 | 0) == 44) { continue } if (($1_1 | 0) == 93) { break block79 } if (HEAPU8[$1_1 + 53248 | 0]) { $2_1 = ($2086($5_1 + 1 | 0, 52896) + $2_1 | 0) + 1 | 0; $1_1 = HEAPU8[$2_1 + $6_1 | 0]; if (($1_1 | 0) == 44) { continue } if (($1_1 | 0) == 93) { break block79 } } block82 : { switch ($1584($0_1, $2_1) + 4 | 0) { case 0: $2_1 = HEAP32[$0_1 + 28 >> 2]; continue; case 1: break block82; default: break block46; }; } break; }; $2_1 = HEAP32[$0_1 + 28 >> 2]; } $1591($0_1, $4_1, HEAP32[$0_1 + 4 >> 2] - $3 | 0); HEAP16[$0_1 + 32 >> 1] = HEAPU16[$0_1 + 32 >> 1] - 1; $2_1 = $2_1 + 1 | 0; break block; } if ($2081($7_1, 13617, 5)) { break block42 } $2_1 = $1_1 + 5 | 0; if (HEAPU8[HEAPU8[$2_1 + $6_1 | 0] + 31424 | 0] & 6) { break block42 } $1589($0_1, 2); break block; } HEAP32[$0_1 + 28 >> 2] = $2_1; break block31; } HEAP32[$0_1 + 28 >> 2] = $1_1; $2_1 = -2; break block; } HEAP32[$0_1 + 28 >> 2] = $1_1; $2_1 = -3; break block; } $2_1 = $1585($7_1); if (!$2_1) { break block42 } HEAP8[$0_1 + 37 | 0] = 1; $1_1 = $1_1 + $2_1 | 0; continue; } break; }; if ($2081($7_1, 11741, 4)) { break block1 } $3 = $1_1 + 4 | 0; if (!(HEAPU8[HEAPU8[$3 + $6_1 | 0] + 31424 | 0] & 6)) { break block83 } } $3 = 0; while (1) { if (($3 | 0) == 5) { break block42 } block85 : { $5_1 = ($3 << 4) + 53168 | 0; if (($2_1 | 0) != HEAPU8[$5_1 | 0] & HEAPU8[$5_1 + 1 | 0] != ($2_1 | 0)) { break block85 } $4_1 = HEAP8[$5_1 + 2 | 0]; if ($68($7_1, HEAP32[$5_1 + 8 >> 2], $4_1)) { break block85 } $4_1 = $1_1 + $4_1 | 0; if (HEAPU8[HEAPU8[$4_1 + $6_1 | 0] + 31424 | 0] & 6) { break block85 } block87 : { if (HEAPU8[$5_1 + 3 | 0] == 5) { $1580($0_1, 5, 5, 23230); break block87; } $1589($0_1, 0); } HEAP8[$0_1 + 37 | 0] = 1; $2_1 = $4_1; break block; } $3 = $3 + 1 | 0; continue; }; } HEAP32[$0_1 + 28 >> 2] = $1_1; } $2_1 = -1; break block; } $1589($0_1, 0); $2_1 = $3; } $0_1 = $10_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1585($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; while (1) { block14 : { block17 : { block8 : { block5 : { block3 : { block2 : { block1 : { block7 : { block6 : { $3 = $0_1 + $2_1 | 0; $1_1 = HEAPU8[$3 | 0]; if ($1_1 - 9 >>> 0 >= 5) { block4 : { switch ($1_1 - 225 | 0) { case 0: break block1; case 1: break block2; case 2: break block3; default: break block4; }; } if (($1_1 | 0) == 239) { break block5 } if (($1_1 | 0) == 47) { break block6 } if (($1_1 | 0) == 194) { break block7 } if (($1_1 | 0) != 32) { break block8 } } $2_1 = $2_1 + 1 | 0; continue; } $1_1 = HEAPU8[$3 + 1 | 0]; if (($1_1 | 0) != 47) { if (!HEAPU8[$3 + 2 | 0] | ($1_1 | 0) != 42) { break block8 } $4_1 = $2_1 + 3 | 0; while (1) { block12 : { $3 = $0_1 + $4_1 | 0; $1_1 = HEAPU8[$3 | 0]; block11 : { if (($1_1 | 0) != 47) { if ($1_1) { break block11 } break block8; } if (HEAPU8[$3 - 1 | 0] == 42) { break block12 } } $4_1 = $4_1 + 1 | 0; continue; } break; }; $2_1 = $4_1 + 1 | 0; continue; } $2_1 = $2_1 + 2 | 0; while (1) { $1_1 = $0_1 + $2_1 | 0; $4_1 = HEAPU8[$1_1 | 0]; block15 : { if (($4_1 | 0) != 226) { $1_1 = $2_1; block16 : { switch ($4_1 - 10 | 0) { case 0: case 3: break block14; case 1: case 2: break block15; default: break block16; }; } if ($4_1) { break block15 } break block14; } if (HEAPU8[$1_1 + 1 | 0] != 128) { break block15 } $1_1 = $2_1 + 2 | 0; $4_1 = HEAPU8[$1_1 + $0_1 | 0]; if (($4_1 & 254) == 168) { break block14 } } $2_1 = $2_1 + 1 | 0; continue; }; } if (HEAPU8[$3 + 1 | 0] != 160) { break block8 } $2_1 = $2_1 + 2 | 0; continue; } if (HEAPU8[$3 + 1 | 0] != 154 | HEAPU8[$3 + 2 | 0] != 128) { break block8 } break block17; } block19 : { switch (HEAPU8[$3 + 1 | 0] - 128 | 0) { case 0: $1_1 = HEAPU8[$3 + 2 | 0]; if ($1_1 << 24 >> 24 >= 0) { break block8 } if ($1_1 >>> 0 < 139) { break block17 } $1_1 = $1_1 - 168 | 0; if ($1_1 >>> 0 > 7) { break block8 } if (1 << $1_1 & 131) { break block17 } break block8; case 1: break block19; default: break block8; }; } if (HEAPU8[$3 + 2 | 0] == 159) { break block17 } break block8; } if (HEAPU8[$3 + 1 | 0] != 128) { break block8 } if (HEAPU8[$3 + 2 | 0] == 128) { break block17 } break block8; } if (HEAPU8[$3 + 1 | 0] != 187) { break block8 } if (HEAPU8[$3 + 2 | 0] == 191) { break block17 } } return $2_1; } $2_1 = $2_1 + 3 | 0; continue; } $2_1 = (($4_1 | 0) != 0) + $1_1 | 0; continue; }; } function $1586($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $2_1 = $0_1 + 8 | 0; while (1) { if (!(HEAP32[$0_1 + 4 >> 2] <= ($1_1 | 0))) { $1533(HEAP32[($1_1 << 2) + $2_1 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $13(HEAP32[$0_1 >> 2], $0_1); } function $1587($0_1) { if (!$1588($0_1)) { return 0 } return $1588($0_1 + 2 | 0); } function $1588($0_1) { var $1_1 = 0; if (HEAPU8[HEAPU8[$0_1 | 0] + 31424 | 0] & 8) { $1_1 = HEAPU8[HEAPU8[$0_1 + 1 | 0] + 31424 | 0] >>> 3 & 1 } return $1_1; } function $1589($0_1, $1_1) { var $2_1 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1 >>> 0 >= HEAPU32[$0_1 + 8 >> 2]) { $1583($0_1, HEAP32[$0_1 + 4 >> 2] + 1 | 0); if (!HEAPU8[$0_1 + 35 | 0]) { $2_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = $2_1 + 1; HEAP8[HEAP32[$0_1 >> 2] + $2_1 | 0] = $1_1; } return; } HEAP32[$0_1 + 4 >> 2] = $2_1 + 1; HEAP8[HEAP32[$0_1 >> 2] + $2_1 | 0] = $1_1; } function $1590($0_1, $1_1) { var $2_1 = 0; block : { if (HEAPU8[$0_1 | 0] != 117) { break block } if (!$1587($0_1 + 1 | 0)) { break block } HEAP32[$1_1 >> 2] = 8; $2_1 = 1; } return $2_1; } function $1591($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block : { if (HEAPU8[$0_1 + 35 | 0]) { break block } $7_1 = HEAP32[$0_1 >> 2]; $4_1 = $7_1 + $1_1 | 0; $3 = HEAPU8[$4_1 | 0]; $6_1 = $3 >>> 4 | 0; $5_1 = $3 >>> 0 >= 192 ? (($6_1 | 0) == 12 ? -1 : ($6_1 | 0) == 13 ? -2 : -4) : 0; $6_1 = 0; $3 = 0; block1 : { if ($2_1 >>> 0 < 12) { break block1 } if ($2_1 >>> 0 < 256) { $9_1 = 1; $3 = 1; break block1; } $6_1 = $2_1 >>> 0 < 65536; $3 = $6_1 ? 2 : 4; } $3 = $3 + $5_1 | 0; if ($3) { $5_1 = HEAP32[$0_1 + 4 >> 2]; $8_1 = $3 + $5_1 | 0; block6 : { if (($3 | 0) > 0) { if (HEAPU32[$0_1 + 8 >> 2] < $8_1 >>> 0) { if ($1583($0_1, $8_1)) { break block } $7_1 = HEAP32[$0_1 >> 2]; $5_1 = HEAP32[$0_1 + 4 >> 2]; } $4_1 = $1_1 + $7_1 | 0; $1_1 = ($1_1 ^ -1) + $5_1 | 0; if (!$1_1) { break block6 } $5_1 = $4_1 + 1 | 0; wasm2js_memory_copy($5_1 + $3 | 0, $5_1, $1_1); break block6; } $1_1 = ($3 + ($1_1 ^ -1) | 0) + $5_1 | 0; if (!$1_1) { break block6 } wasm2js_memory_copy($4_1 + 1 | 0, ($4_1 - $3 | 0) + 1 | 0, $1_1); } HEAP32[$0_1 + 4 >> 2] = $8_1; } $0_1 = HEAPU8[$4_1 | 0] & 15; if ($2_1 >>> 0 <= 11) { HEAP8[$4_1 | 0] = $0_1 | $2_1 << 4; return $3; } if ($9_1) { HEAP8[$4_1 + 1 | 0] = $2_1; HEAP8[$4_1 | 0] = $0_1 | 192; return $3; } if ($6_1) { HEAP8[$4_1 + 2 | 0] = $2_1; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 8; HEAP8[$4_1 | 0] = $0_1 | 208; return $3; } HEAP8[$4_1 + 4 | 0] = $2_1; HEAP8[$4_1 + 3 | 0] = $2_1 >>> 8; HEAP8[$4_1 + 2 | 0] = $2_1 >>> 16; HEAP8[$4_1 + 1 | 0] = $2_1 >>> 24; HEAP8[$4_1 | 0] = $0_1 | 224; return $3; } return 0; } function $1595($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = 1; $3 = HEAPU8[$0_1 | 0]; block : { if ($3 >>> 0 < 192) { break block } $1_1 = ($1_1 | 0) >= 4 ? 4 : $1_1; $4_1 = ($1_1 | 0) <= 1 ? 1 : $1_1; $3 = HEAPU8[$3 + 33456 | 0]; $1_1 = 1; while (1) { if (($1_1 | 0) == ($4_1 | 0)) { break block } $5_1 = HEAPU8[$0_1 + $1_1 | 0]; if (($5_1 & 192) != 128) { $4_1 = $1_1 } else { $3 = $5_1 & 63 | $3 << 6; $1_1 = $1_1 + 1 | 0; continue; } break; }; } HEAP32[$2_1 >> 2] = $3; return $4_1; } function $1596($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; block1 : { block18 : { block3 : { while (1) { if ($1_1 >>> 0 <= 1) { HEAP32[$2_1 >> 2] = 629145; break block1; } block2 : { block4 : { $3 = HEAPU8[$0_1 + 1 | 0]; switch ($3 - 10 | 0) { case 0: case 3: break block2; case 1: case 2: break block3; default: break block4; }; } if (($3 | 0) == 226) { break block2 } block10 : { block13 : { block9 : { block7 : { block6 : { block5 : { block16 : { block15 : { block8 : { switch ($3 - 110 | 0) { default: block12 : { block14 : { switch ($3 - 47 | 0) { case 0: break block12; case 1: break block13; default: break block14; }; } block17 : { switch ($3 - 98 | 0) { case 0: break block15; case 4: break block16; case 1: case 2: case 3: break block3; default: break block17; }; } if (($3 | 0) == 34 | ($3 | 0) == 39) { break block12 } if (($3 | 0) != 92) { break block3 } } HEAP32[$2_1 >> 2] = $3; break block18; case 10: break block10; case 1: case 2: case 3: case 5: case 9: break block3; case 0: break block5; case 4: break block6; case 6: break block7; case 7: break block8; case 8: break block9; }; } if ($1_1 >>> 0 <= 5) { HEAP32[$2_1 >> 2] = 629145; break block1; } block20 : { $3 = $1597($0_1 + 2 | 0); if (($3 & 64512) != 55296 | $1_1 >>> 0 < 12 | (HEAPU8[$0_1 + 6 | 0] != 92 | HEAPU8[$0_1 + 7 | 0] != 117)) { break block20 } $0_1 = $1597($0_1 + 8 | 0); if (($0_1 & 64512) != 56320) { break block20 } HEAP32[$2_1 >> 2] = ($3 << 10 & 1047552 | $0_1 & 1023) + 65536; $1_1 = 12; break block1; } HEAP32[$2_1 >> 2] = $3; $1_1 = 6; break block1; } HEAP32[$2_1 >> 2] = 8; break block18; } HEAP32[$2_1 >> 2] = 12; break block18; } HEAP32[$2_1 >> 2] = 10; break block18; } HEAP32[$2_1 >> 2] = 13; break block18; } HEAP32[$2_1 >> 2] = 9; break block18; } HEAP32[$2_1 >> 2] = 11; break block18; } HEAP32[$2_1 >> 2] = 0; break block18; } if ($1_1 >>> 0 <= 3) { HEAP32[$2_1 >> 2] = 629145; break block1; } $1_1 = 4; $4_1 = $2_1; $2_1 = HEAPU8[$0_1 + 3 | 0]; $0_1 = HEAPU8[$0_1 + 2 | 0]; HEAP32[$4_1 >> 2] = (($2_1 << 1 << 24 >> 24 >>> 7 & 9) + $2_1 & 15 | ($0_1 << 1 << 24 >> 24 >>> 7 & 9) + $0_1 << 4) & 255; break block1; } $3 = 0; while (1) { block22 : { $4_1 = $3; $3 = $3 + 1 | 0; if ($3 >>> 0 >= $1_1 >>> 0) { break block22 } $5_1 = $0_1 + $4_1 | 0; if (HEAPU8[$5_1 | 0] != 92) { break block22 } block25 : { block24 : { block23 : { $3 = HEAPU8[$0_1 + $3 | 0]; switch ($3 - 10 | 0) { case 1: case 2: break block22; case 0: break block23; case 3: break block24; default: break block25; }; } $3 = $4_1 + 2 | 0; continue; } $3 = $4_1 + 2 | 0; if ($3 >>> 0 >= $1_1 >>> 0) { continue } $3 = HEAPU8[$0_1 + $3 | 0] == 10 ? $4_1 + 3 | 0 : $3; continue; } if (($3 | 0) != 226) { break block22 } $3 = $4_1 + 3 | 0; if (HEAPU8[$5_1 + 2 | 0] != 128 | $3 >>> 0 >= $1_1 >>> 0 | (HEAPU8[$0_1 + $3 | 0] & 254) != 168) { break block22 } $3 = $4_1 + 4 | 0; continue; } break; }; if (!$4_1) { HEAP32[$2_1 >> 2] = 629145; break block1; } if (($1_1 | 0) == ($4_1 | 0)) { HEAP32[$2_1 >> 2] = 0; break block1; } $1_1 = $1_1 - $4_1 | 0; $0_1 = $0_1 + $4_1 | 0; if (HEAPU8[$0_1 | 0] == 92) { $6_1 = $4_1 + $6_1 | 0; continue; } break; }; $1_1 = $1595($0_1, $1_1, $2_1) + $4_1 | 0; break block1; } HEAP32[$2_1 >> 2] = 629145; } $1_1 = 2; } return $1_1 + $6_1 | 0; } function $1597($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAPU8[$0_1 + 1 | 0]; $2_1 = (($1_1 << 1 << 24 >> 24 >>> 7 & 9) + $1_1 & 15) << 8; $1_1 = HEAPU8[$0_1 | 0]; $2_1 = $2_1 | (($1_1 << 1 << 24 >> 24 >>> 7 & 9) + $1_1 & 15) << 12; $1_1 = HEAPU8[$0_1 + 2 | 0]; $0_1 = HEAPU8[$0_1 + 3 | 0]; return $2_1 | ($1_1 << 1 << 24 >> 24 >>> 7 & 9) + $1_1 << 4 & 240 | ($0_1 << 1 << 24 >> 24 >>> 7 & 9) + $0_1 & 15; } function $1598($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = HEAP32[$1_1 + 20 >> 2] + ($0_1 >> 31) | 0; $6_1 = $4_1 + 1 | 0; $5_1 = $4_1; $4_1 = $0_1 + HEAP32[$1_1 + 16 >> 2] | 0; $5_1 = $4_1 >>> 0 < $0_1 >>> 0 ? $6_1 : $5_1; $6_1 = HEAP32[$1_1 + 12 >> 2]; block1 : { if (!(($5_1 | 0) == ($6_1 | 0) & HEAPU32[$1_1 + 8 >> 2] > $4_1 >>> 0 | $5_1 >>> 0 < $6_1 >>> 0)) { if ($1599($1_1, $0_1)) { break block1 } } HEAP32[$7_1 + 12 >> 2] = $3; $5_1 = HEAP32[$1_1 + 4 >> 2] + HEAP32[$1_1 + 16 >> 2] | 0; $4_1 = global$0 - 32 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; if (($0_1 | 0) > 0) { HEAP16[$4_1 + 28 >> 1] = 0; HEAP32[$4_1 + 20 >> 2] = 0; HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = $5_1; $35($4_1 + 8 | 0, $2_1, $3); HEAP8[HEAP32[$4_1 + 24 >> 2] + $5_1 | 0] = 0; } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $0_1 = HEAP32[$1_1 + 20 >> 2]; $2_1 = HEAP32[$1_1 + 16 >> 2]; $3 = $2_1; $2_1 = $2080($2_1 + HEAP32[$1_1 + 4 >> 2] | 0); $3 = $3 + $2_1 | 0; HEAP32[$1_1 + 16 >> 2] = $3; $0_1 = ($2_1 >> 31) + $0_1 | 0; HEAP32[$1_1 + 20 >> 2] = $2_1 >>> 0 > $3 >>> 0 ? $0_1 + 1 | 0 : $0_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1599($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; $4_1 = $2_1; $3 = HEAP32[$0_1 + 8 >> 2]; $2_1 = $2_1 << 1 | $3 >>> 31; $6_1 = $2_1; $2_1 = $4_1; $5_1 = $1_1 + $3 | 0; $2_1 = $5_1 >>> 0 < $3 >>> 0 ? $2_1 + 1 | 0 : $2_1; $5_1 = $5_1 + 10 | 0; $2_1 = $5_1 >>> 0 < 10 ? $2_1 + 1 | 0 : $2_1; $1_1 = !$4_1 & $1_1 >>> 0 < $3 >>> 0 | ($4_1 | 0) != 0; $4_1 = $1_1 ? $3 << 1 : $5_1; $2_1 = $1_1 ? $6_1 : $2_1; block6 : { block1 : { block5 : { if (HEAPU8[$0_1 + 24 | 0]) { $1_1 = 1; if (HEAPU8[$0_1 + 25 | 0]) { break block1 } $1_1 = $750($4_1, $2_1); if (!$1_1) { HEAP8[$0_1 + 25 | 0] = HEAPU8[$0_1 + 25 | 0] | 1; $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { $227($1_1) } $1550($0_1); return 7; } $3 = HEAP32[$0_1 + 16 >> 2]; if ($3) { wasm2js_memory_copy($1_1, HEAP32[$0_1 + 4 >> 2], $3) } HEAP8[$0_1 + 24 | 0] = 0; HEAP32[$0_1 + 4 >> 2] = $1_1; break block5; } $3 = HEAP32[$0_1 + 4 >> 2] - 8 | 0; $1_1 = $2_1; $6_1 = $4_1 + 9 | 0; $1_1 = $6_1 >>> 0 < 9 ? $1_1 + 1 | 0 : $1_1; $1_1 = $34($3, $6_1, $1_1); if (!$1_1) { break block6 } HEAP32[$0_1 + 4 >> 2] = $1_1 + 8; } HEAP32[$0_1 + 8 >> 2] = $4_1; HEAP32[$0_1 + 12 >> 2] = $2_1; $1_1 = 0; } return $1_1; } $24($3); HEAP8[$0_1 + 24 | 0] = 1; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 100; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = $0_1 + 26; HEAP8[$0_1 + 25 | 0] = HEAPU8[$0_1 + 25 | 0] | 1; return 7; } function $1600($0_1, $1_1) { var $2_1 = 0, $3 = 0; HEAP8[HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0] = 92; $2_1 = HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0; $3 = HEAPU8[$1_1 + 53520 | 0]; block1 : { if ($3) { HEAP8[$2_1 + 1 | 0] = $3; $3 = 2; break block1; } HEAP8[$2_1 + 1 | 0] = 117; HEAP8[(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0) + 2 | 0] = 48; HEAP8[(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0) + 3 | 0] = 48; HEAP8[(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0) + 4 | 0] = HEAPU8[($1_1 >>> 4 | 0) + 12796 | 0]; HEAP8[(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0) + 5 | 0] = HEAPU8[($1_1 & 15) + 12796 | 0]; $3 = 6; } $1_1 = $3; $2_1 = HEAP32[$0_1 + 20 >> 2]; $1_1 = HEAP32[$0_1 + 16 >> 2] + $1_1 | 0; $2_1 = $3 >>> 0 > $1_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $2_1; } function $1601($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 + -64 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; wasm2js_memory_fill($1_1 + 8 | 0, 0, 56); $1549($0_1); block2 : { if (HEAPU8[$0_1 + 25 | 0]) { $227(HEAP32[$0_1 >> 2]); break block2; } HEAP32[$1_1 + 20 >> 2] = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 + 28 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[HEAP32[HEAP32[$0_1 >> 2] >> 2] + 20 >> 2]; $1584($1_1 + 8 | 0, 0); $2_1 = HEAP32[$1_1 + 8 >> 2]; if (HEAPU8[$1_1 + 43 | 0]) { $10(HEAP32[$1_1 + 24 >> 2], $2_1); $227(HEAP32[$0_1 >> 2]); break block2; } $225(HEAP32[$0_1 >> 2], $2_1, HEAP32[$1_1 + 12 >> 2], 5); } $0_1 = $1_1 - -64 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1602($0_1, $1_1, $2_1) { var $3 = 0; if (!$1599($0_1, $2_1)) { if ($2_1) { wasm2js_memory_copy(HEAP32[$0_1 + 4 >> 2] + HEAP32[$0_1 + 16 >> 2] | 0, $1_1, $2_1) } $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $2_1; $2_1 = HEAP32[$0_1 + 16 >> 2] + $2_1 | 0; $1_1 = $3 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; } } function $1604($0_1) { var $1_1 = 0; while (1) { if (!(HEAPU32[$0_1 + 16 >> 2] <= $1_1 >>> 0)) { $1548(HEAP32[$0_1 + 4 >> 2], HEAP32[$0_1 + 8 >> 2], HEAP32[$0_1 + 12 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; } function $1605($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $2_1 = $2109($0_1 + 8 | 0); block1 : { if ($2_1) { HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $0_1 >> 31; $0_1 = $2_1 + 8 | 0; break block1; } HEAP32[$1_1 >> 2] = $0_1; $64(7, 1176, $1_1); $0_1 = 0; } $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1 | 0; } function $1606($0_1) { $0_1 = $0_1 | 0; $2111($0_1 - 8 | 0); } function $1607($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $8_1 = global$0 - 16 | 0; if ($8_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $8_1; $10_1 = $1_1 + 8 | 0; $11_1 = $0_1 - 8 | 0; __inlined_func$2112$147 : { if (!$11_1) { $3 = $2109($10_1); break __inlined_func$2112$147; } if ($10_1 >>> 0 >= 4294967232) { HEAP32[20691] = 48; $3 = 0; break __inlined_func$2112$147; } $6_1 = $10_1 >>> 0 < 11 ? 16 : $10_1 + 11 & -8; __inlined_func$2113$317 : { block2 : { block : { $3 = $11_1 - 8 | 0; $7_1 = HEAP32[20998]; if ($3 >>> 0 < $7_1 >>> 0) { break block } $9_1 = HEAP32[$3 + 4 >> 2]; $0_1 = $9_1 & 3; if (($0_1 | 0) == 1) { break block } $2_1 = $9_1 & -8; if (!$2_1) { break block } $4_1 = $2_1 + $3 | 0; $5_1 = HEAP32[$4_1 + 4 >> 2]; if (!($5_1 & 1)) { break block } if (!$0_1) { $0_1 = 0; if ($6_1 >>> 0 < 256) { break block2 } if ($6_1 + 4 >>> 0 <= $2_1 >>> 0) { $0_1 = $3; if ($2_1 - $6_1 >>> 0 <= HEAP32[21114] << 1 >>> 0) { break block2 } } $0_1 = 0; break block2; } if ($2_1 >>> 0 >= $6_1 >>> 0) { $0_1 = $2_1 - $6_1 | 0; if ($0_1 >>> 0 >= 16) { HEAP32[$3 + 4 >> 2] = $9_1 & 1 | $6_1 | 2; $2_1 = $3 + $6_1 | 0; HEAP32[$2_1 + 4 >> 2] = $0_1 | 3; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 1; $2116($2_1, $0_1); } $0_1 = $3; break __inlined_func$2113$317; } $0_1 = 0; if (($4_1 | 0) == HEAP32[21e3]) { $2_1 = $2_1 + HEAP32[20997] | 0; if ($2_1 >>> 0 <= $6_1 >>> 0) { break block2 } HEAP32[$3 + 4 >> 2] = $9_1 & 1 | $6_1 | 2; $0_1 = $3 + $6_1 | 0; $2_1 = $2_1 - $6_1 | 0; HEAP32[$0_1 + 4 >> 2] = $2_1 | 1; HEAP32[20997] = $2_1; HEAP32[21e3] = $0_1; $0_1 = $3; break __inlined_func$2113$317; } if (($4_1 | 0) == HEAP32[20999]) { $2_1 = $2_1 + HEAP32[20996] | 0; if ($2_1 >>> 0 < $6_1 >>> 0) { break block2 } $0_1 = $2_1 - $6_1 | 0; block9 : { if ($0_1 >>> 0 >= 16) { HEAP32[$3 + 4 >> 2] = $9_1 & 1 | $6_1 | 2; $5_1 = $3 + $6_1 | 0; HEAP32[$5_1 + 4 >> 2] = $0_1 | 1; $2_1 = $2_1 + $3 | 0; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] & -2; break block9; } HEAP32[$3 + 4 >> 2] = $2_1 | $9_1 & 1 | 2; $0_1 = $2_1 + $3 | 0; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 1; $5_1 = 0; $0_1 = 0; } HEAP32[20999] = $5_1; HEAP32[20996] = $0_1; $0_1 = $3; break __inlined_func$2113$317; } if ($5_1 & 2) { break block2 } $13_1 = $2_1 + ($5_1 & -8) | 0; if ($13_1 >>> 0 < $6_1 >>> 0) { break block2 } $2_1 = HEAP32[$4_1 + 12 >> 2]; block13 : { if ($5_1 >>> 0 <= 255) { $0_1 = HEAP32[$4_1 + 8 >> 2]; $14 = ($5_1 & 248) + 84016 | 0; if (($0_1 | 0) != ($14 | 0) & (HEAP32[$0_1 + 12 >> 2] != ($4_1 | 0) | $0_1 >>> 0 < $7_1 >>> 0)) { break block } if (($0_1 | 0) == ($2_1 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $5_1 >>> 3 | 0); break block13; } if ((HEAP32[$2_1 + 8 >> 2] != ($4_1 | 0) | $2_1 >>> 0 < $7_1 >>> 0) & ($2_1 | 0) != ($14 | 0)) { break block } HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $0_1; break block13; } $12_1 = HEAP32[$4_1 + 24 >> 2]; block16 : { if (($2_1 | 0) != ($4_1 | 0)) { $0_1 = HEAP32[$4_1 + 8 >> 2]; if ($0_1 >>> 0 < $7_1 >>> 0 | HEAP32[$0_1 + 12 >> 2] != ($4_1 | 0) | HEAP32[$2_1 + 8 >> 2] != ($4_1 | 0)) { break block } HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $0_1; break block16; } block19 : { $0_1 = HEAP32[$4_1 + 20 >> 2]; if ($0_1) { $5_1 = $4_1 + 20 | 0 } else { $0_1 = HEAP32[$4_1 + 16 >> 2]; if (!$0_1) { break block19 } $5_1 = $4_1 + 16 | 0; } while (1) { $14 = $5_1; $2_1 = $0_1; $5_1 = $0_1 + 20 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; if ($0_1) { continue } $5_1 = $2_1 + 16 | 0; $0_1 = HEAP32[$2_1 + 16 >> 2]; if ($0_1) { continue } break; }; if ($7_1 >>> 0 > $14 >>> 0) { break block } HEAP32[$14 >> 2] = 0; break block16; } $2_1 = 0; } if (!$12_1) { break block13 } $0_1 = HEAP32[$4_1 + 28 >> 2]; $5_1 = $0_1 << 2; block21 : { if (($4_1 | 0) == HEAP32[$5_1 + 84280 >> 2]) { HEAP32[$5_1 + 84280 >> 2] = $2_1; if ($2_1) { break block21 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $0_1); break block13; } if ($7_1 >>> 0 > $12_1 >>> 0) { break block } block23 : { if (($4_1 | 0) == HEAP32[$12_1 + 16 >> 2]) { HEAP32[$12_1 + 16 >> 2] = $2_1; break block23; } HEAP32[$12_1 + 20 >> 2] = $2_1; } if (!$2_1) { break block13 } } if ($2_1 >>> 0 < $7_1 >>> 0) { break block } HEAP32[$2_1 + 24 >> 2] = $12_1; $0_1 = HEAP32[$4_1 + 16 >> 2]; if ($0_1) { if ($0_1 >>> 0 < $7_1 >>> 0) { break block } HEAP32[$2_1 + 16 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $2_1; } $0_1 = HEAP32[$4_1 + 20 >> 2]; if (!$0_1) { break block13 } if ($0_1 >>> 0 < $7_1 >>> 0) { break block } HEAP32[$2_1 + 20 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $2_1; } $0_1 = $13_1 - $6_1 | 0; if ($0_1 >>> 0 <= 15) { HEAP32[$3 + 4 >> 2] = $9_1 & 1 | $13_1 | 2; $0_1 = $3 + $13_1 | 0; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 1; $0_1 = $3; break __inlined_func$2113$317; } HEAP32[$3 + 4 >> 2] = $9_1 & 1 | $6_1 | 2; $2_1 = $3 + $6_1 | 0; HEAP32[$2_1 + 4 >> 2] = $0_1 | 3; $5_1 = $3 + $13_1 | 0; HEAP32[$5_1 + 4 >> 2] = HEAP32[$5_1 + 4 >> 2] | 1; $2116($2_1, $0_1); $0_1 = $3; break __inlined_func$2113$317; } $2106(); wasm2js_trap(); } } if ($0_1) { $3 = $0_1 + 8 | 0; break __inlined_func$2112$147; } $0_1 = $2109($10_1); $3 = 0; if (!$0_1) { break __inlined_func$2112$147 } $2_1 = HEAP32[$11_1 - 4 >> 2]; $2_1 = ($2_1 & 3 ? -4 : -8) + ($2_1 & -8) | 0; $2049($0_1, $11_1, $2_1 >>> 0 < $10_1 >>> 0 ? $2_1 : $10_1); $2111($11_1); $3 = $0_1; } $0_1 = $3; block1 : { if ($0_1) { HEAP32[$0_1 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1 >> 31; $1_1 = $0_1 + 8 | 0; break block1; } $0_1 = HEAP32[$11_1 >> 2]; HEAP32[$8_1 + 4 >> 2] = $1_1; HEAP32[$8_1 >> 2] = $0_1; $64(7, 5389, $8_1); $1_1 = 0; } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1608($0_1) { $0_1 = $0_1 | 0; return HEAP32[$0_1 - 8 >> 2]; } function $1609($0_1) { $0_1 = $0_1 | 0; return $0_1 + 7 & -8; } function $1610($0_1) { $0_1 = $0_1 | 0; return 0; } function $1612($0_1) { $0_1 = $0_1 | 0; wasm2js_memory_fill(82608, 0, 100); HEAP32[20665] = 1; HEAP32[20655] = 10; $0_1 = HEAP32[18932]; HEAP32[20666] = !$0_1; HEAP32[20667] = $0_1 ? 0 : HEAP32[18934]; return 0; } function $1613($0_1) { $0_1 = $0_1 | 0; wasm2js_memory_fill(82608, 0, 100); } function $1614($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = Math_imul(HEAP32[20666], 52) + 68 | 0; $4_1 = $132($3, $3 >> 31); if ($4_1) { if (HEAP32[20666]) { HEAP32[$4_1 + 80 >> 2] = 10; $3 = $4_1 + 68 | 0; } else { $3 = 82608 } if (!HEAPU16[$3 + 34 >> 1]) { HEAP16[$3 + 34 >> 1] = 1; $5_1 = $3 + 20 | 0; HEAP32[$3 + 48 >> 2] = $5_1; HEAP32[$3 + 44 >> 2] = $5_1; } HEAP32[$4_1 + 12 >> 2] = $1_1; HEAP32[$4_1 + 8 >> 2] = $0_1; HEAP32[$4_1 >> 2] = $3; HEAP32[$4_1 + 20 >> 2] = ($2_1 | 0) != 0; HEAP32[$4_1 + 16 >> 2] = ($0_1 + $1_1 | 0) + 32; $1615($4_1); block5 : { if ($2_1) { HEAP32[$4_1 + 24 >> 2] = 10; $0_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$3 + 8 >> 2] = $0_1 + 10; HEAP32[$3 + 12 >> 2] = HEAP32[$3 + 4 >> 2] - $0_1; $0_1 = $3 + 16 | 0; break block5; } $0_1 = $4_1 + 40 | 0; } HEAP32[$4_1 + 4 >> 2] = $0_1; if (HEAP32[$4_1 + 52 >> 2]) { return $4_1 | 0 } $1616($4_1); } return 0; } function $1615($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = HEAP32[$0_1 + 52 >> 2]; $1_1 = $2_1 << 1; $3 = $1_1 >>> 0 <= 256 ? 256 : $1_1; block : { if (!$2_1) { break block } $1_1 = HEAP32[20678]; if (!$1_1) { break block } FUNCTION_TABLE[$1_1 | 0](); } $4_1 = $132($3 << 2, 0); block1 : { if (!HEAP32[$0_1 + 52 >> 2]) { break block1 } $1_1 = HEAP32[20679]; if (!$1_1) { break block1 } FUNCTION_TABLE[$1_1 | 0](); } if ($4_1) { $6_1 = HEAP32[$0_1 + 56 >> 2]; $8_1 = HEAP32[$0_1 + 52 >> 2]; while (1) { if (!(($5_1 | 0) == ($8_1 | 0))) { $2_1 = HEAP32[($5_1 << 2) + $6_1 >> 2]; while (1) { if ($2_1) { $1_1 = HEAP32[$2_1 + 16 >> 2]; $7_1 = (HEAPU32[$2_1 + 8 >> 2] % ($3 >>> 0) << 2) + $4_1 | 0; HEAP32[$2_1 + 16 >> 2] = HEAP32[$7_1 >> 2]; HEAP32[$7_1 >> 2] = $2_1; $2_1 = $1_1; continue; } break; }; $5_1 = $5_1 + 1 | 0; continue; } break; }; $24($6_1); HEAP32[$0_1 + 52 >> 2] = $3; HEAP32[$0_1 + 56 >> 2] = $4_1; } } function $1616($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$0_1 + 48 >> 2]) { $1627($0_1, 0) } $2_1 = HEAP32[$1_1 + 4 >> 2] - HEAP32[$0_1 + 28 >> 2] | 0; HEAP32[$1_1 + 4 >> 2] = $2_1; $3 = HEAP32[$1_1 + 8 >> 2] - HEAP32[$0_1 + 24 >> 2] | 0; HEAP32[$1_1 + 8 >> 2] = $3; HEAP32[$1_1 + 12 >> 2] = ($2_1 - $3 | 0) + 10; $1618($0_1); $24(HEAP32[$0_1 + 64 >> 2]); $24(HEAP32[$0_1 + 56 >> 2]); $24($0_1); } function $1617($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; if (HEAP32[$0_1 + 20 >> 2]) { $2_1 = HEAP32[$0_1 + 28 >> 2]; $3 = HEAP32[$0_1 >> 2]; $4_1 = HEAP32[$3 + 4 >> 2]; $5_1 = ($2_1 - $4_1 | 0) + 2147418112 | 0; $1_1 = $1_1 >>> 0 < $5_1 >>> 0 ? $1_1 : $5_1; $2_1 = ($1_1 - $2_1 | 0) + $4_1 | 0; HEAP32[$3 + 4 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = ($2_1 - HEAP32[$3 + 8 >> 2] | 0) + 10; HEAP32[$0_1 + 32 >> 2] = (Math_imul($1_1, 9) >>> 0) / 10; HEAP32[$0_1 + 28 >> 2] = $1_1; $1618($0_1); } } function $1618($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; while (1) { block : { if (HEAPU32[$1_1 + 16 >> 2] <= HEAPU32[$1_1 + 4 >> 2]) { break block } $2_1 = HEAP32[$1_1 + 48 >> 2]; if (HEAPU16[$2_1 + 14 >> 1]) { break block } $1624($1621($2_1), 1); continue; } break; }; block1 : { if (HEAP32[$0_1 + 48 >> 2]) { break block1 } $1_1 = HEAP32[$0_1 + 64 >> 2]; if (!$1_1) { break block1 } $24($1_1); HEAP32[$0_1 + 60 >> 2] = 0; HEAP32[$0_1 + 64 >> 2] = 0; } } function $1619($0_1) { $0_1 = $0_1 | 0; return HEAP32[$0_1 + 48 >> 2]; } function $1620($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAP32[$0_1 + 56 >> 2] + (($1_1 >>> 0) % HEAPU32[$0_1 + 52 >> 2] << 2) | 0; block2 : { block : { while (1) { $4_1 = HEAP32[$4_1 >> 2]; if (!$4_1) { break block } if (($1_1 | 0) != HEAP32[$4_1 + 8 >> 2]) { $4_1 = $4_1 + 16 | 0; continue; } break; }; if (!HEAP32[$4_1 + 24 >> 2]) { break block2 } return $1621($4_1) | 0; } if (!$2_1) { return 0 } $4_1 = $0_1; $5_1 = HEAP32[$4_1 >> 2]; __inlined_func$1622$148 : { block1 : { block0 : { if (($2_1 | 0) != 1) { break block0 } $0_1 = HEAP32[$4_1 + 48 >> 2] - HEAP32[$4_1 + 44 >> 2] | 0; if ($0_1 >>> 0 >= HEAPU32[$5_1 + 12 >> 2] | $0_1 >>> 0 >= HEAPU32[$4_1 + 32 >> 2]) { break block1 } if (!$1630($4_1)) { break block0 } if ($0_1 >>> 0 > HEAPU32[$4_1 + 44 >> 2]) { break block1 } } if (HEAPU32[$4_1 + 48 >> 2] >= HEAPU32[$4_1 + 52 >> 2]) { $1615($4_1) } block17 : { block5 : { block3 : { if (!HEAP32[$4_1 + 20 >> 2]) { break block3 } $3 = HEAP32[$5_1 + 48 >> 2]; if (HEAPU16[$3 + 14 >> 1]) { break block3 } if (HEAPU32[$4_1 + 28 >> 2] > HEAP32[$4_1 + 48 >> 2] + 1 >>> 0) { if (!$1630($4_1)) { break block3 } $3 = HEAP32[$5_1 + 48 >> 2]; } $1624($3, 0); $3 = $1621($3); $0_1 = HEAP32[$3 + 20 >> 2]; if (HEAP32[$0_1 + 16 >> 2] == HEAP32[$4_1 + 16 >> 2]) { break block5 } $1629($3); } block13 : { block7 : { $3 = HEAP32[$4_1 + 60 >> 2]; block6 : { if ($3) { break block6 } if (HEAP32[$4_1 + 48 >> 2]) { break block7 } $3 = HEAP32[20667]; if (!$3 | HEAPU32[$4_1 + 28 >> 2] < 3) { break block7 } $0_1 = HEAP32[20678]; if ($0_1) { FUNCTION_TABLE[$0_1 | 0](); $3 = HEAP32[20667]; } block10 : { if (($3 | 0) > 0) { $0_1 = HEAP32[$4_1 + 16 >> 2]; $5_1 = $0_1 >> 31; $3 = __wasm_i64_mul($0_1, $5_1, $3, 0); $6_1 = i64toi32_i32$HIGH_BITS; break block10; } $5_1 = $3 >> 31 << 10 | $3 >>> 22; $0_1 = $3 << 10; $3 = 0 - $0_1 | 0; $6_1 = 0 - ($5_1 + (($0_1 | 0) != 0) | 0) | 0; $0_1 = HEAP32[$4_1 + 16 >> 2]; $5_1 = $0_1 >> 31; } $7_1 = $3; $0_1 = __wasm_i64_mul($0_1, $5_1, HEAP32[$4_1 + 28 >> 2], 0); $5_1 = $0_1; $0_1 = $0_1 >>> 0 > $3 >>> 0; $3 = i64toi32_i32$HIGH_BITS; $0_1 = $0_1 & ($3 | 0) >= ($6_1 | 0) | ($3 | 0) > ($6_1 | 0); $6_1 = $30($0_1 ? $7_1 : $5_1, $0_1 ? $6_1 : $3); HEAP32[$4_1 + 64 >> 2] = $6_1; $0_1 = HEAP32[20679]; if ($0_1) { FUNCTION_TABLE[$0_1 | 0]() } if ($6_1) { $0_1 = FUNCTION_TABLE[HEAP32[18897]]($6_1) | 0; $5_1 = HEAP32[$4_1 + 16 >> 2]; $7_1 = ($0_1 | 0) / ($5_1 | 0) | 0; $0_1 = HEAP32[$4_1 + 60 >> 2]; $2_1 = HEAP32[$4_1 + 8 >> 2]; while (1) { $3 = $2_1 + $6_1 | 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 16 >> 2] = $0_1; HEAP32[$3 + 12 >> 2] = 1; HEAP32[$3 >> 2] = $6_1; HEAP32[$3 + 4 >> 2] = $3 + 32; $6_1 = $5_1 + $6_1 | 0; $0_1 = $3; $7_1 = $7_1 - 1 | 0; if ($7_1) { continue } break; }; break block6; } $3 = HEAP32[$4_1 + 60 >> 2]; if (!$3) { break block7 } } HEAP32[$4_1 + 60 >> 2] = HEAP32[$3 + 16 >> 2]; HEAP32[$3 + 16 >> 2] = 0; break block13; } $2_1 = ($2_1 | 0) != 1; block14 : { if ($2_1) { break block14 } $0_1 = HEAP32[20678]; if (!$0_1) { break block14 } FUNCTION_TABLE[$0_1 | 0](); } $5_1 = $515(HEAP32[$4_1 + 16 >> 2]); block15 : { if ($2_1) { break block15 } $0_1 = HEAP32[20679]; if (!$0_1) { break block15 } FUNCTION_TABLE[$0_1 | 0](); } $3 = 0; if (!$5_1) { break __inlined_func$1622$148 } $3 = $5_1 + HEAP32[$4_1 + 8 >> 2] | 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $3 + 32; } $0_1 = HEAP32[$4_1 + 4 >> 2]; HEAP32[$0_1 >> 2] = HEAP32[$0_1 >> 2] + 1; break block17; } HEAP32[$5_1 + 16 >> 2] = HEAP32[$5_1 + 16 >> 2] + (HEAP32[$4_1 + 20 >> 2] - HEAP32[$0_1 + 20 >> 2] | 0); } HEAP32[$4_1 + 48 >> 2] = HEAP32[$4_1 + 48 >> 2] + 1; $0_1 = HEAP32[$4_1 + 52 >> 2]; HEAP32[$3 + 8 >> 2] = $1_1; $2_1 = ($1_1 >>> 0) % ($0_1 >>> 0) << 2; $0_1 = HEAP32[$2_1 + HEAP32[$4_1 + 56 >> 2] >> 2]; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 20 >> 2] = $4_1; HEAP32[$3 + 16 >> 2] = $0_1; HEAP32[HEAP32[$3 + 4 >> 2] >> 2] = 0; HEAP32[$2_1 + HEAP32[$4_1 + 56 >> 2] >> 2] = $3; if (HEAPU32[$4_1 + 36 >> 2] >= $1_1 >>> 0) { break block1 } HEAP32[$4_1 + 36 >> 2] = $1_1; } } $4_1 = $3; } return $4_1 | 0; } function $1621($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = HEAP32[$0_1 + 28 >> 2]; $2_1 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$1_1 + 24 >> 2] = $2_1; HEAP32[$2_1 + 28 >> 2] = $1_1; HEAP32[$0_1 + 24 >> 2] = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$1_1 + 44 >> 2] = HEAP32[$1_1 + 44 >> 2] - 1; return $0_1; } function $1623($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; block1 : { if (!$2_1) { $2_1 = HEAP32[$0_1 >> 2]; if (HEAPU32[$2_1 + 16 >> 2] <= HEAPU32[$2_1 + 4 >> 2]) { break block1 } } $1624($1_1, 1); return; } HEAP32[$1_1 + 28 >> 2] = $2_1 + 20; $3 = HEAP32[$2_1 + 44 >> 2]; HEAP32[$1_1 + 24 >> 2] = $3; HEAP32[$3 + 28 >> 2] = $1_1; HEAP32[$2_1 + 44 >> 2] = $1_1; HEAP32[$0_1 + 44 >> 2] = HEAP32[$0_1 + 44 >> 2] + 1; } function $1624($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$0_1 + 20 >> 2]; $3 = HEAP32[$2_1 + 56 >> 2] + (HEAPU32[$0_1 + 8 >> 2] % HEAPU32[$2_1 + 52 >> 2] << 2) | 0; while (1) { $5_1 = $3; $4_1 = HEAP32[$3 >> 2]; $3 = $4_1 + 16 | 0; if (($0_1 | 0) != ($4_1 | 0)) { continue } break; }; HEAP32[$5_1 >> 2] = HEAP32[$3 >> 2]; HEAP32[$2_1 + 48 >> 2] = HEAP32[$2_1 + 48 >> 2] - 1; if ($1_1) { $1629($0_1) } } function $1625($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = HEAP32[$0_1 + 56 >> 2]; $5_1 = HEAP32[$0_1 + 52 >> 2]; $2_1 = $4_1 + (($2_1 >>> 0) % ($5_1 >>> 0) << 2) | 0; while (1) { $7_1 = $2_1; $6_1 = HEAP32[$2_1 >> 2]; $2_1 = $6_1 + 16 | 0; if (($1_1 | 0) != ($6_1 | 0)) { continue } break; }; HEAP32[$7_1 >> 2] = HEAP32[$1_1 + 16 >> 2]; HEAP32[$1_1 + 8 >> 2] = $3; $2_1 = (($3 >>> 0) % ($5_1 >>> 0) << 2) + $4_1 | 0; HEAP32[$1_1 + 16 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = $1_1; if ($3 >>> 0 > HEAPU32[$0_1 + 36 >> 2]) { HEAP32[$0_1 + 36 >> 2] = $3 } } function $1626($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if ($1_1 >>> 0 <= HEAPU32[$0_1 + 36 >> 2]) { $1627($0_1, $1_1); HEAP32[$0_1 + 36 >> 2] = $1_1 - 1; } } function $1627($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = HEAP32[$0_1 + 52 >> 2]; $3 = HEAP32[$0_1 + 36 >> 2]; block1 : { if ($2_1 >>> 0 > $3 - $1_1 >>> 0) { $5_1 = ($3 >>> 0) % ($2_1 >>> 0) | 0; $3 = ($1_1 >>> 0) % ($2_1 >>> 0) | 0; break block1; } $3 = $2_1 >>> 1 | 0; $5_1 = $3 - 1 | 0; } while (1) { $4_1 = HEAP32[$0_1 + 56 >> 2] + ($3 << 2) | 0; while (1) { $2_1 = HEAP32[$4_1 >> 2]; if ($2_1) { if ($1_1 >>> 0 <= HEAPU32[$2_1 + 8 >> 2]) { HEAP32[$0_1 + 48 >> 2] = HEAP32[$0_1 + 48 >> 2] - 1; HEAP32[$4_1 >> 2] = HEAP32[$2_1 + 16 >> 2]; if (HEAP32[$2_1 + 24 >> 2]) { $1621($2_1) } $1629($2_1); continue; } else { $4_1 = $2_1 + 16 | 0; continue; } } break; }; if (($3 | 0) != ($5_1 | 0)) { $3 = ($3 + 1 >>> 0) % HEAPU32[$0_1 + 52 >> 2] | 0; continue; } break; }; } function $1628($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; if (HEAP32[$0_1 + 20 >> 2]) { $1_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = 0; $1618($0_1); HEAP32[$1_1 + 4 >> 2] = $2_1; } } function $1629($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; block1 : { if (HEAPU16[$0_1 + 12 >> 1]) { HEAP32[$0_1 + 16 >> 2] = HEAP32[$1_1 + 60 >> 2]; HEAP32[$1_1 + 60 >> 2] = $0_1; break block1; } $506(HEAP32[$0_1 >> 2]); } $0_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$0_1 >> 2] = HEAP32[$0_1 >> 2] - 1; } function $1630($0_1) { if (!(!HEAP32[20669] | HEAP32[20668] < (HEAP32[$0_1 + 12 >> 2] + HEAP32[$0_1 + 8 >> 2] | 0))) { return HEAP32[20676] } return HEAP32[20646]; } function $1631($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $1_1 = $354($0_1, 1426, 56848); block : { if ($1_1) { break block } $2_1 = $23(24); if (!$2_1) { return 7 } HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 0; HEAP16[$2_1 >> 1] = 257; $1_1 = $2_1 + 12 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$2_1 + 20 >> 2] = 0; $1_1 = 7; block2 : { if ($1632($2_1, 14131, 7, 57120)) { break block2 } if ($1632($2_1, 9337, 7, 57148)) { break block2 } if ($1632($2_1, 23897, 10, 53964)) { break block2 } $1_1 = $386($0_1, 9259, 1, 524289, $2_1, 102, 0, 0); if ($1_1) { break block2 } $1_1 = $386($0_1, 9259, 2, 524289, $2_1, 102, 0, 0); if ($1_1) { break block2 } $1_1 = $391($0_1, 3420, -1); if ($1_1) { break block2 } $1_1 = $391($0_1, 4201, 1); if ($1_1) { break block2 } $1_1 = $391($0_1, 10222, 1); if ($1_1) { break block2 } $1_1 = $391($0_1, 10222, 2); if ($1_1) { break block2 } $1_1 = $391($0_1, 12951, 1); if ($1_1) { break block2 } HEAP32[$2_1 + 20 >> 2] = HEAP32[$2_1 + 20 >> 2] + 1; $1_1 = $355($0_1, 23639, 53864, $2_1, 103); if ($1_1) { break block } HEAP32[$2_1 + 20 >> 2] = HEAP32[$2_1 + 20 >> 2] + 1; $1_1 = $355($0_1, 23510, 53864, $2_1, 103); if ($1_1) { break block } HEAP32[$2_1 + 20 >> 2] = HEAP32[$2_1 + 20 >> 2] + 1; return $355($0_1, 12938, 57572, $2_1, 103) | 0; } $1635($2_1); $24($2_1); } return $1_1 | 0; } function $1632($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block12 : { $7_1 = FUNCTION_TABLE[(HEAPU8[$0_1 | 0] == 1 ? 104 : 105) | 0]($1_1, $2_1) | 0; $5_1 = $7_1 & HEAP32[$0_1 + 12 >> 2] - 1; $4_1 = $1640($0_1, $1_1, $2_1, $5_1); block8 : { if ($4_1) { $6_1 = HEAP32[$4_1 + 8 >> 2]; if (!$3) { $1_1 = HEAP32[$4_1 >> 2]; $2_1 = HEAP32[$4_1 + 4 >> 2]; block3 : { if ($2_1) { HEAP32[$2_1 >> 2] = $1_1; break block3; } HEAP32[$0_1 + 8 >> 2] = $1_1; } if ($1_1) { HEAP32[$1_1 + 4 >> 2] = $2_1 } $2_1 = HEAP32[$0_1 + 16 >> 2] + ($5_1 << 3) | 0; if (HEAP32[$2_1 + 4 >> 2] == ($4_1 | 0)) { HEAP32[$2_1 + 4 >> 2] = $1_1 } $1_1 = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = $1_1 - 1; if (($1_1 | 0) <= 1) { HEAP32[$2_1 + 4 >> 2] = 0 } block7 : { if (!HEAPU8[$0_1 + 1 | 0]) { break block7 } $1_1 = HEAP32[$4_1 + 12 >> 2]; if (!$1_1) { break block7 } $24($1_1); } $24($4_1); $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$0_1 + 4 >> 2] = $1_1 - 1; if (($1_1 | 0) > 1) { break block8 } $1635($0_1); return $6_1; } HEAP32[$4_1 + 8 >> 2] = $3; return $6_1; } if (!$3) { break block8 } block11 : { $4_1 = HEAP32[$0_1 + 12 >> 2]; block10 : { if (!$4_1) { if ($1641($0_1, 8)) { break block10 } $4_1 = HEAP32[$0_1 + 12 >> 2]; } if (HEAP32[$0_1 + 4 >> 2] < ($4_1 | 0)) { break block11 } if (!$1641($0_1, $4_1 << 1)) { break block11 } } HEAP32[$0_1 + 4 >> 2] = 0; break block12; } $4_1 = $1642(20, 0); if (!$4_1) { break block12 } block15 : { if (!(!$1_1 | !HEAPU8[$0_1 + 1 | 0])) { $5_1 = $1642($2_1, $2_1 >> 31); HEAP32[$4_1 + 12 >> 2] = $5_1; if (!$5_1) { $24($4_1); break block12; } if (!$2_1) { break block15 } wasm2js_memory_copy($5_1, $1_1, $2_1); break block15; } HEAP32[$4_1 + 12 >> 2] = $1_1; } HEAP32[$4_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] + 1; $1643($0_1, HEAP32[$0_1 + 16 >> 2] + ((HEAP32[$0_1 + 12 >> 2] - 1 & $7_1) << 3) | 0, $4_1); HEAP32[$4_1 + 8 >> 2] = $3; } return $6_1; } return $3; } function $1633($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[HEAP32[$0_1 + 4 >> 2] + 8 >> 2]; $4_1 = $53(HEAP32[$2_1 >> 2]); $6_1 = $209(HEAP32[$2_1 >> 2]) + 1 | 0; block5 : { block4 : { if (($1_1 | 0) == 2) { $7_1 = $1722($0_1); $1_1 = HEAP32[$2_1 + 4 >> 2]; if ($7_1 | HEAPU8[$1_1 + 16 | 0] & 64) { if (!(!$4_1 | ($209($1_1) | 0) != 4)) { $1_1 = HEAP32[$206(HEAP32[$2_1 + 4 >> 2]) >> 2]; HEAP32[$3 + 12 >> 2] = $1_1; if (($1632($5_1, $4_1, $6_1, $1_1) | 0) != ($1_1 | 0)) { break block4 } $235($0_1, 1162, -1); break block4; } $235($0_1, 12430, -1); break block5; } $235($0_1, 16167, -1); break block5; } if ($4_1) { $1_1 = $1723($5_1, $4_1, $6_1); HEAP32[$3 + 12 >> 2] = $1_1; if ($1_1) { break block4 } } HEAP32[$3 >> 2] = $4_1; $1_1 = $0_1; $0_1 = $61(7850, $3); $235($1_1, $0_1, -1); $24($0_1); break block5; } if (!($1722($0_1) | HEAPU8[HEAP32[$2_1 >> 2] + 16 | 0] & 64)) { break block5 } $225($0_1, $3 + 12 | 0, 4, -1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1634($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$0_1 + 20 >> 2] = $1_1 - 1; if (($1_1 | 0) <= 1) { $1635($0_1); $24($0_1); } } function $1635($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = 0; $24(HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; while (1) { if ($1_1) { $3 = HEAP32[$1_1 >> 2]; block1 : { if (!HEAPU8[$0_1 + 1 | 0]) { break block1 } $2_1 = HEAP32[$1_1 + 12 >> 2]; if (!$2_1) { break block1 } $24($2_1); } $24($1_1); $1_1 = $3; continue; } break; }; HEAP32[$0_1 + 4 >> 2] = 0; } function $1636($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $0_1 = 0; $1_1 = HEAP32[18950]; if ($1_1) { $0_1 = FUNCTION_TABLE[$1_1 | 0](500) | 0 } return $0_1 | 0; } function $1637($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; while (1) { if (!($1_1 | $2_1 >>> 0 > 1)) { $1_1 = $2_1 << 3; $1_1 = $354($0_1, HEAP32[$1_1 + 57680 >> 2], HEAP32[$1_1 + 57684 >> 2]); $2_1 = $2_1 + 1 | 0; continue; } break; }; return $1_1 | 0; } function $1638($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; if (($1_1 | 0) <= 0) { $1_1 = $2080($0_1) } while (1) { if (!(($1_1 | 0) <= 0)) { $1_1 = $1_1 - 1 | 0; $2_1 = HEAP8[$0_1 | 0] ^ $2_1 << 3 ^ $2_1; $0_1 = $0_1 + 1 | 0; continue; } break; }; return $2_1 & 2147483647; } function $1639($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; while (1) { if (!(($1_1 | 0) <= 0)) { $1_1 = $1_1 - 1 | 0; $2_1 = HEAP8[$0_1 | 0] ^ $2_1 << 3 ^ $2_1; $0_1 = $0_1 + 1 | 0; continue; } break; }; return $2_1 & 2147483647; } function $1640($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; block : { $4_1 = HEAP32[$0_1 + 16 >> 2]; if (!$4_1) { break block } $5_1 = HEAPU8[$0_1 | 0] == 1 ? 106 : 107; $3 = ($3 << 3) + $4_1 | 0; $0_1 = $3 + 4 | 0; $3 = HEAP32[$3 >> 2]; while (1) { if (!$3) { break block } $0_1 = HEAP32[$0_1 >> 2]; if (!$0_1) { break block } $3 = $3 - 1 | 0; if (FUNCTION_TABLE[$5_1 | 0](HEAP32[$0_1 + 12 >> 2], HEAP32[$0_1 + 16 >> 2], $1_1, $2_1) | 0) { continue } break; }; return $0_1; } return 0; } function $1641($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block1 : { $3 = $1642($1_1 << 3, 0); if (!$3) { $4_1 = 1; break block1; } $24(HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 12 >> 2] = $1_1; HEAP32[$0_1 + 16 >> 2] = $3; $2_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$0_1 + 8 >> 2] = 0; $5_1 = HEAPU8[$0_1 | 0] == 1 ? 104 : 105; $6_1 = $1_1 - 1 | 0; while (1) { if (!$2_1) { break block1 } $7_1 = FUNCTION_TABLE[$5_1 | 0](HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 16 >> 2]) | 0; $1_1 = HEAP32[$2_1 >> 2]; $1643($0_1, (($6_1 & $7_1) << 3) + $3 | 0, $2_1); $2_1 = $1_1; continue; }; } return $4_1; } function $1642($0_1, $1_1) { $1_1 = $31($0_1, $1_1); if (!(!$1_1 | !$0_1)) { wasm2js_memory_fill($1_1, 0, $0_1) } return $1_1; } function $1643($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = HEAP32[$1_1 + 4 >> 2]; block3 : { if ($3) { HEAP32[$2_1 >> 2] = $3; $4_1 = HEAP32[$3 + 4 >> 2]; HEAP32[$2_1 + 4 >> 2] = $4_1; block2 : { if ($4_1) { HEAP32[$4_1 >> 2] = $2_1; break block2; } HEAP32[$0_1 + 8 >> 2] = $2_1; } HEAP32[$3 + 4 >> 2] = $2_1; break block3; } $3 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$2_1 >> 2] = $3; if ($3) { HEAP32[$3 + 4 >> 2] = $2_1 } HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = $2_1; } HEAP32[$1_1 + 4 >> 2] = $2_1; HEAP32[$1_1 >> 2] = HEAP32[$1_1 >> 2] + 1; } function $1644($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = $23(16); if (!$4_1) { return 7 } HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $3 = $4_1 + 8 | 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 1; $3 = 0; while (1) { block4 : { block7 : { if (!(($0_1 | 0) <= ($6_1 | 0) | $3)) { $3 = HEAP32[($6_1 << 2) + $1_1 >> 2]; $5_1 = $2080($3); block6 : { if (($5_1 | 0) == 19) { if (!$2014(23836, $3, 19)) { HEAP32[$4_1 + 4 >> 2] = 1; $3 = 0; break block4; } if (!$2014(24431, $3, 19)) { HEAP32[$4_1 + 4 >> 2] = 0; $3 = 0; break block4; } if ($2014(23673, $3, 19)) { break block6 } HEAP32[$4_1 + 4 >> 2] = 2; $3 = 0; break block4; } if (($5_1 | 0) < 11) { break block7 } } if (!$2014(22010, $3, 11)) { $3 = $1645($4_1, 1, $3 + 11 | 0, $5_1 - 11 | 0); break block4; } if ($2014(21998, $3, 11)) { break block7 } $3 = $1645($4_1, 0, $3 + 11 | 0, $5_1 - 11 | 0); break block4; } if ($3) { $1646($4_1); $0_1 = 0; } else { $0_1 = $4_1 } HEAP32[$2_1 >> 2] = $0_1; return $3 | 0; } $3 = 1; } $6_1 = $6_1 + 1 | 0; continue; }; } function $1645($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $7_1 = $2_1 + $3 | 0; $5_1 = $2_1; while (1) { block2 : { if ($5_1 >>> 0 < $7_1 >>> 0) { $3 = $5_1 + 1 | 0; $4_1 = HEAPU8[$5_1 | 0]; if ($4_1 >>> 0 < 192) { $5_1 = $3; break block2; } $4_1 = HEAPU8[$4_1 + 33456 | 0]; while (1) { block5 : { if ($3 >>> 0 >= $7_1 >>> 0) { $3 = $7_1 } else { $5_1 = HEAPU8[$3 | 0]; if (($5_1 & 192) == 128) { break block5 } } $5_1 = $3; $4_1 = ($4_1 & -2) == 65534 ? 65533 : $4_1 >>> 0 < 128 ? 65533 : ($4_1 & -2048) == 55296 ? 65533 : $4_1; break block2; } $4_1 = $5_1 & 63 | $4_1 << 6; $3 = $3 + 1 | 0; continue; }; } block6 : { if (!$6_1) { break block6 } $8_1 = $34(HEAP32[$0_1 + 12 >> 2], HEAP32[$0_1 + 8 >> 2] + $6_1 << 2, 0); if (!$8_1) { return 7 } $5_1 = HEAP32[$0_1 + 8 >> 2]; label2 : while (1) { block10 : { if ($2_1 >>> 0 < $7_1 >>> 0) { $3 = $2_1 + 1 | 0; $4_1 = HEAPU8[$2_1 | 0]; if ($4_1 >>> 0 < 192) { $2_1 = $3; break block10; } $4_1 = HEAPU8[$4_1 + 33456 | 0]; while (1) { block13 : { if ($3 >>> 0 >= $7_1 >>> 0) { $2_1 = $7_1 } else { $2_1 = HEAPU8[$3 | 0]; if (($2_1 & 192) == 128) { break block13 } $2_1 = $3; } $4_1 = ($4_1 & -2) == 65534 ? 65533 : $4_1 >>> 0 < 128 ? 65533 : ($4_1 & -2048) == 55296 ? 65533 : $4_1; break block10; } $4_1 = $2_1 & 63 | $4_1 << 6; $3 = $3 + 1 | 0; continue; }; } HEAP32[$0_1 + 8 >> 2] = $5_1; HEAP32[$0_1 + 12 >> 2] = $8_1; break block6; } if (($1652($4_1) | 0) == ($1_1 | 0)) { continue } if ($1651($4_1)) { continue } $3 = 0; $6_1 = ($5_1 | 0) > 0 ? $5_1 : 0; while (1) { block15 : { if (($3 | 0) != ($6_1 | 0)) { if (HEAP32[$8_1 + ($3 << 2) >> 2] < ($4_1 | 0)) { break block15 } $6_1 = $3; } $3 = $5_1; while (1) { if (!(($3 | 0) <= ($6_1 | 0))) { $9_1 = $8_1 + ($3 << 2) | 0; HEAP32[$9_1 >> 2] = HEAP32[$9_1 - 4 >> 2]; $3 = $3 - 1 | 0; continue; } break; }; HEAP32[$8_1 + ($6_1 << 2) >> 2] = $4_1; $5_1 = $5_1 + 1 | 0; continue label2; } $3 = $3 + 1 | 0; continue; }; }; } return 0; } if (($1652($4_1) | 0) == ($1_1 | 0)) { continue } $6_1 = !$1651($4_1) + $6_1 | 0; continue; }; } function $1646($0_1) { $0_1 = $0_1 | 0; if ($0_1) { $24(HEAP32[$0_1 + 12 >> 2]); $24($0_1); } return 0; } function $1647($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; $0_1 = $23(28); if (!$0_1) { return 7 } HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 0; $4_1 = $0_1 + 16 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $4_1 = $0_1 + 8 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = $1_1; block2 : { if (!$1_1) { HEAP32[$0_1 + 4 >> 2] = 30822; break block2; } if (($2_1 | 0) < 0) { HEAP32[$0_1 + 8 >> 2] = $2080($1_1); break block2; } HEAP32[$0_1 + 8 >> 2] = $2_1; } HEAP32[$3 >> 2] = $0_1; return 0; } function $1648($0_1) { $0_1 = $0_1 | 0; $24(HEAP32[$0_1 + 20 >> 2]); $24($0_1); return 0; } function $1649($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $10_1 = HEAP32[$0_1 + 4 >> 2]; $14 = $10_1 + HEAP32[$0_1 + 8 >> 2] | 0; $10_1 = $10_1 + HEAP32[$0_1 + 12 >> 2] | 0; $15_1 = HEAP32[$0_1 >> 2]; while (1) { $16_1 = $10_1; if ($10_1 >>> 0 >= $14 >>> 0) { return 101 } $10_1 = $16_1 + 1 | 0; $6_1 = HEAPU8[$16_1 | 0]; if ($6_1 >>> 0 >= 192) { $7_1 = HEAPU8[$6_1 + 33456 | 0]; while (1) { block3 : { if ($10_1 >>> 0 >= $14 >>> 0) { $10_1 = $14; break block3; } $6_1 = HEAPU8[$10_1 | 0]; if (($6_1 & 192) != 128) { break block3 } $7_1 = $6_1 & 63 | $7_1 << 6; $10_1 = $10_1 + 1 | 0; continue; } break; }; $6_1 = ($7_1 & -2) == 65534 ? 65533 : $7_1 >>> 0 < 128 ? 65533 : ($7_1 & -2048) == 55296 ? 65533 : $7_1; } if (!$1650($15_1, $6_1)) { continue } break; }; $8_1 = HEAP32[$0_1 + 20 >> 2]; $9_1 = $8_1; while (1) { $7_1 = HEAP32[$0_1 + 24 >> 2]; if (($7_1 - 4 | 0) <= ($9_1 - $8_1 | 0)) { $7_1 = $7_1 - -64 | 0; $7_1 = $34($8_1, $7_1, $7_1 >> 31); if (!$7_1) { return 7 } $8_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$0_1 + 20 >> 2] = $7_1; HEAP32[$0_1 + 24 >> 2] = HEAP32[$0_1 + 24 >> 2] - -64; $9_1 = $7_1 + ($9_1 - $8_1 | 0) | 0; } block14 : { block17 : { block9 : { block8 : { block7 : { if (($6_1 | 0) <= 127) { if ($6_1 - 65 >>> 0 >= 26) { break block7 } $6_1 = $6_1 | 32; break block8; } if ($6_1 >>> 0 > 65535) { break block9 } $17_1 = HEAP32[$15_1 + 4 >> 2]; $7_1 = 162; $11_1 = -1; $8_1 = 0; while (1) { if (!(($7_1 | 0) < ($8_1 | 0))) { $12_1 = ($7_1 + $8_1 | 0) / 2 | 0; $13_1 = HEAPU16[($12_1 << 2) + 55648 >> 1] > ($6_1 | 0); $7_1 = $13_1 ? $12_1 - 1 | 0 : $7_1; $11_1 = $13_1 ? $11_1 : $12_1; $8_1 = $13_1 ? $8_1 : $12_1 + 1 | 0; continue; } break; }; $8_1 = $11_1 << 2; $11_1 = $8_1 + 55648 | 0; $7_1 = HEAPU16[$11_1 >> 1]; block11 : { if (($7_1 + HEAPU8[$8_1 + 55651 | 0] | 0) <= ($6_1 | 0)) { break block11 } $8_1 = $6_1 ^ $7_1; $7_1 = HEAPU8[$11_1 + 2 | 0]; if ($8_1 & $7_1 & 1) { break block11 } $6_1 = HEAPU16[($7_1 & 254) + 56304 >> 1] + $6_1 & 65535; } if (!$17_1) { break block7 } $18_1 = $6_1 << 3 | 7; $7_1 = 125; $11_1 = 0; $8_1 = 0; while (1) { if (!(($7_1 | 0) < ($8_1 | 0))) { $12_1 = ($7_1 + $8_1 | 0) / 2 | 0; $13_1 = HEAPU16[($12_1 << 1) + 56464 >> 1] > $18_1 >>> 0; $8_1 = $13_1 ? $8_1 : $12_1 + 1 | 0; $7_1 = $13_1 ? $12_1 - 1 | 0 : $7_1; $11_1 = $13_1 ? $11_1 : $12_1; continue; } break; }; if (($17_1 | 0) != 2 & HEAP8[$11_1 + 56720 | 0] < 0) { break block7 } $7_1 = HEAPU16[($11_1 << 1) + 56464 >> 1]; if (($7_1 >>> 3 | 0) + ($7_1 & 7) >>> 0 < $6_1 >>> 0) { break block8 } $6_1 = HEAPU8[$11_1 + 56720 | 0] & 127; } if (!$6_1) { break block14 } } if (($6_1 | 0) <= 127) { HEAP8[$9_1 | 0] = $6_1; $9_1 = $9_1 + 1 | 0; break block14; } if ($6_1 >>> 0 <= 2047) { HEAP8[$9_1 + 1 | 0] = $6_1 & 63 | 128; HEAP8[$9_1 | 0] = $6_1 >>> 6 | 192; $9_1 = $9_1 + 2 | 0; break block14; } if ($6_1 >>> 0 > 65535) { break block17 } HEAP8[$9_1 + 2 | 0] = $6_1 & 63 | 128; HEAP8[$9_1 | 0] = $6_1 >>> 12 | 224; HEAP8[$9_1 + 1 | 0] = $6_1 >>> 6 & 63 | 128; $9_1 = $9_1 + 3 | 0; break block14; } $6_1 = $6_1 - 66560 >>> 0 < 40 ? $6_1 + 40 | 0 : $6_1; } HEAP8[$9_1 + 3 | 0] = $6_1 & 63 | 128; HEAP8[$9_1 + 2 | 0] = $6_1 >>> 6 & 63 | 128; HEAP8[$9_1 + 1 | 0] = $6_1 >>> 12 & 63 | 128; HEAP8[$9_1 | 0] = $6_1 >>> 18 & 7 | 240; $9_1 = $9_1 + 4 | 0; } block19 : { if ($10_1 >>> 0 >= $14 >>> 0) { $7_1 = $10_1; break block19; } $7_1 = $10_1 + 1 | 0; $6_1 = HEAPU8[$10_1 | 0]; if ($6_1 >>> 0 >= 192) { $8_1 = HEAPU8[$6_1 + 33456 | 0]; while (1) { block22 : { if ($7_1 >>> 0 >= $14 >>> 0) { $7_1 = $14; break block22; } $6_1 = HEAPU8[$7_1 | 0]; if (($6_1 & 192) != 128) { break block22 } $8_1 = $6_1 & 63 | $8_1 << 6; $7_1 = $7_1 + 1 | 0; continue; } break; }; $6_1 = ($8_1 & -2) == 65534 ? 65533 : $8_1 >>> 0 < 128 ? 65533 : ($8_1 & -2048) == 55296 ? 65533 : $8_1; } if (!$1650($15_1, $6_1)) { if (!$1651($6_1)) { break block19 } } $8_1 = HEAP32[$0_1 + 20 >> 2]; $10_1 = $7_1; continue; } break; }; HEAP32[$0_1 + 12 >> 2] = $7_1 - HEAP32[$0_1 + 4 >> 2]; $7_1 = $1_1; $1_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$7_1 >> 2] = $1_1; HEAP32[$2_1 >> 2] = $9_1 - $1_1; $1_1 = HEAP32[$0_1 + 4 >> 2]; HEAP32[$3 >> 2] = $16_1 - $1_1; HEAP32[$4_1 >> 2] = $10_1 - $1_1; $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 16 >> 2] = $0_1 + 1; HEAP32[$5_1 >> 2] = $0_1; return 0; } function $1650($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = $1652($1_1); block1 : { block : { $2_1 = HEAP32[$0_1 + 8 >> 2]; if (($2_1 | 0) <= 0) { break block } $2_1 = $2_1 - 1 | 0; $7_1 = HEAP32[$0_1 + 12 >> 2]; $0_1 = 0; while (1) { if (($0_1 | 0) > ($2_1 | 0)) { break block } $4_1 = $0_1 + $2_1 >>> 1 | 0; $3 = HEAP32[($4_1 << 2) + $7_1 >> 2]; $5_1 = 1; if (($3 | 0) == ($1_1 | 0)) { break block1 } $3 = ($1_1 | 0) > ($3 | 0); $2_1 = $3 ? $2_1 : $4_1 - 1 | 0; $0_1 = $3 ? $4_1 + 1 | 0 : $0_1; continue; }; } $5_1 = 0; } return $6_1 ^ $5_1; } function $1651($0_1) { var $1_1 = 0; if ($0_1 - 818 >>> 0 >= 4294967246) { if ($0_1 >>> 0 <= 799) { return 1 << $0_1 - 768 & 134389727 } $1_1 = 1 << $0_1 - 800 & 221688; } return $1_1; } function $1652($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if ($0_1 >>> 0 <= 127) { return (HEAP32[($0_1 >>> 3 & 536870908) + 55632 >> 2] ^ -1) >>> $0_1 & 1 } $1_1 = 1; if ($0_1 >>> 0 <= 4194303) { $6_1 = $0_1 << 10 | 1023; $1_1 = 405; while (1) { if (!(($1_1 | 0) < ($3 | 0))) { $2_1 = $1_1 + $3 >>> 1 | 0; $4_1 = HEAPU32[($2_1 << 2) + 54e3 >> 2] > $6_1 >>> 0; $3 = $4_1 ? $3 : $2_1 + 1 | 0; $1_1 = $4_1 ? $2_1 - 1 | 0 : $1_1; $5_1 = $4_1 ? $5_1 : $2_1; continue; } break; }; $1_1 = $0_1; $0_1 = HEAP32[($5_1 << 2) + 54e3 >> 2]; $1_1 = $1_1 >>> 0 >= ($0_1 >>> 10 | 0) + ($0_1 & 1023) >>> 0; } return $1_1; } function $1653($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0; block2 : { block : { if ($2_1 - 6 >>> 0 < 4294967294) { break block } $1_1 = 12; $7_1 = HEAP32[$3 + 4 >> 2]; $6_1 = $2080($7_1); if (($2_1 | 0) == 5) { if (($6_1 | 0) != 4) { break block } if ($68(9976, $7_1, 4)) { break block } $7_1 = HEAP32[$3 + 12 >> 2]; $6_1 = $2080($7_1); $1_1 = 16; } $5_1 = HEAP32[$1_1 + $3 >> 2]; $3 = $2080($5_1); $2_1 = $356($0_1, 26175); if ($2_1) { break block2 } $2_1 = ($3 + $6_1 | 0) + 314 | 0; $1_1 = $31($2_1, 0); if (!$1_1) { return 7 } if ($2_1) { wasm2js_memory_fill($1_1, 0, $2_1) } $2_1 = $1_1 + 312 | 0; HEAP32[$1_1 + 32 >> 2] = $2_1; HEAP32[$1_1 + 12 >> 2] = $1_1 + 16; HEAP32[$1_1 + 276 >> 2] = 1; HEAP32[$1_1 + 28 >> 2] = $0_1; $0_1 = ($2_1 + $6_1 | 0) + 1 | 0; HEAP32[$1_1 + 36 >> 2] = $0_1; if ($6_1) { wasm2js_memory_copy($2_1, $7_1, $6_1) } if ($3) { wasm2js_memory_copy($0_1, $5_1, $3) } $1654(HEAP32[HEAP32[$1_1 + 12 >> 2] + 20 >> 2]); HEAP32[$4_1 >> 2] = $1_1; return 0; } $1655($5_1, 8986, 0); $2_1 = 1; } return $2_1 | 0; } function $1654($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; block1 : { $1_1 = HEAPU8[$0_1 | 0]; if (!(($1_1 | 0) == 34 | ($1_1 | 0) == 39 | ($1_1 | 0) == 96)) { if (($1_1 | 0) != 91) { break block1 } } $3 = ($1_1 | 0) == 91 ? 93 : $1_1; $1_1 = 0; $2_1 = 1; while (1) { block2 : { $5_1 = $0_1 + $2_1 | 0; $4_1 = HEAPU8[$5_1 | 0]; if (!$4_1) { break block2 } block4 : { if (($3 | 0) == ($4_1 | 0)) { if (HEAPU8[$5_1 + 1 | 0] != ($3 | 0)) { break block2 } HEAP8[$0_1 + $1_1 | 0] = $3; $2_1 = $2_1 + 2 | 0; break block4; } HEAP8[$0_1 + $1_1 | 0] = $4_1; $2_1 = $2_1 + 1 | 0; } $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP8[$0_1 + $1_1 | 0] = 0; } } function $1655($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $24(HEAP32[$0_1 >> 2]); HEAP32[$3 + 12 >> 2] = $2_1; HEAP32[$0_1 >> 2] = $60($1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1656($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; block : { if (HEAP32[$1_1 + 8 >> 2] != 1) { break block } $0_1 = HEAP32[$1_1 + 12 >> 2]; if (HEAP32[$0_1 >> 2] | HEAPU8[$0_1 + 4 | 0]) { break block } HEAP32[$1_1 + 32 >> 2] = 1; } $0_1 = HEAP32[$1_1 >> 2]; $9_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $6_1 = -1; $7_1 = -1; $5_1 = -1; $8_1 = -1; while (1) { if (!(($2_1 | 0) == ($9_1 | 0))) { $3 = HEAP32[$1_1 + 4 >> 2] + Math_imul($2_1, 12) | 0; if (HEAPU8[$3 + 5 | 0]) { $0_1 = HEAPU8[$3 + 4 | 0]; $3 = HEAP32[$3 >> 2]; if (!$3) { $7_1 = ($0_1 | 0) == 8 ? $2_1 : ($0_1 | 0) == 16 ? $2_1 : $7_1; $8_1 = ($0_1 | 0) == 2 ? $2_1 : $8_1; $6_1 = ($0_1 | 0) == 32 ? $2_1 : ($0_1 | 0) == 4 ? $2_1 : $6_1; } $5_1 = ($3 | 0) == 4 ? (($0_1 | 0) == 2 ? $2_1 : $5_1) : $5_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; block5 : { if (($8_1 | 0) >= 0) { HEAP32[$1_1 + 20 >> 2] = 1; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($8_1 << 3) >> 2] = 1; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1075052544; $2_1 = 2; $4_1 = 5.0; break block5; } HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1087604736; HEAP32[$1_1 + 20 >> 2] = 0; block7 : { if (($6_1 | 0) < 0) { $2_1 = 1; $4_1 = 2.0e4; $0_1 = 4; break block7; } $2_1 = 2; HEAP32[$1_1 + 20 >> 2] = 2; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($6_1 << 3) >> 2] = 1; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1086556160; $4_1 = 1.0e4; $0_1 = 6; } if (($7_1 | 0) < 0) { break block5 } HEAP32[$1_1 + 20 >> 2] = $0_1; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($7_1 << 3) >> 2] = $2_1; $4_1 = $4_1 * .5; HEAPF64[$1_1 + 40 >> 3] = $4_1; $2_1 = $2_1 + 1 | 0; } if (($5_1 | 0) >= 0) { HEAP32[HEAP32[$1_1 + 16 >> 2] + ($5_1 << 3) >> 2] = $2_1; HEAPF64[$1_1 + 40 >> 3] = $4_1 + -1.0; } return 0; } function $1657($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 12 >> 2]; $3 = $2_1 + 60 | 0; while (1) { if (!(($1_1 | 0) == 40)) { $100(HEAP32[($1_1 << 2) + $3 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $24(HEAP32[$2_1 + 248 >> 2]); $24($0_1); return 0; } function $1658($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = $23(128); if (!$0_1) { return 7 } wasm2js_memory_fill($0_1, 0, 128); HEAP32[$1_1 >> 2] = $0_1; return 0; } function $1659($0_1) { $0_1 = $0_1 | 0; $1660(HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]); $1661($0_1 + 8 | 0); $24(HEAP32[$0_1 + 72 >> 2]); $24(HEAP32[$0_1 + 88 >> 2]); $24(HEAP32[$0_1 + 120 >> 2]); $24($0_1); return 0; } function $1660($0_1) { $334(HEAP32[$0_1 + 252 >> 2]); HEAP32[$0_1 + 252 >> 2] = 0; } function $1661($0_1) { var $1_1 = 0, $2_1 = 0; if ($0_1) { while (1) { $2_1 = HEAP32[$0_1 >> 2]; if (!(HEAP32[$0_1 + 4 >> 2] <= ($1_1 | 0))) { $1672(HEAP32[($1_1 << 2) + $2_1 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $24($2_1); $24(HEAP32[$0_1 + 16 >> 2]); HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; } } function $1662($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $9_1 = 1; $6_1 = HEAP32[$0_1 >> 2]; block1 : { if (($1_1 | 0) == 1) { $8_1 = 3; $7_1 = -1; break block1; } $11_1 = 1; $5_1 = $1_1 >>> 1 & 1; $7_1 = $1_1 & 4; $9_1 = $7_1 ? ($5_1 ? 2 : 1) : $5_1; $8_1 = 19; $7_1 = $7_1 ? $5_1 : -1; } $10_1 = HEAP32[$6_1 + 12 >> 2]; $6_1 = $0_1 + 8 | 0; $1661($6_1); $24(HEAP32[$0_1 + 72 >> 2]); $24(HEAP32[$0_1 + 120 >> 2]); $24(HEAP32[$0_1 + 88 >> 2]); wasm2js_memory_fill($6_1, 0, 120); HEAP32[$0_1 + 84 >> 2] = $8_1; $8_1 = $0_1 + 72 | 0; block8 : { block5 : { block4 : { if (!$5_1 & ($1_1 | 0) != 1) { break block4 } $1_1 = $53(HEAP32[$4_1 >> 2]); if (!$1_1) { break block4 } HEAP32[$2_1 + 16 >> 2] = $1_1; $1_1 = $61(8932, $2_1 + 16 | 0); HEAP32[$8_1 >> 2] = $1_1; if (!$1_1) { break block5 } HEAP32[$0_1 + 76 >> 2] = $2080($1_1); } $1_1 = 0; if (($7_1 | 0) >= 0) { HEAP32[$2_1 >> 2] = $53(HEAP32[($7_1 << 2) + $4_1 >> 2]); $5_1 = $61(8932, $2_1); HEAP32[$0_1 + 88 >> 2] = $5_1; if (!$5_1) { break block5 } HEAP32[$0_1 + 92 >> 2] = $2080($5_1); } if (($3 | 0) > ($9_1 | 0)) { $1_1 = $50(HEAP32[($9_1 << 2) + $4_1 >> 2]); $1_1 = ($1_1 | 0) > 0 ? $1_1 : 0; } HEAP32[$0_1 + 96 >> 2] = $1_1; $1_1 = $1663($10_1, $1_1, 0, -2, HEAP32[$0_1 + 72 >> 2], HEAP32[$0_1 + 76 >> 2], 0, $11_1, $6_1); if ($1_1) { break block8 } $1_1 = $1664($10_1, $6_1, $8_1); if ($1_1) { break block8 } $1_1 = $1665($0_1); break block8; } $1_1 = 7; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1663($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { wasm2js_memory_fill($8_1, 0, 64); return $1673($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1); } function $1664($0_1, $1_1, $2_1) { HEAP32[$1_1 + 12 >> 2] = $2_1; return $1674($0_1, $1_1, HEAP32[$2_1 >> 2], HEAP32[$2_1 + 4 >> 2]); } function $1665($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $7_1 = global$0 - 16 | 0; $1_1 = $7_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $8_1 = HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2]; $1_1 = HEAP32[$0_1 + 108 >> 2]; $4_1 = HEAP32[$0_1 + 104 >> 2] + 1 | 0; $1_1 = $4_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 + 104 >> 2] = $4_1; HEAP32[$0_1 + 108 >> 2] = $1_1; $1_1 = HEAP32[$0_1 + 116 >> 2]; $6_1 = HEAP32[$0_1 + 112 >> 2]; $4_1 = $6_1 + 1 | 0; $4_1 = ($1_1 | 0) > ($4_1 | 0) ? $1_1 : $4_1; block1 : { block : { while (1) { $6_1 = $6_1 + 1 | 0; if (($1_1 | 0) <= ($6_1 | 0)) { break block } $2_1 = HEAP32[$0_1 + 120 >> 2] + ($6_1 << 4) | 0; $5_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; if (($2_1 | 0) < 0) { $2_1 = 1 } else { $2_1 = !$5_1 & ($2_1 | 0) <= 0 } if ($2_1) { continue } break; }; HEAP32[$0_1 + 112 >> 2] = $6_1; $8_1 = 0; break block1; } HEAP32[$0_1 + 112 >> 2] = $4_1; $8_1 = $1666($8_1, $0_1 + 8 | 0); if (($8_1 | 0) == 100) { $11_1 = HEAP32[$0_1 + 64 >> 2]; $12_1 = HEAP32[$0_1 + 68 >> 2]; block3 : { $1_1 = HEAP32[$0_1 + 88 >> 2]; if (!$1_1) { break block3 } $8_1 = 0; $2_1 = $1_1; $1_1 = HEAP32[$0_1 + 92 >> 2]; $4_1 = HEAP32[$0_1 + 60 >> 2]; $2_1 = $2014($2_1, HEAP32[$0_1 + 56 >> 2], ($1_1 | 0) < ($4_1 | 0) ? $1_1 : $4_1); if ($2_1 | ($1_1 | 0) >= ($4_1 | 0) ? ($2_1 | 0) >= 0 : 0) { break block3 } HEAP32[$0_1 + 100 >> 2] = 1; break block1; } $8_1 = 7; if ($1667($0_1, 2)) { break block1 } $6_1 = 0; $1_1 = HEAP32[$0_1 + 116 >> 2] << 4; if ($1_1) { wasm2js_memory_fill(HEAP32[$0_1 + 120 >> 2], 0, $1_1) } $5_1 = 0; $2_1 = 0; $4_1 = 0; while (1) { if (($6_1 | 0) < ($12_1 | 0)) { HEAP32[$7_1 + 8 >> 2] = 0; HEAP32[$7_1 + 12 >> 2] = 0; $13_1 = $1668($6_1 + $11_1 | 0, $7_1 + 8 | 0); block12 : { block15 : { block10 : { block11 : { block8 : { switch ($2_1 | 0) { case 2: $1_1 = HEAP32[$7_1 + 8 >> 2]; $2_1 = HEAP32[$7_1 + 12 >> 2]; break block11; case 0: $1_1 = HEAP32[$0_1 + 120 >> 2]; $2_1 = $1_1; $5_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$2_1 >> 2] = $5_1; HEAP32[$2_1 + 4 >> 2] = $1_1; $2_1 = 1; $5_1 = 0; break block12; case 1: break block8; default: break block10; }; } $1_1 = HEAP32[$7_1 + 8 >> 2]; $2_1 = HEAP32[$7_1 + 12 >> 2]; if ($1_1 >>> 0 < 2 & ($2_1 | 0) <= 0 | ($2_1 | 0) < 0) { break block11 } $3 = HEAP32[$0_1 + 120 >> 2]; $9_1 = $3; $10_1 = HEAP32[$3 + 16 >> 2]; $3 = HEAP32[$3 + 20 >> 2]; $10_1 = $10_1 + 1 | 0; $3 = $10_1 ? $3 : $3 + 1 | 0; HEAP32[$9_1 + 16 >> 2] = $10_1; HEAP32[$9_1 + 20 >> 2] = $3; } if (!(!$2_1 & $1_1 >>> 0 > 1 | ($2_1 | 0) != 0)) { $2_1 = 0; if ($1_1 - 1 | 0) { break block12 } $2_1 = 3; break block12; } $1_1 = HEAP32[$0_1 + 120 >> 2]; $2_1 = ($1_1 + ($5_1 << 4) | 0) + 24 | 0; $3 = $2_1; $9_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 4 >> 2]; $9_1 = $9_1 + 1 | 0; $2_1 = $9_1 ? $2_1 : $2_1 + 1 | 0; HEAP32[$3 >> 2] = $9_1; HEAP32[$3 + 4 >> 2] = $2_1; $2_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$1_1 + 8 >> 2] + 1 | 0; $2_1 = $3 ? $2_1 : $2_1 + 1 | 0; HEAP32[$1_1 + 8 >> 2] = $3; HEAP32[$1_1 + 12 >> 2] = $2_1; break block15; } $5_1 = HEAP32[$7_1 + 8 >> 2]; if (($5_1 | 0) <= 0) { $4_1 = 267; break block12; } if ($1667($0_1, $5_1 + 2 | 0)) { break block1 } $1_1 = HEAP32[$0_1 + 120 >> 2] + ($5_1 << 4) | 0; $2_1 = $1_1; $3 = HEAP32[$1_1 + 16 >> 2]; $1_1 = HEAP32[$1_1 + 20 >> 2]; $3 = $3 + 1 | 0; $1_1 = $3 ? $1_1 : $1_1 + 1 | 0; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$2_1 + 20 >> 2] = $1_1; } $2_1 = 2; } $6_1 = $6_1 + $13_1 | 0; continue; } break; }; HEAP32[$0_1 + 112 >> 2] = 0; $8_1 = $4_1; break block1; } HEAP32[$0_1 + 100 >> 2] = 1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1 | 0; } function $1666($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0; $5_1 = global$0 - 32 | 0; $3 = $5_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $18_1 = HEAP32[$1_1 + 4 >> 2]; block1 : { if (!$18_1) { break block1 } $20_1 = HEAPU8[$0_1 + 239 | 0] ? 108 : 109; $12_1 = HEAP32[$1_1 >> 2]; $21_1 = ($18_1 | 0) <= 1 ? 1 : $18_1; $19_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$19_1 + 12 >> 2]; $23_1 = $3 & 34; $24_1 = $3 & 2; $22_1 = $3 & 1; $25 = $3 & 4; $26_1 = $3 & 16; $27 = $3 & 32; $28_1 = !($3 & 8); label4 : while (1) { $6_1 = 0; while (1) { $3 = HEAP32[$1_1 + 8 >> 2]; if (($6_1 | 0) < ($3 | 0)) { $3 = HEAP32[($6_1 << 2) + $12_1 >> 2]; block4 : { if (HEAPU8[$3 + 4 | 0]) { $1687($3); break block4; } $2_1 = $1685($0_1, $3); if ($2_1) { break block1 } } $6_1 = $6_1 + 1 | 0; continue; } break; }; $1689($12_1, $18_1, $3, 110); $2_1 = 0; HEAP32[$1_1 + 8 >> 2] = 0; $4_1 = HEAP32[$12_1 >> 2]; if (!HEAP32[$4_1 + 40 >> 2]) { break block1 } $8_1 = HEAP32[$4_1 + 60 >> 2]; HEAP32[$1_1 + 52 >> 2] = $8_1; $7_1 = HEAP32[$4_1 + 64 >> 2]; HEAP32[$1_1 + 48 >> 2] = $7_1; $6_1 = HEAP32[$19_1 >> 2]; if (!($26_1 | !$6_1)) { $3 = HEAP32[$19_1 + 4 >> 2]; if (($3 | 0) > ($8_1 | 0) | ($3 | 0) < ($8_1 | 0) & $28_1) { break block1 } if ($2014($7_1, $6_1, $3)) { break block1 } } $3 = 1; while (1) { block7 : { if (($3 | 0) == ($21_1 | 0)) { $3 = $21_1; break block7; } $2_1 = HEAP32[($3 << 2) + $12_1 >> 2]; if (!HEAP32[$2_1 + 40 >> 2] | ($8_1 | 0) != HEAP32[$2_1 + 60 >> 2]) { break block7 } if ($2014($7_1, HEAP32[$2_1 + 64 >> 2], $8_1)) { break block7 } $3 = $3 + 1 | 0; continue; } break; }; block8 : { if ($23_1 | ($3 | 0) != 1) { break block8 } $8_1 = HEAP32[$4_1 + 56 >> 2]; block13 : { block12 : { block11 : { block10 : { if (HEAPU8[$0_1 + 239 | 0]) { if ($8_1) { break block8 } HEAP32[$1_1 + 60 >> 2] = HEAP32[$4_1 + 76 >> 2]; break block10; } $0_1 = HEAP32[$4_1 + 76 >> 2]; HEAP32[$1_1 + 60 >> 2] = $0_1; if ($8_1) { break block11 } } HEAP32[$1_1 + 56 >> 2] = HEAP32[$4_1 + 72 >> 2]; break block12; } $2_1 = $1694($1_1, HEAP32[$4_1 + 72 >> 2], $0_1, $0_1 >> 31); HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 16 >> 2]; if ($2_1) { break block13 } } $2_1 = 100; } HEAP32[$1_1 + 8 >> 2] = 1; break block1; } $6_1 = 0; while (1) { if (!(($3 | 0) == ($6_1 | 0))) { $1695($0_1, HEAP32[($6_1 << 2) + $12_1 >> 2]); $6_1 = $6_1 + 1 | 0; continue; } break; }; $1689($12_1, $3, $3, $20_1); $4_1 = 0; $13_1 = 0; $9_1 = 0; while (1) { block17 : { $7_1 = HEAP32[$12_1 >> 2]; if (HEAP32[$7_1 + 80 >> 2]) { HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 8 >> 2] = 0; $8_1 = HEAP32[$7_1 + 88 >> 2]; $14 = HEAP32[$7_1 + 92 >> 2]; $1696($0_1, $7_1, $5_1 + 12 | 0, $5_1 + 8 | 0); $6_1 = 1; while (1) { if (($3 | 0) == ($6_1 | 0)) { $6_1 = $3; break block17; } $7_1 = HEAP32[($6_1 << 2) + $12_1 >> 2]; if (!HEAP32[$7_1 + 80 >> 2] | (($8_1 | 0) != HEAP32[$7_1 + 88 >> 2] | ($14 | 0) != HEAP32[$7_1 + 92 >> 2])) { break block17 } $1696($0_1, $7_1, 0, 0); $6_1 = $6_1 + 1 | 0; continue; }; } if (($9_1 | 0) > 0) { $2_1 = $1697($1_1, $9_1 + 20 | 0, 0); if ($2_1) { break block1 } $0_1 = HEAP32[$1_1 + 16 >> 2] + $9_1 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $4_1 = $0_1 + 16 | 0; HEAP8[$4_1 | 0] = 0; HEAP8[$4_1 + 1 | 0] = 0; HEAP8[$4_1 + 2 | 0] = 0; HEAP8[$4_1 + 3 | 0] = 0; $0_1 = $0_1 + 8 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; HEAP32[$1_1 + 60 >> 2] = $9_1; HEAP32[$1_1 + 8 >> 2] = $3; HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 16 >> 2]; $2_1 = 100; break block1; } HEAP32[$1_1 + 8 >> 2] = $3; continue label4; } if ($25) { $1698(HEAP32[$19_1 + 8 >> 2], 0, $5_1 + 12 | 0, $5_1 + 8 | 0) } $15_1 = HEAP32[$5_1 + 8 >> 2]; block23 : { block21 : { if (!!$24_1 & ($15_1 | 0) <= 0) { break block21 } block24 : { if (!(!HEAPU8[$0_1 + 239 | 0] | ($9_1 | 0) <= 0)) { if (($13_1 | 0) <= ($14 | 0) & $4_1 >>> 0 <= $8_1 >>> 0 | ($13_1 | 0) < ($14 | 0)) { break block23 } $17_1 = $13_1 - (($4_1 >>> 0 < $8_1 >>> 0) + $14 | 0) | 0; $7_1 = $4_1 - $8_1 | 0; break block24; } if ((($13_1 | 0) >= ($14 | 0) & $4_1 >>> 0 >= $8_1 >>> 0 | ($13_1 | 0) > ($14 | 0)) & ($9_1 | 0) > 0) { break block23 } $17_1 = $14 - (($4_1 >>> 0 > $8_1 >>> 0) + $13_1 | 0) | 0; $7_1 = $8_1 - $4_1 | 0; } $2_1 = $1699($7_1, $17_1) + ($22_1 ? $15_1 + 1 | 0 : 0) | 0; $16_1 = $2_1; $10_1 = $2_1 + $9_1 | 0; $2_1 = ($9_1 >> 31) + ($2_1 >> 31) | 0; $2_1 = $10_1 >>> 0 < $16_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $10_1 = $10_1 + 20 | 0; $2_1 = $10_1 >>> 0 < 20 ? $2_1 + 1 | 0 : $2_1; $2_1 = $1697($1_1, $10_1, $2_1); if ($2_1) { break block1 } $10_1 = HEAP32[$1_1 + 16 >> 2] + $9_1 | 0; if ($27) { $11_1 = HEAP32[$5_1 + 12 >> 2]; HEAP32[$5_1 + 28 >> 2] = $11_1; $16_1 = 0; $2_1 = 0; block27 : { switch (HEAPU8[$11_1 | 0] - 1 | 0) { case 1: $2_1 = $1700($10_1, $7_1, $17_1); HEAP8[$2_1 + $10_1 | 0] = 2; $16_1 = 1; $2_1 = $2_1 + 1 | 0; default: $1701(0, $5_1 + 28 | 0); break; case 0: break block27; }; } $15_1 = $15_1 + $11_1 | 0; while (1) { $11_1 = HEAP32[$5_1 + 28 >> 2]; if (!($11_1 >>> 0 >= $15_1 >>> 0)) { $11_1 = $11_1 + 1 | 0; $11_1 = $1668($11_1, $5_1 + 16 | 0) + $11_1 | 0; HEAP32[$5_1 + 28 >> 2] = $11_1; if (HEAPU8[$11_1 | 0] == 2) { if (!$16_1) { $2_1 = $1700($2_1 + $10_1 | 0, $7_1, $17_1) + $2_1 | 0 } $16_1 = 1; HEAP8[$2_1 + $10_1 | 0] = 1; $2_1 = $2_1 + 1 | 0; $2_1 = $1700($2_1 + $10_1 | 0, HEAP32[$5_1 + 16 >> 2], HEAP32[$5_1 + 20 >> 2]) + $2_1 | 0; HEAP8[$2_1 + $10_1 | 0] = 2; $2_1 = $2_1 + 1 | 0; } $1701(0, $5_1 + 28 | 0); continue; } break; }; if ($16_1) { HEAP8[$2_1 + $10_1 | 0] = 0; $2_1 = $2_1 + 1 | 0; } $4_1 = $2_1 ? $8_1 : $4_1; $13_1 = $2_1 ? $14 : $13_1; $9_1 = $2_1 + $9_1 | 0; break block21; } $9_1 = $1700($10_1, $7_1, $17_1) + $9_1 | 0; if ($22_1) { if ($15_1) { wasm2js_memory_copy(HEAP32[$1_1 + 16 >> 2] + $9_1 | 0, HEAP32[$5_1 + 12 >> 2], $15_1) } $4_1 = $9_1 + $15_1 | 0; HEAP8[$4_1 + HEAP32[$1_1 + 16 >> 2] | 0] = 0; $9_1 = $4_1 + 1 | 0; } $4_1 = $8_1; $13_1 = $14; } $1689($12_1, $3, $6_1, $20_1); continue; } break; }; break; }; $2_1 = 267; } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1667($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if (($1_1 | 0) <= HEAP32[$0_1 + 116 >> 2]) { return 0 } $2_1 = $34(HEAP32[$0_1 + 120 >> 2], $1_1 << 4, 0); if (!$2_1) { return 7 } $3 = HEAP32[$0_1 + 116 >> 2]; $4_1 = $1_1 - $3 << 4; if ($4_1) { wasm2js_memory_fill(($3 << 4) + $2_1 | 0, 0, $4_1) } HEAP32[$0_1 + 116 >> 2] = $1_1; HEAP32[$0_1 + 120 >> 2] = $2_1; return 0; } function $1668($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $2_1 = HEAP8[$0_1 | 0]; if (($2_1 | 0) >= 0) { HEAP32[$1_1 >> 2] = $2_1 & 255; HEAP32[$1_1 + 4 >> 2] = 0; return 1; } $3 = HEAP8[$0_1 + 1 | 0]; $2_1 = $2_1 & 127 | ($3 & 255) << 7; if (($3 | 0) >= 0) { HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = 0; return 2; } $3 = HEAP8[$0_1 + 2 | 0]; $2_1 = $2_1 & 16383 | ($3 & 255) << 14; if (($3 | 0) >= 0) { HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = 0; return 3; } $3 = HEAP8[$0_1 + 3 | 0]; $2_1 = $2_1 & 2097151 | ($3 & 255) << 21; if (($3 | 0) >= 0) { HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = 0; return 4; } $11_1 = $0_1 + 10 | 0; $8_1 = $0_1 + 4 | 0; $2_1 = $2_1 & 268435455; $5_1 = 28; $3 = 0; while (1) { block5 : { if (!(!$3 & $5_1 >>> 0 <= 63)) { $4_1 = $11_1; break block5; } $9_1 = HEAP8[$8_1 | 0]; $4_1 = $9_1 & 127; $7_1 = $5_1 & 31; if (($5_1 & 63) >>> 0 >= 32) { $10_1 = $4_1 << $7_1; $4_1 = 0; } else { $10_1 = (1 << $7_1) - 1 & $4_1 >>> 32 - $7_1; $4_1 = $4_1 << $7_1; } $4_1 = $4_1 + $2_1 | 0; $6_1 = $6_1 + $10_1 | 0; $6_1 = $2_1 >>> 0 > $4_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $2_1 = $4_1; $5_1 = $5_1 + 7 | 0; $3 = $5_1 >>> 0 < 7 ? $3 + 1 | 0 : $3; $4_1 = $8_1 + 1 | 0; $8_1 = $4_1; if (($9_1 | 0) < 0) { continue } } break; }; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $6_1; return $4_1 - $0_1 | 0; } function $1669($0_1) { $0_1 = $0_1 | 0; return HEAP32[$0_1 + 100 >> 2]; } function $1670($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; block5 : { block4 : { switch ($2_1 | 0) { case 0: $246($1_1, HEAP32[$0_1 + 56 >> 2], HEAP32[$0_1 + 60 >> 2], -1); break block5; case 1: $0_1 = HEAP32[$0_1 + 112 >> 2]; if ($0_1) { $238($1_1, $0_1 - 1 | 0); break block5; } $246($1_1, 25120, -1, 0); break block5; case 2: $0_1 = HEAP32[$0_1 + 120 >> 2] + (HEAP32[$0_1 + 112 >> 2] << 4) | 0; $240($1_1, HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2]); break block5; case 3: $0_1 = HEAP32[$0_1 + 120 >> 2] + (HEAP32[$0_1 + 112 >> 2] << 4) | 0; $240($1_1, HEAP32[$0_1 + 8 >> 2], HEAP32[$0_1 + 12 >> 2]); break block5; default: break block4; }; } $238($1_1, HEAP32[$0_1 + 96 >> 2]); } return 0; } function $1671($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAP32[$0_1 + 108 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 104 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; return 0; } function $1672($0_1) { if ($0_1) { $24(HEAP32[$0_1 + 64 >> 2]); if (!HEAPU8[$0_1 + 5 | 0]) { $24(HEAP32[$0_1 + 40 >> 2]) } $334(HEAP32[$0_1 + 52 >> 2]); } $24($0_1); } function $1673($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1) { var $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $12_1 = global$0 - 32 | 0; $10_1 = $12_1; if (global$4 >>> 0 < $12_1 >>> 0 | global$5 >>> 0 > $12_1 >>> 0) { fimport$30($12_1 | 0) } global$0 = $10_1; $10_1 = 0; block16 : { block1 : { if (($3 | 0) >= 0) { HEAP32[$12_1 + 16 >> 2] = 0; $10_1 = $1675($0_1, 12, $12_1 + 16 | 0, 0); $9_1 = HEAP32[$12_1 + 16 >> 2]; if ($10_1) { break block1 } $10_1 = HEAP32[$0_1 + 260 >> 2]; $1_1 = __wasm_i64_mul($10_1, $10_1 >> 31, $1_1, $1_1 >> 31) + $2_1 | 0; $10_1 = $3 + ($1_1 << 10) | 0; $15_1 = i64toi32_i32$HIGH_BITS + ($2_1 >> 31) | 0; $1_1 = ($1_1 >>> 0 < $2_1 >>> 0 ? $15_1 + 1 | 0 : $15_1) << 10 | $1_1 >>> 22; $283($9_1, 1, $10_1, $3 >>> 0 > $10_1 >>> 0 ? $1_1 + 1 | 0 : $1_1); $10_1 = 0; break block1; } $9_1 = HEAP32[$0_1 + 264 >> 2]; block2 : { if (!$9_1 | HEAP32[$0_1 + 288 >> 2] != ($1_1 | 0)) { break block2 } $14 = 4; $9_1 = ($9_1 + Math_imul($2_1, 24) | 0) + 4 | 0; block14 : { block11 : { block8 : { $18_1 = $6_1 | $7_1; block10 : { if ($18_1) { $9_1 = $9_1 + 8 | 0; $14 = 0; while (1) { $9_1 = HEAP32[$9_1 >> 2]; HEAP32[$12_1 + 16 >> 2] = $9_1; block7 : { if ($9_1) { if ($5_1) { if (HEAP32[$9_1 + 16 >> 2] < ($5_1 | 0)) { continue } if ($2014(HEAP32[$9_1 + 12 >> 2], $4_1, $5_1)) { continue } } if (($11_1 | 0) != ($14 | 0)) { $10_1 = $15_1; break block7; } $11_1 = $11_1 + 16 | 0; $10_1 = $34($15_1, $11_1 << 2, 0); if ($10_1) { break block7 } break block8; } if ($14 >>> 0 >= 2) { $10_1 = $15_1; $9_1 = global$0 - 208 | 0; if ($9_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $9_1 >>> 0) { fimport$30($9_1 | 0) } global$0 = $9_1; HEAP32[$9_1 + 8 >> 2] = 1; HEAP32[$9_1 + 12 >> 2] = 0; $13_1 = $14 << 2; block : { if (!$13_1) { break block } HEAP32[$9_1 + 16 >> 2] = 4; HEAP32[$9_1 + 20 >> 2] = 4; $11_1 = 2; while (1) { $16_1 = ($9_1 + 16 | 0) + ($11_1 << 2) | 0; $17_1 = (HEAP32[$16_1 - 8 >> 2] + 4 | 0) + HEAP32[$16_1 - 4 >> 2] | 0; HEAP32[$16_1 >> 2] = $17_1; $11_1 = $11_1 + 1 | 0; if ($13_1 >>> 0 > $17_1 >>> 0) { continue } break; }; $11_1 = $13_1 - 4 | 0; block21 : { if (($11_1 | 0) <= 0) { $11_1 = 1; $13_1 = 0; break block21; } $13_1 = $10_1 + $11_1 | 0; $16_1 = 1; $11_1 = 1; while (1) { block4 : { if (($16_1 & 3) == 3) { $2051($10_1, $11_1, $9_1 + 16 | 0); $2052($9_1 + 8 | 0, 2); $11_1 = $11_1 + 2 | 0; break block4; } $16_1 = $9_1 + 16 | 0; $17_1 = $11_1 - 1 | 0; block6 : { if (HEAPU32[$16_1 + ($17_1 << 2) >> 2] >= $13_1 - $10_1 >>> 0) { $2053($10_1, $9_1 + 8 | 0, $11_1, 0, $16_1); break block6; } $2051($10_1, $11_1, $9_1 + 16 | 0); } if (($11_1 | 0) == 1) { $2054($9_1 + 8 | 0, 1); $11_1 = 0; break block4; } $2054($9_1 + 8 | 0, $17_1); $11_1 = 1; } $16_1 = HEAP32[$9_1 + 8 >> 2] | 1; HEAP32[$9_1 + 8 >> 2] = $16_1; $10_1 = $10_1 + 4 | 0; if ($13_1 >>> 0 > $10_1 >>> 0) { continue } break; }; $13_1 = HEAP32[$9_1 + 12 >> 2] != 0; } $2053($10_1, $9_1 + 8 | 0, $11_1, 0, $9_1 + 16 | 0); if (!(($11_1 | 0) != 1 | HEAP32[$9_1 + 8 >> 2] != 1 | $13_1)) { break block } while (1) { block102 : { if (($11_1 | 0) <= 1) { $13_1 = $9_1 + 8 | 0; $17_1 = $13_1; $13_1 = $2055($13_1); $2052($17_1, $13_1); $13_1 = $11_1 + $13_1 | 0; break block102; } $13_1 = $9_1 + 8 | 0; $2054($13_1, 2); HEAP32[$9_1 + 8 >> 2] = HEAP32[$9_1 + 8 >> 2] ^ 7; $2052($13_1, 1); $19_1 = $10_1 - 4 | 0; $16_1 = $9_1 + 16 | 0; $17_1 = $11_1 - 2 | 0; $2053($19_1 - HEAP32[$16_1 + ($17_1 << 2) >> 2] | 0, $13_1, $11_1 - 1 | 0, 1, $16_1); $2054($13_1, 1); HEAP32[$9_1 + 8 >> 2] = HEAP32[$9_1 + 8 >> 2] | 1; $2053($19_1, $13_1, $17_1, 1, $16_1); $13_1 = $17_1; } $11_1 = $13_1; $10_1 = $10_1 - 4 | 0; if (HEAP32[$9_1 + 12 >> 2] | (($11_1 | 0) != 1 | HEAP32[$9_1 + 8 >> 2] != 1)) { continue } break; }; } $10_1 = $9_1 + 208 | 0; if ($10_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $10_1 >>> 0) { fimport$30($10_1 | 0) } global$0 = $10_1; $14 = $14 << 2; break block10; } $11_1 = 1; $10_1 = 0; if (($14 | 0) != 1) { break block11 } $14 = 4; break block10; } HEAP32[($14 << 2) + $10_1 >> 2] = $9_1; $14 = $14 + 1 | 0; $9_1 = HEAP32[$12_1 + 16 >> 2]; $15_1 = $10_1; continue; }; } $15_1 = $1677($9_1, $4_1, $5_1); HEAP32[$12_1 + 16 >> 2] = $15_1; if (!$15_1) { break block2 } $15_1 = $12_1 + 16 | 0; } $11_1 = $14 + 100 | 0; $9_1 = $31($11_1, 0); if (!$9_1) { break block8 } $10_1 = 0; if ($11_1) { wasm2js_memory_fill($9_1, 0, $11_1) } $11_1 = $9_1 + 96 | 0; HEAP32[$9_1 + 56 >> 2] = $11_1; HEAP32[$9_1 >> 2] = 2147483647; if ($14) { wasm2js_memory_copy($11_1, $15_1, $14) } $11_1 = 1; break block14; } $11_1 = 0; $10_1 = 7; } $9_1 = 0; } if ($18_1) { $24($15_1) } if (!$9_1 | $11_1 ^ 1) { break block2 } $10_1 = $1678($8_1, $9_1); } $9_1 = 0; if (($3 | 0) == -1) { break block16 } if ($10_1) { break block1 } $10_1 = 0; HEAP32[$12_1 + 16 >> 2] = 0; $3 = $1675($0_1, 13, $12_1 + 16 | 0, 0); $9_1 = HEAP32[$12_1 + 16 >> 2]; if ($3) { $10_1 = $3; break block1; } $3 = HEAP32[$0_1 + 260 >> 2]; $15_1 = $1_1 >> 31; $3 = __wasm_i64_mul($3, $3 >> 31, $1_1, $15_1) + $2_1 | 0; $14 = $2_1 >> 31; $11_1 = $14 + i64toi32_i32$HIGH_BITS | 0; $283($9_1, 1, $3 << 10, ($2_1 >>> 0 > $3 >>> 0 ? $11_1 + 1 | 0 : $11_1) << 10 | $3 >>> 22); $3 = HEAP32[$0_1 + 260 >> 2]; $1_1 = __wasm_i64_mul($3, $3 >> 31, $1_1, $15_1); $3 = $14 + i64toi32_i32$HIGH_BITS | 0; $1_1 = $1_1 + $2_1 | 0; $2_1 = $1_1 >>> 0 < $2_1 >>> 0 ? $3 + 1 | 0 : $3; $283($9_1, 2, $1_1 << 10 | 1023, $2_1 << 10 | $1_1 >>> 22); } $15_1 = $6_1 ? $12_1 + 8 | 0 : 0; $7_1 = $6_1 | $7_1; $14 = !$7_1; while (1) { if ($10_1) { break block16 } $10_1 = $94($9_1); if (($10_1 | 0) != 100) { break block16 } HEAP32[$12_1 + 28 >> 2] = 0; HEAP32[$12_1 + 16 >> 2] = $95($9_1, 1); HEAP32[$12_1 + 20 >> 2] = i64toi32_i32$HIGH_BITS; HEAP32[$12_1 + 8 >> 2] = $95($9_1, 2); HEAP32[$12_1 + 12 >> 2] = i64toi32_i32$HIGH_BITS; $11_1 = $95($9_1, 3); $13_1 = i64toi32_i32$HIGH_BITS; $2_1 = $274($9_1, 4); $6_1 = $273($9_1, 4); $1_1 = HEAP32[$12_1 + 16 >> 2]; $3 = HEAP32[$12_1 + 20 >> 2]; block18 : { if (!$6_1 | (!$4_1 | !($1_1 | $3))) { break block18 } $10_1 = $1679($0_1, $4_1, $5_1, $6_1, $2_1, $12_1 + 16 | 0, $15_1); if ($10_1) { break block16 } $1_1 = HEAP32[$12_1 + 16 >> 2]; $3 = HEAP32[$12_1 + 20 >> 2]; if ($7_1) { break block18 } HEAP32[$12_1 + 8 >> 2] = $1_1; HEAP32[$12_1 + 12 >> 2] = $3; } $10_1 = $1680(HEAP32[$8_1 + 4 >> 2] + 1 | 0, $14, $1_1, $3, HEAP32[$12_1 + 8 >> 2], HEAP32[$12_1 + 12 >> 2], $11_1, $13_1, $6_1, $2_1, $12_1 + 28 | 0); if ($10_1) { break block16 } $10_1 = $1678($8_1, HEAP32[$12_1 + 28 >> 2]); continue; }; } $1_1 = $96($9_1); $0_1 = $12_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return ($10_1 | 0) == 101 ? $1_1 : $10_1; } function $1674($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = HEAP32[$1_1 + 4 >> 2]; block1 : { while (1) { if (!(HEAP32[$1_1 + 36 >> 2] | HEAP32[$1_1 + 4 >> 2] <= ($6_1 | 0))) { $5_1 = HEAP32[HEAP32[$1_1 >> 2] + ($6_1 << 2) >> 2]; while (1) { $4_1 = $1685($0_1, $5_1); if ($4_1) { break block1 } block3 : { if (!$2_1) { $4_1 = 0; break block3; } $4_1 = $1686($5_1, $2_1, $3); if (($4_1 | 0) < 0) { continue } } break; }; if (!(!$4_1 | !HEAPU8[$5_1 + 4 | 0])) { $1687($5_1) } $6_1 = $6_1 + 1 | 0; continue; } break; }; $1689(HEAP32[$1_1 >> 2], $7_1, $7_1, 110); $4_1 = 0; } return $4_1; } function $1675($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 48 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block5 : { block7 : { block4 : { $7_1 = ($1_1 << 2) + $0_1 | 0; $6_1 = HEAP32[$7_1 + 60 >> 2]; if (!$6_1) { block3 : { block2 : { if (($1_1 | 0) != 7) { if (($1_1 | 0) != 18) { break block2 } $1_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$4_1 + 24 >> 2] = HEAP32[$0_1 + 228 >> 2]; HEAP32[$4_1 + 16 >> 2] = $5_1; HEAP32[$4_1 + 20 >> 2] = $1_1; $5_1 = 5; $1_1 = $61(25374, $4_1 + 16 | 0); break block3; } HEAP32[$4_1 + 32 >> 2] = HEAP32[$0_1 + 224 >> 2]; $5_1 = 1; $1_1 = $61(21216, $4_1 + 32 | 0); break block3; } $5_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 16 >> 2]; HEAP32[$4_1 + 4 >> 2] = $5_1; $5_1 = 5; $1_1 = $61(HEAP32[($1_1 << 2) + 56960 >> 2], $4_1); } if (!$1_1) { break block4 } $5_1 = $352(HEAP32[$0_1 + 12 >> 2], $1_1, $5_1, $4_1 + 44 | 0); $24($1_1); $6_1 = HEAP32[$4_1 + 44 >> 2]; HEAP32[$7_1 + 60 >> 2] = $6_1; } if (!$3) { break block5 } if (!$6_1) { $6_1 = 0; $7_1 = 0; break block7; } $7_1 = HEAP16[$6_1 + 16 >> 1]; break block7; } $6_1 = 0; $5_1 = 7; $7_1 = 0; if (!$3) { break block5 } } $1_1 = 0; while (1) { if (($1_1 | 0) >= ($7_1 | 0) | $5_1) { break block5 } $0_1 = $1_1 + 1 | 0; $5_1 = $286($6_1, $0_1, HEAP32[($1_1 << 2) + $3 >> 2]); $1_1 = $0_1; continue; }; } HEAP32[$2_1 >> 2] = $6_1; $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1676($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$2_1 + 16 >> 2]; $3 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$3 + 16 >> 2]; $2_1 = $2014(HEAP32[$2_1 + 12 >> 2], HEAP32[$3 + 12 >> 2], ($0_1 | 0) < ($1_1 | 0) ? $0_1 : $1_1); return ($2_1 ? $2_1 : $0_1 - $1_1 | 0) | 0; } function $1677($0_1, $1_1, $2_1) { var $3 = 0; if (!(!$0_1 | !HEAP32[$0_1 + 16 >> 2])) { $3 = $1640($0_1, $1_1, $2_1, FUNCTION_TABLE[(HEAPU8[$0_1 | 0] == 1 ? 104 : 105) | 0]($1_1, $2_1) & HEAP32[$0_1 + 12 >> 2] - 1) } return $3; } function $1678($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; block1 : { $3 = HEAP32[$0_1 + 4 >> 2]; if (!($3 & 15)) { $2_1 = $34($2_1, ($3 << 2) - -64 | 0, 0); if (!$2_1) { break block1 } HEAP32[$0_1 >> 2] = $2_1; $3 = HEAP32[$0_1 + 4 >> 2]; } HEAP32[$0_1 + 4 >> 2] = $3 + 1; HEAP32[($3 << 2) + $2_1 >> 2] = $1_1; return 0; } $1672($1_1); return 7; } function $1679($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $7_1 = global$0 - 32 | 0; $8_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $8_1; $8_1 = HEAP8[$3 | 0]; block1 : { if (($8_1 | 0) < 0) { $1681($3, $7_1 + 12 | 0); break block1; } HEAP32[$7_1 + 12 >> 2] = $8_1; } $9_1 = 267; block2 : { $12_1 = $7_1 + 24 | 0; $8_1 = $1668($3, $12_1) + $3 | 0; $11_1 = $1668($8_1, $12_1) + $8_1 | 0; $15_1 = $3 + $4_1 | 0; if ($11_1 >>> 0 > $15_1 >>> 0) { break block2 } $13_1 = $6_1; $4_1 = 0; $8_1 = 0; $12_1 = $5_1; while (1) { block13 : { block5 : { if ($11_1 >>> 0 < $15_1 >>> 0) { if (!($12_1 | $13_1)) { $9_1 = 0; break block5; } $9_1 = 0; HEAP32[$7_1 + 16 >> 2] = 0; block9 : { if ($10_1 & 1) { $9_1 = HEAP8[$11_1 | 0]; block8 : { if (($9_1 | 0) < 0) { $10_1 = $1681($11_1, $7_1 + 16 | 0); $9_1 = HEAP32[$7_1 + 16 >> 2]; break block8; } HEAP32[$7_1 + 16 >> 2] = $9_1; $10_1 = 1; } if (($9_1 | 0) > ($8_1 | 0)) { break block9 } $11_1 = $10_1 + $11_1 | 0; } $8_1 = HEAP8[$11_1 | 0]; block11 : { if (($8_1 | 0) < 0) { $10_1 = $1681($11_1, $7_1 + 20 | 0); break block11; } HEAP32[$7_1 + 20 >> 2] = $8_1; $10_1 = 1; } $14 = $10_1 + $11_1 | 0; if (($14 - $3 | 0) < ($9_1 | 0)) { break block9 } $11_1 = HEAP32[$7_1 + 20 >> 2]; if (($11_1 | 0) > ($15_1 - $14 | 0) | !$11_1) { break block9 } $8_1 = ($11_1 >> 31) + ($9_1 >> 31) | 0; $10_1 = $9_1 + $11_1 | 0; $8_1 = $10_1 >>> 0 < $9_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; if (!($10_1 >>> 0 > $17_1 >>> 0 & ($8_1 | 0) >= ($18_1 | 0) | ($8_1 | 0) > ($18_1 | 0))) { $8_1 = $4_1; break block13; } $8_1 = $8_1 << 1 | $10_1 >>> 31; $18_1 = $8_1; $17_1 = $10_1 << 1; $8_1 = $34($4_1, $17_1, $8_1); if ($8_1) { break block13 } $9_1 = 7; break block5; } $9_1 = 267; break block5; } if ($12_1) { $3 = HEAP32[$7_1 + 28 >> 2]; HEAP32[$12_1 >> 2] = HEAP32[$7_1 + 24 >> 2]; HEAP32[$12_1 + 4 >> 2] = $3; } $9_1 = 0; if (!$13_1) { break block5 } $3 = HEAP32[$7_1 + 28 >> 2]; HEAP32[$13_1 >> 2] = HEAP32[$7_1 + 24 >> 2]; HEAP32[$13_1 + 4 >> 2] = $3; } $24($4_1); break block2; } $4_1 = $8_1; if ($11_1) { wasm2js_memory_copy($9_1 + $8_1 | 0, $14, $11_1) } $8_1 = $9_1 + $11_1 | 0; $16_1 = $2014($1_1, $4_1, ($2_1 | 0) > ($8_1 | 0) ? $8_1 : $2_1); $10_1 = HEAP32[$7_1 + 24 >> 2]; $9_1 = HEAP32[$7_1 + 28 >> 2]; block18 : { if ($12_1) { if ($16_1 | ($2_1 | 0) >= ($8_1 | 0) ? ($16_1 | 0) >= 0 : 0) { break block18 } HEAP32[$12_1 >> 2] = $10_1; HEAP32[$12_1 + 4 >> 2] = $9_1; $9_1 = HEAP32[$7_1 + 28 >> 2]; $10_1 = HEAP32[$7_1 + 24 >> 2]; } $12_1 = 0; if (!$13_1 | ($16_1 | 0) >= 0) { break block18 } HEAP32[$13_1 >> 2] = $10_1; HEAP32[$13_1 + 4 >> 2] = $9_1; $13_1 = 0; } $11_1 = $11_1 + $14 | 0; $10_1 = $10_1 + 1 | 0; $9_1 = $10_1 ? $9_1 : $9_1 + 1 | 0; HEAP32[$7_1 + 24 >> 2] = $10_1; HEAP32[$7_1 + 28 >> 2] = $9_1; $10_1 = 1; continue; }; } block19 : { if ($9_1) { break block19 } $4_1 = HEAP32[$7_1 + 12 >> 2]; if (($4_1 | 0) < 2) { break block19 } HEAP32[$7_1 + 24 >> 2] = 0; HEAP32[$7_1 + 20 >> 2] = 0; block22 : { block20 : { if (!$5_1 | !$6_1) { break block20 } $3 = HEAP32[$5_1 >> 2]; $8_1 = HEAP32[$5_1 + 4 >> 2]; if (($3 | 0) == HEAP32[$6_1 >> 2] & ($8_1 | 0) == HEAP32[$6_1 + 4 >> 2]) { break block20 } $9_1 = $1682($0_1, $3, $8_1, $7_1 + 24 | 0, $7_1 + 20 | 0); if (!$9_1) { $9_1 = $1679($0_1, $1_1, $2_1, HEAP32[$7_1 + 24 >> 2], HEAP32[$7_1 + 20 >> 2], $5_1, 0) } $24(HEAP32[$7_1 + 24 >> 2]); HEAP32[$7_1 + 24 >> 2] = 0; $5_1 = 0; $3 = $5_1; if ($9_1) { break block22 } } $3 = $5_1 ? $5_1 : $6_1; $9_1 = $1682($0_1, HEAP32[$3 >> 2], HEAP32[$3 + 4 >> 2], $7_1 + 24 | 0, $7_1 + 20 | 0); $3 = HEAP32[$7_1 + 24 >> 2]; block23 : { if ($9_1) { break block23 } $9_1 = 267; $12_1 = HEAP8[$3 | 0]; if (($12_1 | 0) < 0) { $1681($3, $7_1 + 16 | 0); $12_1 = HEAP32[$7_1 + 16 >> 2]; } if (($12_1 | 0) >= ($4_1 | 0)) { break block23 } $9_1 = $1679($0_1, $1_1, $2_1, $3, HEAP32[$7_1 + 20 >> 2], $5_1, $6_1); $3 = HEAP32[$7_1 + 24 >> 2]; break block22; } } $24($3); } $0_1 = $7_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1; } function $1680($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1) { var $11_1 = 0, $12_1 = 0; if (!($2_1 | $3)) { if ($4_1 | $5_1) { return 267 } $12_1 = $9_1 + 20 | 0; } $11_1 = $31($12_1 + 96 | 0, 0); if (!$11_1) { return 7 } wasm2js_memory_fill($11_1, 0, 96); HEAP32[$11_1 + 24 >> 2] = $6_1; HEAP32[$11_1 + 28 >> 2] = $7_1; HEAP32[$11_1 + 16 >> 2] = $4_1; HEAP32[$11_1 + 20 >> 2] = $5_1; HEAP32[$11_1 + 8 >> 2] = $2_1; HEAP32[$11_1 + 12 >> 2] = $3; HEAP8[$11_1 + 4 | 0] = $1_1; HEAP32[$11_1 >> 2] = $0_1; block6 : { if ($12_1) { HEAP32[$11_1 + 44 >> 2] = $9_1; HEAP8[$11_1 + 5 | 0] = 1; $0_1 = $11_1 + 96 | 0; HEAP32[$11_1 + 40 >> 2] = $0_1; if ($9_1) { wasm2js_memory_copy($0_1, $8_1, $9_1) } $0_1 = $0_1 + $9_1 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $1_1 = $0_1 + 16 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; $0_1 = $0_1 + 8 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; break block6; } $0_1 = $3 - 1 | 0; $1_1 = $2_1 - 1 | 0; $0_1 = ($1_1 | 0) != -1 ? $0_1 + 1 | 0 : $0_1; HEAP32[$11_1 + 32 >> 2] = $1_1; HEAP32[$11_1 + 36 >> 2] = $0_1; } HEAP32[$10_1 >> 2] = $11_1; return 0; } function $1681($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP8[$0_1 + 1 | 0]; $3 = HEAPU8[$0_1 | 0] & 127 | ($2_1 & 255) << 7; $4_1 = 2; block1 : { if (($2_1 | 0) >= 0) { break block1 } $2_1 = HEAP8[$0_1 + 2 | 0]; $3 = $3 & 16383 | ($2_1 & 255) << 14; $4_1 = 3; if (($2_1 | 0) >= 0) { break block1 } $2_1 = HEAP8[$0_1 + 3 | 0]; $3 = $3 & 2097151 | ($2_1 & 255) << 21; $4_1 = 4; if (($2_1 | 0) >= 0) { break block1 } $3 = $3 & 268435455 | (HEAPU8[$0_1 + 4 | 0] & 7) << 28; $4_1 = 5; } $0_1 = $4_1; HEAP32[$1_1 >> 2] = $3; return $0_1; } function $1682($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $16_1 = global$0 - 16 | 0; $8_1 = $16_1; if (global$4 >>> 0 < $8_1 >>> 0 | global$5 >>> 0 > $8_1 >>> 0) { fimport$30($8_1 | 0) } global$0 = $8_1; $17_1 = $0_1 + 252 | 0; $8_1 = HEAP32[$0_1 + 252 >> 2]; block3 : { block1 : { if ($8_1) { $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block10 : { if (!$8_1) { $0_1 = $1(103256); break block10; } $9_1 = HEAP32[$8_1 + 20 >> 2]; $0_1 = HEAP32[$8_1 + 16 >> 2]; block31 : { if (!$0_1) { $1_1 = 4; break block31; } HEAP32[$0_1 + 36 >> 2] = 0; $1_1 = $317($8_1, $1_1, $2_1, $5_1 + 12 | 0); if (!$1_1) { break block31 } $0_1 = HEAP32[$5_1 + 12 >> 2]; HEAP32[$5_1 >> 2] = $0_1; $131($9_1, $1_1, $0_1 ? 8932 : 0, $5_1); $10($9_1, $0_1); } $0_1 = $114($9_1, $1_1); } $1_1 = $5_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; break block1; } block2 : { $8_1 = HEAP32[$0_1 + 248 >> 2]; if ($8_1) { break block2 } HEAP32[$16_1 >> 2] = HEAP32[$0_1 + 20 >> 2]; $8_1 = $61(4058, $16_1); HEAP32[$0_1 + 248 >> 2] = $8_1; if ($8_1) { break block2 } $0_1 = 7; break block3; } $7_1 = HEAP32[$0_1 + 12 >> 2]; $19_1 = HEAP32[$0_1 + 16 >> 2]; $0_1 = $17_1; $6_1 = global$0 - 352 | 0; $9_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $9_1; HEAP32[$6_1 + 348 >> 2] = 0; HEAP32[$0_1 >> 2] = 0; $11_1 = $270($7_1, 32, 0); block22 : { block23 : { block7 : { block21 : { label4 : while (1) { block : { $9_1 = $6_1 + 60 | 0; $139($9_1, $7_1); if (!$11_1) { break block } $10($7_1, HEAP32[$6_1 + 348 >> 2]); HEAP32[$6_1 + 348 >> 2] = 0; $4($7_1); block6 : { $12_1 = $308($9_1, 0, $8_1, $19_1); if ($12_1) { $5_1 = HEAPU8[$12_1 + 43 | 0]; $10_1 = 8452; block32 : { if (($5_1 | 0) == 1) { break block32 } $9_1 = HEAP32[$12_1 + 28 >> 2]; $10_1 = 8632; if ($9_1 & 128) { break block32 } $10_1 = 7640; if ($9_1 & 96) { break block32 } if (($5_1 | 0) != 2) { break block6 } $10_1 = 7597; } $0_1 = $10_1; HEAP32[$6_1 + 16 >> 2] = $8_1; $257($6_1 + 60 | 0, $0_1, $6_1 + 16 | 0); } $13_1 = 1; if (!HEAP32[$6_1 + 64 >> 2]) { break block7 } $10($7_1, 0); HEAP32[$6_1 + 348 >> 2] = HEAP32[$6_1 + 64 >> 2]; HEAP32[$6_1 + 64 >> 2] = 0; break block7; } HEAP32[$11_1 + 28 >> 2] = $12_1; HEAP32[$11_1 + 24 >> 2] = HEAP32[HEAP32[$7_1 + 16 >> 2] + ($309($7_1, HEAP32[$12_1 + 60 >> 2]) << 4) >> 2]; $5_1 = 0; $14 = HEAP16[$12_1 + 34 >> 1]; $9_1 = ($14 | 0) > 0 ? $14 : 0; while (1) { block9 : { if (($5_1 | 0) != ($9_1 | 0)) { if ($67(HEAP32[HEAP32[$12_1 + 4 >> 2] + Math_imul($5_1, 12) >> 2], 12039)) { break block9 } $9_1 = $5_1; } if (($9_1 | 0) == ($14 | 0)) { $10($7_1, 0); HEAP32[$6_1 + 32 >> 2] = 12039; HEAP32[$6_1 + 348 >> 2] = $310($7_1, 29928, $6_1 + 32 | 0); $13_1 = 1; break block7; } $10_1 = $311($6_1 + 60 | 0); HEAP32[$11_1 + 16 >> 2] = $10_1; block20 : { block18 : { if ($10_1) { $5_1 = HEAP32[$12_1 + 60 >> 2]; $14 = $309($7_1, $5_1); $312($10_1, 2, $14, 0, HEAP32[$5_1 >> 2], HEAP32[$5_1 + 4 >> 2]); $5_1 = HEAP32[$10_1 + 108 >> 2]; if (($5_1 | 0) > 0) { HEAP16[(HEAP32[$10_1 + 104 >> 2] + Math_imul($5_1, 20) | 0) - 18 >> 1] = 1 } $15_1 = $313($10_1, 6, 31392); $314($10_1, $14); if (HEAPU8[$7_1 + 87 | 0]) { break block18 } HEAP32[$15_1 + 4 >> 2] = $14; $5_1 = HEAP32[$12_1 + 20 >> 2]; HEAP32[$15_1 + 12 >> 2] = 0; HEAP32[$15_1 + 8 >> 2] = $5_1; $315($10_1, 2, HEAP32[$12_1 >> 2], 0); if (HEAPU8[$7_1 + 87 | 0]) { break block18 } $5_1 = HEAP32[$12_1 + 20 >> 2]; HEAP32[$15_1 + 32 >> 2] = $14; HEAP32[$15_1 + 28 >> 2] = $5_1; HEAP8[$15_1 + 21 | 0] = 253; HEAP32[$15_1 + 36 >> 2] = HEAP16[$12_1 + 34 >> 1] + 1; HEAP32[$15_1 + 68 >> 2] = HEAP16[$12_1 + 34 >> 1]; HEAP16[$6_1 + 280 >> 1] = 0; HEAP32[$6_1 + 104 >> 2] = 1; HEAP32[$6_1 + 108 >> 2] = 1; $316($10_1, $6_1 + 60 | 0); } $5_1 = HEAPU8[$7_1 + 87 | 0]; HEAP32[$11_1 + 20 >> 2] = $7_1; HEAP16[$11_1 + 8 >> 1] = $9_1; if ($5_1) { break block20 } $13_1 = $317($11_1, $1_1, $2_1, $6_1 + 348 | 0); if (($13_1 | 0) != 17 | $18_1 >>> 0 > 48) { break block20 } $18_1 = $18_1 + 1 | 0; $141($6_1 + 60 | 0); $13_1 = 17; continue label4; } HEAP32[$11_1 + 20 >> 2] = $7_1; HEAP16[$11_1 + 8 >> 1] = $9_1; } if ($13_1) { break block21 } break block; } $5_1 = $5_1 + 1 | 0; continue; }; } break; }; $13_1 = 0; if (HEAPU8[$7_1 + 87 | 0]) { break block21 } HEAP32[$0_1 >> 2] = $11_1; break block22; } if (!$11_1) { break block23 } } $0_1 = HEAP32[$11_1 + 16 >> 2]; if (!$0_1) { break block23 } $126($0_1); } $10($7_1, $11_1); } $0_1 = HEAP32[$6_1 + 348 >> 2]; HEAP32[$6_1 >> 2] = $0_1; $131($7_1, $13_1, $0_1 ? 8932 : 0, $6_1); $10($7_1, $0_1); $141($6_1 + 60 | 0); $0_1 = $114($7_1, $13_1); $1_1 = $6_1 + 352 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; } if (!$0_1) { $0_1 = 0; $1_1 = HEAP32[$17_1 >> 2]; $2_1 = 0; block5 : { if (!$1_1) { break block5 } $2_1 = 0; if (!HEAP32[$1_1 + 16 >> 2]) { break block5 } $2_1 = HEAP32[$1_1 >> 2]; } HEAP32[$4_1 >> 2] = $2_1; if (!$3) { break block3 } $0_1 = $2_1 >> 31; $1_1 = $2_1 + 20 | 0; $0_1 = $1_1 >>> 0 < 20 ? $0_1 + 1 | 0 : $0_1; $4_1 = $31($1_1, $0_1); block73 : { if (!$4_1) { $4_1 = 0; $0_1 = 7; break block73; } $0_1 = $335(HEAP32[$17_1 >> 2], $4_1, $2_1, 0); $2_1 = $2_1 + $4_1 | 0; $1_1 = $2_1 + 16 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; $1_1 = $2_1 + 8 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = 0; HEAP8[$1_1 + 6 | 0] = 0; HEAP8[$1_1 + 7 | 0] = 0; HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; HEAP8[$2_1 + 4 | 0] = 0; HEAP8[$2_1 + 5 | 0] = 0; HEAP8[$2_1 + 6 | 0] = 0; HEAP8[$2_1 + 7 | 0] = 0; if (!$0_1) { $0_1 = 0; break block73; } $24($4_1); $4_1 = 0; } HEAP32[$3 >> 2] = $4_1; break block3; } $0_1 = ($0_1 | 0) == 1 ? 267 : $0_1; } $1_1 = $16_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1683($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; $4_1 = 1; if (($1_1 | 0) == ($3 | 0)) { $4_1 = $2081($0_1, $2_1, $1_1) } return $4_1 | 0; } function $1684($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; $4_1 = 1; if (($1_1 | 0) == ($3 | 0)) { $4_1 = $2014($0_1, $2_1, $1_1) } return $4_1 | 0; } function $1685($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $8_1 = global$0 - 16 | 0; $2_1 = $8_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block5 : { block7 : { $2_1 = HEAP32[$1_1 + 72 >> 2]; if ($2_1) { $3 = $2_1 + HEAP32[$1_1 + 76 >> 2] | 0 } else { $3 = HEAP32[$1_1 + 40 >> 2] } if (!(!!$3 & HEAP32[$1_1 + 40 >> 2] + HEAP32[$1_1 + 44 >> 2] >>> 0 > $3 >>> 0)) { block11 : { $2_1 = HEAP32[$1_1 + 56 >> 2]; block10 : { if ($2_1) { $7_1 = HEAP32[$2_1 >> 2]; $24(HEAP32[$1_1 + 40 >> 2]); $0_1 = 0; HEAP32[$1_1 + 40 >> 2] = 0; if (!$7_1) { break block5 } $4_1 = HEAP32[$7_1 + 8 >> 2]; $2_1 = HEAP32[$4_1 >> 2]; $6_1 = HEAP32[$1_1 + 64 >> 2]; $5_1 = HEAP32[$7_1 + 16 >> 2]; if (($5_1 | 0) >= HEAP32[$1_1 + 68 >> 2]) { $24($6_1); $0_1 = $5_1 >> 31 << 1 | $5_1 >>> 31; $6_1 = ($5_1 << 1) + 2 | 0; $0_1 = $6_1 >>> 0 < 2 ? $0_1 + 1 | 0 : $0_1; $6_1 = $31($6_1, $0_1); HEAP32[$1_1 + 64 >> 2] = $6_1; if (!$6_1) { break block7 } HEAP32[$1_1 + 68 >> 2] = ($5_1 << 1) + 2; } $0_1 = $2_1 + 1 | 0; if ($5_1) { wasm2js_memory_copy($6_1, HEAP32[$7_1 + 12 >> 2], $5_1) } HEAP8[$5_1 + HEAP32[$1_1 + 64 >> 2] | 0] = 0; HEAP32[$1_1 + 60 >> 2] = $5_1; $2_1 = $31($0_1, $0_1 >> 31); if (!$2_1) { break block7 } if ($0_1) { wasm2js_memory_copy($2_1, HEAP32[$4_1 + 4 >> 2], $0_1) } HEAP32[$1_1 + 72 >> 2] = $2_1; HEAP32[$1_1 + 44 >> 2] = $0_1; HEAP32[$1_1 + 76 >> 2] = $0_1; HEAP32[$1_1 + 40 >> 2] = $2_1; HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] + 4; break block10; } $1687($1_1); $4_1 = HEAP32[$1_1 + 32 >> 2]; $2_1 = HEAP32[$1_1 + 36 >> 2]; $6_1 = HEAP32[$1_1 + 20 >> 2]; if ($4_1 >>> 0 < HEAPU32[$1_1 + 16 >> 2] & ($2_1 | 0) <= ($6_1 | 0) | ($2_1 | 0) < ($6_1 | 0)) { break block11 } } $0_1 = 0; break block5; } $4_1 = $4_1 + 1 | 0; $2_1 = $4_1 ? $2_1 : $2_1 + 1 | 0; HEAP32[$1_1 + 32 >> 2] = $4_1; HEAP32[$1_1 + 36 >> 2] = $2_1; $3 = $2_1; $2_1 = $1_1 + 40 | 0; $0_1 = $1682($0_1, $4_1, $3, $2_1, $1_1 + 44 | 0); if ($0_1) { break block5 } $3 = HEAP32[$2_1 >> 2]; } $0_1 = $1690($1_1, $3, 20); if ($0_1) { break block5 } $0_1 = HEAP8[$3 | 0]; block13 : { if (($0_1 | 0) < 0) { $0_1 = $1681($3, $8_1 + 12 | 0); break block13; } HEAP32[$8_1 + 12 >> 2] = $0_1; $0_1 = 1; } $0_1 = $0_1 + $3 | 0; $3 = HEAP8[$0_1 | 0]; block15 : { if (($3 | 0) < 0) { $2_1 = $1681($0_1, $8_1 + 8 | 0); $3 = HEAP32[$8_1 + 8 >> 2]; break block15; } HEAP32[$8_1 + 8 >> 2] = $3; $2_1 = 1; } block16 : { if (($3 | 0) <= 0) { break block16 } $7_1 = $0_1 + $2_1 | 0; if (((HEAP32[$1_1 + 40 >> 2] + HEAP32[$1_1 + 44 >> 2] | 0) - $7_1 | 0) < ($3 | 0)) { break block16 } $5_1 = HEAP32[$8_1 + 12 >> 2]; if (($5_1 | 0) > HEAP32[$1_1 + 60 >> 2]) { break block16 } $0_1 = $5_1 >> 31; $4_1 = HEAP32[$1_1 + 68 >> 2]; $6_1 = $4_1; $2_1 = $3 + $5_1 | 0; $0_1 = $2_1 >>> 0 < $3 >>> 0 ? $0_1 + 1 | 0 : $0_1; $4_1 = $4_1 >> 31; if (!(($0_1 | 0) <= ($4_1 | 0) & $2_1 >>> 0 <= $6_1 >>> 0 | ($0_1 | 0) < ($4_1 | 0))) { $0_1 = $0_1 << 1 | $2_1 >>> 31; $2_1 = $2_1 << 1; $0_1 = $34(HEAP32[$1_1 + 64 >> 2], $2_1, $0_1); if (!$0_1) { break block7 } HEAP32[$1_1 + 68 >> 2] = $2_1; HEAP32[$1_1 + 64 >> 2] = $0_1; } $0_1 = $1690($1_1, $7_1, $3 + 10 | 0); if ($0_1) { break block5 } if ($3) { wasm2js_memory_copy($5_1 + HEAP32[$1_1 + 64 >> 2] | 0, $7_1, $3) } HEAP32[$1_1 + 60 >> 2] = $3 + $5_1; $0_1 = $3 + $7_1 | 0; $3 = HEAP8[$0_1 | 0]; block20 : { if (($3 | 0) < 0) { $2_1 = $1681($0_1, $1_1 + 76 | 0); $3 = HEAP32[$1_1 + 76 >> 2]; break block20; } HEAP32[$1_1 + 76 >> 2] = $3; $2_1 = 1; } HEAP32[$1_1 + 80 >> 2] = 0; $2_1 = $0_1 + $2_1 | 0; HEAP32[$1_1 + 72 >> 2] = $2_1; if ((HEAP32[$1_1 + 40 >> 2] + (HEAP32[$1_1 + 44 >> 2] - $2_1 | 0) | 0) < ($3 | 0)) { break block16 } if (!HEAP32[$1_1 + 48 >> 2]) { $0_1 = 267; if (HEAPU8[($2_1 + $3 | 0) - 1 | 0]) { break block5 } } $0_1 = $3 ? 0 : 267; break block5; } $0_1 = 267; break block5; } $0_1 = 7; } $1_1 = $8_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1686($0_1, $1_1, $2_1) { var $3 = 0; if (!HEAP32[$0_1 + 40 >> 2]) { return 0 } $3 = HEAP32[$0_1 + 64 >> 2]; $0_1 = HEAP32[$0_1 + 60 >> 2]; $1_1 = $2014($3, $1_1, ($0_1 | 0) < ($2_1 | 0) ? $0_1 : $2_1); return $1_1 ? $1_1 : $0_1 - $2_1 | 0; } function $1687($0_1) { if (!HEAPU8[$0_1 + 5 | 0]) { $24(HEAP32[$0_1 + 40 >> 2]); $334(HEAP32[$0_1 + 52 >> 2]); HEAP32[$0_1 + 52 >> 2] = 0; } HEAP32[$0_1 + 40 >> 2] = 0; } function $1688($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = HEAP32[$1_1 + 40 >> 2]; block3 : { block2 : { $3 = HEAP32[$0_1 + 40 >> 2]; if ($3) { if ($2_1) { break block2 } $2_1 = -1; } else { $2_1 = $2_1 ? 0 : -1 } $2_1 = $2_1 + !$3 | 0; break block3; } $3 = HEAP32[$0_1 + 60 >> 2]; $4_1 = HEAP32[$1_1 + 60 >> 2]; $2_1 = $3 - $4_1 | 0; $3 = $2014(HEAP32[$0_1 + 64 >> 2], HEAP32[$1_1 + 64 >> 2], ($2_1 | 0) < 0 ? $3 : $4_1); $2_1 = $3 ? $3 : $2_1; } if (!$2_1) { $2_1 = HEAP32[$1_1 >> 2] - HEAP32[$0_1 >> 2] | 0 } return $2_1 | 0; } function $1689($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $6_1 = $1_1 - 1 | 0; $2_1 = $2_1 - (($1_1 | 0) == ($2_1 | 0)) | 0; while (1) { $5_1 = $2_1 - 1 | 0; $1_1 = $5_1; block1 : { if (($2_1 | 0) > 0) { while (1) { if (($1_1 | 0) >= ($6_1 | 0)) { break block1 } $2_1 = ($1_1 << 2) + $0_1 | 0; $1_1 = $1_1 + 1 | 0; $4_1 = ($1_1 << 2) + $0_1 | 0; if ((FUNCTION_TABLE[$3 | 0](HEAP32[$2_1 >> 2], HEAP32[$4_1 >> 2]) | 0) < 0) { break block1 } $7_1 = HEAP32[$4_1 >> 2]; HEAP32[$4_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$2_1 >> 2] = $7_1; continue; } } return; } $2_1 = $5_1; continue; }; } function $1690($0_1, $1_1, $2_1) { $2_1 = $1_1 + $2_1 | 0; $1_1 = 0; while (1) { block1 : { if (!($1_1 | !HEAP32[$0_1 + 52 >> 2])) { if (HEAP32[$0_1 + 48 >> 2] < ($2_1 - HEAP32[$0_1 + 40 >> 2] | 0)) { break block1 } $1_1 = 0; } return $1_1; } $1_1 = $1691($0_1); continue; }; } function $1691($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 + 48 >> 2]; $2_1 = HEAP32[$0_1 + 44 >> 2] - $1_1 | 0; $2_1 = ($2_1 | 0) >= 4096 ? 4096 : $2_1; $3 = $335(HEAP32[$0_1 + 52 >> 2], $1_1 + HEAP32[$0_1 + 40 >> 2] | 0, $2_1, $1_1); block : { if ($3) { break block } $1_1 = $2_1 + HEAP32[$0_1 + 48 >> 2] | 0; HEAP32[$0_1 + 48 >> 2] = $1_1; $1_1 = $1_1 + HEAP32[$0_1 + 40 >> 2] | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = 0; HEAP8[$1_1 + 6 | 0] = 0; HEAP8[$1_1 + 7 | 0] = 0; $2_1 = $1_1 + 16 | 0; HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; $1_1 = $1_1 + 8 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; HEAP8[$1_1 + 4 | 0] = 0; HEAP8[$1_1 + 5 | 0] = 0; HEAP8[$1_1 + 6 | 0] = 0; HEAP8[$1_1 + 7 | 0] = 0; if (HEAP32[$0_1 + 48 >> 2] != HEAP32[$0_1 + 44 >> 2]) { break block } $334(HEAP32[$0_1 + 52 >> 2]); HEAP32[$0_1 + 48 >> 2] = 0; HEAP32[$0_1 + 52 >> 2] = 0; } return $3; } function $1692($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = !HEAP32[$0_1 + 80 >> 2] - !HEAP32[$1_1 + 80 >> 2] | 0; if (!$2_1) { $2_1 = HEAP32[$1_1 + 88 >> 2]; $5_1 = HEAP32[$0_1 + 88 >> 2]; $3 = HEAP32[$0_1 + 92 >> 2]; $4_1 = HEAP32[$1_1 + 92 >> 2]; if (!(($2_1 | 0) != ($5_1 | 0) | ($3 | 0) != ($4_1 | 0))) { return HEAP32[$1_1 >> 2] - HEAP32[$0_1 >> 2] | 0 } $2_1 = ($3 | 0) <= ($4_1 | 0) & $2_1 >>> 0 > $5_1 >>> 0 | ($3 | 0) < ($4_1 | 0) ? 1 : -1; } return $2_1 | 0; } function $1693($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = !HEAP32[$0_1 + 80 >> 2] - !HEAP32[$1_1 + 80 >> 2] | 0; if (!$2_1) { $2_1 = HEAP32[$1_1 + 88 >> 2]; $5_1 = HEAP32[$0_1 + 88 >> 2]; $3 = HEAP32[$0_1 + 92 >> 2]; $4_1 = HEAP32[$1_1 + 92 >> 2]; if (!(($2_1 | 0) != ($5_1 | 0) | ($3 | 0) != ($4_1 | 0))) { return HEAP32[$1_1 >> 2] - HEAP32[$0_1 >> 2] | 0 } $2_1 = $2_1 >>> 0 < $5_1 >>> 0 & ($3 | 0) >= ($4_1 | 0) | ($3 | 0) > ($4_1 | 0) ? 1 : -1; } return $2_1 | 0; } function $1694($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = $2_1 + 20 | 0; $3 = $4_1 >>> 0 < 20 ? $3 + 1 | 0 : $3; $5_1 = HEAPU32[$0_1 + 24 >> 2] < $4_1 >>> 0; $4_1 = HEAP32[$0_1 + 28 >> 2]; block1 : { if (!($5_1 & ($4_1 | 0) <= ($3 | 0) | ($3 | 0) > ($4_1 | 0))) { $5_1 = HEAP32[$0_1 + 16 >> 2]; break block1; } $3 = ($2_1 << 1) + 20 | 0; $4_1 = $3 >> 31; $5_1 = $34(HEAP32[$0_1 + 16 >> 2], $3, $4_1); if (!$5_1) { return 7 } HEAP32[$0_1 + 24 >> 2] = $3; HEAP32[$0_1 + 28 >> 2] = $4_1; HEAP32[$0_1 + 16 >> 2] = $5_1; } if ($2_1) { wasm2js_memory_copy($5_1, $1_1, $2_1) } $0_1 = HEAP32[$0_1 + 16 >> 2] + $2_1 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $1_1 = $0_1 + 16 | 0; HEAP8[$1_1 | 0] = 0; HEAP8[$1_1 + 1 | 0] = 0; HEAP8[$1_1 + 2 | 0] = 0; HEAP8[$1_1 + 3 | 0] = 0; $0_1 = $0_1 + 8 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; return 0; } function $1695($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!(!HEAPU8[$0_1 + 239 | 0] | !HEAP32[$1_1 + 56 >> 2])) { $0_1 = 0; HEAP32[$1_1 + 84 >> 2] = 0; HEAP32[$1_1 + 88 >> 2] = 0; HEAP32[$1_1 + 92 >> 2] = 0; $1702(0, HEAP32[$1_1 + 72 >> 2], HEAP32[$1_1 + 76 >> 2], $1_1 + 80 | 0, $1_1 + 88 | 0, $1_1 + 84 | 0, $2_1 + 15 | 0); break block1; } $0_1 = $1690($1_1, HEAP32[$1_1 + 72 >> 2], 10); if ($0_1) { break block1 } HEAP32[$1_1 + 80 >> 2] = $1668(HEAP32[$1_1 + 72 >> 2], $1_1 + 88 | 0) + HEAP32[$1_1 + 72 >> 2]; $0_1 = 0; } $1_1 = $2_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1696($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $5_1 = global$0 - 16 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $4_1 = HEAP32[$1_1 + 80 >> 2]; HEAP32[$5_1 + 12 >> 2] = $4_1; block2 : { if (!(!HEAPU8[$0_1 + 239 | 0] | !HEAP32[$1_1 + 56 >> 2])) { HEAP8[$5_1 + 11 | 0] = 0; if ($2_1) { HEAP32[$2_1 >> 2] = $4_1; HEAP32[$3 >> 2] = HEAP32[$1_1 + 84 >> 2] - 1; } $1702(0, HEAP32[$1_1 + 72 >> 2], HEAP32[$1_1 + 76 >> 2], $5_1 + 12 | 0, $1_1 + 88 | 0, $1_1 + 84 | 0, $5_1 + 11 | 0); HEAP32[$1_1 + 80 >> 2] = HEAPU8[$5_1 + 11 | 0] ? 0 : HEAP32[$5_1 + 12 >> 2]; break block2; } $7_1 = HEAP32[$1_1 + 72 >> 2] + HEAP32[$1_1 + 76 >> 2] | 0; while (1) { $6_1 = HEAPU8[$4_1 | 0]; if ($8_1 | $6_1) { $8_1 = $6_1 & 128; $4_1 = $4_1 + 1 | 0; continue; } if (!(!HEAP32[$1_1 + 52 >> 2] | HEAP32[$1_1 + 40 >> 2] + HEAP32[$1_1 + 48 >> 2] >>> 0 > $4_1 >>> 0)) { $6_1 = $1691($1_1); if (!$6_1) { continue } break block2; } break; }; $4_1 = $4_1 + 1 | 0; HEAP32[$5_1 + 12 >> 2] = $4_1; if ($2_1) { $6_1 = $2_1; $2_1 = HEAP32[$1_1 + 80 >> 2]; HEAP32[$6_1 >> 2] = $2_1; HEAP32[$3 >> 2] = ($2_1 ^ -1) + $4_1; } block7 : { while (1) { if ($4_1 >>> 0 < $7_1 >>> 0) { if (HEAPU8[$4_1 | 0]) { break block7 } $4_1 = $4_1 + 1 | 0; continue; } break; }; $6_1 = 0; HEAP32[$1_1 + 80 >> 2] = 0; break block2; } HEAP32[$5_1 + 12 >> 2] = $4_1; $6_1 = $1690($1_1, $4_1, 10); if ($6_1) { break block2 } HEAP32[$1_1 + 80 >> 2] = $1668($4_1, $5_1) + $4_1; $2_1 = HEAP32[$5_1 >> 2]; $0_1 = HEAPU8[$0_1 + 239 | 0]; $4_1 = $0_1 ? 0 - $2_1 | 0 : $2_1; $3 = $4_1 + HEAP32[$1_1 + 88 >> 2] | 0; $6_1 = ($2_1 | 0) != 0; $2_1 = HEAP32[$5_1 + 4 >> 2]; $0_1 = HEAP32[$1_1 + 92 >> 2] + ($0_1 ? 0 - ($6_1 + $2_1 | 0) | 0 : $2_1) | 0; HEAP32[$1_1 + 88 >> 2] = $3; HEAP32[$1_1 + 92 >> 2] = $3 >>> 0 < $4_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; $6_1 = 0; } $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1697($0_1, $1_1, $2_1) { var $3 = 0; $3 = HEAP32[$0_1 + 28 >> 2]; if (!(($3 | 0) >= ($2_1 | 0) & HEAPU32[$0_1 + 24 >> 2] >= $1_1 >>> 0 | ($2_1 | 0) < ($3 | 0))) { $2_1 = $2_1 << 1 | $1_1 >>> 31; $1_1 = $1_1 << 1; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 28 >> 2] = $2_1; $1_1 = $34(HEAP32[$0_1 + 16 >> 2], $1_1, $2_1); if (!$1_1) { return 7 } HEAP32[$0_1 + 16 >> 2] = $1_1; } return 0; } function $1698($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $8_1 = global$0 - 16 | 0; $4_1 = $8_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $7_1 = HEAP32[$3 >> 2]; $4_1 = HEAP32[$2_1 >> 2]; HEAP32[$8_1 + 12 >> 2] = 0; $10_1 = $4_1 + $7_1 | 0; $5_1 = $4_1; while (1) { $6_1 = 0; while (1) { block : { if ($5_1 >>> 0 >= $10_1 >>> 0) { break block } $9_1 = $6_1; $6_1 = HEAPU8[$5_1 | 0]; if (!($9_1 | $6_1 & 254)) { break block } $6_1 = $6_1 & 128; $5_1 = $5_1 + 1 | 0; continue; } break; }; block2 : { if (($0_1 | 0) == HEAP32[$8_1 + 12 >> 2]) { $7_1 = $5_1 - $4_1 | 0; break block2; } $7_1 = ($4_1 - $5_1 | 0) + $7_1 | 0; if (($7_1 | 0) <= 0) { $4_1 = $5_1; break block2; } $9_1 = $5_1 + 1 | 0; $4_1 = HEAP8[$5_1 + 1 | 0]; block5 : { if (($4_1 | 0) < 0) { $6_1 = $1681($9_1, $8_1 + 12 | 0); break block5; } HEAP32[$8_1 + 12 >> 2] = $4_1; $6_1 = 1; } $4_1 = $5_1; $5_1 = $6_1 + $9_1 | 0; continue; } break; }; block6 : { if (!$1_1) { break block6 } $0_1 = $4_1 + $7_1 | 0; $1_1 = $10_1 - $0_1 | 0; if (($1_1 | 0) <= 0 | !$1_1) { break block6 } wasm2js_memory_fill($0_1, 0, $1_1); } HEAP32[$2_1 >> 2] = $4_1; HEAP32[$3 >> 2] = $7_1; $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1699($0_1, $1_1) { var $2_1 = 0, $3 = 0; while (1) { $2_1 = $2_1 + 1 | 0; $3 = !$1_1 & $0_1 >>> 0 > 127 | ($1_1 | 0) != 0; $0_1 = ($1_1 & 127) << 25 | $0_1 >>> 7; $1_1 = $1_1 >>> 7 | 0; if ($3) { continue } break; }; return $2_1; } function $1700($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = $0_1; while (1) { $4_1 = $1_1; $5_1 = $3; HEAP8[$3 | 0] = $1_1 | 128; $3 = $3 + 1 | 0; $6_1 = !$2_1 & $1_1 >>> 0 > 127 | ($2_1 | 0) != 0; $1_1 = ($2_1 & 127) << 25 | $1_1 >>> 7; $2_1 = $2_1 >>> 7 | 0; if ($6_1) { continue } break; }; HEAP8[$5_1 | 0] = $4_1; return $3 - $0_1 | 0; } function $1701($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = HEAP32[$1_1 >> 2]; $3 = $5_1; while (1) { $4_1 = $2_1; $2_1 = HEAPU8[$3 | 0]; if ($4_1 | $2_1 & 254) { $2_1 = $2_1 & 128; $3 = $3 + 1 | 0; continue; } break; }; if ($0_1) { $2_1 = HEAP32[$0_1 >> 2]; $4_1 = $3 - $5_1 | 0; if ($4_1) { wasm2js_memory_copy($2_1, $5_1, $4_1) } HEAP32[$0_1 >> 2] = $2_1 + $4_1; } HEAP32[$1_1 >> 2] = $3; } function $1702($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $7_1 = global$0 - 16 | 0; $8_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $8_1; $8_1 = HEAP32[$3 >> 2]; block3 : { if (!$8_1) { $8_1 = 1; $6_1 = $0_1 ? -1 : 1; $11_1 = $0_1 ? -1 : 0; HEAP32[$7_1 + 4 >> 2] = $1_1; $12_1 = $1_1 + $2_1 | 0; $2_1 = 0; $0_1 = 0; while (1) { if (!($1_1 >>> 0 >= $12_1 >>> 0)) { $0_1 = $1668($1_1, $7_1 + 8 | 0) + $1_1 | 0; HEAP32[$7_1 + 4 >> 2] = $0_1; $1_1 = HEAP32[$7_1 + 12 >> 2]; $13_1 = HEAP32[$7_1 + 8 >> 2]; $1703(0, $7_1 + 4 | 0); $1_1 = __wasm_i64_mul($13_1, $1_1, $8_1, $9_1); $10_1 = $10_1 + i64toi32_i32$HIGH_BITS | 0; $8_1 = $2_1; $2_1 = $1_1 + $2_1 | 0; $10_1 = $8_1 >>> 0 > $2_1 >>> 0 ? $10_1 + 1 | 0 : $10_1; $1_1 = HEAP32[$7_1 + 4 >> 2]; while (1) { if (!(HEAPU8[$1_1 | 0] | $1_1 >>> 0 >= $12_1 >>> 0)) { $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$7_1 + 4 >> 2] = $1_1; $8_1 = $6_1; $9_1 = $11_1; continue; } break; }; HEAP32[$5_1 >> 2] = $12_1 - $0_1; HEAP32[$3 >> 2] = $0_1; HEAP32[$4_1 >> 2] = $2_1; HEAP32[$4_1 + 4 >> 2] = $10_1; break block3; } $9_1 = $8_1 - 2 | 0; while (1) { if (!($1_1 >>> 0 > $9_1 >>> 0 | HEAP8[$9_1 | 0] >= 0)) { $9_1 = $9_1 - 1 | 0; continue; } break; }; $8_1 = $9_1 + 1 | 0; $1668($8_1, $7_1 + 8 | 0); $2_1 = HEAP32[$7_1 + 8 >> 2]; $11_1 = 0 - $2_1 | 0; $10_1 = $0_1 ? $2_1 : $11_1; $11_1 = $10_1 + HEAP32[$4_1 >> 2] | 0; $12_1 = HEAP32[$7_1 + 12 >> 2]; $0_1 = HEAP32[$4_1 + 4 >> 2] + ($0_1 ? $12_1 : 0 - ($12_1 + (($2_1 | 0) != 0) | 0) | 0) | 0; HEAP32[$4_1 >> 2] = $11_1; HEAP32[$4_1 + 4 >> 2] = $10_1 >>> 0 > $11_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; block11 : { if (($1_1 | 0) != ($8_1 | 0)) { $4_1 = -1; while (1) { block7 : { $0_1 = $4_1 + $9_1 | 0; if ($1_1 >>> 0 >= $0_1 >>> 0) { $2_1 = 0; break block7; } $4_1 = $4_1 - 1 | 0; $2_1 = HEAPU8[$0_1 | 0]; if (!$2_1) { continue } } break; }; block10 : { block9 : { while (1) { $0_1 = $4_1 + $9_1 | 0; if ($0_1 >>> 0 > $1_1 >>> 0) { $6_1 = HEAPU8[$0_1 | 0]; if (!($2_1 << 24 >> 24 | $6_1 & 128)) { break block9 } $4_1 = $4_1 - 1 | 0; $2_1 = $6_1; continue; } break; }; if ($2_1 & 255 | ($4_1 | 0) > -2) { break block10 } } $0_1 = $0_1 + 2 | 0; } while (1) { $1_1 = HEAP8[$0_1 | 0]; $0_1 = $0_1 + 1 | 0; if (($1_1 | 0) < 0) { continue } break; }; HEAP32[$5_1 >> 2] = $8_1 - $0_1; $8_1 = $0_1; break block11; } HEAP8[$6_1 | 0] = 1; } HEAP32[$3 >> 2] = $8_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1703($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$1_1 >> 2]; $2_1 = $4_1; while (1) { $5_1 = $2_1 + 1 | 0; $2_1 = HEAP8[$2_1 | 0]; if ($2_1 | $3 << 24 >> 24) { $3 = $2_1 & 128; $2_1 = $5_1; continue; } break; }; if ($0_1) { $3 = HEAP32[$0_1 >> 2]; $2_1 = $5_1 - $4_1 | 0; if ($2_1) { wasm2js_memory_copy($3, $4_1, $2_1) } HEAP32[$0_1 >> 2] = $2_1 + $3; } HEAP32[$1_1 >> 2] = $5_1; } function $1704($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = $23(132); if (!$3) { return 7 } wasm2js_memory_fill($3, 0, 132); block3 : { if (($0_1 | 0) <= 1) { $1_1 = $3 + 4 | 0; $0_1 = 1; while (1) { if (($0_1 | 0) == 128) { break block3 } HEAP8[$0_1 + $1_1 | 0] = 0 - ($0_1 - 58 >>> 0 < 4294967286 & ($0_1 & 95) - 91 >>> 0 < 4294967270); $0_1 = $0_1 + 1 | 0; continue; }; } $0_1 = $2080(HEAP32[$1_1 + 4 >> 2]); $5_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $6_1 = $3 + 4 | 0; $0_1 = 0; while (1) { if (($0_1 | 0) == ($5_1 | 0)) { break block3 } $4_1 = HEAP8[HEAP32[$1_1 + 4 >> 2] + $0_1 | 0]; if (($4_1 | 0) >= 0) { HEAP8[$6_1 + $4_1 | 0] = 1; $0_1 = $0_1 + 1 | 0; continue; } break; }; $24($3); return 1; } HEAP32[$2_1 >> 2] = $3; return 0; } function $1706($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0; $4_1 = $23(28); if (!$4_1) { return 7 } HEAP32[$4_1 + 4 >> 2] = $1_1; $0_1 = 0; block1 : { if (!$1_1) { break block1 } $0_1 = $2_1; if (($0_1 | 0) >= 0) { break block1 } $0_1 = $2080($1_1); } HEAP32[$4_1 + 12 >> 2] = 0; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 8 >> 2] = $0_1; $0_1 = $4_1 + 20 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$3 >> 2] = $4_1; return 0; } function $1708($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $10_1 = HEAP32[$0_1 >> 2] + 4 | 0; $6_1 = HEAP32[$0_1 + 12 >> 2]; $7_1 = HEAP32[$0_1 + 8 >> 2]; $13_1 = HEAP32[$0_1 + 4 >> 2]; block6 : { label1 : while (1) { if (($6_1 | 0) >= ($7_1 | 0)) { return 101 } $8_1 = 0 - $6_1 | 0; block2 : { while (1) { $9_1 = $7_1; if (($6_1 | 0) == ($7_1 | 0)) { break block2 } $9_1 = HEAP8[$6_1 + $13_1 | 0]; if (!(($9_1 | 0) < 0 | !HEAPU8[$9_1 + $10_1 | 0])) { $6_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 12 >> 2] = $6_1; $8_1 = $8_1 - 1 | 0; continue; } break; }; $9_1 = $6_1; } $11_1 = ($6_1 | 0) > ($7_1 | 0) ? $6_1 : $7_1; $8_1 = $6_1 + $8_1 | 0; while (1) { block7 : { block5 : { if (($6_1 | 0) != ($11_1 | 0)) { $12_1 = HEAP8[$6_1 + $13_1 | 0]; if (($12_1 | 0) < 0 | !HEAPU8[$10_1 + $12_1 | 0]) { break block5 } $11_1 = $6_1; } if (($9_1 | 0) >= ($11_1 | 0)) { continue label1 } $10_1 = $11_1 - $9_1 | 0; if (($10_1 | 0) <= HEAP32[$0_1 + 24 >> 2]) { break block6 } $6_1 = $10_1 + 20 | 0; HEAP32[$0_1 + 24 >> 2] = $6_1; $6_1 = $34(HEAP32[$0_1 + 20 >> 2], $6_1, $6_1 >> 31); if ($6_1) { break block7 } return 7; } $6_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 12 >> 2] = $6_1; $8_1 = $8_1 + 1 | 0; continue; } break; }; break; }; HEAP32[$0_1 + 20 >> 2] = $6_1; } $6_1 = 0; $7_1 = ($8_1 | 0) > 0 ? $8_1 : 0; $11_1 = $9_1 + $13_1 | 0; while (1) { if (!(($6_1 | 0) == ($7_1 | 0))) { $12_1 = HEAPU8[$6_1 + $11_1 | 0]; HEAP8[HEAP32[$0_1 + 20 >> 2] + $6_1 | 0] = ($12_1 - 65 & 255) >>> 0 < 26 ? $12_1 + 32 | 0 : $12_1; $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 20 >> 2]; HEAP32[$2_1 >> 2] = $10_1; HEAP32[$3 >> 2] = $9_1; HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 12 >> 2]; $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 16 >> 2] = $0_1 + 1; HEAP32[$5_1 >> 2] = $0_1; return 0; } function $1709($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = $23(4); if (!$0_1) { return 7 } HEAP32[$0_1 >> 2] = 0; HEAP32[$2_1 >> 2] = $0_1; return 0; } function $1713($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $8_1 = global$0 - 48 | 0; $6_1 = $8_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $6_1 = HEAP32[$0_1 + 12 >> 2]; $9_1 = HEAP32[$0_1 + 8 >> 2]; $12_1 = $8_1 + 39 | 0; $10_1 = HEAP32[$0_1 + 4 >> 2]; block1 : { while (1) { $13_1 = 101; if (($6_1 | 0) >= ($9_1 | 0)) { break block1 } block3 : { while (1) { $7_1 = $9_1; if (($6_1 | 0) == ($9_1 | 0)) { break block3 } $7_1 = HEAP8[$6_1 + $10_1 | 0]; if (!(($7_1 | 0) < 0 | (HEAPU8[($7_1 - 48 & 255) + 57184 | 0] ? $7_1 >>> 0 >= 48 : 0))) { $6_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 12 >> 2] = $6_1; continue; } break; }; $7_1 = $6_1; } $14 = $7_1; $7_1 = ($6_1 | 0) > ($9_1 | 0) ? $6_1 : $9_1; block6 : { while (1) { if (($6_1 | 0) == ($7_1 | 0)) { break block6 } block8 : { $11_1 = HEAP8[$6_1 + $10_1 | 0]; if (($11_1 | 0) >= 0) { if (!HEAPU8[($11_1 - 48 & 255) + 57184 | 0] | $11_1 >>> 0 < 48) { break block8 } } $6_1 = $6_1 + 1 | 0; HEAP32[$0_1 + 12 >> 2] = $6_1; continue; } break; }; $7_1 = $6_1; } if (($7_1 | 0) <= ($14 | 0)) { continue } break; }; $11_1 = HEAP32[$0_1 + 20 >> 2]; $7_1 = $7_1 - $14 | 0; if (($7_1 | 0) > HEAP32[$0_1 + 24 >> 2]) { $6_1 = $7_1 + 20 | 0; HEAP32[$0_1 + 24 >> 2] = $6_1; $11_1 = $34($11_1, $6_1, $6_1 >> 31); $13_1 = 7; if (!$11_1) { break block1 } HEAP32[$0_1 + 20 >> 2] = $11_1; } $13_1 = $10_1 + $14 | 0; block55 : { block11 : { if ($7_1 - 21 >>> 0 <= 4294967277) { break block11 } $6_1 = 0; $10_1 = 22; while (1) { if (($6_1 | 0) != ($7_1 | 0)) { $9_1 = HEAPU8[$6_1 + $13_1 | 0]; block14 : { if (($9_1 - 65 & 255) >>> 0 <= 25) { $9_1 = $9_1 | 32; break block14; } if (($9_1 - 97 & 255) >>> 0 > 25) { break block11 } } HEAP8[($8_1 + 16 | 0) + $10_1 | 0] = $9_1; $10_1 = $10_1 - 1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP8[$12_1 | 0] = 0; HEAP8[$12_1 + 1 | 0] = 0; HEAP8[$12_1 + 2 | 0] = 0; HEAP8[$12_1 + 3 | 0] = 0; HEAP8[$12_1 + 4 | 0] = 0; $6_1 = ($8_1 + $10_1 | 0) + 17 | 0; HEAP32[$8_1 + 12 >> 2] = $6_1; block15 : { if (HEAPU8[$6_1 | 0] != 115) { break block15 } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 4248, 4471, 0)) { break block15 } if ($1714($7_1, 12266, 12285, 0)) { break block15 } if ($1714($7_1, 4471, 4471, 0)) { break block15 } HEAP32[$8_1 + 12 >> 2] = HEAP32[$8_1 + 12 >> 2] + 1; } $6_1 = HEAP32[$8_1 + 12 >> 2]; $7_1 = $8_1 + 12 | 0; block16 : { if ($1714($7_1, 14757, 14758, 112)) { break block16 } block18 : { if (!$1714($7_1, 12240, 30822, 113)) { if (!$1714($7_1, 14818, 30822, 113)) { break block16 } if (($6_1 | 0) != HEAP32[$8_1 + 12 >> 2]) { break block18 } break block16; } if (($6_1 | 0) == HEAP32[$8_1 + 12 >> 2]) { break block16 } } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18193, 13327, 0)) { break block16 } if ($1714($7_1, 18138, 14529, 0)) { break block16 } if ($1714($7_1, 12199, 12956, 0)) { break block16 } block19 : { $6_1 = HEAP32[$8_1 + 12 >> 2]; if (!$1717($6_1)) { break block19 } $7_1 = HEAPU8[$6_1 | 0]; if (($7_1 | 0) != HEAPU8[$6_1 + 1 | 0]) { break block19 } $7_1 = $7_1 - 108 | 0; if (1 << $7_1 & 16513 ? $7_1 >>> 0 <= 14 : 0) { break block19 } HEAP32[$8_1 + 12 >> 2] = $6_1 + 1; break block16; } if (!$1718($6_1)) { break block16 } if (!$1719($6_1)) { break block16 } $6_1 = $6_1 - 1 | 0; HEAP32[$8_1 + 12 >> 2] = $6_1; HEAP8[$6_1 | 0] = 101; } $6_1 = HEAP32[$8_1 + 12 >> 2]; block21 : { if (HEAPU8[$6_1 | 0] != 121) { break block21 } if (!$1716($6_1 + 1 | 0)) { break block21 } HEAP8[$6_1 | 0] = 105; } block23 : { block30 : { switch (HEAPU8[$6_1 + 1 | 0] - 97 | 0) { case 0: $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18165, 13327, 112)) { break block23 } $1714($7_1, 3110, 10887, 112); break block23; case 2: $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 13972, 14861, 112)) { break block23 } $1714($7_1, 18196, 14870, 112); break block23; case 4: $1714($8_1 + 12 | 0, 12189, 12956, 112); break block23; case 6: $1714($8_1 + 12 | 0, 11694, 12552, 112); break block23; case 11: $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18137, 14529, 112)) { break block23 } if ($1714($7_1, 18292, 11970, 112)) { break block23 } if ($1714($7_1, 13929, 2991, 112)) { break block23 } if ($1714($7_1, 14223, 14969, 112)) { break block23 } $1714($7_1, 10084, 3748, 112); break block23; case 14: $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 12194, 12956, 112)) { break block23 } if ($1714($7_1, 18167, 13327, 112)) { break block23 } $1714($7_1, 18154, 13327, 112); break block23; case 18: $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18309, 11970, 112)) { break block23 } if ($1714($7_1, 12208, 13080, 112)) { break block23 } if ($1714($7_1, 12709, 11678, 112)) { break block23 } $1714($7_1, 10076, 3748, 112); break block23; case 19: break block30; default: break block23; }; } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18303, 11970, 112)) { break block23 } if ($1714($7_1, 12202, 13080, 112)) { break block23 } $1714($7_1, 18141, 14529, 112); } block32 : { block35 : { block33 : { block31 : { block34 : { $6_1 = HEAPU8[HEAP32[$8_1 + 12 >> 2]]; switch ($6_1 - 105 | 0) { case 0: break block31; case 1: case 2: break block32; case 3: break block33; default: break block34; }; } if (($6_1 | 0) == 115) { break block35 } if (($6_1 | 0) != 101) { break block32 } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 12276, 17939, 112)) { break block32 } if ($1714($7_1, 18159, 30822, 112)) { break block32 } $1714($7_1, 18297, 11970, 112); break block32; } $1714($8_1 + 12 | 0, 12270, 17939, 112); break block32; } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 12282, 17939, 112)) { break block32 } $1714($7_1, 12713, 30822, 112); break block32; } $1714($8_1 + 12 | 0, 11396, 30822, 112); } block37 : { block47 : { block46 : { block45 : { block44 : { block43 : { block42 : { block41 : { block40 : { block39 : { block38 : { block36 : { $6_1 = HEAP32[$8_1 + 12 >> 2]; switch (HEAPU8[$6_1 + 1 | 0] - 97 | 0) { case 0: break block36; case 2: break block38; case 4: break block39; case 8: break block40; case 11: break block41; case 13: break block42; case 14: break block43; case 18: break block44; case 19: break block45; case 20: break block46; case 21: case 25: break block47; default: break block37; }; } if (HEAPU8[$6_1 | 0] != 108) { break block37 } $6_1 = $6_1 + 2 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 101 | HEAPU8[$6_1 + 2 | 0] != 110) { break block37 } block48 : { switch (HEAPU8[$6_1 + 3 | 0] - 97 | 0) { case 0: case 4: break block48; default: break block37; }; } $6_1 = $6_1 + 4 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 114) { break block37 } $6_1 = $6_1 + 2 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 99) { break block37 } $6_1 = $6_1 + 2 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 101 | HEAPU8[$6_1 + 2 | 0] != 98 | (HEAPU8[$6_1 + 3 | 0] | 8) != 105) { break block37 } $6_1 = $6_1 + 4 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 116) { break block37 } block50 : { switch (HEAPU8[$6_1 + 2 | 0] - 97 | 0) { case 0: $6_1 = $6_1 + 3 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; case 4: break block50; default: break block37; }; } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 14018, 30822, 114)) { break block37 } if ($1714($7_1, 11609, 30822, 114)) { break block37 } $1714($7_1, 13931, 30822, 114); break block37; } if (HEAPU8[$6_1 | 0] == 117) { $6_1 = $6_1 + 2 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if ((HEAPU8[$6_1 + 3 | 0] - 115 & 255) >>> 0 > 1) { break block37 } $1714($8_1 + 12 | 0, 12236, 30822, 114); break block37; } if (HEAPU8[$6_1 | 0] != 109 | HEAPU8[$6_1 + 2 | 0] != 105) { break block37 } $6_1 = $6_1 + 3 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } $7_1 = $8_1 + 12 | 0; if ($1714($7_1, 18173, 30822, 114)) { break block37 } $1714($7_1, 12216, 30822, 114); break block37; } if (HEAPU8[$6_1 | 0] != 115 | HEAPU8[$6_1 + 2 | 0] != 111) { break block37 } $6_1 = $6_1 + 3 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; break block37; } if (HEAPU8[$6_1 | 0] != 101 | HEAPU8[$6_1 + 2 | 0] != 105) { break block37 } $6_1 = $6_1 + 3 | 0; if (!$1720($6_1)) { break block37 } HEAP32[$8_1 + 12 >> 2] = $6_1; } $6_1 = HEAP32[$8_1 + 12 >> 2]; block52 : { if (HEAPU8[$6_1 | 0] != 101) { break block52 } $7_1 = $6_1 + 1 | 0; if (!$1720($7_1)) { if (!$1718($7_1)) { break block52 } if ($1719($7_1)) { break block52 } } HEAP32[$8_1 + 12 >> 2] = $7_1; $6_1 = $7_1; } if (!(!$1720($6_1) | HEAPU8[$6_1 | 0] != 108 | HEAPU8[$6_1 + 1 | 0] != 108)) { $6_1 = $6_1 + 1 | 0; HEAP32[$8_1 + 12 >> 2] = $6_1; } $9_1 = $2080($6_1); HEAP32[$2_1 >> 2] = $9_1; $10_1 = 0; while (1) { HEAP8[$9_1 + $11_1 | 0] = $10_1; $10_1 = HEAPU8[$6_1 | 0]; if (!$10_1) { break block55 } $9_1 = $9_1 - 1 | 0; $6_1 = $6_1 + 1 | 0; continue; }; } $10_1 = 0; $6_1 = 0; while (1) { if (!(($6_1 | 0) == ($7_1 | 0))) { $9_1 = HEAPU8[$6_1 + $13_1 | 0]; $12_1 = ($9_1 - 65 & 255) >>> 0 < 26; HEAP8[$6_1 + $11_1 | 0] = $12_1 ? $9_1 | 32 : $9_1; $10_1 = $12_1 ? $10_1 : ($9_1 - 48 & 255) >>> 0 < 10 ? 1 : $10_1; $6_1 = $6_1 + 1 | 0; continue; } break; }; $9_1 = $10_1 ? 3 : 10; if (($7_1 | 0) > $9_1 << 1) { $6_1 = $7_1 - $9_1 | 0; while (1) { if (($6_1 | 0) >= ($7_1 | 0)) { $7_1 = $9_1 } else { HEAP8[$9_1 + $11_1 | 0] = HEAPU8[$6_1 + $11_1 | 0]; $9_1 = $9_1 + 1 | 0; $6_1 = $6_1 + 1 | 0; continue; } break; }; } HEAP8[$7_1 + $11_1 | 0] = 0; HEAP32[$2_1 >> 2] = $7_1; } HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 20 >> 2]; HEAP32[$3 >> 2] = $14; HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 12 >> 2]; $1_1 = $0_1; $0_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$1_1 + 16 >> 2] = $0_1 + 1; HEAP32[$5_1 >> 2] = $0_1; $13_1 = 0; } $6_1 = $13_1; $0_1 = $8_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1 | 0; } function $1714($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = HEAP32[$0_1 >> 2]; while (1) { $5_1 = HEAPU8[$1_1 | 0]; if ($5_1) { if (($5_1 | 0) != HEAPU8[$4_1 | 0]) { return 0 } else { $1_1 = $1_1 + 1 | 0; $4_1 = $4_1 + 1 | 0; continue; } } break; }; block3 : { if ($3) { if (!(FUNCTION_TABLE[$3 | 0]($4_1) | 0)) { break block3 } } while (1) { $1_1 = HEAPU8[$2_1 | 0]; if ($1_1) { $4_1 = $4_1 - 1 | 0; HEAP8[$4_1 | 0] = $1_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP32[$0_1 >> 2] = $4_1; } return 1; } function $1715($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; while (1) { $1_1 = $0_1; $0_1 = $0_1 + 1 | 0; if ($1721($1_1)) { continue } break; }; if (!HEAPU8[$1_1 | 0]) { return 0 } while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if ($1717($0_1)) { continue } break; }; return HEAPU8[$0_1 | 0] != 0 | 0; } function $1716($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; while (1) { $1_1 = $0_1; $0_1 = $1_1 + 1 | 0; if ($1717($1_1)) { continue } break; }; return HEAPU8[$1_1 | 0] != 0 | 0; } function $1717($0_1) { var $1_1 = 0; $1_1 = HEAP8[$0_1 | 0]; if (!$1_1) { return 0 } $1_1 = $1_1 - 97 | 0; if (($1_1 | 0) != 24) { return HEAP8[$1_1 + 57264 | 0] } $1_1 = 1; if (HEAPU8[$0_1 + 1 | 0]) { $1_1 = ($1721($0_1 + 1 | 0) | 0) != 0 } return $1_1; } function $1718($0_1) { var $1_1 = 0, $2_1 = 0; while (1) { $1_1 = $0_1; $0_1 = $0_1 + 1 | 0; if ($1721($1_1)) { continue } break; }; block : { if (!HEAPU8[$1_1 | 0]) { break block } while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if ($1717($0_1)) { continue } break; }; if (!HEAPU8[$0_1 | 0]) { break block } while (1) { $1_1 = $0_1; $0_1 = $0_1 + 1 | 0; if ($1721($1_1)) { continue } break; }; if (!HEAPU8[$1_1 | 0]) { return 1 } while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if ($1717($0_1)) { continue } break; }; $2_1 = !HEAPU8[$0_1 | 0]; } return $2_1; } function $1719($0_1) { var $1_1 = 0; block : { if (!$1717($0_1) | (HEAPU8[$0_1 | 0] - 119 & 255) >>> 0 < 3) { break block } if (!$1721($0_1 + 1 | 0)) { break block } $1_1 = ($1717($0_1 + 2 | 0) | 0) != 0; } return $1_1; } function $1720($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; while (1) { $1_1 = $0_1; $0_1 = $0_1 + 1 | 0; if ($1721($1_1)) { continue } break; }; block : { if (!HEAPU8[$1_1 | 0]) { break block } while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if ($1717($0_1)) { continue } break; }; if (!HEAPU8[$0_1 | 0]) { break block } while (1) { $1_1 = $0_1; $0_1 = $0_1 + 1 | 0; if ($1721($1_1)) { continue } break; }; if (!HEAPU8[$1_1 | 0]) { break block } while (1) { $0_1 = $1_1; $1_1 = $0_1 + 1 | 0; if ($1717($0_1)) { continue } break; }; $2_1 = HEAPU8[$0_1 | 0] != 0; } return $2_1 | 0; } function $1721($0_1) { var $1_1 = 0; $1_1 = HEAP8[$0_1 | 0]; if (!$1_1) { return 0 } $1_1 = $1_1 - 97 | 0; if (($1_1 | 0) != 24) { return 1 - HEAP8[$1_1 + 57264 | 0] | 0 } return $1717($0_1 + 1 | 0); } function $1722($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $0_1 = HEAP32[HEAP32[$0_1 >> 2] + 20 >> 2]; HEAP32[$2_1 >> 2] = -1; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = $2_1 + 12; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = $2_1; block3 : { while (1) { if (($1_1 | 0) == 21) { break block3 } $4_1 = $1_1 << 4; $1_1 = $1_1 + 1 | 0; $4_1 = $4_1 + 32816 | 0; if (HEAP32[$4_1 >> 2] != 1004) { continue } break; }; $1_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$3 + 12 >> 2] = $1_1 + 4; $5_1 = HEAP32[$1_1 >> 2]; HEAP32[$3 + 12 >> 2] = $1_1 + 8; $6_1 = HEAP32[$0_1 + 32 >> 2]; $7_1 = HEAP32[$0_1 + 36 >> 2]; $8_1 = HEAP32[$1_1 + 4 >> 2]; block7 : { block6 : { if (($5_1 | 0) > 0) { $1_1 = $7_1 | HEAP32[$4_1 + 12 >> 2]; $5_1 = $6_1 | HEAP32[$4_1 + 8 >> 2]; break block6; } if ($5_1) { break block7 } $1_1 = (HEAP32[$4_1 + 12 >> 2] ^ -1) & $7_1; $5_1 = (HEAP32[$4_1 + 8 >> 2] ^ -1) & $6_1; } HEAP32[$0_1 + 32 >> 2] = $5_1; HEAP32[$0_1 + 36 >> 2] = $1_1; if (($5_1 | 0) == ($6_1 | 0) & ($1_1 | 0) == ($7_1 | 0)) { break block7 } $342($0_1, 0); } if (!$8_1) { break block3 } HEAP32[$8_1 >> 2] = (HEAP32[$4_1 + 8 >> 2] & HEAP32[$0_1 + 32 >> 2] | HEAP32[$4_1 + 12 >> 2] & HEAP32[$0_1 + 36 >> 2]) != 0; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $3 = HEAP32[$2_1 + 12 >> 2]; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1723($0_1, $1_1, $2_1) { $0_1 = $1677($0_1, $1_1, $2_1); if (!$0_1) { return 0 } return HEAP32[$0_1 + 8 >> 2]; } function $1724($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; return $1725(1, $0_1, $1_1, $2_1, $3, $4_1, $5_1) | 0; } function $1725($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0; $7_1 = global$0 - 432 | 0; $9_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $9_1; HEAP32[$7_1 + 424 >> 2] = 0; $24_1 = HEAPU8[HEAP32[$4_1 >> 2] + 3 | 0]; HEAP32[$7_1 + 420 >> 2] = 0; $26_1 = $2080(HEAP32[$4_1 + 4 >> 2]); $8_1 = $2080(HEAP32[$4_1 + 8 >> 2]); block56 : { block : { $9_1 = ($3 << 2) - 8 | 0; $13_1 = $31($9_1, 0); if (!$13_1) { break block } $15_1 = !$9_1; if (!$15_1) { wasm2js_memory_fill($13_1, 0, $9_1) } $21_1 = $31($9_1, 0); if (!$21_1) { break block } if (!$15_1) { wasm2js_memory_fill($21_1, 0, $9_1) } $25 = $26_1 + 1 | 0; $23_1 = $8_1 + 1 | 0; $29_1 = ($24_1 | 0) != 52; $8_1 = 0; $15_1 = 0; $17_1 = 3; while (1) { block5 : { block42 : { block41 : { block27 : { block29 : { block32 : { block36 : { block8 : { if (!(($3 | 0) <= ($17_1 | 0) | $8_1)) { $10_1 = HEAP32[($17_1 << 2) + $4_1 >> 2]; block4 : { if (HEAP32[$7_1 + 420 >> 2]) { break block4 } if ($2080($10_1) >>> 0 < 9) { break block4 } if ($68($10_1, 12942, 8)) { break block4 } $9_1 = HEAP8[$10_1 + 8 | 0]; if (($9_1 | 0) < 0 | HEAPU8[$9_1 + 57360 | 0]) { break block4 } $8_1 = $1780($2_1, $10_1 + 9 | 0, $7_1 + 420 | 0, $6_1); HEAP32[$7_1 + 424 >> 2] = $8_1; break block5; } $8_1 = $10_1; block6 : { if ($29_1) { break block6 } while (1) { $9_1 = HEAPU8[$8_1 | 0]; if (!$9_1) { break block6 } if (($9_1 | 0) != 61) { $8_1 = $8_1 + 1 | 0; continue; } break; }; HEAP32[$7_1 + 48 >> 2] = $8_1 + 1; $9_1 = $61(8932, $7_1 + 48 | 0); if (!$9_1) { break block8 } $18_1 = $8_1 - $10_1 | 0; $1654($9_1); $8_1 = 0; block22 : { block21 : { block9 : { while (1) { if (($8_1 | 0) == 8) { break block9 } block11 : { $27 = $8_1 << 3; if (HEAP32[$27 + 57300 >> 2] == ($18_1 | 0)) { if (!$68($10_1, HEAP32[$27 + 57296 >> 2], $18_1)) { break block11 } } $8_1 = $8_1 + 1 | 0; continue; } break; }; block19 : { switch ($8_1 | 0) { case 0: block20 : { if (($2080($9_1) | 0) != 4) { break block20 } if ($68($9_1, 23639, 4)) { break block20 } $28_1 = 1; break block21; } HEAP32[$7_1 + 16 >> 2] = $9_1; $1655($6_1, 7957, $7_1 + 16 | 0); $28_1 = 1; HEAP32[$7_1 + 424 >> 2] = 1; break block21; case 1: $24($15_1); $15_1 = $9_1; $9_1 = 0; break block22; case 2: $24($11_1); $11_1 = $9_1; $9_1 = 0; break block22; case 3: $24($16_1); $16_1 = $9_1; $9_1 = 0; break block22; case 4: block26 : { block25 : { block24 : { switch ($2080($9_1) - 3 | 0) { case 0: if ($68($9_1, 17582, 3)) { break block25 } break block26; case 1: break block24; default: break block25; }; } if (!$68($9_1, 17577, 4)) { break block26 } } HEAP32[$7_1 + 32 >> 2] = $9_1; $1655($6_1, 7934, $7_1 + 32 | 0); HEAP32[$7_1 + 424 >> 2] = 1; } $30_1 = (HEAPU8[$9_1 | 0] & 223) == 68; break block21; case 5: $24($19_1); $19_1 = $9_1; $9_1 = 0; break block22; case 6: $24($20_1); $20_1 = $9_1; $9_1 = 0; break block22; case 7: break block19; default: break block9; }; } HEAP32[($22_1 << 2) + $21_1 >> 2] = $9_1; $22_1 = $22_1 + 1 | 0; $9_1 = 0; break block22; } HEAP32[$7_1 >> 2] = $10_1; $1655($6_1, 7907, $7_1); HEAP32[$7_1 + 424 >> 2] = 1; } } $24($9_1); $8_1 = HEAP32[$7_1 + 424 >> 2]; break block5; } $9_1 = $2080($10_1); HEAP32[($12_1 << 2) + $13_1 >> 2] = $10_1; $12_1 = $12_1 + 1 | 0; $14 = ($9_1 + $14 | 0) + 1 | 0; $8_1 = 0; break block5; } if (!$19_1 | $8_1) { break block27 } $24($11_1); $24($16_1); if ($12_1) { $11_1 = 0; $8_1 = HEAP32[$7_1 + 424 >> 2]; break block29; } $24($13_1); HEAP32[$7_1 + 400 >> 2] = HEAP32[$4_1 + 4 >> 2]; HEAP32[$7_1 + 404 >> 2] = $19_1; $12_1 = 0; HEAP32[$7_1 + 428 >> 2] = 0; $3 = $61(19769, $7_1 + 400 | 0); $8_1 = 7; block31 : { if (!$3) { break block31 } $9_1 = $349($1_1, $3, $7_1 + 428 | 0); $8_1 = 0; if (!$9_1) { break block31 } HEAP32[$7_1 + 384 >> 2] = $127($1_1); $1655($6_1, 8932, $7_1 + 384 | 0); $8_1 = $9_1; } $24($3); $13_1 = 0; if ($8_1) { break block32 } $8_1 = 0; $11_1 = HEAP32[$7_1 + 428 >> 2]; if ($11_1) { $12_1 = HEAPU16[$11_1 + 144 >> 1] } $14 = 0; $3 = 0; while (1) { if (($8_1 | 0) != ($12_1 | 0)) { $10_1 = $3 + 1 | 0; $9_1 = $3; $3 = $2080($277($11_1, $8_1)) + 1 | 0; $14 = $3 + $14 | 0; $3 = $3 >>> 0 > $14 >>> 0 ? $10_1 : $9_1; $8_1 = $8_1 + 1 | 0; continue; } break; }; $10_1 = $3 + 1 | 0; $8_1 = $3; $3 = $12_1 << 2; $9_1 = $3 + $14 | 0; $8_1 = $3 >>> 0 > $9_1 >>> 0 ? $10_1 : $8_1; $13_1 = $31($9_1, $8_1); if (!$13_1) { $8_1 = 7; break block36; } $10_1 = $3 + $13_1 | 0; $8_1 = 0; $9_1 = 0; while (1) { if (($9_1 | 0) == ($12_1 | 0)) { break block36 } $16_1 = $277($11_1, $9_1); $3 = $2080($16_1) + 1 | 0; if ($3) { wasm2js_memory_copy($10_1, $16_1, $3) } HEAP32[($9_1 << 2) + $13_1 >> 2] = $10_1; $9_1 = $9_1 + 1 | 0; $10_1 = $3 + $10_1 | 0; continue; }; } $8_1 = 7; HEAP32[$7_1 + 424 >> 2] = 7; break block5; } $100($11_1); } HEAP32[$7_1 + 424 >> 2] = $8_1; $11_1 = 0; if (!$20_1 | $8_1) { break block29 } while (1) { block38 : { $16_1 = 0; if (($11_1 | 0) == ($12_1 | 0)) { break block38 } if ($66($20_1, HEAP32[($11_1 << 2) + $13_1 >> 2])) { $11_1 = $11_1 + 1 | 0; continue; } else { while (1) { if ($11_1 >>> 0 < $12_1 >>> 0) { $3 = ($11_1 << 2) + $13_1 | 0; $11_1 = $11_1 + 1 | 0; HEAP32[$3 >> 2] = HEAP32[($11_1 << 2) + $13_1 >> 2]; continue; } break; }; $12_1 = $12_1 - 1 | 0; } } break; }; $11_1 = 0; break block41; } $16_1 = 0; } if ($8_1) { break block42 } } if (!$12_1) { HEAP32[$13_1 >> 2] = 2836; $12_1 = 1; $14 = 8; } if (!HEAP32[$7_1 + 420 >> 2]) { $2_1 = $1780($2_1, 14131, $7_1 + 420 | 0, $6_1); HEAP32[$7_1 + 424 >> 2] = $2_1; if ($2_1) { break block42 } } $10_1 = 1; block45 : { if (!$15_1) { break block45 } $9_1 = HEAPU8[$15_1 | 0]; if (!$9_1) { break block45 } $10_1 = 2; $8_1 = $15_1; while (1) { $2_1 = $9_1 & 255; block47 : { if (($2_1 | 0) != 44) { if ($2_1) { break block47 } break block45; } $10_1 = $10_1 + 1 | 0; } $9_1 = HEAPU8[$8_1 + 1 | 0]; $8_1 = $8_1 + 1 | 0; continue; }; } block55 : { block49 : { $2_1 = Math_imul($10_1, 24); $18_1 = $31($2_1, 0); if (!$18_1) { $17_1 = 7; $10_1 = 0; break block49; } $17_1 = 0; if ($2_1) { wasm2js_memory_fill($18_1, 0, $2_1) } if (!$15_1) { break block49 } $9_1 = 1; $8_1 = $15_1; while (1) { if (($9_1 | 0) >= ($10_1 | 0)) { break block49 } HEAP32[$7_1 + 428 >> 2] = 0; $2_1 = $1781($8_1, $7_1 + 428 | 0); if ($2_1) { $3 = $2_1 + $8_1 | 0; $2_1 = HEAP32[$7_1 + 428 >> 2]; block54 : { if (!($2_1 ? ($2_1 | 0) <= 1e7 : 0)) { $10_1 = $10_1 - 1 | 0; break block54; } HEAP32[Math_imul($9_1, 24) + $18_1 >> 2] = $2_1; $9_1 = $9_1 + 1 | 0; } $8_1 = $3 + 1 | 0; continue; } break; }; HEAP32[$7_1 + 424 >> 2] = 1; HEAP32[$7_1 + 368 >> 2] = $15_1; $1655($6_1, 7872, $7_1 + 368 | 0); $10_1 = 0; $17_1 = HEAP32[$7_1 + 424 >> 2]; break block55; } HEAP32[$7_1 + 424 >> 2] = $17_1; } $3 = 0; if ($17_1) { break block56 } $2_1 = Math_imul($10_1, 24); $9_1 = ($2_1 + (((($23_1 + $26_1 | 0) + $14 | 0) + $12_1 | 0) + ($12_1 << 2) | 0) | 0) + 297 | 0; $3 = $31($9_1, 0); if (!$3) { HEAP32[$7_1 + 424 >> 2] = 7; $3 = 0; break block56; } $8_1 = 0; if ($9_1) { wasm2js_memory_fill($3, 0, $9_1) } HEAP32[$3 + 272 >> 2] = 0; HEAP32[$3 + 24 >> 2] = $12_1; HEAP32[$3 + 12 >> 2] = $1_1; $9_1 = $3 + 296 | 0; HEAP32[$3 + 28 >> 2] = $9_1; $1_1 = HEAP32[$7_1 + 420 >> 2]; HEAP32[$3 + 268 >> 2] = 1048576; HEAP32[$3 + 36 >> 2] = $1_1; $1_1 = ($24_1 | 0) == 52; HEAP8[$3 + 238 | 0] = $1_1 & !$28_1; HEAP8[$3 + 237 | 0] = $1_1; HEAP8[$3 + 239 | 0] = $30_1; HEAP8[$3 + 236 | 0] = $1_1; HEAP32[$3 + 48 >> 2] = 255; $1_1 = $9_1 + ($12_1 << 2) | 0; HEAP32[$3 + 264 >> 2] = $1_1; HEAP32[$3 + 44 >> 2] = $20_1; HEAP32[$3 + 40 >> 2] = $19_1; if ($2_1) { wasm2js_memory_copy($1_1, $18_1, $2_1) } HEAP32[$3 + 260 >> 2] = $10_1; $2_1 = ($10_1 | 0) > 0 ? $10_1 : 0; while (1) { $1_1 = HEAP32[$3 + 264 >> 2]; if (($2_1 | 0) != ($8_1 | 0)) { $1_1 = $1_1 + Math_imul($8_1, 24) | 0; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$1_1 + 12 >> 2] = 0; HEAP16[$1_1 + 4 >> 1] = 257; $1_1 = $1_1 + 16 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $8_1 = $8_1 + 1 | 0; continue; } break; }; $1_1 = $1_1 + Math_imul($10_1, 24) | 0; HEAP32[$3 + 32 >> 2] = $1_1; $1_1 = $1_1 + $12_1 | 0; HEAP32[$3 + 20 >> 2] = $1_1; if ($23_1) { wasm2js_memory_copy($1_1, HEAP32[$4_1 + 8 >> 2], $23_1) } $1_1 = $1_1 + $23_1 | 0; HEAP32[$3 + 16 >> 2] = $1_1; if ($25) { wasm2js_memory_copy($1_1, HEAP32[$4_1 + 4 >> 2], $25) } $4_1 = ($12_1 | 0) > 0 ? $12_1 : 0; $8_1 = $1_1 + $25 | 0; $9_1 = 0; while (1) { if (($4_1 | 0) == ($9_1 | 0)) { $1_1 = 0; $9_1 = ($22_1 | 0) > 0 ? $22_1 : 0; $14 = 0; while (1) { if (($4_1 | 0) == ($14 | 0)) { block65 : { $8_1 = 0; while (1) { if (($8_1 | 0) == ($9_1 | 0)) { break block65 } $2_1 = HEAP32[($8_1 << 2) + $21_1 >> 2]; if ($2_1) { HEAP32[$7_1 + 352 >> 2] = $2_1; $1655($6_1, 7984, $7_1 + 352 | 0); $1_1 = 1; } $8_1 = $8_1 + 1 | 0; continue; }; } } else { $8_1 = 0; $19_1 = $14 << 2; $10_1 = $2080(HEAP32[$19_1 + HEAP32[$3 + 28 >> 2] >> 2]); while (1) { if (($8_1 | 0) != ($9_1 | 0)) { $20_1 = ($8_1 << 2) + $21_1 | 0; $2_1 = HEAP32[$20_1 >> 2]; block68 : { if (!$2_1) { break block68 } if (($2080($2_1) | 0) != ($10_1 | 0)) { break block68 } if ($68(HEAP32[$19_1 + HEAP32[$3 + 28 >> 2] >> 2], $2_1, $10_1)) { break block68 } HEAP8[HEAP32[$3 + 32 >> 2] + $14 | 0] = 1; $24($2_1); HEAP32[$20_1 >> 2] = 0; } $8_1 = $8_1 + 1 | 0; continue; } break; }; $14 = $14 + 1 | 0; continue; } break; }; HEAP32[$7_1 + 424 >> 2] = $1_1; if (!(!$11_1 ^ ($16_1 | 0) != 0 | $1_1)) { HEAP32[$7_1 + 424 >> 2] = 1; HEAP32[$7_1 + 336 >> 2] = $11_1 ? 4253 : 4255; $1655($6_1, 9027, $7_1 + 336 | 0); } $8_1 = 0; HEAP32[$7_1 + 428 >> 2] = 0; block75 : { if (!HEAP32[$3 + 40 >> 2]) { block72 : { if (!$16_1) { $10_1 = 0; $1_1 = 30822; break block72; } $10_1 = $1782($16_1); $1_1 = $10_1; } $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 15306, 0); while (1) { if (($8_1 | 0) < HEAP32[$3 + 24 >> 2]) { HEAP32[$7_1 + 72 >> 2] = HEAP32[HEAP32[$3 + 28 >> 2] + ($8_1 << 2) >> 2]; HEAP32[$7_1 + 68 >> 2] = $8_1; HEAP32[$7_1 + 64 >> 2] = $1_1; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 27510, $7_1 - -64 | 0); $8_1 = $8_1 + 1 | 0; continue; } break; }; if (HEAP32[$3 + 44 >> 2]) { HEAP32[$7_1 + 288 >> 2] = 15288; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 19762, $7_1 + 288 | 0); } $24($10_1); break block75; } $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 15209, 0); while (1) { if (($8_1 | 0) < HEAP32[$3 + 24 >> 2]) { HEAP32[$7_1 + 304 >> 2] = HEAP32[HEAP32[$3 + 28 >> 2] + ($8_1 << 2) >> 2]; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 28374, $7_1 + 304 | 0); $8_1 = $8_1 + 1 | 0; continue; } break; }; $1_1 = HEAP32[$3 + 44 >> 2]; if (!$1_1) { break block75 } HEAP32[$7_1 + 320 >> 2] = $1_1; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 19762, $7_1 + 320 | 0); } $1_1 = HEAP32[$3 + 16 >> 2]; $9_1 = 30822; $10_1 = HEAP32[$3 + 40 >> 2]; if ($10_1) { $2_1 = 30822 } else { $10_1 = HEAP32[$3 + 20 >> 2]; $2_1 = 2835; } HEAP32[$7_1 + 280 >> 2] = $2_1; HEAP32[$7_1 + 276 >> 2] = $10_1; HEAP32[$7_1 + 272 >> 2] = $1_1; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 1634, $7_1 + 272 | 0); HEAP32[$3 + 224 >> 2] = HEAP32[$7_1 + 428 >> 2]; $8_1 = 0; HEAP32[$7_1 + 428 >> 2] = 0; $10_1 = 0; if ($11_1) { $10_1 = $1782($11_1); $9_1 = $10_1; } $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 21967, 0); while (1) { if (($8_1 | 0) < HEAP32[$3 + 24 >> 2]) { HEAP32[$7_1 + 80 >> 2] = $9_1; $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 26505, $7_1 + 80 | 0); $8_1 = $8_1 + 1 | 0; continue; } break; }; if (HEAP32[$3 + 44 >> 2]) { $1783($7_1 + 424 | 0, $7_1 + 428 | 0, 21965, 0) } $24($10_1); HEAP32[$3 + 228 >> 2] = HEAP32[$7_1 + 428 >> 2]; $19_1 = 0; block81 : { if (HEAP32[$7_1 + 424 >> 2]) { break block81 } if ($0_1) { $8_1 = 0; HEAP32[$7_1 + 428 >> 2] = 0; $1_1 = HEAP32[$3 + 12 >> 2]; if (!HEAP32[$3 + 40 >> 2]) { $2_1 = HEAP32[$3 + 44 >> 2]; $9_1 = $61(18603, 0); block87 : { block85 : { while (1) { if (!$9_1) { break block85 } if (($8_1 | 0) < HEAP32[$3 + 24 >> 2]) { HEAP32[$7_1 + 248 >> 2] = HEAP32[HEAP32[$3 + 28 >> 2] + ($8_1 << 2) >> 2]; HEAP32[$7_1 + 244 >> 2] = $8_1; HEAP32[$7_1 + 240 >> 2] = $9_1; $8_1 = $8_1 + 1 | 0; $9_1 = $61(28333, $7_1 + 240 | 0); continue; } break; }; if (!$2_1) { break block87 } HEAP32[$7_1 + 260 >> 2] = $2_1; HEAP32[$7_1 + 256 >> 2] = $9_1; $9_1 = $61(15284, $7_1 + 256 | 0); if ($9_1) { break block87 } } HEAP32[$7_1 + 428 >> 2] = 7; $9_1 = 0; } $2_1 = HEAP32[$3 + 16 >> 2]; $4_1 = HEAP32[$3 + 20 >> 2]; HEAP32[$7_1 + 232 >> 2] = $9_1; HEAP32[$7_1 + 224 >> 2] = $2_1; HEAP32[$7_1 + 228 >> 2] = $4_1; $1730($7_1 + 428 | 0, $1_1, 25413, $7_1 + 224 | 0); $24($9_1); } $2_1 = HEAP32[$3 + 20 >> 2]; HEAP32[$7_1 + 208 >> 2] = HEAP32[$3 + 16 >> 2]; HEAP32[$7_1 + 212 >> 2] = $2_1; $2_1 = $7_1 + 428 | 0; $1730($2_1, $1_1, 22094, $7_1 + 208 | 0); $4_1 = HEAP32[$3 + 20 >> 2]; HEAP32[$7_1 + 192 >> 2] = HEAP32[$3 + 16 >> 2]; HEAP32[$7_1 + 196 >> 2] = $4_1; $1730($2_1, $1_1, 22311, $7_1 + 192 | 0); if (HEAPU8[$3 + 238 | 0]) { $4_1 = HEAP32[$3 + 20 >> 2]; HEAP32[$7_1 + 176 >> 2] = HEAP32[$3 + 16 >> 2]; HEAP32[$7_1 + 180 >> 2] = $4_1; $1730($2_1, $1_1, 22166, $7_1 + 176 | 0); } if (HEAPU8[$3 + 237 | 0]) { $1764($7_1 + 428 | 0, $3) } $1_1 = HEAP32[$7_1 + 428 >> 2]; HEAP32[$7_1 + 424 >> 2] = $1_1; $1_1 = !$1_1; } else { $1_1 = 1 } if (!(($24_1 | 0) == 52 | $0_1)) { HEAP8[$3 + 237 | 0] = 2 } if ($1_1) { HEAP32[$7_1 + 160 >> 2] = HEAP32[$3 + 16 >> 2]; $0_1 = $61(12918, $7_1 + 160 | 0); block93 : { if (!$0_1) { $8_1 = 7; break block93; } $8_1 = $349(HEAP32[$3 + 12 >> 2], $0_1, $7_1 + 428 | 0); if (($8_1 | 0) != 23) { if ($8_1) { break block93 } $1_1 = HEAP32[$7_1 + 428 >> 2]; $94($1_1); HEAP32[$3 + 244 >> 2] = $98($1_1, 0); $8_1 = $100($1_1); break block93; } HEAP32[$3 + 244 >> 2] = 1024; $8_1 = 0; } $24($0_1); HEAP32[$7_1 + 424 >> 2] = $8_1; HEAP32[$3 + 232 >> 2] = HEAP32[$3 + 244 >> 2] - 35; if ($8_1) { break block81 } $0_1 = HEAP32[$3 + 44 >> 2]; $1_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$7_1 + 144 >> 2] = 1; $367($1_1, 1, $7_1 + 144 | 0); $367(HEAP32[$3 + 12 >> 2], 2, 0); HEAP32[$7_1 + 128 >> 2] = HEAP32[HEAP32[$3 + 28 >> 2] >> 2]; $0_1 = $0_1 ? $0_1 : 15275; $9_1 = $61(30768, $7_1 + 128 | 0); $8_1 = 1; while (1) { if (!(!$9_1 | HEAP32[$3 + 24 >> 2] <= ($8_1 | 0))) { HEAP32[$7_1 + 100 >> 2] = HEAP32[HEAP32[$3 + 28 >> 2] + ($8_1 << 2) >> 2]; HEAP32[$7_1 + 96 >> 2] = $9_1; $8_1 = $8_1 + 1 | 0; $9_1 = $61(30766, $7_1 + 96 | 0); continue; } break; }; $1_1 = HEAP32[$3 + 20 >> 2]; HEAP32[$7_1 + 120 >> 2] = $0_1; HEAP32[$7_1 + 116 >> 2] = $1_1; HEAP32[$7_1 + 112 >> 2] = $9_1; $10_1 = 7; $0_1 = $61(26244, $7_1 + 112 | 0); if (!(!$9_1 | !$0_1)) { $10_1 = $356(HEAP32[$3 + 12 >> 2], $0_1) } $24($0_1); $24($9_1); HEAP32[$7_1 + 424 >> 2] = $10_1; break block81; } HEAP32[$3 + 232 >> 2] = HEAP32[$3 + 244 >> 2] - 35; } $20_1 = 0; break block56; } HEAP32[$7_1 + 428 >> 2] = 0; $2_1 = $9_1 << 2; $10_1 = $1784(HEAP32[$2_1 + $13_1 >> 2], $7_1 + 428 | 0); $1_1 = HEAP32[$7_1 + 428 >> 2]; if (!(($1_1 | 0) <= 0 | !$1_1)) { wasm2js_memory_copy($8_1, $10_1, $1_1) } $1_1 = $1_1 + $8_1 | 0; HEAP8[$1_1 | 0] = 0; $1654($8_1); HEAP32[$2_1 + HEAP32[$3 + 28 >> 2] >> 2] = $8_1; $9_1 = $9_1 + 1 | 0; $8_1 = $1_1 + 1 | 0; continue; }; } $18_1 = 0; $3 = 0; break block56; } $17_1 = $17_1 + 1 | 0; continue; }; } HEAP32[$7_1 + 424 >> 2] = 7; $21_1 = 0; $15_1 = 0; $3 = 0; } $24($15_1); $24($18_1); $24($11_1); $24($16_1); $24($19_1); $24($20_1); $8_1 = 0; $0_1 = ($22_1 | 0) > 0 ? $22_1 : 0; while (1) { if (($0_1 | 0) != ($8_1 | 0)) { $24(HEAP32[($8_1 << 2) + $21_1 >> 2]); $8_1 = $8_1 + 1 | 0; continue; } break; }; $24($13_1); $24($21_1); $1_1 = HEAP32[$7_1 + 424 >> 2]; block101 : { if ($1_1) { if ($3) { $1728($3); break block101; } $0_1 = HEAP32[$7_1 + 420 >> 2]; if (!$0_1) { break block101 } FUNCTION_TABLE[HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]]($0_1) | 0; break block101; } HEAP32[$5_1 >> 2] = $3; } $0_1 = $7_1 + 432 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1726($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; return $1725(0, $0_1, $1_1, $2_1, $3, $4_1, $5_1) | 0; } function $1727($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; if (HEAP32[$0_1 + 56 >> 2]) { return 1 } HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1095963344; HEAP32[$1_1 + 20 >> 2] = 0; $2_1 = HEAP32[$1_1 >> 2]; $12_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $7_1 = -1; $8_1 = -1; $9_1 = -1; $5_1 = -1; $2_1 = 0; while (1) { block3 : { block8 : { block7 : { if (($2_1 | 0) != ($12_1 | 0)) { $3 = HEAP32[$1_1 + 4 >> 2] + Math_imul($2_1, 12) | 0; if (!HEAPU8[$3 + 5 | 0]) { if (HEAPU8[$3 + 4 | 0] != 64) { break block3 } HEAP32[$1_1 + 48 >> 2] = 0; HEAP32[$1_1 + 52 >> 2] = 262144; HEAP32[$1_1 + 40 >> 2] = -981572454; HEAP32[$1_1 + 44 >> 2] = 1246829326; HEAP32[$1_1 + 20 >> 2] = 0; return 0; } $6_1 = HEAP32[$3 >> 2]; $11_1 = ($6_1 | 0) < 0; if ($11_1) { $10_1 = 1 } else { $10_1 = (HEAP32[$0_1 + 24 >> 2] + 1 | 0) == ($6_1 | 0) } $3 = HEAPU8[$3 + 4 | 0]; if (!(!$10_1 | (($3 | 0) != 2 | ($5_1 | 0) >= 0))) { HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1072693248; $4_1 = 1; HEAP32[$1_1 + 20 >> 2] = 1; $5_1 = $2_1; break block7; } if (($3 | 0) == 2) { break block7 } if (($3 | 0) != 64) { break block8 } $3 = 64; if (HEAP32[$0_1 + 24 >> 2] < ($6_1 | 0) | $11_1) { break block8 } HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1073741824; $4_1 = $6_1 + 2 | 0; HEAP32[$1_1 + 20 >> 2] = $4_1; $5_1 = $2_1; break block8; } $2_1 = 1; if (($4_1 | 0) == 1) { HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] | 1 } if (($5_1 | 0) >= 0) { $2_1 = HEAP32[$1_1 + 16 >> 2] + ($5_1 << 3) | 0; HEAP8[$2_1 + 4 | 0] = 1; HEAP32[$2_1 >> 2] = 1; $2_1 = 2; } if (($7_1 | 0) >= 0) { $4_1 = $4_1 | 65536; HEAP32[$1_1 + 20 >> 2] = $4_1; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($7_1 << 3) >> 2] = $2_1; $2_1 = $2_1 + 1 | 0; } if (($8_1 | 0) >= 0) { $4_1 = $4_1 | 131072; HEAP32[$1_1 + 20 >> 2] = $4_1; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($8_1 << 3) >> 2] = $2_1; $2_1 = $2_1 + 1 | 0; } if (($9_1 | 0) >= 0) { HEAP32[$1_1 + 20 >> 2] = $4_1 | 262144; HEAP32[HEAP32[$1_1 + 16 >> 2] + ($9_1 << 3) >> 2] = $2_1; } if (HEAP32[$1_1 + 8 >> 2] != 1) { return 0 } $2_1 = HEAP32[$1_1 + 12 >> 2]; $5_1 = HEAP32[$2_1 >> 2]; if (!(($5_1 | 0) >= 0 & ($5_1 | 0) != (HEAP32[$0_1 + 24 >> 2] + 1 | 0))) { $0_1 = HEAPU8[$2_1 + 4 | 0]; HEAP32[$1_1 + 32 >> 2] = 1; HEAP32[$1_1 + 24 >> 2] = $0_1 ? 20576 : 20990; } return 0; } $3 = 2; $7_1 = (HEAP32[$0_1 + 24 >> 2] + 2 | 0) == ($6_1 | 0) ? $2_1 : $7_1; } if (!$10_1) { break block3 } block17 : { switch (__wasm_rotl_i32($3 - 4 | 0, 30) | 0) { case 1: case 3: $9_1 = $2_1; break block3; case 0: case 7: break block17; default: break block3; }; } $8_1 = $2_1; } $2_1 = $2_1 + 1 | 0; continue; }; } function $1728($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; $100(HEAP32[$0_1 + 220 >> 2]); $2_1 = $0_1 + 60 | 0; while (1) { if (!(($1_1 | 0) == 40)) { $100(HEAP32[($1_1 << 2) + $2_1 >> 2]); $1_1 = $1_1 + 1 | 0; continue; } break; }; $24(HEAP32[$0_1 + 248 >> 2]); $24(HEAP32[$0_1 + 224 >> 2]); $24(HEAP32[$0_1 + 228 >> 2]); $24(HEAP32[$0_1 + 40 >> 2]); $24(HEAP32[$0_1 + 44 >> 2]); $1_1 = HEAP32[$0_1 + 36 >> 2]; FUNCTION_TABLE[HEAP32[HEAP32[$1_1 >> 2] + 8 >> 2]]($1_1) | 0; $24($0_1); return 0; } function $1729($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = global$0 - 48 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 44 >> 2] = 0; $4_1 = HEAP32[$0_1 + 12 >> 2]; $5_1 = HEAP32[$0_1 + 40 >> 2]; $2_1 = HEAP32[$0_1 + 16 >> 2]; $3 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$1_1 + 40 >> 2] = $3; HEAP32[$1_1 + 36 >> 2] = $2_1; HEAP32[$1_1 + 28 >> 2] = $3; HEAP32[$1_1 + 24 >> 2] = $2_1; HEAP32[$1_1 + 20 >> 2] = $3; HEAP32[$1_1 + 16 >> 2] = $2_1; HEAP32[$1_1 + 32 >> 2] = $5_1 ? 25084 : 30822; HEAP32[$1_1 + 12 >> 2] = $3; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; HEAP32[$1_1 >> 2] = $2_1; $1730($1_1 + 44 | 0, $4_1, 22769, $1_1); $2_1 = HEAP32[$1_1 + 44 >> 2]; if (!$2_1) { $1728($0_1) } $0_1 = $1_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $1730($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (HEAP32[$0_1 >> 2]) { break block } HEAP32[$4_1 + 12 >> 2] = $3; $2_1 = $60($2_1, $3); if (!$2_1) { HEAP32[$0_1 >> 2] = 7; break block; } HEAP32[$0_1 >> 2] = $97($1_1, $2_1, 0, 0, 0); $24($2_1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1731($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = $23(96); HEAP32[$1_1 >> 2] = $0_1; if (!$0_1) { return 7 } wasm2js_memory_fill($0_1, 0, 96); return 0; } function $1732($0_1) { $0_1 = $0_1 | 0; $1733($0_1); $24($0_1); return 0; } function $1733($0_1) { var $1_1 = 0, $2_1 = 0; if (HEAPU8[$0_1 + 8 | 0]) { $1_1 = HEAP32[$0_1 >> 2]; if (!HEAP32[$1_1 + 220 >> 2]) { $2_1 = $1_1; $1_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$2_1 + 220 >> 2] = $1_1; $96($1_1); HEAP32[$0_1 + 12 >> 2] = 0; } HEAP8[$0_1 + 8 | 0] = 0; } $100(HEAP32[$0_1 + 12 >> 2]); $2_1 = HEAP32[$0_1 + 28 >> 2]; while (1) { if ($2_1) { $1_1 = HEAP32[$2_1 + 8 >> 2]; $24(HEAP32[$2_1 + 12 >> 2]); $24($2_1); $2_1 = $1_1; continue; } break; }; HEAP32[$0_1 + 28 >> 2] = 0; $24(HEAP32[$0_1 + 44 >> 2]); $1785(HEAP32[$0_1 + 92 >> 2]); $1737(HEAP32[$0_1 + 16 >> 2]); wasm2js_memory_fill($0_1 + 4 | 0, 0, 92); } function $1734($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $5_1 = global$0 - 128 | 0; $3 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $3; $3 = 1; $7_1 = HEAP32[$0_1 >> 2]; block : { if (HEAP32[$7_1 + 56 >> 2]) { break block } $9_1 = $1_1 & 65535; block2 : { if (!$9_1) { $3 = 0; break block2; } $10_1 = HEAP32[$4_1 >> 2]; $3 = 1; } if ($1_1 & 65536) { $8_1 = HEAP32[($3 << 2) + $4_1 >> 2]; $3 = $3 + 1 | 0; } $6_1 = $3; block6 : { if (!($1_1 & 131072)) { $3 = $6_1; break block6; } $12_1 = HEAP32[($6_1 << 2) + $4_1 >> 2]; $3 = $6_1 + 1 | 0; } $11_1 = $1_1 & 262144 ? HEAP32[($3 << 2) + $4_1 >> 2] : $11_1; $1733($0_1); HEAP32[$0_1 + 72 >> 2] = $1735($12_1, 0, -2147483648); HEAP32[$0_1 + 76 >> 2] = i64toi32_i32$HIGH_BITS; HEAP32[$0_1 + 80 >> 2] = $1735($11_1, -1, 2147483647); HEAP32[$0_1 + 84 >> 2] = i64toi32_i32$HIGH_BITS; if ($2_1) { $3 = HEAPU8[$2_1 | 0] == 68 } else { $3 = HEAPU8[$7_1 + 239 | 0] } HEAP16[$0_1 + 4 >> 1] = $1_1; HEAP8[$0_1 + 52 | 0] = $3; block12 : { if ($9_1 >>> 0 >= 2) { $4_1 = $53($10_1); if (!$4_1) { $3 = HEAPU16[$10_1 + 16 >> 1]; $2_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $3 = 1 << $2_1; $6_1 = 0; } else { $6_1 = 1 << $2_1; $3 = $6_1 - 1 & 1 >>> 32 - $2_1; } if (!($6_1 & -1431655766 | $3 & -1431655766)) { break block12 } } $2_1 = $9_1 - 2 | 0; HEAP32[$0_1 + 20 >> 2] = 0; $3 = 0; if ($8_1) { $3 = $50($8_1); HEAP32[$0_1 + 20 >> 2] = $3; } $6_1 = HEAPU8[$7_1 + 236 | 0]; $8_1 = HEAP32[$7_1 + 36 >> 2]; $9_1 = HEAP32[$7_1 + 28 >> 2]; $13_1 = HEAP32[$7_1 + 24 >> 2]; HEAP32[$5_1 + 108 >> 2] = 0; HEAP32[$5_1 + 100 >> 2] = 0; HEAP32[$5_1 + 104 >> 2] = 0; HEAP32[$5_1 + 96 >> 2] = $2_1; HEAP32[$5_1 + 92 >> 2] = $13_1; HEAP32[$5_1 + 84 >> 2] = $9_1; HEAP32[$5_1 + 80 >> 2] = $3; HEAP32[$5_1 + 76 >> 2] = $8_1; HEAP32[$5_1 + 88 >> 2] = $6_1; $2_1 = $0_1 + 16 | 0; block15 : { if (!$4_1) { $6_1 = 0; HEAP32[$2_1 >> 2] = 0; break block15; } $8_1 = $7_1 + 8 | 0; $3 = $1736($5_1 + 76 | 0, $4_1, $2080($4_1), $2_1, $5_1 + 124 | 0); $6_1 = HEAP32[$2_1 >> 2]; block17 : { if (!(!HEAP32[$5_1 + 108 >> 2] | $3)) { $1737($6_1); HEAP32[$2_1 >> 2] = 0; break block17; } block18 : { if ($3) { break block18 } if (!$6_1) { $6_1 = 0; break block15; } $3 = $1738($2_1, 12); $6_1 = HEAP32[$2_1 >> 2]; if ($3) { break block18 } $3 = $1739($6_1, 12); if (!$3) { break block15 } } $1737($6_1); HEAP32[$2_1 >> 2] = 0; if (($3 | 0) == 1) { break block17 } if (($3 | 0) != 18) { break block } HEAP32[$5_1 + 64 >> 2] = 12; $1655($8_1, 25737, $5_1 - -64 | 0); $3 = 1; break block; } HEAP32[$5_1 + 48 >> 2] = $4_1; $1655($8_1, 18412, $5_1 + 48 | 0); $3 = 1; break block; } $2_1 = HEAP32[$0_1 >> 2]; HEAP32[$5_1 + 76 >> 2] = 0; HEAP32[$5_1 + 124 >> 2] = 0; HEAP32[$5_1 + 120 >> 2] = 0; $1740($0_1, $6_1, $5_1 + 124 | 0, $5_1 + 120 | 0, $5_1 + 76 | 0); block20 : { if (HEAP32[$5_1 + 76 >> 2]) { break block20 } $3 = HEAP32[$5_1 + 124 >> 2]; if (!HEAPU8[$2_1 + 236 | 0] | ($3 | 0) < 2) { break block20 } $3 = Math_imul($3, 24); $2_1 = $31($3 + (HEAP32[$5_1 + 120 >> 2] << 3) | 0, 0); if (!$2_1) { HEAP32[$5_1 + 76 >> 2] = 7; break block20; } HEAP32[$5_1 + 116 >> 2] = $2_1; $6_1 = $2_1 + $3 | 0; HEAP32[$5_1 + 112 >> 2] = $6_1; $3 = 0; $1741($0_1, 0, HEAP32[$0_1 + 16 >> 2], $5_1 + 116 | 0, $5_1 + 112 | 0, $5_1 + 76 | 0); $8_1 = (HEAP32[$5_1 + 116 >> 2] - $2_1 | 0) / 24 | 0; if (!HEAP32[$5_1 + 76 >> 2]) { $9_1 = HEAP32[$5_1 + 112 >> 2] - $6_1 >> 2; $4_1 = $1742($0_1, 0, $2_1, $8_1); while (1) { if (!(($3 | 0) >= ($9_1 | 0) | $4_1)) { $4_1 = $1742($0_1, HEAP32[$6_1 + ($3 << 2) >> 2], $2_1, $8_1); $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$5_1 + 76 >> 2] = $4_1; } $24($2_1); } $1743($0_1, HEAP32[$0_1 + 16 >> 2], $5_1 + 76 | 0); $3 = HEAP32[$5_1 + 76 >> 2]; $1660($7_1); if ($3) { break block } HEAP32[$0_1 + 32 >> 2] = 0; HEAP32[$0_1 + 36 >> 2] = 0; HEAP32[$0_1 + 40 >> 2] = HEAP32[$0_1 + 44 >> 2]; } block26 : { block29 : { block25 : { switch ($1_1 & 65535) { case 0: $1_1 = HEAP32[$7_1 + 224 >> 2]; block28 : { if ($11_1 | $12_1) { $2_1 = HEAP32[$0_1 + 72 >> 2]; $3 = HEAP32[$0_1 + 76 >> 2]; $4_1 = HEAPU8[$0_1 + 52 | 0]; $10_1 = HEAP32[$0_1 + 84 >> 2]; $6_1 = $5_1 + 16 | 0; HEAP32[$6_1 >> 2] = HEAP32[$0_1 + 80 >> 2]; HEAP32[$6_1 + 4 >> 2] = $10_1; HEAP32[$5_1 + 24 >> 2] = $4_1 ? 20576 : 20990; HEAP32[$5_1 + 8 >> 2] = $2_1; HEAP32[$5_1 + 12 >> 2] = $3; HEAP32[$5_1 >> 2] = $1_1; $1_1 = $61(7112, $5_1); break block28; } $2_1 = HEAPU8[$0_1 + 52 | 0]; HEAP32[$5_1 + 32 >> 2] = $1_1; HEAP32[$5_1 + 36 >> 2] = $2_1 ? 20576 : 20990; $1_1 = $61(7084, $5_1 + 32 | 0); } if (!$1_1) { break block12 } HEAP32[$7_1 + 56 >> 2] = HEAP32[$7_1 + 56 >> 2] + 1; $3 = $352(HEAP32[$7_1 + 12 >> 2], $1_1, 1, $0_1 + 12 | 0); HEAP32[$7_1 + 56 >> 2] = HEAP32[$7_1 + 56 >> 2] - 1; $24($1_1); break block29; case 1: break block25; default: break block26; }; } $3 = $1744($0_1); if ($3) { break block } $3 = $286(HEAP32[$0_1 + 12 >> 2], 1, $10_1); } if ($3) { break block } } $3 = $1745($0_1); break block; } $3 = 7; } $0_1 = $5_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $1735($0_1, $1_1, $2_1) { block : { if (!$0_1) { break block } if (($301($0_1) | 0) != 1) { break block } $1_1 = $50($0_1); $2_1 = i64toi32_i32$HIGH_BITS; } i64toi32_i32$HIGH_BITS = $2_1; return $1_1; } function $1736($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0; $6_1 = global$0 - 32 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; HEAP32[$6_1 + 4 >> 2] = 0; $21_1 = 1; $17_1 = $2_1; while (1) { block4 : { block51 : { block5 : { block6 : { block3 : { block2 : { if (!$13_1) { HEAP32[$6_1 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 0; $14 = $17_1 >> 31 & $17_1; $9_1 = $1_1; $5_1 = $17_1; while (1) { if (($5_1 | 0) > 0) { $7_1 = HEAPU8[$9_1 | 0] - 9 | 0; if ($7_1 >>> 0 > 23 | !(1 << $7_1 & 8388639)) { break block2 } $9_1 = $9_1 + 1 | 0; $5_1 = $5_1 - 1 | 0; continue; } break; }; if (($17_1 | 0) < 0) { break block3 } $13_1 = 101; $15_1 = 0; break block4; } $9_1 = HEAP32[$6_1 + 4 >> 2]; HEAP32[$4_1 >> 2] = $2_1 - $17_1; $11_1 = ($13_1 | 0) == 101 ? ($9_1 ? ($21_1 ? 1 : $13_1) : $13_1) : $13_1; $5_1 = 0; if (($11_1 | 0) == 101) { break block5 } break block6; } $14 = $5_1; } $12_1 = $9_1 - $1_1 | 0; $19_1 = $9_1 + 1 | 0; $10_1 = 0; $15_1 = 0; $5_1 = 0; while (1) { block12 : { block8 : { block13 : { if (($5_1 | 0) != 4) { $7_1 = $5_1 << 3; if (HEAPU8[$7_1 + 57493 | 0] > 1) { break block8 } $7_1 = $7_1 + 57488 | 0; $11_1 = HEAPU8[$7_1 + 4 | 0]; if (($11_1 | 0) > ($14 | 0)) { break block8 } if ($2014($9_1, HEAP32[$7_1 >> 2], $11_1)) { break block8 } HEAP32[$6_1 + 28 >> 2] = 10; $18_1 = HEAPU8[$7_1 + 6 | 0]; if (!(($18_1 | 0) != 1 | HEAPU8[$9_1 + 4 | 0] != 47 | (HEAPU8[$9_1 + 5 | 0] - 48 & 255) >>> 0 > 9)) { $11_1 = ($1781($11_1 + $19_1 | 0, $6_1 + 28 | 0) + $11_1 | 0) + 1 | 0 } $7_1 = HEAPU8[$9_1 + $11_1 | 0]; block10 : { if ($7_1 >>> 0 >= 42) { break block10 } $8_1 = $7_1 & 31; if (($7_1 & 63) >>> 0 >= 32) { $8_1 = 773 >>> $8_1 | 0 } else { $8_1 = ((1 << $8_1) - 1 & 773) << 32 - $8_1 | 15873 >>> $8_1 } if (!($8_1 & 1)) { break block10 } $8_1 = $7_1 & 31; if (($7_1 & 63) >>> 0 >= 32) { $20_1 = 772 >>> $8_1 | 0 } else { $20_1 = ((1 << $8_1) - 1 & 772) << 32 - $8_1 | 1 >>> $8_1 } $8_1 = $1642(48, 0); if ($8_1) { HEAP32[$8_1 >> 2] = $18_1; HEAP32[$8_1 + 4 >> 2] = HEAP32[$6_1 + 28 >> 2]; HEAP32[$6_1 >> 2] = $8_1; $15_1 = $11_1 + $12_1 | 0; $13_1 = 0; $10_1 = $8_1; if ($20_1 & 1) { break block10 } break block12; } $13_1 = 7; if (!($20_1 & 1)) { break block4 } } $8_1 = $7_1 - 34 | 0; if ($8_1 >>> 0 > 7 | !(1 << $8_1 & 193)) { break block13 } break block12; } block14 : { block15 : { block16 : { $5_1 = HEAPU8[$9_1 | 0]; switch ($5_1 - 40 | 0) { case 0: break block14; case 1: break block15; default: break block16; }; } if (($5_1 | 0) == 34) { $5_1 = 1; $11_1 = ($14 | 0) <= 1 ? 1 : $14; while (1) { block19 : { if (($5_1 | 0) != ($11_1 | 0)) { if (HEAPU8[$5_1 + $9_1 | 0] != 34) { break block19 } $11_1 = $5_1; } $13_1 = 1; $15_1 = ($11_1 + $12_1 | 0) + 1 | 0; if (($11_1 | 0) == ($14 | 0)) { break block4 } $7_1 = HEAP32[$0_1 >> 2]; $20_1 = HEAP32[$7_1 >> 2]; $10_1 = 0; $14 = 0; $12_1 = 0; $5_1 = 0; block26 : { block22 : { block20 : { $22_1 = $11_1 - 1 | 0; $13_1 = $1789($7_1, HEAP32[$0_1 + 4 >> 2], $19_1, $22_1, $6_1 + 28 | 0); if ($13_1) { break block20 } $8_1 = 0; $7_1 = 0; $13_1 = 0; while (1) { if ($13_1) { break block20 } HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; $13_1 = FUNCTION_TABLE[HEAP32[$20_1 + 20 >> 2]](HEAP32[$6_1 + 28 >> 2], $6_1 + 24 | 0, $6_1 + 20 | 0, $6_1 + 16 | 0, $6_1 + 12 | 0, $6_1 + 8 | 0) | 0; if ($13_1) { $8_1 = $8_1 + 1 | 0; $7_1 = $8_1 ? $7_1 : $7_1 + 1 | 0; continue; } $11_1 = __wasm_i64_mul($8_1, $7_1, 24, 0); $11_1 = $11_1 + 144 | 0; $10_1 = $1790($10_1, $11_1 & -8, 0); $5_1 = HEAP32[$6_1 + 20 >> 2] + $12_1 | 0; $14 = $1790($14, $5_1, $5_1 >> 31); if (!$14 | !$10_1) { break block22 } $5_1 = Math_imul($8_1, 24) + $10_1 | 0; HEAP32[$5_1 + 120 >> 2] = 0; HEAP32[$5_1 + 124 >> 2] = 0; $11_1 = $5_1 + 136 | 0; HEAP32[$11_1 >> 2] = 0; HEAP32[$11_1 + 4 >> 2] = 0; $11_1 = $5_1 + 128 | 0; HEAP32[$11_1 >> 2] = 0; HEAP32[$11_1 + 4 >> 2] = 0; $11_1 = HEAP32[$6_1 + 20 >> 2]; if ($11_1) { wasm2js_memory_copy($12_1 + $14 | 0, HEAP32[$6_1 + 24 >> 2], $11_1) } $23_1 = HEAP32[$6_1 + 20 >> 2]; HEAP32[$5_1 + 124 >> 2] = $23_1; $11_1 = 0; $18_1 = 0; $5_1 = $5_1 + 120 | 0; $24_1 = HEAP32[$6_1 + 12 >> 2]; if (($22_1 | 0) > ($24_1 | 0)) { $18_1 = HEAPU8[$19_1 + $24_1 | 0] == 42 } HEAP32[$5_1 + 8 >> 2] = $18_1; $12_1 = $12_1 + $23_1 | 0; $18_1 = HEAP32[$6_1 + 16 >> 2]; if (($18_1 | 0) > 0) { $11_1 = HEAPU8[$9_1 + $18_1 | 0] == 94 } HEAP32[$5_1 + 12 >> 2] = $11_1; $8_1 = $8_1 + 1 | 0; $7_1 = $8_1 ? $7_1 : $7_1 + 1 | 0; $5_1 = $8_1; continue; }; } if (($13_1 | 0) != 101) { break block26 } $7_1 = Math_imul($5_1, 24); $10_1 = $1790($10_1, ($7_1 + $12_1 | 0) + 144 | 0, 0); if (!$10_1) { $13_1 = 7; $10_1 = 0; break block26; } wasm2js_memory_fill($10_1, 0, 120); $9_1 = $10_1 + 48 | 0; HEAP32[$10_1 + 20 >> 2] = $9_1; HEAP32[$10_1 >> 2] = 5; $8_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$10_1 + 112 >> 2] = $5_1; HEAP32[$10_1 + 116 >> 2] = $8_1; $5_1 = ($7_1 + $10_1 | 0) + 120 | 0; $13_1 = 0; if ($14) { if ($12_1) { wasm2js_memory_copy($5_1, $14, $12_1) } $9_1 = HEAP32[$10_1 + 20 >> 2]; } $7_1 = HEAP32[$9_1 + 64 >> 2]; $7_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $8_1 = $9_1 + 76 | 0; $11_1 = $9_1 + 72 | 0; $9_1 = 0; while (1) { if (($7_1 | 0) == ($9_1 | 0)) { break block26 } $12_1 = Math_imul($9_1, 24); HEAP32[$12_1 + $11_1 >> 2] = $5_1; $9_1 = $9_1 + 1 | 0; $5_1 = HEAP32[$8_1 + $12_1 >> 2] + $5_1 | 0; continue; }; } $13_1 = 7; } $5_1 = HEAP32[$6_1 + 28 >> 2]; if ($5_1) { FUNCTION_TABLE[HEAP32[$20_1 + 16 >> 2]]($5_1) | 0 } $24($14); if ($13_1) { $24($10_1); $10_1 = 0; } HEAP32[$6_1 >> 2] = $10_1; break block12; } $5_1 = $5_1 + 1 | 0; continue; }; } $15_1 = 0; $5_1 = HEAP32[$0_1 + 16 >> 2]; $10_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $7_1 = HEAP32[$0_1 + 20 >> 2]; $5_1 = 0; while (1) { block35 : { block34 : { if (($5_1 | 0) == ($10_1 | 0)) { $5_1 = $7_1; break block34; } $11_1 = HEAP32[HEAP32[$0_1 + 8 >> 2] + ($5_1 << 2) >> 2]; $8_1 = $2080($11_1); if (($8_1 | 0) >= ($14 | 0) | HEAPU8[$9_1 + $8_1 | 0] != 58) { break block35 } if ($68($11_1, $9_1, $8_1)) { break block35 } $15_1 = ($8_1 + $12_1 | 0) + 1 | 0; } $9_1 = 0; $11_1 = $17_1 - $15_1 | 0; $12_1 = ($11_1 | 0) > 0 ? $11_1 : 0; $7_1 = $1_1 + $15_1 | 0; $8_1 = HEAP32[$0_1 >> 2]; $14 = HEAP32[$8_1 >> 2]; while (1) { block37 : { if (($9_1 | 0) != ($12_1 | 0)) { $10_1 = HEAPU8[$7_1 + $9_1 | 0] - 34 | 0; if ($10_1 >>> 0 > 7 | !(1 << $10_1 & 193)) { break block37 } $12_1 = $9_1; } $10_1 = 0; $13_1 = $1789($8_1, HEAP32[$0_1 + 4 >> 2], $7_1, $12_1, $6_1 + 28 | 0); if (!$13_1) { HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; $19_1 = HEAP32[$6_1 + 28 >> 2]; $8_1 = FUNCTION_TABLE[HEAP32[$14 + 20 >> 2]]($19_1, $6_1 + 24 | 0, $6_1 + 20 | 0, $6_1 + 16 | 0, $6_1 + 12 | 0, $6_1 + 8 | 0) | 0; block41 : { if (!$8_1) { $10_1 = $1642(HEAP32[$6_1 + 20 >> 2] + 144 | 0, 0); if (!$10_1) { $10_1 = 0; $12_1 = HEAP32[$6_1 + 12 >> 2]; $13_1 = 7; break block41; } HEAP32[$10_1 + 116 >> 2] = $5_1; HEAP32[$10_1 + 112 >> 2] = 1; HEAP32[$10_1 >> 2] = 5; HEAP32[$10_1 + 20 >> 2] = $10_1 + 48; $5_1 = HEAP32[$6_1 + 20 >> 2]; $8_1 = $10_1 + 144 | 0; HEAP32[$10_1 + 120 >> 2] = $8_1; HEAP32[$10_1 + 124 >> 2] = $5_1; if ($5_1) { wasm2js_memory_copy($8_1, HEAP32[$6_1 + 24 >> 2], $5_1) } $12_1 = HEAP32[$6_1 + 12 >> 2]; if (!(($11_1 | 0) <= ($12_1 | 0) | HEAPU8[$7_1 + $12_1 | 0] != 42)) { HEAP32[$10_1 + 128 >> 2] = 1; $12_1 = $12_1 + 1 | 0; HEAP32[$6_1 + 12 >> 2] = $12_1; } $5_1 = $7_1 - 1 | 0; $7_1 = HEAP32[$0_1 + 12 >> 2]; $9_1 = HEAP32[$6_1 + 16 >> 2]; while (1) { if (!(!$7_1 | ($9_1 | 0) <= 0 | HEAPU8[$5_1 + $9_1 | 0] != 94)) { HEAP32[$10_1 + 132 >> 2] = 1; $9_1 = $9_1 - 1 | 0; continue; } break; }; HEAP32[$6_1 + 16 >> 2] = $9_1; $13_1 = 0; break block41; } $13_1 = $12_1 ? (($8_1 | 0) != 101 ? $8_1 : 0) : $8_1; } FUNCTION_TABLE[HEAP32[$14 + 16 >> 2]]($19_1) | 0; } HEAP32[$6_1 >> 2] = $10_1; $15_1 = $12_1 + $15_1 | 0; break block12; } $9_1 = $9_1 + 1 | 0; continue; }; } $5_1 = $5_1 + 1 | 0; continue; }; } HEAP32[$0_1 + 32 >> 2] = HEAP32[$0_1 + 32 >> 2] - 1; $15_1 = $12_1 + 1 | 0; $13_1 = 101; break block4; } HEAP32[$6_1 + 28 >> 2] = 0; $13_1 = 1; $5_1 = HEAP32[$0_1 + 32 >> 2]; HEAP32[$0_1 + 32 >> 2] = $5_1 + 1; if (($5_1 | 0) > 999) { break block12 } $13_1 = $1736($0_1, $19_1, $14 - 1 | 0, $6_1, $6_1 + 28 | 0); $15_1 = ($12_1 + HEAP32[$6_1 + 28 >> 2] | 0) + 1 | 0; $10_1 = HEAP32[$6_1 >> 2]; break block12; } if (!$7_1) { break block12 } } $5_1 = $5_1 + 1 | 0; continue; } break; }; if (!$10_1 | $13_1) { break block4 } block47 : { block46 : { $8_1 = HEAP32[$10_1 >> 2]; if (($8_1 | 0) == 5) { $5_1 = 0; $12_1 = ($21_1 | 0) != 0; $9_1 = 1; break block46; } $12_1 = ($21_1 | 0) != 0; $7_1 = HEAP32[$10_1 + 12 >> 2]; $9_1 = ($7_1 | 0) != 0; $5_1 = !$7_1; if (!$21_1 | $7_1) { break block46 } $11_1 = 1; break block47; } block50 : { block49 : { if (!($5_1 | $12_1)) { $7_1 = $1642(48, 0); if ($7_1) { break block49 } $11_1 = 7; break block47; } if ($16_1) { break block50 } $16_1 = 0; break block51; } HEAP32[$7_1 >> 2] = 3; $1791($6_1 + 4 | 0, $16_1, $7_1); $16_1 = $7_1; } if (!(!(($8_1 | 0) != 1 | $9_1) & HEAP32[$16_1 >> 2] != 5)) { if ($9_1 ^ 1 | ($8_1 | 0) == 5 | HEAP32[$16_1 >> 2] != 1) { break block51 } } $10_1 = HEAP32[$6_1 >> 2]; $11_1 = 1; } $1737($10_1); $9_1 = HEAP32[$6_1 + 4 >> 2]; } $1737($9_1); $9_1 = 0; $1737(0); $5_1 = $11_1; } HEAP32[$3 >> 2] = $9_1; $0_1 = $6_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } block57 : { block56 : { block55 : { if ($9_1) { $7_1 = HEAP32[$6_1 >> 2]; if (!HEAP32[$6_1 + 4 >> 2]) { break block55 } HEAP32[$16_1 + 16 >> 2] = $7_1; HEAP32[$7_1 + 8 >> 2] = $16_1; break block56; } $1791($6_1 + 4 | 0, $16_1, HEAP32[$6_1 >> 2]); $7_1 = HEAP32[$6_1 >> 2]; break block57; } HEAP32[$6_1 + 4 >> 2] = $7_1; } } $16_1 = $7_1; $13_1 = 0; $21_1 = $5_1; } $1_1 = $1_1 + $15_1 | 0; $17_1 = $17_1 - $15_1 | 0; continue; }; } function $1737($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { $1_1 = $0_1; if ($1_1) { $0_1 = HEAP32[$1_1 + 12 >> 2]; if ($0_1) { continue } $0_1 = HEAP32[$1_1 + 16 >> 2]; if ($0_1) { continue } } break; }; while (1) { if ($1_1) { $2_1 = $1_1; $3 = HEAP32[$1_1 + 8 >> 2]; block2 : { $1_1 = HEAP32[$1_1 + 20 >> 2]; if (!$1_1) { break block2 } $24(HEAP32[$1_1 >> 2]); $1786($1_1); $0_1 = 0; wasm2js_memory_fill($1_1, 0, 40); $5_1 = $1_1 + 92 | 0; while (1) { if (HEAP32[$1_1 + 64 >> 2] <= ($0_1 | 0)) { break block2 } $4_1 = Math_imul($0_1, 24) + $5_1 | 0; $1787(HEAP32[$4_1 >> 2]); HEAP32[$4_1 >> 2] = 0; $0_1 = $0_1 + 1 | 0; continue; }; } $24(HEAP32[$2_1 + 40 >> 2]); $24($2_1); $1_1 = 0; if (!$3) { continue } $1_1 = $3; if (HEAP32[$1_1 + 12 >> 2] != ($2_1 | 0)) { continue } $0_1 = HEAP32[$1_1 + 16 >> 2]; if (!$0_1) { continue } while (1) { $1_1 = $0_1; $0_1 = HEAP32[$1_1 + 12 >> 2]; if ($0_1) { continue } $0_1 = HEAP32[$1_1 + 16 >> 2]; if ($0_1) { continue } break; }; continue; } break; }; } function $1738($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 - 16 | 0; $2_1 = $6_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = HEAP32[$0_1 >> 2]; block23 : { block20 : { block1 : { if (!$1_1) { $5_1 = 1; break block1; } $10_1 = HEAP32[$2_1 >> 2]; block19 : { if ($10_1 - 3 >>> 0 <= 1) { $3 = $1_1 << 2; $9_1 = $31($3, 0); if (!$9_1) { $5_1 = 7; break block1; } if ($3) { wasm2js_memory_fill($9_1, 0, $3) } $4_1 = $2_1; while (1) if (HEAP32[$4_1 >> 2] != ($10_1 | 0)) { HEAP32[$6_1 + 12 >> 2] = $4_1; $12_1 = $1_1 - 1 | 0; $3 = 0; block15 : { block12 : { while (1) { $7_1 = HEAP32[$4_1 + 8 >> 2]; HEAP32[$4_1 + 8 >> 2] = 0; $8_1 = 0; if ($7_1) { HEAP32[$7_1 + 12 >> 2] = 0; $8_1 = $2_1; } block11 : { $5_1 = $1738($6_1 + 12 | 0, $12_1); if (!$5_1) { $4_1 = 0; $2_1 = HEAP32[$6_1 + 12 >> 2]; while (1) { if (!(!$2_1 | ($1_1 | 0) <= ($4_1 | 0))) { $11_1 = ($4_1 << 2) + $9_1 | 0; $5_1 = HEAP32[$11_1 >> 2]; block10 : { if (!$5_1) { $5_1 = $2_1; $2_1 = 0; break block10; } HEAP32[$3 + 16 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = $5_1; HEAP32[$5_1 + 8 >> 2] = $3; HEAP32[$2_1 + 8 >> 2] = $3; $13_1 = HEAP32[$3 + 8 >> 2]; $5_1 = 0; HEAP32[$3 + 8 >> 2] = 0; $2_1 = $3; $3 = $13_1; } HEAP32[$11_1 >> 2] = $5_1; $4_1 = $4_1 + 1 | 0; continue; } break; }; if (!$2_1) { break block11 } $1737($2_1); $5_1 = 18; } $4_1 = 0; $1_1 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (($1_1 | 0) == ($4_1 | 0)) { break block12 } $1737(HEAP32[($4_1 << 2) + $9_1 >> 2]); $4_1 = $4_1 + 1 | 0; continue; }; } if ($7_1) { $2_1 = $7_1 + 16 | 0; while (1) { $4_1 = HEAP32[$2_1 >> 2]; $2_1 = $4_1 + 12 | 0; if (($10_1 | 0) == HEAP32[$4_1 >> 2]) { continue } break; }; HEAP32[$6_1 + 12 >> 2] = $4_1; $2_1 = HEAP32[$7_1 + 16 >> 2]; $5_1 = HEAP32[$7_1 + 8 >> 2]; HEAP32[$2_1 + 8 >> 2] = $5_1; if ($5_1) { HEAP32[$5_1 + 12 >> 2] = $2_1; $2_1 = $8_1; } HEAP32[$7_1 + 8 >> 2] = $3; $3 = $7_1; continue; } break; }; $5_1 = 0; $8_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $2_1 = 0; $4_1 = 0; while (1) { if (($4_1 | 0) == ($8_1 | 0)) { break block15 } $7_1 = ($4_1 << 2) + $9_1 | 0; $1_1 = HEAP32[$7_1 >> 2]; block16 : { if (!$1_1) { break block16 } if (!$2_1) { HEAP32[$1_1 + 8 >> 2] = 0; $2_1 = $1_1; break block16; } HEAP32[$3 + 16 >> 2] = $2_1; $1_1 = HEAP32[$7_1 >> 2]; HEAP32[$3 + 12 >> 2] = $1_1; HEAP32[$1_1 + 8 >> 2] = $3; HEAP32[$2_1 + 8 >> 2] = $3; $1_1 = HEAP32[$3 + 8 >> 2]; HEAP32[$3 + 8 >> 2] = 0; $2_1 = $3; $3 = $1_1; } $4_1 = $4_1 + 1 | 0; continue; }; } while (1) { if ($3) { $1_1 = HEAP32[$3 + 8 >> 2]; $24($3); $3 = $1_1; continue; } break; }; $2_1 = $8_1; } $24($9_1); break block19; } else { $4_1 = HEAP32[$4_1 + 12 >> 2]; continue; }; } if (($10_1 | 0) != 2) { break block20 } $8_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$6_1 + 8 >> 2] = $8_1; $3 = HEAP32[$2_1 + 16 >> 2]; HEAP32[$6_1 + 4 >> 2] = $3; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$8_1 + 8 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; block22 : { $1_1 = $1_1 - 1 | 0; $5_1 = $1738($6_1 + 8 | 0, $1_1); if (!$5_1) { $5_1 = $1738($6_1 + 4 | 0, $1_1); $3 = HEAP32[$6_1 + 4 >> 2]; if (!$5_1) { break block22 } } $1737($3); $1737(HEAP32[$6_1 + 8 >> 2]); break block19; } $1_1 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$2_1 + 12 >> 2] = $1_1; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$2_1 + 16 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; $5_1 = 0; } if (!$5_1) { break block20 } } $1737($2_1); $2_1 = 0; break block23; } $5_1 = 0; } HEAP32[$0_1 >> 2] = $2_1; $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1739($0_1, $1_1) { var $2_1 = 0; while (1) { if (!$0_1) { return 0 } block2 : { if (($1_1 | 0) < 0) { $2_1 = 18; break block2; } $1_1 = $1_1 - 1 | 0; $2_1 = $1739(HEAP32[$0_1 + 12 >> 2], $1_1); if ($2_1) { break block2 } $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; return $2_1; } function $1740($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; block : { while (1) { if (HEAP32[$4_1 >> 2] | !$1_1) { break block } block2 : { $5_1 = HEAP32[$1_1 >> 2]; if (($5_1 | 0) == 5) { $3 = $2_1; $5_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[HEAP32[$1_1 + 20 >> 2] + 64 >> 2]; HEAP32[$3 >> 2] = $5_1 + $2_1; $14 = ($2_1 | 0) > 0 ? $2_1 : 0; while (1) { $2_1 = HEAP32[$1_1 + 20 >> 2]; if (($11_1 | 0) == ($14 | 0)) { break block2 } $2_1 = $2_1 + Math_imul($11_1, 24) | 0; $13_1 = $2_1 + 72 | 0; $12_1 = HEAP32[$2_1 + 80 >> 2]; $8_1 = HEAP32[$2_1 + 76 >> 2]; $10_1 = HEAP32[$2_1 + 72 >> 2]; $6_1 = $23(64); block4 : { if (!$6_1) { HEAP32[$13_1 + 20 >> 2] = 0; $7_1 = 7; break block4; } $5_1 = HEAP32[$0_1 >> 2]; block8 : { block5 : { if (!$12_1) { break block5 } $7_1 = 7; $9_1 = 0; $2_1 = 1; $3 = 1; while (1) { block7 : { if (!$9_1) { if (HEAP32[$5_1 + 260 >> 2] > ($3 | 0)) { break block7 } $2_1 = 0; } $3 = 1; $9_1 = $8_1 + 1 | 0; while (1) { if ($2_1) { break block8 } if (HEAP32[$5_1 + 260 >> 2] <= ($3 | 0)) { break block5 } $2_1 = 0; block9 : { if (($9_1 | 0) != HEAP32[HEAP32[$5_1 + 264 >> 2] + Math_imul($3, 24) >> 2]) { break block9 } $2_1 = 1; $7_1 = $1663($5_1, HEAP32[$0_1 + 20 >> 2], $3, -2, $10_1, $8_1, 1, 0, $6_1); if ($7_1) { break block9 } $7_1 = $1673($5_1, HEAP32[$0_1 + 20 >> 2], 0, -2, $10_1, $8_1, 0, 0, $6_1); } $3 = $3 + 1 | 0; continue; }; } $9_1 = 0; if (($8_1 | 0) == HEAP32[HEAP32[$5_1 + 264 >> 2] + Math_imul($3, 24) >> 2]) { $7_1 = $1663($5_1, HEAP32[$0_1 + 20 >> 2], $3, -2, $10_1, $8_1, 0, 0, $6_1); HEAP32[$6_1 + 44 >> 2] = 1; $9_1 = 1; } $3 = $3 + 1 | 0; continue; }; } $7_1 = $1663($5_1, HEAP32[$0_1 + 20 >> 2], 0, -2, $10_1, $8_1, $12_1, 0, $6_1); HEAP32[$6_1 + 44 >> 2] = !$12_1; } HEAP32[$13_1 + 20 >> 2] = $6_1; $11_1 = $11_1 + 1 | 0; if (!$7_1) { continue } } break; }; HEAP32[$4_1 >> 2] = $7_1; return; } HEAP32[$3 >> 2] = HEAP32[$3 >> 2] + (($5_1 | 0) == 4); $1740($0_1, HEAP32[$1_1 + 12 >> 2], $2_1, $3, $4_1); $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; } break; }; HEAP32[$2_1 + 44 >> 2] = -1; } } function $1741($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0; $10_1 = global$0 - 16 | 0; $6_1 = $10_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; while (1) { block4 : { block2 : { block : { if (HEAP32[$5_1 >> 2]) { break block } block3 : { switch (HEAP32[$2_1 >> 2] - 2 | 0) { default: $6_1 = HEAP32[$2_1 + 12 >> 2]; break block4; case 0: break block; case 2: break block2; case 3: break block3; }; } $11_1 = HEAP32[$2_1 + 20 >> 2]; $17_1 = $11_1 + 72 | 0; $2_1 = 0; label1 : while (1) { if (HEAP32[$11_1 + 64 >> 2] <= ($12_1 | 0) | $2_1) { break block } $7_1 = HEAP32[$3 >> 2]; HEAP32[$3 >> 2] = $7_1 + 24; HEAP32[$7_1 + 12 >> 2] = $1_1; HEAP32[$7_1 + 4 >> 2] = $12_1; HEAP32[$7_1 >> 2] = $11_1; $2_1 = Math_imul($12_1, 24) + $17_1 | 0; HEAP32[$7_1 + 8 >> 2] = $2_1; HEAP32[$7_1 + 20 >> 2] = HEAP32[$11_1 + 68 >> 2]; $14 = HEAP32[$2_1 + 20 >> 2]; $15_1 = HEAP32[$0_1 >> 2]; $16_1 = HEAP32[$15_1 + 244 >> 2]; $2_1 = 0; $4_1 = 0; $13_1 = 0; while (1) { block7 : { block6 : { if (!(HEAP32[$14 + 4 >> 2] <= ($4_1 | 0) | $2_1)) { $8_1 = HEAP32[HEAP32[$14 >> 2] + ($4_1 << 2) >> 2]; if (HEAP32[$8_1 + 56 >> 2] | HEAPU8[$8_1 + 5 | 0]) { break block6 } $9_1 = HEAP32[$8_1 + 8 >> 2]; $6_1 = HEAP32[$8_1 + 12 >> 2]; while (1) { $2_1 = HEAP32[$8_1 + 20 >> 2]; if (HEAPU32[$8_1 + 16 >> 2] < $9_1 >>> 0 & ($2_1 | 0) <= ($6_1 | 0) | ($2_1 | 0) < ($6_1 | 0)) { break block6 } $2_1 = $1682($15_1, $9_1, $6_1, 0, $10_1 + 12 | 0); if ($2_1) { break block7 } $2_1 = HEAP32[$10_1 + 12 >> 2]; if (($2_1 + 35 | 0) > ($16_1 | 0)) { $13_1 = (($2_1 + 34 | 0) / ($16_1 | 0) | 0) + $13_1 | 0 } $9_1 = $9_1 + 1 | 0; $6_1 = $9_1 ? $6_1 : $6_1 + 1 | 0; continue; }; } HEAP32[$7_1 + 16 >> 2] = $13_1; HEAP32[$5_1 >> 2] = $2_1; $12_1 = $12_1 + 1 | 0; continue label1; } $2_1 = 0; } $4_1 = $4_1 + 1 | 0; continue; }; }; } $0_1 = $10_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return; } $1_1 = HEAP32[$4_1 >> 2]; $6_1 = HEAP32[$2_1 + 12 >> 2]; HEAP32[$1_1 >> 2] = $6_1; HEAP32[$4_1 >> 2] = $1_1 + 4; $1_1 = $6_1; } $1741($0_1, $1_1, $6_1, $3, $4_1, $5_1); $6_1 = HEAP32[$2_1 >> 2]; $2_1 = HEAP32[$2_1 + 16 >> 2]; if (($6_1 | 0) != 4) { continue } $1_1 = HEAP32[$4_1 >> 2]; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$4_1 >> 2] = $1_1 + 4; $1_1 = $2_1; continue; }; } function $1742($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0; $6_1 = global$0 - 32 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $4_1; block : { $11_1 = HEAP32[$0_1 >> 2]; if (HEAP32[$11_1 + 40 >> 2]) { break block } $4_1 = 0; $16_1 = ($3 | 0) > 0 ? $3 : 0; $3 = 0; while (1) { if (!(($3 | 0) == ($16_1 | 0))) { $5_1 = Math_imul($3, 24) + $2_1 | 0; if (($1_1 | 0) == HEAP32[$5_1 + 12 >> 2]) { $12_1 = $12_1 + 1 | 0; $4_1 = HEAP32[$5_1 + 16 >> 2] + $4_1 | 0; } $3 = $3 + 1 | 0; continue; } break; }; $5_1 = 0; if (!$4_1 | ($12_1 | 0) < 2) { break block } $13_1 = HEAP32[$0_1 + 60 >> 2]; block3 : { if ($13_1) { break block3 } HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; block7 : { $5_1 = $1792($11_1, $6_1 + 28 | 0); if (!$5_1) { $5_1 = HEAP32[$6_1 + 28 >> 2]; $3 = $273($5_1, 0); block5 : { if (!$3) { break block5 } $4_1 = $274($5_1, 0) + $3 | 0; $3 = $1793($3, $4_1, $6_1 + 16 | 0) + $3 | 0; while (1) { if (!($3 >>> 0 >= $4_1 >>> 0)) { $3 = $1793($3, $4_1, $6_1 + 8 | 0) + $3 | 0; continue; } break; }; $4_1 = HEAP32[$6_1 + 20 >> 2]; $7_1 = $4_1; $3 = HEAP32[$6_1 + 16 >> 2]; if (!($4_1 | $3)) { break block5 } $4_1 = HEAP32[$6_1 + 8 >> 2]; $8_1 = HEAP32[$6_1 + 12 >> 2]; if ($4_1 | $8_1) { break block7 } } $96($5_1); $5_1 = 267; } $13_1 = 0; break block3; } HEAP32[$0_1 + 64 >> 2] = $3; HEAP32[$0_1 + 68 >> 2] = $7_1; $7_1 = __wasm_i64_sdiv($4_1, $8_1, $3, $7_1); $3 = HEAP32[$11_1 + 244 >> 2]; $8_1 = $3 >> 31; $4_1 = $8_1 + i64toi32_i32$HIGH_BITS | 0; $7_1 = $3 + $7_1 | 0; $4_1 = $3 >>> 0 > $7_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; HEAP32[$0_1 + 60 >> 2] = __wasm_i64_sdiv($7_1, $4_1, $3, $8_1); $5_1 = $96($5_1); $13_1 = HEAP32[$0_1 + 60 >> 2]; } $17_1 = $12_1 - 1 | 0; $8_1 = 1; $7_1 = 0; while (1) { if (($7_1 | 0) >= ($12_1 | 0)) { break block } $3 = 0; $4_1 = 0; if ($5_1) { break block } while (1) { if (!(($3 | 0) == ($16_1 | 0))) { $5_1 = Math_imul($3, 24) + $2_1 | 0; if (!(!HEAP32[$5_1 + 8 >> 2] | HEAP32[$5_1 + 12 >> 2] != ($1_1 | 0) | !!$4_1 & HEAP32[$5_1 + 16 >> 2] >= HEAP32[$4_1 + 16 >> 2])) { $4_1 = $5_1 } $3 = $3 + 1 | 0; continue; } break; }; block16 : { block12 : { if (!$7_1) { $8_1 = $8_1 << 2; break block12; } $3 = ($8_1 | 0) / 4 | 0; if (HEAP32[$4_1 + 16 >> 2] >= (Math_imul((($3 + $14 | 0) - 1 | 0) / ($3 | 0) | 0, $13_1) | 0)) { $10_1 = HEAP32[$4_1 + 20 >> 2]; $9_1 = HEAP32[$4_1 + 8 >> 2]; $3 = $31(16, 0); if ($3) { HEAP32[$3 + 4 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 >> 2] = $9_1; HEAP32[$3 + 12 >> 2] = 0; $15_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$3 + 4 >> 2] = $10_1; HEAP32[$3 + 8 >> 2] = $15_1; HEAP32[$0_1 + 28 >> 2] = $3; HEAP32[$9_1 + 16 >> 2] = $3; $5_1 = 0; } else { $5_1 = 7 } $1787(HEAP32[$9_1 + 20 >> 2]); HEAP32[$9_1 + 20 >> 2] = 0; break block16; } $8_1 = $7_1 >>> 0 < 12 ? $8_1 << 2 : $8_1; $5_1 = 0; if (($7_1 | 0) == ($17_1 | 0) | HEAP32[HEAP32[$4_1 >> 2] + 64 >> 2] < 2) { break block16 } } $3 = HEAP32[$4_1 + 8 >> 2]; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 28 >> 2] = 0; $5_1 = $1794($11_1, $3, HEAP32[$4_1 + 20 >> 2], $6_1 + 8 | 0, $6_1 + 28 | 0); if ($5_1) { break block16 } $5_1 = $1795($11_1, HEAP32[$4_1 >> 2], HEAP32[$4_1 + 4 >> 2], HEAP32[$6_1 + 28 >> 2], HEAP32[$6_1 + 8 >> 2]); if ($5_1) { break block16 } $5_1 = 0; $9_1 = 0; block17 : { $10_1 = HEAP32[$4_1 >> 2]; $3 = HEAP32[$10_1 >> 2]; if (!$3) { break block17 } $10_1 = HEAP32[$10_1 + 4 >> 2] + $3 | 0; while (1) { if ($3 >>> 0 >= $10_1 >>> 0) { break block17 } while (1) { $15_1 = HEAP8[$3 | 0]; $3 = $3 + 1 | 0; if (($15_1 | 0) < 0) { continue } break; }; HEAP32[$6_1 + 16 >> 2] = $3; $1703(0, $6_1 + 16 | 0); $9_1 = $9_1 + 1 | 0; $3 = HEAP32[$6_1 + 16 >> 2]; continue; }; } $14 = $7_1 ? (($9_1 | 0) < ($14 | 0) ? $9_1 : $14) : $9_1; } HEAP32[$4_1 + 8 >> 2] = 0; $7_1 = $7_1 + 1 | 0; continue; }; } $0_1 = $6_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1743($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block2 : { if (!(HEAP32[$2_1 >> 2] | !$1_1)) { if (HEAP32[$1_1 >> 2] == 5) { $5_1 = HEAP32[$1_1 + 20 >> 2]; $3 = HEAP32[$5_1 + 64 >> 2]; if (!$3) { break block2 } $6_1 = ($3 | 0) > 0 ? $3 : 0; $7_1 = $5_1 + 88 | 0; while (1) { block4 : { $8_1 = $1_1; if (($4_1 | 0) != ($6_1 | 0)) { if (HEAP32[Math_imul($4_1, 24) + $7_1 >> 2]) { break block4 } $1_1 = $4_1; } else { $1_1 = $6_1 } HEAP8[$8_1 + 34 | 0] = ($1_1 | 0) == ($3 | 0); break block2; } $4_1 = $4_1 + 1 | 0; continue; }; } $1743($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); $1743($0_1, HEAP32[$1_1 + 16 >> 2], $2_1); if (HEAPU8[HEAP32[$1_1 + 12 >> 2] + 34 | 0]) { $0_1 = HEAPU8[HEAP32[$1_1 + 16 >> 2] + 34 | 0] != 0 } else { $0_1 = 0 } HEAP8[$1_1 + 34 | 0] = $0_1; } return; } HEAP32[$2_1 >> 2] = $1796($0_1, 1, $5_1); } function $1744($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $4_1 = global$0 - 16 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block : { if (HEAP32[$0_1 + 12 >> 2]) { break block } $2_1 = $0_1 + 12 | 0; $1_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 + 220 >> 2]; block2 : { if ($3) { HEAP32[$2_1 >> 2] = $3; HEAP32[$1_1 + 220 >> 2] = 0; break block2; } HEAP32[$4_1 >> 2] = HEAP32[$1_1 + 224 >> 2]; $3 = $61(21851, $4_1); if (!$3) { $2_1 = 7; break block; } HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] + 1; $2_1 = $352(HEAP32[$1_1 + 12 >> 2], $3, 1, $2_1); HEAP32[$1_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2] - 1; $24($3); if ($2_1) { break block } } HEAP8[$0_1 + 8 | 0] = 1; $2_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1745($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block3 : { if (HEAPU16[$0_1 + 4 >> 1] <= 1) { $2_1 = HEAP32[$0_1 >> 2]; HEAP32[$2_1 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2] + 1; block2 : { if (($94(HEAP32[$0_1 + 12 >> 2]) | 0) != 100) { HEAP8[$0_1 + 6 | 0] = 1; $1_1 = $96(HEAP32[$0_1 + 12 >> 2]); break block2; } HEAP32[$0_1 + 32 >> 2] = $95(HEAP32[$0_1 + 12 >> 2], 0); HEAP32[$0_1 + 36 >> 2] = i64toi32_i32$HIGH_BITS; $1_1 = 0; } HEAP32[$2_1 + 56 >> 2] = HEAP32[$2_1 + 56 >> 2] - 1; break block3; } HEAP32[$4_1 + 12 >> 2] = 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; block7 : { if ($1_1) { while (1) { if (!HEAPU8[$0_1 + 7 | 0]) { $96(HEAP32[$0_1 + 12 >> 2]) } $5_1 = $4_1 + 12 | 0; $1746($0_1, $1_1, $5_1); $2_1 = HEAPU8[$1_1 + 32 | 0]; HEAP32[$0_1 + 88 >> 2] = 1; HEAP8[$0_1 + 7 | 0] = 1; HEAP8[$0_1 + 6 | 0] = $2_1; $3 = HEAP32[$1_1 + 28 >> 2]; HEAP32[$0_1 + 32 >> 2] = HEAP32[$1_1 + 24 >> 2]; HEAP32[$0_1 + 36 >> 2] = $3; if (!$2_1) { if ($1747($0_1, $5_1)) { continue } } break; }; $1_1 = HEAP32[$4_1 + 12 >> 2]; if ($1_1) { break block3 } break block7; } HEAP8[$0_1 + 6 | 0] = 1; } $1_1 = HEAP32[$0_1 + 32 >> 2]; $2_1 = HEAP32[$0_1 + 36 >> 2]; block10 : { block9 : { if (!HEAPU8[$0_1 + 52 | 0]) { $3 = HEAPU32[$0_1 + 80 >> 2] < $1_1 >>> 0; $1_1 = HEAP32[$0_1 + 84 >> 2]; if ($3 & ($1_1 | 0) <= ($2_1 | 0) | ($1_1 | 0) < ($2_1 | 0)) { break block9 } break block10; } $3 = HEAP32[$0_1 + 76 >> 2]; if (($3 | 0) <= ($2_1 | 0) & HEAPU32[$0_1 + 72 >> 2] <= $1_1 >>> 0 | ($2_1 | 0) > ($3 | 0)) { break block10 } } HEAP8[$0_1 + 6 | 0] = 1; } $1_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1746($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $10_1 = global$0 - 128 | 0; $4_1 = $10_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if (HEAP32[$2_1 >> 2] | HEAPU8[$1_1 + 32 | 0]) { break block } $12_1 = $1_1 + 32 | 0; $4_1 = HEAPU8[$0_1 + 52 | 0]; HEAP8[$1_1 + 33 | 0] = 1; block8 : { block10 : { block4 : { switch (HEAP32[$1_1 >> 2] - 1 | 0) { case 0: case 2: $8_1 = HEAP32[$1_1 + 16 >> 2]; $5_1 = HEAP32[$1_1 + 12 >> 2]; if (HEAPU8[$5_1 + 34 | 0]) { $1746($0_1, $8_1, $2_1); $0_1 = HEAP32[$8_1 + 28 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$8_1 + 24 >> 2]; HEAP32[$1_1 + 28 >> 2] = $0_1; HEAP8[$1_1 + 32 | 0] = HEAPU8[$8_1 + 32 | 0]; break block; } $3 = HEAPU8[$8_1 + 34 | 0]; $1746($0_1, $5_1, $2_1); if ($3) { $0_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$5_1 + 24 >> 2]; HEAP32[$1_1 + 28 >> 2] = $0_1; HEAP8[$1_1 + 32 | 0] = HEAPU8[$5_1 + 32 | 0]; break block; } $1746($0_1, $8_1, $2_1); $6_1 = $4_1; while (1) { if (HEAPU8[$5_1 + 32 | 0]) { $4_1 = HEAP32[$5_1 + 28 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$5_1 + 24 >> 2]; HEAP32[$1_1 + 28 >> 2] = $4_1; $4_1 = 1; break block8; } $9_1 = HEAPU8[$8_1 + 32 | 0]; if ($9_1) { $4_1 = HEAP32[$5_1 + 24 >> 2]; $7_1 = HEAP32[$5_1 + 28 >> 2]; break block10; } $4_1 = HEAP32[$5_1 + 24 >> 2]; $7_1 = HEAP32[$5_1 + 28 >> 2]; if (HEAP32[$2_1 >> 2]) { break block10 } $3 = HEAP32[$8_1 + 24 >> 2]; $11_1 = HEAP32[$8_1 + 28 >> 2]; $3 = ($3 >>> 0 < $4_1 >>> 0 & ($11_1 | 0) <= ($7_1 | 0) | ($7_1 | 0) > ($11_1 | 0)) - (($7_1 | 0) <= ($11_1 | 0) & $3 >>> 0 > $4_1 >>> 0 | ($7_1 | 0) < ($11_1 | 0)) | 0; $3 = $6_1 ? 0 - $3 | 0 : $3; if (!$3) { break block10 } $1746($0_1, ($3 | 0) < 0 ? $5_1 : $8_1, $2_1); continue; }; case 3: $11_1 = $4_1 ? -1 : 1; $7_1 = HEAP32[$1_1 + 12 >> 2]; $3 = HEAP32[$1_1 + 16 >> 2]; $4_1 = $7_1; block11 : { if (HEAPU8[$3 + 32 | 0]) { break block11 } $4_1 = HEAP32[$7_1 + 24 >> 2]; $6_1 = HEAP32[$3 + 24 >> 2]; $5_1 = HEAP32[$7_1 + 28 >> 2]; $8_1 = HEAP32[$3 + 28 >> 2]; $6_1 = Math_imul($11_1, ($4_1 >>> 0 > $6_1 >>> 0 & ($5_1 | 0) >= ($8_1 | 0) | ($5_1 | 0) > ($8_1 | 0)) - ($4_1 >>> 0 < $6_1 >>> 0 & ($5_1 | 0) <= ($8_1 | 0) | ($5_1 | 0) < ($8_1 | 0)) | 0); $5_1 = HEAPU8[$7_1 + 32 | 0]; if (!$5_1) { $4_1 = $7_1; if (($6_1 | 0) < 0) { break block11 } } $4_1 = $3; if ($5_1) { break block11 } $4_1 = $3; if (($6_1 | 0) > 0) { break block11 } $1746($0_1, $7_1, $2_1); $4_1 = $3; } $1746($0_1, $4_1, $2_1); if (HEAPU8[$7_1 + 32 | 0]) { $0_1 = HEAPU8[$3 + 32 | 0] != 0 } else { $0_1 = 0 } HEAP8[$12_1 | 0] = $0_1; $0_1 = HEAP32[$7_1 + 24 >> 2]; $4_1 = HEAP32[$7_1 + 28 >> 2]; block16 : { if (!HEAPU8[$3 + 32 | 0]) { $2_1 = HEAP32[$3 + 24 >> 2]; $3 = HEAP32[$3 + 28 >> 2]; if (HEAPU8[$7_1 + 32 | 0] | (Math_imul($11_1, ($2_1 >>> 0 < $0_1 >>> 0 & ($3 | 0) <= ($4_1 | 0) | ($3 | 0) < ($4_1 | 0)) - ($0_1 >>> 0 < $2_1 >>> 0 & ($3 | 0) >= ($4_1 | 0) | ($3 | 0) > ($4_1 | 0)) | 0) | 0) >= 0) { break block16 } } HEAP32[$1_1 + 24 >> 2] = $0_1; HEAP32[$1_1 + 28 >> 2] = $4_1; break block; } HEAP32[$1_1 + 24 >> 2] = $2_1; HEAP32[$1_1 + 28 >> 2] = $3; break block; case 1: $6_1 = HEAP32[$1_1 + 12 >> 2]; $5_1 = HEAP32[$1_1 + 16 >> 2]; if (!HEAPU8[$5_1 + 33 | 0]) { $1746($0_1, $5_1, $2_1) } $1746($0_1, $6_1, $2_1); $3 = HEAPU8[$6_1 + 32 | 0]; if (!$3) { $7_1 = $4_1; while (1) { block19 : { if (HEAP32[$2_1 >> 2] | HEAPU8[$5_1 + 32 | 0]) { break block19 } $4_1 = HEAP32[$6_1 + 24 >> 2]; $3 = HEAP32[$5_1 + 24 >> 2]; $8_1 = HEAP32[$6_1 + 28 >> 2]; $11_1 = HEAP32[$5_1 + 28 >> 2]; $4_1 = ($4_1 >>> 0 > $3 >>> 0 & ($8_1 | 0) >= ($11_1 | 0) | ($8_1 | 0) > ($11_1 | 0)) - (($8_1 | 0) <= ($11_1 | 0) & $3 >>> 0 > $4_1 >>> 0 | ($8_1 | 0) < ($11_1 | 0)) | 0; if ((($7_1 ? 0 - $4_1 | 0 : $4_1) | 0) <= 0) { break block19 } $1746($0_1, $5_1, $2_1); continue; } break; }; $3 = HEAPU8[$6_1 + 32 | 0]; } $0_1 = HEAP32[$6_1 + 24 >> 2]; $2_1 = HEAP32[$6_1 + 28 >> 2]; HEAP8[$1_1 + 32 | 0] = $3; HEAP32[$1_1 + 24 >> 2] = $0_1; HEAP32[$1_1 + 28 >> 2] = $2_1; break block; default: break block4; }; } $5_1 = HEAP32[$1_1 + 20 >> 2]; $1786($5_1); $11_1 = HEAP32[$0_1 >> 2]; block36 : { if (HEAP32[$5_1 + 40 >> 2]) { HEAP8[$10_1 + 127 | 0] = 0; block30 : { block22 : { if (HEAP32[$5_1 + 64 >> 2] == 1) { $8_1 = $1806($11_1, HEAP32[$5_1 + 92 >> 2], $5_1 + 16 | 0, $5_1 + 28 | 0, $5_1 + 32 | 0); $6_1 = !HEAP32[$5_1 + 28 >> 2]; break block22; } $14 = HEAPU8[$0_1 + 52 | 0]; wasm2js_memory_fill($10_1 + 16 | 0, 0, 96); $15_1 = $14 ? -1 : 1; while (1) { $0_1 = 0; $4_1 = 0; $7_1 = 0; $9_1 = 0; if ($6_1) { break block22 } while (1) { if (!(HEAPU8[$10_1 + 127 | 0] | (HEAP32[$5_1 + 64 >> 2] <= ($0_1 | 0) | $8_1))) { $6_1 = ($10_1 + 16 | 0) + Math_imul($0_1, 24) | 0; $8_1 = $1807($11_1, $5_1, $0_1, $6_1, $10_1 + 127 | 0); if (!HEAP32[$6_1 >> 2]) { $3 = HEAP32[$6_1 + 8 >> 2]; $6_1 = HEAP32[$6_1 + 12 >> 2]; block27 : { if (!$9_1) { $4_1 = $3; $7_1 = $6_1; break block27; } $9_1 = $3; $13_1 = $4_1; $4_1 = ($3 >>> 0 < $4_1 >>> 0 & ($6_1 | 0) <= ($7_1 | 0) | ($6_1 | 0) < ($7_1 | 0)) - ($3 >>> 0 > $4_1 >>> 0 & ($6_1 | 0) >= ($7_1 | 0) | ($6_1 | 0) > ($7_1 | 0)) | 0; $3 = (($14 ? 0 - $4_1 | 0 : $4_1) | 0) < 0; $4_1 = $3 ? $9_1 : $13_1; $7_1 = $3 ? $6_1 : $7_1; } $9_1 = 1; } $0_1 = $0_1 + 1 | 0; continue; } break; }; $0_1 = 0; while (1) { $3 = HEAP32[$5_1 + 64 >> 2]; if (!(($3 | 0) <= ($0_1 | 0))) { while (1) { block29 : { if (HEAPU8[$10_1 + 127 | 0] | $8_1) { break block29 } $3 = ($10_1 + 16 | 0) + Math_imul($0_1, 24) | 0; if (HEAP32[$3 >> 2]) { break block29 } $9_1 = HEAP32[$3 + 8 >> 2]; $6_1 = HEAP32[$3 + 12 >> 2]; if ((Math_imul($15_1, ($4_1 >>> 0 < $9_1 >>> 0 & ($7_1 | 0) <= ($6_1 | 0) | ($6_1 | 0) > ($7_1 | 0)) - (($6_1 | 0) <= ($7_1 | 0) & $4_1 >>> 0 > $9_1 >>> 0 | ($6_1 | 0) < ($7_1 | 0)) | 0) | 0) >= 0) { break block29 } $8_1 = $1807($11_1, $5_1, $0_1, $3, $10_1 + 127 | 0); $6_1 = HEAP32[$3 + 8 >> 2]; $9_1 = $6_1; $3 = HEAP32[$3 + 12 >> 2]; $6_1 = (Math_imul($15_1, ($4_1 >>> 0 < $6_1 >>> 0 & ($7_1 | 0) <= ($3 | 0) | ($3 | 0) > ($7_1 | 0)) - (($3 | 0) <= ($7_1 | 0) & $4_1 >>> 0 > $6_1 >>> 0 | ($3 | 0) < ($7_1 | 0)) | 0) | 0) > 0; $4_1 = $6_1 ? $9_1 : $4_1; $7_1 = $6_1 ? $3 : $7_1; $0_1 = $6_1 ? 0 : $0_1; continue; } break; }; $0_1 = $0_1 + 1 | 0; continue; } break; }; $6_1 = HEAPU8[$10_1 + 127 | 0]; if ($6_1) { continue } $0_1 = HEAP32[($10_1 + Math_imul($3, 24) | 0) + 12 >> 2]; $3 = $0_1 >> 31; $9_1 = $0_1 + 8 | 0; $3 = $9_1 >>> 0 < 8 ? $3 + 1 | 0 : $3; $3 = $31($9_1, $3); if (!$3) { break block30 } $9_1 = $0_1 + 1 | 0; if ($9_1) { wasm2js_memory_copy($3, HEAP32[($10_1 + Math_imul(HEAP32[$5_1 + 64 >> 2], 24) | 0) + 8 >> 2], $9_1) } $0_1 = $0_1 + $3 | 0; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $0_1 = 0; $13_1 = 0; block32 : { while (1) { $16_1 = HEAP32[$5_1 + 64 >> 2]; $9_1 = $16_1 - 1 | 0; if (($9_1 | 0) <= ($0_1 | 0)) { break block32 } block34 : { $9_1 = ($10_1 + 16 | 0) + Math_imul($0_1, 24) | 0; if (!HEAP32[$9_1 >> 2]) { HEAP32[$10_1 + 12 >> 2] = HEAP32[$9_1 + 16 >> 2]; HEAP32[$10_1 + 8 >> 2] = $3; HEAP32[$10_1 + 4 >> 2] = $3; if (!$1800($10_1 + 4 | 0, $16_1 + ($0_1 ^ -1) | 0, 0, 1, $10_1 + 12 | 0, $10_1 + 8 | 0)) { break block34 } $13_1 = HEAP32[$10_1 + 4 >> 2] - $3 | 0; } $0_1 = $0_1 + 1 | 0; continue; } break; }; $9_1 = HEAP32[$5_1 + 64 >> 2] - 1 | 0; } if (($0_1 | 0) != ($9_1 | 0)) { $24($3); continue; } break; }; HEAP32[$5_1 + 32 >> 2] = $13_1; HEAP32[$5_1 + 28 >> 2] = $3; HEAP32[$5_1 + 16 >> 2] = $4_1; HEAP32[$5_1 + 20 >> 2] = $7_1; HEAP32[$5_1 + 24 >> 2] = 1; $6_1 = 0; } HEAP8[$12_1 | 0] = $6_1; break block36; } $8_1 = 7; break block36; } block38 : { block37 : { $4_1 = HEAPU8[$0_1 + 52 | 0]; $0_1 = HEAPU8[$11_1 + 239 | 0]; if (($4_1 | 0) == ($0_1 | 0)) { break block37 } $4_1 = HEAP32[$5_1 + 4 >> 2]; if (!$4_1) { break block37 } $1702($0_1, HEAP32[$5_1 >> 2], $4_1, $5_1 + 8 | 0, $5_1 + 16 | 0, $5_1 + 32 | 0, $12_1); HEAP32[$5_1 + 28 >> 2] = HEAP32[$5_1 + 8 >> 2]; break block38; } $1808($11_1, $5_1, $12_1); } } HEAP32[$2_1 >> 2] = $8_1; $0_1 = HEAP32[$5_1 + 20 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$5_1 + 16 >> 2]; HEAP32[$1_1 + 28 >> 2] = $0_1; break block; } HEAP32[$1_1 + 24 >> 2] = $4_1; HEAP32[$1_1 + 28 >> 2] = $7_1; $4_1 = ($9_1 | 0) != 0; } HEAP8[$1_1 + 32 | 0] = $4_1; if (!$4_1 | HEAP32[$1_1 >> 2] != 1) { break block } block39 : { $1_1 = HEAP32[$8_1 + 20 >> 2]; if (!HEAP32[$1_1 >> 2]) { break block39 } while (1) { if (HEAP32[$2_1 >> 2] | HEAPU8[$8_1 + 32 | 0]) { break block39 } $4_1 = HEAP32[$1_1 + 32 >> 2]; if ($4_1) { wasm2js_memory_fill(HEAP32[$1_1 + 28 >> 2], 0, $4_1) } $1746($0_1, $8_1, $2_1); continue; }; } block41 : { $1_1 = HEAP32[$5_1 + 20 >> 2]; if (!$1_1 | !HEAP32[$1_1 >> 2]) { break block41 } while (1) { if (HEAP32[$2_1 >> 2] | HEAPU8[$5_1 + 32 | 0]) { break block41 } $4_1 = HEAP32[$1_1 + 32 >> 2]; if ($4_1) { wasm2js_memory_fill(HEAP32[$1_1 + 28 >> 2], 0, $4_1) } $1746($0_1, $5_1, $2_1); continue; }; } HEAP8[$5_1 + 32 | 0] = 1; HEAP8[$8_1 + 32 | 0] = 1; } $0_1 = $10_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1747($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $2_1 = global$0 - 32 | 0; $3 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $3; $3 = HEAP32[$1_1 >> 2]; HEAP32[$2_1 >> 2] = $3; if (!$3) { $9_1 = $0_1 + 28 | 0; block1 : { if (!HEAP32[$0_1 + 28 >> 2]) { break block1 } $3 = $1750(0, $0_1); HEAP32[$2_1 >> 2] = $3; if ($3) { break block1 } block2 : { if (!HEAP32[$9_1 >> 2]) { break block2 } $11_1 = HEAP32[$0_1 >> 2]; $16_1 = HEAP32[$11_1 + 36 >> 2]; $17_1 = HEAP32[$16_1 >> 2]; $3 = 0; $18_1 = $95(HEAP32[$0_1 + 12 >> 2], 0); $19_1 = i64toi32_i32$HIGH_BITS; while (1) { $7_1 = HEAP32[$11_1 + 24 >> 2]; $8_1 = $7_1 >> 31; $4_1 = !$5_1; block3 : { while (1) { if (!($4_1 & 1) | (($3 | 0) >= ($8_1 | 0) & $6_1 >>> 0 >= $7_1 >>> 0 | ($3 | 0) > ($8_1 | 0))) { break block3 } if (HEAPU8[HEAP32[$11_1 + 32 >> 2] + $6_1 | 0]) { $6_1 = $6_1 + 1 | 0; $3 = $6_1 ? $3 : $3 + 1 | 0; $4_1 = 1; continue; } break; }; $4_1 = HEAP32[$0_1 + 12 >> 2]; $8_1 = $6_1 + 1 | 0; $7_1 = $8_1 ? $3 : $3 + 1 | 0; $4_1 = $124($4_1, $8_1); $5_1 = $1789($16_1, HEAP32[$0_1 + 20 >> 2], $4_1, -1, $2_1 + 24 | 0); $13_1 = HEAP32[$2_1 + 24 >> 2]; label1 : while (1) { if (!$5_1) { HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $5_1 = FUNCTION_TABLE[HEAP32[$17_1 + 20 >> 2]]($13_1, $2_1 + 20 | 0, $2_1 + 16 | 0, $2_1 + 12 | 0, $2_1 + 8 | 0, $2_1 + 4 | 0) | 0; HEAP32[$2_1 + 28 >> 2] = $5_1; $4_1 = $9_1; while (1) { $10_1 = HEAP32[$4_1 >> 2]; if ($5_1 | !$10_1) { continue label1 } $12_1 = HEAP32[$10_1 >> 2]; $5_1 = 0; $4_1 = HEAP32[$10_1 + 4 >> 2]; block7 : { if (!(!$3 & ($4_1 | 0) == ($6_1 | 0))) { if (($4_1 | 0) < HEAP32[$11_1 + 24 >> 2]) { break block7 } } $14 = HEAP32[$2_1 + 4 >> 2]; if (!($14 ? !HEAP32[$12_1 + 12 >> 2] : 1)) { break block7 } $15_1 = HEAP32[$12_1 + 4 >> 2]; $4_1 = HEAP32[$2_1 + 16 >> 2]; if (($15_1 | 0) != ($4_1 | 0) & (!HEAP32[$12_1 + 8 >> 2] | ($4_1 | 0) <= ($15_1 | 0))) { break block7 } if ($2014(HEAP32[$2_1 + 20 >> 2], HEAP32[$12_1 >> 2], $15_1)) { break block7 } $1809($10_1 + 12 | 0, $18_1, $19_1, $6_1, $3, $14, $14 >> 31, $2_1 + 28 | 0); $5_1 = HEAP32[$2_1 + 28 >> 2]; } $4_1 = $10_1 + 8 | 0; continue; }; } break; }; if ($13_1) { FUNCTION_TABLE[HEAP32[$17_1 + 16 >> 2]]($13_1) | 0 } if (($5_1 | 0) == 101) { HEAP32[$2_1 + 28 >> 2] = 0; $5_1 = 0; } $6_1 = $8_1; $3 = $7_1; continue; } break; }; $4_1 = $9_1; while (1) { $3 = HEAP32[$4_1 >> 2]; if ($5_1 | !$3) { break block2 } if (HEAP32[$3 + 12 >> 2]) { $7_1 = $1810($3 + 12 | 0, 0, 0) } else { $7_1 = 0 } $5_1 = $7_1; $4_1 = $3 + 8 | 0; continue; }; } HEAP32[$2_1 >> 2] = $5_1; } $3 = $1811($0_1, HEAP32[$0_1 + 16 >> 2], $2_1); while (1) { $0_1 = HEAP32[$9_1 >> 2]; if ($0_1) { $24(HEAP32[$0_1 + 12 >> 2]); HEAP32[$0_1 + 12 >> 2] = 0; $9_1 = $0_1 + 8 | 0; continue; } break; }; $0_1 = HEAP32[$2_1 >> 2]; HEAP32[$1_1 >> 2] = $0_1; $4_1 = !($0_1 | $3); } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1748($0_1) { $0_1 = $0_1 | 0; if (!HEAPU8[$0_1 + 6 | 0]) { return 0 } $1733($0_1); HEAP8[$0_1 + 6 | 0] = 1; return 1; } function $1749($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; block3 : { block2 : { block1 : { block : { $4_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$4_1 + 24 >> 2]; switch ($2_1 - $3 | 0) { case 0: break block; case 1: break block1; case 2: break block2; default: break block3; }; } $1_1 = HEAP32[$1_1 >> 2]; $204($1_1); HEAP16[$1_1 + 16 >> 1] = 1; $244($1_1, $0_1, 9085, 0); return 0; } $240($1_1, HEAP32[$0_1 + 32 >> 2], HEAP32[$0_1 + 36 >> 2]); return 0; } if (HEAP32[$0_1 + 16 >> 2]) { $0_1 = HEAP32[$0_1 + 20 >> 2]; $240($1_1, $0_1, $0_1 >> 31); return 0; } $2_1 = $3; if (HEAP32[$4_1 + 44 >> 2]) { break block3 } $238($1_1, 0); return 0; } $3 = $1750(0, $0_1); block5 : { if ($3) { break block5 } $3 = 0; $0_1 = HEAP32[$0_1 + 12 >> 2]; if (!$0_1 | !HEAP32[$0_1 + 120 >> 2]) { $4_1 = -1 } else { $4_1 = HEAPU16[$0_1 + 144 >> 1] - 1 | 0 } if (($4_1 | 0) <= ($2_1 | 0)) { break block5 } $250($1_1, $276($0_1, $2_1 + 1 | 0)); } return $3 | 0; } function $1750($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; if (!HEAPU8[$1_1 + 7 | 0]) { return 0 } $2_1 = $1744($1_1); block2 : { block1 : { if ($2_1) { break block1 } $3 = HEAP32[$1_1 >> 2]; HEAP32[$3 + 56 >> 2] = HEAP32[$3 + 56 >> 2] + 1; $283(HEAP32[$1_1 + 12 >> 2], 1, HEAP32[$1_1 + 32 >> 2], HEAP32[$1_1 + 36 >> 2]); HEAP8[$1_1 + 7 | 0] = 0; $2_1 = $94(HEAP32[$1_1 + 12 >> 2]); HEAP32[$3 + 56 >> 2] = HEAP32[$3 + 56 >> 2] - 1; if (($2_1 | 0) == 100) { break block2 } $2_1 = $96(HEAP32[$1_1 + 12 >> 2]); if ($2_1) { break block1 } if (HEAP32[HEAP32[$1_1 >> 2] + 40 >> 2]) { break block2 } HEAP8[$1_1 + 6 | 0] = 1; $2_1 = 267; } if ($0_1) { $255($0_1, $2_1) } $4_1 = $2_1; } return $4_1; } function $1751($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 32 >> 2]; HEAP32[$1_1 + 4 >> 2] = $2_1; return 0; } function $1752($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $5_1 = global$0 - 32 | 0; $4_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $4_1; HEAP32[$5_1 + 16 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 0; block20 : { block14 : { block3 : { block12 : { block9 : { block7 : { block13 : { block : { if (($1_1 | 0) < 2) { break block } $7_1 = HEAP32[$0_1 + 24 >> 2]; $4_1 = HEAPU16[HEAP32[$2_1 >> 2] + 16 >> 1]; $6_1 = $4_1 & 31; block1 : { if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $6_1; $8_1 = 0; } else { $8_1 = 1 << $6_1; $4_1 = $8_1 - 1 & 1 >>> 32 - $6_1; } if (!($8_1 & -1431655766 | $4_1 & -1431655766)) { break block1 } $6_1 = HEAP32[(($7_1 << 2) + $2_1 | 0) + 8 >> 2]; $8_1 = HEAPU16[$6_1 + 16 >> 1]; $4_1 = $8_1 & 31; if (($8_1 & 63) >>> 0 >= 32) { $8_1 = 1 << $4_1; $9_1 = 0; } else { $9_1 = 1 << $4_1; $8_1 = $9_1 - 1 & 1 >>> 32 - $4_1; } if ($9_1 & -1431655766 | $8_1 & -1431655766) { break block1 } $1_1 = $53($6_1); $2_1 = $209($6_1); if (!$1_1) { $6_1 = 7; break block3; } block6 : { switch ($2_1 - 7 | 0) { case 1: if ($68($1_1, 12951, 8)) { break block7 } $6_1 = $1753($0_1, 0); break block3; case 0: if ($68($1_1, 15097, 7)) { break block7 } $6_1 = $1754($0_1, 0); if ($6_1) { break block3 } HEAP32[$5_1 + 24 >> 2] = 0; HEAP32[$5_1 >> 2] = HEAP32[$0_1 + 224 >> 2]; $1_1 = $61(7325, $5_1); if (!$1_1) { $4_1 = 7; HEAP32[$5_1 + 28 >> 2] = 7; $6_1 = 0; break block9; } $6_1 = 0; $4_1 = $93(HEAP32[$0_1 + 12 >> 2], $1_1, -1, $5_1 + 24 | 0, 0); HEAP32[$5_1 + 28 >> 2] = $4_1; $24($1_1); if ($4_1) { break block9 } $1_1 = HEAP32[$0_1 + 24 >> 2]; $1_1 = __wasm_i64_mul($1_1, $1_1 >> 31, 12, 0); $4_1 = i64toi32_i32$HIGH_BITS; $1_1 = $1_1 + 12 | 0; $4_1 = $1_1 >>> 0 < 12 ? $4_1 + 1 | 0 : $4_1; $3 = $31($1_1, $4_1); if (!$3) { $4_1 = 7; HEAP32[$5_1 + 28 >> 2] = 7; break block9; } $4_1 = 0; if ($1_1) { wasm2js_memory_fill($3, 0, $1_1) } $1_1 = (HEAP32[$0_1 + 24 >> 2] << 2) + 4 | 0; $7_1 = $1_1 + $3 | 0; $6_1 = $7_1 + $1_1 | 0; break block12; default: break block6; }; } if (($2_1 | 0) == 15) { break block13 } if (($2_1 | 0) >= 7) { break block7 } $6_1 = 1; if (($2_1 | 0) != 5) { break block3 } if ($68($1_1, 12365, 5)) { break block3 } $6_1 = $1755($0_1); break block3; } if (!($50(HEAP32[(($7_1 << 2) + $2_1 | 0) + 16 >> 2]) & -2147483648)) { break block } HEAP32[$5_1 + 16 >> 2] = 19; break block14; } $6_1 = HEAP32[$0_1 + 24 >> 2]; $4_1 = $6_1 >> 31 << 3 | $6_1 >>> 29; $6_1 = ($6_1 << 3) + 8 | 0; $4_1 = $6_1 >>> 0 < 8 ? $4_1 + 1 | 0 : $4_1; $6_1 = $31($6_1, $4_1); if (!$6_1) { HEAP32[$5_1 + 16 >> 2] = 7; break block14; } $11_1 = HEAP32[$0_1 + 24 >> 2] + 1 | 0; $4_1 = $11_1 << 3; if ($4_1) { wasm2js_memory_fill($6_1, 0, $4_1) } block18 : { if (HEAP32[$0_1 + 272 >> 2]) { HEAP32[$5_1 + 16 >> 2] = 0; break block18; } $4_1 = $1675($0_1, 16, $5_1 + 28 | 0, 0); if ($4_1) { HEAP32[$5_1 + 16 >> 2] = $4_1; break block20; } $4_1 = HEAP32[$5_1 + 28 >> 2]; $280($4_1, 0); $94($4_1); $4_1 = $96($4_1); HEAP32[$5_1 + 16 >> 2] = $4_1; if ($4_1) { break block20 } } $8_1 = 1; $7_1 = 1; block21 : { if (($1_1 | 0) < 2) { break block21 } $7_1 = 1; if (HEAP32[$0_1 + 40 >> 2]) { break block21 } $9_1 = HEAP32[((HEAP32[$0_1 + 24 >> 2] << 2) + $2_1 | 0) + 12 >> 2]; $4_1 = HEAPU16[$9_1 + 16 >> 1]; $7_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $7_1; $10_1 = 0; } else { $10_1 = 1 << $7_1; $4_1 = $10_1 - 1 & 1 >>> 32 - $7_1; } if ($10_1 & -1431655766 | $4_1 & -1431655766) { $9_1 = HEAP32[$2_1 + 4 >> 2]; $4_1 = HEAPU16[$9_1 + 16 >> 1]; $7_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $7_1; $10_1 = 0; } else { $10_1 = 1 << $7_1; $4_1 = $10_1 - 1 & 1 >>> 32 - $7_1; } } $7_1 = 1; if ($10_1 & -1431655766 | $4_1 & -1431655766) { break block21 } $10_1 = HEAP32[$2_1 >> 2]; $4_1 = HEAPU16[$10_1 + 16 >> 1]; $7_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $7_1; $12_1 = 0; } else { $12_1 = 1 << $7_1; $4_1 = $12_1 - 1 & 1 >>> 32 - $7_1; } if (!($12_1 & -1431655766 | $4_1 & -1431655766)) { $4_1 = $50($10_1); $10_1 = i64toi32_i32$HIGH_BITS; $7_1 = 1; if (($50($9_1) | 0) == ($4_1 | 0) & (i64toi32_i32$HIGH_BITS | 0) == ($10_1 | 0)) { break block21 } } $4_1 = HEAPU8[HEAP32[$0_1 + 12 >> 2] + 92 | 0]; block25 : { if (($4_1 | 0) == 5) { $7_1 = $1756($0_1, $9_1, $5_1 + 12 | 0, $6_1); break block25; } $7_1 = $1757($0_1, $2_1, $3); } HEAP32[$5_1 + 16 >> 2] = $7_1; if ($7_1) { break block20 } $7_1 = ($4_1 | 0) == 5; } $10_1 = $11_1 << 2; $11_1 = HEAP32[$2_1 >> 2]; $4_1 = HEAPU16[$11_1 + 16 >> 1]; $9_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $9_1; $12_1 = 0; } else { $12_1 = 1 << $9_1; $4_1 = $12_1 - 1 & 1 >>> 32 - $9_1; } if (!($12_1 & -1431655766 | $4_1 & -1431655766)) { $4_1 = $1756($0_1, $11_1, $5_1 + 12 | 0, $6_1); HEAP32[$5_1 + 16 >> 2] = $4_1; $8_1 = !$4_1; } $9_1 = $6_1 + $10_1 | 0; if (!(!$8_1 | ($1_1 | 0) < 2)) { $1_1 = $50(HEAP32[((HEAP32[$0_1 + 24 >> 2] << 2) + $2_1 | 0) + 16 >> 2]); block29 : { block30 : { block28 : { if (!$7_1) { break block28 } $4_1 = $1757($0_1, $2_1, $3); HEAP32[$5_1 + 16 >> 2] = $4_1; if (!$4_1) { break block28 } if (HEAP32[$0_1 + 40 >> 2] | ($4_1 | 0) != 19) { break block29 } $3 = 267; break block30; } $4_1 = $1_1; $1_1 = $1758($0_1, 0, $1_1, HEAP32[$3 >> 2], HEAP32[$3 + 4 >> 2]); HEAP32[$5_1 + 16 >> 2] = $1_1; if ($1_1) { break block29 } $1_1 = 2; while (1) { if (($1_1 | 0) >= (HEAP32[$0_1 + 24 >> 2] + 2 | 0)) { $3 = 0; break block30; } $3 = $1_1 - 2 | 0; if (!HEAPU8[$3 + HEAP32[$0_1 + 32 >> 2] | 0]) { $7_1 = ($1_1 << 2) + $2_1 | 0; $3 = $1759($0_1, $4_1, $53(HEAP32[$7_1 >> 2]), $3, $9_1 + ($3 << 2) | 0); if ($3) { break block30 } $3 = $209(HEAP32[$7_1 >> 2]); $7_1 = $9_1 + (HEAP32[$0_1 + 24 >> 2] << 2) | 0; HEAP32[$7_1 >> 2] = $3 + HEAP32[$7_1 >> 2]; } $1_1 = $1_1 + 1 | 0; continue; }; } HEAP32[$5_1 + 16 >> 2] = $3; } if (HEAPU8[$0_1 + 238 | 0]) { $1760($5_1 + 16 | 0, $0_1, $9_1) } HEAP32[$5_1 + 12 >> 2] = HEAP32[$5_1 + 12 >> 2] + 1; } if (!HEAPU8[$0_1 + 236 | 0]) { break block20 } $1761($5_1 + 16 | 0, $0_1, $9_1, $6_1, HEAP32[$5_1 + 12 >> 2]); break block20; } if ($68($1_1, 12136, 15)) { break block7 } HEAP32[$5_1 + 28 >> 2] = 0; $1_1 = $1762($0_1, $5_1 + 28 | 0); $6_1 = $1_1 | HEAP32[$5_1 + 28 >> 2] ? $1_1 : 267; break block3; } if (!$68($1_1, 22026, 6)) { HEAP32[$5_1 + 24 >> 2] = $1_1 + 6; $8_1 = $5_1 + 24 | 0; $4_1 = $1763($8_1); $1_1 = 8; $3 = HEAP32[$5_1 + 24 >> 2]; $2_1 = HEAPU8[$3 | 0]; if (($2_1 | 0) == 44) { $6_1 = 1; if (!HEAPU8[$3 + 1 | 0]) { break block3 } HEAP32[$5_1 + 24 >> 2] = $3 + 1; $1_1 = $1763($8_1); $2_1 = HEAPU8[HEAP32[$5_1 + 24 >> 2]]; } $6_1 = 1; if ($2_1 & 255 | ($1_1 | 0) < 2) { break block3 } HEAP32[$5_1 + 28 >> 2] = 0; block37 : { if (!HEAPU8[$0_1 + 237 | 0]) { $1764($5_1 + 28 | 0, $0_1); $6_1 = HEAP32[$5_1 + 28 >> 2]; if ($6_1) { break block37 } } $6_1 = $1765($0_1, $4_1, $1_1); } $1660($0_1); break block3; } $6_1 = 1; if ($2_1 >>> 0 < 11) { break block3 } if ($68($1_1, 22022, 10)) { break block3 } HEAP32[$5_1 + 28 >> 2] = $1_1 + 10; HEAP32[$5_1 + 24 >> 2] = 0; HEAP32[$5_1 + 20 >> 2] = 0; $1_1 = $1763($5_1 + 28 | 0); HEAP32[$0_1 + 48 >> 2] = ($1_1 | 0) == 1 ? 8 : ($1_1 | 0) > 16 ? 8 : $1_1; if (!HEAPU8[$0_1 + 237 | 0]) { $1764($5_1 + 24 | 0, $0_1); $6_1 = HEAP32[$5_1 + 24 >> 2]; if ($6_1) { break block3 } } $6_1 = $1675($0_1, 23, $5_1 + 20 | 0, 0); if ($6_1) { break block3 } $1_1 = HEAP32[$5_1 + 20 >> 2]; $283($1_1, 1, 2, 0); $282($1_1, 2, HEAP32[$0_1 + 48 >> 2]); $94($1_1); $6_1 = $96($1_1); break block3; } $7_1 = 0; $3 = 0; } $9_1 = 0; $8_1 = HEAP32[$5_1 + 24 >> 2]; while (1) { block39 : { if ($4_1) { break block39 } if (($94($8_1) | 0) != 100) { break block39 } $2_1 = 0; $10_1 = $1766($0_1, $8_1); $4_1 = $1758($0_1, 0, $10_1, $95($8_1, 0), i64toi32_i32$HIGH_BITS); $1_1 = (HEAP32[$0_1 + 24 >> 2] << 2) + 4 | 0; if ($1_1) { wasm2js_memory_fill($3, 0, $1_1) } while (1) { block41 : { if ($4_1) { break block41 } $1_1 = $2_1; if (($1_1 | 0) >= HEAP32[$0_1 + 24 >> 2]) { break block41 } $2_1 = $1_1 + 1 | 0; $4_1 = 0; if (HEAPU8[$1_1 + HEAP32[$0_1 + 32 >> 2] | 0]) { continue } $4_1 = $1759($0_1, $10_1, $124($8_1, $2_1), $1_1, ($1_1 << 2) + $3 | 0); $1_1 = $274($8_1, $2_1); $11_1 = (HEAP32[$0_1 + 24 >> 2] << 2) + $3 | 0; HEAP32[$11_1 >> 2] = $1_1 + HEAP32[$11_1 >> 2]; continue; } break; }; HEAP32[$5_1 + 28 >> 2] = $4_1; $1_1 = 0; if (HEAPU8[$0_1 + 238 | 0]) { $1760($5_1 + 28 | 0, $0_1, $3); $4_1 = HEAP32[$5_1 + 28 >> 2]; } if ($4_1) { $100($8_1); $8_1 = 0; $4_1 = 1; continue; } else { while (1) { if (!(HEAP32[$0_1 + 24 >> 2] < ($1_1 | 0))) { $2_1 = $1_1 << 2; $10_1 = $2_1 + $7_1 | 0; HEAP32[$10_1 >> 2] = HEAP32[$10_1 >> 2] + HEAP32[$2_1 + $3 >> 2]; $1_1 = $1_1 + 1 | 0; continue; } break; }; $9_1 = $9_1 + 1 | 0; continue; } } break; }; if (HEAPU8[$0_1 + 236 | 0]) { $1761($5_1 + 28 | 0, $0_1, $7_1, $6_1, $9_1) } $24($3); if (!$8_1) { $6_1 = HEAP32[$5_1 + 28 >> 2]; break block3; } $1_1 = $100($8_1); $2_1 = HEAP32[$5_1 + 28 >> 2]; $6_1 = $2_1 ? $2_1 : $1_1; } HEAP32[$5_1 + 16 >> 2] = $6_1; } $6_1 = 0; } $24($6_1); $1660($0_1); $1_1 = HEAP32[$5_1 + 16 >> 2]; $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1753($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $3 = global$0 - 16 | 0; $6_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $6_1; $6_1 = 0; HEAP32[$3 + 12 >> 2] = 0; $2_1 = $1755($0_1); block : { if ($2_1) { break block } $2_1 = $1675($0_1, 27, $3 + 12 | 0, 0); if ($2_1) { break block } $4_1 = HEAP32[$3 + 12 >> 2]; $282($4_1, 1, HEAP32[$0_1 + 288 >> 2]); $282($4_1, 2, HEAP32[$0_1 + 260 >> 2]); label : while (1) { if (($94($4_1) | 0) == 100) { $2_1 = 0; $7_1 = $98($4_1, 0); while (1) { if (HEAP32[$0_1 + 260 >> 2] <= ($2_1 | 0) | $5_1) { continue label } $5_1 = $1815($0_1, $7_1, $2_1, -2); $2_1 = $2_1 + 1 | 0; if (($5_1 | 0) != 101) { continue } $5_1 = 0; $6_1 = 1; continue; }; } break; }; $2_1 = (wasm2js_i32$0 = $5_1, wasm2js_i32$1 = $96($4_1), wasm2js_i32$2 = $5_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); } $1660($0_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 ? ($2_1 ? $2_1 : $6_1 ? 101 : $2_1) : $2_1; } function $1754($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 + 12 >> 2] = 0; $1772($0_1); if ($1_1) { $1813($2_1 + 12 | 0, $0_1, 2, 0) } $1_1 = $2_1 + 12 | 0; $1813($1_1, $0_1, 3, 0); $1813($1_1, $0_1, 4, 0); if (HEAPU8[$0_1 + 238 | 0]) { $1813($1_1, $0_1, 5, 0) } if (HEAPU8[$0_1 + 237 | 0]) { $1813($2_1 + 12 | 0, $0_1, 6, 0) } $1_1 = HEAP32[$2_1 + 12 >> 2]; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1755($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block6 : { block2 : { block : { while (1) { if ($1_1) { break block } if (($2_1 | 0) < HEAP32[$0_1 + 260 >> 2]) { $1_1 = $1815($0_1, HEAP32[$0_1 + 288 >> 2], $2_1, -1); $1_1 = ($1_1 | 0) != 101 ? $1_1 : 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; if (!HEAP32[$0_1 + 52 >> 2] | (!HEAPU8[$0_1 + 237 | 0] | HEAP32[$0_1 + 48 >> 2] != 255)) { break block2 } $2_1 = 0; HEAP32[$3 + 12 >> 2] = 0; $1_1 = $1675($0_1, 22, $3 + 12 | 0, 0); if ($1_1) { break block } $1_1 = HEAP32[$3 + 12 >> 2]; $283($1_1, 1, 2, 0); block5 : { switch ($94($1_1) - 100 | 0) { case 0: $2_1 = $98($1_1, 0); $2_1 = ($2_1 | 0) == 1 ? 8 : $2_1; case 1: HEAP32[$0_1 + 48 >> 2] = $2_1; break; default: break block5; }; } $1_1 = $96($1_1); } if ($1_1) { break block6 } } $1772($0_1); $1_1 = 0; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1756($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; HEAP32[$4_1 + 4 >> 2] = $1_1; HEAP32[$4_1 + 12 >> 2] = $1_1; $5_1 = $1675($0_1, 7, $4_1 + 8 | 0, $4_1 + 12 | 0); $6_1 = HEAP32[$4_1 + 8 >> 2]; block3 : { block1 : { block : { if ($5_1) { break block } $9_1 = ($94($6_1) | 0) != 100; if ($9_1) { break block1 } $10_1 = $1766($0_1, $6_1); $5_1 = $1758($0_1, 1, $10_1, $95($6_1, 0), i64toi32_i32$HIGH_BITS); $7_1 = 1; while (1) { if ($5_1) { break block } if (HEAP32[$0_1 + 24 >> 2] < ($7_1 | 0)) { break block1 } $5_1 = 0; $8_1 = $7_1 - 1 | 0; if (!HEAPU8[$8_1 + HEAP32[$0_1 + 32 >> 2] | 0]) { $5_1 = $1759($0_1, $10_1, $124($6_1, $7_1), -1, ($8_1 << 2) + $3 | 0); $8_1 = $274($6_1, $7_1); $11_1 = (HEAP32[$0_1 + 24 >> 2] << 2) + $3 | 0; HEAP32[$11_1 >> 2] = $8_1 + HEAP32[$11_1 >> 2]; } $7_1 = $7_1 + 1 | 0; continue; }; } $96($6_1); HEAP32[$4_1 >> 2] = $5_1; break block3; } $5_1 = $96($6_1); HEAP32[$4_1 >> 2] = $5_1; if ($5_1 | $9_1) { break block3 } HEAP32[$4_1 + 12 >> 2] = $1_1; block5 : { if (HEAP32[$0_1 + 40 >> 2]) { HEAP32[$4_1 >> 2] = 0; HEAP32[$2_1 >> 2] = HEAP32[$2_1 >> 2] - 1; break block5; } $5_1 = 1; $1_1 = $1675($0_1, 1, $4_1 + 8 | 0, $4_1 + 12 | 0); if ($1_1) { HEAP32[$4_1 >> 2] = $1_1; break block3; } $1_1 = HEAP32[$4_1 + 8 >> 2]; if (($94($1_1) | 0) == 100) { $5_1 = !$98($1_1, 0) } $1_1 = $96($1_1); HEAP32[$4_1 >> 2] = $1_1; if ($1_1) { break block3 } if (!$5_1) { HEAP32[$4_1 >> 2] = $1754($0_1, 1); HEAP32[$2_1 >> 2] = 0; $0_1 = (HEAP32[$0_1 + 24 >> 2] << 3) + 8 | 0; if (!$0_1) { break block3 } wasm2js_memory_fill($3, 0, $0_1); break block3; } $1_1 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$2_1 >> 2] - 1; if ($1_1) { break block5 } $1813($4_1, $0_1, 0, $4_1 + 4 | 0); } if (!HEAPU8[$0_1 + 238 | 0]) { break block3 } $1813($4_1, $0_1, 19, $4_1 + 4 | 0); } $1_1 = HEAP32[$4_1 >> 2]; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1757($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $6_1 = global$0 - 16 | 0; $3 = $6_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block3 : { block4 : { if (HEAP32[$0_1 + 40 >> 2]) { $0_1 = HEAP32[((HEAP32[$0_1 + 24 >> 2] << 2) + $1_1 | 0) + 12 >> 2]; $4_1 = HEAPU16[$0_1 + 16 >> 1]; $3 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $3; $3 = 0; } else { $5_1 = 1 << $3; $4_1 = $5_1 - 1 & 1 >>> 32 - $3; $3 = $5_1; } if ($3 & -1431655766 | $4_1 & -1431655766) { $0_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = HEAPU16[$0_1 + 16 >> 1]; $3 = $1_1 & 31; if (($1_1 & 63) >>> 0 >= 32) { $1_1 = 0 } else { $1_1 = 1 << $3 } $3 = $1_1; } if (!($3 & 1347440720)) { $4_1 = 19; break block3; } $4_1 = 0; $3 = $50($0_1); $0_1 = i64toi32_i32$HIGH_BITS; break block4; } $7_1 = $1_1 + 4 | 0; $4_1 = $1675($0_1, 18, $6_1 + 12 | 0, $7_1); if ($4_1) { break block3 } if (HEAP32[$0_1 + 44 >> 2]) { $3 = HEAP32[$6_1 + 12 >> 2]; $4_1 = HEAP32[$0_1 + 24 >> 2]; $5_1 = $50(HEAP32[(($4_1 << 2) + $1_1 | 0) + 16 >> 2]); $4_1 = $282($3, $4_1 + 2 | 0, $5_1); if ($4_1) { break block3 } } $5_1 = HEAP32[((HEAP32[$0_1 + 24 >> 2] << 2) + $1_1 | 0) + 12 >> 2]; $4_1 = HEAPU16[$5_1 + 16 >> 1]; $3 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 1 << $3; $3 = 0; } else { $8_1 = 1 << $3; $4_1 = $8_1 - 1 & 1 >>> 32 - $3; $3 = $8_1; } block7 : { if ($3 & -1431655766 | $4_1 & -1431655766) { $1_1 = HEAP32[$6_1 + 12 >> 2]; break block7; } $1_1 = HEAPU16[HEAP32[$1_1 >> 2] + 16 >> 1]; $3 = $1_1 & 31; block8 : { if (($1_1 & 63) >>> 0 >= 32) { $1_1 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $1_1 = $4_1 - 1 & 1 >>> 32 - $3; } if (!($4_1 & -1431655766 | $1_1 & -1431655766)) { break block8 } $3 = HEAPU16[HEAP32[$7_1 >> 2] + 16 >> 1]; $1_1 = $3 & 31; if (($3 & 63) >>> 0 >= 32) { $4_1 = 1 << $1_1; $3 = 0; } else { $3 = 1 << $1_1; $4_1 = $3 - 1 & 1 >>> 32 - $1_1; } if ($3 & -1431655766 | $4_1 & -1431655766) { break block8 } $4_1 = 1; break block3; } $1_1 = HEAP32[$6_1 + 12 >> 2]; $4_1 = $286($1_1, 1, $5_1); if ($4_1) { break block3 } } $94($1_1); $4_1 = $96($1_1); $0_1 = HEAP32[$0_1 + 12 >> 2]; $3 = HEAP32[$0_1 + 40 >> 2]; $0_1 = HEAP32[$0_1 + 44 >> 2]; } HEAP32[$2_1 >> 2] = $3; HEAP32[$2_1 + 4 >> 2] = $0_1; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1758($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = HEAP32[$0_1 + 280 >> 2]; $6_1 = HEAP32[$0_1 + 284 >> 2]; block3 : { block2 : { block : { if ($5_1 >>> 0 > $3 >>> 0 & ($6_1 | 0) >= ($4_1 | 0) | ($4_1 | 0) < ($6_1 | 0) | !(($3 | 0) != ($5_1 | 0) | ($4_1 | 0) != ($6_1 | 0) | HEAP32[$0_1 + 292 >> 2])) { break block } if (HEAP32[$0_1 + 288 >> 2] != ($2_1 | 0)) { break block } if (HEAP32[$0_1 + 272 >> 2] <= HEAP32[$0_1 + 268 >> 2]) { break block2 } } $5_1 = $1755($0_1); if ($5_1) { break block3 } } HEAP32[$0_1 + 292 >> 2] = $1_1; HEAP32[$0_1 + 288 >> 2] = $2_1; HEAP32[$0_1 + 280 >> 2] = $3; HEAP32[$0_1 + 284 >> 2] = $4_1; $5_1 = 0; } return $5_1; } function $1759($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $5_1 = global$0 - 32 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; HEAP32[$5_1 + 28 >> 2] = 0; HEAP32[$5_1 + 24 >> 2] = 0; HEAP32[$5_1 + 20 >> 2] = 0; HEAP32[$5_1 + 12 >> 2] = 0; block1 : { if (!$2_1) { HEAP32[$4_1 >> 2] = 0; break block1; } $6_1 = HEAP32[$0_1 + 36 >> 2]; $9_1 = HEAP32[$6_1 >> 2]; $6_1 = $1789($6_1, $1_1, $2_1, -1, $5_1 + 8 | 0); if ($6_1) { break block1 } $12_1 = HEAP32[$9_1 + 20 >> 2]; $10_1 = HEAP32[$5_1 + 8 >> 2]; $1_1 = 0; $2_1 = 0; label : while (1) { block2 : { if ($2_1) { break block2 } $2_1 = FUNCTION_TABLE[$12_1 | 0]($10_1, $5_1 + 16 | 0, $5_1 + 12 | 0, $5_1 + 28 | 0, $5_1 + 24 | 0, $5_1 + 20 | 0) | 0; if ($2_1) { break block2 } $2_1 = 1; $7_1 = HEAP32[$5_1 + 20 >> 2]; $1_1 = ($1_1 | 0) > ($7_1 | 0) ? $1_1 : $7_1 + 1 | 0; if (($7_1 | 0) < 0) { break block2 } $8_1 = HEAP32[$5_1 + 16 >> 2]; if (!$8_1) { break block2 } $11_1 = HEAP32[$5_1 + 12 >> 2]; if (($11_1 | 0) <= 0) { break block2 } $6_1 = 1; $2_1 = $1825($0_1, $3, $7_1, HEAP32[$0_1 + 264 >> 2] + 4 | 0, $8_1, $11_1); while (1) { if (HEAP32[$0_1 + 260 >> 2] <= ($6_1 | 0) | $2_1) { continue label } $2_1 = 0; $7_1 = HEAP32[$0_1 + 264 >> 2] + Math_imul($6_1, 24) | 0; $8_1 = HEAP32[$7_1 >> 2]; if (($8_1 | 0) <= HEAP32[$5_1 + 12 >> 2]) { $2_1 = $1825($0_1, $3, HEAP32[$5_1 + 20 >> 2], $7_1 + 4 | 0, HEAP32[$5_1 + 16 >> 2], $8_1) } $6_1 = $6_1 + 1 | 0; continue; }; } break; }; FUNCTION_TABLE[HEAP32[$9_1 + 16 >> 2]]($10_1) | 0; HEAP32[$4_1 >> 2] = HEAP32[$4_1 >> 2] + $1_1; $6_1 = ($2_1 | 0) != 101 ? $2_1 : 0; } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1760($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; if (!HEAP32[$0_1 >> 2]) { $4_1 = HEAP32[$1_1 + 24 >> 2]; $4_1 = $31(__wasm_i64_mul($4_1, $4_1 >> 31, 10, 0), i64toi32_i32$HIGH_BITS); block2 : { if (!$4_1) { $2_1 = 7; break block2; } $1814(HEAP32[$1_1 + 24 >> 2], $2_1, $4_1, $3 + 12 | 0); $2_1 = $1675($1_1, 20, $3 + 8 | 0, 0); if ($2_1) { $24($4_1); break block2; } $2_1 = HEAP32[$3 + 8 >> 2]; $283($2_1, 1, HEAP32[$1_1 + 280 >> 2], HEAP32[$1_1 + 284 >> 2]); $278($2_1, 2, $4_1, HEAP32[$3 + 12 >> 2], 1); $94($2_1); $2_1 = $96($2_1); } HEAP32[$0_1 >> 2] = $2_1; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1761($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $8_1 = global$0 - 16 | 0; $5_1 = $8_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block : { if (HEAP32[$0_1 >> 2]) { break block } $9_1 = HEAP32[$1_1 + 24 >> 2] + 2 | 0; $6_1 = $31(__wasm_i64_mul($9_1, $9_1 >> 31, 14, 0), i64toi32_i32$HIGH_BITS); if (!$6_1) { HEAP32[$0_1 >> 2] = 7; break block; } $5_1 = $1675($1_1, 22, $8_1 + 4 | 0, 0); if ($5_1) { $24($6_1); HEAP32[$0_1 >> 2] = $5_1; break block; } $10_1 = HEAP32[$8_1 + 4 >> 2]; $283($10_1, 1, 0, 0); block5 : { if (($94($10_1) | 0) == 100) { $11_1 = $273($10_1, 0); $5_1 = 0; block4 : { $12_1 = $274($10_1, 0); if (!$12_1) { break block4 } if (HEAP8[($11_1 + $12_1 | 0) - 1 | 0] < 0) { break block4 } while (1) { if (($5_1 | 0) >= ($9_1 | 0) | ($7_1 | 0) >= ($12_1 | 0)) { break block4 } $13_1 = $1668($7_1 + $11_1 | 0, $8_1 + 8 | 0); HEAP32[($5_1 << 2) + $6_1 >> 2] = HEAP32[$8_1 + 8 >> 2]; $5_1 = $5_1 + 1 | 0; $7_1 = $7_1 + $13_1 | 0; continue; }; } $7_1 = ($5_1 | 0) > ($9_1 | 0) ? $5_1 : $9_1; while (1) { if (($5_1 | 0) == ($7_1 | 0)) { break block5 } HEAP32[($5_1 << 2) + $6_1 >> 2] = 0; $5_1 = $5_1 + 1 | 0; continue; }; } $5_1 = $9_1 << 2; if (!$5_1) { break block5 } wasm2js_memory_fill($6_1, 0, $5_1); } $5_1 = $96($10_1); if ($5_1) { $24($6_1); HEAP32[$0_1 >> 2] = $5_1; break block; } $10_1 = ($9_1 << 2) + $6_1 | 0; $5_1 = HEAP32[$6_1 >> 2]; $7_1 = $5_1 + $4_1 | 0; HEAP32[$6_1 >> 2] = ($4_1 | 0) < 0 ? ($5_1 >>> 0 >= 0 - $4_1 >>> 0 ? $7_1 : 0) : $7_1; $5_1 = 0; while (1) { if (!(HEAP32[$1_1 + 24 >> 2] < ($5_1 | 0))) { $4_1 = $5_1 << 2; $5_1 = $5_1 + 1 | 0; $7_1 = ($5_1 << 2) + $6_1 | 0; $11_1 = HEAP32[$4_1 + $2_1 >> 2] + HEAP32[$7_1 >> 2] | 0; $4_1 = $11_1 - HEAP32[$3 + $4_1 >> 2] | 0; HEAP32[$7_1 >> 2] = $4_1 >>> 0 <= $11_1 >>> 0 ? $4_1 : 0; continue; } break; }; $1814($9_1, $6_1, $10_1, $8_1 + 8 | 0); $1_1 = $1675($1_1, 23, $8_1 + 4 | 0, 0); if ($1_1) { $24($6_1); HEAP32[$0_1 >> 2] = $1_1; break block; } $1_1 = HEAP32[$8_1 + 4 >> 2]; $283($1_1, 1, 0, 0); $278($1_1, 2, $10_1, HEAP32[$8_1 + 8 >> 2], 0); $94($1_1); HEAP32[$0_1 >> 2] = $96($1_1); $280($1_1, 1); $24($6_1); } $0_1 = $8_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1762($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0; $2_1 = global$0 - 128 | 0; $4_1 = $2_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $4_1; HEAP32[$2_1 + 20 >> 2] = 0; block : { $3 = $1675($0_1, 27, $2_1 + 20 | 0, 0); if ($3) { break block } $4_1 = HEAP32[$2_1 + 20 >> 2]; $282($4_1, 1, HEAP32[$0_1 + 288 >> 2]); $282($4_1, 2, HEAP32[$0_1 + 260 >> 2]); $12_1 = $2_1 + 120 | 0; $3 = 0; while (1) { block2 : { block1 : { if ($3) { break block1 } if (($94($4_1) | 0) != 100) { break block1 } $3 = 0; $10_1 = $98($4_1, 0); $11_1 = 0; while (1) { if (HEAP32[$0_1 + 260 >> 2] <= ($11_1 | 0)) { break block2 } $8_1 = 0; $9_1 = 0; if (!$3) { HEAP32[$12_1 >> 2] = 0; HEAP32[$12_1 + 4 >> 2] = 19; HEAP32[$2_1 + 112 >> 2] = 0; HEAP32[$2_1 + 116 >> 2] = 0; block4 : { $5_1 = $2_1 + 48 | 0; $3 = $1663($0_1, $10_1, $11_1, -2, 0, 0, 0, 1, $5_1); if ($3) { break block4 } $3 = $1664($0_1, $5_1, $2_1 + 112 | 0); if ($3) { break block4 } label : while (1) { $3 = $1666($0_1, $2_1 + 48 | 0); if (($3 | 0) != 100) { break block4 } $6_1 = HEAP32[$2_1 + 108 >> 2]; $3 = HEAP32[$2_1 + 104 >> 2]; $4_1 = 0; $5_1 = 0; HEAP32[$2_1 + 40 >> 2] = 0; HEAP32[$2_1 + 44 >> 2] = 0; HEAP32[$2_1 + 32 >> 2] = 0; HEAP32[$2_1 + 36 >> 2] = 0; $13_1 = $3 + $6_1 | 0; $3 = $1668($3, $2_1 + 40 | 0) + $3 | 0; while (1) { if ($3 >>> 0 >= $13_1 >>> 0) { continue label } HEAP32[$2_1 + 24 >> 2] = 0; HEAP32[$2_1 + 28 >> 2] = 0; $3 = $1668($3, $2_1 + 24 | 0) + $3 | 0; if ($13_1 >>> 0 <= $3 >>> 0) { continue } $7_1 = HEAP32[$2_1 + 28 >> 2]; $6_1 = HEAP32[$2_1 + 24 >> 2]; if (!(!$7_1 & $6_1 >>> 0 > 1 | ($7_1 | 0) != 0)) { HEAP32[$2_1 + 32 >> 2] = 0; HEAP32[$2_1 + 36 >> 2] = 0; if ($6_1 | $7_1) { $3 = $1668($3, $2_1 + 32 | 0) + $3 | 0; $4_1 = 0; $5_1 = 0; continue; } $3 = $1668($3, $2_1 + 24 | 0) + $3 | 0; $5_1 = HEAP32[$2_1 + 24 >> 2]; $6_1 = HEAP32[$2_1 + 28 >> 2]; $4_1 = HEAP32[$2_1 + 40 >> 2]; $7_1 = HEAP32[$2_1 + 44 >> 2]; if (HEAPU8[$0_1 + 239 | 0]) { HEAP32[$2_1 + 40 >> 2] = $4_1 - $5_1; HEAP32[$2_1 + 44 >> 2] = $7_1 - ($6_1 + ($4_1 >>> 0 < $5_1 >>> 0) | 0); $4_1 = 0; $5_1 = 0; continue; } $6_1 = $6_1 + $7_1 | 0; $7_1 = $4_1; $4_1 = $4_1 + $5_1 | 0; $6_1 = $7_1 >>> 0 > $4_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; HEAP32[$2_1 + 40 >> 2] = $4_1; HEAP32[$2_1 + 44 >> 2] = $6_1; $4_1 = 0; $5_1 = 0; continue; } $15_1 = HEAP32[$2_1 + 96 >> 2]; $16_1 = HEAP32[$2_1 + 100 >> 2]; $17_1 = HEAP32[$2_1 + 40 >> 2]; $18_1 = HEAP32[$2_1 + 44 >> 2]; $14 = HEAP32[$2_1 + 32 >> 2]; $5_1 = $5_1 + $7_1 | 0; $4_1 = $4_1 + $6_1 | 0; $5_1 = ($4_1 >>> 0 < $6_1 >>> 0 ? $5_1 + 1 | 0 : $5_1) - 1 | 0; $4_1 = $4_1 - 2 | 0; $5_1 = $4_1 >>> 0 < 4294967294 ? $5_1 + 1 | 0 : $5_1; $8_1 = $1826($15_1, $16_1, $10_1, $11_1, $17_1, $18_1, $14, $4_1) ^ $8_1; $9_1 = $9_1 ^ i64toi32_i32$HIGH_BITS; continue; }; }; } $1661($2_1 + 48 | 0); } $11_1 = $11_1 + 1 | 0; $19_1 = $8_1 ^ $19_1; $20_1 = $9_1 ^ $20_1; continue; }; } $6_1 = 0; $10_1 = 0; $4_1 = $96($4_1); if ($3) { break block } if ($4_1) { $3 = $4_1; break block; } $7_1 = HEAP32[HEAP32[$0_1 + 36 >> 2] >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$0_1 + 224 >> 2]; $4_1 = $61(7325, $2_1); block10 : { if (!$4_1) { $3 = 7; $8_1 = 0; break block10; } $3 = $93(HEAP32[$0_1 + 12 >> 2], $4_1, -1, $2_1 + 48 | 0, 0); $24($4_1); $8_1 = HEAP32[$2_1 + 48 >> 2]; } label3 : while (1) { block11 : { if ($3) { break block11 } if (($94($8_1) | 0) != 100) { break block11 } $3 = 0; $11_1 = $95($8_1, 0); $15_1 = i64toi32_i32$HIGH_BITS; $12_1 = $1766($0_1, $8_1); $5_1 = 0; while (1) { if ($3) { continue label3 } $4_1 = $5_1; if (($4_1 | 0) >= HEAP32[$0_1 + 24 >> 2]) { continue label3 } $5_1 = $4_1 + 1 | 0; $3 = 0; if (HEAPU8[$4_1 + HEAP32[$0_1 + 32 >> 2] | 0]) { continue } $3 = $124($8_1, $5_1); $9_1 = $1789(HEAP32[$0_1 + 36 >> 2], $12_1, $3, -1, $2_1 + 112 | 0); $13_1 = HEAP32[$2_1 + 112 >> 2]; label5 : while (1) { if (!$9_1) { HEAP32[$2_1 + 32 >> 2] = 0; HEAP32[$2_1 + 24 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; $9_1 = FUNCTION_TABLE[HEAP32[$7_1 + 20 >> 2]]($13_1, $2_1 + 40 | 0, $2_1 + 32 | 0, $2_1 + 24 | 0, $2_1 + 16 | 0, $2_1 + 12 | 0) | 0; if ($9_1) { continue } $16_1 = HEAP32[$2_1 + 40 >> 2]; $17_1 = HEAP32[$2_1 + 32 >> 2]; $18_1 = HEAP32[$2_1 + 12 >> 2]; $6_1 = $1826($16_1, $17_1, $12_1, 0, $11_1, $15_1, $4_1, $18_1) ^ $6_1; $10_1 = $10_1 ^ i64toi32_i32$HIGH_BITS; $3 = 1; $14 = HEAP32[$0_1 + 260 >> 2]; $14 = ($14 | 0) <= 1 ? 1 : $14; while (1) { if (($3 | 0) == ($14 | 0)) { continue label5 } $21_1 = HEAP32[HEAP32[$0_1 + 264 >> 2] + Math_imul($3, 24) >> 2]; if (($17_1 | 0) >= ($21_1 | 0)) { $6_1 = $1826($16_1, $21_1, $12_1, $3, $11_1, $15_1, $4_1, $18_1) ^ $6_1; $10_1 = $10_1 ^ i64toi32_i32$HIGH_BITS; } $3 = $3 + 1 | 0; continue; }; } break; }; if ($13_1) { FUNCTION_TABLE[HEAP32[$7_1 + 16 >> 2]]($13_1) | 0 } $3 = ($9_1 | 0) != 101 ? $9_1 : 0; continue; }; } break; }; $100($8_1); break block; } $4_1 = HEAP32[$2_1 + 20 >> 2]; continue; }; } HEAP32[$1_1 >> 2] = !$3 & (($6_1 | 0) == ($19_1 | 0) & ($10_1 | 0) == ($20_1 | 0)); $0_1 = $2_1 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return ($3 | 0) != 267 ? $3 : 0; } function $1763($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $1_1 = HEAP32[$0_1 >> 2]; while (1) { $2_1 = HEAP8[$1_1 | 0]; if (!(($2_1 | 0) < 48 | $2_1 >>> 0 > 57 | ($3 | 0) > 214748362)) { $1_1 = $1_1 + 1 | 0; $3 = (Math_imul($3, 10) + $2_1 | 0) - 48 | 0; continue; } break; }; HEAP32[$0_1 >> 2] = $1_1; return $3; } function $1764($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$1_1 + 12 >> 2]; $4_1 = HEAP32[$1_1 + 20 >> 2]; HEAP32[$2_1 >> 2] = HEAP32[$1_1 + 16 >> 2]; HEAP32[$2_1 + 4 >> 2] = $4_1; $1730($0_1, $3, 22234, $2_1); if (!HEAP32[$0_1 >> 2]) { HEAP8[$1_1 + 237 | 0] = 1 } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1765($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; $6_1 = global$0 - 112 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $4_1; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; $9_1 = $31(648, 0); block1 : { if (!$9_1) { $10_1 = 7; break block1; } HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; $5_1 = $1675($0_1, 22, $6_1 + 24 | 0, 0); HEAP32[$6_1 + 96 >> 2] = $5_1; if (!$5_1) { $5_1 = 1; $15_1 = HEAP32[$6_1 + 24 >> 2]; $283($15_1, 1, 1, 0); block4 : { if (($94($15_1) | 0) == 100) { $4_1 = 0; $8_1 = $273($15_1, 0); $3 = $274($15_1, 0); if (!$8_1) { break block4 } $1827($6_1 + 8 | 0, $3, $6_1 + 96 | 0); $4_1 = HEAP32[$6_1 + 96 >> 2]; if ($4_1) { $5_1 = 0; break block4; } $4_1 = HEAP32[$6_1 + 8 >> 2]; if (!(!$4_1 | !$3)) { wasm2js_memory_copy($4_1, $8_1, $3) } HEAP32[$6_1 + 12 >> 2] = $3; } $4_1 = 0; } $5_1 = (wasm2js_i32$0 = $96($15_1), wasm2js_i32$1 = $4_1, wasm2js_i32$2 = $5_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); } $23_1 = $9_1 + 584 | 0; $29_1 = $9_1 + 568 | 0; $30_1 = ($2_1 | 0) <= 2 ? 2 : $2_1; $31_1 = $9_1 + 108 | 0; $27 = $9_1 + 76 | 0; $32_1 = $9_1 - -64 | 0; $18_1 = $9_1 + 40 | 0; $21_1 = $9_1 + 56 | 0; $15_1 = 0; block20 : { while (1) { block7 : { if (($1_1 | 0) <= 0 | $5_1) { break block7 } $3 = HEAP32[$0_1 + 260 >> 2]; HEAP32[$6_1 + 4 >> 2] = 0; $1675($0_1, 28, $6_1 + 4 | 0, 0); $4_1 = HEAP32[$6_1 + 4 >> 2]; $282($4_1, 1, $30_1); $3 = $3 << 10; $8_1 = -1; if (($94($4_1) | 0) == 100) { $17_1 = $95($4_1, 0); $15_1 = i64toi32_i32$HIGH_BITS; $8_1 = $98($4_1, 1); } $7_1 = $3 >> 31; $5_1 = $96($4_1); HEAP32[$6_1 + 20 >> 2] = $5_1; $4_1 = 0; block9 : { if ($5_1) { break block9 } $16_1 = HEAP32[$6_1 + 12 >> 2]; if (!$16_1) { break block9 } $11_1 = 0; $13_1 = 0; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 28 >> 2] = 0; $12_1 = HEAP32[$6_1 + 8 >> 2]; HEAP32[$6_1 + 96 >> 2] = 0; $5_1 = 267; $10_1 = $16_1 - 1 | 0; block10 : { if (HEAP8[$12_1 + $10_1 | 0] < 0) { break block10 } $14 = $12_1 - 1 | 0; $4_1 = $10_1 >> 31 & $10_1; block13 : { while (1) { if (($10_1 | 0) > 0) { if (HEAP8[$10_1 + $14 | 0] >= 0) { $4_1 = $10_1; break block13; } else { $10_1 = $10_1 - 1 | 0; continue; } } break; }; if (($16_1 | 0) > 0) { break block10 } } $13_1 = $12_1 - 2 | 0; $11_1 = (($4_1 | 0) > 0 ? 1 : $4_1) - 1 | 0; while (1) { block15 : { if (($4_1 | 0) < 2) { $5_1 = $11_1; break block15; } $10_1 = $4_1 + $13_1 | 0; $5_1 = $4_1 - 1 | 0; $4_1 = $5_1; if (HEAP8[$10_1 | 0] < 0) { continue } } break; }; HEAP32[$6_1 + 12 >> 2] = $5_1; $5_1 = $1668($5_1 + $12_1 | 0, $6_1 + 24 | 0) + $5_1 | 0; $4_1 = $5_1 + $12_1 | 0; $11_1 = HEAP8[$4_1 | 0]; block17 : { if (($11_1 | 0) < 0) { $4_1 = $1681($4_1, $6_1 + 96 | 0); break block17; } HEAP32[$6_1 + 96 >> 2] = $11_1; $4_1 = 1; } $5_1 = ($16_1 | 0) != ($4_1 + $5_1 | 0) ? 267 : 0; $11_1 = HEAP32[$6_1 + 24 >> 2]; $13_1 = HEAP32[$6_1 + 28 >> 2]; } HEAP32[$6_1 + 20 >> 2] = $5_1; block19 : { if (($8_1 | 0) >= 0) { $10_1 = __wasm_i64_srem($17_1, $15_1, $3, $7_1); $4_1 = i64toi32_i32$HIGH_BITS; $7_1 = __wasm_i64_srem($11_1, $13_1, $3, $7_1) >>> 0 > $10_1 >>> 0; $10_1 = i64toi32_i32$HIGH_BITS; if ($7_1 & ($10_1 | 0) >= ($4_1 | 0) | ($4_1 | 0) < ($10_1 | 0)) { break block19 } } $4_1 = ($2_1 | 0) > ($8_1 | 0) ? $2_1 : $8_1; $15_1 = HEAP32[$6_1 + 96 >> 2]; $8_1 = ($4_1 | 0) < ($15_1 | 0) ? $4_1 : $15_1; $28_1 = 1; $4_1 = 1; $17_1 = $11_1; $15_1 = $13_1; break block9; } HEAP32[$6_1 + 12 >> 2] = $16_1; $4_1 = 0; } if (($8_1 | 0) <= 0) { break block7 } $10_1 = 267; if (($17_1 | 0) != 0 & ($3 | 0) <= ($15_1 | 0) | ($3 | 0) < ($15_1 | 0) | ($15_1 | 0) < 0) { break block20 } wasm2js_memory_fill($9_1, 0, 648); HEAP32[$9_1 + 580 >> 2] = 1; block22 : { if ($5_1) { break block22 } $7_1 = 0; HEAP32[$6_1 + 24 >> 2] = 0; $5_1 = $1675($0_1, 8, $6_1 + 24 | 0, 0); if (!$5_1) { $5_1 = HEAP32[$6_1 + 24 >> 2]; $3 = $15_1; $7_1 = $17_1 + 1 | 0; $3 = $7_1 ? $3 : $3 + 1 | 0; $283($5_1, 1, $7_1, $3); $94($5_1); $7_1 = $98($5_1, 0); $5_1 = $96($5_1); } HEAP32[$6_1 + 20 >> 2] = $5_1; block26 : { block25 : { if (!(!$7_1 | ($7_1 | 0) == 1 & $4_1)) { break block25 } $5_1 = $1675($0_1, 15, $6_1 + 24 | 0, 0); if ($5_1) { break block26 } $12_1 = 1; $5_1 = HEAP32[$6_1 + 24 >> 2]; $3 = $5_1; $11_1 = $15_1; $13_1 = $17_1 + 2 | 0; $11_1 = $13_1 >>> 0 < 2 ? $11_1 + 1 | 0 : $11_1; $283($3, 1, $13_1, $11_1); $3 = $15_1; $11_1 = $17_1 + 1 | 0; $3 = ($11_1 ? $3 : $3 + 1 | 0) & 2147483647; $11_1 = ($11_1 & -1024) + 1024 | 0; $3 = $11_1 >>> 0 < 1024 ? $3 + 1 | 0 : $3; $283($5_1, 2, $11_1, $3); if (($94($5_1) | 0) == 100) { $12_1 = ($125($5_1, 0) | 0) != 5 } $5_1 = $96($5_1); HEAP32[$6_1 + 20 >> 2] = $5_1; if ($12_1) { break block25 } HEAP32[$9_1 + 580 >> 2] = HEAP32[$9_1 + 580 >> 2] | 2; } if ($5_1) { break block22 } HEAP32[$6_1 + 24 >> 2] = 0; wasm2js_memory_fill($23_1, 0, 64); $3 = $8_1 << 2; $5_1 = $31($3, 0); HEAP32[$23_1 >> 2] = $5_1; if (!$5_1) { $5_1 = 7; break block26; } if ($3) { wasm2js_memory_fill($5_1, 0, $3) } $5_1 = $1675($0_1, 12, $6_1 + 24 | 0, 0); if ($5_1) { break block26 } $3 = HEAP32[$6_1 + 24 >> 2]; $283($3, 1, $17_1, $15_1); $5_1 = 0; $12_1 = 0; while (1) { block31 : { if ($12_1) { break block31 } if (($94($3) | 0) != 100 | ($5_1 | 0) >= ($8_1 | 0)) { break block31 } $12_1 = $1680($5_1, 0, $95($3, 1), i64toi32_i32$HIGH_BITS, $95($3, 2), i64toi32_i32$HIGH_BITS, $95($3, 3), i64toi32_i32$HIGH_BITS, $273($3, 4), $274($3, 4), HEAP32[$9_1 + 584 >> 2] + ($5_1 << 2) | 0); HEAP32[$9_1 + 588 >> 2] = HEAP32[$9_1 + 588 >> 2] + 1; $5_1 = $5_1 + 1 | 0; continue; } break; }; $5_1 = (wasm2js_i32$0 = $12_1, wasm2js_i32$1 = $96($3), wasm2js_i32$2 = $12_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); HEAP32[$6_1 + 20 >> 2] = $5_1; if ($5_1) { break block22 } $5_1 = 0; if (HEAP32[$9_1 + 588 >> 2] != ($8_1 | 0)) { break block22 } $5_1 = $1664($0_1, $23_1, $29_1); HEAP32[$6_1 + 20 >> 2] = $5_1; if ($5_1) { break block22 } $10_1 = $1666($0_1, $23_1); HEAP32[$6_1 + 20 >> 2] = $10_1; block35 : { block43 : { block40 : { if (!($10_1 ? ($10_1 | 0) != 100 : 0)) { if (!($4_1 ^ 1 | ($7_1 | 0) <= 0)) { $11_1 = HEAP32[$9_1 + 636 >> 2]; $19_1 = HEAP32[$9_1 + 632 >> 2]; HEAP32[$6_1 + 84 >> 2] = 0; $5_1 = $1675($0_1, 32, $6_1 + 84 | 0, 0); if ($5_1) { break block35 } HEAP32[$6_1 + 96 >> 2] = 0; HEAP32[$6_1 + 100 >> 2] = 0; $12_1 = HEAP32[$6_1 + 84 >> 2]; $4_1 = $12_1; $8_1 = $15_1; $3 = $17_1 + 1 | 0; $8_1 = $3 ? $8_1 : $8_1 + 1 | 0; $283($4_1, 1, $3, $8_1); $22_1 = $7_1 - 1 | 0; $282($4_1, 2, $22_1); block38 : { if (($94($4_1) | 0) == 100) { $13_1 = $95($4_1, 1); $14 = i64toi32_i32$HIGH_BITS; $7_1 = $95($4_1, 2); $25 = i64toi32_i32$HIGH_BITS; $1824($4_1, 3, $6_1 + 96 | 0, $18_1); $8_1 = $9_1; $4_1 = HEAP32[$18_1 >> 2]; $3 = HEAP32[$18_1 + 4 >> 2]; block37 : { if (($3 | 0) >= 0) { break block37 } HEAP32[$18_1 >> 2] = 0 - $4_1; HEAP32[$18_1 + 4 >> 2] = 0 - ((($4_1 | 0) != 0) + $3 | 0); $3 = 0; $4_1 = 1; } HEAP8[$8_1 + 48 | 0] = !($4_1 | $3); $16_1 = $274($12_1, 4); $20_1 = $273($12_1, 4); if ($20_1) { break block38 } $96($12_1); $5_1 = $16_1 ? 7 : 267; break block35; } $5_1 = $96($12_1); break block35; } $8_1 = HEAP32[$6_1 + 96 >> 2]; $3 = HEAP32[$6_1 + 100 >> 2]; $24_1 = $3; $5_1 = 0; HEAP32[$6_1 + 24 >> 2] = 0; $4_1 = $1675($0_1, 34, $6_1 + 24 | 0, 0); if (!$4_1) { $4_1 = HEAP32[$6_1 + 24 >> 2]; $283($4_1, 1, $8_1, $3); $5_1 = ($94($4_1) | 0) == 100; $4_1 = $96($4_1); } HEAP32[$6_1 + 88 >> 2] = $4_1; if (!$5_1 | $4_1) { break block40 } HEAP32[$6_1 + 80 >> 2] = 0; HEAP32[$6_1 + 76 >> 2] = 0; $4_1 = $1682($0_1, $7_1, $25, $6_1 + 80 | 0, $6_1 + 76 | 0); HEAP32[$6_1 + 88 >> 2] = $4_1; $3 = 1; if (!$4_1) { $4_1 = $1828($6_1 + 24 | 0, HEAP32[$6_1 + 80 >> 2], HEAP32[$6_1 + 76 >> 2]); while (1) { if (!(!HEAP32[$6_1 + 24 >> 2] | $4_1)) { $4_1 = $1829($6_1 + 24 | 0); continue; } break; }; HEAP32[$6_1 + 88 >> 2] = $4_1; $3 = HEAP32[$6_1 + 48 >> 2]; $7_1 = $1830($19_1, $11_1, $3, HEAP32[$6_1 + 52 >> 2]); $24($3); $3 = ($7_1 | 0) > 0 ? $5_1 : 0; } $24(HEAP32[$6_1 + 80 >> 2]); break block43; } HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 96 >> 2] = 0; $5_1 = $1675($0_1, 29, $6_1 + 24 | 0, 0); if ($5_1) { break block35 } $4_1 = HEAP32[$6_1 + 24 >> 2]; $283($4_1, 1, $17_1, $15_1); $3 = HEAP32[$9_1 + 588 >> 2]; $283($4_1, 2, $3, $3 >> 31); $8_1 = 0; if (($94($4_1) | 0) == 100) { $8_1 = $98($4_1, 0) } $5_1 = $96($4_1); if ($5_1) { break block35 } $5_1 = $1675($0_1, 10, $6_1 + 96 | 0, 0); if ($5_1) { break block35 } $4_1 = HEAP32[$6_1 + 96 >> 2]; if (($94($4_1) | 0) == 100) { $3 = $95($4_1, 0); HEAP32[$9_1 + 24 >> 2] = $3; $11_1 = i64toi32_i32$HIGH_BITS; HEAP32[$9_1 + 28 >> 2] = $11_1; $5_1 = $3; $3 = $8_1 << 4; $13_1 = $3; $5_1 = $5_1 + $3 | 0; $3 = ($3 >> 31) + $11_1 | 0; $3 = ($5_1 >>> 0 < $13_1 >>> 0 ? $3 + 1 | 0 : $3) - 1 | 0; $5_1 = $5_1 - 1 | 0; $3 = ($5_1 | 0) != -1 ? $3 + 1 | 0 : $3; HEAP32[$9_1 + 32 >> 2] = $5_1; HEAP32[$9_1 + 36 >> 2] = $3; } $5_1 = $96($4_1); if ($5_1) { break block35 } $5_1 = $1818($0_1, HEAP32[$9_1 + 32 >> 2], HEAP32[$9_1 + 36 >> 2], 0, 0); if ($5_1) { break block35 } HEAP32[$9_1 + 16 >> 2] = $7_1; HEAP32[$9_1 >> 2] = $8_1; HEAP32[$9_1 + 8 >> 2] = $17_1; HEAP32[$9_1 + 12 >> 2] = $15_1; $13_1 = $8_1 >> 31; $5_1 = HEAP32[$9_1 + 24 >> 2]; $12_1 = HEAP32[$9_1 + 28 >> 2]; $4_1 = 0; $3 = 0; while (1) if (($4_1 | 0) != 16 | ($3 | 0) != 0) { $7_1 = ($4_1 << 5) + $21_1 | 0; $16_1 = __wasm_i64_mul($4_1, $3, $8_1, $13_1); $11_1 = $12_1 + i64toi32_i32$HIGH_BITS | 0; $16_1 = $5_1 + $16_1 | 0; $11_1 = $16_1 >>> 0 < $5_1 >>> 0 ? $11_1 + 1 | 0 : $11_1; HEAP32[$7_1 >> 2] = $16_1; HEAP32[$7_1 + 4 >> 2] = $11_1; $4_1 = $4_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; continue; } else { $5_1 = 0; break block35; }; } $1661($23_1); break block20; } $3 = $5_1; } block48 : { if ($4_1) { $7_1 = $4_1; break block48; } $7_1 = $4_1; if (!$3) { break block48 } $5_1 = HEAP8[$20_1 | 0]; if (($5_1 - 1 & 255) >>> 0 >= 15) { $96($12_1); $5_1 = 267; break block35; } $4_1 = $5_1 & 255; $3 = 0; HEAP32[$9_1 + 32 >> 2] = $8_1; HEAP32[$9_1 + 36 >> 2] = $24_1; HEAP32[$9_1 + 24 >> 2] = $13_1; HEAP32[$9_1 + 28 >> 2] = $14; HEAP32[$9_1 + 16 >> 2] = $22_1; HEAP32[$9_1 + 8 >> 2] = $17_1; HEAP32[$9_1 + 12 >> 2] = $15_1; $7_1 = (($8_1 - $13_1 | 0) + 1 | 0) / 16 | 0; HEAP32[$9_1 >> 2] = $7_1; $22_1 = $7_1 >> 31; while (1) { if (!(!$3 & ($4_1 | 0) == 15)) { $4_1 = $4_1 + 1 | 0; $8_1 = $4_1 ? $3 : $3 + 1 | 0; $19_1 = ($4_1 << 5) + $21_1 | 0; $3 = $8_1; $8_1 = __wasm_i64_mul($4_1, $3, $7_1, $22_1); $11_1 = $14 + i64toi32_i32$HIGH_BITS | 0; $8_1 = $8_1 + $13_1 | 0; $11_1 = $8_1 >>> 0 < $13_1 >>> 0 ? $11_1 + 1 | 0 : $11_1; HEAP32[$19_1 >> 2] = $8_1; HEAP32[$19_1 + 4 >> 2] = $11_1; continue; } break; }; $3 = Math_imul($5_1, $7_1); $11_1 = $3; $7_1 = $3 + $13_1 | 0; $3 = ($3 >> 31) + $14 | 0; $8_1 = ($5_1 << 5) + $21_1 | 0; $4_1 = $8_1; HEAP32[$4_1 >> 2] = $7_1; HEAP32[$4_1 + 4 >> 2] = $7_1 >>> 0 < $11_1 >>> 0 ? $3 + 1 | 0 : $3; $4_1 = HEAP32[$0_1 + 232 >> 2]; $1827($8_1 + 20 | 0, (($4_1 | 0) < ($16_1 | 0) ? $16_1 : $4_1) + 20 | 0, $6_1 + 88 | 0); $4_1 = HEAP32[$6_1 + 88 >> 2]; if (!$4_1) { if ($16_1) { wasm2js_memory_copy(HEAP32[$8_1 + 20 >> 2], $20_1, $16_1) } HEAP32[$8_1 + 24 >> 2] = $16_1; $3 = $16_1 + HEAP32[$8_1 + 20 >> 2] | 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; $8_1 = $3 + 16 | 0; HEAP8[$8_1 | 0] = 0; HEAP8[$8_1 + 1 | 0] = 0; HEAP8[$8_1 + 2 | 0] = 0; HEAP8[$8_1 + 3 | 0] = 0; $3 = $3 + 8 | 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; } $7_1 = $4_1; while (1) { if (($5_1 | 0) < 0 | $7_1) { break block48 } $7_1 = 0; $11_1 = $6_1 + 24 | 0; wasm2js_memory_fill($11_1, 0, 48); $3 = ($5_1 << 5) + $21_1 | 0; $8_1 = HEAP32[$3 + 20 >> 2]; block54 : { if (!$8_1) { break block54 } $4_1 = $1828($11_1, $8_1, HEAP32[$3 + 24 >> 2]); while (1) { if (!($4_1 | !HEAP32[$6_1 + 24 >> 2])) { $4_1 = $1829($6_1 + 24 | 0); continue; } break; }; HEAP32[$6_1 + 88 >> 2] = $4_1; $11_1 = $3 + 8 | 0; $8_1 = HEAP32[$6_1 + 52 >> 2]; $1827($11_1, $8_1, $6_1 + 88 | 0); $4_1 = HEAP32[$6_1 + 88 >> 2]; $7_1 = $4_1; if ($4_1) { break block54 } if (!(!$8_1 | ($8_1 | 0) <= 0)) { wasm2js_memory_copy(HEAP32[$11_1 >> 2], HEAP32[$6_1 + 48 >> 2], $8_1) } HEAP32[$3 + 12 >> 2] = $8_1; if (($5_1 | 0) <= 0) { $4_1 = 0; $7_1 = 0; break block54; } HEAP32[$6_1 + 80 >> 2] = 0; HEAP32[$6_1 + 76 >> 2] = 0; $8_1 = HEAP32[$6_1 + 44 >> 2]; $7_1 = $3 - 32 | 0; $4_1 = HEAP32[$6_1 + 40 >> 2]; HEAP32[$7_1 >> 2] = $4_1; HEAP32[$7_1 + 4 >> 2] = $8_1; HEAP32[$6_1 + 88 >> 2] = $1682($0_1, $4_1, $8_1, $6_1 + 80 | 0, $6_1 + 76 | 0); $8_1 = $3 - 12 | 0; $3 = HEAP32[$6_1 + 76 >> 2]; $4_1 = HEAP32[$0_1 + 232 >> 2]; $1827($8_1, (($3 | 0) > ($4_1 | 0) ? $3 : $4_1) + 20 | 0, $6_1 + 88 | 0); $4_1 = HEAP32[$6_1 + 88 >> 2]; if (!$4_1) { if ($3) { wasm2js_memory_copy(HEAP32[$7_1 + 20 >> 2], HEAP32[$6_1 + 80 >> 2], $3) } HEAP32[$7_1 + 24 >> 2] = $3; $3 = $3 + HEAP32[$7_1 + 20 >> 2] | 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; $8_1 = $3 + 16 | 0; HEAP8[$8_1 | 0] = 0; HEAP8[$8_1 + 1 | 0] = 0; HEAP8[$8_1 + 2 | 0] = 0; HEAP8[$8_1 + 3 | 0] = 0; $3 = $3 + 8 | 0; HEAP8[$3 | 0] = 0; HEAP8[$3 + 1 | 0] = 0; HEAP8[$3 + 2 | 0] = 0; HEAP8[$3 + 3 | 0] = 0; HEAP8[$3 + 4 | 0] = 0; HEAP8[$3 + 5 | 0] = 0; HEAP8[$3 + 6 | 0] = 0; HEAP8[$3 + 7 | 0] = 0; } $24(HEAP32[$6_1 + 80 >> 2]); $7_1 = $4_1; } $24(HEAP32[$6_1 + 48 >> 2]); $5_1 = $5_1 - 1 | 0; continue; }; } $5_1 = (wasm2js_i32$0 = $4_1, wasm2js_i32$1 = $96($12_1), wasm2js_i32$2 = $7_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); } HEAP32[$6_1 + 20 >> 2] = $5_1; block101 : { block60 : { if ($5_1) { break block60 } if (HEAP32[$9_1 >> 2]) { block81 : { if ($10_1) { while (1) { $16_1 = HEAP32[$9_1 + 644 >> 2]; $25 = HEAP32[$9_1 + 640 >> 2]; $20_1 = HEAP32[$9_1 + 636 >> 2]; $19_1 = HEAP32[$9_1 + 632 >> 2]; HEAP32[$6_1 + 96 >> 2] = 0; $7_1 = $1817(HEAP32[$9_1 + 64 >> 2], HEAP32[$9_1 + 68 >> 2], $19_1, $20_1); $4_1 = $20_1 - $7_1 | 0; block64 : { if (($4_1 | 0) <= 0) { $5_1 = 267; break block64; } $3 = ($1699($7_1, $7_1 >> 31) + $4_1 | 0) + $1699($4_1, 0) | 0; $4_1 = $16_1; $24_1 = $1699($4_1, $4_1 >> 31) + $4_1 | 0; $10_1 = $3 + $24_1 | 0; $5_1 = HEAP32[$9_1 + 80 >> 2]; block65 : { if (($5_1 | 0) <= 0 | HEAP32[$0_1 + 232 >> 2] >= ($5_1 + $10_1 | 0)) { break block65 } $3 = HEAP32[$9_1 + 60 >> 2]; $8_1 = HEAP32[$9_1 + 56 >> 2]; $4_1 = $3; $3 = HEAP32[$9_1 >> 2]; $12_1 = $3; $11_1 = $3 + HEAP32[$9_1 + 24 >> 2] | 0; $3 = HEAP32[$9_1 + 28 >> 2] + ($3 >> 31) | 0; $3 = $11_1 >>> 0 < $12_1 >>> 0 ? $3 + 1 | 0 : $3; if (($3 | 0) <= ($4_1 | 0) & $8_1 >>> 0 >= $11_1 >>> 0 | ($3 | 0) < ($4_1 | 0)) { break block65 } $5_1 = $1818($0_1, $8_1, $4_1, HEAP32[$9_1 + 76 >> 2], $5_1); HEAP32[$6_1 + 96 >> 2] = $5_1; HEAP32[$9_1 + 4 >> 2] = HEAP32[$9_1 + 4 >> 2] + 1; $4_1 = HEAP32[$9_1 + 56 >> 2]; $3 = HEAP32[$9_1 + 60 >> 2]; if (!$5_1) { $5_1 = 1; $11_1 = $7_1 + 1 | 0; while (1) { block68 : { if (($5_1 | 0) == 16) { $14 = 0; break block68; } HEAP32[$6_1 + 24 >> 2] = 0; $7_1 = ($5_1 << 5) + $21_1 | 0; $12_1 = HEAP32[$7_1 + 12 >> 2]; $8_1 = $1817(HEAP32[$7_1 + 8 >> 2], $12_1, $19_1, $11_1); $13_1 = $11_1 - $8_1 | 0; if (($13_1 | 0) <= 0) { $14 = 267; break block68; } $10_1 = $8_1 >> 31; $22_1 = ($1699($8_1, $10_1) + $13_1 | 0) + $1699($13_1, 0) | 0; $14 = HEAP32[$7_1 + 24 >> 2]; block74 : { block78 : { if (!(!!$12_1 & HEAP32[$0_1 + 232 >> 2] < ($14 + $22_1 | 0))) { $26_1 = $7_1 + 8 | 0; $12_1 = $7_1 + 20 | 0; block72 : { if ($14) { break block72 } $1827($12_1, HEAP32[$0_1 + 232 >> 2], $6_1 + 24 | 0); if (HEAP32[$6_1 + 24 >> 2]) { $14 = HEAP32[$7_1 + 24 >> 2]; break block72; } HEAP8[HEAP32[$7_1 + 20 >> 2]] = $5_1; $14 = $1700(HEAP32[$7_1 + 20 >> 2] + 1 | 0, $4_1, $3) + 1 | 0; HEAP32[$7_1 + 24 >> 2] = $14; } $3 = $6_1 + 24 | 0; $1827($12_1, $14 + $22_1 | 0, $3); $1827($26_1, $11_1, $3); $4_1 = 0; $3 = 0; $14 = HEAP32[$6_1 + 24 >> 2]; if ($14) { break block74 } $14 = HEAP32[$7_1 + 24 >> 2]; if (HEAP32[$7_1 + 12 >> 2]) { $14 = $1700(HEAP32[$7_1 + 20 >> 2] + $14 | 0, $8_1, $10_1) + HEAP32[$7_1 + 24 >> 2] | 0; HEAP32[$7_1 + 24 >> 2] = $14; } $4_1 = $1700(HEAP32[$7_1 + 20 >> 2] + $14 | 0, $13_1, 0) + HEAP32[$7_1 + 24 >> 2] | 0; HEAP32[$7_1 + 24 >> 2] = $4_1; if ($13_1) { wasm2js_memory_copy($4_1 + HEAP32[$7_1 + 20 >> 2] | 0, $8_1 + $19_1 | 0, $13_1) } HEAP32[$7_1 + 24 >> 2] = $13_1 + HEAP32[$7_1 + 24 >> 2]; if ($11_1) { wasm2js_memory_copy(HEAP32[$7_1 + 8 >> 2], $19_1, $11_1) } $4_1 = 0; $14 = 0; $8_1 = $11_1; break block78; } $14 = $1818($0_1, HEAP32[$7_1 >> 2], HEAP32[$7_1 + 4 >> 2], HEAP32[$7_1 + 20 >> 2], $14); HEAP8[HEAP32[$7_1 + 20 >> 2]] = $5_1; $8_1 = HEAP32[$7_1 + 20 >> 2] + 1 | 0; $4_1 = $4_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; HEAP32[$7_1 + 24 >> 2] = $1700($8_1, $4_1, $3) + 1; $8_1 = HEAP32[$7_1 + 4 >> 2]; $3 = $8_1; $4_1 = HEAP32[$7_1 >> 2]; $13_1 = $4_1 + 1 | 0; $8_1 = $13_1 ? $3 : $3 + 1 | 0; HEAP32[$7_1 >> 2] = $13_1; HEAP32[$7_1 + 4 >> 2] = $8_1; $8_1 = 0; } HEAP32[$7_1 + 12 >> 2] = $8_1; } if ($14) { break block68 } $5_1 = $5_1 + 1 | 0; if ($3 | $4_1) { continue } } break; }; HEAP32[$6_1 + 96 >> 2] = $14; $3 = HEAP32[$21_1 + 4 >> 2]; $4_1 = HEAP32[$21_1 >> 2]; } $5_1 = 0; HEAP32[$9_1 + 80 >> 2] = 0; HEAP32[$9_1 + 68 >> 2] = 0; $4_1 = $4_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; HEAP32[$9_1 + 56 >> 2] = $4_1; HEAP32[$9_1 + 60 >> 2] = $3; $10_1 = ($1699($20_1, $20_1 >> 31) + ($20_1 + $24_1 | 0) | 0) + 1 | 0; } $3 = HEAP32[$18_1 + 4 >> 2] + ($10_1 >> 31) | 0; $4_1 = $10_1 + HEAP32[$18_1 >> 2] | 0; $3 = $4_1 >>> 0 < $10_1 >>> 0 ? $3 + 1 | 0 : $3; HEAP32[$18_1 >> 2] = $4_1; HEAP32[$18_1 + 4 >> 2] = $3; $1827($27, $5_1 + $10_1 | 0, $6_1 + 96 | 0); $5_1 = HEAP32[$6_1 + 96 >> 2]; if ($5_1) { break block64 } if (!HEAP32[$9_1 + 80 >> 2]) { HEAP32[$9_1 + 80 >> 2] = 1; HEAP8[HEAP32[$9_1 + 76 >> 2]] = 0; } $5_1 = $1831($27, $32_1, $19_1, $20_1, $25, $16_1); if ($5_1) { break block64 } $5_1 = $1666($0_1, $23_1); } $10_1 = HEAP32[$9_1 + 4 >> 2]; if (!(($5_1 | 0) != 100 | ($10_1 | 0) < ($1_1 | 0))) { HEAP32[$6_1 + 20 >> 2] = 0; break block81; } if (($5_1 | 0) == 100) { continue } break; }; HEAP32[$6_1 + 20 >> 2] = $5_1; if ($5_1) { break block60 } } $10_1 = HEAP32[$9_1 + 4 >> 2]; } $22_1 = $10_1 ^ -1; $7_1 = HEAP32[$9_1 + 588 >> 2]; $5_1 = 0; $14 = 0; while (1) { if (!($5_1 | ($7_1 | 0) <= 0)) { $7_1 = $7_1 - 1 | 0; $4_1 = 0; $3 = HEAP32[$9_1 + 588 >> 2]; $3 = ($3 | 0) > 0 ? $3 : 0; $10_1 = 0; while (1) { if (($3 | 0) != ($10_1 | 0)) { $4_1 = $10_1 << 2; $10_1 = $10_1 + 1 | 0; $4_1 = HEAP32[$4_1 + HEAP32[$23_1 >> 2] >> 2]; if (HEAP32[$4_1 >> 2] != ($7_1 | 0)) { continue } } break; }; if (HEAP32[$4_1 + 40 >> 2]) { $16_1 = HEAP32[$4_1 >> 2]; $20_1 = HEAP32[$4_1 + 60 >> 2]; $19_1 = HEAP32[$4_1 + 64 >> 2]; HEAP32[$6_1 + 32 >> 2] = 0; $11_1 = 0; $13_1 = 0; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 28 >> 2] = 0; HEAP32[$6_1 + 104 >> 2] = 0; HEAP32[$6_1 + 96 >> 2] = 0; HEAP32[$6_1 + 100 >> 2] = 0; HEAP32[$6_1 + 88 >> 2] = 0; HEAP32[$6_1 + 92 >> 2] = 0; HEAP32[$6_1 + 84 >> 2] = 0; $8_1 = 0; $10_1 = 0; $5_1 = $1675($0_1, 32, $6_1 + 84 | 0, 0); if (!$5_1) { $4_1 = HEAP32[$6_1 + 84 >> 2]; $283($4_1, 1, $17_1, $15_1); $282($4_1, 2, $16_1); block87 : { if (($94($4_1) | 0) != 100) { $12_1 = 0; break block87; } $3 = $273($4_1, 4); $5_1 = $274($4_1, 4); $8_1 = $95($4_1, 1); $10_1 = i64toi32_i32$HIGH_BITS; $12_1 = $1832($3, $5_1, $6_1 + 24 | 0, $19_1, $20_1, $6_1 + 88 | 0); } $5_1 = (wasm2js_i32$0 = $12_1, wasm2js_i32$1 = $96($4_1), wasm2js_i32$2 = $12_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); } while (1) { block88 : { if ($5_1) { break block88 } $4_1 = HEAP32[$6_1 + 88 >> 2]; $3 = HEAP32[$6_1 + 92 >> 2]; if (!($4_1 | $3)) { break block88 } HEAP32[$6_1 + 80 >> 2] = 0; HEAP32[$6_1 + 76 >> 2] = 0; $5_1 = $1682($0_1, $4_1, $3, $6_1 + 80 | 0, $6_1 + 76 | 0); block89 : { if ($5_1) { break block89 } $5_1 = $1832(HEAP32[$6_1 + 80 >> 2], HEAP32[$6_1 + 76 >> 2], $6_1 + 96 | 0, $19_1, $20_1, $6_1 + 88 | 0); if ($5_1) { break block89 } $5_1 = $1818($0_1, $4_1, $3, HEAP32[$6_1 + 96 >> 2], HEAP32[$6_1 + 100 >> 2]); } $24(HEAP32[$6_1 + 80 >> 2]); $11_1 = $4_1; $13_1 = $3; continue; } break; }; block90 : { if ($5_1 | !($11_1 | $13_1)) { break block90 } HEAP32[$6_1 + 80 >> 2] = 0; $5_1 = $1675($0_1, 17, $6_1 + 80 | 0, 0); if ($5_1) { break block90 } $4_1 = HEAP32[$6_1 + 80 >> 2]; $283($4_1, 1, $8_1, $10_1); $3 = $13_1 - 1 | 0; $5_1 = $11_1 - 1 | 0; $3 = ($5_1 | 0) != -1 ? $3 + 1 | 0 : $3; $283($4_1, 2, $5_1, $3); $94($4_1); $5_1 = $96($4_1); } block91 : { if ($5_1) { break block91 } HEAP32[$6_1 + 80 >> 2] = 0; $5_1 = $1675($0_1, 33, $6_1 + 80 | 0, 0); if ($5_1) { break block91 } $4_1 = HEAP32[$6_1 + 80 >> 2]; $283($4_1, 1, $11_1, $13_1); $278($4_1, 2, HEAP32[$6_1 + 24 >> 2], HEAP32[$6_1 + 28 >> 2], 0); $283($4_1, 3, $17_1, $15_1); $282($4_1, 4, $16_1); $94($4_1); $5_1 = $96($4_1); $280($4_1, 1); } $24(HEAP32[$6_1 + 24 >> 2]); $24(HEAP32[$6_1 + 96 >> 2]); $14 = $14 + 1 | 0; continue; } else { $5_1 = $1816($0_1, $4_1); if ($5_1) { continue } $3 = HEAP32[$4_1 >> 2]; HEAP32[$6_1 + 24 >> 2] = 0; $5_1 = $1675($0_1, 30, $6_1 + 24 | 0, 0); if ($5_1) { continue } $4_1 = HEAP32[$6_1 + 24 >> 2]; $283($4_1, 1, $17_1, $15_1); $282($4_1, 2, $3); $94($4_1); $5_1 = $96($4_1); continue; } } break; }; block92 : { if ($5_1) { break block92 } $5_1 = 0; if (HEAP32[$9_1 + 588 >> 2] == ($14 | 0)) { break block92 } $10_1 = 0; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 96 >> 2] = 0; $7_1 = 0; $4_1 = 0; $8_1 = 0; block93 : { $5_1 = $1675($0_1, 35, $6_1 + 24 | 0, 0); if ($5_1) { break block93 } $3 = HEAP32[$6_1 + 24 >> 2]; $283($3, 1, $17_1, $15_1); $12_1 = 0; while (1) { block96 : { $11_1 = $94($3); if (($11_1 | 0) == 100) { if (($4_1 | 0) < ($12_1 | 0)) { $5_1 = $8_1; break block96; } $12_1 = $12_1 + 16 | 0; $5_1 = $34($8_1, $12_1 << 2, 0); if ($5_1) { break block96 } $7_1 = 7; } $5_1 = (wasm2js_i32$0 = $7_1, wasm2js_i32$1 = $96($3), wasm2js_i32$2 = ($11_1 | 0) == 100, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1); if ($5_1) { $7_1 = HEAP32[$6_1 + 96 >> 2]; break block93; } $5_1 = $1675($0_1, 31, $6_1 + 96 | 0, 0); $7_1 = HEAP32[$6_1 + 96 >> 2]; if ($5_1) { break block93 } $283($7_1, 2, $17_1, $15_1); $5_1 = 0; break block93; } HEAP32[($4_1 << 2) + $5_1 >> 2] = $98($3, 0); $4_1 = $4_1 + 1 | 0; $8_1 = $5_1; continue; }; } HEAP8[$0_1 + 240 | 0] = 1; while (1) { if (!($4_1 >>> 0 <= $10_1 >>> 0 | $5_1)) { $5_1 = 0; $3 = HEAP32[($10_1 << 2) + $8_1 >> 2]; if (($10_1 | 0) != ($3 | 0)) { $282($7_1, 3, $3); $282($7_1, 1, $10_1); $94($7_1); $5_1 = $96($7_1); } $10_1 = $10_1 + 1 | 0; continue; } break; }; HEAP8[$0_1 + 240 | 0] = 0; $24($8_1); } $1_1 = $1_1 + $22_1 | 0; HEAP32[$6_1 + 20 >> 2] = $5_1; $12_1 = 1; if (!$14) { break block101 } $1827($6_1 + 8 | 0, HEAP32[$6_1 + 12 >> 2] + 20 | 0, $6_1 + 20 | 0); $28_1 = 1; $5_1 = HEAP32[$6_1 + 20 >> 2]; if ($5_1) { break block60 } $4_1 = HEAP32[$6_1 + 12 >> 2]; $3 = HEAP32[$6_1 + 8 >> 2]; $4_1 = $1700($4_1 + $3 | 0, $17_1, $15_1) + $4_1 | 0; HEAP32[$6_1 + 12 >> 2] = $1700($3 + $4_1 | 0, $14, 0) + $4_1; } $5_1 = 0; } $4_1 = HEAP32[$18_1 >> 2]; $3 = 0 - $4_1 | 0; $4_1 = 0 - (HEAP32[$18_1 + 4 >> 2] + (($4_1 | 0) != 0) | 0) | 0; HEAP32[$18_1 >> 2] = $3; HEAP32[$18_1 + 4 >> 2] = $4_1; $12_1 = 0; } HEAP32[$6_1 + 24 >> 2] = $5_1; $10_1 = 15; block102 : { while (1) { if (($10_1 | 0) < 0) { break block102 } $4_1 = ($10_1 << 5) + $21_1 | 0; if (HEAP32[$4_1 + 24 >> 2] <= 0) { $24(HEAP32[$4_1 + 20 >> 2]); $24(HEAP32[$4_1 + 8 >> 2]); $10_1 = $10_1 - 1 | 0; continue; } break; }; block104 : { if ($10_1) { break block104 } $1827($31_1, 11, $6_1 + 24 | 0); $10_1 = 1; $5_1 = HEAP32[$6_1 + 24 >> 2]; if ($5_1) { break block104 } HEAP8[HEAP32[$9_1 + 108 >> 2]] = 1; HEAP32[$9_1 + 112 >> 2] = $1700(HEAP32[$9_1 + 108 >> 2] + 1 | 0, HEAP32[$9_1 + 56 >> 2], HEAP32[$9_1 + 60 >> 2]) + 1; $5_1 = 0; } $4_1 = 0; while (1) { if (!(($4_1 | 0) == ($10_1 | 0))) { $3 = ($4_1 << 5) + $21_1 | 0; $8_1 = HEAP32[$3 + 24 >> 2]; if (!($5_1 | ($8_1 | 0) <= 0)) { $5_1 = $1818($0_1, HEAP32[$3 >> 2], HEAP32[$3 + 4 >> 2], HEAP32[$3 + 20 >> 2], $8_1) } $24(HEAP32[$3 + 20 >> 2]); $24(HEAP32[$3 + 8 >> 2]); $4_1 = $4_1 + 1 | 0; continue; } break; }; $7_1 = ($10_1 << 5) + $21_1 | 0; if (!$5_1) { $8_1 = HEAP32[$9_1 + 12 >> 2]; $4_1 = HEAP32[$9_1 + 8 >> 2] + 1 | 0; $8_1 = $4_1 ? $8_1 : $8_1 + 1 | 0; $5_1 = $4_1; $4_1 = 0; $3 = 0; $25 = HEAP32[$9_1 + 16 >> 2]; $26_1 = HEAP32[$9_1 + 24 >> 2]; $24_1 = HEAP32[$9_1 + 28 >> 2]; $10_1 = HEAP32[$9_1 + 56 >> 2]; $16_1 = HEAP32[$9_1 + 60 >> 2]; $13_1 = HEAP32[$9_1 + 32 >> 2]; $11_1 = HEAP32[$9_1 + 36 >> 2]; if (!HEAPU8[$9_1 + 48 | 0]) { $3 = HEAP32[$18_1 + 4 >> 2]; $4_1 = HEAP32[$18_1 >> 2]; } $5_1 = $1821($0_1, $5_1, $8_1, $25, $26_1, $24_1, $10_1, $16_1, $13_1, $11_1, $4_1, $3, HEAP32[$7_1 + 20 >> 2], HEAP32[$7_1 + 24 >> 2]); } $24(HEAP32[$7_1 + 20 >> 2]); $24(HEAP32[$7_1 + 8 >> 2]); HEAP32[$6_1 + 20 >> 2] = $5_1; } if (HEAPU8[$9_1 + 48 | 0] | !$12_1) { break block22 } $3 = $15_1; $4_1 = $17_1 + 1 | 0; $3 = $4_1 ? $3 : $3 + 1 | 0; $1822($0_1, $4_1, $3, HEAP32[$18_1 >> 2], HEAP32[$18_1 + 4 >> 2]); break block22; } HEAP32[$6_1 + 20 >> 2] = $5_1; } $1661($23_1); continue; } break; }; $10_1 = $5_1; } block109 : { if ($10_1 | !$28_1) { break block109 } HEAP32[$6_1 + 24 >> 2] = 0; $10_1 = $1675($0_1, 23, $6_1 + 24 | 0, 0); if ($10_1) { break block109 } $0_1 = HEAP32[$6_1 + 24 >> 2]; $283($0_1, 1, 1, 0); $278($0_1, 2, HEAP32[$6_1 + 8 >> 2], HEAP32[$6_1 + 12 >> 2], 0); $94($0_1); $10_1 = $96($0_1); $280($0_1, 1); } $24($9_1); $24(HEAP32[$6_1 + 8 >> 2]); } $0_1 = $6_1 + 112 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $10_1; } function $1766($0_1, $1_1) { if (!HEAP32[$0_1 + 44 >> 2]) { return 0 } return $98($1_1, HEAP32[$0_1 + 24 >> 2] + 1 | 0); } function $1767($0_1) { $0_1 = $0_1 | 0; HEAP32[$0_1 + 52 >> 2] = 0; return $1768($0_1) | 0; } function $1768($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $1_1 = 0; block1 : { if (HEAPU8[$0_1 + 237 | 0] != 2) { break block1 } HEAP32[$4_1 >> 2] = HEAP32[$0_1 + 20 >> 2]; $5_1 = $61(3590, $4_1); $1_1 = 7; if (!$5_1) { break block1 } $2_1 = HEAP32[$0_1 + 12 >> 2]; $3 = HEAP32[$0_1 + 16 >> 2]; $1_1 = global$0 - 32 | 0; if ($1_1 >>> 0 < global$5 >>> 0 | global$4 >>> 0 < $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; HEAP32[$1_1 + 28 >> 2] = 0; $4($2_1); $6_1 = $416($2_1, $1_1 + 28 | 0); if (!$6_1) { $3 = $319($2_1, $5_1, $3); $7_1 = !$3 | HEAPU8[$3 + 43 | 0] == 2 ? $7_1 : 1; } $3 = HEAP32[$1_1 + 28 >> 2]; if (!(($6_1 | 0) != 0 | $7_1)) { $10($2_1, $3); HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 16 >> 2] = $5_1; $3 = $310($2_1, 6407, $1_1 + 16 | 0); HEAP32[$1_1 + 28 >> 2] = $3; $6_1 = 1; } HEAP32[$1_1 >> 2] = $3; $131($2_1, $6_1, $3 ? 8932 : 0, $1_1); $10($2_1, HEAP32[$1_1 + 28 >> 2]); $2_1 = $114($2_1, $6_1); $1_1 = $1_1 + 32 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $24($5_1); HEAP8[$0_1 + 237 | 0] = !$2_1; $1_1 = 0; } $5_1 = $1_1; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1769($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; $1_1 = HEAP32[$0_1 + 12 >> 2]; $4_1 = HEAP32[$1_1 + 40 >> 2]; $5_1 = HEAP32[$1_1 + 44 >> 2]; $1_1 = $1755($0_1); block : { if ($1_1) { break block } $1_1 = 0; if (HEAPU32[$0_1 + 52 >> 2] < 5) { break block } $2_1 = HEAP32[$0_1 + 48 >> 2]; if (!$2_1 | ($2_1 | 0) == 255) { break block } $2_1 = 0; HEAP32[$3 + 12 >> 2] = 0; $1_1 = $1675($0_1, 36, $3 + 12 | 0, 0); if (!$1_1) { $1_1 = HEAP32[$3 + 12 >> 2]; if (($94($1_1) | 0) == 100) { $2_1 = $98($1_1, 0) } $1_1 = $96($1_1); } $2_1 = Math_imul(HEAP32[$0_1 + 52 >> 2], $2_1); $2_1 = (($2_1 | 0) / 2 | 0) + $2_1 | 0; if (($2_1 | 0) < 65) { break block } $1_1 = $1765($0_1, $2_1, HEAP32[$0_1 + 48 >> 2]); } $1660($0_1); $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$0_1 + 40 >> 2] = $4_1; HEAP32[$0_1 + 44 >> 2] = $5_1; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1771($0_1) { $0_1 = $0_1 | 0; $1772($0_1); return 0; } function $1772($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; while (1) { if (!(HEAP32[$0_1 + 260 >> 2] <= ($3 | 0))) { $1_1 = HEAP32[$0_1 + 264 >> 2] + Math_imul($3, 24) | 0; $2_1 = $1_1 + 12 | 0; $1_1 = $1_1 + 4 | 0; while (1) { $2_1 = HEAP32[$2_1 >> 2]; if ($2_1) { $24(HEAP32[$2_1 + 8 >> 2]); continue; } break; }; $1635($1_1); $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$0_1 + 272 >> 2] = 0; } function $1773($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $1_1 = 0; $0_1 = 0; block : { while (1) { if (($0_1 | 0) == 4) { break block } $4_1 = $0_1 << 3; $0_1 = $0_1 + 1 | 0; $4_1 = $4_1 + 57520 | 0; if ($2073($2_1, HEAP32[$4_1 >> 2])) { continue } break; }; HEAP32[$3 >> 2] = HEAP32[$4_1 + 4 >> 2]; $1_1 = 1; } return $1_1 | 0; } function $1774($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 80 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $5_1 = HEAP32[$0_1 + 12 >> 2]; $3 = $1768($0_1); HEAP32[$2_1 + 76 >> 2] = $3; if (!$3) { HEAP32[$2_1 + 76 >> 2] = $1755($0_1) } HEAP8[$0_1 + 240 | 0] = 1; if (!HEAP32[$0_1 + 40 >> 2]) { $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 72 >> 2] = $1_1; HEAP32[$2_1 + 64 >> 2] = $4_1; HEAP32[$2_1 + 68 >> 2] = $3; $1730($2_1 + 76 | 0, $5_1, 22955, $2_1 - -64 | 0); } if (HEAPU8[$0_1 + 238 | 0]) { $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 56 >> 2] = $1_1; HEAP32[$2_1 + 48 >> 2] = $4_1; HEAP32[$2_1 + 52 >> 2] = $3; $1730($2_1 + 76 | 0, $5_1, 23161, $2_1 + 48 | 0); } if (HEAPU8[$0_1 + 237 | 0]) { $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 40 >> 2] = $1_1; HEAP32[$2_1 + 32 >> 2] = $4_1; HEAP32[$2_1 + 36 >> 2] = $3; $1730($2_1 + 76 | 0, $5_1, 23008, $2_1 + 32 | 0); } $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 24 >> 2] = $1_1; HEAP32[$2_1 + 16 >> 2] = $4_1; HEAP32[$2_1 + 20 >> 2] = $3; $6_1 = $2_1 + 76 | 0; $1730($6_1, $5_1, 23055, $2_1 + 16 | 0); $3 = HEAP32[$0_1 + 20 >> 2]; $4_1 = HEAP32[$0_1 + 16 >> 2]; HEAP32[$2_1 + 8 >> 2] = $1_1; HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = $3; $1730($6_1, $5_1, 23109, $2_1); HEAP8[$0_1 + 240 | 0] = 0; $1_1 = HEAP32[$2_1 + 76 >> 2]; $0_1 = $2_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1775($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block : { if (HEAPU8[$0_1 + 240 | 0]) { break block } if (HEAP32[HEAP32[$0_1 + 264 >> 2] + 8 >> 2] > 0) { $3 = HEAP32[$0_1 + 16 >> 2]; $4_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$2_1 + 8 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = $4_1; HEAP32[$2_1 >> 2] = $3; $4_1 = $61(27600, $2_1); if (!$4_1) { $3 = 7; break block; } HEAP8[$0_1 + 240 | 0] = 1; $3 = $97(HEAP32[$0_1 + 12 >> 2], $4_1, 0, 0, 0); HEAP8[$0_1 + 240 | 0] = 0; $24($4_1); if ($3) { break block } } HEAP32[$0_1 + 256 >> 2] = $1_1 + 1; $3 = 0; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 | 0; } function $1776($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP32[$0_1 + 256 >> 2] = $1_1; return 0; } function $1777($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (($1_1 | 0) < HEAP32[$0_1 + 256 >> 2]) { $1772($0_1) } return 0; } function $1778($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; while (1) { if (($1_1 | 0) == 5) { return 0 } $2_1 = $1_1 << 2; $1_1 = $1_1 + 1 | 0; if ($66($0_1, HEAP32[$2_1 + 57552 >> 2])) { continue } break; }; return 1; } function $1779($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0; $3 = global$0 - 32 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 28 >> 2] = 0; $5_1 = $4_1; $4_1 = $1762($0_1, $3 + 28 | 0); block3 : { block2 : { if (!(($4_1 | 0) != 1 & ($4_1 & 255) != 11)) { $6_1 = HEAPU8[$0_1 + 236 | 0]; HEAP32[$3 + 12 >> 2] = $256($4_1); HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $6_1 ? 4 : 3; $2_1 = $61(7758, $3); break block2; } if (HEAP32[$3 + 28 >> 2] | $4_1) { break block3 } $4_1 = HEAPU8[$0_1 + 236 | 0]; HEAP32[$3 + 24 >> 2] = $2_1; HEAP32[$3 + 20 >> 2] = $1_1; HEAP32[$3 + 16 >> 2] = $4_1 ? 4 : 3; $4_1 = 7; $2_1 = $61(6350, $3 + 16 | 0); } HEAP32[$5_1 >> 2] = $2_1; $4_1 = $2_1 ? 0 : $4_1; } $1660($0_1); $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1 | 0; } function $1780($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $4_1 = global$0 - 32 | 0; $5_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $5_1; HEAP32[$4_1 + 16 >> 2] = $1_1; $1_1 = 0; HEAP32[$4_1 + 28 >> 2] = 0; $7_1 = $61(8932, $4_1 + 16 | 0); block1 : { if (!$7_1) { $6_1 = 7; break block1; } $8_1 = $2080($7_1); $5_1 = $1784($7_1, $4_1 + 28 | 0); $5_1 = $5_1 ? $5_1 : $7_1; $9_1 = $5_1 + HEAP32[$4_1 + 28 >> 2] | 0; HEAP8[$9_1 | 0] = 0; $1654($5_1); $6_1 = 1; $11_1 = $1723($0_1, $5_1, $2080($5_1) + 1 | 0); block7 : { if ($11_1) { $12_1 = $7_1 + $8_1 | 0; $0_1 = 0; $5_1 = 0; block4 : { while (1) { block3 : { $8_1 = $0_1; $6_1 = $9_1 + 1 | 0; if ($6_1 >>> 0 >= $12_1 >>> 0) { break block3 } $10_1 = $1784($6_1, $4_1 + 28 | 0); if (!$10_1) { break block3 } $0_1 = $0_1 + 1 | 0; $5_1 = $0_1 ? $5_1 : $5_1 + 1 | 0; $6_1 = $34($1_1, $0_1 << 2 & -4, 0); if (!$6_1) { break block4 } HEAP32[$6_1 + ($8_1 << 2) >> 2] = $10_1; $9_1 = $10_1 + HEAP32[$4_1 + 28 >> 2] | 0; HEAP8[$9_1 | 0] = 0; $1654($10_1); $1_1 = $6_1; continue; } break; }; $6_1 = FUNCTION_TABLE[HEAP32[$11_1 + 4 >> 2]]($8_1, $1_1, $2_1) | 0; block6 : { if ($6_1) { $1655($3, 9274, 0); break block6; } HEAP32[HEAP32[$2_1 >> 2] >> 2] = $11_1; } $24($1_1); break block7; } $24($7_1); $6_1 = 7; $7_1 = $1_1; break block7; } HEAP32[$4_1 >> 2] = $5_1; $1655($3, 7850, $4_1); } $24($7_1); } $0_1 = $4_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1781($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { $2_1 = HEAPU8[$0_1 + $5_1 | 0] - 48 | 0; if (($2_1 & 255) >>> 0 <= 9) { $2_1 = $2_1 & 255; $4_1 = __wasm_i64_mul($4_1, $3, 10, 0) + $2_1 | 0; $3 = i64toi32_i32$HIGH_BITS; $3 = $4_1 >>> 0 < $2_1 >>> 0 ? $3 + 1 | 0 : $3; if (!(!$3 & $4_1 >>> 0 <= 2147483647)) { return -1 } $5_1 = $5_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = $4_1; return $5_1; } function $1782($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = ($2080($0_1) << 1) + 3 | 0; $2_1 = $31($2_1, $2_1 >> 31); if ($2_1) { HEAP8[$2_1 | 0] = 34; $1_1 = $2_1; while (1) { block2 : { $5_1 = $0_1 + $4_1 | 0; $3 = HEAPU8[$5_1 | 0]; block3 : { if (($3 | 0) != 34) { if (!$3) { break block2 } $1_1 = $1_1 + 1 | 0; break block3; } HEAP8[$1_1 + 1 | 0] = 34; $3 = HEAPU8[$5_1 | 0]; $1_1 = $1_1 + 2 | 0; } HEAP8[$1_1 | 0] = $3; $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP8[$1_1 + 1 | 0] = 34; HEAP8[$1_1 + 2 | 0] = 0; } return $2_1; } function $1783($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; if (!HEAP32[$0_1 >> 2]) { HEAP32[$4_1 + 12 >> 2] = $3; $2_1 = $60($2_1, $3); block3 : { if ($2_1) { $3 = HEAP32[$1_1 >> 2]; if (!$3) { $3 = $2_1; break block3; } HEAP32[$4_1 + 4 >> 2] = $2_1; HEAP32[$4_1 >> 2] = $3; $3 = $61(6118, $4_1); $24($2_1); if ($3) { break block3 } } HEAP32[$0_1 >> 2] = 7; $3 = 0; } $24(HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = $3; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1784($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; while (1) { $3 = 0; block : { label : while (1) { if ($3) { break block } $2_1 = HEAPU8[$0_1 | 0]; $4_1 = $2_1 << 24 >> 24; block3 : { block2 : { block1 : { if (($2_1 | 0) == 34 | ($2_1 | 0) == 39) { break block1 } $3 = $0_1; if (($2_1 | 0) == 91) { break block2 } if (($2_1 | 0) == 96) { break block1 } if ($2_1) { break block3 } return 0; } $4_1 = $4_1 & 255; $3 = $0_1; while (1) { $2_1 = $3; $3 = $2_1 + 1 | 0; $5_1 = HEAPU8[$2_1 + 1 | 0]; if (!$5_1) { continue label } if (($4_1 | 0) != ($5_1 | 0)) { continue } $3 = $2_1 + 2 | 0; if (($4_1 | 0) == HEAPU8[$2_1 + 2 | 0]) { continue } break; }; continue; } while (1) { block4 : { $2_1 = $3; $3 = $2_1 + 1 | 0; $4_1 = HEAPU8[$2_1 + 1 | 0]; if (($4_1 | 0) == 93) { break block4 } if ($4_1) { continue } } break; }; $3 = $4_1 ? $2_1 + 2 | 0 : $3; continue; } if (!(!HEAPU8[$2_1 + 57360 | 0] & ($4_1 | 0) >= 0)) { while (1) { $2_1 = HEAP8[$3 + 1 | 0]; $3 = $3 + 1 | 0; if (HEAPU8[$2_1 + 57360 | 0] | ($2_1 | 0) < 0) { continue } break; }; continue; } break; }; $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 >> 2] = $3 - $0_1; return $0_1; } function $1785($0_1) { block : { if (!$0_1) { break block } HEAP8[$0_1 | 0] = 0; if (HEAPU8[$0_1 + 1 | 0] | HEAPU8[$0_1 + 2 | 0]) { break block } $24($0_1); } } function $1786($0_1) { if (HEAP32[$0_1 + 24 >> 2]) { $24(HEAP32[$0_1 + 28 >> 2]) } HEAP32[$0_1 + 32 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 28 >> 2] = 0; } function $1787($0_1) { $1661($0_1); $24($0_1); } function $1789($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 >> 2]; HEAP32[$5_1 + 12 >> 2] = 0; $3 = FUNCTION_TABLE[HEAP32[$6_1 + 12 >> 2]]($0_1, $2_1, $3, $5_1 + 12 | 0) | 0; $2_1 = HEAP32[$5_1 + 12 >> 2]; block : { if ($3) { break block } HEAP32[$2_1 >> 2] = $0_1; block1 : { if (HEAP32[$6_1 >> 2] <= 0) { break block1 } $3 = FUNCTION_TABLE[HEAP32[$6_1 + 24 >> 2]]($2_1, $1_1) | 0; $2_1 = HEAP32[$5_1 + 12 >> 2]; if (!$3) { break block1 } FUNCTION_TABLE[HEAP32[$6_1 + 16 >> 2]]($2_1) | 0; $2_1 = 0; break block; } $3 = 0; } HEAP32[$4_1 >> 2] = $2_1; $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1790($0_1, $1_1, $2_1) { $1_1 = $34($0_1, $1_1, $2_1); if (!$1_1) { $24($0_1) } return $1_1; } function $1791($0_1, $1_1, $2_1) { var $3 = 0; block1 : { block : { while (1) { $3 = $1_1; $1_1 = HEAP32[$1_1 + 8 >> 2]; if (!$1_1) { break block } if (HEAP32[$1_1 >> 2] <= HEAP32[$2_1 >> 2]) { continue } break; }; HEAP32[$1_1 + 16 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $1_1; break block1; } HEAP32[$0_1 >> 2] = $2_1; } HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; } function $1792($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$2_1 + 12 >> 2] = 0; $3 = $1675($0_1, 22, $2_1 + 12 | 0, 0); $0_1 = HEAP32[$2_1 + 12 >> 2]; block : { if ($3) { break block } $283($0_1, 1, 0, 0); if (($94($0_1) | 0) == 100) { $3 = 0; if (($125($0_1, 0) | 0) == 4) { break block } } $0_1 = $96($0_1); $3 = $0_1 ? $0_1 : 267; $0_1 = 0; } HEAP32[$1_1 >> 2] = $0_1; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1793($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $12_1 = $0_1 + 10 | 0; $4_1 = $0_1; while (1) { block1 : { if (!(!$8_1 & $5_1 >>> 0 <= 63)) { $4_1 = $12_1; break block1; } $7_1 = 0; $7_1 = $1_1 >>> 0 > $4_1 >>> 0 ? HEAPU8[$4_1 | 0] : $7_1; $4_1 = $4_1 + 1 | 0; $9_1 = $7_1 & 127; $3 = $5_1 & 31; if (($5_1 & 63) >>> 0 >= 32) { $11_1 = $9_1 << $3; $3 = 0; } else { $11_1 = (1 << $3) - 1 & $9_1 >>> 32 - $3; $3 = $9_1 << $3; } $3 = $3 + $10_1 | 0; $6_1 = $6_1 + $11_1 | 0; $6_1 = $3 >>> 0 < $10_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $10_1 = $3; $5_1 = $5_1 + 7 | 0; $8_1 = $5_1 >>> 0 < 7 ? $8_1 + 1 | 0 : $8_1; if ($7_1 >>> 0 > 127) { continue } } break; }; HEAP32[$2_1 >> 2] = $10_1; HEAP32[$2_1 + 4 >> 2] = $6_1; return $4_1 - $0_1 | 0; } function $1794($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $6_1 = global$0 - 160 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $11_1 = HEAP32[$1_1 + 20 >> 2]; wasm2js_memory_fill($6_1 + 24 | 0, 0, 128); $5_1 = HEAP32[$1_1 + 8 >> 2]; $7_1 = HEAP32[$1_1 + 12 >> 2]; $9_1 = HEAP32[$0_1 + 24 >> 2]; HEAP32[$6_1 + 16 >> 2] = $2_1; HEAP32[$6_1 + 20 >> 2] = ($7_1 ? 32 : 0) | ($5_1 ? 11 : 3) | (($2_1 | 0) < ($9_1 | 0) ? 4 : 0); HEAP32[$6_1 + 8 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$6_1 + 12 >> 2] = HEAP32[$1_1 + 4 >> 2]; $12_1 = $6_1 + 88 | 0; $5_1 = $1664($0_1, $11_1, $6_1 + 8 | 0); label2 : while (1) { block2 : { block7 : { block3 : { block1 : { if ($5_1) { break block1 } $5_1 = $1666($0_1, $11_1); if (($5_1 | 0) == 100) { break block2 } if ($5_1) { break block1 } $2_1 = $5_1; while (1) { if (($2_1 | 0) == 16) { break block3 } block6 : { $8_1 = $2_1 << 2; $9_1 = $8_1 + ($6_1 + 24 | 0) | 0; $7_1 = HEAP32[$9_1 >> 2]; block4 : { if (!$7_1) { break block4 } if (!$10_1) { $5_1 = HEAP32[$8_1 + $12_1 >> 2]; HEAP32[$9_1 >> 2] = 0; $10_1 = $7_1; break block4; } $5_1 = $1797(HEAPU8[$0_1 + 239 | 0], $7_1, HEAP32[$8_1 + $12_1 >> 2], $10_1, $5_1, $6_1 + 152 | 0, $6_1 + 156 | 0); if ($5_1) { break block6 } $24(HEAP32[$9_1 >> 2]); $24($10_1); HEAP32[$9_1 >> 2] = 0; $5_1 = HEAP32[$6_1 + 156 >> 2]; $10_1 = HEAP32[$6_1 + 152 >> 2]; } $2_1 = $2_1 + 1 | 0; continue; } break; }; $24($10_1); } $2_1 = 0; while (1) { if (($2_1 | 0) == 16) { break block7 } $24(HEAP32[($6_1 + 24 | 0) + ($2_1 << 2) >> 2]); $2_1 = $2_1 + 1 | 0; continue; }; } HEAP32[$4_1 >> 2] = $10_1; HEAP32[$3 >> 2] = $5_1; $5_1 = 0; } $1787($11_1); HEAP32[$1_1 + 20 >> 2] = 0; $0_1 = $6_1 + 160 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } $8_1 = HEAP32[$11_1 + 60 >> 2]; $9_1 = HEAP32[$11_1 + 56 >> 2]; $2_1 = 0; block9 : { if (HEAP32[$6_1 + 24 >> 2]) { $7_1 = $9_1; while (1) { if (($2_1 | 0) == 16) { break block9 } $5_1 = $2_1 << 2; $13_1 = $5_1 + ($6_1 + 24 | 0) | 0; $14 = HEAP32[$13_1 >> 2]; if (!$14) { HEAP32[$13_1 >> 2] = $7_1; HEAP32[$5_1 + $12_1 >> 2] = $8_1; break block9; } $15_1 = $5_1 + $12_1 | 0; $5_1 = $1797(HEAPU8[$0_1 + 239 | 0], $7_1, $8_1, $14, HEAP32[$15_1 >> 2], $6_1 + 156 | 0, $6_1 + 152 | 0); if ($5_1) { if (($7_1 | 0) == ($9_1 | 0)) { continue label2 } $24($7_1); continue label2; } if (($7_1 | 0) != ($9_1 | 0)) { $24($7_1) } $24($14); HEAP32[$13_1 >> 2] = 0; $8_1 = HEAP32[$6_1 + 152 >> 2]; $7_1 = HEAP32[$6_1 + 156 >> 2]; if (($2_1 | 0) == 15) { HEAP32[$13_1 >> 2] = $7_1; HEAP32[$15_1 >> 2] = $8_1; } $2_1 = $2_1 + 1 | 0; continue; }; } $2_1 = $8_1 >> 31; $5_1 = $8_1 + 11 | 0; $2_1 = $5_1 >>> 0 < 11 ? $2_1 + 1 | 0 : $2_1; $2_1 = $31($5_1, $2_1); HEAP32[$6_1 + 88 >> 2] = $8_1; HEAP32[$6_1 + 24 >> 2] = $2_1; $5_1 = 7; if (!$2_1) { continue } if ($8_1) { wasm2js_memory_copy($2_1, $9_1, $8_1) } $2_1 = $2_1 + $8_1 | 0; HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; HEAP8[$2_1 + 2 | 0] = 0; HEAP8[$2_1 + 3 | 0] = 0; HEAP8[$2_1 + 4 | 0] = 0; HEAP8[$2_1 + 5 | 0] = 0; HEAP8[$2_1 + 6 | 0] = 0; HEAP8[$2_1 + 7 | 0] = 0; $5_1 = 0; $2_1 = $2_1 + 8 | 0; HEAP8[$2_1 | 0] = 0; HEAP8[$2_1 + 1 | 0] = 0; continue; } $5_1 = 0; continue; }; } function $1795($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0; $5_1 = global$0 - 48 | 0; $6_1 = $5_1; if (global$4 >>> 0 < $5_1 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $6_1; block1 : { if (!$3) { $24(HEAP32[$1_1 >> 2]); HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $4_1 = 0; break block1; } $6_1 = HEAP32[$1_1 + 44 >> 2]; if (($6_1 | 0) < 0) { HEAP32[$1_1 + 4 >> 2] = $4_1; HEAP32[$1_1 >> 2] = $3; $4_1 = 0; break block1; } $10_1 = HEAP32[$1_1 >> 2]; if (!$10_1) { $24($3); $4_1 = 0; break block1; } $8_1 = HEAP32[$1_1 + 4 >> 2]; block5 : { if (($2_1 | 0) > ($6_1 | 0)) { $13_1 = $2_1 - $6_1 | 0; $6_1 = $3; $7_1 = $4_1; break block5; } $13_1 = $6_1 - $2_1 | 0; $6_1 = $10_1; $7_1 = $8_1; $10_1 = $3; $8_1 = $4_1; } $9_1 = HEAPU8[$0_1 + 239 | 0]; HEAP32[$5_1 + 40 >> 2] = 0; HEAP32[$5_1 + 44 >> 2] = 0; HEAP32[$5_1 + 32 >> 2] = 0; HEAP32[$5_1 + 36 >> 2] = 0; HEAP32[$5_1 + 24 >> 2] = 0; HEAP32[$5_1 + 28 >> 2] = 0; HEAP32[$5_1 + 20 >> 2] = $10_1; HEAP32[$5_1 + 16 >> 2] = $6_1; HEAP32[$5_1 + 8 >> 2] = 0; $0_1 = $6_1; block7 : { block6 : { if (!$9_1) { break block6 } $0_1 = $7_1 >> 31; $3 = $7_1 + 10 | 0; $0_1 = $3 >>> 0 < 10 ? $0_1 + 1 | 0 : $0_1; $0_1 = $31($3, $0_1); if ($0_1) { break block6 } $4_1 = 7; break block7; } HEAP32[$5_1 + 12 >> 2] = $0_1; $11_1 = $8_1 + $10_1 | 0; $1798($5_1 + 20 | 0, $11_1, 0, $5_1 + 40 | 0); $12_1 = $6_1 + $7_1 | 0; $1798($5_1 + 16 | 0, $12_1, 0, $5_1 + 32 | 0); while (1) { if (!(!HEAP32[$5_1 + 20 >> 2] | !HEAP32[$5_1 + 16 >> 2])) { $3 = HEAP32[$5_1 + 40 >> 2]; $4_1 = HEAP32[$5_1 + 32 >> 2]; $7_1 = HEAP32[$5_1 + 44 >> 2]; $8_1 = HEAP32[$5_1 + 36 >> 2]; $4_1 = ($3 >>> 0 > $4_1 >>> 0 & ($7_1 | 0) >= ($8_1 | 0) | ($7_1 | 0) > ($8_1 | 0)) - ($3 >>> 0 < $4_1 >>> 0 & ($7_1 | 0) <= ($8_1 | 0) | ($7_1 | 0) < ($8_1 | 0)) | 0; $4_1 = $9_1 ? 0 - $4_1 | 0 : $4_1; if (!$4_1) { $4_1 = HEAP32[$5_1 + 8 >> 2]; $8_1 = HEAP32[$5_1 + 24 >> 2]; $15_1 = HEAP32[$5_1 + 28 >> 2]; $16_1 = HEAP32[$5_1 + 12 >> 2]; $14 = $5_1 + 12 | 0; $1799($14, $9_1, $5_1 + 24 | 0, $5_1 + 8 | 0, $3, $7_1); if (!$1800($14, $13_1, 0, 1, $5_1 + 20 | 0, $5_1 + 16 | 0)) { HEAP32[$5_1 + 24 >> 2] = $8_1; HEAP32[$5_1 + 28 >> 2] = $15_1; HEAP32[$5_1 + 12 >> 2] = $16_1; HEAP32[$5_1 + 8 >> 2] = $4_1; } $1798($5_1 + 20 | 0, $11_1, $9_1, $5_1 + 40 | 0); $1798($5_1 + 16 | 0, $12_1, $9_1, $5_1 + 32 | 0); continue; } if (($4_1 | 0) < 0) { $3 = $5_1 + 20 | 0; $1703(0, $3); $1798($3, $11_1, $9_1, $5_1 + 40 | 0); continue; } else { $3 = $5_1 + 16 | 0; $1703(0, $3); $1798($3, $12_1, $9_1, $5_1 + 32 | 0); continue; } } break; }; $7_1 = HEAP32[$5_1 + 12 >> 2] - $0_1 | 0; $4_1 = 0; if (!$9_1) { break block7 } $24($6_1); $6_1 = $0_1; } $24($10_1); HEAP32[$1_1 + 4 >> 2] = $7_1; HEAP32[$1_1 >> 2] = $6_1; } if (($2_1 | 0) > HEAP32[$1_1 + 44 >> 2]) { HEAP32[$1_1 + 44 >> 2] = $2_1 } $0_1 = $5_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1796($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $6_1 = HEAP32[$0_1 >> 2]; $3 = 0; block : { if (!$1_1) { break block } $3 = 0; if (HEAPU8[$0_1 + 52 | 0] != HEAPU8[$6_1 + 239 | 0]) { break block } $0_1 = HEAP32[$2_1 + 64 >> 2]; $3 = 0; if (($0_1 | 0) > 4) { break block } $3 = ($0_1 | 0) > 0; } $8_1 = $2_1 + 72 | 0; $1_1 = 0; $0_1 = 0; block6 : { block1 : { while (1) { if (!$3) { break block1 } if (($0_1 | 0) < HEAP32[$2_1 + 64 >> 2]) { $7_1 = Math_imul($0_1, 24) + $8_1 | 0; $3 = HEAP32[$7_1 + 20 >> 2]; block4 : { if (HEAP32[$7_1 + 12 >> 2]) { $1_1 = $3 ? 1 : $1_1; $4_1 = 0; break block4; } $4_1 = 1; if (!$3) { break block4 } $1_1 = 1; $4_1 = HEAP32[$3 + 44 >> 2] != 0; } $3 = $4_1; $0_1 = $0_1 + 1 | 0; continue; } break; }; if (!$1_1) { break block1 } $0_1 = HEAP32[$2_1 + 68 >> 2]; $12_1 = ($0_1 | 0) >= HEAP32[$6_1 + 24 >> 2] ? -1 : $0_1; $7_1 = 0; $13_1 = 1; $1_1 = 0; while (1) { if (HEAP32[$2_1 + 64 >> 2] <= ($7_1 | 0) | $1_1) { break block6 } $0_1 = Math_imul($7_1, 24) + $8_1 | 0; $3 = HEAP32[$0_1 + 20 >> 2]; block8 : { if ($3) { $9_1 = HEAPU8[$6_1 + 239 | 0]; $4_1 = HEAP32[$3 + 4 >> 2]; $10_1 = HEAP32[$0_1 >> 2]; $11_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = $1674($6_1, $3, $10_1, $11_1); if ($1_1) { break block8 } $9_1 = $9_1 ? 108 : 109; $0_1 = 0; $1_1 = ($4_1 | 0) > 0 ? $4_1 : 0; block9 : { while (1) { if (($0_1 | 0) == ($1_1 | 0)) { break block9 } block10 : { $4_1 = HEAP32[HEAP32[$3 >> 2] + ($0_1 << 2) >> 2]; if (!HEAP32[$4_1 + 40 >> 2]) { break block10 } if ($1686($4_1, $10_1, $11_1)) { break block10 } $0_1 = $0_1 + 1 | 0; continue; } break; }; $1_1 = $0_1; } HEAP32[$3 + 8 >> 2] = $1_1; $0_1 = 0; while (1) { block11 : { $4_1 = HEAP32[$3 >> 2]; if (($0_1 | 0) >= ($1_1 | 0)) { break block11 } $1_1 = $1695($6_1, HEAP32[$4_1 + ($0_1 << 2) >> 2]); if ($1_1) { break block8 } $0_1 = $0_1 + 1 | 0; $1_1 = HEAP32[$3 + 8 >> 2]; continue; } break; }; $1689($4_1, $0_1, $0_1, $9_1); HEAP32[$3 + 32 >> 2] = $12_1; } $1_1 = 0; } $7_1 = $7_1 + 1 | 0; continue; }; } $1_1 = 0; $0_1 = 0; while (1) { if (HEAP32[$2_1 + 64 >> 2] <= ($0_1 | 0) | $1_1) { break block6 } $1_1 = Math_imul($0_1, 24) + $8_1 | 0; block13 : { if (!HEAP32[$1_1 + 20 >> 2]) { $1_1 = 0; break block13; } HEAP32[$5_1 + 12 >> 2] = 0; HEAP32[$5_1 + 8 >> 2] = 0; $1_1 = $1794($6_1, $1_1, HEAP32[$2_1 + 68 >> 2], $5_1 + 12 | 0, $5_1 + 8 | 0); if ($1_1) { break block13 } $1_1 = $1795($6_1, $2_1, $0_1, HEAP32[$5_1 + 8 >> 2], HEAP32[$5_1 + 12 >> 2]); } $0_1 = $0_1 + 1 | 0; continue; }; } HEAP32[$2_1 + 40 >> 2] = $13_1; $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1797($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { var $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $7_1 = global$0 - 48 | 0; $8_1 = $7_1; if (global$4 >>> 0 < $7_1 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $8_1; HEAP32[$7_1 + 40 >> 2] = 0; HEAP32[$7_1 + 44 >> 2] = 0; HEAP32[$7_1 + 32 >> 2] = 0; HEAP32[$7_1 + 36 >> 2] = 0; HEAP32[$7_1 + 24 >> 2] = 0; HEAP32[$7_1 + 28 >> 2] = 0; HEAP32[$7_1 + 20 >> 2] = $1_1; HEAP32[$7_1 + 16 >> 2] = $3; HEAP32[$7_1 + 8 >> 2] = 0; HEAP32[$5_1 >> 2] = 0; HEAP32[$6_1 >> 2] = 0; $8_1 = ($2_1 >> 31) + ($4_1 >> 31) | 0; $9_1 = $2_1 + $4_1 | 0; $8_1 = $9_1 >>> 0 < $4_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $9_1 = $9_1 + 17 | 0; $8_1 = $9_1 >>> 0 < 17 ? $8_1 + 1 | 0 : $8_1; $8_1 = $31($9_1, $8_1); block1 : { if (!$8_1) { $1_1 = 7; break block1; } HEAP32[$7_1 + 12 >> 2] = $8_1; $9_1 = $1_1 + $2_1 | 0; $1798($7_1 + 20 | 0, $9_1, 0, $7_1 + 40 | 0); $11_1 = $3 + $4_1 | 0; $1798($7_1 + 16 | 0, $11_1, 0, $7_1 + 32 | 0); block7 : { block2 : { while (1) { $12_1 = HEAP32[$7_1 + 20 >> 2]; $13_1 = HEAP32[$7_1 + 16 >> 2]; if (!($12_1 | $13_1)) { break block2 } $1_1 = HEAP32[$7_1 + 40 >> 2]; $2_1 = HEAP32[$7_1 + 32 >> 2]; $3 = HEAP32[$7_1 + 44 >> 2]; $4_1 = HEAP32[$7_1 + 36 >> 2]; $10_1 = ($1_1 >>> 0 > $2_1 >>> 0 & ($3 | 0) >= ($4_1 | 0) | ($3 | 0) > ($4_1 | 0)) - ($1_1 >>> 0 < $2_1 >>> 0 & ($3 | 0) <= ($4_1 | 0) | ($3 | 0) < ($4_1 | 0)) | 0; $10_1 = $0_1 ? 0 - $10_1 | 0 : $10_1; block4 : { if (!($10_1 | (!$12_1 | !$13_1))) { $2_1 = $7_1 + 12 | 0; $1799($2_1, $0_1, $7_1 + 24 | 0, $7_1 + 8 | 0, $1_1, $3); $1_1 = $2_1; $2_1 = $7_1 + 20 | 0; $3 = $7_1 + 16 | 0; $1_1 = $1801($1_1, $2_1, $3); if ($1_1) { break block4 } $1798($2_1, $9_1, $0_1, $7_1 + 40 | 0); $1798($3, $11_1, $0_1, $7_1 + 32 | 0); continue; } if (!$13_1 | ($12_1 | 0) != 0 & ($10_1 | 0) < 0) { $2_1 = $7_1 + 12 | 0; $1799($2_1, $0_1, $7_1 + 24 | 0, $7_1 + 8 | 0, $1_1, $3); $1_1 = $7_1 + 20 | 0; $1703($2_1, $1_1); $1798($1_1, $9_1, $0_1, $7_1 + 40 | 0); continue; } $1_1 = $7_1 + 12 | 0; $1799($1_1, $0_1, $7_1 + 24 | 0, $7_1 + 8 | 0, $2_1, $4_1); $2_1 = $1_1; $1_1 = $7_1 + 16 | 0; $1703($2_1, $1_1); $1798($1_1, $11_1, $0_1, $7_1 + 32 | 0); continue; } break; }; $24($8_1); $0_1 = 0; $8_1 = 0; break block7; } $0_1 = HEAP32[$7_1 + 12 >> 2]; HEAP8[$0_1 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$0_1 + 4 | 0] = 0; HEAP8[$0_1 + 5 | 0] = 0; HEAP8[$0_1 + 6 | 0] = 0; HEAP8[$0_1 + 7 | 0] = 0; $1_1 = 0; } HEAP32[$5_1 >> 2] = $8_1; HEAP32[$6_1 >> 2] = $0_1 - $8_1; } $0_1 = $7_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1798($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = $1_1; $1_1 = HEAP32[$0_1 >> 2]; block1 : { if ($5_1 >>> 0 <= $1_1 >>> 0) { HEAP32[$0_1 >> 2] = 0; break block1; } HEAP32[$0_1 >> 2] = $1668($1_1, $4_1 + 8 | 0) + HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$4_1 + 8 >> 2]; $5_1 = $2_1 ? 0 - $0_1 | 0 : $0_1; $1_1 = $5_1 + HEAP32[$3 >> 2] | 0; $6_1 = ($0_1 | 0) != 0; $0_1 = HEAP32[$4_1 + 12 >> 2]; $0_1 = HEAP32[$3 + 4 >> 2] + ($2_1 ? 0 - ($6_1 + $0_1 | 0) | 0 : $0_1) | 0; HEAP32[$3 >> 2] = $1_1; HEAP32[$3 + 4 >> 2] = $1_1 >>> 0 < $5_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1799($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0; block2 : { if (HEAP32[$3 >> 2] ? !$1_1 : 1) { $6_1 = HEAP32[$2_1 >> 2]; $1_1 = $4_1 - $6_1 | 0; $6_1 = $5_1 - (HEAP32[$2_1 + 4 >> 2] + ($4_1 >>> 0 < $6_1 >>> 0) | 0) | 0; break block2; } $6_1 = HEAP32[$2_1 >> 2]; $1_1 = $6_1 - $4_1 | 0; $6_1 = HEAP32[$2_1 + 4 >> 2] - (($4_1 >>> 0 > $6_1 >>> 0) + $5_1 | 0) | 0; } HEAP32[$0_1 >> 2] = $1700(HEAP32[$0_1 >> 2], $1_1, $6_1) + HEAP32[$0_1 >> 2]; HEAP32[$2_1 >> 2] = $4_1; HEAP32[$2_1 + 4 >> 2] = $5_1; HEAP32[$3 >> 2] = 1; } function $1800($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0; $6_1 = global$0 - 48 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$6_1 + 44 >> 2] = HEAP32[$0_1 >> 2]; $8_1 = HEAP32[$4_1 >> 2]; HEAP32[$6_1 + 40 >> 2] = $8_1; $10_1 = HEAP32[$5_1 >> 2]; HEAP32[$6_1 + 36 >> 2] = $10_1; HEAP32[$6_1 + 32 >> 2] = 0; HEAP32[$6_1 + 28 >> 2] = 0; block26 : { block3 : { if (HEAPU8[$8_1 | 0] == 1) { $11_1 = $8_1 + 1 | 0; $9_1 = HEAP8[$8_1 + 1 | 0]; block2 : { if (($9_1 | 0) < 0) { $8_1 = $1681($11_1, $6_1 + 32 | 0); $9_1 = HEAP32[$6_1 + 32 >> 2]; break block2; } HEAP32[$6_1 + 32 >> 2] = $9_1; $8_1 = 1; } HEAP32[$6_1 + 40 >> 2] = $8_1 + $11_1; if (!$9_1) { break block3 } } if (HEAPU8[$10_1 | 0] == 1) { $8_1 = 1; $11_1 = $10_1 + 1 | 0; $7_1 = HEAP8[$10_1 + 1 | 0]; block6 : { if (($7_1 | 0) < 0) { $8_1 = $1681($11_1, $6_1 + 28 | 0); $7_1 = HEAP32[$6_1 + 28 >> 2]; break block6; } HEAP32[$6_1 + 28 >> 2] = $7_1; } HEAP32[$6_1 + 36 >> 2] = $8_1 + $11_1; if (!$7_1) { break block3 } } $16_1 = $1_1; $17_1 = $1_1 >> 31; $18_1 = ($2_1 | 0) != 0; while (1) { block9 : { block20 : { if (($7_1 | 0) == ($9_1 | 0)) { $9_1 = HEAP32[$6_1 + 44 >> 2]; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; if ($7_1) { HEAP8[$9_1 | 0] = 1; $1_1 = $9_1 + 1 | 0; HEAP32[$6_1 + 44 >> 2] = $1700($1_1, $7_1, $7_1 >> 31) + $1_1; } $1803($6_1 + 40 | 0, $6_1 + 8 | 0); $1_1 = HEAP32[$6_1 + 12 >> 2]; $12_1 = $1_1; $1_1 = $1_1 - 1 | 0; $13_1 = HEAP32[$6_1 + 8 >> 2]; $11_1 = $13_1 - 2 | 0; $1_1 = $11_1 >>> 0 < 4294967294 ? $1_1 + 1 | 0 : $1_1; HEAP32[$6_1 + 8 >> 2] = $11_1; $8_1 = $1_1; HEAP32[$6_1 + 12 >> 2] = $1_1; $1803($6_1 + 36 | 0, $6_1); $1_1 = HEAP32[$6_1 + 4 >> 2]; $14 = $1_1; $1_1 = $1_1 - 1 | 0; $15_1 = HEAP32[$6_1 >> 2]; $10_1 = $15_1 - 2 | 0; $1_1 = $10_1 >>> 0 < 4294967294 ? $1_1 + 1 | 0 : $1_1; HEAP32[$6_1 >> 2] = $10_1; $7_1 = $1_1; HEAP32[$6_1 + 4 >> 2] = $1_1; if ($13_1 >>> 0 < 2 & ($12_1 | 0) <= 0 | ($12_1 | 0) < 0 | ($15_1 >>> 0 < 2 & ($14 | 0) <= 0 | ($14 | 0) < 0)) { break block9 } while (1) { $12_1 = $8_1 + $17_1 | 0; $13_1 = $11_1 + $16_1 | 0; $12_1 = $13_1 >>> 0 < $16_1 >>> 0 ? $12_1 + 1 | 0 : $12_1; block14 : { while (1) { block11 : { if (!(($10_1 | 0) == ($13_1 | 0) & ($7_1 | 0) == ($12_1 | 0))) { if (($7_1 | 0) <= ($8_1 | 0) & $10_1 >>> 0 <= $11_1 >>> 0 | ($7_1 | 0) < ($8_1 | 0) | $3 | ($10_1 >>> 0 > $13_1 >>> 0 & ($7_1 | 0) >= ($12_1 | 0) | ($7_1 | 0) > ($12_1 | 0))) { break block11 } } $14 = $6_1 + 44 | 0; $15_1 = $6_1 + 16 | 0; $1_1 = $2_1 ? $8_1 : $7_1; $9_1 = ($2_1 ? $11_1 : $10_1) + 2 | 0; $1_1 = $9_1 >>> 0 < 2 ? $1_1 + 1 | 0 : $1_1; $1804($14, $15_1, $9_1, $1_1); $1_1 = HEAP32[$6_1 + 20 >> 2] - 1 | 0; $14 = HEAP32[$6_1 + 16 >> 2] - 2 | 0; $1_1 = $14 >>> 0 < 4294967294 ? $1_1 + 1 | 0 : $1_1; HEAP32[$6_1 + 16 >> 2] = $14; HEAP32[$6_1 + 20 >> 2] = $1_1; $9_1 = 0; } if (!(!(($7_1 | 0) <= ($8_1 | 0) & $10_1 >>> 0 <= $11_1 >>> 0 | ($7_1 | 0) < ($8_1 | 0)) & ($10_1 >>> 0 > $13_1 >>> 0 & ($7_1 | 0) >= ($12_1 | 0) | ($7_1 | 0) > ($12_1 | 0) | $18_1))) { if (HEAPU8[HEAP32[$6_1 + 36 >> 2]] < 2) { break block14 } $1803($6_1 + 36 | 0, $6_1); $7_1 = HEAP32[$6_1 + 4 >> 2] - 1 | 0; $10_1 = HEAP32[$6_1 >> 2] - 2 | 0; $7_1 = $10_1 >>> 0 < 4294967294 ? $7_1 + 1 | 0 : $7_1; HEAP32[$6_1 >> 2] = $10_1; HEAP32[$6_1 + 4 >> 2] = $7_1; continue; } break; }; if (HEAPU8[HEAP32[$6_1 + 40 >> 2]] < 2) { break block14 } $1803($6_1 + 40 | 0, $6_1 + 8 | 0); $1_1 = HEAP32[$6_1 + 12 >> 2] - 1 | 0; $11_1 = HEAP32[$6_1 + 8 >> 2] - 2 | 0; $1_1 = $11_1 >>> 0 < 4294967294 ? $1_1 + 1 | 0 : $1_1; HEAP32[$6_1 + 8 >> 2] = $11_1; $8_1 = $1_1; HEAP32[$6_1 + 12 >> 2] = $1_1; continue; } break; }; if ($9_1) { HEAP32[$6_1 + 44 >> 2] = $9_1 } $1701(0, $6_1 + 40 | 0); $1701(0, $6_1 + 36 | 0); $1_1 = HEAP32[$6_1 + 40 >> 2]; if (!HEAPU8[$1_1 | 0]) { break block9 } $7_1 = HEAP32[$6_1 + 36 >> 2]; if (!HEAPU8[$7_1 | 0]) { break block9 } $8_1 = $1_1 + 1 | 0; $1_1 = HEAP8[$1_1 + 1 | 0]; block17 : { if (($1_1 | 0) < 0) { $1_1 = $1681($8_1, $6_1 + 32 | 0); break block17; } HEAP32[$6_1 + 32 >> 2] = $1_1; $1_1 = 1; } HEAP32[$6_1 + 40 >> 2] = $1_1 + $8_1; $1_1 = $7_1 + 1 | 0; $7_1 = HEAP8[$7_1 + 1 | 0]; block19 : { if (($7_1 | 0) < 0) { $8_1 = $1681($1_1, $6_1 + 28 | 0); break block19; } HEAP32[$6_1 + 28 >> 2] = $7_1; $8_1 = 1; } HEAP32[$6_1 + 36 >> 2] = $8_1 + $1_1; break block20; } if (($7_1 | 0) > ($9_1 | 0)) { $1701(0, $6_1 + 40 | 0); $1_1 = HEAP32[$6_1 + 40 >> 2]; if (!HEAPU8[$1_1 | 0]) { break block9 } $7_1 = $1_1 + 1 | 0; $1_1 = HEAP8[$1_1 + 1 | 0]; block23 : { if (($1_1 | 0) < 0) { $1_1 = $1681($7_1, $6_1 + 32 | 0); break block23; } HEAP32[$6_1 + 32 >> 2] = $1_1; $1_1 = 1; } HEAP32[$6_1 + 40 >> 2] = $1_1 + $7_1; break block20; } $1701(0, $6_1 + 36 | 0); $1_1 = HEAP32[$6_1 + 36 >> 2]; if (!HEAPU8[$1_1 | 0]) { break block9 } $7_1 = $1_1 + 1 | 0; $1_1 = HEAP8[$1_1 + 1 | 0]; block25 : { if (($1_1 | 0) < 0) { $1_1 = $1681($7_1, $6_1 + 28 | 0); break block25; } HEAP32[$6_1 + 28 >> 2] = $1_1; $1_1 = 1; } HEAP32[$6_1 + 36 >> 2] = $1_1 + $7_1; } $7_1 = HEAP32[$6_1 + 28 >> 2]; $9_1 = HEAP32[$6_1 + 32 >> 2]; continue; } break; }; $1703(0, $6_1 + 36 | 0); $1703(0, $6_1 + 40 | 0); HEAP32[$4_1 >> 2] = HEAP32[$6_1 + 40 >> 2]; HEAP32[$5_1 >> 2] = HEAP32[$6_1 + 36 >> 2]; $1_1 = HEAP32[$6_1 + 44 >> 2]; $9_1 = 0; if (($1_1 | 0) == HEAP32[$0_1 >> 2]) { break block26 } HEAP8[$1_1 | 0] = 0; HEAP32[$0_1 >> 2] = $1_1 + 1; $9_1 = 1; break block26; } $9_1 = 0; } $0_1 = $6_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $9_1; } function $1801($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 48 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; HEAP32[$3 + 44 >> 2] = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$1_1 >> 2]; HEAP32[$3 + 40 >> 2] = $6_1; HEAP32[$3 + 36 >> 2] = HEAP32[$2_1 >> 2]; while (1) { block9 : { block16 : { block10 : { block12 : { block1 : { block5 : { block7 : { $5_1 = HEAPU8[$6_1 | 0]; block4 : { block2 : { if (!$5_1) { $4_1 = HEAP32[$3 + 36 >> 2]; if (!HEAPU8[$4_1 | 0]) { break block1 } $4_1 = 2147483647; break block2; } $4_1 = 0; if (($5_1 | 0) != 1) { break block2 } $4_1 = HEAP8[$6_1 + 1 | 0]; if (($4_1 | 0) < 0) { $1681($6_1 + 1 | 0, $3 + 32 | 0); $4_1 = HEAP32[$3 + 32 >> 2]; } if (!$4_1) { break block4 } } $5_1 = 2147483647; block6 : { $7_1 = HEAP32[$3 + 36 >> 2]; switch (HEAPU8[$7_1 | 0]) { case 0: break block5; case 1: break block6; default: break block7; }; } $5_1 = HEAP8[$7_1 + 1 | 0]; if (($5_1 | 0) < 0) { $1681($7_1 + 1 | 0, $3 + 28 | 0); $5_1 = HEAP32[$3 + 28 >> 2]; } if ($5_1) { break block5 } } $5_1 = 267; break block9; } $5_1 = 0; } if (($4_1 | 0) != ($5_1 | 0)) { break block10 } HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $4_1 = $1802($3 + 44 | 0, $4_1); HEAP32[$3 + 36 >> 2] = $4_1 + $7_1; HEAP32[$3 + 40 >> 2] = $4_1 + $6_1; $1803($3 + 40 | 0, $3 + 16 | 0); $1803($3 + 36 | 0, $3 + 8 | 0); $4_1 = HEAP32[$3 + 20 >> 2]; $7_1 = $4_1; $5_1 = HEAP32[$3 + 16 >> 2]; if (!($5_1 >>> 0 < 2 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0)) { $4_1 = HEAP32[$3 + 8 >> 2]; $6_1 = HEAP32[$3 + 12 >> 2]; if ($4_1 >>> 0 > 1 & ($6_1 | 0) >= 0 | ($6_1 | 0) > 0) { break block12 } } $4_1 = HEAP32[$3 + 36 >> 2]; $6_1 = HEAP32[$3 + 40 >> 2]; } $7_1 = HEAP32[$3 + 44 >> 2]; HEAP32[$3 + 44 >> 2] = $7_1 + 1; $5_1 = 0; HEAP8[$7_1 | 0] = 0; HEAP32[$0_1 >> 2] = HEAP32[$3 + 44 >> 2]; HEAP32[$1_1 >> 2] = $6_1 + 1; HEAP32[$2_1 >> 2] = $4_1 + 1; break block9; } while (1) { $8_1 = $4_1 >>> 0 > $5_1 >>> 0 & ($6_1 | 0) >= ($7_1 | 0) | ($6_1 | 0) > ($7_1 | 0); $1804($3 + 44 | 0, $3, $8_1 ? $5_1 : $4_1, $8_1 ? $7_1 : $6_1); $8_1 = HEAP32[$3 + 4 >> 2] - 1 | 0; $9_1 = HEAP32[$3 >> 2] - 2 | 0; $8_1 = $9_1 >>> 0 < 4294967294 ? $8_1 + 1 | 0 : $8_1; HEAP32[$3 >> 2] = $9_1; HEAP32[$3 + 4 >> 2] = $8_1; block14 : { if (!(($4_1 | 0) != ($5_1 | 0) | ($6_1 | 0) != ($7_1 | 0))) { $1805($3 + 40 | 0, $3 + 16 | 0); $1805($3 + 36 | 0, $3 + 8 | 0); break block14; } if (!(($6_1 | 0) <= ($7_1 | 0) & $4_1 >>> 0 <= $5_1 >>> 0 | ($6_1 | 0) < ($7_1 | 0))) { $1805($3 + 40 | 0, $3 + 16 | 0); break block14; } $1805($3 + 36 | 0, $3 + 8 | 0); } $5_1 = HEAP32[$3 + 16 >> 2]; $7_1 = HEAP32[$3 + 20 >> 2]; $4_1 = HEAP32[$3 + 8 >> 2]; $6_1 = HEAP32[$3 + 12 >> 2]; if (($5_1 | 0) != -1 | ($7_1 | 0) != 2147483647 | (($4_1 | 0) != -1 | ($6_1 | 0) != 2147483647)) { continue } break; }; break block16; } if (($4_1 | 0) < ($5_1 | 0)) { $5_1 = $3 + 44 | 0; HEAP32[$3 + 40 >> 2] = $1802($5_1, $4_1) + $6_1; $1701($5_1, $3 + 40 | 0); break block16; } $4_1 = $3 + 44 | 0; HEAP32[$3 + 36 >> 2] = $1802($4_1, $5_1) + $7_1; $1701($4_1, $3 + 36 | 0); } $6_1 = HEAP32[$3 + 40 >> 2]; continue; } break; }; $0_1 = $3 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1802($0_1, $1_1) { var $2_1 = 0, $3 = 0; if (!$1_1) { return 0 } $2_1 = HEAP32[$0_1 >> 2]; $1_1 = $1700($2_1 + 1 | 0, $1_1, $1_1 >> 31); HEAP8[$2_1 | 0] = 1; $3 = $0_1; $0_1 = $1_1 + 1 | 0; HEAP32[$3 >> 2] = $0_1 + $2_1; return $0_1; } function $1803($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$0_1 >> 2] = $1668(HEAP32[$0_1 >> 2], $2_1 + 8 | 0) + HEAP32[$0_1 >> 2]; $0_1 = HEAP32[$1_1 + 4 >> 2] + HEAP32[$2_1 + 12 >> 2] | 0; $3 = HEAP32[$2_1 + 8 >> 2]; $4_1 = $3 + HEAP32[$1_1 >> 2] | 0; HEAP32[$1_1 >> 2] = $4_1; HEAP32[$1_1 + 4 >> 2] = $3 >>> 0 > $4_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1804($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = HEAP32[$1_1 >> 2]; HEAP32[$0_1 >> 2] = $1700(HEAP32[$0_1 >> 2], $2_1 - $4_1 | 0, $3 - (HEAP32[$1_1 + 4 >> 2] + ($2_1 >>> 0 < $4_1 >>> 0) | 0) | 0) + HEAP32[$0_1 >> 2]; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $3; } function $1805($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$0_1 >> 2]; $2_1 = HEAPU8[$4_1 | 0]; block3 : { if ($2_1 >>> 0 >= 2) { block2 : { if ($2_1 << 24 >> 24 < 0) { $5_1 = $1681($4_1, $3 + 12 | 0); $2_1 = HEAP32[$3 + 12 >> 2]; break block2; } $5_1 = 1; } HEAP32[$0_1 >> 2] = $4_1 + $5_1; $5_1 = HEAP32[$1_1 >> 2]; $4_1 = $5_1 + $2_1 | 0; $0_1 = HEAP32[$1_1 + 4 >> 2] + ($2_1 >> 31) | 0; $0_1 = ($4_1 >>> 0 < $5_1 >>> 0 ? $0_1 + 1 | 0 : $0_1) - 1 | 0; $2_1 = $4_1 - 2 | 0; $0_1 = $2_1 >>> 0 < 4294967294 ? $0_1 + 1 | 0 : $0_1; HEAP32[$1_1 >> 2] = $2_1; HEAP32[$1_1 + 4 >> 2] = $0_1; break block3; } HEAP32[$1_1 >> 2] = -1; HEAP32[$1_1 + 4 >> 2] = 2147483647; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1806($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $6_1 = global$0 - 16 | 0; $8_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $8_1; block3 : { block : { $10_1 = HEAP32[$1_1 + 8 >> 2]; if (!$10_1) { break block } $12_1 = HEAPU8[$0_1 + 239 | 0] ? 108 : 109; $9_1 = HEAP32[$1_1 >> 2]; $7_1 = $9_1; while (1) { if (!HEAP32[HEAP32[$7_1 >> 2] + 80 >> 2]) { break block } $5_1 = HEAP32[$9_1 >> 2]; $8_1 = HEAP32[$5_1 + 88 >> 2]; $11_1 = HEAP32[$5_1 + 92 >> 2]; $7_1 = 1; $5_1 = $1696($0_1, $5_1, $6_1 + 12 | 0, $6_1 + 8 | 0); block2 : { while (1) { if (!(($7_1 | 0) >= ($10_1 | 0) | $5_1)) { $5_1 = HEAP32[($7_1 << 2) + $9_1 >> 2]; if (!HEAP32[$5_1 + 80 >> 2] | (HEAP32[$5_1 + 88 >> 2] != ($8_1 | 0) | ($11_1 | 0) != HEAP32[$5_1 + 92 >> 2])) { break block2 } $7_1 = $7_1 + 1 | 0; $5_1 = $1696($0_1, $5_1, 0, 0); continue; } break; }; if ($5_1) { break block3 } } $1689(HEAP32[$1_1 >> 2], $10_1, $7_1, $12_1); $7_1 = HEAP32[$6_1 + 8 >> 2]; if (!(!HEAP32[HEAP32[$9_1 >> 2] + 56 >> 2] | ($7_1 | 0) <= 0)) { $5_1 = $1694($1_1, HEAP32[$6_1 + 12 >> 2], $7_1 + 1 | 0, 0); if ($5_1) { break block3 } HEAP32[$6_1 + 12 >> 2] = HEAP32[$1_1 + 16 >> 2]; } $5_1 = HEAP32[$1_1 + 32 >> 2]; if (($5_1 | 0) >= 0) { $1698($5_1, 1, $6_1 + 12 | 0, $6_1 + 8 | 0); $7_1 = HEAP32[$6_1 + 8 >> 2]; } if (($7_1 | 0) > 0) { HEAP32[$3 >> 2] = HEAP32[$6_1 + 12 >> 2]; HEAP32[$2_1 >> 2] = $8_1; HEAP32[$2_1 + 4 >> 2] = $11_1; HEAP32[$4_1 >> 2] = $7_1; $5_1 = 0; break block3; } else { $7_1 = HEAP32[$1_1 >> 2]; continue; } }; } $5_1 = 0; HEAP32[$3 >> 2] = 0; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1807($0_1, $1_1, $2_1, $3, $4_1) { block3 : { block1 : { if (($2_1 | 0) == HEAP32[$1_1 + 44 >> 2]) { $1808($0_1, $1_1, $4_1); HEAP32[$3 + 16 >> 2] = HEAP32[$1_1 + 28 >> 2]; HEAP32[$3 + 20 >> 2] = HEAP32[$1_1 + 32 >> 2]; $0_1 = HEAP32[$1_1 + 20 >> 2]; HEAP32[$3 + 8 >> 2] = HEAP32[$1_1 + 16 >> 2]; HEAP32[$3 + 12 >> 2] = $0_1; break block1; } $1_1 = HEAP32[(Math_imul($2_1, 24) + $1_1 | 0) + 92 >> 2]; if ($1_1) { $1_1 = $1806($0_1, $1_1, $3 + 8 | 0, $3 + 16 | 0, $3 + 20 | 0); if (HEAP32[$3 + 16 >> 2]) { break block3 } HEAP8[$4_1 | 0] = 1; return $1_1; } HEAP32[$3 >> 2] = 1; } $1_1 = 0; } return $1_1; } function $1808($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $5_1 = HEAP32[$1_1 >> 2]; block3 : { block2 : { $3 = HEAP32[$1_1 + 8 >> 2]; block1 : { if (!$3) { $3 = $5_1; if (!$3) { break block1 } } $5_1 = $5_1 + HEAP32[$1_1 + 4 >> 2] | 0; if ($5_1 >>> 0 > $3 >>> 0) { break block2 } } HEAP8[$2_1 | 0] = 1; break block3; } $7_1 = $1668($3, $4_1) + $3 | 0; HEAP32[$4_1 + 12 >> 2] = $7_1; block6 : { if (HEAP32[$1_1 + 8 >> 2] ? !HEAPU8[$0_1 + 239 | 0] : 1) { $0_1 = HEAP32[$1_1 + 20 >> 2] + HEAP32[$4_1 + 4 >> 2] | 0; $6_1 = HEAP32[$4_1 >> 2]; $3 = $6_1 + HEAP32[$1_1 + 16 >> 2] | 0; HEAP32[$1_1 + 16 >> 2] = $3; HEAP32[$1_1 + 20 >> 2] = $3 >>> 0 < $6_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; break block6; } $0_1 = HEAP32[$1_1 + 16 >> 2]; $3 = HEAP32[$4_1 >> 2]; $6_1 = $0_1 - $3 | 0; $0_1 = HEAP32[$1_1 + 20 >> 2] - (HEAP32[$4_1 + 4 >> 2] + ($0_1 >>> 0 < $3 >>> 0) | 0) | 0; HEAP32[$1_1 + 16 >> 2] = $6_1; HEAP32[$1_1 + 20 >> 2] = $0_1; } HEAP32[$1_1 + 28 >> 2] = $7_1; $1703(0, $4_1 + 12 | 0); $3 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$1_1 + 32 >> 2] = $3 - HEAP32[$1_1 + 28 >> 2]; while (1) { if (!(HEAPU8[$3 | 0] | $3 >>> 0 >= $5_1 >>> 0)) { $3 = $3 + 1 | 0; continue; } break; }; HEAP32[$1_1 + 8 >> 2] = $3; HEAP8[$2_1 | 0] = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1809($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $9_1 = global$0 - 16 | 0; $10_1 = $9_1; if (global$4 >>> 0 < $9_1 >>> 0 | global$5 >>> 0 > $9_1 >>> 0) { fimport$30($9_1 | 0) } global$0 = $10_1; $8_1 = HEAP32[$0_1 >> 2]; HEAP32[$9_1 + 12 >> 2] = $8_1; $10_1 = $1_1; $11_1 = $2_1; block2 : { block1 : { if ($8_1) { $11_1 = HEAP32[$8_1 + 16 >> 2]; $12_1 = HEAP32[$8_1 + 20 >> 2]; if (($11_1 | 0) == ($1_1 | 0) & ($12_1 | 0) == ($2_1 | 0)) { break block1 } HEAP32[$8_1 >> 2] = HEAP32[$8_1 >> 2] + 1; $10_1 = $1_1 - $11_1 | 0; $11_1 = $2_1 - (($1_1 >>> 0 < $11_1 >>> 0) + $12_1 | 0) | 0; } $10_1 = $1810($9_1 + 12 | 0, $10_1, $11_1); $8_1 = HEAP32[$9_1 + 12 >> 2]; if ($10_1) { break block2 } HEAP32[$8_1 + 32 >> 2] = 0; HEAP32[$8_1 + 36 >> 2] = 0; HEAP32[$8_1 + 24 >> 2] = -1; HEAP32[$8_1 + 28 >> 2] = -1; HEAP32[$8_1 + 16 >> 2] = $1_1; HEAP32[$8_1 + 20 >> 2] = $2_1; } block6 : { block4 : { if (!(!$3 & ($4_1 | 0) <= 0 | ($4_1 | 0) < 0)) { if (($3 | 0) == HEAP32[$8_1 + 24 >> 2] & ($4_1 | 0) == HEAP32[$8_1 + 28 >> 2]) { break block4 } $10_1 = $1810($9_1 + 12 | 0, 1, 0); if ($10_1) { $8_1 = HEAP32[$9_1 + 12 >> 2]; break block2; } $10_1 = $1810($9_1 + 12 | 0, $3, $4_1); $8_1 = HEAP32[$9_1 + 12 >> 2]; if ($10_1) { break block2 } HEAP32[$8_1 + 32 >> 2] = 0; HEAP32[$8_1 + 36 >> 2] = 0; HEAP32[$8_1 + 24 >> 2] = $3; HEAP32[$8_1 + 28 >> 2] = $4_1; break block4; } if (($4_1 | 0) < 0) { break block6 } } $2_1 = $9_1 + 12 | 0; $1_1 = HEAP32[$8_1 + 32 >> 2]; $3 = $5_1 - $1_1 | 0; $1_1 = $6_1 - (HEAP32[$8_1 + 36 >> 2] + ($1_1 >>> 0 > $5_1 >>> 0) | 0) | 0; $3 = $3 + 2 | 0; $1_1 = $3 >>> 0 < 2 ? $1_1 + 1 | 0 : $1_1; $10_1 = $1810($2_1, $3, $1_1); $8_1 = HEAP32[$9_1 + 12 >> 2]; if ($10_1) { break block2 } HEAP32[$8_1 + 32 >> 2] = $5_1; HEAP32[$8_1 + 36 >> 2] = $6_1; } $10_1 = 0; } HEAP32[$7_1 >> 2] = $10_1; if (($8_1 | 0) == HEAP32[$0_1 >> 2]) { $8_1 = 0 } else { HEAP32[$0_1 >> 2] = $8_1; $8_1 = 1; } $0_1 = $9_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1; } function $1810($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = HEAP32[$0_1 >> 2]; block5 : { block2 : { if (!$3) { $3 = $31(140, 0); if (!$3) { return 7 } HEAP32[$3 + 8 >> 2] = 100; HEAP32[$3 >> 2] = 0; $4_1 = $3 + 40 | 0; HEAP32[$3 + 4 >> 2] = $4_1; break block2; } $4_1 = HEAP32[$3 + 8 >> 2]; $5_1 = HEAP32[$3 >> 2]; if (($4_1 | 0) >= ($5_1 + 11 | 0)) { $4_1 = HEAP32[$3 + 4 >> 2]; break block2; } $6_1 = $4_1 << 1; $5_1 = $6_1 >> 31; $4_1 = $6_1 + 40 | 0; $5_1 = $4_1 >>> 0 < 40 ? $5_1 + 1 | 0 : $5_1; $3 = $34($3, $4_1, $5_1); if (!$3) { $24(HEAP32[$0_1 >> 2]); $3 = 0; $5_1 = 7; break block5; } HEAP32[$3 + 8 >> 2] = $6_1; $4_1 = $3 + 40 | 0; HEAP32[$3 + 4 >> 2] = $4_1; $5_1 = HEAP32[$3 >> 2]; } $1_1 = $1700($5_1 + $4_1 | 0, $1_1, $2_1) + HEAP32[$3 >> 2] | 0; HEAP32[$3 >> 2] = $1_1; HEAP8[$1_1 + HEAP32[$3 + 4 >> 2] | 0] = 0; $5_1 = 0; } HEAP32[$0_1 >> 2] = $3; return $5_1; } function $1811($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; $6_1 = global$0 - 16 | 0; $4_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $4_1; block : { block6 : { while (1) { $4_1 = HEAP32[$2_1 >> 2]; $3 = ($4_1 | 0) != 0; if ($4_1) { break block } block4 : { switch (HEAP32[$1_1 >> 2] - 1 | 0) { case 0: case 2: block5 : { if (!$1811($0_1, HEAP32[$1_1 + 12 >> 2], $2_1)) { break block5 } if (!$1811($0_1, HEAP32[$1_1 + 16 >> 2], $2_1)) { break block5 } if (HEAP32[$2_1 >> 2]) { break block6 } $3 = 1; if (HEAP32[$1_1 >> 2] != 1) { break block } $4_1 = HEAP32[$1_1 + 8 >> 2]; if ($4_1) { if (HEAP32[$4_1 >> 2] == 1) { break block } } $3 = 0; $4_1 = $1_1; while (1) { $7_1 = HEAP32[$4_1 + 12 >> 2]; if ($7_1) { $4_1 = HEAP32[HEAP32[HEAP32[$4_1 + 16 >> 2] + 20 >> 2] + 32 >> 2]; $3 = $4_1 + $3 | 0; $8_1 = ($4_1 >> 31) + $8_1 | 0; $8_1 = $3 >>> 0 < $4_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $4_1 = $7_1; continue; } break; }; $7_1 = $3; $3 = HEAP32[HEAP32[$4_1 + 20 >> 2] + 32 >> 2]; $5_1 = $3; $7_1 = $7_1 + $5_1 | 0; $3 = ($5_1 >> 31) + $8_1 | 0; $3 = ($5_1 >>> 0 > $7_1 >>> 0 ? $3 + 1 | 0 : $3) << 1 | $7_1 >>> 31; $8_1 = ($7_1 << 1) + 10 | 0; $3 = $8_1 >>> 0 < 10 ? $3 + 1 | 0 : $3; $8_1 = $31($8_1, $3); if (!$8_1) { HEAP32[$2_1 >> 2] = 7; $24(0); break block5; } $2_1 = HEAP32[$4_1 + 20 >> 2]; HEAP32[$6_1 + 8 >> 2] = HEAP32[$2_1 + 28 >> 2]; HEAP32[$6_1 + 4 >> 2] = HEAP32[$2_1 + 64 >> 2]; $3 = 1; while (1) { block10 : { if (!$3) { break block10 } $4_1 = HEAP32[$4_1 + 8 >> 2]; if (!$4_1 | HEAP32[$4_1 >> 2] != 1) { break block10 } $3 = $1812(HEAP32[$4_1 + 4 >> 2], $8_1, $6_1 + 8 | 0, $6_1 + 4 | 0, HEAP32[HEAP32[$4_1 + 16 >> 2] + 20 >> 2]); continue; } break; }; $2_1 = HEAP32[HEAP32[$1_1 + 16 >> 2] + 20 >> 2]; HEAP32[$6_1 + 8 >> 2] = HEAP32[$2_1 + 28 >> 2]; HEAP32[$6_1 + 4 >> 2] = HEAP32[$2_1 + 64 >> 2]; $2_1 = $1_1; while (1) { $2_1 = HEAP32[$2_1 + 12 >> 2]; if (!(!$2_1 | !$3)) { $3 = HEAP32[HEAP32[$2_1 + 8 >> 2] + 4 >> 2]; $7_1 = $6_1 + 8 | 0; $5_1 = $6_1 + 4 | 0; $4_1 = $2_1; if (HEAP32[$4_1 >> 2] == 1) { $4_1 = HEAP32[$4_1 + 16 >> 2] } $3 = $1812($3, $8_1, $7_1, $5_1, HEAP32[$4_1 + 20 >> 2]); continue; } break; }; $24($8_1); if ($3) { break block6 } } $3 = 0; if (HEAP32[$1_1 >> 2] != 1) { break block } $2_1 = HEAP32[$1_1 + 8 >> 2]; if (!!$2_1 & HEAP32[$2_1 >> 2] == 1) { break block } while (1) { $2_1 = HEAP32[$1_1 + 20 >> 2]; if (!$2_1) { $2_1 = HEAP32[$1_1 + 16 >> 2]; if (!(HEAP32[$2_1 + 24 >> 2] != HEAP32[$0_1 + 32 >> 2] | HEAP32[$2_1 + 28 >> 2] != HEAP32[$0_1 + 36 >> 2])) { $1786(HEAP32[$2_1 + 20 >> 2]) } $1_1 = HEAP32[$1_1 + 12 >> 2]; continue; } break; }; if (HEAP32[$1_1 + 24 >> 2] != HEAP32[$0_1 + 32 >> 2] | HEAP32[$1_1 + 28 >> 2] != HEAP32[$0_1 + 36 >> 2]) { break block } $1786($2_1); break block; case 3: $3 = ($1811($0_1, HEAP32[$1_1 + 12 >> 2], $2_1) | $1811($0_1, HEAP32[$1_1 + 16 >> 2], $2_1)) != 0; break block; case 1: if (!$1811($0_1, HEAP32[$1_1 + 12 >> 2], $2_1)) { break block } $13_1 = $13_1 ^ 1; $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; default: break block4; }; } break; }; block18 : { block17 : { block16 : { if (!HEAP32[$0_1 + 28 >> 2]) { break block16 } if (HEAPU8[$1_1 + 34 | 0]) { break block17 } if (HEAP32[$1_1 + 24 >> 2] != HEAP32[$0_1 + 32 >> 2] | HEAP32[$1_1 + 28 >> 2] != HEAP32[$0_1 + 36 >> 2]) { break block16 } $5_1 = HEAP32[$1_1 + 20 >> 2]; if (HEAP32[$5_1 + 28 >> 2]) { break block18 } } $3 = 0; if (HEAPU8[$1_1 + 32 | 0] | (HEAP32[$1_1 + 24 >> 2] != HEAP32[$0_1 + 32 >> 2] | HEAP32[$1_1 + 28 >> 2] != HEAP32[$0_1 + 36 >> 2])) { break block } $3 = HEAP32[HEAP32[$1_1 + 20 >> 2] + 32 >> 2] > 0; break block; } $5_1 = HEAP32[$1_1 + 20 >> 2]; $1786($5_1); } $11_1 = HEAP32[$5_1 + 24 >> 2] ? HEAP32[$5_1 + 28 >> 2] : $11_1; $14 = $5_1 + 88 | 0; $8_1 = -1; $3 = 0; $4_1 = 0; block25 : { block24 : { block31 : { block28 : { while (1) { if (($4_1 | 0) < HEAP32[$5_1 + 64 >> 2]) { $10_1 = HEAP32[Math_imul($4_1, 24) + $14 >> 2]; if ($10_1) { block23 : { $7_1 = HEAP32[$10_1 + 12 >> 2]; if ($7_1) { $7_1 = HEAP32[$7_1 >> 2]; $7_1 = $31($7_1, $7_1 >> 31); if ($7_1) { break block23 } break block24; } $24($3); $24($11_1); HEAP32[$5_1 + 28 >> 2] = 0; HEAP32[$5_1 + 32 >> 2] = 0; $4_1 = 0; break block25; } $12_1 = $1668(HEAP32[HEAP32[$10_1 + 12 >> 2] + 4 >> 2], $6_1 + 8 | 0); $10_1 = HEAP32[$10_1 + 12 >> 2]; $9_1 = HEAP32[$10_1 >> 2] - $12_1 | 0; if ($9_1) { wasm2js_memory_copy($7_1, $12_1 + HEAP32[$10_1 + 4 >> 2] | 0, $9_1) } if ($3) { HEAP32[$6_1 + 8 >> 2] = $7_1; HEAP32[$6_1 + 4 >> 2] = $3; HEAP32[$6_1 >> 2] = $7_1; $1800($6_1 + 8 | 0, $4_1 - $8_1 | 0, 0, 1, $6_1 + 4 | 0, $6_1); $24($3); $9_1 = HEAP32[$6_1 + 8 >> 2] - $7_1 | 0; if (!$9_1) { break block28 } } $8_1 = $4_1; $3 = $7_1; } $4_1 = $4_1 + 1 | 0; continue; } break; }; $4_1 = 0; block29 : { if (($8_1 | 0) < 0) { break block29 } $7_1 = HEAP32[$5_1 + 44 >> 2]; if (($7_1 | 0) < 0) { HEAP32[$5_1 + 32 >> 2] = $9_1; HEAP32[$5_1 + 28 >> 2] = $3; $3 = HEAP32[$0_1 + 32 >> 2]; $8_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$5_1 + 24 >> 2] = 1; HEAP32[$5_1 + 16 >> 2] = $3; HEAP32[$5_1 + 20 >> 2] = $8_1; break block29; } $12_1 = HEAP32[$5_1 + 28 >> 2]; $10_1 = $8_1 >>> 0 < $7_1 >>> 0; HEAP32[$6_1 + 4 >> 2] = $10_1 ? $12_1 : $3; HEAP32[$6_1 + 8 >> 2] = $10_1 ? $3 : $12_1; $9_1 = $9_1 + 8 | 0; $9_1 = $1642($9_1, $9_1 >> 31); HEAP32[$6_1 >> 2] = $9_1; if (!$9_1) { break block31 } HEAP32[$5_1 + 28 >> 2] = $9_1; $9_1 = 0; block33 : { if ($1800($6_1, $10_1 ? $7_1 - $8_1 | 0 : $8_1 - $7_1 | 0, 0, 1, $6_1 + 8 | 0, $6_1 + 4 | 0)) { HEAP32[$5_1 + 24 >> 2] = 1; $9_1 = HEAP32[$6_1 >> 2] - HEAP32[$5_1 + 28 >> 2] | 0; break block33; } $24(HEAP32[$6_1 >> 2]); HEAP32[$5_1 + 28 >> 2] = 0; } HEAP32[$5_1 + 32 >> 2] = $9_1; $24($3); } if (HEAP32[$5_1 + 28 >> 2] == ($11_1 | 0)) { break block25 } $24($11_1); break block25; } $24($7_1); $24($11_1); HEAP32[$5_1 + 28 >> 2] = 0; HEAP32[$5_1 + 32 >> 2] = 0; $4_1 = 0; break block25; } $24($3); } $4_1 = 7; } HEAP32[$2_1 >> 2] = $4_1; $2_1 = HEAP32[$5_1 + 28 >> 2]; $4_1 = HEAP32[$0_1 + 36 >> 2]; HEAP32[$1_1 + 24 >> 2] = HEAP32[$0_1 + 32 >> 2]; HEAP32[$1_1 + 28 >> 2] = $4_1; $3 = ($2_1 | 0) != 0; break block; } $3 = 1; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3 ^ $13_1; } function $1812($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $5_1 = global$0 - 32 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $9_1 = HEAP32[$3 >> 2]; $6_1 = HEAP32[$4_1 + 64 >> 2]; $7_1 = HEAP32[$4_1 + 28 >> 2]; HEAP32[$5_1 + 12 >> 2] = $7_1; HEAP32[$5_1 + 8 >> 2] = $7_1; HEAP32[$5_1 + 28 >> 2] = $1_1; $10_1 = HEAP32[$2_1 >> 2]; HEAP32[$5_1 + 24 >> 2] = $1_1; $8_1 = $5_1 + 12 | 0; $1800($5_1 + 24 | 0, $0_1 + $6_1 | 0, 0, 0, $2_1, $8_1); $6_1 = HEAP32[$5_1 + 24 >> 2]; HEAP32[$5_1 + 20 >> 2] = $6_1; HEAP32[$5_1 + 16 >> 2] = $6_1; HEAP32[$2_1 >> 2] = $10_1; HEAP32[$5_1 + 12 >> 2] = $7_1; $1800($5_1 + 20 | 0, $0_1 + $9_1 | 0, 1, 0, $8_1, $2_1); $0_1 = HEAP32[$5_1 + 20 >> 2]; block4 : { block2 : { block1 : { if (($1_1 | 0) != ($6_1 | 0)) { if (($0_1 | 0) == ($6_1 | 0)) { break block1 } $1801($5_1 + 8 | 0, $5_1 + 28 | 0, $5_1 + 16 | 0); break block2; } if (($0_1 | 0) != ($1_1 | 0)) { $1703($5_1 + 8 | 0, $5_1 + 16 | 0); break block2; } $2_1 = 0; break block4; } $1703($5_1 + 8 | 0, $5_1 + 28 | 0); } $1_1 = HEAP32[$4_1 + 28 >> 2]; $0_1 = HEAP32[$5_1 + 8 >> 2] + ($1_1 ^ -1) | 0; block5 : { if (($0_1 | 0) < 0) { break block5 } $6_1 = HEAP32[$4_1 + 32 >> 2]; if (($6_1 | 0) < ($0_1 | 0)) { break block5 } $6_1 = $6_1 - $0_1 | 0; if ($6_1) { wasm2js_memory_fill($0_1 + $1_1 | 0, 0, $6_1) } HEAP32[$4_1 + 32 >> 2] = $0_1; $1_1 = HEAP32[$4_1 + 28 >> 2]; } HEAP32[$2_1 >> 2] = $1_1; HEAP32[$3 >> 2] = HEAP32[$4_1 + 64 >> 2]; $2_1 = 1; } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1813($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; if (!HEAP32[$0_1 >> 2]) { $3 = $1675($1_1, $2_1, $4_1 + 12 | 0, $3); if (!$3) { $1_1 = HEAP32[$4_1 + 12 >> 2]; $94($1_1); $3 = $96($1_1); } HEAP32[$0_1 >> 2] = $3; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1814($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $5_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $0_1 = 0; while (1) { if (!(($4_1 | 0) == ($5_1 | 0))) { $0_1 = $1700($0_1 + $2_1 | 0, HEAP32[($4_1 << 2) + $1_1 >> 2], 0) + $0_1 | 0; $4_1 = $4_1 + 1 | 0; continue; } break; }; HEAP32[$3 >> 2] = $0_1; } function $1815($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0; $10_1 = global$0 - 96 | 0; $4_1 = $10_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $6_1 = $1663($0_1, $1_1, $2_1, $3, 0, 0, 1, 0, $10_1 + 8 | 0); block : { if ($6_1) { break block } $13_1 = HEAP32[$10_1 + 12 >> 2]; if (!$13_1) { break block } block6 : { block2 : { if (($3 | 0) == -1) { $4_1 = $2_1; $9_1 = $4_1 >> 31; $11_1 = $1_1; $14 = $1_1 >> 31; break block2; } $6_1 = $1675($0_1, 15, $10_1 + 72 | 0, 0); if ($6_1) { break block } $5_1 = HEAP32[$10_1 + 72 >> 2]; $11_1 = $1_1; $4_1 = HEAP32[$0_1 + 260 >> 2]; $14 = $1_1 >> 31; $9_1 = __wasm_i64_mul($4_1, $4_1 >> 31, $1_1, $14); $4_1 = $2_1; $12_1 = $9_1 + $4_1 | 0; $9_1 = $4_1 >> 31; $7_1 = $9_1 + i64toi32_i32$HIGH_BITS | 0; $283($5_1, 1, $12_1 << 10, ($4_1 >>> 0 > $12_1 >>> 0 ? $7_1 + 1 | 0 : $7_1) << 10 | $12_1 >>> 22); $12_1 = HEAP32[$0_1 + 260 >> 2]; $12_1 = __wasm_i64_mul($12_1, $12_1 >> 31, $1_1, $14); $7_1 = $9_1 + i64toi32_i32$HIGH_BITS | 0; $12_1 = $4_1 + $12_1 | 0; $7_1 = $12_1 >>> 0 < $4_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; $283($5_1, 2, $12_1 << 10 | 1023, $7_1 << 10 | $12_1 >>> 22); $12_1 = 0; $15_1 = 0; if (($94($5_1) | 0) == 100) { $12_1 = $95($5_1, 0); $15_1 = i64toi32_i32$HIGH_BITS; } $6_1 = $96($5_1); if ($6_1) { break block } if (($3 | 0) != -2) { $21_1 = $12_1; $19_1 = $15_1; break block2; } $26_1 = 1; $6_1 = 3; if (($13_1 | 0) != 1) { $21_1 = $12_1; $19_1 = $15_1; break block6; } $21_1 = $12_1; $19_1 = $15_1; if (HEAP32[HEAP32[HEAP32[$10_1 + 8 >> 2] >> 2] + 56 >> 2]) { break block6 } $6_1 = 101; break block; } $5_1 = HEAP32[$0_1 + 260 >> 2]; $17_1 = $5_1 >> 31; $12_1 = $3 + 1 | 0; $16_1 = $12_1 >> 31; $6_1 = $1675($0_1, 8, $10_1 + 72 | 0, 0); block7 : { if ($6_1) { break block7 } $13_1 = HEAP32[$10_1 + 72 >> 2]; $15_1 = HEAP32[$0_1 + 260 >> 2]; $15_1 = __wasm_i64_mul($11_1, $14, $15_1, $15_1 >> 31); $8_1 = $9_1 + i64toi32_i32$HIGH_BITS | 0; $15_1 = $4_1 + $15_1 | 0; $7_1 = ($15_1 >>> 0 < $4_1 >>> 0 ? $8_1 + 1 | 0 : $8_1) << 10 | $15_1 >>> 22; $15_1 = $12_1 + ($15_1 << 10) | 0; $8_1 = $7_1 + $16_1 | 0; $283($13_1, 1, $15_1, $12_1 >>> 0 > $15_1 >>> 0 ? $8_1 + 1 | 0 : $8_1); $7_1 = 0; if (($94($13_1) | 0) == 100) { $7_1 = $98($13_1, 0) } $6_1 = $96($13_1); if ($6_1) { break block7 } $6_1 = 0; $22_1 = $7_1; if (($7_1 | 0) < 16) { break block7 } $22_1 = 0; $6_1 = $1815($0_1, $1_1, $2_1, $12_1); } if ($6_1) { break block } $11_1 = __wasm_i64_mul($11_1, $14, $5_1, $17_1); $9_1 = $9_1 + i64toi32_i32$HIGH_BITS | 0; $7_1 = $4_1; $4_1 = $4_1 + $11_1 | 0; $7_1 = ($7_1 >>> 0 > $4_1 >>> 0 ? $9_1 + 1 | 0 : $9_1) << 10 | $4_1 >>> 22; $4_1 = $12_1 + ($4_1 << 10) | 0; $7_1 = $7_1 + $16_1 | 0; $15_1 = $4_1 >>> 0 < $12_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; $12_1 = $4_1; $6_1 = ($3 | 0) == -1 ? 1 : ($19_1 | 0) >= ($15_1 | 0) & $21_1 >>> 0 >= $4_1 >>> 0 | ($15_1 | 0) < ($19_1 | 0) ? 1 : 3; } HEAP32[$10_1 + 80 >> 2] = 0; HEAP32[$10_1 + 72 >> 2] = 0; HEAP32[$10_1 + 76 >> 2] = 0; HEAP32[$10_1 + 84 >> 2] = $6_1; $6_1 = $1664($0_1, $10_1 + 8 | 0, $10_1 + 72 | 0); $5_1 = 0; block31 : { block9 : { block25 : { block11 : { while (1) { if ($6_1) { break block9 } block12 : { $6_1 = $1666($0_1, $10_1 + 8 | 0); if (($6_1 | 0) != 100) { if ($6_1) { break block9 } if (($3 | 0) == -1) { break block11 } $4_1 = HEAP32[$10_1 + 12 >> 2]; $9_1 = HEAP32[$10_1 + 8 >> 2]; $6_1 = 0; HEAP32[$10_1 + 92 >> 2] = 0; $7_1 = 0; while (1) { if (($4_1 | 0) <= ($7_1 | 0) | $6_1) { break block12 } $6_1 = $1816($0_1, HEAP32[$9_1 + ($7_1 << 2) >> 2]); $7_1 = $7_1 + 1 | 0; continue; }; } $13_1 = HEAP32[$10_1 + 68 >> 2]; $18_1 = HEAP32[$10_1 + 64 >> 2]; $11_1 = HEAP32[$10_1 + 60 >> 2]; $20_1 = HEAP32[$10_1 + 56 >> 2]; if (!$5_1) { $6_1 = 7; $5_1 = $31(64, 0); if (!$5_1) { continue } wasm2js_memory_fill($5_1, 0, 64); $4_1 = HEAP32[$0_1 + 232 >> 2]; $4_1 = $31($4_1, $4_1 >> 31); HEAP32[$5_1 + 48 >> 2] = $4_1; if (!$4_1) { continue } HEAP32[$5_1 + 40 >> 2] = HEAP32[$0_1 + 232 >> 2]; $6_1 = $1675($0_1, 10, $10_1 + 92 | 0, 0); if ($6_1) { continue } $4_1 = HEAP32[$10_1 + 92 >> 2]; if (($94($4_1) | 0) == 100) { $9_1 = $95($4_1, 0); HEAP32[$5_1 + 8 >> 2] = $9_1; $7_1 = i64toi32_i32$HIGH_BITS; HEAP32[$5_1 + 12 >> 2] = $7_1; HEAP32[$5_1 + 16 >> 2] = $9_1; HEAP32[$5_1 + 20 >> 2] = $7_1; } $6_1 = $96($4_1); if ($6_1) { continue } } $16_1 = HEAP32[$5_1 + 44 >> 2]; $6_1 = 267; $17_1 = $1817(HEAP32[$5_1 + 24 >> 2], HEAP32[$5_1 + 28 >> 2], $20_1, $11_1); $14 = $11_1 - $17_1 | 0; if (($14 | 0) <= 0) { continue } $4_1 = $13_1 >> 31; $27 = $4_1; $9_1 = ($1699($17_1, $17_1 >> 31) + ($13_1 + $14 | 0) | 0) + $1699($14, 0) | 0; $7_1 = $1699($13_1, $4_1); $4_1 = $9_1 + $7_1 | 0; $9_1 = $4_1 >> 31; block16 : { if (($16_1 | 0) <= 0) { break block16 } $8_1 = $9_1; $23_1 = $4_1 + $16_1 | 0; $8_1 = $23_1 >>> 0 < $16_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $24_1 = HEAP32[$0_1 + 232 >> 2]; $25 = $24_1 >> 31; if (($8_1 | 0) <= ($25 | 0) & $23_1 >>> 0 <= $24_1 >>> 0 | ($8_1 | 0) < ($25 | 0)) { break block16 } $8_1 = HEAP32[$5_1 + 20 >> 2]; $9_1 = $8_1; $4_1 = HEAP32[$5_1 + 16 >> 2]; if (($4_1 | 0) == -1 & ($8_1 | 0) == 2147483647) { continue } $14 = $4_1 + 1 | 0; $8_1 = $14 ? $8_1 : $8_1 + 1 | 0; HEAP32[$5_1 + 16 >> 2] = $14; HEAP32[$5_1 + 20 >> 2] = $8_1; $6_1 = $1818($0_1, $4_1, $9_1, HEAP32[$5_1 + 48 >> 2], $16_1); if ($6_1) { continue } HEAP32[$0_1 + 52 >> 2] = HEAP32[$0_1 + 52 >> 2] + 1; $6_1 = $1819($0_1, $5_1, $20_1, $17_1 + 1 | 0); if ($6_1) { continue } $16_1 = 0; HEAP32[$5_1 + 28 >> 2] = 0; $4_1 = ($1699($11_1, $11_1 >> 31) + ($7_1 + ($11_1 + $13_1 | 0) | 0) | 0) + 1 | 0; $9_1 = $4_1 >> 31; $14 = $11_1; $17_1 = 0; } $7_1 = $9_1 + HEAP32[$5_1 + 60 >> 2] | 0; $8_1 = $4_1 + HEAP32[$5_1 + 56 >> 2] | 0; $7_1 = $8_1 >>> 0 < $4_1 >>> 0 ? $7_1 + 1 | 0 : $7_1; HEAP32[$5_1 + 56 >> 2] = $8_1; HEAP32[$5_1 + 60 >> 2] = $7_1; $7_1 = HEAP32[$5_1 + 48 >> 2]; $8_1 = HEAP32[$5_1 + 40 >> 2]; $6_1 = $8_1 >> 31; if (!(($6_1 | 0) >= ($9_1 | 0) & $4_1 >>> 0 <= $8_1 >>> 0 | ($6_1 | 0) > ($9_1 | 0))) { $6_1 = 7; $7_1 = $34($7_1, $4_1, $9_1); if (!$7_1) { continue } HEAP32[$5_1 + 40 >> 2] = $4_1; HEAP32[$5_1 + 48 >> 2] = $7_1; } $4_1 = $1700($7_1 + $16_1 | 0, $17_1, $17_1 >> 31) + $16_1 | 0; $4_1 = $1700($4_1 + HEAP32[$5_1 + 48 >> 2] | 0, $14, $14 >> 31) + $4_1 | 0; if ($14) { wasm2js_memory_copy($4_1 + HEAP32[$5_1 + 48 >> 2] | 0, $17_1 + $20_1 | 0, $14) } $4_1 = $4_1 + $14 | 0; $4_1 = $1700($4_1 + HEAP32[$5_1 + 48 >> 2] | 0, $13_1, $27) + $4_1 | 0; if ($13_1) { wasm2js_memory_copy($4_1 + HEAP32[$5_1 + 48 >> 2] | 0, $18_1, $13_1) } HEAP32[$5_1 + 44 >> 2] = $4_1 + $13_1; block21 : { if (HEAP32[$5_1 + 32 >> 2] >= ($11_1 | 0)) { $18_1 = HEAP32[$5_1 + 24 >> 2]; break block21; } $6_1 = 7; $8_1 = $11_1 << 1; $18_1 = $34(HEAP32[$5_1 + 36 >> 2], $8_1, $11_1 >> 31 << 1 | $11_1 >>> 31); if (!$18_1) { continue } HEAP32[$5_1 + 36 >> 2] = $18_1; HEAP32[$5_1 + 24 >> 2] = $18_1; HEAP32[$5_1 + 32 >> 2] = $8_1; } if ($11_1) { wasm2js_memory_copy($18_1, $20_1, $11_1) } HEAP32[$5_1 + 28 >> 2] = $11_1; $6_1 = 0; continue; } break; }; if ($6_1) { break block9 } block24 : { if ($26_1) { $6_1 = $1675($0_1, 26, $10_1 + 92 | 0, 0); if ($6_1) { break block9 } $6_1 = HEAP32[$10_1 + 92 >> 2]; $4_1 = HEAP32[$0_1 + 260 >> 2]; $9_1 = $4_1; $11_1 = $4_1 >> 31; $4_1 = $1_1; $7_1 = $4_1 >> 31; $1_1 = __wasm_i64_mul($9_1, $11_1, $4_1, $7_1) + $2_1 | 0; $13_1 = $2_1 >> 31; $9_1 = $13_1 + i64toi32_i32$HIGH_BITS | 0; $283($6_1, 1, $1_1 << 10, ($1_1 >>> 0 < $2_1 >>> 0 ? $9_1 + 1 | 0 : $9_1) << 10 | $1_1 >>> 22); $1_1 = HEAP32[$0_1 + 260 >> 2]; $1_1 = __wasm_i64_mul($1_1, $1_1 >> 31, $4_1, $7_1); $8_1 = $13_1 + i64toi32_i32$HIGH_BITS | 0; $1_1 = $1_1 + $2_1 | 0; $8_1 = $1_1 >>> 0 < $2_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $283($6_1, 2, $1_1 << 10 | 1023, $8_1 << 10 | $1_1 >>> 22); break block24; } $6_1 = $1675($0_1, 16, $10_1 + 92 | 0, 0); if ($6_1) { break block9 } $6_1 = HEAP32[$10_1 + 92 >> 2]; $4_1 = $6_1; $9_1 = HEAP32[$0_1 + 260 >> 2]; $1_1 = __wasm_i64_mul($9_1, $9_1 >> 31, $1_1, $1_1 >> 31) + $2_1 | 0; $9_1 = i64toi32_i32$HIGH_BITS + ($2_1 >> 31) | 0; $9_1 = ($1_1 >>> 0 < $2_1 >>> 0 ? $9_1 + 1 | 0 : $9_1) << 10 | $1_1 >>> 22; $1_1 = $3 + ($1_1 << 10) | 0; $8_1 = ($3 >> 31) + $9_1 | 0; $283($4_1, 1, $1_1, $1_1 >>> 0 < $3 >>> 0 ? $8_1 + 1 | 0 : $8_1); } $94($6_1); $6_1 = $96($6_1); if ($6_1 | !$5_1) { break block9 } break block25; } if ($5_1) { break block25 } $6_1 = 0; break block; } block27 : { if (HEAP32[$5_1 >> 2]) { $7_1 = HEAP32[$5_1 + 20 >> 2]; $17_1 = $7_1; $16_1 = HEAP32[$5_1 + 16 >> 2]; $1_1 = $16_1 + 1 | 0; $7_1 = $1_1 ? $7_1 : $7_1 + 1 | 0; HEAP32[$5_1 + 16 >> 2] = $1_1; HEAP32[$5_1 + 20 >> 2] = $7_1; $6_1 = $1818($0_1, $16_1, $17_1, HEAP32[$5_1 + 48 >> 2], HEAP32[$5_1 + 44 >> 2]); if ($6_1) { break block27 } $7_1 = HEAP32[$5_1 + 16 >> 2]; $13_1 = HEAP32[$5_1 + 20 >> 2]; $11_1 = HEAP32[$5_1 + 8 >> 2]; $14 = HEAP32[$5_1 + 12 >> 2]; $1_1 = $5_1; $2_1 = 1; while (1) { $1_1 = HEAP32[$1_1 >> 2]; if (HEAP32[$1_1 >> 2]) { $18_1 = $1_1 + 8 | 0; $6_1 = 0; $4_1 = $7_1; $9_1 = $13_1; while (1) { $8_1 = HEAP32[$18_1 >> 2]; if (!($6_1 | !$8_1)) { $18_1 = $8_1 + 4 | 0; $6_1 = $1820($8_1, $2_1, $11_1, $14); $6_1 = $1818($0_1, $4_1, $9_1, $6_1 + HEAP32[$8_1 + 36 >> 2] | 0, HEAP32[$8_1 + 32 >> 2] - $6_1 | 0); $8_1 = HEAP32[$8_1 + 12 >> 2] + 1 | 0; $20_1 = $8_1; $11_1 = $8_1 + $11_1 | 0; $8_1 = ($8_1 >> 31) + $14 | 0; $14 = $11_1 >>> 0 < $20_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $8_1 = $9_1; $4_1 = $4_1 + 1 | 0; $9_1 = $4_1 ? $8_1 : $8_1 + 1 | 0; continue; } break; }; if ($6_1) { break block27 } $2_1 = $2_1 + 1 | 0; $11_1 = $7_1; $14 = $13_1; $7_1 = $4_1; $13_1 = $9_1; continue; } break; }; $2_1 = $1820($1_1, $2_1, $11_1, $14); $4_1 = HEAP32[$5_1 + 8 >> 2]; $11_1 = HEAP32[$5_1 + 12 >> 2]; $9_1 = $13_1 - 1 | 0; $7_1 = $7_1 - 1 | 0; $9_1 = ($7_1 | 0) != -1 ? $9_1 + 1 | 0 : $9_1; $6_1 = $1821($0_1, $12_1, $15_1, $22_1, $4_1, $11_1, $16_1, $17_1, $7_1, $9_1, HEAP32[$5_1 + 56 >> 2], HEAP32[$5_1 + 60 >> 2], $2_1 + HEAP32[$1_1 + 36 >> 2] | 0, HEAP32[$1_1 + 32 >> 2] - $2_1 | 0); break block27; } $6_1 = $1821($0_1, $12_1, $15_1, $22_1, 0, 0, 0, 0, 0, 0, HEAP32[$5_1 + 56 >> 2], HEAP32[$5_1 + 60 >> 2], HEAP32[$5_1 + 48 >> 2], HEAP32[$5_1 + 44 >> 2]); } HEAP32[$0_1 + 52 >> 2] = HEAP32[$0_1 + 52 >> 2] + 1; if ($6_1) { break block9 } if (($3 | 0) != -1) { $6_1 = 0; if (($15_1 | 0) >= ($19_1 | 0) & $12_1 >>> 0 >= $21_1 >>> 0 | ($15_1 | 0) > ($19_1 | 0)) { break block9 } } $6_1 = $1822($0_1, $12_1, $15_1, HEAP32[$5_1 + 56 >> 2], HEAP32[$5_1 + 60 >> 2]); break block31; } if (!$5_1) { break block } } $24(HEAP32[$5_1 + 48 >> 2]); $24(HEAP32[$5_1 + 36 >> 2]); $1823(HEAP32[$5_1 >> 2]); $24($5_1); } $1661($10_1 + 8 | 0); $0_1 = $10_1 + 96 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1816($0_1, $1_1) { var $2_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { if (!(HEAP32[$1_1 + 8 >> 2] | HEAP32[$1_1 + 12 >> 2])) { $0_1 = 0; break block1; } $0_1 = $1675($0_1, 17, $2_1 + 12 | 0, 0); if ($0_1) { break block1 } $0_1 = HEAP32[$2_1 + 12 >> 2]; $283($0_1, 1, HEAP32[$1_1 + 8 >> 2], HEAP32[$1_1 + 12 >> 2]); $283($0_1, 2, HEAP32[$1_1 + 24 >> 2], HEAP32[$1_1 + 28 >> 2]); $94($0_1); $0_1 = $96($0_1); } $1_1 = $2_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1817($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $1_1 = ($1_1 | 0) < ($3 | 0) ? $1_1 : $3; $3 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { block1 : { if (($3 | 0) != ($4_1 | 0)) { if (HEAPU8[$0_1 + $4_1 | 0] == HEAPU8[$2_1 + $4_1 | 0]) { break block1 } $3 = $4_1; } return $3; } $4_1 = $4_1 + 1 | 0; continue; }; } function $1818($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0; $5_1 = global$0 - 16 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; $0_1 = $1675($0_1, 9, $5_1 + 12 | 0, 0); if (!$0_1) { $6_1 = HEAP32[$5_1 + 12 >> 2]; $283($6_1, 1, $1_1, $2_1); $278($6_1, 2, $3, $4_1, 0); $94($6_1); $0_1 = $96($6_1); $280($6_1, 1); } $1_1 = $5_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1819($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $7_1 = global$0 - 16 | 0; $4_1 = $7_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block3 : { block12 : { block10 : { block5 : { block1 : { $5_1 = HEAP32[$1_1 >> 2]; if (!$5_1) { $10_1 = HEAP32[$0_1 + 232 >> 2]; break block1; } $8_1 = HEAP32[$5_1 + 32 >> 2]; $9_1 = HEAP32[$5_1 + 16 >> 2]; $4_1 = $1817($9_1, HEAP32[$5_1 + 20 >> 2], $2_1, $3); $6_1 = $3 - $4_1 | 0; if (($6_1 | 0) <= 0) { $3 = 267; break block3; } $12_1 = $4_1 >> 31; $11_1 = ($1699($4_1, $12_1) + ($6_1 + $8_1 | 0) | 0) + $1699($6_1, 0) | 0; $10_1 = HEAP32[$0_1 + 232 >> 2]; if (($10_1 | 0) < ($11_1 | 0)) { if ($9_1) { break block1 } $0_1 = $31($11_1, $11_1 >> 31); HEAP32[$5_1 + 36 >> 2] = $0_1; if (!$0_1) { break block5 } $9_1 = HEAP32[$5_1 + 16 >> 2]; } if ($9_1) { $8_1 = $1700(HEAP32[$5_1 + 36 >> 2] + $8_1 | 0, $4_1, $12_1) + $8_1 | 0 } $0_1 = $1700(HEAP32[$5_1 + 36 >> 2] + $8_1 | 0, $6_1, 0) + $8_1 | 0; if ($6_1) { wasm2js_memory_copy($0_1 + HEAP32[$5_1 + 36 >> 2] | 0, $2_1 + $4_1 | 0, $6_1) } HEAP32[$5_1 + 32 >> 2] = $0_1 + $6_1; HEAP32[$5_1 + 12 >> 2] = HEAP32[$5_1 + 12 >> 2] + 1; $4_1 = HEAP32[$5_1 + 28 >> 2]; if (($3 | 0) > HEAP32[$5_1 + 24 >> 2]) { $0_1 = $3 << 1; $4_1 = $34($4_1, $0_1, $3 >> 31 << 1 | $3 >>> 31); if (!$4_1) { break block5 } HEAP32[$5_1 + 28 >> 2] = $4_1; HEAP32[$5_1 + 24 >> 2] = $0_1; } HEAP32[$5_1 + 16 >> 2] = $4_1; if ($3) { wasm2js_memory_copy($4_1, $2_1, $3) } HEAP32[$5_1 + 20 >> 2] = $3; $3 = 0; break block3; } $4_1 = $31($10_1 + 40 | 0, 0); HEAP32[$7_1 + 12 >> 2] = $4_1; if (!$4_1) { break block5 } HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; HEAP32[$4_1 + 32 >> 2] = 11; $6_1 = $4_1 + 24 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $4_1 + 16 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; $6_1 = $4_1 + 8 | 0; HEAP32[$6_1 >> 2] = 0; HEAP32[$6_1 + 4 >> 2] = 0; HEAP32[$4_1 + 36 >> 2] = $4_1 + 40; if (!$5_1) { break block10 } HEAP32[$7_1 + 8 >> 2] = HEAP32[$5_1 >> 2]; $3 = $1819($0_1, $7_1 + 8 | 0, $2_1, $3); $0_1 = HEAP32[$7_1 + 8 >> 2]; if (!HEAP32[$5_1 >> 2]) { HEAP32[$5_1 >> 2] = $0_1 } HEAP32[$5_1 + 4 >> 2] = $4_1; $2_1 = HEAP32[$5_1 + 8 >> 2]; HEAP32[$4_1 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = $2_1; HEAP32[$4_1 + 28 >> 2] = HEAP32[$5_1 + 28 >> 2]; HEAP32[$4_1 + 24 >> 2] = HEAP32[$5_1 + 24 >> 2]; HEAP32[$5_1 + 28 >> 2] = 0; break block12; } $3 = 7; break block3; } HEAP32[$4_1 + 8 >> 2] = $4_1; $3 = $1819($0_1, $7_1 + 12 | 0, $2_1, $3); $4_1 = HEAP32[$7_1 + 12 >> 2]; } HEAP32[$1_1 >> 2] = $4_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1820($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $6_1 = HEAP32[$0_1 + 36 >> 2]; $4_1 = $1699($2_1, $3); $5_1 = 10 - $4_1 | 0; HEAP8[$6_1 + $5_1 | 0] = $1_1; $1700((HEAP32[$0_1 + 36 >> 2] - $4_1 | 0) + 11 | 0, $2_1, $3); return $5_1; } function $1821($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1, $8_1, $9_1, $10_1, $11_1, $12_1, $13_1) { var $14 = 0, $15_1 = 0; $14 = global$0 - 32 | 0; if ($14 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $14 >>> 0) { fimport$30($14 | 0) } global$0 = $14; $15_1 = $1675($0_1, 11, $14 + 28 | 0, 0); block : { if ($15_1) { break block } $0_1 = HEAP32[$14 + 28 >> 2]; $283($0_1, 1, $1_1, $2_1); $282($0_1, 2, $3); $283($0_1, 3, $4_1, $5_1); $283($0_1, 4, $6_1, $7_1); block2 : { if (!($10_1 | $11_1)) { $283($0_1, 5, $8_1, $9_1); break block2; } HEAP32[$14 + 8 >> 2] = $10_1; HEAP32[$14 + 12 >> 2] = $11_1; HEAP32[$14 >> 2] = $8_1; HEAP32[$14 + 4 >> 2] = $9_1; $1_1 = $61(15067, $14); if (!$1_1) { $15_1 = 7; break block; } $285($0_1, 5, $1_1, -1, 1); } $278($0_1, 6, $12_1, $13_1, 0); $94($0_1); $15_1 = $96($0_1); $280($0_1, 5); } $0_1 = $14 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $15_1; } function $1822($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = global$0 - 32 | 0; $7_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $7_1; $5_1 = $1675($0_1, 37, $6_1 + 28 | 0, 0); block : { if ($5_1) { break block } $8_1 = HEAP32[$6_1 + 28 >> 2]; $7_1 = $2_1; $5_1 = $1_1 + 1 | 0; $7_1 = $5_1 ? $7_1 : $7_1 + 1 | 0; $283($8_1, 1, $5_1, $7_1); $7_1 = __wasm_i64_sdiv($1_1, $2_1, 1024, 0); $283($8_1, 2, $7_1 << 10 | 1023, i64toi32_i32$HIGH_BITS << 10 | $7_1 >>> 22); $4_1 = __wasm_i64_sdiv(__wasm_i64_mul($3, $4_1, 3, 0), i64toi32_i32$HIGH_BITS, 2, 0); $10_1 = i64toi32_i32$HIGH_BITS; while (1) { block1 : { $7_1 = $9_1; if (($94($8_1) | 0) != 100) { break block1 } HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; $1824($8_1, 2, $6_1 + 8 | 0, $6_1 + 16 | 0); $7_1 = 0; $9_1 = HEAP32[$6_1 + 20 >> 2]; $5_1 = $9_1; $3 = HEAP32[$6_1 + 16 >> 2]; if (!$3 & ($5_1 | 0) <= 0 | ($5_1 | 0) < 0) { break block1 } $9_1 = 1; if (($5_1 | 0) <= ($10_1 | 0) & $3 >>> 0 <= $4_1 >>> 0 | ($5_1 | 0) < ($10_1 | 0)) { continue } } break; }; $5_1 = $96($8_1); if (!$7_1) { break block } HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 8 >> 2] = 0; if ($5_1) { break block } $5_1 = $1675($0_1, 38, $6_1 + 16 | 0, 0); if ($5_1) { break block } $5_1 = $1675($0_1, 39, $6_1 + 8 | 0, 0); if ($5_1) { break block } $283($8_1, 1, $1_1, $2_1); $0_1 = HEAP32[$6_1 + 16 >> 2]; $7_1 = 0; block2 : { while (1) { if (($94($8_1) | 0) != 100) { break block2 } $282($0_1, 1, $7_1); $282($0_1, 2, $98($8_1, 0)); $282($0_1, 3, $98($8_1, 1)); $94($0_1); $7_1 = $7_1 + 1 | 0; $5_1 = $96($0_1); if (!$5_1) { continue } break; }; $96($8_1); break block; } $5_1 = $96($8_1); if ($5_1) { break block } $0_1 = HEAP32[$6_1 + 8 >> 2]; $283($0_1, 1, $1_1, $2_1); $94($0_1); $5_1 = $96($0_1); } $0_1 = $6_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1823($0_1) { var $1_1 = 0, $2_1 = 0; block : { if (!$0_1) { break block } $0_1 = HEAP32[$0_1 + 8 >> 2]; $1823(HEAP32[$0_1 >> 2]); while (1) { if (!$0_1) { break block } $2_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$0_1 + 36 >> 2]; if (($1_1 | 0) != ($0_1 + 40 | 0)) { $24($1_1) } $24(HEAP32[$0_1 + 28 >> 2]); $24($0_1); $0_1 = $2_1; continue; }; } } function $1824($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $7_1 = $124($0_1, $1_1); if ($7_1) { $0_1 = 0; $1_1 = 0; while (1) { $5_1 = HEAPU8[$1_1 + $7_1 | 0]; if (!(($5_1 - 48 & 255) >>> 0 > 9)) { $5_1 = $5_1 & 15; $0_1 = __wasm_i64_mul($0_1, $4_1, 10, 0) + $5_1 | 0; $4_1 = i64toi32_i32$HIGH_BITS; $4_1 = $0_1 >>> 0 < $5_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $4_1; $2_1 = 1; $5_1 = 0; while (1) { $0_1 = HEAPU8[$1_1 + $7_1 | 0]; if (($0_1 | 0) != 32) { if (($0_1 | 0) == 45) { $2_1 = -1; $5_1 = -1; $1_1 = $1_1 + 1 | 0; } $0_1 = 0; $4_1 = 0; while (1) { $6_1 = HEAPU8[$1_1 + $7_1 | 0]; if (!(($6_1 - 48 & 255) >>> 0 > 9)) { $6_1 = $6_1 & 15; $0_1 = __wasm_i64_mul($0_1, $4_1, 10, 0) + $6_1 | 0; $4_1 = i64toi32_i32$HIGH_BITS; $4_1 = $0_1 >>> 0 < $6_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $1_1 = $1_1 + 1 | 0; continue; } break; }; HEAP32[$3 >> 2] = __wasm_i64_mul($0_1, $4_1, $2_1, $5_1); HEAP32[$3 + 4 >> 2] = i64toi32_i32$HIGH_BITS; } else { $1_1 = $1_1 + 1 | 0; continue; } break; }; } } function $1825($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0; $6_1 = global$0 - 16 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $7_1 = $1723($3, $4_1, $5_1); HEAP32[$6_1 + 12 >> 2] = $7_1; if ($7_1) { HEAP32[$0_1 + 272 >> 2] = (HEAP32[$0_1 + 272 >> 2] - (HEAP32[$7_1 >> 2] + $5_1 | 0) | 0) - 20 } block2 : { block1 : { if (!$1809($6_1 + 12 | 0, HEAP32[$0_1 + 280 >> 2], HEAP32[$0_1 + 284 >> 2], $1_1, $1_1 >> 31, $2_1, $2_1 >> 31, $6_1 + 8 | 0)) { break block1 } $1_1 = HEAP32[$6_1 + 12 >> 2]; if (($1632($3, $4_1, $5_1, $1_1) | 0) != ($1_1 | 0)) { break block1 } $24($1_1); $4_1 = 7; break block2; } $4_1 = HEAP32[$6_1 + 8 >> 2]; if ($4_1) { break block2 } HEAP32[$0_1 + 272 >> 2] = (HEAP32[$0_1 + 272 >> 2] + (HEAP32[HEAP32[$6_1 + 12 >> 2] >> 2] + $5_1 | 0) | 0) + 20; $4_1 = 0; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1; } function $1826($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { var $8_1 = 0, $9_1 = 0; $8_1 = ($2_1 >> 31) + $5_1 | 0; $9_1 = $2_1; $2_1 = $2_1 + $4_1 | 0; $8_1 = $9_1 >>> 0 > $2_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $9_1 = $2_1; $2_1 = $5_1 << 3 | $4_1 >>> 29; $5_1 = $4_1 << 3; $4_1 = $9_1 + $5_1 | 0; $2_1 = $2_1 + $8_1 | 0; $2_1 = $4_1 >>> 0 < $5_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $5_1 = $2_1 + ($3 >> 31) | 0; $9_1 = $3; $3 = $3 + $4_1 | 0; $5_1 = $9_1 >>> 0 > $3 >>> 0 ? $5_1 + 1 | 0 : $5_1; $2_1 = $2_1 << 3 | $4_1 >>> 29; $4_1 = $4_1 << 3; $3 = $4_1 + $3 | 0; $2_1 = $2_1 + $5_1 | 0; $2_1 = $3 >>> 0 < $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $8_1 = $2_1 + ($6_1 >> 31) | 0; $4_1 = $3 + $6_1 | 0; $8_1 = $4_1 >>> 0 < $6_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $2_1 = $2_1 << 3 | $3 >>> 29; $5_1 = $4_1; $4_1 = $3 << 3; $3 = $5_1 + $4_1 | 0; $2_1 = $2_1 + $8_1 | 0; $2_1 = $3 >>> 0 < $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $5_1 = $2_1 + ($7_1 >> 31) | 0; $4_1 = $3 + $7_1 | 0; $5_1 = $4_1 >>> 0 < $7_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; $2_1 = $2_1 << 3 | $3 >>> 29; $3 = $3 << 3; $4_1 = $3 + $4_1 | 0; $2_1 = $2_1 + $5_1 | 0; $5_1 = $3 >>> 0 > $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; $2_1 = 0; $3 = ($1_1 | 0) > 0 ? $1_1 : 0; while (1) { if (!(($2_1 | 0) == ($3 | 0))) { $4_1 = __wasm_i64_mul($4_1, $5_1, 9, 0); $1_1 = HEAP8[$0_1 + $2_1 | 0]; $4_1 = $4_1 + $1_1 | 0; $8_1 = i64toi32_i32$HIGH_BITS + ($1_1 >> 31) | 0; $5_1 = $1_1 >>> 0 > $4_1 >>> 0 ? $8_1 + 1 | 0 : $8_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; i64toi32_i32$HIGH_BITS = $5_1; return $4_1; } function $1827($0_1, $1_1, $2_1) { var $3 = 0; if (!(HEAP32[$2_1 >> 2] | HEAP32[$0_1 + 8 >> 2] >= ($1_1 | 0))) { $3 = $34(HEAP32[$0_1 >> 2], $1_1, $1_1 >> 31); if ($3) { HEAP32[$0_1 >> 2] = $3; HEAP32[$0_1 + 8 >> 2] = $1_1; return; } HEAP32[$2_1 >> 2] = 7; } } function $1828($0_1, $1_1, $2_1) { wasm2js_memory_fill($0_1 + 8 | 0, 0, 40); HEAP32[$0_1 + 4 >> 2] = $2_1; HEAP32[$0_1 >> 2] = $1_1; if (!$1_1) { HEAP32[$0_1 + 8 >> 2] = 1; return 0; } if (HEAPU8[$1_1 | 0]) { $1_1 = $1668($1_1 + 1 | 0, $0_1 + 16 | 0) + 1 | 0 } else { $1_1 = 1 } HEAP32[$0_1 + 8 >> 2] = $1_1; return $1829($0_1); } function $1829($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $4_1 = global$0 - 16 | 0; $1_1 = $4_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $3 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$4_1 + 12 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $2_1 = HEAP32[$0_1 + 16 >> 2]; $1_1 = HEAP32[$0_1 + 20 >> 2]; if (!(!($2_1 | $1_1) | !$3)) { $2_1 = $2_1 + 1 | 0; $1_1 = $2_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $1_1; } $1_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = HEAP32[$0_1 + 4 >> 2]; block2 : { if (($1_1 | 0) >= ($7_1 | 0)) { $1_1 = 0; HEAP32[$0_1 >> 2] = 0; break block2; } $2_1 = HEAP32[$0_1 >> 2]; if ($3) { $6_1 = $1_1; $5_1 = $1_1 + $2_1 | 0; $1_1 = HEAP8[$5_1 | 0]; block5 : { if (($1_1 | 0) < 0) { $1_1 = $1681($5_1, $4_1 + 12 | 0); break block5; } HEAP32[$4_1 + 12 >> 2] = $1_1; $1_1 = 1; } $1_1 = $6_1 + $1_1 | 0; HEAP32[$0_1 + 8 >> 2] = $1_1; } $2_1 = $1_1 + $2_1 | 0; $5_1 = HEAP8[$2_1 | 0]; block7 : { if (($5_1 | 0) < 0) { $6_1 = $1681($2_1, $4_1 + 8 | 0); break block7; } HEAP32[$4_1 + 8 >> 2] = $5_1; $6_1 = 1; } $2_1 = $6_1 + $1_1 | 0; HEAP32[$0_1 + 8 >> 2] = $2_1; $1_1 = 267; $6_1 = $3; $3 = HEAP32[$4_1 + 12 >> 2]; if (($6_1 | 0) < ($3 | 0)) { break block2 } $6_1 = $7_1 - $2_1 | 0; $2_1 = HEAP32[$4_1 + 8 >> 2]; if (($6_1 | 0) < ($2_1 | 0) | !$2_1) { break block2 } $5_1 = $0_1 + 24 | 0; $7_1 = $2_1 + $3 | 0; $1827($5_1, $7_1, $4_1 + 4 | 0); $1_1 = HEAP32[$4_1 + 4 >> 2]; if ($1_1) { break block2 } $1_1 = 0; $5_1 = HEAP32[$5_1 >> 2]; if (!$5_1) { break block2 } if ($2_1) { wasm2js_memory_copy($3 + $5_1 | 0, HEAP32[$0_1 >> 2] + HEAP32[$0_1 + 8 >> 2] | 0, $2_1) } HEAP32[$0_1 + 28 >> 2] = $7_1; $3 = $2_1 + HEAP32[$0_1 + 8 >> 2] | 0; HEAP32[$0_1 + 8 >> 2] = $3; if (HEAP32[$0_1 + 16 >> 2] | HEAP32[$0_1 + 20 >> 2]) { break block2 } $1_1 = HEAP32[$0_1 >> 2] + $3 | 0; $2_1 = HEAP8[$1_1 | 0]; block10 : { if (($2_1 | 0) < 0) { $1_1 = $1681($1_1, $0_1 + 40 | 0); $2_1 = HEAP32[$0_1 + 40 >> 2]; $3 = HEAP32[$0_1 + 8 >> 2]; break block10; } HEAP32[$0_1 + 40 >> 2] = $2_1; $1_1 = 1; } $3 = $1_1 + $3 | 0; HEAP32[$0_1 + 8 >> 2] = $3; $1_1 = 267; if ((HEAP32[$0_1 + 4 >> 2] - $3 | 0) < ($2_1 | 0)) { break block2 } HEAP32[$0_1 + 8 >> 2] = $2_1 + $3; HEAP32[$0_1 + 36 >> 2] = $3 + HEAP32[$0_1 >> 2]; $1_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1830($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block1 : { if (!(!$2_1 | !$0_1)) { $4_1 = ($1_1 | 0) < ($3 | 0) ? $1_1 : $3; if ($4_1) { break block1 } } return $1_1 - $3 | 0; } $0_1 = $2014($0_1, $2_1, $4_1); return $0_1 ? $0_1 : $1_1 - $3 | 0; } function $1831($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $7_1 = global$0 - 16 | 0; if ($7_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $7_1 >>> 0) { fimport$30($7_1 | 0) } global$0 = $7_1; HEAP32[$7_1 + 12 >> 2] = 0; $10_1 = HEAP32[$1_1 + 4 >> 2]; $1827($1_1, $3, $7_1 + 12 | 0); $6_1 = HEAP32[$7_1 + 12 >> 2]; block : { if ($6_1) { break block } $9_1 = HEAP32[$1_1 >> 2]; $8_1 = $1817($9_1, HEAP32[$1_1 + 4 >> 2], $2_1, $3); $6_1 = $3 - $8_1 | 0; if (($6_1 | 0) <= 0) { $6_1 = 267; break block; } if ($3) { wasm2js_memory_copy($9_1, $2_1, $3) } HEAP32[$1_1 + 4 >> 2] = $3; block4 : { if (!$10_1) { $1_1 = HEAP32[$0_1 + 4 >> 2]; break block4; } $1_1 = $1700(HEAP32[$0_1 >> 2] + HEAP32[$0_1 + 4 >> 2] | 0, $8_1, $8_1 >> 31) + HEAP32[$0_1 + 4 >> 2] | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; } $1_1 = $1700(HEAP32[$0_1 >> 2] + $1_1 | 0, $6_1, 0) + HEAP32[$0_1 + 4 >> 2] | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; if ($6_1) { wasm2js_memory_copy($1_1 + HEAP32[$0_1 >> 2] | 0, $2_1 + $8_1 | 0, $6_1) } $1_1 = $6_1 + HEAP32[$0_1 + 4 >> 2] | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; $6_1 = 0; if (!$4_1) { break block } $1_1 = $1700($1_1 + HEAP32[$0_1 >> 2] | 0, $5_1, $5_1 >> 31) + HEAP32[$0_1 + 4 >> 2] | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; if ($5_1) { wasm2js_memory_copy($1_1 + HEAP32[$0_1 >> 2] | 0, $4_1, $5_1) } HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] + $5_1; } $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $6_1; } function $1832($0_1, $1_1, $2_1, $3, $4_1, $5_1) { var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = global$0 - 80 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$6_1 + 24 >> 2] = 0; HEAP32[$6_1 + 16 >> 2] = 0; HEAP32[$6_1 + 20 >> 2] = 0; HEAP32[$6_1 + 12 >> 2] = 0; block1 : { if (($1_1 | 0) <= 0) { $7_1 = 267; break block1; } $8_1 = HEAPU8[$0_1 | 0]; $1827($2_1, $1_1, $6_1 + 12 | 0); $7_1 = HEAP32[$6_1 + 12 >> 2]; if ($7_1) { break block1 } HEAP32[$2_1 + 4 >> 2] = 0; $7_1 = $1828($6_1 + 32 | 0, $0_1, $1_1); $10_1 = ($8_1 | 0) != 0; while (1) { block2 : { if (!HEAP32[$6_1 + 32 >> 2] | $7_1) { break block2 } $1_1 = HEAP32[$6_1 + 60 >> 2]; $7_1 = HEAP32[$6_1 + 56 >> 2]; block4 : { if (!HEAP32[$2_1 + 4 >> 2]) { $8_1 = $1830($7_1, $1_1, $3, $4_1); if (($8_1 | 0) < 0 | !$8_1 & $10_1) { break block4 } $8_1 = HEAP32[$6_1 + 48 >> 2]; $9_1 = HEAP32[$6_1 + 52 >> 2]; $1833($2_1, HEAP8[$0_1 | 0], $8_1, $9_1); HEAP32[$5_1 >> 2] = $8_1; HEAP32[$5_1 + 4 >> 2] = $9_1; } $7_1 = $1831($2_1, $6_1 + 16 | 0, $7_1, $1_1, HEAP32[$6_1 + 68 >> 2], HEAP32[$6_1 + 72 >> 2]); if ($7_1) { break block2 } } $7_1 = $1829($6_1 + 32 | 0); continue; } break; }; if (!HEAP32[$2_1 + 4 >> 2]) { $3 = HEAP8[$0_1 | 0]; $1_1 = HEAP32[$6_1 + 48 >> 2]; $0_1 = HEAP32[$6_1 + 52 >> 2]; $1833($2_1, $3, $1_1, $0_1); HEAP32[$5_1 >> 2] = $1_1; HEAP32[$5_1 + 4 >> 2] = $0_1; } $24(HEAP32[$6_1 + 56 >> 2]); $24(HEAP32[$6_1 + 16 >> 2]); } $0_1 = $6_1 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $7_1; } function $1833($0_1, $1_1, $2_1, $3) { HEAP8[HEAP32[$0_1 >> 2]] = $1_1; if ($2_1 | $3) { $1_1 = $1700(HEAP32[$0_1 >> 2] + 1 | 0, $2_1, $3) + 1 | 0 } else { $1_1 = 1 } HEAP32[$0_1 + 4 >> 2] = $1_1; } function $1834($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0, $25 = 0, $26_1 = 0, $27 = 0, $28_1 = 0, $29_1 = 0, $30_1 = 0, $31_1 = 0, $32_1 = 0, $33_1 = 0, $34_1 = 0, $35_1 = 0, $36_1 = 0, $37_1 = 0, $38_1 = 0, $39_1 = 0, $40_1 = 0, $41_1 = 0, $42_1 = 0, $43_1 = 0, $44_1 = 0, $45_1 = 0, $46_1 = 0, $47_1 = 0; $3 = global$0 - 208 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; block1 : { if (($1_1 | 0) >= 7) { $235($0_1, 26762, -1); break block1; } if ($1835($0_1, 3420, HEAP32[$2_1 >> 2], $3 + 12 | 0)) { break block1 } $18_1 = 15; $19_1 = -1; $23_1 = 21980; $31_1 = 21986; $32_1 = 21976; block7 : { switch ($1_1 - 2 | 0) { case 4: $18_1 = $50(HEAP32[$2_1 + 20 >> 2]); case 3: $19_1 = $50(HEAP32[$2_1 + 16 >> 2]); case 2: $23_1 = $53(HEAP32[$2_1 + 12 >> 2]); case 1: $31_1 = $53(HEAP32[$2_1 + 8 >> 2]); case 0: $32_1 = $53(HEAP32[$2_1 + 4 >> 2]); break; default: break block7; }; } if ($32_1 ? !$23_1 | !$31_1 : 1) { $227($0_1); break block1; } if (!$18_1) { $246($0_1, 30822, -1, 0); break block1; } $14 = HEAP32[$3 + 12 >> 2]; if ($1750($0_1, $14)) { break block1 } $35_1 = HEAP32[$14 >> 2]; HEAP32[$3 + 128 >> 2] = 0; HEAP32[$3 + 120 >> 2] = 0; HEAP32[$3 + 124 >> 2] = 0; if (!HEAP32[$14 + 16 >> 2]) { $246($0_1, 30822, 0, 0); break block1; } $1_1 = ($18_1 | 0) <= -64 ? -64 : $18_1; $1_1 = ($1_1 | 0) >= 64 ? 64 : $1_1; $43_1 = $1_1 - 1 | 0; $44_1 = 0 - $1_1 | 0; $20_1 = 1; while (1) { $22_1 = $44_1; $22_1 = ($18_1 | 0) >= 0 ? ($20_1 + $43_1 | 0) / ($20_1 | 0) | 0 : $22_1; $24_1 = 0; $33_1 = 0; $34_1 = 0; $25 = 0; $26_1 = 0; block17 : { label9 : while (1) { if (($20_1 | 0) != ($24_1 | 0)) { $21_1 = ($3 + 16 | 0) + Math_imul($24_1, 24) | 0; $1_1 = $21_1; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $1_1 + 16 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $21_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $16_1 = 0; $27 = -1; while (1) { block16 : { block20 : { if (($16_1 | 0) < HEAP32[$35_1 + 24 >> 2]) { if (($16_1 | 0) != ($19_1 | 0) & ($19_1 | 0) >= 0) { break block16 } $7_1 = $1836($14, $3 + 200 | 0, 0); if ($7_1) { break block17 } $1_1 = $1642(Math_imul(HEAP32[$3 + 200 >> 2], 40), 0); HEAP32[$3 + 152 >> 2] = $1_1; if (!$1_1) { $7_1 = 7; break block17; } HEAP32[$3 + 144 >> 2] = $22_1; HEAP32[$3 + 140 >> 2] = $16_1; HEAP32[$3 + 156 >> 2] = -1; HEAP32[$3 + 148 >> 2] = HEAP32[$3 + 200 >> 2]; HEAP32[$3 + 136 >> 2] = $14; $7_1 = $1838(HEAP32[$14 + 16 >> 2], 115, $3 + 136 | 0); $15_1 = HEAP32[$3 + 152 >> 2]; if ($7_1) { $36_1 = 0; $37_1 = 0; $1_1 = 0; $38_1 = 0; $39_1 = 0; $40_1 = 0; $13_1 = 0; break block20; } $17_1 = 0; $1_1 = HEAP32[$3 + 200 >> 2]; $9_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = 0; while (1) { if (($1_1 | 0) == ($9_1 | 0)) { $2_1 = -1; $9_1 = 0; $5_1 = 0; $11_1 = 0; $12_1 = 0; } else { $8_1 = HEAP32[(Math_imul($1_1, 40) + $15_1 | 0) + 16 >> 2]; $4_1 = $1_1 & 63; $2_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $2_1; $5_1 = 0; } else { $5_1 = 1 << $2_1; $6_1 = $5_1 - 1 & 1 >>> 32 - $2_1; } $2_1 = $8_1 ? $5_1 : 0; $33_1 = $2_1 | $33_1; $34_1 = $34_1 | ($8_1 ? $6_1 : 0); $1_1 = $1_1 + 1 | 0; continue; } break; }; label7 : while (1) { $13_1 = $2_1; $39_1 = $11_1; $40_1 = $12_1; $36_1 = $9_1; $37_1 = $5_1; $38_1 = $17_1; label6 : while (1) { block26 : { block24 : { if (HEAP32[$3 + 156 >> 2] >= 0) { $2_1 = 0; $1_1 = HEAP32[$3 + 148 >> 2]; $5_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $9_1 = 2147483647; $15_1 = HEAP32[$3 + 152 >> 2]; while (1) { if (($2_1 | 0) == ($5_1 | 0)) { break block24 } $4_1 = Math_imul($2_1, 40) + $15_1 | 0; if (HEAP32[$4_1 + 16 >> 2]) { $8_1 = HEAP32[$4_1 + 8 >> 2]; $6_1 = $8_1; $10_1 = $9_1 >>> 0 > $8_1 >>> 0; $4_1 = HEAP32[$4_1 + 12 >> 2]; $8_1 = $9_1 >> 31; $9_1 = $10_1 & ($4_1 | 0) <= ($8_1 | 0) | ($4_1 | 0) < ($8_1 | 0) ? $6_1 : $9_1; } $2_1 = $2_1 + 1 | 0; continue; }; } $2_1 = 0; HEAP32[$3 + 156 >> 2] = 0; while (1) { $1_1 = HEAP32[$3 + 148 >> 2]; if (($2_1 | 0) >= ($1_1 | 0)) { break block26 } $1_1 = HEAP32[$3 + 152 >> 2] + Math_imul($2_1, 40) | 0; $1839($1_1 + 16 | 0, $1_1 + 8 | 0, HEAP32[$3 + 144 >> 2]); $2_1 = $2_1 + 1 | 0; continue; }; } if (($9_1 | 0) == 2147483647) { $1_1 = $16_1; break block20; } $4_1 = ($9_1 - HEAP32[$3 + 144 >> 2] | 0) + 1 | 0; HEAP32[$3 + 156 >> 2] = $4_1; $8_1 = $9_1 + 1 | 0; $2_1 = 0; while (1) { if (($1_1 | 0) <= ($2_1 | 0)) { break block26 } $1_1 = HEAP32[$3 + 152 >> 2] + Math_imul($2_1, 40) | 0; $1839($1_1 + 16 | 0, $1_1 + 8 | 0, $8_1); $1839($1_1 + 32 | 0, $1_1 + 24 | 0, $4_1); $2_1 = $2_1 + 1 | 0; $1_1 = HEAP32[$3 + 148 >> 2]; continue; }; } $17_1 = HEAP32[$3 + 156 >> 2]; $41_1 = $17_1 >> 31; $15_1 = 0; $11_1 = 0; $12_1 = 0; $9_1 = 0; $5_1 = 0; $2_1 = 0; while (1) { block29 : { if (($1_1 | 0) > ($15_1 | 0)) { $28_1 = HEAP32[$3 + 152 >> 2] + Math_imul($15_1, 40) | 0; $4_1 = HEAP32[$28_1 + 32 >> 2]; if (!$4_1) { break block29 } HEAP32[$3 + 204 >> 2] = $4_1; $1_1 = HEAP32[$28_1 + 28 >> 2]; $4_1 = $1_1; $8_1 = HEAP32[$28_1 + 24 >> 2]; HEAP32[$3 + 160 >> 2] = $8_1; HEAP32[$3 + 164 >> 2] = $1_1; $6_1 = $15_1 & 63; $1_1 = $6_1 & 31; if (($6_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $1_1; $10_1 = 0; } else { $10_1 = 1 << $1_1; $6_1 = $10_1 - 1 & 1 >>> 32 - $1_1; } $42_1 = $10_1; $1_1 = $9_1 | $42_1; $45_1 = $6_1; $10_1 = $5_1 | $6_1; while (1) { block32 : { $6_1 = HEAP32[$3 + 144 >> 2]; $29_1 = $6_1 + $17_1 | 0; $30_1 = $29_1 >> 31; if (!(($30_1 | 0) <= ($4_1 | 0) & $8_1 >>> 0 >= $29_1 >>> 0 | ($4_1 | 0) > ($30_1 | 0) | ($8_1 >>> 0 < $17_1 >>> 0 & ($4_1 | 0) <= ($41_1 | 0) | ($4_1 | 0) < ($41_1 | 0)))) { $4_1 = HEAP32[$28_1 >> 2]; $4_1 = ($4_1 | 0) > ($6_1 | 0) ? $6_1 : $4_1; $29_1 = ($4_1 | 0) > 0 ? $4_1 : 0; $30_1 = $42_1 & ($9_1 | $25); $46_1 = $45_1 & ($5_1 | $26_1); $8_1 = $8_1 - $17_1 | 0; $4_1 = $8_1 & 31; if (($8_1 & 63) >>> 0 >= 32) { $6_1 = 1 << $4_1; $9_1 = 0; } else { $9_1 = 1 << $4_1; $6_1 = $9_1 - 1 & 1 >>> 32 - $4_1; } $47_1 = $9_1; $9_1 = $6_1; $8_1 = 0; $4_1 = 0; while (1) { if (!(!$4_1 & ($8_1 | 0) == ($29_1 | 0))) { $5_1 = $8_1 & 31; if (($8_1 & 63) >>> 0 >= 32) { $6_1 = 0; $5_1 = $9_1 >>> $5_1 | 0; } else { $6_1 = $9_1 >>> $5_1 | 0; $5_1 = ((1 << $5_1) - 1 & $9_1) << 32 - $5_1 | $47_1 >>> $5_1; } $11_1 = $5_1 | $11_1; $12_1 = $6_1 | $12_1; $8_1 = $8_1 + 1 | 0; $4_1 = $8_1 ? $4_1 : $4_1 + 1 | 0; continue; } break; }; $2_1 = ($30_1 | $46_1 ? 1 : 1e3) + $2_1 | 0; if (HEAPU8[HEAP32[$3 + 204 >> 2]] >= 2) { break block32 } $5_1 = $10_1; $9_1 = $1_1; } $1_1 = HEAP32[$3 + 148 >> 2]; break block29; } $1840($3 + 204 | 0, $3 + 160 | 0); $8_1 = HEAP32[$3 + 160 >> 2]; $4_1 = HEAP32[$3 + 164 >> 2]; $9_1 = $1_1; $5_1 = $10_1; continue; }; } if (($2_1 | 0) <= ($13_1 | 0)) { continue label6 } continue label7; } $15_1 = $15_1 + 1 | 0; continue; }; }; }; } $24_1 = $24_1 + 1 | 0; $25 = $25 | HEAP32[$21_1 + 8 >> 2]; $26_1 = $26_1 | HEAP32[$21_1 + 12 >> 2]; continue label9; } $24($15_1); if ($7_1) { break block17 } if (($13_1 | 0) <= ($27 | 0)) { break block16 } $2_1 = $21_1; HEAP32[$2_1 + 16 >> 2] = $39_1; HEAP32[$2_1 + 20 >> 2] = $40_1; HEAP32[$2_1 + 8 >> 2] = $36_1; HEAP32[$2_1 + 12 >> 2] = $37_1; HEAP32[$2_1 + 4 >> 2] = $38_1; HEAP32[$2_1 >> 2] = $1_1; $27 = $13_1; } $16_1 = $16_1 + 1 | 0; continue; }; } break; }; if (!(!(($25 | 0) == ($33_1 | 0) & ($26_1 | 0) == ($34_1 | 0)) & ($20_1 | 0) != 4)) { $27 = $20_1 - 1 | 0; $7_1 = 0; $9_1 = 0; while (1) { if ($7_1 | $9_1 >>> 0 >= $20_1 >>> 0) { break block17 } $16_1 = HEAP32[$14 >> 2]; HEAP32[$3 + 188 >> 2] = 0; $1_1 = ($3 + 16 | 0) + Math_imul($9_1, 24) | 0; $8_1 = HEAP32[$1_1 + 16 >> 2]; $4_1 = HEAP32[$1_1 + 20 >> 2]; $10_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = HEAP32[$1_1 >> 2] + 1 | 0; $13_1 = $124(HEAP32[$14 + 12 >> 2], $1_1); $2_1 = HEAP32[$14 + 12 >> 2]; block36 : { if (!$13_1) { $7_1 = ($125($2_1, $1_1) | 0) != 5 ? 7 : 0; break block36; } $18_1 = $274($2_1, $1_1); $1_1 = HEAP32[$16_1 + 36 >> 2]; $21_1 = HEAP32[$1_1 >> 2]; $7_1 = $1789($1_1, HEAP32[$14 + 20 >> 2], $13_1, $18_1, $3 + 184 | 0); if ($7_1) { break block36 } $2_1 = 0; $17_1 = HEAP32[$3 + 184 >> 2]; $19_1 = 0; block37 : { label15 : while (1) { $7_1 = 0; while (1) { if ($7_1) { break block37 } HEAP32[$3 + 176 >> 2] = -1; HEAP32[$3 + 172 >> 2] = 0; HEAP32[$3 + 168 >> 2] = 0; block39 : { $7_1 = FUNCTION_TABLE[HEAP32[$21_1 + 20 >> 2]]($17_1, $3 + 180 | 0, $3 + 176 | 0, $3 + 172 | 0, $3 + 168 | 0, $3 + 188 | 0) | 0; if ($7_1) { if (($7_1 | 0) != 101) { break block37 } $1_1 = $13_1 + $19_1 | 0; break block39; } $7_1 = 0; $1_1 = HEAP32[$3 + 188 >> 2]; if (($10_1 | 0) > ($1_1 | 0)) { continue } block40 : { if ($2_1) { break block40 } $11_1 = 0; $12_1 = 0; block50 : { block43 : { block42 : { if (!($4_1 | $8_1)) { $8_1 = 0; $4_1 = 0; break block42; } while (1) { $2_1 = $11_1; $11_1 = $2_1 + 1 | 0; $12_1 = $11_1 ? $12_1 : $12_1 + 1 | 0; $1_1 = 0; $6_1 = $8_1; $5_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $5_1 = $4_1 >>> $5_1 | 0 } else { $5_1 = ((1 << $5_1) - 1 & $4_1) << 32 - $5_1 | $6_1 >>> $5_1 } if (!($5_1 & 1)) { continue } break; }; while (1) { $5_1 = $1_1; $1_1 = $1_1 + 1 | 0; $12_1 = $8_1; $11_1 = ($5_1 ^ -1) + $22_1 | 0; $6_1 = $11_1 & 31; if (($11_1 & 63) >>> 0 >= 32) { $6_1 = $4_1 >>> $6_1 | 0 } else { $6_1 = ((1 << $6_1) - 1 & $4_1) << 32 - $6_1 | $12_1 >>> $6_1 } if (!($6_1 & 1)) { continue } break; }; $5_1 = $2_1 - $5_1 | 0; if (($5_1 | 0) < 2) { break block42 } $2_1 = HEAP32[$3 + 172 >> 2]; $6_1 = HEAP32[$14 + 20 >> 2]; HEAP32[$3 + 136 >> 2] = 0; $11_1 = HEAP32[$16_1 + 36 >> 2]; $1_1 = HEAP32[$11_1 >> 2]; $7_1 = $1789($11_1, $6_1, $2_1 + $13_1 | 0, $18_1 - $2_1 | 0, $3 + 160 | 0); if ($7_1) { break block43 } $5_1 = (($5_1 | 0) / 2 | 0) + $22_1 | 0; $7_1 = 0; $2_1 = HEAP32[$3 + 160 >> 2]; block46 : { while (1) { if (!$7_1) { if (HEAP32[$3 + 136 >> 2] >= ($5_1 | 0)) { FUNCTION_TABLE[HEAP32[$1_1 + 16 >> 2]]($2_1) | 0; break block46; } else { HEAP32[$3 + 200 >> 2] = 0; HEAP32[$3 + 196 >> 2] = 0; HEAP32[$3 + 192 >> 2] = 0; $7_1 = FUNCTION_TABLE[HEAP32[$1_1 + 20 >> 2]]($2_1, $3 + 204 | 0, $3 + 200 | 0, $3 + 196 | 0, $3 + 192 | 0, $3 + 136 | 0) | 0; continue; } } break; }; FUNCTION_TABLE[HEAP32[$1_1 + 16 >> 2]]($2_1) | 0; if (($7_1 | 0) != 101) { break block43 } } $1_1 = HEAP32[$3 + 136 >> 2] + ((($7_1 | 0) != 0) - $22_1 | 0) | 0; $2_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $10_1 = $2_1 + $10_1 | 0; $1_1 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $6_1 = 0; $8_1 = $4_1 >>> $1_1 | 0; } else { $6_1 = $4_1 >>> $1_1 | 0; $8_1 = ((1 << $1_1) - 1 & $4_1) << 32 - $1_1 | $8_1 >>> $1_1; } $4_1 = $6_1; } block49 : { if (!(!$9_1 & ($10_1 | 0) <= 0)) { $7_1 = $1841($3 + 120 | 0, $23_1, -1); break block49; } $1_1 = HEAP32[$3 + 172 >> 2]; if (!$1_1) { break block50 } $7_1 = $1841($3 + 120 | 0, $13_1, $1_1); } if (!$7_1) { break block50 } } $2_1 = 1; continue; } $1_1 = HEAP32[$3 + 188 >> 2]; if (($10_1 | 0) <= ($1_1 | 0)) { break block40 } $2_1 = 1; continue label15; } if (($1_1 | 0) >= ($10_1 + $22_1 | 0)) { $7_1 = 0; $1_1 = $23_1; if (($9_1 | 0) == ($27 | 0)) { break block39 } break block37; } $5_1 = $1_1 - $10_1 | 0; $2_1 = $5_1 & 31; if (($5_1 & 63) >>> 0 >= 32) { $12_1 = 1 << $2_1; $2_1 = 0; } else { $5_1 = 1 << $2_1; $12_1 = $5_1 - 1 & 1 >>> 32 - $2_1; $2_1 = $5_1; } $7_1 = 0; if (($1_1 | 0) > ($10_1 | 0)) { $7_1 = $1841($3 + 120 | 0, $13_1 + $19_1 | 0, HEAP32[$3 + 172 >> 2] - $19_1 | 0) } $1_1 = $2_1 & $8_1; $2_1 = $4_1 & $12_1; if (!(!($1_1 | $2_1) | $7_1)) { $7_1 = $1841($3 + 120 | 0, $32_1, -1) } block54 : { if ($7_1) { break block54 } $6_1 = $3 + 120 | 0; $5_1 = HEAP32[$3 + 172 >> 2]; $7_1 = $1841($6_1, $5_1 + $13_1 | 0, HEAP32[$3 + 168 >> 2] - $5_1 | 0); if ($7_1 | !($1_1 | $2_1)) { break block54 } $7_1 = $1841($6_1, $31_1, -1); } $2_1 = 1; $19_1 = HEAP32[$3 + 168 >> 2]; continue; } break; }; break; }; $7_1 = $1841($3 + 120 | 0, $1_1, -1); } FUNCTION_TABLE[HEAP32[$21_1 + 16 >> 2]]($17_1) | 0; } $9_1 = $9_1 + 1 | 0; continue; }; } $20_1 = $20_1 + 1 | 0; continue; } break; }; $1660($35_1); if ($7_1) { $255($0_1, $7_1); $24(HEAP32[$3 + 120 >> 2]); break block1; } $246($0_1, HEAP32[$3 + 120 >> 2], -1, 1); } $0_1 = $3 + 208 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1835($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { if ((HEAPU16[$2_1 + 16 >> 1] & 4031) != 2561 | HEAPU8[$2_1 + 19 | 0] != 112) { break block } if ($2073(HEAP32[$2_1 >> 2], 9085)) { break block } $5_1 = HEAP32[$2_1 + 8 >> 2]; } HEAP32[$3 >> 2] = $5_1; $3 = 0; if (!$5_1) { HEAP32[$4_1 >> 2] = $1_1; $1_1 = $0_1; $0_1 = $61(6564, $4_1); $235($1_1, $0_1, -1); $24($0_1); $3 = 1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $3; } function $1836($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 8 >> 2] = 0; HEAP32[$3 + 12 >> 2] = 0; HEAP32[$3 + 4 >> 2] = $0_1; $0_1 = $1838(HEAP32[$0_1 + 16 >> 2], 116, $3 + 4 | 0); if ($1_1) { HEAP32[$1_1 >> 2] = HEAP32[$3 + 8 >> 2] } if ($2_1) { HEAP32[$2_1 >> 2] = HEAP32[$3 + 12 >> 2] } $1_1 = $3 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1837($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $1_1 = HEAP32[$2_1 + 16 >> 2] + Math_imul($1_1, 40) | 0; HEAP32[$1_1 >> 2] = HEAP32[HEAP32[$0_1 + 20 >> 2] + 64 >> 2]; $4_1 = $3 + 12 | 0; $2_1 = $1855(HEAP32[$2_1 >> 2], $0_1, HEAP32[$2_1 + 4 >> 2], $4_1); $0_1 = HEAP32[$3 + 12 >> 2]; block : { if (!$0_1) { break block } HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = $0_1; $1840($4_1, $3); $0_1 = HEAP32[$3 >> 2]; $4_1 = HEAP32[$3 + 4 >> 2]; if (!(($4_1 | 0) >= 0 | ($4_1 | 0) > 0)) { $2_1 = 267; break block; } $5_1 = HEAP32[$3 + 12 >> 2]; HEAP32[$1_1 + 32 >> 2] = $5_1; HEAP32[$1_1 + 16 >> 2] = $5_1; HEAP32[$1_1 + 24 >> 2] = $0_1; HEAP32[$1_1 + 28 >> 2] = $4_1; HEAP32[$1_1 + 8 >> 2] = $0_1; HEAP32[$1_1 + 12 >> 2] = $4_1; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $1838($0_1, $1_1, $2_1) { var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = 0; $1_1 = $1858($0_1, $3 + 12 | 0, $1_1, $2_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1839($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = global$0 - 16 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; $4_1 = HEAP32[$0_1 >> 2]; HEAP32[$3 + 12 >> 2] = $4_1; block : { if (!$4_1) { break block } $5_1 = HEAP32[$1_1 + 4 >> 2]; $4_1 = HEAP32[$1_1 >> 2]; HEAP32[$3 >> 2] = $4_1; HEAP32[$3 + 4 >> 2] = $5_1; $7_1 = $2_1 >> 31; while (1) { $6_1 = HEAP32[$3 + 12 >> 2]; block2 : { if (!($2_1 >>> 0 <= $4_1 >>> 0 & ($5_1 | 0) >= ($7_1 | 0) | ($5_1 | 0) > ($7_1 | 0))) { if (HEAPU8[$6_1 | 0] >= 2) { break block2 } $5_1 = -1; $6_1 = 0; $4_1 = -1; } HEAP32[$1_1 >> 2] = $4_1; HEAP32[$1_1 + 4 >> 2] = $5_1; HEAP32[$0_1 >> 2] = $6_1; break block; } $1840($3 + 12 | 0, $3); $4_1 = HEAP32[$3 >> 2]; $5_1 = HEAP32[$3 + 4 >> 2]; continue; }; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1840($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0 - 16 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $3 = HEAP32[$0_1 >> 2]; $4_1 = HEAP8[$3 | 0]; block1 : { if (($4_1 | 0) < 0) { $5_1 = $1681($3, $2_1 + 12 | 0); $4_1 = HEAP32[$2_1 + 12 >> 2]; break block1; } $5_1 = 1; } HEAP32[$0_1 >> 2] = $3 + $5_1; $0_1 = $4_1 - 2 | 0; $4_1 = $0_1; $3 = $0_1 + HEAP32[$1_1 >> 2] | 0; $0_1 = HEAP32[$1_1 + 4 >> 2] + ($0_1 >> 31) | 0; HEAP32[$1_1 >> 2] = $3; HEAP32[$1_1 + 4 >> 2] = $3 >>> 0 < $4_1 >>> 0 ? $0_1 + 1 | 0 : $0_1; $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1841($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (($2_1 | 0) < 0) { $2_1 = $2080($1_1) } $5_1 = HEAP32[$0_1 >> 2]; $6_1 = HEAP32[$0_1 + 8 >> 2]; $3 = HEAP32[$0_1 + 4 >> 2]; if (($6_1 | 0) <= (($3 + $2_1 | 0) + 1 | 0)) { $4_1 = ($2_1 >> 31) + ($6_1 >> 31) | 0; $3 = $2_1 + $6_1 | 0; $4_1 = $3 >>> 0 < $6_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; $3 = $3 + 100 | 0; $4_1 = $3 >>> 0 < 100 ? $4_1 + 1 | 0 : $4_1; $5_1 = $34($5_1, $3, $4_1); if (!$5_1) { return 7 } HEAP32[$0_1 + 8 >> 2] = $3; HEAP32[$0_1 >> 2] = $5_1; $3 = HEAP32[$0_1 + 4 >> 2]; } if ($2_1) { wasm2js_memory_copy($3 + $5_1 | 0, $1_1, $2_1) } $1_1 = HEAP32[$0_1 + 4 >> 2] + $2_1 | 0; HEAP32[$0_1 + 4 >> 2] = $1_1; HEAP8[$1_1 + HEAP32[$0_1 >> 2] | 0] = 0; return 0; } function $1842($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0; $3 = global$0 - 176 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; block : { if ($1835($0_1, 4201, HEAP32[$2_1 >> 2], $3 + 28 | 0)) { break block } $4_1 = HEAP32[$3 + 28 >> 2]; if ($1750($0_1, $4_1)) { break block } $9_1 = HEAP32[$4_1 >> 2]; $12_1 = HEAP32[HEAP32[$9_1 + 36 >> 2] >> 2]; HEAP32[$3 + 168 >> 2] = 0; HEAP32[$3 + 160 >> 2] = 0; HEAP32[$3 + 164 >> 2] = 0; if (!HEAP32[$4_1 + 16 >> 2]) { $246($0_1, 30822, 0, 0); break block; } $6_1 = $3 + 128 | 0; $1_1 = $6_1 + 24 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $3 + 144 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $1_1 = $6_1 + 8 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$3 + 128 >> 2] = 0; HEAP32[$3 + 132 >> 2] = 0; $2_1 = $1836($4_1, 0, $3 + 172 | 0); block2 : { if ($2_1) { break block2 } $1_1 = $1642(Math_imul(HEAP32[$3 + 172 >> 2], 24), 0); HEAP32[$3 + 152 >> 2] = $1_1; block3 : { if (!$1_1) { break block3 } $1_1 = HEAP32[$4_1 + 36 >> 2]; $2_1 = HEAP32[$4_1 + 32 >> 2]; HEAP32[$3 + 128 >> 2] = $4_1; HEAP32[$3 + 144 >> 2] = $2_1; HEAP32[$3 + 148 >> 2] = $1_1; $2_1 = $1838(HEAP32[$4_1 + 16 >> 2], 117, $6_1); if ($2_1) { break block2 } $1_1 = 0; while (1) { if (($1_1 | 0) >= HEAP32[$9_1 + 24 >> 2]) { $2_1 = 0; break block2; } HEAP32[$3 + 116 >> 2] = 0; HEAP32[$3 + 112 >> 2] = 0; HEAP32[$3 + 108 >> 2] = 0; HEAP32[$3 + 136 >> 2] = 0; HEAP32[$3 + 132 >> 2] = $1_1; HEAP32[$3 + 104 >> 2] = 0; $2_1 = $1838(HEAP32[$4_1 + 16 >> 2], 118, $3 + 128 | 0); if ($2_1) { break block2 } $10_1 = $1_1 + 1 | 0; $2_1 = $124(HEAP32[$4_1 + 12 >> 2], $10_1); $5_1 = $274(HEAP32[$4_1 + 12 >> 2], $10_1); block6 : { if (!$2_1) { if (($125(HEAP32[$4_1 + 12 >> 2], $10_1) | 0) != 5) { break block3 } break block6; } $2_1 = $1789(HEAP32[$9_1 + 36 >> 2], HEAP32[$4_1 + 20 >> 2], $2_1, $5_1, $3 + 124 | 0); if ($2_1) { break block2 } $11_1 = HEAP32[$3 + 124 >> 2]; $2_1 = FUNCTION_TABLE[HEAP32[$12_1 + 20 >> 2]]($11_1, $3 + 120 | 0, $3 + 116 | 0, $3 + 112 | 0, $3 + 108 | 0, $3 + 104 | 0) | 0; while (1) { $5_1 = HEAP32[$3 + 172 >> 2]; $15_1 = ($5_1 | 0) > 0 ? $5_1 : 0; $16_1 = HEAP32[$3 + 152 >> 2]; block7 : { while (1) { if ($2_1) { break block7 } $2_1 = 0; $5_1 = 2147483647; $6_1 = 0; while (1) { if (!(($2_1 | 0) == ($15_1 | 0))) { $8_1 = Math_imul($2_1, 24) + $16_1 | 0; if (HEAP32[$8_1 >> 2]) { $13_1 = HEAP32[$8_1 + 8 >> 2]; $14 = HEAP32[$8_1 + 16 >> 2]; $7_1 = $13_1 - $14 | 0; $17_1 = $7_1; $18_1 = $5_1; $19_1 = $5_1 >>> 0 > $7_1 >>> 0; $7_1 = HEAP32[$8_1 + 12 >> 2] - (HEAP32[$8_1 + 20 >> 2] + ($13_1 >>> 0 < $14 >>> 0) | 0) | 0; $5_1 = $5_1 >> 31; $7_1 = $19_1 & ($7_1 | 0) <= ($5_1 | 0) | ($5_1 | 0) > ($7_1 | 0); $5_1 = $7_1 ? $17_1 : $18_1; $6_1 = $7_1 ? $8_1 : $6_1; } $2_1 = $2_1 + 1 | 0; continue; } break; }; $2_1 = 101; if (!$6_1) { continue } break; }; block11 : { if (HEAPU8[HEAP32[$6_1 >> 2]] <= 1) { HEAP32[$6_1 >> 2] = 0; break block11; } $1840($6_1, $6_1 + 8 | 0); } $2_1 = 0; $11_1 = HEAP32[$3 + 124 >> 2]; while (1) { if (!(HEAP32[$3 + 104 >> 2] >= ($5_1 | 0) | $2_1)) { $2_1 = FUNCTION_TABLE[HEAP32[$12_1 + 20 >> 2]]($11_1, $3 + 120 | 0, $3 + 116 | 0, $3 + 112 | 0, $3 + 108 | 0, $3 + 104 | 0) | 0; continue; } break; }; if (!$2_1) { HEAP32[$3 >> 2] = $1_1; $2_1 = HEAP32[$3 + 112 >> 2]; HEAP32[$3 + 8 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = HEAP32[$3 + 108 >> 2] - $2_1; HEAP32[$3 + 4 >> 2] = ($6_1 - HEAP32[$3 + 152 >> 2] | 0) / 24; $2_1 = $1841($3 + 160 | 0, $63(64, $3 + 32 | 0, 30200, $3), -1); continue; } if (($2_1 | 0) != 101) { continue } $2_1 = HEAP32[$9_1 + 40 >> 2] ? 101 : 267; continue; } break; }; FUNCTION_TABLE[HEAP32[$12_1 + 16 >> 2]]($11_1) | 0; if (($2_1 | 0) != 101) { break block2 } } $1_1 = $10_1; continue; }; } $2_1 = 7; } $24(HEAP32[$3 + 152 >> 2]); $1660($9_1); if ($2_1) { $255($0_1, $2_1); $24(HEAP32[$3 + 160 >> 2]); break block; } $246($0_1, HEAP32[$3 + 160 >> 2], HEAP32[$3 + 164 >> 2] - 1 | 0, 1); } $0_1 = $3 + 176 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1843($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; $3 = global$0 - 16 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $1_1 = HEAP32[$0_1 + 20 >> 2]; if (!(!$1_1 | !HEAP32[$1_1 + 40 >> 2])) { $2_1 = HEAP32[$2_1 >> 2]; HEAP32[$3 + 12 >> 2] = 0; if (!HEAPU8[$0_1 + 32 | 0]) { $1_1 = HEAP32[$0_1 + 24 >> 2]; $5_1 = HEAP32[$0_1 + 28 >> 2]; $1859($2_1, $0_1, $3 + 12 | 0); while (1) { $4_1 = HEAP32[$3 + 12 >> 2]; if (!($4_1 | HEAP32[$0_1 + 24 >> 2] == ($1_1 | 0) & ($5_1 | 0) == HEAP32[$0_1 + 28 >> 2])) { $1746($2_1, $0_1, $3 + 12 | 0); if (!HEAPU8[$0_1 + 32 | 0]) { continue } HEAP32[$3 + 12 >> 2] = 267; continue; } break; }; $1_1 = HEAP32[$0_1 + 20 >> 2]; } HEAP32[$1_1 + 40 >> 2] = 0; } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1 | 0; } function $1844($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; $3 = global$0 - 16 | 0; $1_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $1_1; $1_1 = 0; HEAP32[$3 >> 2] = 0; HEAP32[$3 + 4 >> 2] = 0; $4_1 = $3 + 12 | 0; $8_1 = $1855(HEAP32[$2_1 >> 2], $0_1, HEAP32[$2_1 + 4 >> 2], $4_1); $6_1 = HEAP32[HEAP32[$0_1 + 20 >> 2] + 64 >> 2]; $0_1 = 0; if (HEAP32[$3 + 12 >> 2]) { $1840($4_1, $3); $9_1 = HEAP32[$3 + 4 >> 2]; $10_1 = HEAP32[$3 + 12 >> 2]; $0_1 = HEAP32[$3 >> 2]; } $11_1 = ($6_1 | 0) > 0 ? $6_1 : 0; while (1) { if (!(!$1_1 & ($5_1 | 0) == ($11_1 | 0))) { $4_1 = HEAP32[$2_1 + 8 >> 2]; HEAP32[$2_1 + 8 >> 2] = $4_1 + 1; $4_1 = HEAP32[$2_1 + 24 >> 2] + Math_imul($4_1, 24) | 0; HEAP32[$4_1 + 8 >> 2] = $0_1; HEAP32[$4_1 + 12 >> 2] = $9_1; HEAP32[$4_1 >> 2] = $10_1; $7_1 = ($5_1 ^ -1) + $6_1 | 0; HEAP32[$4_1 + 16 >> 2] = $7_1; HEAP32[$4_1 + 20 >> 2] = $7_1 >> 31; $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; continue; } break; }; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $8_1 | 0; } function $1845($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block : { if ($1835($0_1, 12951, HEAP32[$2_1 >> 2], $1_1 + 12 | 0)) { break block } $3 = HEAP32[HEAP32[$1_1 + 12 >> 2] >> 2]; $2_1 = $97(HEAP32[$3 + 12 >> 2], 23599, 0, 0, 0); block1 : { if ($2_1) { break block1 } $2_1 = $1753($3, 1); if (!($2_1 ? ($2_1 | 0) != 101 : 0)) { $4_1 = $97(HEAP32[$3 + 12 >> 2], 23631, 0, 0, 0); $2_1 = $4_1 ? $4_1 : $2_1; break block1; } $97(HEAP32[$3 + 12 >> 2], 23614, 0, 0, 0); $97(HEAP32[$3 + 12 >> 2], 23631, 0, 0, 0); } $1660($3); block5 : { if (($2_1 | 0) != 101) { if ($2_1) { break block5 } $246($0_1, 15359, -1, 0); break block; } $246($0_1, 11933, -1, 0); break block; } $255($0_1, $2_1); } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1846($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0, $21_1 = 0; $3 = global$0 - 80 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; block : { if ($1835($0_1, 10222, HEAP32[$2_1 >> 2], $3 + 12 | 0)) { break block } $4_1 = 0; if (($1_1 | 0) >= 2) { $4_1 = $53(HEAP32[$2_1 + 4 >> 2]) } $6_1 = HEAP32[$3 + 12 >> 2]; $1_1 = HEAP32[$6_1 + 16 >> 2]; if (!$1_1) { $225($0_1, 30822, 0, 0); break block; } $14 = $4_1 ? $4_1 : 1611; $15_1 = HEAP32[$6_1 >> 2]; $2_1 = $3 + 40 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $2_1 = $3 + 32 | 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; HEAP32[$3 + 24 >> 2] = 0; HEAP32[$3 + 28 >> 2] = 0; HEAP32[$3 + 16 >> 2] = $6_1; HEAP32[$3 + 20 >> 2] = HEAP32[$15_1 + 24 >> 2]; block15 : { block35 : { block13 : { block5 : { $2_1 = HEAP32[$6_1 + 92 >> 2]; if ($2_1) { if (!$2073(HEAP32[$2_1 + 12 >> 2], $14)) { $13_1 = 1; break block5; } $1785($2_1); HEAP32[$6_1 + 92 >> 2] = 0; $1_1 = HEAP32[$6_1 + 16 >> 2]; } HEAP32[$3 + 64 >> 2] = 0; $1838($1_1, 119, $3 - -64 | 0); $1_1 = HEAP32[$3 + 64 >> 2]; HEAP32[$6_1 + 24 >> 2] = $1_1; HEAP32[$3 + 24 >> 2] = $1_1; $4_1 = 0; $1_1 = 0; while (1) { block8 : { block10 : { block7 : { $2_1 = HEAPU8[$1_1 + $14 | 0]; if ($2_1) { $5_1 = $2_1 << 24 >> 24; HEAP32[$3 + 64 >> 2] = 0; $7_1 = $2_1 - 108 | 0; if ($7_1 >>> 0 > 13) { break block7 } if (1 << $7_1 & 12432) { break block8 } if ($7_1) { if (($7_1 | 0) != 2) { break block7 } if (HEAPU8[$15_1 + 236 | 0]) { break block8 } break block10; } if (!HEAPU8[$15_1 + 238 | 0]) { break block10 } break block8; } $1_1 = $4_1 >>> 29 | 0; $7_1 = $2080($14); $5_1 = $4_1 << 3; $2_1 = $5_1 + $7_1 | 0; $1_1 = $7_1 >>> 0 > $2_1 >>> 0 ? $1_1 + 1 | 0 : $1_1; $2_1 = $2_1 + 25 | 0; $1_1 = $2_1 >>> 0 < 25 ? $1_1 + 1 | 0 : $1_1; $2_1 = $1642($2_1, $1_1); if ($2_1) { HEAP32[$2_1 + 16 >> 2] = 20; $1_1 = $4_1 << 2; HEAP32[($1_1 + $2_1 | 0) + 20 >> 2] = $1_1 + 24; $1_1 = ($2_1 + $5_1 | 0) + 24 | 0; HEAP32[$2_1 + 12 >> 2] = $1_1; HEAP32[$2_1 + 4 >> 2] = $4_1; $4_1 = $7_1 + 1 | 0; if ($4_1) { wasm2js_memory_copy($1_1, $14, $4_1) } HEAP8[$2_1 | 0] = 1; HEAP32[$6_1 + 88 >> 2] = 1; HEAP32[$6_1 + 92 >> 2] = $2_1; break block5; } HEAP32[$6_1 + 88 >> 2] = 1; HEAP32[$6_1 + 92 >> 2] = 0; break block13; } block14 : { switch ($2_1 - 97 | 0) { case 0: break block14; case 1: case 2: break block8; default: break block10; }; } if (HEAPU8[$15_1 + 236 | 0]) { break block8 } } HEAP32[$3 >> 2] = $5_1; $1655($3 - -64 | 0, 18060, $3); $1_1 = $0_1; $0_1 = HEAP32[$3 + 64 >> 2]; $235($1_1, $0_1, -1); $24($0_1); break block15; } $1_1 = $1_1 + 1 | 0; $4_1 = $1848($3 + 16 | 0, $5_1) + $4_1 | 0; continue; }; } block17 : { if (!HEAPU8[$2_1 + 1 | 0]) { HEAP8[$2_1 + 1 | 0] = 1; $7_1 = $2_1 + 20 | 0; $16_1 = 120; break block17; } if (!HEAPU8[$2_1 + 2 | 0]) { HEAP8[$2_1 + 2 | 0] = 1; $7_1 = ((HEAP32[$2_1 + 4 >> 2] << 2) + $2_1 | 0) + 24 | 0; $16_1 = 120; break block17; } $7_1 = $31(HEAP32[$2_1 + 4 >> 2] << 2, 0); if (!$7_1) { break block13 } $16_1 = 1; if (!HEAP32[$2_1 + 8 >> 2]) { break block17 } $1_1 = HEAP32[$2_1 + 4 >> 2] << 2; if (!$1_1) { break block17 } wasm2js_memory_copy($7_1, $2_1 + 20 | 0, $1_1); } HEAP32[$3 + 44 >> 2] = $7_1; HEAP32[$3 + 24 >> 2] = HEAP32[$6_1 + 24 >> 2]; $17_1 = HEAP32[$6_1 >> 2]; HEAP32[$3 + 72 >> 2] = 0; $20_1 = $3 + 32 | 0; $4_1 = $7_1; $2_1 = 0; while (1) { block30 : { block20 : { block33 : { block24 : { block27 : { block31 : { block21 : { block29 : { block19 : { if ($2_1) { break block19 } $19_1 = $14 + $18_1 | 0; $1_1 = HEAPU8[$19_1 | 0]; if (!$1_1) { break block19 } $2_1 = $1_1 << 24 >> 24; HEAP8[$3 + 40 | 0] = $2_1; block26 : { block22 : { block28 : { block23 : { switch ($1_1 - 108 | 0) { default: switch ($1_1 - 97 | 0) { case 0: break block26; case 1: break block27; case 2: break block28; default: break block29; }; case 0: break block20; case 1: case 3: case 5: case 6: break block21; case 2: break block22; case 4: break block23; case 7: break block24; }; } $2_1 = 0; if ($13_1) { break block30 } HEAP32[$4_1 >> 2] = HEAP32[$3 + 24 >> 2]; break block30; } $2_1 = 0; if ($13_1) { break block30 } HEAP32[$4_1 >> 2] = HEAP32[$3 + 20 >> 2]; break block30; } if ($13_1) { break block31 } HEAP32[$3 + 64 >> 2] = 0; HEAP32[$3 + 68 >> 2] = 0; $2_1 = $1850($17_1, $3 + 72 | 0, $3 - -64 | 0, 0, 0); HEAP32[$3 + 76 >> 2] = $2_1; HEAP32[HEAP32[$3 + 44 >> 2] >> 2] = HEAP32[$3 + 64 >> 2]; break block30; } if ($13_1) { break block31 } $2_1 = $1850($17_1, $3 + 72 | 0, $3 - -64 | 0, $3 + 60 | 0, $3 + 56 | 0); HEAP32[$3 + 76 >> 2] = $2_1; if ($2_1) { break block30 } $2_1 = HEAP32[$3 + 68 >> 2]; $10_1 = $2_1; $9_1 = HEAP32[$3 + 64 >> 2]; $4_1 = __wasm_i64_sdiv($9_1, $2_1, 2, 0); $5_1 = i64toi32_i32$HIGH_BITS; $2_1 = 0; $1_1 = 0; while (1) { if (HEAP32[$3 + 20 >> 2] <= ($1_1 | 0)) { break block30 } $8_1 = $1668(HEAP32[$3 + 60 >> 2], $3 + 48 | 0) + HEAP32[$3 + 60 >> 2] | 0; HEAP32[$3 + 60 >> 2] = $8_1; if (HEAPU32[$3 + 56 >> 2] < $8_1 >>> 0) { $2_1 = 267; break block33; } else { $11_1 = HEAP32[$3 + 44 >> 2] + ($1_1 << 2) | 0; $12_1 = $4_1 + HEAP32[$3 + 48 >> 2] | 0; $8_1 = $12_1 >>> 0 < $4_1 >>> 0 ? $5_1 + 1 | 0 : $5_1; HEAP32[$11_1 >> 2] = __wasm_i64_sdiv($12_1, $8_1, $9_1, $10_1); $1_1 = $1_1 + 1 | 0; continue; } }; } $96(HEAP32[$3 + 72 >> 2]); block34 : { if ($13_1) { break block34 } $1_1 = HEAP32[$6_1 + 92 >> 2]; $5_1 = $1_1 + 8 | 0; HEAP32[$5_1 >> 2] = 1; $4_1 = HEAP32[$1_1 + 4 >> 2] << 2; if (!$4_1) { break block34 } wasm2js_memory_copy(($4_1 + $5_1 | 0) + 16 | 0, $1_1 + 20 | 0, $4_1); } if ($2_1) { break block35 } $225($0_1, $7_1, HEAP32[HEAP32[$6_1 + 92 >> 2] + 4 >> 2] << 2, $16_1); break block15; } if (($1_1 | 0) == 121) { break block27 } } $1_1 = HEAP32[$6_1 + 16 >> 2]; $2_1 = $1836($6_1, 0, 0); HEAP32[$3 + 76 >> 2] = $2_1; if ($2_1) { break block30 } if (!$13_1) { if (HEAP32[$6_1 + 28 >> 2]) { $2_1 = $1850($17_1, $3 + 72 | 0, $20_1, 0, 0); HEAP32[$3 + 76 >> 2] = $2_1; if ($2_1) { break block30 } } HEAP32[$3 + 76 >> 2] = $1838($1_1, 121, $3 + 16 | 0); $1747($6_1, $3 + 76 | 0); $2_1 = HEAP32[$3 + 76 >> 2]; if ($2_1) { break block30 } } $1838($1_1, 122, $3 + 16 | 0); } $2_1 = 0; break block30; } $1_1 = $1848($3 + 16 | 0, $2_1) << 2; if ($1_1) { wasm2js_memory_fill($4_1, 0, $1_1) } $2_1 = $1853(HEAP32[$6_1 + 16 >> 2], $3 + 16 | 0); break block33; } $2_1 = $1836($6_1, 0, 0); HEAP32[$3 + 76 >> 2] = $2_1; if ($2_1) { break block30 } $9_1 = $1642(HEAP32[$6_1 + 24 >> 2] << 4, 0); if (!$9_1) { $2_1 = 7; break block33; } $1838(HEAP32[$6_1 + 16 >> 2], 123, $9_1); $10_1 = 0; $1_1 = HEAP32[$3 + 24 >> 2]; $4_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $1_1 = 0; $2_1 = 0; while (1) { if (!(($2_1 | 0) == ($4_1 | 0))) { $5_1 = ($2_1 << 4) + $9_1 | 0; $1_1 = $1_1 - HEAP32[HEAP32[HEAP32[$5_1 >> 2] + 20 >> 2] + 64 >> 2] | 0; HEAP32[$5_1 + 4 >> 2] = $1_1; $2_1 = $2_1 + 1 | 0; continue; } break; }; while (1) { $12_1 = 0; $11_1 = 0; $4_1 = 0; block46 : { block42 : { if (($10_1 | 0) >= HEAP32[$3 + 20 >> 2]) { $2_1 = 0; break block42; } while (1) { if (($4_1 | 0) < HEAP32[$3 + 24 >> 2]) { $1_1 = ($4_1 << 4) + $9_1 | 0; $5_1 = $1_1 + 8 | 0; $2_1 = $1855($6_1, HEAP32[$1_1 >> 2], $10_1, $5_1); if ($2_1) { break block42 } if (HEAP32[$5_1 >> 2]) { HEAP32[$1_1 + 12 >> 2] = HEAP32[$1_1 + 4 >> 2]; $1856($1_1); if (!HEAP32[$1_1 + 8 >> 2]) { $2_1 = 267; break block42; } $11_1 = $11_1 + 1 | 0; } $4_1 = $4_1 + 1 | 0; continue; } break; }; while (1) { if (($11_1 | 0) <= 0) { break block46 } $2_1 = 0; $1_1 = HEAP32[$3 + 24 >> 2]; $21_1 = ($1_1 | 0) > 0 ? $1_1 : 0; $5_1 = 0; $4_1 = 0; while (1) { if (!(($2_1 | 0) == ($21_1 | 0))) { $8_1 = ($2_1 << 4) + $9_1 | 0; block49 : { if (!HEAP32[$8_1 + 8 >> 2]) { $1_1 = 0; break block49; } if (!(!!$5_1 & HEAP32[$8_1 + 12 >> 2] >= HEAP32[$5_1 + 12 >> 2])) { $5_1 = $8_1 } block53 : { if ($4_1) { $1_1 = 1; if (HEAP32[$8_1 + 12 >> 2] != HEAP32[$8_1 - 4 >> 2]) { break block53 } } $1_1 = $4_1 + 1 | 0; } $12_1 = ($1_1 | 0) > ($12_1 | 0) ? $1_1 : $12_1; } $2_1 = $2_1 + 1 | 0; $4_1 = $1_1; continue; } break; }; $11_1 = $11_1 - $1856($5_1) | 0; continue; }; } $24($9_1); break block33; } HEAP32[HEAP32[$3 + 44 >> 2] + ($10_1 << 2) >> 2] = $12_1; $10_1 = $10_1 + 1 | 0; continue; }; } HEAP32[$3 + 76 >> 2] = $2_1; break block30; } $1_1 = HEAP32[$6_1 + 32 >> 2]; $5_1 = HEAP32[$6_1 + 36 >> 2]; HEAP32[$3 + 64 >> 2] = 0; $2_1 = $1675($17_1, 21, $3 - -64 | 0, 0); $4_1 = HEAP32[$3 + 64 >> 2]; block57 : { block56 : { if (!$2_1) { $283($4_1, 1, $1_1, $5_1); if (($94($4_1) | 0) == 100) { if (($125($4_1, 0) | 0) == 4) { break block56 } } $1_1 = $96($4_1); $2_1 = $1_1 ? $1_1 : 267; $4_1 = 0; } HEAP32[$3 + 76 >> 2] = $2_1; break block57; } $2_1 = 0; HEAP32[$3 + 76 >> 2] = 0; $1_1 = $273($4_1, 0); $5_1 = $1_1 + $274($4_1, 0) | 0; while (1) { if (HEAP32[$3 + 20 >> 2] <= ($2_1 | 0)) { break block57 } $1_1 = $1793($1_1, $5_1, $3 - -64 | 0) + $1_1 | 0; if ($1_1 >>> 0 > $5_1 >>> 0) { HEAP32[$3 + 76 >> 2] = 267 } else { HEAP32[HEAP32[$3 + 44 >> 2] + ($2_1 << 2) >> 2] = HEAP32[$3 + 64 >> 2]; $2_1 = $2_1 + 1 | 0; continue; } break; }; } $96($4_1); $2_1 = HEAP32[$3 + 76 >> 2]; } $4_1 = HEAP32[$3 + 44 >> 2] + ($1848($3 + 16 | 0, HEAP8[$19_1 | 0]) << 2) | 0; HEAP32[$3 + 44 >> 2] = $4_1; $18_1 = $18_1 + 1 | 0; continue; }; } $7_1 = 0; $2_1 = 7; } $255($0_1, $2_1); if (!$16_1) { break block15 } FUNCTION_TABLE[$16_1 | 0]($7_1); } $1660($15_1); } $0_1 = $3 + 80 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1847($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; HEAP32[$2_1 >> 2] = HEAP32[$2_1 >> 2] + 1; HEAP32[$0_1 + 36 >> 2] = $1_1; return 0; } function $1848($0_1, $1_1) { var $2_1 = 0; $2_1 = 1; block6 : { block2 : { block1 : { block5 : { block4 : { block : { block3 : { switch ($1_1 - 108 | 0) { case 0: case 7: break block; case 1: case 3: case 5: case 6: break block1; case 2: case 4: break block2; default: break block3; }; } switch ($1_1 - 97 | 0) { case 0: break block; case 2: break block2; case 1: break block4; default: break block5; }; } return HEAP32[$0_1 + 4 >> 2]; } return Math_imul(HEAP32[$0_1 + 8 >> 2], (HEAP32[$0_1 + 4 >> 2] + 31 | 0) / 32 | 0); } if (($1_1 | 0) == 121) { break block6 } } $2_1 = Math_imul(Math_imul(HEAP32[$0_1 + 4 >> 2], HEAP32[$0_1 + 8 >> 2]), 3); } return $2_1; } return Math_imul(HEAP32[$0_1 + 8 >> 2], HEAP32[$0_1 + 4 >> 2]); } function $1849($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $0_1; $0_1 = $0_1 - HEAP32[$0_1 - 4 >> 2] | 0; block1 : { if (($1_1 | 0) == ($0_1 + 20 | 0)) { HEAP8[$0_1 + 1 | 0] = 0; break block1; } HEAP8[$0_1 + 2 | 0] = 0; } if (!(HEAPU8[$0_1 + 2 | 0] | (HEAPU8[$0_1 | 0] | HEAPU8[$0_1 + 1 | 0]))) { $24($0_1) } } function $1850($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $6_1 = global$0 - 16 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; $5_1 = HEAP32[$1_1 >> 2]; block1 : { if (!$5_1) { $0_1 = $1792($0_1, $1_1); if ($0_1) { break block1 } $5_1 = HEAP32[$1_1 >> 2]; } $0_1 = 267; $8_1 = $274($5_1, 0); $5_1 = $273($5_1, 0); if (!$5_1) { break block1 } $9_1 = $5_1 + $8_1 | 0; $10_1 = $1793($5_1, $9_1, $6_1 + 8 | 0); $1_1 = HEAP32[$6_1 + 8 >> 2]; $7_1 = HEAP32[$6_1 + 12 >> 2]; if (!$1_1 & ($7_1 | 0) <= 0 | ($7_1 | 0) < 0 | ($8_1 | 0) < ($10_1 | 0)) { break block1 } HEAP32[$2_1 >> 2] = $1_1; HEAP32[$2_1 + 4 >> 2] = $7_1; if ($3) { HEAP32[$3 >> 2] = $5_1 + $10_1 } $0_1 = 0; if (!$4_1) { break block1 } HEAP32[$4_1 >> 2] = $9_1; } $1_1 = $6_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1851($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 - 16 | 0; $3 = $6_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $9_1 = HEAP32[$2_1 + 28 >> 2] + Math_imul(Math_imul(HEAP32[$2_1 + 4 >> 2], $1_1), 12) | 0; $4_1 = HEAP32[$2_1 >> 2]; $7_1 = HEAP32[$4_1 >> 2]; block1 : { if (!(!HEAPU8[$0_1 + 34 | 0] | HEAP32[HEAP32[$0_1 + 8 >> 2] >> 2] == 1)) { $1_1 = 0; while (1) { if (HEAP32[$7_1 + 24 >> 2] <= ($1_1 | 0)) { break block1 } $2_1 = Math_imul($1_1, 12) + $9_1 | 0; $0_1 = HEAP32[$4_1 + 64 >> 2]; HEAP32[$2_1 + 8 >> 2] = $0_1; HEAP32[$2_1 + 4 >> 2] = $0_1; $1_1 = $1_1 + 1 | 0; continue; }; } if (!HEAP32[$0_1 + 40 >> 2]) { $2_1 = HEAP32[$4_1 + 32 >> 2]; $12_1 = HEAP32[$4_1 + 36 >> 2]; $1_1 = $0_1; while (1) { $3 = $1_1; $1_1 = HEAP32[$3 + 8 >> 2]; if ($1_1) { if (HEAPU8[$3 + 34 | 0] | HEAP32[$1_1 >> 2] == 1) { continue } } break; }; $10_1 = HEAPU8[$3 + 32 | 0]; $1_1 = HEAP32[$3 + 24 >> 2]; $13_1 = HEAP32[$3 + 28 >> 2]; $5_1 = $1838($3, 124, $7_1); HEAP32[$6_1 + 12 >> 2] = $5_1; if ($5_1) { break block1 } $1859($4_1, $3, $6_1 + 12 | 0); while (1) { $5_1 = HEAP32[$6_1 + 12 >> 2]; if (!($5_1 | HEAPU8[$4_1 + 6 | 0])) { while (1) { if (!HEAPU8[$4_1 + 7 | 0]) { $96(HEAP32[$4_1 + 12 >> 2]) } $11_1 = $6_1 + 12 | 0; $1746($4_1, $3, $11_1); $5_1 = HEAPU8[$3 + 32 | 0]; HEAP32[$4_1 + 88 >> 2] = 1; HEAP8[$4_1 + 7 | 0] = 1; HEAP8[$4_1 + 6 | 0] = $5_1; $8_1 = HEAP32[$3 + 28 >> 2]; HEAP32[$4_1 + 32 >> 2] = HEAP32[$3 + 24 >> 2]; HEAP32[$4_1 + 36 >> 2] = $8_1; if (!(HEAP32[$3 >> 2] != 1 | $5_1)) { if ($1747($4_1, $11_1)) { continue } } break; }; if (HEAP32[$6_1 + 12 >> 2] | HEAPU8[$4_1 + 6 | 0]) { continue } $1862($3, HEAP32[$7_1 + 24 >> 2]); continue; } break; }; HEAP32[$4_1 + 32 >> 2] = $2_1; HEAP32[$4_1 + 36 >> 2] = $12_1; HEAP8[$4_1 + 6 | 0] = 0; block8 : { if ($10_1) { HEAP8[$3 + 32 | 0] = $10_1; break block8; } $1859($4_1, $3, $6_1 + 12 | 0); while (1) { $1746($4_1, $3, $6_1 + 12 | 0); if (HEAPU8[$3 + 32 | 0]) { HEAP32[$6_1 + 12 >> 2] = 267; $5_1 = 267; } else { $5_1 = HEAP32[$6_1 + 12 >> 2] } if (HEAP32[$3 + 24 >> 2] == ($1_1 | 0) & ($13_1 | 0) == HEAP32[$3 + 28 >> 2]) { break block8 } if (!$5_1) { continue } break; }; } if ($5_1) { break block1 } } $5_1 = 0; $2_1 = 0; while (1) { if (HEAP32[$7_1 + 24 >> 2] <= ($2_1 | 0)) { break block1 } $8_1 = Math_imul($2_1, 12); $1_1 = $8_1 + 4 | 0; $3 = HEAP32[$0_1 + 40 >> 2]; HEAP32[$1_1 + $9_1 >> 2] = HEAP32[$3 + $1_1 >> 2]; $1_1 = $8_1 + 8 | 0; HEAP32[$1_1 + $9_1 >> 2] = HEAP32[$1_1 + $3 >> 2]; $2_1 = $2_1 + 1 | 0; continue; }; } $0_1 = $6_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1 | 0; } function $1852($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = HEAP32[$2_1 + 4 >> 2]; $6_1 = Math_imul($4_1, $1_1); $1_1 = 0; while (1) { if (!($5_1 | ($1_1 | 0) >= ($4_1 | 0))) { $5_1 = $1855(HEAP32[$2_1 >> 2], $0_1, $1_1, $3 + 12 | 0); if (HEAP32[$3 + 12 >> 2]) { $4_1 = $1860($3 + 12 | 0) } else { $4_1 = 0 } HEAP32[HEAP32[$2_1 + 28 >> 2] + Math_imul($1_1 + $6_1 | 0, 12) >> 2] = $4_1; $1_1 = $1_1 + 1 | 0; $4_1 = HEAP32[$2_1 + 4 >> 2]; continue; } break; }; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1 | 0; } function $1853($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; block : { while (1) { $2_1 = 0; if (HEAPU8[$0_1 + 32 | 0]) { break block } $3 = HEAP32[$1_1 >> 2]; if (HEAP32[$0_1 + 24 >> 2] != HEAP32[$3 + 32 >> 2] | HEAP32[$0_1 + 28 >> 2] != HEAP32[$3 + 36 >> 2]) { break block } $2_1 = HEAP32[$0_1 + 12 >> 2]; if ($2_1) { $2_1 = $1853($2_1, $1_1); if ($2_1) { break block } $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; $7_1 = HEAP32[$3 >> 2]; $6_1 = HEAP32[$0_1 + 20 >> 2]; $3 = HEAP32[$6_1 + 28 >> 2]; HEAP32[$4_1 + 12 >> 2] = $3; $2_1 = HEAP32[$1_1 + 4 >> 2]; $0_1 = HEAP32[$0_1 + 36 >> 2]; $5_1 = HEAPU8[$1_1 + 24 | 0]; if (($5_1 | 0) != 121) { $2_1 = ($2_1 + 31 | 0) / 32 | 0 } block3 : { if (!$3) { break block3 } $2_1 = Math_imul($0_1, $2_1); $0_1 = 0; $8_1 = ($5_1 | 0) != 121; while (1) { $3 = $1860($4_1 + 12 | 0); $5_1 = HEAP32[$6_1 + 68 >> 2]; block5 : { if (($0_1 | 0) != ($5_1 | 0) & ($5_1 | 0) < HEAP32[$7_1 + 24 >> 2]) { break block5 } if (!$8_1) { HEAP32[(HEAP32[$1_1 + 28 >> 2] + ($2_1 << 2) | 0) + ($0_1 << 2) >> 2] = $3; break block5; } if (!$3) { break block5 } $3 = (HEAP32[$1_1 + 28 >> 2] + ($2_1 << 2) | 0) + (($0_1 + 1 | 0) / 32 << 2) | 0; HEAP32[$3 >> 2] = HEAP32[$3 >> 2] | 1 << $0_1; } $0_1 = HEAP32[$4_1 + 12 >> 2]; if (HEAPU8[$0_1 | 0] != 1) { break block3 } $3 = $0_1 + 1 | 0; $0_1 = HEAP8[$0_1 + 1 | 0]; block8 : { if (($0_1 | 0) < 0) { $5_1 = $1681($3, $4_1 + 8 | 0); $0_1 = HEAP32[$4_1 + 8 >> 2]; break block8; } HEAP32[$4_1 + 8 >> 2] = $0_1; $5_1 = 1; } HEAP32[$4_1 + 12 >> 2] = $3 + $5_1; if (HEAP32[$1_1 + 4 >> 2] > ($0_1 | 0)) { continue } break; }; $2_1 = 267; break block; } $2_1 = 0; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1854($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; HEAP32[($1_1 << 4) + $2_1 >> 2] = $0_1; return 0; } function $1855($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0; $4_1 = global$0 - 48 | 0; $8_1 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $8_1; $8_1 = HEAP32[$0_1 >> 2]; $13_1 = HEAP32[$1_1 + 20 >> 2]; HEAP32[$3 >> 2] = 0; $6_1 = HEAP32[$13_1 + 68 >> 2]; block1 : { if (($2_1 | 0) != ($6_1 | 0) & ($6_1 | 0) < HEAP32[$8_1 + 24 >> 2]) { break block1 } $6_1 = HEAP32[$1_1 + 28 >> 2]; $5_1 = HEAP32[$1_1 + 24 >> 2]; HEAP32[$4_1 + 16 >> 2] = $5_1; HEAP32[$4_1 + 20 >> 2] = $6_1; $7_1 = HEAP32[$13_1 + 28 >> 2]; HEAP32[$4_1 + 28 >> 2] = $7_1; block3 : { if (!(HEAP32[$0_1 + 32 >> 2] != ($5_1 | 0) | HEAP32[$0_1 + 36 >> 2] != ($6_1 | 0) | HEAPU8[$1_1 + 32 | 0])) { break block3 } $5_1 = 0; HEAP32[$4_1 + 12 >> 2] = 0; $12_1 = HEAPU8[$8_1 + 239 | 0]; $7_1 = 0; $8_1 = $1_1; while (1) { $1_1 = HEAP32[$1_1 + 8 >> 2]; if ($1_1) { $7_1 = HEAPU8[$1_1 + 32 | 0] ? 1 : $7_1; $6_1 = HEAP32[$1_1 >> 2]; $8_1 = ($6_1 | 0) == 1 ? $1_1 : $8_1; $5_1 = ($6_1 | 0) == 4 ? 1 : $5_1; continue; } break; }; if (!$5_1) { $5_1 = 0; break block1; } $1_1 = $8_1; while (1) { if (HEAPU8[$1_1 + 34 | 0]) { $1_1 = HEAP32[$1_1 + 8 >> 2]; continue; } break; }; block7 : { if (!HEAP32[$13_1 + 40 >> 2]) { break block7 } $6_1 = HEAPU8[$1_1 + 32 | 0]; $1859($0_1, $1_1, $4_1 + 12 | 0); block8 : { while (1) { $5_1 = HEAP32[$4_1 + 12 >> 2]; if ($5_1) { break block1 } $5_1 = HEAPU8[$1_1 + 32 | 0]; if ($5_1) { break block8 } $1746($0_1, $1_1, $4_1 + 12 | 0); if (HEAP32[$1_1 + 24 >> 2] != HEAP32[$4_1 + 16 >> 2] | HEAP32[$1_1 + 28 >> 2] != HEAP32[$4_1 + 20 >> 2] | $6_1) { continue } break; }; $5_1 = HEAP32[$4_1 + 12 >> 2]; if ($5_1) { break block1 } $5_1 = HEAPU8[$1_1 + 32 | 0]; } if (($6_1 | 0) == ($5_1 & 255)) { break block7 } $5_1 = 267; break block1; } block9 : { if (!($7_1 & 255)) { break block9 } while (1) { if (HEAPU8[$1_1 + 32 | 0]) { break block9 } $1746($0_1, $1_1, $4_1 + 12 | 0); $5_1 = HEAP32[$4_1 + 12 >> 2]; if (!$5_1) { continue } break; }; break block1; } $14 = 1; while (1) { block19 : { if ($8_1) { $1_1 = $8_1; if (HEAP32[$1_1 >> 2] == 1) { $1_1 = HEAP32[$1_1 + 16 >> 2] } $7_1 = HEAP32[$1_1 + 20 >> 2]; $1_1 = HEAP32[$7_1 + 48 >> 2]; HEAP32[$4_1 + 28 >> 2] = $1_1; $6_1 = HEAP32[$7_1 + 60 >> 2]; HEAP32[$4_1 + 16 >> 2] = HEAP32[$7_1 + 56 >> 2]; HEAP32[$4_1 + 20 >> 2] = $6_1; $6_1 = HEAP32[$7_1 + 4 >> 2]; block14 : { if (HEAPU8[$0_1 + 52 | 0] == ($12_1 | 0)) { if (!$6_1) { $5_1 = 0; break block14; } $10_1 = $6_1 + HEAP32[$7_1 >> 2] >>> 0 <= $1_1 >>> 0; $5_1 = 1; break block14; } $5_1 = 1; block16 : { if (!$6_1) { break block16 } $5_1 = 0; if (!$1_1) { break block16 } $5_1 = HEAPU32[$7_1 >> 2] >= $1_1 >>> 0; } HEAP8[$4_1 + 44 | 0] = $5_1; while (1) { block20 : { if ($1_1) { $10_1 = HEAPU8[$4_1 + 44 | 0]; $6_1 = HEAP32[$4_1 + 16 >> 2]; $5_1 = HEAP32[$0_1 + 32 >> 2]; $11_1 = HEAP32[$4_1 + 20 >> 2]; $9_1 = HEAP32[$0_1 + 36 >> 2]; $6_1 = ($6_1 >>> 0 > $5_1 >>> 0 & ($11_1 | 0) >= ($9_1 | 0) | ($9_1 | 0) < ($11_1 | 0)) - ($5_1 >>> 0 > $6_1 >>> 0 & ($9_1 | 0) >= ($11_1 | 0) | ($9_1 | 0) > ($11_1 | 0)) | 0; if ($10_1 | (($12_1 ? 0 - $6_1 | 0 : $6_1) | 0) <= 0) { break block19 } break block20; } $10_1 = HEAPU8[$4_1 + 44 | 0]; if (!$10_1) { break block20 } $1_1 = 0; break block19; } $1702($12_1, HEAP32[$7_1 >> 2], HEAP32[$7_1 + 4 >> 2], $4_1 + 28 | 0, $4_1 + 16 | 0, $4_1 + 32 | 0, $4_1 + 44 | 0); $1_1 = HEAP32[$4_1 + 28 >> 2]; continue; }; } while (1) { block23 : { if (!$5_1) { $10_1 = 1; break block23; } block26 : { block25 : { block28 : { block27 : { if ($1_1) { $6_1 = HEAP32[$4_1 + 16 >> 2]; $5_1 = HEAP32[$0_1 + 32 >> 2]; $11_1 = HEAP32[$4_1 + 20 >> 2]; $9_1 = HEAP32[$0_1 + 36 >> 2]; $5_1 = ($6_1 >>> 0 > $5_1 >>> 0 & ($11_1 | 0) >= ($9_1 | 0) | ($9_1 | 0) < ($11_1 | 0)) - ($5_1 >>> 0 > $6_1 >>> 0 & ($9_1 | 0) >= ($11_1 | 0) | ($9_1 | 0) > ($11_1 | 0)) | 0; if ($10_1 | (($12_1 ? 0 - $5_1 | 0 : $5_1) | 0) >= 0) { break block25 } $5_1 = HEAP32[$7_1 + 4 >> 2]; $9_1 = HEAP32[$7_1 >> 2]; HEAP32[$4_1 + 44 >> 2] = $1_1; $1703(0, $4_1 + 44 | 0); $5_1 = $5_1 + $9_1 | 0; $1_1 = HEAP32[$4_1 + 44 >> 2]; while (1) { if ($1_1 >>> 0 >= $5_1 >>> 0) { break block26 } if (HEAPU8[$1_1 | 0]) { break block27 } $1_1 = $1_1 + 1 | 0; continue; }; } if ($10_1) { break block25 } $1_1 = HEAP32[$7_1 >> 2]; $1_1 = $1668($1_1, $4_1 + 16 | 0) + $1_1 | 0; break block28; } $9_1 = $1668($1_1, $4_1 + 32 | 0); $5_1 = HEAP32[$4_1 + 32 >> 2]; $15_1 = $12_1 ? 0 - $5_1 | 0 : $5_1; $10_1 = $15_1 + $6_1 | 0; $6_1 = HEAP32[$4_1 + 36 >> 2]; $6_1 = ($12_1 ? 0 - ($6_1 + (($5_1 | 0) != 0) | 0) | 0 : $6_1) + $11_1 | 0; HEAP32[$4_1 + 16 >> 2] = $10_1; HEAP32[$4_1 + 20 >> 2] = $10_1 >>> 0 < $15_1 >>> 0 ? $6_1 + 1 | 0 : $6_1; $1_1 = $1_1 + $9_1 | 0; } $10_1 = 0; break block23; } HEAP32[$4_1 + 28 >> 2] = $1_1; break block19; } $5_1 = 0; continue; } $5_1 = 1; continue; }; } if ($14) { $7_1 = HEAP32[$13_1 + 48 >> 2] } else { $7_1 = 0 } HEAP32[$4_1 + 28 >> 2] = $7_1; break block3; } HEAP32[$7_1 + 48 >> 2] = $1_1; $6_1 = HEAP32[$4_1 + 20 >> 2]; $1_1 = HEAP32[$4_1 + 16 >> 2]; HEAP32[$7_1 + 56 >> 2] = $1_1; HEAP32[$7_1 + 60 >> 2] = $6_1; if (!(!$10_1 & (HEAP32[$0_1 + 32 >> 2] == ($1_1 | 0) & HEAP32[$0_1 + 36 >> 2] == ($6_1 | 0)))) { $14 = 0 } $8_1 = HEAP32[$8_1 + 12 >> 2]; continue; }; } $5_1 = 0; if (!$7_1) { break block1 } block36 : { if (HEAPU8[$7_1 | 0] == 1) { $0_1 = $7_1 + 1 | 0; HEAP32[$4_1 + 28 >> 2] = $0_1; $1_1 = HEAP8[$7_1 + 1 | 0]; block35 : { if (($1_1 | 0) < 0) { $1_1 = $1681($0_1, $4_1 + 32 | 0); break block35; } HEAP32[$4_1 + 32 >> 2] = $1_1; $1_1 = 1; } $7_1 = $1_1 + $0_1 | 0; HEAP32[$4_1 + 28 >> 2] = $7_1; break block36; } HEAP32[$4_1 + 32 >> 2] = 0; } while (1) { $0_1 = HEAP32[$4_1 + 32 >> 2]; if (($2_1 | 0) > ($0_1 | 0)) { $1701(0, $4_1 + 28 | 0); $0_1 = HEAP32[$4_1 + 28 >> 2]; if (!HEAPU8[$0_1 | 0]) { break block1 } $8_1 = $0_1 + 1 | 0; $0_1 = HEAP8[$0_1 + 1 | 0]; block39 : { if (($0_1 | 0) < 0) { $0_1 = $1681($8_1, $4_1 + 32 | 0); break block39; } HEAP32[$4_1 + 32 >> 2] = $0_1; $0_1 = 1; } $7_1 = $0_1 + $8_1 | 0; HEAP32[$4_1 + 28 >> 2] = $7_1; continue; } break; }; HEAP32[$3 >> 2] = ($0_1 | 0) == ($2_1 | 0) ? (HEAPU8[$7_1 | 0] ? $7_1 : 0) : 0; } $0_1 = $4_1 + 48 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $5_1; } function $1856($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $1_1 = global$0 - 16 | 0; $2_1 = $1_1; if (global$4 >>> 0 < $1_1 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $2_1; block1 : { if (!$0_1) { $2_1 = 1; break block1; } $3 = HEAP32[$0_1 + 8 >> 2]; $5_1 = $1668($3, $1_1 + 8 | 0); $4_1 = HEAP32[$1_1 + 12 >> 2]; $2_1 = HEAP32[$1_1 + 8 >> 2]; block3 : { if (!(!$4_1 & $2_1 >>> 0 >= 2 | ($4_1 | 0) != 0)) { $3 = 0; $2_1 = 1; break block3; } HEAP32[$0_1 + 12 >> 2] = (HEAP32[$0_1 + 12 >> 2] + $2_1 | 0) - 2; $3 = $3 + $5_1 | 0; $2_1 = 0; } HEAP32[$0_1 + 8 >> 2] = $3; } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1; } function $1857($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] + 1; HEAP32[$2_1 + 8 >> 2] = HEAP32[$2_1 + 8 >> 2] + HEAP32[$0_1 + 64 >> 2]; return 0; } function $1858($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0; block1 : { while (1) { $4_1 = HEAP32[$0_1 >> 2]; if (($4_1 | 0) != 5) { $5_1 = ($4_1 | 0) == 2; $4_1 = $1858(HEAP32[$0_1 + 12 >> 2], $1_1, $2_1, $3); if ($5_1 | $4_1) { break block1 } $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; $4_1 = FUNCTION_TABLE[$2_1 | 0]($0_1, HEAP32[$1_1 >> 2], $3) | 0; HEAP32[$1_1 >> 2] = HEAP32[$1_1 >> 2] + 1; } return $4_1; } function $1859($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; while (1) { if (!(HEAP32[$2_1 >> 2] | !$1_1)) { $3 = HEAP32[$1_1 + 20 >> 2]; if ($3) { $1786($3); if (HEAP32[$3 + 40 >> 2]) { $8_1 = $3 + 92 | 0; $6_1 = 0; while (1) { if (!(HEAP32[$3 + 64 >> 2] <= ($6_1 | 0))) { block4 : { $5_1 = HEAP32[Math_imul($6_1, 24) + $8_1 >> 2]; if (!$5_1) { break block4 } HEAP32[$5_1 + 36 >> 2] = 1; $7_1 = 0; HEAP32[$5_1 + 8 >> 2] = 0; $4_1 = HEAP32[$5_1 + 4 >> 2]; $9_1 = ($4_1 | 0) > 0 ? $4_1 : 0; while (1) { if (($7_1 | 0) == ($9_1 | 0)) { break block4 } $4_1 = HEAP32[HEAP32[$5_1 >> 2] + ($7_1 << 2) >> 2]; HEAP32[$4_1 + 80 >> 2] = 0; HEAP32[$4_1 + 84 >> 2] = 0; $4_1 = $4_1 + 88 | 0; HEAP32[$4_1 >> 2] = 0; HEAP32[$4_1 + 4 >> 2] = 0; $7_1 = $7_1 + 1 | 0; continue; }; } $6_1 = $6_1 + 1 | 0; continue; } break; }; HEAP32[$2_1 >> 2] = $1796($0_1, 0, $3); } HEAP32[$3 + 48 >> 2] = 0; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = 0; } HEAP16[$1_1 + 32 >> 1] = 0; HEAP32[$1_1 + 24 >> 2] = 0; HEAP32[$1_1 + 28 >> 2] = 0; $1859($0_1, HEAP32[$1_1 + 12 >> 2], $2_1); $1_1 = HEAP32[$1_1 + 16 >> 2]; continue; } break; }; } function $1860($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = HEAP32[$0_1 >> 2]; while (1) { $2_1 = HEAPU8[$1_1 | 0]; if ($2_1 & 254 | $4_1) { $4_1 = $2_1 & 128; $1_1 = $1_1 + 1 | 0; $3 = ($2_1 << 24 >> 24 >= 0) + $3 | 0; continue; } break; }; HEAP32[$0_1 >> 2] = $1_1; return $3; } function $1861($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; block : { $1_1 = HEAP32[$0_1 + 40 >> 2]; if ($1_1) { break block } $1_1 = $31(Math_imul(HEAP32[$2_1 + 24 >> 2], 12), 0); HEAP32[$0_1 + 40 >> 2] = $1_1; if ($1_1) { break block } return 7; } $0_1 = Math_imul(HEAP32[$2_1 + 24 >> 2], 12); if ($0_1) { wasm2js_memory_fill($1_1, 0, $0_1) } return 0; } function $1862($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = global$0 - 16 | 0; $2_1 = $5_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; while (1) { if ($0_1) { $2_1 = HEAP32[$0_1 + 20 >> 2]; block1 : { if (!$2_1) { break block1 } $2_1 = HEAP32[$2_1 + 28 >> 2]; if (!$2_1) { break block1 } $3 = 0; HEAP32[$5_1 + 12 >> 2] = 0; while (1) { $6_1 = 0; $4_1 = 0; while (1) { $7_1 = HEAPU8[$2_1 | 0]; if ($7_1 & 254 | $6_1) { $2_1 = $2_1 + 1 | 0; $4_1 = !$6_1 + $4_1 | 0; $6_1 = $7_1 & 128; continue; } break; }; $3 = HEAP32[$0_1 + 40 >> 2] + Math_imul($3, 12) | 0; $6_1 = $3 + 4 | 0; HEAP32[$6_1 >> 2] = HEAP32[$6_1 >> 2] + $4_1; $3 = $3 + 8 | 0; HEAP32[$3 >> 2] = HEAP32[$3 >> 2] + (($4_1 | 0) != 0); if (!HEAPU8[$2_1 | 0]) { break block1 } $4_1 = $2_1 + 1 | 0; $3 = HEAP8[$2_1 + 1 | 0]; block4 : { if (($3 | 0) < 0) { $2_1 = $1681($4_1, $5_1 + 12 | 0); $3 = HEAP32[$5_1 + 12 >> 2]; break block4; } HEAP32[$5_1 + 12 >> 2] = $3; $2_1 = 1; } $2_1 = $2_1 + $4_1 | 0; if (($1_1 | 0) > ($3 | 0)) { continue } break; }; } $1862(HEAP32[$0_1 + 12 >> 2], $1_1); $0_1 = HEAP32[$0_1 + 16 >> 2]; continue; } break; }; $0_1 = $5_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1863($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; var $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0; $6_1 = global$0 - 16 | 0; if ($6_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $6_1; HEAP32[$6_1 + 12 >> 2] = 0; $0_1 = $356($0_1, 25530); if (!$0_1) { $9_1 = 14131; $7_1 = $2_1 - 3 | 0; block4 : { block1 : { if (!$7_1) { break block1 } $10_1 = $3 + 12 | 0; $3 = 0; $11_1 = ($7_1 | 0) > 0 ? $7_1 : 0; $0_1 = 0; while (1) { if (!(($0_1 | 0) == ($11_1 | 0))) { $3 = ($2080(HEAP32[$10_1 + ($0_1 << 2) >> 2]) + $3 | 0) + 1 | 0; $0_1 = $0_1 + 1 | 0; continue; } break; }; $0_1 = $7_1 << 2; $8_1 = $31($0_1 + $3 | 0, 0); if (!$8_1) { $8_1 = 0; $0_1 = 7; break block4; } $0_1 = $0_1 + $8_1 | 0; $3 = 0; while (1) { if (($3 | 0) != ($11_1 | 0)) { $7_1 = $3 << 2; $12_1 = $7_1 + $10_1 | 0; $13_1 = $2080(HEAP32[$12_1 >> 2]); HEAP32[$7_1 + $8_1 >> 2] = $0_1; $7_1 = $13_1 + 1 | 0; if ($7_1) { wasm2js_memory_copy($0_1, HEAP32[$12_1 >> 2], $7_1) } $1654($0_1); $3 = $3 + 1 | 0; $0_1 = $0_1 + $7_1 | 0; continue; } break; }; if (($2_1 | 0) < 4) { break block1 } $9_1 = HEAP32[$8_1 >> 2]; } $0_1 = 1; $3 = $1723($1_1, $9_1, $2080($9_1) + 1 | 0); if (!$3) { HEAP32[$6_1 >> 2] = $9_1; $1655($5_1, 7850, $6_1); break block4; } block10 : { $0_1 = ($2_1 | 0) > 4; $0_1 = FUNCTION_TABLE[HEAP32[$3 + 4 >> 2]](($0_1 ? $2_1 : 4) - 4 | 0, $0_1 ? $8_1 + 4 | 0 : 0, $6_1 + 12 | 0) | 0; block9 : { if ($0_1) { $2_1 = HEAP32[$6_1 + 12 >> 2]; break block9; } $1_1 = $23(20); $2_1 = HEAP32[$6_1 + 12 >> 2]; if ($1_1) { break block10 } $0_1 = 7; } if (!$2_1) { break block4 } FUNCTION_TABLE[HEAP32[$3 + 8 >> 2]]($2_1) | 0; break block4; } HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; HEAP32[$1_1 + 16 >> 2] = $2_1; HEAP32[$1_1 + 12 >> 2] = $3; $0_1 = 0; HEAP32[$1_1 + 8 >> 2] = 0; HEAP32[$4_1 >> 2] = $1_1; } $24($8_1); } $1_1 = $6_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1 | 0; } function $1864($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $0_1 = 0; $2_1 = HEAP32[$1_1 >> 2]; $3 = ($2_1 | 0) > 0 ? $2_1 : 0; block2 : { while (1) { if (($0_1 | 0) != ($3 | 0)) { $2_1 = HEAP32[$1_1 + 4 >> 2] + Math_imul($0_1, 12) | 0; if (!(!HEAPU8[$2_1 + 5 | 0] | HEAP32[$2_1 >> 2] | HEAPU8[$2_1 + 4 | 0] != 2)) { HEAP32[$1_1 + 20 >> 2] = 1; $0_1 = HEAP32[$1_1 + 16 >> 2] + ($0_1 << 3) | 0; HEAP8[$0_1 + 4 | 0] = 1; HEAP32[$0_1 >> 2] = 1; HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1072693248; break block2; } $0_1 = $0_1 + 1 | 0; continue; } break; }; HEAP32[$1_1 + 20 >> 2] = 0; } return 0; } function $1865($0_1) { $0_1 = $0_1 | 0; FUNCTION_TABLE[HEAP32[HEAP32[$0_1 + 12 >> 2] + 8 >> 2]](HEAP32[$0_1 + 16 >> 2]) | 0; $24($0_1); return 0; } function $1866($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = $23(36); if (!$0_1) { return 7 } wasm2js_memory_fill($0_1, 0, 36); HEAP32[$1_1 >> 2] = $0_1; return 0; } function $1867($0_1) { $0_1 = $0_1 | 0; $1868($0_1); $24($0_1); return 0; } function $1868($0_1) { var $1_1 = 0; $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($1_1) { FUNCTION_TABLE[HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2] + 16 >> 2]]($1_1) | 0; HEAP32[$0_1 + 8 >> 2] = 0; } $24(HEAP32[$0_1 + 4 >> 2]); HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; $1_1 = $0_1 + 20 | 0; HEAP32[$1_1 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 0; $0_1 = $0_1 + 28 | 0; HEAP32[$0_1 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; } function $1869($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $3 = HEAP32[$0_1 >> 2]; $1868($0_1); $2_1 = 1; block : { if (($1_1 | 0) != 1) { break block } $2_1 = $53(HEAP32[$4_1 >> 2]); $4_1 = $209(HEAP32[$4_1 >> 2]); $1_1 = $4_1 + 1 | 0; $1_1 = $31($1_1, $1_1 >> 31); HEAP32[$0_1 + 4 >> 2] = $1_1; if (!$1_1) { return 7 } if (($4_1 | 0) > 0) { if ($4_1) { wasm2js_memory_copy($1_1, $2_1, $4_1) } $1_1 = HEAP32[$0_1 + 4 >> 2]; } HEAP8[$1_1 + $4_1 | 0] = 0; $2_1 = FUNCTION_TABLE[HEAP32[HEAP32[$3 + 12 >> 2] + 12 >> 2]](HEAP32[$3 + 16 >> 2], HEAP32[$0_1 + 4 >> 2], $4_1, $0_1 + 8 | 0) | 0; if ($2_1) { break block } HEAP32[HEAP32[$0_1 + 8 >> 2] >> 2] = HEAP32[$3 + 16 >> 2]; $2_1 = $1870($0_1); } return $2_1 | 0; } function $1870($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; HEAP32[$0_1 + 12 >> 2] = HEAP32[$0_1 + 12 >> 2] + 1; $1_1 = FUNCTION_TABLE[HEAP32[HEAP32[HEAP32[$0_1 >> 2] + 12 >> 2] + 20 >> 2]](HEAP32[$0_1 + 8 >> 2], $0_1 + 16 | 0, $0_1 + 20 | 0, $0_1 + 24 | 0, $0_1 + 28 | 0, $0_1 + 32 | 0) | 0; if (!$1_1) { return 0 } $1868($0_1); return (($1_1 | 0) != 101 ? $1_1 : 0) | 0; } function $1871($0_1) { $0_1 = $0_1 | 0; return !HEAP32[$0_1 + 16 >> 2] | 0; } function $1872($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; block5 : { block4 : { switch ($2_1 | 0) { case 0: $246($1_1, HEAP32[$0_1 + 4 >> 2], -1, -1); break block5; case 1: $246($1_1, HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2], -1); break block5; case 2: $238($1_1, HEAP32[$0_1 + 24 >> 2]); break block5; case 3: $238($1_1, HEAP32[$0_1 + 28 >> 2]); break block5; default: break block4; }; } $238($1_1, HEAP32[$0_1 + 32 >> 2]); } return 0; } function $1873($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP32[$1_1 >> 2] = $0_1; HEAP32[$1_1 + 4 >> 2] = $0_1 >> 31; return 0; } function $1874($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; $1_1 = $356($0_1, 26092); if (!$1_1) { $2_1 = $270($0_1, 16, 0); HEAP32[$4_1 >> 2] = $2_1; if (!$2_1) { return 7 } $367($0_1, 2, 0); HEAP32[$2_1 + 12 >> 2] = $0_1; $1_1 = 0; } return $1_1 | 0; } function $1875($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 16 | 0; HEAP32[$3 + 8 >> 2] = -1; HEAP32[$3 + 12 >> 2] = -1; $0_1 = HEAP32[$1_1 >> 2]; $8_1 = ($0_1 | 0) > 0 ? $0_1 : 0; $0_1 = HEAP32[$1_1 + 4 >> 2]; while (1) { if (!(($2_1 | 0) == ($8_1 | 0))) { $5_1 = HEAP32[$0_1 >> 2]; block1 : { if (($5_1 | 0) < 8) { break block1 } $7_1 = $5_1 - 8 | 0; $5_1 = 1 << $7_1; if (!HEAPU8[$0_1 + 5 | 0]) { $4_1 = $4_1 | $5_1; break block1; } if (HEAPU8[$0_1 + 4 | 0] != 2) { break block1 } HEAP32[($3 + 8 | 0) + ($7_1 << 2) >> 2] = $2_1; $6_1 = $6_1 | $5_1; } $0_1 = $0_1 + 12 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; block3 : { if (HEAP32[$1_1 + 8 >> 2] <= 0) { break block3 } $0_1 = HEAP32[$1_1 + 12 >> 2]; if (HEAP32[$0_1 >> 2] >= 0 | HEAPU8[$0_1 + 4 | 0]) { break block3 } HEAP32[$1_1 + 32 >> 2] = 1; } $0_1 = 19; if (!(($6_1 ^ -1) & $4_1)) { $0_1 = 0; $4_1 = HEAP32[$3 + 8 >> 2]; $2_1 = 0; block5 : { if (($4_1 | 0) < 0) { break block5 } HEAP32[$1_1 + 40 >> 2] = 0; HEAP32[$1_1 + 44 >> 2] = 1072693248; $2_1 = $4_1 << 3; $4_1 = HEAP32[$1_1 + 16 >> 2]; $6_1 = $2_1 + $4_1 | 0; HEAP8[$6_1 + 4 | 0] = 1; HEAP32[$6_1 >> 2] = 1; $3 = HEAP32[$3 + 12 >> 2]; $2_1 = 1; if (($3 | 0) < 0) { break block5 } $2_1 = $4_1 + ($3 << 3) | 0; HEAP8[$2_1 + 4 | 0] = 1; HEAP32[$2_1 >> 2] = 2; $2_1 = 3; } HEAP32[$1_1 + 20 >> 2] = $2_1; } return $0_1 | 0; } function $1876($0_1) { $0_1 = $0_1 | 0; $10(HEAP32[$0_1 + 12 >> 2], $0_1); return 0; } function $1877($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0; $2_1 = $270(HEAP32[$0_1 + 12 >> 2], 224, 0); if (!$2_1) { return 7 } $0_1 = HEAP32[$0_1 + 12 >> 2]; HEAP8[$2_1 + 64 | 0] = 1; HEAP32[$2_1 + 56 >> 2] = 0; HEAP32[$2_1 + 60 >> 2] = 0; HEAP32[$2_1 + 48 >> 2] = 100; HEAP32[$2_1 + 52 >> 2] = 0; HEAP32[$2_1 + 44 >> 2] = $2_1 + 66; HEAP32[$2_1 + 36 >> 2] = $0_1; HEAP32[$1_1 >> 2] = $2_1; return 0; } function $1878($0_1) { $0_1 = $0_1 | 0; $1879($0_1); $10(HEAP32[$0_1 + 36 >> 2], $0_1); return 0; } function $1879($0_1) { $1545($0_1 + 168 | 0); $1550($0_1 + 40 | 0); $10(HEAP32[$0_1 + 36 >> 2], HEAP32[$0_1 + 32 >> 2]); HEAP32[$0_1 + 32 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 28 >> 2] = 0; HEAP8[$0_1 + 20 | 0] = 0; HEAP32[$0_1 + 12 >> 2] = 0; } function $1880($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; var $5_1 = 0, $6_1 = 0; $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $1879($0_1); block6 : { block : { if (!$1_1) { break block } $5_1 = $0_1 + 168 | 0; wasm2js_memory_fill($5_1, 0, 56); HEAP32[$0_1 + 192 >> 2] = 1; HEAP32[$0_1 + 184 >> 2] = HEAP32[$0_1 + 36 >> 2]; $6_1 = $1542(HEAP32[$4_1 >> 2]); $3 = HEAP32[$4_1 >> 2]; block5 : { block3 : { if ($6_1) { HEAP32[$0_1 + 172 >> 2] = $209($3); HEAP32[$0_1 + 168 >> 2] = $206(HEAP32[$4_1 >> 2]); break block3; } HEAP32[$0_1 + 180 >> 2] = $53($3); HEAP32[$0_1 + 188 >> 2] = $209(HEAP32[$4_1 >> 2]); if (!HEAP32[$0_1 + 180 >> 2]) { HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; break block; } if (!$1544($5_1, 0)) { break block3 } if (HEAPU8[$0_1 + 203 | 0]) { break block5 } $24(HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]); $1_1 = $61(20048, 0); HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] = $1_1; $1879($0_1); $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] ? 1 : 7; break block6; } block15 : { if (($1_1 | 0) == 3) { $3 = $53(HEAP32[$4_1 + 4 >> 2]); if (!$3) { break block } if (HEAPU8[$3 | 0] != 36) { $24(HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]); HEAP32[$2_1 + 16 >> 2] = $3; $1_1 = $61(19993, $2_1 + 16 | 0); HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] = $1_1; $1879($0_1); $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] ? 1 : 7; break block6; } HEAP32[$0_1 + 16 >> 2] = $48($3); block14 : { block10 : { if (!HEAPU8[$3 + 1 | 0]) { $1_1 = 0; HEAP8[$0_1 + 20 | 0] = 0; break block10; } $1_1 = $1530($5_1, 0, $3 + 1 | 0, 0); if ($1_1 >>> 0 >= 4294967293) { if (($1_1 | 0) == -2) { $4_1 = 0; HEAP8[$0_1 + 20 | 0] = 0; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; break block6; } $24(HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2]); HEAP32[$2_1 >> 2] = $3; $1_1 = $61(19993, $2_1); HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] = $1_1; $1879($0_1); $4_1 = HEAP32[HEAP32[$0_1 >> 2] + 8 >> 2] ? 1 : 7; break block6; } $4_1 = HEAP32[$0_1 + 216 >> 2]; if ($4_1) { HEAP8[$0_1 + 20 | 0] = 12; HEAP32[$0_1 + 8 >> 2] = $4_1; break block14; } HEAP8[$0_1 + 20 | 0] = 11; } HEAP32[$0_1 + 8 >> 2] = $1_1; } $1548($0_1 + 40 | 0, $3, HEAP32[$0_1 + 16 >> 2]); break block15; } $1_1 = 0; HEAP8[$0_1 + 20 | 0] = 0; HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 1; $1548($0_1 + 40 | 0, 29267, 1); } $4_1 = 0; HEAP32[$0_1 + 24 >> 2] = 0; $3 = $1575($5_1, $1_1, $2_1 + 28 | 0) + $1_1 | 0; HEAP32[$0_1 + 12 >> 2] = $3 + HEAP32[$2_1 + 28 >> 2]; $5_1 = HEAP32[$0_1 + 168 >> 2] + $1_1 | 0; if (HEAPU8[$0_1 + 21 | 0] | (HEAPU8[$5_1 | 0] & 15) >>> 0 < 11) { break block6 } HEAP32[$0_1 + 8 >> 2] = $3; HEAP8[$0_1 + 20 | 0] = HEAPU8[$5_1 | 0] & 15; $3 = $270(HEAP32[$0_1 + 36 >> 2], 24, 0); HEAP32[$0_1 + 32 >> 2] = $3; if (!$3) { break block5 } HEAP32[$0_1 + 24 >> 2] = 1; HEAP32[$0_1 + 28 >> 2] = 1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; HEAP32[$3 + 8 >> 2] = HEAP32[$0_1 + 12 >> 2]; $0_1 = HEAP32[$0_1 + 8 >> 2]; HEAP32[$3 + 4 >> 2] = $1_1; HEAP32[$3 >> 2] = $0_1; break block6; } $4_1 = 7; break block6; } $4_1 = 0; } $0_1 = $2_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $4_1 | 0; } function $1881($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $5_1 = $0_1 + 168 | 0; block11 : { block10 : { if (HEAPU8[$0_1 + 21 | 0]) { $1_1 = $1882($0_1); $2_1 = HEAPU8[$1_1 + HEAP32[$0_1 + 168 >> 2] | 0]; $6_1 = $1575($5_1, $1_1, $4_1 + 12 | 0); block4 : { $7_1 = ($2_1 & 15) - 13 >>> 0 < 4294967294; block6 : { if (!$7_1) { $3 = HEAP32[$0_1 + 24 >> 2]; $2_1 = HEAP32[$0_1 + 28 >> 2]; block3 : { if ($3 >>> 0 < $2_1 >>> 0) { $2_1 = HEAP32[$0_1 + 32 >> 2]; break block3; } $3 = ($2_1 << 1) + 3 | 0; $2_1 = $55(HEAP32[$0_1 + 36 >> 2], HEAP32[$0_1 + 32 >> 2], __wasm_i64_mul($3, 0, 24, 0), i64toi32_i32$HIGH_BITS); if (!$2_1) { break block4 } HEAP32[$0_1 + 32 >> 2] = $2_1; HEAP32[$0_1 + 28 >> 2] = $3; $3 = HEAP32[$0_1 + 24 >> 2]; } $8_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = Math_imul($3, 24) + $2_1 | 0; HEAP32[$2_1 + 4 >> 2] = $1_1; HEAP32[$2_1 >> 2] = $8_1; $8_1 = HEAP32[$4_1 + 12 >> 2]; HEAP32[$2_1 + 16 >> 2] = -1; HEAP32[$2_1 + 20 >> 2] = -1; $6_1 = $1_1 + $6_1 | 0; HEAP32[$2_1 + 8 >> 2] = $8_1 + $6_1; HEAP32[$2_1 + 12 >> 2] = HEAP32[$0_1 + 56 >> 2]; $2_1 = 0; if (!(!$3 | !HEAPU8[$0_1 + 20 | 0])) { $1883($0_1); $3 = HEAP32[$0_1 + 24 >> 2]; $2_1 = HEAPU8[$0_1 + 65 | 0] ? 7 : 0; } HEAP32[$0_1 + 8 >> 2] = $6_1; $1_1 = $3 + 1 | 0; HEAP32[$0_1 + 24 >> 2] = $1_1; break block6; } $6_1 = HEAP32[$4_1 + 12 >> 2] + ($1_1 + $6_1 | 0) | 0; HEAP32[$0_1 + 8 >> 2] = $6_1; $1_1 = HEAP32[$0_1 + 24 >> 2]; $2_1 = 0; } block9 : { block8 : { while (1) { if ($1_1) { $3 = HEAP32[$0_1 + 32 >> 2] + Math_imul($1_1, 24) | 0; if (HEAPU32[$3 - 16 >> 2] > $6_1 >>> 0) { break block8 } $1_1 = $1_1 - 1 | 0; HEAP32[$0_1 + 24 >> 2] = $1_1; HEAP32[$0_1 + 56 >> 2] = HEAP32[$3 - 12 >> 2]; HEAP32[$0_1 + 60 >> 2] = 0; $7_1 = 0; continue; } break; }; $3 = 0; if (!$7_1) { break block9 } break block10; } if ($7_1) { break block10 } $3 = HEAPU8[HEAP32[$5_1 >> 2] + HEAP32[$3 - 20 >> 2] | 0] & 15; } HEAP8[$0_1 + 20 | 0] = $3; break block10; } $2_1 = 7; break block11; } $2_1 = $1882($0_1); HEAP32[$0_1 + 8 >> 2] = ($1575($5_1, $2_1, $4_1 + 8 | 0) + $2_1 | 0) + HEAP32[$4_1 + 8 >> 2]; $2_1 = 0; } block12 : { if (HEAPU8[$0_1 + 20 | 0] != 11) { break block12 } $1_1 = HEAP32[$0_1 + 24 >> 2]; if (!$1_1) { break block12 } $1_1 = (HEAP32[$0_1 + 32 >> 2] + Math_imul($1_1, 24) | 0) - 8 | 0; $3 = $1_1; $5_1 = HEAP32[$1_1 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; HEAP32[$3 >> 2] = $5_1; HEAP32[$3 + 4 >> 2] = $1_1; } HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] + 1; } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $2_1 | 0; } function $1882($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block1 : { if (HEAPU8[$0_1 + 20 | 0] == 12) { $2_1 = HEAP32[$0_1 + 8 >> 2]; $0_1 = ($2_1 + $1575($0_1 + 168 | 0, $2_1, $1_1 + 12 | 0) | 0) + HEAP32[$1_1 + 12 >> 2] | 0; break block1; } $0_1 = HEAP32[$0_1 + 8 >> 2]; } $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $1883($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $1_1 = global$0 - 32 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block1 : { if (HEAPU8[$0_1 + 20 | 0] == 11) { $2_1 = (HEAP32[$0_1 + 32 >> 2] + Math_imul(HEAP32[$0_1 + 24 >> 2], 24) | 0) - 8 | 0; $3 = HEAP32[$2_1 + 4 >> 2]; HEAP32[$1_1 >> 2] = HEAP32[$2_1 >> 2]; HEAP32[$1_1 + 4 >> 2] = $3; $1598(30, $0_1 + 40 | 0, 18445, $1_1); break block1; } $2_1 = HEAP32[$0_1 + 8 >> 2]; $3 = $1575($0_1 + 168 | 0, $2_1, $1_1 + 28 | 0) + ($2_1 + HEAP32[$0_1 + 168 >> 2] | 0) | 0; $5_1 = 29444; $6_1 = 4; $4_1 = HEAP32[$1_1 + 28 >> 2]; block2 : { if (!$4_1 | !(HEAPU8[HEAPU8[$3 | 0] + 31424 | 0] & 2)) { break block2 } $2_1 = 0; while (1) { if (($2_1 | 0) == ($4_1 | 0)) { $5_1 = 6e3; $6_1 = 2; break block2; } $7_1 = $2_1 + $3 | 0; $2_1 = $2_1 + 1 | 0; if (HEAPU8[HEAPU8[$7_1 | 0] + 31424 | 0] & 6) { continue } break; }; } HEAP32[$1_1 + 20 >> 2] = $3; HEAP32[$1_1 + 16 >> 2] = $4_1; $1598($4_1 + $6_1 | 0, $0_1 + 40 | 0, $5_1, $1_1 + 16 | 0); } $0_1 = $1_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $1884($0_1) { $0_1 = $0_1 | 0; return HEAPU32[$0_1 + 8 >> 2] >= HEAPU32[$0_1 + 12 >> 2] | 0; } function $1885($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = global$0 - 16 | 0; $3 = $4_1; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; block11 : { block8 : { switch ($2_1 | 0) { case 0: $2_1 = HEAP32[$0_1 + 24 >> 2]; if (!$2_1) { if (HEAP32[$0_1 + 16 >> 2] == 1) { break block11 } $3 = $1886($0_1); $2_1 = HEAP32[$0_1 + 16 >> 2]; if (($3 | 0) == ($2_1 | 0)) { break block11 } $2_1 = $2_1 - $3 | 0; $0_1 = $3 + HEAP32[$0_1 + 44 >> 2] | 0; if (HEAPU8[$0_1 | 0] == 91) { $305($0_1 + 1 | 0, $4_1 + 8 | 0, $2_1 - 1 | 0, 1); $240($1_1, HEAP32[$4_1 + 8 >> 2], HEAP32[$4_1 + 12 >> 2]); break block11; } $3 = $0_1 + 1 | 0; if (HEAPU8[$3 | 0] == 34) { $246($1_1, $0_1 + 2 | 0, $2_1 - 3 | 0, -1); break block11; } $246($1_1, $3, $2_1 - 1 | 0, -1); break block11; } if (HEAPU8[$0_1 + 20 | 0] == 12) { $1552($0_1 + 168 | 0, HEAP32[$0_1 + 8 >> 2], $1_1, 1); break block11; } $0_1 = (HEAP32[$0_1 + 32 >> 2] + Math_imul($2_1, 24) | 0) - 8 | 0; $240($1_1, HEAP32[$0_1 >> 2], HEAP32[$0_1 + 4 >> 2]); break block11; case 1: $2_1 = $1882($0_1); $1552($0_1 + 168 | 0, $2_1, $1_1, 1); if ((HEAPU8[$2_1 + HEAP32[$0_1 + 168 >> 2] | 0] & 15) >>> 0 < 11) { break block11 } $0_1 = HEAP32[$1_1 >> 2]; HEAP8[$0_1 + 19 | 0] = 74; HEAP16[$0_1 + 16 >> 1] = HEAPU16[$0_1 + 16 >> 1] | 2048; break block11; case 2: $246($1_1, HEAP32[((HEAPU8[$1882($0_1) + HEAP32[$0_1 + 168 >> 2] | 0] & 15) << 2) + 53552 >> 2], -1, 0); break block11; case 3: $2_1 = $1882($0_1); if ((HEAPU8[$2_1 + HEAP32[$0_1 + 168 >> 2] | 0] & 15) >>> 0 > 10) { break block11 } $1552($0_1 + 168 | 0, $2_1, $1_1, 1); break block11; case 4: $240($1_1, HEAP32[$0_1 + 8 >> 2], 0); break block11; case 5: $2_1 = HEAP32[$0_1 + 24 >> 2]; if (!$2_1 | !HEAPU8[$0_1 + 21 | 0]) { break block11 } $240($1_1, HEAP32[(HEAP32[$0_1 + 32 >> 2] + Math_imul($2_1, 24) | 0) - 24 >> 2], 0); break block11; case 6: $3 = HEAP32[$0_1 + 60 >> 2]; $5_1 = $3; $2_1 = HEAP32[$0_1 + 56 >> 2]; $6_1 = $2_1; if (HEAP32[$0_1 + 24 >> 2]) { $1883($0_1); $3 = HEAP32[$0_1 + 60 >> 2]; $2_1 = HEAP32[$0_1 + 56 >> 2]; } $247($1_1, HEAP32[$0_1 + 44 >> 2], $2_1, $3, -1); HEAP32[$0_1 + 56 >> 2] = $6_1; HEAP32[$0_1 + 60 >> 2] = $5_1; break block11; case 7: $2_1 = $1886($0_1); $247($1_1, HEAP32[$0_1 + 44 >> 2], $2_1, 0, -1); break block11; default: $246($1_1, HEAP32[$0_1 + 44 >> 2], HEAP32[$0_1 + 16 >> 2], 0); break block11; case 8: break block8; }; } $2_1 = HEAP32[$0_1 + 180 >> 2]; if (!$2_1) { $225($1_1, HEAP32[$0_1 + 168 >> 2], HEAP32[$0_1 + 172 >> 2], -1); break block11; } $246($1_1, $2_1, -1, -1); } $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return 0; } function $1886($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $2_1 = global$0 - 16 | 0; $1_1 = $2_1; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; $1_1 = HEAP32[$0_1 + 56 >> 2]; block : { if (HEAP32[$0_1 + 4 >> 2] | !HEAPU8[$0_1 + 21 | 0] | $1_1 >>> 0 < 2) { break block } $6_1 = HEAP32[$0_1 + 44 >> 2]; $8_1 = $6_1 + 1 | 0; $7_1 = $0_1 + 168 | 0; while (1) { $1_1 = $1_1 - 1 | 0; $3 = $6_1 + $1_1 | 0; $4_1 = HEAPU8[$3 | 0]; block2 : { if (($4_1 | 0) != 91 & ($4_1 | 0) != 46) { break block2 } HEAP8[$3 | 0] = 0; $5_1 = $1530($7_1, 0, $8_1, 0); HEAP8[$3 | 0] = $4_1; if ($5_1 >>> 0 >= 4294967293) { break block2 } if (($1575($7_1, $5_1, $2_1 + 12 | 0) + $5_1 | 0) == HEAP32[$0_1 + 8 >> 2]) { break block } } if ($1_1 >>> 0 >= 2) { continue } break; }; $1_1 = 1; } $0_1 = $2_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1; } function $1887($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; HEAP32[$1_1 >> 2] = HEAP32[$0_1 + 4 >> 2]; HEAP32[$1_1 + 4 >> 2] = 0; return 0; } function $1888($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $0_1 = $1877($0_1, $1_1); if (!$0_1) { HEAP8[HEAP32[$1_1 >> 2] + 21 | 0] = 1 } return $0_1 | 0; } function $1889($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; while (1) { if (($1_1 | 0) == 40) { while (1) { if (!(($2_1 | 0) == 6)) { $1_1 = $2_1 << 4; $386($0_1, HEAP32[$1_1 + 58400 >> 2], 1, 1, 0, 0, HEAP32[$1_1 + 58408 >> 2], HEAP32[$1_1 + 58412 >> 2]); $2_1 = $2_1 + 1 | 0; continue; } break; }; $0_1 = 0; } else { $3 = Math_imul($1_1, 12); $386($0_1, HEAP32[$3 + 57920 >> 2], HEAP8[$3 + 57924 | 0], 1, 0, HEAP32[$3 + 57928 >> 2], 0, 0); $1_1 = $1_1 + 1 | 0; continue; } break; }; return $0_1 | 0; } function $1890($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $6_1 = $0_1; wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; $1_1 = $0_1 & 2147483647; __inlined_func$1953$160 : { if ($1_1 >>> 0 >= 1072693248) { $4_1 = ($0_1 | 0) >= 0 ? 0.0 : 3.141592653589793; if (!($1_1 - 1072693248 | $2_1)) { break __inlined_func$1953$160 } $4_1 = 0.0 / ($3 - $3); break __inlined_func$1953$160; } block3 : { if ($1_1 >>> 0 <= 1071644671) { $4_1 = 1.5707963267948966; if ($1_1 >>> 0 < 1012924417) { break block3 } $4_1 = 6.123233995736766e-17 - $3 * $1954($3 * $3) - $3 + 1.5707963267948966; break __inlined_func$1953$160; } if (($0_1 | 0) < 0) { $3 = ($3 + 1.0) * .5; $5_1 = Math_sqrt($3); $3 = 1.5707963267948966 - ($5_1 + ($5_1 * $1954($3) + -6.123233995736766e-17)); $4_1 = $3 + $3; break __inlined_func$1953$160; } $3 = (1.0 - $3) * .5; $5_1 = Math_sqrt($3); $7_1 = $5_1 * $1954($3); wasm2js_scratch_store_f64(+$5_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $0_1 | 0); $4_1 = $3; $3 = +wasm2js_scratch_load_f64(); $3 = $7_1 + ($4_1 - $3 * $3) / ($5_1 + $3) + $3; $4_1 = $3 + $3; } } $233($6_1, $4_1); return; } fimport$0(23889, 17982, 378, 17668); wasm2js_trap(); } function $1891($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0.0, $7_1 = 0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $7_1 = $0_1; wasm2js_scratch_store_f64(+$3); $1_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; $0_1 = $1_1 & 2147483647; __inlined_func$1956$163 : { if ($0_1 >>> 0 >= 1072693248) { $4_1 = $3 * 1.5707963267948966 + 7.52316384526264e-37; if (!($0_1 - 1072693248 | $2_1)) { break __inlined_func$1956$163 } $4_1 = 0.0 / ($3 - $3); break __inlined_func$1956$163; } block3 : { if ($0_1 >>> 0 <= 1071644671) { if ($0_1 + -1048576 >>> 0 < 1044381696) { break block3 } $4_1 = $3 * $1954($3 * $3) + $3; break __inlined_func$1956$163; } $5_1 = (1.0 - Math_abs($3)) * .5; $3 = Math_sqrt($5_1); $6_1 = $1954($5_1); block5 : { if ($0_1 >>> 0 >= 1072640819) { $3 = $3 * $6_1 + $3; $3 = 1.5707963267948966 - ($3 + $3 + -6.123233995736766e-17); break block5; } wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $0_1 | 0); $4_1 = $5_1; $5_1 = +wasm2js_scratch_load_f64(); $4_1 = ($4_1 - $5_1 * $5_1) / ($3 + $5_1); $3 = .7853981633974483 - ($5_1 + $5_1) - (($3 + $3) * $6_1 - (6.123233995736766e-17 - ($4_1 + $4_1))) + .7853981633974483; } $3 = ($1_1 | 0) < 0 ? -$3 : $3; } $4_1 = $3; } $233($7_1, $4_1); return; } fimport$0(23889, 17982, 379, 17739); wasm2js_trap(); } function $1892($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $1959($3)); return; } fimport$0(23889, 17982, 380, 17757); wasm2js_trap(); } function $1893($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0, $8_1 = 0; if (($1_1 | 0) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $7_1 = $0_1; $3 = $39(HEAP32[$2_1 >> 2]); $4_1 = $39(HEAP32[$2_1 + 4 >> 2]); $0_1 = $1960($4_1); __inlined_func$1961$168 : { block1 : { $1_1 = i64toi32_i32$HIGH_BITS & 2147483647; if (!(($1_1 | 0) == 2146435072 & ($0_1 | 0) != 0 | $1_1 >>> 0 > 2146435072)) { $1_1 = !$1960($3); $0_1 = i64toi32_i32$HIGH_BITS & 2147483647; if ($1_1 & ($0_1 | 0) == 2146435072 | $0_1 >>> 0 < 2146435072) { break block1 } } $3 = $3 + $4_1; break __inlined_func$1961$168; } wasm2js_scratch_store_f64(+$4_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; $0_1 = wasm2js_scratch_load_i32(0) | 0; $8_1 = $0_1; if (!($0_1 | $2_1 - 1072693248)) { $3 = $1959($3); break __inlined_func$1961$168; } wasm2js_scratch_store_f64(+$3); $6_1 = $2_1 >>> 30 & 2; $1_1 = wasm2js_scratch_load_i32(1) | 0; $0_1 = $6_1 | $1_1 >>> 31; folding_inner0 : { $1_1 = $1_1 & 2147483647; block4 : { if (!(wasm2js_scratch_load_i32(0) | $1_1)) { block6 : { switch ($0_1 - 2 | 0) { case 0: $3 = 3.141592653589793; break __inlined_func$1961$168; case 1: break block6; default: break block4; }; } $3 = -3.141592653589793; break __inlined_func$1961$168; } $2_1 = $2_1 & 2147483647; if (!($2_1 | $8_1)) { break folding_inner0 } block9 : { if (($2_1 | 0) == 2146435072) { if (($1_1 | 0) != 2146435072) { break block9 } $3 = HEAPF64[($0_1 << 3) + 58976 >> 3]; break __inlined_func$1961$168; } if (!(($1_1 | 0) != 2146435072 & $2_1 + 67108864 >>> 0 >= $1_1 >>> 0)) { break folding_inner0 } block13 : { if ($6_1) { $5_1 = 0.0; if ($2_1 >>> 0 > $1_1 + 67108864 >>> 0) { break block13 } } $5_1 = $1959(Math_abs($3 / $4_1)); } $3 = $5_1; block16 : { switch ($0_1 - 1 | 0) { case 0: $3 = -$3; break __inlined_func$1961$168; case 1: $3 = 3.141592653589793 - ($3 + -1.2246467991473532e-16); break __inlined_func$1961$168; case 2: break block16; default: break block4; }; } $3 = $3 + -1.2246467991473532e-16 + -3.141592653589793; break __inlined_func$1961$168; } $3 = HEAPF64[($0_1 << 3) + 59008 >> 3]; } break __inlined_func$1961$168; } wasm2js_scratch_store_f64(1.5707963267948966); $0_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+$3); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, $2_1 | 0); wasm2js_scratch_store_i32(1, $0_1 & 2147483647 | $1_1 & -2147483648); $3 = +wasm2js_scratch_load_f64(); } $233($7_1, $3); return; } fimport$0(23751, 17982, 570, 17911); wasm2js_trap(); } function $1894($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $1_1 = $0_1; wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $0_1 = $0_1 >>> 20 & 2047; __inlined_func$1955$171 : { if ($0_1 >>> 0 <= 1023) { $3 = $3 + -1.0; $3 = $2010($3 + Math_sqrt($3 * $3 + ($3 + $3))); break __inlined_func$1955$171; } if ($0_1 >>> 0 <= 1048) { $3 = $2007($3 + $3 + -1.0 / ($3 + Math_sqrt($3 * $3 + -1.0))); break __inlined_func$1955$171; } $3 = $2007($3) + .6931471805599453; } $233($1_1, $3); return; } fimport$0(23889, 17982, 394, 17793); wasm2js_trap(); } function $1895($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $4_1 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $2_1 = $0_1; $3 = Math_abs($4_1); wasm2js_scratch_store_f64(+$4_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $1_1 = $0_1 >>> 20 & 2047; block1 : { if ($1_1 >>> 0 >= 1049) { $3 = $2007($3) + .6931471805599453; break block1; } if ($1_1 >>> 0 >= 1024) { $3 = $2007($3 + $3 + 1.0 / ($3 + Math_sqrt($4_1 * $4_1 + 1.0))); break block1; } if ($1_1 >>> 0 < 997) { break block1 } $5_1 = $3; $3 = $4_1 * $4_1; $3 = $2010($5_1 + $3 / (Math_sqrt($3 + 1.0) + 1.0)); } $233($2_1, ($0_1 | 0) < 0 ? -$3 : $3); return; } fimport$0(23889, 17982, 402, 17803); wasm2js_trap(); } function $1896($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $4_1 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $2_1 = $0_1; $3 = Math_abs($4_1); wasm2js_scratch_store_f64(+$4_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $1_1 = $0_1 >>> 20 & 2047; block1 : { block2 : { if ($1_1 >>> 0 <= 1021) { if ($1_1 >>> 0 < 991) { break block1 } $4_1 = $3 + $3; $3 = $4_1 + $3 * $4_1 / (1.0 - $3); break block2; } $3 = $3 / (1.0 - $3); $3 = $3 + $3; } $3 = $2010($3) * .5; } $233($2_1, ($0_1 | 0) < 0 ? -$3 : $3); return; } fimport$0(23889, 17982, 410, 17813); wasm2js_trap(); } function $1897($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $3 = global$0 - 16 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; if (($1_1 | 0) == 2) { block3 : { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); break block3; } $1_1 = $53(HEAP32[$2_1 >> 2]); $2_1 = $53(HEAP32[$2_1 + 4 >> 2]); $4_1 = $1_1; $1_1 = $3 + 8 | 0; $1898($4_1, $1_1); $1898($2_1, $3); $2_1 = $1_1; $1_1 = $3; while (1) { if (!(($6_1 | 0) == 4)) { $8_1 = ($1899($2_1) | 0) == ($1899($1_1) | 0); while (1) { $5_1 = HEAP8[$2_1 + 1 | 0]; $4_1 = $2_1 + 1 | 0; $2_1 = $4_1; if (($5_1 | 0) < -64) { continue } break; }; $2_1 = $1_1; while (1) { $5_1 = HEAP8[$2_1 + 1 | 0]; $1_1 = $2_1 + 1 | 0; $2_1 = $1_1; if (($5_1 | 0) < -64) { continue } break; }; $6_1 = $6_1 + 1 | 0; $7_1 = $7_1 + $8_1 | 0; $2_1 = $4_1; continue; } break; }; $238($0_1, $7_1); } $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return; } fimport$0(23751, 17982, 1680, 17875); wasm2js_trap(); } function $1898($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { while (1) { $2_1 = HEAPU8[$0_1 + $3 | 0]; if (!$2_1) { break block } if ((($2_1 | 32) - 123 & 255) >>> 0 <= 229) { $3 = $3 + 1 | 0; continue; } break; }; HEAP8[$1_1 | 0] = $2093($2_1); $2_1 = 1; while (1) { block2 : { if (($2_1 | 0) > 3) { break block2 } $4_1 = HEAPU8[$0_1 + $3 | 0]; if (!$4_1) { break block2 } $4_1 = HEAPU8[($4_1 & 127) + 58496 | 0]; if ($4_1) { HEAP8[$1_1 + $2_1 | 0] = $4_1 + 48; $2_1 = $2_1 + 1 | 0; } $3 = $3 + 1 | 0; continue; } break; }; $0_1 = ($2_1 | 0) <= 4 ? 4 : $2_1; while (1) { if (!(($0_1 | 0) == ($2_1 | 0))) { HEAP8[$1_1 + $2_1 | 0] = 48; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP8[$0_1 + $1_1 | 0] = 0; return; } HEAP8[$1_1 + 4 | 0] = HEAPU8[24730]; $0_1 = HEAPU8[24726] | HEAPU8[24727] << 8 | (HEAPU8[24728] << 16 | HEAPU8[24729] << 24); HEAP8[$1_1 | 0] = $0_1; HEAP8[$1_1 + 1 | 0] = $0_1 >>> 8; HEAP8[$1_1 + 2 | 0] = $0_1 >>> 16; HEAP8[$1_1 + 3 | 0] = $0_1 >>> 24; } function $1899($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; $2_1 = $0_1 + 1 | 0; block4 : { block : { block1 : { block2 : { block3 : { $1_1 = HEAPU8[$0_1 | 0]; $3 = HEAPU8[$1_1 + 58624 | 0]; switch ($3 - 1 | 0) { case 0: break block; case 1: break block1; case 2: break block2; case 3: break block3; default: break block4; }; } return 65533; } $2_1 = $0_1 + 2 | 0; $1_1 = HEAPU8[$0_1 + 1 | 0] + ($1_1 << 6) | 0; } $1_1 = HEAPU8[$2_1 | 0] + ($1_1 << 6) | 0; $2_1 = $2_1 + 1 | 0; } $0_1 = HEAPU8[$2_1 | 0] + ($1_1 << 6) | 0; $1_1 = $3 << 2; $0_1 = $0_1 - HEAP32[$1_1 + 58880 >> 2] | 0; $1_1 = ($0_1 & -2) == 65534 ? 65533 : $0_1 & HEAP32[$1_1 + 58896 >> 2] ? (($0_1 & -2048) == 55296 ? 65533 : $0_1) : 65533; } return $1_1; } function $1900($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $3 * 180.0 / 3.141592653589793); return; } fimport$0(23889, 17982, 498, 17831); wasm2js_trap(); } function $1901($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $3 * 3.141592653589793 / 180.0); return; } fimport$0(23889, 17982, 499, 17890); wasm2js_trap(); } function $1902($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $4_1 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $2_1 = $0_1; $0_1 = global$0 - 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; wasm2js_scratch_store_f64(+$4_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $1_1 = $1_1 & 2147483647; block1 : { if ($1_1 >>> 0 <= 1072243195) { $3 = 1.0; if ($1_1 >>> 0 < 1044816030) { break block1 } $3 = $1966($4_1, 0.0); break block1; } $3 = $4_1 - $4_1; if ($1_1 >>> 0 >= 2146435072) { break block1 } $1_1 = $1968($4_1, $0_1); $4_1 = HEAPF64[$0_1 + 8 >> 3]; $3 = HEAPF64[$0_1 >> 3]; block6 : { switch (($1_1 & 3) - 1 | 0) { default: $3 = $1966($3, $4_1); break block1; case 0: $3 = -$1969($3, $4_1, 1); break block1; case 1: $3 = -$1966($3, $4_1); break block1; case 2: break block6; }; } $3 = $1969($3, $4_1, 1); } $4_1 = $3; $0_1 = $0_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $233($2_1, $4_1); return; } fimport$0(23889, 17982, 420, 17669); wasm2js_trap(); } function $1903($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $2_1 = $0_1; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $0_1 = $0_1 & 2147483647; block1 : { if ($0_1 >>> 0 <= 1072243195) { if ($0_1 >>> 0 < 1045430272) { break block1 } $3 = $1969($3, 0.0, 0); break block1; } if ($0_1 >>> 0 >= 2146435072) { $3 = $3 - $3; break block1; } $0_1 = $1968($3, $1_1); $4_1 = HEAPF64[$1_1 + 8 >> 3]; $3 = HEAPF64[$1_1 >> 3]; block6 : { switch (($0_1 & 3) - 1 | 0) { default: $3 = $1969($3, $4_1, 1); break block1; case 0: $3 = $1966($3, $4_1); break block1; case 1: $3 = -$1969($3, $4_1, 1); break block1; case 2: break block6; }; } $3 = -$1966($3, $4_1); } $0_1 = $1_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $233($2_1, $3); return; } fimport$0(23889, 17982, 419, 17740); wasm2js_trap(); } function $1904($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $2090($3)); return; } fimport$0(23889, 17982, 421, 17758); wasm2js_trap(); } function $1905($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, 1.0 / $2090($3)); return; } fimport$0(23889, 17982, 422, 17641); wasm2js_trap(); } function $1906($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $1_1 = $0_1; $3 = Math_abs($3); wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; block1 : { if ($0_1 >>> 0 <= 1072049729) { $4_1 = 1.0; if ($0_1 >>> 0 < 1045430272) { break block1 } $3 = $1984($3); $4_1 = $3 + 1.0; $4_1 = $3 * $3 / ($4_1 + $4_1) + 1.0; break block1; } if ($0_1 >>> 0 <= 1082535489) { $3 = $1979($3); $4_1 = ($3 + 1.0 / $3) * .5; break block1; } $4_1 = $1971($3, 1.0); } $233($1_1, $4_1); return; } fimport$0(23889, 17982, 446, 17794); wasm2js_trap(); } function $1907($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $4_1 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $2_1 = $0_1; wasm2js_scratch_store_f64(.5); $0_1 = wasm2js_scratch_load_i32(1) | 0; $6_1 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+$4_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, $6_1 | 0); wasm2js_scratch_store_i32(1, $0_1 & 2147483647 | $1_1 & -2147483648); $5_1 = +wasm2js_scratch_load_f64(); $3 = Math_abs($4_1); wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; __inlined_func$2066$197 : { block2 : { if ($0_1 >>> 0 <= 1082535489) { $3 = $1984($3); if ($0_1 >>> 0 <= 1072693247) { if ($0_1 >>> 0 < 1045430272) { break block2 } $4_1 = $5_1 * ($3 + $3 - $3 * $3 / ($3 + 1.0)); break __inlined_func$2066$197; } $4_1 = $5_1 * ($3 + $3 / ($3 + 1.0)); break __inlined_func$2066$197; } $4_1 = $1971($3, $5_1 + $5_1); } } $233($2_1, $4_1); return; } fimport$0(23889, 17982, 438, 17804); wasm2js_trap(); } function $1908($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $2091($3)); return; } fimport$0(23889, 17982, 454, 17814); wasm2js_trap(); } function $1909($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, 1.0 / $2091($3)); return; } fimport$0(23889, 17982, 456, 17784); wasm2js_trap(); } function $1910($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $1979($3)); return; } fimport$0(23889, 17982, 474, 17731); wasm2js_trap(); } function $1911($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, $2007($3)); return; } fimport$0(23889, 17982, 472, 17823); wasm2js_trap(); } function $1912($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0.0, $7_1 = 0.0, $8_1 = 0.0, $9_1 = 0.0, $10_1 = 0.0, $11_1 = 0.0, $12_1 = 0.0, $13_1 = 0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $13_1 = $0_1; wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; $1_1 = wasm2js_scratch_load_i32(0) | 0; __inlined_func$2009$208 : { block3 : { block5 : { block2 : { if (($0_1 | 0) <= 1048575) { $4_1 = -Infinity; if ($3 == 0.0) { break __inlined_func$2009$208 } if (($0_1 | 0) >= 0) { break block2 } $4_1 = ($3 - $3) / 0.0; break __inlined_func$2009$208; } if ($0_1 >>> 0 > 2146435071) { break block3 } $2_1 = -1023; if (($0_1 | 0) != 1072693248) { break block5 } $0_1 = 1072693248; if ($1_1) { break block5 } $4_1 = 0.0; break __inlined_func$2009$208; } wasm2js_scratch_store_f64(+($3 * 18014398509481984.0)); $0_1 = wasm2js_scratch_load_i32(1) | 0; $1_1 = wasm2js_scratch_load_i32(0) | 0; $2_1 = -1077; } $0_1 = $0_1 + 614242 | 0; $10_1 = +(($0_1 >>> 20 | 0) + $2_1 | 0); $6_1 = $10_1 * .30102999566361177; wasm2js_scratch_store_i32(0, $1_1 | 0); wasm2js_scratch_store_i32(1, ($0_1 & 1048575) + 1072079006 | 0); $5_1 = +wasm2js_scratch_load_f64() + -1.0; $7_1 = $5_1 * ($5_1 * .5); $8_1 = $5_1 / ($5_1 + 2.0); $9_1 = $8_1 * $8_1; $3 = $9_1 * $9_1; wasm2js_scratch_store_f64(+($5_1 - $7_1)); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $0_1 | 0); $4_1 = +wasm2js_scratch_load_f64(); $11_1 = $4_1 * .4342944818781689; $12_1 = $6_1 + $11_1; $3 = $8_1 * ($7_1 + ($3 * ($3 * ($3 * .15313837699209373 + .22222198432149784) + .3999999999940942) + $9_1 * ($3 * ($3 * ($3 * .14798198605116586 + .1818357216161805) + .2857142874366239) + .6666666666666735))) + ($5_1 - $4_1 - $7_1); $3 = $12_1 + ($11_1 + ($6_1 - $12_1) + ($3 * .4342944818781689 + ($10_1 * 3.694239077158931e-13 + ($3 + $4_1) * 2.5082946711645275e-11))); } $4_1 = $3; } $233($13_1, $4_1); return; } fimport$0(23889, 17982, 473, 17920); wasm2js_trap(); } function $1913($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0.0, $8_1 = 0.0, $9_1 = 0.0, $10_1 = 0, $11_1 = 0.0, $12_1 = 0, $13_1 = 0, $14 = 0.0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0.0, $19_1 = 0.0, $20_1 = 0.0, $21_1 = 0, wasm2js_f64$0 = 0.0, wasm2js_f64$1 = 0.0, wasm2js_i32$0 = 0; if (($1_1 | 0) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $5_1 = $39(HEAP32[$2_1 >> 2]); $4_1 = $39(HEAP32[$2_1 + 4 >> 2]); HEAP32[20691] = 0; $21_1 = $0_1; $12_1 = global$0 - 16 | 0; $0_1 = $12_1; if (global$4 >>> 0 < $0_1 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $10_1 = $1980($5_1); $15_1 = $1980($4_1); $16_1 = $15_1 & 2047; $17_1 = $16_1 - 1086 | 0; wasm2js_scratch_store_f64(+$4_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; $6_1 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+$5_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; $1_1 = wasm2js_scratch_load_i32(0) | 0; block3 : { block1 : { if ($17_1 >>> 0 > 4294967167 & $10_1 - 2047 >>> 0 >= 4294965250) { break block1 } if ($2040($6_1, $2_1)) { $3 = 1.0; if (!$1_1 & ($0_1 | 0) == 1072693248) { break block3 } $10_1 = $6_1 << 1; $6_1 = $2_1 << 1 | $6_1 >>> 31; if (!($10_1 | $6_1)) { break block3 } $0_1 = $0_1 << 1 | $1_1 >>> 31; $1_1 = $1_1 << 1; if (!(!(($0_1 | 0) == -2097152 & ($1_1 | 0) != 0 | $0_1 >>> 0 > 4292870144) & (!$10_1 & ($6_1 | 0) == -2097152 | $6_1 >>> 0 < 4292870144))) { $3 = $5_1 + $4_1; break block3; } if (!$1_1 & ($0_1 | 0) == 2145386496) { break block3 } $3 = ($2_1 | 0) < 0 ^ $0_1 >>> 0 < 2145386496 ? 0.0 : $4_1 * $4_1; break block3; } if ($2040($1_1, $0_1)) { $3 = $5_1 * $5_1; if (($0_1 | 0) < 0) { $3 = ($2041($6_1, $2_1) | 0) == 1 ? -$3 : $3 } if (($2_1 | 0) >= 0) { break block3 } $3 = $1976(1.0 / $3); break block3; } if (($0_1 | 0) < 0) { $0_1 = $2041($6_1, $2_1); if (!$0_1) { $3 = $2006($5_1); break block3; } $13_1 = ($0_1 | 0) == 1 ? 262144 : 0; $10_1 = $10_1 & 2047; wasm2js_scratch_store_f64(+$5_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; $1_1 = wasm2js_scratch_load_i32(0) | 0; $0_1 = $0_1 & 2147483647; } if ($17_1 >>> 0 <= 4294967167) { $3 = 1.0; $2_1 = ($0_1 | 0) == 1072693248; if ($2_1 & !$1_1) { break block3 } if ($16_1 >>> 0 <= 957) { $3 = (($1_1 | 0) != 0 & $2_1 | $0_1 >>> 0 > 1072693248 ? $4_1 : -$4_1) + 1.0; break block3; } if ((($0_1 | 0) == 1072693248 & ($1_1 | 0) != 0 | $0_1 >>> 0 > 1072693248) != ($15_1 >>> 0 > 2047 | 0)) { $3 = $1978(0); break block3; } $3 = $1977(0); break block3; } if ($10_1) { break block1 } wasm2js_scratch_store_f64(+($5_1 * 4503599627370496.0)); $0_1 = wasm2js_scratch_load_i32(1) | 0; $1_1 = wasm2js_scratch_load_i32(0) | 0; $0_1 = ($0_1 & 2147483647) - 54525952 | 0; } wasm2js_scratch_store_i32(0, $6_1 & -134217728); wasm2js_scratch_store_i32(1, $2_1 | 0); $18_1 = +wasm2js_scratch_load_f64(); $2_1 = $0_1 - 1072076117 | 0; $6_1 = $2_1 >> 31; $9_1 = +($2_1 >> 20 >>> 0) + +($6_1 | 0) * 4294967296.0; $6_1 = ($2_1 >>> 13 & 127) << 5; $14 = $9_1 * HEAPF64[8537] + HEAPF64[$6_1 + 68384 >> 3]; wasm2js_scratch_store_i32(0, 0); $0_1 = $0_1 - ($2_1 & -1048576) | 0; wasm2js_scratch_store_i32(1, ($1_1 - -2147483648 >>> 0 < 2147483648 ? $0_1 + 1 | 0 : $0_1) | 0); $3 = +wasm2js_scratch_load_f64(); $7_1 = HEAPF64[$6_1 + 68360 >> 3]; $5_1 = $3 * $7_1 + -1.0; wasm2js_scratch_store_i32(0, $1_1 | 0); wasm2js_scratch_store_i32(1, $0_1 | 0); $19_1 = (+wasm2js_scratch_load_f64() - $3) * $7_1; $3 = $5_1 + $19_1; $11_1 = HEAPF64[8538]; $7_1 = $3 * $11_1; $20_1 = $9_1 * HEAPF64[8536] + HEAPF64[$6_1 + 68376 >> 3]; $9_1 = $3 + $20_1; $8_1 = $5_1; $5_1 = $5_1 * $11_1; $8_1 = $8_1 * $5_1; $11_1 = $9_1 + $8_1; $8_1 = $14 + ($3 + ($20_1 - $9_1)) + $19_1 * ($7_1 + $5_1) + ($8_1 + ($9_1 - $11_1)); $5_1 = $3 * $7_1; $3 = $8_1 + $3 * $5_1 * ($5_1 * ($5_1 * ($3 * HEAPF64[8544] + HEAPF64[8543]) + ($3 * HEAPF64[8542] + HEAPF64[8541])) + ($3 * HEAPF64[8540] + HEAPF64[8539])); $5_1 = $11_1 + $3; HEAPF64[$12_1 + 8 >> 3] = $3 + ($11_1 - $5_1); wasm2js_scratch_store_f64(+$5_1); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_store_i32(0, wasm2js_scratch_load_i32(0) & -134217728); wasm2js_scratch_store_i32(1, $0_1 | 0); $7_1 = +wasm2js_scratch_load_f64(); $3 = $18_1 * $7_1; $4_1 = ($4_1 - $18_1) * $7_1 + $4_1 * (HEAPF64[$12_1 + 8 >> 3] + ($5_1 - $7_1)); __inlined_func$2044$329 : { block : { $0_1 = $1980($3) & 2047; $1_1 = $1980(5.551115123125783e-17); if ($0_1 - $1_1 >>> 0 < $1980(512.0) - $1_1 >>> 0) { break block } if ($0_1 >>> 0 < $1_1 >>> 0) { $3 = $3 + 1.0; $3 = $13_1 ? -$3 : $3; break __inlined_func$2044$329; } $1_1 = $1980(1024.0) >>> 0 > $0_1 >>> 0; $0_1 = 0; if ($1_1) { break block } wasm2js_scratch_store_f64(+$3); $0_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; if (($0_1 | 0) < 0) { $3 = $1977($13_1); break __inlined_func$2044$329; } $3 = $1978($13_1); break __inlined_func$2044$329; } $8_1 = $4_1; $4_1 = HEAPF64[7737]; $5_1 = $3 * HEAPF64[7736] + $4_1; $4_1 = $5_1 - $4_1; $3 = $8_1 + ($4_1 * HEAPF64[7739] + ($4_1 * HEAPF64[7738] + $3)); $4_1 = $3 * $3; $14 = $4_1 * $4_1 * ($3 * HEAPF64[7743] + HEAPF64[7742]); $8_1 = $4_1 * ($3 * HEAPF64[7741] + HEAPF64[7740]); wasm2js_scratch_store_f64(+$5_1); wasm2js_scratch_load_i32(1) | 0; $6_1 = wasm2js_scratch_load_i32(0) | 0; $2_1 = $6_1 << 4 & 2032; $3 = $14 + ($8_1 + (HEAPF64[$2_1 + 62e3 >> 3] + $3)); $1_1 = HEAP32[$2_1 + 62008 >> 2]; $2_1 = HEAP32[$2_1 + 62012 >> 2] + ($6_1 + $13_1 << 13) | 0; if (!$0_1) { __inlined_func$2045$263 : { if (!($6_1 & -2147483648)) { wasm2js_scratch_store_i32(0, $1_1 | 0); wasm2js_scratch_store_i32(1, $2_1 - 1058013184 | 0); $4_1 = +wasm2js_scratch_load_f64(); $3 = ($4_1 * $3 + $4_1) * 5486124068793688683255936.0e279; break __inlined_func$2045$263; } wasm2js_scratch_store_i32(0, $1_1 | 0); $0_1 = $2_1 + 1071644672 | 0; wasm2js_scratch_store_i32(1, $0_1 | 0); $4_1 = +wasm2js_scratch_load_f64(); $7_1 = $4_1 * $3; $3 = $7_1 + $4_1; if (Math_abs($3) < 1.0) { $1983($1976(2.2250738585072014e-308) * 2.2250738585072014e-308); wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $0_1 & -2147483648); $5_1 = $3 < 0.0 ? -1.0 : 1.0; $9_1 = $3 + $5_1; $3 = $9_1 + ($7_1 + ($4_1 - $3) + ($3 + ($5_1 - $9_1))) - $5_1; $3 = (wasm2js_f64$0 = +wasm2js_scratch_load_f64(), wasm2js_f64$1 = $3, wasm2js_i32$0 = $3 == 0.0, wasm2js_i32$0 ? wasm2js_f64$0 : wasm2js_f64$1); } $3 = $3 * 2.2250738585072014e-308; } break __inlined_func$2044$329; } wasm2js_scratch_store_i32(0, $1_1 | 0); wasm2js_scratch_store_i32(1, $2_1 | 0); $4_1 = +wasm2js_scratch_load_f64(); $3 = $4_1 * $3 + $4_1; } } $0_1 = $12_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; $233($21_1, $3); return; } fimport$0(23751, 17982, 546, 17687); wasm2js_trap(); } function $1914($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0; if (($1_1 | 0) == 1) { block2 : { switch ($221(HEAP32[$2_1 >> 2]) - 1 | 0) { case 0: $4_1 = $0_1; $1_1 = $217(HEAP32[$2_1 >> 2]); $0_1 = i64toi32_i32$HIGH_BITS; $2_1 = ($1_1 | $0_1) != 0; $0_1 = !$1_1 & ($0_1 | 0) <= 0 | ($0_1 | 0) < 0; $240($4_1, $0_1 ? ($2_1 ? -1 : 0) : 1, $0_1 ? ($2_1 ? -1 : 0) : 0); return; case 4: $241($0_1); return; default: break block2; }; } $3 = $39(HEAP32[$2_1 >> 2]); $233($0_1, $3 > 0.0 ? 1.0 : $3 < 0.0 ? -1.0 : 0.0); return; } fimport$0(23889, 17982, 590, 17748); wasm2js_trap(); } function $1915($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $39(HEAP32[$2_1 >> 2]); HEAP32[20691] = 0; $233($0_1, Math_sqrt($3)); return; } fimport$0(23889, 17982, 375, 17632); wasm2js_trap(); } function $1916($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0; if (($1_1 | 0) == 1) { block2 : { switch ($221(HEAP32[$2_1 >> 2]) - 1 | 0) { case 0: $4_1 = $0_1; $0_1 = $217(HEAP32[$2_1 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; $240($4_1, __wasm_i64_mul($0_1, $1_1, $0_1, $1_1), i64toi32_i32$HIGH_BITS); return; case 4: $241($0_1); return; default: break block2; }; } $3 = $39(HEAP32[$2_1 >> 2]); $233($0_1, $3 * $3); return; } fimport$0(23889, 17982, 514, 17864); wasm2js_trap(); } function $1917($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { block2 : { switch ($221(HEAP32[$2_1 >> 2]) - 1 | 0) { case 0: $240($0_1, $217(HEAP32[$2_1 >> 2]), i64toi32_i32$HIGH_BITS); return; case 4: $241($0_1); return; default: break block2; }; } $3 = Math_ceil($39(HEAP32[$2_1 >> 2])); if (Math_abs($3) < 9223372036854775808.0) { $2_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $1_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $1_1 = 0 } } else { $2_1 = 0; $1_1 = -2147483648; } $240($0_1, $2_1, $1_1); return; } fimport$0(23889, 17982, 620, 17766); wasm2js_trap(); } function $1918($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0; if (($1_1 | 0) == 1) { block2 : { switch ($221(HEAP32[$2_1 >> 2]) - 1 | 0) { case 0: $240($0_1, $217(HEAP32[$2_1 >> 2]), i64toi32_i32$HIGH_BITS); return; case 4: $241($0_1); return; default: break block2; }; } $3 = Math_floor($39(HEAP32[$2_1 >> 2])); if (Math_abs($3) < 9223372036854775808.0) { $2_1 = ~~$3 >>> 0; if (Math_abs($3) >= 1.0) { $1_1 = ~~($3 > 0.0 ? Math_min(Math_floor($3 * 2.3283064365386963e-10), 4294967295.0) : Math_ceil(($3 - +(~~$3 >>> 0 >>> 0)) * 2.3283064365386963e-10)) >>> 0 } else { $1_1 = 0 } } else { $2_1 = 0; $1_1 = -2147483648; } $240($0_1, $2_1, $1_1); return; } fimport$0(23889, 17982, 645, 17677); wasm2js_trap(); } function $1919($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $233($0_1, 3.141592653589793); } function $1920($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block : { if (($1_1 | 0) != 2) { break block } if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { break block } $7_1 = $217(HEAP32[$2_1 + 4 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; $8_1 = $1_1; if (($1_1 | 0) < 0) { $235($0_1, 9177, -1); return; } $6_1 = $209(HEAP32[$2_1 >> 2]); $3 = $23(Math_imul($6_1, $7_1) + 1 | 0); $4_1 = $23($6_1 + 1 | 0); if ($4_1 ? !$3 : 1) { $227($0_1); if ($3) { $24($3) } if (!$4_1) { break block } $24($4_1); return; } $1_1 = 0; $2_1 = $2075($4_1, $53(HEAP32[$2_1 >> 2])); while (1) { if (!(($5_1 | 0) == ($7_1 | 0) & ($1_1 | 0) == ($8_1 | 0))) { $2075($3 + Math_imul($5_1, $6_1) | 0, $2_1); $5_1 = $5_1 + 1 | 0; $1_1 = $5_1 ? $1_1 : $1_1 + 1 | 0; continue; } break; }; $246($0_1, $3, -1, -1); $24($3); $24($2_1); } } function $1921($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0; block3 : { block5 : { block6 : { if (($1_1 & -2) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $5_1 = $53(HEAP32[$2_1 >> 2]); if (!$5_1) { break block3 } $3 = $53(HEAP32[$2_1 + 4 >> 2]); if (($1_1 | 0) == 3) { $1_1 = $50(HEAP32[$2_1 + 8 >> 2]); $8_1 = (($1_1 | 0) <= 1 ? 1 : $1_1) - 1 | 0; } if (!HEAPU8[$5_1 | 0]) { break block5 } while (1) { if (!$1899($3) | ($4_1 | 0) == ($8_1 | 0)) { break block6 } $4_1 = $4_1 + 1 | 0; while (1) { $1_1 = HEAP8[$3 + 1 | 0]; $3 = $3 + 1 | 0; if (($1_1 | 0) < -64) { continue } break; }; continue; }; } fimport$0(23741, 17982, 1038, 17618); wasm2js_trap(); } $4_1 = 0; while (1) { $2_1 = $5_1; $1_1 = $3; if (!$1899($1_1)) { break block5 } while (1) { $6_1 = $1899($2_1); $11_1 = $1899($1_1); while (1) { $7_1 = HEAP8[$2_1 + 1 | 0]; $9_1 = $2_1 + 1 | 0; $2_1 = $9_1; if (($7_1 | 0) < -64) { continue } break; }; $2_1 = $1_1; while (1) { $7_1 = HEAP8[$2_1 + 1 | 0]; $1_1 = $2_1 + 1 | 0; $2_1 = $1_1; if (($7_1 | 0) < -64) { continue } break; }; if ($6_1) { $2_1 = $9_1; if (($6_1 | 0) == ($11_1 | 0)) { continue } } break; }; if ($6_1) { while (1) { $1_1 = HEAP8[$3 + 1 | 0]; $3 = $3 + 1 | 0; if (($1_1 | 0) < -64) { continue } break; }; $10_1 = $10_1 + 1 | 0; continue; } break; }; $4_1 = ($8_1 + $10_1 | 0) + 1 | 0; } $238($0_1, $4_1); } } function $1922($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; if (($1_1 | 0) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $1_1 = $53(HEAP32[$2_1 >> 2]); $2_1 = $50(HEAP32[$2_1 + 4 >> 2]); $4_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $2_1 = $1_1; while (1) { if (!(!$1899($2_1) | ($3 | 0) == ($4_1 | 0))) { $3 = $3 + 1 | 0; while (1) { $5_1 = HEAP8[$2_1 + 1 | 0]; $2_1 = $2_1 + 1 | 0; if (($5_1 | 0) < -64) { continue } break; }; continue; } break; }; $2_1 = $2_1 - $1_1 | 0; $3 = $23($2_1 + 1 | 0); if (!$3) { $227($0_1); return; } $1_1 = $2083($3, $1_1, $2_1); HEAP8[$1_1 + $2_1 | 0] = 0; $246($0_1, $1_1, -1, -1); $24($1_1); return; } fimport$0(23751, 17982, 1073, 17659); wasm2js_trap(); } function $1923($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0; if (($1_1 | 0) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $1_1 = $53(HEAP32[$2_1 >> 2]); $4_1 = $50(HEAP32[$2_1 + 4 >> 2]); $2_1 = $1_1; while (1) { if ($1899($2_1)) { while (1) { $5_1 = HEAP8[$2_1 + 1 | 0]; $2_1 = $2_1 + 1 | 0; if (($5_1 | 0) < -64) { continue } break; }; $3 = $3 + 1 | 0; continue; } break; }; $3 = $3 - $4_1 | 0; $3 = ($3 | 0) > 0 ? $3 : 0; while (1) { if (($3 | 0) > 0) { $3 = $3 - 1 | 0; while (1) { $4_1 = HEAP8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if (($4_1 | 0) < -64) { continue } break; }; continue; } break; }; $2_1 = $23(($2_1 - $1_1 | 0) + 1 | 0); if (!$2_1) { $227($0_1); return; } $3 = $0_1; $0_1 = $2075($2_1, $1_1); $246($3, $0_1, -1, -1); $24($0_1); return; } fimport$0(23751, 17982, 1113, 17649); wasm2js_trap(); } function $1924($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $3 = $53(HEAP32[$2_1 >> 2]); $1_1 = $2080($3); $4_1 = $23($1_1 + 1 | 0); if (!$4_1) { $227($0_1); return; } $1_1 = $1_1 + $4_1 | 0; HEAP8[$1_1 | 0] = 0; $6_1 = $1_1 - 1 | 0; label1 : while (1) { $1_1 = $3; if ($1899($1_1)) { while (1) { $2_1 = 1; $5_1 = HEAP8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if (($5_1 | 0) < -64) { continue } break; }; while (1) { $5_1 = $1_1 - $2_1 | 0; if ($3 >>> 0 > $5_1 >>> 0) { $3 = $1_1; continue label1; } else { HEAP8[$6_1 | 0] = HEAPU8[$5_1 | 0]; $2_1 = $2_1 + 1 | 0; $6_1 = $6_1 - 1 | 0; continue; } }; } break; }; $246($0_1, $4_1, -1, -1); $24($4_1); return; } fimport$0(17942, 17982, 1323, 17843); wasm2js_trap(); } function $1925($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block2 : { if (($1_1 | 0) == 1) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $1_1 = $53(HEAP32[$2_1 >> 2]); $4_1 = $1926($1_1); if (!$4_1) { break block2 } $6_1 = 1; $5_1 = $4_1; while (1) { $2_1 = HEAPU8[$1_1 | 0]; if ($2_1) { $7_1 = 1; $1_1 = $1_1 + 1 | 0; $3 = $2_1 << 24 >> 24; if (!(($3 | 0) == 32 | ($3 | 0) == 9)) { $7_1 = 0; block6 : { if (($6_1 | 0) == 1) { $2_1 = $2093($3); break block6; } $2_1 = $3 - 65 >>> 0 < 26 ? $3 | 32 : $3; } } HEAP8[$5_1 | 0] = $2_1; $5_1 = $5_1 + 1 | 0; $6_1 = $7_1; continue; } break; }; HEAP8[$5_1 | 0] = 0; $246($0_1, $4_1, -1, -1); $24($4_1); return; } fimport$0(23889, 17982, 724, 17711); wasm2js_trap(); } $227($0_1); } function $1926($0_1) { return $2075($23($2080($0_1) + 1 | 0), $0_1); } function $1927($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; block4 : { if (($1_1 | 0) == 2) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $7_1 = $53(HEAP32[$2_1 >> 2]); $2_1 = $217(HEAP32[$2_1 + 4 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; $6_1 = $1_1; if (($1_1 | 0) < 0) { $235($0_1, 9177, -1); return; } $1_1 = $1928($7_1); $4_1 = $1_1 >> 31; $3 = $4_1; block5 : { if (!($1_1 >>> 0 < $2_1 >>> 0 & ($3 | 0) <= ($6_1 | 0) | ($3 | 0) < ($6_1 | 0))) { $5_1 = $1926($7_1); if (!$5_1) { break block4 } $246($0_1, $5_1, -1, -1); break block5; } $3 = $2_1 - $1_1 | 0; $5_1 = $23(($2080($7_1) + $3 | 0) + 1 | 0); if (!$5_1) { break block4 } $4_1 = $6_1 - ($4_1 + ($1_1 >>> 0 > $2_1 >>> 0) | 0) | 0; $6_1 = $3 + 1 | 0; $4_1 = $6_1 ? $4_1 : $4_1 + 1 | 0; $3 = 1; $1_1 = 0; $2_1 = $5_1; while (1) { if (!(($3 | 0) == ($6_1 | 0) & ($1_1 | 0) == ($4_1 | 0))) { HEAP8[$2_1 | 0] = 32; $3 = $3 + 1 | 0; $1_1 = $3 ? $1_1 : $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $2075($2_1, $7_1); } $246($0_1, $5_1, -1, -1); $24($5_1); return; } fimport$0(23751, 17982, 771, 17775); wasm2js_trap(); } $227($0_1); } function $1928($0_1) { var $1_1 = 0, $2_1 = 0; while (1) { block : { if (($0_1 | 0) == -1) { break block } $1_1 = HEAPU8[$0_1 | 0]; if (!$1_1) { break block } $2_1 = $2_1 + 1 | 0; $0_1 = (HEAPU8[$1_1 + 58624 | 0] + $0_1 | 0) + 1 | 0; continue; } break; }; return $2_1; } function $1929($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block4 : { if (($1_1 | 0) == 2) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $7_1 = $53(HEAP32[$2_1 >> 2]); $2_1 = $217(HEAP32[$2_1 + 4 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; $6_1 = $1_1; if (($1_1 | 0) < 0) { $235($0_1, 9177, -1); return; } $1_1 = $1928($7_1); $4_1 = $1_1 >> 31; $3 = $4_1; block5 : { if (!($1_1 >>> 0 < $2_1 >>> 0 & ($3 | 0) <= ($6_1 | 0) | ($3 | 0) < ($6_1 | 0))) { $1_1 = $1926($7_1); if (!$1_1) { break block4 } $246($0_1, $1_1, -1, -1); break block5; } $3 = $2_1 - $1_1 | 0; $8_1 = $2080($7_1); $5_1 = $23(($3 + $8_1 | 0) + 1 | 0); if (!$5_1) { break block4 } $4_1 = $6_1 - ($4_1 + ($1_1 >>> 0 > $2_1 >>> 0) | 0) | 0; $6_1 = $3 + 1 | 0; $4_1 = $6_1 ? $4_1 : $4_1 + 1 | 0; $1_1 = $2075($5_1, $7_1); $2_1 = $8_1 + $1_1 | 0; $5_1 = 1; $3 = 0; while (1) { if (!(($6_1 | 0) == ($5_1 | 0) & ($3 | 0) == ($4_1 | 0))) { HEAP8[$2_1 | 0] = 32; $5_1 = $5_1 + 1 | 0; $3 = $5_1 ? $3 : $3 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP8[$2_1 | 0] = 0; } $246($0_1, $1_1, -1, -1); $24($1_1); return; } fimport$0(23751, 17982, 825, 17722); wasm2js_trap(); } $227($0_1); } function $1930($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; block4 : { if (($1_1 | 0) == 2) { if (($221(HEAP32[$2_1 >> 2]) | 0) == 5) { $241($0_1); return; } $8_1 = $53(HEAP32[$2_1 >> 2]); $6_1 = $217(HEAP32[$2_1 + 4 >> 2]); $1_1 = i64toi32_i32$HIGH_BITS; $7_1 = $1_1; if (($1_1 | 0) < 0) { $235($0_1, 9177, -1); return; } $1_1 = $1928($8_1); $9_1 = $1_1; $11_1 = $1_1 >> 31; $2_1 = $11_1; block5 : { if (!($1_1 >>> 0 < $6_1 >>> 0 & ($2_1 | 0) <= ($7_1 | 0) | ($2_1 | 0) < ($7_1 | 0))) { $5_1 = $1926($8_1); if (!$5_1) { break block4 } $246($0_1, $5_1, -1, -1); break block5; } $12_1 = $2080($8_1); $5_1 = $23(($12_1 + ($6_1 - $1_1 | 0) | 0) + 1 | 0); if (!$5_1) { break block4 } $3 = $6_1 - $9_1 | 0; $2_1 = $7_1 - ($11_1 + ($6_1 >>> 0 < $9_1 >>> 0) | 0) | 0; $1_1 = $2_1 >>> 1 | 0; $4_1 = (($2_1 & 1) << 31 | $3 >>> 1) + 1 | 0; $10_1 = $4_1 ? $1_1 : $1_1 + 1 | 0; $3 = 1; $1_1 = 0; $2_1 = $5_1; while (1) { if (!(($3 | 0) == ($4_1 | 0) & ($1_1 | 0) == ($10_1 | 0))) { HEAP8[$2_1 | 0] = 32; $3 = $3 + 1 | 0; $1_1 = $3 ? $1_1 : $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; $3 = $4_1; $1_1 = 0; $2_1 = $2075($2_1, $8_1) + $12_1 | 0; while (1) { $4_1 = $1_1 + $11_1 | 0; $10_1 = $3 + $9_1 | 0; $4_1 = $10_1 >>> 0 < $9_1 >>> 0 ? $4_1 + 1 | 0 : $4_1; if (!($6_1 >>> 0 < $10_1 >>> 0 & ($4_1 | 0) >= ($7_1 | 0) | ($4_1 | 0) > ($7_1 | 0))) { HEAP8[$2_1 | 0] = 32; $3 = $3 + 1 | 0; $1_1 = $3 ? $1_1 : $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; continue; } break; }; HEAP8[$2_1 | 0] = 0; } $246($0_1, $5_1, -1, -1); $24($5_1); return; } fimport$0(23751, 17982, 880, 17902); wasm2js_trap(); } $227($0_1); } function $1931($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; block3 : { if (($1_1 | 0) == 2) { block2 : { if (($221(HEAP32[$2_1 >> 2]) | 0) != 5) { if (($221(HEAP32[$2_1 + 4 >> 2]) | 0) != 5) { break block2 } } $241($0_1); return; } $3 = $53(HEAP32[$2_1 >> 2]); $8_1 = $53(HEAP32[$2_1 + 4 >> 2]); $4_1 = $23($2080($3) + 1 | 0); if (!$4_1) { break block3 } $6_1 = $4_1; while (1) { $2_1 = $8_1; $5_1 = $1899($3); if ($5_1) { while (1) { $7_1 = $1899($2_1); if (!(!$7_1 | ($5_1 | 0) == ($7_1 | 0))) { while (1) { $1_1 = HEAP8[$2_1 + 1 | 0]; $2_1 = $2_1 + 1 | 0; if (($1_1 | 0) < -64) { continue } break; }; continue; } break; }; $1_1 = $2_1; if ($7_1) { while (1) { $5_1 = HEAP8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if (($5_1 | 0) < -64) { continue } break; }; $1_1 = $1_1 - $2_1 | 0; $6_1 = $2083($6_1, $2_1, $1_1) + $1_1 | 0; } while (1) { $2_1 = HEAP8[$3 + 1 | 0]; $1_1 = $3 + 1 | 0; $3 = $1_1; if (($2_1 | 0) < -64) { continue } break; }; continue; } break; }; HEAP8[$6_1 | 0] = 0; $246($0_1, $4_1, -1, -1); $24($4_1); return; } fimport$0(23751, 17982, 939, 17697); wasm2js_trap(); } $227($0_1); } function $1932($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0; if (($1_1 | 0) == 1) { $0_1 = $266($0_1, 24); if (($301(HEAP32[$2_1 >> 2]) | 0) != 5) { $1_1 = HEAP32[$0_1 + 20 >> 2]; $6_1 = $1_1; $7_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $1_1 ? $6_1 : $7_1; $4_1 = $39(HEAP32[$2_1 >> 2]); $3 = HEAPF64[$0_1 >> 3]; $5_1 = $4_1 - $3; $3 = $3 + $5_1 / (+HEAPU32[$0_1 + 16 >> 2] + +HEAP32[$0_1 + 20 >> 2] * 4294967296.0); HEAPF64[$0_1 >> 3] = $3; HEAPF64[$0_1 + 8 >> 3] = $5_1 * ($4_1 - $3) + HEAPF64[$0_1 + 8 >> 3]; } return; } fimport$0(23889, 17982, 1395, 10016); wasm2js_trap(); } function $1933($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0.0; $1_1 = $266($0_1, 0); block : { if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 16 >> 2]; $3 = HEAP32[$1_1 + 20 >> 2]; if ($2_1 >>> 0 < 2 & ($3 | 0) <= 0 | ($3 | 0) < 0) { break block } $4_1 = HEAPF64[$1_1 + 8 >> 3]; $1_1 = $3 - 1 | 0; $2_1 = $2_1 - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; $4_1 = Math_sqrt($4_1 / (+($2_1 >>> 0) + +($1_1 >>> 0) * 4294967296.0)); } $233($0_1, $4_1); } function $1934($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0.0; $1_1 = $266($0_1, 0); block : { if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 16 >> 2]; $3 = HEAP32[$1_1 + 20 >> 2]; if ($2_1 >>> 0 < 2 & ($3 | 0) <= 0 | ($3 | 0) < 0) { break block } $4_1 = HEAPF64[$1_1 + 8 >> 3]; $1_1 = $3 - 1 | 0; $2_1 = $2_1 - 1 | 0; $1_1 = ($2_1 | 0) != -1 ? $1_1 + 1 | 0 : $1_1; $4_1 = $4_1 / (+($2_1 >>> 0) + +($1_1 >>> 0) * 4294967296.0); } $233($0_1, $4_1); } function $1935($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0.0; if (($1_1 | 0) == 1) { $3 = $301(HEAP32[$2_1 >> 2]); if (($3 | 0) != 5) { block6 : { block5 : { block3 : { $0_1 = $266($0_1, 64); block4 : { if (!HEAP32[$0_1 + 56 >> 2]) { $1_1 = $2117(12); HEAP32[$0_1 + 56 >> 2] = $1_1; if (($3 | 0) != 1) { break block3 } HEAP32[$1_1 + 4 >> 2] = 435; HEAP32[$0_1 + 48 >> 2] = 0; HEAP32[$0_1 + 52 >> 2] = 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $1_1; $4_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $3 = $1_1 ? $3 : $4_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $3; break block4; } $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $1_1; $4_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $3 = $1_1 ? $3 : $4_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $3; if (HEAP32[$0_1 + 48 >> 2] | HEAP32[$0_1 + 52 >> 2]) { break block5 } } $1_1 = $217(HEAP32[$2_1 >> 2]); $3 = i64toi32_i32$HIGH_BITS; $2_1 = $2117(8); HEAP32[$2_1 >> 2] = $1_1; HEAP32[$2_1 + 4 >> 2] = $3; break block6; } HEAP32[$0_1 + 48 >> 2] = 1; HEAP32[$0_1 + 52 >> 2] = 0; HEAP32[$1_1 + 4 >> 2] = 436; $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $1_1; $4_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $3 = $1_1 ? $3 : $4_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $3; } $5_1 = $39(HEAP32[$2_1 >> 2]); $2_1 = $2117(8); HEAPF64[$2_1 >> 3] = $5_1; } $0_1 = HEAP32[$0_1 + 56 >> 2]; $1_1 = HEAP32[$0_1 + 4 >> 2]; while (1) { __inlined_func$1947$330 : { $3 = HEAP32[$0_1 >> 2]; if (!$3) { $1_1 = $2117(24); HEAP32[$1_1 + 16 >> 2] = 1; HEAP32[$1_1 + 20 >> 2] = 0; HEAP32[$1_1 + 8 >> 2] = $2_1; HEAP32[$0_1 >> 2] = $1_1; break __inlined_func$1947$330; } $3 = FUNCTION_TABLE[$1_1 | 0](HEAP32[$3 + 8 >> 2], $2_1) | 0; if ($3) { $0_1 = HEAP32[$0_1 >> 2] + (($3 | 0) <= 0 ? 4 : 0) | 0; continue; } else { $0_1 = HEAP32[$0_1 >> 2]; $1_1 = HEAP32[$0_1 + 20 >> 2]; $3 = $1_1; $4_1 = $1_1 + 1 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2] + 1 | 0; $3 = $1_1 ? $3 : $4_1; HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $3; $2111($2_1); } } break; }; } return; } fimport$0(23889, 17982, 1418, 10007); wasm2js_trap(); } function $1936($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$1_1 >> 2]; $0_1 = HEAP32[$0_1 + 4 >> 2]; $1_1 = HEAP32[$1_1 + 4 >> 2]; return ($2_1 >>> 0 > $3 >>> 0 & ($0_1 | 0) >= ($1_1 | 0) | ($0_1 | 0) > ($1_1 | 0)) - ($2_1 >>> 0 < $3 >>> 0 & ($0_1 | 0) <= ($1_1 | 0) | ($0_1 | 0) < ($1_1 | 0)) | 0; } function $1937($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0.0, $3 = 0.0; $2_1 = HEAPF64[$0_1 >> 3]; $3 = HEAPF64[$1_1 >> 3]; return ($2_1 != $3 ? ($2_1 < $3 ? -1 : 1) : 0) | 0; } function $1939($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 56 >> 2]; if (!$2_1) { break block } $1941($2_1, 437, $1_1); $1942(HEAP32[$1_1 + 56 >> 2]); $2111(HEAP32[$1_1 + 56 >> 2]); if (HEAP32[$1_1 + 40 >> 2] != 1 | HEAP32[$1_1 + 44 >> 2]) { break block } if (!(HEAP32[$1_1 + 48 >> 2] | HEAP32[$1_1 + 52 >> 2])) { $240($0_1, HEAP32[$1_1 >> 2], HEAP32[$1_1 + 4 >> 2]); return; } $233($0_1, HEAPF64[$1_1 + 8 >> 3]); } } function $1940($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0.0; folding_inner0 : { block2 : { if (!(HEAP32[$3 + 48 >> 2] | HEAP32[$3 + 52 >> 2])) { $5_1 = HEAP32[$3 + 32 >> 2]; $4_1 = HEAP32[$3 + 36 >> 2]; if (!(($1_1 | 0) != ($5_1 | 0) | ($2_1 | 0) != ($4_1 | 0))) { break folding_inner0 } if (($2_1 | 0) <= ($4_1 | 0) & $1_1 >>> 0 <= $5_1 >>> 0 | ($2_1 | 0) < ($4_1 | 0)) { break block2 } $0_1 = HEAP32[$0_1 >> 2]; HEAP32[$3 + 40 >> 2] = 1; HEAP32[$3 + 44 >> 2] = 0; HEAP32[$3 + 32 >> 2] = $1_1; HEAP32[$3 + 36 >> 2] = $2_1; HEAP32[$3 >> 2] = $0_1; HEAP32[$3 + 4 >> 2] = $0_1 >> 31; return; } $5_1 = HEAP32[$3 + 32 >> 2]; $4_1 = HEAP32[$3 + 36 >> 2]; if (!(($1_1 | 0) != ($5_1 | 0) | ($2_1 | 0) != ($4_1 | 0))) { break folding_inner0 } if (($2_1 | 0) <= ($4_1 | 0) & $1_1 >>> 0 <= $5_1 >>> 0 | ($2_1 | 0) < ($4_1 | 0)) { break block2 } $6_1 = HEAPF64[$0_1 >> 3]; HEAP32[$3 + 40 >> 2] = 1; HEAP32[$3 + 44 >> 2] = 0; HEAP32[$3 + 32 >> 2] = $1_1; HEAP32[$3 + 36 >> 2] = $2_1; HEAPF64[$3 + 8 >> 3] = $6_1; } return; } $0_1 = HEAP32[$3 + 44 >> 2]; $1_1 = HEAP32[$3 + 40 >> 2] + 1 | 0; $0_1 = $1_1 ? $0_1 : $0_1 + 1 | 0; HEAP32[$3 + 40 >> 2] = $1_1; HEAP32[$3 + 44 >> 2] = $0_1; } function $1941($0_1, $1_1, $2_1) { $1948(HEAP32[$0_1 >> 2], $1_1, $2_1); } function $1942($0_1) { $1949(HEAP32[$0_1 >> 2]); } function $1943($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { HEAPF64[$1_1 + 24 >> 3] = (+HEAPU32[$1_1 + 16 >> 2] + +HEAP32[$1_1 + 20 >> 2] * 4294967296.0) * .5; $1944($0_1); } } function $1944($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; block : { $1_1 = $266($0_1, 0); if (!$1_1) { break block } $2_1 = HEAP32[$1_1 + 56 >> 2]; if (!$2_1) { break block } HEAP32[$1_1 + 60 >> 2] = 0; $1941($2_1, 438, $1_1); $1942(HEAP32[$1_1 + 56 >> 2]); $2111(HEAP32[$1_1 + 56 >> 2]); if (!(HEAP32[$1_1 + 48 >> 2] | HEAP32[$1_1 + 52 >> 2])) { $2_1 = HEAP32[$1_1 >> 2]; $3 = HEAP32[$1_1 + 4 >> 2]; $4_1 = HEAP32[$1_1 + 40 >> 2]; $1_1 = HEAP32[$1_1 + 44 >> 2]; if (!(($4_1 | 0) != 1 | ($1_1 | 0) != 0)) { $240($0_1, $2_1, $3); return; } $233($0_1, (+($2_1 >>> 0) + +($3 | 0) * 4294967296.0) / (+($4_1 >>> 0) + +($1_1 | 0) * 4294967296.0)); return; } $233($0_1, HEAPF64[$1_1 + 8 >> 3] / (+HEAPU32[$1_1 + 40 >> 2] + +HEAP32[$1_1 + 44 >> 2] * 4294967296.0)); } } function $1945($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { HEAPF64[$1_1 + 24 >> 3] = (+HEAPU32[$1_1 + 16 >> 2] + +HEAP32[$1_1 + 20 >> 2] * 4294967296.0) * .25; $1944($0_1); } } function $1946($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0; $1_1 = $266($0_1, 0); if ($1_1) { HEAPF64[$1_1 + 24 >> 3] = (+(__wasm_i64_mul(HEAP32[$1_1 + 16 >> 2], HEAP32[$1_1 + 20 >> 2], 3, 0) >>> 0) + +(i64toi32_i32$HIGH_BITS | 0) * 4294967296.0) * .25; $1944($0_1); } } function $1948($0_1, $1_1, $2_1) { var $3 = 0; while (1) { if ($0_1) { $3 = HEAP32[$0_1 >> 2]; if ($3) { $1948($3, $1_1, $2_1) } FUNCTION_TABLE[$1_1 | 0](HEAP32[$0_1 + 8 >> 2], HEAP32[$0_1 + 16 >> 2], HEAP32[$0_1 + 20 >> 2], $2_1); $0_1 = HEAP32[$0_1 + 4 >> 2]; if ($0_1) { continue } } break; }; } function $1949($0_1) { var $1_1 = 0; if ($0_1) { $2111(HEAP32[$0_1 + 8 >> 2]); $1_1 = HEAP32[$0_1 >> 2]; if ($1_1) { $1949($1_1) } $1_1 = HEAP32[$0_1 + 4 >> 2]; if ($1_1) { $1949($1_1) } $2111($0_1); } } function $1950($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; var $4_1 = 0, $5_1 = 0, $6_1 = 0.0; if (HEAP32[$3 + 60 >> 2] <= 0) { $6_1 = HEAPF64[$3 + 24 >> 3]; $2_1 = $2_1 + HEAP32[$3 + 36 >> 2] | 0; $5_1 = $1_1; $4_1 = HEAP32[$3 + 32 >> 2]; $1_1 = $1_1 + $4_1 | 0; $5_1 = $5_1 >>> 0 > $1_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; block1 : { if (!(+($1_1 | 0) >= $6_1)) { break block1 } $2_1 = HEAP32[$3 + 16 >> 2]; $4_1 = $2_1 - $4_1 | 0; if (+($4_1 | 0) >= +($2_1 >>> 0) + +HEAP32[$3 + 20 >> 2] * 4294967296.0 - $6_1) { $2_1 = HEAP32[$3 + 44 >> 2]; $4_1 = HEAP32[$3 + 40 >> 2] + 1 | 0; $2_1 = $4_1 ? $2_1 : $2_1 + 1 | 0; HEAP32[$3 + 40 >> 2] = $4_1; HEAP32[$3 + 44 >> 2] = $2_1; if (!(HEAP32[$3 + 48 >> 2] | HEAP32[$3 + 52 >> 2])) { $2_1 = HEAP32[$0_1 >> 2]; $4_1 = $2_1; $0_1 = $2_1 + HEAP32[$3 >> 2] | 0; $2_1 = HEAP32[$3 + 4 >> 2] + ($2_1 >> 31) | 0; HEAP32[$3 >> 2] = $0_1; HEAP32[$3 + 4 >> 2] = $0_1 >>> 0 < $4_1 >>> 0 ? $2_1 + 1 | 0 : $2_1; break block1; } HEAPF64[$3 + 8 >> 3] = HEAPF64[$0_1 >> 3] + HEAPF64[$3 + 8 >> 3]; break block1; } HEAP32[$3 + 60 >> 2] = 1; } HEAP32[$3 + 32 >> 2] = $1_1; HEAP32[$3 + 36 >> 2] = $5_1; } } function $1952($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $2087(fimport$1(-100, $0_1 | 0, $1_1 | 0, 0) | 0) | 0; } function $1954($0_1) { return $0_1 * ($0_1 * ($0_1 * ($0_1 * ($0_1 * ($0_1 * 3.479331075960212e-05 + 7.915349942898145e-04) + -.04005553450067941) + .20121253213486293) + -.3255658186224009) + .16666666666666666) / ($0_1 * ($0_1 * ($0_1 * ($0_1 * .07703815055590194 + -.6882839716054533) + 2.0209457602335057) + -2.403394911734414) + 1.0); } function $1959($0_1) { var $1_1 = 0.0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0.0, $6_1 = 0.0; wasm2js_scratch_store_f64(+$0_1); $4_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $2_1 = $4_1 & 2147483647; if ($2_1 >>> 0 >= 1141899264) { wasm2js_scratch_store_f64(1.5707963267948966); $2_1 = wasm2js_scratch_load_i32(1) | 0; $3 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+$0_1); $4_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, $3 | 0); wasm2js_scratch_store_i32(1, $2_1 & 2147483647 | $4_1 & -2147483648); $1_1 = +wasm2js_scratch_load_f64(); $2_1 = $1960($0_1); $4_1 = i64toi32_i32$HIGH_BITS & 2147483647; return ($4_1 | 0) == 2146435072 & ($2_1 | 0) != 0 | $4_1 >>> 0 > 2146435072 ? $0_1 : $1_1; } block3 : { block2 : { if ($2_1 >>> 0 <= 1071382527) { $3 = -1; if ($2_1 >>> 0 >= 1044381696) { break block2 } break block3; } $0_1 = Math_abs($0_1); if ($2_1 >>> 0 <= 1072889855) { if ($2_1 >>> 0 <= 1072037887) { $0_1 = ($0_1 + $0_1 + -1.0) / ($0_1 + 2.0); $3 = 0; break block2; } $0_1 = ($0_1 + -1.0) / ($0_1 + 1.0); $3 = 1; break block2; } if ($2_1 >>> 0 <= 1073971199) { $0_1 = ($0_1 + -1.5) / ($0_1 * 1.5 + 1.0); $3 = 2; break block2; } $0_1 = -1.0 / $0_1; $3 = 3; } $5_1 = $0_1 * $0_1; $1_1 = $5_1 * $5_1; $6_1 = $1_1 * ($1_1 * ($1_1 * ($1_1 * ($1_1 * -.036531572744216916 + -.058335701337905735) + -.0769187620504483) + -.11111110405462356) + -.19999999999876483); $1_1 = $5_1 * ($1_1 * ($1_1 * ($1_1 * ($1_1 * ($1_1 * .016285820115365782 + .049768779946159324) + .06661073137387531) + .09090887133436507) + .14285714272503466) + .3333333333333293); if ($2_1 >>> 0 <= 1071382527) { return $0_1 - $0_1 * ($6_1 + $1_1) } $2_1 = $3 << 3; $0_1 = HEAPF64[$2_1 + 58912 >> 3] - ($0_1 * ($6_1 + $1_1) - HEAPF64[$2_1 + 58944 >> 3] - $0_1); $0_1 = ($4_1 | 0) < 0 ? -$0_1 : $0_1; } return $0_1; } function $1960($0_1) { var $1_1 = 0, $2_1 = 0; wasm2js_scratch_store_f64(+$0_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; i64toi32_i32$HIGH_BITS = $1_1; return $2_1; } function $1965($0_1) { $0_1 = $0_1 | 0; $0_1 = fimport$2($0_1 | 0) | 0; return $2102(($0_1 | 0) != 27 ? $0_1 : 0) | 0; } function $1966($0_1, $1_1) { var $2_1 = 0.0, $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0; $2_1 = $0_1 * $0_1; $3 = $2_1 * .5; $4_1 = 1.0 - $3; $5_1 = 1.0 - $4_1 - $3; $3 = $2_1 * $2_1; return $4_1 + ($5_1 + ($2_1 * ($2_1 * ($2_1 * ($2_1 * 2.480158728947673e-05 + -.001388888888887411) + .0416666666666666) + $3 * $3 * ($2_1 * ($2_1 * -1.1359647557788195e-11 + 2.087572321298175e-09) + -2.7557314351390663e-07)) - $0_1 * $1_1)); } function $1968($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0.0, $10_1 = 0.0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0, $15_1 = 0, $16_1 = 0, $17_1 = 0, $18_1 = 0, $19_1 = 0, $20_1 = 0.0, $21_1 = 0, $22_1 = 0, $23_1 = 0, $24_1 = 0; $14 = global$0 - 48 | 0; $3 = $14; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; wasm2js_scratch_store_f64(+$0_1); $15_1 = wasm2js_scratch_load_i32(1) | 0; $2_1 = wasm2js_scratch_load_i32(0) | 0; block4 : { block10 : { $8_1 = $15_1 & 2147483647; block1 : { if ($8_1 >>> 0 <= 1074752122) { if (($15_1 & 1048575) == 598523) { break block1 } if ($8_1 >>> 0 <= 1073928572) { if (($15_1 | 0) >= 0) { $0_1 = $0_1 + -1.5707963267341256; $4_1 = $0_1 + -6.077100506506192e-11; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + -6.077100506506192e-11; $3 = 1; break block4; } $0_1 = $0_1 + 1.5707963267341256; $4_1 = $0_1 + 6.077100506506192e-11; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + 6.077100506506192e-11; $3 = -1; break block4; } if (($15_1 | 0) >= 0) { $0_1 = $0_1 + -3.1415926534682512; $4_1 = $0_1 + -1.2154201013012384e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + -1.2154201013012384e-10; $3 = 2; break block4; } $0_1 = $0_1 + 3.1415926534682512; $4_1 = $0_1 + 1.2154201013012384e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + 1.2154201013012384e-10; $3 = -2; break block4; } if ($8_1 >>> 0 <= 1075594811) { if ($8_1 >>> 0 <= 1075183036) { if (($8_1 | 0) == 1074977148) { break block1 } if (($15_1 | 0) >= 0) { $0_1 = $0_1 + -4.712388980202377; $4_1 = $0_1 + -1.8231301519518578e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + -1.8231301519518578e-10; $3 = 3; break block4; } $0_1 = $0_1 + 4.712388980202377; $4_1 = $0_1 + 1.8231301519518578e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + 1.8231301519518578e-10; $3 = -3; break block4; } if (($8_1 | 0) == 1075388923) { break block1 } if (($15_1 | 0) >= 0) { $0_1 = $0_1 + -6.2831853069365025; $4_1 = $0_1 + -2.430840202602477e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + -2.430840202602477e-10; $3 = 4; break block4; } $0_1 = $0_1 + 6.2831853069365025; $4_1 = $0_1 + 2.430840202602477e-10; HEAPF64[$1_1 >> 3] = $4_1; HEAPF64[$1_1 + 8 >> 3] = $0_1 - $4_1 + 2.430840202602477e-10; $3 = -4; break block4; } if ($8_1 >>> 0 > 1094263290) { break block10 } } $4_1 = $0_1 * .6366197723675814 + 6755399441055744.0 + -6755399441055744.0; if (Math_abs($4_1) < 2147483647.0) { $3 = ~~$4_1 } else { $3 = -2147483648 } $9_1 = $0_1 + $4_1 * -1.5707963267341256; $10_1 = $4_1 * 6.077100506506192e-11; $20_1 = $9_1 - $10_1; block12 : { if ($20_1 < -.7853981633974483) { $3 = $3 - 1 | 0; $4_1 = $4_1 + -1.0; $10_1 = $4_1 * 6.077100506506192e-11; $9_1 = $0_1 + $4_1 * -1.5707963267341256; break block12; } if (!($20_1 > .7853981633974483)) { break block12 } $3 = $3 + 1 | 0; $4_1 = $4_1 + 1.0; $10_1 = $4_1 * 6.077100506506192e-11; $9_1 = $0_1 + $4_1 * -1.5707963267341256; } $0_1 = $9_1 - $10_1; HEAPF64[$1_1 >> 3] = $0_1; wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $5_1 = $8_1 >>> 20 | 0; block13 : { if (($5_1 - ($2_1 >>> 20 & 2047) | 0) < 17) { break block13 } $10_1 = $9_1; $0_1 = $4_1 * 6.077100506303966e-11; $9_1 = $9_1 - $0_1; $10_1 = $4_1 * 2.0222662487959506e-21 - ($10_1 - $9_1 - $0_1); $0_1 = $9_1 - $10_1; HEAPF64[$1_1 >> 3] = $0_1; wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; if (($5_1 - ($2_1 >>> 20 & 2047) | 0) < 50) { break block13 } $10_1 = $9_1; $0_1 = $4_1 * 2.0222662487111665e-21; $9_1 = $9_1 - $0_1; $10_1 = $4_1 * 8.4784276603689e-32 - ($10_1 - $9_1 - $0_1); $0_1 = $9_1 - $10_1; HEAPF64[$1_1 >> 3] = $0_1; } HEAPF64[$1_1 + 8 >> 3] = $9_1 - $0_1 - $10_1; break block4; } if ($8_1 >>> 0 >= 2146435072) { $0_1 = $0_1 - $0_1; HEAPF64[$1_1 >> 3] = $0_1; HEAPF64[$1_1 + 8 >> 3] = $0_1; $3 = 0; break block4; } $3 = $14 + 16 | 0; $5_1 = $3 | 8; wasm2js_scratch_store_i32(0, $2_1 | 0); wasm2js_scratch_store_i32(1, $15_1 & 1048575 | 1096810496); $0_1 = +wasm2js_scratch_load_f64(); $2_1 = 1; while (1) { $4_1 = +((Math_abs($0_1) < 2147483647.0 ? ~~$0_1 : -2147483648) | 0); HEAPF64[$3 >> 3] = $4_1; $0_1 = ($0_1 - $4_1) * 16777216.0; $12_1 = $2_1; $2_1 = 0; $3 = $5_1; if ($12_1) { continue } break; }; HEAPF64[$14 + 32 >> 3] = $0_1; $3 = 2; while (1) { $2_1 = $3; $3 = $3 - 1 | 0; $16_1 = $14 + 16 | 0; if (HEAPF64[$16_1 + ($2_1 << 3) >> 3] == 0.0) { continue } break; }; $3 = ($8_1 >>> 20 | 0) - 1046 | 0; $17_1 = $2_1 + 1 | 0; $5_1 = 0; $7_1 = global$0 - 560 | 0; $2_1 = $7_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $2_1 = ($3 - 3 | 0) / 24 | 0; $6_1 = ($2_1 | 0) > 0 ? $2_1 : 0; $18_1 = $3 + Math_imul($6_1, -24) | 0; $12_1 = HEAP32[14761]; $11_1 = $17_1 - 1 | 0; if (($12_1 + $11_1 | 0) >= 0) { $3 = $12_1 + $17_1 | 0; $2_1 = $6_1 - $11_1 | 0; while (1) { HEAPF64[($7_1 + 320 | 0) + ($5_1 << 3) >> 3] = ($2_1 | 0) < 0 ? 0.0 : +HEAP32[($2_1 << 2) + 59056 >> 2]; $2_1 = $2_1 + 1 | 0; $5_1 = $5_1 + 1 | 0; if (($3 | 0) != ($5_1 | 0)) { continue } break; }; } $8_1 = $18_1 - 24 | 0; $3 = 0; $5_1 = ($12_1 | 0) > 0 ? $12_1 : 0; $13_1 = ($17_1 | 0) <= 0; while (1) { block41 : { if ($13_1) { $0_1 = 0.0; break block41; } $19_1 = $3 + $11_1 | 0; $2_1 = 0; $0_1 = 0.0; while (1) { $0_1 = HEAPF64[($2_1 << 3) + $16_1 >> 3] * HEAPF64[($7_1 + 320 | 0) + ($19_1 - $2_1 << 3) >> 3] + $0_1; $2_1 = $2_1 + 1 | 0; if (($17_1 | 0) != ($2_1 | 0)) { continue } break; }; } HEAPF64[($3 << 3) + $7_1 >> 3] = $0_1; $2_1 = ($3 | 0) == ($5_1 | 0); $3 = $3 + 1 | 0; if (!$2_1) { continue } break; }; $23_1 = 47 - $18_1 | 0; $19_1 = 48 - $18_1 | 0; $24_1 = ($6_1 << 2) + 59056 | 0; $3 = $12_1; block21 : { while (1) { $0_1 = HEAPF64[($3 << 3) + $7_1 >> 3]; $2_1 = 0; $5_1 = $3; if (($3 | 0) > 0) { while (1) { $11_1 = ($7_1 + 480 | 0) + ($2_1 << 2) | 0; $4_1 = $0_1 * 5.9604644775390625e-08; if (Math_abs($4_1) < 2147483647.0) { $6_1 = ~~$4_1 } else { $6_1 = -2147483648 } $4_1 = +($6_1 | 0); $0_1 = $4_1 * -16777216.0 + $0_1; if (Math_abs($0_1) < 2147483647.0) { $6_1 = ~~$0_1 } else { $6_1 = -2147483648 } HEAP32[$11_1 >> 2] = $6_1; $0_1 = HEAPF64[(($5_1 << 3) + $7_1 | 0) - 8 >> 3] + $4_1; $5_1 = $5_1 - 1 | 0; $2_1 = $2_1 + 1 | 0; if (($3 | 0) != ($2_1 | 0)) { continue } break; } } $0_1 = $2064($0_1, $8_1); $0_1 = $0_1 + Math_floor($0_1 * .125) * -8.0; if (Math_abs($0_1) < 2147483647.0) { $11_1 = ~~$0_1 } else { $11_1 = -2147483648 } $0_1 = $0_1 - +($11_1 | 0); block9 : { block103 : { block8 : { $21_1 = ($8_1 | 0) <= 0; block7 : { if (!$21_1) { $5_1 = ($7_1 + ($3 << 2) | 0) + 476 | 0; $6_1 = HEAP32[$5_1 >> 2]; $2_1 = $6_1 >> $19_1; $13_1 = $5_1; $5_1 = $6_1 - ($2_1 << $19_1) | 0; HEAP32[$13_1 >> 2] = $5_1; $11_1 = $2_1 + $11_1 | 0; $13_1 = $5_1 >> $23_1; break block7; } if ($8_1) { break block8 } $13_1 = HEAP32[($7_1 + ($3 << 2) | 0) + 476 >> 2] >> 23; } if (($13_1 | 0) <= 0) { break block9 } break block103; } $13_1 = 2; if ($0_1 >= .5) { break block103 } $13_1 = 0; break block9; } $2_1 = 0; $6_1 = 0; $5_1 = 1; if (($3 | 0) > 0) { while (1) { $22_1 = ($7_1 + 480 | 0) + ($2_1 << 2) | 0; $5_1 = HEAP32[$22_1 >> 2]; block15 : { block14 : { if ($6_1) { $6_1 = 16777215 } else { if (!$5_1) { break block14 } $6_1 = 16777216; } HEAP32[$22_1 >> 2] = $6_1 - $5_1; $6_1 = 1; $5_1 = 0; break block15; } $6_1 = 0; $5_1 = 1; } $2_1 = $2_1 + 1 | 0; if (($3 | 0) != ($2_1 | 0)) { continue } break; } } block16 : { if ($21_1) { break block16 } $2_1 = 8388607; block17 : { switch ($8_1 - 1 | 0) { case 1: $2_1 = 4194303; break; case 0: break block17; default: break block16; }; } $6_1 = ($7_1 + ($3 << 2) | 0) + 476 | 0; HEAP32[$6_1 >> 2] = HEAP32[$6_1 >> 2] & $2_1; } $11_1 = $11_1 + 1 | 0; if (($13_1 | 0) != 2) { break block9 } $0_1 = 1.0 - $0_1; $13_1 = 2; if ($5_1) { break block9 } $0_1 = $0_1 - $2064(1.0, $8_1); } if ($0_1 == 0.0) { $5_1 = 0; block20 : { $2_1 = $3; if (($12_1 | 0) >= ($3 | 0)) { break block20 } while (1) { $2_1 = $2_1 - 1 | 0; $5_1 = HEAP32[($7_1 + 480 | 0) + ($2_1 << 2) >> 2] | $5_1; if (($2_1 | 0) > ($12_1 | 0)) { continue } break; }; if (!$5_1) { break block20 } while (1) { $8_1 = $8_1 - 24 | 0; $3 = $3 - 1 | 0; if (!HEAP32[($7_1 + 480 | 0) + ($3 << 2) >> 2]) { continue } break; }; break block21; } $2_1 = 1; while (1) { $5_1 = $2_1; $2_1 = $2_1 + 1 | 0; if (!HEAP32[($7_1 + 480 | 0) + ($12_1 - $5_1 << 2) >> 2]) { continue } break; }; $5_1 = $3 + $5_1 | 0; while (1) { $6_1 = $3 + $17_1 | 0; $3 = $3 + 1 | 0; HEAPF64[($7_1 + 320 | 0) + ($6_1 << 3) >> 3] = HEAP32[$24_1 + ($3 << 2) >> 2]; $2_1 = 0; $0_1 = 0.0; if (($17_1 | 0) > 0) { while (1) { $0_1 = HEAPF64[($2_1 << 3) + $16_1 >> 3] * HEAPF64[($7_1 + 320 | 0) + ($6_1 - $2_1 << 3) >> 3] + $0_1; $2_1 = $2_1 + 1 | 0; if (($17_1 | 0) != ($2_1 | 0)) { continue } break; } } HEAPF64[($3 << 3) + $7_1 >> 3] = $0_1; if (($3 | 0) < ($5_1 | 0)) { continue } break; }; $3 = $5_1; continue; } break; }; $0_1 = $2064($0_1, 24 - $18_1 | 0); block24 : { if ($0_1 >= 16777216.0) { $8_1 = ($7_1 + 480 | 0) + ($3 << 2) | 0; $4_1 = $0_1 * 5.9604644775390625e-08; if (Math_abs($4_1) < 2147483647.0) { $2_1 = ~~$4_1 } else { $2_1 = -2147483648 } $0_1 = +($2_1 | 0) * -16777216.0 + $0_1; if (Math_abs($0_1) < 2147483647.0) { $5_1 = ~~$0_1 } else { $5_1 = -2147483648 } HEAP32[$8_1 >> 2] = $5_1; $3 = $3 + 1 | 0; $8_1 = $18_1; break block24; } $2_1 = Math_abs($0_1) < 2147483647.0 ? ~~$0_1 : -2147483648; } HEAP32[($7_1 + 480 | 0) + ($3 << 2) >> 2] = $2_1; } $0_1 = $2064(1.0, $8_1); if (($3 | 0) >= 0) { $2_1 = $3; while (1) { $5_1 = $2_1; HEAPF64[($2_1 << 3) + $7_1 >> 3] = $0_1 * +HEAP32[($7_1 + 480 | 0) + ($2_1 << 2) >> 2]; $2_1 = $2_1 - 1 | 0; $0_1 = $0_1 * 5.9604644775390625e-08; if ($5_1) { continue } break; }; $6_1 = $3; while (1) { $5_1 = $3 - $6_1 | 0; $8_1 = ($5_1 | 0) > ($12_1 | 0) ? $12_1 : $5_1; block27 : { if (($8_1 | 0) < 0) { $0_1 = 0.0; break block27; } $18_1 = ($6_1 << 3) + $7_1 | 0; $2_1 = 0; $0_1 = 0.0; while (1) { $16_1 = $2_1 << 3; $0_1 = HEAPF64[$16_1 + 61824 >> 3] * HEAPF64[$18_1 + $16_1 >> 3] + $0_1; $16_1 = ($2_1 | 0) != ($8_1 | 0); $2_1 = $2_1 + 1 | 0; if ($16_1) { continue } break; }; } HEAPF64[($7_1 + 160 | 0) + ($5_1 << 3) >> 3] = $0_1; $2_1 = ($6_1 | 0) > 0; $6_1 = $6_1 - 1 | 0; if ($2_1) { continue } break; }; } $0_1 = 0.0; if (($3 | 0) >= 0) { $2_1 = $3; while (1) { $5_1 = $2_1; $2_1 = $2_1 - 1 | 0; $0_1 = $0_1 + HEAPF64[($7_1 + 160 | 0) + ($5_1 << 3) >> 3]; if ($5_1) { continue } break; }; } HEAPF64[$14 >> 3] = $13_1 ? -$0_1 : $0_1; $0_1 = HEAPF64[$7_1 + 160 >> 3] - $0_1; $2_1 = 1; if (($3 | 0) > 0) { while (1) { $0_1 = $0_1 + HEAPF64[($7_1 + 160 | 0) + ($2_1 << 3) >> 3]; $5_1 = ($2_1 | 0) != ($3 | 0); $2_1 = $2_1 + 1 | 0; if ($5_1) { continue } break; } } HEAPF64[$14 + 8 >> 3] = $13_1 ? -$0_1 : $0_1; $3 = $7_1 + 560 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $3 = $11_1 & 7; $0_1 = HEAPF64[$14 >> 3]; if (($15_1 | 0) < 0) { HEAPF64[$1_1 >> 3] = -$0_1; HEAPF64[$1_1 + 8 >> 3] = -HEAPF64[$14 + 8 >> 3]; $3 = 0 - $3 | 0; break block4; } HEAPF64[$1_1 >> 3] = $0_1; HEAPF64[$1_1 + 8 >> 3] = HEAPF64[$14 + 8 >> 3]; } $1_1 = $14 + 48 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $3; } function $1969($0_1, $1_1, $2_1) { var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0; $3 = $0_1 * $0_1; $5_1 = $3 * ($3 * $3) * ($3 * 1.58969099521155e-10 + -2.5050760253406863e-08) + ($3 * ($3 * 2.7557313707070068e-06 + -1.984126982985795e-04) + .00833333333332249); $4_1 = $0_1 * $3; if (!$2_1) { return $4_1 * ($3 * $5_1 + -.16666666666666632) + $0_1 } return $0_1 - ($3 * ($1_1 * .5 - $4_1 * $5_1) - $1_1 + $4_1 * .16666666666666632); } function $1971($0_1, $1_1) { return $1_1 * 2247116418577894884661631.0e283 * $1979($0_1 + -1416.0996898839683) * 2247116418577894884661631.0e283; } function $1975($0_1, $1_1) { return $1_1 * $1976($0_1 ? -$1_1 : $1_1); } function $1976($0_1) { var $1_1 = 0; $1_1 = global$0 - 16 | 0; HEAPF64[$1_1 + 8 >> 3] = $0_1; return HEAPF64[$1_1 + 8 >> 3]; } function $1977($0_1) { return $1975($0_1, 1.2882297539194267e-231); } function $1978($0_1) { return $1975($0_1, 3105036184601417870297958.0e207); } function $1979($0_1) { var $1_1 = 0.0, $2_1 = 0, $3 = 0.0, $4_1 = 0, $5_1 = 0, $6_1 = 0.0, $7_1 = 0; block3 : { block1 : { $2_1 = $1980($0_1) & 2047; $5_1 = $1980(5.551115123125783e-17); if ($2_1 - $5_1 >>> 0 < $1980(512.0) - $5_1 >>> 0) { $4_1 = $2_1; break block1; } if ($2_1 >>> 0 < $5_1 >>> 0) { return $0_1 + 1.0 } if ($1980(1024.0) >>> 0 > $2_1 >>> 0) { break block1 } wasm2js_scratch_store_f64(+$0_1); $4_1 = wasm2js_scratch_load_i32(1) | 0; $3 = 0.0; if (!(wasm2js_scratch_load_i32(0) | 0) & ($4_1 | 0) == -1048576) { break block3 } if ($1980(Infinity) >>> 0 <= $2_1 >>> 0) { return $0_1 + 1.0 } if (($4_1 | 0) < 0) { return $1977(0) } return $1978(0); } $1_1 = HEAPF64[7737]; $6_1 = $0_1 * HEAPF64[7736] + $1_1; $1_1 = $6_1 - $1_1; $1_1 = $1_1 * HEAPF64[7739] + ($1_1 * HEAPF64[7738] + $0_1); $0_1 = $1_1 * $1_1; $3 = $0_1 * $0_1 * ($1_1 * HEAPF64[7743] + HEAPF64[7742]); $0_1 = $0_1 * ($1_1 * HEAPF64[7741] + HEAPF64[7740]); wasm2js_scratch_store_f64(+$6_1); wasm2js_scratch_load_i32(1) | 0; $5_1 = wasm2js_scratch_load_i32(0) | 0; $2_1 = $5_1 << 4 & 2032; $1_1 = $3 + ($0_1 + (HEAPF64[$2_1 + 62e3 >> 3] + $1_1)); $7_1 = HEAP32[$2_1 + 62008 >> 2]; $2_1 = HEAP32[$2_1 + 62012 >> 2] + ($5_1 << 13) | 0; if (!$4_1) { __inlined_func$1981$230 : { if (!($5_1 & -2147483648)) { wasm2js_scratch_store_i32(0, $7_1 | 0); wasm2js_scratch_store_i32(1, $2_1 - 1058013184 | 0); $0_1 = +wasm2js_scratch_load_f64(); $0_1 = ($0_1 * $1_1 + $0_1) * 5486124068793688683255936.0e279; break __inlined_func$1981$230; } wasm2js_scratch_store_i32(0, $7_1 | 0); wasm2js_scratch_store_i32(1, $2_1 + 1071644672 | 0); $6_1 = +wasm2js_scratch_load_f64(); $1_1 = $6_1 * $1_1; $3 = $1_1 + $6_1; if ($3 < 1.0) { $4_1 = global$0 - 16 | 0; HEAP32[$4_1 + 8 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = 1048576; $1983(HEAPF64[$4_1 + 8 >> 3] * 2.2250738585072014e-308); $0_1 = $3 + 1.0; $0_1 = $0_1 + ($1_1 + ($6_1 - $3) + ($3 + (1.0 - $0_1))) + -1.0; $3 = $0_1 == 0.0 ? 0.0 : $0_1; } $0_1 = $3 * 2.2250738585072014e-308; } return $0_1; } wasm2js_scratch_store_i32(0, $7_1 | 0); wasm2js_scratch_store_i32(1, $2_1 | 0); $0_1 = +wasm2js_scratch_load_f64(); $3 = $0_1 * $1_1 + $0_1; } return $3; } function $1980($0_1) { var $1_1 = 0; wasm2js_scratch_store_f64(+$0_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; return $1_1 >>> 20 | 0; } function $1983($0_1) { HEAPF64[(global$0 - 16 | 0) + 8 >> 3] = $0_1; } function $1984($0_1) { var $1_1 = 0, $2_1 = 0.0, $3 = 0.0, $4_1 = 0.0, $5_1 = 0, $6_1 = 0.0, $7_1 = 0; block1 : { block7 : { block4 : { wasm2js_scratch_store_f64(+$0_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; block6 : { block3 : { $5_1 = $1_1 & 2147483647; if ($5_1 >>> 0 >= 1078159482) { $5_1 = $1960($0_1); $7_1 = i64toi32_i32$HIGH_BITS & 2147483647; if (($7_1 | 0) == 2146435072 & ($5_1 | 0) != 0 | $7_1 >>> 0 > 2146435072) { break block1 } if (!(($1_1 | 0) > 0 | ($1_1 | 0) >= 0)) { return -1.0 } if (!($0_1 > 709.782712893384)) { break block3 } return $0_1 * 8988465674311579538646525.0e283; } if ($5_1 >>> 0 < 1071001155) { break block4 } if ($5_1 >>> 0 > 1072734897) { break block3 } if (($1_1 | 0) >= 0) { $1_1 = 1; $2_1 = 1.9082149292705877e-10; $6_1 = $0_1 + -.6931471803691238; break block6; } $1_1 = -1; $2_1 = -1.9082149292705877e-10; $6_1 = $0_1 + .6931471803691238; break block6; } wasm2js_scratch_store_f64(.5); $1_1 = wasm2js_scratch_load_i32(1) | 0; $7_1 = wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_f64(+$0_1); $5_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, $7_1 | 0); wasm2js_scratch_store_i32(1, $1_1 & 2147483647 | $5_1 & -2147483648); $2_1 = $0_1 * 1.4426950408889634 + +wasm2js_scratch_load_f64(); if (Math_abs($2_1) < 2147483647.0) { $1_1 = ~~$2_1 } else { $1_1 = -2147483648 } $3 = +($1_1 | 0); $2_1 = $3 * 1.9082149292705877e-10; $6_1 = $0_1 + $3 * -.6931471803691238; } $0_1 = $6_1; $0_1 = $0_1 - $2_1; $2_1 = $6_1 - $0_1 - $2_1; break block7; } if ($5_1 >>> 0 < 1016070144) { break block1 } $1_1 = 0; } $4_1 = $0_1 * .5; $3 = $0_1 * $4_1; $6_1 = $3 * ($3 * ($3 * ($3 * ($3 * -2.0109921818362437e-07 + 4.008217827329362e-06) + -7.93650757867488e-05) + 1.5873015872548146e-03) + -.03333333333333313) + 1.0; $4_1 = 3.0 - $6_1 * $4_1; $4_1 = $3 * (($6_1 - $4_1) / (6.0 - $0_1 * $4_1)); if (!$1_1) { return $0_1 - ($0_1 * $4_1 - $3) } $2_1 = $0_1 * ($4_1 - $2_1) - $2_1 - $3; block10 : { switch ($1_1 + 1 | 0) { case 0: return ($0_1 - $2_1) * .5 + -.5; case 2: if ($0_1 < -.25) { return ($2_1 - ($0_1 + .5)) * -2.0 } $0_1 = $0_1 - $2_1; return $0_1 + $0_1 + 1.0; default: break block10; }; } wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $1_1 + 1023 << 20); $3 = +wasm2js_scratch_load_f64(); if ($1_1 >>> 0 >= 57) { $0_1 = $0_1 - $2_1 + 1.0; return (($1_1 | 0) == 1024 ? ($0_1 + $0_1) * 8988465674311579538646525.0e283 : $0_1 * $3) + -1.0; } wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, 1023 - $1_1 << 20); $4_1 = +wasm2js_scratch_load_f64(); if ($1_1 >>> 0 <= 19) { $0_1 = 1.0 - $4_1 + ($0_1 - $2_1) } else { $0_1 = $0_1 - ($2_1 + $4_1) + 1.0 } $0_1 = $0_1 * $3; } return $0_1; } function $1987($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $5_1 = global$0 - 32 | 0; if ($5_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $5_1 >>> 0) { fimport$30($5_1 | 0) } global$0 = $5_1; block2 : { block1 : { $3 = fimport$4($0_1 | 0, $1_1 | 0) | 0; if (($3 | 0) == -8) { $2_1 = global$0 - 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; $4_1 = fimport$27($0_1 | 0, $2_1 + 8 | 0) | 0; if ($4_1) { HEAP32[20691] = $4_1; $4_1 = 0; } else { $4_1 = 1 } $2_1 = $2_1 + 32 | 0; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if ($4_1) { break block1 } } $1_1 = $2087($3); break block2; } $3 = 0; while (1) { $2_1 = $3 + $5_1 | 0; HEAP8[$2_1 | 0] = HEAPU8[$3 + 25062 | 0]; $4_1 = ($3 | 0) != 14; $3 = $3 + 1 | 0; if ($4_1) { continue } break; }; __inlined_func$2047$232 : { if ($0_1) { $3 = 14; $2_1 = $0_1; while (1) { $3 = $3 + 1 | 0; $4_1 = $2_1 >>> 0 > 9; $2_1 = ($2_1 >>> 0) / 10 | 0; if ($4_1) { continue } break; }; HEAP8[$3 + $5_1 | 0] = 0; while (1) { $3 = $3 - 1 | 0; $2_1 = ($0_1 >>> 0) / 10 | 0; HEAP8[$3 + $5_1 | 0] = $0_1 - Math_imul($2_1, 10) | 48; $4_1 = $0_1 >>> 0 > 9; $0_1 = $2_1; if ($4_1) { continue } break; }; break __inlined_func$2047$232; } HEAP8[$2_1 | 0] = 48; HEAP8[$5_1 + 15 | 0] = 0; } $1_1 = $2087(fimport$5($5_1 | 0, $1_1 | 0) | 0); } $0_1 = $5_1 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1988($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return $2087(fimport$6($0_1 | 0, $1_1 | 0, $2_1 | 0) | 0) | 0; } function $1989($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = global$0 - 128 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; $4_1 = 0; block : { block1 : { switch ($1_1 - 1 | 0) { default: if (($1_1 | 0) == 9) { break block } break; case 0: case 2: break block; case 1: break block1; }; } HEAP32[$3 + 120 >> 2] = $2_1 + 4; $4_1 = HEAP32[$2_1 >> 2]; } block6 : { block3 : { if ($1_1 >>> 0 > 16) { break block3 } if (!(1 << $1_1 & 110592)) { if (($1_1 | 0) != 9) { if (($1_1 | 0) != 14) { break block3 } HEAP32[$3 + 16 >> 2] = $4_1; HEAP32[$3 + 20 >> 2] = 0; $1_1 = $2087(fimport$7($0_1 | 0, 14, $3 + 16 | 0) | 0); break block6; } HEAP32[$3 + 48 >> 2] = $3 + 120; HEAP32[$3 + 52 >> 2] = 0; $1_1 = fimport$7($0_1 | 0, 16, $3 + 48 | 0) | 0; if (($1_1 | 0) == -28) { HEAP32[$3 + 32 >> 2] = $4_1; HEAP32[$3 + 36 >> 2] = 0; $1_1 = fimport$7($0_1 | 0, 9, $3 + 32 | 0) | 0; } if ($1_1) { $1_1 = $2087($1_1); break block6; } $0_1 = HEAP32[$3 + 124 >> 2]; $1_1 = HEAP32[$3 + 120 >> 2] == 2 ? 0 - $0_1 | 0 : $0_1; break block6; } HEAP32[$3 + 112 >> 2] = $4_1; HEAP32[$3 + 116 >> 2] = 0; $1_1 = $2087(fimport$7($0_1 | 0, $1_1 | 0, $3 + 112 | 0) | 0); break block6; } if (($1_1 | 0) != 1030) { HEAP32[$3 >> 2] = ($1_1 | 0) == 4 ? $4_1 | 32768 : $4_1; HEAP32[$3 + 4 >> 2] = 0; $1_1 = $2087(fimport$7($0_1 | 0, $1_1 | 0, $3 | 0) | 0); break block6; } HEAP32[$3 + 96 >> 2] = $4_1; HEAP32[$3 + 100 >> 2] = 0; $1_1 = fimport$7($0_1 | 0, 1030, $3 + 96 | 0) | 0; if (($1_1 | 0) != -28) { $1_1 = $2087($1_1); break block6; } HEAP32[$3 + 80 >> 2] = 0; HEAP32[$3 + 84 >> 2] = 0; $1_1 = fimport$7($0_1 | 0, 1030, $3 + 80 | 0) | 0; if (($1_1 | 0) != -28) { if (($1_1 | 0) >= 0) { fimport$2($1_1 | 0) | 0 } $1_1 = $2087(-28); break block6; } HEAP32[$3 + 64 >> 2] = $4_1; HEAP32[$3 + 68 >> 2] = 0; $1_1 = $2087(fimport$7($0_1 | 0, 0, $3 - -64 | 0) | 0); } $0_1 = $3 + 128 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $1991($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; if (($0_1 | 0) < 0) { return $2087(-8) | 0 } return $1992($0_1, 30822, $1_1, 4096) | 0; } function $1992($0_1, $1_1, $2_1, $3) { var $4_1 = 0; block2 : { block6 : { block1 : { if (!(($3 | 0) != 4096 | ($0_1 | 0) < 0)) { if (HEAPU8[$1_1 | 0]) { break block1 } $0_1 = fimport$8($0_1 | 0, $2_1 | 0) | 0; break block2; } block5 : { if (($0_1 | 0) != -100) { $4_1 = HEAPU8[$1_1 | 0]; if (!$3 & ($4_1 | 0) == 47) { break block5 } if (($3 | 0) != 256 | ($4_1 | 0) != 47) { break block1 } break block6; } if (($3 | 0) == 256) { break block6 } if ($3) { break block1 } } $0_1 = fimport$9($1_1 | 0, $2_1 | 0) | 0; break block2; } $0_1 = fimport$10($0_1 | 0, $1_1 | 0, $2_1 | 0, $3 | 0) | 0; break block2; } $0_1 = fimport$11($1_1 | 0, $2_1 | 0) | 0; } return $2087($0_1); } function $1993($0_1) { return $2102(fimport$12($0_1 | 0) | 0); } function $1994($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return $2087(fimport$31($0_1 | 0, $1_1 | 0, $2_1 | 0) | 0) | 0; } function $1995($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $2_1 = global$0; $3 = $2_1; $4_1 = 4096; $5_1 = $2_1 - ($0_1 ? 16 : 4096) | 0; $2_1 = $5_1; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; block1 : { block : { if (!$0_1) { break block } $2_1 = $0_1; $4_1 = $1_1; if ($1_1) { break block } HEAP32[20691] = 28; $0_1 = 0; break block1; } $0_1 = 0; $1_1 = $2087(fimport$13($2_1 | 0, $4_1 | 0) | 0); if (($1_1 | 0) < 0) { break block1 } if (!(!!$1_1 & HEAPU8[$2_1 | 0] == 47)) { HEAP32[20691] = 44; break block1; } if (($2_1 | 0) != ($5_1 | 0)) { $0_1 = $2_1; break block1; } $0_1 = $2080($2_1) + 1 | 0; $1_1 = $2109($0_1); if ($1_1) { $0_1 = $2049($1_1, $2_1, $0_1) } else { $0_1 = 0 } } if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; return $0_1 | 0; } function $1997($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0; $1_1 = $2072($0_1, 61); if (($0_1 | 0) == ($1_1 | 0)) { return 0 } $3 = $1_1 - $0_1 | 0; block1 : { if (HEAPU8[$3 + $0_1 | 0]) { break block1 } $1_1 = HEAP32[20692]; if (!$1_1) { break block1 } $2_1 = HEAP32[$1_1 >> 2]; if (!$2_1) { break block1 } while (1) { block3 : { if (!$2081($0_1, $2_1, $3)) { $2_1 = HEAP32[$1_1 >> 2] + $3 | 0; if (HEAPU8[$2_1 | 0] == 61) { break block3 } } $2_1 = HEAP32[$1_1 + 4 >> 2]; $1_1 = $1_1 + 4 | 0; if ($2_1) { continue } break block1; } break; }; $4_1 = $2_1 + 1 | 0; } return $4_1; } function $2000() { return 0; } function $2006($0_1) { $0_1 = $0_1 - $0_1; return $0_1 / $0_1; } function $2007($0_1) { var $1_1 = 0.0, $2_1 = 0, $3 = 0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0.0, $8_1 = 0, $9_1 = 0.0, $10_1 = 0.0; wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $3 = $2_1 >>> 16 | 0; wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; $8_1 = wasm2js_scratch_load_i32(0) | 0; if ($2_1 - 1072562176 >>> 0 <= 198911) { if (!(($8_1 | 0) != 0 | ($2_1 | 0) != 1072693248)) { return 0.0 } $0_1 = $0_1 + -1.0; $1_1 = $0_1 * 134217728.0; $1_1 = $0_1 + $1_1 - $1_1; $7_1 = HEAPF64[8013]; $9_1 = $1_1 * $1_1 * $7_1; $10_1 = $0_1 + $9_1; $4_1 = $0_1 * $0_1; $5_1 = $0_1 * $4_1; return $10_1 + ($5_1 * ($5_1 * ($5_1 * ($5_1 * HEAPF64[8023] + ($4_1 * HEAPF64[8022] + ($0_1 * HEAPF64[8021] + HEAPF64[8020]))) + ($4_1 * HEAPF64[8019] + ($0_1 * HEAPF64[8018] + HEAPF64[8017]))) + ($4_1 * HEAPF64[8016] + ($0_1 * HEAPF64[8015] + HEAPF64[8014]))) + (($0_1 - $1_1) * $7_1 * ($0_1 + $1_1) + ($9_1 + ($0_1 - $10_1)))); } block4 : { if ($3 - 32752 >>> 0 <= 4294934559) { if ($0_1 == 0.0) { return $1976(-1.0) / 0.0 } if (!$8_1 & ($2_1 | 0) == 2146435072) { break block4 } if (!(($3 & 32752) != 32752 & $3 >>> 0 <= 32767)) { return $2006($0_1) } wasm2js_scratch_store_f64(+($0_1 * 4503599627370496.0)); $2_1 = wasm2js_scratch_load_i32(1) | 0; $8_1 = wasm2js_scratch_load_i32(0) | 0; $2_1 = $2_1 - 54525952 | 0; } $3 = $2_1 - 1072037888 | 0; $6_1 = $3 >> 31; $4_1 = +($3 >> 20 >>> 0) + +($6_1 | 0) * 4294967296.0; $6_1 = ($3 >>> 13 & 127) << 4; $5_1 = $4_1 * HEAPF64[8006] + HEAPF64[$6_1 + 64200 >> 3]; $0_1 = HEAPF64[$6_1 + 64192 >> 3]; wasm2js_scratch_store_i32(0, $8_1 | 0); wasm2js_scratch_store_i32(1, $2_1 - ($3 & -1048576) | 0); $0_1 = $0_1 * (+wasm2js_scratch_load_f64() - HEAPF64[$6_1 + 66240 >> 3] - HEAPF64[$6_1 + 66248 >> 3]); $7_1 = $5_1 + $0_1; $1_1 = $0_1 * $0_1; $0_1 = $7_1 + ($0_1 * $1_1 * ($1_1 * ($0_1 * HEAPF64[8012] + HEAPF64[8011]) + ($0_1 * HEAPF64[8010] + HEAPF64[8009])) + ($1_1 * HEAPF64[8008] + ($4_1 * HEAPF64[8007] + ($0_1 + ($5_1 - $7_1))))); } return $0_1; } function $2010($0_1) { var $1_1 = 0, $2_1 = 0.0, $3 = 0.0, $4_1 = 0, $5_1 = 0.0, $6_1 = 0.0, $7_1 = 0.0, $8_1 = 0.0, $9_1 = 0; block3 : { wasm2js_scratch_store_f64(+$0_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; $4_1 = wasm2js_scratch_load_i32(0) | 0; block2 : { block5 : { block4 : { if (($1_1 | 0) <= 1071284857) { if ($1_1 >>> 0 >= 3220176896) { $3 = -Infinity; if ($0_1 == -1.0) { break block2 } return ($0_1 - $0_1) / 0.0; } if ((($1_1 & 2147483647) << 1 | $4_1 >>> 31) >>> 0 < 2034237440) { break block3 } if (($1_1 | 0) == -1076707643 | $1_1 >>> 0 > 3218259653) { break block4 } break block5; } if ($1_1 >>> 0 > 2146435071) { break block3 } } $2_1 = $0_1 + 1.0; wasm2js_scratch_store_f64(+$2_1); $1_1 = wasm2js_scratch_load_i32(1) | 0; $4_1 = wasm2js_scratch_load_i32(0) | 0; $1_1 = $1_1 + 614242 | 0; $9_1 = ($1_1 >>> 20 | 0) - 1023 | 0; if ($1_1 >>> 0 <= 1129316351) { $5_1 = ($1_1 >>> 0 > 1074790399 ? $0_1 - $2_1 + 1.0 : $0_1 - ($2_1 + -1.0)) / $2_1 } wasm2js_scratch_store_i32(0, $4_1 | 0); wasm2js_scratch_store_i32(1, ($1_1 & 1048575) + 1072079006 | 0); $0_1 = +wasm2js_scratch_load_f64() + -1.0; $8_1 = +($9_1 | 0); $5_1 = $8_1 * 1.9082149292705877e-10 + $5_1; } $6_1 = $0_1 / ($0_1 + 2.0); $7_1 = $6_1 * $6_1; $2_1 = $7_1 * $7_1; $3 = $0_1; $0_1 = $0_1 * ($0_1 * .5); $3 = $8_1 * .6931471803691238 + ($3 + ($6_1 * ($0_1 + ($2_1 * ($2_1 * ($2_1 * .15313837699209373 + .22222198432149784) + .3999999999940942) + $7_1 * ($2_1 * ($2_1 * ($2_1 * .14798198605116586 + .1818357216161805) + .2857142874366239) + .6666666666666735))) + $5_1 - $0_1)); } return $3; } return $0_1; } function $2011($0_1, $1_1, $2_1, $3) { var $4_1 = 0; $4_1 = global$0 - 16 | 0; if ($4_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $4_1; $1_1 = $2102(fimport$32($0_1 | 0, $1_1 | 0, $2_1 | 0, $3 & 255, $4_1 + 8 | 0) | 0); $2_1 = HEAP32[$4_1 + 8 >> 2]; $3 = HEAP32[$4_1 + 12 >> 2]; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; i64toi32_i32$HIGH_BITS = $1_1 ? -1 : $3; return $1_1 ? -1 : $2_1; } function $2012($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $1992(-100, $0_1, $1_1, 256) | 0; } function $2013($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $3 = ($2_1 | 0) != 0; block2 : { block1 : { block : { if (!($0_1 & 3) | !$2_1) { break block } $4_1 = $1_1 & 255; while (1) { if (($4_1 | 0) == HEAPU8[$0_1 | 0]) { break block1 } $2_1 = $2_1 - 1 | 0; $3 = ($2_1 | 0) != 0; $0_1 = $0_1 + 1 | 0; if (!($0_1 & 3)) { break block } if ($2_1) { continue } break; }; } if (!$3) { break block2 } $3 = $1_1 & 255; if (!(($3 | 0) == HEAPU8[$0_1 | 0] | $2_1 >>> 0 < 4)) { $3 = Math_imul($3, 16843009); while (1) { $4_1 = $3 ^ HEAP32[$0_1 >> 2]; if (((16843008 - $4_1 | $4_1) & -2139062144) != -2139062144) { break block1 } $0_1 = $0_1 + 4 | 0; $2_1 = $2_1 - 4 | 0; if ($2_1 >>> 0 > 3) { continue } break; }; } if (!$2_1) { break block2 } } $1_1 = $1_1 & 255; while (1) { if (HEAPU8[$0_1 | 0] == ($1_1 | 0)) { return $0_1 } $0_1 = $0_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; if ($2_1) { continue } break; }; } return 0; } function $2014($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; block2 : { block1 : { if ($2_1 >>> 0 >= 4) { if (($0_1 | $1_1) & 3) { break block1 } while (1) { if (HEAP32[$0_1 >> 2] != HEAP32[$1_1 >> 2]) { break block1 } $1_1 = $1_1 + 4 | 0; $0_1 = $0_1 + 4 | 0; $2_1 = $2_1 - 4 | 0; if ($2_1 >>> 0 > 3) { continue } break; }; } if (!$2_1) { break block2 } } while (1) { $3 = HEAPU8[$0_1 | 0]; $4_1 = HEAPU8[$1_1 | 0]; if (($3 | 0) == ($4_1 | 0)) { $1_1 = $1_1 + 1 | 0; $0_1 = $0_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; if ($2_1) { continue } break block2; } break; }; return $3 - $4_1 | 0; } return 0; } function $2015($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $2087(fimport$16(-100, $0_1 | 0, $1_1 | 0) | 0) | 0; } function $2027($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block : { if (!$1_1) { break block } HEAP8[$0_1 | 0] = 0; $2_1 = $0_1 + $1_1 | 0; HEAP8[$2_1 - 1 | 0] = 0; if ($1_1 >>> 0 < 3) { break block } HEAP8[$0_1 + 2 | 0] = 0; HEAP8[$0_1 + 1 | 0] = 0; HEAP8[$2_1 - 3 | 0] = 0; HEAP8[$2_1 - 2 | 0] = 0; if ($1_1 >>> 0 < 7) { break block } HEAP8[$0_1 + 3 | 0] = 0; HEAP8[$2_1 - 4 | 0] = 0; if ($1_1 >>> 0 < 9) { break block } $2_1 = 0 - $0_1 & 3; $0_1 = $2_1 + $0_1 | 0; HEAP32[$0_1 >> 2] = 0; $2_1 = $1_1 - $2_1 & -4; $1_1 = $2_1 + $0_1 | 0; HEAP32[$1_1 - 4 >> 2] = 0; if ($2_1 >>> 0 < 9) { break block } HEAP32[$0_1 + 8 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$1_1 - 8 >> 2] = 0; HEAP32[$1_1 - 12 >> 2] = 0; if ($2_1 >>> 0 < 25) { break block } HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = 0; HEAP32[$1_1 - 16 >> 2] = 0; HEAP32[$1_1 - 20 >> 2] = 0; HEAP32[$1_1 - 24 >> 2] = 0; HEAP32[$1_1 - 28 >> 2] = 0; $4_1 = $0_1 & 4 | 24; $1_1 = $2_1 - $4_1 | 0; if ($1_1 >>> 0 < 32) { break block } $2_1 = __wasm_i64_mul(0, 0, 1, 1); $3 = i64toi32_i32$HIGH_BITS; $0_1 = $0_1 + $4_1 | 0; while (1) { HEAP32[$0_1 + 24 >> 2] = $2_1; HEAP32[$0_1 + 28 >> 2] = $3; HEAP32[$0_1 + 16 >> 2] = $2_1; HEAP32[$0_1 + 20 >> 2] = $3; HEAP32[$0_1 + 8 >> 2] = $2_1; HEAP32[$0_1 + 12 >> 2] = $3; HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = $3; $0_1 = $0_1 + 32 | 0; $1_1 = $1_1 - 32 | 0; if ($1_1 >>> 0 > 31) { continue } break; }; } } function $2032($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; $6_1 = $6_1 | 0; var $7_1 = 0, $8_1 = 0; if ($5_1 & 4095 | $6_1 & -4096) { HEAP32[20691] = 28; return -1; } if ($1_1 >>> 0 >= 2147483647) { HEAP32[20691] = 48; return -1; } $5_1 = ($6_1 & 4095) << 20 | $5_1 >>> 12; $6_1 = $6_1 >>> 12 | 0; $7_1 = -28; __inlined_func$2030$336 : { if ($0_1) { break __inlined_func$2030$336 } $6_1 = $6_1 << 12 | $5_1 >>> 20; $8_1 = $5_1 << 12; block4 : { block2 : { if ($3 & 32) { $5_1 = $1_1 + 15 & -16; $4_1 = $2114(65536, $5_1 + 40 | 0); if ($4_1) { break block2 } $7_1 = -48; break __inlined_func$2030$336; } $5_1 = $2109(40); $7_1 = fimport$35($1_1 | 0, $2_1 | 0, $3 | 0, $4_1 | 0, $8_1 | 0, $6_1 | 0, $5_1 + 8 | 0, $5_1 | 0) | 0; if (($7_1 | 0) >= 0) { HEAP32[$5_1 + 12 >> 2] = $4_1; break block4; } $2111($5_1); break __inlined_func$2030$336; } $2027($4_1, $5_1); $5_1 = $4_1 + $5_1 | 0; HEAP32[$5_1 >> 2] = $4_1; HEAP32[$5_1 + 8 >> 2] = 1; HEAP32[$5_1 + 12 >> 2] = -1; } HEAP32[$5_1 + 32 >> 2] = $2_1; HEAP32[$5_1 + 24 >> 2] = $8_1; HEAP32[$5_1 + 28 >> 2] = $6_1; HEAP32[$5_1 + 16 >> 2] = $3; HEAP32[$5_1 + 4 >> 2] = $1_1; HEAP32[$5_1 + 36 >> 2] = HEAP32[20730]; HEAP32[20730] = $5_1; $7_1 = HEAP32[$5_1 >> 2]; } $1_1 = $7_1; return $2087($0_1 ? $1_1 : ($1_1 | 0) != -63 ? $1_1 : $3 & 32 ? ($3 & 16 ? -63 : -48) : -63) | 0; } function $2033($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0; $4_1 = global$0 - 16 | 0; $2_1 = $4_1; if (global$4 >>> 0 < $2_1 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; HEAP32[$4_1 + 12 >> 2] = 0; $2_1 = HEAP32[20730]; __inlined_func$2029$247 : { if ($2_1) { $3 = $4_1 + 12 | 0; while (1) { if (($0_1 | 0) == HEAP32[$2_1 >> 2]) { break __inlined_func$2029$247 } if ($3) { HEAP32[$3 >> 2] = $2_1 } $2_1 = HEAP32[$2_1 + 36 >> 2]; if ($2_1) { continue } break; }; } $2_1 = 0; } block2 : { if (!($2_1 ? $1_1 : 0)) { $0_1 = -28; break block2; } if (($1_1 | 0) != HEAP32[$2_1 + 4 >> 2]) { $0_1 = -28; break block2; } $3 = HEAP32[$2_1 + 36 >> 2]; $5_1 = HEAP32[$4_1 + 12 >> 2]; block5 : { if ($5_1) { HEAP32[$5_1 + 36 >> 2] = $3; break block5; } HEAP32[20730] = $3; } $3 = HEAP32[$2_1 + 16 >> 2]; if (!($3 & 32)) { fimport$34($0_1 | 0, $1_1 | 0, HEAP32[$2_1 + 32 >> 2], $3 | 0, HEAP32[$2_1 + 12 >> 2], HEAP32[$2_1 + 24 >> 2], HEAP32[$2_1 + 28 >> 2]) | 0 } if (HEAP32[$2_1 + 8 >> 2]) { $2111(HEAP32[$2_1 >> 2]) } $0_1 = 0; if (HEAPU8[$2_1 + 16 | 0] & 32) { break block2 } $2111($2_1); } $1_1 = $4_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $2087($0_1) | 0; } function $2040($0_1, $1_1) { var $2_1 = 0; $1_1 = $1_1 << 1 | $0_1 >>> 31; $2_1 = !($0_1 << 1); $0_1 = $1_1 + 2097152 | 0; return $2_1 & ($0_1 | 0) == 2097152 | $0_1 >>> 0 < 2097152; } function $2041($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $2_1 = $1_1 >>> 20 & 2047; block : { if ($2_1 >>> 0 < 1023) { break block } $5_1 = 2; if ($2_1 >>> 0 > 1075) { break block } $5_1 = 0; $2_1 = 1075 - $2_1 | 0; $3 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $2_1 = 1 << $3; $4_1 = 0; } else { $4_1 = 1 << $3; $2_1 = $4_1 - 1 & 1 >>> 32 - $3; } $3 = $2_1 - 1 | 0; $6_1 = $4_1 - 1 | 0; $3 = ($6_1 | 0) != -1 ? $3 + 1 | 0 : $3; if ($0_1 & $6_1 | $1_1 & $3) { break block } $5_1 = $0_1 & $4_1 | $1_1 & $2_1 ? 1 : 2; } return $5_1; } function $2049($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0; if ($2_1 >>> 0 >= 512) { if ($2_1) { wasm2js_memory_copy($0_1, $1_1, $2_1) } return $0_1; } $3 = $0_1 + $2_1 | 0; block6 : { if (!(($0_1 ^ $1_1) & 3)) { block3 : { if (!($0_1 & 3)) { $2_1 = $0_1; break block3; } if (!$2_1) { $2_1 = $0_1; break block3; } $2_1 = $0_1; while (1) { HEAP8[$2_1 | 0] = HEAPU8[$1_1 | 0]; $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; if (!($2_1 & 3)) { break block3 } if ($2_1 >>> 0 < $3 >>> 0) { continue } break; }; } $4_1 = $3 & -4; block5 : { if ($3 >>> 0 < 64) { break block5 } $5_1 = $4_1 + -64 | 0; if ($5_1 >>> 0 < $2_1 >>> 0) { break block5 } while (1) { HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; HEAP32[$2_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2]; HEAP32[$2_1 + 8 >> 2] = HEAP32[$1_1 + 8 >> 2]; HEAP32[$2_1 + 12 >> 2] = HEAP32[$1_1 + 12 >> 2]; HEAP32[$2_1 + 16 >> 2] = HEAP32[$1_1 + 16 >> 2]; HEAP32[$2_1 + 20 >> 2] = HEAP32[$1_1 + 20 >> 2]; HEAP32[$2_1 + 24 >> 2] = HEAP32[$1_1 + 24 >> 2]; HEAP32[$2_1 + 28 >> 2] = HEAP32[$1_1 + 28 >> 2]; HEAP32[$2_1 + 32 >> 2] = HEAP32[$1_1 + 32 >> 2]; HEAP32[$2_1 + 36 >> 2] = HEAP32[$1_1 + 36 >> 2]; HEAP32[$2_1 + 40 >> 2] = HEAP32[$1_1 + 40 >> 2]; HEAP32[$2_1 + 44 >> 2] = HEAP32[$1_1 + 44 >> 2]; HEAP32[$2_1 + 48 >> 2] = HEAP32[$1_1 + 48 >> 2]; HEAP32[$2_1 + 52 >> 2] = HEAP32[$1_1 + 52 >> 2]; HEAP32[$2_1 + 56 >> 2] = HEAP32[$1_1 + 56 >> 2]; HEAP32[$2_1 + 60 >> 2] = HEAP32[$1_1 + 60 >> 2]; $1_1 = $1_1 - -64 | 0; $2_1 = $2_1 - -64 | 0; if ($5_1 >>> 0 >= $2_1 >>> 0) { continue } break; }; } if ($2_1 >>> 0 >= $4_1 >>> 0) { break block6 } while (1) { HEAP32[$2_1 >> 2] = HEAP32[$1_1 >> 2]; $1_1 = $1_1 + 4 | 0; $2_1 = $2_1 + 4 | 0; if ($4_1 >>> 0 > $2_1 >>> 0) { continue } break; }; break block6; } if ($3 >>> 0 < 4) { $2_1 = $0_1; break block6; } if ($2_1 >>> 0 < 4) { $2_1 = $0_1; break block6; } $4_1 = $3 - 4 | 0; $2_1 = $0_1; while (1) { HEAP8[$2_1 | 0] = HEAPU8[$1_1 | 0]; HEAP8[$2_1 + 1 | 0] = HEAPU8[$1_1 + 1 | 0]; HEAP8[$2_1 + 2 | 0] = HEAPU8[$1_1 + 2 | 0]; HEAP8[$2_1 + 3 | 0] = HEAPU8[$1_1 + 3 | 0]; $1_1 = $1_1 + 4 | 0; $2_1 = $2_1 + 4 | 0; if ($4_1 >>> 0 >= $2_1 >>> 0) { continue } break; }; } if ($2_1 >>> 0 < $3 >>> 0) { while (1) { HEAP8[$2_1 | 0] = HEAPU8[$1_1 | 0]; $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 + 1 | 0; if (($3 | 0) != ($2_1 | 0)) { continue } break; } } return $0_1; } function $2051($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0; $4_1 = global$0 - 240 | 0; $3 = $4_1; if (global$4 >>> 0 < $4_1 >>> 0 | global$5 >>> 0 > $4_1 >>> 0) { fimport$30($4_1 | 0) } global$0 = $3; HEAP32[$4_1 >> 2] = $0_1; $6_1 = 1; block : { if (($1_1 | 0) < 2) { break block } $3 = $0_1; while (1) { $3 = $3 - 4 | 0; $7_1 = $1_1 - 2 | 0; $5_1 = $3 - HEAP32[($7_1 << 2) + $2_1 >> 2] | 0; if ((FUNCTION_TABLE[485]($0_1, $5_1, 111) | 0) >= 0) { if ((FUNCTION_TABLE[485]($0_1, $3, 111) | 0) >= 0) { break block } } $8_1 = $5_1; $5_1 = (FUNCTION_TABLE[485]($5_1, $3, 111) | 0) >= 0; $3 = $5_1 ? $8_1 : $3; HEAP32[($6_1 << 2) + $4_1 >> 2] = $3; $6_1 = $6_1 + 1 | 0; $1_1 = $5_1 ? $1_1 - 1 | 0 : $7_1; if (($1_1 | 0) > 1) { continue } break; }; } $2056($4_1, $6_1); $0_1 = $4_1 + 240 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $2052($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAP32[$0_1 + 4 >> 2]; block1 : { if ($1_1 >>> 0 <= 31) { $3 = HEAP32[$0_1 >> 2]; break block1; } $1_1 = $1_1 - 32 | 0; $3 = $2_1; $2_1 = 0; } HEAP32[$0_1 + 4 >> 2] = $2_1 >>> $1_1; HEAP32[$0_1 >> 2] = $2_1 << 32 - $1_1 | $3 >>> $1_1; } function $2053($0_1, $1_1, $2_1, $3, $4_1) { var $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $6_1 = global$0 - 240 | 0; $5_1 = $6_1; if (global$4 >>> 0 < $6_1 >>> 0 | global$5 >>> 0 > $6_1 >>> 0) { fimport$30($6_1 | 0) } global$0 = $5_1; $5_1 = HEAP32[$1_1 >> 2]; HEAP32[$6_1 + 232 >> 2] = $5_1; $1_1 = HEAP32[$1_1 + 4 >> 2]; HEAP32[$6_1 >> 2] = $0_1; HEAP32[$6_1 + 236 >> 2] = $1_1; $9_1 = !$3; block7 : { block6 : { block2 : { block1 : { if (($5_1 | 0) != 1) { $5_1 = $0_1; $3 = 1; break block1; } $5_1 = $0_1; $3 = 1; if ($1_1) { break block1 } break block2; } while (1) { $7_1 = ($2_1 << 2) + $4_1 | 0; $1_1 = $5_1 - HEAP32[$7_1 >> 2] | 0; if ((FUNCTION_TABLE[485]($1_1, $0_1, 111) | 0) <= 0) { break block2 } $8_1 = $9_1 ^ -1; $9_1 = 1; block5 : { if (!(($8_1 | ($2_1 | 0) < 2) & 1)) { $7_1 = HEAP32[$7_1 - 8 >> 2]; $8_1 = $5_1 - 4 | 0; if ((FUNCTION_TABLE[485]($8_1, $1_1, 111) | 0) >= 0) { break block5 } if ((FUNCTION_TABLE[485]($8_1 - $7_1 | 0, $1_1, 111) | 0) >= 0) { break block5 } } HEAP32[($3 << 2) + $6_1 >> 2] = $1_1; $5_1 = $6_1 + 232 | 0; $7_1 = $5_1; $5_1 = $2055($5_1); $2052($7_1, $5_1); $3 = $3 + 1 | 0; $2_1 = $2_1 + $5_1 | 0; $5_1 = $1_1; if (HEAP32[$6_1 + 236 >> 2] | HEAP32[$6_1 + 232 >> 2] != 1) { continue } break block6; } break; }; $1_1 = $5_1; break block6; } $1_1 = $5_1; if (!$9_1) { break block7 } } $2056($6_1, $3); $2051($1_1, $2_1, $4_1); } $0_1 = $6_1 + 240 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $2054($0_1, $1_1) { var $2_1 = 0, $3 = 0; block1 : { if ($1_1 >>> 0 <= 31) { $3 = HEAP32[$0_1 >> 2]; $2_1 = $0_1 + 4 | 0; break block1; } $1_1 = $1_1 - 32 | 0; $2_1 = $0_1; } $2_1 = HEAP32[$2_1 >> 2]; HEAP32[$0_1 >> 2] = $3 << $1_1; HEAP32[$0_1 + 4 >> 2] = $2_1 << $1_1 | $3 >>> 32 - $1_1; } function $2055($0_1) { var $1_1 = 0; $1_1 = $2058(HEAP32[$0_1 >> 2] - 1 | 0); if (!$1_1) { $0_1 = $2058(HEAP32[$0_1 + 4 >> 2]); $1_1 = $0_1 ? $0_1 | 32 : 0; } return $1_1; } function $2056($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $3 = 4; $5_1 = global$0 - 256 | 0; $2_1 = $5_1; if ($2_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $2_1 >>> 0) { fimport$30($2_1 | 0) } global$0 = $2_1; if (($1_1 | 0) >= 2) { $7_1 = ($1_1 << 2) + $0_1 | 0; HEAP32[$7_1 >> 2] = $5_1; while (1) { $4_1 = $3 >>> 0 >= 256 ? 256 : $3; $2049(HEAP32[$7_1 >> 2], HEAP32[$0_1 >> 2], $4_1); $2_1 = 0; while (1) { $6_1 = ($2_1 << 2) + $0_1 | 0; $2_1 = $2_1 + 1 | 0; $2049(HEAP32[$6_1 >> 2], HEAP32[($2_1 << 2) + $0_1 >> 2], $4_1); HEAP32[$6_1 >> 2] = HEAP32[$6_1 >> 2] + $4_1; if (($1_1 | 0) != ($2_1 | 0)) { continue } break; }; $3 = $3 - $4_1 | 0; if ($3) { continue } break; }; } $0_1 = $5_1 + 256 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $2058($0_1) { var wasm2js_i32$0 = 0, wasm2js_i32$1 = 0, wasm2js_i32$2 = 0; return wasm2js_i32$0 = __wasm_ctz_i32($0_1), wasm2js_i32$1 = 0, wasm2js_i32$2 = $0_1, wasm2js_i32$2 ? wasm2js_i32$0 : wasm2js_i32$1; } function $2060($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; return FUNCTION_TABLE[$2_1 | 0]($0_1, $1_1) | 0; } function $2061($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = $2_1; HEAP32[$3 + 8 >> 2] = $1_1; $1_1 = $2102(fimport$20($0_1 | 0, $3 + 8 | 0, 1, $3 + 4 | 0) | 0); $2_1 = HEAP32[$3 + 4 >> 2]; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return ($1_1 ? -1 : $2_1) | 0; } function $2062($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; $4_1 = $3 + 15 | 0; $1_1 = $2_1 ? $1_1 : $4_1; $0_1 = fimport$21(-100, $0_1 | 0, $1_1 | 0, ($2_1 >>> 0 <= 1 ? 1 : $2_1) | 0) | 0; $1_1 = $2087(($1_1 | 0) == ($4_1 | 0) ? $0_1 >> 31 & $0_1 : $0_1); $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $2063($0_1) { $0_1 = $0_1 | 0; return $2087(fimport$22($0_1 | 0) | 0) | 0; } function $2064($0_1, $1_1) { block2 : { if (($1_1 | 0) >= 1024) { $0_1 = $0_1 * 8988465674311579538646525.0e283; if ($1_1 >>> 0 < 2047) { $1_1 = $1_1 - 1023 | 0; break block2; } $0_1 = $0_1 * 8988465674311579538646525.0e283; $1_1 = ($1_1 >>> 0 >= 3069 ? 3069 : $1_1) - 2046 | 0; break block2; } if (($1_1 | 0) > -1023) { break block2 } $0_1 = $0_1 * 2.004168360008973e-292; if ($1_1 >>> 0 > 4294965304) { $1_1 = $1_1 + 969 | 0; break block2; } $0_1 = $0_1 * 2.004168360008973e-292; $1_1 = ($1_1 >>> 0 <= 4294964336 ? -2960 : $1_1) + 1938 | 0; } wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $1_1 + 1023 << 20); return $0_1 * +wasm2js_scratch_load_f64(); } function $2068($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; return $1992(-100, $0_1, $1_1, 0) | 0; } function $2069($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $3 = global$0 - 32 | 0; $4_1 = $3; if (global$4 >>> 0 < $3 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $4_1; $4_1 = HEAP32[$0_1 + 28 >> 2]; HEAP32[$3 + 16 >> 2] = $4_1; $5_1 = HEAP32[$0_1 + 20 >> 2]; HEAP32[$3 + 28 >> 2] = $2_1; HEAP32[$3 + 24 >> 2] = $1_1; $1_1 = $5_1 - $4_1 | 0; HEAP32[$3 + 20 >> 2] = $1_1; $5_1 = $1_1 + $2_1 | 0; $1_1 = $3 + 16 | 0; $8_1 = 2; block5 : { block4 : { block2 : { block1 : { if ($2102(fimport$23(HEAP32[$0_1 + 60 >> 2], $1_1 | 0, 2, $3 + 12 | 0) | 0)) { $4_1 = $1_1; break block1; } while (1) { $6_1 = HEAP32[$3 + 12 >> 2]; if (($6_1 | 0) == ($5_1 | 0)) { break block2 } if (($6_1 | 0) < 0) { $4_1 = $1_1; break block4; } $7_1 = HEAP32[$1_1 + 4 >> 2]; $9_1 = $7_1 >>> 0 < $6_1 >>> 0; $4_1 = ($9_1 ? 8 : 0) + $1_1 | 0; $7_1 = $6_1 - ($9_1 ? $7_1 : 0) | 0; HEAP32[$4_1 >> 2] = $7_1 + HEAP32[$4_1 >> 2]; $1_1 = ($9_1 ? 12 : 4) + $1_1 | 0; HEAP32[$1_1 >> 2] = HEAP32[$1_1 >> 2] - $7_1; $5_1 = $5_1 - $6_1 | 0; $1_1 = $4_1; $8_1 = $8_1 - $9_1 | 0; if (!$2102(fimport$23(HEAP32[$0_1 + 60 >> 2], $1_1 | 0, $8_1 | 0, $3 + 12 | 0) | 0)) { continue } break; }; } if (($5_1 | 0) != -1) { break block4 } } $1_1 = HEAP32[$0_1 + 44 >> 2]; HEAP32[$0_1 + 28 >> 2] = $1_1; HEAP32[$0_1 + 20 >> 2] = $1_1; HEAP32[$0_1 + 16 >> 2] = $1_1 + HEAP32[$0_1 + 48 >> 2]; $1_1 = $2_1; break block5; } HEAP32[$0_1 + 28 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 >> 2] = HEAP32[$0_1 >> 2] | 32; $1_1 = 0; if (($8_1 | 0) == 2) { break block5 } $1_1 = $2_1 - HEAP32[$4_1 + 4 >> 2] | 0; } $0_1 = $3 + 32 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $1_1 | 0; } function $2071($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; i64toi32_i32$HIGH_BITS = 0; return 0; } function $2072($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; block2 : { block4 : { block3 : { $2_1 = $1_1 & 255; $3 = $2_1; if ($2_1) { if ($0_1 & 3) { while (1) { $4_1 = HEAPU8[$0_1 | 0]; if (!$4_1 | ($2_1 | 0) == ($4_1 | 0)) { break block2 } $0_1 = $0_1 + 1 | 0; if ($0_1 & 3) { continue } break; } } $2_1 = HEAP32[$0_1 >> 2]; if ((($2_1 | 16843008 - $2_1) & -2139062144) != -2139062144) { break block3 } $4_1 = Math_imul($3, 16843009); while (1) { $3 = $2_1 ^ $4_1; if (((16843008 - $3 | $3) & -2139062144) != -2139062144) { break block3 } $2_1 = HEAP32[$0_1 + 4 >> 2]; $3 = $0_1 + 4 | 0; $0_1 = $3; if (((16843008 - $2_1 | $2_1) & -2139062144) == -2139062144) { continue } break; }; break block4; } return $2080($0_1) + $0_1 | 0; } $3 = $0_1; } while (1) { $0_1 = $3; $2_1 = HEAPU8[$0_1 | 0]; if (!$2_1) { break block2 } $3 = $0_1 + 1 | 0; if (($2_1 | 0) != ($1_1 & 255)) { continue } break; }; } return $0_1; } function $2073($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = HEAPU8[$0_1 | 0]; $3 = HEAPU8[$1_1 | 0]; block : { if (!$2_1 | ($3 | 0) != ($2_1 | 0)) { break block } while (1) { $3 = HEAPU8[$1_1 + 1 | 0]; $2_1 = HEAPU8[$0_1 + 1 | 0]; if (!$2_1) { break block } $1_1 = $1_1 + 1 | 0; $0_1 = $0_1 + 1 | 0; if (($2_1 | 0) == ($3 | 0)) { continue } break; }; } return $2_1 - $3 | 0; } function $2075($0_1, $1_1) { var $2_1 = 0, $3 = 0; $3 = $0_1; block3 : { block1 : { if (($1_1 ^ $3) & 3) { $2_1 = HEAPU8[$1_1 | 0]; break block1; } if ($1_1 & 3) { while (1) { $2_1 = HEAPU8[$1_1 | 0]; HEAP8[$3 | 0] = $2_1; if (!$2_1) { break block3 } $3 = $3 + 1 | 0; $1_1 = $1_1 + 1 | 0; if ($1_1 & 3) { continue } break; } } $2_1 = HEAP32[$1_1 >> 2]; if ((($2_1 | 16843008 - $2_1) & -2139062144) != -2139062144) { break block1 } while (1) { HEAP32[$3 >> 2] = $2_1; $3 = $3 + 4 | 0; $2_1 = $1_1; $1_1 = $2_1 + 4 | 0; $2_1 = HEAP32[$2_1 + 4 >> 2]; if ((($2_1 | 16843008 - $2_1) & -2139062144) == -2139062144) { continue } break; }; } HEAP8[$3 | 0] = $2_1; if (!($2_1 & 255)) { break block3 } while (1) { $2_1 = HEAPU8[$1_1 + 1 | 0]; HEAP8[$3 + 1 | 0] = $2_1; $3 = $3 + 1 | 0; $1_1 = $1_1 + 1 | 0; if ($2_1) { continue } break; }; } return $0_1; } function $2078($0_1) { var $1_1 = 0; $1_1 = 9163; block : { if ($0_1 >>> 0 > 153) { break block } block2 : { if (!$0_1) { $0_1 = 0; break block2; } $0_1 = HEAPU16[($0_1 << 1) + 72464 >> 1]; if (!$0_1) { break block } } $1_1 = $0_1 + 72772 | 0; } return $1_1; } function $2079($0_1) { $0_1 = $0_1 | 0; return $2078($0_1) | 0; } function $2080($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; block2 : { block : { $1_1 = $0_1; if (!($1_1 & 3)) { break block } if (!HEAPU8[$1_1 | 0]) { return 0 } while (1) { $1_1 = $1_1 + 1 | 0; if (!($1_1 & 3)) { break block } if (HEAPU8[$1_1 | 0]) { continue } break; }; break block2; } while (1) { $2_1 = $1_1; $1_1 = $1_1 + 4 | 0; $3 = HEAP32[$2_1 >> 2]; if ((($3 | 16843008 - $3) & -2139062144) == -2139062144) { continue } break; }; while (1) { $1_1 = $2_1; $2_1 = $1_1 + 1 | 0; if (HEAPU8[$1_1 | 0]) { continue } break; }; } return $1_1 - $0_1 | 0; } function $2081($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; if (!$2_1) { return 0 } $3 = HEAPU8[$0_1 | 0]; if ($3) { block3 : { while (1) { $4_1 = HEAPU8[$1_1 | 0]; if (($3 | 0) != ($4_1 | 0) | !$4_1) { break block3 } $2_1 = $2_1 - 1 | 0; if (!$2_1) { break block3 } $1_1 = $1_1 + 1 | 0; $3 = HEAPU8[$0_1 + 1 | 0]; $0_1 = $0_1 + 1 | 0; if ($3) { continue } break; }; $3 = 0; } } else { $3 = 0 } return $3 - HEAPU8[$1_1 | 0] | 0; } function $2083($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0; $4_1 = $0_1; block2 : { block3 : { block4 : { block : { if (($1_1 ^ $4_1) & 3) { break block } $3 = ($2_1 | 0) != 0; block1 : { if (!($1_1 & 3) | !$2_1) { break block1 } while (1) { $3 = HEAPU8[$1_1 | 0]; HEAP8[$4_1 | 0] = $3; if (!$3) { break block2 } $4_1 = $4_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; $3 = ($2_1 | 0) != 0; $1_1 = $1_1 + 1 | 0; if (!($1_1 & 3)) { break block1 } if ($2_1) { continue } break; }; } if (!$3) { break block3 } if (!HEAPU8[$1_1 | 0]) { break block2 } if ($2_1 >>> 0 < 4) { break block } while (1) { $3 = HEAP32[$1_1 >> 2]; if (((16843008 - $3 | $3) & -2139062144) != -2139062144) { break block4 } HEAP32[$4_1 >> 2] = $3; $4_1 = $4_1 + 4 | 0; $1_1 = $1_1 + 4 | 0; $2_1 = $2_1 - 4 | 0; if ($2_1 >>> 0 > 3) { continue } break; }; } if (!$2_1) { break block3 } } while (1) { $3 = HEAPU8[$1_1 | 0]; HEAP8[$4_1 | 0] = $3; if (!$3) { break block2 } $4_1 = $4_1 + 1 | 0; $1_1 = $1_1 + 1 | 0; $2_1 = $2_1 - 1 | 0; if ($2_1) { continue } break; }; } $2_1 = 0; } $2027($4_1, $2_1); return $0_1; } function $2086($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0; $2_1 = global$0 - 32 | 0; HEAP32[$2_1 + 24 >> 2] = 0; HEAP32[$2_1 + 28 >> 2] = 0; HEAP32[$2_1 + 16 >> 2] = 0; HEAP32[$2_1 + 20 >> 2] = 0; HEAP32[$2_1 + 8 >> 2] = 0; HEAP32[$2_1 + 12 >> 2] = 0; HEAP32[$2_1 >> 2] = 0; HEAP32[$2_1 + 4 >> 2] = 0; $3 = HEAPU8[$1_1 | 0]; if (!$3) { return 0 } if (!HEAPU8[$1_1 + 1 | 0]) { $1_1 = $0_1; while (1) { $2_1 = $1_1; $1_1 = $2_1 + 1 | 0; if (HEAPU8[$2_1 | 0] == ($3 | 0)) { continue } break; }; return $2_1 - $0_1 | 0; } while (1) { $4_1 = ($3 >>> 3 & 28) + $2_1 | 0; HEAP32[$4_1 >> 2] = HEAP32[$4_1 >> 2] | 1 << $3; $3 = HEAPU8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if ($3) { continue } break; }; $1_1 = $0_1; $3 = HEAPU8[$1_1 | 0]; block2 : { if (!$3) { break block2 } while (1) { if (!(HEAP32[($3 >>> 3 & 28) + $2_1 >> 2] >>> $3 & 1)) { break block2 } $3 = HEAPU8[$1_1 + 1 | 0]; $1_1 = $1_1 + 1 | 0; if ($3) { continue } break; }; } return $1_1 - $0_1 | 0; } function $2087($0_1) { if ($0_1 >>> 0 >= 4294963201) { HEAP32[20691] = 0 - $0_1; $0_1 = -1; } return $0_1; } function $2089($0_1, $1_1, $2_1) { var $3 = 0.0, $4_1 = 0.0, $5_1 = 0.0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0.0; wasm2js_scratch_store_f64(+$0_1); $7_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $6_1 = $7_1 & 2147483640; $6_1 = ($6_1 | 0) == 1072010279 | $6_1 >>> 0 < 1072010279; block1 : { if ($6_1) { break block1 } $8_1 = ($7_1 | 0) >= 0; $0_1 = .7853981633974483 - Math_abs($0_1) + (3.061616997868383e-17 - ($8_1 ? $1_1 : -$1_1)); $1_1 = 0.0; } $4_1 = $0_1 * $0_1; $3 = $0_1 * $4_1; $9_1 = $3 * .3333333333333341; $5_1 = $3; $3 = $4_1 * $4_1; $4_1 = $9_1 + ($4_1 * ($5_1 * ($3 * ($3 * ($3 * ($3 * ($3 * -1.8558637485527546e-05 + 7.817944429395571e-05) + 5.880412408202641e-04) + 3.5920791075913124e-03) + .021869488294859542) + .13333333333320124 + $4_1 * ($3 * ($3 * ($3 * ($3 * ($3 * 2.590730518636337e-05 + 7.140724913826082e-05) + 2.464631348184699e-04) + 1.4562094543252903e-03) + .0088632398235993) + .05396825397622605)) + $1_1) + $1_1); $1_1 = $0_1 + $4_1; if (!$6_1) { $5_1 = $1_1 * $1_1; $3 = $1_1; $1_1 = +(1 - ($2_1 << 1) | 0); $0_1 = $0_1 + ($4_1 - $5_1 / ($3 + $1_1)); $0_1 = $1_1 - ($0_1 + $0_1); return $8_1 & 1 ? $0_1 : -$0_1; } if ($2_1) { $5_1 = -1.0 / $1_1; wasm2js_scratch_store_f64(+$5_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $2_1 | 0); $3 = +wasm2js_scratch_load_f64(); wasm2js_scratch_store_f64(+$1_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; wasm2js_scratch_store_i32(0, 0); wasm2js_scratch_store_i32(1, $2_1 | 0); $1_1 = +wasm2js_scratch_load_f64(); $1_1 = $5_1 * ($3 * ($4_1 - ($1_1 - $0_1)) + ($3 * $1_1 + 1.0)) + $3; } return $1_1; } function $2090($0_1) { var $1_1 = 0, $2_1 = 0; $1_1 = global$0 - 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; $2_1 = $2_1 & 2147483647; block1 : { if ($2_1 >>> 0 <= 1072243195) { if ($2_1 >>> 0 < 1044381696) { break block1 } $0_1 = $2089($0_1, 0.0, 0); break block1; } if ($2_1 >>> 0 >= 2146435072) { $0_1 = $0_1 - $0_1; break block1; } $2_1 = $1968($0_1, $1_1); $0_1 = $2089(HEAPF64[$1_1 >> 3], HEAPF64[$1_1 + 8 >> 3], $2_1 & 1); } $1_1 = $1_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1; } function $2091($0_1) { var $1_1 = 0.0, $2_1 = 0; $1_1 = Math_abs($0_1); wasm2js_scratch_store_f64(+$1_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; block2 : { if ($2_1 >>> 0 >= 1071748075) { if ($2_1 >>> 0 >= 1077149697) { $1_1 = -0.0 / $1_1 + 1.0; break block2; } $1_1 = 1.0 - 2.0 / ($1984($1_1 + $1_1) + 2.0); break block2; } if ($2_1 >>> 0 >= 1070618799) { $1_1 = $1984($1_1 + $1_1); $1_1 = $1_1 / ($1_1 + 2.0); break block2; } if ($2_1 >>> 0 < 1048576) { break block2 } $1_1 = $1984($1_1 * -2.0); $1_1 = -$1_1 / ($1_1 + 2.0); } wasm2js_scratch_store_f64(+$0_1); $2_1 = wasm2js_scratch_load_i32(1) | 0; wasm2js_scratch_load_i32(0) | 0; return ($2_1 | 0) < 0 ? -$1_1 : $1_1; } function $2093($0_1) { return $0_1 - 97 >>> 0 < 26 ? $0_1 & 95 : $0_1; } function $2094($0_1) { $0_1 = $0_1 | 0; return $2087(fimport$25(-100, $0_1 | 0, 0) | 0) | 0; } function $2102($0_1) { if (!$0_1) { return 0 } HEAP32[20691] = $0_1; return -1; } function $2105($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; var $3 = 0; $3 = global$0 - 16 | 0; if ($3 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $3 >>> 0) { fimport$30($3 | 0) } global$0 = $3; HEAP32[$3 + 12 >> 2] = $2_1; HEAP32[$3 + 8 >> 2] = $1_1; $1_1 = $2102(fimport$23($0_1 | 0, $3 + 8 | 0, 1, $3 + 4 | 0) | 0); $2_1 = HEAP32[$3 + 4 >> 2]; $0_1 = $3 + 16 | 0; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return ($1_1 ? -1 : $2_1) | 0; } function $2106() { fimport$28(); wasm2js_trap(); } function $2107($0_1) { $0_1 = $0_1 | 0; return $2102(fimport$2(HEAP32[$0_1 + 60 >> 2]) | 0) | 0; } function $2108($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $0_1 = $2011(HEAP32[$0_1 + 60 >> 2], $1_1, $2_1, $3); return $0_1 | 0; } function $2109($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0; $12_1 = global$0 - 16 | 0; $1_1 = $12_1; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; block5 : { block88 : { block4 : { block6 : { if ($0_1 >>> 0 <= 244) { $4_1 = HEAP32[20994]; $7_1 = $0_1 >>> 0 < 11 ? 16 : $0_1 + 11 & 504; $0_1 = $7_1 >>> 3 | 0; $1_1 = $4_1 >>> $0_1 | 0; if ($1_1 & 3) { $5_1 = $0_1 + (($1_1 ^ -1) & 1) | 0; $2_1 = $5_1 << 3; $3 = $2_1 + 84016 | 0; $1_1 = HEAP32[$2_1 + 84024 >> 2]; $0_1 = HEAP32[$1_1 + 8 >> 2]; block3 : { if (($3 | 0) == ($0_1 | 0)) { HEAP32[20994] = __wasm_rotl_i32(-2, $5_1) & $4_1; break block3; } if (($1_1 | 0) != HEAP32[$0_1 + 12 >> 2] | $0_1 >>> 0 < HEAPU32[20998]) { break block4 } HEAP32[$0_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $0_1; } $0_1 = $1_1 + 8 | 0; HEAP32[$1_1 + 4 >> 2] = $2_1 | 3; $1_1 = $1_1 + $2_1 | 0; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 1; break block5; } $9_1 = HEAP32[20996]; if ($9_1 >>> 0 >= $7_1 >>> 0) { break block6 } if ($1_1) { $2_1 = 2 << $0_1; $5_1 = __wasm_ctz_i32((0 - $2_1 | $2_1) & $1_1 << $0_1); $2_1 = $5_1 << 3; $3 = $2_1 + 84016 | 0; $1_1 = HEAP32[$2_1 + 84024 >> 2]; $0_1 = HEAP32[$1_1 + 8 >> 2]; block9 : { if (($3 | 0) == ($0_1 | 0)) { $4_1 = __wasm_rotl_i32(-2, $5_1) & $4_1; HEAP32[20994] = $4_1; break block9; } if (($1_1 | 0) != HEAP32[$0_1 + 12 >> 2] | $0_1 >>> 0 < HEAPU32[20998]) { break block4 } HEAP32[$0_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $0_1; } HEAP32[$1_1 + 4 >> 2] = $7_1 | 3; $6_1 = $1_1 + $7_1 | 0; $5_1 = $2_1 - $7_1 | 0; HEAP32[$6_1 + 4 >> 2] = $5_1 | 1; HEAP32[$1_1 + $2_1 >> 2] = $5_1; if ($9_1) { $0_1 = ($9_1 & -8) + 84016 | 0; $2_1 = HEAP32[20999]; $3 = 1 << ($9_1 >>> 3); block12 : { if (!($3 & $4_1)) { HEAP32[20994] = $3 | $4_1; $3 = $0_1; break block12; } $3 = HEAP32[$0_1 + 8 >> 2]; if ($3 >>> 0 < HEAPU32[20998]) { break block4 } } HEAP32[$0_1 + 8 >> 2] = $2_1; HEAP32[$3 + 12 >> 2] = $2_1; HEAP32[$2_1 + 12 >> 2] = $0_1; HEAP32[$2_1 + 8 >> 2] = $3; } $0_1 = $1_1 + 8 | 0; HEAP32[20999] = $6_1; HEAP32[20996] = $5_1; break block5; } $11_1 = HEAP32[20995]; if (!$11_1) { break block6 } $1_1 = HEAP32[(__wasm_ctz_i32($11_1) << 2) + 84280 >> 2]; $5_1 = (HEAP32[$1_1 + 4 >> 2] & -8) - $7_1 | 0; $2_1 = $1_1; while (1) { block14 : { $0_1 = HEAP32[$1_1 + 16 >> 2]; if (!$0_1) { $0_1 = HEAP32[$1_1 + 20 >> 2]; if (!$0_1) { break block14 } } $3 = (HEAP32[$0_1 + 4 >> 2] & -8) - $7_1 | 0; $1_1 = $3 >>> 0 < $5_1 >>> 0; $5_1 = $1_1 ? $3 : $5_1; $2_1 = $1_1 ? $0_1 : $2_1; $1_1 = $0_1; continue; } break; }; $8_1 = HEAP32[20998]; if ($8_1 >>> 0 > $2_1 >>> 0) { break block4 } $10_1 = HEAP32[$2_1 + 24 >> 2]; $0_1 = HEAP32[$2_1 + 12 >> 2]; block16 : { if (($0_1 | 0) != ($2_1 | 0)) { $1_1 = HEAP32[$2_1 + 8 >> 2]; if ($1_1 >>> 0 < $8_1 >>> 0 | HEAP32[$1_1 + 12 >> 2] != ($2_1 | 0) | HEAP32[$0_1 + 8 >> 2] != ($2_1 | 0)) { break block4 } HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 8 >> 2] = $1_1; break block16; } block19 : { $1_1 = HEAP32[$2_1 + 20 >> 2]; if ($1_1) { $3 = $2_1 + 20 | 0 } else { $1_1 = HEAP32[$2_1 + 16 >> 2]; if (!$1_1) { break block19 } $3 = $2_1 + 16 | 0; } while (1) { $6_1 = $3; $0_1 = $1_1; $3 = $0_1 + 20 | 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; if ($1_1) { continue } $3 = $0_1 + 16 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; if ($1_1) { continue } break; }; if ($6_1 >>> 0 < $8_1 >>> 0) { break block4 } HEAP32[$6_1 >> 2] = 0; break block16; } $0_1 = 0; } block20 : { if (!$10_1) { break block20 } $1_1 = HEAP32[$2_1 + 28 >> 2]; $3 = $1_1 << 2; block22 : { if (($2_1 | 0) == HEAP32[$3 + 84280 >> 2]) { HEAP32[$3 + 84280 >> 2] = $0_1; if ($0_1) { break block22 } HEAP32[20995] = __wasm_rotl_i32(-2, $1_1) & $11_1; break block20; } if ($8_1 >>> 0 > $10_1 >>> 0) { break block4 } block24 : { if (($2_1 | 0) == HEAP32[$10_1 + 16 >> 2]) { HEAP32[$10_1 + 16 >> 2] = $0_1; break block24; } HEAP32[$10_1 + 20 >> 2] = $0_1; } if (!$0_1) { break block20 } } if ($0_1 >>> 0 < $8_1 >>> 0) { break block4 } HEAP32[$0_1 + 24 >> 2] = $10_1; $1_1 = HEAP32[$2_1 + 16 >> 2]; if ($1_1) { if ($1_1 >>> 0 < $8_1 >>> 0) { break block4 } HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $0_1; } $1_1 = HEAP32[$2_1 + 20 >> 2]; if (!$1_1) { break block20 } if ($1_1 >>> 0 < $8_1 >>> 0) { break block4 } HEAP32[$0_1 + 20 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $0_1; } block27 : { if ($5_1 >>> 0 <= 15) { $0_1 = $5_1 + $7_1 | 0; HEAP32[$2_1 + 4 >> 2] = $0_1 | 3; $0_1 = $0_1 + $2_1 | 0; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 1; break block27; } HEAP32[$2_1 + 4 >> 2] = $7_1 | 3; $6_1 = $2_1 + $7_1 | 0; HEAP32[$6_1 + 4 >> 2] = $5_1 | 1; HEAP32[$5_1 + $6_1 >> 2] = $5_1; if ($9_1) { $0_1 = ($9_1 & -8) + 84016 | 0; $1_1 = HEAP32[20999]; $3 = 1 << ($9_1 >>> 3); block30 : { if (!($3 & $4_1)) { HEAP32[20994] = $3 | $4_1; $3 = $0_1; break block30; } $3 = HEAP32[$0_1 + 8 >> 2]; if ($8_1 >>> 0 > $3 >>> 0) { break block4 } } HEAP32[$0_1 + 8 >> 2] = $1_1; HEAP32[$3 + 12 >> 2] = $1_1; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$1_1 + 8 >> 2] = $3; } HEAP32[20999] = $6_1; HEAP32[20996] = $5_1; } $0_1 = $2_1 + 8 | 0; break block5; } $7_1 = -1; if ($0_1 >>> 0 > 4294967231) { break block6 } $1_1 = $0_1 + 11 | 0; $7_1 = $1_1 & -8; $9_1 = HEAP32[20995]; if (!$9_1) { break block6 } $4_1 = 31; $5_1 = 0 - $7_1 | 0; if ($0_1 >>> 0 <= 16777204) { $0_1 = Math_clz32($1_1 >>> 8 | 0); $4_1 = (($7_1 >>> 38 - $0_1 & 1) - ($0_1 << 1) | 0) + 62 | 0; } $1_1 = HEAP32[($4_1 << 2) + 84280 >> 2]; block37 : { block35 : { block33 : { if (!$1_1) { $0_1 = 0; break block33; } $0_1 = 0; $2_1 = $7_1 << (($4_1 | 0) != 31 ? 25 - ($4_1 >>> 1 | 0) | 0 : 0); while (1) { block34 : { $6_1 = (HEAP32[$1_1 + 4 >> 2] & -8) - $7_1 | 0; if ($6_1 >>> 0 >= $5_1 >>> 0) { break block34 } $3 = $1_1; $5_1 = $6_1; if ($5_1) { break block34 } $5_1 = 0; $0_1 = $1_1; break block35; } $6_1 = HEAP32[$1_1 + 20 >> 2]; $1_1 = HEAP32[(($2_1 >>> 29 & 4) + $1_1 | 0) + 16 >> 2]; $0_1 = $6_1 ? (($1_1 | 0) == ($6_1 | 0) ? $0_1 : $6_1) : $0_1; $2_1 = $2_1 << 1; if ($1_1) { continue } break; }; } if (!($0_1 | $3)) { $3 = 0; $0_1 = 2 << $4_1; $0_1 = (0 - $0_1 | $0_1) & $9_1; if (!$0_1) { break block6 } $0_1 = HEAP32[(__wasm_ctz_i32($0_1) << 2) + 84280 >> 2]; } if (!$0_1) { break block37 } } while (1) { $2_1 = (HEAP32[$0_1 + 4 >> 2] & -8) - $7_1 | 0; $1_1 = $2_1 >>> 0 < $5_1 >>> 0; $5_1 = $1_1 ? $2_1 : $5_1; $3 = $1_1 ? $0_1 : $3; $1_1 = HEAP32[$0_1 + 16 >> 2]; if ($1_1) { $0_1 = $1_1 } else { $0_1 = HEAP32[$0_1 + 20 >> 2] } if ($0_1) { continue } break; }; } if (!$3 | HEAP32[20996] - $7_1 >>> 0 <= $5_1 >>> 0) { break block6 } $6_1 = HEAP32[20998]; if ($6_1 >>> 0 > $3 >>> 0) { break block4 } $8_1 = HEAP32[$3 + 24 >> 2]; $0_1 = HEAP32[$3 + 12 >> 2]; block40 : { if (($0_1 | 0) != ($3 | 0)) { $1_1 = HEAP32[$3 + 8 >> 2]; if ($1_1 >>> 0 < $6_1 >>> 0 | HEAP32[$1_1 + 12 >> 2] != ($3 | 0) | HEAP32[$0_1 + 8 >> 2] != ($3 | 0)) { break block4 } HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 8 >> 2] = $1_1; break block40; } block43 : { $1_1 = HEAP32[$3 + 20 >> 2]; if ($1_1) { $2_1 = $3 + 20 | 0 } else { $1_1 = HEAP32[$3 + 16 >> 2]; if (!$1_1) { break block43 } $2_1 = $3 + 16 | 0; } while (1) { $4_1 = $2_1; $0_1 = $1_1; $2_1 = $0_1 + 20 | 0; $1_1 = HEAP32[$0_1 + 20 >> 2]; if ($1_1) { continue } $2_1 = $0_1 + 16 | 0; $1_1 = HEAP32[$0_1 + 16 >> 2]; if ($1_1) { continue } break; }; if ($4_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$4_1 >> 2] = 0; break block40; } $0_1 = 0; } block44 : { if (!$8_1) { break block44 } $1_1 = HEAP32[$3 + 28 >> 2]; $2_1 = $1_1 << 2; block46 : { if (($3 | 0) == HEAP32[$2_1 + 84280 >> 2]) { HEAP32[$2_1 + 84280 >> 2] = $0_1; if ($0_1) { break block46 } $9_1 = __wasm_rotl_i32(-2, $1_1) & $9_1; HEAP32[20995] = $9_1; break block44; } if ($6_1 >>> 0 > $8_1 >>> 0) { break block4 } block48 : { if (($3 | 0) == HEAP32[$8_1 + 16 >> 2]) { HEAP32[$8_1 + 16 >> 2] = $0_1; break block48; } HEAP32[$8_1 + 20 >> 2] = $0_1; } if (!$0_1) { break block44 } } if ($0_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$0_1 + 24 >> 2] = $8_1; $1_1 = HEAP32[$3 + 16 >> 2]; if ($1_1) { if ($1_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$0_1 + 16 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $0_1; } $1_1 = HEAP32[$3 + 20 >> 2]; if (!$1_1) { break block44 } if ($1_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$0_1 + 20 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $0_1; } block51 : { if ($5_1 >>> 0 <= 15) { $0_1 = $5_1 + $7_1 | 0; HEAP32[$3 + 4 >> 2] = $0_1 | 3; $0_1 = $0_1 + $3 | 0; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] | 1; break block51; } HEAP32[$3 + 4 >> 2] = $7_1 | 3; $4_1 = $3 + $7_1 | 0; HEAP32[$4_1 + 4 >> 2] = $5_1 | 1; HEAP32[$4_1 + $5_1 >> 2] = $5_1; if ($5_1 >>> 0 <= 255) { $0_1 = ($5_1 & 248) + 84016 | 0; $1_1 = HEAP32[20994]; $2_1 = 1 << ($5_1 >>> 3); block54 : { if (!($1_1 & $2_1)) { HEAP32[20994] = $1_1 | $2_1; $5_1 = $0_1; break block54; } $5_1 = HEAP32[$0_1 + 8 >> 2]; if ($6_1 >>> 0 > $5_1 >>> 0) { break block4 } } HEAP32[$0_1 + 8 >> 2] = $4_1; HEAP32[$5_1 + 12 >> 2] = $4_1; HEAP32[$4_1 + 12 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = $5_1; break block51; } $0_1 = 31; if ($5_1 >>> 0 <= 16777215) { $0_1 = Math_clz32($5_1 >>> 8 | 0); $0_1 = ($5_1 >>> 38 - $0_1 & 1 | $0_1 << 1) ^ 62; } HEAP32[$4_1 + 28 >> 2] = $0_1; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 20 >> 2] = 0; $2_1 = ($0_1 << 2) + 84280 | 0; block58 : { $1_1 = 1 << $0_1; block57 : { if (!($1_1 & $9_1)) { HEAP32[20995] = $1_1 | $9_1; HEAP32[$2_1 >> 2] = $4_1; break block57; } $0_1 = $5_1 << (($0_1 | 0) != 31 ? 25 - ($0_1 >>> 1 | 0) | 0 : 0); $1_1 = HEAP32[$2_1 >> 2]; while (1) { $2_1 = $1_1; if ((HEAP32[$1_1 + 4 >> 2] & -8) == ($5_1 | 0)) { break block58 } $1_1 = $0_1 >>> 29 | 0; $0_1 = $0_1 << 1; $7_1 = $2_1 + ($1_1 & 4) | 0; $1_1 = HEAP32[$7_1 + 16 >> 2]; if ($1_1) { continue } break; }; $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$0_1 >> 2] = $4_1; } HEAP32[$4_1 + 24 >> 2] = $2_1; HEAP32[$4_1 + 12 >> 2] = $4_1; HEAP32[$4_1 + 8 >> 2] = $4_1; break block51; } if ($2_1 >>> 0 < $6_1 >>> 0) { break block4 } $0_1 = HEAP32[$2_1 + 8 >> 2]; if ($0_1 >>> 0 < $6_1 >>> 0) { break block4 } HEAP32[$0_1 + 12 >> 2] = $4_1; HEAP32[$2_1 + 8 >> 2] = $4_1; HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = $2_1; HEAP32[$4_1 + 8 >> 2] = $0_1; } $0_1 = $3 + 8 | 0; break block5; } $3 = HEAP32[20996]; if ($7_1 >>> 0 <= $3 >>> 0) { $0_1 = HEAP32[20999]; $1_1 = $3 - $7_1 | 0; block61 : { if ($1_1 >>> 0 >= 16) { $2_1 = $0_1 + $7_1 | 0; HEAP32[$2_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + $3 >> 2] = $1_1; HEAP32[$0_1 + 4 >> 2] = $7_1 | 3; break block61; } HEAP32[$0_1 + 4 >> 2] = $3 | 3; $1_1 = $0_1 + $3 | 0; HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] | 1; $1_1 = 0; $2_1 = 0; } HEAP32[20996] = $1_1; HEAP32[20999] = $2_1; $0_1 = $0_1 + 8 | 0; break block5; } $2_1 = HEAP32[20997]; if ($7_1 >>> 0 < $2_1 >>> 0) { $1_1 = $2_1 - $7_1 | 0; HEAP32[20997] = $1_1; $0_1 = HEAP32[21e3]; $2_1 = $0_1 + $7_1 | 0; HEAP32[21e3] = $2_1; HEAP32[$2_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + 4 >> 2] = $7_1 | 3; $0_1 = $0_1 + 8 | 0; break block5; } $0_1 = 0; if (HEAP32[21112]) { $1_1 = HEAP32[21114] } else { HEAP32[21115] = -1; HEAP32[21116] = -1; HEAP32[21113] = 4096; HEAP32[21114] = 4096; HEAP32[21112] = $12_1 + 12 & -16 ^ 1431655768; HEAP32[21117] = 0; HEAP32[21105] = 0; $1_1 = 4096; } $5_1 = $7_1 + 47 | 0; $4_1 = $1_1 + $5_1 | 0; $6_1 = 0 - $1_1 | 0; $1_1 = $4_1 & $6_1; if ($1_1 >>> 0 <= $7_1 >>> 0) { break block5 } $3 = HEAP32[21104]; if ($3) { $11_1 = $3; $3 = HEAP32[21102]; $8_1 = $3 + $1_1 | 0; if ($11_1 >>> 0 < $8_1 >>> 0 | $3 >>> 0 >= $8_1 >>> 0) { break block5 } } block77 : { block74 : { if (!(HEAPU8[84420] & 4)) { block70 : { block75 : { block73 : { block69 : { $3 = HEAP32[21e3]; if ($3) { $0_1 = 84424; while (1) { $8_1 = HEAP32[$0_1 >> 2]; if ($3 >>> 0 >= $8_1 >>> 0 & $3 >>> 0 < $8_1 + HEAP32[$0_1 + 4 >> 2] >>> 0) { break block69 } $0_1 = HEAP32[$0_1 + 8 >> 2]; if ($0_1) { continue } break; }; } $2_1 = $2119(0); if (($2_1 | 0) == -1) { break block70 } $4_1 = $1_1; $0_1 = HEAP32[21113]; $3 = $0_1 - 1 | 0; if ($3 & $2_1) { $4_1 = ($1_1 - $2_1 | 0) + ($2_1 + $3 & 0 - $0_1) | 0 } if ($4_1 >>> 0 <= $7_1 >>> 0) { break block70 } $0_1 = HEAP32[21104]; if ($0_1) { $6_1 = $0_1; $0_1 = HEAP32[21102]; $3 = $0_1 + $4_1 | 0; if ($6_1 >>> 0 < $3 >>> 0 | $0_1 >>> 0 >= $3 >>> 0) { break block70 } } $0_1 = $2119($4_1); if (($2_1 | 0) != ($0_1 | 0)) { break block73 } break block74; } $4_1 = $6_1 & $4_1 - $2_1; $2_1 = $2119($4_1); if (($2_1 | 0) == (HEAP32[$0_1 >> 2] + HEAP32[$0_1 + 4 >> 2] | 0)) { break block75 } $0_1 = $2_1; } if (($0_1 | 0) == -1) { break block70 } if ($4_1 >>> 0 >= $7_1 + 48 >>> 0) { $2_1 = $0_1; break block74; } $2_1 = HEAP32[21114]; $2_1 = $2_1 + ($5_1 - $4_1 | 0) & 0 - $2_1; if (($2119($2_1) | 0) == -1) { break block70 } $4_1 = $2_1 + $4_1 | 0; $2_1 = $0_1; break block74; } if (($2_1 | 0) != -1) { break block74 } } HEAP32[21105] = HEAP32[21105] | 4; } $2_1 = $2119($1_1); $0_1 = $2119(0); if (($2_1 | 0) == -1 | ($0_1 | 0) == -1 | $0_1 >>> 0 <= $2_1 >>> 0) { break block77 } $4_1 = $0_1 - $2_1 | 0; if ($4_1 >>> 0 <= $7_1 + 40 >>> 0) { break block77 } } $0_1 = HEAP32[21102] + $4_1 | 0; HEAP32[21102] = $0_1; if (HEAPU32[21103] < $0_1 >>> 0) { HEAP32[21103] = $0_1 } block84 : { block81 : { block80 : { $5_1 = HEAP32[21e3]; if ($5_1) { $0_1 = 84424; while (1) { $1_1 = HEAP32[$0_1 >> 2]; $3 = HEAP32[$0_1 + 4 >> 2]; if (($1_1 + $3 | 0) == ($2_1 | 0)) { break block80 } $0_1 = HEAP32[$0_1 + 8 >> 2]; if ($0_1) { continue } break; }; break block81; } $0_1 = HEAP32[20998]; if (!(!!$0_1 & $0_1 >>> 0 <= $2_1 >>> 0)) { HEAP32[20998] = $2_1 } $0_1 = 0; HEAP32[21107] = $4_1; HEAP32[21106] = $2_1; HEAP32[21002] = -1; HEAP32[21003] = HEAP32[21112]; HEAP32[21109] = 0; while (1) { $1_1 = $0_1 << 3; $3 = $1_1 + 84016 | 0; HEAP32[$1_1 + 84024 >> 2] = $3; HEAP32[$1_1 + 84028 >> 2] = $3; $0_1 = $0_1 + 1 | 0; if (($0_1 | 0) != 32) { continue } break; }; $0_1 = $4_1 - 40 | 0; $1_1 = -8 - $2_1 & 7; $3 = $0_1 - $1_1 | 0; HEAP32[20997] = $3; $1_1 = $1_1 + $2_1 | 0; HEAP32[21e3] = $1_1; HEAP32[$1_1 + 4 >> 2] = $3 | 1; HEAP32[($0_1 + $2_1 | 0) + 4 >> 2] = 40; HEAP32[21001] = HEAP32[21116]; break block84; } if (HEAP32[$0_1 + 12 >> 2] & 8 | ($2_1 >>> 0 <= $5_1 >>> 0 | $1_1 >>> 0 > $5_1 >>> 0)) { break block81 } HEAP32[$0_1 + 4 >> 2] = $3 + $4_1; $0_1 = -8 - $5_1 & 7; $1_1 = $0_1 + $5_1 | 0; HEAP32[21e3] = $1_1; $2_1 = HEAP32[20997] + $4_1 | 0; $0_1 = $2_1 - $0_1 | 0; HEAP32[20997] = $0_1; HEAP32[$1_1 + 4 >> 2] = $0_1 | 1; HEAP32[($2_1 + $5_1 | 0) + 4 >> 2] = 40; HEAP32[21001] = HEAP32[21116]; break block84; } if ($2_1 >>> 0 < HEAPU32[20998]) { HEAP32[20998] = $2_1 } $3 = $2_1 + $4_1 | 0; $0_1 = 84424; block87 : { while (1) { $1_1 = HEAP32[$0_1 >> 2]; if (($3 | 0) != ($1_1 | 0)) { $0_1 = HEAP32[$0_1 + 8 >> 2]; if ($0_1) { continue } break block87; } break; }; if (!(HEAPU8[$0_1 + 12 | 0] & 8)) { break block88 } } $0_1 = 84424; while (1) { block90 : { $1_1 = HEAP32[$0_1 >> 2]; if ($5_1 >>> 0 >= $1_1 >>> 0) { $3 = $1_1 + HEAP32[$0_1 + 4 >> 2] | 0; if ($3 >>> 0 > $5_1 >>> 0) { break block90 } } $0_1 = HEAP32[$0_1 + 8 >> 2]; continue; } break; }; $0_1 = $4_1 - 40 | 0; $1_1 = -8 - $2_1 & 7; $6_1 = $0_1 - $1_1 | 0; HEAP32[20997] = $6_1; $1_1 = $1_1 + $2_1 | 0; HEAP32[21e3] = $1_1; HEAP32[$1_1 + 4 >> 2] = $6_1 | 1; HEAP32[($0_1 + $2_1 | 0) + 4 >> 2] = 40; HEAP32[21001] = HEAP32[21116]; $0_1 = ($3 + (39 - $3 & 7) | 0) - 47 | 0; $1_1 = $0_1 >>> 0 < $5_1 + 16 >>> 0 ? $5_1 : $0_1; HEAP32[$1_1 + 4 >> 2] = 27; $0_1 = HEAP32[21109]; HEAP32[$1_1 + 16 >> 2] = HEAP32[21108]; HEAP32[$1_1 + 20 >> 2] = $0_1; $0_1 = HEAP32[21107]; HEAP32[$1_1 + 8 >> 2] = HEAP32[21106]; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[21108] = $1_1 + 8; HEAP32[21107] = $4_1; HEAP32[21106] = $2_1; HEAP32[21109] = 0; $0_1 = $1_1 + 24 | 0; while (1) { HEAP32[$0_1 + 4 >> 2] = 7; $2_1 = $0_1 + 8 | 0; $0_1 = $0_1 + 4 | 0; if ($2_1 >>> 0 < $3 >>> 0) { continue } break; }; if (($1_1 | 0) == ($5_1 | 0)) { break block84 } HEAP32[$1_1 + 4 >> 2] = HEAP32[$1_1 + 4 >> 2] & -2; $2_1 = $1_1 - $5_1 | 0; HEAP32[$5_1 + 4 >> 2] = $2_1 | 1; HEAP32[$1_1 >> 2] = $2_1; block94 : { if ($2_1 >>> 0 <= 255) { $0_1 = ($2_1 & 248) + 84016 | 0; $1_1 = HEAP32[20994]; $2_1 = 1 << ($2_1 >>> 3); block93 : { if (!($1_1 & $2_1)) { HEAP32[20994] = $1_1 | $2_1; $1_1 = $0_1; break block93; } $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($1_1 >>> 0 < HEAPU32[20998]) { break block4 } } HEAP32[$0_1 + 8 >> 2] = $5_1; HEAP32[$1_1 + 12 >> 2] = $5_1; $2_1 = 12; $3 = 8; break block94; } $0_1 = 31; if ($2_1 >>> 0 <= 16777215) { $0_1 = Math_clz32($2_1 >>> 8 | 0); $0_1 = ($2_1 >>> 38 - $0_1 & 1 | $0_1 << 1) ^ 62; } HEAP32[$5_1 + 28 >> 2] = $0_1; HEAP32[$5_1 + 16 >> 2] = 0; HEAP32[$5_1 + 20 >> 2] = 0; $1_1 = ($0_1 << 2) + 84280 | 0; block98 : { $3 = HEAP32[20995]; $4_1 = 1 << $0_1; block97 : { if (!($3 & $4_1)) { HEAP32[20995] = $3 | $4_1; HEAP32[$1_1 >> 2] = $5_1; break block97; } $0_1 = $2_1 << (($0_1 | 0) != 31 ? 25 - ($0_1 >>> 1 | 0) | 0 : 0); $3 = HEAP32[$1_1 >> 2]; while (1) { $1_1 = $3; if (($2_1 | 0) == (HEAP32[$1_1 + 4 >> 2] & -8)) { break block98 } $4_1 = $0_1 >>> 29 | 0; $0_1 = $0_1 << 1; $4_1 = ($4_1 & 4) + $1_1 | 0; $3 = HEAP32[$4_1 + 16 >> 2]; if ($3) { continue } break; }; $0_1 = $4_1 + 16 | 0; if ($0_1 >>> 0 < HEAPU32[20998]) { break block4 } HEAP32[$0_1 >> 2] = $5_1; } HEAP32[$5_1 + 24 >> 2] = $1_1; $2_1 = 8; $1_1 = $5_1; $0_1 = $1_1; $3 = 12; break block94; } $2_1 = HEAP32[20998]; if ($2_1 >>> 0 > $1_1 >>> 0) { break block4 } $0_1 = HEAP32[$1_1 + 8 >> 2]; if ($2_1 >>> 0 > $0_1 >>> 0) { break block4 } HEAP32[$0_1 + 12 >> 2] = $5_1; HEAP32[$1_1 + 8 >> 2] = $5_1; HEAP32[$5_1 + 8 >> 2] = $0_1; $0_1 = 0; $2_1 = 24; $3 = 12; } HEAP32[$3 + $5_1 >> 2] = $1_1; HEAP32[$2_1 + $5_1 >> 2] = $0_1; } $0_1 = HEAP32[20997]; if ($0_1 >>> 0 <= $7_1 >>> 0) { break block77 } $1_1 = $0_1 - $7_1 | 0; HEAP32[20997] = $1_1; $0_1 = HEAP32[21e3]; $2_1 = $0_1 + $7_1 | 0; HEAP32[21e3] = $2_1; HEAP32[$2_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + 4 >> 2] = $7_1 | 3; $0_1 = $0_1 + 8 | 0; break block5; } HEAP32[20691] = 48; $0_1 = 0; break block5; } $2106(); wasm2js_trap(); } HEAP32[$0_1 >> 2] = $2_1; HEAP32[$0_1 + 4 >> 2] = HEAP32[$0_1 + 4 >> 2] + $4_1; __inlined_func$2110$276 : { $9_1 = (-8 - $2_1 & 7) + $2_1 | 0; HEAP32[$9_1 + 4 >> 2] = $7_1 | 3; $6_1 = (-8 - $1_1 & 7) + $1_1 | 0; $4_1 = $7_1 + $9_1 | 0; $3 = $6_1 - $4_1 | 0; block60 : { block1 : { if (($6_1 | 0) == HEAP32[21e3]) { HEAP32[21e3] = $4_1; $0_1 = HEAP32[20997] + $3 | 0; HEAP32[20997] = $0_1; HEAP32[$4_1 + 4 >> 2] = $0_1 | 1; break block1; } if (($6_1 | 0) == HEAP32[20999]) { HEAP32[20999] = $4_1; $0_1 = HEAP32[20996] + $3 | 0; HEAP32[20996] = $0_1; HEAP32[$4_1 + 4 >> 2] = $0_1 | 1; HEAP32[$0_1 + $4_1 >> 2] = $0_1; break block1; } $7_1 = HEAP32[$6_1 + 4 >> 2]; if (($7_1 & 3) == 1) { $2_1 = HEAP32[$6_1 + 12 >> 2]; block8 : { if ($7_1 >>> 0 <= 255) { $0_1 = HEAP32[$6_1 + 8 >> 2]; $1_1 = ($7_1 & 248) + 84016 | 0; if (($0_1 | 0) != ($1_1 | 0) & (HEAP32[$0_1 + 12 >> 2] != ($6_1 | 0) | $0_1 >>> 0 < HEAPU32[20998])) { break block60 } if (($0_1 | 0) == ($2_1 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $7_1 >>> 3 | 0); break block8; } if ((HEAP32[$2_1 + 8 >> 2] != ($6_1 | 0) | HEAPU32[20998] > $2_1 >>> 0) & ($1_1 | 0) != ($2_1 | 0)) { break block60 } HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $0_1; break block8; } $8_1 = HEAP32[$6_1 + 24 >> 2]; block11 : { if (($2_1 | 0) != ($6_1 | 0)) { $0_1 = HEAP32[$6_1 + 8 >> 2]; if ($0_1 >>> 0 < HEAPU32[20998] | HEAP32[$0_1 + 12 >> 2] != ($6_1 | 0) | HEAP32[$2_1 + 8 >> 2] != ($6_1 | 0)) { break block60 } HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $0_1; break block11; } block141 : { $0_1 = HEAP32[$6_1 + 20 >> 2]; if ($0_1) { $1_1 = $6_1 + 20 | 0 } else { $0_1 = HEAP32[$6_1 + 16 >> 2]; if (!$0_1) { break block141 } $1_1 = $6_1 + 16 | 0; } while (1) { $5_1 = $1_1; $2_1 = $0_1; $1_1 = $0_1 + 20 | 0; $0_1 = HEAP32[$0_1 + 20 >> 2]; if ($0_1) { continue } $1_1 = $2_1 + 16 | 0; $0_1 = HEAP32[$2_1 + 16 >> 2]; if ($0_1) { continue } break; }; if (HEAPU32[20998] > $5_1 >>> 0) { break block60 } HEAP32[$5_1 >> 2] = 0; break block11; } $2_1 = 0; } if (!$8_1) { break block8 } $0_1 = HEAP32[$6_1 + 28 >> 2]; $1_1 = $0_1 << 2; block1614 : { if (($6_1 | 0) == HEAP32[$1_1 + 84280 >> 2]) { HEAP32[$1_1 + 84280 >> 2] = $2_1; if ($2_1) { break block1614 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $0_1); break block8; } if (HEAPU32[20998] > $8_1 >>> 0) { break block60 } block18 : { if (($6_1 | 0) == HEAP32[$8_1 + 16 >> 2]) { HEAP32[$8_1 + 16 >> 2] = $2_1; break block18; } HEAP32[$8_1 + 20 >> 2] = $2_1; } if (!$2_1) { break block8 } } $1_1 = HEAP32[20998]; if ($1_1 >>> 0 > $2_1 >>> 0) { break block60 } HEAP32[$2_1 + 24 >> 2] = $8_1; $0_1 = HEAP32[$6_1 + 16 >> 2]; if ($0_1) { if ($0_1 >>> 0 < $1_1 >>> 0) { break block60 } HEAP32[$2_1 + 16 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $2_1; } $0_1 = HEAP32[$6_1 + 20 >> 2]; if (!$0_1) { break block8 } if ($0_1 >>> 0 < $1_1 >>> 0) { break block60 } HEAP32[$2_1 + 20 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $2_1; } $0_1 = $7_1 & -8; $3 = $0_1 + $3 | 0; $6_1 = $0_1 + $6_1 | 0; $7_1 = HEAP32[$6_1 + 4 >> 2]; } HEAP32[$6_1 + 4 >> 2] = $7_1 & -2; HEAP32[$4_1 + 4 >> 2] = $3 | 1; HEAP32[$3 + $4_1 >> 2] = $3; if ($3 >>> 0 <= 255) { $0_1 = ($3 & 248) + 84016 | 0; $1_1 = HEAP32[20994]; $2_1 = 1 << ($3 >>> 3); block2215 : { if (!($1_1 & $2_1)) { HEAP32[20994] = $1_1 | $2_1; $3 = $0_1; break block2215; } $3 = HEAP32[$0_1 + 8 >> 2]; if ($3 >>> 0 < HEAPU32[20998]) { break block60 } } HEAP32[$0_1 + 8 >> 2] = $4_1; HEAP32[$3 + 12 >> 2] = $4_1; HEAP32[$4_1 + 12 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = $3; break block1; } $2_1 = 31; if ($3 >>> 0 <= 16777215) { $0_1 = Math_clz32($3 >>> 8 | 0); $2_1 = ($3 >>> 38 - $0_1 & 1 | $0_1 << 1) ^ 62; } HEAP32[$4_1 + 28 >> 2] = $2_1; HEAP32[$4_1 + 16 >> 2] = 0; HEAP32[$4_1 + 20 >> 2] = 0; $0_1 = ($2_1 << 2) + 84280 | 0; block26 : { $1_1 = HEAP32[20995]; $5_1 = 1 << $2_1; block25 : { if (!($1_1 & $5_1)) { HEAP32[20995] = $1_1 | $5_1; HEAP32[$0_1 >> 2] = $4_1; break block25; } $2_1 = $3 << (($2_1 | 0) != 31 ? 25 - ($2_1 >>> 1 | 0) | 0 : 0); $1_1 = HEAP32[$0_1 >> 2]; while (1) { $0_1 = $1_1; if ((HEAP32[$0_1 + 4 >> 2] & -8) == ($3 | 0)) { break block26 } $1_1 = $2_1 >>> 29 | 0; $2_1 = $2_1 << 1; $5_1 = $0_1 + ($1_1 & 4) | 0; $1_1 = HEAP32[$5_1 + 16 >> 2]; if ($1_1) { continue } break; }; $1_1 = $5_1 + 16 | 0; if ($1_1 >>> 0 < HEAPU32[20998]) { break block60 } HEAP32[$1_1 >> 2] = $4_1; } HEAP32[$4_1 + 24 >> 2] = $0_1; HEAP32[$4_1 + 12 >> 2] = $4_1; HEAP32[$4_1 + 8 >> 2] = $4_1; break block1; } $2_1 = HEAP32[20998]; if ($2_1 >>> 0 > $0_1 >>> 0) { break block60 } $1_1 = HEAP32[$0_1 + 8 >> 2]; if ($2_1 >>> 0 > $1_1 >>> 0) { break block60 } HEAP32[$1_1 + 12 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = $4_1; HEAP32[$4_1 + 24 >> 2] = 0; HEAP32[$4_1 + 12 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = $1_1; } $0_1 = $9_1 + 8 | 0; break __inlined_func$2110$276; } $2106(); wasm2js_trap(); } } $1_1 = $12_1 + 16 | 0; if ($1_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $1_1 >>> 0) { fimport$30($1_1 | 0) } global$0 = $1_1; return $0_1 | 0; } function $2111($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; block1 : { block : { if (!$0_1) { break block } $3 = $0_1 - 8 | 0; $6_1 = HEAP32[20998]; if ($3 >>> 0 < $6_1 >>> 0) { break block1 } $1_1 = HEAP32[$0_1 - 4 >> 2]; if (($1_1 & 3) == 1) { break block1 } $0_1 = $1_1 & -8; $5_1 = $3 + $0_1 | 0; block2 : { if ($1_1 & 1) { break block2 } if (!($1_1 & 2)) { break block } $4_1 = HEAP32[$3 >> 2]; $3 = $3 - $4_1 | 0; if ($6_1 >>> 0 > $3 >>> 0) { break block1 } $0_1 = $0_1 + $4_1 | 0; if (($3 | 0) != HEAP32[20999]) { $2_1 = HEAP32[$3 + 12 >> 2]; if ($4_1 >>> 0 <= 255) { $1_1 = HEAP32[$3 + 8 >> 2]; $7_1 = ($4_1 & 248) + 84016 | 0; if (($1_1 | 0) != ($7_1 | 0) & (HEAP32[$1_1 + 12 >> 2] != ($3 | 0) | $1_1 >>> 0 < $6_1 >>> 0)) { break block1 } if (($1_1 | 0) == ($2_1 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $4_1 >>> 3 | 0); break block2; } if ((HEAP32[$2_1 + 8 >> 2] != ($3 | 0) | $2_1 >>> 0 < $6_1 >>> 0) & ($2_1 | 0) != ($7_1 | 0)) { break block1 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $1_1; break block2; } $8_1 = HEAP32[$3 + 24 >> 2]; block9 : { if (($2_1 | 0) != ($3 | 0)) { $1_1 = HEAP32[$3 + 8 >> 2]; if ($1_1 >>> 0 < $6_1 >>> 0 | HEAP32[$1_1 + 12 >> 2] != ($3 | 0) | HEAP32[$2_1 + 8 >> 2] != ($3 | 0)) { break block1 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $1_1; break block9; } block12 : { $1_1 = HEAP32[$3 + 20 >> 2]; if ($1_1) { $4_1 = $3 + 20 | 0 } else { $1_1 = HEAP32[$3 + 16 >> 2]; if (!$1_1) { break block12 } $4_1 = $3 + 16 | 0; } while (1) { $7_1 = $4_1; $2_1 = $1_1; $4_1 = $1_1 + 20 | 0; $1_1 = HEAP32[$1_1 + 20 >> 2]; if ($1_1) { continue } $4_1 = $2_1 + 16 | 0; $1_1 = HEAP32[$2_1 + 16 >> 2]; if ($1_1) { continue } break; }; if ($6_1 >>> 0 > $7_1 >>> 0) { break block1 } HEAP32[$7_1 >> 2] = 0; break block9; } $2_1 = 0; } if (!$8_1) { break block2 } $1_1 = HEAP32[$3 + 28 >> 2]; $4_1 = $1_1 << 2; block14 : { if (($3 | 0) == HEAP32[$4_1 + 84280 >> 2]) { HEAP32[$4_1 + 84280 >> 2] = $2_1; if ($2_1) { break block14 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $1_1); break block2; } if ($6_1 >>> 0 > $8_1 >>> 0) { break block1 } block16 : { if (($3 | 0) == HEAP32[$8_1 + 16 >> 2]) { HEAP32[$8_1 + 16 >> 2] = $2_1; break block16; } HEAP32[$8_1 + 20 >> 2] = $2_1; } if (!$2_1) { break block2 } } if ($2_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 24 >> 2] = $8_1; $1_1 = HEAP32[$3 + 16 >> 2]; if ($1_1) { if ($1_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 16 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $2_1; } $1_1 = HEAP32[$3 + 20 >> 2]; if (!$1_1) { break block2 } if ($1_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 20 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $2_1; break block2; } $1_1 = HEAP32[$5_1 + 4 >> 2]; if (($1_1 & 3) != 3) { break block2 } HEAP32[20996] = $0_1; HEAP32[$5_1 + 4 >> 2] = $1_1 & -2; HEAP32[$3 + 4 >> 2] = $0_1 | 1; HEAP32[$5_1 >> 2] = $0_1; return; } if ($3 >>> 0 >= $5_1 >>> 0) { break block1 } $8_1 = HEAP32[$5_1 + 4 >> 2]; if (!($8_1 & 1)) { break block1 } block36 : { if (!($8_1 & 2)) { if (HEAP32[21e3] == ($5_1 | 0)) { HEAP32[21e3] = $3; $0_1 = HEAP32[20997] + $0_1 | 0; HEAP32[20997] = $0_1; HEAP32[$3 + 4 >> 2] = $0_1 | 1; if (HEAP32[20999] != ($3 | 0)) { break block } HEAP32[20996] = 0; HEAP32[20999] = 0; return; } $10_1 = HEAP32[20999]; if (($10_1 | 0) == ($5_1 | 0)) { HEAP32[20999] = $3; $0_1 = HEAP32[20996] + $0_1 | 0; HEAP32[20996] = $0_1; HEAP32[$3 + 4 >> 2] = $0_1 | 1; HEAP32[$0_1 + $3 >> 2] = $0_1; return; } $2_1 = HEAP32[$5_1 + 12 >> 2]; block24 : { if ($8_1 >>> 0 <= 255) { $1_1 = HEAP32[$5_1 + 8 >> 2]; $4_1 = ($8_1 & 248) + 84016 | 0; if (($1_1 | 0) != ($4_1 | 0) & (($5_1 | 0) != HEAP32[$1_1 + 12 >> 2] | $1_1 >>> 0 < $6_1 >>> 0)) { break block1 } if (($1_1 | 0) == ($2_1 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $8_1 >>> 3 | 0); break block24; } if ((($5_1 | 0) != HEAP32[$2_1 + 8 >> 2] | $2_1 >>> 0 < $6_1 >>> 0) & ($2_1 | 0) != ($4_1 | 0)) { break block1 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $1_1; break block24; } $9_1 = HEAP32[$5_1 + 24 >> 2]; block27 : { if (($2_1 | 0) != ($5_1 | 0)) { $1_1 = HEAP32[$5_1 + 8 >> 2]; if ($1_1 >>> 0 < $6_1 >>> 0 | ($5_1 | 0) != HEAP32[$1_1 + 12 >> 2] | ($5_1 | 0) != HEAP32[$2_1 + 8 >> 2]) { break block1 } HEAP32[$1_1 + 12 >> 2] = $2_1; HEAP32[$2_1 + 8 >> 2] = $1_1; break block27; } block30 : { $1_1 = HEAP32[$5_1 + 20 >> 2]; if ($1_1) { $4_1 = $5_1 + 20 | 0 } else { $1_1 = HEAP32[$5_1 + 16 >> 2]; if (!$1_1) { break block30 } $4_1 = $5_1 + 16 | 0; } while (1) { $7_1 = $4_1; $2_1 = $1_1; $4_1 = $1_1 + 20 | 0; $1_1 = HEAP32[$1_1 + 20 >> 2]; if ($1_1) { continue } $4_1 = $2_1 + 16 | 0; $1_1 = HEAP32[$2_1 + 16 >> 2]; if ($1_1) { continue } break; }; if ($6_1 >>> 0 > $7_1 >>> 0) { break block1 } HEAP32[$7_1 >> 2] = 0; break block27; } $2_1 = 0; } if (!$9_1) { break block24 } $1_1 = HEAP32[$5_1 + 28 >> 2]; $4_1 = $1_1 << 2; block32 : { if (HEAP32[$4_1 + 84280 >> 2] == ($5_1 | 0)) { HEAP32[$4_1 + 84280 >> 2] = $2_1; if ($2_1) { break block32 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $1_1); break block24; } if ($6_1 >>> 0 > $9_1 >>> 0) { break block1 } block34 : { if (HEAP32[$9_1 + 16 >> 2] == ($5_1 | 0)) { HEAP32[$9_1 + 16 >> 2] = $2_1; break block34; } HEAP32[$9_1 + 20 >> 2] = $2_1; } if (!$2_1) { break block24 } } if ($2_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 24 >> 2] = $9_1; $1_1 = HEAP32[$5_1 + 16 >> 2]; if ($1_1) { if ($1_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 16 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $2_1; } $1_1 = HEAP32[$5_1 + 20 >> 2]; if (!$1_1) { break block24 } if ($1_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$2_1 + 20 >> 2] = $1_1; HEAP32[$1_1 + 24 >> 2] = $2_1; } $0_1 = ($8_1 & -8) + $0_1 | 0; HEAP32[$3 + 4 >> 2] = $0_1 | 1; HEAP32[$0_1 + $3 >> 2] = $0_1; if (($3 | 0) != ($10_1 | 0)) { break block36 } HEAP32[20996] = $0_1; return; } HEAP32[$5_1 + 4 >> 2] = $8_1 & -2; HEAP32[$3 + 4 >> 2] = $0_1 | 1; HEAP32[$0_1 + $3 >> 2] = $0_1; } if ($0_1 >>> 0 <= 255) { $1_1 = ($0_1 & 248) + 84016 | 0; $4_1 = HEAP32[20994]; $0_1 = 1 << ($0_1 >>> 3); block39 : { if (!($4_1 & $0_1)) { HEAP32[20994] = $0_1 | $4_1; $0_1 = $1_1; break block39; } $0_1 = HEAP32[$1_1 + 8 >> 2]; if ($6_1 >>> 0 > $0_1 >>> 0) { break block1 } } HEAP32[$1_1 + 8 >> 2] = $3; HEAP32[$0_1 + 12 >> 2] = $3; HEAP32[$3 + 12 >> 2] = $1_1; HEAP32[$3 + 8 >> 2] = $0_1; return; } $2_1 = 31; if ($0_1 >>> 0 <= 16777215) { $1_1 = Math_clz32($0_1 >>> 8 | 0); $2_1 = ($0_1 >>> 38 - $1_1 & 1 | $1_1 << 1) ^ 62; } HEAP32[$3 + 28 >> 2] = $2_1; HEAP32[$3 + 16 >> 2] = 0; HEAP32[$3 + 20 >> 2] = 0; $4_1 = ($2_1 << 2) + 84280 | 0; block44 : { block43 : { $1_1 = HEAP32[20995]; $7_1 = 1 << $2_1; block42 : { if (!($1_1 & $7_1)) { HEAP32[20995] = $1_1 | $7_1; HEAP32[$4_1 >> 2] = $3; $2_1 = 24; $0_1 = 8; break block42; } $2_1 = $0_1 << (($2_1 | 0) != 31 ? 25 - ($2_1 >>> 1 | 0) | 0 : 0); $4_1 = HEAP32[$4_1 >> 2]; while (1) { $1_1 = $4_1; if ((HEAP32[$1_1 + 4 >> 2] & -8) == ($0_1 | 0)) { break block43 } $4_1 = $2_1 >>> 29 | 0; $2_1 = $2_1 << 1; $7_1 = ($4_1 & 4) + $1_1 | 0; $4_1 = HEAP32[$7_1 + 16 >> 2]; if ($4_1) { continue } break; }; $0_1 = $7_1 + 16 | 0; if ($0_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$0_1 >> 2] = $3; $2_1 = 24; $4_1 = $1_1; $0_1 = 8; } $1_1 = $3; $7_1 = $1_1; break block44; } if ($1_1 >>> 0 < $6_1 >>> 0) { break block1 } $4_1 = HEAP32[$1_1 + 8 >> 2]; if ($4_1 >>> 0 < $6_1 >>> 0) { break block1 } HEAP32[$4_1 + 12 >> 2] = $3; HEAP32[$1_1 + 8 >> 2] = $3; $0_1 = 24; $2_1 = 8; $7_1 = 0; } HEAP32[$2_1 + $3 >> 2] = $4_1; HEAP32[$3 + 12 >> 2] = $1_1; HEAP32[$0_1 + $3 >> 2] = $7_1; $0_1 = HEAP32[21002] - 1 | 0; HEAP32[21002] = $0_1 ? $0_1 : -1; } return; } $2106(); wasm2js_trap(); } function $2114($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; if ($0_1 >>> 0 <= 8) { return $2109($1_1) | 0 } $2_1 = 16; $3 = $0_1 >>> 0 <= 16 ? 16 : $0_1; block1 : { if (!($3 - 1 & $3)) { $0_1 = $3; break block1; } while (1) { $0_1 = $2_1; $2_1 = $0_1 << 1; if ($0_1 >>> 0 < $3 >>> 0) { continue } break; }; } __inlined_func$2115$277 : { if ($1_1 >>> 0 >= -64 - $0_1 >>> 0) { HEAP32[20691] = 48; $1_1 = 0; break __inlined_func$2115$277; } $3 = $1_1 >>> 0 < 11 ? 16 : $1_1 + 11 & -8; $2_1 = $2109(($3 + $0_1 | 0) + 12 | 0); $1_1 = 0; if (!$2_1) { break __inlined_func$2115$277 } $1_1 = $2_1 - 8 | 0; block5 : { if (!($2_1 & $0_1 - 1)) { $0_1 = $1_1; break block5; } $5_1 = $2_1 - 4 | 0; $6_1 = HEAP32[$5_1 >> 2]; $4_1 = $0_1; $0_1 = (($0_1 + $2_1 | 0) - 1 & 0 - $0_1) - 8 | 0; $0_1 = ($0_1 - $1_1 >>> 0 <= 15 ? $4_1 : 0) + $0_1 | 0; $2_1 = $0_1 - $1_1 | 0; $4_1 = ($6_1 & -8) - $2_1 | 0; if (!($6_1 & 3)) { $1_1 = HEAP32[$1_1 >> 2]; HEAP32[$0_1 + 4 >> 2] = $4_1; HEAP32[$0_1 >> 2] = $1_1 + $2_1; break block5; } HEAP32[$0_1 + 4 >> 2] = $4_1 | HEAP32[$0_1 + 4 >> 2] & 1 | 2; $4_1 = $0_1 + $4_1 | 0; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 1; HEAP32[$5_1 >> 2] = $2_1 | HEAP32[$5_1 >> 2] & 1 | 2; $4_1 = $1_1 + $2_1 | 0; HEAP32[$4_1 + 4 >> 2] = HEAP32[$4_1 + 4 >> 2] | 1; $2116($1_1, $2_1); } $1_1 = HEAP32[$0_1 + 4 >> 2]; block7 : { if (!($1_1 & 3)) { break block7 } $2_1 = $1_1 & -8; if ($2_1 >>> 0 <= $3 + 16 >>> 0) { break block7 } HEAP32[$0_1 + 4 >> 2] = $3 | $1_1 & 1 | 2; $1_1 = $0_1 + $3 | 0; $3 = $2_1 - $3 | 0; HEAP32[$1_1 + 4 >> 2] = $3 | 3; $2_1 = $0_1 + $2_1 | 0; HEAP32[$2_1 + 4 >> 2] = HEAP32[$2_1 + 4 >> 2] | 1; $2116($1_1, $3); } $1_1 = $0_1 + 8 | 0; } return $1_1 | 0; } function $2116($0_1, $1_1) { var $2_1 = 0, $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0; $5_1 = $0_1 + $1_1 | 0; block3 : { block2 : { block1 : { $2_1 = HEAP32[$0_1 + 4 >> 2]; if ($2_1 & 1) { $6_1 = HEAP32[20998]; break block1; } if (!($2_1 & 2)) { break block2 } $4_1 = HEAP32[$0_1 >> 2]; $0_1 = $0_1 - $4_1 | 0; $6_1 = HEAP32[20998]; if ($0_1 >>> 0 < $6_1 >>> 0) { break block3 } $1_1 = $1_1 + $4_1 | 0; if (($0_1 | 0) != HEAP32[20999]) { $3 = HEAP32[$0_1 + 12 >> 2]; if ($4_1 >>> 0 <= 255) { $2_1 = HEAP32[$0_1 + 8 >> 2]; $7_1 = ($4_1 & 248) + 84016 | 0; if (($2_1 | 0) != ($7_1 | 0) & (HEAP32[$2_1 + 12 >> 2] != ($0_1 | 0) | $2_1 >>> 0 < $6_1 >>> 0)) { break block3 } if (($2_1 | 0) == ($3 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $4_1 >>> 3 | 0); break block1; } if ((HEAP32[$3 + 8 >> 2] != ($0_1 | 0) | $3 >>> 0 < $6_1 >>> 0) & ($3 | 0) != ($7_1 | 0)) { break block3 } HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; break block1; } $8_1 = HEAP32[$0_1 + 24 >> 2]; block10 : { if (($0_1 | 0) != ($3 | 0)) { $2_1 = HEAP32[$0_1 + 8 >> 2]; if ($2_1 >>> 0 < $6_1 >>> 0 | HEAP32[$2_1 + 12 >> 2] != ($0_1 | 0) | HEAP32[$3 + 8 >> 2] != ($0_1 | 0)) { break block3 } HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; break block10; } block13 : { $4_1 = HEAP32[$0_1 + 20 >> 2]; if ($4_1) { $2_1 = $0_1 + 20 | 0 } else { $4_1 = HEAP32[$0_1 + 16 >> 2]; if (!$4_1) { break block13 } $2_1 = $0_1 + 16 | 0; } while (1) { $7_1 = $2_1; $3 = $4_1; $2_1 = $3 + 20 | 0; $4_1 = HEAP32[$3 + 20 >> 2]; if ($4_1) { continue } $2_1 = $3 + 16 | 0; $4_1 = HEAP32[$3 + 16 >> 2]; if ($4_1) { continue } break; }; if ($6_1 >>> 0 > $7_1 >>> 0) { break block3 } HEAP32[$7_1 >> 2] = 0; break block10; } $3 = 0; } if (!$8_1) { break block1 } $2_1 = HEAP32[$0_1 + 28 >> 2]; $4_1 = $2_1 << 2; block15 : { if (($0_1 | 0) == HEAP32[$4_1 + 84280 >> 2]) { HEAP32[$4_1 + 84280 >> 2] = $3; if ($3) { break block15 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $2_1); break block1; } if ($6_1 >>> 0 > $8_1 >>> 0) { break block3 } block17 : { if (($0_1 | 0) == HEAP32[$8_1 + 16 >> 2]) { HEAP32[$8_1 + 16 >> 2] = $3; break block17; } HEAP32[$8_1 + 20 >> 2] = $3; } if (!$3) { break block1 } } if ($3 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 24 >> 2] = $8_1; $2_1 = HEAP32[$0_1 + 16 >> 2]; if ($2_1) { if ($2_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 16 >> 2] = $2_1; HEAP32[$2_1 + 24 >> 2] = $3; } $2_1 = HEAP32[$0_1 + 20 >> 2]; if (!$2_1) { break block1 } if ($2_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 20 >> 2] = $2_1; HEAP32[$2_1 + 24 >> 2] = $3; break block1; } $2_1 = HEAP32[$5_1 + 4 >> 2]; if (($2_1 & 3) != 3) { break block1 } HEAP32[20996] = $1_1; HEAP32[$5_1 + 4 >> 2] = $2_1 & -2; HEAP32[$0_1 + 4 >> 2] = $1_1 | 1; HEAP32[$5_1 >> 2] = $1_1; return; } if ($5_1 >>> 0 < $6_1 >>> 0) { break block3 } $9_1 = HEAP32[$5_1 + 4 >> 2]; block37 : { if (!($9_1 & 2)) { if (HEAP32[21e3] == ($5_1 | 0)) { HEAP32[21e3] = $0_1; $1_1 = HEAP32[20997] + $1_1 | 0; HEAP32[20997] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1 | 1; if (HEAP32[20999] != ($0_1 | 0)) { break block2 } HEAP32[20996] = 0; HEAP32[20999] = 0; return; } $10_1 = HEAP32[20999]; if (($10_1 | 0) == ($5_1 | 0)) { HEAP32[20999] = $0_1; $1_1 = HEAP32[20996] + $1_1 | 0; HEAP32[20996] = $1_1; HEAP32[$0_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + $1_1 >> 2] = $1_1; return; } $3 = HEAP32[$5_1 + 12 >> 2]; block25 : { if ($9_1 >>> 0 <= 255) { $2_1 = HEAP32[$5_1 + 8 >> 2]; $4_1 = ($9_1 & 248) + 84016 | 0; if (($2_1 | 0) != ($4_1 | 0) & (($5_1 | 0) != HEAP32[$2_1 + 12 >> 2] | $2_1 >>> 0 < $6_1 >>> 0)) { break block3 } if (($2_1 | 0) == ($3 | 0)) { HEAP32[20994] = HEAP32[20994] & __wasm_rotl_i32(-2, $9_1 >>> 3 | 0); break block25; } if ((($5_1 | 0) != HEAP32[$3 + 8 >> 2] | $3 >>> 0 < $6_1 >>> 0) & ($3 | 0) != ($4_1 | 0)) { break block3 } HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; break block25; } $8_1 = HEAP32[$5_1 + 24 >> 2]; block28 : { if (($3 | 0) != ($5_1 | 0)) { $2_1 = HEAP32[$5_1 + 8 >> 2]; if ($2_1 >>> 0 < $6_1 >>> 0 | ($5_1 | 0) != HEAP32[$2_1 + 12 >> 2] | ($5_1 | 0) != HEAP32[$3 + 8 >> 2]) { break block3 } HEAP32[$2_1 + 12 >> 2] = $3; HEAP32[$3 + 8 >> 2] = $2_1; break block28; } block31 : { $4_1 = HEAP32[$5_1 + 20 >> 2]; if ($4_1) { $2_1 = $5_1 + 20 | 0 } else { $4_1 = HEAP32[$5_1 + 16 >> 2]; if (!$4_1) { break block31 } $2_1 = $5_1 + 16 | 0; } while (1) { $7_1 = $2_1; $3 = $4_1; $2_1 = $3 + 20 | 0; $4_1 = HEAP32[$3 + 20 >> 2]; if ($4_1) { continue } $2_1 = $3 + 16 | 0; $4_1 = HEAP32[$3 + 16 >> 2]; if ($4_1) { continue } break; }; if ($6_1 >>> 0 > $7_1 >>> 0) { break block3 } HEAP32[$7_1 >> 2] = 0; break block28; } $3 = 0; } if (!$8_1) { break block25 } $2_1 = HEAP32[$5_1 + 28 >> 2]; $4_1 = $2_1 << 2; block33 : { if (HEAP32[$4_1 + 84280 >> 2] == ($5_1 | 0)) { HEAP32[$4_1 + 84280 >> 2] = $3; if ($3) { break block33 } HEAP32[20995] = HEAP32[20995] & __wasm_rotl_i32(-2, $2_1); break block25; } if ($6_1 >>> 0 > $8_1 >>> 0) { break block3 } block35 : { if (HEAP32[$8_1 + 16 >> 2] == ($5_1 | 0)) { HEAP32[$8_1 + 16 >> 2] = $3; break block35; } HEAP32[$8_1 + 20 >> 2] = $3; } if (!$3) { break block25 } } if ($3 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 24 >> 2] = $8_1; $2_1 = HEAP32[$5_1 + 16 >> 2]; if ($2_1) { if ($2_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 16 >> 2] = $2_1; HEAP32[$2_1 + 24 >> 2] = $3; } $2_1 = HEAP32[$5_1 + 20 >> 2]; if (!$2_1) { break block25 } if ($2_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$3 + 20 >> 2] = $2_1; HEAP32[$2_1 + 24 >> 2] = $3; } $1_1 = ($9_1 & -8) + $1_1 | 0; HEAP32[$0_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + $1_1 >> 2] = $1_1; if (($0_1 | 0) != ($10_1 | 0)) { break block37 } HEAP32[20996] = $1_1; return; } HEAP32[$5_1 + 4 >> 2] = $9_1 & -2; HEAP32[$0_1 + 4 >> 2] = $1_1 | 1; HEAP32[$0_1 + $1_1 >> 2] = $1_1; } if ($1_1 >>> 0 <= 255) { $2_1 = ($1_1 & 248) + 84016 | 0; $3 = HEAP32[20994]; $1_1 = 1 << ($1_1 >>> 3); block40 : { if (!($3 & $1_1)) { HEAP32[20994] = $1_1 | $3; $1_1 = $2_1; break block40; } $1_1 = HEAP32[$2_1 + 8 >> 2]; if ($6_1 >>> 0 > $1_1 >>> 0) { break block3 } } HEAP32[$2_1 + 8 >> 2] = $0_1; HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 12 >> 2] = $2_1; HEAP32[$0_1 + 8 >> 2] = $1_1; return; } $3 = 31; if ($1_1 >>> 0 <= 16777215) { $2_1 = Math_clz32($1_1 >>> 8 | 0); $3 = ($1_1 >>> 38 - $2_1 & 1 | $2_1 << 1) ^ 62; } HEAP32[$0_1 + 28 >> 2] = $3; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; $2_1 = ($3 << 2) + 84280 | 0; block44 : { $4_1 = HEAP32[20995]; $7_1 = 1 << $3; block43 : { if (!($4_1 & $7_1)) { HEAP32[20995] = $4_1 | $7_1; HEAP32[$2_1 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $2_1; break block43; } $3 = $1_1 << (($3 | 0) != 31 ? 25 - ($3 >>> 1 | 0) | 0 : 0); $2_1 = HEAP32[$2_1 >> 2]; while (1) { $4_1 = $2_1; if ((HEAP32[$2_1 + 4 >> 2] & -8) == ($1_1 | 0)) { break block44 } $2_1 = $3 >>> 29 | 0; $3 = $3 << 1; $7_1 = $4_1 + ($2_1 & 4) | 0; $2_1 = HEAP32[$7_1 + 16 >> 2]; if ($2_1) { continue } break; }; $1_1 = $7_1 + 16 | 0; if ($1_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$1_1 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = $4_1; } HEAP32[$0_1 + 12 >> 2] = $0_1; HEAP32[$0_1 + 8 >> 2] = $0_1; return; } if ($4_1 >>> 0 < $6_1 >>> 0) { break block3 } $1_1 = HEAP32[$4_1 + 8 >> 2]; if ($1_1 >>> 0 < $6_1 >>> 0) { break block3 } HEAP32[$1_1 + 12 >> 2] = $0_1; HEAP32[$4_1 + 8 >> 2] = $0_1; HEAP32[$0_1 + 24 >> 2] = 0; HEAP32[$0_1 + 12 >> 2] = $4_1; HEAP32[$0_1 + 8 >> 2] = $1_1; } return; } $2106(); wasm2js_trap(); } function $2117($0_1) { var $1_1 = 0; $1_1 = __wasm_i64_mul(1, 0, $0_1, 0); $1_1 = ($0_1 | 1) >>> 0 < 65536 ? $1_1 : i64toi32_i32$HIGH_BITS ? -1 : $1_1; $0_1 = $2109($1_1); if (!(!$0_1 | !(HEAPU8[$0_1 - 4 | 0] & 3))) { $2027($0_1, $1_1) } return $0_1; } function $2119($0_1) { var $1_1 = 0, $2_1 = 0, $3 = 0; block1 : { $0_1 = $0_1 + 7 | 0; $1_1 = $0_1 >>> 0 < 7; $2_1 = $1_1 + 1 | 0; $3 = $1_1; $1_1 = HEAP32[20557]; $0_1 = $1_1 + ($0_1 & -8) | 0; if (!($1_1 >>> 0 > $0_1 >>> 0 ? $2_1 : $3)) { if ($0_1 >>> 0 <= __wasm_memory_size() << 16 >>> 0) { break block1 } if (fimport$29($0_1 | 0) | 0) { break block1 } } HEAP32[20691] = 48; return -1; } HEAP32[20557] = $0_1; return $1_1; } function $2120() { global$2 = 5327360; global$1 = 84480; } function $2121() { return global$0 - global$1 | 0; } function $2122() { return global$2 | 0; } function $2123() { return global$1 | 0; } function $2124($0_1) { $0_1 = $0_1 | 0; } function $2126($0_1) { $0_1 = $0_1 | 0; if (global$4 >>> 0 < $0_1 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; } function $2127($0_1) { $0_1 = $0_1 | 0; $0_1 = global$0 - $0_1 & -16; if ($0_1 >>> 0 > global$4 >>> 0 | global$5 >>> 0 > $0_1 >>> 0) { fimport$30($0_1 | 0) } global$0 = $0_1; return $0_1 | 0; } function $2128() { return global$0 | 0; } function $2129($0_1) { $0_1 = $0_1 | 0; var $1_1 = 0, $2_1 = 0, $3 = 0; if (!$0_1) { if (HEAP32[20518]) { $1_1 = $2129(HEAP32[20518]) } if (HEAP32[20556]) { $1_1 = $2129(HEAP32[20556]) | $1_1 } $0_1 = HEAP32[20991]; if ($0_1) { while (1) { if (HEAP32[$0_1 + 20 >> 2] != HEAP32[$0_1 + 28 >> 2]) { $1_1 = $2129($0_1) | $1_1 } $0_1 = HEAP32[$0_1 + 56 >> 2]; if ($0_1) { continue } break; } } return $1_1 | 0; } $3 = HEAP32[$0_1 + 76 >> 2] < 0; block12 : { block10 : { if (HEAP32[$0_1 + 20 >> 2] == HEAP32[$0_1 + 28 >> 2]) { break block10 } FUNCTION_TABLE[HEAP32[$0_1 + 36 >> 2]]($0_1, 0, 0) | 0; if (HEAP32[$0_1 + 20 >> 2]) { break block10 } $1_1 = -1; break block12; } $1_1 = HEAP32[$0_1 + 8 >> 2]; $2_1 = HEAP32[$0_1 + 4 >> 2]; if (($1_1 | 0) != ($2_1 | 0)) { $1_1 = $2_1 - $1_1 | 0; FUNCTION_TABLE[HEAP32[$0_1 + 40 >> 2]]($0_1, $1_1, $1_1 >> 31, 1) | 0; } $1_1 = 0; HEAP32[$0_1 + 28 >> 2] = 0; HEAP32[$0_1 + 16 >> 2] = 0; HEAP32[$0_1 + 20 >> 2] = 0; HEAP32[$0_1 + 4 >> 2] = 0; HEAP32[$0_1 + 8 >> 2] = 0; if ($3) { break block12 } } return $1_1 | 0; } function $2130($0_1, $1_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; global$4 = $0_1; global$5 = $1_1; } function $2138($0_1, $1_1, $2_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $240($0_1, $1_1, $2_1); } function $2139($0_1, $1_1, $2_1, $3, $4_1, $5_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; return FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3, $4_1, $5_1) | 0; } function $2140($0_1, $1_1, $2_1, $3) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; return FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3) | 0; } function $2142($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; return FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3, $4_1) | 0; } function $2143($0_1, $1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; $5_1 = $5_1 | 0; $6_1 = $6_1 | 0; $7_1 = $7_1 | 0; return FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3, $4_1, $5_1, $6_1, $7_1) | 0; } function $2144($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3, $4_1); } function $2145($0_1, $1_1, $2_1, $3, $4_1) { $0_1 = $0_1 | 0; $1_1 = $1_1 | 0; $2_1 = $2_1 | 0; $3 = $3 | 0; $4_1 = $4_1 | 0; return FUNCTION_TABLE[$0_1 | 0]($1_1, $2_1, $3, $4_1) | 0; } function _ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0, $10_1 = 0, $11_1 = 0, $12_1 = 0, $13_1 = 0, $14 = 0; label$1 : { label$2 : { label$3 : { label$4 : { label$5 : { label$6 : { label$7 : { label$8 : { label$9 : { label$11 : { $4_1 = $1_1; if ($4_1) { if (!$2_1) { break label$11 } if (!$3) { break label$9 } $4_1 = Math_clz32($3) - Math_clz32($4_1) | 0; if ($4_1 >>> 0 <= 31) { break label$8 } break label$2; } if (($3 | 0) == 1 | $3 >>> 0 > 1) { break label$2 } $1_1 = ($0_1 >>> 0) / ($2_1 >>> 0) | 0; __wasm_intrinsics_temp_i64 = $0_1 - Math_imul($1_1, $2_1) | 0; __wasm_intrinsics_temp_i64$hi = 0; i64toi32_i32$HIGH_BITS = 0; return $1_1; } if (!$0_1) { break label$7 } if (!$3) { break label$6 } $5_1 = $3 - 1 | 0; if ($5_1 & $3) { break label$6 } __wasm_intrinsics_temp_i64 = $0_1; __wasm_intrinsics_temp_i64$hi = $4_1 & $5_1; $0_1 = $4_1 >>> __wasm_ctz_i32($3) | 0; i64toi32_i32$HIGH_BITS = 0; return $0_1; } $5_1 = $2_1 - 1 | 0; if (!($5_1 & $2_1)) { break label$5 } $10_1 = (Math_clz32($2_1) + 33 | 0) - Math_clz32($4_1) | 0; $6_1 = 0 - $10_1 | 0; break label$3; } $10_1 = $4_1 + 1 | 0; $6_1 = 63 - $4_1 | 0; break label$3; } __wasm_intrinsics_temp_i64 = 0; $0_1 = ($4_1 >>> 0) / ($3 >>> 0) | 0; __wasm_intrinsics_temp_i64$hi = $4_1 - Math_imul($0_1, $3) | 0; i64toi32_i32$HIGH_BITS = 0; return $0_1; } $4_1 = Math_clz32($3) - Math_clz32($4_1) | 0; if ($4_1 >>> 0 < 31) { break label$4 } break label$2; } __wasm_intrinsics_temp_i64 = $0_1 & $5_1; __wasm_intrinsics_temp_i64$hi = 0; if (($2_1 | 0) == 1) { break label$1 } $2_1 = __wasm_ctz_i32($2_1); $3 = $2_1 & 31; if (($2_1 & 63) >>> 0 >= 32) { $4_1 = 0; $0_1 = $1_1 >>> $3 | 0; } else { $4_1 = $1_1 >>> $3 | 0; $0_1 = ((1 << $3) - 1 & $1_1) << 32 - $3 | $0_1 >>> $3; } i64toi32_i32$HIGH_BITS = $4_1; return $0_1; } $10_1 = $4_1 + 1 | 0; $6_1 = 63 - $4_1 | 0; } $5_1 = $0_1; $4_1 = $10_1 & 63; $7_1 = $4_1 & 31; if (($4_1 & 63) >>> 0 >= 32) { $4_1 = 0; $5_1 = $1_1 >>> $7_1 | 0; } else { $4_1 = $1_1 >>> $7_1 | 0; $5_1 = ((1 << $7_1) - 1 & $1_1) << 32 - $7_1 | $5_1 >>> $7_1; } $7_1 = $6_1 & 63; $6_1 = $0_1; $8_1 = $7_1 & 31; if (($7_1 & 63) >>> 0 >= 32) { $9_1 = $0_1 << $8_1; $0_1 = 0; } else { $9_1 = (1 << $8_1) - 1 & $6_1 >>> 32 - $8_1 | $1_1 << $8_1; $0_1 = $6_1 << $8_1; } $1_1 = $9_1; if ($10_1) { $6_1 = $3 - 1 | 0; $11_1 = $2_1 - 1 | 0; $6_1 = ($11_1 | 0) != -1 ? $6_1 + 1 | 0 : $6_1; $7_1 = $11_1; while (1) { $4_1 = $4_1 << 1 | $5_1 >>> 31; $5_1 = $5_1 << 1 | $1_1 >>> 31; $11_1 = $4_1; $8_1 = $6_1 - ($4_1 + ($5_1 >>> 0 > $7_1 >>> 0) | 0) | 0; $12_1 = $8_1 >> 31; $9_1 = $12_1; $4_1 = $5_1; $8_1 = $2_1 & $9_1; $5_1 = $4_1 - $8_1 | 0; $4_1 = $11_1 - (($3 & $9_1) + ($4_1 >>> 0 < $8_1 >>> 0) | 0) | 0; $9_1 = $1_1 << 1 | $0_1 >>> 31; $0_1 = $13_1 | $0_1 << 1; $1_1 = $9_1 | $14; $11_1 = $12_1 & 1; $13_1 = $11_1; $10_1 = $10_1 - 1 | 0; if ($10_1) { continue } break; }; } __wasm_intrinsics_temp_i64 = $5_1; __wasm_intrinsics_temp_i64$hi = $4_1; $9_1 = $1_1 << 1 | $0_1 >>> 31; $0_1 = $11_1 | $0_1 << 1; i64toi32_i32$HIGH_BITS = $9_1 | $14; return $0_1; } __wasm_intrinsics_temp_i64 = $0_1; __wasm_intrinsics_temp_i64$hi = $1_1; $0_1 = 0; $1_1 = 0; } i64toi32_i32$HIGH_BITS = $1_1; return $0_1; } function __wasm_ctz_i32($0_1) { if ($0_1) { return 31 - Math_clz32($0_1 - 1 ^ $0_1) | 0 } return 32; } function __wasm_i64_mul($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0, $8_1 = 0, $9_1 = 0; $4_1 = $2_1 >>> 16 | 0; $5_1 = $0_1 >>> 16 | 0; $9_1 = Math_imul($4_1, $5_1); $6_1 = $2_1 & 65535; $7_1 = $0_1 & 65535; $8_1 = Math_imul($6_1, $7_1); $5_1 = ($8_1 >>> 16 | 0) + Math_imul($5_1, $6_1) | 0; $4_1 = ($5_1 & 65535) + Math_imul($4_1, $7_1) | 0; i64toi32_i32$HIGH_BITS = (Math_imul($1_1, $2_1) + $9_1 | 0) + Math_imul($0_1, $3) + ($5_1 >>> 16) + ($4_1 >>> 16) | 0; return $8_1 & 65535 | $4_1 << 16; } function __wasm_i64_sdiv($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0, $7_1 = 0; $5_1 = $1_1 ^ $3; $6_1 = $5_1 >> 31; $4_1 = $1_1 >> 31; $0_1 = $0_1 ^ $4_1; $7_1 = $0_1 - $4_1 | 0; $4_1 = ($1_1 ^ $4_1) - (($0_1 >>> 0 < $4_1 >>> 0) + $4_1 | 0) | 0; $0_1 = $3 >> 31; $1_1 = $2_1 ^ $0_1; $5_1 = $5_1 >> 31; $0_1 = __wasm_i64_udiv($7_1, $4_1, $1_1 - $0_1 | 0, ($0_1 ^ $3) - (($0_1 >>> 0 > $1_1 >>> 0) + $0_1 | 0) | 0) ^ $5_1; $1_1 = $0_1 - $5_1 | 0; i64toi32_i32$HIGH_BITS = ($6_1 ^ i64toi32_i32$HIGH_BITS) - (($0_1 >>> 0 < $5_1 >>> 0) + $6_1 | 0) | 0; return $1_1; } function __wasm_i64_srem($0_1, $1_1, $2_1, $3) { var $4_1 = 0, $5_1 = 0, $6_1 = 0; $4_1 = $1_1 >> 31; $0_1 = $0_1 ^ $4_1; $5_1 = $0_1 - $4_1 | 0; $6_1 = ($1_1 ^ $4_1) - (($0_1 >>> 0 < $4_1 >>> 0) + $4_1 | 0) | 0; $1_1 = $3 >> 31; $0_1 = $1_1 ^ $2_1; $1_1 = __wasm_i64_urem($5_1, $6_1, $0_1 - $1_1 | 0, ($1_1 ^ $3) - (($0_1 >>> 0 < $1_1 >>> 0) + $1_1 | 0) | 0) ^ $4_1; $0_1 = $1_1 - $4_1 | 0; i64toi32_i32$HIGH_BITS = ($4_1 ^ i64toi32_i32$HIGH_BITS) - (($1_1 >>> 0 < $4_1 >>> 0) + $4_1 | 0) | 0; return $0_1; } function __wasm_i64_udiv($0_1, $1_1, $2_1, $3) { $0_1 = _ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E($0_1, $1_1, $2_1, $3); return $0_1; } function __wasm_i64_urem($0_1, $1_1, $2_1, $3) { _ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E($0_1, $1_1, $2_1, $3); i64toi32_i32$HIGH_BITS = __wasm_intrinsics_temp_i64$hi; return __wasm_intrinsics_temp_i64; } function __wasm_rotl_i32($0_1, $1_1) { var $2_1 = 0, $3 = 0; $2_1 = $1_1 & 31; $3 = (-1 >>> $2_1 & $0_1) << $2_1; $2_1 = $0_1; $0_1 = 0 - $1_1 & 31; return $3 | ($2_1 & -1 << $0_1) >>> $0_1; } function __wasm_rotl_i64($0_1, $1_1, $2_1) { var $3 = 0, $4_1 = 0, $5_1 = 0, $6_1 = 0; $6_1 = $2_1 & 63; $5_1 = $6_1; $4_1 = $5_1 & 31; if ($5_1 >>> 0 >= 32) { $5_1 = -1 >>> $4_1 | 0 } else { $3 = -1 >>> $4_1 | 0; $5_1 = $3 | (1 << $4_1) - 1 << 32 - $4_1; } $5_1 = $5_1 & $0_1; $3 = $1_1 & $3; $4_1 = $6_1 & 31; if ($6_1 >>> 0 >= 32) { $3 = $5_1 << $4_1; $6_1 = 0; } else { $3 = (1 << $4_1) - 1 & $5_1 >>> 32 - $4_1 | $3 << $4_1; $6_1 = $5_1 << $4_1; } $5_1 = $3; $4_1 = 0 - $2_1 & 63; $3 = $4_1 & 31; if ($4_1 >>> 0 >= 32) { $3 = -1 << $3; $2_1 = 0; } else { $2_1 = -1 << $3; $3 = $2_1 | (1 << $3) - 1 & -1 >>> 32 - $3; } $0_1 = $2_1 & $0_1; $1_1 = $1_1 & $3; $3 = $4_1 & 31; if ($4_1 >>> 0 >= 32) { $2_1 = 0; $0_1 = $1_1 >>> $3 | 0; } else { $2_1 = $1_1 >>> $3 | 0; $0_1 = ((1 << $3) - 1 & $1_1) << 32 - $3 | $0_1 >>> $3; } $0_1 = $0_1 | $6_1; i64toi32_i32$HIGH_BITS = $2_1 | $5_1; return $0_1; } // EMSCRIPTEN_END_FUNCS ; bufferView = HEAPU8; initActiveSegments(imports); var FUNCTION_TABLE = Table([null, $24, $259, $690, $706, $136, $509, $510, $245, $249, $336, $912, $913, $914, $392, $405, $407, $408, $397, $376, $508, $511, $158, $599, $600, $601, $602, $603, $604, $605, $782, $780, $731, $756, $757, $811, $812, $813, $1161, $1216, $1217, $1202, $385, $1152, $358, $1105, $480, $1021, $1022, $1027, $1028, $1029, $10, $1038, $1047, $1049, $1062, $789, $1084, $1085, $1090, $1260, $1203, $1204, $1259, $480, $1248, $1249, $1250, $1311, $1312, $1207, $1272, $1310, $1059, $1226, $1227, $1391, $1392, $1383, $1384, $11, $1148, $1186, $1229, $1230, $1231, $1245, $1251, $1317, $1318, $1325, $1361, $1360, $1372, $1401, $1462, $1463, $1474, $1475, $1479, $1586, $1633, $1634, $1638, $1639, $1683, $1684, $1692, $1693, $1688, $1676, $1715, $1716, $1720, $1837, $1857, $1843, $1844, $1847, $1849, $1851, $1852, $1854, $1861, $69, $80, $81, $82, $84, $85, $86, $88, $87, $89, $90, $91, $444, $487, $488, $445, $449, $450, $452, $454, $455, $456, $446, $459, $460, $463, $465, $466, $470, $245, $473, $474, $475, $476, $1965, $1952, $1995, $2068, $1991, $1994, $1989, $2061, $2105, $1987, $2094, $477, $2015, $2063, $1988, $2000, $2032, $2033, $478, $2062, $2012, $479, $480, $480, $482, $483, $485, $484, $486, $489, $490, $491, $492, $480, $494, $495, $496, $497, $498, $499, $500, $524, $525, $526, $527, $528, $529, $530, $531, $532, $533, $534, $554, $556, $557, $558, $480, $560, $837, $838, $839, $840, $841, $843, $844, $845, $846, $847, $1394, $1396, $1400, $1402, $1403, $1405, $1406, $1407, $1408, $1410, $1411, $1412, $1414, $1415, $1416, $1417, $1418, $1419, $1420, $1421, $1422, $1423, $1424, $1425, $1426, $1427, $1428, $1429, $1431, $1432, $1433, $1434, $1435, $1436, $1437, $1438, $1439, $1440, $1441, $1442, $1443, $1444, $1448, $1449, $1450, $1451, $1452, $1453, $1454, $1455, $1456, $1457, $1458, $1459, $1460, $1473, $1476, $1477, $1478, $1481, $1482, $1483, $1484, $1485, $1486, $1487, $1488, $1489, $1487, $1491, $1489, $1493, $1494, $1495, $1496, $1497, $1498, $1499, $1500, $1501, $245, $1503, $1504, $1505, $1508, $1509, $1511, $1513, $1515, $1517, $1518, $1519, $1520, $1528, $1534, $1539, $1541, $1546, $1553, $1556, $1558, $1560, $1562, $1563, $1564, $1565, $1566, $1567, $1569, $1570, $1571, $1572, $1574, $1605, $1606, $1607, $1608, $1609, $1610, $245, $1612, $1613, $1614, $1617, $1619, $1620, $1623, $1625, $1626, $1616, $1628, $1631, $1636, $1637, $1724, $1726, $1727, $1728, $1729, $1731, $1732, $1734, $1745, $1748, $1749, $1751, $1752, $1767, $1769, $1610, $1771, $1773, $1774, $1775, $1776, $1777, $1778, $1779, $1644, $1646, $1647, $1648, $1649, $1653, $1656, $1657, $1658, $1659, $1662, $1665, $1669, $1670, $1671, $1704, $839, $1706, $1648, $1708, $1709, $839, $1706, $1648, $1713, $1834, $1842, $1845, $1846, $1863, $1864, $1865, $1866, $1867, $1869, $1870, $1871, $1872, $1873, $1874, $1875, $1876, $1877, $1878, $1880, $1881, $1884, $1885, $1887, $1888, $1936, $1937, $1940, $1950, $1890, $1891, $1892, $1893, $1894, $1895, $1896, $1897, $1900, $1901, $1902, $1903, $1904, $1905, $1906, $1907, $1908, $1909, $1910, $1911, $1912, $1913, $1914, $1915, $1916, $1917, $1918, $1919, $1920, $1921, $1922, $1923, $1924, $1925, $1927, $1929, $1930, $1931, $1932, $1933, $1934, $1935, $1939, $1943, $1945, $1946, $2060, $1610, $2069, $2071, $2107, $2108]); function __wasm_memory_size() { return buffer.byteLength / 65536 | 0; } return { "memory": Object.create(Object.prototype, { "grow": { }, "buffer": { "get": function () { return buffer; } } }), "__wasm_call_ctors": $0, "__indirect_function_table": FUNCTION_TABLE, "sqlite3_free": $24, "sqlite3_value_text": $53, "sqlite3_prepare_v2": $93, "sqlite3_step": $94, "sqlite3_reset": $96, "sqlite3_exec": $97, "sqlite3_finalize": $100, "sqlite3_column_name": $123, "sqlite3_column_text": $124, "sqlite3_column_type": $125, "sqlite3_errmsg": $127, "sqlite3_clear_bindings": $203, "sqlite3_value_blob": $206, "sqlite3_value_bytes": $209, "sqlite3_value_double": $213, "sqlite3_value_int": $215, "sqlite3_value_type": $221, "sqlite3_result_blob": $225, "sqlite3_result_double": $233, "sqlite3_result_error": $235, "sqlite3_result_int": $238, "sqlite3_result_int64": $2138, "sqlite3_result_null": $241, "sqlite3_result_text": $246, "sqlite3_aggregate_context": $266, "sqlite3_column_count": $271, "sqlite3_data_count": $272, "sqlite3_column_blob": $273, "sqlite3_column_bytes": $274, "sqlite3_column_double": $275, "sqlite3_bind_blob": $278, "sqlite3_bind_double": $281, "sqlite3_bind_int": $282, "sqlite3_bind_text": $285, "sqlite3_bind_parameter_index": $289, "sqlite3_sql": $293, "sqlite3_normalized_sql": $297, "sqlite3_changes": $379, "sqlite3_close_v2": $384, "sqlite3_create_function_v2": $389, "sqlite3_update_hook": $396, "sqlite3_open": $403, "strerror": $2079, "malloc": $2109, "free": $2111, "RegisterExtensionFunctions": $1889, "fflush": $2129, "emscripten_stack_get_end": $2123, "emscripten_stack_get_base": $2122, "emscripten_builtin_memalign": $2114, "_emscripten_tempret_set": $2124, "emscripten_stack_init": $2120, "emscripten_stack_get_free": $2121, "_emscripten_stack_restore": $2126, "_emscripten_stack_alloc": $2127, "emscripten_stack_get_current": $2128, "__set_stack_limits": $2130, "dynCall_iiiij": $2139, "dynCall_iij": $2140, "dynCall_iijii": $2139, "dynCall_iiji": $2142, "dynCall_iiiiiij": $2143, "dynCall_viji": $2144, "dynCall_jiji": $2145 }; } return asmFunc(info); } )(info); }, instantiate: /** @suppress{checkTypes} */ function(binary, info) { return { then: function(ok) { var module = new WebAssembly.Module(binary); ok({ 'instance': new WebAssembly.Instance(module, info) }); // Emulate a simple WebAssembly.instantiate(..).then(()=>{}).catch(()=>{}) syntax. return { catch: function() {} }; } }; }, RuntimeError: Error, isWasm2js: true, }; // end include: wasm2js.js if (WebAssembly.isWasm2js) { // We don't need to actually download a wasm binary, mark it as present but // empty. wasmBinary = []; } if (!globalThis.WebAssembly) { err('no native wasm support detected'); } // Wasm globals //======================================== // Runtime essentials //======================================== // whether we are quitting the application. no code should run after this. // set in exit() and abort() var ABORT = false; // set by exit() and abort(). Passed to 'onExit' handler. // NOTE: This is also used as the process return code in shell environments // but only when noExitRuntime is false. var EXITSTATUS; // In STRICT mode, we only define assert() when ASSERTIONS is set. i.e. we // don't define it at all in release modes. This matches the behaviour of // MINIMAL_RUNTIME. // TODO(sbc): Make this the default even without STRICT enabled. /** @type {function(*, string=)} */ function assert(condition, text) { if (!condition) { abort('Assertion failed' + (text ? ': ' + text : '')); } } // We used to include malloc/free by default in the past. Show a helpful error in // builds with assertions. /** * Indicates whether filename is delivered via file protocol (as opposed to http/https) * @noinline */ var isFileURI = (filename) => filename.startsWith('file://'); // include: runtime_common.js // include: runtime_stack_check.js // Initializes the stack cookie. Called at the startup of main and at the startup of each thread in pthreads mode. function writeStackCookie() { var max = _emscripten_stack_get_end(); assert((max & 3) == 0); // If the stack ends at address zero we write our cookies 4 bytes into the // stack. This prevents interference with SAFE_HEAP and ASAN which also // monitor writes to address zero. if (max == 0) { max += 4; } // The stack grow downwards towards _emscripten_stack_get_end. // We write cookies to the final two words in the stack and detect if they are // ever overwritten. HEAPU32[((max)>>2)] = 0x02135467;checkInt32(0x02135467); HEAPU32[(((max)+(4))>>2)] = 0x89BACDFE;checkInt32(0x89BACDFE); // Also test the global address 0 for integrity. HEAPU32[((0)>>2)] = 1668509029;checkInt32(1668509029); } function checkStackCookie() { if (ABORT) return; var max = _emscripten_stack_get_end(); // See writeStackCookie(). if (max == 0) { max += 4; } var cookie1 = HEAPU32[((max)>>2)]; var cookie2 = HEAPU32[(((max)+(4))>>2)]; if (cookie1 != 0x02135467 || cookie2 != 0x89BACDFE) { abort(`Stack overflow! Stack cookie has been overwritten at ${ptrToString(max)}, expected hex dwords 0x89BACDFE and 0x2135467, but received ${ptrToString(cookie2)} ${ptrToString(cookie1)}`); } // Also test the global address 0 for integrity. if (HEAPU32[((0)>>2)] != 0x63736d65 /* 'emsc' */) { abort('Runtime error: The application has corrupted its heap memory area (address zero)!'); } } // end include: runtime_stack_check.js // include: runtime_exceptions.js // end include: runtime_exceptions.js // include: runtime_debug.js var runtimeDebug = true; // Switch to false at runtime to disable logging at the right times // Used by XXXXX_DEBUG settings to output debug messages. function dbg(...args) { if (!runtimeDebug && typeof runtimeDebug != 'undefined') return; // TODO(sbc): Make this configurable somehow. Its not always convenient for // logging to show up as warnings. console.warn(...args); } // Endianness check (() => { var h16 = new Int16Array(1); var h8 = new Int8Array(h16.buffer); h16[0] = 0x6373; if (h8[0] !== 0x73 || h8[1] !== 0x63) abort('Runtime error: expected the system to be little-endian! (Run with -sSUPPORT_BIG_ENDIAN to bypass)'); })(); function consumedModuleProp(prop) { if (!Object.getOwnPropertyDescriptor(Module, prop)) { Object.defineProperty(Module, prop, { configurable: true, set() { abort(`Attempt to set \`Module.${prop}\` after it has already been processed. This can happen, for example, when code is injected via '--post-js' rather than '--pre-js'`); } }); } } function makeInvalidEarlyAccess(name) { return () => assert(false, `call to '${name}' via reference taken before Wasm module initialization`); } function ignoredModuleProp(prop) { if (Object.getOwnPropertyDescriptor(Module, prop)) { abort(`\`Module.${prop}\` was supplied but \`${prop}\` not included in INCOMING_MODULE_JS_API`); } } // forcing the filesystem exports a few things by default function isExportedByForceFilesystem(name) { return name === 'FS_createPath' || name === 'FS_createDataFile' || name === 'FS_createPreloadedFile' || name === 'FS_preloadFile' || name === 'FS_unlink' || name === 'addRunDependency' || // The old FS has some functionality that WasmFS lacks. name === 'FS_createLazyFile' || name === 'FS_createDevice' || name === 'removeRunDependency'; } /** * Intercept access to a symbols in the global symbol. This enables us to give * informative warnings/errors when folks attempt to use symbols they did not * include in their build, or no symbols that no longer exist. * * We don't define this in MODULARIZE mode since in that mode emscripten symbols * are never placed in the global scope. */ function hookGlobalSymbolAccess(sym, func) { if (!Object.getOwnPropertyDescriptor(globalThis, sym)) { Object.defineProperty(globalThis, sym, { configurable: true, get() { func(); return undefined; } }); } } function missingGlobal(sym, msg) { hookGlobalSymbolAccess(sym, () => { warnOnce(`\`${sym}\` is no longer defined by emscripten. ${msg}`); }); } missingGlobal('buffer', 'Please use HEAP8.buffer or wasmMemory.buffer'); missingGlobal('asm', 'Please use wasmExports instead'); function missingLibrarySymbol(sym) { hookGlobalSymbolAccess(sym, () => { // Can't `abort()` here because it would break code that does runtime // checks. e.g. `if (typeof SDL === 'undefined')`. var msg = `\`${sym}\` is a library symbol and not included by default; add it to your library.js __deps or to DEFAULT_LIBRARY_FUNCS_TO_INCLUDE on the command line`; // DEFAULT_LIBRARY_FUNCS_TO_INCLUDE requires the name as it appears in // library.js, which means $name for a JS name with no prefix, or name // for a JS name like _name. var librarySymbol = sym; if (!librarySymbol.startsWith('_')) { librarySymbol = '$' + sym; } msg += ` (e.g. -sDEFAULT_LIBRARY_FUNCS_TO_INCLUDE='${librarySymbol}')`; if (isExportedByForceFilesystem(sym)) { msg += '. Alternatively, forcing filesystem support (-sFORCE_FILESYSTEM) can export this for you'; } warnOnce(msg); }); // Any symbol that is not included from the JS library is also (by definition) // not exported on the Module object. unexportedRuntimeSymbol(sym); } function unexportedRuntimeSymbol(sym) { if (!Object.getOwnPropertyDescriptor(Module, sym)) { Object.defineProperty(Module, sym, { configurable: true, get() { var msg = `'${sym}' was not exported. add it to EXPORTED_RUNTIME_METHODS (see the Emscripten FAQ)`; if (isExportedByForceFilesystem(sym)) { msg += '. Alternatively, forcing filesystem support (-sFORCE_FILESYSTEM) can export this for you'; } abort(msg); }, }); } } var MAX_UINT8 = (2 ** 8) - 1; var MAX_UINT16 = (2 ** 16) - 1; var MAX_UINT32 = (2 ** 32) - 1; var MAX_UINT53 = (2 ** 53) - 1; var MAX_UINT64 = (2 ** 64) - 1; var MIN_INT8 = - (2 ** ( 8 - 1)); var MIN_INT16 = - (2 ** (16 - 1)); var MIN_INT32 = - (2 ** (32 - 1)); var MIN_INT53 = - (2 ** (53 - 1)); var MIN_INT64 = - (2 ** (64 - 1)); function checkInt(value, bits, min, max) { assert(Number.isInteger(Number(value)), `attempt to write non-integer (${value}) into integer heap`); assert(value <= max, `value (${value}) too large to write as ${bits}-bit value`); assert(value >= min, `value (${value}) too small to write as ${bits}-bit value`); } var checkInt1 = (value) => checkInt(value, 1, 1); var checkInt8 = (value) => checkInt(value, 8, MIN_INT8, MAX_UINT8); var checkInt16 = (value) => checkInt(value, 16, MIN_INT16, MAX_UINT16); var checkInt32 = (value) => checkInt(value, 32, MIN_INT32, MAX_UINT32); var checkInt53 = (value) => checkInt(value, 53, MIN_INT53, MAX_UINT53); var checkInt64 = (value) => checkInt(value, 64, MIN_INT64, MAX_UINT64); // end include: runtime_debug.js // Memory management var /** @type {!Int8Array} */ HEAP8, /** @type {!Uint8Array} */ HEAPU8, /** @type {!Int16Array} */ HEAP16, /** @type {!Uint16Array} */ HEAPU16, /** @type {!Int32Array} */ HEAP32, /** @type {!Uint32Array} */ HEAPU32, /** @type {!Float32Array} */ HEAPF32, /** @type {!Float64Array} */ HEAPF64; var runtimeInitialized = false; function updateMemoryViews() { var b = wasmMemory.buffer; HEAP8 = new Int8Array(b); HEAP16 = new Int16Array(b); HEAPU8 = new Uint8Array(b); HEAPU16 = new Uint16Array(b); HEAP32 = new Int32Array(b); HEAPU32 = new Uint32Array(b); HEAPF32 = new Float32Array(b); HEAPF64 = new Float64Array(b); } // include: memoryprofiler.js // end include: memoryprofiler.js // end include: runtime_common.js assert(globalThis.Int32Array && globalThis.Float64Array && Int32Array.prototype.subarray && Int32Array.prototype.set, 'JS engine does not provide full typed array support'); function preRun() { if (Module['preRun']) { if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']]; while (Module['preRun'].length) { addOnPreRun(Module['preRun'].shift()); } } consumedModuleProp('preRun'); // Begin ATPRERUNS hooks callRuntimeCallbacks(onPreRuns); // End ATPRERUNS hooks } function initRuntime() { assert(!runtimeInitialized); runtimeInitialized = true; setStackLimits(); checkStackCookie(); // Begin ATINITS hooks if (!Module['noFSInit'] && !FS.initialized) FS.init(); TTY.init(); // End ATINITS hooks wasmExports['__wasm_call_ctors'](); // Begin ATPOSTCTORS hooks FS.ignorePermissions = false; // End ATPOSTCTORS hooks } function postRun() { checkStackCookie(); // PThreads reuse the runtime from the main thread. if (Module['postRun']) { if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']]; while (Module['postRun'].length) { addOnPostRun(Module['postRun'].shift()); } } consumedModuleProp('postRun'); // Begin ATPOSTRUNS hooks callRuntimeCallbacks(onPostRuns); // End ATPOSTRUNS hooks } /** @param {string|number=} what */ function abort(what) { Module['onAbort']?.(what); what = 'Aborted(' + what + ')'; // TODO(sbc): Should we remove printing and leave it up to whoever // catches the exception? err(what); ABORT = true; // Use a wasm runtime error, because a JS error might be seen as a foreign // exception, which means we'd run destructors on it. We need the error to // simply make the program stop. // FIXME This approach does not work in Wasm EH because it currently does not assume // all RuntimeErrors are from traps; it decides whether a RuntimeError is from // a trap or not based on a hidden field within the object. So at the moment // we don't have a way of throwing a wasm trap from JS. TODO Make a JS API that // allows this in the wasm spec. // Suppress closure compiler warning here. Closure compiler's builtin extern // definition for WebAssembly.RuntimeError claims it takes no arguments even // though it can. // TODO(https://github.com/google/closure-compiler/pull/3913): Remove if/when upstream closure gets fixed. /** @suppress {checkTypes} */ var e = new WebAssembly.RuntimeError(what); // Throw the error whether or not MODULARIZE is set because abort is used // in code paths apart from instantiation where an exception is expected // to be thrown when abort is called. throw e; } function createExportWrapper(name, nargs) { return (...args) => { assert(runtimeInitialized, `native function \`${name}\` called before runtime initialization`); var f = wasmExports[name]; assert(f, `exported native function \`${name}\` not found`); // Only assert for too many arguments. Too few can be valid since the missing arguments will be zero filled. assert(args.length <= nargs, `native function \`${name}\` called with ${args.length} args but expects ${nargs}`); return f(...args); }; } var wasmBinaryFile; // When building with wasm2js these 3 functions all no-ops. function findWasmBinary(file) {} function getBinarySync(file) {} function getWasmBinary(file) {} async function instantiateArrayBuffer(binaryFile, imports) { try { var binary = await getWasmBinary(binaryFile); var instance = await WebAssembly.instantiate(binary, imports); return instance; } catch (reason) { err(`failed to asynchronously prepare wasm: ${reason}`); // Warn on some common problems. if (isFileURI(binaryFile)) { err(`warning: Loading from a file URI (${binaryFile}) is not supported in most browsers. See https://emscripten.org/docs/getting_started/FAQ.html#how-do-i-run-a-local-webserver-for-testing-why-does-my-program-stall-in-downloading-or-preparing`); } abort(reason); } } async function instantiateAsync(binary, binaryFile, imports) { if (!binary // Don't use streaming for file:// delivered objects in a webview, fetch them synchronously. && !isFileURI(binaryFile) // Avoid instantiateStreaming() on Node.js environment for now, as while // Node.js v18.1.0 implements it, it does not have a full fetch() // implementation yet. // // Reference: // https://github.com/emscripten-core/emscripten/pull/16917 && !ENVIRONMENT_IS_NODE ) { try { var response = fetch(binaryFile, { credentials: 'same-origin' }); var instantiationResult = await WebAssembly.instantiateStreaming(response, imports); return instantiationResult; } catch (reason) { // We expect the most common failure cause to be a bad MIME type for the binary, // in which case falling back to ArrayBuffer instantiation should work. err(`wasm streaming compile failed: ${reason}`); err('falling back to ArrayBuffer instantiation'); // fall back of instantiateArrayBuffer below }; } return instantiateArrayBuffer(binaryFile, imports); } function getWasmImports() { // prepare imports var imports = { 'env': wasmImports, 'wasi_snapshot_preview1': wasmImports, }; return imports; } // Create the wasm instance. // Receives the wasm imports, returns the exports. async function createWasm() { // Load the wasm module and create an instance of using native support in the JS engine. // handle a generated wasm instance, receiving its exports and // performing other necessary setup /** @param {WebAssembly.Module=} module*/ function receiveInstance(instance, module) { wasmExports = instance.exports; assignWasmExports(wasmExports); updateMemoryViews(); removeRunDependency('wasm-instantiate'); return wasmExports; } addRunDependency('wasm-instantiate'); // Prefer streaming instantiation if available. // Async compilation can be confusing when an error on the page overwrites Module // (for example, if the order of elements is wrong, and the one defining Module is // later), so we save Module and check it later. var trueModule = Module; function receiveInstantiationResult(result) { // 'result' is a ResultObject object which has both the module and instance. // receiveInstance() will swap in the exports (to Module.asm) so they can be called assert(Module === trueModule, 'the Module object should not be replaced during async compilation - perhaps the order of HTML elements is wrong?'); trueModule = null; // TODO: Due to Closure regression https://github.com/google/closure-compiler/issues/3193, the above line no longer optimizes out down to the following line. // When the regression is fixed, can restore the above PTHREADS-enabled path. return receiveInstance(result['instance']); } var info = getWasmImports(); // User shell pages can write their own Module.instantiateWasm = function(imports, successCallback) callback // to manually instantiate the Wasm module themselves. This allows pages to // run the instantiation parallel to any other async startup actions they are // performing. // Also pthreads and wasm workers initialize the wasm instance through this // path. if (Module['instantiateWasm']) { return new Promise((resolve, reject) => { try { Module['instantiateWasm'](info, (inst, mod) => { resolve(receiveInstance(inst, mod)); }); } catch(e) { err(`Module.instantiateWasm callback failed with error: ${e}`); reject(e); } }); } wasmBinaryFile ??= findWasmBinary(); var result = await instantiateAsync(wasmBinary, wasmBinaryFile, info); var exports = receiveInstantiationResult(result); return exports; } // Globals used by JS i64 conversions (see makeSetValue) var tempDouble; var tempI64; // end include: preamble.js // Begin JS library code class ExitStatus { name = 'ExitStatus'; constructor(status) { this.message = `Program terminated with exit(${status})`; this.status = status; } } var callRuntimeCallbacks = (callbacks) => { while (callbacks.length > 0) { // Pass the module as the first argument. callbacks.shift()(Module); } }; var onPostRuns = []; var addOnPostRun = (cb) => onPostRuns.push(cb); var onPreRuns = []; var addOnPreRun = (cb) => onPreRuns.push(cb); var runDependencies = 0; var dependenciesFulfilled = null; var runDependencyTracking = { }; var runDependencyWatcher = null; var removeRunDependency = (id) => { runDependencies--; Module['monitorRunDependencies']?.(runDependencies); assert(id, 'removeRunDependency requires an ID'); assert(runDependencyTracking[id]); delete runDependencyTracking[id]; if (runDependencies == 0) { if (runDependencyWatcher !== null) { clearInterval(runDependencyWatcher); runDependencyWatcher = null; } if (dependenciesFulfilled) { var callback = dependenciesFulfilled; dependenciesFulfilled = null; callback(); // can add another dependenciesFulfilled } } }; var addRunDependency = (id) => { runDependencies++; Module['monitorRunDependencies']?.(runDependencies); assert(id, 'addRunDependency requires an ID') assert(!runDependencyTracking[id]); runDependencyTracking[id] = 1; if (runDependencyWatcher === null && globalThis.setInterval) { // Check for missing dependencies every few seconds runDependencyWatcher = setInterval(() => { if (ABORT) { clearInterval(runDependencyWatcher); runDependencyWatcher = null; return; } var shown = false; for (var dep in runDependencyTracking) { if (!shown) { shown = true; err('still waiting on run dependencies:'); } err(`dependency: ${dep}`); } if (shown) { err('(end of list)'); } }, 10000); // Prevent this timer from keeping the runtime alive if nothing // else is. runDependencyWatcher.unref?.() } }; /** * @param {number} ptr * @param {string} type */ function getValue(ptr, type = 'i8') { if (type.endsWith('*')) type = '*'; 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': abort('to do getValue(i64) use WASM_BIGINT'); case 'float': return HEAPF32[((ptr)>>2)]; case 'double': return HEAPF64[((ptr)>>3)]; case '*': return HEAPU32[((ptr)>>2)]; default: abort(`invalid type for getValue: ${type}`); } } var noExitRuntime = true; var ptrToString = (ptr) => { assert(typeof ptr === 'number', `ptrToString expects a number, got ${typeof ptr}`); // Convert to 32-bit unsigned value ptr >>>= 0; return '0x' + ptr.toString(16).padStart(8, '0'); }; var setStackLimits = () => { var stackLow = _emscripten_stack_get_base(); var stackHigh = _emscripten_stack_get_end(); ___set_stack_limits(stackLow, stackHigh); }; /** * @param {number} ptr * @param {number} value * @param {string} type */ function setValue(ptr, value, type = 'i8') { if (type.endsWith('*')) type = '*'; switch (type) { case 'i1': HEAP8[ptr] = value;checkInt8(value); break; case 'i8': HEAP8[ptr] = value;checkInt8(value); break; case 'i16': HEAP16[((ptr)>>1)] = value;checkInt16(value); break; case 'i32': HEAP32[((ptr)>>2)] = value;checkInt32(value); break; case 'i64': abort('to do setValue(i64) use WASM_BIGINT'); case 'float': HEAPF32[((ptr)>>2)] = value; break; case 'double': HEAPF64[((ptr)>>3)] = value; break; case '*': HEAPU32[((ptr)>>2)] = value; break; default: abort(`invalid type for setValue: ${type}`); } } var stackRestore = (val) => __emscripten_stack_restore(val); var stackSave = () => _emscripten_stack_get_current(); var warnOnce = (text) => { warnOnce.shown ||= {}; if (!warnOnce.shown[text]) { warnOnce.shown[text] = 1; if (ENVIRONMENT_IS_NODE) text = 'warning: ' + text; err(text); } }; var UTF8Decoder = globalThis.TextDecoder && new TextDecoder(); var findStringEnd = (heapOrArray, idx, maxBytesToRead, ignoreNul) => { var maxIdx = idx + maxBytesToRead; if (ignoreNul) return maxIdx; // TextDecoder needs to know the byte length in advance, it doesn't stop on // null terminator by itself. // As a tiny code save trick, compare idx against maxIdx using a negation, // so that maxBytesToRead=undefined/NaN means Infinity. while (heapOrArray[idx] && !(idx >= maxIdx)) ++idx; return idx; }; /** * Given a pointer 'idx' to a null-terminated UTF8-encoded string in the given * array that contains uint8 values, returns a copy of that string as a * Javascript String object. * heapOrArray is either a regular array, or a JavaScript typed array view. * @param {number=} idx * @param {number=} maxBytesToRead * @param {boolean=} ignoreNul - If true, the function will not stop on a NUL character. * @return {string} */ var UTF8ArrayToString = (heapOrArray, idx = 0, maxBytesToRead, ignoreNul) => { var endPtr = findStringEnd(heapOrArray, idx, maxBytesToRead, ignoreNul); // When using conditional TextDecoder, skip it for short strings as the overhead of the native call is not worth it. if (endPtr - idx > 16 && heapOrArray.buffer && UTF8Decoder) { return UTF8Decoder.decode(heapOrArray.subarray(idx, endPtr)); } var str = ''; while (idx < endPtr) { // For UTF8 byte structure, see: // http://en.wikipedia.org/wiki/UTF-8#Description // https://www.ietf.org/rfc/rfc2279.txt // https://tools.ietf.org/html/rfc3629 var u0 = heapOrArray[idx++]; if (!(u0 & 0x80)) { str += String.fromCharCode(u0); continue; } var u1 = heapOrArray[idx++] & 63; if ((u0 & 0xE0) == 0xC0) { str += String.fromCharCode(((u0 & 31) << 6) | u1); continue; } var u2 = heapOrArray[idx++] & 63; if ((u0 & 0xF0) == 0xE0) { u0 = ((u0 & 15) << 12) | (u1 << 6) | u2; } else { if ((u0 & 0xF8) != 0xF0) warnOnce('Invalid UTF-8 leading byte ' + ptrToString(u0) + ' encountered when deserializing a UTF-8 string in wasm memory to a JS string!'); u0 = ((u0 & 7) << 18) | (u1 << 12) | (u2 << 6) | (heapOrArray[idx++] & 63); } if (u0 < 0x10000) { str += String.fromCharCode(u0); } else { var ch = u0 - 0x10000; str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF)); } } return str; }; /** * Given a pointer 'ptr' to a null-terminated UTF8-encoded string in the * emscripten HEAP, returns a copy of that string as a Javascript String object. * * @param {number} ptr * @param {number=} maxBytesToRead - An optional length that specifies the * maximum number of bytes to read. You can omit this parameter to scan the * string until the first 0 byte. If maxBytesToRead is passed, and the string * at [ptr, ptr+maxBytesToReadr[ contains a null byte in the middle, then the * string will cut short at that byte index. * @param {boolean=} ignoreNul - If true, the function will not stop on a NUL character. * @return {string} */ var UTF8ToString = (ptr, maxBytesToRead, ignoreNul) => { assert(typeof ptr == 'number', `UTF8ToString expects a number (got ${typeof ptr})`); return ptr ? UTF8ArrayToString(HEAPU8, ptr, maxBytesToRead, ignoreNul) : ''; }; var ___assert_fail = (condition, filename, line, func) => abort(`Assertion failed: ${UTF8ToString(condition)}, at: ` + [filename ? UTF8ToString(filename) : 'unknown filename', line, func ? UTF8ToString(func) : 'unknown function']); var ___handle_stack_overflow = (requested) => { var base = _emscripten_stack_get_base(); var end = _emscripten_stack_get_end(); abort(`stack overflow (Attempt to set SP to ${ptrToString(requested)}` + `, with stack limits [${ptrToString(end)} - ${ptrToString(base)}` + ']). If you require more stack space build with -sSTACK_SIZE='); }; var PATH = { isAbs:(path) => path.charAt(0) === '/', splitPath:(filename) => { var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/; return splitPathRe.exec(filename).slice(1); }, normalizeArray:(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:(path) => { var isAbsolute = PATH.isAbs(path), trailingSlash = path.slice(-1) === '/'; // Normalize the path path = PATH.normalizeArray(path.split('/').filter((p) => !!p), !isAbsolute).join('/'); if (!path && !isAbsolute) { path = '.'; } if (path && trailingSlash) { path += '/'; } return (isAbsolute ? '/' : '') + path; }, dirname:(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.slice(0, -1); } return root + dir; }, basename:(path) => path && path.match(/([^\/]+|\/)\/*$/)[1], join:(...paths) => PATH.normalize(paths.join('/')), join2:(l, r) => PATH.normalize(l + '/' + r), }; var initRandomFill = () => { // This block is not needed on v19+ since crypto.getRandomValues is builtin if (ENVIRONMENT_IS_NODE) { var nodeCrypto = require('node:crypto'); return (view) => nodeCrypto.randomFillSync(view); } return (view) => crypto.getRandomValues(view); }; var randomFill = (view) => { // Lazily init on the first invocation. (randomFill = initRandomFill())(view); }; var PATH_FS = { resolve:(...args) => { var resolvedPath = '', resolvedAbsolute = false; for (var i = args.length - 1; i >= -1 && !resolvedAbsolute; i--) { var path = (i >= 0) ? args[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) { return ''; // an invalid portion invalidates the whole thing } resolvedPath = path + '/' + resolvedPath; resolvedAbsolute = PATH.isAbs(path); } // 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((p) => !!p), !resolvedAbsolute).join('/'); return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.'; }, relative:(from, to) => { from = PATH_FS.resolve(from).slice(1); to = PATH_FS.resolve(to).slice(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 FS_stdin_getChar_buffer = []; var lengthBytesUTF8 = (str) => { var len = 0; for (var i = 0; i < str.length; ++i) { // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code // unit, not a Unicode code point of the character! So decode // UTF16->UTF32->UTF8. // See http://unicode.org/faq/utf_bom.html#utf16-3 var c = str.charCodeAt(i); // possibly a lead surrogate if (c <= 0x7F) { len++; } else if (c <= 0x7FF) { len += 2; } else if (c >= 0xD800 && c <= 0xDFFF) { len += 4; ++i; } else { len += 3; } } return len; }; var stringToUTF8Array = (str, heap, outIdx, maxBytesToWrite) => { assert(typeof str === 'string', `stringToUTF8Array expects a string (got ${typeof str})`); // Parameter maxBytesToWrite is not optional. Negative values, 0, null, // undefined and false each don't write out any bytes. if (!(maxBytesToWrite > 0)) return 0; var startIdx = outIdx; var endIdx = outIdx + maxBytesToWrite - 1; // -1 for string null terminator. for (var i = 0; i < str.length; ++i) { // For UTF8 byte structure, see http://en.wikipedia.org/wiki/UTF-8#Description // and https://www.ietf.org/rfc/rfc2279.txt // and https://tools.ietf.org/html/rfc3629 var u = str.codePointAt(i); if (u <= 0x7F) { if (outIdx >= endIdx) break; heap[outIdx++] = u; } else if (u <= 0x7FF) { if (outIdx + 1 >= endIdx) break; heap[outIdx++] = 0xC0 | (u >> 6); heap[outIdx++] = 0x80 | (u & 63); } else if (u <= 0xFFFF) { if (outIdx + 2 >= endIdx) break; heap[outIdx++] = 0xE0 | (u >> 12); heap[outIdx++] = 0x80 | ((u >> 6) & 63); heap[outIdx++] = 0x80 | (u & 63); } else { if (outIdx + 3 >= endIdx) break; if (u > 0x10FFFF) warnOnce('Invalid Unicode code point ' + ptrToString(u) + ' encountered when serializing a JS string to a UTF-8 string in wasm memory! (Valid unicode code points should be in range 0-0x10FFFF).'); heap[outIdx++] = 0xF0 | (u >> 18); heap[outIdx++] = 0x80 | ((u >> 12) & 63); heap[outIdx++] = 0x80 | ((u >> 6) & 63); heap[outIdx++] = 0x80 | (u & 63); // Gotcha: if codePoint is over 0xFFFF, it is represented as a surrogate pair in UTF-16. // We need to manually skip over the second code unit for correct iteration. i++; } } // Null-terminate the pointer to the buffer. heap[outIdx] = 0; return outIdx - startIdx; }; /** @type {function(string, boolean=, number=)} */ var intArrayFromString = (stringy, dontAddNull, length) => { var len = length > 0 ? length : lengthBytesUTF8(stringy)+1; var u8array = new Array(len); var numBytesWritten = stringToUTF8Array(stringy, u8array, 0, u8array.length); if (dontAddNull) u8array.length = numBytesWritten; return u8array; }; var FS_stdin_getChar = () => { if (!FS_stdin_getChar_buffer.length) { var result = null; if (ENVIRONMENT_IS_NODE) { // we will read data by chunks of BUFSIZE var BUFSIZE = 256; var buf = Buffer.alloc(BUFSIZE); var bytesRead = 0; // For some reason we must suppress a closure warning here, even though // fd definitely exists on process.stdin, and is even the proper way to // get the fd of stdin, // https://github.com/nodejs/help/issues/2136#issuecomment-523649904 // This started to happen after moving this logic out of library_tty.js, // so it is related to the surrounding code in some unclear manner. /** @suppress {missingProperties} */ var fd = process.stdin.fd; try { bytesRead = fs.readSync(fd, buf, 0, BUFSIZE); } catch(e) { // Cross-platform differences: on Windows, reading EOF throws an // exception, but on other OSes, reading EOF returns 0. Uniformize // behavior by treating the EOF exception to return 0. if (e.toString().includes('EOF')) bytesRead = 0; else throw e; } if (bytesRead > 0) { result = buf.slice(0, bytesRead).toString('utf-8'); } } else if (globalThis.window?.prompt) { // Browser. result = window.prompt('Input: '); // returns null on cancel if (result !== null) { result += '\n'; } } else {} if (!result) { return null; } FS_stdin_getChar_buffer = intArrayFromString(result, true); } return FS_stdin_getChar_buffer.shift(); }; var TTY = { ttys:[], init() { // https://github.com/emscripten-core/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() { // https://github.com/emscripten-core/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(dev, ops) { TTY.ttys[dev] = { input: [], output: [], ops: ops }; FS.registerDevice(dev, TTY.stream_ops); }, stream_ops:{ open(stream) { var tty = TTY.ttys[stream.node.rdev]; if (!tty) { throw new FS.ErrnoError(43); } stream.tty = tty; stream.seekable = false; }, close(stream) { // flush any pending line data stream.tty.ops.fsync(stream.tty); }, fsync(stream) { stream.tty.ops.fsync(stream.tty); }, read(stream, buffer, offset, length, pos /* ignored */) { if (!stream.tty || !stream.tty.ops.get_char) { throw new FS.ErrnoError(60); } 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(29); } if (result === undefined && bytesRead === 0) { throw new FS.ErrnoError(6); } if (result === null || result === undefined) break; bytesRead++; buffer[offset+i] = result; } if (bytesRead) { stream.node.atime = Date.now(); } return bytesRead; }, write(stream, buffer, offset, length, pos) { if (!stream.tty || !stream.tty.ops.put_char) { throw new FS.ErrnoError(60); } try { for (var i = 0; i < length; i++) { stream.tty.ops.put_char(stream.tty, buffer[offset+i]); } } catch (e) { throw new FS.ErrnoError(29); } if (length) { stream.node.mtime = stream.node.ctime = Date.now(); } return i; }, }, default_tty_ops:{ get_char(tty) { return FS_stdin_getChar(); }, put_char(tty, val) { if (val === null || val === 10) { out(UTF8ArrayToString(tty.output)); tty.output = []; } else { if (val != 0) tty.output.push(val); // val == 0 would cut text output off in the middle. } }, fsync(tty) { if (tty.output?.length > 0) { out(UTF8ArrayToString(tty.output)); tty.output = []; } }, ioctl_tcgets(tty) { // typical setting return { c_iflag: 25856, c_oflag: 5, c_cflag: 191, c_lflag: 35387, c_cc: [ 0x03, 0x1c, 0x7f, 0x15, 0x04, 0x00, 0x01, 0x00, 0x11, 0x13, 0x1a, 0x00, 0x12, 0x0f, 0x17, 0x16, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, ] }; }, ioctl_tcsets(tty, optional_actions, data) { // currently just ignore return 0; }, ioctl_tiocgwinsz(tty) { return [24, 80]; }, }, default_tty1_ops:{ put_char(tty, val) { if (val === null || val === 10) { err(UTF8ArrayToString(tty.output)); tty.output = []; } else { if (val != 0) tty.output.push(val); } }, fsync(tty) { if (tty.output?.length > 0) { err(UTF8ArrayToString(tty.output)); tty.output = []; } }, }, }; var zeroMemory = (ptr, size) => HEAPU8.fill(0, ptr, ptr + size); var alignMemory = (size, alignment) => { assert(alignment, "alignment argument is required"); return Math.ceil(size / alignment) * alignment; }; var mmapAlloc = (size) => { size = alignMemory(size, 65536); var ptr = _emscripten_builtin_memalign(65536, size); if (ptr) zeroMemory(ptr, size); return ptr; }; var MEMFS = { ops_table:null, mount(mount) { return MEMFS.createNode(null, '/', 16895, 0); }, createNode(parent, name, mode, dev) { if (FS.isBlkdev(mode) || FS.isFIFO(mode)) { // not supported throw new FS.ErrnoError(63); } 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, mmap: MEMFS.stream_ops.mmap, msync: MEMFS.stream_ops.msync } }, 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.usedBytes = 0; // The actual number of bytes used in the typed array, as opposed to contents.length which gives the whole capacity. // When the byte data of the file is populated, this will point to either a typed array, or a normal JS array. Typed arrays are preferred // for performance, and used by default. However, typed arrays are not resizable like normal JS arrays are, so there is a small disk size // penalty involved for appending file writes that continuously grow a file similar to std::vector capacity vs used -scheme. node.contents = null; } 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.atime = node.mtime = node.ctime = Date.now(); // add the new node to the parent if (parent) { parent.contents[name] = node; parent.atime = parent.mtime = parent.ctime = node.atime; } return node; }, getFileDataAsTypedArray(node) { if (!node.contents) return new Uint8Array(0); if (node.contents.subarray) return node.contents.subarray(0, node.usedBytes); // Make sure to not return excess unused bytes. return new Uint8Array(node.contents); }, expandFileStorage(node, newCapacity) { var prevCapacity = node.contents ? node.contents.length : 0; if (prevCapacity >= newCapacity) return; // No need to expand, the storage was already large enough. // Don't expand strictly to the given requested limit if it's only a very small increase, but instead geometrically grow capacity. // For small filesizes (<1MB), perform size*2 geometric increase, but for large sizes, do a much more conservative size*1.125 increase to // avoid overshooting the allocation cap by a very large margin. var CAPACITY_DOUBLING_MAX = 1024 * 1024; newCapacity = Math.max(newCapacity, (prevCapacity * (prevCapacity < CAPACITY_DOUBLING_MAX ? 2.0 : 1.125)) >>> 0); if (prevCapacity != 0) newCapacity = Math.max(newCapacity, 256); // At minimum allocate 256b for each file when expanding. var oldContents = node.contents; node.contents = new Uint8Array(newCapacity); // Allocate new storage. if (node.usedBytes > 0) node.contents.set(oldContents.subarray(0, node.usedBytes), 0); // Copy old data over to the new storage. }, resizeFileStorage(node, newSize) { if (node.usedBytes == newSize) return; if (newSize == 0) { node.contents = null; // Fully decommit when requesting a resize to zero. node.usedBytes = 0; } else { var oldContents = node.contents; node.contents = new Uint8Array(newSize); // Allocate new storage. if (oldContents) { node.contents.set(oldContents.subarray(0, Math.min(newSize, node.usedBytes))); // Copy old data over to the new storage. } node.usedBytes = newSize; } }, node_ops:{ getattr(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.usedBytes; } else if (FS.isLink(node.mode)) { attr.size = node.link.length; } else { attr.size = 0; } attr.atime = new Date(node.atime); attr.mtime = new Date(node.mtime); attr.ctime = new Date(node.ctime); // 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(node, attr) { for (const key of ["mode", "atime", "mtime", "ctime"]) { if (attr[key] != null) { node[key] = attr[key]; } } if (attr.size !== undefined) { MEMFS.resizeFileStorage(node, attr.size); } }, lookup(parent, name) { throw new FS.ErrnoError(44); }, mknod(parent, name, mode, dev) { return MEMFS.createNode(parent, name, mode, dev); }, rename(old_node, new_dir, new_name) { var new_node; try { new_node = FS.lookupNode(new_dir, new_name); } catch (e) {} if (new_node) { if (FS.isDir(old_node.mode)) { // if we're overwriting a directory at new_name, make sure it's empty. for (var i in new_node.contents) { throw new FS.ErrnoError(55); } } FS.hashRemoveNode(new_node); } // do the internal rewiring delete old_node.parent.contents[old_node.name]; new_dir.contents[new_name] = old_node; old_node.name = new_name; new_dir.ctime = new_dir.mtime = old_node.parent.ctime = old_node.parent.mtime = Date.now(); }, unlink(parent, name) { delete parent.contents[name]; parent.ctime = parent.mtime = Date.now(); }, rmdir(parent, name) { var node = FS.lookupNode(parent, name); for (var i in node.contents) { throw new FS.ErrnoError(55); } delete parent.contents[name]; parent.ctime = parent.mtime = Date.now(); }, readdir(node) { return ['.', '..', ...Object.keys(node.contents)]; }, symlink(parent, newname, oldpath) { var node = MEMFS.createNode(parent, newname, 0o777 | 40960, 0); node.link = oldpath; return node; }, readlink(node) { if (!FS.isLink(node.mode)) { throw new FS.ErrnoError(28); } return node.link; }, }, stream_ops:{ read(stream, buffer, offset, length, position) { var contents = stream.node.contents; if (position >= stream.node.usedBytes) return 0; var size = Math.min(stream.node.usedBytes - 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(stream, buffer, offset, length, position, canOwn) { // The data buffer should be a typed array view assert(!(buffer instanceof ArrayBuffer)); if (!length) return 0; var node = stream.node; node.mtime = node.ctime = Date.now(); if (buffer.subarray && (!node.contents || node.contents.subarray)) { // This write is from a typed array to a typed array? if (canOwn) { assert(position === 0, 'canOwn must imply no weird position inside the file'); node.contents = buffer.subarray(offset, offset + length); node.usedBytes = length; return length; } else if (node.usedBytes === 0 && position === 0) { // If this is a simple first write to an empty file, do a fast set since we don't need to care about old data. node.contents = buffer.slice(offset, offset + length); node.usedBytes = length; return length; } else if (position + length <= node.usedBytes) { // Writing to an already allocated and used subrange of the file? node.contents.set(buffer.subarray(offset, offset + length), position); return length; } } // Appending to an existing file and we need to reallocate, or source data did not come as a typed array. MEMFS.expandFileStorage(node, position+length); if (node.contents.subarray && buffer.subarray) { // Use typed array write which is available. node.contents.set(buffer.subarray(offset, offset + length), position); } else { for (var i = 0; i < length; i++) { node.contents[position + i] = buffer[offset + i]; // Or fall back to manual write if not. } } node.usedBytes = Math.max(node.usedBytes, position + length); return length; }, llseek(stream, offset, whence) { var position = offset; if (whence === 1) { position += stream.position; } else if (whence === 2) { if (FS.isFile(stream.node.mode)) { position += stream.node.usedBytes; } } if (position < 0) { throw new FS.ErrnoError(28); } return position; }, mmap(stream, length, position, prot, flags) { if (!FS.isFile(stream.node.mode)) { throw new FS.ErrnoError(43); } var ptr; var allocated; var contents = stream.node.contents; // Only make a new copy when MAP_PRIVATE is specified. if (!(flags & 2) && contents && contents.buffer === HEAP8.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 { allocated = true; ptr = mmapAlloc(length); if (!ptr) { throw new FS.ErrnoError(48); } if (contents) { // 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); } } HEAP8.set(contents, ptr); } } return { ptr, allocated }; }, msync(stream, buffer, offset, length, mmapFlags) { MEMFS.stream_ops.write(stream, buffer, 0, length, offset, false); // should we check if bytesWritten and length are the same? return 0; }, }, }; var FS_modeStringToFlags = (str) => { var flagModes = { 'r': 0, 'r+': 2, 'w': 512 | 64 | 1, 'w+': 512 | 64 | 2, 'a': 1024 | 64 | 1, 'a+': 1024 | 64 | 2, }; var flags = flagModes[str]; if (typeof flags == 'undefined') { throw new Error(`Unknown file open mode: ${str}`); } return flags; }; var FS_getMode = (canRead, canWrite) => { var mode = 0; if (canRead) mode |= 292 | 73; if (canWrite) mode |= 146; return mode; }; var strError = (errno) => UTF8ToString(_strerror(errno)); var ERRNO_CODES = { 'EPERM': 63, 'ENOENT': 44, 'ESRCH': 71, 'EINTR': 27, 'EIO': 29, 'ENXIO': 60, 'E2BIG': 1, 'ENOEXEC': 45, 'EBADF': 8, 'ECHILD': 12, 'EAGAIN': 6, 'EWOULDBLOCK': 6, 'ENOMEM': 48, 'EACCES': 2, 'EFAULT': 21, 'ENOTBLK': 105, 'EBUSY': 10, 'EEXIST': 20, 'EXDEV': 75, 'ENODEV': 43, 'ENOTDIR': 54, 'EISDIR': 31, 'EINVAL': 28, 'ENFILE': 41, 'EMFILE': 33, 'ENOTTY': 59, 'ETXTBSY': 74, 'EFBIG': 22, 'ENOSPC': 51, 'ESPIPE': 70, 'EROFS': 69, 'EMLINK': 34, 'EPIPE': 64, 'EDOM': 18, 'ERANGE': 68, 'ENOMSG': 49, 'EIDRM': 24, 'ECHRNG': 106, 'EL2NSYNC': 156, 'EL3HLT': 107, 'EL3RST': 108, 'ELNRNG': 109, 'EUNATCH': 110, 'ENOCSI': 111, 'EL2HLT': 112, 'EDEADLK': 16, 'ENOLCK': 46, 'EBADE': 113, 'EBADR': 114, 'EXFULL': 115, 'ENOANO': 104, 'EBADRQC': 103, 'EBADSLT': 102, 'EDEADLOCK': 16, 'EBFONT': 101, 'ENOSTR': 100, 'ENODATA': 116, 'ETIME': 117, 'ENOSR': 118, 'ENONET': 119, 'ENOPKG': 120, 'EREMOTE': 121, 'ENOLINK': 47, 'EADV': 122, 'ESRMNT': 123, 'ECOMM': 124, 'EPROTO': 65, 'EMULTIHOP': 36, 'EDOTDOT': 125, 'EBADMSG': 9, 'ENOTUNIQ': 126, 'EBADFD': 127, 'EREMCHG': 128, 'ELIBACC': 129, 'ELIBBAD': 130, 'ELIBSCN': 131, 'ELIBMAX': 132, 'ELIBEXEC': 133, 'ENOSYS': 52, 'ENOTEMPTY': 55, 'ENAMETOOLONG': 37, 'ELOOP': 32, 'EOPNOTSUPP': 138, 'EPFNOSUPPORT': 139, 'ECONNRESET': 15, 'ENOBUFS': 42, 'EAFNOSUPPORT': 5, 'EPROTOTYPE': 67, 'ENOTSOCK': 57, 'ENOPROTOOPT': 50, 'ESHUTDOWN': 140, 'ECONNREFUSED': 14, 'EADDRINUSE': 3, 'ECONNABORTED': 13, 'ENETUNREACH': 40, 'ENETDOWN': 38, 'ETIMEDOUT': 73, 'EHOSTDOWN': 142, 'EHOSTUNREACH': 23, 'EINPROGRESS': 26, 'EALREADY': 7, 'EDESTADDRREQ': 17, 'EMSGSIZE': 35, 'EPROTONOSUPPORT': 66, 'ESOCKTNOSUPPORT': 137, 'EADDRNOTAVAIL': 4, 'ENETRESET': 39, 'EISCONN': 30, 'ENOTCONN': 53, 'ETOOMANYREFS': 141, 'EUSERS': 136, 'EDQUOT': 19, 'ESTALE': 72, 'ENOTSUP': 138, 'ENOMEDIUM': 148, 'EILSEQ': 25, 'EOVERFLOW': 61, 'ECANCELED': 11, 'ENOTRECOVERABLE': 56, 'EOWNERDEAD': 62, 'ESTRPIPE': 135, }; var asyncLoad = async (url) => { var arrayBuffer = await readAsync(url); assert(arrayBuffer, `Loading data file "${url}" failed (no arrayBuffer).`); return new Uint8Array(arrayBuffer); }; var FS_createDataFile = (...args) => FS.createDataFile(...args); var getUniqueRunDependency = (id) => { var orig = id; while (1) { if (!runDependencyTracking[id]) return id; id = orig + Math.random(); } }; var preloadPlugins = []; var FS_handledByPreloadPlugin = async (byteArray, fullname) => { // Ensure plugins are ready. if (typeof Browser != 'undefined') Browser.init(); for (var plugin of preloadPlugins) { if (plugin['canHandle'](fullname)) { assert(plugin['handle'].constructor.name === 'AsyncFunction', 'Filesystem plugin handlers must be async functions (See #24914)') return plugin['handle'](byteArray, fullname); } } // If no plugin handled this file then return the original/unmodified // byteArray. return byteArray; }; var FS_preloadFile = async (parent, name, url, canRead, canWrite, dontCreateFile, canOwn, preFinish) => { // 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_FS.resolve(PATH.join2(parent, name)) : parent; var dep = getUniqueRunDependency(`cp ${fullname}`); // might have several active requests for the same fullname addRunDependency(dep); try { var byteArray = url; if (typeof url == 'string') { byteArray = await asyncLoad(url); } byteArray = await FS_handledByPreloadPlugin(byteArray, fullname); preFinish?.(); if (!dontCreateFile) { FS_createDataFile(parent, name, byteArray, canRead, canWrite, canOwn); } } finally { removeRunDependency(dep); } }; var FS_createPreloadedFile = (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn, preFinish) => { FS_preloadFile(parent, name, url, canRead, canWrite, dontCreateFile, canOwn, preFinish).then(onload).catch(onerror); }; var FS = { root:null, mounts:[], devices:{ }, streams:[], nextInode:1, nameTable:null, currentPath:"/", initialized:false, ignorePermissions:true, filesystems:null, syncFSRequests:0, ErrnoError:class extends Error { name = 'ErrnoError'; // We set the `name` property to be able to identify `FS.ErrnoError` // - the `name` is a standard ECMA-262 property of error objects. Kind of good to have it anyway. // - when using PROXYFS, an error can come from an underlying FS // as different FS objects have their own FS.ErrnoError each, // the test `err instanceof FS.ErrnoError` won't detect an error coming from another filesystem, causing bugs. // we'll use the reliable test `err.name == "ErrnoError"` instead constructor(errno) { super(runtimeInitialized ? strError(errno) : ''); this.errno = errno; for (var key in ERRNO_CODES) { if (ERRNO_CODES[key] === errno) { this.code = key; break; } } } }, FSStream:class { shared = {}; get object() { return this.node; } set object(val) { this.node = val; } get isRead() { return (this.flags & 2097155) !== 1; } get isWrite() { return (this.flags & 2097155) !== 0; } get isAppend() { return (this.flags & 1024); } get flags() { return this.shared.flags; } set flags(val) { this.shared.flags = val; } get position() { return this.shared.position; } set position(val) { this.shared.position = val; } }, FSNode:class { node_ops = {}; stream_ops = {}; readMode = 292 | 73; writeMode = 146; mounted = null; constructor(parent, name, mode, rdev) { if (!parent) { parent = this; // root node sets parent to itself } this.parent = parent; this.mount = parent.mount; this.id = FS.nextInode++; this.name = name; this.mode = mode; this.rdev = rdev; this.atime = this.mtime = this.ctime = Date.now(); } get read() { return (this.mode & this.readMode) === this.readMode; } set read(val) { val ? this.mode |= this.readMode : this.mode &= ~this.readMode; } get write() { return (this.mode & this.writeMode) === this.writeMode; } set write(val) { val ? this.mode |= this.writeMode : this.mode &= ~this.writeMode; } get isFolder() { return FS.isDir(this.mode); } get isDevice() { return FS.isChrdev(this.mode); } }, lookupPath(path, opts = {}) { if (!path) { throw new FS.ErrnoError(44); } opts.follow_mount ??= true if (!PATH.isAbs(path)) { path = FS.cwd() + '/' + path; } // limit max consecutive symlinks to 40 (SYMLOOP_MAX). linkloop: for (var nlinks = 0; nlinks < 40; nlinks++) { // split the absolute path var parts = path.split('/').filter((p) => !!p); // 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; } if (parts[i] === '.') { continue; } if (parts[i] === '..') { current_path = PATH.dirname(current_path); if (FS.isRoot(current)) { path = current_path + '/' + parts.slice(i + 1).join('/'); // We're making progress here, don't let many consecutive ..'s // lead to ELOOP nlinks--; continue linkloop; } else { current = current.parent; } continue; } current_path = PATH.join2(current_path, parts[i]); try { current = FS.lookupNode(current, parts[i]); } catch (e) { // if noent_okay is true, suppress a ENOENT in the last component // and return an object with an undefined node. This is needed for // resolving symlinks in the path when creating a file. if ((e?.errno === 44) && islast && opts.noent_okay) { return { path: current_path }; } throw e; } // jump to the mount's root node if this is a mountpoint if (FS.isMountpoint(current) && (!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 (FS.isLink(current.mode) && (!islast || opts.follow)) { if (!current.node_ops.readlink) { throw new FS.ErrnoError(52); } var link = current.node_ops.readlink(current); if (!PATH.isAbs(link)) { link = PATH.dirname(current_path) + '/' + link; } path = link + '/' + parts.slice(i + 1).join('/'); continue linkloop; } } return { path: current_path, node: current }; } throw new FS.ErrnoError(32); }, getPath(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(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(node) { var hash = FS.hashName(node.parent.id, node.name); node.name_next = FS.nameTable[hash]; FS.nameTable[hash] = node; }, hashRemoveNode(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(parent, name) { var errCode = FS.mayLookup(parent); if (errCode) { throw new FS.ErrnoError(errCode); } 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(parent, name, mode, rdev) { assert(typeof parent == 'object') var node = new FS.FSNode(parent, name, mode, rdev); FS.hashAddNode(node); return node; }, destroyNode(node) { FS.hashRemoveNode(node); }, isRoot(node) { return node === node.parent; }, isMountpoint(node) { return !!node.mounted; }, isFile(mode) { return (mode & 61440) === 32768; }, isDir(mode) { return (mode & 61440) === 16384; }, isLink(mode) { return (mode & 61440) === 40960; }, isChrdev(mode) { return (mode & 61440) === 8192; }, isBlkdev(mode) { return (mode & 61440) === 24576; }, isFIFO(mode) { return (mode & 61440) === 4096; }, isSocket(mode) { return (mode & 49152) === 49152; }, flagsToPermissionString(flag) { var perms = ['r', 'w', 'rw'][flag & 3]; if ((flag & 512)) { perms += 'w'; } return perms; }, nodePermissions(node, perms) { if (FS.ignorePermissions) { return 0; } // return 0 if any user, group or owner bits are set. if (perms.includes('r') && !(node.mode & 292)) { return 2; } if (perms.includes('w') && !(node.mode & 146)) { return 2; } if (perms.includes('x') && !(node.mode & 73)) { return 2; } return 0; }, mayLookup(dir) { if (!FS.isDir(dir.mode)) return 54; var errCode = FS.nodePermissions(dir, 'x'); if (errCode) return errCode; if (!dir.node_ops.lookup) return 2; return 0; }, mayCreate(dir, name) { if (!FS.isDir(dir.mode)) { return 54; } try { var node = FS.lookupNode(dir, name); return 20; } catch (e) { } return FS.nodePermissions(dir, 'wx'); }, mayDelete(dir, name, isdir) { var node; try { node = FS.lookupNode(dir, name); } catch (e) { return e.errno; } var errCode = FS.nodePermissions(dir, 'wx'); if (errCode) { return errCode; } if (isdir) { if (!FS.isDir(node.mode)) { return 54; } if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) { return 10; } } else if (FS.isDir(node.mode)) { return 31; } return 0; }, mayOpen(node, flags) { if (!node) { return 44; } if (FS.isLink(node.mode)) { return 32; } var mode = FS.flagsToPermissionString(flags); if (FS.isDir(node.mode)) { // opening for write // TODO: check for O_SEARCH? (== search for dir only) if (mode !== 'r' || (flags & (512 | 64))) { return 31; } } return FS.nodePermissions(node, mode); }, checkOpExists(op, err) { if (!op) { throw new FS.ErrnoError(err); } return op; }, MAX_OPEN_FDS:4096, nextfd() { for (var fd = 0; fd <= FS.MAX_OPEN_FDS; fd++) { if (!FS.streams[fd]) { return fd; } } throw new FS.ErrnoError(33); }, getStreamChecked(fd) { var stream = FS.getStream(fd); if (!stream) { throw new FS.ErrnoError(8); } return stream; }, getStream:(fd) => FS.streams[fd], createStream(stream, fd = -1) { assert(fd >= -1); // clone it, so we can return an instance of FSStream stream = Object.assign(new FS.FSStream(), stream); if (fd == -1) { fd = FS.nextfd(); } stream.fd = fd; FS.streams[fd] = stream; return stream; }, closeStream(fd) { FS.streams[fd] = null; }, dupStream(origStream, fd = -1) { var stream = FS.createStream(origStream, fd); stream.stream_ops?.dup?.(stream); return stream; }, doSetAttr(stream, node, attr) { var setattr = stream?.stream_ops.setattr; var arg = setattr ? stream : node; setattr ??= node.node_ops.setattr; FS.checkOpExists(setattr, 63) setattr(arg, attr); }, chrdev_stream_ops:{ open(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 stream.stream_ops.open?.(stream); }, llseek() { throw new FS.ErrnoError(70); }, }, major:(dev) => ((dev) >> 8), minor:(dev) => ((dev) & 0xff), makedev:(ma, mi) => ((ma) << 8 | (mi)), registerDevice(dev, ops) { FS.devices[dev] = { stream_ops: ops }; }, getDevice:(dev) => FS.devices[dev], getMounts(mount) { var mounts = []; var check = [mount]; while (check.length) { var m = check.pop(); mounts.push(m); check.push(...m.mounts); } return mounts; }, syncfs(populate, callback) { if (typeof populate == 'function') { callback = populate; populate = false; } FS.syncFSRequests++; if (FS.syncFSRequests > 1) { err(`warning: ${FS.syncFSRequests} FS.syncfs operations in flight at once, probably just doing extra work`); } var mounts = FS.getMounts(FS.root.mount); var completed = 0; function doCallback(errCode) { assert(FS.syncFSRequests > 0); FS.syncFSRequests--; return callback(errCode); } function done(errCode) { if (errCode) { if (!done.errored) { done.errored = true; return doCallback(errCode); } return; } if (++completed >= mounts.length) { doCallback(null); } }; // sync all mounts for (var mount of mounts) { if (mount.type.syncfs) { mount.type.syncfs(mount, populate, done); } else { done(null); } } }, mount(type, opts, mountpoint) { if (typeof type == 'string') { // The filesystem was not included, and instead we have an error // message stored in the variable. throw type; } var root = mountpoint === '/'; var pseudo = !mountpoint; var node; if (root && FS.root) { throw new FS.ErrnoError(10); } 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(10); } if (!FS.isDir(node.mode)) { throw new FS.ErrnoError(54); } } var mount = { type, opts, 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(mountpoint) { var lookup = FS.lookupPath(mountpoint, { follow_mount: false }); if (!FS.isMountpoint(lookup.node)) { throw new FS.ErrnoError(28); } // destroy the nodes for this mount, and all its child mounts var node = lookup.node; var mount = node.mounted; var mounts = FS.getMounts(mount); for (var [hash, current] of Object.entries(FS.nameTable)) { while (current) { var next = current.name_next; if (mounts.includes(current.mount)) { 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(parent, name) { return parent.node_ops.lookup(parent, name); }, mknod(path, mode, dev) { var lookup = FS.lookupPath(path, { parent: true }); var parent = lookup.node; var name = PATH.basename(path); if (!name) { throw new FS.ErrnoError(28); } if (name === '.' || name === '..') { throw new FS.ErrnoError(20); } var errCode = FS.mayCreate(parent, name); if (errCode) { throw new FS.ErrnoError(errCode); } if (!parent.node_ops.mknod) { throw new FS.ErrnoError(63); } return parent.node_ops.mknod(parent, name, mode, dev); }, statfs(path) { return FS.statfsNode(FS.lookupPath(path, {follow: true}).node); }, statfsStream(stream) { // We keep a separate statfsStream function because noderawfs overrides // it. In noderawfs, stream.node is sometimes null. Instead, we need to // look at stream.path. return FS.statfsNode(stream.node); }, statfsNode(node) { // NOTE: None of the defaults here are true. We're just returning safe and // sane values. Currently nodefs and rawfs replace these defaults, // other file systems leave them alone. var rtn = { bsize: 4096, frsize: 4096, blocks: 1e6, bfree: 5e5, bavail: 5e5, files: FS.nextInode, ffree: FS.nextInode - 1, fsid: 42, flags: 2, namelen: 255, }; if (node.node_ops.statfs) { Object.assign(rtn, node.node_ops.statfs(node.mount.opts.root)); } return rtn; }, create(path, mode = 0o666) { mode &= 4095; mode |= 32768; return FS.mknod(path, mode, 0); }, mkdir(path, mode = 0o777) { mode &= 511 | 512; mode |= 16384; return FS.mknod(path, mode, 0); }, mkdirTree(path, mode) { var dirs = path.split('/'); var d = ''; for (var dir of dirs) { if (!dir) continue; if (d || PATH.isAbs(path)) d += '/'; d += dir; try { FS.mkdir(d, mode); } catch(e) { if (e.errno != 20) throw e; } } }, mkdev(path, mode, dev) { if (typeof dev == 'undefined') { dev = mode; mode = 0o666; } mode |= 8192; return FS.mknod(path, mode, dev); }, symlink(oldpath, newpath) { if (!PATH_FS.resolve(oldpath)) { throw new FS.ErrnoError(44); } var lookup = FS.lookupPath(newpath, { parent: true }); var parent = lookup.node; if (!parent) { throw new FS.ErrnoError(44); } var newname = PATH.basename(newpath); var errCode = FS.mayCreate(parent, newname); if (errCode) { throw new FS.ErrnoError(errCode); } if (!parent.node_ops.symlink) { throw new FS.ErrnoError(63); } return parent.node_ops.symlink(parent, newname, oldpath); }, rename(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; // let the errors from non existent directories percolate up lookup = FS.lookupPath(old_path, { parent: true }); old_dir = lookup.node; lookup = FS.lookupPath(new_path, { parent: true }); new_dir = lookup.node; if (!old_dir || !new_dir) throw new FS.ErrnoError(44); // need to be part of the same mount if (old_dir.mount !== new_dir.mount) { throw new FS.ErrnoError(75); } // 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_FS.relative(old_path, new_dirname); if (relative.charAt(0) !== '.') { throw new FS.ErrnoError(28); } // new path should not be an ancestor of the old path relative = PATH_FS.relative(new_path, old_dirname); if (relative.charAt(0) !== '.') { throw new FS.ErrnoError(55); } // 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 errCode = FS.mayDelete(old_dir, old_name, isdir); if (errCode) { throw new FS.ErrnoError(errCode); } // need delete permissions if we'll be overwriting. // need create permissions if new doesn't already exist. errCode = new_node ? FS.mayDelete(new_dir, new_name, isdir) : FS.mayCreate(new_dir, new_name); if (errCode) { throw new FS.ErrnoError(errCode); } if (!old_dir.node_ops.rename) { throw new FS.ErrnoError(63); } if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) { throw new FS.ErrnoError(10); } // if we are going to change the parent, check write permissions if (new_dir !== old_dir) { errCode = FS.nodePermissions(old_dir, 'w'); if (errCode) { throw new FS.ErrnoError(errCode); } } // 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); // update old node (we do this here to avoid each backend // needing to) old_node.parent = new_dir; } 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(path) { var lookup = FS.lookupPath(path, { parent: true }); var parent = lookup.node; var name = PATH.basename(path); var node = FS.lookupNode(parent, name); var errCode = FS.mayDelete(parent, name, true); if (errCode) { throw new FS.ErrnoError(errCode); } if (!parent.node_ops.rmdir) { throw new FS.ErrnoError(63); } if (FS.isMountpoint(node)) { throw new FS.ErrnoError(10); } parent.node_ops.rmdir(parent, name); FS.destroyNode(node); }, readdir(path) { var lookup = FS.lookupPath(path, { follow: true }); var node = lookup.node; var readdir = FS.checkOpExists(node.node_ops.readdir, 54); return readdir(node); }, unlink(path) { var lookup = FS.lookupPath(path, { parent: true }); var parent = lookup.node; if (!parent) { throw new FS.ErrnoError(44); } var name = PATH.basename(path); var node = FS.lookupNode(parent, name); var errCode = FS.mayDelete(parent, name, false); if (errCode) { // According to POSIX, we should map EISDIR to EPERM, but // we instead do what Linux does (and we must, as we use // the musl linux libc). throw new FS.ErrnoError(errCode); } if (!parent.node_ops.unlink) { throw new FS.ErrnoError(63); } if (FS.isMountpoint(node)) { throw new FS.ErrnoError(10); } parent.node_ops.unlink(parent, name); FS.destroyNode(node); }, readlink(path) { var lookup = FS.lookupPath(path); var link = lookup.node; if (!link) { throw new FS.ErrnoError(44); } if (!link.node_ops.readlink) { throw new FS.ErrnoError(28); } return link.node_ops.readlink(link); }, stat(path, dontFollow) { var lookup = FS.lookupPath(path, { follow: !dontFollow }); var node = lookup.node; var getattr = FS.checkOpExists(node.node_ops.getattr, 63); return getattr(node); }, fstat(fd) { var stream = FS.getStreamChecked(fd); var node = stream.node; var getattr = stream.stream_ops.getattr; var arg = getattr ? stream : node; getattr ??= node.node_ops.getattr; FS.checkOpExists(getattr, 63) return getattr(arg); }, lstat(path) { return FS.stat(path, true); }, doChmod(stream, node, mode, dontFollow) { FS.doSetAttr(stream, node, { mode: (mode & 4095) | (node.mode & ~4095), ctime: Date.now(), dontFollow }); }, chmod(path, mode, dontFollow) { var node; if (typeof path == 'string') { var lookup = FS.lookupPath(path, { follow: !dontFollow }); node = lookup.node; } else { node = path; } FS.doChmod(null, node, mode, dontFollow); }, lchmod(path, mode) { FS.chmod(path, mode, true); }, fchmod(fd, mode) { var stream = FS.getStreamChecked(fd); FS.doChmod(stream, stream.node, mode, false); }, doChown(stream, node, dontFollow) { FS.doSetAttr(stream, node, { timestamp: Date.now(), dontFollow // we ignore the uid / gid for now }); }, chown(path, uid, gid, dontFollow) { var node; if (typeof path == 'string') { var lookup = FS.lookupPath(path, { follow: !dontFollow }); node = lookup.node; } else { node = path; } FS.doChown(null, node, dontFollow); }, lchown(path, uid, gid) { FS.chown(path, uid, gid, true); }, fchown(fd, uid, gid) { var stream = FS.getStreamChecked(fd); FS.doChown(stream, stream.node, false); }, doTruncate(stream, node, len) { if (FS.isDir(node.mode)) { throw new FS.ErrnoError(31); } if (!FS.isFile(node.mode)) { throw new FS.ErrnoError(28); } var errCode = FS.nodePermissions(node, 'w'); if (errCode) { throw new FS.ErrnoError(errCode); } FS.doSetAttr(stream, node, { size: len, timestamp: Date.now() }); }, truncate(path, len) { if (len < 0) { throw new FS.ErrnoError(28); } var node; if (typeof path == 'string') { var lookup = FS.lookupPath(path, { follow: true }); node = lookup.node; } else { node = path; } FS.doTruncate(null, node, len); }, ftruncate(fd, len) { var stream = FS.getStreamChecked(fd); if (len < 0 || (stream.flags & 2097155) === 0) { throw new FS.ErrnoError(28); } FS.doTruncate(stream, stream.node, len); }, utime(path, atime, mtime) { var lookup = FS.lookupPath(path, { follow: true }); var node = lookup.node; var setattr = FS.checkOpExists(node.node_ops.setattr, 63); setattr(node, { atime: atime, mtime: mtime }); }, open(path, flags, mode = 0o666) { if (path === "") { throw new FS.ErrnoError(44); } flags = typeof flags == 'string' ? FS_modeStringToFlags(flags) : flags; if ((flags & 64)) { mode = (mode & 4095) | 32768; } else { mode = 0; } var node; var isDirPath; if (typeof path == 'object') { node = path; } else { isDirPath = path.endsWith("/"); // noent_okay makes it so that if the final component of the path // doesn't exist, lookupPath returns `node: undefined`. `path` will be // updated to point to the target of all symlinks. var lookup = FS.lookupPath(path, { follow: !(flags & 131072), noent_okay: true }); node = lookup.node; path = lookup.path; } // perhaps we need to create the node var created = false; 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(20); } } else if (isDirPath) { throw new FS.ErrnoError(31); } else { // node doesn't exist, try to create it // Ignore the permission bits here to ensure we can `open` this new // file below. We use chmod below to apply the permissions once the // file is open. node = FS.mknod(path, mode | 0o777, 0); created = true; } } if (!node) { throw new FS.ErrnoError(44); } // can't truncate a device if (FS.isChrdev(node.mode)) { flags &= ~512; } // if asked only for a directory, then this must be one if ((flags & 65536) && !FS.isDir(node.mode)) { throw new FS.ErrnoError(54); } // check permissions, if this is not a file we just created now (it is ok to // create and write to a file with read-only permissions; it is read-only // for later use) if (!created) { var errCode = FS.mayOpen(node, flags); if (errCode) { throw new FS.ErrnoError(errCode); } } // do truncation if necessary if ((flags & 512) && !created) { FS.truncate(node, 0); } // we've already handled these, don't pass down to the underlying vfs flags &= ~(128 | 512 | 131072); // register the stream with the filesystem var stream = FS.createStream({ node, path: FS.getPath(node), // we want the absolute path to the node flags, seekable: true, position: 0, stream_ops: node.stream_ops, // used by the file family libc calls (fopen, fwrite, ferror, etc.) ungotten: [], error: false }); // call the new stream's open function if (stream.stream_ops.open) { stream.stream_ops.open(stream); } if (created) { FS.chmod(node, mode & 0o777); } return stream; }, close(stream) { if (FS.isClosed(stream)) { throw new FS.ErrnoError(8); } if (stream.getdents) stream.getdents = null; // free readdir state try { if (stream.stream_ops.close) { stream.stream_ops.close(stream); } } catch (e) { throw e; } finally { FS.closeStream(stream.fd); } stream.fd = null; }, isClosed(stream) { return stream.fd === null; }, llseek(stream, offset, whence) { if (FS.isClosed(stream)) { throw new FS.ErrnoError(8); } if (!stream.seekable || !stream.stream_ops.llseek) { throw new FS.ErrnoError(70); } if (whence != 0 && whence != 1 && whence != 2) { throw new FS.ErrnoError(28); } stream.position = stream.stream_ops.llseek(stream, offset, whence); stream.ungotten = []; return stream.position; }, read(stream, buffer, offset, length, position) { assert(offset >= 0); if (length < 0 || position < 0) { throw new FS.ErrnoError(28); } if (FS.isClosed(stream)) { throw new FS.ErrnoError(8); } if ((stream.flags & 2097155) === 1) { throw new FS.ErrnoError(8); } if (FS.isDir(stream.node.mode)) { throw new FS.ErrnoError(31); } if (!stream.stream_ops.read) { throw new FS.ErrnoError(28); } var seeking = typeof position != 'undefined'; if (!seeking) { position = stream.position; } else if (!stream.seekable) { throw new FS.ErrnoError(70); } var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position); if (!seeking) stream.position += bytesRead; return bytesRead; }, write(stream, buffer, offset, length, position, canOwn) { assert(offset >= 0); if (length < 0 || position < 0) { throw new FS.ErrnoError(28); } if (FS.isClosed(stream)) { throw new FS.ErrnoError(8); } if ((stream.flags & 2097155) === 0) { throw new FS.ErrnoError(8); } if (FS.isDir(stream.node.mode)) { throw new FS.ErrnoError(31); } if (!stream.stream_ops.write) { throw new FS.ErrnoError(28); } if (stream.seekable && stream.flags & 1024) { // seek to the end before writing in append mode FS.llseek(stream, 0, 2); } var seeking = typeof position != 'undefined'; if (!seeking) { position = stream.position; } else if (!stream.seekable) { throw new FS.ErrnoError(70); } var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn); if (!seeking) stream.position += bytesWritten; return bytesWritten; }, mmap(stream, length, position, prot, flags) { // User requests writing to file (prot & PROT_WRITE != 0). // Checking if we have permissions to write to the file unless // MAP_PRIVATE flag is set. According to POSIX spec it is possible // to write to file opened in read-only mode with MAP_PRIVATE flag, // as all modifications will be visible only in the memory of // the current process. if ((prot & 2) !== 0 && (flags & 2) === 0 && (stream.flags & 2097155) !== 2) { throw new FS.ErrnoError(2); } if ((stream.flags & 2097155) === 1) { throw new FS.ErrnoError(2); } if (!stream.stream_ops.mmap) { throw new FS.ErrnoError(43); } if (!length) { throw new FS.ErrnoError(28); } return stream.stream_ops.mmap(stream, length, position, prot, flags); }, msync(stream, buffer, offset, length, mmapFlags) { assert(offset >= 0); if (!stream.stream_ops.msync) { return 0; } return stream.stream_ops.msync(stream, buffer, offset, length, mmapFlags); }, ioctl(stream, cmd, arg) { if (!stream.stream_ops.ioctl) { throw new FS.ErrnoError(59); } return stream.stream_ops.ioctl(stream, cmd, arg); }, readFile(path, opts = {}) { opts.flags = opts.flags || 0; opts.encoding = opts.encoding || 'binary'; if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') { abort(`Invalid encoding type "${opts.encoding}"`); } 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') { buf = UTF8ArrayToString(buf); } FS.close(stream); return buf; }, writeFile(path, data, opts = {}) { opts.flags = opts.flags || 577; var stream = FS.open(path, opts.flags, opts.mode); if (typeof data == 'string') { data = new Uint8Array(intArrayFromString(data, true)); } if (ArrayBuffer.isView(data)) { FS.write(stream, data, 0, data.byteLength, undefined, opts.canOwn); } else { abort('Unsupported data type'); } FS.close(stream); }, cwd:() => FS.currentPath, chdir(path) { var lookup = FS.lookupPath(path, { follow: true }); if (lookup.node === null) { throw new FS.ErrnoError(44); } if (!FS.isDir(lookup.node.mode)) { throw new FS.ErrnoError(54); } var errCode = FS.nodePermissions(lookup.node, 'x'); if (errCode) { throw new FS.ErrnoError(errCode); } FS.currentPath = lookup.path; }, createDefaultDirectories() { FS.mkdir('/tmp'); FS.mkdir('/home'); FS.mkdir('/home/web_user'); }, createDefaultDevices() { // create /dev FS.mkdir('/dev'); // setup /dev/null FS.registerDevice(FS.makedev(1, 3), { read: () => 0, write: (stream, buffer, offset, length, pos) => length, llseek: () => 0, }); FS.mkdev('/dev/null', FS.makedev(1, 3)); // setup /dev/tty and /dev/tty1 // stderr needs to print output using err() rather than out() // 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)); // setup /dev/[u]random // use a buffer to avoid overhead of individual crypto calls per byte var randomBuffer = new Uint8Array(1024), randomLeft = 0; var randomByte = () => { if (randomLeft === 0) { randomFill(randomBuffer); randomLeft = randomBuffer.byteLength; } return randomBuffer[--randomLeft]; }; FS.createDevice('/dev', 'random', randomByte); FS.createDevice('/dev', 'urandom', randomByte); // 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'); }, createSpecialDirectories() { // create /proc/self/fd which allows /proc/self/fd/6 => readlink gives the // name of the stream for fd 6 (see test_unistd_ttyname) FS.mkdir('/proc'); var proc_self = FS.mkdir('/proc/self'); FS.mkdir('/proc/self/fd'); FS.mount({ mount() { var node = FS.createNode(proc_self, 'fd', 16895, 73); node.stream_ops = { llseek: MEMFS.stream_ops.llseek, }; node.node_ops = { lookup(parent, name) { var fd = +name; var stream = FS.getStreamChecked(fd); var ret = { parent: null, mount: { mountpoint: 'fake' }, node_ops: { readlink: () => stream.path }, id: fd + 1, }; ret.parent = ret; // make it look like a simple root node return ret; }, readdir() { return Array.from(FS.streams.entries()) .filter(([k, v]) => v) .map(([k, v]) => k.toString()); } }; return node; } }, {}, '/proc/self/fd'); }, createStandardStreams(input, output, error) { // 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 (input) { FS.createDevice('/dev', 'stdin', input); } else { FS.symlink('/dev/tty', '/dev/stdin'); } if (output) { FS.createDevice('/dev', 'stdout', null, output); } else { FS.symlink('/dev/tty', '/dev/stdout'); } if (error) { FS.createDevice('/dev', 'stderr', null, error); } else { FS.symlink('/dev/tty1', '/dev/stderr'); } // open default streams for the stdin, stdout and stderr devices var stdin = FS.open('/dev/stdin', 0); var stdout = FS.open('/dev/stdout', 1); var stderr = FS.open('/dev/stderr', 1); assert(stdin.fd === 0, `invalid handle for stdin (${stdin.fd})`); assert(stdout.fd === 1, `invalid handle for stdout (${stdout.fd})`); assert(stderr.fd === 2, `invalid handle for stderr (${stderr.fd})`); }, staticInit() { FS.nameTable = new Array(4096); FS.mount(MEMFS, {}, '/'); FS.createDefaultDirectories(); FS.createDefaultDevices(); FS.createSpecialDirectories(); FS.filesystems = { 'MEMFS': MEMFS, }; }, init(input, output, error) { assert(!FS.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.initialized = true; // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here input ??= Module['stdin']; output ??= Module['stdout']; error ??= Module['stderr']; FS.createStandardStreams(input, output, error); }, quit() { FS.initialized = false; // force-flush all streams, so we get musl std streams printed out _fflush(0); // close all of our streams for (var stream of FS.streams) { if (stream) { FS.close(stream); } } }, findObject(path, dontResolveLastLink) { var ret = FS.analyzePath(path, dontResolveLastLink); if (!ret.exists) { return null; } return ret.object; }, analyzePath(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; }, createPath(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) { if (e.errno != 20) throw e; } parent = current; } return current; }, createFile(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(parent, name, data, canRead, canWrite, canOwn) { var path = name; if (parent) { parent = typeof parent == 'string' ? parent : FS.getPath(parent); path = name ? PATH.join2(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, 577); FS.write(stream, data, 0, data.length, 0, canOwn); FS.close(stream); FS.chmod(node, mode); } }, createDevice(parent, name, input, output) { var path = PATH.join2(typeof parent == 'string' ? parent : FS.getPath(parent), name); var mode = FS_getMode(!!input, !!output); 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(stream) { stream.seekable = false; }, close(stream) { // flush any pending line data if (output?.buffer?.length) { output(10); } }, read(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(29); } if (result === undefined && bytesRead === 0) { throw new FS.ErrnoError(6); } if (result === null || result === undefined) break; bytesRead++; buffer[offset+i] = result; } if (bytesRead) { stream.node.atime = Date.now(); } return bytesRead; }, write(stream, buffer, offset, length, pos) { for (var i = 0; i < length; i++) { try { output(buffer[offset+i]); } catch (e) { throw new FS.ErrnoError(29); } } if (length) { stream.node.mtime = stream.node.ctime = Date.now(); } return i; } }); return FS.mkdev(path, mode, dev); }, forceLoadFile(obj) { if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true; if (globalThis.XMLHttpRequest) { abort("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 { // Command-line. try { obj.contents = readBinary(obj.url); } catch (e) { throw new FS.ErrnoError(29); } } }, createLazyFile(parent, name, url, canRead, canWrite) { // Lazy chunked Uint8Array (implements get and length from Uint8Array). // Actual getting is abstracted away for eventual reuse. class LazyUint8Array { lengthKnown = false; chunks = []; // Loaded chunks. Index is the chunk number get(idx) { if (idx > this.length-1 || idx < 0) { return undefined; } var chunkOffset = idx % this.chunkSize; var chunkNum = (idx / this.chunkSize)|0; return this.getter(chunkNum)[chunkOffset]; } setDataGetter(getter) { this.getter = getter; } 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)) abort("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 usesGzip = (header = xhr.getResponseHeader("Content-Encoding")) && header === "gzip"; var chunkSize = 1024*1024; // Chunk size in bytes if (!hasByteServing) chunkSize = datalength; // Function to get a range from the remote URL. var doXHR = (from, to) => { if (from > to) abort("invalid range (" + from + ", " + to + ") or no bytes requested!"); if (to > datalength-1) abort("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. 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)) abort("Couldn't load " + url + ". Status: " + xhr.status); if (xhr.response !== undefined) { return new Uint8Array(/** @type{Array} */(xhr.response || [])); } return intArrayFromString(xhr.responseText || '', true); }; var lazyArray = this; lazyArray.setDataGetter((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') abort('doXHR failed!'); return lazyArray.chunks[chunkNum]; }); if (usesGzip || !datalength) { // if the server uses gzip or doesn't supply the length, we have to download the whole file to get the (uncompressed) length chunkSize = datalength = 1; // this will force getter(0)/doXHR do download the whole file datalength = this.getter(0).length; chunkSize = datalength; out("LazyFiles on gzip forces download of the whole file when length is accessed"); } this._length = datalength; this._chunkSize = chunkSize; this.lengthKnown = true; } get length() { if (!this.lengthKnown) { this.cacheLength(); } return this._length; } get chunkSize() { if (!this.lengthKnown) { this.cacheLength(); } return this._chunkSize; } } if (globalThis.XMLHttpRequest) { if (!ENVIRONMENT_IS_WORKER) abort('Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc'); var lazyArray = new LazyUint8Array(); 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; } // Add a function that defers querying the file size until it is asked the first time. Object.defineProperties(node, { usedBytes: { get: function() { return this.contents.length; } } }); // override each stream op with one that tries to force load the lazy file first var stream_ops = {}; for (const [key, fn] of Object.entries(node.stream_ops)) { stream_ops[key] = (...args) => { FS.forceLoadFile(node); return fn(...args); }; } function writeChunks(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 (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; } // use a custom read function stream_ops.read = (stream, buffer, offset, length, position) => { FS.forceLoadFile(node); return writeChunks(stream, buffer, offset, length, position) }; // use a custom mmap function stream_ops.mmap = (stream, length, position, prot, flags) => { FS.forceLoadFile(node); var ptr = mmapAlloc(length); if (!ptr) { throw new FS.ErrnoError(48); } writeChunks(stream, HEAP8, ptr, length, position); return { ptr, allocated: true }; }; node.stream_ops = stream_ops; return node; }, absolutePath() { abort('FS.absolutePath has been removed; use PATH_FS.resolve instead'); }, createFolder() { abort('FS.createFolder has been removed; use FS.mkdir instead'); }, createLink() { abort('FS.createLink has been removed; use FS.symlink instead'); }, joinPath() { abort('FS.joinPath has been removed; use PATH.join instead'); }, mmapAlloc() { abort('FS.mmapAlloc has been replaced by the top level function mmapAlloc'); }, standardizePath() { abort('FS.standardizePath has been removed; use PATH.normalize instead'); }, }; var SYSCALLS = { calculateAt(dirfd, path, allowEmpty) { if (PATH.isAbs(path)) { return path; } // relative path var dir; if (dirfd === -100) { dir = FS.cwd(); } else { var dirstream = SYSCALLS.getStreamFromFD(dirfd); dir = dirstream.path; } if (path.length == 0) { if (!allowEmpty) { throw new FS.ErrnoError(44);; } return dir; } return dir + '/' + path; }, writeStat(buf, stat) { HEAPU32[((buf)>>2)] = stat.dev;checkInt32(stat.dev); HEAPU32[(((buf)+(4))>>2)] = stat.mode;checkInt32(stat.mode); HEAPU32[(((buf)+(8))>>2)] = stat.nlink;checkInt32(stat.nlink); HEAPU32[(((buf)+(12))>>2)] = stat.uid;checkInt32(stat.uid); HEAPU32[(((buf)+(16))>>2)] = stat.gid;checkInt32(stat.gid); HEAPU32[(((buf)+(20))>>2)] = stat.rdev;checkInt32(stat.rdev); (tempI64 = [stat.size>>>0,(tempDouble = stat.size,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(24))>>2)] = tempI64[0],HEAP32[(((buf)+(28))>>2)] = tempI64[1]);checkInt64(stat.size); HEAP32[(((buf)+(32))>>2)] = 4096;checkInt32(4096); HEAP32[(((buf)+(36))>>2)] = stat.blocks;checkInt32(stat.blocks); var atime = stat.atime.getTime(); var mtime = stat.mtime.getTime(); var ctime = stat.ctime.getTime(); (tempI64 = [Math.floor(atime / 1000)>>>0,(tempDouble = Math.floor(atime / 1000),(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(40))>>2)] = tempI64[0],HEAP32[(((buf)+(44))>>2)] = tempI64[1]);checkInt64(Math.floor(atime / 1000)); HEAPU32[(((buf)+(48))>>2)] = (atime % 1000) * 1000 * 1000;checkInt32((atime % 1000) * 1000 * 1000); (tempI64 = [Math.floor(mtime / 1000)>>>0,(tempDouble = Math.floor(mtime / 1000),(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(56))>>2)] = tempI64[0],HEAP32[(((buf)+(60))>>2)] = tempI64[1]);checkInt64(Math.floor(mtime / 1000)); HEAPU32[(((buf)+(64))>>2)] = (mtime % 1000) * 1000 * 1000;checkInt32((mtime % 1000) * 1000 * 1000); (tempI64 = [Math.floor(ctime / 1000)>>>0,(tempDouble = Math.floor(ctime / 1000),(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(72))>>2)] = tempI64[0],HEAP32[(((buf)+(76))>>2)] = tempI64[1]);checkInt64(Math.floor(ctime / 1000)); HEAPU32[(((buf)+(80))>>2)] = (ctime % 1000) * 1000 * 1000;checkInt32((ctime % 1000) * 1000 * 1000); (tempI64 = [stat.ino>>>0,(tempDouble = stat.ino,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(88))>>2)] = tempI64[0],HEAP32[(((buf)+(92))>>2)] = tempI64[1]);checkInt64(stat.ino); return 0; }, writeStatFs(buf, stats) { HEAPU32[(((buf)+(4))>>2)] = stats.bsize;checkInt32(stats.bsize); HEAPU32[(((buf)+(60))>>2)] = stats.bsize;checkInt32(stats.bsize); (tempI64 = [stats.blocks>>>0,(tempDouble = stats.blocks,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(8))>>2)] = tempI64[0],HEAP32[(((buf)+(12))>>2)] = tempI64[1]);checkInt64(stats.blocks); (tempI64 = [stats.bfree>>>0,(tempDouble = stats.bfree,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(16))>>2)] = tempI64[0],HEAP32[(((buf)+(20))>>2)] = tempI64[1]);checkInt64(stats.bfree); (tempI64 = [stats.bavail>>>0,(tempDouble = stats.bavail,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(24))>>2)] = tempI64[0],HEAP32[(((buf)+(28))>>2)] = tempI64[1]);checkInt64(stats.bavail); (tempI64 = [stats.files>>>0,(tempDouble = stats.files,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(32))>>2)] = tempI64[0],HEAP32[(((buf)+(36))>>2)] = tempI64[1]);checkInt64(stats.files); (tempI64 = [stats.ffree>>>0,(tempDouble = stats.ffree,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((buf)+(40))>>2)] = tempI64[0],HEAP32[(((buf)+(44))>>2)] = tempI64[1]);checkInt64(stats.ffree); HEAPU32[(((buf)+(48))>>2)] = stats.fsid;checkInt32(stats.fsid); HEAPU32[(((buf)+(64))>>2)] = stats.flags;checkInt32(stats.flags); // ST_NOSUID HEAPU32[(((buf)+(56))>>2)] = stats.namelen;checkInt32(stats.namelen); }, doMsync(addr, stream, len, flags, offset) { if (!FS.isFile(stream.node.mode)) { throw new FS.ErrnoError(43); } if (flags & 2) { // MAP_PRIVATE calls need not to be synced back to underlying fs return 0; } var buffer = HEAPU8.slice(addr, addr + len); FS.msync(stream, buffer, offset, len, flags); }, getStreamFromFD(fd) { var stream = FS.getStreamChecked(fd); return stream; }, varargs:undefined, getStr(ptr) { var ret = UTF8ToString(ptr); return ret; }, }; function ___syscall_chmod(path, mode) { try { path = SYSCALLS.getStr(path); FS.chmod(path, mode); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_faccessat(dirfd, path, amode, flags) { try { path = SYSCALLS.getStr(path); assert(!flags || flags == 512); path = SYSCALLS.calculateAt(dirfd, path); if (amode & ~7) { // need a valid mode return -28; } var lookup = FS.lookupPath(path, { follow: true }); var node = lookup.node; if (!node) { return -44; } var perms = ''; if (amode & 4) perms += 'r'; if (amode & 2) perms += 'w'; if (amode & 1) perms += 'x'; if (perms /* otherwise, they've just passed F_OK */ && FS.nodePermissions(node, perms)) { return -2; } return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_fchmod(fd, mode) { try { FS.fchmod(fd, mode); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_fchown32(fd, owner, group) { try { FS.fchown(fd, owner, group); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } var syscallGetVarargI = () => { assert(SYSCALLS.varargs != undefined); // the `+` prepended here is necessary to convince the JSCompiler that varargs is indeed a number. var ret = HEAP32[((+SYSCALLS.varargs)>>2)]; SYSCALLS.varargs += 4; return ret; }; var syscallGetVarargP = syscallGetVarargI; function ___syscall_fcntl64(fd, cmd, varargs) { SYSCALLS.varargs = varargs; try { var stream = SYSCALLS.getStreamFromFD(fd); switch (cmd) { case 0: { var arg = syscallGetVarargI(); if (arg < 0) { return -28; } while (FS.streams[arg]) { arg++; } var newStream; newStream = FS.dupStream(stream, arg); return newStream.fd; } case 1: case 2: return 0; // FD_CLOEXEC makes no sense for a single process. case 3: return stream.flags; case 4: { var arg = syscallGetVarargI(); stream.flags |= arg; return 0; } case 12: { var arg = syscallGetVarargP(); var offset = 0; // We're always unlocked. HEAP16[(((arg)+(offset))>>1)] = 2;checkInt16(2); return 0; } case 13: case 14: // Pretend that the locking is successful. These are process-level locks, // and Emscripten programs are a single process. If we supported linking a // filesystem between programs, we'd need to do more here. // See https://github.com/emscripten-core/emscripten/issues/23697 return 0; } return -28; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_fstat64(fd, buf) { try { return SYSCALLS.writeStat(buf, FS.fstat(fd)); } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } var convertI32PairToI53Checked = (lo, hi) => { assert(lo == (lo >>> 0) || lo == (lo|0)); // lo should either be a i32 or a u32 assert(hi === (hi|0)); // hi should be a i32 return ((hi + 0x200000) >>> 0 < 0x400001 - !!lo) ? (lo >>> 0) + hi * 4294967296 : NaN; }; function ___syscall_ftruncate64(fd,length_low, length_high) { var length = convertI32PairToI53Checked(length_low, length_high); try { if (isNaN(length)) return -61; FS.ftruncate(fd, length); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } ; } var stringToUTF8 = (str, outPtr, maxBytesToWrite) => { assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!'); return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite); }; function ___syscall_getcwd(buf, size) { try { if (size === 0) return -28; var cwd = FS.cwd(); var cwdLengthInBytes = lengthBytesUTF8(cwd) + 1; if (size < cwdLengthInBytes) return -68; stringToUTF8(cwd, buf, size); return cwdLengthInBytes; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_lstat64(path, buf) { try { path = SYSCALLS.getStr(path); return SYSCALLS.writeStat(buf, FS.lstat(path)); } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_mkdirat(dirfd, path, mode) { try { path = SYSCALLS.getStr(path); path = SYSCALLS.calculateAt(dirfd, path); FS.mkdir(path, mode, 0); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_newfstatat(dirfd, path, buf, flags) { try { path = SYSCALLS.getStr(path); var nofollow = flags & 256; var allowEmpty = flags & 4096; flags = flags & (~6400); assert(!flags, `unknown flags in __syscall_newfstatat: ${flags}`); path = SYSCALLS.calculateAt(dirfd, path, allowEmpty); return SYSCALLS.writeStat(buf, nofollow ? FS.lstat(path) : FS.stat(path)); } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_openat(dirfd, path, flags, varargs) { SYSCALLS.varargs = varargs; try { path = SYSCALLS.getStr(path); path = SYSCALLS.calculateAt(dirfd, path); var mode = varargs ? syscallGetVarargI() : 0; return FS.open(path, flags, mode).fd; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_readlinkat(dirfd, path, buf, bufsize) { try { path = SYSCALLS.getStr(path); path = SYSCALLS.calculateAt(dirfd, path); if (bufsize <= 0) return -28; var ret = FS.readlink(path); var len = Math.min(bufsize, lengthBytesUTF8(ret)); var endChar = HEAP8[buf+len]; stringToUTF8(ret, buf, bufsize+1); // readlink is one of the rare functions that write out a C string, but does never append a null to the output buffer(!) // stringToUTF8() always appends a null byte, so restore the character under the null byte after the write. HEAP8[buf+len] = endChar; return len; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_rmdir(path) { try { path = SYSCALLS.getStr(path); FS.rmdir(path); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_stat64(path, buf) { try { path = SYSCALLS.getStr(path); return SYSCALLS.writeStat(buf, FS.stat(path)); } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } function ___syscall_unlinkat(dirfd, path, flags) { try { path = SYSCALLS.getStr(path); path = SYSCALLS.calculateAt(dirfd, path); if (!flags) { FS.unlink(path); } else if (flags === 512) { FS.rmdir(path); } else { return -28; } return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } var readI53FromI64 = (ptr) => { return HEAPU32[((ptr)>>2)] + HEAP32[(((ptr)+(4))>>2)] * 4294967296; }; function ___syscall_utimensat(dirfd, path, times, flags) { try { path = SYSCALLS.getStr(path); assert(!flags); path = SYSCALLS.calculateAt(dirfd, path, true); var now = Date.now(), atime, mtime; if (!times) { atime = now; mtime = now; } else { var seconds = readI53FromI64(times); var nanoseconds = HEAP32[(((times)+(8))>>2)]; if (nanoseconds == 1073741823) { atime = now; } else if (nanoseconds == 1073741822) { atime = null; } else { atime = (seconds*1000) + (nanoseconds/(1000*1000)); } times += 16; seconds = readI53FromI64(times); nanoseconds = HEAP32[(((times)+(8))>>2)]; if (nanoseconds == 1073741823) { mtime = now; } else if (nanoseconds == 1073741822) { mtime = null; } else { mtime = (seconds*1000) + (nanoseconds/(1000*1000)); } } // null here means UTIME_OMIT was passed. If both were set to UTIME_OMIT then // we can skip the call completely. if ((mtime ?? atime) !== null) { FS.utime(path, atime, mtime); } return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } } var __abort_js = () => abort('native code called abort()'); var isLeapYear = (year) => year%4 === 0 && (year%100 !== 0 || year%400 === 0); var MONTH_DAYS_LEAP_CUMULATIVE = [0,31,60,91,121,152,182,213,244,274,305,335]; var MONTH_DAYS_REGULAR_CUMULATIVE = [0,31,59,90,120,151,181,212,243,273,304,334]; var ydayFromDate = (date) => { var leap = isLeapYear(date.getFullYear()); var monthDaysCumulative = (leap ? MONTH_DAYS_LEAP_CUMULATIVE : MONTH_DAYS_REGULAR_CUMULATIVE); var yday = monthDaysCumulative[date.getMonth()] + date.getDate() - 1; // -1 since it's days since Jan 1 return yday; }; function __localtime_js(time_low, time_high,tmPtr) { var time = convertI32PairToI53Checked(time_low, time_high); var date = new Date(time*1000); HEAP32[((tmPtr)>>2)] = date.getSeconds();checkInt32(date.getSeconds()); HEAP32[(((tmPtr)+(4))>>2)] = date.getMinutes();checkInt32(date.getMinutes()); HEAP32[(((tmPtr)+(8))>>2)] = date.getHours();checkInt32(date.getHours()); HEAP32[(((tmPtr)+(12))>>2)] = date.getDate();checkInt32(date.getDate()); HEAP32[(((tmPtr)+(16))>>2)] = date.getMonth();checkInt32(date.getMonth()); HEAP32[(((tmPtr)+(20))>>2)] = date.getFullYear()-1900;checkInt32(date.getFullYear()-1900); HEAP32[(((tmPtr)+(24))>>2)] = date.getDay();checkInt32(date.getDay()); var yday = ydayFromDate(date)|0; HEAP32[(((tmPtr)+(28))>>2)] = yday;checkInt32(yday); HEAP32[(((tmPtr)+(36))>>2)] = -(date.getTimezoneOffset() * 60);checkInt32(-(date.getTimezoneOffset() * 60)); // Attention: DST is in December in South, and some regions don't have DST at all. var start = new Date(date.getFullYear(), 0, 1); var summerOffset = new Date(date.getFullYear(), 6, 1).getTimezoneOffset(); var winterOffset = start.getTimezoneOffset(); var dst = (summerOffset != winterOffset && date.getTimezoneOffset() == Math.min(winterOffset, summerOffset))|0; HEAP32[(((tmPtr)+(32))>>2)] = dst;checkInt32(dst); ; } function __mmap_js(len,prot,flags,fd,offset_low, offset_high,allocated,addr) { var offset = convertI32PairToI53Checked(offset_low, offset_high); try { // musl's mmap doesn't allow values over a certain limit // see OFF_MASK in mmap.c. assert(!isNaN(offset)); var stream = SYSCALLS.getStreamFromFD(fd); var res = FS.mmap(stream, len, offset, prot, flags); var ptr = res.ptr; HEAP32[((allocated)>>2)] = res.allocated;checkInt32(res.allocated); HEAPU32[((addr)>>2)] = ptr; return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } ; } function __munmap_js(addr,len,prot,flags,fd,offset_low, offset_high) { var offset = convertI32PairToI53Checked(offset_low, offset_high); try { var stream = SYSCALLS.getStreamFromFD(fd); if (prot & 2) { SYSCALLS.doMsync(addr, stream, len, flags, offset); } } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return -e.errno; } ; } var __tzset_js = (timezone, daylight, std_name, dst_name) => { // TODO: Use (malleable) environment variables instead of system settings. var currentYear = new Date().getFullYear(); var winter = new Date(currentYear, 0, 1); var summer = new Date(currentYear, 6, 1); var winterOffset = winter.getTimezoneOffset(); var summerOffset = summer.getTimezoneOffset(); // Local standard timezone offset. Local standard time is not adjusted for // daylight savings. This code uses the fact that getTimezoneOffset returns // a greater value during Standard Time versus Daylight Saving Time (DST). // Thus it determines the expected output during Standard Time, and it // compares whether the output of the given date the same (Standard) or less // (DST). var stdTimezoneOffset = Math.max(winterOffset, summerOffset); // timezone is specified as seconds west of UTC ("The external variable // `timezone` shall be set to the difference, in seconds, between // Coordinated Universal Time (UTC) and local standard time."), the same // as returned by stdTimezoneOffset. // See http://pubs.opengroup.org/onlinepubs/009695399/functions/tzset.html HEAPU32[((timezone)>>2)] = stdTimezoneOffset * 60; HEAP32[((daylight)>>2)] = Number(winterOffset != summerOffset);checkInt32(Number(winterOffset != summerOffset)); var extractZone = (timezoneOffset) => { // Why inverse sign? // Read here https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/getTimezoneOffset var sign = timezoneOffset >= 0 ? "-" : "+"; var absOffset = Math.abs(timezoneOffset) var hours = String(Math.floor(absOffset / 60)).padStart(2, "0"); var minutes = String(absOffset % 60).padStart(2, "0"); return `UTC${sign}${hours}${minutes}`; } var winterName = extractZone(winterOffset); var summerName = extractZone(summerOffset); assert(winterName); assert(summerName); assert(lengthBytesUTF8(winterName) <= 16, `timezone name truncated to fit in TZNAME_MAX (${winterName})`); assert(lengthBytesUTF8(summerName) <= 16, `timezone name truncated to fit in TZNAME_MAX (${summerName})`); if (summerOffset < winterOffset) { // Northern hemisphere stringToUTF8(winterName, std_name, 17); stringToUTF8(summerName, dst_name, 17); } else { stringToUTF8(winterName, dst_name, 17); stringToUTF8(summerName, std_name, 17); } }; var _emscripten_get_now = () => performance.now(); var _emscripten_date_now = () => Date.now(); var nowIsMonotonic = 1; var checkWasiClock = (clock_id) => clock_id >= 0 && clock_id <= 3; function _clock_time_get(clk_id,ignored_precision_low, ignored_precision_high,ptime) { var ignored_precision = convertI32PairToI53Checked(ignored_precision_low, ignored_precision_high); if (!checkWasiClock(clk_id)) { return 28; } var now; // all wasi clocks but realtime are monotonic if (clk_id === 0) { now = _emscripten_date_now(); } else if (nowIsMonotonic) { now = _emscripten_get_now(); } else { return 52; } // "now" is in ms, and wasi times are in ns. var nsec = Math.round(now * 1000 * 1000); (tempI64 = [nsec>>>0,(tempDouble = nsec,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[((ptime)>>2)] = tempI64[0],HEAP32[(((ptime)+(4))>>2)] = tempI64[1]);checkInt64(nsec); return 0; ; } var getHeapMax = () => HEAPU8.length; var _emscripten_get_heap_max = () => getHeapMax(); var abortOnCannotGrowMemory = (requestedSize) => { abort(`Cannot enlarge memory arrays to size ${requestedSize} bytes (OOM). Either (1) compile with -sINITIAL_MEMORY=X with X higher than the current value ${HEAP8.length}, (2) compile with -sALLOW_MEMORY_GROWTH which allows increasing the size at runtime, or (3) if you want malloc to return NULL (0) instead of this abort, compile with -sABORTING_MALLOC=0`); }; var _emscripten_resize_heap = (requestedSize) => { var oldSize = HEAPU8.length; // With CAN_ADDRESS_2GB or MEMORY64, pointers are already unsigned. requestedSize >>>= 0; abortOnCannotGrowMemory(requestedSize); }; var ENV = { }; var getExecutableName = () => thisProgram || './this.program'; var getEnvStrings = () => { if (!getEnvStrings.strings) { // Default values. // Browser language detection #8751 var lang = (globalThis.navigator?.language ?? 'C').replace('-', '_') + '.UTF-8'; var env = { 'USER': 'web_user', 'LOGNAME': 'web_user', 'PATH': '/', 'PWD': '/', 'HOME': '/home/web_user', 'LANG': lang, '_': getExecutableName() }; // Apply the user-provided values, if any. for (var x in ENV) { // x is a key in ENV; if ENV[x] is undefined, that means it was // explicitly set to be so. We allow user code to do that to // force variables with default values to remain unset. if (ENV[x] === undefined) delete env[x]; else env[x] = ENV[x]; } var strings = []; for (var x in env) { strings.push(`${x}=${env[x]}`); } getEnvStrings.strings = strings; } return getEnvStrings.strings; }; var _environ_get = (__environ, environ_buf) => { var bufSize = 0; var envp = 0; for (var string of getEnvStrings()) { var ptr = environ_buf + bufSize; HEAPU32[(((__environ)+(envp))>>2)] = ptr; bufSize += stringToUTF8(string, ptr, Infinity) + 1; envp += 4; } return 0; }; var _environ_sizes_get = (penviron_count, penviron_buf_size) => { var strings = getEnvStrings(); HEAPU32[((penviron_count)>>2)] = strings.length;checkInt32(strings.length); var bufSize = 0; for (var string of strings) { bufSize += lengthBytesUTF8(string) + 1; } HEAPU32[((penviron_buf_size)>>2)] = bufSize;checkInt32(bufSize); return 0; }; function _fd_close(fd) { try { var stream = SYSCALLS.getStreamFromFD(fd); FS.close(stream); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } } function _fd_fdstat_get(fd, pbuf) { try { var rightsBase = 0; var rightsInheriting = 0; var flags = 0; { var stream = SYSCALLS.getStreamFromFD(fd); // All character devices are terminals (other things a Linux system would // assume is a character device, like the mouse, we have special APIs for). var type = stream.tty ? 2 : FS.isDir(stream.mode) ? 3 : FS.isLink(stream.mode) ? 7 : 4; } HEAP8[pbuf] = type;checkInt8(type); HEAP16[(((pbuf)+(2))>>1)] = flags;checkInt16(flags); (tempI64 = [rightsBase>>>0,(tempDouble = rightsBase,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((pbuf)+(8))>>2)] = tempI64[0],HEAP32[(((pbuf)+(12))>>2)] = tempI64[1]);checkInt64(rightsBase); (tempI64 = [rightsInheriting>>>0,(tempDouble = rightsInheriting,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[(((pbuf)+(16))>>2)] = tempI64[0],HEAP32[(((pbuf)+(20))>>2)] = tempI64[1]);checkInt64(rightsInheriting); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } } /** @param {number=} offset */ var doReadv = (stream, iov, iovcnt, offset) => { var ret = 0; for (var i = 0; i < iovcnt; i++) { var ptr = HEAPU32[((iov)>>2)]; var len = HEAPU32[(((iov)+(4))>>2)]; iov += 8; var curr = FS.read(stream, HEAP8, ptr, len, offset); if (curr < 0) return -1; ret += curr; if (curr < len) break; // nothing more to read if (typeof offset != 'undefined') { offset += curr; } } return ret; }; function _fd_read(fd, iov, iovcnt, pnum) { try { var stream = SYSCALLS.getStreamFromFD(fd); var num = doReadv(stream, iov, iovcnt); HEAPU32[((pnum)>>2)] = num;checkInt32(num); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } } function _fd_seek(fd,offset_low, offset_high,whence,newOffset) { var offset = convertI32PairToI53Checked(offset_low, offset_high); try { if (isNaN(offset)) return 61; var stream = SYSCALLS.getStreamFromFD(fd); FS.llseek(stream, offset, whence); (tempI64 = [stream.position>>>0,(tempDouble = stream.position,(+(Math.abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? (+(Math.floor((tempDouble)/4294967296.0)))>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)], HEAP32[((newOffset)>>2)] = tempI64[0],HEAP32[(((newOffset)+(4))>>2)] = tempI64[1]);checkInt64(stream.position); if (stream.getdents && offset === 0 && whence === 0) stream.getdents = null; // reset readdir state return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } ; } function _fd_sync(fd) { try { var stream = SYSCALLS.getStreamFromFD(fd); var rtn = stream.stream_ops?.fsync?.(stream); return rtn; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } } /** @param {number=} offset */ var doWritev = (stream, iov, iovcnt, offset) => { var ret = 0; for (var i = 0; i < iovcnt; i++) { var ptr = HEAPU32[((iov)>>2)]; var len = HEAPU32[(((iov)+(4))>>2)]; iov += 8; var curr = FS.write(stream, HEAP8, ptr, len, offset); if (curr < 0) return -1; ret += curr; if (curr < len) { // No more space to write. break; } if (typeof offset != 'undefined') { offset += curr; } } return ret; }; function _fd_write(fd, iov, iovcnt, pnum) { try { var stream = SYSCALLS.getStreamFromFD(fd); var num = doWritev(stream, iov, iovcnt); HEAPU32[((pnum)>>2)] = num;checkInt32(num); return 0; } catch (e) { if (typeof FS == 'undefined' || !(e.name === 'ErrnoError')) throw e; return e.errno; } } var getCFunc = (ident) => { var func = Module['_' + ident]; // closure exported function assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported'); return func; }; var writeArrayToMemory = (array, buffer) => { assert(array.length >= 0, 'writeArrayToMemory array must have a length (should be an array or typed array)') HEAP8.set(array, buffer); }; var stackAlloc = (sz) => __emscripten_stack_alloc(sz); var stringToUTF8OnStack = (str) => { var size = lengthBytesUTF8(str) + 1; var ret = stackAlloc(size); stringToUTF8(str, ret, size); return ret; }; /** * @param {string|null=} returnType * @param {Array=} argTypes * @param {Array=} args * @param {Object=} opts */ var ccall = (ident, returnType, argTypes, args, opts) => { // For fast lookup of conversion functions var toC = { 'string': (str) => { var ret = 0; if (str !== null && str !== undefined && str !== 0) { // null string ret = stringToUTF8OnStack(str); } return ret; }, 'array': (arr) => { var ret = stackAlloc(arr.length); writeArrayToMemory(arr, ret); return ret; } }; function convertReturnValue(ret) { if (returnType === 'string') { return UTF8ToString(ret); } if (returnType === 'boolean') return Boolean(ret); return ret; } var func = getCFunc(ident); var cArgs = []; var stack = 0; assert(returnType !== 'array', 'Return type should not be "array".'); if (args) { for (var i = 0; i < args.length; i++) { var converter = toC[argTypes[i]]; if (converter) { if (stack === 0) stack = stackSave(); cArgs[i] = converter(args[i]); } else { cArgs[i] = args[i]; } } } var ret = func(...cArgs); function onDone(ret) { if (stack !== 0) stackRestore(stack); return convertReturnValue(ret); } ret = onDone(ret); return ret; }; /** * @param {string=} returnType * @param {Array=} argTypes * @param {Object=} opts */ var cwrap = (ident, returnType, argTypes, opts) => { return (...args) => ccall(ident, returnType, argTypes, args, opts); }; var stringToNewUTF8 = (str) => { var size = lengthBytesUTF8(str) + 1; var ret = _malloc(size); if (ret) stringToUTF8(str, ret, size); return ret; }; var functionsInTableMap; var freeTableIndexes = []; var wasmTableMirror = []; var getWasmTableEntry = (funcPtr) => { var func = wasmTableMirror[funcPtr]; if (!func) { /** @suppress {checkTypes} */ wasmTableMirror[funcPtr] = func = wasmTable.get(funcPtr); } /** @suppress {checkTypes} */ assert(wasmTable.get(funcPtr) == func, 'JavaScript-side Wasm function table mirror is out of date!'); return func; }; var setWasmTableEntry = (idx, func) => { /** @suppress {checkTypes} */ wasmTable.set(idx, func); // With ABORT_ON_WASM_EXCEPTIONS wasmTable.get is overridden to return wrapped // functions so we need to call it here to retrieve the potential wrapper correctly // instead of just storing 'func' directly into wasmTableMirror /** @suppress {checkTypes} */ wasmTableMirror[idx] = wasmTable.get(idx); }; var removeFunction = (index) => { functionsInTableMap.delete(getWasmTableEntry(index)); setWasmTableEntry(index, null); freeTableIndexes.push(index); }; var updateTableMap = (offset, count) => { if (functionsInTableMap) { for (var i = offset; i < offset + count; i++) { var item = getWasmTableEntry(i); // Ignore null values. if (item) { functionsInTableMap.set(item, i); } } } }; var getFunctionAddress = (func) => { // First, create the map if this is the first use. if (!functionsInTableMap) { functionsInTableMap = new WeakMap(); updateTableMap(0, wasmTable.length); } return functionsInTableMap.get(func) || 0; }; var getEmptyTableSlot = () => { // Reuse a free index if there is one, otherwise grow. if (freeTableIndexes.length) { return freeTableIndexes.pop(); } try { // Grow the table return wasmTable['grow'](1); } catch (err) { if (!(err instanceof RangeError)) { throw err; } abort('Unable to grow wasm table. Set ALLOW_TABLE_GROWTH.'); } }; /** @param {string=} sig */ var addFunction = (func, sig) => { assert(typeof func != 'undefined'); // Check if the function is already in the table, to ensure each function // gets a unique index. var rtn = getFunctionAddress(func); if (rtn) { return rtn; } // It's not in the table, add it now. // Make sure functionsInTableMap is actually up to date, that is, that this // function is not actually in the wasm Table despite not being tracked in // functionsInTableMap. for (var i = 0; i < wasmTable.length; i++) { assert(getWasmTableEntry(i) != func, 'function in Table but not functionsInTableMap'); } var ret = getEmptyTableSlot(); setWasmTableEntry(ret, func); functionsInTableMap.set(func, ret); return ret; }; FS.createPreloadedFile = FS_createPreloadedFile; FS.preloadFile = FS_preloadFile; FS.staticInit();; // End JS library code // include: postlibrary.js // This file is included after the automatically-generated JS library code // but before the wasm module is created. { // Begin ATMODULES hooks if (Module['noExitRuntime']) noExitRuntime = Module['noExitRuntime']; if (Module['preloadPlugins']) preloadPlugins = Module['preloadPlugins']; if (Module['print']) out = Module['print']; if (Module['printErr']) err = Module['printErr']; if (Module['wasmBinary']) wasmBinary = Module['wasmBinary']; // End ATMODULES hooks checkIncomingModuleAPI(); if (Module['arguments']) arguments_ = Module['arguments']; if (Module['thisProgram']) thisProgram = Module['thisProgram']; // Assertions on removed incoming Module JS APIs. assert(typeof Module['memoryInitializerPrefixURL'] == 'undefined', 'Module.memoryInitializerPrefixURL option was removed, use Module.locateFile instead'); assert(typeof Module['pthreadMainPrefixURL'] == 'undefined', 'Module.pthreadMainPrefixURL option was removed, use Module.locateFile instead'); assert(typeof Module['cdInitializerPrefixURL'] == 'undefined', 'Module.cdInitializerPrefixURL option was removed, use Module.locateFile instead'); assert(typeof Module['filePackagePrefixURL'] == 'undefined', 'Module.filePackagePrefixURL option was removed, use Module.locateFile instead'); assert(typeof Module['read'] == 'undefined', 'Module.read option was removed'); assert(typeof Module['readAsync'] == 'undefined', 'Module.readAsync option was removed (modify readAsync in JS)'); assert(typeof Module['readBinary'] == 'undefined', 'Module.readBinary option was removed (modify readBinary in JS)'); assert(typeof Module['setWindowTitle'] == 'undefined', 'Module.setWindowTitle option was removed (modify emscripten_set_window_title in JS)'); assert(typeof Module['TOTAL_MEMORY'] == 'undefined', 'Module.TOTAL_MEMORY has been renamed Module.INITIAL_MEMORY'); assert(typeof Module['ENVIRONMENT'] == 'undefined', 'Module.ENVIRONMENT has been deprecated. To force the environment, use the ENVIRONMENT compile-time option (for example, -sENVIRONMENT=web or -sENVIRONMENT=node)'); assert(typeof Module['STACK_SIZE'] == 'undefined', 'STACK_SIZE can no longer be set at runtime. Use -sSTACK_SIZE at link time') // If memory is defined in wasm, the user can't provide it, or set INITIAL_MEMORY assert(typeof Module['wasmMemory'] == 'undefined', 'Use of `wasmMemory` detected. Use -sIMPORTED_MEMORY to define wasmMemory externally'); assert(typeof Module['INITIAL_MEMORY'] == 'undefined', 'Detected runtime INITIAL_MEMORY setting. Use -sIMPORTED_MEMORY to define wasmMemory dynamically'); if (Module['preInit']) { if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']]; while (Module['preInit'].length > 0) { Module['preInit'].shift()(); } } consumedModuleProp('preInit'); } // Begin runtime exports Module['stackSave'] = stackSave; Module['stackRestore'] = stackRestore; Module['stackAlloc'] = stackAlloc; Module['cwrap'] = cwrap; Module['addFunction'] = addFunction; Module['removeFunction'] = removeFunction; Module['UTF8ToString'] = UTF8ToString; Module['stringToNewUTF8'] = stringToNewUTF8; Module['writeArrayToMemory'] = writeArrayToMemory; var missingLibrarySymbols = [ 'writeI53ToI64', 'writeI53ToI64Clamped', 'writeI53ToI64Signaling', 'writeI53ToU64Clamped', 'writeI53ToU64Signaling', 'readI53FromU64', 'convertI32PairToI53', 'convertU32PairToI53', 'getTempRet0', 'setTempRet0', 'createNamedFunction', 'exitJS', 'growMemory', 'withStackSave', 'inetPton4', 'inetNtop4', 'inetPton6', 'inetNtop6', 'readSockaddr', 'writeSockaddr', 'readEmAsmArgs', 'jstoi_q', 'autoResumeAudioContext', 'dynCallLegacy', 'getDynCaller', 'dynCall', 'handleException', 'keepRuntimeAlive', 'runtimeKeepalivePush', 'runtimeKeepalivePop', 'callUserCallback', 'maybeExit', 'asmjsMangle', 'HandleAllocator', 'addOnInit', 'addOnPostCtor', 'addOnPreMain', 'addOnExit', 'STACK_SIZE', 'STACK_ALIGN', 'POINTER_SIZE', 'ASSERTIONS', 'intArrayToString', 'AsciiToString', 'stringToAscii', 'UTF16ToString', 'stringToUTF16', 'lengthBytesUTF16', 'UTF32ToString', 'stringToUTF32', 'lengthBytesUTF32', 'registerKeyEventCallback', 'maybeCStringToJsString', 'findEventTarget', 'getBoundingClientRect', 'fillMouseEventData', 'registerMouseEventCallback', 'registerWheelEventCallback', 'registerUiEventCallback', 'registerFocusEventCallback', 'fillDeviceOrientationEventData', 'registerDeviceOrientationEventCallback', 'fillDeviceMotionEventData', 'registerDeviceMotionEventCallback', 'screenOrientation', 'fillOrientationChangeEventData', 'registerOrientationChangeEventCallback', 'fillFullscreenChangeEventData', 'registerFullscreenChangeEventCallback', 'JSEvents_requestFullscreen', 'JSEvents_resizeCanvasForFullscreen', 'registerRestoreOldStyle', 'hideEverythingExceptGivenElement', 'restoreHiddenElements', 'setLetterbox', 'softFullscreenResizeWebGLRenderTarget', 'doRequestFullscreen', 'fillPointerlockChangeEventData', 'registerPointerlockChangeEventCallback', 'registerPointerlockErrorEventCallback', 'requestPointerLock', 'fillVisibilityChangeEventData', 'registerVisibilityChangeEventCallback', 'registerTouchEventCallback', 'fillGamepadEventData', 'registerGamepadEventCallback', 'registerBeforeUnloadEventCallback', 'fillBatteryEventData', 'registerBatteryEventCallback', 'setCanvasElementSize', 'getCanvasElementSize', 'jsStackTrace', 'getCallstack', 'convertPCtoSourceLocation', 'wasiRightsToMuslOFlags', 'wasiOFlagsToMuslOFlags', 'safeSetTimeout', 'setImmediateWrapped', 'safeRequestAnimationFrame', 'clearImmediateWrapped', 'registerPostMainLoop', 'registerPreMainLoop', 'getPromise', 'makePromise', 'idsToPromises', 'makePromiseCallback', 'ExceptionInfo', 'findMatchingCatch', 'Browser_asyncPrepareDataCounter', 'arraySum', 'addDays', 'getSocketFromFD', 'getSocketAddress', 'FS_mkdirTree', '_setNetworkCallback', 'heapObjectForWebGLType', 'toTypedArrayIndex', 'webgl_enable_ANGLE_instanced_arrays', 'webgl_enable_OES_vertex_array_object', 'webgl_enable_WEBGL_draw_buffers', 'webgl_enable_WEBGL_multi_draw', 'webgl_enable_EXT_polygon_offset_clamp', 'webgl_enable_EXT_clip_control', 'webgl_enable_WEBGL_polygon_mode', 'emscriptenWebGLGet', 'computeUnpackAlignedImageSize', 'colorChannelsInGlTextureFormat', 'emscriptenWebGLGetTexPixelData', 'emscriptenWebGLGetUniform', 'webglGetUniformLocation', 'webglPrepareUniformLocationsBeforeFirstUse', 'webglGetLeftBracePos', 'emscriptenWebGLGetVertexAttrib', '__glGetActiveAttribOrUniform', 'writeGLArray', 'registerWebGlEventCallback', 'runAndAbortIfError', 'ALLOC_NORMAL', 'ALLOC_STACK', 'allocate', 'writeStringToMemory', 'writeAsciiToMemory', 'allocateUTF8', 'allocateUTF8OnStack', 'demangle', 'stackTrace', 'getNativeTypeSize', ]; missingLibrarySymbols.forEach(missingLibrarySymbol) var unexportedSymbols = [ 'run', 'out', 'err', 'callMain', 'abort', 'wasmExports', 'HEAPF32', 'HEAPF64', 'HEAP8', 'HEAPU8', 'HEAP16', 'HEAPU16', 'HEAP32', 'HEAPU32', 'HEAP64', 'HEAPU64', 'writeStackCookie', 'checkStackCookie', 'readI53FromI64', 'convertI32PairToI53Checked', 'ptrToString', 'zeroMemory', 'getHeapMax', 'abortOnCannotGrowMemory', 'ENV', 'setStackLimits', 'ERRNO_CODES', 'strError', 'DNS', 'Protocols', 'Sockets', 'timers', 'warnOnce', 'readEmAsmArgsArray', 'getExecutableName', 'asyncLoad', 'alignMemory', 'mmapAlloc', 'wasmTable', 'wasmMemory', 'getUniqueRunDependency', 'noExitRuntime', 'addRunDependency', 'removeRunDependency', 'addOnPreRun', 'addOnPostRun', 'ccall', 'freeTableIndexes', 'functionsInTableMap', 'getEmptyTableSlot', 'updateTableMap', 'getFunctionAddress', 'setValue', 'getValue', 'PATH', 'PATH_FS', 'UTF8Decoder', 'UTF8ArrayToString', 'stringToUTF8Array', 'stringToUTF8', 'lengthBytesUTF8', 'intArrayFromString', 'UTF16Decoder', 'stringToUTF8OnStack', 'JSEvents', 'specialHTMLTargets', 'findCanvasEventTarget', 'currentFullscreenStrategy', 'restoreOldWindowedStyle', 'UNWIND_CACHE', 'ExitStatus', 'getEnvStrings', 'checkWasiClock', 'doReadv', 'doWritev', 'initRandomFill', 'randomFill', 'emSetImmediate', 'emClearImmediate_deps', 'emClearImmediate', 'promiseMap', 'uncaughtExceptionCount', 'exceptionLast', 'exceptionCaught', 'Browser', 'requestFullscreen', 'requestFullScreen', 'setCanvasSize', 'getUserMedia', 'createContext', 'getPreloadedImageData__data', 'wget', 'MONTH_DAYS_REGULAR', 'MONTH_DAYS_LEAP', 'MONTH_DAYS_REGULAR_CUMULATIVE', 'MONTH_DAYS_LEAP_CUMULATIVE', 'isLeapYear', 'ydayFromDate', 'SYSCALLS', 'preloadPlugins', 'FS_createPreloadedFile', 'FS_preloadFile', 'FS_modeStringToFlags', 'FS_getMode', 'FS_stdin_getChar_buffer', 'FS_stdin_getChar', 'FS_unlink', 'FS_createPath', 'FS_createDevice', 'FS_readFile', 'FS', 'FS_root', 'FS_mounts', 'FS_devices', 'FS_streams', 'FS_nextInode', 'FS_nameTable', 'FS_currentPath', 'FS_initialized', 'FS_ignorePermissions', 'FS_filesystems', 'FS_syncFSRequests', 'FS_lookupPath', 'FS_getPath', 'FS_hashName', 'FS_hashAddNode', 'FS_hashRemoveNode', 'FS_lookupNode', 'FS_createNode', 'FS_destroyNode', 'FS_isRoot', 'FS_isMountpoint', 'FS_isFile', 'FS_isDir', 'FS_isLink', 'FS_isChrdev', 'FS_isBlkdev', 'FS_isFIFO', 'FS_isSocket', 'FS_flagsToPermissionString', 'FS_nodePermissions', 'FS_mayLookup', 'FS_mayCreate', 'FS_mayDelete', 'FS_mayOpen', 'FS_checkOpExists', 'FS_nextfd', 'FS_getStreamChecked', 'FS_getStream', 'FS_createStream', 'FS_closeStream', 'FS_dupStream', 'FS_doSetAttr', 'FS_chrdev_stream_ops', 'FS_major', 'FS_minor', 'FS_makedev', 'FS_registerDevice', 'FS_getDevice', 'FS_getMounts', 'FS_syncfs', 'FS_mount', 'FS_unmount', 'FS_lookup', 'FS_mknod', 'FS_statfs', 'FS_statfsStream', 'FS_statfsNode', 'FS_create', 'FS_mkdir', 'FS_mkdev', 'FS_symlink', 'FS_rename', 'FS_rmdir', 'FS_readdir', 'FS_readlink', 'FS_stat', 'FS_fstat', 'FS_lstat', 'FS_doChmod', 'FS_chmod', 'FS_lchmod', 'FS_fchmod', 'FS_doChown', 'FS_chown', 'FS_lchown', 'FS_fchown', 'FS_doTruncate', 'FS_truncate', 'FS_ftruncate', 'FS_utime', 'FS_open', 'FS_close', 'FS_isClosed', 'FS_llseek', 'FS_read', 'FS_write', 'FS_mmap', 'FS_msync', 'FS_ioctl', 'FS_writeFile', 'FS_cwd', 'FS_chdir', 'FS_createDefaultDirectories', 'FS_createDefaultDevices', 'FS_createSpecialDirectories', 'FS_createStandardStreams', 'FS_staticInit', 'FS_init', 'FS_quit', 'FS_findObject', 'FS_analyzePath', 'FS_createFile', 'FS_createDataFile', 'FS_forceLoadFile', 'FS_createLazyFile', 'FS_absolutePath', 'FS_createFolder', 'FS_createLink', 'FS_joinPath', 'FS_mmapAlloc', 'FS_standardizePath', 'MEMFS', 'TTY', 'PIPEFS', 'SOCKFS', 'tempFixedLengthArray', 'miniTempWebGLFloatBuffers', 'miniTempWebGLIntBuffers', 'GL', 'AL', 'GLUT', 'EGL', 'GLEW', 'IDBStore', 'SDL', 'SDL_gfx', 'print', 'printErr', 'jstoi_s', ]; unexportedSymbols.forEach(unexportedRuntimeSymbol); // End runtime exports // Begin JS library exports // End JS library exports // end include: postlibrary.js function checkIncomingModuleAPI() { ignoredModuleProp('fetchSettings'); ignoredModuleProp('logReadFiles'); ignoredModuleProp('loadSplitModule'); } // Imports from the Wasm binary. var _sqlite3_free = Module['_sqlite3_free'] = makeInvalidEarlyAccess('_sqlite3_free'); var _sqlite3_value_text = Module['_sqlite3_value_text'] = makeInvalidEarlyAccess('_sqlite3_value_text'); var _sqlite3_prepare_v2 = Module['_sqlite3_prepare_v2'] = makeInvalidEarlyAccess('_sqlite3_prepare_v2'); var _sqlite3_step = Module['_sqlite3_step'] = makeInvalidEarlyAccess('_sqlite3_step'); var _sqlite3_reset = Module['_sqlite3_reset'] = makeInvalidEarlyAccess('_sqlite3_reset'); var _sqlite3_exec = Module['_sqlite3_exec'] = makeInvalidEarlyAccess('_sqlite3_exec'); var _sqlite3_finalize = Module['_sqlite3_finalize'] = makeInvalidEarlyAccess('_sqlite3_finalize'); var _sqlite3_column_name = Module['_sqlite3_column_name'] = makeInvalidEarlyAccess('_sqlite3_column_name'); var _sqlite3_column_text = Module['_sqlite3_column_text'] = makeInvalidEarlyAccess('_sqlite3_column_text'); var _sqlite3_column_type = Module['_sqlite3_column_type'] = makeInvalidEarlyAccess('_sqlite3_column_type'); var _sqlite3_errmsg = Module['_sqlite3_errmsg'] = makeInvalidEarlyAccess('_sqlite3_errmsg'); var _sqlite3_clear_bindings = Module['_sqlite3_clear_bindings'] = makeInvalidEarlyAccess('_sqlite3_clear_bindings'); var _sqlite3_value_blob = Module['_sqlite3_value_blob'] = makeInvalidEarlyAccess('_sqlite3_value_blob'); var _sqlite3_value_bytes = Module['_sqlite3_value_bytes'] = makeInvalidEarlyAccess('_sqlite3_value_bytes'); var _sqlite3_value_double = Module['_sqlite3_value_double'] = makeInvalidEarlyAccess('_sqlite3_value_double'); var _sqlite3_value_int = Module['_sqlite3_value_int'] = makeInvalidEarlyAccess('_sqlite3_value_int'); var _sqlite3_value_type = Module['_sqlite3_value_type'] = makeInvalidEarlyAccess('_sqlite3_value_type'); var _sqlite3_result_blob = Module['_sqlite3_result_blob'] = makeInvalidEarlyAccess('_sqlite3_result_blob'); var _sqlite3_result_double = Module['_sqlite3_result_double'] = makeInvalidEarlyAccess('_sqlite3_result_double'); var _sqlite3_result_error = Module['_sqlite3_result_error'] = makeInvalidEarlyAccess('_sqlite3_result_error'); var _sqlite3_result_int = Module['_sqlite3_result_int'] = makeInvalidEarlyAccess('_sqlite3_result_int'); var _sqlite3_result_int64 = Module['_sqlite3_result_int64'] = makeInvalidEarlyAccess('_sqlite3_result_int64'); var _sqlite3_result_null = Module['_sqlite3_result_null'] = makeInvalidEarlyAccess('_sqlite3_result_null'); var _sqlite3_result_text = Module['_sqlite3_result_text'] = makeInvalidEarlyAccess('_sqlite3_result_text'); var _sqlite3_aggregate_context = Module['_sqlite3_aggregate_context'] = makeInvalidEarlyAccess('_sqlite3_aggregate_context'); var _sqlite3_column_count = Module['_sqlite3_column_count'] = makeInvalidEarlyAccess('_sqlite3_column_count'); var _sqlite3_data_count = Module['_sqlite3_data_count'] = makeInvalidEarlyAccess('_sqlite3_data_count'); var _sqlite3_column_blob = Module['_sqlite3_column_blob'] = makeInvalidEarlyAccess('_sqlite3_column_blob'); var _sqlite3_column_bytes = Module['_sqlite3_column_bytes'] = makeInvalidEarlyAccess('_sqlite3_column_bytes'); var _sqlite3_column_double = Module['_sqlite3_column_double'] = makeInvalidEarlyAccess('_sqlite3_column_double'); var _sqlite3_bind_blob = Module['_sqlite3_bind_blob'] = makeInvalidEarlyAccess('_sqlite3_bind_blob'); var _sqlite3_bind_double = Module['_sqlite3_bind_double'] = makeInvalidEarlyAccess('_sqlite3_bind_double'); var _sqlite3_bind_int = Module['_sqlite3_bind_int'] = makeInvalidEarlyAccess('_sqlite3_bind_int'); var _sqlite3_bind_text = Module['_sqlite3_bind_text'] = makeInvalidEarlyAccess('_sqlite3_bind_text'); var _sqlite3_bind_parameter_index = Module['_sqlite3_bind_parameter_index'] = makeInvalidEarlyAccess('_sqlite3_bind_parameter_index'); var _sqlite3_sql = Module['_sqlite3_sql'] = makeInvalidEarlyAccess('_sqlite3_sql'); var _sqlite3_normalized_sql = Module['_sqlite3_normalized_sql'] = makeInvalidEarlyAccess('_sqlite3_normalized_sql'); var _sqlite3_changes = Module['_sqlite3_changes'] = makeInvalidEarlyAccess('_sqlite3_changes'); var _sqlite3_close_v2 = Module['_sqlite3_close_v2'] = makeInvalidEarlyAccess('_sqlite3_close_v2'); var _sqlite3_create_function_v2 = Module['_sqlite3_create_function_v2'] = makeInvalidEarlyAccess('_sqlite3_create_function_v2'); var _sqlite3_update_hook = Module['_sqlite3_update_hook'] = makeInvalidEarlyAccess('_sqlite3_update_hook'); var _sqlite3_open = Module['_sqlite3_open'] = makeInvalidEarlyAccess('_sqlite3_open'); var _strerror = makeInvalidEarlyAccess('_strerror'); var _malloc = Module['_malloc'] = makeInvalidEarlyAccess('_malloc'); var _free = Module['_free'] = makeInvalidEarlyAccess('_free'); var _RegisterExtensionFunctions = Module['_RegisterExtensionFunctions'] = makeInvalidEarlyAccess('_RegisterExtensionFunctions'); var _fflush = makeInvalidEarlyAccess('_fflush'); var _emscripten_stack_get_end = makeInvalidEarlyAccess('_emscripten_stack_get_end'); var _emscripten_stack_get_base = makeInvalidEarlyAccess('_emscripten_stack_get_base'); var _emscripten_builtin_memalign = makeInvalidEarlyAccess('_emscripten_builtin_memalign'); var __emscripten_tempret_set = makeInvalidEarlyAccess('__emscripten_tempret_set'); var _emscripten_stack_init = makeInvalidEarlyAccess('_emscripten_stack_init'); var _emscripten_stack_get_free = makeInvalidEarlyAccess('_emscripten_stack_get_free'); var __emscripten_stack_restore = makeInvalidEarlyAccess('__emscripten_stack_restore'); var __emscripten_stack_alloc = makeInvalidEarlyAccess('__emscripten_stack_alloc'); var _emscripten_stack_get_current = makeInvalidEarlyAccess('_emscripten_stack_get_current'); var ___set_stack_limits = Module['___set_stack_limits'] = makeInvalidEarlyAccess('___set_stack_limits'); var dynCall_iiiij = makeInvalidEarlyAccess('dynCall_iiiij'); var dynCall_iij = makeInvalidEarlyAccess('dynCall_iij'); var dynCall_iijii = makeInvalidEarlyAccess('dynCall_iijii'); var dynCall_iiji = makeInvalidEarlyAccess('dynCall_iiji'); var dynCall_iiiiiij = makeInvalidEarlyAccess('dynCall_iiiiiij'); var dynCall_viji = makeInvalidEarlyAccess('dynCall_viji'); var dynCall_jiji = makeInvalidEarlyAccess('dynCall_jiji'); var memory = makeInvalidEarlyAccess('memory'); var __indirect_function_table = makeInvalidEarlyAccess('__indirect_function_table'); var wasmMemory = makeInvalidEarlyAccess('wasmMemory'); var wasmTable = makeInvalidEarlyAccess('wasmTable'); function assignWasmExports(wasmExports) { assert(typeof wasmExports['sqlite3_free'] != 'undefined', 'missing Wasm export: sqlite3_free'); assert(typeof wasmExports['sqlite3_value_text'] != 'undefined', 'missing Wasm export: sqlite3_value_text'); assert(typeof wasmExports['sqlite3_prepare_v2'] != 'undefined', 'missing Wasm export: sqlite3_prepare_v2'); assert(typeof wasmExports['sqlite3_step'] != 'undefined', 'missing Wasm export: sqlite3_step'); assert(typeof wasmExports['sqlite3_reset'] != 'undefined', 'missing Wasm export: sqlite3_reset'); assert(typeof wasmExports['sqlite3_exec'] != 'undefined', 'missing Wasm export: sqlite3_exec'); assert(typeof wasmExports['sqlite3_finalize'] != 'undefined', 'missing Wasm export: sqlite3_finalize'); assert(typeof wasmExports['sqlite3_column_name'] != 'undefined', 'missing Wasm export: sqlite3_column_name'); assert(typeof wasmExports['sqlite3_column_text'] != 'undefined', 'missing Wasm export: sqlite3_column_text'); assert(typeof wasmExports['sqlite3_column_type'] != 'undefined', 'missing Wasm export: sqlite3_column_type'); assert(typeof wasmExports['sqlite3_errmsg'] != 'undefined', 'missing Wasm export: sqlite3_errmsg'); assert(typeof wasmExports['sqlite3_clear_bindings'] != 'undefined', 'missing Wasm export: sqlite3_clear_bindings'); assert(typeof wasmExports['sqlite3_value_blob'] != 'undefined', 'missing Wasm export: sqlite3_value_blob'); assert(typeof wasmExports['sqlite3_value_bytes'] != 'undefined', 'missing Wasm export: sqlite3_value_bytes'); assert(typeof wasmExports['sqlite3_value_double'] != 'undefined', 'missing Wasm export: sqlite3_value_double'); assert(typeof wasmExports['sqlite3_value_int'] != 'undefined', 'missing Wasm export: sqlite3_value_int'); assert(typeof wasmExports['sqlite3_value_type'] != 'undefined', 'missing Wasm export: sqlite3_value_type'); assert(typeof wasmExports['sqlite3_result_blob'] != 'undefined', 'missing Wasm export: sqlite3_result_blob'); assert(typeof wasmExports['sqlite3_result_double'] != 'undefined', 'missing Wasm export: sqlite3_result_double'); assert(typeof wasmExports['sqlite3_result_error'] != 'undefined', 'missing Wasm export: sqlite3_result_error'); assert(typeof wasmExports['sqlite3_result_int'] != 'undefined', 'missing Wasm export: sqlite3_result_int'); assert(typeof wasmExports['sqlite3_result_int64'] != 'undefined', 'missing Wasm export: sqlite3_result_int64'); assert(typeof wasmExports['sqlite3_result_null'] != 'undefined', 'missing Wasm export: sqlite3_result_null'); assert(typeof wasmExports['sqlite3_result_text'] != 'undefined', 'missing Wasm export: sqlite3_result_text'); assert(typeof wasmExports['sqlite3_aggregate_context'] != 'undefined', 'missing Wasm export: sqlite3_aggregate_context'); assert(typeof wasmExports['sqlite3_column_count'] != 'undefined', 'missing Wasm export: sqlite3_column_count'); assert(typeof wasmExports['sqlite3_data_count'] != 'undefined', 'missing Wasm export: sqlite3_data_count'); assert(typeof wasmExports['sqlite3_column_blob'] != 'undefined', 'missing Wasm export: sqlite3_column_blob'); assert(typeof wasmExports['sqlite3_column_bytes'] != 'undefined', 'missing Wasm export: sqlite3_column_bytes'); assert(typeof wasmExports['sqlite3_column_double'] != 'undefined', 'missing Wasm export: sqlite3_column_double'); assert(typeof wasmExports['sqlite3_bind_blob'] != 'undefined', 'missing Wasm export: sqlite3_bind_blob'); assert(typeof wasmExports['sqlite3_bind_double'] != 'undefined', 'missing Wasm export: sqlite3_bind_double'); assert(typeof wasmExports['sqlite3_bind_int'] != 'undefined', 'missing Wasm export: sqlite3_bind_int'); assert(typeof wasmExports['sqlite3_bind_text'] != 'undefined', 'missing Wasm export: sqlite3_bind_text'); assert(typeof wasmExports['sqlite3_bind_parameter_index'] != 'undefined', 'missing Wasm export: sqlite3_bind_parameter_index'); assert(typeof wasmExports['sqlite3_sql'] != 'undefined', 'missing Wasm export: sqlite3_sql'); assert(typeof wasmExports['sqlite3_normalized_sql'] != 'undefined', 'missing Wasm export: sqlite3_normalized_sql'); assert(typeof wasmExports['sqlite3_changes'] != 'undefined', 'missing Wasm export: sqlite3_changes'); assert(typeof wasmExports['sqlite3_close_v2'] != 'undefined', 'missing Wasm export: sqlite3_close_v2'); assert(typeof wasmExports['sqlite3_create_function_v2'] != 'undefined', 'missing Wasm export: sqlite3_create_function_v2'); assert(typeof wasmExports['sqlite3_update_hook'] != 'undefined', 'missing Wasm export: sqlite3_update_hook'); assert(typeof wasmExports['sqlite3_open'] != 'undefined', 'missing Wasm export: sqlite3_open'); assert(typeof wasmExports['strerror'] != 'undefined', 'missing Wasm export: strerror'); assert(typeof wasmExports['malloc'] != 'undefined', 'missing Wasm export: malloc'); assert(typeof wasmExports['free'] != 'undefined', 'missing Wasm export: free'); assert(typeof wasmExports['RegisterExtensionFunctions'] != 'undefined', 'missing Wasm export: RegisterExtensionFunctions'); assert(typeof wasmExports['fflush'] != 'undefined', 'missing Wasm export: fflush'); assert(typeof wasmExports['emscripten_stack_get_end'] != 'undefined', 'missing Wasm export: emscripten_stack_get_end'); assert(typeof wasmExports['emscripten_stack_get_base'] != 'undefined', 'missing Wasm export: emscripten_stack_get_base'); assert(typeof wasmExports['emscripten_builtin_memalign'] != 'undefined', 'missing Wasm export: emscripten_builtin_memalign'); assert(typeof wasmExports['_emscripten_tempret_set'] != 'undefined', 'missing Wasm export: _emscripten_tempret_set'); assert(typeof wasmExports['emscripten_stack_init'] != 'undefined', 'missing Wasm export: emscripten_stack_init'); assert(typeof wasmExports['emscripten_stack_get_free'] != 'undefined', 'missing Wasm export: emscripten_stack_get_free'); assert(typeof wasmExports['_emscripten_stack_restore'] != 'undefined', 'missing Wasm export: _emscripten_stack_restore'); assert(typeof wasmExports['_emscripten_stack_alloc'] != 'undefined', 'missing Wasm export: _emscripten_stack_alloc'); assert(typeof wasmExports['emscripten_stack_get_current'] != 'undefined', 'missing Wasm export: emscripten_stack_get_current'); assert(typeof wasmExports['__set_stack_limits'] != 'undefined', 'missing Wasm export: __set_stack_limits'); assert(typeof wasmExports['dynCall_iiiij'] != 'undefined', 'missing Wasm export: dynCall_iiiij'); assert(typeof wasmExports['dynCall_iij'] != 'undefined', 'missing Wasm export: dynCall_iij'); assert(typeof wasmExports['dynCall_iijii'] != 'undefined', 'missing Wasm export: dynCall_iijii'); assert(typeof wasmExports['dynCall_iiji'] != 'undefined', 'missing Wasm export: dynCall_iiji'); assert(typeof wasmExports['dynCall_iiiiiij'] != 'undefined', 'missing Wasm export: dynCall_iiiiiij'); assert(typeof wasmExports['dynCall_viji'] != 'undefined', 'missing Wasm export: dynCall_viji'); assert(typeof wasmExports['dynCall_jiji'] != 'undefined', 'missing Wasm export: dynCall_jiji'); assert(typeof wasmExports['memory'] != 'undefined', 'missing Wasm export: memory'); assert(typeof wasmExports['__indirect_function_table'] != 'undefined', 'missing Wasm export: __indirect_function_table'); _sqlite3_free = Module['_sqlite3_free'] = createExportWrapper('sqlite3_free', 1); _sqlite3_value_text = Module['_sqlite3_value_text'] = createExportWrapper('sqlite3_value_text', 1); _sqlite3_prepare_v2 = Module['_sqlite3_prepare_v2'] = createExportWrapper('sqlite3_prepare_v2', 5); _sqlite3_step = Module['_sqlite3_step'] = createExportWrapper('sqlite3_step', 1); _sqlite3_reset = Module['_sqlite3_reset'] = createExportWrapper('sqlite3_reset', 1); _sqlite3_exec = Module['_sqlite3_exec'] = createExportWrapper('sqlite3_exec', 5); _sqlite3_finalize = Module['_sqlite3_finalize'] = createExportWrapper('sqlite3_finalize', 1); _sqlite3_column_name = Module['_sqlite3_column_name'] = createExportWrapper('sqlite3_column_name', 2); _sqlite3_column_text = Module['_sqlite3_column_text'] = createExportWrapper('sqlite3_column_text', 2); _sqlite3_column_type = Module['_sqlite3_column_type'] = createExportWrapper('sqlite3_column_type', 2); _sqlite3_errmsg = Module['_sqlite3_errmsg'] = createExportWrapper('sqlite3_errmsg', 1); _sqlite3_clear_bindings = Module['_sqlite3_clear_bindings'] = createExportWrapper('sqlite3_clear_bindings', 1); _sqlite3_value_blob = Module['_sqlite3_value_blob'] = createExportWrapper('sqlite3_value_blob', 1); _sqlite3_value_bytes = Module['_sqlite3_value_bytes'] = createExportWrapper('sqlite3_value_bytes', 1); _sqlite3_value_double = Module['_sqlite3_value_double'] = createExportWrapper('sqlite3_value_double', 1); _sqlite3_value_int = Module['_sqlite3_value_int'] = createExportWrapper('sqlite3_value_int', 1); _sqlite3_value_type = Module['_sqlite3_value_type'] = createExportWrapper('sqlite3_value_type', 1); _sqlite3_result_blob = Module['_sqlite3_result_blob'] = createExportWrapper('sqlite3_result_blob', 4); _sqlite3_result_double = Module['_sqlite3_result_double'] = createExportWrapper('sqlite3_result_double', 2); _sqlite3_result_error = Module['_sqlite3_result_error'] = createExportWrapper('sqlite3_result_error', 3); _sqlite3_result_int = Module['_sqlite3_result_int'] = createExportWrapper('sqlite3_result_int', 2); _sqlite3_result_int64 = Module['_sqlite3_result_int64'] = createExportWrapper('sqlite3_result_int64', 3); _sqlite3_result_null = Module['_sqlite3_result_null'] = createExportWrapper('sqlite3_result_null', 1); _sqlite3_result_text = Module['_sqlite3_result_text'] = createExportWrapper('sqlite3_result_text', 4); _sqlite3_aggregate_context = Module['_sqlite3_aggregate_context'] = createExportWrapper('sqlite3_aggregate_context', 2); _sqlite3_column_count = Module['_sqlite3_column_count'] = createExportWrapper('sqlite3_column_count', 1); _sqlite3_data_count = Module['_sqlite3_data_count'] = createExportWrapper('sqlite3_data_count', 1); _sqlite3_column_blob = Module['_sqlite3_column_blob'] = createExportWrapper('sqlite3_column_blob', 2); _sqlite3_column_bytes = Module['_sqlite3_column_bytes'] = createExportWrapper('sqlite3_column_bytes', 2); _sqlite3_column_double = Module['_sqlite3_column_double'] = createExportWrapper('sqlite3_column_double', 2); _sqlite3_bind_blob = Module['_sqlite3_bind_blob'] = createExportWrapper('sqlite3_bind_blob', 5); _sqlite3_bind_double = Module['_sqlite3_bind_double'] = createExportWrapper('sqlite3_bind_double', 3); _sqlite3_bind_int = Module['_sqlite3_bind_int'] = createExportWrapper('sqlite3_bind_int', 3); _sqlite3_bind_text = Module['_sqlite3_bind_text'] = createExportWrapper('sqlite3_bind_text', 5); _sqlite3_bind_parameter_index = Module['_sqlite3_bind_parameter_index'] = createExportWrapper('sqlite3_bind_parameter_index', 2); _sqlite3_sql = Module['_sqlite3_sql'] = createExportWrapper('sqlite3_sql', 1); _sqlite3_normalized_sql = Module['_sqlite3_normalized_sql'] = createExportWrapper('sqlite3_normalized_sql', 1); _sqlite3_changes = Module['_sqlite3_changes'] = createExportWrapper('sqlite3_changes', 1); _sqlite3_close_v2 = Module['_sqlite3_close_v2'] = createExportWrapper('sqlite3_close_v2', 1); _sqlite3_create_function_v2 = Module['_sqlite3_create_function_v2'] = createExportWrapper('sqlite3_create_function_v2', 9); _sqlite3_update_hook = Module['_sqlite3_update_hook'] = createExportWrapper('sqlite3_update_hook', 3); _sqlite3_open = Module['_sqlite3_open'] = createExportWrapper('sqlite3_open', 2); _strerror = createExportWrapper('strerror', 1); _malloc = Module['_malloc'] = createExportWrapper('malloc', 1); _free = Module['_free'] = createExportWrapper('free', 1); _RegisterExtensionFunctions = Module['_RegisterExtensionFunctions'] = createExportWrapper('RegisterExtensionFunctions', 1); _fflush = createExportWrapper('fflush', 1); _emscripten_stack_get_end = wasmExports['emscripten_stack_get_end']; _emscripten_stack_get_base = wasmExports['emscripten_stack_get_base']; _emscripten_builtin_memalign = createExportWrapper('emscripten_builtin_memalign', 2); __emscripten_tempret_set = createExportWrapper('_emscripten_tempret_set', 1); _emscripten_stack_init = wasmExports['emscripten_stack_init']; _emscripten_stack_get_free = wasmExports['emscripten_stack_get_free']; __emscripten_stack_restore = wasmExports['_emscripten_stack_restore']; __emscripten_stack_alloc = wasmExports['_emscripten_stack_alloc']; _emscripten_stack_get_current = wasmExports['emscripten_stack_get_current']; ___set_stack_limits = Module['___set_stack_limits'] = createExportWrapper('__set_stack_limits', 2); dynCall_iiiij = createExportWrapper('dynCall_iiiij', 6); dynCall_iij = createExportWrapper('dynCall_iij', 4); dynCall_iijii = createExportWrapper('dynCall_iijii', 6); dynCall_iiji = createExportWrapper('dynCall_iiji', 5); dynCall_iiiiiij = createExportWrapper('dynCall_iiiiiij', 8); dynCall_viji = createExportWrapper('dynCall_viji', 5); dynCall_jiji = createExportWrapper('dynCall_jiji', 5); memory = wasmMemory = wasmExports['memory']; __indirect_function_table = wasmTable = wasmExports['__indirect_function_table']; } var wasmImports = { /** @export */ __assert_fail: ___assert_fail, /** @export */ __handle_stack_overflow: ___handle_stack_overflow, /** @export */ __syscall_chmod: ___syscall_chmod, /** @export */ __syscall_faccessat: ___syscall_faccessat, /** @export */ __syscall_fchmod: ___syscall_fchmod, /** @export */ __syscall_fchown32: ___syscall_fchown32, /** @export */ __syscall_fcntl64: ___syscall_fcntl64, /** @export */ __syscall_fstat64: ___syscall_fstat64, /** @export */ __syscall_ftruncate64: ___syscall_ftruncate64, /** @export */ __syscall_getcwd: ___syscall_getcwd, /** @export */ __syscall_lstat64: ___syscall_lstat64, /** @export */ __syscall_mkdirat: ___syscall_mkdirat, /** @export */ __syscall_newfstatat: ___syscall_newfstatat, /** @export */ __syscall_openat: ___syscall_openat, /** @export */ __syscall_readlinkat: ___syscall_readlinkat, /** @export */ __syscall_rmdir: ___syscall_rmdir, /** @export */ __syscall_stat64: ___syscall_stat64, /** @export */ __syscall_unlinkat: ___syscall_unlinkat, /** @export */ __syscall_utimensat: ___syscall_utimensat, /** @export */ _abort_js: __abort_js, /** @export */ _localtime_js: __localtime_js, /** @export */ _mmap_js: __mmap_js, /** @export */ _munmap_js: __munmap_js, /** @export */ _tzset_js: __tzset_js, /** @export */ clock_time_get: _clock_time_get, /** @export */ emscripten_date_now: _emscripten_date_now, /** @export */ emscripten_get_heap_max: _emscripten_get_heap_max, /** @export */ emscripten_get_now: _emscripten_get_now, /** @export */ emscripten_resize_heap: _emscripten_resize_heap, /** @export */ environ_get: _environ_get, /** @export */ environ_sizes_get: _environ_sizes_get, /** @export */ fd_close: _fd_close, /** @export */ fd_fdstat_get: _fd_fdstat_get, /** @export */ fd_read: _fd_read, /** @export */ fd_seek: _fd_seek, /** @export */ fd_sync: _fd_sync, /** @export */ fd_write: _fd_write }; // include: postamble.js // === Auto-generated postamble setup entry stuff === var calledRun; function stackCheckInit() { // This is normally called automatically during __wasm_call_ctors but need to // get these values before even running any of the ctors so we call it redundantly // here. _emscripten_stack_init(); // TODO(sbc): Move writeStackCookie to native to to avoid this. writeStackCookie(); } function run() { if (runDependencies > 0) { dependenciesFulfilled = run; return; } stackCheckInit(); preRun(); // a preRun added a dependency, run will be called later if (runDependencies > 0) { dependenciesFulfilled = run; return; } function doRun() { // run may have just been called through dependencies being fulfilled just in this very frame, // or while the async setStatus time below was happening assert(!calledRun); calledRun = true; Module['calledRun'] = true; if (ABORT) return; initRuntime(); Module['onRuntimeInitialized']?.(); consumedModuleProp('onRuntimeInitialized'); assert(!Module['_main'], 'compiled without a main, but one is present. if you added it from JS, use Module["onRuntimeInitialized"]'); postRun(); } if (Module['setStatus']) { Module['setStatus']('Running...'); setTimeout(() => { setTimeout(() => Module['setStatus'](''), 1); doRun(); }, 1); } else { doRun(); } checkStackCookie(); } function checkUnflushedContent() { // Compiler settings do not allow exiting the runtime, so flushing // the streams is not possible. but in ASSERTIONS mode we check // if there was something to flush, and if so tell the user they // should request that the runtime be exitable. // Normally we would not even include flush() at all, but in ASSERTIONS // builds we do so just for this check, and here we see if there is any // content to flush, that is, we check if there would have been // something a non-ASSERTIONS build would have not seen. // How we flush the streams depends on whether we are in SYSCALLS_REQUIRE_FILESYSTEM=0 // mode (which has its own special function for this; otherwise, all // the code is inside libc) var oldOut = out; var oldErr = err; var has = false; out = err = (x) => { has = true; } try { // it doesn't matter if it fails _fflush(0); // also flush in the JS FS layer for (var name of ['stdout', 'stderr']) { var info = FS.analyzePath('/dev/' + name); if (!info) return; var stream = info.object; var rdev = stream.rdev; var tty = TTY.ttys[rdev]; if (tty?.output?.length) { has = true; } } } catch(e) {} out = oldOut; err = oldErr; if (has) { warnOnce('stdio streams had content in them that was not flushed. you should set EXIT_RUNTIME to 1 (see the Emscripten FAQ), or make sure to emit a newline when you printf etc.'); } } var wasmExports; // With async instantation wasmExports is assigned asynchronously when the // instance is received. createWasm(); run(); // end include: postamble.js // The shell-pre.js and emcc-generated code goes above return Module; }); // The end of the promise being returned return initSqlJsPromise; } // The end of our initSqlJs function // This bit below is copied almost exactly from what you get when you use the MODULARIZE=1 flag with emcc // However, we don't want to use the emcc modularization. See shell-pre.js if (typeof exports === 'object' && typeof module === 'object'){ module.exports = initSqlJs; // This will allow the module to be used in ES6 or CommonJS module.exports.default = initSqlJs; } else if (typeof define === 'function' && define['amd']) { define([], function() { return initSqlJs; }); } else if (typeof exports === 'object'){ exports["Module"] = initSqlJs; }