Skip to content

Instantly share code, notes, and snippets.

@suzuki0keiichi

suzuki0keiichi/Simple_Texture2D.js

Created December 26, 2013 15:46
Show Gist options
  • Save suzuki0keiichi/8135251 to your computer and use it in GitHub Desktop.
Save suzuki0keiichi/8135251 to your computer and use it in GitHub Desktop.
Download ZIP
glbook/Chapter_9/Simple_Texture2D/Simple_Texture2DをEmscriptenにかけるとどんな感じになるか。 これ https://github.com/kripken/emscripten/blob/master/tests/glbook/Chapter_9/Simple_Texture2D/Simple_Texture2D.c と https://github.com/kripken/emscripten/blob/master/tests/glbook/Common のものをまとめたやつをEmscriptenにかけた結果。
Raw
Simple_Texture2D.js
// Note: Some Emscripten settings will significantly limit the speed of the generated code.
// Note: Some Emscripten settings may limit the speed of the generated code.
// The Module object: Our interface to the outside world. We import
// and export values on it, and do the work to get that through
// closure compiler if necessary. There are various ways Module can be used:
// 1. Not defined. We create it here
// 2. A function parameter, function(Module) { ..generated code.. }
// 3. pre-run appended it, var Module = {}; ..generated code..
// 4. External script tag defines var Module.
// We need to do an eval in order to handle the closure compiler
// case, where this code here is minified but Module was defined
// elsewhere (e.g. case 4 above). We also need to check if Module
// already exists (e.g. case 3 above).
// Note that if you want to run closure, and also to use Module
// after the generated code, you will need to define var Module = {};
// before the code. Then that object will be used in the code, and you
// can continue to use Module afterwards as well.
var Module;
if (!Module) Module = eval('(function() { try { return Module || {} } catch(e) { return {} } })()');
// Sometimes an existing Module object exists with properties
// meant to overwrite the default module functionality. Here
// we collect those properties and reapply _after_ we configure
// the current environment's defaults to avoid having to be so
// defensive during initialization.
var moduleOverrides = {};
for (var key in Module) {
if (Module.hasOwnProperty(key)) {
moduleOverrides[key] = Module[key];
}
}
// The environment setup code below is customized to use Module.
// *** Environment setup code ***
var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
var ENVIRONMENT_IS_WEB = typeof window === 'object';
var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
if (ENVIRONMENT_IS_NODE) {
// Expose functionality in the same simple way that the shells work
// Note that we pollute the global namespace here, otherwise we break in node
Module['print'] = function print(x) {
process['stdout'].write(x + '\n');
};
Module['printErr'] = function printErr(x) {
process['stderr'].write(x + '\n');
};
var nodeFS = require('fs');
var nodePath = require('path');
Module['read'] = function read(filename, binary) {
filename = nodePath['normalize'](filename);
var ret = nodeFS['readFileSync'](filename);
// The path is absolute if the normalized version is the same as the resolved.
if (!ret && filename != nodePath['resolve'](filename)) {
filename = path.join(__dirname, '..', 'src', filename);
ret = nodeFS['readFileSync'](filename);
}
if (ret && !binary) ret = ret.toString();
return ret;
};
Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
Module['load'] = function load(f) {
globalEval(read(f));
};
Module['arguments'] = process['argv'].slice(2);
module['exports'] = Module;
}
else if (ENVIRONMENT_IS_SHELL) {
Module['print'] = print;
if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
if (typeof read != 'undefined') {
Module['read'] = read;
} else {
Module['read'] = function read() { throw 'no read() available (jsc?)' };
}
Module['readBinary'] = function readBinary(f) {
return read(f, 'binary');
};
if (typeof scriptArgs != 'undefined') {
Module['arguments'] = scriptArgs;
} else if (typeof arguments != 'undefined') {
Module['arguments'] = arguments;
}
this['Module'] = Module;
eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
}
else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
Module['read'] = function read(url) {
var xhr = new XMLHttpRequest();
xhr.open('GET', url, false);
xhr.send(null);
return xhr.responseText;
};
if (typeof arguments != 'undefined') {
Module['arguments'] = arguments;
}
if (typeof console !== 'undefined') {
Module['print'] = function print(x) {
console.log(x);
};
Module['printErr'] = function printErr(x) {
console.log(x);
};
} else {
// Probably a worker, and without console.log. We can do very little here...
var TRY_USE_DUMP = false;
Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
dump(x);
}) : (function(x) {
// self.postMessage(x); // enable this if you want stdout to be sent as messages
}));
}
if (ENVIRONMENT_IS_WEB) {
this['Module'] = Module;
} else {
Module['load'] = importScripts;
}
}
else {
// Unreachable because SHELL is dependant on the others
throw 'Unknown runtime environment. Where are we?';
}
function globalEval(x) {
eval.call(null, x);
}
if (!Module['load'] == 'undefined' && Module['read']) {
Module['load'] = function load(f) {
globalEval(Module['read'](f));
};
}
if (!Module['print']) {
Module['print'] = function(){};
}
if (!Module['printErr']) {
Module['printErr'] = Module['print'];
}
if (!Module['arguments']) {
Module['arguments'] = [];
}
// *** Environment setup code ***
// Closure helpers
Module.print = Module['print'];
Module.printErr = Module['printErr'];
// Callbacks
Module['preRun'] = [];
Module['postRun'] = [];
// Merge back in the overrides
for (var key in moduleOverrides) {
if (moduleOverrides.hasOwnProperty(key)) {
Module[key] = moduleOverrides[key];
}
}
// === Auto-generated preamble library stuff ===
//========================================
// Runtime code shared with compiler
//========================================
var Runtime = {
stackSave: function () {
return STACKTOP;
},
stackRestore: function (stackTop) {
STACKTOP = stackTop;
},
forceAlign: function (target, quantum) {
quantum = quantum || 4;
if (quantum == 1) return target;
if (isNumber(target) && isNumber(quantum)) {
return Math.ceil(target/quantum)*quantum;
} else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
}
return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
},
isNumberType: function (type) {
return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
},
isPointerType: function isPointerType(type) {
return type[type.length-1] == '*';
},
isStructType: function isStructType(type) {
if (isPointerType(type)) return false;
if (isArrayType(type)) return true;
if (/<?{ ?[^}]* ?}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
// See comment in isStructPointerType()
return type[0] == '%';
},
INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
FLOAT_TYPES: {"float":0,"double":0},
or64: function (x, y) {
var l = (x | 0) | (y | 0);
var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
return l + h;
},
and64: function (x, y) {
var l = (x | 0) & (y | 0);
var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
return l + h;
},
xor64: function (x, y) {
var l = (x | 0) ^ (y | 0);
var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
return l + h;
},
getNativeTypeSize: function (type) {
switch (type) {
case 'i1': case 'i8': return 1;
case 'i16': return 2;
case 'i32': return 4;
case 'i64': return 8;
case 'float': return 4;
case 'double': return 8;
default: {
if (type[type.length-1] === '*') {
return Runtime.QUANTUM_SIZE; // A pointer
} else if (type[0] === 'i') {
var bits = parseInt(type.substr(1));
assert(bits % 8 === 0);
return bits/8;
} else {
return 0;
}
}
}
},
getNativeFieldSize: function (type) {
return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
},
dedup: function dedup(items, ident) {
var seen = {};
if (ident) {
return items.filter(function(item) {
if (seen[item[ident]]) return false;
seen[item[ident]] = true;
return true;
});
} else {
return items.filter(function(item) {
if (seen[item]) return false;
seen[item] = true;
return true;
});
}
},
set: function set() {
var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
var ret = {};
for (var i = 0; i < args.length; i++) {
ret[args[i]] = 0;
}
return ret;
},
STACK_ALIGN: 4,
getAlignSize: function (type, size, vararg) {
// we align i64s and doubles on 64-bit boundaries, unlike x86
return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
},
calculateStructAlignment: function calculateStructAlignment(type) {
type.flatSize = 0;
type.alignSize = 0;
var diffs = [];
var prev = -1;
var index = 0;
type.flatIndexes = type.fields.map(function(field) {
index++;
var size, alignSize;
if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
alignSize = Runtime.getAlignSize(field, size);
} else if (Runtime.isStructType(field)) {
if (field[1] === '0') {
// this is [0 x something]. When inside another structure like here, it must be at the end,
// and it adds no size
// XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
size = 0;
if (Types.types[field]) {
alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
} else {
alignSize = type.alignSize || QUANTUM_SIZE;
}
} else {
size = Types.types[field].flatSize;
alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
}
} else if (field[0] == 'b') {
// bN, large number field, like a [N x i8]
size = field.substr(1)|0;
alignSize = 1;
} else if (field[0] === '<') {
// vector type
size = alignSize = Types.types[field].flatSize; // fully aligned
} else if (field[0] === 'i') {
// illegal integer field, that could not be legalized because it is an internal structure field
// it is ok to have such fields, if we just use them as markers of field size and nothing more complex
size = alignSize = parseInt(field.substr(1))/8;
assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
} else {
assert(false, 'invalid type for calculateStructAlignment');
}
if (type.packed) alignSize = 1;
type.alignSize = Math.max(type.alignSize, alignSize);
var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
type.flatSize = curr + size;
if (prev >= 0) {
diffs.push(curr-prev);
}
prev = curr;
return curr;
});
if (type.name_[0] === '[') {
// arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
// allocating a potentially huge array for [999999 x i8] etc.
type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
}
type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
if (diffs.length == 0) {
type.flatFactor = type.flatSize;
} else if (Runtime.dedup(diffs).length == 1) {
type.flatFactor = diffs[0];
}
type.needsFlattening = (type.flatFactor != 1);
return type.flatIndexes;
},
generateStructInfo: function (struct, typeName, offset) {
var type, alignment;
if (typeName) {
offset = offset || 0;
type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
if (!type) return null;
if (type.fields.length != struct.length) {
printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
return null;
}
alignment = type.flatIndexes;
} else {
var type = { fields: struct.map(function(item) { return item[0] }) };
alignment = Runtime.calculateStructAlignment(type);
}
var ret = {
__size__: type.flatSize
};
if (typeName) {
struct.forEach(function(item, i) {
if (typeof item === 'string') {
ret[item] = alignment[i] + offset;
} else {
// embedded struct
var key;
for (var k in item) key = k;
ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
}
});
} else {
struct.forEach(function(item, i) {
ret[item[1]] = alignment[i];
});
}
return ret;
},
dynCall: function (sig, ptr, args) {
if (args && args.length) {
assert(args.length == sig.length-1);
return FUNCTION_TABLE[ptr].apply(null, args);
} else {
assert(sig.length == 1);
return FUNCTION_TABLE[ptr]();
}
},
addFunction: function (func) {
var table = FUNCTION_TABLE;
var ret = table.length;
assert(ret % 2 === 0);
table.push(func);
for (var i = 0; i < 2-1; i++) table.push(0);
return ret;
},
removeFunction: function (index) {
var table = FUNCTION_TABLE;
table[index] = null;
},
getAsmConst: function (code, numArgs) {
// code is a constant string on the heap, so we can cache these
if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
var func = Runtime.asmConstCache[code];
if (func) return func;
var args = [];
for (var i = 0; i < numArgs; i++) {
args.push(String.fromCharCode(36) + i); // $0, $1 etc
}
return Runtime.asmConstCache[code] = eval('(function(' + args.join(',') + '){ ' + Pointer_stringify(code) + ' })'); // new Function does not allow upvars in node
},
warnOnce: function (text) {
if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
if (!Runtime.warnOnce.shown[text]) {
Runtime.warnOnce.shown[text] = 1;
Module.printErr(text);
}
},
funcWrappers: {},
getFuncWrapper: function (func, sig) {
assert(sig);
if (!Runtime.funcWrappers[func]) {
Runtime.funcWrappers[func] = function dynCall_wrapper() {
return Runtime.dynCall(sig, func, arguments);
};
}
return Runtime.funcWrappers[func];
},
UTF8Processor: function () {
var buffer = [];
var needed = 0;
this.processCChar = function (code) {
code = code & 0xFF;
if (buffer.length == 0) {
if ((code & 0x80) == 0x00) { // 0xxxxxxx
return String.fromCharCode(code);
}
buffer.push(code);
if ((code & 0xE0) == 0xC0) { // 110xxxxx
needed = 1;
} else if ((code & 0xF0) == 0xE0) { // 1110xxxx
needed = 2;
} else { // 11110xxx
needed = 3;
}
return '';
}
if (needed) {
buffer.push(code);
needed--;
if (needed > 0) return '';
}
var c1 = buffer[0];
var c2 = buffer[1];
var c3 = buffer[2];
var c4 = buffer[3];
var ret;
if (buffer.length == 2) {
ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
} else if (buffer.length == 3) {
ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
} else {
// http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
((c3 & 0x3F) << 6) | (c4 & 0x3F);
ret = String.fromCharCode(
Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
(codePoint - 0x10000) % 0x400 + 0xDC00);
}
buffer.length = 0;
return ret;
}
this.processJSString = function processJSString(string) {
string = unescape(encodeURIComponent(string));
var ret = [];
for (var i = 0; i < string.length; i++) {
ret.push(string.charCodeAt(i));
}
return ret;
}
},
stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+3)&-4);(assert((STACKTOP|0) < (STACK_MAX|0))|0); return ret; },
staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + (assert(!staticSealed),size))|0;STATICTOP = (((STATICTOP)+3)&-4); return ret; },
dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + (assert(DYNAMICTOP > 0),size))|0;DYNAMICTOP = (((DYNAMICTOP)+3)&-4); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 4))*(quantum ? quantum : 4); return ret; },
makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((low>>>0)+((high>>>0)*4294967296)) : ((low>>>0)+((high|0)*4294967296))); return ret; },
GLOBAL_BASE: 4,
QUANTUM_SIZE: 4,
__dummy__: 0
}
//========================================
// Runtime essentials
//========================================
var __THREW__ = 0; // Used in checking for thrown exceptions.
var setjmpId = 1; // Used in setjmp/longjmp
var setjmpLabels = {};
var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
var EXITSTATUS = 0;
var undef = 0;
// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
var tempI64, tempI64b;
var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
function assert(condition, text) {
if (!condition) {
abort('Assertion failed: ' + text);
}
}
var globalScope = this;
// C calling interface. A convenient way to call C functions (in C files, or
// defined with extern "C").
//
// Note: LLVM optimizations can inline and remove functions, after which you will not be
// able to call them. Closure can also do so. To avoid that, add your function to
// the exports using something like
//
// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
//
// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
// except that 'array' is not possible (there is no way for us to know the length of the array)
// @param args An array of the arguments to the function, as native JS values (as in returnType)
// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
// @return The return value, as a native JS value (as in returnType)
function ccall(ident, returnType, argTypes, args) {
return ccallFunc(getCFunc(ident), returnType, argTypes, args);
}
Module["ccall"] = ccall;
// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
function getCFunc(ident) {
try {
var func = Module['_' + ident]; // closure exported function
if (!func) func = eval('_' + ident); // explicit lookup
} catch(e) {
}
assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
return func;
}
// Internal function that does a C call using a function, not an identifier
function ccallFunc(func, returnType, argTypes, args) {
var stack = 0;
function toC(value, type) {
if (type == 'string') {
if (value === null || value === undefined || value === 0) return 0; // null string
value = intArrayFromString(value);
type = 'array';
}
if (type == 'array') {
if (!stack) stack = Runtime.stackSave();
var ret = Runtime.stackAlloc(value.length);
writeArrayToMemory(value, ret);
return ret;
}
return value;
}
function fromC(value, type) {
if (type == 'string') {
return Pointer_stringify(value);
}
assert(type != 'array');
return value;
}
var i = 0;
var cArgs = args ? args.map(function(arg) {
return toC(arg, argTypes[i++]);
}) : [];
var ret = fromC(func.apply(null, cArgs), returnType);
if (stack) Runtime.stackRestore(stack);
return ret;
}
// Returns a native JS wrapper for a C function. This is similar to ccall, but
// returns a function you can call repeatedly in a normal way. For example:
//
// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
// alert(my_function(5, 22));
// alert(my_function(99, 12));
//
function cwrap(ident, returnType, argTypes) {
var func = getCFunc(ident);
return function() {
return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
}
}
Module["cwrap"] = cwrap;
// Sets a value in memory in a dynamic way at run-time. Uses the
// type data. This is the same as makeSetValue, except that
// makeSetValue is done at compile-time and generates the needed
// code then, whereas this function picks the right code at
// run-time.
// Note that setValue and getValue only do *aligned* writes and reads!
// Note that ccall uses JS types as for defining types, while setValue and
// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
function setValue(ptr, value, type, noSafe) {
type = type || 'i8';
if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
switch(type) {
case 'i1': HEAP8[(ptr)]=value; break;
case 'i8': HEAP8[(ptr)]=value; break;
case 'i16': HEAP16[((ptr)>>1)]=value; break;
case 'i32': HEAP32[((ptr)>>2)]=value; break;
case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
case 'float': HEAPF32[((ptr)>>2)]=value; break;
case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;
default: abort('invalid type for setValue: ' + type);
}
}
Module['setValue'] = setValue;
// Parallel to setValue.
function getValue(ptr, type, noSafe) {
type = type || 'i8';
if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
switch(type) {
case 'i1': return HEAP8[(ptr)];
case 'i8': return HEAP8[(ptr)];
case 'i16': return HEAP16[((ptr)>>1)];
case 'i32': return HEAP32[((ptr)>>2)];
case 'i64': return HEAP32[((ptr)>>2)];
case 'float': return HEAPF32[((ptr)>>2)];
case 'double': return (HEAP32[((tempDoublePtr)>>2)]=HEAP32[((ptr)>>2)],HEAP32[(((tempDoublePtr)+(4))>>2)]=HEAP32[(((ptr)+(4))>>2)],HEAPF64[(tempDoublePtr)>>3]);
default: abort('invalid type for setValue: ' + type);
}
return null;
}
Module['getValue'] = getValue;
var ALLOC_NORMAL = 0; // Tries to use _malloc()
var ALLOC_STACK = 1; // Lives for the duration of the current function call
var ALLOC_STATIC = 2; // Cannot be freed
var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
var ALLOC_NONE = 4; // Do not allocate
Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
Module['ALLOC_STACK'] = ALLOC_STACK;
Module['ALLOC_STATIC'] = ALLOC_STATIC;
Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
Module['ALLOC_NONE'] = ALLOC_NONE;
// allocate(): This is for internal use. You can use it yourself as well, but the interface
// is a little tricky (see docs right below). The reason is that it is optimized
// for multiple syntaxes to save space in generated code. So you should
// normally not use allocate(), and instead allocate memory using _malloc(),
// initialize it with setValue(), and so forth.
// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
// in *bytes* (note that this is sometimes confusing: the next parameter does not
// affect this!)
// @types: Either an array of types, one for each byte (or 0 if no type at that position),
// or a single type which is used for the entire block. This only matters if there
// is initial data - if @slab is a number, then this does not matter at all and is
// ignored.
// @allocator: How to allocate memory, see ALLOC_*
function allocate(slab, types, allocator, ptr) {
var zeroinit, size;
if (typeof slab === 'number') {
zeroinit = true;
size = slab;
} else {
zeroinit = false;
size = slab.length;
}
var singleType = typeof types === 'string' ? types : null;
var ret;
if (allocator == ALLOC_NONE) {
ret = ptr;
} else {
ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
}
if (zeroinit) {
var ptr = ret, stop;
assert((ret & 3) == 0);
stop = ret + (size & ~3);
for (; ptr < stop; ptr += 4) {
HEAP32[((ptr)>>2)]=0;
}
stop = ret + size;
while (ptr < stop) {
HEAP8[((ptr++)|0)]=0;
}
return ret;
}
if (singleType === 'i8') {
if (slab.subarray || slab.slice) {
HEAPU8.set(slab, ret);
} else {
HEAPU8.set(new Uint8Array(slab), ret);
}
return ret;
}
var i = 0, type, typeSize, previousType;
while (i < size) {
var curr = slab[i];
if (typeof curr === 'function') {
curr = Runtime.getFunctionIndex(curr);
}
type = singleType || types[i];
if (type === 0) {
i++;
continue;
}
assert(type, 'Must know what type to store in allocate!');
if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
setValue(ret+i, curr, type);
// no need to look up size unless type changes, so cache it
if (previousType !== type) {
typeSize = Runtime.getNativeTypeSize(type);
previousType = type;
}
i += typeSize;
}
return ret;
}
Module['allocate'] = allocate;
function Pointer_stringify(ptr, /* optional */ length) {
// TODO: use TextDecoder
// Find the length, and check for UTF while doing so
var hasUtf = false;
var t;
var i = 0;
while (1) {
assert(ptr + i < TOTAL_MEMORY);
t = HEAPU8[(((ptr)+(i))|0)];
if (t >= 128) hasUtf = true;
else if (t == 0 && !length) break;
i++;
if (length && i == length) break;
}
if (!length) length = i;
var ret = '';
if (!hasUtf) {
var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
var curr;
while (length > 0) {
curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
ret = ret ? ret + curr : curr;
ptr += MAX_CHUNK;
length -= MAX_CHUNK;
}
return ret;
}
var utf8 = new Runtime.UTF8Processor();
for (i = 0; i < length; i++) {
assert(ptr + i < TOTAL_MEMORY);
t = HEAPU8[(((ptr)+(i))|0)];
ret += utf8.processCChar(t);
}
return ret;
}
Module['Pointer_stringify'] = Pointer_stringify;
// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
// a copy of that string as a Javascript String object.
function UTF16ToString(ptr) {
var i = 0;
var str = '';
while (1) {
var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
if (codeUnit == 0)
return str;
++i;
// fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
str += String.fromCharCode(codeUnit);
}
}
Module['UTF16ToString'] = UTF16ToString;
// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
function stringToUTF16(str, outPtr) {
for(var i = 0; i < str.length; ++i) {
// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
}
// Null-terminate the pointer to the HEAP.
HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
}
Module['stringToUTF16'] = stringToUTF16;
// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
// a copy of that string as a Javascript String object.
function UTF32ToString(ptr) {
var i = 0;
var str = '';
while (1) {
var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
if (utf32 == 0)
return str;
++i;
// Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
if (utf32 >= 0x10000) {
var ch = utf32 - 0x10000;
str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
} else {
str += String.fromCharCode(utf32);
}
}
}
Module['UTF32ToString'] = UTF32ToString;
// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
function stringToUTF32(str, outPtr) {
var iChar = 0;
for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
var trailSurrogate = str.charCodeAt(++iCodeUnit);
codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
}
HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
++iChar;
}
// Null-terminate the pointer to the HEAP.
HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
}
Module['stringToUTF32'] = stringToUTF32;
function demangle(func) {
try {
if (typeof func === 'number') func = Pointer_stringify(func);
if (func[0] !== '_') return func;
if (func[1] !== '_') return func; // C function
if (func[2] !== 'Z') return func;
switch (func[3]) {
case 'n': return 'operator new()';
case 'd': return 'operator delete()';
}
var i = 3;
// params, etc.
var basicTypes = {
'v': 'void',
'b': 'bool',
'c': 'char',
's': 'short',
'i': 'int',
'l': 'long',
'f': 'float',
'd': 'double',
'w': 'wchar_t',
'a': 'signed char',
'h': 'unsigned char',
't': 'unsigned short',
'j': 'unsigned int',
'm': 'unsigned long',
'x': 'long long',
'y': 'unsigned long long',
'z': '...'
};
function dump(x) {
//return;
if (x) Module.print(x);
Module.print(func);
var pre = '';
for (var a = 0; a < i; a++) pre += ' ';
Module.print (pre + '^');
}
var subs = [];
function parseNested() {
i++;
if (func[i] === 'K') i++; // ignore const
var parts = [];
while (func[i] !== 'E') {
if (func[i] === 'S') { // substitution
i++;
var next = func.indexOf('_', i);
var num = func.substring(i, next) || 0;
parts.push(subs[num] || '?');
i = next+1;
continue;
}
if (func[i] === 'C') { // constructor
parts.push(parts[parts.length-1]);
i += 2;
continue;
}
var size = parseInt(func.substr(i));
var pre = size.toString().length;
if (!size || !pre) { i--; break; } // counter i++ below us
var curr = func.substr(i + pre, size);
parts.push(curr);
subs.push(curr);
i += pre + size;
}
i++; // skip E
return parts;
}
var first = true;
function parse(rawList, limit, allowVoid) { // main parser
limit = limit || Infinity;
var ret = '', list = [];
function flushList() {
return '(' + list.join(', ') + ')';
}
var name;
if (func[i] === 'N') {
// namespaced N-E
name = parseNested().join('::');
limit--;
if (limit === 0) return rawList ? [name] : name;
} else {
// not namespaced
if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
var size = parseInt(func.substr(i));
if (size) {
var pre = size.toString().length;
name = func.substr(i + pre, size);
i += pre + size;
}
}
first = false;
if (func[i] === 'I') {
i++;
var iList = parse(true);
var iRet = parse(true, 1, true);
ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
} else {
ret = name;
}
paramLoop: while (i < func.length && limit-- > 0) {
//dump('paramLoop');
var c = func[i++];
if (c in basicTypes) {
list.push(basicTypes[c]);
} else {
switch (c) {
case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
case 'L': { // literal
i++; // skip basic type
var end = func.indexOf('E', i);
var size = end - i;
list.push(func.substr(i, size));
i += size + 2; // size + 'EE'
break;
}
case 'A': { // array
var size = parseInt(func.substr(i));
i += size.toString().length;
if (func[i] !== '_') throw '?';
i++; // skip _
list.push(parse(true, 1, true)[0] + ' [' + size + ']');
break;
}
case 'E': break paramLoop;
default: ret += '?' + c; break paramLoop;
}
}
}
if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
return rawList ? list : ret + flushList();
}
return parse();
} catch(e) {
return func;
}
}
function demangleAll(text) {
return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
}
function stackTrace() {
var stack = new Error().stack;
return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
}
// Memory management
var PAGE_SIZE = 4096;
function alignMemoryPage(x) {
return (x+4095)&-4096;
}
var HEAP;
var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
function enlargeMemory() {
abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
}
var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 16777216;
var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
// Initialize the runtime's memory
// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
'Cannot fallback to non-typed array case: Code is too specialized');
var buffer = new ArrayBuffer(TOTAL_MEMORY);
HEAP8 = new Int8Array(buffer);
HEAP16 = new Int16Array(buffer);
HEAP32 = new Int32Array(buffer);
HEAPU8 = new Uint8Array(buffer);
HEAPU16 = new Uint16Array(buffer);
HEAPU32 = new Uint32Array(buffer);
HEAPF32 = new Float32Array(buffer);
HEAPF64 = new Float64Array(buffer);
// Endianness check (note: assumes compiler arch was little-endian)
HEAP32[0] = 255;
assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
Module['HEAP'] = HEAP;
Module['HEAP8'] = HEAP8;
Module['HEAP16'] = HEAP16;
Module['HEAP32'] = HEAP32;
Module['HEAPU8'] = HEAPU8;
Module['HEAPU16'] = HEAPU16;
Module['HEAPU32'] = HEAPU32;
Module['HEAPF32'] = HEAPF32;
Module['HEAPF64'] = HEAPF64;
function callRuntimeCallbacks(callbacks) {
while(callbacks.length > 0) {
var callback = callbacks.shift();
if (typeof callback == 'function') {
callback();
continue;
}
var func = callback.func;
if (typeof func === 'number') {
if (callback.arg === undefined) {
Runtime.dynCall('v', func);
} else {
Runtime.dynCall('vi', func, [callback.arg]);
}
} else {
func(callback.arg === undefined ? null : callback.arg);
}
}
}
var __ATPRERUN__ = []; // functions called before the runtime is initialized
var __ATINIT__ = []; // functions called during startup
var __ATMAIN__ = []; // functions called when main() is to be run
var __ATEXIT__ = []; // functions called during shutdown
var __ATPOSTRUN__ = []; // functions called after the runtime has exited
var runtimeInitialized = false;
function preRun() {
// compatibility - merge in anything from Module['preRun'] at this time
if (Module['preRun']) {
if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
while (Module['preRun'].length) {
addOnPreRun(Module['preRun'].shift());
}
}
callRuntimeCallbacks(__ATPRERUN__);
}
function ensureInitRuntime() {
if (runtimeInitialized) return;
runtimeInitialized = true;
callRuntimeCallbacks(__ATINIT__);
}
function preMain() {
callRuntimeCallbacks(__ATMAIN__);
}
function exitRuntime() {
callRuntimeCallbacks(__ATEXIT__);
}
function postRun() {
// compatibility - merge in anything from Module['postRun'] at this time
if (Module['postRun']) {
if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
while (Module['postRun'].length) {
addOnPostRun(Module['postRun'].shift());
}
}
callRuntimeCallbacks(__ATPOSTRUN__);
}
function addOnPreRun(cb) {
__ATPRERUN__.unshift(cb);
}
Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
function addOnInit(cb) {
__ATINIT__.unshift(cb);
}
Module['addOnInit'] = Module.addOnInit = addOnInit;
function addOnPreMain(cb) {
__ATMAIN__.unshift(cb);
}
Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
function addOnExit(cb) {
__ATEXIT__.unshift(cb);
}
Module['addOnExit'] = Module.addOnExit = addOnExit;
function addOnPostRun(cb) {
__ATPOSTRUN__.unshift(cb);
}
Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
// Tools
// This processes a JS string into a C-line array of numbers, 0-terminated.
// For LLVM-originating strings, see parser.js:parseLLVMString function
function intArrayFromString(stringy, dontAddNull, length /* optional */) {
var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
if (length) {
ret.length = length;
}
if (!dontAddNull) {
ret.push(0);
}
return ret;
}
Module['intArrayFromString'] = intArrayFromString;
function intArrayToString(array) {
var ret = [];
for (var i = 0; i < array.length; i++) {
var chr = array[i];
if (chr > 0xFF) {
assert(false, 'Character code ' + chr + ' (' + String.fromCharCode(chr) + ') at offset ' + i + ' not in 0x00-0xFF.');
chr &= 0xFF;
}
ret.push(String.fromCharCode(chr));
}
return ret.join('');
}
Module['intArrayToString'] = intArrayToString;
// Write a Javascript array to somewhere in the heap
function writeStringToMemory(string, buffer, dontAddNull) {
var array = intArrayFromString(string, dontAddNull);
var i = 0;
while (i < array.length) {
var chr = array[i];
HEAP8[(((buffer)+(i))|0)]=chr;
i = i + 1;
}
}
Module['writeStringToMemory'] = writeStringToMemory;
function writeArrayToMemory(array, buffer) {
for (var i = 0; i < array.length; i++) {
HEAP8[(((buffer)+(i))|0)]=array[i];
}
}
Module['writeArrayToMemory'] = writeArrayToMemory;
function writeAsciiToMemory(str, buffer, dontAddNull) {
for (var i = 0; i < str.length; i++) {
assert(str.charCodeAt(i) === str.charCodeAt(i)&0xff);
HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
}
if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
}
Module['writeAsciiToMemory'] = writeAsciiToMemory;
function unSign(value, bits, ignore, sig) {
if (value >= 0) {
return value;
}
return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
: Math.pow(2, bits) + value;
}
function reSign(value, bits, ignore, sig) {
if (value <= 0) {
return value;
}
var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
: Math.pow(2, bits-1);
if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
// but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
// TODO: In i64 mode 1, resign the two parts separately and safely
value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
}
return value;
}
if (!Math['imul']) Math['imul'] = function imul(a, b) {
var ah = a >>> 16;
var al = a & 0xffff;
var bh = b >>> 16;
var bl = b & 0xffff;
return (al*bl + ((ah*bl + al*bh) << 16))|0;
};
Math.imul = Math['imul'];
var Math_abs = Math.abs;
var Math_cos = Math.cos;
var Math_sin = Math.sin;
var Math_tan = Math.tan;
var Math_acos = Math.acos;
var Math_asin = Math.asin;
var Math_atan = Math.atan;
var Math_atan2 = Math.atan2;
var Math_exp = Math.exp;
var Math_log = Math.log;
var Math_sqrt = Math.sqrt;
var Math_ceil = Math.ceil;
var Math_floor = Math.floor;
var Math_pow = Math.pow;
var Math_imul = Math.imul;
var Math_fround = Math.fround;
var Math_min = Math.min;
// A counter of dependencies for calling run(). If we need to
// do asynchronous work before running, increment this and
// decrement it. Incrementing must happen in a place like
// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
// Note that you can add dependencies in preRun, even though
// it happens right before run - run will be postponed until
// the dependencies are met.
var runDependencies = 0;
var runDependencyWatcher = null;
var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
var runDependencyTracking = {};
function addRunDependency(id) {
runDependencies++;
if (Module['monitorRunDependencies']) {
Module['monitorRunDependencies'](runDependencies);
}
if (id) {
assert(!runDependencyTracking[id]);
runDependencyTracking[id] = 1;
if (runDependencyWatcher === null && typeof setInterval !== 'undefined') {
// Check for missing dependencies every few seconds
runDependencyWatcher = setInterval(function() {
var shown = false;
for (var dep in runDependencyTracking) {
if (!shown) {
shown = true;
Module.printErr('still waiting on run dependencies:');
}
Module.printErr('dependency: ' + dep);
}
if (shown) {
Module.printErr('(end of list)');
}
}, 10000);
}
} else {
Module.printErr('warning: run dependency added without ID');
}
}
Module['addRunDependency'] = addRunDependency;
function removeRunDependency(id) {
runDependencies--;
if (Module['monitorRunDependencies']) {
Module['monitorRunDependencies'](runDependencies);
}
if (id) {
assert(runDependencyTracking[id]);
delete runDependencyTracking[id];
} else {
Module.printErr('warning: run dependency removed without ID');
}
if (runDependencies == 0) {
if (runDependencyWatcher !== null) {
clearInterval(runDependencyWatcher);
runDependencyWatcher = null;
}
if (dependenciesFulfilled) {
var callback = dependenciesFulfilled;
dependenciesFulfilled = null;
callback(); // can add another dependenciesFulfilled
}
}
}
Module['removeRunDependency'] = removeRunDependency;
Module["preloadedImages"] = {}; // maps url to image data
Module["preloadedAudios"] = {}; // maps url to audio data
var memoryInitializer = null;
// === Body ===
STATIC_BASE = 4;
STATICTOP = STATIC_BASE + 1420;
/* global initializers */ __ATINIT__.push({ func: function() { runPostSets() } });
/* memory initializer */ allocate([95,78,69,84,95,87,77,95,83,84,65,84,69,0,0,0,83,105,109,112,108,101,32,84,101,120,116,117,114,101,32,50,68,0,0,0,37,115,0,0,115,95,116,101,120,116,117,114,101,0,0,0,69,114,114,111,114,32,99,111,109,112,105,108,105,110,103,32,115,104,97,100,101,114,58,10,37,115,10,0,37,52,100,32,102,114,97,109,101,115,32,114,101,110,100,101,114,101,100,32,105,110,32,37,49,46,52,102,32,115,101,99,111,110,100,115,32,45,62,32,70,80,83,61,37,51,46,52,102,10,0,0,69,114,114,111,114,32,108,105,110,107,105,110,103,32,112,114,111,103,114,97,109,58,10,37,115,10,0,0,97,95,116,101,120,67,111,111,114,100,0,0,97,95,112,111,115,105,116,105,111,110,0,0,0,0,0,191,0,0,0,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,191,0,0,0,191,0,0,0,0,0,0,0,0,0,0,128,63,0,0,0,63,0,0,0,191,0,0,0,0,0,0,128,63,0,0,128,63,0,0,0,63,0,0,0,63,0,0,0,0,0,0,128,63,0,0,0,0,97,116,116,114,105,98,117,116,101,32,118,101,99,52,32,97,95,112,111,115,105,116,105,111,110,59,32,32,32,10,97,116,116,114,105,98,117,116,101,32,118,101,99,50,32,97,95,116,101,120,67,111,111,114,100,59,32,32,32,10,118,97,114,121,105,110,103,32,118,101,99,50,32,118,95,116,101,120,67,111,111,114,100,59,32,32,32,32,32,10,118,111,105,100,32,109,97,105,110,40,41,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,123,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,32,32,32,103,108,95,80,111,115,105,116,105,111,110,32,61,32,97,95,112,111,115,105,116,105,111,110,59,32,10,32,32,32,118,95,116,101,120,67,111,111,114,100,32,61,32,97,95,116,101,120,67,111,111,114,100,59,32,32,10,125,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,0,0,0,0,0,0,1,0,2,0,0,0,2,0,3,0,112,114,101,99,105,115,105,111,110,32,109,101,100,105,117,109,112,32,102,108,111,97,116,59,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,118,97,114,121,105,110,103,32,118,101,99,50,32,118,95,116,101,120,67,111,111,114,100,59,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,117,110,105,102,111,114,109,32,115,97,109,112,108,101,114,50,68,32,115,95,116,101,120,116,117,114,101,59,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,118,111,105,100,32,109,97,105,110,40,41,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,123,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,32,32,103,108,95,70,114,97,103,67,111,108,111,114,32,61,32,116,101,120,116,117,114,101,50,68,40,32,115,95,116,101,120,116,117,114,101,44,32,118,95,116,101,120,67,111,111,114,100,32,41,59,10,125,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,10,0,255,0,0,0,255,0,0,0,255,255,255,0,152,48,0,0,2,0,0,0,56,48,0,0,56,48,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE)
function runPostSets() {
}
var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
assert(tempDoublePtr % 8 == 0);
function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
HEAP8[tempDoublePtr] = HEAP8[ptr];
HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
}
function copyTempDouble(ptr) {
HEAP8[tempDoublePtr] = HEAP8[ptr];
HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
}
function _memcpy(dest, src, num) {
dest = dest|0; src = src|0; num = num|0;
var ret = 0;
ret = dest|0;
if ((dest&3) == (src&3)) {
while (dest & 3) {
if ((num|0) == 0) return ret|0;
HEAP8[(dest)]=HEAP8[(src)];
dest = (dest+1)|0;
src = (src+1)|0;
num = (num-1)|0;
}
while ((num|0) >= 4) {
HEAP32[((dest)>>2)]=HEAP32[((src)>>2)];
dest = (dest+4)|0;
src = (src+4)|0;
num = (num-4)|0;
}
}
while ((num|0) > 0) {
HEAP8[(dest)]=HEAP8[(src)];
dest = (dest+1)|0;
src = (src+1)|0;
num = (num-1)|0;
}
return ret|0;
}var _llvm_memcpy_p0i8_p0i8_i32=_memcpy;
var GL={counter:1,lastError:0,buffers:[],programs:[],framebuffers:[],renderbuffers:[],textures:[],uniforms:[],shaders:[],currArrayBuffer:0,currElementArrayBuffer:0,byteSizeByTypeRoot:5120,byteSizeByType:[1,1,2,2,4,4,4,2,3,4,8],programInfos:{},stringCache:{},packAlignment:4,unpackAlignment:4,init:function () {
Browser.moduleContextCreatedCallbacks.push(GL.initExtensions);
},recordError:function recordError(errorCode) {
if (!GL.lastError) {
GL.lastError = errorCode;
}
},getNewId:function (table) {
var ret = GL.counter++;
for (var i = table.length; i < ret; i++) {
table[i] = null;
}
return ret;
},MINI_TEMP_BUFFER_SIZE:16,miniTempBuffer:null,miniTempBufferViews:[0],MAX_TEMP_BUFFER_SIZE:2097152,tempBufferIndexLookup:null,tempVertexBuffers:null,tempIndexBuffers:null,tempQuadIndexBuffer:null,generateTempBuffers:function (quads) {
GL.tempBufferIndexLookup = new Uint8Array(GL.MAX_TEMP_BUFFER_SIZE+1);
GL.tempVertexBuffers = [];
GL.tempIndexBuffers = [];
var last = -1, curr = -1;
var size = 1;
for (var i = 0; i <= GL.MAX_TEMP_BUFFER_SIZE; i++) {
if (i > size) {
size <<= 1;
}
if (size != last) {
curr++;
GL.tempVertexBuffers[curr] = Module.ctx.createBuffer();
Module.ctx.bindBuffer(Module.ctx.ARRAY_BUFFER, GL.tempVertexBuffers[curr]);
Module.ctx.bufferData(Module.ctx.ARRAY_BUFFER, size, Module.ctx.DYNAMIC_DRAW);
Module.ctx.bindBuffer(Module.ctx.ARRAY_BUFFER, null);
GL.tempIndexBuffers[curr] = Module.ctx.createBuffer();
Module.ctx.bindBuffer(Module.ctx.ELEMENT_ARRAY_BUFFER, GL.tempIndexBuffers[curr]);
Module.ctx.bufferData(Module.ctx.ELEMENT_ARRAY_BUFFER, size, Module.ctx.DYNAMIC_DRAW);
Module.ctx.bindBuffer(Module.ctx.ELEMENT_ARRAY_BUFFER, null);
last = size;
}
GL.tempBufferIndexLookup[i] = curr;
}
if (quads) {
// GL_QUAD indexes can be precalculated
GL.tempQuadIndexBuffer = Module.ctx.createBuffer();
Module.ctx.bindBuffer(Module.ctx.ELEMENT_ARRAY_BUFFER, GL.tempQuadIndexBuffer);
var numIndexes = GL.MAX_TEMP_BUFFER_SIZE >> 1;
var quadIndexes = new Uint16Array(numIndexes);
var i = 0, v = 0;
while (1) {
quadIndexes[i++] = v;
if (i >= numIndexes) break;
quadIndexes[i++] = v+1;
if (i >= numIndexes) break;
quadIndexes[i++] = v+2;
if (i >= numIndexes) break;
quadIndexes[i++] = v;
if (i >= numIndexes) break;
quadIndexes[i++] = v+2;
if (i >= numIndexes) break;
quadIndexes[i++] = v+3;
if (i >= numIndexes) break;
v += 4;
}
Module.ctx.bufferData(Module.ctx.ELEMENT_ARRAY_BUFFER, quadIndexes, Module.ctx.STATIC_DRAW);
Module.ctx.bindBuffer(Module.ctx.ELEMENT_ARRAY_BUFFER, null);
}
},findToken:function (source, token) {
function isIdentChar(ch) {
if (ch >= 48 && ch <= 57) // 0-9
return true;
if (ch >= 65 && ch <= 90) // A-Z
return true;
if (ch >= 97 && ch <= 122) // a-z
return true;
return false;
}
var i = -1;
do {
i = source.indexOf(token, i + 1);
if (i < 0) {
break;
}
if (i > 0 && isIdentChar(source[i - 1])) {
continue;
}
i += token.length;
if (i < source.length - 1 && isIdentChar(source[i + 1])) {
continue;
}
return true;
} while (true);
return false;
},getSource:function (shader, count, string, length) {
var source = '';
for (var i = 0; i < count; ++i) {
var frag;
if (length) {
var len = HEAP32[(((length)+(i*4))>>2)];
if (len < 0) {
frag = Pointer_stringify(HEAP32[(((string)+(i*4))>>2)]);
} else {
frag = Pointer_stringify(HEAP32[(((string)+(i*4))>>2)], len);
}
} else {
frag = Pointer_stringify(HEAP32[(((string)+(i*4))>>2)]);
}
source += frag;
}
// Let's see if we need to enable the standard derivatives extension
type = Module.ctx.getShaderParameter(GL.shaders[shader], 0x8B4F /* GL_SHADER_TYPE */);
if (type == 0x8B30 /* GL_FRAGMENT_SHADER */) {
if (GL.findToken(source, "dFdx") ||
GL.findToken(source, "dFdy") ||
GL.findToken(source, "fwidth")) {
source = "#extension GL_OES_standard_derivatives : enable\n" + source;
var extension = Module.ctx.getExtension("OES_standard_derivatives");
}
}
return source;
},computeImageSize:function (width, height, sizePerPixel, alignment) {
function roundedToNextMultipleOf(x, y) {
return Math.floor((x + y - 1) / y) * y
}
var plainRowSize = width * sizePerPixel;
var alignedRowSize = roundedToNextMultipleOf(plainRowSize, alignment);
return (height <= 0) ? 0 :
((height - 1) * alignedRowSize + plainRowSize);
},get:function (name_, p, type) {
var ret = undefined;
switch(name_) { // Handle a few trivial GLES values
case 0x8DFA: // GL_SHADER_COMPILER
ret = 1;
break;
case 0x8DF8: // GL_SHADER_BINARY_FORMATS
if (type === 'Integer') {
// fall through, see gles2_conformance.cpp
} else {
GL.recordError(0x0500); // GL_INVALID_ENUM
return;
}
case 0x8DF9: // GL_NUM_SHADER_BINARY_FORMATS
ret = 0;
break;
case 0x86A2: // GL_NUM_COMPRESSED_TEXTURE_FORMATS
// WebGL doesn't have GL_NUM_COMPRESSED_TEXTURE_FORMATS (it's obsolete since GL_COMPRESSED_TEXTURE_FORMATS returns a JS array that can be queried for length),
// so implement it ourselves to allow C++ GLES2 code get the length.
var formats = Module.ctx.getParameter(0x86A3 /*GL_COMPRESSED_TEXTURE_FORMATS*/);
ret = formats.length;
break;
case 0x8B9A: // GL_IMPLEMENTATION_COLOR_READ_TYPE
ret = 0x1401; // GL_UNSIGNED_BYTE
break;
case 0x8B9B: // GL_IMPLEMENTATION_COLOR_READ_FORMAT
ret = 0x1908; // GL_RGBA
break;
}
if (ret === undefined) {
var result = Module.ctx.getParameter(name_);
switch (typeof(result)) {
case "number":
ret = result;
break;
case "boolean":
ret = result ? 1 : 0;
break;
case "string":
GL.recordError(0x0500); // GL_INVALID_ENUM
return;
case "object":
if (result === null) {
GL.recordError(0x0500); // GL_INVALID_ENUM
return;
} else if (result instanceof Float32Array ||
result instanceof Uint32Array ||
result instanceof Int32Array ||
result instanceof Array) {
for (var i = 0; i < result.length; ++i) {
switch (type) {
case 'Integer': HEAP32[(((p)+(i*4))>>2)]=result[i]; break;
case 'Float': HEAPF32[(((p)+(i*4))>>2)]=result[i]; break;
case 'Boolean': HEAP8[(((p)+(i))|0)]=result[i] ? 1 : 0; break;
default: throw 'internal glGet error, bad type: ' + type;
}
}
return;
} else if (result instanceof WebGLBuffer ||
result instanceof WebGLProgram ||
result instanceof WebGLFramebuffer ||
result instanceof WebGLRenderbuffer ||
result instanceof WebGLTexture) {
ret = result.name | 0;
} else {
GL.recordError(0x0500); // GL_INVALID_ENUM
return;
}
break;
default:
GL.recordError(0x0500); // GL_INVALID_ENUM
return;
}
}
switch (type) {
case 'Integer': HEAP32[((p)>>2)]=ret; break;
case 'Float': HEAPF32[((p)>>2)]=ret; break;
case 'Boolean': HEAP8[(p)]=ret ? 1 : 0; break;
default: throw 'internal glGet error, bad type: ' + type;
}
},getTexPixelData:function (type, format, width, height, pixels, internalFormat) {
var sizePerPixel;
switch (type) {
case 0x1401 /* GL_UNSIGNED_BYTE */:
switch (format) {
case 0x1906 /* GL_ALPHA */:
case 0x1909 /* GL_LUMINANCE */:
sizePerPixel = 1;
break;
case 0x1907 /* GL_RGB */:
sizePerPixel = 3;
break;
case 0x1908 /* GL_RGBA */:
sizePerPixel = 4;
break;
case 0x190A /* GL_LUMINANCE_ALPHA */:
sizePerPixel = 2;
break;
default:
throw 'Invalid format (' + format + ')';
}
break;
case 0x1403 /* GL_UNSIGNED_SHORT */:
if (format == 0x1902 /* GL_DEPTH_COMPONENT */) {
sizePerPixel = 2;
} else {
throw 'Invalid format (' + format + ')';
}
break;
case 0x1405 /* GL_UNSIGNED_INT */:
if (format == 0x1902 /* GL_DEPTH_COMPONENT */) {
sizePerPixel = 4;
} else {
throw 'Invalid format (' + format + ')';
}
break;
case 0x84FA /* UNSIGNED_INT_24_8_WEBGL */:
sizePerPixel = 4;
break;
case 0x8363 /* GL_UNSIGNED_SHORT_5_6_5 */:
case 0x8033 /* GL_UNSIGNED_SHORT_4_4_4_4 */:
case 0x8034 /* GL_UNSIGNED_SHORT_5_5_5_1 */:
sizePerPixel = 2;
break;
case 0x1406 /* GL_FLOAT */:
assert(GL.floatExt, 'Must have OES_texture_float to use float textures');
switch (format) {
case 0x1907 /* GL_RGB */:
sizePerPixel = 3*4;
break;
case 0x1908 /* GL_RGBA */:
sizePerPixel = 4*4;
break;
default:
throw 'Invalid format (' + format + ')';
}
internalFormat = Module.ctx.RGBA;
break;
default:
throw 'Invalid type (' + type + ')';
}
var bytes = GL.computeImageSize(width, height, sizePerPixel, GL.unpackAlignment);
if (type == 0x1401 /* GL_UNSIGNED_BYTE */) {
pixels = HEAPU8.subarray((pixels),(pixels+bytes));
} else if (type == 0x1406 /* GL_FLOAT */) {
pixels = HEAPF32.subarray((pixels)>>2,(pixels+bytes)>>2);
} else if (type == 0x1405 /* GL_UNSIGNED_INT */ || type == 0x84FA /* UNSIGNED_INT_24_8_WEBGL */) {
pixels = HEAPU32.subarray((pixels)>>2,(pixels+bytes)>>2);
} else {
pixels = HEAPU16.subarray((pixels)>>1,(pixels+bytes)>>1);
}
return {
pixels: pixels,
internalFormat: internalFormat
}
},initExtensions:function () {
if (GL.initExtensions.done) return;
GL.initExtensions.done = true;
if (!Module.useWebGL) return; // an app might link both gl and 2d backends
GL.miniTempBuffer = new Float32Array(GL.MINI_TEMP_BUFFER_SIZE);
for (var i = 0; i < GL.MINI_TEMP_BUFFER_SIZE; i++) {
GL.miniTempBufferViews[i] = GL.miniTempBuffer.subarray(0, i+1);
}
GL.maxVertexAttribs = Module.ctx.getParameter(Module.ctx.MAX_VERTEX_ATTRIBS);
// Detect the presence of a few extensions manually, this GL interop layer itself will need to know if they exist.
GL.compressionExt = Module.ctx.getExtension('WEBGL_compressed_texture_s3tc') ||
Module.ctx.getExtension('MOZ_WEBGL_compressed_texture_s3tc') ||
Module.ctx.getExtension('WEBKIT_WEBGL_compressed_texture_s3tc');
GL.anisotropicExt = Module.ctx.getExtension('EXT_texture_filter_anisotropic') ||
Module.ctx.getExtension('MOZ_EXT_texture_filter_anisotropic') ||
Module.ctx.getExtension('WEBKIT_EXT_texture_filter_anisotropic');
GL.floatExt = Module.ctx.getExtension('OES_texture_float');
// These are the 'safe' feature-enabling extensions that don't add any performance impact related to e.g. debugging, and
// should be enabled by default so that client GLES2/GL code will not need to go through extra hoops to get its stuff working.
// As new extensions are ratified at http://www.khronos.org/registry/webgl/extensions/ , feel free to add your new extensions
// here, as long as they don't produce a performance impact for users that might not be using those extensions.
// E.g. debugging-related extensions should probably be off by default.
var automaticallyEnabledExtensions = [ "OES_texture_float", "OES_texture_half_float", "OES_standard_derivatives",
"OES_vertex_array_object", "WEBGL_compressed_texture_s3tc", "WEBGL_depth_texture",
"OES_element_index_uint", "EXT_texture_filter_anisotropic", "ANGLE_instanced_arrays",
"OES_texture_float_linear", "OES_texture_half_float_linear", "WEBGL_compressed_texture_atc",
"WEBGL_compressed_texture_pvrtc", "EXT_color_buffer_half_float", "WEBGL_color_buffer_float",
"EXT_frag_depth", "EXT_sRGB", "WEBGL_draw_buffers", "WEBGL_shared_resources" ];
function shouldEnableAutomatically(extension) {
for(var i in automaticallyEnabledExtensions) {
var include = automaticallyEnabledExtensions[i];
if (ext.indexOf(include) != -1) {
return true;
}
}
return false;
}
var extensions = Module.ctx.getSupportedExtensions();
for(var e in extensions) {
var ext = extensions[e].replace('MOZ_', '').replace('WEBKIT_', '');
if (automaticallyEnabledExtensions.indexOf(ext) != -1) {
Module.ctx.getExtension(ext); // Calling .getExtension enables that extension permanently, no need to store the return value to be enabled.
}
}
},populateUniformTable:function (program) {
var p = GL.programs[program];
GL.programInfos[program] = {
uniforms: {},
maxUniformLength: 0, // This is eagerly computed below, since we already enumerate all uniforms anyway.
maxAttributeLength: -1 // This is lazily computed and cached, computed when/if first asked, "-1" meaning not computed yet.
};
var ptable = GL.programInfos[program];
var utable = ptable.uniforms;
// A program's uniform table maps the string name of an uniform to an integer location of that uniform.
// The global GL.uniforms map maps integer locations to WebGLUniformLocations.
var numUniforms = Module.ctx.getProgramParameter(p, Module.ctx.ACTIVE_UNIFORMS);
for (var i = 0; i < numUniforms; ++i) {
var u = Module.ctx.getActiveUniform(p, i);
var name = u.name;
ptable.maxUniformLength = Math.max(ptable.maxUniformLength, name.length+1);
// Strip off any trailing array specifier we might have got, e.g. "[0]".
if (name.indexOf(']', name.length-1) !== -1) {
var ls = name.lastIndexOf('[');
name = name.slice(0, ls);
}
// Optimize memory usage slightly: If we have an array of uniforms, e.g. 'vec3 colors[3];', then
// only store the string 'colors' in utable, and 'colors[0]', 'colors[1]' and 'colors[2]' will be parsed as 'colors'+i.
// Note that for the GL.uniforms table, we still need to fetch the all WebGLUniformLocations for all the indices.
var loc = Module.ctx.getUniformLocation(p, name);
var id = GL.getNewId(GL.uniforms);
utable[name] = [u.size, id];
GL.uniforms[id] = loc;
for (var j = 1; j < u.size; ++j) {
var n = name + '['+j+']';
loc = Module.ctx.getUniformLocation(p, n);
id = GL.getNewId(GL.uniforms);
GL.uniforms[id] = loc;
}
}
}};function _glPixelStorei(pname, param) {
if (pname == 0x0D05 /* GL_PACK_ALIGNMENT */) {
GL.packAlignment = param;
} else if (pname == 0x0cf5 /* GL_UNPACK_ALIGNMENT */) {
GL.unpackAlignment = param;
}
Module.ctx.pixelStorei(pname, param);
}
function _glGenTextures(n, textures) {
for (var i = 0; i < n; i++) {
var id = GL.getNewId(GL.textures);
var texture = Module.ctx.createTexture();
texture.name = id;
GL.textures[id] = texture;
HEAP32[(((textures)+(i*4))>>2)]=id;
}
}
function _glBindTexture(target, texture) {
Module.ctx.bindTexture(target, texture ? GL.textures[texture] : null);
}
function _glTexImage2D(target, level, internalFormat, width, height, border, format, type, pixels) {
if (pixels) {
var data = GL.getTexPixelData(type, format, width, height, pixels, internalFormat);
pixels = data.pixels;
internalFormat = data.internalFormat;
} else {
pixels = null;
}
Module.ctx.texImage2D(target, level, internalFormat, width, height, border, format, type, pixels);
}
function _glTexParameteri(x0, x1, x2) { Module.ctx.texParameteri(x0, x1, x2) }
function _glGetAttribLocation(program, name) {
program = GL.programs[program];
name = Pointer_stringify(name);
return Module.ctx.getAttribLocation(program, name);
}
function _glGetUniformLocation(program, name) {
name = Pointer_stringify(name);
var arrayOffset = 0;
// If user passed an array accessor "[index]", parse the array index off the accessor.
if (name.indexOf(']', name.length-1) !== -1) {
var ls = name.lastIndexOf('[');
var arrayIndex = name.slice(ls+1, -1);
if (arrayIndex.length > 0) {
arrayOffset = parseInt(arrayIndex);
if (arrayOffset < 0) {
return -1;
}
}
name = name.slice(0, ls);
}
var ptable = GL.programInfos[program];
if (!ptable) {
return -1;
}
var utable = ptable.uniforms;
var uniformInfo = utable[name]; // returns pair [ dimension_of_uniform_array, uniform_location ]
if (uniformInfo && arrayOffset < uniformInfo[0]) { // Check if user asked for an out-of-bounds element, i.e. for 'vec4 colors[3];' user could ask for 'colors[10]' which should return -1.
return uniformInfo[1]+arrayOffset;
} else {
return -1;
}
}
function _glGenBuffers(n, buffers) {
for (var i = 0; i < n; i++) {
var id = GL.getNewId(GL.buffers);
var buffer = Module.ctx.createBuffer();
buffer.name = id;
GL.buffers[id] = buffer;
HEAP32[(((buffers)+(i*4))>>2)]=id;
}
}
function _glBindBuffer(target, buffer) {
var bufferObj = buffer ? GL.buffers[buffer] : null;
if (target == Module.ctx.ARRAY_BUFFER) {
GL.currArrayBuffer = buffer;
} else if (target == Module.ctx.ELEMENT_ARRAY_BUFFER) {
GL.currElementArrayBuffer = buffer;
}
Module.ctx.bindBuffer(target, bufferObj);
}
function _glBufferData(target, size, data, usage) {
switch (usage) { // fix usages, WebGL only has *_DRAW
case 0x88E1: // GL_STREAM_READ
case 0x88E2: // GL_STREAM_COPY
usage = 0x88E0; // GL_STREAM_DRAW
break;
case 0x88E5: // GL_STATIC_READ
case 0x88E6: // GL_STATIC_COPY
usage = 0x88E4; // GL_STATIC_DRAW
break;
case 0x88E9: // GL_DYNAMIC_READ
case 0x88EA: // GL_DYNAMIC_COPY
usage = 0x88E8; // GL_DYNAMIC_DRAW
break;
}
Module.ctx.bufferData(target, HEAPU8.subarray(data, data+size), usage);
}
function _glClearColor(x0, x1, x2, x3) { Module.ctx.clearColor(x0, x1, x2, x3) }
function _glViewport(x0, x1, x2, x3) { Module.ctx.viewport(x0, x1, x2, x3) }
function _glClear(x0) { Module.ctx.clear(x0) }
function _glUseProgram(program) {
Module.ctx.useProgram(program ? GL.programs[program] : null);
}
function _glVertexAttribPointer(index, size, type, normalized, stride, ptr) {
Module.ctx.vertexAttribPointer(index, size, type, normalized, stride, ptr);
}
function _glEnableVertexAttribArray(index) {
Module.ctx.enableVertexAttribArray(index);
}
function _glActiveTexture(x0) { Module.ctx.activeTexture(x0) }
function _glUniform1i(location, v0) {
location = GL.uniforms[location];
Module.ctx.uniform1i(location, v0);
}
function _glDrawElements(mode, count, type, indices) {
Module.ctx.drawElements(mode, count, type, indices);
}
function _glDeleteTextures(n, textures) {
for (var i = 0; i < n; i++) {
var id = HEAP32[(((textures)+(i*4))>>2)];
var texture = GL.textures[id];
Module.ctx.deleteTexture(texture);
texture.name = 0;
GL.textures[id] = null;
}
}
function _glDeleteProgram(program) {
var program = GL.programs[program];
Module.ctx.deleteProgram(program);
program.name = 0;
GL.programs[program] = null;
GL.programInfos[program] = null;
}
var EGL={errorCode:12288,defaultDisplayInitialized:false,currentContext:0,currentReadSurface:0,currentDrawSurface:0,stringCache:{},setErrorCode:function (code) {
EGL.errorCode = code;
},chooseConfig:function (display, attribList, config, config_size, numConfigs) {
if (display != 62000 /* Magic ID for Emscripten 'default display' */) {
EGL.setErrorCode(0x3008 /* EGL_BAD_DISPLAY */);
return 0;
}
// TODO: read attribList.
if ((!config || !config_size) && !numConfigs) {
EGL.setErrorCode(0x300C /* EGL_BAD_PARAMETER */);
return 0;
}
if (numConfigs) {
HEAP32[((numConfigs)>>2)]=1; // Total number of supported configs: 1.
}
if (config && config_size > 0) {
HEAP32[((config)>>2)]=62002;
}
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
return 1;
}};function _eglGetDisplay(nativeDisplayType) {
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
// Note: As a 'conformant' implementation of EGL, we would prefer to init here only if the user
// calls this function with EGL_DEFAULT_DISPLAY. Other display IDs would be preferred to be unsupported
// and EGL_NO_DISPLAY returned. Uncomment the following code lines to do this.
// Instead, an alternative route has been preferred, namely that the Emscripten EGL implementation
// "emulates" X11, and eglGetDisplay is expected to accept/receive a pointer to an X11 Display object.
// Therefore, be lax and allow anything to be passed in, and return the magic handle to our default EGLDisplay object.
// if (nativeDisplayType == 0 /* EGL_DEFAULT_DISPLAY */) {
return 62000; // Magic ID for Emscripten 'default display'
// }
// else
// return 0; // EGL_NO_DISPLAY
}
function _eglInitialize(display, majorVersion, minorVersion) {
if (display == 62000 /* Magic ID for Emscripten 'default display' */) {
if (majorVersion) {
HEAP32[((majorVersion)>>2)]=1; // Advertise EGL Major version: '1'
}
if (minorVersion) {
HEAP32[((minorVersion)>>2)]=4; // Advertise EGL Minor version: '4'
}
EGL.defaultDisplayInitialized = true;
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
return 1;
}
else {
EGL.setErrorCode(0x3008 /* EGL_BAD_DISPLAY */);
return 0;
}
}
function _eglGetConfigs(display, configs, config_size, numConfigs) {
return EGL.chooseConfig(display, 0, configs, config_size, numConfigs);
}
function _eglChooseConfig(display, attrib_list, configs, config_size, numConfigs) {
return EGL.chooseConfig(display, attrib_list, configs, config_size, numConfigs);
}
function _eglCreateWindowSurface(display, config, win, attrib_list) {
if (display != 62000 /* Magic ID for Emscripten 'default display' */) {
EGL.setErrorCode(0x3008 /* EGL_BAD_DISPLAY */);
return 0;
}
if (config != 62002 /* Magic ID for the only EGLConfig supported by Emscripten */) {
EGL.setErrorCode(0x3005 /* EGL_BAD_CONFIG */);
return 0;
}
// TODO: Examine attrib_list! Parameters that can be present there are:
// - EGL_RENDER_BUFFER (must be EGL_BACK_BUFFER)
// - EGL_VG_COLORSPACE (can't be set)
// - EGL_VG_ALPHA_FORMAT (can't be set)
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
return 62006; /* Magic ID for Emscripten 'default surface' */
}
var GLUT={initTime:null,idleFunc:null,displayFunc:null,keyboardFunc:null,keyboardUpFunc:null,specialFunc:null,specialUpFunc:null,reshapeFunc:null,motionFunc:null,passiveMotionFunc:null,mouseFunc:null,buttons:0,modifiers:0,initWindowWidth:256,initWindowHeight:256,initDisplayMode:18,windowX:0,windowY:0,windowWidth:0,windowHeight:0,saveModifiers:function (event) {
GLUT.modifiers = 0;
if (event['shiftKey'])
GLUT.modifiers += 1; /* GLUT_ACTIVE_SHIFT */
if (event['ctrlKey'])
GLUT.modifiers += 2; /* GLUT_ACTIVE_CTRL */
if (event['altKey'])
GLUT.modifiers += 4; /* GLUT_ACTIVE_ALT */
},onMousemove:function (event) {
/* Send motion event only if the motion changed, prevents
* spamming our app with uncessary callback call. It does happen in
* Chrome on Windows.
*/
var lastX = Browser.mouseX;
var lastY = Browser.mouseY;
Browser.calculateMouseEvent(event);
var newX = Browser.mouseX;
var newY = Browser.mouseY;
if (newX == lastX && newY == lastY) return;
if (GLUT.buttons == 0 && event.target == Module["canvas"] && GLUT.passiveMotionFunc) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('vii', GLUT.passiveMotionFunc, [lastX, lastY]);
} else if (GLUT.buttons != 0 && GLUT.motionFunc) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('vii', GLUT.motionFunc, [lastX, lastY]);
}
},getSpecialKey:function (keycode) {
var key = null;
switch (keycode) {
case 8: key = 120 /* backspace */; break;
case 46: key = 111 /* delete */; break;
case 0x70 /*DOM_VK_F1*/: key = 1 /* GLUT_KEY_F1 */; break;
case 0x71 /*DOM_VK_F2*/: key = 2 /* GLUT_KEY_F2 */; break;
case 0x72 /*DOM_VK_F3*/: key = 3 /* GLUT_KEY_F3 */; break;
case 0x73 /*DOM_VK_F4*/: key = 4 /* GLUT_KEY_F4 */; break;
case 0x74 /*DOM_VK_F5*/: key = 5 /* GLUT_KEY_F5 */; break;
case 0x75 /*DOM_VK_F6*/: key = 6 /* GLUT_KEY_F6 */; break;
case 0x76 /*DOM_VK_F7*/: key = 7 /* GLUT_KEY_F7 */; break;
case 0x77 /*DOM_VK_F8*/: key = 8 /* GLUT_KEY_F8 */; break;
case 0x78 /*DOM_VK_F9*/: key = 9 /* GLUT_KEY_F9 */; break;
case 0x79 /*DOM_VK_F10*/: key = 10 /* GLUT_KEY_F10 */; break;
case 0x7a /*DOM_VK_F11*/: key = 11 /* GLUT_KEY_F11 */; break;
case 0x7b /*DOM_VK_F12*/: key = 12 /* GLUT_KEY_F12 */; break;
case 0x25 /*DOM_VK_LEFT*/: key = 100 /* GLUT_KEY_LEFT */; break;
case 0x26 /*DOM_VK_UP*/: key = 101 /* GLUT_KEY_UP */; break;
case 0x27 /*DOM_VK_RIGHT*/: key = 102 /* GLUT_KEY_RIGHT */; break;
case 0x28 /*DOM_VK_DOWN*/: key = 103 /* GLUT_KEY_DOWN */; break;
case 0x21 /*DOM_VK_PAGE_UP*/: key = 104 /* GLUT_KEY_PAGE_UP */; break;
case 0x22 /*DOM_VK_PAGE_DOWN*/: key = 105 /* GLUT_KEY_PAGE_DOWN */; break;
case 0x24 /*DOM_VK_HOME*/: key = 106 /* GLUT_KEY_HOME */; break;
case 0x23 /*DOM_VK_END*/: key = 107 /* GLUT_KEY_END */; break;
case 0x2d /*DOM_VK_INSERT*/: key = 108 /* GLUT_KEY_INSERT */; break;
case 16 /*DOM_VK_SHIFT*/:
case 0x05 /*DOM_VK_LEFT_SHIFT*/:
key = 112 /* GLUT_KEY_SHIFT_L */;
break;
case 0x06 /*DOM_VK_RIGHT_SHIFT*/:
key = 113 /* GLUT_KEY_SHIFT_R */;
break;
case 17 /*DOM_VK_CONTROL*/:
case 0x03 /*DOM_VK_LEFT_CONTROL*/:
key = 114 /* GLUT_KEY_CONTROL_L */;
break;
case 0x04 /*DOM_VK_RIGHT_CONTROL*/:
key = 115 /* GLUT_KEY_CONTROL_R */;
break;
case 18 /*DOM_VK_ALT*/:
case 0x02 /*DOM_VK_LEFT_ALT*/:
key = 116 /* GLUT_KEY_ALT_L */;
break;
case 0x01 /*DOM_VK_RIGHT_ALT*/:
key = 117 /* GLUT_KEY_ALT_R */;
break;
};
return key;
},getASCIIKey:function (event) {
if (event['ctrlKey'] || event['altKey'] || event['metaKey']) return null;
var keycode = event['keyCode'];
/* The exact list is soooo hard to find in a canonical place! */
if (48 <= keycode && keycode <= 57)
return keycode; // numeric TODO handle shift?
if (65 <= keycode && keycode <= 90)
return event['shiftKey'] ? keycode : keycode + 32;
if (106 <= keycode && keycode <= 111)
return keycode - 106 + 42; // *,+-./ TODO handle shift?
switch (keycode) {
case 27: // escape
case 32: // space
case 61: // equal
return keycode;
}
var s = event['shiftKey'];
switch (keycode) {
case 186: return s ? 58 : 59; // colon / semi-colon
case 187: return s ? 43 : 61; // add / equal (these two may be wrong)
case 188: return s ? 60 : 44; // less-than / comma
case 189: return s ? 95 : 45; // dash
case 190: return s ? 62 : 46; // greater-than / period
case 191: return s ? 63 : 47; // forward slash
case 219: return s ? 123 : 91; // open bracket
case 220: return s ? 124 : 47; // back slash
case 221: return s ? 125 : 93; // close braket
case 222: return s ? 34 : 39; // single quote
}
return null;
},onKeydown:function (event) {
if (GLUT.specialFunc || GLUT.keyboardFunc) {
var key = GLUT.getSpecialKey(event['keyCode']);
if (key !== null) {
if( GLUT.specialFunc ) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('viii', GLUT.specialFunc, [key, Browser.mouseX, Browser.mouseY]);
}
}
else
{
key = GLUT.getASCIIKey(event);
if( key !== null && GLUT.keyboardFunc ) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('viii', GLUT.keyboardFunc, [key, Browser.mouseX, Browser.mouseY]);
}
}
}
},onKeyup:function (event) {
if (GLUT.specialUpFunc || GLUT.keyboardUpFunc) {
var key = GLUT.getSpecialKey(event['keyCode']);
if (key !== null) {
if(GLUT.specialUpFunc) {
event.preventDefault ();
GLUT.saveModifiers(event);
Runtime.dynCall('viii', GLUT.specialUpFunc, [key, Browser.mouseX, Browser.mouseY]);
}
}
else
{
key = GLUT.getASCIIKey(event);
if( key !== null && GLUT.keyboardUpFunc ) {
event.preventDefault ();
GLUT.saveModifiers(event);
Runtime.dynCall('viii', GLUT.keyboardUpFunc, [key, Browser.mouseX, Browser.mouseY]);
}
}
}
},onMouseButtonDown:function (event) {
Browser.calculateMouseEvent(event);
GLUT.buttons |= (1 << event['button']);
if (event.target == Module["canvas"] && GLUT.mouseFunc) {
try {
event.target.setCapture();
} catch (e) {}
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('viiii', GLUT.mouseFunc, [event['button'], 0/*GLUT_DOWN*/, Browser.mouseX, Browser.mouseY]);
}
},onMouseButtonUp:function (event) {
Browser.calculateMouseEvent(event);
GLUT.buttons &= ~(1 << event['button']);
if (GLUT.mouseFunc) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('viiii', GLUT.mouseFunc, [event['button'], 1/*GLUT_UP*/, Browser.mouseX, Browser.mouseY]);
}
},onMouseWheel:function (event) {
Browser.calculateMouseEvent(event);
// cross-browser wheel delta
var e = window.event || event; // old IE support
var delta = Math.max(-1, Math.min(1, (e.wheelDelta || -e.detail)));
var button = 3; // wheel up
if (delta < 0) {
button = 4; // wheel down
}
if (GLUT.mouseFunc) {
event.preventDefault();
GLUT.saveModifiers(event);
Runtime.dynCall('viiii', GLUT.mouseFunc, [button, 0/*GLUT_DOWN*/, Browser.mouseX, Browser.mouseY]);
}
},onFullScreenEventChange:function (event) {
var width;
var height;
if (document["fullScreen"] || document["mozFullScreen"] || document["webkitIsFullScreen"]) {
width = screen["width"];
height = screen["height"];
} else {
width = GLUT.windowWidth;
height = GLUT.windowHeight;
// TODO set position
document.removeEventListener('fullscreenchange', GLUT.onFullScreenEventChange, true);
document.removeEventListener('mozfullscreenchange', GLUT.onFullScreenEventChange, true);
document.removeEventListener('webkitfullscreenchange', GLUT.onFullScreenEventChange, true);
}
Browser.setCanvasSize(width, height);
/* Can't call _glutReshapeWindow as that requests cancelling fullscreen. */
if (GLUT.reshapeFunc) {
// console.log("GLUT.reshapeFunc (from FS): " + width + ", " + height);
Runtime.dynCall('vii', GLUT.reshapeFunc, [width, height]);
}
_glutPostRedisplay();
},requestFullScreen:function () {
var RFS = Module["canvas"]['requestFullscreen'] ||
Module["canvas"]['requestFullScreen'] ||
Module["canvas"]['mozRequestFullScreen'] ||
Module["canvas"]['webkitRequestFullScreen'] ||
(function() {});
RFS.apply(Module["canvas"], []);
},cancelFullScreen:function () {
var CFS = document['exitFullscreen'] ||
document['cancelFullScreen'] ||
document['mozCancelFullScreen'] ||
document['webkitCancelFullScreen'] ||
(function() {});
CFS.apply(document, []);
}};function _glutInitDisplayMode(mode) {
GLUT.initDisplayMode = mode;
}
var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
var ___errno_state=0;function ___setErrNo(value) {
// For convenient setting and returning of errno.
HEAP32[((___errno_state)>>2)]=value
return value;
}
var TTY={ttys:[],init:function () {
// https://github.com/kripken/emscripten/pull/1555
// if (ENVIRONMENT_IS_NODE) {
// // currently, FS.init does not distinguish if process.stdin is a file or TTY
// // device, it always assumes it's a TTY device. because of this, we're forcing
// // process.stdin to UTF8 encoding to at least make stdin reading compatible
// // with text files until FS.init can be refactored.
// process['stdin']['setEncoding']('utf8');
// }
},shutdown:function () {
// https://github.com/kripken/emscripten/pull/1555
// if (ENVIRONMENT_IS_NODE) {
// // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
// // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
// // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
// // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
// // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
// process['stdin']['pause']();
// }
},register:function (dev, ops) {
TTY.ttys[dev] = { input: [], output: [], ops: ops };
FS.registerDevice(dev, TTY.stream_ops);
},stream_ops:{open:function (stream) {
var tty = TTY.ttys[stream.node.rdev];
if (!tty) {
throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
}
stream.tty = tty;
stream.seekable = false;
},close:function (stream) {
// flush any pending line data
if (stream.tty.output.length) {
stream.tty.ops.put_char(stream.tty, 10);
}
},read:function (stream, buffer, offset, length, pos /* ignored */) {
if (!stream.tty || !stream.tty.ops.get_char) {
throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
}
var bytesRead = 0;
for (var i = 0; i < length; i++) {
var result;
try {
result = stream.tty.ops.get_char(stream.tty);
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
if (result === undefined && bytesRead === 0) {
throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
}
if (result === null || result === undefined) break;
bytesRead++;
buffer[offset+i] = result;
}
if (bytesRead) {
stream.node.timestamp = Date.now();
}
return bytesRead;
},write:function (stream, buffer, offset, length, pos) {
if (!stream.tty || !stream.tty.ops.put_char) {
throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
}
for (var i = 0; i < length; i++) {
try {
stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
}
if (length) {
stream.node.timestamp = Date.now();
}
return i;
}},default_tty_ops:{get_char:function (tty) {
if (!tty.input.length) {
var result = null;
if (ENVIRONMENT_IS_NODE) {
result = process['stdin']['read']();
if (!result) {
if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
return null; // EOF
}
return undefined; // no data available
}
} else if (typeof window != 'undefined' &&
typeof window.prompt == 'function') {
// Browser.
result = window.prompt('Input: '); // returns null on cancel
if (result !== null) {
result += '\n';
}
} else if (typeof readline == 'function') {
// Command line.
result = readline();
if (result !== null) {
result += '\n';
}
}
if (!result) {
return null;
}
tty.input = intArrayFromString(result, true);
}
return tty.input.shift();
},put_char:function (tty, val) {
if (val === null || val === 10) {
Module['print'](tty.output.join(''));
tty.output = [];
} else {
tty.output.push(TTY.utf8.processCChar(val));
}
}},default_tty1_ops:{put_char:function (tty, val) {
if (val === null || val === 10) {
Module['printErr'](tty.output.join(''));
tty.output = [];
} else {
tty.output.push(TTY.utf8.processCChar(val));
}
}}};
var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
return MEMFS.createNode(null, '/', 16384 | 0777, 0);
},createNode:function (parent, name, mode, dev) {
if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
// no supported
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
if (!MEMFS.ops_table) {
MEMFS.ops_table = {
dir: {
node: {
getattr: MEMFS.node_ops.getattr,
setattr: MEMFS.node_ops.setattr,
lookup: MEMFS.node_ops.lookup,
mknod: MEMFS.node_ops.mknod,
mknod: MEMFS.node_ops.mknod,
rename: MEMFS.node_ops.rename,
unlink: MEMFS.node_ops.unlink,
rmdir: MEMFS.node_ops.rmdir,
readdir: MEMFS.node_ops.readdir,
symlink: MEMFS.node_ops.symlink
},
stream: {
llseek: MEMFS.stream_ops.llseek
}
},
file: {
node: {
getattr: MEMFS.node_ops.getattr,
setattr: MEMFS.node_ops.setattr
},
stream: {
llseek: MEMFS.stream_ops.llseek,
read: MEMFS.stream_ops.read,
write: MEMFS.stream_ops.write,
allocate: MEMFS.stream_ops.allocate,
mmap: MEMFS.stream_ops.mmap
}
},
link: {
node: {
getattr: MEMFS.node_ops.getattr,
setattr: MEMFS.node_ops.setattr,
readlink: MEMFS.node_ops.readlink
},
stream: {}
},
chrdev: {
node: {
getattr: MEMFS.node_ops.getattr,
setattr: MEMFS.node_ops.setattr
},
stream: FS.chrdev_stream_ops
},
};
}
var node = FS.createNode(parent, name, mode, dev);
if (FS.isDir(node.mode)) {
node.node_ops = MEMFS.ops_table.dir.node;
node.stream_ops = MEMFS.ops_table.dir.stream;
node.contents = {};
} else if (FS.isFile(node.mode)) {
node.node_ops = MEMFS.ops_table.file.node;
node.stream_ops = MEMFS.ops_table.file.stream;
node.contents = [];
node.contentMode = MEMFS.CONTENT_FLEXIBLE;
} else if (FS.isLink(node.mode)) {
node.node_ops = MEMFS.ops_table.link.node;
node.stream_ops = MEMFS.ops_table.link.stream;
} else if (FS.isChrdev(node.mode)) {
node.node_ops = MEMFS.ops_table.chrdev.node;
node.stream_ops = MEMFS.ops_table.chrdev.stream;
}
node.timestamp = Date.now();
// add the new node to the parent
if (parent) {
parent.contents[name] = node;
}
return node;
},ensureFlexible:function (node) {
if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
var contents = node.contents;
node.contents = Array.prototype.slice.call(contents);
node.contentMode = MEMFS.CONTENT_FLEXIBLE;
}
},node_ops:{getattr:function (node) {
var attr = {};
// device numbers reuse inode numbers.
attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
attr.ino = node.id;
attr.mode = node.mode;
attr.nlink = 1;
attr.uid = 0;
attr.gid = 0;
attr.rdev = node.rdev;
if (FS.isDir(node.mode)) {
attr.size = 4096;
} else if (FS.isFile(node.mode)) {
attr.size = node.contents.length;
} else if (FS.isLink(node.mode)) {
attr.size = node.link.length;
} else {
attr.size = 0;
}
attr.atime = new Date(node.timestamp);
attr.mtime = new Date(node.timestamp);
attr.ctime = new Date(node.timestamp);
// NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
// but this is not required by the standard.
attr.blksize = 4096;
attr.blocks = Math.ceil(attr.size / attr.blksize);
return attr;
},setattr:function (node, attr) {
if (attr.mode !== undefined) {
node.mode = attr.mode;
}
if (attr.timestamp !== undefined) {
node.timestamp = attr.timestamp;
}
if (attr.size !== undefined) {
MEMFS.ensureFlexible(node);
var contents = node.contents;
if (attr.size < contents.length) contents.length = attr.size;
else while (attr.size > contents.length) contents.push(0);
}
},lookup:function (parent, name) {
throw FS.genericErrors[ERRNO_CODES.ENOENT];
},mknod:function (parent, name, mode, dev) {
return MEMFS.createNode(parent, name, mode, dev);
},rename:function (old_node, new_dir, new_name) {
// if we're overwriting a directory at new_name, make sure it's empty.
if (FS.isDir(old_node.mode)) {
var new_node;
try {
new_node = FS.lookupNode(new_dir, new_name);
} catch (e) {
}
if (new_node) {
for (var i in new_node.contents) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
}
}
}
// do the internal rewiring
delete old_node.parent.contents[old_node.name];
old_node.name = new_name;
new_dir.contents[new_name] = old_node;
old_node.parent = new_dir;
},unlink:function (parent, name) {
delete parent.contents[name];
},rmdir:function (parent, name) {
var node = FS.lookupNode(parent, name);
for (var i in node.contents) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
}
delete parent.contents[name];
},readdir:function (node) {
var entries = ['.', '..']
for (var key in node.contents) {
if (!node.contents.hasOwnProperty(key)) {
continue;
}
entries.push(key);
}
return entries;
},symlink:function (parent, newname, oldpath) {
var node = MEMFS.createNode(parent, newname, 0777 | 40960, 0);
node.link = oldpath;
return node;
},readlink:function (node) {
if (!FS.isLink(node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
return node.link;
}},stream_ops:{read:function (stream, buffer, offset, length, position) {
var contents = stream.node.contents;
if (position >= contents.length)
return 0;
var size = Math.min(contents.length - position, length);
assert(size >= 0);
if (size > 8 && contents.subarray) { // non-trivial, and typed array
buffer.set(contents.subarray(position, position + size), offset);
} else
{
for (var i = 0; i < size; i++) {
buffer[offset + i] = contents[position + i];
}
}
return size;
},write:function (stream, buffer, offset, length, position, canOwn) {
var node = stream.node;
node.timestamp = Date.now();
var contents = node.contents;
if (length && contents.length === 0 && position === 0 && buffer.subarray) {
// just replace it with the new data
assert(buffer.length);
if (canOwn && offset === 0) {
node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
} else {
node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
node.contentMode = MEMFS.CONTENT_FIXED;
}
return length;
}
MEMFS.ensureFlexible(node);
var contents = node.contents;
while (contents.length < position) contents.push(0);
for (var i = 0; i < length; i++) {
contents[position + i] = buffer[offset + i];
}
return length;
},llseek:function (stream, offset, whence) {
var position = offset;
if (whence === 1) { // SEEK_CUR.
position += stream.position;
} else if (whence === 2) { // SEEK_END.
if (FS.isFile(stream.node.mode)) {
position += stream.node.contents.length;
}
}
if (position < 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
stream.ungotten = [];
stream.position = position;
return position;
},allocate:function (stream, offset, length) {
MEMFS.ensureFlexible(stream.node);
var contents = stream.node.contents;
var limit = offset + length;
while (limit > contents.length) contents.push(0);
},mmap:function (stream, buffer, offset, length, position, prot, flags) {
if (!FS.isFile(stream.node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
}
var ptr;
var allocated;
var contents = stream.node.contents;
// Only make a new copy when MAP_PRIVATE is specified.
if ( !(flags & 2) &&
(contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
// We can't emulate MAP_SHARED when the file is not backed by the buffer
// we're mapping to (e.g. the HEAP buffer).
allocated = false;
ptr = contents.byteOffset;
} else {
// Try to avoid unnecessary slices.
if (position > 0 || position + length < contents.length) {
if (contents.subarray) {
contents = contents.subarray(position, position + length);
} else {
contents = Array.prototype.slice.call(contents, position, position + length);
}
}
allocated = true;
ptr = _malloc(length);
if (!ptr) {
throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
}
buffer.set(contents, ptr);
}
return { ptr: ptr, allocated: allocated };
}}};
var IDBFS={dbs:{},indexedDB:function () {
return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
},DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
return MEMFS.mount.apply(null, arguments);
},syncfs:function (mount, populate, callback) {
IDBFS.getLocalSet(mount, function(err, local) {
if (err) return callback(err);
IDBFS.getRemoteSet(mount, function(err, remote) {
if (err) return callback(err);
var src = populate ? remote : local;
var dst = populate ? local : remote;
IDBFS.reconcile(src, dst, callback);
});
});
},reconcile:function (src, dst, callback) {
var total = 0;
var create = {};
for (var key in src.files) {
if (!src.files.hasOwnProperty(key)) continue;
var e = src.files[key];
var e2 = dst.files[key];
if (!e2 || e.timestamp > e2.timestamp) {
create[key] = e;
total++;
}
}
var remove = {};
for (var key in dst.files) {
if (!dst.files.hasOwnProperty(key)) continue;
var e = dst.files[key];
var e2 = src.files[key];
if (!e2) {
remove[key] = e;
total++;
}
}
if (!total) {
// early out
return callback(null);
}
var completed = 0;
function done(err) {
if (err) return callback(err);
if (++completed >= total) {
return callback(null);
}
};
// create a single transaction to handle and IDB reads / writes we'll need to do
var db = src.type === 'remote' ? src.db : dst.db;
var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
transaction.onerror = function transaction_onerror() { callback(this.error); };
var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
for (var path in create) {
if (!create.hasOwnProperty(path)) continue;
var entry = create[path];
if (dst.type === 'local') {
// save file to local
try {
if (FS.isDir(entry.mode)) {
FS.mkdir(path, entry.mode);
} else if (FS.isFile(entry.mode)) {
var stream = FS.open(path, 'w+', 0666);
FS.write(stream, entry.contents, 0, entry.contents.length, 0, true /* canOwn */);
FS.close(stream);
}
done(null);
} catch (e) {
return done(e);
}
} else {
// save file to IDB
var req = store.put(entry, path);
req.onsuccess = function req_onsuccess() { done(null); };
req.onerror = function req_onerror() { done(this.error); };
}
}
for (var path in remove) {
if (!remove.hasOwnProperty(path)) continue;
var entry = remove[path];
if (dst.type === 'local') {
// delete file from local
try {
if (FS.isDir(entry.mode)) {
// TODO recursive delete?
FS.rmdir(path);
} else if (FS.isFile(entry.mode)) {
FS.unlink(path);
}
done(null);
} catch (e) {
return done(e);
}
} else {
// delete file from IDB
var req = store.delete(path);
req.onsuccess = function req_onsuccess() { done(null); };
req.onerror = function req_onerror() { done(this.error); };
}
}
},getLocalSet:function (mount, callback) {
var files = {};
function isRealDir(p) {
return p !== '.' && p !== '..';
};
function toAbsolute(root) {
return function(p) {
return PATH.join2(root, p);
}
};
var check = FS.readdir(mount.mountpoint)
.filter(isRealDir)
.map(toAbsolute(mount.mountpoint));
while (check.length) {
var path = check.pop();
var stat, node;
try {
var lookup = FS.lookupPath(path);
node = lookup.node;
stat = FS.stat(path);
} catch (e) {
return callback(e);
}
if (FS.isDir(stat.mode)) {
check.push.apply(check, FS.readdir(path)
.filter(isRealDir)
.map(toAbsolute(path)));
files[path] = { mode: stat.mode, timestamp: stat.mtime };
} else if (FS.isFile(stat.mode)) {
files[path] = { contents: node.contents, mode: stat.mode, timestamp: stat.mtime };
} else {
return callback(new Error('node type not supported'));
}
}
return callback(null, { type: 'local', files: files });
},getDB:function (name, callback) {
// look it up in the cache
var db = IDBFS.dbs[name];
if (db) {
return callback(null, db);
}
var req;
try {
req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
} catch (e) {
return onerror(e);
}
req.onupgradeneeded = function req_onupgradeneeded() {
db = req.result;
db.createObjectStore(IDBFS.DB_STORE_NAME);
};
req.onsuccess = function req_onsuccess() {
db = req.result;
// add to the cache
IDBFS.dbs[name] = db;
callback(null, db);
};
req.onerror = function req_onerror() {
callback(this.error);
};
},getRemoteSet:function (mount, callback) {
var files = {};
IDBFS.getDB(mount.mountpoint, function(err, db) {
if (err) return callback(err);
var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
transaction.onerror = function transaction_onerror() { callback(this.error); };
var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
store.openCursor().onsuccess = function store_openCursor_onsuccess(event) {
var cursor = event.target.result;
if (!cursor) {
return callback(null, { type: 'remote', db: db, files: files });
}
files[cursor.key] = cursor.value;
cursor.continue();
};
});
}};
var NODEFS={isWindows:false,staticInit:function () {
NODEFS.isWindows = !!process.platform.match(/^win/);
},mount:function (mount) {
assert(ENVIRONMENT_IS_NODE);
return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
},createNode:function (parent, name, mode, dev) {
if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var node = FS.createNode(parent, name, mode);
node.node_ops = NODEFS.node_ops;
node.stream_ops = NODEFS.stream_ops;
return node;
},getMode:function (path) {
var stat;
try {
stat = fs.lstatSync(path);
if (NODEFS.isWindows) {
// On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
// propagate write bits to execute bits.
stat.mode = stat.mode | ((stat.mode & 146) >> 1);
}
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
return stat.mode;
},realPath:function (node) {
var parts = [];
while (node.parent !== node) {
parts.push(node.name);
node = node.parent;
}
parts.push(node.mount.opts.root);
parts.reverse();
return PATH.join.apply(null, parts);
},flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
if (flags in NODEFS.flagsToPermissionStringMap) {
return NODEFS.flagsToPermissionStringMap[flags];
} else {
return flags;
}
},node_ops:{getattr:function (node) {
var path = NODEFS.realPath(node);
var stat;
try {
stat = fs.lstatSync(path);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
// node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
// See http://support.microsoft.com/kb/140365
if (NODEFS.isWindows && !stat.blksize) {
stat.blksize = 4096;
}
if (NODEFS.isWindows && !stat.blocks) {
stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
}
return {
dev: stat.dev,
ino: stat.ino,
mode: stat.mode,
nlink: stat.nlink,
uid: stat.uid,
gid: stat.gid,
rdev: stat.rdev,
size: stat.size,
atime: stat.atime,
mtime: stat.mtime,
ctime: stat.ctime,
blksize: stat.blksize,
blocks: stat.blocks
};
},setattr:function (node, attr) {
var path = NODEFS.realPath(node);
try {
if (attr.mode !== undefined) {
fs.chmodSync(path, attr.mode);
// update the common node structure mode as well
node.mode = attr.mode;
}
if (attr.timestamp !== undefined) {
var date = new Date(attr.timestamp);
fs.utimesSync(path, date, date);
}
if (attr.size !== undefined) {
fs.truncateSync(path, attr.size);
}
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},lookup:function (parent, name) {
var path = PATH.join2(NODEFS.realPath(parent), name);
var mode = NODEFS.getMode(path);
return NODEFS.createNode(parent, name, mode);
},mknod:function (parent, name, mode, dev) {
var node = NODEFS.createNode(parent, name, mode, dev);
// create the backing node for this in the fs root as well
var path = NODEFS.realPath(node);
try {
if (FS.isDir(node.mode)) {
fs.mkdirSync(path, node.mode);
} else {
fs.writeFileSync(path, '', { mode: node.mode });
}
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
return node;
},rename:function (oldNode, newDir, newName) {
var oldPath = NODEFS.realPath(oldNode);
var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
try {
fs.renameSync(oldPath, newPath);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},unlink:function (parent, name) {
var path = PATH.join2(NODEFS.realPath(parent), name);
try {
fs.unlinkSync(path);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},rmdir:function (parent, name) {
var path = PATH.join2(NODEFS.realPath(parent), name);
try {
fs.rmdirSync(path);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},readdir:function (node) {
var path = NODEFS.realPath(node);
try {
return fs.readdirSync(path);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},symlink:function (parent, newName, oldPath) {
var newPath = PATH.join2(NODEFS.realPath(parent), newName);
try {
fs.symlinkSync(oldPath, newPath);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},readlink:function (node) {
var path = NODEFS.realPath(node);
try {
return fs.readlinkSync(path);
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
}},stream_ops:{open:function (stream) {
var path = NODEFS.realPath(stream.node);
try {
if (FS.isFile(stream.node.mode)) {
stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
}
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},close:function (stream) {
try {
if (FS.isFile(stream.node.mode) && stream.nfd) {
fs.closeSync(stream.nfd);
}
} catch (e) {
if (!e.code) throw e;
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
},read:function (stream, buffer, offset, length, position) {
// FIXME this is terrible.
var nbuffer = new Buffer(length);
var res;
try {
res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
if (res > 0) {
for (var i = 0; i < res; i++) {
buffer[offset + i] = nbuffer[i];
}
}
return res;
},write:function (stream, buffer, offset, length, position) {
// FIXME this is terrible.
var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
var res;
try {
res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
return res;
},llseek:function (stream, offset, whence) {
var position = offset;
if (whence === 1) { // SEEK_CUR.
position += stream.position;
} else if (whence === 2) { // SEEK_END.
if (FS.isFile(stream.node.mode)) {
try {
var stat = fs.fstatSync(stream.nfd);
position += stat.size;
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES[e.code]);
}
}
}
if (position < 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
stream.position = position;
return position;
}}};
var _stdin=allocate(1, "i32*", ALLOC_STATIC);
var _stdout=allocate(1, "i32*", ALLOC_STATIC);
var _stderr=allocate(1, "i32*", ALLOC_STATIC);
function _fflush(stream) {
// int fflush(FILE *stream);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
// we don't currently perform any user-space buffering of data
}var FS={root:null,mounts:[],devices:[null],streams:[null],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
return ___setErrNo(e.errno);
},lookupPath:function (path, opts) {
path = PATH.resolve(FS.cwd(), path);
opts = opts || { recurse_count: 0 };
if (opts.recurse_count > 8) { // max recursive lookup of 8
throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
}
// split the path
var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
return !!p;
}), false);
// start at the root
var current = FS.root;
var current_path = '/';
for (var i = 0; i < parts.length; i++) {
var islast = (i === parts.length-1);
if (islast && opts.parent) {
// stop resolving
break;
}
current = FS.lookupNode(current, parts[i]);
current_path = PATH.join2(current_path, parts[i]);
// jump to the mount's root node if this is a mountpoint
if (FS.isMountpoint(current)) {
current = current.mount.root;
}
// follow symlinks
// by default, lookupPath will not follow a symlink if it is the final path component.
// setting opts.follow = true will override this behavior.
if (!islast || opts.follow) {
var count = 0;
while (FS.isLink(current.mode)) {
var link = FS.readlink(current_path);
current_path = PATH.resolve(PATH.dirname(current_path), link);
var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
current = lookup.node;
if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
}
}
}
}
return { path: current_path, node: current };
},getPath:function (node) {
var path;
while (true) {
if (FS.isRoot(node)) {
var mount = node.mount.mountpoint;
if (!path) return mount;
return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
}
path = path ? node.name + '/' + path : node.name;
node = node.parent;
}
},hashName:function (parentid, name) {
var hash = 0;
for (var i = 0; i < name.length; i++) {
hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
}
return ((parentid + hash) >>> 0) % FS.nameTable.length;
},hashAddNode:function (node) {
var hash = FS.hashName(node.parent.id, node.name);
node.name_next = FS.nameTable[hash];
FS.nameTable[hash] = node;
},hashRemoveNode:function (node) {
var hash = FS.hashName(node.parent.id, node.name);
if (FS.nameTable[hash] === node) {
FS.nameTable[hash] = node.name_next;
} else {
var current = FS.nameTable[hash];
while (current) {
if (current.name_next === node) {
current.name_next = node.name_next;
break;
}
current = current.name_next;
}
}
},lookupNode:function (parent, name) {
var err = FS.mayLookup(parent);
if (err) {
throw new FS.ErrnoError(err);
}
var hash = FS.hashName(parent.id, name);
for (var node = FS.nameTable[hash]; node; node = node.name_next) {
var nodeName = node.name;
if (node.parent.id === parent.id && nodeName === name) {
return node;
}
}
// if we failed to find it in the cache, call into the VFS
return FS.lookup(parent, name);
},createNode:function (parent, name, mode, rdev) {
if (!FS.FSNode) {
FS.FSNode = function(parent, name, mode, rdev) {
this.id = FS.nextInode++;
this.name = name;
this.mode = mode;
this.node_ops = {};
this.stream_ops = {};
this.rdev = rdev;
this.parent = null;
this.mount = null;
if (!parent) {
parent = this; // root node sets parent to itself
}
this.parent = parent;
this.mount = parent.mount;
FS.hashAddNode(this);
};
// compatibility
var readMode = 292 | 73;
var writeMode = 146;
FS.FSNode.prototype = {};
// NOTE we must use Object.defineProperties instead of individual calls to
// Object.defineProperty in order to make closure compiler happy
Object.defineProperties(FS.FSNode.prototype, {
read: {
get: function() { return (this.mode & readMode) === readMode; },
set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
},
write: {
get: function() { return (this.mode & writeMode) === writeMode; },
set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
},
isFolder: {
get: function() { return FS.isDir(this.mode); },
},
isDevice: {
get: function() { return FS.isChrdev(this.mode); },
},
});
}
return new FS.FSNode(parent, name, mode, rdev);
},destroyNode:function (node) {
FS.hashRemoveNode(node);
},isRoot:function (node) {
return node === node.parent;
},isMountpoint:function (node) {
return node.mounted;
},isFile:function (mode) {
return (mode & 61440) === 32768;
},isDir:function (mode) {
return (mode & 61440) === 16384;
},isLink:function (mode) {
return (mode & 61440) === 40960;
},isChrdev:function (mode) {
return (mode & 61440) === 8192;
},isBlkdev:function (mode) {
return (mode & 61440) === 24576;
},isFIFO:function (mode) {
return (mode & 61440) === 4096;
},isSocket:function (mode) {
return (mode & 49152) === 49152;
},flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
var flags = FS.flagModes[str];
if (typeof flags === 'undefined') {
throw new Error('Unknown file open mode: ' + str);
}
return flags;
},flagsToPermissionString:function (flag) {
var accmode = flag & 2097155;
var perms = ['r', 'w', 'rw'][accmode];
if ((flag & 512)) {
perms += 'w';
}
return perms;
},nodePermissions:function (node, perms) {
if (FS.ignorePermissions) {
return 0;
}
// return 0 if any user, group or owner bits are set.
if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
return ERRNO_CODES.EACCES;
} else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
return ERRNO_CODES.EACCES;
} else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
return ERRNO_CODES.EACCES;
}
return 0;
},mayLookup:function (dir) {
return FS.nodePermissions(dir, 'x');
},mayCreate:function (dir, name) {
try {
var node = FS.lookupNode(dir, name);
return ERRNO_CODES.EEXIST;
} catch (e) {
}
return FS.nodePermissions(dir, 'wx');
},mayDelete:function (dir, name, isdir) {
var node;
try {
node = FS.lookupNode(dir, name);
} catch (e) {
return e.errno;
}
var err = FS.nodePermissions(dir, 'wx');
if (err) {
return err;
}
if (isdir) {
if (!FS.isDir(node.mode)) {
return ERRNO_CODES.ENOTDIR;
}
if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
return ERRNO_CODES.EBUSY;
}
} else {
if (FS.isDir(node.mode)) {
return ERRNO_CODES.EISDIR;
}
}
return 0;
},mayOpen:function (node, flags) {
if (!node) {
return ERRNO_CODES.ENOENT;
}
if (FS.isLink(node.mode)) {
return ERRNO_CODES.ELOOP;
} else if (FS.isDir(node.mode)) {
if ((flags & 2097155) !== 0 || // opening for write
(flags & 512)) {
return ERRNO_CODES.EISDIR;
}
}
return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
},MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
fd_start = fd_start || 1;
fd_end = fd_end || FS.MAX_OPEN_FDS;
for (var fd = fd_start; fd <= fd_end; fd++) {
if (!FS.streams[fd]) {
return fd;
}
}
throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
},getStream:function (fd) {
return FS.streams[fd];
},createStream:function (stream, fd_start, fd_end) {
if (!FS.FSStream) {
FS.FSStream = function(){};
FS.FSStream.prototype = {};
// compatibility
Object.defineProperties(FS.FSStream.prototype, {
object: {
get: function() { return this.node; },
set: function(val) { this.node = val; }
},
isRead: {
get: function() { return (this.flags & 2097155) !== 1; }
},
isWrite: {
get: function() { return (this.flags & 2097155) !== 0; }
},
isAppend: {
get: function() { return (this.flags & 1024); }
}
});
}
if (stream.__proto__) {
// reuse the object
stream.__proto__ = FS.FSStream.prototype;
} else {
var newStream = new FS.FSStream();
for (var p in stream) {
newStream[p] = stream[p];
}
stream = newStream;
}
var fd = FS.nextfd(fd_start, fd_end);
stream.fd = fd;
FS.streams[fd] = stream;
return stream;
},closeStream:function (fd) {
FS.streams[fd] = null;
},chrdev_stream_ops:{open:function (stream) {
var device = FS.getDevice(stream.node.rdev);
// override node's stream ops with the device's
stream.stream_ops = device.stream_ops;
// forward the open call
if (stream.stream_ops.open) {
stream.stream_ops.open(stream);
}
},llseek:function () {
throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
}},major:function (dev) {
return ((dev) >> 8);
},minor:function (dev) {
return ((dev) & 0xff);
},makedev:function (ma, mi) {
return ((ma) << 8 | (mi));
},registerDevice:function (dev, ops) {
FS.devices[dev] = { stream_ops: ops };
},getDevice:function (dev) {
return FS.devices[dev];
},syncfs:function (populate, callback) {
if (typeof(populate) === 'function') {
callback = populate;
populate = false;
}
var completed = 0;
var total = FS.mounts.length;
function done(err) {
if (err) {
return callback(err);
}
if (++completed >= total) {
callback(null);
}
};
// sync all mounts
for (var i = 0; i < FS.mounts.length; i++) {
var mount = FS.mounts[i];
if (!mount.type.syncfs) {
done(null);
continue;
}
mount.type.syncfs(mount, populate, done);
}
},mount:function (type, opts, mountpoint) {
var lookup;
if (mountpoint) {
lookup = FS.lookupPath(mountpoint, { follow: false });
mountpoint = lookup.path; // use the absolute path
}
var mount = {
type: type,
opts: opts,
mountpoint: mountpoint,
root: null
};
// create a root node for the fs
var root = type.mount(mount);
root.mount = mount;
mount.root = root;
// assign the mount info to the mountpoint's node
if (lookup) {
lookup.node.mount = mount;
lookup.node.mounted = true;
// compatibility update FS.root if we mount to /
if (mountpoint === '/') {
FS.root = mount.root;
}
}
// add to our cached list of mounts
FS.mounts.push(mount);
return root;
},lookup:function (parent, name) {
return parent.node_ops.lookup(parent, name);
},mknod:function (path, mode, dev) {
var lookup = FS.lookupPath(path, { parent: true });
var parent = lookup.node;
var name = PATH.basename(path);
var err = FS.mayCreate(parent, name);
if (err) {
throw new FS.ErrnoError(err);
}
if (!parent.node_ops.mknod) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
return parent.node_ops.mknod(parent, name, mode, dev);
},create:function (path, mode) {
mode = mode !== undefined ? mode : 0666;
mode &= 4095;
mode |= 32768;
return FS.mknod(path, mode, 0);
},mkdir:function (path, mode) {
mode = mode !== undefined ? mode : 0777;
mode &= 511 | 512;
mode |= 16384;
return FS.mknod(path, mode, 0);
},mkdev:function (path, mode, dev) {
if (typeof(dev) === 'undefined') {
dev = mode;
mode = 0666;
}
mode |= 8192;
return FS.mknod(path, mode, dev);
},symlink:function (oldpath, newpath) {
var lookup = FS.lookupPath(newpath, { parent: true });
var parent = lookup.node;
var newname = PATH.basename(newpath);
var err = FS.mayCreate(parent, newname);
if (err) {
throw new FS.ErrnoError(err);
}
if (!parent.node_ops.symlink) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
return parent.node_ops.symlink(parent, newname, oldpath);
},rename:function (old_path, new_path) {
var old_dirname = PATH.dirname(old_path);
var new_dirname = PATH.dirname(new_path);
var old_name = PATH.basename(old_path);
var new_name = PATH.basename(new_path);
// parents must exist
var lookup, old_dir, new_dir;
try {
lookup = FS.lookupPath(old_path, { parent: true });
old_dir = lookup.node;
lookup = FS.lookupPath(new_path, { parent: true });
new_dir = lookup.node;
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
}
// need to be part of the same mount
if (old_dir.mount !== new_dir.mount) {
throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
}
// source must exist
var old_node = FS.lookupNode(old_dir, old_name);
// old path should not be an ancestor of the new path
var relative = PATH.relative(old_path, new_dirname);
if (relative.charAt(0) !== '.') {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
// new path should not be an ancestor of the old path
relative = PATH.relative(new_path, old_dirname);
if (relative.charAt(0) !== '.') {
throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
}
// see if the new path already exists
var new_node;
try {
new_node = FS.lookupNode(new_dir, new_name);
} catch (e) {
// not fatal
}
// early out if nothing needs to change
if (old_node === new_node) {
return;
}
// we'll need to delete the old entry
var isdir = FS.isDir(old_node.mode);
var err = FS.mayDelete(old_dir, old_name, isdir);
if (err) {
throw new FS.ErrnoError(err);
}
// need delete permissions if we'll be overwriting.
// need create permissions if new doesn't already exist.
err = new_node ?
FS.mayDelete(new_dir, new_name, isdir) :
FS.mayCreate(new_dir, new_name);
if (err) {
throw new FS.ErrnoError(err);
}
if (!old_dir.node_ops.rename) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
}
// if we are going to change the parent, check write permissions
if (new_dir !== old_dir) {
err = FS.nodePermissions(old_dir, 'w');
if (err) {
throw new FS.ErrnoError(err);
}
}
// remove the node from the lookup hash
FS.hashRemoveNode(old_node);
// do the underlying fs rename
try {
old_dir.node_ops.rename(old_node, new_dir, new_name);
} catch (e) {
throw e;
} finally {
// add the node back to the hash (in case node_ops.rename
// changed its name)
FS.hashAddNode(old_node);
}
},rmdir:function (path) {
var lookup = FS.lookupPath(path, { parent: true });
var parent = lookup.node;
var name = PATH.basename(path);
var node = FS.lookupNode(parent, name);
var err = FS.mayDelete(parent, name, true);
if (err) {
throw new FS.ErrnoError(err);
}
if (!parent.node_ops.rmdir) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
if (FS.isMountpoint(node)) {
throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
}
parent.node_ops.rmdir(parent, name);
FS.destroyNode(node);
},readdir:function (path) {
var lookup = FS.lookupPath(path, { follow: true });
var node = lookup.node;
if (!node.node_ops.readdir) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
}
return node.node_ops.readdir(node);
},unlink:function (path) {
var lookup = FS.lookupPath(path, { parent: true });
var parent = lookup.node;
var name = PATH.basename(path);
var node = FS.lookupNode(parent, name);
var err = FS.mayDelete(parent, name, false);
if (err) {
// POSIX says unlink should set EPERM, not EISDIR
if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
throw new FS.ErrnoError(err);
}
if (!parent.node_ops.unlink) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
if (FS.isMountpoint(node)) {
throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
}
parent.node_ops.unlink(parent, name);
FS.destroyNode(node);
},readlink:function (path) {
var lookup = FS.lookupPath(path, { follow: false });
var link = lookup.node;
if (!link.node_ops.readlink) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
return link.node_ops.readlink(link);
},stat:function (path, dontFollow) {
var lookup = FS.lookupPath(path, { follow: !dontFollow });
var node = lookup.node;
if (!node.node_ops.getattr) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
return node.node_ops.getattr(node);
},lstat:function (path) {
return FS.stat(path, true);
},chmod:function (path, mode, dontFollow) {
var node;
if (typeof path === 'string') {
var lookup = FS.lookupPath(path, { follow: !dontFollow });
node = lookup.node;
} else {
node = path;
}
if (!node.node_ops.setattr) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
node.node_ops.setattr(node, {
mode: (mode & 4095) | (node.mode & ~4095),
timestamp: Date.now()
});
},lchmod:function (path, mode) {
FS.chmod(path, mode, true);
},fchmod:function (fd, mode) {
var stream = FS.getStream(fd);
if (!stream) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
FS.chmod(stream.node, mode);
},chown:function (path, uid, gid, dontFollow) {
var node;
if (typeof path === 'string') {
var lookup = FS.lookupPath(path, { follow: !dontFollow });
node = lookup.node;
} else {
node = path;
}
if (!node.node_ops.setattr) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
node.node_ops.setattr(node, {
timestamp: Date.now()
// we ignore the uid / gid for now
});
},lchown:function (path, uid, gid) {
FS.chown(path, uid, gid, true);
},fchown:function (fd, uid, gid) {
var stream = FS.getStream(fd);
if (!stream) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
FS.chown(stream.node, uid, gid);
},truncate:function (path, len) {
if (len < 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var node;
if (typeof path === 'string') {
var lookup = FS.lookupPath(path, { follow: true });
node = lookup.node;
} else {
node = path;
}
if (!node.node_ops.setattr) {
throw new FS.ErrnoError(ERRNO_CODES.EPERM);
}
if (FS.isDir(node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
}
if (!FS.isFile(node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var err = FS.nodePermissions(node, 'w');
if (err) {
throw new FS.ErrnoError(err);
}
node.node_ops.setattr(node, {
size: len,
timestamp: Date.now()
});
},ftruncate:function (fd, len) {
var stream = FS.getStream(fd);
if (!stream) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
if ((stream.flags & 2097155) === 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
FS.truncate(stream.node, len);
},utime:function (path, atime, mtime) {
var lookup = FS.lookupPath(path, { follow: true });
var node = lookup.node;
node.node_ops.setattr(node, {
timestamp: Math.max(atime, mtime)
});
},open:function (path, flags, mode, fd_start, fd_end) {
flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
mode = typeof mode === 'undefined' ? 0666 : mode;
if ((flags & 64)) {
mode = (mode & 4095) | 32768;
} else {
mode = 0;
}
var node;
if (typeof path === 'object') {
node = path;
} else {
path = PATH.normalize(path);
try {
var lookup = FS.lookupPath(path, {
follow: !(flags & 131072)
});
node = lookup.node;
} catch (e) {
// ignore
}
}
// perhaps we need to create the node
if ((flags & 64)) {
if (node) {
// if O_CREAT and O_EXCL are set, error out if the node already exists
if ((flags & 128)) {
throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
}
} else {
// node doesn't exist, try to create it
node = FS.mknod(path, mode, 0);
}
}
if (!node) {
throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
}
// can't truncate a device
if (FS.isChrdev(node.mode)) {
flags &= ~512;
}
// check permissions
var err = FS.mayOpen(node, flags);
if (err) {
throw new FS.ErrnoError(err);
}
// do truncation if necessary
if ((flags & 512)) {
FS.truncate(node, 0);
}
// we've already handled these, don't pass down to the underlying vfs
flags &= ~(128 | 512);
// register the stream with the filesystem
var stream = FS.createStream({
node: node,
path: FS.getPath(node), // we want the absolute path to the node
flags: flags,
seekable: true,
position: 0,
stream_ops: node.stream_ops,
// used by the file family libc calls (fopen, fwrite, ferror, etc.)
ungotten: [],
error: false
}, fd_start, fd_end);
// call the new stream's open function
if (stream.stream_ops.open) {
stream.stream_ops.open(stream);
}
if (Module['logReadFiles'] && !(flags & 1)) {
if (!FS.readFiles) FS.readFiles = {};
if (!(path in FS.readFiles)) {
FS.readFiles[path] = 1;
Module['printErr']('read file: ' + path);
}
}
return stream;
},close:function (stream) {
try {
if (stream.stream_ops.close) {
stream.stream_ops.close(stream);
}
} catch (e) {
throw e;
} finally {
FS.closeStream(stream.fd);
}
},llseek:function (stream, offset, whence) {
if (!stream.seekable || !stream.stream_ops.llseek) {
throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
}
return stream.stream_ops.llseek(stream, offset, whence);
},read:function (stream, buffer, offset, length, position) {
if (length < 0 || position < 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
if ((stream.flags & 2097155) === 1) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
if (FS.isDir(stream.node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
}
if (!stream.stream_ops.read) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var seeking = true;
if (typeof position === 'undefined') {
position = stream.position;
seeking = false;
} else if (!stream.seekable) {
throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
}
var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
if (!seeking) stream.position += bytesRead;
return bytesRead;
},write:function (stream, buffer, offset, length, position, canOwn) {
if (length < 0 || position < 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
if ((stream.flags & 2097155) === 0) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
if (FS.isDir(stream.node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
}
if (!stream.stream_ops.write) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var seeking = true;
if (typeof position === 'undefined') {
position = stream.position;
seeking = false;
} else if (!stream.seekable) {
throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
}
if (stream.flags & 1024) {
// seek to the end before writing in append mode
FS.llseek(stream, 0, 2);
}
var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
if (!seeking) stream.position += bytesWritten;
return bytesWritten;
},allocate:function (stream, offset, length) {
if (offset < 0 || length <= 0) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
if ((stream.flags & 2097155) === 0) {
throw new FS.ErrnoError(ERRNO_CODES.EBADF);
}
if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
}
if (!stream.stream_ops.allocate) {
throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
}
stream.stream_ops.allocate(stream, offset, length);
},mmap:function (stream, buffer, offset, length, position, prot, flags) {
// TODO if PROT is PROT_WRITE, make sure we have write access
if ((stream.flags & 2097155) === 1) {
throw new FS.ErrnoError(ERRNO_CODES.EACCES);
}
if (!stream.stream_ops.mmap) {
throw new FS.errnoError(ERRNO_CODES.ENODEV);
}
return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
},ioctl:function (stream, cmd, arg) {
if (!stream.stream_ops.ioctl) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
}
return stream.stream_ops.ioctl(stream, cmd, arg);
},readFile:function (path, opts) {
opts = opts || {};
opts.flags = opts.flags || 'r';
opts.encoding = opts.encoding || 'binary';
var ret;
var stream = FS.open(path, opts.flags);
var stat = FS.stat(path);
var length = stat.size;
var buf = new Uint8Array(length);
FS.read(stream, buf, 0, length, 0);
if (opts.encoding === 'utf8') {
ret = '';
var utf8 = new Runtime.UTF8Processor();
for (var i = 0; i < length; i++) {
ret += utf8.processCChar(buf[i]);
}
} else if (opts.encoding === 'binary') {
ret = buf;
} else {
throw new Error('Invalid encoding type "' + opts.encoding + '"');
}
FS.close(stream);
return ret;
},writeFile:function (path, data, opts) {
opts = opts || {};
opts.flags = opts.flags || 'w';
opts.encoding = opts.encoding || 'utf8';
var stream = FS.open(path, opts.flags, opts.mode);
if (opts.encoding === 'utf8') {
var utf8 = new Runtime.UTF8Processor();
var buf = new Uint8Array(utf8.processJSString(data));
FS.write(stream, buf, 0, buf.length, 0);
} else if (opts.encoding === 'binary') {
FS.write(stream, data, 0, data.length, 0);
} else {
throw new Error('Invalid encoding type "' + opts.encoding + '"');
}
FS.close(stream);
},cwd:function () {
return FS.currentPath;
},chdir:function (path) {
var lookup = FS.lookupPath(path, { follow: true });
if (!FS.isDir(lookup.node.mode)) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
}
var err = FS.nodePermissions(lookup.node, 'x');
if (err) {
throw new FS.ErrnoError(err);
}
FS.currentPath = lookup.path;
},createDefaultDirectories:function () {
FS.mkdir('/tmp');
},createDefaultDevices:function () {
// create /dev
FS.mkdir('/dev');
// setup /dev/null
FS.registerDevice(FS.makedev(1, 3), {
read: function() { return 0; },
write: function() { return 0; }
});
FS.mkdev('/dev/null', FS.makedev(1, 3));
// setup /dev/tty and /dev/tty1
// stderr needs to print output using Module['printErr']
// so we register a second tty just for it.
TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
FS.mkdev('/dev/tty', FS.makedev(5, 0));
FS.mkdev('/dev/tty1', FS.makedev(6, 0));
// we're not going to emulate the actual shm device,
// just create the tmp dirs that reside in it commonly
FS.mkdir('/dev/shm');
FS.mkdir('/dev/shm/tmp');
},createStandardStreams:function () {
// TODO deprecate the old functionality of a single
// input / output callback and that utilizes FS.createDevice
// and instead require a unique set of stream ops
// by default, we symlink the standard streams to the
// default tty devices. however, if the standard streams
// have been overwritten we create a unique device for
// them instead.
if (Module['stdin']) {
FS.createDevice('/dev', 'stdin', Module['stdin']);
} else {
FS.symlink('/dev/tty', '/dev/stdin');
}
if (Module['stdout']) {
FS.createDevice('/dev', 'stdout', null, Module['stdout']);
} else {
FS.symlink('/dev/tty', '/dev/stdout');
}
if (Module['stderr']) {
FS.createDevice('/dev', 'stderr', null, Module['stderr']);
} else {
FS.symlink('/dev/tty1', '/dev/stderr');
}
// open default streams for the stdin, stdout and stderr devices
var stdin = FS.open('/dev/stdin', 'r');
HEAP32[((_stdin)>>2)]=stdin.fd;
assert(stdin.fd === 1, 'invalid handle for stdin (' + stdin.fd + ')');
var stdout = FS.open('/dev/stdout', 'w');
HEAP32[((_stdout)>>2)]=stdout.fd;
assert(stdout.fd === 2, 'invalid handle for stdout (' + stdout.fd + ')');
var stderr = FS.open('/dev/stderr', 'w');
HEAP32[((_stderr)>>2)]=stderr.fd;
assert(stderr.fd === 3, 'invalid handle for stderr (' + stderr.fd + ')');
},ensureErrnoError:function () {
if (FS.ErrnoError) return;
FS.ErrnoError = function ErrnoError(errno) {
this.errno = errno;
for (var key in ERRNO_CODES) {
if (ERRNO_CODES[key] === errno) {
this.code = key;
break;
}
}
this.message = ERRNO_MESSAGES[errno];
this.stack = stackTrace();
};
FS.ErrnoError.prototype = new Error();
FS.ErrnoError.prototype.constructor = FS.ErrnoError;
// Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
[ERRNO_CODES.ENOENT].forEach(function(code) {
FS.genericErrors[code] = new FS.ErrnoError(code);
FS.genericErrors[code].stack = '<generic error, no stack>';
});
},staticInit:function () {
FS.ensureErrnoError();
FS.nameTable = new Array(4096);
FS.root = FS.createNode(null, '/', 16384 | 0777, 0);
FS.mount(MEMFS, {}, '/');
FS.createDefaultDirectories();
FS.createDefaultDevices();
},init:function (input, output, error) {
assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
FS.init.initialized = true;
FS.ensureErrnoError();
// Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
Module['stdin'] = input || Module['stdin'];
Module['stdout'] = output || Module['stdout'];
Module['stderr'] = error || Module['stderr'];
FS.createStandardStreams();
},quit:function () {
FS.init.initialized = false;
for (var i = 0; i < FS.streams.length; i++) {
var stream = FS.streams[i];
if (!stream) {
continue;
}
FS.close(stream);
}
},getMode:function (canRead, canWrite) {
var mode = 0;
if (canRead) mode |= 292 | 73;
if (canWrite) mode |= 146;
return mode;
},joinPath:function (parts, forceRelative) {
var path = PATH.join.apply(null, parts);
if (forceRelative && path[0] == '/') path = path.substr(1);
return path;
},absolutePath:function (relative, base) {
return PATH.resolve(base, relative);
},standardizePath:function (path) {
return PATH.normalize(path);
},findObject:function (path, dontResolveLastLink) {
var ret = FS.analyzePath(path, dontResolveLastLink);
if (ret.exists) {
return ret.object;
} else {
___setErrNo(ret.error);
return null;
}
},analyzePath:function (path, dontResolveLastLink) {
// operate from within the context of the symlink's target
try {
var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
path = lookup.path;
} catch (e) {
}
var ret = {
isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
parentExists: false, parentPath: null, parentObject: null
};
try {
var lookup = FS.lookupPath(path, { parent: true });
ret.parentExists = true;
ret.parentPath = lookup.path;
ret.parentObject = lookup.node;
ret.name = PATH.basename(path);
lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
ret.exists = true;
ret.path = lookup.path;
ret.object = lookup.node;
ret.name = lookup.node.name;
ret.isRoot = lookup.path === '/';
} catch (e) {
ret.error = e.errno;
};
return ret;
},createFolder:function (parent, name, canRead, canWrite) {
var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
var mode = FS.getMode(canRead, canWrite);
return FS.mkdir(path, mode);
},createPath:function (parent, path, canRead, canWrite) {
parent = typeof parent === 'string' ? parent : FS.getPath(parent);
var parts = path.split('/').reverse();
while (parts.length) {
var part = parts.pop();
if (!part) continue;
var current = PATH.join2(parent, part);
try {
FS.mkdir(current);
} catch (e) {
// ignore EEXIST
}
parent = current;
}
return current;
},createFile:function (parent, name, properties, canRead, canWrite) {
var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
var mode = FS.getMode(canRead, canWrite);
return FS.create(path, mode);
},createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
var mode = FS.getMode(canRead, canWrite);
var node = FS.create(path, mode);
if (data) {
if (typeof data === 'string') {
var arr = new Array(data.length);
for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
data = arr;
}
// make sure we can write to the file
FS.chmod(node, mode | 146);
var stream = FS.open(node, 'w');
FS.write(stream, data, 0, data.length, 0, canOwn);
FS.close(stream);
FS.chmod(node, mode);
}
return node;
},createDevice:function (parent, name, input, output) {
var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
var mode = FS.getMode(!!input, !!output);
if (!FS.createDevice.major) FS.createDevice.major = 64;
var dev = FS.makedev(FS.createDevice.major++, 0);
// Create a fake device that a set of stream ops to emulate
// the old behavior.
FS.registerDevice(dev, {
open: function(stream) {
stream.seekable = false;
},
close: function(stream) {
// flush any pending line data
if (output && output.buffer && output.buffer.length) {
output(10);
}
},
read: function(stream, buffer, offset, length, pos /* ignored */) {
var bytesRead = 0;
for (var i = 0; i < length; i++) {
var result;
try {
result = input();
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
if (result === undefined && bytesRead === 0) {
throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
}
if (result === null || result === undefined) break;
bytesRead++;
buffer[offset+i] = result;
}
if (bytesRead) {
stream.node.timestamp = Date.now();
}
return bytesRead;
},
write: function(stream, buffer, offset, length, pos) {
for (var i = 0; i < length; i++) {
try {
output(buffer[offset+i]);
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
}
if (length) {
stream.node.timestamp = Date.now();
}
return i;
}
});
return FS.mkdev(path, mode, dev);
},createLink:function (parent, name, target, canRead, canWrite) {
var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
return FS.symlink(target, path);
},forceLoadFile:function (obj) {
if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
var success = true;
if (typeof XMLHttpRequest !== 'undefined') {
throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
} else if (Module['read']) {
// Command-line.
try {
// WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
// read() will try to parse UTF8.
obj.contents = intArrayFromString(Module['read'](obj.url), true);
} catch (e) {
success = false;
}
} else {
throw new Error('Cannot load without read() or XMLHttpRequest.');
}
if (!success) ___setErrNo(ERRNO_CODES.EIO);
return success;
},createLazyFile:function (parent, name, url, canRead, canWrite) {
if (typeof XMLHttpRequest !== 'undefined') {
if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
// Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
function LazyUint8Array() {
this.lengthKnown = false;
this.chunks = []; // Loaded chunks. Index is the chunk number
}
LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
if (idx > this.length-1 || idx < 0) {
return undefined;
}
var chunkOffset = idx % this.chunkSize;
var chunkNum = Math.floor(idx / this.chunkSize);
return this.getter(chunkNum)[chunkOffset];
}
LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
this.getter = getter;
}
LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
// Find length
var xhr = new XMLHttpRequest();
xhr.open('HEAD', url, false);
xhr.send(null);
if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
var datalength = Number(xhr.getResponseHeader("Content-length"));
var header;
var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
var chunkSize = 1024*1024; // Chunk size in bytes
if (!hasByteServing) chunkSize = datalength;
// Function to get a range from the remote URL.
var doXHR = (function(from, to) {
if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
// TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
var xhr = new XMLHttpRequest();
xhr.open('GET', url, false);
if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
// Some hints to the browser that we want binary data.
if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
if (xhr.overrideMimeType) {
xhr.overrideMimeType('text/plain; charset=x-user-defined');
}
xhr.send(null);
if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
if (xhr.response !== undefined) {
return new Uint8Array(xhr.response || []);
} else {
return intArrayFromString(xhr.responseText || '', true);
}
});
var lazyArray = this;
lazyArray.setDataGetter(function(chunkNum) {
var start = chunkNum * chunkSize;
var end = (chunkNum+1) * chunkSize - 1; // including this byte
end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
lazyArray.chunks[chunkNum] = doXHR(start, end);
}
if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
return lazyArray.chunks[chunkNum];
});
this._length = datalength;
this._chunkSize = chunkSize;
this.lengthKnown = true;
}
var lazyArray = new LazyUint8Array();
Object.defineProperty(lazyArray, "length", {
get: function() {
if(!this.lengthKnown) {
this.cacheLength();
}
return this._length;
}
});
Object.defineProperty(lazyArray, "chunkSize", {
get: function() {
if(!this.lengthKnown) {
this.cacheLength();
}
return this._chunkSize;
}
});
var properties = { isDevice: false, contents: lazyArray };
} else {
var properties = { isDevice: false, url: url };
}
var node = FS.createFile(parent, name, properties, canRead, canWrite);
// This is a total hack, but I want to get this lazy file code out of the
// core of MEMFS. If we want to keep this lazy file concept I feel it should
// be its own thin LAZYFS proxying calls to MEMFS.
if (properties.contents) {
node.contents = properties.contents;
} else if (properties.url) {
node.contents = null;
node.url = properties.url;
}
// override each stream op with one that tries to force load the lazy file first
var stream_ops = {};
var keys = Object.keys(node.stream_ops);
keys.forEach(function(key) {
var fn = node.stream_ops[key];
stream_ops[key] = function forceLoadLazyFile() {
if (!FS.forceLoadFile(node)) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
return fn.apply(null, arguments);
};
});
// use a custom read function
stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
if (!FS.forceLoadFile(node)) {
throw new FS.ErrnoError(ERRNO_CODES.EIO);
}
var contents = stream.node.contents;
if (position >= contents.length)
return 0;
var size = Math.min(contents.length - position, length);
assert(size >= 0);
if (contents.slice) { // normal array
for (var i = 0; i < size; i++) {
buffer[offset + i] = contents[position + i];
}
} else {
for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
buffer[offset + i] = contents.get(position + i);
}
}
return size;
};
node.stream_ops = stream_ops;
return node;
},createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
Browser.init();
// TODO we should allow people to just pass in a complete filename instead
// of parent and name being that we just join them anyways
var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
function processData(byteArray) {
function finish(byteArray) {
if (!dontCreateFile) {
FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
}
if (onload) onload();
removeRunDependency('cp ' + fullname);
}
var handled = false;
Module['preloadPlugins'].forEach(function(plugin) {
if (handled) return;
if (plugin['canHandle'](fullname)) {
plugin['handle'](byteArray, fullname, finish, function() {
if (onerror) onerror();
removeRunDependency('cp ' + fullname);
});
handled = true;
}
});
if (!handled) finish(byteArray);
}
addRunDependency('cp ' + fullname);
if (typeof url == 'string') {
Browser.asyncLoad(url, function(byteArray) {
processData(byteArray);
}, onerror);
} else {
processData(url);
}
},indexedDB:function () {
return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
},DB_NAME:function () {
return 'EM_FS_' + window.location.pathname;
},DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
onload = onload || function(){};
onerror = onerror || function(){};
var indexedDB = FS.indexedDB();
try {
var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
} catch (e) {
return onerror(e);
}
openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
console.log('creating db');
var db = openRequest.result;
db.createObjectStore(FS.DB_STORE_NAME);
};
openRequest.onsuccess = function openRequest_onsuccess() {
var db = openRequest.result;
var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
var files = transaction.objectStore(FS.DB_STORE_NAME);
var ok = 0, fail = 0, total = paths.length;
function finish() {
if (fail == 0) onload(); else onerror();
}
paths.forEach(function(path) {
var putRequest = files.put(FS.analyzePath(path).object.contents, path);
putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
});
transaction.onerror = onerror;
};
openRequest.onerror = onerror;
},loadFilesFromDB:function (paths, onload, onerror) {
onload = onload || function(){};
onerror = onerror || function(){};
var indexedDB = FS.indexedDB();
try {
var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
} catch (e) {
return onerror(e);
}
openRequest.onupgradeneeded = onerror; // no database to load from
openRequest.onsuccess = function openRequest_onsuccess() {
var db = openRequest.result;
try {
var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
} catch(e) {
onerror(e);
return;
}
var files = transaction.objectStore(FS.DB_STORE_NAME);
var ok = 0, fail = 0, total = paths.length;
function finish() {
if (fail == 0) onload(); else onerror();
}
paths.forEach(function(path) {
var getRequest = files.get(path);
getRequest.onsuccess = function getRequest_onsuccess() {
if (FS.analyzePath(path).exists) {
FS.unlink(path);
}
FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
ok++;
if (ok + fail == total) finish();
};
getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
});
transaction.onerror = onerror;
};
openRequest.onerror = onerror;
}};var PATH={splitPath:function (filename) {
var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
return splitPathRe.exec(filename).slice(1);
},normalizeArray:function (parts, allowAboveRoot) {
// if the path tries to go above the root, `up` ends up > 0
var up = 0;
for (var i = parts.length - 1; i >= 0; i--) {
var last = parts[i];
if (last === '.') {
parts.splice(i, 1);
} else if (last === '..') {
parts.splice(i, 1);
up++;
} else if (up) {
parts.splice(i, 1);
up--;
}
}
// if the path is allowed to go above the root, restore leading ..s
if (allowAboveRoot) {
for (; up--; up) {
parts.unshift('..');
}
}
return parts;
},normalize:function (path) {
var isAbsolute = path.charAt(0) === '/',
trailingSlash = path.substr(-1) === '/';
// Normalize the path
path = PATH.normalizeArray(path.split('/').filter(function(p) {
return !!p;
}), !isAbsolute).join('/');
if (!path && !isAbsolute) {
path = '.';
}
if (path && trailingSlash) {
path += '/';
}
return (isAbsolute ? '/' : '') + path;
},dirname:function (path) {
var result = PATH.splitPath(path),
root = result[0],
dir = result[1];
if (!root && !dir) {
// No dirname whatsoever
return '.';
}
if (dir) {
// It has a dirname, strip trailing slash
dir = dir.substr(0, dir.length - 1);
}
return root + dir;
},basename:function (path) {
// EMSCRIPTEN return '/'' for '/', not an empty string
if (path === '/') return '/';
var lastSlash = path.lastIndexOf('/');
if (lastSlash === -1) return path;
return path.substr(lastSlash+1);
},extname:function (path) {
return PATH.splitPath(path)[3];
},join:function () {
var paths = Array.prototype.slice.call(arguments, 0);
return PATH.normalize(paths.join('/'));
},join2:function (l, r) {
return PATH.normalize(l + '/' + r);
},resolve:function () {
var resolvedPath = '',
resolvedAbsolute = false;
for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
var path = (i >= 0) ? arguments[i] : FS.cwd();
// Skip empty and invalid entries
if (typeof path !== 'string') {
throw new TypeError('Arguments to path.resolve must be strings');
} else if (!path) {
continue;
}
resolvedPath = path + '/' + resolvedPath;
resolvedAbsolute = path.charAt(0) === '/';
}
// At this point the path should be resolved to a full absolute path, but
// handle relative paths to be safe (might happen when process.cwd() fails)
resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
return !!p;
}), !resolvedAbsolute).join('/');
return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
},relative:function (from, to) {
from = PATH.resolve(from).substr(1);
to = PATH.resolve(to).substr(1);
function trim(arr) {
var start = 0;
for (; start < arr.length; start++) {
if (arr[start] !== '') break;
}
var end = arr.length - 1;
for (; end >= 0; end--) {
if (arr[end] !== '') break;
}
if (start > end) return [];
return arr.slice(start, end - start + 1);
}
var fromParts = trim(from.split('/'));
var toParts = trim(to.split('/'));
var length = Math.min(fromParts.length, toParts.length);
var samePartsLength = length;
for (var i = 0; i < length; i++) {
if (fromParts[i] !== toParts[i]) {
samePartsLength = i;
break;
}
}
var outputParts = [];
for (var i = samePartsLength; i < fromParts.length; i++) {
outputParts.push('..');
}
outputParts = outputParts.concat(toParts.slice(samePartsLength));
return outputParts.join('/');
}};var Browser={mainLoop:{scheduler:null,shouldPause:false,paused:false,queue:[],pause:function () {
Browser.mainLoop.shouldPause = true;
},resume:function () {
if (Browser.mainLoop.paused) {
Browser.mainLoop.paused = false;
Browser.mainLoop.scheduler();
}
Browser.mainLoop.shouldPause = false;
},updateStatus:function () {
if (Module['setStatus']) {
var message = Module['statusMessage'] || 'Please wait...';
var remaining = Browser.mainLoop.remainingBlockers;
var expected = Browser.mainLoop.expectedBlockers;
if (remaining) {
if (remaining < expected) {
Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
} else {
Module['setStatus'](message);
}
} else {
Module['setStatus']('');
}
}
}},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
Browser.initted = true;
try {
new Blob();
Browser.hasBlobConstructor = true;
} catch(e) {
Browser.hasBlobConstructor = false;
console.log("warning: no blob constructor, cannot create blobs with mimetypes");
}
Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
Module.noImageDecoding = true;
}
// Support for plugins that can process preloaded files. You can add more of these to
// your app by creating and appending to Module.preloadPlugins.
//
// Each plugin is asked if it can handle a file based on the file's name. If it can,
// it is given the file's raw data. When it is done, it calls a callback with the file's
// (possibly modified) data. For example, a plugin might decompress a file, or it
// might create some side data structure for use later (like an Image element, etc.).
var imagePlugin = {};
imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
};
imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
var b = null;
if (Browser.hasBlobConstructor) {
try {
b = new Blob([byteArray], { type: Browser.getMimetype(name) });
if (b.size !== byteArray.length) { // Safari bug #118630
// Safari's Blob can only take an ArrayBuffer
b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
}
} catch(e) {
Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
}
}
if (!b) {
var bb = new Browser.BlobBuilder();
bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
b = bb.getBlob();
}
var url = Browser.URLObject.createObjectURL(b);
assert(typeof url == 'string', 'createObjectURL must return a url as a string');
var img = new Image();
img.onload = function img_onload() {
assert(img.complete, 'Image ' + name + ' could not be decoded');
var canvas = document.createElement('canvas');
canvas.width = img.width;
canvas.height = img.height;
var ctx = canvas.getContext('2d');
ctx.drawImage(img, 0, 0);
Module["preloadedImages"][name] = canvas;
Browser.URLObject.revokeObjectURL(url);
if (onload) onload(byteArray);
};
img.onerror = function img_onerror(event) {
console.log('Image ' + url + ' could not be decoded');
if (onerror) onerror();
};
img.src = url;
};
Module['preloadPlugins'].push(imagePlugin);
var audioPlugin = {};
audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
};
audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
var done = false;
function finish(audio) {
if (done) return;
done = true;
Module["preloadedAudios"][name] = audio;
if (onload) onload(byteArray);
}
function fail() {
if (done) return;
done = true;
Module["preloadedAudios"][name] = new Audio(); // empty shim
if (onerror) onerror();
}
if (Browser.hasBlobConstructor) {
try {
var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
} catch(e) {
return fail();
}
var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
assert(typeof url == 'string', 'createObjectURL must return a url as a string');
var audio = new Audio();
audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
audio.onerror = function audio_onerror(event) {
if (done) return;
console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
function encode64(data) {
var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
var PAD = '=';
var ret = '';
var leftchar = 0;
var leftbits = 0;
for (var i = 0; i < data.length; i++) {
leftchar = (leftchar << 8) | data[i];
leftbits += 8;
while (leftbits >= 6) {
var curr = (leftchar >> (leftbits-6)) & 0x3f;
leftbits -= 6;
ret += BASE[curr];
}
}
if (leftbits == 2) {
ret += BASE[(leftchar&3) << 4];
ret += PAD + PAD;
} else if (leftbits == 4) {
ret += BASE[(leftchar&0xf) << 2];
ret += PAD;
}
return ret;
}
audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
finish(audio); // we don't wait for confirmation this worked - but it's worth trying
};
audio.src = url;
// workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
Browser.safeSetTimeout(function() {
finish(audio); // try to use it even though it is not necessarily ready to play
}, 10000);
} else {
return fail();
}
};
Module['preloadPlugins'].push(audioPlugin);
// Canvas event setup
var canvas = Module['canvas'];
canvas.requestPointerLock = canvas['requestPointerLock'] ||
canvas['mozRequestPointerLock'] ||
canvas['webkitRequestPointerLock'];
canvas.exitPointerLock = document['exitPointerLock'] ||
document['mozExitPointerLock'] ||
document['webkitExitPointerLock'] ||
function(){}; // no-op if function does not exist
canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
function pointerLockChange() {
Browser.pointerLock = document['pointerLockElement'] === canvas ||
document['mozPointerLockElement'] === canvas ||
document['webkitPointerLockElement'] === canvas;
}
document.addEventListener('pointerlockchange', pointerLockChange, false);
document.addEventListener('mozpointerlockchange', pointerLockChange, false);
document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
if (Module['elementPointerLock']) {
canvas.addEventListener("click", function(ev) {
if (!Browser.pointerLock && canvas.requestPointerLock) {
canvas.requestPointerLock();
ev.preventDefault();
}
}, false);
}
},createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
var ctx;
try {
if (useWebGL) {
var contextAttributes = {
antialias: false,
alpha: false
};
if (webGLContextAttributes) {
for (var attribute in webGLContextAttributes) {
contextAttributes[attribute] = webGLContextAttributes[attribute];
}
}
var errorInfo = '?';
function onContextCreationError(event) {
errorInfo = event.statusMessage || errorInfo;
}
canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
try {
['experimental-webgl', 'webgl'].some(function(webglId) {
return ctx = canvas.getContext(webglId, contextAttributes);
});
} finally {
canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
}
} else {
ctx = canvas.getContext('2d');
}
if (!ctx) throw ':(';
} catch (e) {
Module.print('Could not create canvas: ' + [errorInfo, e]);
return null;
}
if (useWebGL) {
// Set the background of the WebGL canvas to black
canvas.style.backgroundColor = "black";
// Warn on context loss
canvas.addEventListener('webglcontextlost', function(event) {
alert('WebGL context lost. You will need to reload the page.');
}, false);
}
if (setInModule) {
Module.ctx = ctx;
Module.useWebGL = useWebGL;
Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
Browser.init();
}
return ctx;
},destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
Browser.lockPointer = lockPointer;
Browser.resizeCanvas = resizeCanvas;
if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
var canvas = Module['canvas'];
function fullScreenChange() {
Browser.isFullScreen = false;
if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
document['fullScreenElement'] || document['fullscreenElement']) === canvas) {
canvas.cancelFullScreen = document['cancelFullScreen'] ||
document['mozCancelFullScreen'] ||
document['webkitCancelFullScreen'];
canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
if (Browser.lockPointer) canvas.requestPointerLock();
Browser.isFullScreen = true;
if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
} else if (Browser.resizeCanvas){
Browser.setWindowedCanvasSize();
}
if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
}
if (!Browser.fullScreenHandlersInstalled) {
Browser.fullScreenHandlersInstalled = true;
document.addEventListener('fullscreenchange', fullScreenChange, false);
document.addEventListener('mozfullscreenchange', fullScreenChange, false);
document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
}
canvas.requestFullScreen = canvas['requestFullScreen'] ||
canvas['mozRequestFullScreen'] ||
(canvas['webkitRequestFullScreen'] ? function() { canvas['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
canvas.requestFullScreen();
},requestAnimationFrame:function requestAnimationFrame(func) {
if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
setTimeout(func, 1000/60);
} else {
if (!window.requestAnimationFrame) {
window.requestAnimationFrame = window['requestAnimationFrame'] ||
window['mozRequestAnimationFrame'] ||
window['webkitRequestAnimationFrame'] ||
window['msRequestAnimationFrame'] ||
window['oRequestAnimationFrame'] ||
window['setTimeout'];
}
window.requestAnimationFrame(func);
}
},safeCallback:function (func) {
return function() {
if (!ABORT) return func.apply(null, arguments);
};
},safeRequestAnimationFrame:function (func) {
return Browser.requestAnimationFrame(function() {
if (!ABORT) func();
});
},safeSetTimeout:function (func, timeout) {
return setTimeout(function() {
if (!ABORT) func();
}, timeout);
},safeSetInterval:function (func, timeout) {
return setInterval(function() {
if (!ABORT) func();
}, timeout);
},getMimetype:function (name) {
return {
'jpg': 'image/jpeg',
'jpeg': 'image/jpeg',
'png': 'image/png',
'bmp': 'image/bmp',
'ogg': 'audio/ogg',
'wav': 'audio/wav',
'mp3': 'audio/mpeg'
}[name.substr(name.lastIndexOf('.')+1)];
},getUserMedia:function (func) {
if(!window.getUserMedia) {
window.getUserMedia = navigator['getUserMedia'] ||
navigator['mozGetUserMedia'];
}
window.getUserMedia(func);
},getMovementX:function (event) {
return event['movementX'] ||
event['mozMovementX'] ||
event['webkitMovementX'] ||
0;
},getMovementY:function (event) {
return event['movementY'] ||
event['mozMovementY'] ||
event['webkitMovementY'] ||
0;
},mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
if (Browser.pointerLock) {
// When the pointer is locked, calculate the coordinates
// based on the movement of the mouse.
// Workaround for Firefox bug 764498
if (event.type != 'mousemove' &&
('mozMovementX' in event)) {
Browser.mouseMovementX = Browser.mouseMovementY = 0;
} else {
Browser.mouseMovementX = Browser.getMovementX(event);
Browser.mouseMovementY = Browser.getMovementY(event);
}
// check if SDL is available
if (typeof SDL != "undefined") {
Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
} else {
// just add the mouse delta to the current absolut mouse position
// FIXME: ideally this should be clamped against the canvas size and zero
Browser.mouseX += Browser.mouseMovementX;
Browser.mouseY += Browser.mouseMovementY;
}
} else {
// Otherwise, calculate the movement based on the changes
// in the coordinates.
var rect = Module["canvas"].getBoundingClientRect();
var x, y;
if (event.type == 'touchstart' ||
event.type == 'touchend' ||
event.type == 'touchmove') {
var t = event.touches.item(0);
if (t) {
x = t.pageX - (window.scrollX + rect.left);
y = t.pageY - (window.scrollY + rect.top);
} else {
return;
}
} else {
x = event.pageX - (window.scrollX + rect.left);
y = event.pageY - (window.scrollY + rect.top);
}
// the canvas might be CSS-scaled compared to its backbuffer;
// SDL-using content will want mouse coordinates in terms
// of backbuffer units.
var cw = Module["canvas"].width;
var ch = Module["canvas"].height;
x = x * (cw / rect.width);
y = y * (ch / rect.height);
Browser.mouseMovementX = x - Browser.mouseX;
Browser.mouseMovementY = y - Browser.mouseY;
Browser.mouseX = x;
Browser.mouseY = y;
}
},xhrLoad:function (url, onload, onerror) {
var xhr = new XMLHttpRequest();
xhr.open('GET', url, true);
xhr.responseType = 'arraybuffer';
xhr.onload = function xhr_onload() {
if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
onload(xhr.response);
} else {
onerror();
}
};
xhr.onerror = onerror;
xhr.send(null);
},asyncLoad:function (url, onload, onerror, noRunDep) {
Browser.xhrLoad(url, function(arrayBuffer) {
assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
onload(new Uint8Array(arrayBuffer));
if (!noRunDep) removeRunDependency('al ' + url);
}, function(event) {
if (onerror) {
onerror();
} else {
throw 'Loading data file "' + url + '" failed.';
}
});
if (!noRunDep) addRunDependency('al ' + url);
},resizeListeners:[],updateResizeListeners:function () {
var canvas = Module['canvas'];
Browser.resizeListeners.forEach(function(listener) {
listener(canvas.width, canvas.height);
});
},setCanvasSize:function (width, height, noUpdates) {
var canvas = Module['canvas'];
canvas.width = width;
canvas.height = height;
if (!noUpdates) Browser.updateResizeListeners();
},windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
var canvas = Module['canvas'];
this.windowedWidth = canvas.width;
this.windowedHeight = canvas.height;
canvas.width = screen.width;
canvas.height = screen.height;
// check if SDL is available
if (typeof SDL != "undefined") {
var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
}
Browser.updateResizeListeners();
},setWindowedCanvasSize:function () {
var canvas = Module['canvas'];
canvas.width = this.windowedWidth;
canvas.height = this.windowedHeight;
// check if SDL is available
if (typeof SDL != "undefined") {
var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
}
Browser.updateResizeListeners();
}};function _glutCreateWindow(name) {
var contextAttributes = {
antialias: ((GLUT.initDisplayMode & 0x0080 /*GLUT_MULTISAMPLE*/) != 0),
depth: ((GLUT.initDisplayMode & 0x0010 /*GLUT_DEPTH*/) != 0),
stencil: ((GLUT.initDisplayMode & 0x0020 /*GLUT_STENCIL*/) != 0)
};
Module.ctx = Browser.createContext(Module['canvas'], true, true, contextAttributes);
return Module.ctx ? 1 /* a new GLUT window ID for the created context */ : 0 /* failure */;
}function _eglCreateContext(display, config, hmm, contextAttribs) {
if (display != 62000 /* Magic ID for Emscripten 'default display' */) {
EGL.setErrorCode(0x3008 /* EGL_BAD_DISPLAY */);
return 0;
}
_glutInitDisplayMode(0x92 /* GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH | GLUT_MULTISAMPLE */);
EGL.windowID = _glutCreateWindow();
if (EGL.windowID != 0) {
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
// Note: This function only creates a context, but it shall not make it active.
return 62004; // Magic ID for Emscripten EGLContext
} else {
EGL.setErrorCode(0x3009 /* EGL_BAD_MATCH */); // By the EGL 1.4 spec, an implementation that does not support GLES2 (WebGL in this case), this error code is set.
return 0; /* EGL_NO_CONTEXT */
}
}
function _eglMakeCurrent(display, draw, read, context) {
if (display != 62000 /* Magic ID for Emscripten 'default display' */) {
EGL.setErrorCode(0x3008 /* EGL_BAD_DISPLAY */);
return 0 /* EGL_FALSE */;
}
//\todo An EGL_NOT_INITIALIZED error is generated if EGL is not initialized for dpy.
if (context != 0 && context != 62004 /* Magic ID for Emscripten EGLContext */) {
EGL.setErrorCode(0x3006 /* EGL_BAD_CONTEXT */);
return 0;
}
if ((read != 0 && read != 62006) || (draw != 0 && draw != 62006 /* Magic ID for Emscripten 'default surface' */)) {
EGL.setErrorCode(0x300D /* EGL_BAD_SURFACE */);
return 0;
}
EGL.currentContext = context;
EGL.currentDrawSurface = draw;
EGL.currentReadSurface = read;
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
return 1 /* EGL_TRUE */;
}
function _XOpenDisplay() {
return 1; // We support 1 display, the canvas
}
function _XCreateWindow(display, parent, x, y, width, height, border_width, depth, class_, visual, valuemask, attributes) {
// All we can do is set the width and height
Browser.setCanvasSize(width, height);
return 2;
}
function _XChangeWindowAttributes(){}
function _XSetWMHints(){}
function _XMapWindow(){}
function _XStoreName(){}
function _XInternAtom(display, name_, hmm) { return 0 }
function _memset(ptr, value, num) {
ptr = ptr|0; value = value|0; num = num|0;
var stop = 0, value4 = 0, stop4 = 0, unaligned = 0;
stop = (ptr + num)|0;
if ((num|0) >= 20) {
// This is unaligned, but quite large, so work hard to get to aligned settings
value = value & 0xff;
unaligned = ptr & 3;
value4 = value | (value << 8) | (value << 16) | (value << 24);
stop4 = stop & ~3;
if (unaligned) {
unaligned = (ptr + 4 - unaligned)|0;
while ((ptr|0) < (unaligned|0)) { // no need to check for stop, since we have large num
HEAP8[(ptr)]=value;
ptr = (ptr+1)|0;
}
}
while ((ptr|0) < (stop4|0)) {
HEAP32[((ptr)>>2)]=value4;
ptr = (ptr+4)|0;
}
}
while ((ptr|0) < (stop|0)) {
HEAP8[(ptr)]=value;
ptr = (ptr+1)|0;
}
return (ptr-num)|0;
}var _llvm_memset_p0i8_i32=_memset;
function _XSendEvent(){}
function _gettimeofday(ptr) {
var now = Date.now();
HEAP32[((ptr)>>2)]=Math.floor(now/1000); // seconds
HEAP32[(((ptr)+(4))>>2)]=Math.floor((now-1000*Math.floor(now/1000))*1000); // microseconds
return 0;
}
function _eglSwapBuffers() {
EGL.setErrorCode(0x3000 /* EGL_SUCCESS */);
}
var _mkport=undefined;var SOCKFS={mount:function (mount) {
return FS.createNode(null, '/', 16384 | 0777, 0);
},createSocket:function (family, type, protocol) {
var streaming = type == 1;
if (protocol) {
assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
}
// create our internal socket structure
var sock = {
family: family,
type: type,
protocol: protocol,
server: null,
peers: {},
pending: [],
recv_queue: [],
sock_ops: SOCKFS.websocket_sock_ops
};
// create the filesystem node to store the socket structure
var name = SOCKFS.nextname();
var node = FS.createNode(SOCKFS.root, name, 49152, 0);
node.sock = sock;
// and the wrapping stream that enables library functions such
// as read and write to indirectly interact with the socket
var stream = FS.createStream({
path: name,
node: node,
flags: FS.modeStringToFlags('r+'),
seekable: false,
stream_ops: SOCKFS.stream_ops
});
// map the new stream to the socket structure (sockets have a 1:1
// relationship with a stream)
sock.stream = stream;
return sock;
},getSocket:function (fd) {
var stream = FS.getStream(fd);
if (!stream || !FS.isSocket(stream.node.mode)) {
return null;
}
return stream.node.sock;
},stream_ops:{poll:function (stream) {
var sock = stream.node.sock;
return sock.sock_ops.poll(sock);
},ioctl:function (stream, request, varargs) {
var sock = stream.node.sock;
return sock.sock_ops.ioctl(sock, request, varargs);
},read:function (stream, buffer, offset, length, position /* ignored */) {
var sock = stream.node.sock;
var msg = sock.sock_ops.recvmsg(sock, length);
if (!msg) {
// socket is closed
return 0;
}
buffer.set(msg.buffer, offset);
return msg.buffer.length;
},write:function (stream, buffer, offset, length, position /* ignored */) {
var sock = stream.node.sock;
return sock.sock_ops.sendmsg(sock, buffer, offset, length);
},close:function (stream) {
var sock = stream.node.sock;
sock.sock_ops.close(sock);
}},nextname:function () {
if (!SOCKFS.nextname.current) {
SOCKFS.nextname.current = 0;
}
return 'socket[' + (SOCKFS.nextname.current++) + ']';
},websocket_sock_ops:{createPeer:function (sock, addr, port) {
var ws;
if (typeof addr === 'object') {
ws = addr;
addr = null;
port = null;
}
if (ws) {
// for sockets that've already connected (e.g. we're the server)
// we can inspect the _socket property for the address
if (ws._socket) {
addr = ws._socket.remoteAddress;
port = ws._socket.remotePort;
}
// if we're just now initializing a connection to the remote,
// inspect the url property
else {
var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
if (!result) {
throw new Error('WebSocket URL must be in the format ws(s)://address:port');
}
addr = result[1];
port = parseInt(result[2], 10);
}
} else {
// create the actual websocket object and connect
try {
var url = 'ws://' + addr + ':' + port;
// the node ws library API is slightly different than the browser's
var opts = ENVIRONMENT_IS_NODE ? {headers: {'websocket-protocol': ['binary']}} : ['binary'];
// If node we use the ws library.
var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
ws = new WebSocket(url, opts);
ws.binaryType = 'arraybuffer';
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
}
}
var peer = {
addr: addr,
port: port,
socket: ws,
dgram_send_queue: []
};
SOCKFS.websocket_sock_ops.addPeer(sock, peer);
SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
// if this is a bound dgram socket, send the port number first to allow
// us to override the ephemeral port reported to us by remotePort on the
// remote end.
if (sock.type === 2 && typeof sock.sport !== 'undefined') {
peer.dgram_send_queue.push(new Uint8Array([
255, 255, 255, 255,
'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
]));
}
return peer;
},getPeer:function (sock, addr, port) {
return sock.peers[addr + ':' + port];
},addPeer:function (sock, peer) {
sock.peers[peer.addr + ':' + peer.port] = peer;
},removePeer:function (sock, peer) {
delete sock.peers[peer.addr + ':' + peer.port];
},handlePeerEvents:function (sock, peer) {
var first = true;
var handleOpen = function () {
try {
var queued = peer.dgram_send_queue.shift();
while (queued) {
peer.socket.send(queued);
queued = peer.dgram_send_queue.shift();
}
} catch (e) {
// not much we can do here in the way of proper error handling as we've already
// lied and said this data was sent. shut it down.
peer.socket.close();
}
};
function handleMessage(data) {
assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
data = new Uint8Array(data); // make a typed array view on the array buffer
// if this is the port message, override the peer's port with it
var wasfirst = first;
first = false;
if (wasfirst &&
data.length === 10 &&
data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
// update the peer's port and it's key in the peer map
var newport = ((data[8] << 8) | data[9]);
SOCKFS.websocket_sock_ops.removePeer(sock, peer);
peer.port = newport;
SOCKFS.websocket_sock_ops.addPeer(sock, peer);
return;
}
sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
};
if (ENVIRONMENT_IS_NODE) {
peer.socket.on('open', handleOpen);
peer.socket.on('message', function(data, flags) {
if (!flags.binary) {
return;
}
handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
});
peer.socket.on('error', function() {
// don't throw
});
} else {
peer.socket.onopen = handleOpen;
peer.socket.onmessage = function peer_socket_onmessage(event) {
handleMessage(event.data);
};
}
},poll:function (sock) {
if (sock.type === 1 && sock.server) {
// listen sockets should only say they're available for reading
// if there are pending clients.
return sock.pending.length ? (64 | 1) : 0;
}
var mask = 0;
var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
null;
if (sock.recv_queue.length ||
!dest || // connection-less sockets are always ready to read
(dest && dest.socket.readyState === dest.socket.CLOSING) ||
(dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
mask |= (64 | 1);
}
if (!dest || // connection-less sockets are always ready to write
(dest && dest.socket.readyState === dest.socket.OPEN)) {
mask |= 4;
}
if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
(dest && dest.socket.readyState === dest.socket.CLOSED)) {
mask |= 16;
}
return mask;
},ioctl:function (sock, request, arg) {
switch (request) {
case 21531:
var bytes = 0;
if (sock.recv_queue.length) {
bytes = sock.recv_queue[0].data.length;
}
HEAP32[((arg)>>2)]=bytes;
return 0;
default:
return ERRNO_CODES.EINVAL;
}
},close:function (sock) {
// if we've spawned a listen server, close it
if (sock.server) {
try {
sock.server.close();
} catch (e) {
}
sock.server = null;
}
// close any peer connections
var peers = Object.keys(sock.peers);
for (var i = 0; i < peers.length; i++) {
var peer = sock.peers[peers[i]];
try {
peer.socket.close();
} catch (e) {
}
SOCKFS.websocket_sock_ops.removePeer(sock, peer);
}
return 0;
},bind:function (sock, addr, port) {
if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
}
sock.saddr = addr;
sock.sport = port || _mkport();
// in order to emulate dgram sockets, we need to launch a listen server when
// binding on a connection-less socket
// note: this is only required on the server side
if (sock.type === 2) {
// close the existing server if it exists
if (sock.server) {
sock.server.close();
sock.server = null;
}
// swallow error operation not supported error that occurs when binding in the
// browser where this isn't supported
try {
sock.sock_ops.listen(sock, 0);
} catch (e) {
if (!(e instanceof FS.ErrnoError)) throw e;
if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
}
}
},connect:function (sock, addr, port) {
if (sock.server) {
throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
}
// TODO autobind
// if (!sock.addr && sock.type == 2) {
// }
// early out if we're already connected / in the middle of connecting
if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
if (dest) {
if (dest.socket.readyState === dest.socket.CONNECTING) {
throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
} else {
throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
}
}
}
// add the socket to our peer list and set our
// destination address / port to match
var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
sock.daddr = peer.addr;
sock.dport = peer.port;
// always "fail" in non-blocking mode
throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
},listen:function (sock, backlog) {
if (!ENVIRONMENT_IS_NODE) {
throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
}
if (sock.server) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
}
var WebSocketServer = require('ws').Server;
var host = sock.saddr;
sock.server = new WebSocketServer({
host: host,
port: sock.sport
// TODO support backlog
});
sock.server.on('connection', function(ws) {
if (sock.type === 1) {
var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
// create a peer on the new socket
var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
newsock.daddr = peer.addr;
newsock.dport = peer.port;
// push to queue for accept to pick up
sock.pending.push(newsock);
} else {
// create a peer on the listen socket so calling sendto
// with the listen socket and an address will resolve
// to the correct client
SOCKFS.websocket_sock_ops.createPeer(sock, ws);
}
});
sock.server.on('closed', function() {
sock.server = null;
});
sock.server.on('error', function() {
// don't throw
});
},accept:function (listensock) {
if (!listensock.server) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
var newsock = listensock.pending.shift();
newsock.stream.flags = listensock.stream.flags;
return newsock;
},getname:function (sock, peer) {
var addr, port;
if (peer) {
if (sock.daddr === undefined || sock.dport === undefined) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
}
addr = sock.daddr;
port = sock.dport;
} else {
// TODO saddr and sport will be set for bind()'d UDP sockets, but what
// should we be returning for TCP sockets that've been connect()'d?
addr = sock.saddr || 0;
port = sock.sport || 0;
}
return { addr: addr, port: port };
},sendmsg:function (sock, buffer, offset, length, addr, port) {
if (sock.type === 2) {
// connection-less sockets will honor the message address,
// and otherwise fall back to the bound destination address
if (addr === undefined || port === undefined) {
addr = sock.daddr;
port = sock.dport;
}
// if there was no address to fall back to, error out
if (addr === undefined || port === undefined) {
throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
}
} else {
// connection-based sockets will only use the bound
addr = sock.daddr;
port = sock.dport;
}
// find the peer for the destination address
var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
// early out if not connected with a connection-based socket
if (sock.type === 1) {
if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
} else if (dest.socket.readyState === dest.socket.CONNECTING) {
throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
}
}
// create a copy of the incoming data to send, as the WebSocket API
// doesn't work entirely with an ArrayBufferView, it'll just send
// the entire underlying buffer
var data;
if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
data = buffer.slice(offset, offset + length);
} else { // ArrayBufferView
data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
}
// if we're emulating a connection-less dgram socket and don't have
// a cached connection, queue the buffer to send upon connect and
// lie, saying the data was sent now.
if (sock.type === 2) {
if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
// if we're not connected, open a new connection
if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
}
dest.dgram_send_queue.push(data);
return length;
}
}
try {
// send the actual data
dest.socket.send(data);
return length;
} catch (e) {
throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
}
},recvmsg:function (sock, length) {
// http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
if (sock.type === 1 && sock.server) {
// tcp servers should not be recv()'ing on the listen socket
throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
}
var queued = sock.recv_queue.shift();
if (!queued) {
if (sock.type === 1) {
var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
if (!dest) {
// if we have a destination address but are not connected, error out
throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
}
else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
// return null if the socket has closed
return null;
}
else {
// else, our socket is in a valid state but truly has nothing available
throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
}
} else {
throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
}
}
// queued.data will be an ArrayBuffer if it's unadulterated, but if it's
// requeued TCP data it'll be an ArrayBufferView
var queuedLength = queued.data.byteLength || queued.data.length;
var queuedOffset = queued.data.byteOffset || 0;
var queuedBuffer = queued.data.buffer || queued.data;
var bytesRead = Math.min(length, queuedLength);
var res = {
buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
addr: queued.addr,
port: queued.port
};
// push back any unread data for TCP connections
if (sock.type === 1 && bytesRead < queuedLength) {
var bytesRemaining = queuedLength - bytesRead;
queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
sock.recv_queue.unshift(queued);
}
return res;
}}};function _send(fd, buf, len, flags) {
var sock = SOCKFS.getSocket(fd);
if (!sock) {
___setErrNo(ERRNO_CODES.EBADF);
return -1;
}
// TODO honor flags
return _write(fd, buf, len);
}
function _pwrite(fildes, buf, nbyte, offset) {
// ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
var stream = FS.getStream(fildes);
if (!stream) {
___setErrNo(ERRNO_CODES.EBADF);
return -1;
}
try {
var slab = HEAP8;
return FS.write(stream, slab, buf, nbyte, offset);
} catch (e) {
FS.handleFSError(e);
return -1;
}
}function _write(fildes, buf, nbyte) {
// ssize_t write(int fildes, const void *buf, size_t nbyte);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
var stream = FS.getStream(fildes);
if (!stream) {
___setErrNo(ERRNO_CODES.EBADF);
return -1;
}
try {
var slab = HEAP8;
return FS.write(stream, slab, buf, nbyte);
} catch (e) {
FS.handleFSError(e);
return -1;
}
}function _fwrite(ptr, size, nitems, stream) {
// size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
var bytesToWrite = nitems * size;
if (bytesToWrite == 0) return 0;
var bytesWritten = _write(stream, ptr, bytesToWrite);
if (bytesWritten == -1) {
var streamObj = FS.getStream(stream);
if (streamObj) streamObj.error = true;
return 0;
} else {
return Math.floor(bytesWritten / size);
}
}
function _strlen(ptr) {
ptr = ptr|0;
var curr = 0;
curr = ptr;
while (HEAP8[(curr)]) {
curr = (curr + 1)|0;
}
return (curr - ptr)|0;
}
function __reallyNegative(x) {
return x < 0 || (x === 0 && (1/x) === -Infinity);
}function __formatString(format, varargs) {
var textIndex = format;
var argIndex = 0;
function getNextArg(type) {
// NOTE: Explicitly ignoring type safety. Otherwise this fails:
// int x = 4; printf("%c\n", (char)x);
var ret;
if (type === 'double') {
ret = (HEAP32[((tempDoublePtr)>>2)]=HEAP32[(((varargs)+(argIndex))>>2)],HEAP32[(((tempDoublePtr)+(4))>>2)]=HEAP32[(((varargs)+((argIndex)+(4)))>>2)],HEAPF64[(tempDoublePtr)>>3]);
} else if (type == 'i64') {
ret = [HEAP32[(((varargs)+(argIndex))>>2)],
HEAP32[(((varargs)+(argIndex+4))>>2)]];
} else {
type = 'i32'; // varargs are always i32, i64, or double
ret = HEAP32[(((varargs)+(argIndex))>>2)];
}
argIndex += Math.max(Runtime.getNativeFieldSize(type), Runtime.getAlignSize(type, null, true));
return ret;
}
var ret = [];
var curr, next, currArg;
while(1) {
var startTextIndex = textIndex;
curr = HEAP8[(textIndex)];
if (curr === 0) break;
next = HEAP8[((textIndex+1)|0)];
if (curr == 37) {
// Handle flags.
var flagAlwaysSigned = false;
var flagLeftAlign = false;
var flagAlternative = false;
var flagZeroPad = false;
var flagPadSign = false;
flagsLoop: while (1) {
switch (next) {
case 43:
flagAlwaysSigned = true;
break;
case 45:
flagLeftAlign = true;
break;
case 35:
flagAlternative = true;
break;
case 48:
if (flagZeroPad) {
break flagsLoop;
} else {
flagZeroPad = true;
break;
}
case 32:
flagPadSign = true;
break;
default:
break flagsLoop;
}
textIndex++;
next = HEAP8[((textIndex+1)|0)];
}
// Handle width.
var width = 0;
if (next == 42) {
width = getNextArg('i32');
textIndex++;
next = HEAP8[((textIndex+1)|0)];
} else {
while (next >= 48 && next <= 57) {
width = width * 10 + (next - 48);
textIndex++;
next = HEAP8[((textIndex+1)|0)];
}
}
// Handle precision.
var precisionSet = false;
if (next == 46) {
var precision = 0;
precisionSet = true;
textIndex++;
next = HEAP8[((textIndex+1)|0)];
if (next == 42) {
precision = getNextArg('i32');
textIndex++;
} else {
while(1) {
var precisionChr = HEAP8[((textIndex+1)|0)];
if (precisionChr < 48 ||
precisionChr > 57) break;
precision = precision * 10 + (precisionChr - 48);
textIndex++;
}
}
next = HEAP8[((textIndex+1)|0)];
} else {
var precision = 6; // Standard default.
}
// Handle integer sizes. WARNING: These assume a 32-bit architecture!
var argSize;
switch (String.fromCharCode(next)) {
case 'h':
var nextNext = HEAP8[((textIndex+2)|0)];
if (nextNext == 104) {
textIndex++;
argSize = 1; // char (actually i32 in varargs)
} else {
argSize = 2; // short (actually i32 in varargs)
}
break;
case 'l':
var nextNext = HEAP8[((textIndex+2)|0)];
if (nextNext == 108) {
textIndex++;
argSize = 8; // long long
} else {
argSize = 4; // long
}
break;
case 'L': // long long
case 'q': // int64_t
case 'j': // intmax_t
argSize = 8;
break;
case 'z': // size_t
case 't': // ptrdiff_t
case 'I': // signed ptrdiff_t or unsigned size_t
argSize = 4;
break;
default:
argSize = null;
}
if (argSize) textIndex++;
next = HEAP8[((textIndex+1)|0)];
// Handle type specifier.
switch (String.fromCharCode(next)) {
case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
// Integer.
var signed = next == 100 || next == 105;
argSize = argSize || 4;
var currArg = getNextArg('i' + (argSize * 8));
var origArg = currArg;
var argText;
// Flatten i64-1 [low, high] into a (slightly rounded) double
if (argSize == 8) {
currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
}
// Truncate to requested size.
if (argSize <= 4) {
var limit = Math.pow(256, argSize) - 1;
currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
}
// Format the number.
var currAbsArg = Math.abs(currArg);
var prefix = '';
if (next == 100 || next == 105) {
if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], null); else
argText = reSign(currArg, 8 * argSize, 1).toString(10);
} else if (next == 117) {
if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], true); else
argText = unSign(currArg, 8 * argSize, 1).toString(10);
currArg = Math.abs(currArg);
} else if (next == 111) {
argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
} else if (next == 120 || next == 88) {
prefix = (flagAlternative && currArg != 0) ? '0x' : '';
if (argSize == 8 && i64Math) {
if (origArg[1]) {
argText = (origArg[1]>>>0).toString(16);
var lower = (origArg[0]>>>0).toString(16);
while (lower.length < 8) lower = '0' + lower;
argText += lower;
} else {
argText = (origArg[0]>>>0).toString(16);
}
} else
if (currArg < 0) {
// Represent negative numbers in hex as 2's complement.
currArg = -currArg;
argText = (currAbsArg - 1).toString(16);
var buffer = [];
for (var i = 0; i < argText.length; i++) {
buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
}
argText = buffer.join('');
while (argText.length < argSize * 2) argText = 'f' + argText;
} else {
argText = currAbsArg.toString(16);
}
if (next == 88) {
prefix = prefix.toUpperCase();
argText = argText.toUpperCase();
}
} else if (next == 112) {
if (currAbsArg === 0) {
argText = '(nil)';
} else {
prefix = '0x';
argText = currAbsArg.toString(16);
}
}
if (precisionSet) {
while (argText.length < precision) {
argText = '0' + argText;
}
}
// Add sign if needed
if (currArg >= 0) {
if (flagAlwaysSigned) {
prefix = '+' + prefix;
} else if (flagPadSign) {
prefix = ' ' + prefix;
}
}
// Move sign to prefix so we zero-pad after the sign
if (argText.charAt(0) == '-') {
prefix = '-' + prefix;
argText = argText.substr(1);
}
// Add padding.
while (prefix.length + argText.length < width) {
if (flagLeftAlign) {
argText += ' ';
} else {
if (flagZeroPad) {
argText = '0' + argText;
} else {
prefix = ' ' + prefix;
}
}
}
// Insert the result into the buffer.
argText = prefix + argText;
argText.split('').forEach(function(chr) {
ret.push(chr.charCodeAt(0));
});
break;
}
case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
// Float.
var currArg = getNextArg('double');
var argText;
if (isNaN(currArg)) {
argText = 'nan';
flagZeroPad = false;
} else if (!isFinite(currArg)) {
argText = (currArg < 0 ? '-' : '') + 'inf';
flagZeroPad = false;
} else {
var isGeneral = false;
var effectivePrecision = Math.min(precision, 20);
// Convert g/G to f/F or e/E, as per:
// http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
if (next == 103 || next == 71) {
isGeneral = true;
precision = precision || 1;
var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
if (precision > exponent && exponent >= -4) {
next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
precision -= exponent + 1;
} else {
next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
precision--;
}
effectivePrecision = Math.min(precision, 20);
}
if (next == 101 || next == 69) {
argText = currArg.toExponential(effectivePrecision);
// Make sure the exponent has at least 2 digits.
if (/[eE][-+]\d$/.test(argText)) {
argText = argText.slice(0, -1) + '0' + argText.slice(-1);
}
} else if (next == 102 || next == 70) {
argText = currArg.toFixed(effectivePrecision);
if (currArg === 0 && __reallyNegative(currArg)) {
argText = '-' + argText;
}
}
var parts = argText.split('e');
if (isGeneral && !flagAlternative) {
// Discard trailing zeros and periods.
while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
(parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
parts[0] = parts[0].slice(0, -1);
}
} else {
// Make sure we have a period in alternative mode.
if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
// Zero pad until required precision.
while (precision > effectivePrecision++) parts[0] += '0';
}
argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
// Capitalize 'E' if needed.
if (next == 69) argText = argText.toUpperCase();
// Add sign.
if (currArg >= 0) {
if (flagAlwaysSigned) {
argText = '+' + argText;
} else if (flagPadSign) {
argText = ' ' + argText;
}
}
}
// Add padding.
while (argText.length < width) {
if (flagLeftAlign) {
argText += ' ';
} else {
if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
argText = argText[0] + '0' + argText.slice(1);
} else {
argText = (flagZeroPad ? '0' : ' ') + argText;
}
}
}
// Adjust case.
if (next < 97) argText = argText.toUpperCase();
// Insert the result into the buffer.
argText.split('').forEach(function(chr) {
ret.push(chr.charCodeAt(0));
});
break;
}
case 's': {
// String.
var arg = getNextArg('i8*');
var argLength = arg ? _strlen(arg) : '(null)'.length;
if (precisionSet) argLength = Math.min(argLength, precision);
if (!flagLeftAlign) {
while (argLength < width--) {
ret.push(32);
}
}
if (arg) {
for (var i = 0; i < argLength; i++) {
ret.push(HEAPU8[((arg++)|0)]);
}
} else {
ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
}
if (flagLeftAlign) {
while (argLength < width--) {
ret.push(32);
}
}
break;
}
case 'c': {
// Character.
if (flagLeftAlign) ret.push(getNextArg('i8'));
while (--width > 0) {
ret.push(32);
}
if (!flagLeftAlign) ret.push(getNextArg('i8'));
break;
}
case 'n': {
// Write the length written so far to the next parameter.
var ptr = getNextArg('i32*');
HEAP32[((ptr)>>2)]=ret.length
break;
}
case '%': {
// Literal percent sign.
ret.push(curr);
break;
}
default: {
// Unknown specifiers remain untouched.
for (var i = startTextIndex; i < textIndex + 2; i++) {
ret.push(HEAP8[(i)]);
}
}
}
textIndex += 2;
// TODO: Support a/A (hex float) and m (last error) specifiers.
// TODO: Support %1${specifier} for arg selection.
} else {
ret.push(curr);
textIndex += 1;
}
}
return ret;
}function _fprintf(stream, format, varargs) {
// int fprintf(FILE *restrict stream, const char *restrict format, ...);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
var result = __formatString(format, varargs);
var stack = Runtime.stackSave();
var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
Runtime.stackRestore(stack);
return ret;
}function _printf(format, varargs) {
// int printf(const char *restrict format, ...);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
var stdout = HEAP32[((_stdout)>>2)];
return _fprintf(stdout, format, varargs);
}
var _llvm_va_start=undefined;
function _snprintf(s, n, format, varargs) {
// int snprintf(char *restrict s, size_t n, const char *restrict format, ...);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
var result = __formatString(format, varargs);
var limit = (n === undefined) ? result.length
: Math.min(result.length, Math.max(n - 1, 0));
if (s < 0) {
s = -s;
var buf = _malloc(limit+1);
HEAP32[((s)>>2)]=buf;
s = buf;
}
for (var i = 0; i < limit; i++) {
HEAP8[(((s)+(i))|0)]=result[i];
}
if (limit < n || (n === undefined)) HEAP8[(((s)+(i))|0)]=0;
return result.length;
}function _sprintf(s, format, varargs) {
// int sprintf(char *restrict s, const char *restrict format, ...);
// http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
return _snprintf(s, undefined, format, varargs);
}var _vsprintf=_sprintf;
function _llvm_va_end() {}
function _glCreateShader(shaderType) {
var id = GL.getNewId(GL.shaders);
GL.shaders[id] = Module.ctx.createShader(shaderType);
return id;
}
function _glShaderSource(shader, count, string, length) {
var source = GL.getSource(shader, count, string, length);
Module.ctx.shaderSource(GL.shaders[shader], source);
}
function _glCompileShader(shader) {
Module.ctx.compileShader(GL.shaders[shader]);
}
function _glGetShaderiv(shader, pname, p) {
if (pname == 0x8B84) { // GL_INFO_LOG_LENGTH
HEAP32[((p)>>2)]=Module.ctx.getShaderInfoLog(GL.shaders[shader]).length + 1;
} else {
HEAP32[((p)>>2)]=Module.ctx.getShaderParameter(GL.shaders[shader], pname);
}
}
function _glGetShaderInfoLog(shader, maxLength, length, infoLog) {
var log = Module.ctx.getShaderInfoLog(GL.shaders[shader]);
// Work around a bug in Chromium which causes getShaderInfoLog to return null
if (!log) {
log = "";
}
log = log.substr(0, maxLength - 1);
writeStringToMemory(log, infoLog);
if (length) {
HEAP32[((length)>>2)]=log.length
}
}
function _glDeleteShader(shader) {
Module.ctx.deleteShader(GL.shaders[shader]);
GL.shaders[shader] = null;
}
function _glCreateProgram() {
var id = GL.getNewId(GL.programs);
var program = Module.ctx.createProgram();
program.name = id;
GL.programs[id] = program;
return id;
}
function _glAttachShader(program, shader) {
Module.ctx.attachShader(GL.programs[program],
GL.shaders[shader]);
}
function _glLinkProgram(program) {
Module.ctx.linkProgram(GL.programs[program]);
GL.programInfos[program] = null; // uniforms no longer keep the same names after linking
GL.populateUniformTable(program);
}
function _glGetProgramiv(program, pname, p) {
if (pname == 0x8B84) { // GL_INFO_LOG_LENGTH
HEAP32[((p)>>2)]=Module.ctx.getProgramInfoLog(GL.programs[program]).length + 1;
} else if (pname == 0x8B87 /* GL_ACTIVE_UNIFORM_MAX_LENGTH */) {
var ptable = GL.programInfos[program];
if (ptable) {
HEAP32[((p)>>2)]=ptable.maxUniformLength;
return;
} else if (program < GL.counter) {
GL.recordError(0x0502 /* GL_INVALID_OPERATION */);
} else {
GL.recordError(0x0501 /* GL_INVALID_VALUE */);
}
} else if (pname == 0x8B8A /* GL_ACTIVE_ATTRIBUTE_MAX_LENGTH */) {
var ptable = GL.programInfos[program];
if (ptable) {
if (ptable.maxAttributeLength == -1) {
var program = GL.programs[program];
var numAttribs = Module.ctx.getProgramParameter(program, Module.ctx.ACTIVE_ATTRIBUTES);
ptable.maxAttributeLength = 0; // Spec says if there are no active attribs, 0 must be returned.
for(var i = 0; i < numAttribs; ++i) {
var activeAttrib = Module.ctx.getActiveAttrib(program, i);
ptable.maxAttributeLength = Math.max(ptable.maxAttributeLength, activeAttrib.name.length+1);
}
}
HEAP32[((p)>>2)]=ptable.maxAttributeLength;
return;
} else if (program < GL.counter) {
GL.recordError(0x0502 /* GL_INVALID_OPERATION */);
} else {
GL.recordError(0x0501 /* GL_INVALID_VALUE */);
}
} else {
HEAP32[((p)>>2)]=Module.ctx.getProgramParameter(GL.programs[program], pname);
}
}
function _glGetProgramInfoLog(program, maxLength, length, infoLog) {
var log = Module.ctx.getProgramInfoLog(GL.programs[program]);
// Work around a bug in Chromium which causes getProgramInfoLog to return null
if (!log) {
log = "";
}
log = log.substr(0, maxLength - 1);
writeStringToMemory(log, infoLog);
if (length) {
HEAP32[((length)>>2)]=log.length
}
}
function _abort() {
Module['abort']();
}
function ___errno_location() {
return ___errno_state;
}
function _sbrk(bytes) {
// Implement a Linux-like 'memory area' for our 'process'.
// Changes the size of the memory area by |bytes|; returns the
// address of the previous top ('break') of the memory area
// We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
var self = _sbrk;
if (!self.called) {
DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
self.called = true;
assert(Runtime.dynamicAlloc);
self.alloc = Runtime.dynamicAlloc;
Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
}
var ret = DYNAMICTOP;
if (bytes != 0) self.alloc(bytes);
return ret; // Previous break location.
}
function _sysconf(name) {
// long sysconf(int name);
// http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
switch(name) {
case 30: return PAGE_SIZE;
case 132:
case 133:
case 12:
case 137:
case 138:
case 15:
case 235:
case 16:
case 17:
case 18:
case 19:
case 20:
case 149:
case 13:
case 10:
case 236:
case 153:
case 9:
case 21:
case 22:
case 159:
case 154:
case 14:
case 77:
case 78:
case 139:
case 80:
case 81:
case 79:
case 82:
case 68:
case 67:
case 164:
case 11:
case 29:
case 47:
case 48:
case 95:
case 52:
case 51:
case 46:
return 200809;
case 27:
case 246:
case 127:
case 128:
case 23:
case 24:
case 160:
case 161:
case 181:
case 182:
case 242:
case 183:
case 184:
case 243:
case 244:
case 245:
case 165:
case 178:
case 179:
case 49:
case 50:
case 168:
case 169:
case 175:
case 170:
case 171:
case 172:
case 97:
case 76:
case 32:
case 173:
case 35:
return -1;
case 176:
case 177:
case 7:
case 155:
case 8:
case 157:
case 125:
case 126:
case 92:
case 93:
case 129:
case 130:
case 131:
case 94:
case 91:
return 1;
case 74:
case 60:
case 69:
case 70:
case 4:
return 1024;
case 31:
case 42:
case 72:
return 32;
case 87:
case 26:
case 33:
return 2147483647;
case 34:
case 1:
return 47839;
case 38:
case 36:
return 99;
case 43:
case 37:
return 2048;
case 0: return 2097152;
case 3: return 65536;
case 28: return 32768;
case 44: return 32767;
case 75: return 16384;
case 39: return 1000;
case 89: return 700;
case 71: return 256;
case 40: return 255;
case 2: return 100;
case 180: return 64;
case 25: return 20;
case 5: return 16;
case 6: return 6;
case 73: return 4;
case 84: return 1;
}
___setErrNo(ERRNO_CODES.EINVAL);
return -1;
}
function _time(ptr) {
var ret = Math.floor(Date.now()/1000);
if (ptr) {
HEAP32[((ptr)>>2)]=ret
}
return ret;
}
GL.init()
Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
staticSealed = true; // seal the static portion of memory
STACK_MAX = STACK_BASE + 5242880;
DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
assert(DYNAMIC_BASE < TOTAL_MEMORY); // Stack must fit in TOTAL_MEMORY; allocations from here on may enlarge TOTAL_MEMORY
var FUNCTION_TABLE = [0,0,_Draw,0];
// EMSCRIPTEN_START_FUNCS
function _CreateSimpleTexture2D(){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+16)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
var $textureId=sp;
var $pixels=(sp)+(4);
var $1=$pixels;
assert(12 % 1 === 0);(_memcpy($1, 896, 12)|0);
_glPixelStorei(3317,1);
_glGenTextures(1,$textureId);
var $2=HEAP32[(($textureId)>>2)];
_glBindTexture(3553,$2);
var $3=(($pixels)|0);
_glTexImage2D(3553,0,6407,2,2,0,6407,5121,$3);
_glTexParameteri(3553,10241,9728);
_glTexParameteri(3553,10240,9728);
var $4=HEAP32[(($textureId)>>2)];
STACKTOP=sp;return $4;
}
function _Init($esContext){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+708)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
var $1;
var $userData;
var $vShaderStr=sp;
var $fShaderStr=(sp)+(244);
var $vVertices=(sp)+(616);
var $indices=(sp)+(696);
$1=$esContext;
var $2=_malloc(28);
var $3=$1;
var $4=(($3)|0);
HEAP32[(($4)>>2)]=$2;
var $5=$1;
var $6=(($5)|0);
var $7=HEAP32[(($6)>>2)];
var $8=$7;
$userData=$8;
var $9=$vShaderStr;
assert(241 % 1 === 0);(_memcpy($9, 268, 241)|0);
var $10=$fShaderStr;
assert(372 % 1 === 0);(_memcpy($10, 524, 372)|0);
var $11=(($vShaderStr)|0);
var $12=(($fShaderStr)|0);
var $13=_esLoadProgram($11,$12);
var $14=$userData;
var $15=(($14)|0);
HEAP32[(($15)>>2)]=$13;
var $16=$userData;
var $17=(($16)|0);
var $18=HEAP32[(($17)>>2)];
var $19=_glGetAttribLocation($18,176);
var $20=$userData;
var $21=(($20+4)|0);
HEAP32[(($21)>>2)]=$19;
var $22=$userData;
var $23=(($22)|0);
var $24=HEAP32[(($23)>>2)];
var $25=_glGetAttribLocation($24,164);
var $26=$userData;
var $27=(($26+8)|0);
HEAP32[(($27)>>2)]=$25;
var $28=$userData;
var $29=(($28)|0);
var $30=HEAP32[(($29)>>2)];
var $31=_glGetUniformLocation($30,44);
var $32=$userData;
var $33=(($32+12)|0);
HEAP32[(($33)>>2)]=$31;
var $34=_CreateSimpleTexture2D();
var $35=$userData;
var $36=(($35+16)|0);
HEAP32[(($36)>>2)]=$34;
var $37=$vVertices;
assert(80 % 1 === 0);(_memcpy($37, 188, 80)|0);
var $38=$indices;
assert(12 % 1 === 0);HEAP16[(($38)>>1)]=HEAP16[((512)>>1)];HEAP16[((($38)+(2))>>1)]=HEAP16[((514)>>1)];HEAP16[((($38)+(4))>>1)]=HEAP16[((516)>>1)];HEAP16[((($38)+(6))>>1)]=HEAP16[((518)>>1)];HEAP16[((($38)+(8))>>1)]=HEAP16[((520)>>1)];HEAP16[((($38)+(10))>>1)]=HEAP16[((522)>>1)];
var $39=$userData;
var $40=(($39+20)|0);
_glGenBuffers(1,$40);
var $41=$userData;
var $42=(($41+20)|0);
var $43=HEAP32[(($42)>>2)];
_glBindBuffer(34962,$43);
var $44=(($vVertices)|0);
var $45=$44;
_glBufferData(34962,80,$45,35044);
var $46=$userData;
var $47=(($46+24)|0);
_glGenBuffers(1,$47);
var $48=$userData;
var $49=(($48+24)|0);
var $50=HEAP32[(($49)>>2)];
_glBindBuffer(34963,$50);
var $51=(($indices)|0);
var $52=$51;
_glBufferData(34963,12,$52,35044);
_glClearColor(0,0,0,1);
STACKTOP=sp;return 1;
}
function _Draw($esContext){
var label=0;
var $1;
var $userData;
$1=$esContext;
var $2=$1;
var $3=(($2+4)|0);
var $4=HEAP32[(($3)>>2)];
var $5=$1;
var $6=(($5+8)|0);
var $7=HEAP32[(($6)>>2)];
_glViewport(0,0,$4,$7);
_glClear(16384);
var $8=$1;
var $9=(($8)|0);
var $10=HEAP32[(($9)>>2)];
var $11=$10;
$userData=$11;
var $12=$userData;
var $13=(($12)|0);
var $14=HEAP32[(($13)>>2)];
_glUseProgram($14);
var $15=$userData;
var $16=(($15+20)|0);
var $17=HEAP32[(($16)>>2)];
_glBindBuffer(34962,$17);
var $18=$userData;
var $19=(($18+4)|0);
var $20=HEAP32[(($19)>>2)];
_glVertexAttribPointer($20,3,5126,0,20,0);
var $21=$userData;
var $22=(($21+8)|0);
var $23=HEAP32[(($22)>>2)];
_glVertexAttribPointer($23,2,5126,0,20,12);
var $24=$userData;
var $25=(($24+4)|0);
var $26=HEAP32[(($25)>>2)];
_glEnableVertexAttribArray($26);
var $27=$userData;
var $28=(($27+8)|0);
var $29=HEAP32[(($28)>>2)];
_glEnableVertexAttribArray($29);
_glActiveTexture(33984);
var $30=$userData;
var $31=(($30+16)|0);
var $32=HEAP32[(($31)>>2)];
_glBindTexture(3553,$32);
var $33=$userData;
var $34=(($33+12)|0);
var $35=HEAP32[(($34)>>2)];
_glUniform1i($35,0);
var $36=$userData;
var $37=(($36+24)|0);
var $38=HEAP32[(($37)>>2)];
_glBindBuffer(34963,$38);
_glDrawElements(4,6,5123,0);
return;
}
function _ShutDown($esContext){
var label=0;
var $1;
var $userData;
$1=$esContext;
var $2=$1;
var $3=(($2)|0);
var $4=HEAP32[(($3)>>2)];
var $5=$4;
$userData=$5;
var $6=$userData;
var $7=(($6+16)|0);
_glDeleteTextures(1,$7);
var $8=$userData;
var $9=(($8)|0);
var $10=HEAP32[(($9)>>2)];
_glDeleteProgram($10);
var $11=$1;
var $12=(($11)|0);
var $13=HEAP32[(($12)>>2)];
_free($13);
return;
}
function _main($argc,$argv){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+68)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3;
var $esContext=sp;
var $userData=(sp)+(40);
$1=0;
$2=$argc;
$3=$argv;
_esInitContext($esContext);
var $4=$userData;
var $5=(($esContext)|0);
HEAP32[(($5)>>2)]=$4;
var $6=_esCreateWindow($esContext,20,320,240,0);
var $7=_Init($esContext);
var $8=($7|0)!=0;
if($8){label=3;break;}else{label=2;break;}
case 2:
$1=0;
label=4;break;
case 3:
_esRegisterDrawFunc($esContext,2);
_esMainLoop($esContext);
_ShutDown($esContext);
label=4;break;
case 4:
var $12=$1;
STACKTOP=sp;return $12;
default: assert(0, "bad label: " + label);
}
}
Module["_main"] = _main;
function _CreateEGLContext($hWnd,$eglDisplay,$eglContext,$eglSurface,$attribList){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+32)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3;
var $4;
var $5;
var $6;
var $numConfigs=sp;
var $majorVersion=(sp)+(4);
var $minorVersion=(sp)+(8);
var $display;
var $context;
var $surface;
var $config=(sp)+(12);
var $contextAttribs=(sp)+(16);
$2=$hWnd;
$3=$eglDisplay;
$4=$eglContext;
$5=$eglSurface;
$6=$attribList;
var $7=$contextAttribs;
assert(16 % 1 === 0);HEAP32[(($7)>>2)]=HEAP32[((908)>>2)];HEAP32[((($7)+(4))>>2)]=HEAP32[((912)>>2)];HEAP32[((($7)+(8))>>2)]=HEAP32[((916)>>2)];HEAP32[((($7)+(12))>>2)]=HEAP32[((920)>>2)];
var $8=HEAP32[((924)>>2)];
var $9=$8;
var $10=_eglGetDisplay($9);
$display=$10;
var $11=$display;
var $12=($11|0)==0;
if($12){label=2;break;}else{label=3;break;}
case 2:
$1=0;
label=16;break;
case 3:
var $15=$display;
var $16=_eglInitialize($15,$majorVersion,$minorVersion);
var $17=($16|0)!=0;
if($17){label=5;break;}else{label=4;break;}
case 4:
$1=0;
label=16;break;
case 5:
var $20=$display;
var $21=_eglGetConfigs($20,0,0,$numConfigs);
var $22=($21|0)!=0;
if($22){label=7;break;}else{label=6;break;}
case 6:
$1=0;
label=16;break;
case 7:
var $25=$display;
var $26=$6;
var $27=_eglChooseConfig($25,$26,$config,1,$numConfigs);
var $28=($27|0)!=0;
if($28){label=9;break;}else{label=8;break;}
case 8:
$1=0;
label=16;break;
case 9:
var $31=$display;
var $32=HEAP32[(($config)>>2)];
var $33=$2;
var $34=_eglCreateWindowSurface($31,$32,$33,0);
$surface=$34;
var $35=$surface;
var $36=($35|0)==0;
if($36){label=10;break;}else{label=11;break;}
case 10:
$1=0;
label=16;break;
case 11:
var $39=$display;
var $40=HEAP32[(($config)>>2)];
var $41=(($contextAttribs)|0);
var $42=_eglCreateContext($39,$40,0,$41);
$context=$42;
var $43=$context;
var $44=($43|0)==0;
if($44){label=12;break;}else{label=13;break;}
case 12:
$1=0;
label=16;break;
case 13:
var $47=$display;
var $48=$surface;
var $49=$surface;
var $50=$context;
var $51=_eglMakeCurrent($47,$48,$49,$50);
var $52=($51|0)!=0;
if($52){label=15;break;}else{label=14;break;}
case 14:
$1=0;
label=16;break;
case 15:
var $55=$display;
var $56=$3;
HEAP32[(($56)>>2)]=$55;
var $57=$surface;
var $58=$5;
HEAP32[(($58)>>2)]=$57;
var $59=$context;
var $60=$4;
HEAP32[(($60)>>2)]=$59;
$1=1;
label=16;break;
case 16:
var $62=$1;
STACKTOP=sp;return $62;
default: assert(0, "bad label: " + label);
}
}
function _WinCreate($esContext,$title){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+252)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3;
var $root;
var $swa=sp;
var $xattr=(sp)+(60);
var $wm_state;
var $hints=(sp)+(120);
var $xev=(sp)+(156);
var $ecfg;
var $num_config;
var $win;
$2=$esContext;
$3=$title;
var $4=_XOpenDisplay(0);
HEAP32[((924)>>2)]=$4;
var $5=HEAP32[((924)>>2)];
var $6=($5|0)==0;
if($6){label=2;break;}else{label=3;break;}
case 2:
$1=0;
label=4;break;
case 3:
var $9=HEAP32[((924)>>2)];
var $10=$9;
var $11=(($10+132)|0);
var $12=HEAP32[(($11)>>2)];
var $13=HEAP32[((924)>>2)];
var $14=$13;
var $15=(($14+140)|0);
var $16=HEAP32[(($15)>>2)];
var $17=(($16+((($12)*(80))&-1))|0);
var $18=(($17+8)|0);
var $19=HEAP32[(($18)>>2)];
$root=$19;
var $20=(($swa+40)|0);
HEAP32[(($20)>>2)]=32833;
var $21=HEAP32[((924)>>2)];
var $22=$root;
var $23=$2;
var $24=(($23+4)|0);
var $25=HEAP32[(($24)>>2)];
var $26=$2;
var $27=(($26+8)|0);
var $28=HEAP32[(($27)>>2)];
var $29=_XCreateWindow($21,$22,0,0,$25,$28,0,0,1,0,2048,$swa);
$win=$29;
var $30=(($xattr+48)|0);
HEAP32[(($30)>>2)]=0;
var $31=HEAP32[((924)>>2)];
var $32=$win;
var $33;
var $34=(($hints+4)|0);
HEAP32[(($34)>>2)]=1;
var $35=(($hints)|0);
HEAP32[(($35)>>2)]=1;
var $36=HEAP32[((924)>>2)];
var $37=$win;
var $38;
var $39=HEAP32[((924)>>2)];
var $40=$win;
var $41;
var $42=HEAP32[((924)>>2)];
var $43=$win;
var $44=$3;
var $45;
var $46=HEAP32[((924)>>2)];
var $47=_XInternAtom($46,4,0);
$wm_state=$47;
var $48=$xev;
_memset($48, 0, 96)|0;
var $49=$xev;
HEAP32[(($49)>>2)]=33;
var $50=$win;
var $51=$xev;
var $52=(($51+16)|0);
HEAP32[(($52)>>2)]=$50;
var $53=$wm_state;
var $54=$xev;
var $55=(($54+20)|0);
HEAP32[(($55)>>2)]=$53;
var $56=$xev;
var $57=(($56+24)|0);
HEAP32[(($57)>>2)]=32;
var $58=$xev;
var $59=(($58+28)|0);
var $60=$59;
var $61=(($60)|0);
HEAP32[(($61)>>2)]=1;
var $62=$xev;
var $63=(($62+28)|0);
var $64=$63;
var $65=(($64+4)|0);
HEAP32[(($65)>>2)]=0;
var $66=HEAP32[((924)>>2)];
var $67=HEAP32[((924)>>2)];
var $68=$67;
var $69=(($68+132)|0);
var $70=HEAP32[(($69)>>2)];
var $71=HEAP32[((924)>>2)];
var $72=$71;
var $73=(($72+140)|0);
var $74=HEAP32[(($73)>>2)];
var $75=(($74+((($70)*(80))&-1))|0);
var $76=(($75+8)|0);
var $77=HEAP32[(($76)>>2)];
var $78;
var $79=$win;
var $80=$2;
var $81=(($80+12)|0);
HEAP32[(($81)>>2)]=$79;
$1=1;
label=4;break;
case 4:
var $83=$1;
STACKTOP=sp;return $83;
default: assert(0, "bad label: " + label);
}
}
function _esInitContext($esContext){
var label=0;
label = 1;
while(1)switch(label){
case 1:
var $1;
$1=$esContext;
var $2=$1;
var $3=($2|0)!=0;
if($3){label=2;break;}else{label=3;break;}
case 2:
var $5=$1;
var $6=$5;
_memset($6, 0, 40)|0;
label=3;break;
case 3:
return;
default: assert(0, "bad label: " + label);
}
}
function _esCreateWindow($esContext,$title,$width,$height,$flags){
var label=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+60)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3;
var $4;
var $5;
var $6;
var $attribList=sp;
$2=$esContext;
$3=$title;
$4=$width;
$5=$height;
$6=$flags;
var $7=(($attribList)|0);
HEAP32[(($7)>>2)]=12324;
var $8=(($7+4)|0);
HEAP32[(($8)>>2)]=5;
var $9=(($8+4)|0);
HEAP32[(($9)>>2)]=12323;
var $10=(($9+4)|0);
HEAP32[(($10)>>2)]=6;
var $11=(($10+4)|0);
HEAP32[(($11)>>2)]=12322;
var $12=(($11+4)|0);
HEAP32[(($12)>>2)]=5;
var $13=(($12+4)|0);
HEAP32[(($13)>>2)]=12321;
var $14=(($13+4)|0);
var $15=$6;
var $16=$15&1;
var $17=($16|0)!=0;
var $18=($17?8:-1);
HEAP32[(($14)>>2)]=$18;
var $19=(($14+4)|0);
HEAP32[(($19)>>2)]=12325;
var $20=(($19+4)|0);
var $21=$6;
var $22=$21&2;
var $23=($22|0)!=0;
var $24=($23?8:-1);
HEAP32[(($20)>>2)]=$24;
var $25=(($20+4)|0);
HEAP32[(($25)>>2)]=12326;
var $26=(($25+4)|0);
var $27=$6;
var $28=$27&4;
var $29=($28|0)!=0;
var $30=($29?8:-1);
HEAP32[(($26)>>2)]=$30;
var $31=(($26+4)|0);
HEAP32[(($31)>>2)]=12338;
var $32=(($31+4)|0);
var $33=$6;
var $34=$33&8;
var $35=($34|0)!=0;
var $36=($35?1:0);
HEAP32[(($32)>>2)]=$36;
var $37=(($32+4)|0);
HEAP32[(($37)>>2)]=12344;
var $38=$2;
var $39=($38|0)==0;
if($39){label=2;break;}else{label=3;break;}
case 2:
$1=0;
label=8;break;
case 3:
var $42=$4;
var $43=$2;
var $44=(($43+4)|0);
HEAP32[(($44)>>2)]=$42;
var $45=$5;
var $46=$2;
var $47=(($46+8)|0);
HEAP32[(($47)>>2)]=$45;
var $48=$2;
var $49=$3;
var $50=_WinCreate($48,$49);
var $51=($50|0)!=0;
if($51){label=5;break;}else{label=4;break;}
case 4:
$1=0;
label=8;break;
case 5:
var $54=$2;
var $55=(($54+12)|0);
var $56=HEAP32[(($55)>>2)];
var $57=$2;
var $58=(($57+16)|0);
var $59=$2;
var $60=(($59+20)|0);
var $61=$2;
var $62=(($61+24)|0);
var $63=(($attribList)|0);
var $64=_CreateEGLContext($56,$58,$60,$62,$63);
var $65=($64|0)!=0;
if($65){label=7;break;}else{label=6;break;}
case 6:
$1=0;
label=8;break;
case 7:
$1=1;
label=8;break;
case 8:
var $69=$1;
STACKTOP=sp;return $69;
default: assert(0, "bad label: " + label);
}
}
function _esMainLoop($esContext){
var label=0;
var tempVarArgs=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+24)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $t1=sp;
var $t2=(sp)+(8);
var $tz=(sp)+(16);
var $deltatime;
var $totaltime;
var $frames;
$1=$esContext;
$totaltime=0;
$frames=0;
var $2=$tz;
var $3=_gettimeofday($t1,$2);
var $4=$tz;
var $5=_gettimeofday($t2,$4);
var $6=(($t2)|0);
var $7=HEAP32[(($6)>>2)];
var $8=(($t1)|0);
var $9=HEAP32[(($8)>>2)];
var $10=((($7)-($9))|0);
var $11=($10|0);
var $12=(($t2+4)|0);
var $13=HEAP32[(($12)>>2)];
var $14=(($t1+4)|0);
var $15=HEAP32[(($14)>>2)];
var $16=((($13)-($15))|0);
var $17=($16|0);
var $18=($17)*((0.000001));
var $19=($11)+($18);
var $20=$19;
$deltatime=$20;
var $21=$t1;
var $22=$t2;
assert(8 % 1 === 0);HEAP32[(($21)>>2)]=HEAP32[(($22)>>2)];HEAP32[((($21)+(4))>>2)]=HEAP32[((($22)+(4))>>2)];
var $23=$1;
var $24=(($23+36)|0);
var $25=HEAP32[(($24)>>2)];
var $26=($25|0)!=0;
if($26){label=2;break;}else{label=3;break;}
case 2:
var $28=$1;
var $29=(($28+36)|0);
var $30=HEAP32[(($29)>>2)];
var $31=$1;
var $32=$deltatime;
FUNCTION_TABLE[$30]($31,$32);
label=3;break;
case 3:
var $34=$1;
var $35=(($34+28)|0);
var $36=HEAP32[(($35)>>2)];
var $37=($36|0)!=0;
if($37){label=4;break;}else{label=5;break;}
case 4:
var $39=$1;
var $40=(($39+28)|0);
var $41=HEAP32[(($40)>>2)];
var $42=$1;
FUNCTION_TABLE[$41]($42);
label=5;break;
case 5:
var $44=$1;
var $45=(($44+16)|0);
var $46=HEAP32[(($45)>>2)];
var $47=$1;
var $48=(($47+24)|0);
var $49=HEAP32[(($48)>>2)];
var $50=_eglSwapBuffers($46,$49);
var $51=$deltatime;
var $52=$totaltime;
var $53=($52)+($51);
$totaltime=$53;
var $54=$frames;
var $55=((($54)+(1))|0);
$frames=$55;
var $56=$totaltime;
var $57=$56>2;
if($57){label=6;break;}else{label=7;break;}
case 6:
var $59=$frames;
var $60=$totaltime;
var $61=$60;
var $62=$frames;
var $63=($62>>>0);
var $64=$totaltime;
var $65=($63)/($64);
var $66=$65;
var $67=_printf(84,(tempVarArgs=STACKTOP,STACKTOP = (STACKTOP + 20)|0,(assert((STACKTOP|0) < (STACK_MAX|0))|0),HEAP32[((tempVarArgs)>>2)]=$59,(HEAPF64[(tempDoublePtr)>>3]=$61,HEAP32[(((tempVarArgs)+(4))>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[((((tempVarArgs)+(4))+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]),(HEAPF64[(tempDoublePtr)>>3]=$66,HEAP32[(((tempVarArgs)+(12))>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[((((tempVarArgs)+(12))+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]),tempVarArgs)); STACKTOP=tempVarArgs;
var $68=$totaltime;
var $69=($68)-(2);
$totaltime=$69;
$frames=0;
label=7;break;
case 7:
STACKTOP=sp;return;
default: assert(0, "bad label: " + label);
}
}
function _esRegisterDrawFunc($esContext,$drawFunc){
var label=0;
var $1;
var $2;
$1=$esContext;
$2=$drawFunc;
var $3=$2;
var $4=$1;
var $5=(($4+28)|0);
HEAP32[(($5)>>2)]=$3;
return;
}
function _esLogMessage($formatStr,varrp){
var label=0;
var tempVarArgs=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+1028)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
var $1;
var $params=sp;
var $buf=(sp)+(4);
$1=$formatStr;
var $2=$params;
HEAP32[(($2)>>2)]=varrp;
var $3=(($buf)|0);
var $4=$1;
var $5=HEAP32[(($params)>>2)];
var $6=_sprintf($3,$4,$5);
var $7=(($buf)|0);
var $8=_printf(40,(tempVarArgs=STACKTOP,STACKTOP = (STACKTOP + 4)|0,(assert((STACKTOP|0) < (STACK_MAX|0))|0),HEAP32[((tempVarArgs)>>2)]=$7,tempVarArgs)); STACKTOP=tempVarArgs;
var $9=$params;
STACKTOP=sp;return;
}
function _esLoadShader($type,$shaderSrc){
var label=0;
var tempVarArgs=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+12)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3=sp;
var $shader;
var $compiled=(sp)+(4);
var $infoLen=(sp)+(8);
var $infoLog;
$2=$type;
HEAP32[(($3)>>2)]=$shaderSrc;
var $4=$2;
var $5=_glCreateShader($4);
$shader=$5;
var $6=$shader;
var $7=($6|0)==0;
if($7){label=2;break;}else{label=3;break;}
case 2:
$1=0;
label=8;break;
case 3:
var $10=$shader;
_glShaderSource($10,1,$3,0);
var $11=$shader;
_glCompileShader($11);
var $12=$shader;
_glGetShaderiv($12,35713,$compiled);
var $13=HEAP32[(($compiled)>>2)];
var $14=($13|0)!=0;
if($14){label=7;break;}else{label=4;break;}
case 4:
HEAP32[(($infoLen)>>2)]=0;
var $16=$shader;
_glGetShaderiv($16,35716,$infoLen);
var $17=HEAP32[(($infoLen)>>2)];
var $18=($17|0)>1;
if($18){label=5;break;}else{label=6;break;}
case 5:
var $20=HEAP32[(($infoLen)>>2)];
var $21=$20;
var $22=_malloc($21);
$infoLog=$22;
var $23=$shader;
var $24=HEAP32[(($infoLen)>>2)];
var $25=$infoLog;
_glGetShaderInfoLog($23,$24,0,$25);
var $26=$infoLog;
_esLogMessage(56,(tempVarArgs=STACKTOP,STACKTOP = (STACKTOP + 4)|0,(assert((STACKTOP|0) < (STACK_MAX|0))|0),HEAP32[((tempVarArgs)>>2)]=$26,tempVarArgs)); STACKTOP=tempVarArgs;
var $27=$infoLog;
_free($27);
label=6;break;
case 6:
var $29=$shader;
_glDeleteShader($29);
$1=0;
label=8;break;
case 7:
var $31=$shader;
$1=$31;
label=8;break;
case 8:
var $33=$1;
STACKTOP=sp;return $33;
default: assert(0, "bad label: " + label);
}
}
function _esLoadProgram($vertShaderSrc,$fragShaderSrc){
var label=0;
var tempVarArgs=0;
var sp=STACKTOP;STACKTOP=(STACKTOP+8)|0; (assert(!(STACKTOP&3))|0); (assert((STACKTOP|0) < (STACK_MAX|0))|0);
label = 1;
while(1)switch(label){
case 1:
var $1;
var $2;
var $3;
var $vertexShader;
var $fragmentShader;
var $programObject;
var $linked=sp;
var $infoLen=(sp)+(4);
var $infoLog;
$2=$vertShaderSrc;
$3=$fragShaderSrc;
var $4=$2;
var $5=_esLoadShader(35633,$4);
$vertexShader=$5;
var $6=$vertexShader;
var $7=($6|0)==0;
if($7){label=2;break;}else{label=3;break;}
case 2:
$1=0;
label=12;break;
case 3:
var $10=$3;
var $11=_esLoadShader(35632,$10);
$fragmentShader=$11;
var $12=$fragmentShader;
var $13=($12|0)==0;
if($13){label=4;break;}else{label=5;break;}
case 4:
var $15=$vertexShader;
_glDeleteShader($15);
$1=0;
label=12;break;
case 5:
var $17=_glCreateProgram();
$programObject=$17;
var $18=$programObject;
var $19=($18|0)==0;
if($19){label=6;break;}else{label=7;break;}
case 6:
$1=0;
label=12;break;
case 7:
var $22=$programObject;
var $23=$vertexShader;
_glAttachShader($22,$23);
var $24=$programObject;
var $25=$fragmentShader;
_glAttachShader($24,$25);
var $26=$programObject;
_glLinkProgram($26);
var $27=$programObject;
_glGetProgramiv($27,35714,$linked);
var $28=HEAP32[(($linked)>>2)];
var $29=($28|0)!=0;
if($29){label=11;break;}else{label=8;break;}
case 8:
HEAP32[(($infoLen)>>2)]=0;
var $31=$programObject;
_glGetProgramiv($31,35716,$infoLen);
var $32=HEAP32[(($infoLen)>>2)];
var $33=($32|0)>1;
if($33){label=9;break;}else{label=10;break;}
case 9:
var $35=HEAP32[(($infoLen)>>2)];
var $36=$35;
var $37=_malloc($36);
$infoLog=$37;
var $38=$programObject;
var $39=HEAP32[(($infoLen)>>2)];
var $40=$infoLog;
_glGetProgramInfoLog($38,$39,0,$40);
var $41=$infoLog;
_esLogMessage(136,(tempVarArgs=STACKTOP,STACKTOP = (STACKTOP + 4)|0,(assert((STACKTOP|0) < (STACK_MAX|0))|0),HEAP32[((tempVarArgs)>>2)]=$41,tempVarArgs)); STACKTOP=tempVarArgs;
var $42=$infoLog;
_free($42);
label=10;break;
case 10:
var $44=$programObject;
_glDeleteProgram($44);
$1=0;
label=12;break;
case 11:
var $46=$vertexShader;
_glDeleteShader($46);
var $47=$fragmentShader;
_glDeleteShader($47);
var $48=$programObject;
$1=$48;
label=12;break;
case 12:
var $50=$1;
STACKTOP=sp;return $50;
default: assert(0, "bad label: " + label);
}
}
function _malloc($bytes){
var label=0;
label = 1;
while(1)switch(label){
case 1:
var $1=($bytes>>>0)<245;
if($1){label=2;break;}else{label=78;break;}
case 2:
var $3=($bytes>>>0)<11;
if($3){var $8=16;label=4;break;}else{label=3;break;}
case 3:
var $5=((($bytes)+(11))|0);
var $6=$5&-8;
var $8=$6;label=4;break;
case 4:
var $8;
var $9=$8>>>3;
var $10=HEAP32[((952)>>2)];
var $11=$10>>>($9>>>0);
var $12=$11&3;
var $13=($12|0)==0;
if($13){label=12;break;}else{label=5;break;}
case 5:
var $15=$11&1;
var $16=$15^1;
var $17=((($16)+($9))|0);
var $18=$17<<1;
var $19=((992+($18<<2))|0);
var $20=$19;
var $_sum110=((($18)+(2))|0);
var $21=((992+($_sum110<<2))|0);
var $22=HEAP32[(($21)>>2)];
var $23=(($22+8)|0);
var $24=HEAP32[(($23)>>2)];
var $25=($20|0)==($24|0);
if($25){label=6;break;}else{label=7;break;}
case 6:
var $27=1<<$17;
var $28=$27^-1;
var $29=$10&$28;
HEAP32[((952)>>2)]=$29;
label=11;break;
case 7:
var $31=$24;
var $32=HEAP32[((968)>>2)];
var $33=($31>>>0)<($32>>>0);
if($33){label=10;break;}else{label=8;break;}
case 8:
var $35=(($24+12)|0);
var $36=HEAP32[(($35)>>2)];
var $37=($36|0)==($22|0);
if($37){label=9;break;}else{label=10;break;}
case 9:
HEAP32[(($35)>>2)]=$20;
HEAP32[(($21)>>2)]=$24;
label=11;break;
case 10:
_abort();
throw "Reached an unreachable!";
case 11:
var $40=$17<<3;
var $41=$40|3;
var $42=(($22+4)|0);
HEAP32[(($42)>>2)]=$41;
var $43=$22;
var $_sum111112=$40|4;
var $44=(($43+$_sum111112)|0);
var $45=$44;
var $46=HEAP32[(($45)>>2)];
var $47=$46|1;
HEAP32[(($45)>>2)]=$47;
var $48=$23;
var $mem_0=$48;label=341;break;
case 12:
var $50=HEAP32[((960)>>2)];
var $51=($8>>>0)>($50>>>0);
if($51){label=13;break;}else{var $nb_0=$8;label=160;break;}
case 13:
var $53=($11|0)==0;
if($53){label=27;break;}else{label=14;break;}
case 14:
var $55=$11<<$9;
var $56=2<<$9;
var $57=(((-$56))|0);
var $58=$56|$57;
var $59=$55&$58;
var $60=(((-$59))|0);
var $61=$59&$60;
var $62=((($61)-(1))|0);
var $63=$62>>>12;
var $64=$63&16;
var $65=$62>>>($64>>>0);
var $66=$65>>>5;
var $67=$66&8;
var $68=$67|$64;
var $69=$65>>>($67>>>0);
var $70=$69>>>2;
var $71=$70&4;
var $72=$68|$71;
var $73=$69>>>($71>>>0);
var $74=$73>>>1;
var $75=$74&2;
var $76=$72|$75;
var $77=$73>>>($75>>>0);
var $78=$77>>>1;
var $79=$78&1;
var $80=$76|$79;
var $81=$77>>>($79>>>0);
var $82=((($80)+($81))|0);
var $83=$82<<1;
var $84=((992+($83<<2))|0);
var $85=$84;
var $_sum104=((($83)+(2))|0);
var $86=((992+($_sum104<<2))|0);
var $87=HEAP32[(($86)>>2)];
var $88=(($87+8)|0);
var $89=HEAP32[(($88)>>2)];
var $90=($85|0)==($89|0);
if($90){label=15;break;}else{label=16;break;}
case 15:
var $92=1<<$82;
var $93=$92^-1;
var $94=$10&$93;
HEAP32[((952)>>2)]=$94;
label=20;break;
case 16:
var $96=$89;
var $97=HEAP32[((968)>>2)];
var $98=($96>>>0)<($97>>>0);
if($98){label=19;break;}else{label=17;break;}
case 17:
var $100=(($89+12)|0);
var $101=HEAP32[(($100)>>2)];
var $102=($101|0)==($87|0);
if($102){label=18;break;}else{label=19;break;}
case 18:
HEAP32[(($100)>>2)]=$85;
HEAP32[(($86)>>2)]=$89;
label=20;break;
case 19:
_abort();
throw "Reached an unreachable!";
case 20:
var $105=$82<<3;
var $106=((($105)-($8))|0);
var $107=$8|3;
var $108=(($87+4)|0);
HEAP32[(($108)>>2)]=$107;
var $109=$87;
var $110=(($109+$8)|0);
var $111=$110;
var $112=$106|1;
var $_sum105106=$8|4;
var $113=(($109+$_sum105106)|0);
var $114=$113;
HEAP32[(($114)>>2)]=$112;
var $115=(($109+$105)|0);
var $116=$115;
HEAP32[(($116)>>2)]=$106;
var $117=HEAP32[((960)>>2)];
var $118=($117|0)==0;
if($118){label=26;break;}else{label=21;break;}
case 21:
var $120=HEAP32[((972)>>2)];
var $121=$117>>>3;
var $122=$121<<1;
var $123=((992+($122<<2))|0);
var $124=$123;
var $125=HEAP32[((952)>>2)];
var $126=1<<$121;
var $127=$125&$126;
var $128=($127|0)==0;
if($128){label=22;break;}else{label=23;break;}
case 22:
var $130=$125|$126;
HEAP32[((952)>>2)]=$130;
var $_sum108_pre=((($122)+(2))|0);
var $_pre=((992+($_sum108_pre<<2))|0);
var $F4_0=$124;var $_pre_phi=$_pre;label=25;break;
case 23:
var $_sum109=((($122)+(2))|0);
var $132=((992+($_sum109<<2))|0);
var $133=HEAP32[(($132)>>2)];
var $134=$133;
var $135=HEAP32[((968)>>2)];
var $136=($134>>>0)<($135>>>0);
if($136){label=24;break;}else{var $F4_0=$133;var $_pre_phi=$132;label=25;break;}
case 24:
_abort();
throw "Reached an unreachable!";
case 25:
var $_pre_phi;
var $F4_0;
HEAP32[(($_pre_phi)>>2)]=$120;
var $139=(($F4_0+12)|0);
HEAP32[(($139)>>2)]=$120;
var $140=(($120+8)|0);
HEAP32[(($140)>>2)]=$F4_0;
var $141=(($120+12)|0);
HEAP32[(($141)>>2)]=$124;
label=26;break;
case 26:
HEAP32[((960)>>2)]=$106;
HEAP32[((972)>>2)]=$111;
var $143=$88;
var $mem_0=$143;label=341;break;
case 27:
var $145=HEAP32[((956)>>2)];
var $146=($145|0)==0;
if($146){var $nb_0=$8;label=160;break;}else{label=28;break;}
case 28:
var $148=(((-$145))|0);
var $149=$145&$148;
var $150=((($149)-(1))|0);
var $151=$150>>>12;
var $152=$151&16;
var $153=$150>>>($152>>>0);
var $154=$153>>>5;
var $155=$154&8;
var $156=$155|$152;
var $157=$153>>>($155>>>0);
var $158=$157>>>2;
var $159=$158&4;
var $160=$156|$159;
var $161=$157>>>($159>>>0);
var $162=$161>>>1;
var $163=$162&2;
var $164=$160|$163;
var $165=$161>>>($163>>>0);
var $166=$165>>>1;
var $167=$166&1;
var $168=$164|$167;
var $169=$165>>>($167>>>0);
var $170=((($168)+($169))|0);
var $171=((1256+($170<<2))|0);
var $172=HEAP32[(($171)>>2)];
var $173=(($172+4)|0);
var $174=HEAP32[(($173)>>2)];
var $175=$174&-8;
var $176=((($175)-($8))|0);
var $t_0_i=$172;var $v_0_i=$172;var $rsize_0_i=$176;label=29;break;
case 29:
var $rsize_0_i;
var $v_0_i;
var $t_0_i;
var $178=(($t_0_i+16)|0);
var $179=HEAP32[(($178)>>2)];
var $180=($179|0)==0;
if($180){label=30;break;}else{var $185=$179;label=31;break;}
case 30:
var $182=(($t_0_i+20)|0);
var $183=HEAP32[(($182)>>2)];
var $184=($183|0)==0;
if($184){label=32;break;}else{var $185=$183;label=31;break;}
case 31:
var $185;
var $186=(($185+4)|0);
var $187=HEAP32[(($186)>>2)];
var $188=$187&-8;
var $189=((($188)-($8))|0);
var $190=($189>>>0)<($rsize_0_i>>>0);
var $_rsize_0_i=($190?$189:$rsize_0_i);
var $_v_0_i=($190?$185:$v_0_i);
var $t_0_i=$185;var $v_0_i=$_v_0_i;var $rsize_0_i=$_rsize_0_i;label=29;break;
case 32:
var $192=$v_0_i;
var $193=HEAP32[((968)>>2)];
var $194=($192>>>0)<($193>>>0);
if($194){label=76;break;}else{label=33;break;}
case 33:
var $196=(($192+$8)|0);
var $197=$196;
var $198=($192>>>0)<($196>>>0);
if($198){label=34;break;}else{label=76;break;}
case 34:
var $200=(($v_0_i+24)|0);
var $201=HEAP32[(($200)>>2)];
var $202=(($v_0_i+12)|0);
var $203=HEAP32[(($202)>>2)];
var $204=($203|0)==($v_0_i|0);
if($204){label=40;break;}else{label=35;break;}
case 35:
var $206=(($v_0_i+8)|0);
var $207=HEAP32[(($206)>>2)];
var $208=$207;
var $209=($208>>>0)<($193>>>0);
if($209){label=39;break;}else{label=36;break;}
case 36:
var $211=(($207+12)|0);
var $212=HEAP32[(($211)>>2)];
var $213=($212|0)==($v_0_i|0);
if($213){label=37;break;}else{label=39;break;}
case 37:
var $215=(($203+8)|0);
var $216=HEAP32[(($215)>>2)];
var $217=($216|0)==($v_0_i|0);
if($217){label=38;break;}else{label=39;break;}
case 38:
HEAP32[(($211)>>2)]=$203;
HEAP32[(($215)>>2)]=$207;
var $R_1_i=$203;label=47;break;
case 39:
_abort();
throw "Reached an unreachable!";
case 40:
var $220=(($v_0_i+20)|0);
var $221=HEAP32[(($220)>>2)];
var $222=($221|0)==0;
if($222){label=41;break;}else{var $R_0_i=$221;var $RP_0_i=$220;label=42;break;}
case 41:
var $224=(($v_0_i+16)|0);
var $225=HEAP32[(($224)>>2)];
var $226=($225|0)==0;
if($226){var $R_1_i=0;label=47;break;}else{var $R_0_i=$225;var $RP_0_i=$224;label=42;break;}
case 42:
var $RP_0_i;
var $R_0_i;
var $227=(($R_0_i+20)|0);
var $228=HEAP32[(($227)>>2)];
var $229=($228|0)==0;
if($229){label=43;break;}else{var $R_0_i=$228;var $RP_0_i=$227;label=42;break;}
case 43:
var $231=(($R_0_i+16)|0);
var $232=HEAP32[(($231)>>2)];
var $233=($232|0)==0;
if($233){label=44;break;}else{var $R_0_i=$232;var $RP_0_i=$231;label=42;break;}
case 44:
var $235=$RP_0_i;
var $236=($235>>>0)<($193>>>0);
if($236){label=46;break;}else{label=45;break;}
case 45:
HEAP32[(($RP_0_i)>>2)]=0;
var $R_1_i=$R_0_i;label=47;break;
case 46:
_abort();
throw "Reached an unreachable!";
case 47:
var $R_1_i;
var $240=($201|0)==0;
if($240){label=67;break;}else{label=48;break;}
case 48:
var $242=(($v_0_i+28)|0);
var $243=HEAP32[(($242)>>2)];
var $244=((1256+($243<<2))|0);
var $245=HEAP32[(($244)>>2)];
var $246=($v_0_i|0)==($245|0);
if($246){label=49;break;}else{label=51;break;}
case 49:
HEAP32[(($244)>>2)]=$R_1_i;
var $cond_i=($R_1_i|0)==0;
if($cond_i){label=50;break;}else{label=57;break;}
case 50:
var $248=HEAP32[(($242)>>2)];
var $249=1<<$248;
var $250=$249^-1;
var $251=HEAP32[((956)>>2)];
var $252=$251&$250;
HEAP32[((956)>>2)]=$252;
label=67;break;
case 51:
var $254=$201;
var $255=HEAP32[((968)>>2)];
var $256=($254>>>0)<($255>>>0);
if($256){label=55;break;}else{label=52;break;}
case 52:
var $258=(($201+16)|0);
var $259=HEAP32[(($258)>>2)];
var $260=($259|0)==($v_0_i|0);
if($260){label=53;break;}else{label=54;break;}
case 53:
HEAP32[(($258)>>2)]=$R_1_i;
label=56;break;
case 54:
var $263=(($201+20)|0);
HEAP32[(($263)>>2)]=$R_1_i;
label=56;break;
case 55:
_abort();
throw "Reached an unreachable!";
case 56:
var $266=($R_1_i|0)==0;
if($266){label=67;break;}else{label=57;break;}
case 57:
var $268=$R_1_i;
var $269=HEAP32[((968)>>2)];
var $270=($268>>>0)<($269>>>0);
if($270){label=66;break;}else{label=58;break;}
case 58:
var $272=(($R_1_i+24)|0);
HEAP32[(($272)>>2)]=$201;
var $273=(($v_0_i+16)|0);
var $274=HEAP32[(($273)>>2)];
var $275=($274|0)==0;
if($275){label=62;break;}else{label=59;break;}
case 59:
var $277=$274;
var $278=HEAP32[((968)>>2)];
var $279=($277>>>0)<($278>>>0);
if($279){label=61;break;}else{label=60;break;}
case 60:
var $281=(($R_1_i+16)|0);
HEAP32[(($281)>>2)]=$274;
var $282=(($274+24)|0);
HEAP32[(($282)>>2)]=$R_1_i;
label=62;break;
case 61:
_abort();
throw "Reached an unreachable!";
case 62:
var $285=(($v_0_i+20)|0);
var $286=HEAP32[(($285)>>2)];
var $287=($286|0)==0;
if($287){label=67;break;}else{label=63;break;}
case 63:
var $289=$286;
var $290=HEAP32[((968)>>2)];
var $291=($289>>>0)<($290>>>0);
if($291){label=65;break;}else{label=64;break;}
case 64:
var $293=(($R_1_i+20)|0);
HEAP32[(($293)>>2)]=$286;
var $294=(($286+24)|0);
HEAP32[(($294)>>2)]=$R_1_i;
label=67;break;
case 65:
_abort();
throw "Reached an unreachable!";
case 66:
_abort();
throw "Reached an unreachable!";
case 67:
var $298=($rsize_0_i>>>0)<16;
if($298){label=68;break;}else{label=69;break;}
case 68:
var $300=((($rsize_0_i)+($8))|0);
var $301=$300|3;
var $302=(($v_0_i+4)|0);
HEAP32[(($302)>>2)]=$301;
var $_sum4_i=((($300)+(4))|0);
var $303=(($192+$_sum4_i)|0);
var $304=$303;
var $305=HEAP32[(($304)>>2)];
var $306=$305|1;
HEAP32[(($304)>>2)]=$306;
label=77;break;
case 69:
var $308=$8|3;
var $309=(($v_0_i+4)|0);
HEAP32[(($309)>>2)]=$308;
var $310=$rsize_0_i|1;
var $_sum_i135=$8|4;
var $311=(($192+$_sum_i135)|0);
var $312=$311;
HEAP32[(($312)>>2)]=$310;
var $_sum1_i=((($rsize_0_i)+($8))|0);
var $313=(($192+$_sum1_i)|0);
var $314=$313;
HEAP32[(($314)>>2)]=$rsize_0_i;
var $315=HEAP32[((960)>>2)];
var $316=($315|0)==0;
if($316){label=75;break;}else{label=70;break;}
case 70:
var $318=HEAP32[((972)>>2)];
var $319=$315>>>3;
var $320=$319<<1;
var $321=((992+($320<<2))|0);
var $322=$321;
var $323=HEAP32[((952)>>2)];
var $324=1<<$319;
var $325=$323&$324;
var $326=($325|0)==0;
if($326){label=71;break;}else{label=72;break;}
case 71:
var $328=$323|$324;
HEAP32[((952)>>2)]=$328;
var $_sum2_pre_i=((($320)+(2))|0);
var $_pre_i=((992+($_sum2_pre_i<<2))|0);
var $F1_0_i=$322;var $_pre_phi_i=$_pre_i;label=74;break;
case 72:
var $_sum3_i=((($320)+(2))|0);
var $330=((992+($_sum3_i<<2))|0);
var $331=HEAP32[(($330)>>2)];
var $332=$331;
var $333=HEAP32[((968)>>2)];
var $334=($332>>>0)<($333>>>0);
if($334){label=73;break;}else{var $F1_0_i=$331;var $_pre_phi_i=$330;label=74;break;}
case 73:
_abort();
throw "Reached an unreachable!";
case 74:
var $_pre_phi_i;
var $F1_0_i;
HEAP32[(($_pre_phi_i)>>2)]=$318;
var $337=(($F1_0_i+12)|0);
HEAP32[(($337)>>2)]=$318;
var $338=(($318+8)|0);
HEAP32[(($338)>>2)]=$F1_0_i;
var $339=(($318+12)|0);
HEAP32[(($339)>>2)]=$322;
label=75;break;
case 75:
HEAP32[((960)>>2)]=$rsize_0_i;
HEAP32[((972)>>2)]=$197;
label=77;break;
case 76:
_abort();
throw "Reached an unreachable!";
case 77:
var $342=(($v_0_i+8)|0);
var $343=$342;
var $344=($342|0)==0;
if($344){var $nb_0=$8;label=160;break;}else{var $mem_0=$343;label=341;break;}
case 78:
var $346=($bytes>>>0)>4294967231;
if($346){var $nb_0=-1;label=160;break;}else{label=79;break;}
case 79:
var $348=((($bytes)+(11))|0);
var $349=$348&-8;
var $350=HEAP32[((956)>>2)];
var $351=($350|0)==0;
if($351){var $nb_0=$349;label=160;break;}else{label=80;break;}
case 80:
var $353=(((-$349))|0);
var $354=$348>>>8;
var $355=($354|0)==0;
if($355){var $idx_0_i=0;label=83;break;}else{label=81;break;}
case 81:
var $357=($349>>>0)>16777215;
if($357){var $idx_0_i=31;label=83;break;}else{label=82;break;}
case 82:
var $359=((($354)+(1048320))|0);
var $360=$359>>>16;
var $361=$360&8;
var $362=$354<<$361;
var $363=((($362)+(520192))|0);
var $364=$363>>>16;
var $365=$364&4;
var $366=$365|$361;
var $367=$362<<$365;
var $368=((($367)+(245760))|0);
var $369=$368>>>16;
var $370=$369&2;
var $371=$366|$370;
var $372=(((14)-($371))|0);
var $373=$367<<$370;
var $374=$373>>>15;
var $375=((($372)+($374))|0);
var $376=$375<<1;
var $377=((($375)+(7))|0);
var $378=$349>>>($377>>>0);
var $379=$378&1;
var $380=$379|$376;
var $idx_0_i=$380;label=83;break;
case 83:
var $idx_0_i;
var $382=((1256+($idx_0_i<<2))|0);
var $383=HEAP32[(($382)>>2)];
var $384=($383|0)==0;
if($384){var $v_2_i=0;var $rsize_2_i=$353;var $t_1_i=0;label=90;break;}else{label=84;break;}
case 84:
var $386=($idx_0_i|0)==31;
if($386){var $391=0;label=86;break;}else{label=85;break;}
case 85:
var $388=$idx_0_i>>>1;
var $389=(((25)-($388))|0);
var $391=$389;label=86;break;
case 86:
var $391;
var $392=$349<<$391;
var $v_0_i116=0;var $rsize_0_i115=$353;var $t_0_i114=$383;var $sizebits_0_i=$392;var $rst_0_i=0;label=87;break;
case 87:
var $rst_0_i;
var $sizebits_0_i;
var $t_0_i114;
var $rsize_0_i115;
var $v_0_i116;
var $394=(($t_0_i114+4)|0);
var $395=HEAP32[(($394)>>2)];
var $396=$395&-8;
var $397=((($396)-($349))|0);
var $398=($397>>>0)<($rsize_0_i115>>>0);
if($398){label=88;break;}else{var $v_1_i=$v_0_i116;var $rsize_1_i=$rsize_0_i115;label=89;break;}
case 88:
var $400=($396|0)==($349|0);
if($400){var $v_2_i=$t_0_i114;var $rsize_2_i=$397;var $t_1_i=$t_0_i114;label=90;break;}else{var $v_1_i=$t_0_i114;var $rsize_1_i=$397;label=89;break;}
case 89:
var $rsize_1_i;
var $v_1_i;
var $402=(($t_0_i114+20)|0);
var $403=HEAP32[(($402)>>2)];
var $404=$sizebits_0_i>>>31;
var $405=(($t_0_i114+16+($404<<2))|0);
var $406=HEAP32[(($405)>>2)];
var $407=($403|0)==0;
var $408=($403|0)==($406|0);
var $or_cond_i=$407|$408;
var $rst_1_i=($or_cond_i?$rst_0_i:$403);
var $409=($406|0)==0;
var $410=$sizebits_0_i<<1;
if($409){var $v_2_i=$v_1_i;var $rsize_2_i=$rsize_1_i;var $t_1_i=$rst_1_i;label=90;break;}else{var $v_0_i116=$v_1_i;var $rsize_0_i115=$rsize_1_i;var $t_0_i114=$406;var $sizebits_0_i=$410;var $rst_0_i=$rst_1_i;label=87;break;}
case 90:
var $t_1_i;
var $rsize_2_i;
var $v_2_i;
var $411=($t_1_i|0)==0;
var $412=($v_2_i|0)==0;
var $or_cond19_i=$411&$412;
if($or_cond19_i){label=91;break;}else{var $t_2_ph_i=$t_1_i;label=93;break;}
case 91:
var $414=2<<$idx_0_i;
var $415=(((-$414))|0);
var $416=$414|$415;
var $417=$350&$416;
var $418=($417|0)==0;
if($418){var $nb_0=$349;label=160;break;}else{label=92;break;}
case 92:
var $420=(((-$417))|0);
var $421=$417&$420;
var $422=((($421)-(1))|0);
var $423=$422>>>12;
var $424=$423&16;
var $425=$422>>>($424>>>0);
var $426=$425>>>5;
var $427=$426&8;
var $428=$427|$424;
var $429=$425>>>($427>>>0);
var $430=$429>>>2;
var $431=$430&4;
var $432=$428|$431;
var $433=$429>>>($431>>>0);
var $434=$433>>>1;
var $435=$434&2;
var $436=$432|$435;
var $437=$433>>>($435>>>0);
var $438=$437>>>1;
var $439=$438&1;
var $440=$436|$439;
var $441=$437>>>($439>>>0);
var $442=((($440)+($441))|0);
var $443=((1256+($442<<2))|0);
var $444=HEAP32[(($443)>>2)];
var $t_2_ph_i=$444;label=93;break;
case 93:
var $t_2_ph_i;
var $445=($t_2_ph_i|0)==0;
if($445){var $rsize_3_lcssa_i=$rsize_2_i;var $v_3_lcssa_i=$v_2_i;label=96;break;}else{var $t_226_i=$t_2_ph_i;var $rsize_327_i=$rsize_2_i;var $v_328_i=$v_2_i;label=94;break;}
case 94:
var $v_328_i;
var $rsize_327_i;
var $t_226_i;
var $446=(($t_226_i+4)|0);
var $447=HEAP32[(($446)>>2)];
var $448=$447&-8;
var $449=((($448)-($349))|0);
var $450=($449>>>0)<($rsize_327_i>>>0);
var $_rsize_3_i=($450?$449:$rsize_327_i);
var $t_2_v_3_i=($450?$t_226_i:$v_328_i);
var $451=(($t_226_i+16)|0);
var $452=HEAP32[(($451)>>2)];
var $453=($452|0)==0;
if($453){label=95;break;}else{var $t_226_i=$452;var $rsize_327_i=$_rsize_3_i;var $v_328_i=$t_2_v_3_i;label=94;break;}
case 95:
var $454=(($t_226_i+20)|0);
var $455=HEAP32[(($454)>>2)];
var $456=($455|0)==0;
if($456){var $rsize_3_lcssa_i=$_rsize_3_i;var $v_3_lcssa_i=$t_2_v_3_i;label=96;break;}else{var $t_226_i=$455;var $rsize_327_i=$_rsize_3_i;var $v_328_i=$t_2_v_3_i;label=94;break;}
case 96:
var $v_3_lcssa_i;
var $rsize_3_lcssa_i;
var $457=($v_3_lcssa_i|0)==0;
if($457){var $nb_0=$349;label=160;break;}else{label=97;break;}
case 97:
var $459=HEAP32[((960)>>2)];
var $460=((($459)-($349))|0);
var $461=($rsize_3_lcssa_i>>>0)<($460>>>0);
if($461){label=98;break;}else{var $nb_0=$349;label=160;break;}
case 98:
var $463=$v_3_lcssa_i;
var $464=HEAP32[((968)>>2)];
var $465=($463>>>0)<($464>>>0);
if($465){label=158;break;}else{label=99;break;}
case 99:
var $467=(($463+$349)|0);
var $468=$467;
var $469=($463>>>0)<($467>>>0);
if($469){label=100;break;}else{label=158;break;}
case 100:
var $471=(($v_3_lcssa_i+24)|0);
var $472=HEAP32[(($471)>>2)];
var $473=(($v_3_lcssa_i+12)|0);
var $474=HEAP32[(($473)>>2)];
var $475=($474|0)==($v_3_lcssa_i|0);
if($475){label=106;break;}else{label=101;break;}
case 101:
var $477=(($v_3_lcssa_i+8)|0);
var $478=HEAP32[(($477)>>2)];
var $479=$478;
var $480=($479>>>0)<($464>>>0);
if($480){label=105;break;}else{label=102;break;}
case 102:
var $482=(($478+12)|0);
var $483=HEAP32[(($482)>>2)];
var $484=($483|0)==($v_3_lcssa_i|0);
if($484){label=103;break;}else{label=105;break;}
case 103:
var $486=(($474+8)|0);
var $487=HEAP32[(($486)>>2)];
var $488=($487|0)==($v_3_lcssa_i|0);
if($488){label=104;break;}else{label=105;break;}
case 104:
HEAP32[(($482)>>2)]=$474;
HEAP32[(($486)>>2)]=$478;
var $R_1_i120=$474;label=113;break;
case 105:
_abort();
throw "Reached an unreachable!";
case 106:
var $491=(($v_3_lcssa_i+20)|0);
var $492=HEAP32[(($491)>>2)];
var $493=($492|0)==0;
if($493){label=107;break;}else{var $R_0_i118=$492;var $RP_0_i117=$491;label=108;break;}
case 107:
var $495=(($v_3_lcssa_i+16)|0);
var $496=HEAP32[(($495)>>2)];
var $497=($496|0)==0;
if($497){var $R_1_i120=0;label=113;break;}else{var $R_0_i118=$496;var $RP_0_i117=$495;label=108;break;}
case 108:
var $RP_0_i117;
var $R_0_i118;
var $498=(($R_0_i118+20)|0);
var $499=HEAP32[(($498)>>2)];
var $500=($499|0)==0;
if($500){label=109;break;}else{var $R_0_i118=$499;var $RP_0_i117=$498;label=108;break;}
case 109:
var $502=(($R_0_i118+16)|0);
var $503=HEAP32[(($502)>>2)];
var $504=($503|0)==0;
if($504){label=110;break;}else{var $R_0_i118=$503;var $RP_0_i117=$502;label=108;break;}
case 110:
var $506=$RP_0_i117;
var $507=($506>>>0)<($464>>>0);
if($507){label=112;break;}else{label=111;break;}
case 111:
HEAP32[(($RP_0_i117)>>2)]=0;
var $R_1_i120=$R_0_i118;label=113;break;
case 112:
_abort();
throw "Reached an unreachable!";
case 113:
var $R_1_i120;
var $511=($472|0)==0;
if($511){label=133;break;}else{label=114;break;}
case 114:
var $513=(($v_3_lcssa_i+28)|0);
var $514=HEAP32[(($513)>>2)];
var $515=((1256+($514<<2))|0);
var $516=HEAP32[(($515)>>2)];
var $517=($v_3_lcssa_i|0)==($516|0);
if($517){label=115;break;}else{label=117;break;}
case 115:
HEAP32[(($515)>>2)]=$R_1_i120;
var $cond_i121=($R_1_i120|0)==0;
if($cond_i121){label=116;break;}else{label=123;break;}
case 116:
var $519=HEAP32[(($513)>>2)];
var $520=1<<$519;
var $521=$520^-1;
var $522=HEAP32[((956)>>2)];
var $523=$522&$521;
HEAP32[((956)>>2)]=$523;
label=133;break;
case 117:
var $525=$472;
var $526=HEAP32[((968)>>2)];
var $527=($525>>>0)<($526>>>0);
if($527){label=121;break;}else{label=118;break;}
case 118:
var $529=(($472+16)|0);
var $530=HEAP32[(($529)>>2)];
var $531=($530|0)==($v_3_lcssa_i|0);
if($531){label=119;break;}else{label=120;break;}
case 119:
HEAP32[(($529)>>2)]=$R_1_i120;
label=122;break;
case 120:
var $534=(($472+20)|0);
HEAP32[(($534)>>2)]=$R_1_i120;
label=122;break;
case 121:
_abort();
throw "Reached an unreachable!";
case 122:
var $537=($R_1_i120|0)==0;
if($537){label=133;break;}else{label=123;break;}
case 123:
var $539=$R_1_i120;
var $540=HEAP32[((968)>>2)];
var $541=($539>>>0)<($540>>>0);
if($541){label=132;break;}else{label=124;break;}
case 124:
var $543=(($R_1_i120+24)|0);
HEAP32[(($543)>>2)]=$472;
var $544=(($v_3_lcssa_i+16)|0);
var $545=HEAP32[(($544)>>2)];
var $546=($545|0)==0;
if($546){label=128;break;}else{label=125;break;}
case 125:
var $548=$545;
var $549=HEAP32[((968)>>2)];
var $550=($548>>>0)<($549>>>0);
if($550){label=127;break;}else{label=126;break;}
case 126:
var $552=(($R_1_i120+16)|0);
HEAP32[(($552)>>2)]=$545;
var $553=(($545+24)|0);
HEAP32[(($553)>>2)]=$R_1_i120;
label=128;break;
case 127:
_abort();
throw "Reached an unreachable!";
case 128:
var $556=(($v_3_lcssa_i+20)|0);
var $557=HEAP32[(($556)>>2)];
var $558=($557|0)==0;
if($558){label=133;break;}else{label=129;break;}
case 129:
var $560=$557;
var $561=HEAP32[((968)>>2)];
var $562=($560>>>0)<($561>>>0);
if($562){label=131;break;}else{label=130;break;}
case 130:
var $564=(($R_1_i120+20)|0);
HEAP32[(($564)>>2)]=$557;
var $565=(($557+24)|0);
HEAP32[(($565)>>2)]=$R_1_i120;
label=133;break;
case 131:
_abort();
throw "Reached an unreachable!";
case 132:
_abort();
throw "Reached an unreachable!";
case 133:
var $569=($rsize_3_lcssa_i>>>0)<16;
if($569){label=134;break;}else{label=135;break;}
case 134:
var $571=((($rsize_3_lcssa_i)+($349))|0);
var $572=$571|3;
var $573=(($v_3_lcssa_i+4)|0);
HEAP32[(($573)>>2)]=$572;
var $_sum18_i=((($571)+(4))|0);
var $574=(($463+$_sum18_i)|0);
var $575=$574;
var $576=HEAP32[(($575)>>2)];
var $577=$576|1;
HEAP32[(($575)>>2)]=$577;
label=159;break;
case 135:
var $579=$349|3;
var $580=(($v_3_lcssa_i+4)|0);
HEAP32[(($580)>>2)]=$579;
var $581=$rsize_3_lcssa_i|1;
var $_sum_i123134=$349|4;
var $582=(($463+$_sum_i123134)|0);
var $583=$582;
HEAP32[(($583)>>2)]=$581;
var $_sum1_i124=((($rsize_3_lcssa_i)+($349))|0);
var $584=(($463+$_sum1_i124)|0);
var $585=$584;
HEAP32[(($585)>>2)]=$rsize_3_lcssa_i;
var $586=$rsize_3_lcssa_i>>>3;
var $587=($rsize_3_lcssa_i>>>0)<256;
if($587){label=136;break;}else{label=141;break;}
case 136:
var $589=$586<<1;
var $590=((992+($589<<2))|0);
var $591=$590;
var $592=HEAP32[((952)>>2)];
var $593=1<<$586;
var $594=$592&$593;
var $595=($594|0)==0;
if($595){label=137;break;}else{label=138;break;}
case 137:
var $597=$592|$593;
HEAP32[((952)>>2)]=$597;
var $_sum14_pre_i=((($589)+(2))|0);
var $_pre_i125=((992+($_sum14_pre_i<<2))|0);
var $F5_0_i=$591;var $_pre_phi_i126=$_pre_i125;label=140;break;
case 138:
var $_sum17_i=((($589)+(2))|0);
var $599=((992+($_sum17_i<<2))|0);
var $600=HEAP32[(($599)>>2)];
var $601=$600;
var $602=HEAP32[((968)>>2)];
var $603=($601>>>0)<($602>>>0);
if($603){label=139;break;}else{var $F5_0_i=$600;var $_pre_phi_i126=$599;label=140;break;}
case 139:
_abort();
throw "Reached an unreachable!";
case 140:
var $_pre_phi_i126;
var $F5_0_i;
HEAP32[(($_pre_phi_i126)>>2)]=$468;
var $606=(($F5_0_i+12)|0);
HEAP32[(($606)>>2)]=$468;
var $_sum15_i=((($349)+(8))|0);
var $607=(($463+$_sum15_i)|0);
var $608=$607;
HEAP32[(($608)>>2)]=$F5_0_i;
var $_sum16_i=((($349)+(12))|0);
var $609=(($463+$_sum16_i)|0);
var $610=$609;
HEAP32[(($610)>>2)]=$591;
label=159;break;
case 141:
var $612=$467;
var $613=$rsize_3_lcssa_i>>>8;
var $614=($613|0)==0;
if($614){var $I7_0_i=0;label=144;break;}else{label=142;break;}
case 142:
var $616=($rsize_3_lcssa_i>>>0)>16777215;
if($616){var $I7_0_i=31;label=144;break;}else{label=143;break;}
case 143:
var $618=((($613)+(1048320))|0);
var $619=$618>>>16;
var $620=$619&8;
var $621=$613<<$620;
var $622=((($621)+(520192))|0);
var $623=$622>>>16;
var $624=$623&4;
var $625=$624|$620;
var $626=$621<<$624;
var $627=((($626)+(245760))|0);
var $628=$627>>>16;
var $629=$628&2;
var $630=$625|$629;
var $631=(((14)-($630))|0);
var $632=$626<<$629;
var $633=$632>>>15;
var $634=((($631)+($633))|0);
var $635=$634<<1;
var $636=((($634)+(7))|0);
var $637=$rsize_3_lcssa_i>>>($636>>>0);
var $638=$637&1;
var $639=$638|$635;
var $I7_0_i=$639;label=144;break;
case 144:
var $I7_0_i;
var $641=((1256+($I7_0_i<<2))|0);
var $_sum2_i=((($349)+(28))|0);
var $642=(($463+$_sum2_i)|0);
var $643=$642;
HEAP32[(($643)>>2)]=$I7_0_i;
var $_sum3_i127=((($349)+(16))|0);
var $644=(($463+$_sum3_i127)|0);
var $_sum4_i128=((($349)+(20))|0);
var $645=(($463+$_sum4_i128)|0);
var $646=$645;
HEAP32[(($646)>>2)]=0;
var $647=$644;
HEAP32[(($647)>>2)]=0;
var $648=HEAP32[((956)>>2)];
var $649=1<<$I7_0_i;
var $650=$648&$649;
var $651=($650|0)==0;
if($651){label=145;break;}else{label=146;break;}
case 145:
var $653=$648|$649;
HEAP32[((956)>>2)]=$653;
HEAP32[(($641)>>2)]=$612;
var $654=$641;
var $_sum5_i=((($349)+(24))|0);
var $655=(($463+$_sum5_i)|0);
var $656=$655;
HEAP32[(($656)>>2)]=$654;
var $_sum6_i=((($349)+(12))|0);
var $657=(($463+$_sum6_i)|0);
var $658=$657;
HEAP32[(($658)>>2)]=$612;
var $_sum7_i=((($349)+(8))|0);
var $659=(($463+$_sum7_i)|0);
var $660=$659;
HEAP32[(($660)>>2)]=$612;
label=159;break;
case 146:
var $662=HEAP32[(($641)>>2)];
var $663=($I7_0_i|0)==31;
if($663){var $668=0;label=148;break;}else{label=147;break;}
case 147:
var $665=$I7_0_i>>>1;
var $666=(((25)-($665))|0);
var $668=$666;label=148;break;
case 148:
var $668;
var $669=$rsize_3_lcssa_i<<$668;
var $K12_0_i=$669;var $T_0_i=$662;label=149;break;
case 149:
var $T_0_i;
var $K12_0_i;
var $671=(($T_0_i+4)|0);
var $672=HEAP32[(($671)>>2)];
var $673=$672&-8;
var $674=($673|0)==($rsize_3_lcssa_i|0);
if($674){label=154;break;}else{label=150;break;}
case 150:
var $676=$K12_0_i>>>31;
var $677=(($T_0_i+16+($676<<2))|0);
var $678=HEAP32[(($677)>>2)];
var $679=($678|0)==0;
var $680=$K12_0_i<<1;
if($679){label=151;break;}else{var $K12_0_i=$680;var $T_0_i=$678;label=149;break;}
case 151:
var $682=$677;
var $683=HEAP32[((968)>>2)];
var $684=($682>>>0)<($683>>>0);
if($684){label=153;break;}else{label=152;break;}
case 152:
HEAP32[(($677)>>2)]=$612;
var $_sum11_i=((($349)+(24))|0);
var $686=(($463+$_sum11_i)|0);
var $687=$686;
HEAP32[(($687)>>2)]=$T_0_i;
var $_sum12_i=((($349)+(12))|0);
var $688=(($463+$_sum12_i)|0);
var $689=$688;
HEAP32[(($689)>>2)]=$612;
var $_sum13_i=((($349)+(8))|0);
var $690=(($463+$_sum13_i)|0);
var $691=$690;
HEAP32[(($691)>>2)]=$612;
label=159;break;
case 153:
_abort();
throw "Reached an unreachable!";
case 154:
var $694=(($T_0_i+8)|0);
var $695=HEAP32[(($694)>>2)];
var $696=$T_0_i;
var $697=HEAP32[((968)>>2)];
var $698=($696>>>0)<($697>>>0);
if($698){label=157;break;}else{label=155;break;}
case 155:
var $700=$695;
var $701=($700>>>0)<($697>>>0);
if($701){label=157;break;}else{label=156;break;}
case 156:
var $703=(($695+12)|0);
HEAP32[(($703)>>2)]=$612;
HEAP32[(($694)>>2)]=$612;
var $_sum8_i=((($349)+(8))|0);
var $704=(($463+$_sum8_i)|0);
var $705=$704;
HEAP32[(($705)>>2)]=$695;
var $_sum9_i=((($349)+(12))|0);
var $706=(($463+$_sum9_i)|0);
var $707=$706;
HEAP32[(($707)>>2)]=$T_0_i;
var $_sum10_i=((($349)+(24))|0);
var $708=(($463+$_sum10_i)|0);
var $709=$708;
HEAP32[(($709)>>2)]=0;
label=159;break;
case 157:
_abort();
throw "Reached an unreachable!";
case 158:
_abort();
throw "Reached an unreachable!";
case 159:
var $711=(($v_3_lcssa_i+8)|0);
var $712=$711;
var $713=($711|0)==0;
if($713){var $nb_0=$349;label=160;break;}else{var $mem_0=$712;label=341;break;}
case 160:
var $nb_0;
var $714=HEAP32[((960)>>2)];
var $715=($nb_0>>>0)>($714>>>0);
if($715){label=165;break;}else{label=161;break;}
case 161:
var $717=((($714)-($nb_0))|0);
var $718=HEAP32[((972)>>2)];
var $719=($717>>>0)>15;
if($719){label=162;break;}else{label=163;break;}
case 162:
var $721=$718;
var $722=(($721+$nb_0)|0);
var $723=$722;
HEAP32[((972)>>2)]=$723;
HEAP32[((960)>>2)]=$717;
var $724=$717|1;
var $_sum102=((($nb_0)+(4))|0);
var $725=(($721+$_sum102)|0);
var $726=$725;
HEAP32[(($726)>>2)]=$724;
var $727=(($721+$714)|0);
var $728=$727;
HEAP32[(($728)>>2)]=$717;
var $729=$nb_0|3;
var $730=(($718+4)|0);
HEAP32[(($730)>>2)]=$729;
label=164;break;
case 163:
HEAP32[((960)>>2)]=0;
HEAP32[((972)>>2)]=0;
var $732=$714|3;
var $733=(($718+4)|0);
HEAP32[(($733)>>2)]=$732;
var $734=$718;
var $_sum101=((($714)+(4))|0);
var $735=(($734+$_sum101)|0);
var $736=$735;
var $737=HEAP32[(($736)>>2)];
var $738=$737|1;
HEAP32[(($736)>>2)]=$738;
label=164;break;
case 164:
var $740=(($718+8)|0);
var $741=$740;
var $mem_0=$741;label=341;break;
case 165:
var $743=HEAP32[((964)>>2)];
var $744=($nb_0>>>0)<($743>>>0);
if($744){label=166;break;}else{label=167;break;}
case 166:
var $746=((($743)-($nb_0))|0);
HEAP32[((964)>>2)]=$746;
var $747=HEAP32[((976)>>2)];
var $748=$747;
var $749=(($748+$nb_0)|0);
var $750=$749;
HEAP32[((976)>>2)]=$750;
var $751=$746|1;
var $_sum=((($nb_0)+(4))|0);
var $752=(($748+$_sum)|0);
var $753=$752;
HEAP32[(($753)>>2)]=$751;
var $754=$nb_0|3;
var $755=(($747+4)|0);
HEAP32[(($755)>>2)]=$754;
var $756=(($747+8)|0);
var $757=$756;
var $mem_0=$757;label=341;break;
case 167:
var $759=HEAP32[((928)>>2)];
var $760=($759|0)==0;
if($760){label=168;break;}else{label=171;break;}
case 168:
var $762=_sysconf(30);
var $763=((($762)-(1))|0);
var $764=$763&$762;
var $765=($764|0)==0;
if($765){label=170;break;}else{label=169;break;}
case 169:
_abort();
throw "Reached an unreachable!";
case 170:
HEAP32[((936)>>2)]=$762;
HEAP32[((932)>>2)]=$762;
HEAP32[((940)>>2)]=-1;
HEAP32[((944)>>2)]=-1;
HEAP32[((948)>>2)]=0;
HEAP32[((1396)>>2)]=0;
var $767=_time(0);
var $768=$767&-16;
var $769=$768^1431655768;
HEAP32[((928)>>2)]=$769;
label=171;break;
case 171:
var $771=((($nb_0)+(48))|0);
var $772=HEAP32[((936)>>2)];
var $773=((($nb_0)+(47))|0);
var $774=((($772)+($773))|0);
var $775=(((-$772))|0);
var $776=$774&$775;
var $777=($776>>>0)>($nb_0>>>0);
if($777){label=172;break;}else{var $mem_0=0;label=341;break;}
case 172:
var $779=HEAP32[((1392)>>2)];
var $780=($779|0)==0;
if($780){label=174;break;}else{label=173;break;}
case 173:
var $782=HEAP32[((1384)>>2)];
var $783=((($782)+($776))|0);
var $784=($783>>>0)<=($782>>>0);
var $785=($783>>>0)>($779>>>0);
var $or_cond1_i=$784|$785;
if($or_cond1_i){var $mem_0=0;label=341;break;}else{label=174;break;}
case 174:
var $787=HEAP32[((1396)>>2)];
var $788=$787&4;
var $789=($788|0)==0;
if($789){label=175;break;}else{var $tsize_1_i=0;label=198;break;}
case 175:
var $791=HEAP32[((976)>>2)];
var $792=($791|0)==0;
if($792){label=181;break;}else{label=176;break;}
case 176:
var $794=$791;
var $sp_0_i_i=1400;label=177;break;
case 177:
var $sp_0_i_i;
var $796=(($sp_0_i_i)|0);
var $797=HEAP32[(($796)>>2)];
var $798=($797>>>0)>($794>>>0);
if($798){label=179;break;}else{label=178;break;}
case 178:
var $800=(($sp_0_i_i+4)|0);
var $801=HEAP32[(($800)>>2)];
var $802=(($797+$801)|0);
var $803=($802>>>0)>($794>>>0);
if($803){label=180;break;}else{label=179;break;}
case 179:
var $805=(($sp_0_i_i+8)|0);
var $806=HEAP32[(($805)>>2)];
var $807=($806|0)==0;
if($807){label=181;break;}else{var $sp_0_i_i=$806;label=177;break;}
case 180:
var $808=($sp_0_i_i|0)==0;
if($808){label=181;break;}else{label=188;break;}
case 181:
var $809=_sbrk(0);
var $810=($809|0)==-1;
if($810){var $tsize_0303639_i=0;label=197;break;}else{label=182;break;}
case 182:
var $812=$809;
var $813=HEAP32[((932)>>2)];
var $814=((($813)-(1))|0);
var $815=$814&$812;
var $816=($815|0)==0;
if($816){var $ssize_0_i=$776;label=184;break;}else{label=183;break;}
case 183:
var $818=((($814)+($812))|0);
var $819=(((-$813))|0);
var $820=$818&$819;
var $821=((($776)-($812))|0);
var $822=((($821)+($820))|0);
var $ssize_0_i=$822;label=184;break;
case 184:
var $ssize_0_i;
var $824=HEAP32[((1384)>>2)];
var $825=((($824)+($ssize_0_i))|0);
var $826=($ssize_0_i>>>0)>($nb_0>>>0);
var $827=($ssize_0_i>>>0)<2147483647;
var $or_cond_i129=$826&$827;
if($or_cond_i129){label=185;break;}else{var $tsize_0303639_i=0;label=197;break;}
case 185:
var $829=HEAP32[((1392)>>2)];
var $830=($829|0)==0;
if($830){label=187;break;}else{label=186;break;}
case 186:
var $832=($825>>>0)<=($824>>>0);
var $833=($825>>>0)>($829>>>0);
var $or_cond2_i=$832|$833;
if($or_cond2_i){var $tsize_0303639_i=0;label=197;break;}else{label=187;break;}
case 187:
var $835=_sbrk($ssize_0_i);
var $836=($835|0)==($809|0);
var $ssize_0__i=($836?$ssize_0_i:0);
var $__i=($836?$809:-1);
var $tbase_0_i=$__i;var $tsize_0_i=$ssize_0__i;var $br_0_i=$835;var $ssize_1_i=$ssize_0_i;label=190;break;
case 188:
var $838=HEAP32[((964)>>2)];
var $839=((($774)-($838))|0);
var $840=$839&$775;
var $841=($840>>>0)<2147483647;
if($841){label=189;break;}else{var $tsize_0303639_i=0;label=197;break;}
case 189:
var $843=_sbrk($840);
var $844=HEAP32[(($796)>>2)];
var $845=HEAP32[(($800)>>2)];
var $846=(($844+$845)|0);
var $847=($843|0)==($846|0);
var $_3_i=($847?$840:0);
var $_4_i=($847?$843:-1);
var $tbase_0_i=$_4_i;var $tsize_0_i=$_3_i;var $br_0_i=$843;var $ssize_1_i=$840;label=190;break;
case 190:
var $ssize_1_i;
var $br_0_i;
var $tsize_0_i;
var $tbase_0_i;
var $849=(((-$ssize_1_i))|0);
var $850=($tbase_0_i|0)==-1;
if($850){label=191;break;}else{var $tsize_244_i=$tsize_0_i;var $tbase_245_i=$tbase_0_i;label=201;break;}
case 191:
var $852=($br_0_i|0)!=-1;
var $853=($ssize_1_i>>>0)<2147483647;
var $or_cond5_i=$852&$853;
var $854=($ssize_1_i>>>0)<($771>>>0);
var $or_cond6_i=$or_cond5_i&$854;
if($or_cond6_i){label=192;break;}else{var $ssize_2_i=$ssize_1_i;label=196;break;}
case 192:
var $856=HEAP32[((936)>>2)];
var $857=((($773)-($ssize_1_i))|0);
var $858=((($857)+($856))|0);
var $859=(((-$856))|0);
var $860=$858&$859;
var $861=($860>>>0)<2147483647;
if($861){label=193;break;}else{var $ssize_2_i=$ssize_1_i;label=196;break;}
case 193:
var $863=_sbrk($860);
var $864=($863|0)==-1;
if($864){label=195;break;}else{label=194;break;}
case 194:
var $866=((($860)+($ssize_1_i))|0);
var $ssize_2_i=$866;label=196;break;
case 195:
var $868=_sbrk($849);
var $tsize_0303639_i=$tsize_0_i;label=197;break;
case 196:
var $ssize_2_i;
var $870=($br_0_i|0)==-1;
if($870){var $tsize_0303639_i=$tsize_0_i;label=197;break;}else{var $tsize_244_i=$ssize_2_i;var $tbase_245_i=$br_0_i;label=201;break;}
case 197:
var $tsize_0303639_i;
var $871=HEAP32[((1396)>>2)];
var $872=$871|4;
HEAP32[((1396)>>2)]=$872;
var $tsize_1_i=$tsize_0303639_i;label=198;break;
case 198:
var $tsize_1_i;
var $874=($776>>>0)<2147483647;
if($874){label=199;break;}else{label=340;break;}
case 199:
var $876=_sbrk($776);
var $877=_sbrk(0);
var $notlhs_i=($876|0)!=-1;
var $notrhs_i=($877|0)!=-1;
var $or_cond8_not_i=$notrhs_i&$notlhs_i;
var $878=($876>>>0)<($877>>>0);
var $or_cond9_i=$or_cond8_not_i&$878;
if($or_cond9_i){label=200;break;}else{label=340;break;}
case 200:
var $879=$877;
var $880=$876;
var $881=((($879)-($880))|0);
var $882=((($nb_0)+(40))|0);
var $883=($881>>>0)>($882>>>0);
var $_tsize_1_i=($883?$881:$tsize_1_i);
var $_tbase_1_i=($883?$876:-1);
var $884=($_tbase_1_i|0)==-1;
if($884){label=340;break;}else{var $tsize_244_i=$_tsize_1_i;var $tbase_245_i=$_tbase_1_i;label=201;break;}
case 201:
var $tbase_245_i;
var $tsize_244_i;
var $885=HEAP32[((1384)>>2)];
var $886=((($885)+($tsize_244_i))|0);
HEAP32[((1384)>>2)]=$886;
var $887=HEAP32[((1388)>>2)];
var $888=($886>>>0)>($887>>>0);
if($888){label=202;break;}else{label=203;break;}
case 202:
HEAP32[((1388)>>2)]=$886;
label=203;break;
case 203:
var $890=HEAP32[((976)>>2)];
var $891=($890|0)==0;
if($891){label=204;break;}else{var $sp_067_i=1400;label=211;break;}
case 204:
var $893=HEAP32[((968)>>2)];
var $894=($893|0)==0;
var $895=($tbase_245_i>>>0)<($893>>>0);
var $or_cond10_i=$894|$895;
if($or_cond10_i){label=205;break;}else{label=206;break;}
case 205:
HEAP32[((968)>>2)]=$tbase_245_i;
label=206;break;
case 206:
HEAP32[((1400)>>2)]=$tbase_245_i;
HEAP32[((1404)>>2)]=$tsize_244_i;
HEAP32[((1412)>>2)]=0;
var $897=HEAP32[((928)>>2)];
HEAP32[((988)>>2)]=$897;
HEAP32[((984)>>2)]=-1;
var $i_02_i_i=0;label=207;break;
case 207:
var $i_02_i_i;
var $899=$i_02_i_i<<1;
var $900=((992+($899<<2))|0);
var $901=$900;
var $_sum_i_i=((($899)+(3))|0);
var $902=((992+($_sum_i_i<<2))|0);
HEAP32[(($902)>>2)]=$901;
var $_sum1_i_i=((($899)+(2))|0);
var $903=((992+($_sum1_i_i<<2))|0);
HEAP32[(($903)>>2)]=$901;
var $904=((($i_02_i_i)+(1))|0);
var $exitcond_i_i=($904|0)==32;
if($exitcond_i_i){label=208;break;}else{var $i_02_i_i=$904;label=207;break;}
case 208:
var $905=((($tsize_244_i)-(40))|0);
var $906=(($tbase_245_i+8)|0);
var $907=$906;
var $908=$907&7;
var $909=($908|0)==0;
if($909){var $913=0;label=210;break;}else{label=209;break;}
case 209:
var $911=(((-$907))|0);
var $912=$911&7;
var $913=$912;label=210;break;
case 210:
var $913;
var $914=(($tbase_245_i+$913)|0);
var $915=$914;
var $916=((($905)-($913))|0);
HEAP32[((976)>>2)]=$915;
HEAP32[((964)>>2)]=$916;
var $917=$916|1;
var $_sum_i14_i=((($913)+(4))|0);
var $918=(($tbase_245_i+$_sum_i14_i)|0);
var $919=$918;
HEAP32[(($919)>>2)]=$917;
var $_sum2_i_i=((($tsize_244_i)-(36))|0);
var $920=(($tbase_245_i+$_sum2_i_i)|0);
var $921=$920;
HEAP32[(($921)>>2)]=40;
var $922=HEAP32[((944)>>2)];
HEAP32[((980)>>2)]=$922;
label=338;break;
case 211:
var $sp_067_i;
var $923=(($sp_067_i)|0);
var $924=HEAP32[(($923)>>2)];
var $925=(($sp_067_i+4)|0);
var $926=HEAP32[(($925)>>2)];
var $927=(($924+$926)|0);
var $928=($tbase_245_i|0)==($927|0);
if($928){label=213;break;}else{label=212;break;}
case 212:
var $930=(($sp_067_i+8)|0);
var $931=HEAP32[(($930)>>2)];
var $932=($931|0)==0;
if($932){label=218;break;}else{var $sp_067_i=$931;label=211;break;}
case 213:
var $933=(($sp_067_i+12)|0);
var $934=HEAP32[(($933)>>2)];
var $935=$934&8;
var $936=($935|0)==0;
if($936){label=214;break;}else{label=218;break;}
case 214:
var $938=$890;
var $939=($938>>>0)>=($924>>>0);
var $940=($938>>>0)<($tbase_245_i>>>0);
var $or_cond47_i=$939&$940;
if($or_cond47_i){label=215;break;}else{label=218;break;}
case 215:
var $942=((($926)+($tsize_244_i))|0);
HEAP32[(($925)>>2)]=$942;
var $943=HEAP32[((976)>>2)];
var $944=HEAP32[((964)>>2)];
var $945=((($944)+($tsize_244_i))|0);
var $946=$943;
var $947=(($943+8)|0);
var $948=$947;
var $949=$948&7;
var $950=($949|0)==0;
if($950){var $954=0;label=217;break;}else{label=216;break;}
case 216:
var $952=(((-$948))|0);
var $953=$952&7;
var $954=$953;label=217;break;
case 217:
var $954;
var $955=(($946+$954)|0);
var $956=$955;
var $957=((($945)-($954))|0);
HEAP32[((976)>>2)]=$956;
HEAP32[((964)>>2)]=$957;
var $958=$957|1;
var $_sum_i18_i=((($954)+(4))|0);
var $959=(($946+$_sum_i18_i)|0);
var $960=$959;
HEAP32[(($960)>>2)]=$958;
var $_sum2_i19_i=((($945)+(4))|0);
var $961=(($946+$_sum2_i19_i)|0);
var $962=$961;
HEAP32[(($962)>>2)]=40;
var $963=HEAP32[((944)>>2)];
HEAP32[((980)>>2)]=$963;
label=338;break;
case 218:
var $964=HEAP32[((968)>>2)];
var $965=($tbase_245_i>>>0)<($964>>>0);
if($965){label=219;break;}else{label=220;break;}
case 219:
HEAP32[((968)>>2)]=$tbase_245_i;
label=220;break;
case 220:
var $967=(($tbase_245_i+$tsize_244_i)|0);
var $sp_160_i=1400;label=221;break;
case 221:
var $sp_160_i;
var $969=(($sp_160_i)|0);
var $970=HEAP32[(($969)>>2)];
var $971=($970|0)==($967|0);
if($971){label=223;break;}else{label=222;break;}
case 222:
var $973=(($sp_160_i+8)|0);
var $974=HEAP32[(($973)>>2)];
var $975=($974|0)==0;
if($975){label=304;break;}else{var $sp_160_i=$974;label=221;break;}
case 223:
var $976=(($sp_160_i+12)|0);
var $977=HEAP32[(($976)>>2)];
var $978=$977&8;
var $979=($978|0)==0;
if($979){label=224;break;}else{label=304;break;}
case 224:
HEAP32[(($969)>>2)]=$tbase_245_i;
var $981=(($sp_160_i+4)|0);
var $982=HEAP32[(($981)>>2)];
var $983=((($982)+($tsize_244_i))|0);
HEAP32[(($981)>>2)]=$983;
var $984=(($tbase_245_i+8)|0);
var $985=$984;
var $986=$985&7;
var $987=($986|0)==0;
if($987){var $992=0;label=226;break;}else{label=225;break;}
case 225:
var $989=(((-$985))|0);
var $990=$989&7;
var $992=$990;label=226;break;
case 226:
var $992;
var $993=(($tbase_245_i+$992)|0);
var $_sum93_i=((($tsize_244_i)+(8))|0);
var $994=(($tbase_245_i+$_sum93_i)|0);
var $995=$994;
var $996=$995&7;
var $997=($996|0)==0;
if($997){var $1002=0;label=228;break;}else{label=227;break;}
case 227:
var $999=(((-$995))|0);
var $1000=$999&7;
var $1002=$1000;label=228;break;
case 228:
var $1002;
var $_sum94_i=((($1002)+($tsize_244_i))|0);
var $1003=(($tbase_245_i+$_sum94_i)|0);
var $1004=$1003;
var $1005=$1003;
var $1006=$993;
var $1007=((($1005)-($1006))|0);
var $_sum_i21_i=((($992)+($nb_0))|0);
var $1008=(($tbase_245_i+$_sum_i21_i)|0);
var $1009=$1008;
var $1010=((($1007)-($nb_0))|0);
var $1011=$nb_0|3;
var $_sum1_i22_i=((($992)+(4))|0);
var $1012=(($tbase_245_i+$_sum1_i22_i)|0);
var $1013=$1012;
HEAP32[(($1013)>>2)]=$1011;
var $1014=HEAP32[((976)>>2)];
var $1015=($1004|0)==($1014|0);
if($1015){label=229;break;}else{label=230;break;}
case 229:
var $1017=HEAP32[((964)>>2)];
var $1018=((($1017)+($1010))|0);
HEAP32[((964)>>2)]=$1018;
HEAP32[((976)>>2)]=$1009;
var $1019=$1018|1;
var $_sum42_i_i=((($_sum_i21_i)+(4))|0);
var $1020=(($tbase_245_i+$_sum42_i_i)|0);
var $1021=$1020;
HEAP32[(($1021)>>2)]=$1019;
label=303;break;
case 230:
var $1023=HEAP32[((972)>>2)];
var $1024=($1004|0)==($1023|0);
if($1024){label=231;break;}else{label=232;break;}
case 231:
var $1026=HEAP32[((960)>>2)];
var $1027=((($1026)+($1010))|0);
HEAP32[((960)>>2)]=$1027;
HEAP32[((972)>>2)]=$1009;
var $1028=$1027|1;
var $_sum40_i_i=((($_sum_i21_i)+(4))|0);
var $1029=(($tbase_245_i+$_sum40_i_i)|0);
var $1030=$1029;
HEAP32[(($1030)>>2)]=$1028;
var $_sum41_i_i=((($1027)+($_sum_i21_i))|0);
var $1031=(($tbase_245_i+$_sum41_i_i)|0);
var $1032=$1031;
HEAP32[(($1032)>>2)]=$1027;
label=303;break;
case 232:
var $_sum2_i23_i=((($tsize_244_i)+(4))|0);
var $_sum95_i=((($_sum2_i23_i)+($1002))|0);
var $1034=(($tbase_245_i+$_sum95_i)|0);
var $1035=$1034;
var $1036=HEAP32[(($1035)>>2)];
var $1037=$1036&3;
var $1038=($1037|0)==1;
if($1038){label=233;break;}else{var $oldfirst_0_i_i=$1004;var $qsize_0_i_i=$1010;label=280;break;}
case 233:
var $1040=$1036&-8;
var $1041=$1036>>>3;
var $1042=($1036>>>0)<256;
if($1042){label=234;break;}else{label=246;break;}
case 234:
var $_sum3738_i_i=$1002|8;
var $_sum105_i=((($_sum3738_i_i)+($tsize_244_i))|0);
var $1044=(($tbase_245_i+$_sum105_i)|0);
var $1045=$1044;
var $1046=HEAP32[(($1045)>>2)];
var $_sum39_i_i=((($tsize_244_i)+(12))|0);
var $_sum106_i=((($_sum39_i_i)+($1002))|0);
var $1047=(($tbase_245_i+$_sum106_i)|0);
var $1048=$1047;
var $1049=HEAP32[(($1048)>>2)];
var $1050=$1041<<1;
var $1051=((992+($1050<<2))|0);
var $1052=$1051;
var $1053=($1046|0)==($1052|0);
if($1053){label=237;break;}else{label=235;break;}
case 235:
var $1055=$1046;
var $1056=HEAP32[((968)>>2)];
var $1057=($1055>>>0)<($1056>>>0);
if($1057){label=245;break;}else{label=236;break;}
case 236:
var $1059=(($1046+12)|0);
var $1060=HEAP32[(($1059)>>2)];
var $1061=($1060|0)==($1004|0);
if($1061){label=237;break;}else{label=245;break;}
case 237:
var $1062=($1049|0)==($1046|0);
if($1062){label=238;break;}else{label=239;break;}
case 238:
var $1064=1<<$1041;
var $1065=$1064^-1;
var $1066=HEAP32[((952)>>2)];
var $1067=$1066&$1065;
HEAP32[((952)>>2)]=$1067;
label=279;break;
case 239:
var $1069=($1049|0)==($1052|0);
if($1069){label=240;break;}else{label=241;break;}
case 240:
var $_pre52_i_i=(($1049+8)|0);
var $_pre_phi53_i_i=$_pre52_i_i;label=243;break;
case 241:
var $1071=$1049;
var $1072=HEAP32[((968)>>2)];
var $1073=($1071>>>0)<($1072>>>0);
if($1073){label=244;break;}else{label=242;break;}
case 242:
var $1075=(($1049+8)|0);
var $1076=HEAP32[(($1075)>>2)];
var $1077=($1076|0)==($1004|0);
if($1077){var $_pre_phi53_i_i=$1075;label=243;break;}else{label=244;break;}
case 243:
var $_pre_phi53_i_i;
var $1078=(($1046+12)|0);
HEAP32[(($1078)>>2)]=$1049;
HEAP32[(($_pre_phi53_i_i)>>2)]=$1046;
label=279;break;
case 244:
_abort();
throw "Reached an unreachable!";
case 245:
_abort();
throw "Reached an unreachable!";
case 246:
var $1080=$1003;
var $_sum34_i_i=$1002|24;
var $_sum96_i=((($_sum34_i_i)+($tsize_244_i))|0);
var $1081=(($tbase_245_i+$_sum96_i)|0);
var $1082=$1081;
var $1083=HEAP32[(($1082)>>2)];
var $_sum5_i_i=((($tsize_244_i)+(12))|0);
var $_sum97_i=((($_sum5_i_i)+($1002))|0);
var $1084=(($tbase_245_i+$_sum97_i)|0);
var $1085=$1084;
var $1086=HEAP32[(($1085)>>2)];
var $1087=($1086|0)==($1080|0);
if($1087){label=252;break;}else{label=247;break;}
case 247:
var $_sum3536_i_i=$1002|8;
var $_sum98_i=((($_sum3536_i_i)+($tsize_244_i))|0);
var $1089=(($tbase_245_i+$_sum98_i)|0);
var $1090=$1089;
var $1091=HEAP32[(($1090)>>2)];
var $1092=$1091;
var $1093=HEAP32[((968)>>2)];
var $1094=($1092>>>0)<($1093>>>0);
if($1094){label=251;break;}else{label=248;break;}
case 248:
var $1096=(($1091+12)|0);
var $1097=HEAP32[(($1096)>>2)];
var $1098=($1097|0)==($1080|0);
if($1098){label=249;break;}else{label=251;break;}
case 249:
var $1100=(($1086+8)|0);
var $1101=HEAP32[(($1100)>>2)];
var $1102=($1101|0)==($1080|0);
if($1102){label=250;break;}else{label=251;break;}
case 250:
HEAP32[(($1096)>>2)]=$1086;
HEAP32[(($1100)>>2)]=$1091;
var $R_1_i_i=$1086;label=259;break;
case 251:
_abort();
throw "Reached an unreachable!";
case 252:
var $_sum67_i_i=$1002|16;
var $_sum103_i=((($_sum2_i23_i)+($_sum67_i_i))|0);
var $1105=(($tbase_245_i+$_sum103_i)|0);
var $1106=$1105;
var $1107=HEAP32[(($1106)>>2)];
var $1108=($1107|0)==0;
if($1108){label=253;break;}else{var $R_0_i_i=$1107;var $RP_0_i_i=$1106;label=254;break;}
case 253:
var $_sum104_i=((($_sum67_i_i)+($tsize_244_i))|0);
var $1110=(($tbase_245_i+$_sum104_i)|0);
var $1111=$1110;
var $1112=HEAP32[(($1111)>>2)];
var $1113=($1112|0)==0;
if($1113){var $R_1_i_i=0;label=259;break;}else{var $R_0_i_i=$1112;var $RP_0_i_i=$1111;label=254;break;}
case 254:
var $RP_0_i_i;
var $R_0_i_i;
var $1114=(($R_0_i_i+20)|0);
var $1115=HEAP32[(($1114)>>2)];
var $1116=($1115|0)==0;
if($1116){label=255;break;}else{var $R_0_i_i=$1115;var $RP_0_i_i=$1114;label=254;break;}
case 255:
var $1118=(($R_0_i_i+16)|0);
var $1119=HEAP32[(($1118)>>2)];
var $1120=($1119|0)==0;
if($1120){label=256;break;}else{var $R_0_i_i=$1119;var $RP_0_i_i=$1118;label=254;break;}
case 256:
var $1122=$RP_0_i_i;
var $1123=HEAP32[((968)>>2)];
var $1124=($1122>>>0)<($1123>>>0);
if($1124){label=258;break;}else{label=257;break;}
case 257:
HEAP32[(($RP_0_i_i)>>2)]=0;
var $R_1_i_i=$R_0_i_i;label=259;break;
case 258:
_abort();
throw "Reached an unreachable!";
case 259:
var $R_1_i_i;
var $1128=($1083|0)==0;
if($1128){label=279;break;}else{label=260;break;}
case 260:
var $_sum30_i_i=((($tsize_244_i)+(28))|0);
var $_sum99_i=((($_sum30_i_i)+($1002))|0);
var $1130=(($tbase_245_i+$_sum99_i)|0);
var $1131=$1130;
var $1132=HEAP32[(($1131)>>2)];
var $1133=((1256+($1132<<2))|0);
var $1134=HEAP32[(($1133)>>2)];
var $1135=($1080|0)==($1134|0);
if($1135){label=261;break;}else{label=263;break;}
case 261:
HEAP32[(($1133)>>2)]=$R_1_i_i;
var $cond_i_i=($R_1_i_i|0)==0;
if($cond_i_i){label=262;break;}else{label=269;break;}
case 262:
var $1137=HEAP32[(($1131)>>2)];
var $1138=1<<$1137;
var $1139=$1138^-1;
var $1140=HEAP32[((956)>>2)];
var $1141=$1140&$1139;
HEAP32[((956)>>2)]=$1141;
label=279;break;
case 263:
var $1143=$1083;
var $1144=HEAP32[((968)>>2)];
var $1145=($1143>>>0)<($1144>>>0);
if($1145){label=267;break;}else{label=264;break;}
case 264:
var $1147=(($1083+16)|0);
var $1148=HEAP32[(($1147)>>2)];
var $1149=($1148|0)==($1080|0);
if($1149){label=265;break;}else{label=266;break;}
case 265:
HEAP32[(($1147)>>2)]=$R_1_i_i;
label=268;break;
case 266:
var $1152=(($1083+20)|0);
HEAP32[(($1152)>>2)]=$R_1_i_i;
label=268;break;
case 267:
_abort();
throw "Reached an unreachable!";
case 268:
var $1155=($R_1_i_i|0)==0;
if($1155){label=279;break;}else{label=269;break;}
case 269:
var $1157=$R_1_i_i;
var $1158=HEAP32[((968)>>2)];
var $1159=($1157>>>0)<($1158>>>0);
if($1159){label=278;break;}else{label=270;break;}
case 270:
var $1161=(($R_1_i_i+24)|0);
HEAP32[(($1161)>>2)]=$1083;
var $_sum3132_i_i=$1002|16;
var $_sum100_i=((($_sum3132_i_i)+($tsize_244_i))|0);
var $1162=(($tbase_245_i+$_sum100_i)|0);
var $1163=$1162;
var $1164=HEAP32[(($1163)>>2)];
var $1165=($1164|0)==0;
if($1165){label=274;break;}else{label=271;break;}
case 271:
var $1167=$1164;
var $1168=HEAP32[((968)>>2)];
var $1169=($1167>>>0)<($1168>>>0);
if($1169){label=273;break;}else{label=272;break;}
case 272:
var $1171=(($R_1_i_i+16)|0);
HEAP32[(($1171)>>2)]=$1164;
var $1172=(($1164+24)|0);
HEAP32[(($1172)>>2)]=$R_1_i_i;
label=274;break;
case 273:
_abort();
throw "Reached an unreachable!";
case 274:
var $_sum101_i=((($_sum2_i23_i)+($_sum3132_i_i))|0);
var $1175=(($tbase_245_i+$_sum101_i)|0);
var $1176=$1175;
var $1177=HEAP32[(($1176)>>2)];
var $1178=($1177|0)==0;
if($1178){label=279;break;}else{label=275;break;}
case 275:
var $1180=$1177;
var $1181=HEAP32[((968)>>2)];
var $1182=($1180>>>0)<($1181>>>0);
if($1182){label=277;break;}else{label=276;break;}
case 276:
var $1184=(($R_1_i_i+20)|0);
HEAP32[(($1184)>>2)]=$1177;
var $1185=(($1177+24)|0);
HEAP32[(($1185)>>2)]=$R_1_i_i;
label=279;break;
case 277:
_abort();
throw "Reached an unreachable!";
case 278:
_abort();
throw "Reached an unreachable!";
case 279:
var $_sum9_i_i=$1040|$1002;
var $_sum102_i=((($_sum9_i_i)+($tsize_244_i))|0);
var $1189=(($tbase_245_i+$_sum102_i)|0);
var $1190=$1189;
var $1191=((($1040)+($1010))|0);
var $oldfirst_0_i_i=$1190;var $qsize_0_i_i=$1191;label=280;break;
case 280:
var $qsize_0_i_i;
var $oldfirst_0_i_i;
var $1193=(($oldfirst_0_i_i+4)|0);
var $1194=HEAP32[(($1193)>>2)];
var $1195=$1194&-2;
HEAP32[(($1193)>>2)]=$1195;
var $1196=$qsize_0_i_i|1;
var $_sum10_i_i=((($_sum_i21_i)+(4))|0);
var $1197=(($tbase_245_i+$_sum10_i_i)|0);
var $1198=$1197;
HEAP32[(($1198)>>2)]=$1196;
var $_sum11_i24_i=((($qsize_0_i_i)+($_sum_i21_i))|0);
var $1199=(($tbase_245_i+$_sum11_i24_i)|0);
var $1200=$1199;
HEAP32[(($1200)>>2)]=$qsize_0_i_i;
var $1201=$qsize_0_i_i>>>3;
var $1202=($qsize_0_i_i>>>0)<256;
if($1202){label=281;break;}else{label=286;break;}
case 281:
var $1204=$1201<<1;
var $1205=((992+($1204<<2))|0);
var $1206=$1205;
var $1207=HEAP32[((952)>>2)];
var $1208=1<<$1201;
var $1209=$1207&$1208;
var $1210=($1209|0)==0;
if($1210){label=282;break;}else{label=283;break;}
case 282:
var $1212=$1207|$1208;
HEAP32[((952)>>2)]=$1212;
var $_sum26_pre_i_i=((($1204)+(2))|0);
var $_pre_i25_i=((992+($_sum26_pre_i_i<<2))|0);
var $F4_0_i_i=$1206;var $_pre_phi_i26_i=$_pre_i25_i;label=285;break;
case 283:
var $_sum29_i_i=((($1204)+(2))|0);
var $1214=((992+($_sum29_i_i<<2))|0);
var $1215=HEAP32[(($1214)>>2)];
var $1216=$1215;
var $1217=HEAP32[((968)>>2)];
var $1218=($1216>>>0)<($1217>>>0);
if($1218){label=284;break;}else{var $F4_0_i_i=$1215;var $_pre_phi_i26_i=$1214;label=285;break;}
case 284:
_abort();
throw "Reached an unreachable!";
case 285:
var $_pre_phi_i26_i;
var $F4_0_i_i;
HEAP32[(($_pre_phi_i26_i)>>2)]=$1009;
var $1221=(($F4_0_i_i+12)|0);
HEAP32[(($1221)>>2)]=$1009;
var $_sum27_i_i=((($_sum_i21_i)+(8))|0);
var $1222=(($tbase_245_i+$_sum27_i_i)|0);
var $1223=$1222;
HEAP32[(($1223)>>2)]=$F4_0_i_i;
var $_sum28_i_i=((($_sum_i21_i)+(12))|0);
var $1224=(($tbase_245_i+$_sum28_i_i)|0);
var $1225=$1224;
HEAP32[(($1225)>>2)]=$1206;
label=303;break;
case 286:
var $1227=$1008;
var $1228=$qsize_0_i_i>>>8;
var $1229=($1228|0)==0;
if($1229){var $I7_0_i_i=0;label=289;break;}else{label=287;break;}
case 287:
var $1231=($qsize_0_i_i>>>0)>16777215;
if($1231){var $I7_0_i_i=31;label=289;break;}else{label=288;break;}
case 288:
var $1233=((($1228)+(1048320))|0);
var $1234=$1233>>>16;
var $1235=$1234&8;
var $1236=$1228<<$1235;
var $1237=((($1236)+(520192))|0);
var $1238=$1237>>>16;
var $1239=$1238&4;
var $1240=$1239|$1235;
var $1241=$1236<<$1239;
var $1242=((($1241)+(245760))|0);
var $1243=$1242>>>16;
var $1244=$1243&2;
var $1245=$1240|$1244;
var $1246=(((14)-($1245))|0);
var $1247=$1241<<$1244;
var $1248=$1247>>>15;
var $1249=((($1246)+($1248))|0);
var $1250=$1249<<1;
var $1251=((($1249)+(7))|0);
var $1252=$qsize_0_i_i>>>($1251>>>0);
var $1253=$1252&1;
var $1254=$1253|$1250;
var $I7_0_i_i=$1254;label=289;break;
case 289:
var $I7_0_i_i;
var $1256=((1256+($I7_0_i_i<<2))|0);
var $_sum12_i_i=((($_sum_i21_i)+(28))|0);
var $1257=(($tbase_245_i+$_sum12_i_i)|0);
var $1258=$1257;
HEAP32[(($1258)>>2)]=$I7_0_i_i;
var $_sum13_i_i=((($_sum_i21_i)+(16))|0);
var $1259=(($tbase_245_i+$_sum13_i_i)|0);
var $_sum14_i_i=((($_sum_i21_i)+(20))|0);
var $1260=(($tbase_245_i+$_sum14_i_i)|0);
var $1261=$1260;
HEAP32[(($1261)>>2)]=0;
var $1262=$1259;
HEAP32[(($1262)>>2)]=0;
var $1263=HEAP32[((956)>>2)];
var $1264=1<<$I7_0_i_i;
var $1265=$1263&$1264;
var $1266=($1265|0)==0;
if($1266){label=290;break;}else{label=291;break;}
case 290:
var $1268=$1263|$1264;
HEAP32[((956)>>2)]=$1268;
HEAP32[(($1256)>>2)]=$1227;
var $1269=$1256;
var $_sum15_i_i=((($_sum_i21_i)+(24))|0);
var $1270=(($tbase_245_i+$_sum15_i_i)|0);
var $1271=$1270;
HEAP32[(($1271)>>2)]=$1269;
var $_sum16_i_i=((($_sum_i21_i)+(12))|0);
var $1272=(($tbase_245_i+$_sum16_i_i)|0);
var $1273=$1272;
HEAP32[(($1273)>>2)]=$1227;
var $_sum17_i_i=((($_sum_i21_i)+(8))|0);
var $1274=(($tbase_245_i+$_sum17_i_i)|0);
var $1275=$1274;
HEAP32[(($1275)>>2)]=$1227;
label=303;break;
case 291:
var $1277=HEAP32[(($1256)>>2)];
var $1278=($I7_0_i_i|0)==31;
if($1278){var $1283=0;label=293;break;}else{label=292;break;}
case 292:
var $1280=$I7_0_i_i>>>1;
var $1281=(((25)-($1280))|0);
var $1283=$1281;label=293;break;
case 293:
var $1283;
var $1284=$qsize_0_i_i<<$1283;
var $K8_0_i_i=$1284;var $T_0_i27_i=$1277;label=294;break;
case 294:
var $T_0_i27_i;
var $K8_0_i_i;
var $1286=(($T_0_i27_i+4)|0);
var $1287=HEAP32[(($1286)>>2)];
var $1288=$1287&-8;
var $1289=($1288|0)==($qsize_0_i_i|0);
if($1289){label=299;break;}else{label=295;break;}
case 295:
var $1291=$K8_0_i_i>>>31;
var $1292=(($T_0_i27_i+16+($1291<<2))|0);
var $1293=HEAP32[(($1292)>>2)];
var $1294=($1293|0)==0;
var $1295=$K8_0_i_i<<1;
if($1294){label=296;break;}else{var $K8_0_i_i=$1295;var $T_0_i27_i=$1293;label=294;break;}
case 296:
var $1297=$1292;
var $1298=HEAP32[((968)>>2)];
var $1299=($1297>>>0)<($1298>>>0);
if($1299){label=298;break;}else{label=297;break;}
case 297:
HEAP32[(($1292)>>2)]=$1227;
var $_sum23_i_i=((($_sum_i21_i)+(24))|0);
var $1301=(($tbase_245_i+$_sum23_i_i)|0);
var $1302=$1301;
HEAP32[(($1302)>>2)]=$T_0_i27_i;
var $_sum24_i_i=((($_sum_i21_i)+(12))|0);
var $1303=(($tbase_245_i+$_sum24_i_i)|0);
var $1304=$1303;
HEAP32[(($1304)>>2)]=$1227;
var $_sum25_i_i=((($_sum_i21_i)+(8))|0);
var $1305=(($tbase_245_i+$_sum25_i_i)|0);
var $1306=$1305;
HEAP32[(($1306)>>2)]=$1227;
label=303;break;
case 298:
_abort();
throw "Reached an unreachable!";
case 299:
var $1309=(($T_0_i27_i+8)|0);
var $1310=HEAP32[(($1309)>>2)];
var $1311=$T_0_i27_i;
var $1312=HEAP32[((968)>>2)];
var $1313=($1311>>>0)<($1312>>>0);
if($1313){label=302;break;}else{label=300;break;}
case 300:
var $1315=$1310;
var $1316=($1315>>>0)<($1312>>>0);
if($1316){label=302;break;}else{label=301;break;}
case 301:
var $1318=(($1310+12)|0);
HEAP32[(($1318)>>2)]=$1227;
HEAP32[(($1309)>>2)]=$1227;
var $_sum20_i_i=((($_sum_i21_i)+(8))|0);
var $1319=(($tbase_245_i+$_sum20_i_i)|0);
var $1320=$1319;
HEAP32[(($1320)>>2)]=$1310;
var $_sum21_i_i=((($_sum_i21_i)+(12))|0);
var $1321=(($tbase_245_i+$_sum21_i_i)|0);
var $1322=$1321;
HEAP32[(($1322)>>2)]=$T_0_i27_i;
var $_sum22_i_i=((($_sum_i21_i)+(24))|0);
var $1323=(($tbase_245_i+$_sum22_i_i)|0);
var $1324=$1323;
HEAP32[(($1324)>>2)]=0;
label=303;break;
case 302:
_abort();
throw "Reached an unreachable!";
case 303:
var $_sum1819_i_i=$992|8;
var $1325=(($tbase_245_i+$_sum1819_i_i)|0);
var $mem_0=$1325;label=341;break;
case 304:
var $1326=$890;
var $sp_0_i_i_i=1400;label=305;break;
case 305:
var $sp_0_i_i_i;
var $1328=(($sp_0_i_i_i)|0);
var $1329=HEAP32[(($1328)>>2)];
var $1330=($1329>>>0)>($1326>>>0);
if($1330){label=307;break;}else{label=306;break;}
case 306:
var $1332=(($sp_0_i_i_i+4)|0);
var $1333=HEAP32[(($1332)>>2)];
var $1334=(($1329+$1333)|0);
var $1335=($1334>>>0)>($1326>>>0);
if($1335){label=308;break;}else{label=307;break;}
case 307:
var $1337=(($sp_0_i_i_i+8)|0);
var $1338=HEAP32[(($1337)>>2)];
var $sp_0_i_i_i=$1338;label=305;break;
case 308:
var $_sum_i15_i=((($1333)-(47))|0);
var $_sum1_i16_i=((($1333)-(39))|0);
var $1339=(($1329+$_sum1_i16_i)|0);
var $1340=$1339;
var $1341=$1340&7;
var $1342=($1341|0)==0;
if($1342){var $1347=0;label=310;break;}else{label=309;break;}
case 309:
var $1344=(((-$1340))|0);
var $1345=$1344&7;
var $1347=$1345;label=310;break;
case 310:
var $1347;
var $_sum2_i17_i=((($_sum_i15_i)+($1347))|0);
var $1348=(($1329+$_sum2_i17_i)|0);
var $1349=(($890+16)|0);
var $1350=$1349;
var $1351=($1348>>>0)<($1350>>>0);
var $1352=($1351?$1326:$1348);
var $1353=(($1352+8)|0);
var $1354=$1353;
var $1355=((($tsize_244_i)-(40))|0);
var $1356=(($tbase_245_i+8)|0);
var $1357=$1356;
var $1358=$1357&7;
var $1359=($1358|0)==0;
if($1359){var $1363=0;label=312;break;}else{label=311;break;}
case 311:
var $1361=(((-$1357))|0);
var $1362=$1361&7;
var $1363=$1362;label=312;break;
case 312:
var $1363;
var $1364=(($tbase_245_i+$1363)|0);
var $1365=$1364;
var $1366=((($1355)-($1363))|0);
HEAP32[((976)>>2)]=$1365;
HEAP32[((964)>>2)]=$1366;
var $1367=$1366|1;
var $_sum_i_i_i=((($1363)+(4))|0);
var $1368=(($tbase_245_i+$_sum_i_i_i)|0);
var $1369=$1368;
HEAP32[(($1369)>>2)]=$1367;
var $_sum2_i_i_i=((($tsize_244_i)-(36))|0);
var $1370=(($tbase_245_i+$_sum2_i_i_i)|0);
var $1371=$1370;
HEAP32[(($1371)>>2)]=40;
var $1372=HEAP32[((944)>>2)];
HEAP32[((980)>>2)]=$1372;
var $1373=(($1352+4)|0);
var $1374=$1373;
HEAP32[(($1374)>>2)]=27;
assert(16 % 1 === 0);HEAP32[(($1353)>>2)]=HEAP32[((1400)>>2)];HEAP32[((($1353)+(4))>>2)]=HEAP32[((1404)>>2)];HEAP32[((($1353)+(8))>>2)]=HEAP32[((1408)>>2)];HEAP32[((($1353)+(12))>>2)]=HEAP32[((1412)>>2)];
HEAP32[((1400)>>2)]=$tbase_245_i;
HEAP32[((1404)>>2)]=$tsize_244_i;
HEAP32[((1412)>>2)]=0;
HEAP32[((1408)>>2)]=$1354;
var $1375=(($1352+28)|0);
var $1376=$1375;
HEAP32[(($1376)>>2)]=7;
var $1377=(($1352+32)|0);
var $1378=($1377>>>0)<($1334>>>0);
if($1378){var $1379=$1376;label=313;break;}else{label=314;break;}
case 313:
var $1379;
var $1380=(($1379+4)|0);
HEAP32[(($1380)>>2)]=7;
var $1381=(($1379+8)|0);
var $1382=$1381;
var $1383=($1382>>>0)<($1334>>>0);
if($1383){var $1379=$1380;label=313;break;}else{label=314;break;}
case 314:
var $1384=($1352|0)==($1326|0);
if($1384){label=338;break;}else{label=315;break;}
case 315:
var $1386=$1352;
var $1387=$890;
var $1388=((($1386)-($1387))|0);
var $1389=(($1326+$1388)|0);
var $_sum3_i_i=((($1388)+(4))|0);
var $1390=(($1326+$_sum3_i_i)|0);
var $1391=$1390;
var $1392=HEAP32[(($1391)>>2)];
var $1393=$1392&-2;
HEAP32[(($1391)>>2)]=$1393;
var $1394=$1388|1;
var $1395=(($890+4)|0);
HEAP32[(($1395)>>2)]=$1394;
var $1396=$1389;
HEAP32[(($1396)>>2)]=$1388;
var $1397=$1388>>>3;
var $1398=($1388>>>0)<256;
if($1398){label=316;break;}else{label=321;break;}
case 316:
var $1400=$1397<<1;
var $1401=((992+($1400<<2))|0);
var $1402=$1401;
var $1403=HEAP32[((952)>>2)];
var $1404=1<<$1397;
var $1405=$1403&$1404;
var $1406=($1405|0)==0;
if($1406){label=317;break;}else{label=318;break;}
case 317:
var $1408=$1403|$1404;
HEAP32[((952)>>2)]=$1408;
var $_sum10_pre_i_i=((($1400)+(2))|0);
var $_pre_i_i=((992+($_sum10_pre_i_i<<2))|0);
var $F_0_i_i=$1402;var $_pre_phi_i_i=$_pre_i_i;label=320;break;
case 318:
var $_sum11_i_i=((($1400)+(2))|0);
var $1410=((992+($_sum11_i_i<<2))|0);
var $1411=HEAP32[(($1410)>>2)];
var $1412=$1411;
var $1413=HEAP32[((968)>>2)];
var $1414=($1412>>>0)<($1413>>>0);
if($1414){label=319;break;}else{var $F_0_i_i=$1411;var $_pre_phi_i_i=$1410;label=320;break;}
case 319:
_abort();
throw "Reached an unreachable!";
case 320:
var $_pre_phi_i_i;
var $F_0_i_i;
HEAP32[(($_pre_phi_i_i)>>2)]=$890;
var $1417=(($F_0_i_i+12)|0);
HEAP32[(($1417)>>2)]=$890;
var $1418=(($890+8)|0);
HEAP32[(($1418)>>2)]=$F_0_i_i;
var $1419=(($890+12)|0);
HEAP32[(($1419)>>2)]=$1402;
label=338;break;
case 321:
var $1421=$890;
var $1422=$1388>>>8;
var $1423=($1422|0)==0;
if($1423){var $I1_0_i_i=0;label=324;break;}else{label=322;break;}
case 322:
var $1425=($1388>>>0)>16777215;
if($1425){var $I1_0_i_i=31;label=324;break;}else{label=323;break;}
case 323:
var $1427=((($1422)+(1048320))|0);
var $1428=$1427>>>16;
var $1429=$1428&8;
var $1430=$1422<<$1429;
var $1431=((($1430)+(520192))|0);
var $1432=$1431>>>16;
var $1433=$1432&4;
var $1434=$1433|$1429;
var $1435=$1430<<$1433;
var $1436=((($1435)+(245760))|0);
var $1437=$1436>>>16;
var $1438=$1437&2;
var $1439=$1434|$1438;
var $1440=(((14)-($1439))|0);
var $1441=$1435<<$1438;
var $1442=$1441>>>15;
var $1443=((($1440)+($1442))|0);
var $1444=$1443<<1;
var $1445=((($1443)+(7))|0);
var $1446=$1388>>>($1445>>>0);
var $1447=$1446&1;
var $1448=$1447|$1444;
var $I1_0_i_i=$1448;label=324;break;
case 324:
var $I1_0_i_i;
var $1450=((1256+($I1_0_i_i<<2))|0);
var $1451=(($890+28)|0);
var $I1_0_c_i_i=$I1_0_i_i;
HEAP32[(($1451)>>2)]=$I1_0_c_i_i;
var $1452=(($890+20)|0);
HEAP32[(($1452)>>2)]=0;
var $1453=(($890+16)|0);
HEAP32[(($1453)>>2)]=0;
var $1454=HEAP32[((956)>>2)];
var $1455=1<<$I1_0_i_i;
var $1456=$1454&$1455;
var $1457=($1456|0)==0;
if($1457){label=325;break;}else{label=326;break;}
case 325:
var $1459=$1454|$1455;
HEAP32[((956)>>2)]=$1459;
HEAP32[(($1450)>>2)]=$1421;
var $1460=(($890+24)|0);
var $_c_i_i=$1450;
HEAP32[(($1460)>>2)]=$_c_i_i;
var $1461=(($890+12)|0);
HEAP32[(($1461)>>2)]=$890;
var $1462=(($890+8)|0);
HEAP32[(($1462)>>2)]=$890;
label=338;break;
case 326:
var $1464=HEAP32[(($1450)>>2)];
var $1465=($I1_0_i_i|0)==31;
if($1465){var $1470=0;label=328;break;}else{label=327;break;}
case 327:
var $1467=$I1_0_i_i>>>1;
var $1468=(((25)-($1467))|0);
var $1470=$1468;label=328;break;
case 328:
var $1470;
var $1471=$1388<<$1470;
var $K2_0_i_i=$1471;var $T_0_i_i=$1464;label=329;break;
case 329:
var $T_0_i_i;
var $K2_0_i_i;
var $1473=(($T_0_i_i+4)|0);
var $1474=HEAP32[(($1473)>>2)];
var $1475=$1474&-8;
var $1476=($1475|0)==($1388|0);
if($1476){label=334;break;}else{label=330;break;}
case 330:
var $1478=$K2_0_i_i>>>31;
var $1479=(($T_0_i_i+16+($1478<<2))|0);
var $1480=HEAP32[(($1479)>>2)];
var $1481=($1480|0)==0;
var $1482=$K2_0_i_i<<1;
if($1481){label=331;break;}else{var $K2_0_i_i=$1482;var $T_0_i_i=$1480;label=329;break;}
case 331:
var $1484=$1479;
var $1485=HEAP32[((968)>>2)];
var $1486=($1484>>>0)<($1485>>>0);
if($1486){label=333;break;}else{label=332;break;}
case 332:
HEAP32[(($1479)>>2)]=$1421;
var $1488=(($890+24)|0);
var $T_0_c7_i_i=$T_0_i_i;
HEAP32[(($1488)>>2)]=$T_0_c7_i_i;
var $1489=(($890+12)|0);
HEAP32[(($1489)>>2)]=$890;
var $1490=(($890+8)|0);
HEAP32[(($1490)>>2)]=$890;
label=338;break;
case 333:
_abort();
throw "Reached an unreachable!";
case 334:
var $1493=(($T_0_i_i+8)|0);
var $1494=HEAP32[(($1493)>>2)];
var $1495=$T_0_i_i;
var $1496=HEAP32[((968)>>2)];
var $1497=($1495>>>0)<($1496>>>0);
if($1497){label=337;break;}else{label=335;break;}
case 335:
var $1499=$1494;
var $1500=($1499>>>0)<($1496>>>0);
if($1500){label=337;break;}else{label=336;break;}
case 336:
var $1502=(($1494+12)|0);
HEAP32[(($1502)>>2)]=$1421;
HEAP32[(($1493)>>2)]=$1421;
var $1503=(($890+8)|0);
var $_c6_i_i=$1494;
HEAP32[(($1503)>>2)]=$_c6_i_i;
var $1504=(($890+12)|0);
var $T_0_c_i_i=$T_0_i_i;
HEAP32[(($1504)>>2)]=$T_0_c_i_i;
var $1505=(($890+24)|0);
HEAP32[(($1505)>>2)]=0;
label=338;break;
case 337:
_abort();
throw "Reached an unreachable!";
case 338:
var $1506=HEAP32[((964)>>2)];
var $1507=($1506>>>0)>($nb_0>>>0);
if($1507){label=339;break;}else{label=340;break;}
case 339:
var $1509=((($1506)-($nb_0))|0);
HEAP32[((964)>>2)]=$1509;
var $1510=HEAP32[((976)>>2)];
var $1511=$1510;
var $1512=(($1511+$nb_0)|0);
var $1513=$1512;
HEAP32[((976)>>2)]=$1513;
var $1514=$1509|1;
var $_sum_i132=((($nb_0)+(4))|0);
var $1515=(($1511+$_sum_i132)|0);
var $1516=$1515;
HEAP32[(($1516)>>2)]=$1514;
var $1517=$nb_0|3;
var $1518=(($1510+4)|0);
HEAP32[(($1518)>>2)]=$1517;
var $1519=(($1510+8)|0);
var $1520=$1519;
var $mem_0=$1520;label=341;break;
case 340:
var $1521=___errno_location();
HEAP32[(($1521)>>2)]=12;
var $mem_0=0;label=341;break;
case 341:
var $mem_0;
return $mem_0;
default: assert(0, "bad label: " + label);
}
}
Module["_malloc"] = _malloc;
function _free($mem){
var label=0;
label = 1;
while(1)switch(label){
case 1:
var $1=($mem|0)==0;
if($1){label=140;break;}else{label=2;break;}
case 2:
var $3=((($mem)-(8))|0);
var $4=$3;
var $5=HEAP32[((968)>>2)];
var $6=($3>>>0)<($5>>>0);
if($6){label=139;break;}else{label=3;break;}
case 3:
var $8=((($mem)-(4))|0);
var $9=$8;
var $10=HEAP32[(($9)>>2)];
var $11=$10&3;
var $12=($11|0)==1;
if($12){label=139;break;}else{label=4;break;}
case 4:
var $14=$10&-8;
var $_sum=((($14)-(8))|0);
var $15=(($mem+$_sum)|0);
var $16=$15;
var $17=$10&1;
var $18=($17|0)==0;
if($18){label=5;break;}else{var $p_0=$4;var $psize_0=$14;label=56;break;}
case 5:
var $20=$3;
var $21=HEAP32[(($20)>>2)];
var $22=($11|0)==0;
if($22){label=140;break;}else{label=6;break;}
case 6:
var $_sum231=(((-8)-($21))|0);
var $24=(($mem+$_sum231)|0);
var $25=$24;
var $26=((($21)+($14))|0);
var $27=($24>>>0)<($5>>>0);
if($27){label=139;break;}else{label=7;break;}
case 7:
var $29=HEAP32[((972)>>2)];
var $30=($25|0)==($29|0);
if($30){label=54;break;}else{label=8;break;}
case 8:
var $32=$21>>>3;
var $33=($21>>>0)<256;
if($33){label=9;break;}else{label=21;break;}
case 9:
var $_sum265=((($_sum231)+(8))|0);
var $35=(($mem+$_sum265)|0);
var $36=$35;
var $37=HEAP32[(($36)>>2)];
var $_sum266=((($_sum231)+(12))|0);
var $38=(($mem+$_sum266)|0);
var $39=$38;
var $40=HEAP32[(($39)>>2)];
var $41=$32<<1;
var $42=((992+($41<<2))|0);
var $43=$42;
var $44=($37|0)==($43|0);
if($44){label=12;break;}else{label=10;break;}
case 10:
var $46=$37;
var $47=($46>>>0)<($5>>>0);
if($47){label=20;break;}else{label=11;break;}
case 11:
var $49=(($37+12)|0);
var $50=HEAP32[(($49)>>2)];
var $51=($50|0)==($25|0);
if($51){label=12;break;}else{label=20;break;}
case 12:
var $52=($40|0)==($37|0);
if($52){label=13;break;}else{label=14;break;}
case 13:
var $54=1<<$32;
var $55=$54^-1;
var $56=HEAP32[((952)>>2)];
var $57=$56&$55;
HEAP32[((952)>>2)]=$57;
var $p_0=$25;var $psize_0=$26;label=56;break;
case 14:
var $59=($40|0)==($43|0);
if($59){label=15;break;}else{label=16;break;}
case 15:
var $_pre290=(($40+8)|0);
var $_pre_phi291=$_pre290;label=18;break;
case 16:
var $61=$40;
var $62=($61>>>0)<($5>>>0);
if($62){label=19;break;}else{label=17;break;}
case 17:
var $64=(($40+8)|0);
var $65=HEAP32[(($64)>>2)];
var $66=($65|0)==($25|0);
if($66){var $_pre_phi291=$64;label=18;break;}else{label=19;break;}
case 18:
var $_pre_phi291;
var $67=(($37+12)|0);
HEAP32[(($67)>>2)]=$40;
HEAP32[(($_pre_phi291)>>2)]=$37;
var $p_0=$25;var $psize_0=$26;label=56;break;
case 19:
_abort();
throw "Reached an unreachable!";
case 20:
_abort();
throw "Reached an unreachable!";
case 21:
var $69=$24;
var $_sum257=((($_sum231)+(24))|0);
var $70=(($mem+$_sum257)|0);
var $71=$70;
var $72=HEAP32[(($71)>>2)];
var $_sum258=((($_sum231)+(12))|0);
var $73=(($mem+$_sum258)|0);
var $74=$73;
var $75=HEAP32[(($74)>>2)];
var $76=($75|0)==($69|0);
if($76){label=27;break;}else{label=22;break;}
case 22:
var $_sum264=((($_sum231)+(8))|0);
var $78=(($mem+$_sum264)|0);
var $79=$78;
var $80=HEAP32[(($79)>>2)];
var $81=$80;
var $82=($81>>>0)<($5>>>0);
if($82){label=26;break;}else{label=23;break;}
case 23:
var $84=(($80+12)|0);
var $85=HEAP32[(($84)>>2)];
var $86=($85|0)==($69|0);
if($86){label=24;break;}else{label=26;break;}
case 24:
var $88=(($75+8)|0);
var $89=HEAP32[(($88)>>2)];
var $90=($89|0)==($69|0);
if($90){label=25;break;}else{label=26;break;}
case 25:
HEAP32[(($84)>>2)]=$75;
HEAP32[(($88)>>2)]=$80;
var $R_1=$75;label=34;break;
case 26:
_abort();
throw "Reached an unreachable!";
case 27:
var $_sum260=((($_sum231)+(20))|0);
var $93=(($mem+$_sum260)|0);
var $94=$93;
var $95=HEAP32[(($94)>>2)];
var $96=($95|0)==0;
if($96){label=28;break;}else{var $R_0=$95;var $RP_0=$94;label=29;break;}
case 28:
var $_sum259=((($_sum231)+(16))|0);
var $98=(($mem+$_sum259)|0);
var $99=$98;
var $100=HEAP32[(($99)>>2)];
var $101=($100|0)==0;
if($101){var $R_1=0;label=34;break;}else{var $R_0=$100;var $RP_0=$99;label=29;break;}
case 29:
var $RP_0;
var $R_0;
var $102=(($R_0+20)|0);
var $103=HEAP32[(($102)>>2)];
var $104=($103|0)==0;
if($104){label=30;break;}else{var $R_0=$103;var $RP_0=$102;label=29;break;}
case 30:
var $106=(($R_0+16)|0);
var $107=HEAP32[(($106)>>2)];
var $108=($107|0)==0;
if($108){label=31;break;}else{var $R_0=$107;var $RP_0=$106;label=29;break;}
case 31:
var $110=$RP_0;
var $111=($110>>>0)<($5>>>0);
if($111){label=33;break;}else{label=32;break;}
case 32:
HEAP32[(($RP_0)>>2)]=0;
var $R_1=$R_0;label=34;break;
case 33:
_abort();
throw "Reached an unreachable!";
case 34:
var $R_1;
var $115=($72|0)==0;
if($115){var $p_0=$25;var $psize_0=$26;label=56;break;}else{label=35;break;}
case 35:
var $_sum261=((($_sum231)+(28))|0);
var $117=(($mem+$_sum261)|0);
var $118=$117;
var $119=HEAP32[(($118)>>2)];
var $120=((1256+($119<<2))|0);
var $121=HEAP32[(($120)>>2)];
var $122=($69|0)==($121|0);
if($122){label=36;break;}else{label=38;break;}
case 36:
HEAP32[(($120)>>2)]=$R_1;
var $cond=($R_1|0)==0;
if($cond){label=37;break;}else{label=44;break;}
case 37:
var $124=HEAP32[(($118)>>2)];
var $125=1<<$124;
var $126=$125^-1;
var $127=HEAP32[((956)>>2)];
var $128=$127&$126;
HEAP32[((956)>>2)]=$128;
var $p_0=$25;var $psize_0=$26;label=56;break;
case 38:
var $130=$72;
var $131=HEAP32[((968)>>2)];
var $132=($130>>>0)<($131>>>0);
if($132){label=42;break;}else{label=39;break;}
case 39:
var $134=(($72+16)|0);
var $135=HEAP32[(($134)>>2)];
var $136=($135|0)==($69|0);
if($136){label=40;break;}else{label=41;break;}
case 40:
HEAP32[(($134)>>2)]=$R_1;
label=43;break;
case 41:
var $139=(($72+20)|0);
HEAP32[(($139)>>2)]=$R_1;
label=43;break;
case 42:
_abort();
throw "Reached an unreachable!";
case 43:
var $142=($R_1|0)==0;
if($142){var $p_0=$25;var $psize_0=$26;label=56;break;}else{label=44;break;}
case 44:
var $144=$R_1;
var $145=HEAP32[((968)>>2)];
var $146=($144>>>0)<($145>>>0);
if($146){label=53;break;}else{label=45;break;}
case 45:
var $148=(($R_1+24)|0);
HEAP32[(($148)>>2)]=$72;
var $_sum262=((($_sum231)+(16))|0);
var $149=(($mem+$_sum262)|0);
var $150=$149;
var $151=HEAP32[(($150)>>2)];
var $152=($151|0)==0;
if($152){label=49;break;}else{label=46;break;}
case 46:
var $154=$151;
var $155=HEAP32[((968)>>2)];
var $156=($154>>>0)<($155>>>0);
if($156){label=48;break;}else{label=47;break;}
case 47:
var $158=(($R_1+16)|0);
HEAP32[(($158)>>2)]=$151;
var $159=(($151+24)|0);
HEAP32[(($159)>>2)]=$R_1;
label=49;break;
case 48:
_abort();
throw "Reached an unreachable!";
case 49:
var $_sum263=((($_sum231)+(20))|0);
var $162=(($mem+$_sum263)|0);
var $163=$162;
var $164=HEAP32[(($163)>>2)];
var $165=($164|0)==0;
if($165){var $p_0=$25;var $psize_0=$26;label=56;break;}else{label=50;break;}
case 50:
var $167=$164;
var $168=HEAP32[((968)>>2)];
var $169=($167>>>0)<($168>>>0);
if($169){label=52;break;}else{label=51;break;}
case 51:
var $171=(($R_1+20)|0);
HEAP32[(($171)>>2)]=$164;
var $172=(($164+24)|0);
HEAP32[(($172)>>2)]=$R_1;
var $p_0=$25;var $psize_0=$26;label=56;break;
case 52:
_abort();
throw "Reached an unreachable!";
case 53:
_abort();
throw "Reached an unreachable!";
case 54:
var $_sum232=((($14)-(4))|0);
var $176=(($mem+$_sum232)|0);
var $177=$176;
var $178=HEAP32[(($177)>>2)];
var $179=$178&3;
var $180=($179|0)==3;
if($180){label=55;break;}else{var $p_0=$25;var $psize_0=$26;label=56;break;}
case 55:
HEAP32[((960)>>2)]=$26;
var $182=HEAP32[(($177)>>2)];
var $183=$182&-2;
HEAP32[(($177)>>2)]=$183;
var $184=$26|1;
var $_sum255=((($_sum231)+(4))|0);
var $185=(($mem+$_sum255)|0);
var $186=$185;
HEAP32[(($186)>>2)]=$184;
var $187=$15;
HEAP32[(($187)>>2)]=$26;
label=140;break;
case 56:
var $psize_0;
var $p_0;
var $189=$p_0;
var $190=($189>>>0)<($15>>>0);
if($190){label=57;break;}else{label=139;break;}
case 57:
var $_sum254=((($14)-(4))|0);
var $192=(($mem+$_sum254)|0);
var $193=$192;
var $194=HEAP32[(($193)>>2)];
var $195=$194&1;
var $196=($195|0)==0;
if($196){label=139;break;}else{label=58;break;}
case 58:
var $198=$194&2;
var $199=($198|0)==0;
if($199){label=59;break;}else{label=112;break;}
case 59:
var $201=HEAP32[((976)>>2)];
var $202=($16|0)==($201|0);
if($202){label=60;break;}else{label=62;break;}
case 60:
var $204=HEAP32[((964)>>2)];
var $205=((($204)+($psize_0))|0);
HEAP32[((964)>>2)]=$205;
HEAP32[((976)>>2)]=$p_0;
var $206=$205|1;
var $207=(($p_0+4)|0);
HEAP32[(($207)>>2)]=$206;
var $208=HEAP32[((972)>>2)];
var $209=($p_0|0)==($208|0);
if($209){label=61;break;}else{label=140;break;}
case 61:
HEAP32[((972)>>2)]=0;
HEAP32[((960)>>2)]=0;
label=140;break;
case 62:
var $212=HEAP32[((972)>>2)];
var $213=($16|0)==($212|0);
if($213){label=63;break;}else{label=64;break;}
case 63:
var $215=HEAP32[((960)>>2)];
var $216=((($215)+($psize_0))|0);
HEAP32[((960)>>2)]=$216;
HEAP32[((972)>>2)]=$p_0;
var $217=$216|1;
var $218=(($p_0+4)|0);
HEAP32[(($218)>>2)]=$217;
var $219=(($189+$216)|0);
var $220=$219;
HEAP32[(($220)>>2)]=$216;
label=140;break;
case 64:
var $222=$194&-8;
var $223=((($222)+($psize_0))|0);
var $224=$194>>>3;
var $225=($194>>>0)<256;
if($225){label=65;break;}else{label=77;break;}
case 65:
var $227=(($mem+$14)|0);
var $228=$227;
var $229=HEAP32[(($228)>>2)];
var $_sum252253=$14|4;
var $230=(($mem+$_sum252253)|0);
var $231=$230;
var $232=HEAP32[(($231)>>2)];
var $233=$224<<1;
var $234=((992+($233<<2))|0);
var $235=$234;
var $236=($229|0)==($235|0);
if($236){label=68;break;}else{label=66;break;}
case 66:
var $238=$229;
var $239=HEAP32[((968)>>2)];
var $240=($238>>>0)<($239>>>0);
if($240){label=76;break;}else{label=67;break;}
case 67:
var $242=(($229+12)|0);
var $243=HEAP32[(($242)>>2)];
var $244=($243|0)==($16|0);
if($244){label=68;break;}else{label=76;break;}
case 68:
var $245=($232|0)==($229|0);
if($245){label=69;break;}else{label=70;break;}
case 69:
var $247=1<<$224;
var $248=$247^-1;
var $249=HEAP32[((952)>>2)];
var $250=$249&$248;
HEAP32[((952)>>2)]=$250;
label=110;break;
case 70:
var $252=($232|0)==($235|0);
if($252){label=71;break;}else{label=72;break;}
case 71:
var $_pre288=(($232+8)|0);
var $_pre_phi289=$_pre288;label=74;break;
case 72:
var $254=$232;
var $255=HEAP32[((968)>>2)];
var $256=($254>>>0)<($255>>>0);
if($256){label=75;break;}else{label=73;break;}
case 73:
var $258=(($232+8)|0);
var $259=HEAP32[(($258)>>2)];
var $260=($259|0)==($16|0);
if($260){var $_pre_phi289=$258;label=74;break;}else{label=75;break;}
case 74:
var $_pre_phi289;
var $261=(($229+12)|0);
HEAP32[(($261)>>2)]=$232;
HEAP32[(($_pre_phi289)>>2)]=$229;
label=110;break;
case 75:
_abort();
throw "Reached an unreachable!";
case 76:
_abort();
throw "Reached an unreachable!";
case 77:
var $263=$15;
var $_sum234=((($14)+(16))|0);
var $264=(($mem+$_sum234)|0);
var $265=$264;
var $266=HEAP32[(($265)>>2)];
var $_sum235236=$14|4;
var $267=(($mem+$_sum235236)|0);
var $268=$267;
var $269=HEAP32[(($268)>>2)];
var $270=($269|0)==($263|0);
if($270){label=83;break;}else{label=78;break;}
case 78:
var $272=(($mem+$14)|0);
var $273=$272;
var $274=HEAP32[(($273)>>2)];
var $275=$274;
var $276=HEAP32[((968)>>2)];
var $277=($275>>>0)<($276>>>0);
if($277){label=82;break;}else{label=79;break;}
case 79:
var $279=(($274+12)|0);
var $280=HEAP32[(($279)>>2)];
var $281=($280|0)==($263|0);
if($281){label=80;break;}else{label=82;break;}
case 80:
var $283=(($269+8)|0);
var $284=HEAP32[(($283)>>2)];
var $285=($284|0)==($263|0);
if($285){label=81;break;}else{label=82;break;}
case 81:
HEAP32[(($279)>>2)]=$269;
HEAP32[(($283)>>2)]=$274;
var $R7_1=$269;label=90;break;
case 82:
_abort();
throw "Reached an unreachable!";
case 83:
var $_sum238=((($14)+(12))|0);
var $288=(($mem+$_sum238)|0);
var $289=$288;
var $290=HEAP32[(($289)>>2)];
var $291=($290|0)==0;
if($291){label=84;break;}else{var $R7_0=$290;var $RP9_0=$289;label=85;break;}
case 84:
var $_sum237=((($14)+(8))|0);
var $293=(($mem+$_sum237)|0);
var $294=$293;
var $295=HEAP32[(($294)>>2)];
var $296=($295|0)==0;
if($296){var $R7_1=0;label=90;break;}else{var $R7_0=$295;var $RP9_0=$294;label=85;break;}
case 85:
var $RP9_0;
var $R7_0;
var $297=(($R7_0+20)|0);
var $298=HEAP32[(($297)>>2)];
var $299=($298|0)==0;
if($299){label=86;break;}else{var $R7_0=$298;var $RP9_0=$297;label=85;break;}
case 86:
var $301=(($R7_0+16)|0);
var $302=HEAP32[(($301)>>2)];
var $303=($302|0)==0;
if($303){label=87;break;}else{var $R7_0=$302;var $RP9_0=$301;label=85;break;}
case 87:
var $305=$RP9_0;
var $306=HEAP32[((968)>>2)];
var $307=($305>>>0)<($306>>>0);
if($307){label=89;break;}else{label=88;break;}
case 88:
HEAP32[(($RP9_0)>>2)]=0;
var $R7_1=$R7_0;label=90;break;
case 89:
_abort();
throw "Reached an unreachable!";
case 90:
var $R7_1;
var $311=($266|0)==0;
if($311){label=110;break;}else{label=91;break;}
case 91:
var $_sum247=((($14)+(20))|0);
var $313=(($mem+$_sum247)|0);
var $314=$313;
var $315=HEAP32[(($314)>>2)];
var $316=((1256+($315<<2))|0);
var $317=HEAP32[(($316)>>2)];
var $318=($263|0)==($317|0);
if($318){label=92;break;}else{label=94;break;}
case 92:
HEAP32[(($316)>>2)]=$R7_1;
var $cond283=($R7_1|0)==0;
if($cond283){label=93;break;}else{label=100;break;}
case 93:
var $320=HEAP32[(($314)>>2)];
var $321=1<<$320;
var $322=$321^-1;
var $323=HEAP32[((956)>>2)];
var $324=$323&$322;
HEAP32[((956)>>2)]=$324;
label=110;break;
case 94:
var $326=$266;
var $327=HEAP32[((968)>>2)];
var $328=($326>>>0)<($327>>>0);
if($328){label=98;break;}else{label=95;break;}
case 95:
var $330=(($266+16)|0);
var $331=HEAP32[(($330)>>2)];
var $332=($331|0)==($263|0);
if($332){label=96;break;}else{label=97;break;}
case 96:
HEAP32[(($330)>>2)]=$R7_1;
label=99;break;
case 97:
var $335=(($266+20)|0);
HEAP32[(($335)>>2)]=$R7_1;
label=99;break;
case 98:
_abort();
throw "Reached an unreachable!";
case 99:
var $338=($R7_1|0)==0;
if($338){label=110;break;}else{label=100;break;}
case 100:
var $340=$R7_1;
var $341=HEAP32[((968)>>2)];
var $342=($340>>>0)<($341>>>0);
if($342){label=109;break;}else{label=101;break;}
case 101:
var $344=(($R7_1+24)|0);
HEAP32[(($344)>>2)]=$266;
var $_sum248=((($14)+(8))|0);
var $345=(($mem+$_sum248)|0);
var $346=$345;
var $347=HEAP32[(($346)>>2)];
var $348=($347|0)==0;
if($348){label=105;break;}else{label=102;break;}
case 102:
var $350=$347;
var $351=HEAP32[((968)>>2)];
var $352=($350>>>0)<($351>>>0);
if($352){label=104;break;}else{label=103;break;}
case 103:
var $354=(($R7_1+16)|0);
HEAP32[(($354)>>2)]=$347;
var $355=(($347+24)|0);
HEAP32[(($355)>>2)]=$R7_1;
label=105;break;
case 104:
_abort();
throw "Reached an unreachable!";
case 105:
var $_sum249=((($14)+(12))|0);
var $358=(($mem+$_sum249)|0);
var $359=$358;
var $360=HEAP32[(($359)>>2)];
var $361=($360|0)==0;
if($361){label=110;break;}else{label=106;break;}
case 106:
var $363=$360;
var $364=HEAP32[((968)>>2)];
var $365=($363>>>0)<($364>>>0);
if($365){label=108;break;}else{label=107;break;}
case 107:
var $367=(($R7_1+20)|0);
HEAP32[(($367)>>2)]=$360;
var $368=(($360+24)|0);
HEAP32[(($368)>>2)]=$R7_1;
label=110;break;
case 108:
_abort();
throw "Reached an unreachable!";
case 109:
_abort();
throw "Reached an unreachable!";
case 110:
var $372=$223|1;
var $373=(($p_0+4)|0);
HEAP32[(($373)>>2)]=$372;
var $374=(($189+$223)|0);
var $375=$374;
HEAP32[(($375)>>2)]=$223;
var $376=HEAP32[((972)>>2)];
var $377=($p_0|0)==($376|0);
if($377){label=111;break;}else{var $psize_1=$223;label=113;break;}
case 111:
HEAP32[((960)>>2)]=$223;
label=140;break;
case 112:
var $380=$194&-2;
HEAP32[(($193)>>2)]=$380;
var $381=$psize_0|1;
var $382=(($p_0+4)|0);
HEAP32[(($382)>>2)]=$381;
var $383=(($189+$psize_0)|0);
var $384=$383;
HEAP32[(($384)>>2)]=$psize_0;
var $psize_1=$psize_0;label=113;break;
case 113:
var $psize_1;
var $386=$psize_1>>>3;
var $387=($psize_1>>>0)<256;
if($387){label=114;break;}else{label=119;break;}
case 114:
var $389=$386<<1;
var $390=((992+($389<<2))|0);
var $391=$390;
var $392=HEAP32[((952)>>2)];
var $393=1<<$386;
var $394=$392&$393;
var $395=($394|0)==0;
if($395){label=115;break;}else{label=116;break;}
case 115:
var $397=$392|$393;
HEAP32[((952)>>2)]=$397;
var $_sum245_pre=((($389)+(2))|0);
var $_pre=((992+($_sum245_pre<<2))|0);
var $F16_0=$391;var $_pre_phi=$_pre;label=118;break;
case 116:
var $_sum246=((($389)+(2))|0);
var $399=((992+($_sum246<<2))|0);
var $400=HEAP32[(($399)>>2)];
var $401=$400;
var $402=HEAP32[((968)>>2)];
var $403=($401>>>0)<($402>>>0);
if($403){label=117;break;}else{var $F16_0=$400;var $_pre_phi=$399;label=118;break;}
case 117:
_abort();
throw "Reached an unreachable!";
case 118:
var $_pre_phi;
var $F16_0;
HEAP32[(($_pre_phi)>>2)]=$p_0;
var $406=(($F16_0+12)|0);
HEAP32[(($406)>>2)]=$p_0;
var $407=(($p_0+8)|0);
HEAP32[(($407)>>2)]=$F16_0;
var $408=(($p_0+12)|0);
HEAP32[(($408)>>2)]=$391;
label=140;break;
case 119:
var $410=$p_0;
var $411=$psize_1>>>8;
var $412=($411|0)==0;
if($412){var $I18_0=0;label=122;break;}else{label=120;break;}
case 120:
var $414=($psize_1>>>0)>16777215;
if($414){var $I18_0=31;label=122;break;}else{label=121;break;}
case 121:
var $416=((($411)+(1048320))|0);
var $417=$416>>>16;
var $418=$417&8;
var $419=$411<<$418;
var $420=((($419)+(520192))|0);
var $421=$420>>>16;
var $422=$421&4;
var $423=$422|$418;
var $424=$419<<$422;
var $425=((($424)+(245760))|0);
var $426=$425>>>16;
var $427=$426&2;
var $428=$423|$427;
var $429=(((14)-($428))|0);
var $430=$424<<$427;
var $431=$430>>>15;
var $432=((($429)+($431))|0);
var $433=$432<<1;
var $434=((($432)+(7))|0);
var $435=$psize_1>>>($434>>>0);
var $436=$435&1;
var $437=$436|$433;
var $I18_0=$437;label=122;break;
case 122:
var $I18_0;
var $439=((1256+($I18_0<<2))|0);
var $440=(($p_0+28)|0);
var $I18_0_c=$I18_0;
HEAP32[(($440)>>2)]=$I18_0_c;
var $441=(($p_0+20)|0);
HEAP32[(($441)>>2)]=0;
var $442=(($p_0+16)|0);
HEAP32[(($442)>>2)]=0;
var $443=HEAP32[((956)>>2)];
var $444=1<<$I18_0;
var $445=$443&$444;
var $446=($445|0)==0;
if($446){label=123;break;}else{label=124;break;}
case 123:
var $448=$443|$444;
HEAP32[((956)>>2)]=$448;
HEAP32[(($439)>>2)]=$410;
var $449=(($p_0+24)|0);
var $_c=$439;
HEAP32[(($449)>>2)]=$_c;
var $450=(($p_0+12)|0);
HEAP32[(($450)>>2)]=$p_0;
var $451=(($p_0+8)|0);
HEAP32[(($451)>>2)]=$p_0;
label=136;break;
case 124:
var $453=HEAP32[(($439)>>2)];
var $454=($I18_0|0)==31;
if($454){var $459=0;label=126;break;}else{label=125;break;}
case 125:
var $456=$I18_0>>>1;
var $457=(((25)-($456))|0);
var $459=$457;label=126;break;
case 126:
var $459;
var $460=$psize_1<<$459;
var $K19_0=$460;var $T_0=$453;label=127;break;
case 127:
var $T_0;
var $K19_0;
var $462=(($T_0+4)|0);
var $463=HEAP32[(($462)>>2)];
var $464=$463&-8;
var $465=($464|0)==($psize_1|0);
if($465){label=132;break;}else{label=128;break;}
case 128:
var $467=$K19_0>>>31;
var $468=(($T_0+16+($467<<2))|0);
var $469=HEAP32[(($468)>>2)];
var $470=($469|0)==0;
var $471=$K19_0<<1;
if($470){label=129;break;}else{var $K19_0=$471;var $T_0=$469;label=127;break;}
case 129:
var $473=$468;
var $474=HEAP32[((968)>>2)];
var $475=($473>>>0)<($474>>>0);
if($475){label=131;break;}else{label=130;break;}
case 130:
HEAP32[(($468)>>2)]=$410;
var $477=(($p_0+24)|0);
var $T_0_c242=$T_0;
HEAP32[(($477)>>2)]=$T_0_c242;
var $478=(($p_0+12)|0);
HEAP32[(($478)>>2)]=$p_0;
var $479=(($p_0+8)|0);
HEAP32[(($479)>>2)]=$p_0;
label=136;break;
case 131:
_abort();
throw "Reached an unreachable!";
case 132:
var $482=(($T_0+8)|0);
var $483=HEAP32[(($482)>>2)];
var $484=$T_0;
var $485=HEAP32[((968)>>2)];
var $486=($484>>>0)<($485>>>0);
if($486){label=135;break;}else{label=133;break;}
case 133:
var $488=$483;
var $489=($488>>>0)<($485>>>0);
if($489){label=135;break;}else{label=134;break;}
case 134:
var $491=(($483+12)|0);
HEAP32[(($491)>>2)]=$410;
HEAP32[(($482)>>2)]=$410;
var $492=(($p_0+8)|0);
var $_c241=$483;
HEAP32[(($492)>>2)]=$_c241;
var $493=(($p_0+12)|0);
var $T_0_c=$T_0;
HEAP32[(($493)>>2)]=$T_0_c;
var $494=(($p_0+24)|0);
HEAP32[(($494)>>2)]=0;
label=136;break;
case 135:
_abort();
throw "Reached an unreachable!";
case 136:
var $496=HEAP32[((984)>>2)];
var $497=((($496)-(1))|0);
HEAP32[((984)>>2)]=$497;
var $498=($497|0)==0;
if($498){var $sp_0_in_i=1408;label=137;break;}else{label=140;break;}
case 137:
var $sp_0_in_i;
var $sp_0_i=HEAP32[(($sp_0_in_i)>>2)];
var $499=($sp_0_i|0)==0;
var $500=(($sp_0_i+8)|0);
if($499){label=138;break;}else{var $sp_0_in_i=$500;label=137;break;}
case 138:
HEAP32[((984)>>2)]=-1;
label=140;break;
case 139:
_abort();
throw "Reached an unreachable!";
case 140:
return;
default: assert(0, "bad label: " + label);
}
}
Module["_free"] = _free;
// EMSCRIPTEN_END_FUNCS
// EMSCRIPTEN_END_FUNCS
// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
var i64Math = null;
// === Auto-generated postamble setup entry stuff ===
if (memoryInitializer) {
function applyData(data) {
HEAPU8.set(data, STATIC_BASE);
}
if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
applyData(Module['readBinary'](memoryInitializer));
} else {
addRunDependency('memory initializer');
Browser.asyncLoad(memoryInitializer, function(data) {
applyData(data);
removeRunDependency('memory initializer');
}, function(data) {
throw 'could not load memory initializer ' + memoryInitializer;
});
}
}
function ExitStatus(status) {
this.name = "ExitStatus";
this.message = "Program terminated with exit(" + status + ")";
this.status = status;
};
ExitStatus.prototype = new Error();
ExitStatus.prototype.constructor = ExitStatus;
var initialStackTop;
var preloadStartTime = null;
var calledMain = false;
dependenciesFulfilled = function runCaller() {
// If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
if (!Module['calledRun'] && shouldRunNow) run();
if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
}
Module['callMain'] = Module.callMain = function callMain(args) {
assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
args = args || [];
if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
Module.printErr('preload time: ' + (Date.now() - preloadStartTime) + ' ms');
}
ensureInitRuntime();
var argc = args.length+1;
function pad() {
for (var i = 0; i < 4-1; i++) {
argv.push(0);
}
}
var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
pad();
for (var i = 0; i < argc-1; i = i + 1) {
argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
pad();
}
argv.push(0);
argv = allocate(argv, 'i32', ALLOC_NORMAL);
initialStackTop = STACKTOP;
try {
var ret = Module['_main'](argc, argv, 0);
// if we're not running an evented main loop, it's time to exit
if (!Module['noExitRuntime']) {
exit(ret);
}
}
catch(e) {
if (e instanceof ExitStatus) {
// exit() throws this once it's done to make sure execution
// has been stopped completely
return;
} else if (e == 'SimulateInfiniteLoop') {
// running an evented main loop, don't immediately exit
Module['noExitRuntime'] = true;
return;
} else {
if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
throw e;
}
} finally {
calledMain = true;
}
}
function run(args) {
args = args || Module['arguments'];
if (preloadStartTime === null) preloadStartTime = Date.now();
if (runDependencies > 0) {
Module.printErr('run() called, but dependencies remain, so not running');
return;
}
preRun();
if (runDependencies > 0) {
// a preRun added a dependency, run will be called later
return;
}
function doRun() {
ensureInitRuntime();
preMain();
Module['calledRun'] = true;
if (Module['_main'] && shouldRunNow) {
Module['callMain'](args);
}
postRun();
}
if (Module['setStatus']) {
Module['setStatus']('Running...');
setTimeout(function() {
setTimeout(function() {
Module['setStatus']('');
}, 1);
if (!ABORT) doRun();
}, 1);
} else {
doRun();
}
}
Module['run'] = Module.run = run;
function exit(status) {
ABORT = true;
EXITSTATUS = status;
STACKTOP = initialStackTop;
// exit the runtime
exitRuntime();
// TODO We should handle this differently based on environment.
// In the browser, the best we can do is throw an exception
// to halt execution, but in node we could process.exit and
// I'd imagine SM shell would have something equivalent.
// This would let us set a proper exit status (which
// would be great for checking test exit statuses).
// https://github.com/kripken/emscripten/issues/1371
// throw an exception to halt the current execution
throw new ExitStatus(status);
}
Module['exit'] = Module.exit = exit;
function abort(text) {
if (text) {
Module.print(text);
Module.printErr(text);
}
ABORT = true;
EXITSTATUS = 1;
throw 'abort() at ' + stackTrace();
}
Module['abort'] = Module.abort = abort;
// {{PRE_RUN_ADDITIONS}}
if (Module['preInit']) {
if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
while (Module['preInit'].length > 0) {
Module['preInit'].pop()();
}
}
// shouldRunNow refers to calling main(), not run().
var shouldRunNow = true;
if (Module['noInitialRun']) {
shouldRunNow = false;
}
run();
// {{POST_RUN_ADDITIONS}}
// {{MODULE_ADDITIONS}}
//@ sourceMappingURL=Simple_Texture2D.js.map
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment