· 10 years ago · May 27, 2016, 08:00 PM
1// The Module object: Our interface to the outside world. We import
2// and export values on it, and do the work to get that through
3// closure compiler if necessary. There are various ways Module can be used:
4// 1. Not defined. We create it here
5// 2. A function parameter, function(Module) { ..generated code.. }
6// 3. pre-run appended it, var Module = {}; ..generated code..
7// 4. External script tag defines var Module.
8// We need to do an eval in order to handle the closure compiler
9// case, where this code here is minified but Module was defined
10// elsewhere (e.g. case 4 above). We also need to check if Module
11// already exists (e.g. case 3 above).
12// Note that if you want to run closure, and also to use Module
13// after the generated code, you will need to define var Module = {};
14// before the code. Then that object will be used in the code, and you
15// can continue to use Module afterwards as well.
16var Module;
17if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
18
19// Sometimes an existing Module object exists with properties
20// meant to overwrite the default module functionality. Here
21// we collect those properties and reapply _after_ we configure
22// the current environment's defaults to avoid having to be so
23// defensive during initialization.
24var moduleOverrides = {};
25for (var key in Module) {
26 if (Module.hasOwnProperty(key)) {
27 moduleOverrides[key] = Module[key];
28 }
29}
30
31// The environment setup code below is customized to use Module.
32// *** Environment setup code ***
33var ENVIRONMENT_IS_WEB = typeof window === 'object';
34// Three configurations we can be running in:
35// 1) We could be the application main() thread running in the main JS UI thread. (ENVIRONMENT_IS_WORKER == false and ENVIRONMENT_IS_PTHREAD == false)
36// 2) We could be the application main() thread proxied to worker. (with Emscripten -s PROXY_TO_WORKER=1) (ENVIRONMENT_IS_WORKER == true, ENVIRONMENT_IS_PTHREAD == false)
37// 3) We could be an application pthread running in a worker. (ENVIRONMENT_IS_WORKER == true and ENVIRONMENT_IS_PTHREAD == true)
38var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
39var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function' && !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_WORKER;
40var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
41
42if (ENVIRONMENT_IS_NODE) {
43 // Expose functionality in the same simple way that the shells work
44 // Note that we pollute the global namespace here, otherwise we break in node
45 if (!Module['print']) Module['print'] = function print(x) {
46 process['stdout'].write(x + '\n');
47 };
48 if (!Module['printErr']) Module['printErr'] = function printErr(x) {
49 process['stderr'].write(x + '\n');
50 };
51
52 var nodeFS = require('fs');
53 var nodePath = require('path');
54
55 Module['read'] = function read(filename, binary) {
56 filename = nodePath['normalize'](filename);
57 var ret = nodeFS['readFileSync'](filename);
58 // The path is absolute if the normalized version is the same as the resolved.
59 if (!ret && filename != nodePath['resolve'](filename)) {
60 filename = path.join(__dirname, '..', 'src', filename);
61 ret = nodeFS['readFileSync'](filename);
62 }
63 if (ret && !binary) ret = ret.toString();
64 return ret;
65 };
66
67 Module['readBinary'] = function readBinary(filename) {
68 var ret = Module['read'](filename, true);
69 if (!ret.buffer) {
70 ret = new Uint8Array(ret);
71 }
72 assert(ret.buffer);
73 return ret;
74 };
75
76 Module['load'] = function load(f) {
77 globalEval(read(f));
78 };
79
80 if (!Module['thisProgram']) {
81 if (process['argv'].length > 1) {
82 Module['thisProgram'] = process['argv'][1].replace(/\\/g, '/');
83 } else {
84 Module['thisProgram'] = 'unknown-program';
85 }
86 }
87
88 Module['arguments'] = process['argv'].slice(2);
89
90 if (typeof module !== 'undefined') {
91 module['exports'] = Module;
92 }
93
94 process['on']('uncaughtException', function(ex) {
95 // suppress ExitStatus exceptions from showing an error
96 if (!(ex instanceof ExitStatus)) {
97 throw ex;
98 }
99 });
100
101 Module['inspect'] = function () { return '[Emscripten Module object]'; };
102}
103else if (ENVIRONMENT_IS_SHELL) {
104 if (!Module['print']) Module['print'] = print;
105 if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
106
107 if (typeof read != 'undefined') {
108 Module['read'] = read;
109 } else {
110 Module['read'] = function read() { throw 'no read() available (jsc?)' };
111 }
112
113 Module['readBinary'] = function readBinary(f) {
114 if (typeof readbuffer === 'function') {
115 return new Uint8Array(readbuffer(f));
116 }
117 var data = read(f, 'binary');
118 assert(typeof data === 'object');
119 return data;
120 };
121
122 if (typeof scriptArgs != 'undefined') {
123 Module['arguments'] = scriptArgs;
124 } else if (typeof arguments != 'undefined') {
125 Module['arguments'] = arguments;
126 }
127
128}
129else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
130 Module['read'] = function read(url) {
131 var xhr = new XMLHttpRequest();
132 xhr.open('GET', url, false);
133 xhr.send(null);
134 return xhr.responseText;
135 };
136
137 if (typeof arguments != 'undefined') {
138 Module['arguments'] = arguments;
139 }
140
141 if (typeof console !== 'undefined') {
142 if (!Module['print']) Module['print'] = function print(x) {
143 console.log(x);
144 };
145 if (!Module['printErr']) Module['printErr'] = function printErr(x) {
146 console.log(x);
147 };
148 } else {
149 // Probably a worker, and without console.log. We can do very little here...
150 var TRY_USE_DUMP = false;
151 if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
152 dump(x);
153 }) : (function(x) {
154 // self.postMessage(x); // enable this if you want stdout to be sent as messages
155 }));
156 }
157
158 if (ENVIRONMENT_IS_WORKER) {
159 Module['load'] = importScripts;
160 }
161
162 if (typeof Module['setWindowTitle'] === 'undefined') {
163 Module['setWindowTitle'] = function(title) { document.title = title };
164 }
165}
166else {
167 // Unreachable because SHELL is dependant on the others
168 throw 'Unknown runtime environment. Where are we?';
169}
170
171function globalEval(x) {
172 eval.call(null, x);
173}
174if (!Module['load'] && Module['read']) {
175 Module['load'] = function load(f) {
176 globalEval(Module['read'](f));
177 };
178}
179if (!Module['print']) {
180 Module['print'] = function(){};
181}
182if (!Module['printErr']) {
183 Module['printErr'] = Module['print'];
184}
185if (!Module['arguments']) {
186 Module['arguments'] = [];
187}
188if (!Module['thisProgram']) {
189 Module['thisProgram'] = './this.program';
190}
191
192// *** Environment setup code ***
193
194// Closure helpers
195Module.print = Module['print'];
196Module.printErr = Module['printErr'];
197
198// Callbacks
199Module['preRun'] = [];
200Module['postRun'] = [];
201
202// Merge back in the overrides
203for (var key in moduleOverrides) {
204 if (moduleOverrides.hasOwnProperty(key)) {
205 Module[key] = moduleOverrides[key];
206 }
207}
208
209
210
211// === Preamble library stuff ===
212
213// Documentation for the public APIs defined in this file must be updated in:
214// site/source/docs/api_reference/preamble.js.rst
215// A prebuilt local version of the documentation is available at:
216// site/build/text/docs/api_reference/preamble.js.txt
217// You can also build docs locally as HTML or other formats in site/
218// An online HTML version (which may be of a different version of Emscripten)
219// is up at http://kripken.github.io/emscripten-site/docs/api_reference/preamble.js.html
220
221//========================================
222// Runtime code shared with compiler
223//========================================
224
225var Runtime = {
226 setTempRet0: function (value) {
227 tempRet0 = value;
228 },
229 getTempRet0: function () {
230 return tempRet0;
231 },
232 stackSave: function () {
233 return STACKTOP;
234 },
235 stackRestore: function (stackTop) {
236 STACKTOP = stackTop;
237 },
238 getNativeTypeSize: function (type) {
239 switch (type) {
240 case 'i1': case 'i8': return 1;
241 case 'i16': return 2;
242 case 'i32': return 4;
243 case 'i64': return 8;
244 case 'float': return 4;
245 case 'double': return 8;
246 default: {
247 if (type[type.length-1] === '*') {
248 return Runtime.QUANTUM_SIZE; // A pointer
249 } else if (type[0] === 'i') {
250 var bits = parseInt(type.substr(1));
251 assert(bits % 8 === 0);
252 return bits/8;
253 } else {
254 return 0;
255 }
256 }
257 }
258 },
259 getNativeFieldSize: function (type) {
260 return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
261 },
262 STACK_ALIGN: 16,
263 prepVararg: function (ptr, type) {
264 if (type === 'double' || type === 'i64') {
265 // move so the load is aligned
266 if (ptr & 7) {
267 assert((ptr & 7) === 4);
268 ptr += 4;
269 }
270 } else {
271 assert((ptr & 3) === 0);
272 }
273 return ptr;
274 },
275 getAlignSize: function (type, size, vararg) {
276 // we align i64s and doubles on 64-bit boundaries, unlike x86
277 if (!vararg && (type == 'i64' || type == 'double')) return 8;
278 if (!type) return Math.min(size, 8); // align structures internally to 64 bits
279 return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
280 },
281 dynCall: function (sig, ptr, args) {
282 if (args && args.length) {
283 assert(args.length == sig.length-1);
284 if (!args.splice) args = Array.prototype.slice.call(args);
285 args.splice(0, 0, ptr);
286 assert(('dynCall_' + sig) in Module, 'bad function pointer type - no table for sig \'' + sig + '\'');
287 return Module['dynCall_' + sig].apply(null, args);
288 } else {
289 assert(sig.length == 1);
290 assert(('dynCall_' + sig) in Module, 'bad function pointer type - no table for sig \'' + sig + '\'');
291 return Module['dynCall_' + sig].call(null, ptr);
292 }
293 },
294 functionPointers: [],
295 addFunction: function (func) {
296 for (var i = 0; i < Runtime.functionPointers.length; i++) {
297 if (!Runtime.functionPointers[i]) {
298 Runtime.functionPointers[i] = func;
299 return 2*(1 + i);
300 }
301 }
302 throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
303 },
304 removeFunction: function (index) {
305 Runtime.functionPointers[(index-2)/2] = null;
306 },
307 warnOnce: function (text) {
308 if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
309 if (!Runtime.warnOnce.shown[text]) {
310 Runtime.warnOnce.shown[text] = 1;
311 Module.printErr(text);
312 }
313 },
314 funcWrappers: {},
315 getFuncWrapper: function (func, sig) {
316 assert(sig);
317 if (!Runtime.funcWrappers[sig]) {
318 Runtime.funcWrappers[sig] = {};
319 }
320 var sigCache = Runtime.funcWrappers[sig];
321 if (!sigCache[func]) {
322 sigCache[func] = function dynCall_wrapper() {
323 return Runtime.dynCall(sig, func, arguments);
324 };
325 }
326 return sigCache[func];
327 },
328 getCompilerSetting: function (name) {
329 throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
330 },
331 stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+15)&-16);(assert((((STACKTOP|0) < (STACK_MAX|0))|0))|0); return ret; },
332 staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + (assert(!staticSealed),size))|0;STATICTOP = (((STATICTOP)+15)&-16); return ret; },
333 dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + (assert(DYNAMICTOP > 0),size))|0;DYNAMICTOP = (((DYNAMICTOP)+15)&-16); if (DYNAMICTOP >= TOTAL_MEMORY) { var success = enlargeMemory(); if (!success) { DYNAMICTOP = ret; return 0; } }; return ret; },
334 alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 16))*(quantum ? quantum : 16); return ret; },
335 makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*4294967296.0)) : ((+((low>>>0)))+((+((high|0)))*4294967296.0))); return ret; },
336 GLOBAL_BASE: 8,
337 QUANTUM_SIZE: 4,
338 __dummy__: 0
339}
340
341
342
343Module["Runtime"] = Runtime;
344
345
346
347//========================================
348// Runtime essentials
349//========================================
350
351var __THREW__ = 0; // Used in checking for thrown exceptions.
352
353var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
354var EXITSTATUS = 0;
355
356var undef = 0;
357// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
358// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
359var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
360var tempI64, tempI64b;
361var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
362
363function assert(condition, text) {
364 if (!condition) {
365 abort('Assertion failed: ' + text);
366 }
367}
368
369var globalScope = this;
370
371// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
372function getCFunc(ident) {
373 var func = Module['_' + ident]; // closure exported function
374 if (!func) {
375 try {
376 func = eval('_' + ident); // explicit lookup
377 } catch(e) {}
378 }
379 assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
380 return func;
381}
382
383var cwrap, ccall;
384(function(){
385 var JSfuncs = {
386 // Helpers for cwrap -- it can't refer to Runtime directly because it might
387 // be renamed by closure, instead it calls JSfuncs['stackSave'].body to find
388 // out what the minified function name is.
389 'stackSave': function() {
390 Runtime.stackSave()
391 },
392 'stackRestore': function() {
393 Runtime.stackRestore()
394 },
395 // type conversion from js to c
396 'arrayToC' : function(arr) {
397 var ret = Runtime.stackAlloc(arr.length);
398 writeArrayToMemory(arr, ret);
399 return ret;
400 },
401 'stringToC' : function(str) {
402 var ret = 0;
403 if (str !== null && str !== undefined && str !== 0) { // null string
404 // at most 4 bytes per UTF-8 code point, +1 for the trailing '\0'
405 ret = Runtime.stackAlloc((str.length << 2) + 1);
406 writeStringToMemory(str, ret);
407 }
408 return ret;
409 }
410 };
411 // For fast lookup of conversion functions
412 var toC = {'string' : JSfuncs['stringToC'], 'array' : JSfuncs['arrayToC']};
413
414 // C calling interface.
415 ccall = function ccallFunc(ident, returnType, argTypes, args, opts) {
416 var func = getCFunc(ident);
417 var cArgs = [];
418 var stack = 0;
419 assert(returnType !== 'array', 'Return type should not be "array".');
420 if (args) {
421 for (var i = 0; i < args.length; i++) {
422 var converter = toC[argTypes[i]];
423 if (converter) {
424 if (stack === 0) stack = Runtime.stackSave();
425 cArgs[i] = converter(args[i]);
426 } else {
427 cArgs[i] = args[i];
428 }
429 }
430 }
431 var ret = func.apply(null, cArgs);
432 if ((!opts || !opts.async) && typeof EmterpreterAsync === 'object') {
433 assert(!EmterpreterAsync.state, 'cannot start async op with normal JS calling ccall');
434 }
435 if (opts && opts.async) assert(!returnType, 'async ccalls cannot return values');
436 if (returnType === 'string') ret = Pointer_stringify(ret);
437 if (stack !== 0) {
438 if (opts && opts.async) {
439 EmterpreterAsync.asyncFinalizers.push(function() {
440 Runtime.stackRestore(stack);
441 });
442 return;
443 }
444 Runtime.stackRestore(stack);
445 }
446 return ret;
447 }
448
449 var sourceRegex = /^function\s*\(([^)]*)\)\s*{\s*([^*]*?)[\s;]*(?:return\s*(.*?)[;\s]*)?}$/;
450 function parseJSFunc(jsfunc) {
451 // Match the body and the return value of a javascript function source
452 var parsed = jsfunc.toString().match(sourceRegex).slice(1);
453 return {arguments : parsed[0], body : parsed[1], returnValue: parsed[2]}
454 }
455 var JSsource = {};
456 for (var fun in JSfuncs) {
457 if (JSfuncs.hasOwnProperty(fun)) {
458 // Elements of toCsource are arrays of three items:
459 // the code, and the return value
460 JSsource[fun] = parseJSFunc(JSfuncs[fun]);
461 }
462 }
463
464
465 cwrap = function cwrap(ident, returnType, argTypes) {
466 argTypes = argTypes || [];
467 var cfunc = getCFunc(ident);
468 // When the function takes numbers and returns a number, we can just return
469 // the original function
470 var numericArgs = argTypes.every(function(type){ return type === 'number'});
471 var numericRet = (returnType !== 'string');
472 if ( numericRet && numericArgs) {
473 return cfunc;
474 }
475 // Creation of the arguments list (["$1","$2",...,"$nargs"])
476 var argNames = argTypes.map(function(x,i){return '$'+i});
477 var funcstr = "(function(" + argNames.join(',') + ") {";
478 var nargs = argTypes.length;
479 if (!numericArgs) {
480 // Generate the code needed to convert the arguments from javascript
481 // values to pointers
482 funcstr += 'var stack = ' + JSsource['stackSave'].body + ';';
483 for (var i = 0; i < nargs; i++) {
484 var arg = argNames[i], type = argTypes[i];
485 if (type === 'number') continue;
486 var convertCode = JSsource[type + 'ToC']; // [code, return]
487 funcstr += 'var ' + convertCode.arguments + ' = ' + arg + ';';
488 funcstr += convertCode.body + ';';
489 funcstr += arg + '=' + convertCode.returnValue + ';';
490 }
491 }
492
493 // When the code is compressed, the name of cfunc is not literally 'cfunc' anymore
494 var cfuncname = parseJSFunc(function(){return cfunc}).returnValue;
495 // Call the function
496 funcstr += 'var ret = ' + cfuncname + '(' + argNames.join(',') + ');';
497 if (!numericRet) { // Return type can only by 'string' or 'number'
498 // Convert the result to a string
499 var strgfy = parseJSFunc(function(){return Pointer_stringify}).returnValue;
500 funcstr += 'ret = ' + strgfy + '(ret);';
501 }
502 funcstr += "if (typeof EmterpreterAsync === 'object') { assert(!EmterpreterAsync.state, 'cannot start async op with normal JS calling cwrap') }";
503 if (!numericArgs) {
504 // If we had a stack, restore it
505 funcstr += JSsource['stackRestore'].body.replace('()', '(stack)') + ';';
506 }
507 funcstr += 'return ret})';
508 return eval(funcstr);
509 };
510})();
511Module["ccall"] = ccall;
512Module["cwrap"] = cwrap;
513
514function setValue(ptr, value, type, noSafe) {
515 type = type || 'i8';
516 if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
517 switch(type) {
518 case 'i1': HEAP8[((ptr)>>0)]=value; break;
519 case 'i8': HEAP8[((ptr)>>0)]=value; break;
520 case 'i16': HEAP16[((ptr)>>1)]=value; break;
521 case 'i32': HEAP32[((ptr)>>2)]=value; break;
522 case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
523 case 'float': HEAPF32[((ptr)>>2)]=value; break;
524 case 'double': HEAPF64[((ptr)>>3)]=value; break;
525 default: abort('invalid type for setValue: ' + type);
526 }
527}
528Module["setValue"] = setValue;
529
530
531function getValue(ptr, type, noSafe) {
532 type = type || 'i8';
533 if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
534 switch(type) {
535 case 'i1': return HEAP8[((ptr)>>0)];
536 case 'i8': return HEAP8[((ptr)>>0)];
537 case 'i16': return HEAP16[((ptr)>>1)];
538 case 'i32': return HEAP32[((ptr)>>2)];
539 case 'i64': return HEAP32[((ptr)>>2)];
540 case 'float': return HEAPF32[((ptr)>>2)];
541 case 'double': return HEAPF64[((ptr)>>3)];
542 default: abort('invalid type for setValue: ' + type);
543 }
544 return null;
545}
546Module["getValue"] = getValue;
547
548var ALLOC_NORMAL = 0; // Tries to use _malloc()
549var ALLOC_STACK = 1; // Lives for the duration of the current function call
550var ALLOC_STATIC = 2; // Cannot be freed
551var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
552var ALLOC_NONE = 4; // Do not allocate
553Module["ALLOC_NORMAL"] = ALLOC_NORMAL;
554Module["ALLOC_STACK"] = ALLOC_STACK;
555Module["ALLOC_STATIC"] = ALLOC_STATIC;
556Module["ALLOC_DYNAMIC"] = ALLOC_DYNAMIC;
557Module["ALLOC_NONE"] = ALLOC_NONE;
558
559// allocate(): This is for internal use. You can use it yourself as well, but the interface
560// is a little tricky (see docs right below). The reason is that it is optimized
561// for multiple syntaxes to save space in generated code. So you should
562// normally not use allocate(), and instead allocate memory using _malloc(),
563// initialize it with setValue(), and so forth.
564// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
565// in *bytes* (note that this is sometimes confusing: the next parameter does not
566// affect this!)
567// @types: Either an array of types, one for each byte (or 0 if no type at that position),
568// or a single type which is used for the entire block. This only matters if there
569// is initial data - if @slab is a number, then this does not matter at all and is
570// ignored.
571// @allocator: How to allocate memory, see ALLOC_*
572function allocate(slab, types, allocator, ptr) {
573 var zeroinit, size;
574 if (typeof slab === 'number') {
575 zeroinit = true;
576 size = slab;
577 } else {
578 zeroinit = false;
579 size = slab.length;
580 }
581
582 var singleType = typeof types === 'string' ? types : null;
583
584 var ret;
585 if (allocator == ALLOC_NONE) {
586 ret = ptr;
587 } else {
588 ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
589 }
590
591 if (zeroinit) {
592 var ptr = ret, stop;
593 assert((ret & 3) == 0);
594 stop = ret + (size & ~3);
595 for (; ptr < stop; ptr += 4) {
596 HEAP32[((ptr)>>2)]=0;
597 }
598 stop = ret + size;
599 while (ptr < stop) {
600 HEAP8[((ptr++)>>0)]=0;
601 }
602 return ret;
603 }
604
605 if (singleType === 'i8') {
606 if (slab.subarray || slab.slice) {
607 HEAPU8.set(slab, ret);
608 } else {
609 HEAPU8.set(new Uint8Array(slab), ret);
610 }
611 return ret;
612 }
613
614 var i = 0, type, typeSize, previousType;
615 while (i < size) {
616 var curr = slab[i];
617
618 if (typeof curr === 'function') {
619 curr = Runtime.getFunctionIndex(curr);
620 }
621
622 type = singleType || types[i];
623 if (type === 0) {
624 i++;
625 continue;
626 }
627 assert(type, 'Must know what type to store in allocate!');
628
629 if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
630
631 setValue(ret+i, curr, type);
632
633 // no need to look up size unless type changes, so cache it
634 if (previousType !== type) {
635 typeSize = Runtime.getNativeTypeSize(type);
636 previousType = type;
637 }
638 i += typeSize;
639 }
640
641 return ret;
642}
643Module["allocate"] = allocate;
644
645// Allocate memory during any stage of startup - static memory early on, dynamic memory later, malloc when ready
646function getMemory(size) {
647 if (!staticSealed) return Runtime.staticAlloc(size);
648 if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);
649 return _malloc(size);
650}
651Module["getMemory"] = getMemory;
652
653function Pointer_stringify(ptr, /* optional */ length) {
654 if (length === 0 || !ptr) return '';
655 // TODO: use TextDecoder
656 // Find the length, and check for UTF while doing so
657 var hasUtf = 0;
658 var t;
659 var i = 0;
660 while (1) {
661 assert(ptr + i < TOTAL_MEMORY);
662 t = HEAPU8[(((ptr)+(i))>>0)];
663 hasUtf |= t;
664 if (t == 0 && !length) break;
665 i++;
666 if (length && i == length) break;
667 }
668 if (!length) length = i;
669
670 var ret = '';
671
672 if (hasUtf < 128) {
673 var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
674 var curr;
675 while (length > 0) {
676 curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
677 ret = ret ? ret + curr : curr;
678 ptr += MAX_CHUNK;
679 length -= MAX_CHUNK;
680 }
681 return ret;
682 }
683 return Module['UTF8ToString'](ptr);
684}
685Module["Pointer_stringify"] = Pointer_stringify;
686
687// Given a pointer 'ptr' to a null-terminated ASCII-encoded string in the emscripten HEAP, returns
688// a copy of that string as a Javascript String object.
689
690function AsciiToString(ptr) {
691 var str = '';
692 while (1) {
693 var ch = HEAP8[((ptr++)>>0)];
694 if (!ch) return str;
695 str += String.fromCharCode(ch);
696 }
697}
698Module["AsciiToString"] = AsciiToString;
699
700// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
701// null-terminated and encoded in ASCII form. The copy will require at most str.length+1 bytes of space in the HEAP.
702
703function stringToAscii(str, outPtr) {
704 return writeAsciiToMemory(str, outPtr, false);
705}
706Module["stringToAscii"] = stringToAscii;
707
708// Given a pointer 'ptr' to a null-terminated UTF8-encoded string in the given array that contains uint8 values, returns
709// a copy of that string as a Javascript String object.
710
711function UTF8ArrayToString(u8Array, idx) {
712 var u0, u1, u2, u3, u4, u5;
713
714 var str = '';
715 while (1) {
716 // For UTF8 byte structure, see http://en.wikipedia.org/wiki/UTF-8#Description and https://www.ietf.org/rfc/rfc2279.txt and https://tools.ietf.org/html/rfc3629
717 u0 = u8Array[idx++];
718 if (!u0) return str;
719 if (!(u0 & 0x80)) { str += String.fromCharCode(u0); continue; }
720 u1 = u8Array[idx++] & 63;
721 if ((u0 & 0xE0) == 0xC0) { str += String.fromCharCode(((u0 & 31) << 6) | u1); continue; }
722 u2 = u8Array[idx++] & 63;
723 if ((u0 & 0xF0) == 0xE0) {
724 u0 = ((u0 & 15) << 12) | (u1 << 6) | u2;
725 } else {
726 u3 = u8Array[idx++] & 63;
727 if ((u0 & 0xF8) == 0xF0) {
728 u0 = ((u0 & 7) << 18) | (u1 << 12) | (u2 << 6) | u3;
729 } else {
730 u4 = u8Array[idx++] & 63;
731 if ((u0 & 0xFC) == 0xF8) {
732 u0 = ((u0 & 3) << 24) | (u1 << 18) | (u2 << 12) | (u3 << 6) | u4;
733 } else {
734 u5 = u8Array[idx++] & 63;
735 u0 = ((u0 & 1) << 30) | (u1 << 24) | (u2 << 18) | (u3 << 12) | (u4 << 6) | u5;
736 }
737 }
738 }
739 if (u0 < 0x10000) {
740 str += String.fromCharCode(u0);
741 } else {
742 var ch = u0 - 0x10000;
743 str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
744 }
745 }
746}
747Module["UTF8ArrayToString"] = UTF8ArrayToString;
748
749// Given a pointer 'ptr' to a null-terminated UTF8-encoded string in the emscripten HEAP, returns
750// a copy of that string as a Javascript String object.
751
752function UTF8ToString(ptr) {
753 return UTF8ArrayToString(HEAPU8,ptr);
754}
755Module["UTF8ToString"] = UTF8ToString;
756
757// Copies the given Javascript String object 'str' to the given byte array at address 'outIdx',
758// encoded in UTF8 form and null-terminated. The copy will require at most str.length*4+1 bytes of space in the HEAP.
759// Use the function lengthBytesUTF8() to compute the exact number of bytes (excluding null terminator) that this function will write.
760// Parameters:
761// str: the Javascript string to copy.
762// outU8Array: the array to copy to. Each index in this array is assumed to be one 8-byte element.
763// outIdx: The starting offset in the array to begin the copying.
764// maxBytesToWrite: The maximum number of bytes this function can write to the array. This count should include the null
765// terminator, i.e. if maxBytesToWrite=1, only the null terminator will be written and nothing else.
766// maxBytesToWrite=0 does not write any bytes to the output, not even the null terminator.
767// Returns the number of bytes written, EXCLUDING the null terminator.
768
769function stringToUTF8Array(str, outU8Array, outIdx, maxBytesToWrite) {
770 if (!(maxBytesToWrite > 0)) // Parameter maxBytesToWrite is not optional. Negative values, 0, null, undefined and false each don't write out any bytes.
771 return 0;
772
773 var startIdx = outIdx;
774 var endIdx = outIdx + maxBytesToWrite - 1; // -1 for string null terminator.
775 for (var i = 0; i < str.length; ++i) {
776 // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! So decode UTF16->UTF32->UTF8.
777 // See http://unicode.org/faq/utf_bom.html#utf16-3
778 // For UTF8 byte structure, see http://en.wikipedia.org/wiki/UTF-8#Description and https://www.ietf.org/rfc/rfc2279.txt and https://tools.ietf.org/html/rfc3629
779 var u = str.charCodeAt(i); // possibly a lead surrogate
780 if (u >= 0xD800 && u <= 0xDFFF) u = 0x10000 + ((u & 0x3FF) << 10) | (str.charCodeAt(++i) & 0x3FF);
781 if (u <= 0x7F) {
782 if (outIdx >= endIdx) break;
783 outU8Array[outIdx++] = u;
784 } else if (u <= 0x7FF) {
785 if (outIdx + 1 >= endIdx) break;
786 outU8Array[outIdx++] = 0xC0 | (u >> 6);
787 outU8Array[outIdx++] = 0x80 | (u & 63);
788 } else if (u <= 0xFFFF) {
789 if (outIdx + 2 >= endIdx) break;
790 outU8Array[outIdx++] = 0xE0 | (u >> 12);
791 outU8Array[outIdx++] = 0x80 | ((u >> 6) & 63);
792 outU8Array[outIdx++] = 0x80 | (u & 63);
793 } else if (u <= 0x1FFFFF) {
794 if (outIdx + 3 >= endIdx) break;
795 outU8Array[outIdx++] = 0xF0 | (u >> 18);
796 outU8Array[outIdx++] = 0x80 | ((u >> 12) & 63);
797 outU8Array[outIdx++] = 0x80 | ((u >> 6) & 63);
798 outU8Array[outIdx++] = 0x80 | (u & 63);
799 } else if (u <= 0x3FFFFFF) {
800 if (outIdx + 4 >= endIdx) break;
801 outU8Array[outIdx++] = 0xF8 | (u >> 24);
802 outU8Array[outIdx++] = 0x80 | ((u >> 18) & 63);
803 outU8Array[outIdx++] = 0x80 | ((u >> 12) & 63);
804 outU8Array[outIdx++] = 0x80 | ((u >> 6) & 63);
805 outU8Array[outIdx++] = 0x80 | (u & 63);
806 } else {
807 if (outIdx + 5 >= endIdx) break;
808 outU8Array[outIdx++] = 0xFC | (u >> 30);
809 outU8Array[outIdx++] = 0x80 | ((u >> 24) & 63);
810 outU8Array[outIdx++] = 0x80 | ((u >> 18) & 63);
811 outU8Array[outIdx++] = 0x80 | ((u >> 12) & 63);
812 outU8Array[outIdx++] = 0x80 | ((u >> 6) & 63);
813 outU8Array[outIdx++] = 0x80 | (u & 63);
814 }
815 }
816 // Null-terminate the pointer to the buffer.
817 outU8Array[outIdx] = 0;
818 return outIdx - startIdx;
819}
820Module["stringToUTF8Array"] = stringToUTF8Array;
821
822// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
823// null-terminated and encoded in UTF8 form. The copy will require at most str.length*4+1 bytes of space in the HEAP.
824// Use the function lengthBytesUTF8() to compute the exact number of bytes (excluding null terminator) that this function will write.
825// Returns the number of bytes written, EXCLUDING the null terminator.
826
827function stringToUTF8(str, outPtr, maxBytesToWrite) {
828 assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');
829 return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);
830}
831Module["stringToUTF8"] = stringToUTF8;
832
833// Returns the number of bytes the given Javascript string takes if encoded as a UTF8 byte array, EXCLUDING the null terminator byte.
834
835function lengthBytesUTF8(str) {
836 var len = 0;
837 for (var i = 0; i < str.length; ++i) {
838 // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! So decode UTF16->UTF32->UTF8.
839 // See http://unicode.org/faq/utf_bom.html#utf16-3
840 var u = str.charCodeAt(i); // possibly a lead surrogate
841 if (u >= 0xD800 && u <= 0xDFFF) u = 0x10000 + ((u & 0x3FF) << 10) | (str.charCodeAt(++i) & 0x3FF);
842 if (u <= 0x7F) {
843 ++len;
844 } else if (u <= 0x7FF) {
845 len += 2;
846 } else if (u <= 0xFFFF) {
847 len += 3;
848 } else if (u <= 0x1FFFFF) {
849 len += 4;
850 } else if (u <= 0x3FFFFFF) {
851 len += 5;
852 } else {
853 len += 6;
854 }
855 }
856 return len;
857}
858Module["lengthBytesUTF8"] = lengthBytesUTF8;
859
860// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
861// a copy of that string as a Javascript String object.
862
863function UTF16ToString(ptr) {
864 var i = 0;
865
866 var str = '';
867 while (1) {
868 var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
869 if (codeUnit == 0)
870 return str;
871 ++i;
872 // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
873 str += String.fromCharCode(codeUnit);
874 }
875}
876Module["UTF16ToString"] = UTF16ToString;
877
878// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
879// null-terminated and encoded in UTF16 form. The copy will require at most str.length*4+2 bytes of space in the HEAP.
880// Use the function lengthBytesUTF16() to compute the exact number of bytes (excluding null terminator) that this function will write.
881// Parameters:
882// str: the Javascript string to copy.
883// outPtr: Byte address in Emscripten HEAP where to write the string to.
884// maxBytesToWrite: The maximum number of bytes this function can write to the array. This count should include the null
885// terminator, i.e. if maxBytesToWrite=2, only the null terminator will be written and nothing else.
886// maxBytesToWrite<2 does not write any bytes to the output, not even the null terminator.
887// Returns the number of bytes written, EXCLUDING the null terminator.
888
889function stringToUTF16(str, outPtr, maxBytesToWrite) {
890 assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');
891 // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.
892 if (maxBytesToWrite === undefined) {
893 maxBytesToWrite = 0x7FFFFFFF;
894 }
895 if (maxBytesToWrite < 2) return 0;
896 maxBytesToWrite -= 2; // Null terminator.
897 var startPtr = outPtr;
898 var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;
899 for (var i = 0; i < numCharsToWrite; ++i) {
900 // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
901 var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
902 HEAP16[((outPtr)>>1)]=codeUnit;
903 outPtr += 2;
904 }
905 // Null-terminate the pointer to the HEAP.
906 HEAP16[((outPtr)>>1)]=0;
907 return outPtr - startPtr;
908}
909Module["stringToUTF16"] = stringToUTF16;
910
911// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.
912
913function lengthBytesUTF16(str) {
914 return str.length*2;
915}
916Module["lengthBytesUTF16"] = lengthBytesUTF16;
917
918function UTF32ToString(ptr) {
919 var i = 0;
920
921 var str = '';
922 while (1) {
923 var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
924 if (utf32 == 0)
925 return str;
926 ++i;
927 // 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.
928 // See http://unicode.org/faq/utf_bom.html#utf16-3
929 if (utf32 >= 0x10000) {
930 var ch = utf32 - 0x10000;
931 str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
932 } else {
933 str += String.fromCharCode(utf32);
934 }
935 }
936}
937Module["UTF32ToString"] = UTF32ToString;
938
939// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
940// null-terminated and encoded in UTF32 form. The copy will require at most str.length*4+4 bytes of space in the HEAP.
941// Use the function lengthBytesUTF32() to compute the exact number of bytes (excluding null terminator) that this function will write.
942// Parameters:
943// str: the Javascript string to copy.
944// outPtr: Byte address in Emscripten HEAP where to write the string to.
945// maxBytesToWrite: The maximum number of bytes this function can write to the array. This count should include the null
946// terminator, i.e. if maxBytesToWrite=4, only the null terminator will be written and nothing else.
947// maxBytesToWrite<4 does not write any bytes to the output, not even the null terminator.
948// Returns the number of bytes written, EXCLUDING the null terminator.
949
950function stringToUTF32(str, outPtr, maxBytesToWrite) {
951 assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');
952 // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.
953 if (maxBytesToWrite === undefined) {
954 maxBytesToWrite = 0x7FFFFFFF;
955 }
956 if (maxBytesToWrite < 4) return 0;
957 var startPtr = outPtr;
958 var endPtr = startPtr + maxBytesToWrite - 4;
959 for (var i = 0; i < str.length; ++i) {
960 // 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.
961 // See http://unicode.org/faq/utf_bom.html#utf16-3
962 var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
963 if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
964 var trailSurrogate = str.charCodeAt(++i);
965 codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
966 }
967 HEAP32[((outPtr)>>2)]=codeUnit;
968 outPtr += 4;
969 if (outPtr + 4 > endPtr) break;
970 }
971 // Null-terminate the pointer to the HEAP.
972 HEAP32[((outPtr)>>2)]=0;
973 return outPtr - startPtr;
974}
975Module["stringToUTF32"] = stringToUTF32;
976
977// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.
978
979function lengthBytesUTF32(str) {
980 var len = 0;
981 for (var i = 0; i < str.length; ++i) {
982 // 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.
983 // See http://unicode.org/faq/utf_bom.html#utf16-3
984 var codeUnit = str.charCodeAt(i);
985 if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) ++i; // possibly a lead surrogate, so skip over the tail surrogate.
986 len += 4;
987 }
988
989 return len;
990}
991Module["lengthBytesUTF32"] = lengthBytesUTF32;
992
993function demangle(func) {
994 var hasLibcxxabi = !!Module['___cxa_demangle'];
995 if (hasLibcxxabi) {
996 try {
997 var buf = _malloc(func.length);
998 writeStringToMemory(func.substr(1), buf);
999 var status = _malloc(4);
1000 var ret = Module['___cxa_demangle'](buf, 0, 0, status);
1001 if (getValue(status, 'i32') === 0 && ret) {
1002 return Pointer_stringify(ret);
1003 }
1004 // otherwise, libcxxabi failed, we can try ours which may return a partial result
1005 } catch(e) {
1006 // failure when using libcxxabi, we can try ours which may return a partial result
1007 } finally {
1008 if (buf) _free(buf);
1009 if (status) _free(status);
1010 if (ret) _free(ret);
1011 }
1012 }
1013 var i = 3;
1014 // params, etc.
1015 var basicTypes = {
1016 'v': 'void',
1017 'b': 'bool',
1018 'c': 'char',
1019 's': 'short',
1020 'i': 'int',
1021 'l': 'long',
1022 'f': 'float',
1023 'd': 'double',
1024 'w': 'wchar_t',
1025 'a': 'signed char',
1026 'h': 'unsigned char',
1027 't': 'unsigned short',
1028 'j': 'unsigned int',
1029 'm': 'unsigned long',
1030 'x': 'long long',
1031 'y': 'unsigned long long',
1032 'z': '...'
1033 };
1034 var subs = [];
1035 var first = true;
1036 function dump(x) {
1037 //return;
1038 if (x) Module.print(x);
1039 Module.print(func);
1040 var pre = '';
1041 for (var a = 0; a < i; a++) pre += ' ';
1042 Module.print (pre + '^');
1043 }
1044 function parseNested() {
1045 i++;
1046 if (func[i] === 'K') i++; // ignore const
1047 var parts = [];
1048 while (func[i] !== 'E') {
1049 if (func[i] === 'S') { // substitution
1050 i++;
1051 var next = func.indexOf('_', i);
1052 var num = func.substring(i, next) || 0;
1053 parts.push(subs[num] || '?');
1054 i = next+1;
1055 continue;
1056 }
1057 if (func[i] === 'C') { // constructor
1058 parts.push(parts[parts.length-1]);
1059 i += 2;
1060 continue;
1061 }
1062 var size = parseInt(func.substr(i));
1063 var pre = size.toString().length;
1064 if (!size || !pre) { i--; break; } // counter i++ below us
1065 var curr = func.substr(i + pre, size);
1066 parts.push(curr);
1067 subs.push(curr);
1068 i += pre + size;
1069 }
1070 i++; // skip E
1071 return parts;
1072 }
1073 function parse(rawList, limit, allowVoid) { // main parser
1074 limit = limit || Infinity;
1075 var ret = '', list = [];
1076 function flushList() {
1077 return '(' + list.join(', ') + ')';
1078 }
1079 var name;
1080 if (func[i] === 'N') {
1081 // namespaced N-E
1082 name = parseNested().join('::');
1083 limit--;
1084 if (limit === 0) return rawList ? [name] : name;
1085 } else {
1086 // not namespaced
1087 if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
1088 var size = parseInt(func.substr(i));
1089 if (size) {
1090 var pre = size.toString().length;
1091 name = func.substr(i + pre, size);
1092 i += pre + size;
1093 }
1094 }
1095 first = false;
1096 if (func[i] === 'I') {
1097 i++;
1098 var iList = parse(true);
1099 var iRet = parse(true, 1, true);
1100 ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
1101 } else {
1102 ret = name;
1103 }
1104 paramLoop: while (i < func.length && limit-- > 0) {
1105 //dump('paramLoop');
1106 var c = func[i++];
1107 if (c in basicTypes) {
1108 list.push(basicTypes[c]);
1109 } else {
1110 switch (c) {
1111 case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
1112 case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
1113 case 'L': { // literal
1114 i++; // skip basic type
1115 var end = func.indexOf('E', i);
1116 var size = end - i;
1117 list.push(func.substr(i, size));
1118 i += size + 2; // size + 'EE'
1119 break;
1120 }
1121 case 'A': { // array
1122 var size = parseInt(func.substr(i));
1123 i += size.toString().length;
1124 if (func[i] !== '_') throw '?';
1125 i++; // skip _
1126 list.push(parse(true, 1, true)[0] + ' [' + size + ']');
1127 break;
1128 }
1129 case 'E': break paramLoop;
1130 default: ret += '?' + c; break paramLoop;
1131 }
1132 }
1133 }
1134 if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
1135 if (rawList) {
1136 if (ret) {
1137 list.push(ret + '?');
1138 }
1139 return list;
1140 } else {
1141 return ret + flushList();
1142 }
1143 }
1144 var parsed = func;
1145 try {
1146 // Special-case the entry point, since its name differs from other name mangling.
1147 if (func == 'Object._main' || func == '_main') {
1148 return 'main()';
1149 }
1150 if (typeof func === 'number') func = Pointer_stringify(func);
1151 if (func[0] !== '_') return func;
1152 if (func[1] !== '_') return func; // C function
1153 if (func[2] !== 'Z') return func;
1154 switch (func[3]) {
1155 case 'n': return 'operator new()';
1156 case 'd': return 'operator delete()';
1157 }
1158 parsed = parse();
1159 } catch(e) {
1160 parsed += '?';
1161 }
1162 if (parsed.indexOf('?') >= 0 && !hasLibcxxabi) {
1163 Runtime.warnOnce('warning: a problem occurred in builtin C++ name demangling; build with -s DEMANGLE_SUPPORT=1 to link in libcxxabi demangling');
1164 }
1165 return parsed;
1166}
1167
1168function demangleAll(text) {
1169 return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
1170}
1171
1172function jsStackTrace() {
1173 var err = new Error();
1174 if (!err.stack) {
1175 // IE10+ special cases: It does have callstack info, but it is only populated if an Error object is thrown,
1176 // so try that as a special-case.
1177 try {
1178 throw new Error(0);
1179 } catch(e) {
1180 err = e;
1181 }
1182 if (!err.stack) {
1183 return '(no stack trace available)';
1184 }
1185 }
1186 return err.stack.toString();
1187}
1188
1189function stackTrace() {
1190 return demangleAll(jsStackTrace());
1191}
1192Module["stackTrace"] = stackTrace;
1193
1194// Memory management
1195
1196var PAGE_SIZE = 4096;
1197
1198function alignMemoryPage(x) {
1199 if (x % 4096 > 0) {
1200 x += (4096 - (x % 4096));
1201 }
1202 return x;
1203}
1204
1205var HEAP;
1206var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
1207
1208var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
1209var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
1210var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
1211
1212
1213function abortOnCannotGrowMemory() {
1214 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 -s ALLOW_MEMORY_GROWTH=1 which adjusts the size at runtime but prevents some optimizations, (3) set Module.TOTAL_MEMORY to a higher value before the program runs, or if you want malloc to return NULL (0) instead of this abort, compile with -s ABORTING_MALLOC=0 ');
1215}
1216
1217function enlargeMemory() {
1218 abortOnCannotGrowMemory();
1219}
1220
1221
1222var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
1223var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 16777216;
1224
1225var totalMemory = 64*1024;
1226while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
1227 if (totalMemory < 16*1024*1024) {
1228 totalMemory *= 2;
1229 } else {
1230 totalMemory += 16*1024*1024
1231 }
1232}
1233if (totalMemory !== TOTAL_MEMORY) {
1234 Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be compliant with the asm.js spec (and given that TOTAL_STACK=' + TOTAL_STACK + ')');
1235 TOTAL_MEMORY = totalMemory;
1236}
1237
1238// Initialize the runtime's memory
1239// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
1240assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
1241 'JS engine does not provide full typed array support');
1242
1243var buffer;
1244
1245
1246
1247buffer = new ArrayBuffer(TOTAL_MEMORY);
1248HEAP8 = new Int8Array(buffer);
1249HEAP16 = new Int16Array(buffer);
1250HEAP32 = new Int32Array(buffer);
1251HEAPU8 = new Uint8Array(buffer);
1252HEAPU16 = new Uint16Array(buffer);
1253HEAPU32 = new Uint32Array(buffer);
1254HEAPF32 = new Float32Array(buffer);
1255HEAPF64 = new Float64Array(buffer);
1256
1257
1258// Endianness check (note: assumes compiler arch was little-endian)
1259HEAP32[0] = 255;
1260assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
1261
1262Module['HEAP'] = HEAP;
1263Module['buffer'] = buffer;
1264Module['HEAP8'] = HEAP8;
1265Module['HEAP16'] = HEAP16;
1266Module['HEAP32'] = HEAP32;
1267Module['HEAPU8'] = HEAPU8;
1268Module['HEAPU16'] = HEAPU16;
1269Module['HEAPU32'] = HEAPU32;
1270Module['HEAPF32'] = HEAPF32;
1271Module['HEAPF64'] = HEAPF64;
1272
1273function callRuntimeCallbacks(callbacks) {
1274 while(callbacks.length > 0) {
1275 var callback = callbacks.shift();
1276 if (typeof callback == 'function') {
1277 callback();
1278 continue;
1279 }
1280 var func = callback.func;
1281 if (typeof func === 'number') {
1282 if (callback.arg === undefined) {
1283 Runtime.dynCall('v', func);
1284 } else {
1285 Runtime.dynCall('vi', func, [callback.arg]);
1286 }
1287 } else {
1288 func(callback.arg === undefined ? null : callback.arg);
1289 }
1290 }
1291}
1292
1293var __ATPRERUN__ = []; // functions called before the runtime is initialized
1294var __ATINIT__ = []; // functions called during startup
1295var __ATMAIN__ = []; // functions called when main() is to be run
1296var __ATEXIT__ = []; // functions called during shutdown
1297var __ATPOSTRUN__ = []; // functions called after the runtime has exited
1298
1299var runtimeInitialized = false;
1300var runtimeExited = false;
1301
1302
1303function preRun() {
1304 // compatibility - merge in anything from Module['preRun'] at this time
1305 if (Module['preRun']) {
1306 if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
1307 while (Module['preRun'].length) {
1308 addOnPreRun(Module['preRun'].shift());
1309 }
1310 }
1311 callRuntimeCallbacks(__ATPRERUN__);
1312}
1313
1314function ensureInitRuntime() {
1315 if (runtimeInitialized) return;
1316 runtimeInitialized = true;
1317 callRuntimeCallbacks(__ATINIT__);
1318}
1319
1320function preMain() {
1321 callRuntimeCallbacks(__ATMAIN__);
1322}
1323
1324function exitRuntime() {
1325 callRuntimeCallbacks(__ATEXIT__);
1326 runtimeExited = true;
1327}
1328
1329function postRun() {
1330 // compatibility - merge in anything from Module['postRun'] at this time
1331 if (Module['postRun']) {
1332 if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
1333 while (Module['postRun'].length) {
1334 addOnPostRun(Module['postRun'].shift());
1335 }
1336 }
1337 callRuntimeCallbacks(__ATPOSTRUN__);
1338}
1339
1340function addOnPreRun(cb) {
1341 __ATPRERUN__.unshift(cb);
1342}
1343Module["addOnPreRun"] = addOnPreRun;
1344
1345function addOnInit(cb) {
1346 __ATINIT__.unshift(cb);
1347}
1348Module["addOnInit"] = addOnInit;
1349
1350function addOnPreMain(cb) {
1351 __ATMAIN__.unshift(cb);
1352}
1353Module["addOnPreMain"] = addOnPreMain;
1354
1355function addOnExit(cb) {
1356 __ATEXIT__.unshift(cb);
1357}
1358Module["addOnExit"] = addOnExit;
1359
1360function addOnPostRun(cb) {
1361 __ATPOSTRUN__.unshift(cb);
1362}
1363Module["addOnPostRun"] = addOnPostRun;
1364
1365// Tools
1366
1367
1368function intArrayFromString(stringy, dontAddNull, length /* optional */) {
1369 var len = length > 0 ? length : lengthBytesUTF8(stringy)+1;
1370 var u8array = new Array(len);
1371 var numBytesWritten = stringToUTF8Array(stringy, u8array, 0, u8array.length);
1372 if (dontAddNull) u8array.length = numBytesWritten;
1373 return u8array;
1374}
1375Module["intArrayFromString"] = intArrayFromString;
1376
1377function intArrayToString(array) {
1378 var ret = [];
1379 for (var i = 0; i < array.length; i++) {
1380 var chr = array[i];
1381 if (chr > 0xFF) {
1382 assert(false, 'Character code ' + chr + ' (' + String.fromCharCode(chr) + ') at offset ' + i + ' not in 0x00-0xFF.');
1383 chr &= 0xFF;
1384 }
1385 ret.push(String.fromCharCode(chr));
1386 }
1387 return ret.join('');
1388}
1389Module["intArrayToString"] = intArrayToString;
1390
1391function writeStringToMemory(string, buffer, dontAddNull) {
1392 var array = intArrayFromString(string, dontAddNull);
1393 var i = 0;
1394 while (i < array.length) {
1395 var chr = array[i];
1396 HEAP8[(((buffer)+(i))>>0)]=chr;
1397 i = i + 1;
1398 }
1399}
1400Module["writeStringToMemory"] = writeStringToMemory;
1401
1402function writeArrayToMemory(array, buffer) {
1403 for (var i = 0; i < array.length; i++) {
1404 HEAP8[((buffer++)>>0)]=array[i];
1405 }
1406}
1407Module["writeArrayToMemory"] = writeArrayToMemory;
1408
1409function writeAsciiToMemory(str, buffer, dontAddNull) {
1410 for (var i = 0; i < str.length; ++i) {
1411 assert(str.charCodeAt(i) === str.charCodeAt(i)&0xff);
1412 HEAP8[((buffer++)>>0)]=str.charCodeAt(i);
1413 }
1414 // Null-terminate the pointer to the HEAP.
1415 if (!dontAddNull) HEAP8[((buffer)>>0)]=0;
1416}
1417Module["writeAsciiToMemory"] = writeAsciiToMemory;
1418
1419function unSign(value, bits, ignore) {
1420 if (value >= 0) {
1421 return value;
1422 }
1423 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
1424 : Math.pow(2, bits) + value;
1425}
1426function reSign(value, bits, ignore) {
1427 if (value <= 0) {
1428 return value;
1429 }
1430 var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
1431 : Math.pow(2, bits-1);
1432 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
1433 // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
1434 // TODO: In i64 mode 1, resign the two parts separately and safely
1435 value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
1436 }
1437 return value;
1438}
1439
1440
1441// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
1442if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
1443 var ah = a >>> 16;
1444 var al = a & 0xffff;
1445 var bh = b >>> 16;
1446 var bl = b & 0xffff;
1447 return (al*bl + ((ah*bl + al*bh) << 16))|0;
1448};
1449Math.imul = Math['imul'];
1450
1451
1452if (!Math['clz32']) Math['clz32'] = function(x) {
1453 x = x >>> 0;
1454 for (var i = 0; i < 32; i++) {
1455 if (x & (1 << (31 - i))) return i;
1456 }
1457 return 32;
1458};
1459Math.clz32 = Math['clz32']
1460
1461var Math_abs = Math.abs;
1462var Math_cos = Math.cos;
1463var Math_sin = Math.sin;
1464var Math_tan = Math.tan;
1465var Math_acos = Math.acos;
1466var Math_asin = Math.asin;
1467var Math_atan = Math.atan;
1468var Math_atan2 = Math.atan2;
1469var Math_exp = Math.exp;
1470var Math_log = Math.log;
1471var Math_sqrt = Math.sqrt;
1472var Math_ceil = Math.ceil;
1473var Math_floor = Math.floor;
1474var Math_pow = Math.pow;
1475var Math_imul = Math.imul;
1476var Math_fround = Math.fround;
1477var Math_min = Math.min;
1478var Math_clz32 = Math.clz32;
1479
1480// A counter of dependencies for calling run(). If we need to
1481// do asynchronous work before running, increment this and
1482// decrement it. Incrementing must happen in a place like
1483// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
1484// Note that you can add dependencies in preRun, even though
1485// it happens right before run - run will be postponed until
1486// the dependencies are met.
1487var runDependencies = 0;
1488var runDependencyWatcher = null;
1489var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
1490var runDependencyTracking = {};
1491
1492function getUniqueRunDependency(id) {
1493 var orig = id;
1494 while (1) {
1495 if (!runDependencyTracking[id]) return id;
1496 id = orig + Math.random();
1497 }
1498 return id;
1499}
1500
1501function addRunDependency(id) {
1502 runDependencies++;
1503 if (Module['monitorRunDependencies']) {
1504 Module['monitorRunDependencies'](runDependencies);
1505 }
1506 if (id) {
1507 assert(!runDependencyTracking[id]);
1508 runDependencyTracking[id] = 1;
1509 if (runDependencyWatcher === null && typeof setInterval !== 'undefined') {
1510 // Check for missing dependencies every few seconds
1511 runDependencyWatcher = setInterval(function() {
1512 if (ABORT) {
1513 clearInterval(runDependencyWatcher);
1514 runDependencyWatcher = null;
1515 return;
1516 }
1517 var shown = false;
1518 for (var dep in runDependencyTracking) {
1519 if (!shown) {
1520 shown = true;
1521 Module.printErr('still waiting on run dependencies:');
1522 }
1523 Module.printErr('dependency: ' + dep);
1524 }
1525 if (shown) {
1526 Module.printErr('(end of list)');
1527 }
1528 }, 10000);
1529 }
1530 } else {
1531 Module.printErr('warning: run dependency added without ID');
1532 }
1533}
1534Module["addRunDependency"] = addRunDependency;
1535
1536function removeRunDependency(id) {
1537 runDependencies--;
1538 if (Module['monitorRunDependencies']) {
1539 Module['monitorRunDependencies'](runDependencies);
1540 }
1541 if (id) {
1542 assert(runDependencyTracking[id]);
1543 delete runDependencyTracking[id];
1544 } else {
1545 Module.printErr('warning: run dependency removed without ID');
1546 }
1547 if (runDependencies == 0) {
1548 if (runDependencyWatcher !== null) {
1549 clearInterval(runDependencyWatcher);
1550 runDependencyWatcher = null;
1551 }
1552 if (dependenciesFulfilled) {
1553 var callback = dependenciesFulfilled;
1554 dependenciesFulfilled = null;
1555 callback(); // can add another dependenciesFulfilled
1556 }
1557 }
1558}
1559Module["removeRunDependency"] = removeRunDependency;
1560
1561Module["preloadedImages"] = {}; // maps url to image data
1562Module["preloadedAudios"] = {}; // maps url to audio data
1563
1564
1565
1566var memoryInitializer = null;
1567
1568
1569
1570// === Body ===
1571
1572var ASM_CONSTS = [];
1573
1574
1575
1576
1577STATIC_BASE = 8;
1578
1579STATICTOP = STATIC_BASE + 1712;
1580 /* global initializers */ __ATINIT__.push();
1581
1582
1583/* memory initializer */ allocate([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,60,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,3,0,0,0,180,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,255,255,255,255,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,255,0,0,0,255,0,0,0,255,0,0,0,255,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
1584
1585
1586
1587
1588
1589/* no memory initializer */
1590var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
1591
1592assert(tempDoublePtr % 8 == 0);
1593
1594function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
1595
1596 HEAP8[tempDoublePtr] = HEAP8[ptr];
1597
1598 HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
1599
1600 HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
1601
1602 HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
1603
1604}
1605
1606function copyTempDouble(ptr) {
1607
1608 HEAP8[tempDoublePtr] = HEAP8[ptr];
1609
1610 HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
1611
1612 HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
1613
1614 HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
1615
1616 HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
1617
1618 HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
1619
1620 HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
1621
1622 HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
1623
1624}
1625
1626// {{PRE_LIBRARY}}
1627
1628
1629 var _UItoF=true;
1630
1631
1632 function ___setErrNo(value) {
1633 if (Module['___errno_location']) HEAP32[((Module['___errno_location']())>>2)]=value;
1634 else Module.printErr('failed to set errno from JS');
1635 return value;
1636 }
1637
1638 var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};function _sysconf(name) {
1639 // long sysconf(int name);
1640 // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
1641 switch(name) {
1642 case 30: return PAGE_SIZE;
1643 case 85: return totalMemory / PAGE_SIZE;
1644 case 132:
1645 case 133:
1646 case 12:
1647 case 137:
1648 case 138:
1649 case 15:
1650 case 235:
1651 case 16:
1652 case 17:
1653 case 18:
1654 case 19:
1655 case 20:
1656 case 149:
1657 case 13:
1658 case 10:
1659 case 236:
1660 case 153:
1661 case 9:
1662 case 21:
1663 case 22:
1664 case 159:
1665 case 154:
1666 case 14:
1667 case 77:
1668 case 78:
1669 case 139:
1670 case 80:
1671 case 81:
1672 case 82:
1673 case 68:
1674 case 67:
1675 case 164:
1676 case 11:
1677 case 29:
1678 case 47:
1679 case 48:
1680 case 95:
1681 case 52:
1682 case 51:
1683 case 46:
1684 return 200809;
1685 case 79:
1686 return 0;
1687 case 27:
1688 case 246:
1689 case 127:
1690 case 128:
1691 case 23:
1692 case 24:
1693 case 160:
1694 case 161:
1695 case 181:
1696 case 182:
1697 case 242:
1698 case 183:
1699 case 184:
1700 case 243:
1701 case 244:
1702 case 245:
1703 case 165:
1704 case 178:
1705 case 179:
1706 case 49:
1707 case 50:
1708 case 168:
1709 case 169:
1710 case 175:
1711 case 170:
1712 case 171:
1713 case 172:
1714 case 97:
1715 case 76:
1716 case 32:
1717 case 173:
1718 case 35:
1719 return -1;
1720 case 176:
1721 case 177:
1722 case 7:
1723 case 155:
1724 case 8:
1725 case 157:
1726 case 125:
1727 case 126:
1728 case 92:
1729 case 93:
1730 case 129:
1731 case 130:
1732 case 131:
1733 case 94:
1734 case 91:
1735 return 1;
1736 case 74:
1737 case 60:
1738 case 69:
1739 case 70:
1740 case 4:
1741 return 1024;
1742 case 31:
1743 case 42:
1744 case 72:
1745 return 32;
1746 case 87:
1747 case 26:
1748 case 33:
1749 return 2147483647;
1750 case 34:
1751 case 1:
1752 return 47839;
1753 case 38:
1754 case 36:
1755 return 99;
1756 case 43:
1757 case 37:
1758 return 2048;
1759 case 0: return 2097152;
1760 case 3: return 65536;
1761 case 28: return 32768;
1762 case 44: return 32767;
1763 case 75: return 16384;
1764 case 39: return 1000;
1765 case 89: return 700;
1766 case 71: return 256;
1767 case 40: return 255;
1768 case 2: return 100;
1769 case 180: return 64;
1770 case 25: return 20;
1771 case 5: return 16;
1772 case 6: return 6;
1773 case 73: return 4;
1774 case 84: {
1775 if (typeof navigator === 'object') return navigator['hardwareConcurrency'] || 1;
1776 return 1;
1777 }
1778 }
1779 ___setErrNo(ERRNO_CODES.EINVAL);
1780 return -1;
1781 }
1782
1783
1784 Module["_memset"] = _memset;
1785
1786 function _pthread_cleanup_push(routine, arg) {
1787 __ATEXIT__.push(function() { Runtime.dynCall('vi', routine, [arg]) })
1788 _pthread_cleanup_push.level = __ATEXIT__.length;
1789 }
1790
1791
1792 Module["_bitshift64Lshr"] = _bitshift64Lshr;
1793
1794 function _pthread_cleanup_pop() {
1795 assert(_pthread_cleanup_push.level == __ATEXIT__.length, 'cannot pop if something else added meanwhile!');
1796 __ATEXIT__.pop();
1797 _pthread_cleanup_push.level = __ATEXIT__.length;
1798 }
1799
1800 function _abort() {
1801 Module['abort']();
1802 }
1803
1804 function ___lock() {}
1805
1806 function ___unlock() {}
1807
1808
1809
1810
1811 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"};
1812
1813 var PATH={splitPath:function (filename) {
1814 var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
1815 return splitPathRe.exec(filename).slice(1);
1816 },normalizeArray:function (parts, allowAboveRoot) {
1817 // if the path tries to go above the root, `up` ends up > 0
1818 var up = 0;
1819 for (var i = parts.length - 1; i >= 0; i--) {
1820 var last = parts[i];
1821 if (last === '.') {
1822 parts.splice(i, 1);
1823 } else if (last === '..') {
1824 parts.splice(i, 1);
1825 up++;
1826 } else if (up) {
1827 parts.splice(i, 1);
1828 up--;
1829 }
1830 }
1831 // if the path is allowed to go above the root, restore leading ..s
1832 if (allowAboveRoot) {
1833 for (; up--; up) {
1834 parts.unshift('..');
1835 }
1836 }
1837 return parts;
1838 },normalize:function (path) {
1839 var isAbsolute = path.charAt(0) === '/',
1840 trailingSlash = path.substr(-1) === '/';
1841 // Normalize the path
1842 path = PATH.normalizeArray(path.split('/').filter(function(p) {
1843 return !!p;
1844 }), !isAbsolute).join('/');
1845 if (!path && !isAbsolute) {
1846 path = '.';
1847 }
1848 if (path && trailingSlash) {
1849 path += '/';
1850 }
1851 return (isAbsolute ? '/' : '') + path;
1852 },dirname:function (path) {
1853 var result = PATH.splitPath(path),
1854 root = result[0],
1855 dir = result[1];
1856 if (!root && !dir) {
1857 // No dirname whatsoever
1858 return '.';
1859 }
1860 if (dir) {
1861 // It has a dirname, strip trailing slash
1862 dir = dir.substr(0, dir.length - 1);
1863 }
1864 return root + dir;
1865 },basename:function (path) {
1866 // EMSCRIPTEN return '/'' for '/', not an empty string
1867 if (path === '/') return '/';
1868 var lastSlash = path.lastIndexOf('/');
1869 if (lastSlash === -1) return path;
1870 return path.substr(lastSlash+1);
1871 },extname:function (path) {
1872 return PATH.splitPath(path)[3];
1873 },join:function () {
1874 var paths = Array.prototype.slice.call(arguments, 0);
1875 return PATH.normalize(paths.join('/'));
1876 },join2:function (l, r) {
1877 return PATH.normalize(l + '/' + r);
1878 },resolve:function () {
1879 var resolvedPath = '',
1880 resolvedAbsolute = false;
1881 for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
1882 var path = (i >= 0) ? arguments[i] : FS.cwd();
1883 // Skip empty and invalid entries
1884 if (typeof path !== 'string') {
1885 throw new TypeError('Arguments to path.resolve must be strings');
1886 } else if (!path) {
1887 return ''; // an invalid portion invalidates the whole thing
1888 }
1889 resolvedPath = path + '/' + resolvedPath;
1890 resolvedAbsolute = path.charAt(0) === '/';
1891 }
1892 // At this point the path should be resolved to a full absolute path, but
1893 // handle relative paths to be safe (might happen when process.cwd() fails)
1894 resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
1895 return !!p;
1896 }), !resolvedAbsolute).join('/');
1897 return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
1898 },relative:function (from, to) {
1899 from = PATH.resolve(from).substr(1);
1900 to = PATH.resolve(to).substr(1);
1901 function trim(arr) {
1902 var start = 0;
1903 for (; start < arr.length; start++) {
1904 if (arr[start] !== '') break;
1905 }
1906 var end = arr.length - 1;
1907 for (; end >= 0; end--) {
1908 if (arr[end] !== '') break;
1909 }
1910 if (start > end) return [];
1911 return arr.slice(start, end - start + 1);
1912 }
1913 var fromParts = trim(from.split('/'));
1914 var toParts = trim(to.split('/'));
1915 var length = Math.min(fromParts.length, toParts.length);
1916 var samePartsLength = length;
1917 for (var i = 0; i < length; i++) {
1918 if (fromParts[i] !== toParts[i]) {
1919 samePartsLength = i;
1920 break;
1921 }
1922 }
1923 var outputParts = [];
1924 for (var i = samePartsLength; i < fromParts.length; i++) {
1925 outputParts.push('..');
1926 }
1927 outputParts = outputParts.concat(toParts.slice(samePartsLength));
1928 return outputParts.join('/');
1929 }};
1930
1931 var TTY={ttys:[],init:function () {
1932 // https://github.com/kripken/emscripten/pull/1555
1933 // if (ENVIRONMENT_IS_NODE) {
1934 // // currently, FS.init does not distinguish if process.stdin is a file or TTY
1935 // // device, it always assumes it's a TTY device. because of this, we're forcing
1936 // // process.stdin to UTF8 encoding to at least make stdin reading compatible
1937 // // with text files until FS.init can be refactored.
1938 // process['stdin']['setEncoding']('utf8');
1939 // }
1940 },shutdown:function () {
1941 // https://github.com/kripken/emscripten/pull/1555
1942 // if (ENVIRONMENT_IS_NODE) {
1943 // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
1944 // // 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
1945 // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
1946 // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
1947 // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
1948 // process['stdin']['pause']();
1949 // }
1950 },register:function (dev, ops) {
1951 TTY.ttys[dev] = { input: [], output: [], ops: ops };
1952 FS.registerDevice(dev, TTY.stream_ops);
1953 },stream_ops:{open:function (stream) {
1954 var tty = TTY.ttys[stream.node.rdev];
1955 if (!tty) {
1956 throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
1957 }
1958 stream.tty = tty;
1959 stream.seekable = false;
1960 },close:function (stream) {
1961 // flush any pending line data
1962 stream.tty.ops.flush(stream.tty);
1963 },flush:function (stream) {
1964 stream.tty.ops.flush(stream.tty);
1965 },read:function (stream, buffer, offset, length, pos /* ignored */) {
1966 if (!stream.tty || !stream.tty.ops.get_char) {
1967 throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
1968 }
1969 var bytesRead = 0;
1970 for (var i = 0; i < length; i++) {
1971 var result;
1972 try {
1973 result = stream.tty.ops.get_char(stream.tty);
1974 } catch (e) {
1975 throw new FS.ErrnoError(ERRNO_CODES.EIO);
1976 }
1977 if (result === undefined && bytesRead === 0) {
1978 throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
1979 }
1980 if (result === null || result === undefined) break;
1981 bytesRead++;
1982 buffer[offset+i] = result;
1983 }
1984 if (bytesRead) {
1985 stream.node.timestamp = Date.now();
1986 }
1987 return bytesRead;
1988 },write:function (stream, buffer, offset, length, pos) {
1989 if (!stream.tty || !stream.tty.ops.put_char) {
1990 throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
1991 }
1992 for (var i = 0; i < length; i++) {
1993 try {
1994 stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
1995 } catch (e) {
1996 throw new FS.ErrnoError(ERRNO_CODES.EIO);
1997 }
1998 }
1999 if (length) {
2000 stream.node.timestamp = Date.now();
2001 }
2002 return i;
2003 }},default_tty_ops:{get_char:function (tty) {
2004 if (!tty.input.length) {
2005 var result = null;
2006 if (ENVIRONMENT_IS_NODE) {
2007 // we will read data by chunks of BUFSIZE
2008 var BUFSIZE = 256;
2009 var buf = new Buffer(BUFSIZE);
2010 var bytesRead = 0;
2011
2012 var fd = process.stdin.fd;
2013 // Linux and Mac cannot use process.stdin.fd (which isn't set up as sync)
2014 var usingDevice = false;
2015 try {
2016 fd = fs.openSync('/dev/stdin', 'r');
2017 usingDevice = true;
2018 } catch (e) {}
2019
2020 bytesRead = fs.readSync(fd, buf, 0, BUFSIZE, null);
2021
2022 if (usingDevice) { fs.closeSync(fd); }
2023 if (bytesRead > 0) {
2024 result = buf.slice(0, bytesRead).toString('utf-8');
2025 } else {
2026 result = null;
2027 }
2028
2029 } else if (typeof window != 'undefined' &&
2030 typeof window.prompt == 'function') {
2031 // Browser.
2032 result = window.prompt('Input: '); // returns null on cancel
2033 if (result !== null) {
2034 result += '\n';
2035 }
2036 } else if (typeof readline == 'function') {
2037 // Command line.
2038 result = readline();
2039 if (result !== null) {
2040 result += '\n';
2041 }
2042 }
2043 if (!result) {
2044 return null;
2045 }
2046 tty.input = intArrayFromString(result, true);
2047 }
2048 return tty.input.shift();
2049 },put_char:function (tty, val) {
2050 if (val === null || val === 10) {
2051 Module['print'](UTF8ArrayToString(tty.output, 0));
2052 tty.output = [];
2053 } else {
2054 if (val != 0) tty.output.push(val); // val == 0 would cut text output off in the middle.
2055 }
2056 },flush:function (tty) {
2057 if (tty.output && tty.output.length > 0) {
2058 Module['print'](UTF8ArrayToString(tty.output, 0));
2059 tty.output = [];
2060 }
2061 }},default_tty1_ops:{put_char:function (tty, val) {
2062 if (val === null || val === 10) {
2063 Module['printErr'](UTF8ArrayToString(tty.output, 0));
2064 tty.output = [];
2065 } else {
2066 if (val != 0) tty.output.push(val);
2067 }
2068 },flush:function (tty) {
2069 if (tty.output && tty.output.length > 0) {
2070 Module['printErr'](UTF8ArrayToString(tty.output, 0));
2071 tty.output = [];
2072 }
2073 }}};
2074
2075 var MEMFS={ops_table:null,mount:function (mount) {
2076 return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
2077 },createNode:function (parent, name, mode, dev) {
2078 if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
2079 // no supported
2080 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2081 }
2082 if (!MEMFS.ops_table) {
2083 MEMFS.ops_table = {
2084 dir: {
2085 node: {
2086 getattr: MEMFS.node_ops.getattr,
2087 setattr: MEMFS.node_ops.setattr,
2088 lookup: MEMFS.node_ops.lookup,
2089 mknod: MEMFS.node_ops.mknod,
2090 rename: MEMFS.node_ops.rename,
2091 unlink: MEMFS.node_ops.unlink,
2092 rmdir: MEMFS.node_ops.rmdir,
2093 readdir: MEMFS.node_ops.readdir,
2094 symlink: MEMFS.node_ops.symlink
2095 },
2096 stream: {
2097 llseek: MEMFS.stream_ops.llseek
2098 }
2099 },
2100 file: {
2101 node: {
2102 getattr: MEMFS.node_ops.getattr,
2103 setattr: MEMFS.node_ops.setattr
2104 },
2105 stream: {
2106 llseek: MEMFS.stream_ops.llseek,
2107 read: MEMFS.stream_ops.read,
2108 write: MEMFS.stream_ops.write,
2109 allocate: MEMFS.stream_ops.allocate,
2110 mmap: MEMFS.stream_ops.mmap,
2111 msync: MEMFS.stream_ops.msync
2112 }
2113 },
2114 link: {
2115 node: {
2116 getattr: MEMFS.node_ops.getattr,
2117 setattr: MEMFS.node_ops.setattr,
2118 readlink: MEMFS.node_ops.readlink
2119 },
2120 stream: {}
2121 },
2122 chrdev: {
2123 node: {
2124 getattr: MEMFS.node_ops.getattr,
2125 setattr: MEMFS.node_ops.setattr
2126 },
2127 stream: FS.chrdev_stream_ops
2128 }
2129 };
2130 }
2131 var node = FS.createNode(parent, name, mode, dev);
2132 if (FS.isDir(node.mode)) {
2133 node.node_ops = MEMFS.ops_table.dir.node;
2134 node.stream_ops = MEMFS.ops_table.dir.stream;
2135 node.contents = {};
2136 } else if (FS.isFile(node.mode)) {
2137 node.node_ops = MEMFS.ops_table.file.node;
2138 node.stream_ops = MEMFS.ops_table.file.stream;
2139 node.usedBytes = 0; // The actual number of bytes used in the typed array, as opposed to contents.buffer.byteLength which gives the whole capacity.
2140 // When the byte data of the file is populated, this will point to either a typed array, or a normal JS array. Typed arrays are preferred
2141 // for performance, and used by default. However, typed arrays are not resizable like normal JS arrays are, so there is a small disk size
2142 // penalty involved for appending file writes that continuously grow a file similar to std::vector capacity vs used -scheme.
2143 node.contents = null;
2144 } else if (FS.isLink(node.mode)) {
2145 node.node_ops = MEMFS.ops_table.link.node;
2146 node.stream_ops = MEMFS.ops_table.link.stream;
2147 } else if (FS.isChrdev(node.mode)) {
2148 node.node_ops = MEMFS.ops_table.chrdev.node;
2149 node.stream_ops = MEMFS.ops_table.chrdev.stream;
2150 }
2151 node.timestamp = Date.now();
2152 // add the new node to the parent
2153 if (parent) {
2154 parent.contents[name] = node;
2155 }
2156 return node;
2157 },getFileDataAsRegularArray:function (node) {
2158 if (node.contents && node.contents.subarray) {
2159 var arr = [];
2160 for (var i = 0; i < node.usedBytes; ++i) arr.push(node.contents[i]);
2161 return arr; // Returns a copy of the original data.
2162 }
2163 return node.contents; // No-op, the file contents are already in a JS array. Return as-is.
2164 },getFileDataAsTypedArray:function (node) {
2165 if (!node.contents) return new Uint8Array;
2166 if (node.contents.subarray) return node.contents.subarray(0, node.usedBytes); // Make sure to not return excess unused bytes.
2167 return new Uint8Array(node.contents);
2168 },expandFileStorage:function (node, newCapacity) {
2169 // If we are asked to expand the size of a file that already exists, revert to using a standard JS array to store the file
2170 // instead of a typed array. This makes resizing the array more flexible because we can just .push() elements at the back to
2171 // increase the size.
2172 if (node.contents && node.contents.subarray && newCapacity > node.contents.length) {
2173 node.contents = MEMFS.getFileDataAsRegularArray(node);
2174 node.usedBytes = node.contents.length; // We might be writing to a lazy-loaded file which had overridden this property, so force-reset it.
2175 }
2176
2177 if (!node.contents || node.contents.subarray) { // Keep using a typed array if creating a new storage, or if old one was a typed array as well.
2178 var prevCapacity = node.contents ? node.contents.buffer.byteLength : 0;
2179 if (prevCapacity >= newCapacity) return; // No need to expand, the storage was already large enough.
2180 // Don't expand strictly to the given requested limit if it's only a very small increase, but instead geometrically grow capacity.
2181 // For small filesizes (<1MB), perform size*2 geometric increase, but for large sizes, do a much more conservative size*1.125 increase to
2182 // avoid overshooting the allocation cap by a very large margin.
2183 var CAPACITY_DOUBLING_MAX = 1024 * 1024;
2184 newCapacity = Math.max(newCapacity, (prevCapacity * (prevCapacity < CAPACITY_DOUBLING_MAX ? 2.0 : 1.125)) | 0);
2185 if (prevCapacity != 0) newCapacity = Math.max(newCapacity, 256); // At minimum allocate 256b for each file when expanding.
2186 var oldContents = node.contents;
2187 node.contents = new Uint8Array(newCapacity); // Allocate new storage.
2188 if (node.usedBytes > 0) node.contents.set(oldContents.subarray(0, node.usedBytes), 0); // Copy old data over to the new storage.
2189 return;
2190 }
2191 // Not using a typed array to back the file storage. Use a standard JS array instead.
2192 if (!node.contents && newCapacity > 0) node.contents = [];
2193 while (node.contents.length < newCapacity) node.contents.push(0);
2194 },resizeFileStorage:function (node, newSize) {
2195 if (node.usedBytes == newSize) return;
2196 if (newSize == 0) {
2197 node.contents = null; // Fully decommit when requesting a resize to zero.
2198 node.usedBytes = 0;
2199 return;
2200 }
2201 if (!node.contents || node.contents.subarray) { // Resize a typed array if that is being used as the backing store.
2202 var oldContents = node.contents;
2203 node.contents = new Uint8Array(new ArrayBuffer(newSize)); // Allocate new storage.
2204 if (oldContents) {
2205 node.contents.set(oldContents.subarray(0, Math.min(newSize, node.usedBytes))); // Copy old data over to the new storage.
2206 }
2207 node.usedBytes = newSize;
2208 return;
2209 }
2210 // Backing with a JS array.
2211 if (!node.contents) node.contents = [];
2212 if (node.contents.length > newSize) node.contents.length = newSize;
2213 else while (node.contents.length < newSize) node.contents.push(0);
2214 node.usedBytes = newSize;
2215 },node_ops:{getattr:function (node) {
2216 var attr = {};
2217 // device numbers reuse inode numbers.
2218 attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
2219 attr.ino = node.id;
2220 attr.mode = node.mode;
2221 attr.nlink = 1;
2222 attr.uid = 0;
2223 attr.gid = 0;
2224 attr.rdev = node.rdev;
2225 if (FS.isDir(node.mode)) {
2226 attr.size = 4096;
2227 } else if (FS.isFile(node.mode)) {
2228 attr.size = node.usedBytes;
2229 } else if (FS.isLink(node.mode)) {
2230 attr.size = node.link.length;
2231 } else {
2232 attr.size = 0;
2233 }
2234 attr.atime = new Date(node.timestamp);
2235 attr.mtime = new Date(node.timestamp);
2236 attr.ctime = new Date(node.timestamp);
2237 // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
2238 // but this is not required by the standard.
2239 attr.blksize = 4096;
2240 attr.blocks = Math.ceil(attr.size / attr.blksize);
2241 return attr;
2242 },setattr:function (node, attr) {
2243 if (attr.mode !== undefined) {
2244 node.mode = attr.mode;
2245 }
2246 if (attr.timestamp !== undefined) {
2247 node.timestamp = attr.timestamp;
2248 }
2249 if (attr.size !== undefined) {
2250 MEMFS.resizeFileStorage(node, attr.size);
2251 }
2252 },lookup:function (parent, name) {
2253 throw FS.genericErrors[ERRNO_CODES.ENOENT];
2254 },mknod:function (parent, name, mode, dev) {
2255 return MEMFS.createNode(parent, name, mode, dev);
2256 },rename:function (old_node, new_dir, new_name) {
2257 // if we're overwriting a directory at new_name, make sure it's empty.
2258 if (FS.isDir(old_node.mode)) {
2259 var new_node;
2260 try {
2261 new_node = FS.lookupNode(new_dir, new_name);
2262 } catch (e) {
2263 }
2264 if (new_node) {
2265 for (var i in new_node.contents) {
2266 throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
2267 }
2268 }
2269 }
2270 // do the internal rewiring
2271 delete old_node.parent.contents[old_node.name];
2272 old_node.name = new_name;
2273 new_dir.contents[new_name] = old_node;
2274 old_node.parent = new_dir;
2275 },unlink:function (parent, name) {
2276 delete parent.contents[name];
2277 },rmdir:function (parent, name) {
2278 var node = FS.lookupNode(parent, name);
2279 for (var i in node.contents) {
2280 throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
2281 }
2282 delete parent.contents[name];
2283 },readdir:function (node) {
2284 var entries = ['.', '..']
2285 for (var key in node.contents) {
2286 if (!node.contents.hasOwnProperty(key)) {
2287 continue;
2288 }
2289 entries.push(key);
2290 }
2291 return entries;
2292 },symlink:function (parent, newname, oldpath) {
2293 var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
2294 node.link = oldpath;
2295 return node;
2296 },readlink:function (node) {
2297 if (!FS.isLink(node.mode)) {
2298 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
2299 }
2300 return node.link;
2301 }},stream_ops:{read:function (stream, buffer, offset, length, position) {
2302 var contents = stream.node.contents;
2303 if (position >= stream.node.usedBytes) return 0;
2304 var size = Math.min(stream.node.usedBytes - position, length);
2305 assert(size >= 0);
2306 if (size > 8 && contents.subarray) { // non-trivial, and typed array
2307 buffer.set(contents.subarray(position, position + size), offset);
2308 } else {
2309 for (var i = 0; i < size; i++) buffer[offset + i] = contents[position + i];
2310 }
2311 return size;
2312 },write:function (stream, buffer, offset, length, position, canOwn) {
2313 if (!length) return 0;
2314 var node = stream.node;
2315 node.timestamp = Date.now();
2316
2317 if (buffer.subarray && (!node.contents || node.contents.subarray)) { // This write is from a typed array to a typed array?
2318 if (canOwn) { // Can we just reuse the buffer we are given?
2319 assert(position === 0, 'canOwn must imply no weird position inside the file');
2320 node.contents = buffer.subarray(offset, offset + length);
2321 node.usedBytes = length;
2322 return length;
2323 } else if (node.usedBytes === 0 && position === 0) { // If this is a simple first write to an empty file, do a fast set since we don't need to care about old data.
2324 node.contents = new Uint8Array(buffer.subarray(offset, offset + length));
2325 node.usedBytes = length;
2326 return length;
2327 } else if (position + length <= node.usedBytes) { // Writing to an already allocated and used subrange of the file?
2328 node.contents.set(buffer.subarray(offset, offset + length), position);
2329 return length;
2330 }
2331 }
2332
2333 // Appending to an existing file and we need to reallocate, or source data did not come as a typed array.
2334 MEMFS.expandFileStorage(node, position+length);
2335 if (node.contents.subarray && buffer.subarray) node.contents.set(buffer.subarray(offset, offset + length), position); // Use typed array write if available.
2336 else {
2337 for (var i = 0; i < length; i++) {
2338 node.contents[position + i] = buffer[offset + i]; // Or fall back to manual write if not.
2339 }
2340 }
2341 node.usedBytes = Math.max(node.usedBytes, position+length);
2342 return length;
2343 },llseek:function (stream, offset, whence) {
2344 var position = offset;
2345 if (whence === 1) { // SEEK_CUR.
2346 position += stream.position;
2347 } else if (whence === 2) { // SEEK_END.
2348 if (FS.isFile(stream.node.mode)) {
2349 position += stream.node.usedBytes;
2350 }
2351 }
2352 if (position < 0) {
2353 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
2354 }
2355 return position;
2356 },allocate:function (stream, offset, length) {
2357 MEMFS.expandFileStorage(stream.node, offset + length);
2358 stream.node.usedBytes = Math.max(stream.node.usedBytes, offset + length);
2359 },mmap:function (stream, buffer, offset, length, position, prot, flags) {
2360 if (!FS.isFile(stream.node.mode)) {
2361 throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
2362 }
2363 var ptr;
2364 var allocated;
2365 var contents = stream.node.contents;
2366 // Only make a new copy when MAP_PRIVATE is specified.
2367 if ( !(flags & 2) &&
2368 (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
2369 // We can't emulate MAP_SHARED when the file is not backed by the buffer
2370 // we're mapping to (e.g. the HEAP buffer).
2371 allocated = false;
2372 ptr = contents.byteOffset;
2373 } else {
2374 // Try to avoid unnecessary slices.
2375 if (position > 0 || position + length < stream.node.usedBytes) {
2376 if (contents.subarray) {
2377 contents = contents.subarray(position, position + length);
2378 } else {
2379 contents = Array.prototype.slice.call(contents, position, position + length);
2380 }
2381 }
2382 allocated = true;
2383 ptr = _malloc(length);
2384 if (!ptr) {
2385 throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
2386 }
2387 buffer.set(contents, ptr);
2388 }
2389 return { ptr: ptr, allocated: allocated };
2390 },msync:function (stream, buffer, offset, length, mmapFlags) {
2391 if (!FS.isFile(stream.node.mode)) {
2392 throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
2393 }
2394 if (mmapFlags & 2) {
2395 // MAP_PRIVATE calls need not to be synced back to underlying fs
2396 return 0;
2397 }
2398
2399 var bytesWritten = MEMFS.stream_ops.write(stream, buffer, 0, length, offset, false);
2400 // should we check if bytesWritten and length are the same?
2401 return 0;
2402 }}};
2403
2404 var IDBFS={dbs:{},indexedDB:function () {
2405 if (typeof indexedDB !== 'undefined') return indexedDB;
2406 var ret = null;
2407 if (typeof window === 'object') ret = window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
2408 assert(ret, 'IDBFS used, but indexedDB not supported');
2409 return ret;
2410 },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
2411 // reuse all of the core MEMFS functionality
2412 return MEMFS.mount.apply(null, arguments);
2413 },syncfs:function (mount, populate, callback) {
2414 IDBFS.getLocalSet(mount, function(err, local) {
2415 if (err) return callback(err);
2416
2417 IDBFS.getRemoteSet(mount, function(err, remote) {
2418 if (err) return callback(err);
2419
2420 var src = populate ? remote : local;
2421 var dst = populate ? local : remote;
2422
2423 IDBFS.reconcile(src, dst, callback);
2424 });
2425 });
2426 },getDB:function (name, callback) {
2427 // check the cache first
2428 var db = IDBFS.dbs[name];
2429 if (db) {
2430 return callback(null, db);
2431 }
2432
2433 var req;
2434 try {
2435 req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
2436 } catch (e) {
2437 return callback(e);
2438 }
2439 req.onupgradeneeded = function(e) {
2440 var db = e.target.result;
2441 var transaction = e.target.transaction;
2442
2443 var fileStore;
2444
2445 if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
2446 fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
2447 } else {
2448 fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
2449 }
2450
2451 if (!fileStore.indexNames.contains('timestamp')) {
2452 fileStore.createIndex('timestamp', 'timestamp', { unique: false });
2453 }
2454 };
2455 req.onsuccess = function() {
2456 db = req.result;
2457
2458 // add to the cache
2459 IDBFS.dbs[name] = db;
2460 callback(null, db);
2461 };
2462 req.onerror = function(e) {
2463 callback(this.error);
2464 e.preventDefault();
2465 };
2466 },getLocalSet:function (mount, callback) {
2467 var entries = {};
2468
2469 function isRealDir(p) {
2470 return p !== '.' && p !== '..';
2471 };
2472 function toAbsolute(root) {
2473 return function(p) {
2474 return PATH.join2(root, p);
2475 }
2476 };
2477
2478 var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
2479
2480 while (check.length) {
2481 var path = check.pop();
2482 var stat;
2483
2484 try {
2485 stat = FS.stat(path);
2486 } catch (e) {
2487 return callback(e);
2488 }
2489
2490 if (FS.isDir(stat.mode)) {
2491 check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
2492 }
2493
2494 entries[path] = { timestamp: stat.mtime };
2495 }
2496
2497 return callback(null, { type: 'local', entries: entries });
2498 },getRemoteSet:function (mount, callback) {
2499 var entries = {};
2500
2501 IDBFS.getDB(mount.mountpoint, function(err, db) {
2502 if (err) return callback(err);
2503
2504 var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
2505 transaction.onerror = function(e) {
2506 callback(this.error);
2507 e.preventDefault();
2508 };
2509
2510 var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
2511 var index = store.index('timestamp');
2512
2513 index.openKeyCursor().onsuccess = function(event) {
2514 var cursor = event.target.result;
2515
2516 if (!cursor) {
2517 return callback(null, { type: 'remote', db: db, entries: entries });
2518 }
2519
2520 entries[cursor.primaryKey] = { timestamp: cursor.key };
2521
2522 cursor.continue();
2523 };
2524 });
2525 },loadLocalEntry:function (path, callback) {
2526 var stat, node;
2527
2528 try {
2529 var lookup = FS.lookupPath(path);
2530 node = lookup.node;
2531 stat = FS.stat(path);
2532 } catch (e) {
2533 return callback(e);
2534 }
2535
2536 if (FS.isDir(stat.mode)) {
2537 return callback(null, { timestamp: stat.mtime, mode: stat.mode });
2538 } else if (FS.isFile(stat.mode)) {
2539 // Performance consideration: storing a normal JavaScript array to a IndexedDB is much slower than storing a typed array.
2540 // Therefore always convert the file contents to a typed array first before writing the data to IndexedDB.
2541 node.contents = MEMFS.getFileDataAsTypedArray(node);
2542 return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
2543 } else {
2544 return callback(new Error('node type not supported'));
2545 }
2546 },storeLocalEntry:function (path, entry, callback) {
2547 try {
2548 if (FS.isDir(entry.mode)) {
2549 FS.mkdir(path, entry.mode);
2550 } else if (FS.isFile(entry.mode)) {
2551 FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
2552 } else {
2553 return callback(new Error('node type not supported'));
2554 }
2555
2556 FS.chmod(path, entry.mode);
2557 FS.utime(path, entry.timestamp, entry.timestamp);
2558 } catch (e) {
2559 return callback(e);
2560 }
2561
2562 callback(null);
2563 },removeLocalEntry:function (path, callback) {
2564 try {
2565 var lookup = FS.lookupPath(path);
2566 var stat = FS.stat(path);
2567
2568 if (FS.isDir(stat.mode)) {
2569 FS.rmdir(path);
2570 } else if (FS.isFile(stat.mode)) {
2571 FS.unlink(path);
2572 }
2573 } catch (e) {
2574 return callback(e);
2575 }
2576
2577 callback(null);
2578 },loadRemoteEntry:function (store, path, callback) {
2579 var req = store.get(path);
2580 req.onsuccess = function(event) { callback(null, event.target.result); };
2581 req.onerror = function(e) {
2582 callback(this.error);
2583 e.preventDefault();
2584 };
2585 },storeRemoteEntry:function (store, path, entry, callback) {
2586 var req = store.put(entry, path);
2587 req.onsuccess = function() { callback(null); };
2588 req.onerror = function(e) {
2589 callback(this.error);
2590 e.preventDefault();
2591 };
2592 },removeRemoteEntry:function (store, path, callback) {
2593 var req = store.delete(path);
2594 req.onsuccess = function() { callback(null); };
2595 req.onerror = function(e) {
2596 callback(this.error);
2597 e.preventDefault();
2598 };
2599 },reconcile:function (src, dst, callback) {
2600 var total = 0;
2601
2602 var create = [];
2603 Object.keys(src.entries).forEach(function (key) {
2604 var e = src.entries[key];
2605 var e2 = dst.entries[key];
2606 if (!e2 || e.timestamp > e2.timestamp) {
2607 create.push(key);
2608 total++;
2609 }
2610 });
2611
2612 var remove = [];
2613 Object.keys(dst.entries).forEach(function (key) {
2614 var e = dst.entries[key];
2615 var e2 = src.entries[key];
2616 if (!e2) {
2617 remove.push(key);
2618 total++;
2619 }
2620 });
2621
2622 if (!total) {
2623 return callback(null);
2624 }
2625
2626 var errored = false;
2627 var completed = 0;
2628 var db = src.type === 'remote' ? src.db : dst.db;
2629 var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
2630 var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
2631
2632 function done(err) {
2633 if (err) {
2634 if (!done.errored) {
2635 done.errored = true;
2636 return callback(err);
2637 }
2638 return;
2639 }
2640 if (++completed >= total) {
2641 return callback(null);
2642 }
2643 };
2644
2645 transaction.onerror = function(e) {
2646 done(this.error);
2647 e.preventDefault();
2648 };
2649
2650 // sort paths in ascending order so directory entries are created
2651 // before the files inside them
2652 create.sort().forEach(function (path) {
2653 if (dst.type === 'local') {
2654 IDBFS.loadRemoteEntry(store, path, function (err, entry) {
2655 if (err) return done(err);
2656 IDBFS.storeLocalEntry(path, entry, done);
2657 });
2658 } else {
2659 IDBFS.loadLocalEntry(path, function (err, entry) {
2660 if (err) return done(err);
2661 IDBFS.storeRemoteEntry(store, path, entry, done);
2662 });
2663 }
2664 });
2665
2666 // sort paths in descending order so files are deleted before their
2667 // parent directories
2668 remove.sort().reverse().forEach(function(path) {
2669 if (dst.type === 'local') {
2670 IDBFS.removeLocalEntry(path, done);
2671 } else {
2672 IDBFS.removeRemoteEntry(store, path, done);
2673 }
2674 });
2675 }};
2676
2677 var NODEFS={isWindows:false,staticInit:function () {
2678 NODEFS.isWindows = !!process.platform.match(/^win/);
2679 },mount:function (mount) {
2680 assert(ENVIRONMENT_IS_NODE);
2681 return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
2682 },createNode:function (parent, name, mode, dev) {
2683 if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
2684 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
2685 }
2686 var node = FS.createNode(parent, name, mode);
2687 node.node_ops = NODEFS.node_ops;
2688 node.stream_ops = NODEFS.stream_ops;
2689 return node;
2690 },getMode:function (path) {
2691 var stat;
2692 try {
2693 stat = fs.lstatSync(path);
2694 if (NODEFS.isWindows) {
2695 // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
2696 // propagate write bits to execute bits.
2697 stat.mode = stat.mode | ((stat.mode & 146) >> 1);
2698 }
2699 } catch (e) {
2700 if (!e.code) throw e;
2701 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2702 }
2703 return stat.mode;
2704 },realPath:function (node) {
2705 var parts = [];
2706 while (node.parent !== node) {
2707 parts.push(node.name);
2708 node = node.parent;
2709 }
2710 parts.push(node.mount.opts.root);
2711 parts.reverse();
2712 return PATH.join.apply(null, parts);
2713 },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) {
2714 flags &= ~0100000 /*O_LARGEFILE*/; // Ignore this flag from musl, otherwise node.js fails to open the file.
2715 if (flags in NODEFS.flagsToPermissionStringMap) {
2716 return NODEFS.flagsToPermissionStringMap[flags];
2717 } else {
2718 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
2719 }
2720 },node_ops:{getattr:function (node) {
2721 var path = NODEFS.realPath(node);
2722 var stat;
2723 try {
2724 stat = fs.lstatSync(path);
2725 } catch (e) {
2726 if (!e.code) throw e;
2727 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2728 }
2729 // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
2730 // See http://support.microsoft.com/kb/140365
2731 if (NODEFS.isWindows && !stat.blksize) {
2732 stat.blksize = 4096;
2733 }
2734 if (NODEFS.isWindows && !stat.blocks) {
2735 stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
2736 }
2737 return {
2738 dev: stat.dev,
2739 ino: stat.ino,
2740 mode: stat.mode,
2741 nlink: stat.nlink,
2742 uid: stat.uid,
2743 gid: stat.gid,
2744 rdev: stat.rdev,
2745 size: stat.size,
2746 atime: stat.atime,
2747 mtime: stat.mtime,
2748 ctime: stat.ctime,
2749 blksize: stat.blksize,
2750 blocks: stat.blocks
2751 };
2752 },setattr:function (node, attr) {
2753 var path = NODEFS.realPath(node);
2754 try {
2755 if (attr.mode !== undefined) {
2756 fs.chmodSync(path, attr.mode);
2757 // update the common node structure mode as well
2758 node.mode = attr.mode;
2759 }
2760 if (attr.timestamp !== undefined) {
2761 var date = new Date(attr.timestamp);
2762 fs.utimesSync(path, date, date);
2763 }
2764 if (attr.size !== undefined) {
2765 fs.truncateSync(path, attr.size);
2766 }
2767 } catch (e) {
2768 if (!e.code) throw e;
2769 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2770 }
2771 },lookup:function (parent, name) {
2772 var path = PATH.join2(NODEFS.realPath(parent), name);
2773 var mode = NODEFS.getMode(path);
2774 return NODEFS.createNode(parent, name, mode);
2775 },mknod:function (parent, name, mode, dev) {
2776 var node = NODEFS.createNode(parent, name, mode, dev);
2777 // create the backing node for this in the fs root as well
2778 var path = NODEFS.realPath(node);
2779 try {
2780 if (FS.isDir(node.mode)) {
2781 fs.mkdirSync(path, node.mode);
2782 } else {
2783 fs.writeFileSync(path, '', { mode: node.mode });
2784 }
2785 } catch (e) {
2786 if (!e.code) throw e;
2787 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2788 }
2789 return node;
2790 },rename:function (oldNode, newDir, newName) {
2791 var oldPath = NODEFS.realPath(oldNode);
2792 var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
2793 try {
2794 fs.renameSync(oldPath, newPath);
2795 } catch (e) {
2796 if (!e.code) throw e;
2797 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2798 }
2799 },unlink:function (parent, name) {
2800 var path = PATH.join2(NODEFS.realPath(parent), name);
2801 try {
2802 fs.unlinkSync(path);
2803 } catch (e) {
2804 if (!e.code) throw e;
2805 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2806 }
2807 },rmdir:function (parent, name) {
2808 var path = PATH.join2(NODEFS.realPath(parent), name);
2809 try {
2810 fs.rmdirSync(path);
2811 } catch (e) {
2812 if (!e.code) throw e;
2813 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2814 }
2815 },readdir:function (node) {
2816 var path = NODEFS.realPath(node);
2817 try {
2818 return fs.readdirSync(path);
2819 } catch (e) {
2820 if (!e.code) throw e;
2821 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2822 }
2823 },symlink:function (parent, newName, oldPath) {
2824 var newPath = PATH.join2(NODEFS.realPath(parent), newName);
2825 try {
2826 fs.symlinkSync(oldPath, newPath);
2827 } catch (e) {
2828 if (!e.code) throw e;
2829 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2830 }
2831 },readlink:function (node) {
2832 var path = NODEFS.realPath(node);
2833 try {
2834 path = fs.readlinkSync(path);
2835 path = NODEJS_PATH.relative(NODEJS_PATH.resolve(node.mount.opts.root), path);
2836 return path;
2837 } catch (e) {
2838 if (!e.code) throw e;
2839 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2840 }
2841 }},stream_ops:{open:function (stream) {
2842 var path = NODEFS.realPath(stream.node);
2843 try {
2844 if (FS.isFile(stream.node.mode)) {
2845 stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
2846 }
2847 } catch (e) {
2848 if (!e.code) throw e;
2849 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2850 }
2851 },close:function (stream) {
2852 try {
2853 if (FS.isFile(stream.node.mode) && stream.nfd) {
2854 fs.closeSync(stream.nfd);
2855 }
2856 } catch (e) {
2857 if (!e.code) throw e;
2858 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2859 }
2860 },read:function (stream, buffer, offset, length, position) {
2861 if (length === 0) return 0; // node errors on 0 length reads
2862 // FIXME this is terrible.
2863 var nbuffer = new Buffer(length);
2864 var res;
2865 try {
2866 res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
2867 } catch (e) {
2868 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2869 }
2870 if (res > 0) {
2871 for (var i = 0; i < res; i++) {
2872 buffer[offset + i] = nbuffer[i];
2873 }
2874 }
2875 return res;
2876 },write:function (stream, buffer, offset, length, position) {
2877 // FIXME this is terrible.
2878 var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
2879 var res;
2880 try {
2881 res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
2882 } catch (e) {
2883 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2884 }
2885 return res;
2886 },llseek:function (stream, offset, whence) {
2887 var position = offset;
2888 if (whence === 1) { // SEEK_CUR.
2889 position += stream.position;
2890 } else if (whence === 2) { // SEEK_END.
2891 if (FS.isFile(stream.node.mode)) {
2892 try {
2893 var stat = fs.fstatSync(stream.nfd);
2894 position += stat.size;
2895 } catch (e) {
2896 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
2897 }
2898 }
2899 }
2900
2901 if (position < 0) {
2902 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
2903 }
2904
2905 return position;
2906 }}};
2907
2908 var WORKERFS={DIR_MODE:16895,FILE_MODE:33279,reader:null,mount:function (mount) {
2909 assert(ENVIRONMENT_IS_WORKER);
2910 if (!WORKERFS.reader) WORKERFS.reader = new FileReaderSync();
2911 var root = WORKERFS.createNode(null, '/', WORKERFS.DIR_MODE, 0);
2912 var createdParents = {};
2913 function ensureParent(path) {
2914 // return the parent node, creating subdirs as necessary
2915 var parts = path.split('/');
2916 var parent = root;
2917 for (var i = 0; i < parts.length-1; i++) {
2918 var curr = parts.slice(0, i+1).join('/');
2919 if (!createdParents[curr]) {
2920 createdParents[curr] = WORKERFS.createNode(parent, curr, WORKERFS.DIR_MODE, 0);
2921 }
2922 parent = createdParents[curr];
2923 }
2924 return parent;
2925 }
2926 function base(path) {
2927 var parts = path.split('/');
2928 return parts[parts.length-1];
2929 }
2930 // We also accept FileList here, by using Array.prototype
2931 Array.prototype.forEach.call(mount.opts["files"] || [], function(file) {
2932 WORKERFS.createNode(ensureParent(file.name), base(file.name), WORKERFS.FILE_MODE, 0, file, file.lastModifiedDate);
2933 });
2934 (mount.opts["blobs"] || []).forEach(function(obj) {
2935 WORKERFS.createNode(ensureParent(obj["name"]), base(obj["name"]), WORKERFS.FILE_MODE, 0, obj["data"]);
2936 });
2937 (mount.opts["packages"] || []).forEach(function(pack) {
2938 pack['metadata'].files.forEach(function(file) {
2939 var name = file.filename.substr(1); // remove initial slash
2940 WORKERFS.createNode(ensureParent(name), base(name), WORKERFS.FILE_MODE, 0, pack['blob'].slice(file.start, file.end));
2941 });
2942 });
2943 return root;
2944 },createNode:function (parent, name, mode, dev, contents, mtime) {
2945 var node = FS.createNode(parent, name, mode);
2946 node.mode = mode;
2947 node.node_ops = WORKERFS.node_ops;
2948 node.stream_ops = WORKERFS.stream_ops;
2949 node.timestamp = (mtime || new Date).getTime();
2950 assert(WORKERFS.FILE_MODE !== WORKERFS.DIR_MODE);
2951 if (mode === WORKERFS.FILE_MODE) {
2952 node.size = contents.size;
2953 node.contents = contents;
2954 } else {
2955 node.size = 4096;
2956 node.contents = {};
2957 }
2958 if (parent) {
2959 parent.contents[name] = node;
2960 }
2961 return node;
2962 },node_ops:{getattr:function (node) {
2963 return {
2964 dev: 1,
2965 ino: undefined,
2966 mode: node.mode,
2967 nlink: 1,
2968 uid: 0,
2969 gid: 0,
2970 rdev: undefined,
2971 size: node.size,
2972 atime: new Date(node.timestamp),
2973 mtime: new Date(node.timestamp),
2974 ctime: new Date(node.timestamp),
2975 blksize: 4096,
2976 blocks: Math.ceil(node.size / 4096),
2977 };
2978 },setattr:function (node, attr) {
2979 if (attr.mode !== undefined) {
2980 node.mode = attr.mode;
2981 }
2982 if (attr.timestamp !== undefined) {
2983 node.timestamp = attr.timestamp;
2984 }
2985 },lookup:function (parent, name) {
2986 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
2987 },mknod:function (parent, name, mode, dev) {
2988 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2989 },rename:function (oldNode, newDir, newName) {
2990 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2991 },unlink:function (parent, name) {
2992 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2993 },rmdir:function (parent, name) {
2994 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2995 },readdir:function (node) {
2996 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2997 },symlink:function (parent, newName, oldPath) {
2998 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
2999 },readlink:function (node) {
3000 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3001 }},stream_ops:{read:function (stream, buffer, offset, length, position) {
3002 if (position >= stream.node.size) return 0;
3003 var chunk = stream.node.contents.slice(position, position + length);
3004 var ab = WORKERFS.reader.readAsArrayBuffer(chunk);
3005 buffer.set(new Uint8Array(ab), offset);
3006 return chunk.size;
3007 },write:function (stream, buffer, offset, length, position) {
3008 throw new FS.ErrnoError(ERRNO_CODES.EIO);
3009 },llseek:function (stream, offset, whence) {
3010 var position = offset;
3011 if (whence === 1) { // SEEK_CUR.
3012 position += stream.position;
3013 } else if (whence === 2) { // SEEK_END.
3014 if (FS.isFile(stream.node.mode)) {
3015 position += stream.node.size;
3016 }
3017 }
3018 if (position < 0) {
3019 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3020 }
3021 return position;
3022 }}};
3023
3024 var _stdin=allocate(1, "i32*", ALLOC_STATIC);
3025
3026 var _stdout=allocate(1, "i32*", ALLOC_STATIC);
3027
3028 var _stderr=allocate(1, "i32*", ALLOC_STATIC);var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,trackingDelegate:{},tracking:{openFlags:{READ:1,WRITE:2}},ErrnoError:null,genericErrors:{},filesystems:null,handleFSError:function (e) {
3029 if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
3030 return ___setErrNo(e.errno);
3031 },lookupPath:function (path, opts) {
3032 path = PATH.resolve(FS.cwd(), path);
3033 opts = opts || {};
3034
3035 if (!path) return { path: '', node: null };
3036
3037 var defaults = {
3038 follow_mount: true,
3039 recurse_count: 0
3040 };
3041 for (var key in defaults) {
3042 if (opts[key] === undefined) {
3043 opts[key] = defaults[key];
3044 }
3045 }
3046
3047 if (opts.recurse_count > 8) { // max recursive lookup of 8
3048 throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
3049 }
3050
3051 // split the path
3052 var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
3053 return !!p;
3054 }), false);
3055
3056 // start at the root
3057 var current = FS.root;
3058 var current_path = '/';
3059
3060 for (var i = 0; i < parts.length; i++) {
3061 var islast = (i === parts.length-1);
3062 if (islast && opts.parent) {
3063 // stop resolving
3064 break;
3065 }
3066
3067 current = FS.lookupNode(current, parts[i]);
3068 current_path = PATH.join2(current_path, parts[i]);
3069
3070 // jump to the mount's root node if this is a mountpoint
3071 if (FS.isMountpoint(current)) {
3072 if (!islast || (islast && opts.follow_mount)) {
3073 current = current.mounted.root;
3074 }
3075 }
3076
3077 // by default, lookupPath will not follow a symlink if it is the final path component.
3078 // setting opts.follow = true will override this behavior.
3079 if (!islast || opts.follow) {
3080 var count = 0;
3081 while (FS.isLink(current.mode)) {
3082 var link = FS.readlink(current_path);
3083 current_path = PATH.resolve(PATH.dirname(current_path), link);
3084
3085 var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
3086 current = lookup.node;
3087
3088 if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
3089 throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
3090 }
3091 }
3092 }
3093 }
3094
3095 return { path: current_path, node: current };
3096 },getPath:function (node) {
3097 var path;
3098 while (true) {
3099 if (FS.isRoot(node)) {
3100 var mount = node.mount.mountpoint;
3101 if (!path) return mount;
3102 return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
3103 }
3104 path = path ? node.name + '/' + path : node.name;
3105 node = node.parent;
3106 }
3107 },hashName:function (parentid, name) {
3108 var hash = 0;
3109
3110
3111 for (var i = 0; i < name.length; i++) {
3112 hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
3113 }
3114 return ((parentid + hash) >>> 0) % FS.nameTable.length;
3115 },hashAddNode:function (node) {
3116 var hash = FS.hashName(node.parent.id, node.name);
3117 node.name_next = FS.nameTable[hash];
3118 FS.nameTable[hash] = node;
3119 },hashRemoveNode:function (node) {
3120 var hash = FS.hashName(node.parent.id, node.name);
3121 if (FS.nameTable[hash] === node) {
3122 FS.nameTable[hash] = node.name_next;
3123 } else {
3124 var current = FS.nameTable[hash];
3125 while (current) {
3126 if (current.name_next === node) {
3127 current.name_next = node.name_next;
3128 break;
3129 }
3130 current = current.name_next;
3131 }
3132 }
3133 },lookupNode:function (parent, name) {
3134 var err = FS.mayLookup(parent);
3135 if (err) {
3136 throw new FS.ErrnoError(err, parent);
3137 }
3138 var hash = FS.hashName(parent.id, name);
3139 for (var node = FS.nameTable[hash]; node; node = node.name_next) {
3140 var nodeName = node.name;
3141 if (node.parent.id === parent.id && nodeName === name) {
3142 return node;
3143 }
3144 }
3145 // if we failed to find it in the cache, call into the VFS
3146 return FS.lookup(parent, name);
3147 },createNode:function (parent, name, mode, rdev) {
3148 if (!FS.FSNode) {
3149 FS.FSNode = function(parent, name, mode, rdev) {
3150 if (!parent) {
3151 parent = this; // root node sets parent to itself
3152 }
3153 this.parent = parent;
3154 this.mount = parent.mount;
3155 this.mounted = null;
3156 this.id = FS.nextInode++;
3157 this.name = name;
3158 this.mode = mode;
3159 this.node_ops = {};
3160 this.stream_ops = {};
3161 this.rdev = rdev;
3162 };
3163
3164 FS.FSNode.prototype = {};
3165
3166 // compatibility
3167 var readMode = 292 | 73;
3168 var writeMode = 146;
3169
3170 // NOTE we must use Object.defineProperties instead of individual calls to
3171 // Object.defineProperty in order to make closure compiler happy
3172 Object.defineProperties(FS.FSNode.prototype, {
3173 read: {
3174 get: function() { return (this.mode & readMode) === readMode; },
3175 set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
3176 },
3177 write: {
3178 get: function() { return (this.mode & writeMode) === writeMode; },
3179 set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
3180 },
3181 isFolder: {
3182 get: function() { return FS.isDir(this.mode); }
3183 },
3184 isDevice: {
3185 get: function() { return FS.isChrdev(this.mode); }
3186 }
3187 });
3188 }
3189
3190 var node = new FS.FSNode(parent, name, mode, rdev);
3191
3192 FS.hashAddNode(node);
3193
3194 return node;
3195 },destroyNode:function (node) {
3196 FS.hashRemoveNode(node);
3197 },isRoot:function (node) {
3198 return node === node.parent;
3199 },isMountpoint:function (node) {
3200 return !!node.mounted;
3201 },isFile:function (mode) {
3202 return (mode & 61440) === 32768;
3203 },isDir:function (mode) {
3204 return (mode & 61440) === 16384;
3205 },isLink:function (mode) {
3206 return (mode & 61440) === 40960;
3207 },isChrdev:function (mode) {
3208 return (mode & 61440) === 8192;
3209 },isBlkdev:function (mode) {
3210 return (mode & 61440) === 24576;
3211 },isFIFO:function (mode) {
3212 return (mode & 61440) === 4096;
3213 },isSocket:function (mode) {
3214 return (mode & 49152) === 49152;
3215 },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) {
3216 var flags = FS.flagModes[str];
3217 if (typeof flags === 'undefined') {
3218 throw new Error('Unknown file open mode: ' + str);
3219 }
3220 return flags;
3221 },flagsToPermissionString:function (flag) {
3222 var perms = ['r', 'w', 'rw'][flag & 3];
3223 if ((flag & 512)) {
3224 perms += 'w';
3225 }
3226 return perms;
3227 },nodePermissions:function (node, perms) {
3228 if (FS.ignorePermissions) {
3229 return 0;
3230 }
3231 // return 0 if any user, group or owner bits are set.
3232 if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
3233 return ERRNO_CODES.EACCES;
3234 } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
3235 return ERRNO_CODES.EACCES;
3236 } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
3237 return ERRNO_CODES.EACCES;
3238 }
3239 return 0;
3240 },mayLookup:function (dir) {
3241 var err = FS.nodePermissions(dir, 'x');
3242 if (err) return err;
3243 if (!dir.node_ops.lookup) return ERRNO_CODES.EACCES;
3244 return 0;
3245 },mayCreate:function (dir, name) {
3246 try {
3247 var node = FS.lookupNode(dir, name);
3248 return ERRNO_CODES.EEXIST;
3249 } catch (e) {
3250 }
3251 return FS.nodePermissions(dir, 'wx');
3252 },mayDelete:function (dir, name, isdir) {
3253 var node;
3254 try {
3255 node = FS.lookupNode(dir, name);
3256 } catch (e) {
3257 return e.errno;
3258 }
3259 var err = FS.nodePermissions(dir, 'wx');
3260 if (err) {
3261 return err;
3262 }
3263 if (isdir) {
3264 if (!FS.isDir(node.mode)) {
3265 return ERRNO_CODES.ENOTDIR;
3266 }
3267 if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
3268 return ERRNO_CODES.EBUSY;
3269 }
3270 } else {
3271 if (FS.isDir(node.mode)) {
3272 return ERRNO_CODES.EISDIR;
3273 }
3274 }
3275 return 0;
3276 },mayOpen:function (node, flags) {
3277 if (!node) {
3278 return ERRNO_CODES.ENOENT;
3279 }
3280 if (FS.isLink(node.mode)) {
3281 return ERRNO_CODES.ELOOP;
3282 } else if (FS.isDir(node.mode)) {
3283 if ((flags & 2097155) !== 0 || // opening for write
3284 (flags & 512)) {
3285 return ERRNO_CODES.EISDIR;
3286 }
3287 }
3288 return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
3289 },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
3290 fd_start = fd_start || 0;
3291 fd_end = fd_end || FS.MAX_OPEN_FDS;
3292 for (var fd = fd_start; fd <= fd_end; fd++) {
3293 if (!FS.streams[fd]) {
3294 return fd;
3295 }
3296 }
3297 throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
3298 },getStream:function (fd) {
3299 return FS.streams[fd];
3300 },createStream:function (stream, fd_start, fd_end) {
3301 if (!FS.FSStream) {
3302 FS.FSStream = function(){};
3303 FS.FSStream.prototype = {};
3304 // compatibility
3305 Object.defineProperties(FS.FSStream.prototype, {
3306 object: {
3307 get: function() { return this.node; },
3308 set: function(val) { this.node = val; }
3309 },
3310 isRead: {
3311 get: function() { return (this.flags & 2097155) !== 1; }
3312 },
3313 isWrite: {
3314 get: function() { return (this.flags & 2097155) !== 0; }
3315 },
3316 isAppend: {
3317 get: function() { return (this.flags & 1024); }
3318 }
3319 });
3320 }
3321 // clone it, so we can return an instance of FSStream
3322 var newStream = new FS.FSStream();
3323 for (var p in stream) {
3324 newStream[p] = stream[p];
3325 }
3326 stream = newStream;
3327 var fd = FS.nextfd(fd_start, fd_end);
3328 stream.fd = fd;
3329 FS.streams[fd] = stream;
3330 return stream;
3331 },closeStream:function (fd) {
3332 FS.streams[fd] = null;
3333 },chrdev_stream_ops:{open:function (stream) {
3334 var device = FS.getDevice(stream.node.rdev);
3335 // override node's stream ops with the device's
3336 stream.stream_ops = device.stream_ops;
3337 // forward the open call
3338 if (stream.stream_ops.open) {
3339 stream.stream_ops.open(stream);
3340 }
3341 },llseek:function () {
3342 throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
3343 }},major:function (dev) {
3344 return ((dev) >> 8);
3345 },minor:function (dev) {
3346 return ((dev) & 0xff);
3347 },makedev:function (ma, mi) {
3348 return ((ma) << 8 | (mi));
3349 },registerDevice:function (dev, ops) {
3350 FS.devices[dev] = { stream_ops: ops };
3351 },getDevice:function (dev) {
3352 return FS.devices[dev];
3353 },getMounts:function (mount) {
3354 var mounts = [];
3355 var check = [mount];
3356
3357 while (check.length) {
3358 var m = check.pop();
3359
3360 mounts.push(m);
3361
3362 check.push.apply(check, m.mounts);
3363 }
3364
3365 return mounts;
3366 },syncfs:function (populate, callback) {
3367 if (typeof(populate) === 'function') {
3368 callback = populate;
3369 populate = false;
3370 }
3371
3372 var mounts = FS.getMounts(FS.root.mount);
3373 var completed = 0;
3374
3375 function done(err) {
3376 if (err) {
3377 if (!done.errored) {
3378 done.errored = true;
3379 return callback(err);
3380 }
3381 return;
3382 }
3383 if (++completed >= mounts.length) {
3384 callback(null);
3385 }
3386 };
3387
3388 // sync all mounts
3389 mounts.forEach(function (mount) {
3390 if (!mount.type.syncfs) {
3391 return done(null);
3392 }
3393 mount.type.syncfs(mount, populate, done);
3394 });
3395 },mount:function (type, opts, mountpoint) {
3396 var root = mountpoint === '/';
3397 var pseudo = !mountpoint;
3398 var node;
3399
3400 if (root && FS.root) {
3401 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3402 } else if (!root && !pseudo) {
3403 var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
3404
3405 mountpoint = lookup.path; // use the absolute path
3406 node = lookup.node;
3407
3408 if (FS.isMountpoint(node)) {
3409 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3410 }
3411
3412 if (!FS.isDir(node.mode)) {
3413 throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
3414 }
3415 }
3416
3417 var mount = {
3418 type: type,
3419 opts: opts,
3420 mountpoint: mountpoint,
3421 mounts: []
3422 };
3423
3424 // create a root node for the fs
3425 var mountRoot = type.mount(mount);
3426 mountRoot.mount = mount;
3427 mount.root = mountRoot;
3428
3429 if (root) {
3430 FS.root = mountRoot;
3431 } else if (node) {
3432 // set as a mountpoint
3433 node.mounted = mount;
3434
3435 // add the new mount to the current mount's children
3436 if (node.mount) {
3437 node.mount.mounts.push(mount);
3438 }
3439 }
3440
3441 return mountRoot;
3442 },unmount:function (mountpoint) {
3443 var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
3444
3445 if (!FS.isMountpoint(lookup.node)) {
3446 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3447 }
3448
3449 // destroy the nodes for this mount, and all its child mounts
3450 var node = lookup.node;
3451 var mount = node.mounted;
3452 var mounts = FS.getMounts(mount);
3453
3454 Object.keys(FS.nameTable).forEach(function (hash) {
3455 var current = FS.nameTable[hash];
3456
3457 while (current) {
3458 var next = current.name_next;
3459
3460 if (mounts.indexOf(current.mount) !== -1) {
3461 FS.destroyNode(current);
3462 }
3463
3464 current = next;
3465 }
3466 });
3467
3468 // no longer a mountpoint
3469 node.mounted = null;
3470
3471 // remove this mount from the child mounts
3472 var idx = node.mount.mounts.indexOf(mount);
3473 assert(idx !== -1);
3474 node.mount.mounts.splice(idx, 1);
3475 },lookup:function (parent, name) {
3476 return parent.node_ops.lookup(parent, name);
3477 },mknod:function (path, mode, dev) {
3478 var lookup = FS.lookupPath(path, { parent: true });
3479 var parent = lookup.node;
3480 var name = PATH.basename(path);
3481 if (!name || name === '.' || name === '..') {
3482 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3483 }
3484 var err = FS.mayCreate(parent, name);
3485 if (err) {
3486 throw new FS.ErrnoError(err);
3487 }
3488 if (!parent.node_ops.mknod) {
3489 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3490 }
3491 return parent.node_ops.mknod(parent, name, mode, dev);
3492 },create:function (path, mode) {
3493 mode = mode !== undefined ? mode : 438 /* 0666 */;
3494 mode &= 4095;
3495 mode |= 32768;
3496 return FS.mknod(path, mode, 0);
3497 },mkdir:function (path, mode) {
3498 mode = mode !== undefined ? mode : 511 /* 0777 */;
3499 mode &= 511 | 512;
3500 mode |= 16384;
3501 return FS.mknod(path, mode, 0);
3502 },mkdev:function (path, mode, dev) {
3503 if (typeof(dev) === 'undefined') {
3504 dev = mode;
3505 mode = 438 /* 0666 */;
3506 }
3507 mode |= 8192;
3508 return FS.mknod(path, mode, dev);
3509 },symlink:function (oldpath, newpath) {
3510 if (!PATH.resolve(oldpath)) {
3511 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3512 }
3513 var lookup = FS.lookupPath(newpath, { parent: true });
3514 var parent = lookup.node;
3515 if (!parent) {
3516 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3517 }
3518 var newname = PATH.basename(newpath);
3519 var err = FS.mayCreate(parent, newname);
3520 if (err) {
3521 throw new FS.ErrnoError(err);
3522 }
3523 if (!parent.node_ops.symlink) {
3524 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3525 }
3526 return parent.node_ops.symlink(parent, newname, oldpath);
3527 },rename:function (old_path, new_path) {
3528 var old_dirname = PATH.dirname(old_path);
3529 var new_dirname = PATH.dirname(new_path);
3530 var old_name = PATH.basename(old_path);
3531 var new_name = PATH.basename(new_path);
3532 // parents must exist
3533 var lookup, old_dir, new_dir;
3534 try {
3535 lookup = FS.lookupPath(old_path, { parent: true });
3536 old_dir = lookup.node;
3537 lookup = FS.lookupPath(new_path, { parent: true });
3538 new_dir = lookup.node;
3539 } catch (e) {
3540 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3541 }
3542 if (!old_dir || !new_dir) throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3543 // need to be part of the same mount
3544 if (old_dir.mount !== new_dir.mount) {
3545 throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
3546 }
3547 // source must exist
3548 var old_node = FS.lookupNode(old_dir, old_name);
3549 // old path should not be an ancestor of the new path
3550 var relative = PATH.relative(old_path, new_dirname);
3551 if (relative.charAt(0) !== '.') {
3552 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3553 }
3554 // new path should not be an ancestor of the old path
3555 relative = PATH.relative(new_path, old_dirname);
3556 if (relative.charAt(0) !== '.') {
3557 throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
3558 }
3559 // see if the new path already exists
3560 var new_node;
3561 try {
3562 new_node = FS.lookupNode(new_dir, new_name);
3563 } catch (e) {
3564 // not fatal
3565 }
3566 // early out if nothing needs to change
3567 if (old_node === new_node) {
3568 return;
3569 }
3570 // we'll need to delete the old entry
3571 var isdir = FS.isDir(old_node.mode);
3572 var err = FS.mayDelete(old_dir, old_name, isdir);
3573 if (err) {
3574 throw new FS.ErrnoError(err);
3575 }
3576 // need delete permissions if we'll be overwriting.
3577 // need create permissions if new doesn't already exist.
3578 err = new_node ?
3579 FS.mayDelete(new_dir, new_name, isdir) :
3580 FS.mayCreate(new_dir, new_name);
3581 if (err) {
3582 throw new FS.ErrnoError(err);
3583 }
3584 if (!old_dir.node_ops.rename) {
3585 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3586 }
3587 if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
3588 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3589 }
3590 // if we are going to change the parent, check write permissions
3591 if (new_dir !== old_dir) {
3592 err = FS.nodePermissions(old_dir, 'w');
3593 if (err) {
3594 throw new FS.ErrnoError(err);
3595 }
3596 }
3597 try {
3598 if (FS.trackingDelegate['willMovePath']) {
3599 FS.trackingDelegate['willMovePath'](old_path, new_path);
3600 }
3601 } catch(e) {
3602 console.log("FS.trackingDelegate['willMovePath']('"+old_path+"', '"+new_path+"') threw an exception: " + e.message);
3603 }
3604 // remove the node from the lookup hash
3605 FS.hashRemoveNode(old_node);
3606 // do the underlying fs rename
3607 try {
3608 old_dir.node_ops.rename(old_node, new_dir, new_name);
3609 } catch (e) {
3610 throw e;
3611 } finally {
3612 // add the node back to the hash (in case node_ops.rename
3613 // changed its name)
3614 FS.hashAddNode(old_node);
3615 }
3616 try {
3617 if (FS.trackingDelegate['onMovePath']) FS.trackingDelegate['onMovePath'](old_path, new_path);
3618 } catch(e) {
3619 console.log("FS.trackingDelegate['onMovePath']('"+old_path+"', '"+new_path+"') threw an exception: " + e.message);
3620 }
3621 },rmdir:function (path) {
3622 var lookup = FS.lookupPath(path, { parent: true });
3623 var parent = lookup.node;
3624 var name = PATH.basename(path);
3625 var node = FS.lookupNode(parent, name);
3626 var err = FS.mayDelete(parent, name, true);
3627 if (err) {
3628 throw new FS.ErrnoError(err);
3629 }
3630 if (!parent.node_ops.rmdir) {
3631 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3632 }
3633 if (FS.isMountpoint(node)) {
3634 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3635 }
3636 try {
3637 if (FS.trackingDelegate['willDeletePath']) {
3638 FS.trackingDelegate['willDeletePath'](path);
3639 }
3640 } catch(e) {
3641 console.log("FS.trackingDelegate['willDeletePath']('"+path+"') threw an exception: " + e.message);
3642 }
3643 parent.node_ops.rmdir(parent, name);
3644 FS.destroyNode(node);
3645 try {
3646 if (FS.trackingDelegate['onDeletePath']) FS.trackingDelegate['onDeletePath'](path);
3647 } catch(e) {
3648 console.log("FS.trackingDelegate['onDeletePath']('"+path+"') threw an exception: " + e.message);
3649 }
3650 },readdir:function (path) {
3651 var lookup = FS.lookupPath(path, { follow: true });
3652 var node = lookup.node;
3653 if (!node.node_ops.readdir) {
3654 throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
3655 }
3656 return node.node_ops.readdir(node);
3657 },unlink:function (path) {
3658 var lookup = FS.lookupPath(path, { parent: true });
3659 var parent = lookup.node;
3660 var name = PATH.basename(path);
3661 var node = FS.lookupNode(parent, name);
3662 var err = FS.mayDelete(parent, name, false);
3663 if (err) {
3664 // POSIX says unlink should set EPERM, not EISDIR
3665 if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
3666 throw new FS.ErrnoError(err);
3667 }
3668 if (!parent.node_ops.unlink) {
3669 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3670 }
3671 if (FS.isMountpoint(node)) {
3672 throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
3673 }
3674 try {
3675 if (FS.trackingDelegate['willDeletePath']) {
3676 FS.trackingDelegate['willDeletePath'](path);
3677 }
3678 } catch(e) {
3679 console.log("FS.trackingDelegate['willDeletePath']('"+path+"') threw an exception: " + e.message);
3680 }
3681 parent.node_ops.unlink(parent, name);
3682 FS.destroyNode(node);
3683 try {
3684 if (FS.trackingDelegate['onDeletePath']) FS.trackingDelegate['onDeletePath'](path);
3685 } catch(e) {
3686 console.log("FS.trackingDelegate['onDeletePath']('"+path+"') threw an exception: " + e.message);
3687 }
3688 },readlink:function (path) {
3689 var lookup = FS.lookupPath(path);
3690 var link = lookup.node;
3691 if (!link) {
3692 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3693 }
3694 if (!link.node_ops.readlink) {
3695 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3696 }
3697 return PATH.resolve(FS.getPath(link.parent), link.node_ops.readlink(link));
3698 },stat:function (path, dontFollow) {
3699 var lookup = FS.lookupPath(path, { follow: !dontFollow });
3700 var node = lookup.node;
3701 if (!node) {
3702 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3703 }
3704 if (!node.node_ops.getattr) {
3705 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3706 }
3707 return node.node_ops.getattr(node);
3708 },lstat:function (path) {
3709 return FS.stat(path, true);
3710 },chmod:function (path, mode, dontFollow) {
3711 var node;
3712 if (typeof path === 'string') {
3713 var lookup = FS.lookupPath(path, { follow: !dontFollow });
3714 node = lookup.node;
3715 } else {
3716 node = path;
3717 }
3718 if (!node.node_ops.setattr) {
3719 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3720 }
3721 node.node_ops.setattr(node, {
3722 mode: (mode & 4095) | (node.mode & ~4095),
3723 timestamp: Date.now()
3724 });
3725 },lchmod:function (path, mode) {
3726 FS.chmod(path, mode, true);
3727 },fchmod:function (fd, mode) {
3728 var stream = FS.getStream(fd);
3729 if (!stream) {
3730 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3731 }
3732 FS.chmod(stream.node, mode);
3733 },chown:function (path, uid, gid, dontFollow) {
3734 var node;
3735 if (typeof path === 'string') {
3736 var lookup = FS.lookupPath(path, { follow: !dontFollow });
3737 node = lookup.node;
3738 } else {
3739 node = path;
3740 }
3741 if (!node.node_ops.setattr) {
3742 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3743 }
3744 node.node_ops.setattr(node, {
3745 timestamp: Date.now()
3746 // we ignore the uid / gid for now
3747 });
3748 },lchown:function (path, uid, gid) {
3749 FS.chown(path, uid, gid, true);
3750 },fchown:function (fd, uid, gid) {
3751 var stream = FS.getStream(fd);
3752 if (!stream) {
3753 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3754 }
3755 FS.chown(stream.node, uid, gid);
3756 },truncate:function (path, len) {
3757 if (len < 0) {
3758 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3759 }
3760 var node;
3761 if (typeof path === 'string') {
3762 var lookup = FS.lookupPath(path, { follow: true });
3763 node = lookup.node;
3764 } else {
3765 node = path;
3766 }
3767 if (!node.node_ops.setattr) {
3768 throw new FS.ErrnoError(ERRNO_CODES.EPERM);
3769 }
3770 if (FS.isDir(node.mode)) {
3771 throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
3772 }
3773 if (!FS.isFile(node.mode)) {
3774 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3775 }
3776 var err = FS.nodePermissions(node, 'w');
3777 if (err) {
3778 throw new FS.ErrnoError(err);
3779 }
3780 node.node_ops.setattr(node, {
3781 size: len,
3782 timestamp: Date.now()
3783 });
3784 },ftruncate:function (fd, len) {
3785 var stream = FS.getStream(fd);
3786 if (!stream) {
3787 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3788 }
3789 if ((stream.flags & 2097155) === 0) {
3790 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3791 }
3792 FS.truncate(stream.node, len);
3793 },utime:function (path, atime, mtime) {
3794 var lookup = FS.lookupPath(path, { follow: true });
3795 var node = lookup.node;
3796 node.node_ops.setattr(node, {
3797 timestamp: Math.max(atime, mtime)
3798 });
3799 },open:function (path, flags, mode, fd_start, fd_end) {
3800 if (path === "") {
3801 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3802 }
3803 flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
3804 mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
3805 if ((flags & 64)) {
3806 mode = (mode & 4095) | 32768;
3807 } else {
3808 mode = 0;
3809 }
3810 var node;
3811 if (typeof path === 'object') {
3812 node = path;
3813 } else {
3814 path = PATH.normalize(path);
3815 try {
3816 var lookup = FS.lookupPath(path, {
3817 follow: !(flags & 131072)
3818 });
3819 node = lookup.node;
3820 } catch (e) {
3821 // ignore
3822 }
3823 }
3824 // perhaps we need to create the node
3825 var created = false;
3826 if ((flags & 64)) {
3827 if (node) {
3828 // if O_CREAT and O_EXCL are set, error out if the node already exists
3829 if ((flags & 128)) {
3830 throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
3831 }
3832 } else {
3833 // node doesn't exist, try to create it
3834 node = FS.mknod(path, mode, 0);
3835 created = true;
3836 }
3837 }
3838 if (!node) {
3839 throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
3840 }
3841 // can't truncate a device
3842 if (FS.isChrdev(node.mode)) {
3843 flags &= ~512;
3844 }
3845 // if asked only for a directory, then this must be one
3846 if ((flags & 65536) && !FS.isDir(node.mode)) {
3847 throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
3848 }
3849 // check permissions, if this is not a file we just created now (it is ok to
3850 // create and write to a file with read-only permissions; it is read-only
3851 // for later use)
3852 if (!created) {
3853 var err = FS.mayOpen(node, flags);
3854 if (err) {
3855 throw new FS.ErrnoError(err);
3856 }
3857 }
3858 // do truncation if necessary
3859 if ((flags & 512)) {
3860 FS.truncate(node, 0);
3861 }
3862 // we've already handled these, don't pass down to the underlying vfs
3863 flags &= ~(128 | 512);
3864
3865 // register the stream with the filesystem
3866 var stream = FS.createStream({
3867 node: node,
3868 path: FS.getPath(node), // we want the absolute path to the node
3869 flags: flags,
3870 seekable: true,
3871 position: 0,
3872 stream_ops: node.stream_ops,
3873 // used by the file family libc calls (fopen, fwrite, ferror, etc.)
3874 ungotten: [],
3875 error: false
3876 }, fd_start, fd_end);
3877 // call the new stream's open function
3878 if (stream.stream_ops.open) {
3879 stream.stream_ops.open(stream);
3880 }
3881 if (Module['logReadFiles'] && !(flags & 1)) {
3882 if (!FS.readFiles) FS.readFiles = {};
3883 if (!(path in FS.readFiles)) {
3884 FS.readFiles[path] = 1;
3885 Module['printErr']('read file: ' + path);
3886 }
3887 }
3888 try {
3889 if (FS.trackingDelegate['onOpenFile']) {
3890 var trackingFlags = 0;
3891 if ((flags & 2097155) !== 1) {
3892 trackingFlags |= FS.tracking.openFlags.READ;
3893 }
3894 if ((flags & 2097155) !== 0) {
3895 trackingFlags |= FS.tracking.openFlags.WRITE;
3896 }
3897 FS.trackingDelegate['onOpenFile'](path, trackingFlags);
3898 }
3899 } catch(e) {
3900 console.log("FS.trackingDelegate['onOpenFile']('"+path+"', flags) threw an exception: " + e.message);
3901 }
3902 return stream;
3903 },close:function (stream) {
3904 if (stream.getdents) stream.getdents = null; // free readdir state
3905 try {
3906 if (stream.stream_ops.close) {
3907 stream.stream_ops.close(stream);
3908 }
3909 } catch (e) {
3910 throw e;
3911 } finally {
3912 FS.closeStream(stream.fd);
3913 }
3914 },llseek:function (stream, offset, whence) {
3915 if (!stream.seekable || !stream.stream_ops.llseek) {
3916 throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
3917 }
3918 stream.position = stream.stream_ops.llseek(stream, offset, whence);
3919 stream.ungotten = [];
3920 return stream.position;
3921 },read:function (stream, buffer, offset, length, position) {
3922 if (length < 0 || position < 0) {
3923 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3924 }
3925 if ((stream.flags & 2097155) === 1) {
3926 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3927 }
3928 if (FS.isDir(stream.node.mode)) {
3929 throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
3930 }
3931 if (!stream.stream_ops.read) {
3932 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3933 }
3934 var seeking = true;
3935 if (typeof position === 'undefined') {
3936 position = stream.position;
3937 seeking = false;
3938 } else if (!stream.seekable) {
3939 throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
3940 }
3941 var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
3942 if (!seeking) stream.position += bytesRead;
3943 return bytesRead;
3944 },write:function (stream, buffer, offset, length, position, canOwn) {
3945 if (length < 0 || position < 0) {
3946 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3947 }
3948 if ((stream.flags & 2097155) === 0) {
3949 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3950 }
3951 if (FS.isDir(stream.node.mode)) {
3952 throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
3953 }
3954 if (!stream.stream_ops.write) {
3955 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3956 }
3957 if (stream.flags & 1024) {
3958 // seek to the end before writing in append mode
3959 FS.llseek(stream, 0, 2);
3960 }
3961 var seeking = true;
3962 if (typeof position === 'undefined') {
3963 position = stream.position;
3964 seeking = false;
3965 } else if (!stream.seekable) {
3966 throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
3967 }
3968 var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
3969 if (!seeking) stream.position += bytesWritten;
3970 try {
3971 if (stream.path && FS.trackingDelegate['onWriteToFile']) FS.trackingDelegate['onWriteToFile'](stream.path);
3972 } catch(e) {
3973 console.log("FS.trackingDelegate['onWriteToFile']('"+path+"') threw an exception: " + e.message);
3974 }
3975 return bytesWritten;
3976 },allocate:function (stream, offset, length) {
3977 if (offset < 0 || length <= 0) {
3978 throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
3979 }
3980 if ((stream.flags & 2097155) === 0) {
3981 throw new FS.ErrnoError(ERRNO_CODES.EBADF);
3982 }
3983 if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
3984 throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
3985 }
3986 if (!stream.stream_ops.allocate) {
3987 throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
3988 }
3989 stream.stream_ops.allocate(stream, offset, length);
3990 },mmap:function (stream, buffer, offset, length, position, prot, flags) {
3991 // TODO if PROT is PROT_WRITE, make sure we have write access
3992 if ((stream.flags & 2097155) === 1) {
3993 throw new FS.ErrnoError(ERRNO_CODES.EACCES);
3994 }
3995 if (!stream.stream_ops.mmap) {
3996 throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
3997 }
3998 return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
3999 },msync:function (stream, buffer, offset, length, mmapFlags) {
4000 if (!stream || !stream.stream_ops.msync) {
4001 return 0;
4002 }
4003 return stream.stream_ops.msync(stream, buffer, offset, length, mmapFlags);
4004 },munmap:function (stream) {
4005 return 0;
4006 },ioctl:function (stream, cmd, arg) {
4007 if (!stream.stream_ops.ioctl) {
4008 throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
4009 }
4010 return stream.stream_ops.ioctl(stream, cmd, arg);
4011 },readFile:function (path, opts) {
4012 opts = opts || {};
4013 opts.flags = opts.flags || 'r';
4014 opts.encoding = opts.encoding || 'binary';
4015 if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
4016 throw new Error('Invalid encoding type "' + opts.encoding + '"');
4017 }
4018 var ret;
4019 var stream = FS.open(path, opts.flags);
4020 var stat = FS.stat(path);
4021 var length = stat.size;
4022 var buf = new Uint8Array(length);
4023 FS.read(stream, buf, 0, length, 0);
4024 if (opts.encoding === 'utf8') {
4025 ret = UTF8ArrayToString(buf, 0);
4026 } else if (opts.encoding === 'binary') {
4027 ret = buf;
4028 }
4029 FS.close(stream);
4030 return ret;
4031 },writeFile:function (path, data, opts) {
4032 opts = opts || {};
4033 opts.flags = opts.flags || 'w';
4034 opts.encoding = opts.encoding || 'utf8';
4035 if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
4036 throw new Error('Invalid encoding type "' + opts.encoding + '"');
4037 }
4038 var stream = FS.open(path, opts.flags, opts.mode);
4039 if (opts.encoding === 'utf8') {
4040 var buf = new Uint8Array(lengthBytesUTF8(data)+1);
4041 var actualNumBytes = stringToUTF8Array(data, buf, 0, buf.length);
4042 FS.write(stream, buf, 0, actualNumBytes, 0, opts.canOwn);
4043 } else if (opts.encoding === 'binary') {
4044 FS.write(stream, data, 0, data.length, 0, opts.canOwn);
4045 }
4046 FS.close(stream);
4047 },cwd:function () {
4048 return FS.currentPath;
4049 },chdir:function (path) {
4050 var lookup = FS.lookupPath(path, { follow: true });
4051 if (!FS.isDir(lookup.node.mode)) {
4052 throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
4053 }
4054 var err = FS.nodePermissions(lookup.node, 'x');
4055 if (err) {
4056 throw new FS.ErrnoError(err);
4057 }
4058 FS.currentPath = lookup.path;
4059 },createDefaultDirectories:function () {
4060 FS.mkdir('/tmp');
4061 FS.mkdir('/home');
4062 FS.mkdir('/home/web_user');
4063 },createDefaultDevices:function () {
4064 // create /dev
4065 FS.mkdir('/dev');
4066 // setup /dev/null
4067 FS.registerDevice(FS.makedev(1, 3), {
4068 read: function() { return 0; },
4069 write: function(stream, buffer, offset, length, pos) { return length; }
4070 });
4071 FS.mkdev('/dev/null', FS.makedev(1, 3));
4072 // setup /dev/tty and /dev/tty1
4073 // stderr needs to print output using Module['printErr']
4074 // so we register a second tty just for it.
4075 TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
4076 TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
4077 FS.mkdev('/dev/tty', FS.makedev(5, 0));
4078 FS.mkdev('/dev/tty1', FS.makedev(6, 0));
4079 // setup /dev/[u]random
4080 var random_device;
4081 if (typeof crypto !== 'undefined') {
4082 // for modern web browsers
4083 var randomBuffer = new Uint8Array(1);
4084 random_device = function() { crypto.getRandomValues(randomBuffer); return randomBuffer[0]; };
4085 } else if (ENVIRONMENT_IS_NODE) {
4086 // for nodejs
4087 random_device = function() { return require('crypto').randomBytes(1)[0]; };
4088 } else {
4089 // default for ES5 platforms
4090 random_device = function() { return (Math.random()*256)|0; };
4091 }
4092 FS.createDevice('/dev', 'random', random_device);
4093 FS.createDevice('/dev', 'urandom', random_device);
4094 // we're not going to emulate the actual shm device,
4095 // just create the tmp dirs that reside in it commonly
4096 FS.mkdir('/dev/shm');
4097 FS.mkdir('/dev/shm/tmp');
4098 },createSpecialDirectories:function () {
4099 // create /proc/self/fd which allows /proc/self/fd/6 => readlink gives the name of the stream for fd 6 (see test_unistd_ttyname)
4100 FS.mkdir('/proc');
4101 FS.mkdir('/proc/self');
4102 FS.mkdir('/proc/self/fd');
4103 FS.mount({
4104 mount: function() {
4105 var node = FS.createNode('/proc/self', 'fd', 16384 | 0777, 73);
4106 node.node_ops = {
4107 lookup: function(parent, name) {
4108 var fd = +name;
4109 var stream = FS.getStream(fd);
4110 if (!stream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
4111 var ret = {
4112 parent: null,
4113 mount: { mountpoint: 'fake' },
4114 node_ops: { readlink: function() { return stream.path } }
4115 };
4116 ret.parent = ret; // make it look like a simple root node
4117 return ret;
4118 }
4119 };
4120 return node;
4121 }
4122 }, {}, '/proc/self/fd');
4123 },createStandardStreams:function () {
4124 // TODO deprecate the old functionality of a single
4125 // input / output callback and that utilizes FS.createDevice
4126 // and instead require a unique set of stream ops
4127
4128 // by default, we symlink the standard streams to the
4129 // default tty devices. however, if the standard streams
4130 // have been overwritten we create a unique device for
4131 // them instead.
4132 if (Module['stdin']) {
4133 FS.createDevice('/dev', 'stdin', Module['stdin']);
4134 } else {
4135 FS.symlink('/dev/tty', '/dev/stdin');
4136 }
4137 if (Module['stdout']) {
4138 FS.createDevice('/dev', 'stdout', null, Module['stdout']);
4139 } else {
4140 FS.symlink('/dev/tty', '/dev/stdout');
4141 }
4142 if (Module['stderr']) {
4143 FS.createDevice('/dev', 'stderr', null, Module['stderr']);
4144 } else {
4145 FS.symlink('/dev/tty1', '/dev/stderr');
4146 }
4147
4148 // open default streams for the stdin, stdout and stderr devices
4149 var stdin = FS.open('/dev/stdin', 'r');
4150 assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
4151
4152 var stdout = FS.open('/dev/stdout', 'w');
4153 assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
4154
4155 var stderr = FS.open('/dev/stderr', 'w');
4156 assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
4157 },ensureErrnoError:function () {
4158 if (FS.ErrnoError) return;
4159 FS.ErrnoError = function ErrnoError(errno, node) {
4160 //Module.printErr(stackTrace()); // useful for debugging
4161 this.node = node;
4162 this.setErrno = function(errno) {
4163 this.errno = errno;
4164 for (var key in ERRNO_CODES) {
4165 if (ERRNO_CODES[key] === errno) {
4166 this.code = key;
4167 break;
4168 }
4169 }
4170 };
4171 this.setErrno(errno);
4172 this.message = ERRNO_MESSAGES[errno];
4173 if (this.stack) this.stack = demangleAll(this.stack);
4174 };
4175 FS.ErrnoError.prototype = new Error();
4176 FS.ErrnoError.prototype.constructor = FS.ErrnoError;
4177 // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
4178 [ERRNO_CODES.ENOENT].forEach(function(code) {
4179 FS.genericErrors[code] = new FS.ErrnoError(code);
4180 FS.genericErrors[code].stack = '<generic error, no stack>';
4181 });
4182 },staticInit:function () {
4183 FS.ensureErrnoError();
4184
4185 FS.nameTable = new Array(4096);
4186
4187 FS.mount(MEMFS, {}, '/');
4188
4189 FS.createDefaultDirectories();
4190 FS.createDefaultDevices();
4191 FS.createSpecialDirectories();
4192
4193 FS.filesystems = {
4194 'MEMFS': MEMFS,
4195 'IDBFS': IDBFS,
4196 'NODEFS': NODEFS,
4197 'WORKERFS': WORKERFS,
4198 };
4199 },init:function (input, output, error) {
4200 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)');
4201 FS.init.initialized = true;
4202
4203 FS.ensureErrnoError();
4204
4205 // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
4206 Module['stdin'] = input || Module['stdin'];
4207 Module['stdout'] = output || Module['stdout'];
4208 Module['stderr'] = error || Module['stderr'];
4209
4210 FS.createStandardStreams();
4211 },quit:function () {
4212 FS.init.initialized = false;
4213 // force-flush all streams, so we get musl std streams printed out
4214 var fflush = Module['_fflush'];
4215 if (fflush) fflush(0);
4216 // close all of our streams
4217 for (var i = 0; i < FS.streams.length; i++) {
4218 var stream = FS.streams[i];
4219 if (!stream) {
4220 continue;
4221 }
4222 FS.close(stream);
4223 }
4224 },getMode:function (canRead, canWrite) {
4225 var mode = 0;
4226 if (canRead) mode |= 292 | 73;
4227 if (canWrite) mode |= 146;
4228 return mode;
4229 },joinPath:function (parts, forceRelative) {
4230 var path = PATH.join.apply(null, parts);
4231 if (forceRelative && path[0] == '/') path = path.substr(1);
4232 return path;
4233 },absolutePath:function (relative, base) {
4234 return PATH.resolve(base, relative);
4235 },standardizePath:function (path) {
4236 return PATH.normalize(path);
4237 },findObject:function (path, dontResolveLastLink) {
4238 var ret = FS.analyzePath(path, dontResolveLastLink);
4239 if (ret.exists) {
4240 return ret.object;
4241 } else {
4242 ___setErrNo(ret.error);
4243 return null;
4244 }
4245 },analyzePath:function (path, dontResolveLastLink) {
4246 // operate from within the context of the symlink's target
4247 try {
4248 var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
4249 path = lookup.path;
4250 } catch (e) {
4251 }
4252 var ret = {
4253 isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
4254 parentExists: false, parentPath: null, parentObject: null
4255 };
4256 try {
4257 var lookup = FS.lookupPath(path, { parent: true });
4258 ret.parentExists = true;
4259 ret.parentPath = lookup.path;
4260 ret.parentObject = lookup.node;
4261 ret.name = PATH.basename(path);
4262 lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
4263 ret.exists = true;
4264 ret.path = lookup.path;
4265 ret.object = lookup.node;
4266 ret.name = lookup.node.name;
4267 ret.isRoot = lookup.path === '/';
4268 } catch (e) {
4269 ret.error = e.errno;
4270 };
4271 return ret;
4272 },createFolder:function (parent, name, canRead, canWrite) {
4273 var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
4274 var mode = FS.getMode(canRead, canWrite);
4275 return FS.mkdir(path, mode);
4276 },createPath:function (parent, path, canRead, canWrite) {
4277 parent = typeof parent === 'string' ? parent : FS.getPath(parent);
4278 var parts = path.split('/').reverse();
4279 while (parts.length) {
4280 var part = parts.pop();
4281 if (!part) continue;
4282 var current = PATH.join2(parent, part);
4283 try {
4284 FS.mkdir(current);
4285 } catch (e) {
4286 // ignore EEXIST
4287 }
4288 parent = current;
4289 }
4290 return current;
4291 },createFile:function (parent, name, properties, canRead, canWrite) {
4292 var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
4293 var mode = FS.getMode(canRead, canWrite);
4294 return FS.create(path, mode);
4295 },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
4296 var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
4297 var mode = FS.getMode(canRead, canWrite);
4298 var node = FS.create(path, mode);
4299 if (data) {
4300 if (typeof data === 'string') {
4301 var arr = new Array(data.length);
4302 for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
4303 data = arr;
4304 }
4305 // make sure we can write to the file
4306 FS.chmod(node, mode | 146);
4307 var stream = FS.open(node, 'w');
4308 FS.write(stream, data, 0, data.length, 0, canOwn);
4309 FS.close(stream);
4310 FS.chmod(node, mode);
4311 }
4312 return node;
4313 },createDevice:function (parent, name, input, output) {
4314 var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
4315 var mode = FS.getMode(!!input, !!output);
4316 if (!FS.createDevice.major) FS.createDevice.major = 64;
4317 var dev = FS.makedev(FS.createDevice.major++, 0);
4318 // Create a fake device that a set of stream ops to emulate
4319 // the old behavior.
4320 FS.registerDevice(dev, {
4321 open: function(stream) {
4322 stream.seekable = false;
4323 },
4324 close: function(stream) {
4325 // flush any pending line data
4326 if (output && output.buffer && output.buffer.length) {
4327 output(10);
4328 }
4329 },
4330 read: function(stream, buffer, offset, length, pos /* ignored */) {
4331 var bytesRead = 0;
4332 for (var i = 0; i < length; i++) {
4333 var result;
4334 try {
4335 result = input();
4336 } catch (e) {
4337 throw new FS.ErrnoError(ERRNO_CODES.EIO);
4338 }
4339 if (result === undefined && bytesRead === 0) {
4340 throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
4341 }
4342 if (result === null || result === undefined) break;
4343 bytesRead++;
4344 buffer[offset+i] = result;
4345 }
4346 if (bytesRead) {
4347 stream.node.timestamp = Date.now();
4348 }
4349 return bytesRead;
4350 },
4351 write: function(stream, buffer, offset, length, pos) {
4352 for (var i = 0; i < length; i++) {
4353 try {
4354 output(buffer[offset+i]);
4355 } catch (e) {
4356 throw new FS.ErrnoError(ERRNO_CODES.EIO);
4357 }
4358 }
4359 if (length) {
4360 stream.node.timestamp = Date.now();
4361 }
4362 return i;
4363 }
4364 });
4365 return FS.mkdev(path, mode, dev);
4366 },createLink:function (parent, name, target, canRead, canWrite) {
4367 var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
4368 return FS.symlink(target, path);
4369 },forceLoadFile:function (obj) {
4370 if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
4371 var success = true;
4372 if (typeof XMLHttpRequest !== 'undefined') {
4373 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.");
4374 } else if (Module['read']) {
4375 // Command-line.
4376 try {
4377 // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
4378 // read() will try to parse UTF8.
4379 obj.contents = intArrayFromString(Module['read'](obj.url), true);
4380 obj.usedBytes = obj.contents.length;
4381 } catch (e) {
4382 success = false;
4383 }
4384 } else {
4385 throw new Error('Cannot load without read() or XMLHttpRequest.');
4386 }
4387 if (!success) ___setErrNo(ERRNO_CODES.EIO);
4388 return success;
4389 },createLazyFile:function (parent, name, url, canRead, canWrite) {
4390 // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
4391 function LazyUint8Array() {
4392 this.lengthKnown = false;
4393 this.chunks = []; // Loaded chunks. Index is the chunk number
4394 }
4395 LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
4396 if (idx > this.length-1 || idx < 0) {
4397 return undefined;
4398 }
4399 var chunkOffset = idx % this.chunkSize;
4400 var chunkNum = (idx / this.chunkSize)|0;
4401 return this.getter(chunkNum)[chunkOffset];
4402 }
4403 LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
4404 this.getter = getter;
4405 }
4406 LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
4407 // Find length
4408 var xhr = new XMLHttpRequest();
4409 xhr.open('HEAD', url, false);
4410 xhr.send(null);
4411 if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
4412 var datalength = Number(xhr.getResponseHeader("Content-length"));
4413 var header;
4414 var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
4415 var chunkSize = 1024*1024; // Chunk size in bytes
4416
4417 if (!hasByteServing) chunkSize = datalength;
4418
4419 // Function to get a range from the remote URL.
4420 var doXHR = (function(from, to) {
4421 if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
4422 if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
4423
4424 // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
4425 var xhr = new XMLHttpRequest();
4426 xhr.open('GET', url, false);
4427 if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
4428
4429 // Some hints to the browser that we want binary data.
4430 if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
4431 if (xhr.overrideMimeType) {
4432 xhr.overrideMimeType('text/plain; charset=x-user-defined');
4433 }
4434
4435 xhr.send(null);
4436 if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
4437 if (xhr.response !== undefined) {
4438 return new Uint8Array(xhr.response || []);
4439 } else {
4440 return intArrayFromString(xhr.responseText || '', true);
4441 }
4442 });
4443 var lazyArray = this;
4444 lazyArray.setDataGetter(function(chunkNum) {
4445 var start = chunkNum * chunkSize;
4446 var end = (chunkNum+1) * chunkSize - 1; // including this byte
4447 end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
4448 if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
4449 lazyArray.chunks[chunkNum] = doXHR(start, end);
4450 }
4451 if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
4452 return lazyArray.chunks[chunkNum];
4453 });
4454
4455 this._length = datalength;
4456 this._chunkSize = chunkSize;
4457 this.lengthKnown = true;
4458 }
4459 if (typeof XMLHttpRequest !== 'undefined') {
4460 if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
4461 var lazyArray = new LazyUint8Array();
4462 Object.defineProperty(lazyArray, "length", {
4463 get: function() {
4464 if(!this.lengthKnown) {
4465 this.cacheLength();
4466 }
4467 return this._length;
4468 }
4469 });
4470 Object.defineProperty(lazyArray, "chunkSize", {
4471 get: function() {
4472 if(!this.lengthKnown) {
4473 this.cacheLength();
4474 }
4475 return this._chunkSize;
4476 }
4477 });
4478
4479 var properties = { isDevice: false, contents: lazyArray };
4480 } else {
4481 var properties = { isDevice: false, url: url };
4482 }
4483
4484 var node = FS.createFile(parent, name, properties, canRead, canWrite);
4485 // This is a total hack, but I want to get this lazy file code out of the
4486 // core of MEMFS. If we want to keep this lazy file concept I feel it should
4487 // be its own thin LAZYFS proxying calls to MEMFS.
4488 if (properties.contents) {
4489 node.contents = properties.contents;
4490 } else if (properties.url) {
4491 node.contents = null;
4492 node.url = properties.url;
4493 }
4494 // Add a function that defers querying the file size until it is asked the first time.
4495 Object.defineProperty(node, "usedBytes", {
4496 get: function() { return this.contents.length; }
4497 });
4498 // override each stream op with one that tries to force load the lazy file first
4499 var stream_ops = {};
4500 var keys = Object.keys(node.stream_ops);
4501 keys.forEach(function(key) {
4502 var fn = node.stream_ops[key];
4503 stream_ops[key] = function forceLoadLazyFile() {
4504 if (!FS.forceLoadFile(node)) {
4505 throw new FS.ErrnoError(ERRNO_CODES.EIO);
4506 }
4507 return fn.apply(null, arguments);
4508 };
4509 });
4510 // use a custom read function
4511 stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
4512 if (!FS.forceLoadFile(node)) {
4513 throw new FS.ErrnoError(ERRNO_CODES.EIO);
4514 }
4515 var contents = stream.node.contents;
4516 if (position >= contents.length)
4517 return 0;
4518 var size = Math.min(contents.length - position, length);
4519 assert(size >= 0);
4520 if (contents.slice) { // normal array
4521 for (var i = 0; i < size; i++) {
4522 buffer[offset + i] = contents[position + i];
4523 }
4524 } else {
4525 for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
4526 buffer[offset + i] = contents.get(position + i);
4527 }
4528 }
4529 return size;
4530 };
4531 node.stream_ops = stream_ops;
4532 return node;
4533 },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn, preFinish) {
4534 Browser.init();
4535 // TODO we should allow people to just pass in a complete filename instead
4536 // of parent and name being that we just join them anyways
4537 var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
4538 var dep = getUniqueRunDependency('cp ' + fullname); // might have several active requests for the same fullname
4539 function processData(byteArray) {
4540 function finish(byteArray) {
4541 if (preFinish) preFinish();
4542 if (!dontCreateFile) {
4543 FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
4544 }
4545 if (onload) onload();
4546 removeRunDependency(dep);
4547 }
4548 var handled = false;
4549 Module['preloadPlugins'].forEach(function(plugin) {
4550 if (handled) return;
4551 if (plugin['canHandle'](fullname)) {
4552 plugin['handle'](byteArray, fullname, finish, function() {
4553 if (onerror) onerror();
4554 removeRunDependency(dep);
4555 });
4556 handled = true;
4557 }
4558 });
4559 if (!handled) finish(byteArray);
4560 }
4561 addRunDependency(dep);
4562 if (typeof url == 'string') {
4563 Browser.asyncLoad(url, function(byteArray) {
4564 processData(byteArray);
4565 }, onerror);
4566 } else {
4567 processData(url);
4568 }
4569 },indexedDB:function () {
4570 return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
4571 },DB_NAME:function () {
4572 return 'EM_FS_' + window.location.pathname;
4573 },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
4574 onload = onload || function(){};
4575 onerror = onerror || function(){};
4576 var indexedDB = FS.indexedDB();
4577 try {
4578 var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
4579 } catch (e) {
4580 return onerror(e);
4581 }
4582 openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
4583 console.log('creating db');
4584 var db = openRequest.result;
4585 db.createObjectStore(FS.DB_STORE_NAME);
4586 };
4587 openRequest.onsuccess = function openRequest_onsuccess() {
4588 var db = openRequest.result;
4589 var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
4590 var files = transaction.objectStore(FS.DB_STORE_NAME);
4591 var ok = 0, fail = 0, total = paths.length;
4592 function finish() {
4593 if (fail == 0) onload(); else onerror();
4594 }
4595 paths.forEach(function(path) {
4596 var putRequest = files.put(FS.analyzePath(path).object.contents, path);
4597 putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
4598 putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
4599 });
4600 transaction.onerror = onerror;
4601 };
4602 openRequest.onerror = onerror;
4603 },loadFilesFromDB:function (paths, onload, onerror) {
4604 onload = onload || function(){};
4605 onerror = onerror || function(){};
4606 var indexedDB = FS.indexedDB();
4607 try {
4608 var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
4609 } catch (e) {
4610 return onerror(e);
4611 }
4612 openRequest.onupgradeneeded = onerror; // no database to load from
4613 openRequest.onsuccess = function openRequest_onsuccess() {
4614 var db = openRequest.result;
4615 try {
4616 var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
4617 } catch(e) {
4618 onerror(e);
4619 return;
4620 }
4621 var files = transaction.objectStore(FS.DB_STORE_NAME);
4622 var ok = 0, fail = 0, total = paths.length;
4623 function finish() {
4624 if (fail == 0) onload(); else onerror();
4625 }
4626 paths.forEach(function(path) {
4627 var getRequest = files.get(path);
4628 getRequest.onsuccess = function getRequest_onsuccess() {
4629 if (FS.analyzePath(path).exists) {
4630 FS.unlink(path);
4631 }
4632 FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
4633 ok++;
4634 if (ok + fail == total) finish();
4635 };
4636 getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
4637 });
4638 transaction.onerror = onerror;
4639 };
4640 openRequest.onerror = onerror;
4641 }};var SYSCALLS={DEFAULT_POLLMASK:5,mappings:{},umask:511,calculateAt:function (dirfd, path) {
4642 if (path[0] !== '/') {
4643 // relative path
4644 var dir;
4645 if (dirfd === -100) {
4646 dir = FS.cwd();
4647 } else {
4648 var dirstream = FS.getStream(dirfd);
4649 if (!dirstream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
4650 dir = dirstream.path;
4651 }
4652 path = PATH.join2(dir, path);
4653 }
4654 return path;
4655 },doStat:function (func, path, buf) {
4656 try {
4657 var stat = func(path);
4658 } catch (e) {
4659 if (e && e.node && PATH.normalize(path) !== PATH.normalize(FS.getPath(e.node))) {
4660 // an error occurred while trying to look up the path; we should just report ENOTDIR
4661 return -ERRNO_CODES.ENOTDIR;
4662 }
4663 throw e;
4664 }
4665 HEAP32[((buf)>>2)]=stat.dev;
4666 HEAP32[(((buf)+(4))>>2)]=0;
4667 HEAP32[(((buf)+(8))>>2)]=stat.ino;
4668 HEAP32[(((buf)+(12))>>2)]=stat.mode;
4669 HEAP32[(((buf)+(16))>>2)]=stat.nlink;
4670 HEAP32[(((buf)+(20))>>2)]=stat.uid;
4671 HEAP32[(((buf)+(24))>>2)]=stat.gid;
4672 HEAP32[(((buf)+(28))>>2)]=stat.rdev;
4673 HEAP32[(((buf)+(32))>>2)]=0;
4674 HEAP32[(((buf)+(36))>>2)]=stat.size;
4675 HEAP32[(((buf)+(40))>>2)]=4096;
4676 HEAP32[(((buf)+(44))>>2)]=stat.blocks;
4677 HEAP32[(((buf)+(48))>>2)]=(stat.atime.getTime() / 1000)|0;
4678 HEAP32[(((buf)+(52))>>2)]=0;
4679 HEAP32[(((buf)+(56))>>2)]=(stat.mtime.getTime() / 1000)|0;
4680 HEAP32[(((buf)+(60))>>2)]=0;
4681 HEAP32[(((buf)+(64))>>2)]=(stat.ctime.getTime() / 1000)|0;
4682 HEAP32[(((buf)+(68))>>2)]=0;
4683 HEAP32[(((buf)+(72))>>2)]=stat.ino;
4684 return 0;
4685 },doMsync:function (addr, stream, len, flags) {
4686 var buffer = new Uint8Array(HEAPU8.subarray(addr, addr + len));
4687 FS.msync(stream, buffer, 0, len, flags);
4688 },doMkdir:function (path, mode) {
4689 // remove a trailing slash, if one - /a/b/ has basename of '', but
4690 // we want to create b in the context of this function
4691 path = PATH.normalize(path);
4692 if (path[path.length-1] === '/') path = path.substr(0, path.length-1);
4693 FS.mkdir(path, mode, 0);
4694 return 0;
4695 },doMknod:function (path, mode, dev) {
4696 // we don't want this in the JS API as it uses mknod to create all nodes.
4697 switch (mode & 61440) {
4698 case 32768:
4699 case 8192:
4700 case 24576:
4701 case 4096:
4702 case 49152:
4703 break;
4704 default: return -ERRNO_CODES.EINVAL;
4705 }
4706 FS.mknod(path, mode, dev);
4707 return 0;
4708 },doReadlink:function (path, buf, bufsize) {
4709 if (bufsize <= 0) return -ERRNO_CODES.EINVAL;
4710 var ret = FS.readlink(path);
4711 ret = ret.slice(0, Math.max(0, bufsize));
4712 writeStringToMemory(ret, buf, true);
4713 return ret.length;
4714 },doAccess:function (path, amode) {
4715 if (amode & ~7) {
4716 // need a valid mode
4717 return -ERRNO_CODES.EINVAL;
4718 }
4719 var node;
4720 var lookup = FS.lookupPath(path, { follow: true });
4721 node = lookup.node;
4722 var perms = '';
4723 if (amode & 4) perms += 'r';
4724 if (amode & 2) perms += 'w';
4725 if (amode & 1) perms += 'x';
4726 if (perms /* otherwise, they've just passed F_OK */ && FS.nodePermissions(node, perms)) {
4727 return -ERRNO_CODES.EACCES;
4728 }
4729 return 0;
4730 },doDup:function (path, flags, suggestFD) {
4731 var suggest = FS.getStream(suggestFD);
4732 if (suggest) FS.close(suggest);
4733 return FS.open(path, flags, 0, suggestFD, suggestFD).fd;
4734 },doReadv:function (stream, iov, iovcnt, offset) {
4735 var ret = 0;
4736 for (var i = 0; i < iovcnt; i++) {
4737 var ptr = HEAP32[(((iov)+(i*8))>>2)];
4738 var len = HEAP32[(((iov)+(i*8 + 4))>>2)];
4739 var curr = FS.read(stream, HEAP8,ptr, len, offset);
4740 if (curr < 0) return -1;
4741 ret += curr;
4742 if (curr < len) break; // nothing more to read
4743 }
4744 return ret;
4745 },doWritev:function (stream, iov, iovcnt, offset) {
4746 var ret = 0;
4747 for (var i = 0; i < iovcnt; i++) {
4748 var ptr = HEAP32[(((iov)+(i*8))>>2)];
4749 var len = HEAP32[(((iov)+(i*8 + 4))>>2)];
4750 var curr = FS.write(stream, HEAP8,ptr, len, offset);
4751 if (curr < 0) return -1;
4752 ret += curr;
4753 }
4754 return ret;
4755 },varargs:0,get:function (varargs) {
4756 SYSCALLS.varargs += 4;
4757 var ret = HEAP32[(((SYSCALLS.varargs)-(4))>>2)];
4758 return ret;
4759 },getStr:function () {
4760 var ret = Pointer_stringify(SYSCALLS.get());
4761 return ret;
4762 },getStreamFromFD:function () {
4763 var stream = FS.getStream(SYSCALLS.get());
4764 if (!stream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
4765 return stream;
4766 },getSocketFromFD:function () {
4767 var socket = SOCKFS.getSocket(SYSCALLS.get());
4768 if (!socket) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
4769 return socket;
4770 },getSocketAddress:function (allowNull) {
4771 var addrp = SYSCALLS.get(), addrlen = SYSCALLS.get();
4772 if (allowNull && addrp === 0) return null;
4773 var info = __read_sockaddr(addrp, addrlen);
4774 if (info.errno) throw new FS.ErrnoError(info.errno);
4775 info.addr = DNS.lookup_addr(info.addr) || info.addr;
4776 return info;
4777 },get64:function () {
4778 var low = SYSCALLS.get(), high = SYSCALLS.get();
4779 if (low >= 0) assert(high === 0);
4780 else assert(high === -1);
4781 return low;
4782 },getZero:function () {
4783 assert(SYSCALLS.get() === 0);
4784 }};function ___syscall6(which, varargs) {SYSCALLS.varargs = varargs;
4785 try {
4786 // close
4787 var stream = SYSCALLS.getStreamFromFD();
4788 FS.close(stream);
4789 return 0;
4790 } catch (e) {
4791 if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e);
4792 return -e.errno;
4793 }
4794 }
4795
4796 function _llvm_stackrestore(p) {
4797 var self = _llvm_stacksave;
4798 var ret = self.LLVM_SAVEDSTACKS[p];
4799 self.LLVM_SAVEDSTACKS.splice(p, 1);
4800 Runtime.stackRestore(ret);
4801 }
4802
4803 function _sbrk(bytes) {
4804 // Implement a Linux-like 'memory area' for our 'process'.
4805 // Changes the size of the memory area by |bytes|; returns the
4806 // address of the previous top ('break') of the memory area
4807 // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
4808 var self = _sbrk;
4809 if (!self.called) {
4810 DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
4811 self.called = true;
4812 assert(Runtime.dynamicAlloc);
4813 self.alloc = Runtime.dynamicAlloc;
4814 Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
4815 }
4816 var ret = DYNAMICTOP;
4817 if (bytes != 0) {
4818 var success = self.alloc(bytes);
4819 if (!success) return -1 >>> 0; // sbrk failure code
4820 }
4821 return ret; // Previous break location.
4822 }
4823
4824 function _llvm_stacksave() {
4825 var self = _llvm_stacksave;
4826 if (!self.LLVM_SAVEDSTACKS) {
4827 self.LLVM_SAVEDSTACKS = [];
4828 }
4829 self.LLVM_SAVEDSTACKS.push(Runtime.stackSave());
4830 return self.LLVM_SAVEDSTACKS.length-1;
4831 }
4832
4833
4834 function _emscripten_memcpy_big(dest, src, num) {
4835 HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
4836 return dest;
4837 }
4838 Module["_memcpy"] = _memcpy;
4839
4840
4841
4842 function _emscripten_set_main_loop_timing(mode, value) {
4843 Browser.mainLoop.timingMode = mode;
4844 Browser.mainLoop.timingValue = value;
4845
4846 if (!Browser.mainLoop.func) {
4847 console.error('emscripten_set_main_loop_timing: Cannot set timing mode for main loop since a main loop does not exist! Call emscripten_set_main_loop first to set one up.');
4848 return 1; // Return non-zero on failure, can't set timing mode when there is no main loop.
4849 }
4850
4851 if (mode == 0 /*EM_TIMING_SETTIMEOUT*/) {
4852 Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler_setTimeout() {
4853 setTimeout(Browser.mainLoop.runner, value); // doing this each time means that on exception, we stop
4854 };
4855 Browser.mainLoop.method = 'timeout';
4856 } else if (mode == 1 /*EM_TIMING_RAF*/) {
4857 Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler_rAF() {
4858 Browser.requestAnimationFrame(Browser.mainLoop.runner);
4859 };
4860 Browser.mainLoop.method = 'rAF';
4861 } else if (mode == 2 /*EM_TIMING_SETIMMEDIATE*/) {
4862 if (!window['setImmediate']) {
4863 // Emulate setImmediate. (note: not a complete polyfill, we don't emulate clearImmediate() to keep code size to minimum, since not needed)
4864 var setImmediates = [];
4865 var emscriptenMainLoopMessageId = '__emcc';
4866 function Browser_setImmediate_messageHandler(event) {
4867 if (event.source === window && event.data === emscriptenMainLoopMessageId) {
4868 event.stopPropagation();
4869 setImmediates.shift()();
4870 }
4871 }
4872 window.addEventListener("message", Browser_setImmediate_messageHandler, true);
4873 window['setImmediate'] = function Browser_emulated_setImmediate(func) {
4874 setImmediates.push(func);
4875 window.postMessage(emscriptenMainLoopMessageId, "*");
4876 }
4877 }
4878 Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler_setImmediate() {
4879 window['setImmediate'](Browser.mainLoop.runner);
4880 };
4881 Browser.mainLoop.method = 'immediate';
4882 }
4883 return 0;
4884 }function _emscripten_set_main_loop(func, fps, simulateInfiniteLoop, arg, noSetTiming) {
4885 Module['noExitRuntime'] = true;
4886
4887 assert(!Browser.mainLoop.func, 'emscripten_set_main_loop: there can only be one main loop function at once: call emscripten_cancel_main_loop to cancel the previous one before setting a new one with different parameters.');
4888
4889 Browser.mainLoop.func = func;
4890 Browser.mainLoop.arg = arg;
4891
4892 var thisMainLoopId = Browser.mainLoop.currentlyRunningMainloop;
4893
4894 Browser.mainLoop.runner = function Browser_mainLoop_runner() {
4895 if (ABORT) return;
4896 if (Browser.mainLoop.queue.length > 0) {
4897 var start = Date.now();
4898 var blocker = Browser.mainLoop.queue.shift();
4899 blocker.func(blocker.arg);
4900 if (Browser.mainLoop.remainingBlockers) {
4901 var remaining = Browser.mainLoop.remainingBlockers;
4902 var next = remaining%1 == 0 ? remaining-1 : Math.floor(remaining);
4903 if (blocker.counted) {
4904 Browser.mainLoop.remainingBlockers = next;
4905 } else {
4906 // not counted, but move the progress along a tiny bit
4907 next = next + 0.5; // do not steal all the next one's progress
4908 Browser.mainLoop.remainingBlockers = (8*remaining + next)/9;
4909 }
4910 }
4911 console.log('main loop blocker "' + blocker.name + '" took ' + (Date.now() - start) + ' ms'); //, left: ' + Browser.mainLoop.remainingBlockers);
4912 Browser.mainLoop.updateStatus();
4913 setTimeout(Browser.mainLoop.runner, 0);
4914 return;
4915 }
4916
4917 // catch pauses from non-main loop sources
4918 if (thisMainLoopId < Browser.mainLoop.currentlyRunningMainloop) return;
4919
4920 // Implement very basic swap interval control
4921 Browser.mainLoop.currentFrameNumber = Browser.mainLoop.currentFrameNumber + 1 | 0;
4922 if (Browser.mainLoop.timingMode == 1/*EM_TIMING_RAF*/ && Browser.mainLoop.timingValue > 1 && Browser.mainLoop.currentFrameNumber % Browser.mainLoop.timingValue != 0) {
4923 // Not the scheduled time to render this frame - skip.
4924 Browser.mainLoop.scheduler();
4925 return;
4926 }
4927
4928 // Signal GL rendering layer that processing of a new frame is about to start. This helps it optimize
4929 // VBO double-buffering and reduce GPU stalls.
4930
4931 if (Browser.mainLoop.method === 'timeout' && Module.ctx) {
4932 Module.printErr('Looks like you are rendering without using requestAnimationFrame for the main loop. You should use 0 for the frame rate in emscripten_set_main_loop in order to use requestAnimationFrame, as that can greatly improve your frame rates!');
4933 Browser.mainLoop.method = ''; // just warn once per call to set main loop
4934 }
4935
4936 Browser.mainLoop.runIter(function() {
4937 if (typeof arg !== 'undefined') {
4938 Runtime.dynCall('vi', func, [arg]);
4939 } else {
4940 Runtime.dynCall('v', func);
4941 }
4942 });
4943
4944 // catch pauses from the main loop itself
4945 if (thisMainLoopId < Browser.mainLoop.currentlyRunningMainloop) return;
4946
4947 // Queue new audio data. This is important to be right after the main loop invocation, so that we will immediately be able
4948 // to queue the newest produced audio samples.
4949 // TODO: Consider adding pre- and post- rAF callbacks so that GL.newRenderingFrameStarted() and SDL.audio.queueNewAudioData()
4950 // do not need to be hardcoded into this function, but can be more generic.
4951 if (typeof SDL === 'object' && SDL.audio && SDL.audio.queueNewAudioData) SDL.audio.queueNewAudioData();
4952
4953 Browser.mainLoop.scheduler();
4954 }
4955
4956 if (!noSetTiming) {
4957 if (fps && fps > 0) _emscripten_set_main_loop_timing(0/*EM_TIMING_SETTIMEOUT*/, 1000.0 / fps);
4958 else _emscripten_set_main_loop_timing(1/*EM_TIMING_RAF*/, 1); // Do rAF by rendering each frame (no decimating)
4959
4960 Browser.mainLoop.scheduler();
4961 }
4962
4963 if (simulateInfiniteLoop) {
4964 throw 'SimulateInfiniteLoop';
4965 }
4966 }var Browser={mainLoop:{scheduler:null,method:"",currentlyRunningMainloop:0,func:null,arg:0,timingMode:0,timingValue:0,currentFrameNumber:0,queue:[],pause:function () {
4967 Browser.mainLoop.scheduler = null;
4968 Browser.mainLoop.currentlyRunningMainloop++; // Incrementing this signals the previous main loop that it's now become old, and it must return.
4969 },resume:function () {
4970 Browser.mainLoop.currentlyRunningMainloop++;
4971 var timingMode = Browser.mainLoop.timingMode;
4972 var timingValue = Browser.mainLoop.timingValue;
4973 var func = Browser.mainLoop.func;
4974 Browser.mainLoop.func = null;
4975 _emscripten_set_main_loop(func, 0, false, Browser.mainLoop.arg, true /* do not set timing and call scheduler, we will do it on the next lines */);
4976 _emscripten_set_main_loop_timing(timingMode, timingValue);
4977 Browser.mainLoop.scheduler();
4978 },updateStatus:function () {
4979 if (Module['setStatus']) {
4980 var message = Module['statusMessage'] || 'Please wait...';
4981 var remaining = Browser.mainLoop.remainingBlockers;
4982 var expected = Browser.mainLoop.expectedBlockers;
4983 if (remaining) {
4984 if (remaining < expected) {
4985 Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
4986 } else {
4987 Module['setStatus'](message);
4988 }
4989 } else {
4990 Module['setStatus']('');
4991 }
4992 }
4993 },runIter:function (func) {
4994 if (ABORT) return;
4995 if (Module['preMainLoop']) {
4996 var preRet = Module['preMainLoop']();
4997 if (preRet === false) {
4998 return; // |return false| skips a frame
4999 }
5000 }
5001 try {
5002 func();
5003 } catch (e) {
5004 if (e instanceof ExitStatus) {
5005 return;
5006 } else {
5007 if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
5008 throw e;
5009 }
5010 }
5011 if (Module['postMainLoop']) Module['postMainLoop']();
5012 }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
5013 if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
5014
5015 if (Browser.initted) return;
5016 Browser.initted = true;
5017
5018 try {
5019 new Blob();
5020 Browser.hasBlobConstructor = true;
5021 } catch(e) {
5022 Browser.hasBlobConstructor = false;
5023 console.log("warning: no blob constructor, cannot create blobs with mimetypes");
5024 }
5025 Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
5026 Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
5027 if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
5028 console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
5029 Module.noImageDecoding = true;
5030 }
5031
5032 // Support for plugins that can process preloaded files. You can add more of these to
5033 // your app by creating and appending to Module.preloadPlugins.
5034 //
5035 // Each plugin is asked if it can handle a file based on the file's name. If it can,
5036 // it is given the file's raw data. When it is done, it calls a callback with the file's
5037 // (possibly modified) data. For example, a plugin might decompress a file, or it
5038 // might create some side data structure for use later (like an Image element, etc.).
5039
5040 var imagePlugin = {};
5041 imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
5042 return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
5043 };
5044 imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
5045 var b = null;
5046 if (Browser.hasBlobConstructor) {
5047 try {
5048 b = new Blob([byteArray], { type: Browser.getMimetype(name) });
5049 if (b.size !== byteArray.length) { // Safari bug #118630
5050 // Safari's Blob can only take an ArrayBuffer
5051 b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
5052 }
5053 } catch(e) {
5054 Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
5055 }
5056 }
5057 if (!b) {
5058 var bb = new Browser.BlobBuilder();
5059 bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
5060 b = bb.getBlob();
5061 }
5062 var url = Browser.URLObject.createObjectURL(b);
5063 assert(typeof url == 'string', 'createObjectURL must return a url as a string');
5064 var img = new Image();
5065 img.onload = function img_onload() {
5066 assert(img.complete, 'Image ' + name + ' could not be decoded');
5067 var canvas = document.createElement('canvas');
5068 canvas.width = img.width;
5069 canvas.height = img.height;
5070 var ctx = canvas.getContext('2d');
5071 ctx.drawImage(img, 0, 0);
5072 Module["preloadedImages"][name] = canvas;
5073 Browser.URLObject.revokeObjectURL(url);
5074 if (onload) onload(byteArray);
5075 };
5076 img.onerror = function img_onerror(event) {
5077 console.log('Image ' + url + ' could not be decoded');
5078 if (onerror) onerror();
5079 };
5080 img.src = url;
5081 };
5082 Module['preloadPlugins'].push(imagePlugin);
5083
5084 var audioPlugin = {};
5085 audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
5086 return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
5087 };
5088 audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
5089 var done = false;
5090 function finish(audio) {
5091 if (done) return;
5092 done = true;
5093 Module["preloadedAudios"][name] = audio;
5094 if (onload) onload(byteArray);
5095 }
5096 function fail() {
5097 if (done) return;
5098 done = true;
5099 Module["preloadedAudios"][name] = new Audio(); // empty shim
5100 if (onerror) onerror();
5101 }
5102 if (Browser.hasBlobConstructor) {
5103 try {
5104 var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
5105 } catch(e) {
5106 return fail();
5107 }
5108 var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
5109 assert(typeof url == 'string', 'createObjectURL must return a url as a string');
5110 var audio = new Audio();
5111 audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
5112 audio.onerror = function audio_onerror(event) {
5113 if (done) return;
5114 console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
5115 function encode64(data) {
5116 var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
5117 var PAD = '=';
5118 var ret = '';
5119 var leftchar = 0;
5120 var leftbits = 0;
5121 for (var i = 0; i < data.length; i++) {
5122 leftchar = (leftchar << 8) | data[i];
5123 leftbits += 8;
5124 while (leftbits >= 6) {
5125 var curr = (leftchar >> (leftbits-6)) & 0x3f;
5126 leftbits -= 6;
5127 ret += BASE[curr];
5128 }
5129 }
5130 if (leftbits == 2) {
5131 ret += BASE[(leftchar&3) << 4];
5132 ret += PAD + PAD;
5133 } else if (leftbits == 4) {
5134 ret += BASE[(leftchar&0xf) << 2];
5135 ret += PAD;
5136 }
5137 return ret;
5138 }
5139 audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
5140 finish(audio); // we don't wait for confirmation this worked - but it's worth trying
5141 };
5142 audio.src = url;
5143 // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
5144 Browser.safeSetTimeout(function() {
5145 finish(audio); // try to use it even though it is not necessarily ready to play
5146 }, 10000);
5147 } else {
5148 return fail();
5149 }
5150 };
5151 Module['preloadPlugins'].push(audioPlugin);
5152
5153 // Canvas event setup
5154
5155 var canvas = Module['canvas'];
5156 function pointerLockChange() {
5157 Browser.pointerLock = document['pointerLockElement'] === canvas ||
5158 document['mozPointerLockElement'] === canvas ||
5159 document['webkitPointerLockElement'] === canvas ||
5160 document['msPointerLockElement'] === canvas;
5161 }
5162 if (canvas) {
5163 // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
5164 // Module['forcedAspectRatio'] = 4 / 3;
5165
5166 canvas.requestPointerLock = canvas['requestPointerLock'] ||
5167 canvas['mozRequestPointerLock'] ||
5168 canvas['webkitRequestPointerLock'] ||
5169 canvas['msRequestPointerLock'] ||
5170 function(){};
5171 canvas.exitPointerLock = document['exitPointerLock'] ||
5172 document['mozExitPointerLock'] ||
5173 document['webkitExitPointerLock'] ||
5174 document['msExitPointerLock'] ||
5175 function(){}; // no-op if function does not exist
5176 canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
5177
5178
5179 document.addEventListener('pointerlockchange', pointerLockChange, false);
5180 document.addEventListener('mozpointerlockchange', pointerLockChange, false);
5181 document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
5182 document.addEventListener('mspointerlockchange', pointerLockChange, false);
5183
5184 if (Module['elementPointerLock']) {
5185 canvas.addEventListener("click", function(ev) {
5186 if (!Browser.pointerLock && canvas.requestPointerLock) {
5187 canvas.requestPointerLock();
5188 ev.preventDefault();
5189 }
5190 }, false);
5191 }
5192 }
5193 },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
5194 if (useWebGL && Module.ctx && canvas == Module.canvas) return Module.ctx; // no need to recreate GL context if it's already been created for this canvas.
5195
5196 var ctx;
5197 var contextHandle;
5198 if (useWebGL) {
5199 // For GLES2/desktop GL compatibility, adjust a few defaults to be different to WebGL defaults, so that they align better with the desktop defaults.
5200 var contextAttributes = {
5201 antialias: false,
5202 alpha: false
5203 };
5204
5205 if (webGLContextAttributes) {
5206 for (var attribute in webGLContextAttributes) {
5207 contextAttributes[attribute] = webGLContextAttributes[attribute];
5208 }
5209 }
5210
5211 contextHandle = GL.createContext(canvas, contextAttributes);
5212 if (contextHandle) {
5213 ctx = GL.getContext(contextHandle).GLctx;
5214 }
5215 // Set the background of the WebGL canvas to black
5216 canvas.style.backgroundColor = "black";
5217 } else {
5218 ctx = canvas.getContext('2d');
5219 }
5220
5221 if (!ctx) return null;
5222
5223 if (setInModule) {
5224 if (!useWebGL) assert(typeof GLctx === 'undefined', 'cannot set in module if GLctx is used, but we are a non-GL context that would replace it');
5225
5226 Module.ctx = ctx;
5227 if (useWebGL) GL.makeContextCurrent(contextHandle);
5228 Module.useWebGL = useWebGL;
5229 Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
5230 Browser.init();
5231 }
5232 return ctx;
5233 },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas, vrDevice) {
5234 Browser.lockPointer = lockPointer;
5235 Browser.resizeCanvas = resizeCanvas;
5236 Browser.vrDevice = vrDevice;
5237 if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
5238 if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
5239 if (typeof Browser.vrDevice === 'undefined') Browser.vrDevice = null;
5240
5241 var canvas = Module['canvas'];
5242 function fullScreenChange() {
5243 Browser.isFullScreen = false;
5244 var canvasContainer = canvas.parentNode;
5245 if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
5246 document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
5247 document['fullScreenElement'] || document['fullscreenElement'] ||
5248 document['msFullScreenElement'] || document['msFullscreenElement'] ||
5249 document['webkitCurrentFullScreenElement']) === canvasContainer) {
5250 canvas.cancelFullScreen = document['cancelFullScreen'] ||
5251 document['mozCancelFullScreen'] ||
5252 document['webkitCancelFullScreen'] ||
5253 document['msExitFullscreen'] ||
5254 document['exitFullscreen'] ||
5255 function() {};
5256 canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
5257 if (Browser.lockPointer) canvas.requestPointerLock();
5258 Browser.isFullScreen = true;
5259 if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
5260 } else {
5261
5262 // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
5263 canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
5264 canvasContainer.parentNode.removeChild(canvasContainer);
5265
5266 if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
5267 }
5268 if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
5269 Browser.updateCanvasDimensions(canvas);
5270 }
5271
5272 if (!Browser.fullScreenHandlersInstalled) {
5273 Browser.fullScreenHandlersInstalled = true;
5274 document.addEventListener('fullscreenchange', fullScreenChange, false);
5275 document.addEventListener('mozfullscreenchange', fullScreenChange, false);
5276 document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
5277 document.addEventListener('MSFullscreenChange', fullScreenChange, false);
5278 }
5279
5280 // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
5281 var canvasContainer = document.createElement("div");
5282 canvas.parentNode.insertBefore(canvasContainer, canvas);
5283 canvasContainer.appendChild(canvas);
5284
5285 // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
5286 canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
5287 canvasContainer['mozRequestFullScreen'] ||
5288 canvasContainer['msRequestFullscreen'] ||
5289 (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
5290
5291 if (vrDevice) {
5292 canvasContainer.requestFullScreen({ vrDisplay: vrDevice });
5293 } else {
5294 canvasContainer.requestFullScreen();
5295 }
5296 },nextRAF:0,fakeRequestAnimationFrame:function (func) {
5297 // try to keep 60fps between calls to here
5298 var now = Date.now();
5299 if (Browser.nextRAF === 0) {
5300 Browser.nextRAF = now + 1000/60;
5301 } else {
5302 while (now + 2 >= Browser.nextRAF) { // fudge a little, to avoid timer jitter causing us to do lots of delay:0
5303 Browser.nextRAF += 1000/60;
5304 }
5305 }
5306 var delay = Math.max(Browser.nextRAF - now, 0);
5307 setTimeout(func, delay);
5308 },requestAnimationFrame:function requestAnimationFrame(func) {
5309 if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
5310 Browser.fakeRequestAnimationFrame(func);
5311 } else {
5312 if (!window.requestAnimationFrame) {
5313 window.requestAnimationFrame = window['requestAnimationFrame'] ||
5314 window['mozRequestAnimationFrame'] ||
5315 window['webkitRequestAnimationFrame'] ||
5316 window['msRequestAnimationFrame'] ||
5317 window['oRequestAnimationFrame'] ||
5318 Browser.fakeRequestAnimationFrame;
5319 }
5320 window.requestAnimationFrame(func);
5321 }
5322 },safeCallback:function (func) {
5323 return function() {
5324 if (!ABORT) return func.apply(null, arguments);
5325 };
5326 },allowAsyncCallbacks:true,queuedAsyncCallbacks:[],pauseAsyncCallbacks:function () {
5327 Browser.allowAsyncCallbacks = false;
5328 },resumeAsyncCallbacks:function () { // marks future callbacks as ok to execute, and synchronously runs any remaining ones right now
5329 Browser.allowAsyncCallbacks = true;
5330 if (Browser.queuedAsyncCallbacks.length > 0) {
5331 var callbacks = Browser.queuedAsyncCallbacks;
5332 Browser.queuedAsyncCallbacks = [];
5333 callbacks.forEach(function(func) {
5334 func();
5335 });
5336 }
5337 },safeRequestAnimationFrame:function (func) {
5338 return Browser.requestAnimationFrame(function() {
5339 if (ABORT) return;
5340 if (Browser.allowAsyncCallbacks) {
5341 func();
5342 } else {
5343 Browser.queuedAsyncCallbacks.push(func);
5344 }
5345 });
5346 },safeSetTimeout:function (func, timeout) {
5347 Module['noExitRuntime'] = true;
5348 return setTimeout(function() {
5349 if (ABORT) return;
5350 if (Browser.allowAsyncCallbacks) {
5351 func();
5352 } else {
5353 Browser.queuedAsyncCallbacks.push(func);
5354 }
5355 }, timeout);
5356 },safeSetInterval:function (func, timeout) {
5357 Module['noExitRuntime'] = true;
5358 return setInterval(function() {
5359 if (ABORT) return;
5360 if (Browser.allowAsyncCallbacks) {
5361 func();
5362 } // drop it on the floor otherwise, next interval will kick in
5363 }, timeout);
5364 },getMimetype:function (name) {
5365 return {
5366 'jpg': 'image/jpeg',
5367 'jpeg': 'image/jpeg',
5368 'png': 'image/png',
5369 'bmp': 'image/bmp',
5370 'ogg': 'audio/ogg',
5371 'wav': 'audio/wav',
5372 'mp3': 'audio/mpeg'
5373 }[name.substr(name.lastIndexOf('.')+1)];
5374 },getUserMedia:function (func) {
5375 if(!window.getUserMedia) {
5376 window.getUserMedia = navigator['getUserMedia'] ||
5377 navigator['mozGetUserMedia'];
5378 }
5379 window.getUserMedia(func);
5380 },getMovementX:function (event) {
5381 return event['movementX'] ||
5382 event['mozMovementX'] ||
5383 event['webkitMovementX'] ||
5384 0;
5385 },getMovementY:function (event) {
5386 return event['movementY'] ||
5387 event['mozMovementY'] ||
5388 event['webkitMovementY'] ||
5389 0;
5390 },getMouseWheelDelta:function (event) {
5391 var delta = 0;
5392 switch (event.type) {
5393 case 'DOMMouseScroll':
5394 delta = event.detail;
5395 break;
5396 case 'mousewheel':
5397 delta = event.wheelDelta;
5398 break;
5399 case 'wheel':
5400 delta = event['deltaY'];
5401 break;
5402 default:
5403 throw 'unrecognized mouse wheel event: ' + event.type;
5404 }
5405 return delta;
5406 },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,touches:{},lastTouches:{},calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
5407 if (Browser.pointerLock) {
5408 // When the pointer is locked, calculate the coordinates
5409 // based on the movement of the mouse.
5410 // Workaround for Firefox bug 764498
5411 if (event.type != 'mousemove' &&
5412 ('mozMovementX' in event)) {
5413 Browser.mouseMovementX = Browser.mouseMovementY = 0;
5414 } else {
5415 Browser.mouseMovementX = Browser.getMovementX(event);
5416 Browser.mouseMovementY = Browser.getMovementY(event);
5417 }
5418
5419 // check if SDL is available
5420 if (typeof SDL != "undefined") {
5421 Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
5422 Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
5423 } else {
5424 // just add the mouse delta to the current absolut mouse position
5425 // FIXME: ideally this should be clamped against the canvas size and zero
5426 Browser.mouseX += Browser.mouseMovementX;
5427 Browser.mouseY += Browser.mouseMovementY;
5428 }
5429 } else {
5430 // Otherwise, calculate the movement based on the changes
5431 // in the coordinates.
5432 var rect = Module["canvas"].getBoundingClientRect();
5433 var cw = Module["canvas"].width;
5434 var ch = Module["canvas"].height;
5435
5436 // Neither .scrollX or .pageXOffset are defined in a spec, but
5437 // we prefer .scrollX because it is currently in a spec draft.
5438 // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
5439 var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
5440 var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
5441 // If this assert lands, it's likely because the browser doesn't support scrollX or pageXOffset
5442 // and we have no viable fallback.
5443 assert((typeof scrollX !== 'undefined') && (typeof scrollY !== 'undefined'), 'Unable to retrieve scroll position, mouse positions likely broken.');
5444
5445 if (event.type === 'touchstart' || event.type === 'touchend' || event.type === 'touchmove') {
5446 var touch = event.touch;
5447 if (touch === undefined) {
5448 return; // the "touch" property is only defined in SDL
5449
5450 }
5451 var adjustedX = touch.pageX - (scrollX + rect.left);
5452 var adjustedY = touch.pageY - (scrollY + rect.top);
5453
5454 adjustedX = adjustedX * (cw / rect.width);
5455 adjustedY = adjustedY * (ch / rect.height);
5456
5457 var coords = { x: adjustedX, y: adjustedY };
5458
5459 if (event.type === 'touchstart') {
5460 Browser.lastTouches[touch.identifier] = coords;
5461 Browser.touches[touch.identifier] = coords;
5462 } else if (event.type === 'touchend' || event.type === 'touchmove') {
5463 var last = Browser.touches[touch.identifier];
5464 if (!last) last = coords;
5465 Browser.lastTouches[touch.identifier] = last;
5466 Browser.touches[touch.identifier] = coords;
5467 }
5468 return;
5469 }
5470
5471 var x = event.pageX - (scrollX + rect.left);
5472 var y = event.pageY - (scrollY + rect.top);
5473
5474 // the canvas might be CSS-scaled compared to its backbuffer;
5475 // SDL-using content will want mouse coordinates in terms
5476 // of backbuffer units.
5477 x = x * (cw / rect.width);
5478 y = y * (ch / rect.height);
5479
5480 Browser.mouseMovementX = x - Browser.mouseX;
5481 Browser.mouseMovementY = y - Browser.mouseY;
5482 Browser.mouseX = x;
5483 Browser.mouseY = y;
5484 }
5485 },xhrLoad:function (url, onload, onerror) {
5486 var xhr = new XMLHttpRequest();
5487 xhr.open('GET', url, true);
5488 xhr.responseType = 'arraybuffer';
5489 xhr.onload = function xhr_onload() {
5490 if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
5491 onload(xhr.response);
5492 } else {
5493 onerror();
5494 }
5495 };
5496 xhr.onerror = onerror;
5497 xhr.send(null);
5498 },asyncLoad:function (url, onload, onerror, noRunDep) {
5499 Browser.xhrLoad(url, function(arrayBuffer) {
5500 assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
5501 onload(new Uint8Array(arrayBuffer));
5502 if (!noRunDep) removeRunDependency('al ' + url);
5503 }, function(event) {
5504 if (onerror) {
5505 onerror();
5506 } else {
5507 throw 'Loading data file "' + url + '" failed.';
5508 }
5509 });
5510 if (!noRunDep) addRunDependency('al ' + url);
5511 },resizeListeners:[],updateResizeListeners:function () {
5512 var canvas = Module['canvas'];
5513 Browser.resizeListeners.forEach(function(listener) {
5514 listener(canvas.width, canvas.height);
5515 });
5516 },setCanvasSize:function (width, height, noUpdates) {
5517 var canvas = Module['canvas'];
5518 Browser.updateCanvasDimensions(canvas, width, height);
5519 if (!noUpdates) Browser.updateResizeListeners();
5520 },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
5521 // check if SDL is available
5522 if (typeof SDL != "undefined") {
5523 var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
5524 flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
5525 HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
5526 }
5527 Browser.updateResizeListeners();
5528 },setWindowedCanvasSize:function () {
5529 // check if SDL is available
5530 if (typeof SDL != "undefined") {
5531 var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
5532 flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
5533 HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
5534 }
5535 Browser.updateResizeListeners();
5536 },updateCanvasDimensions:function (canvas, wNative, hNative) {
5537 if (wNative && hNative) {
5538 canvas.widthNative = wNative;
5539 canvas.heightNative = hNative;
5540 } else {
5541 wNative = canvas.widthNative;
5542 hNative = canvas.heightNative;
5543 }
5544 var w = wNative;
5545 var h = hNative;
5546 if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
5547 if (w/h < Module['forcedAspectRatio']) {
5548 w = Math.round(h * Module['forcedAspectRatio']);
5549 } else {
5550 h = Math.round(w / Module['forcedAspectRatio']);
5551 }
5552 }
5553 if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
5554 document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
5555 document['fullScreenElement'] || document['fullscreenElement'] ||
5556 document['msFullScreenElement'] || document['msFullscreenElement'] ||
5557 document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
5558 var factor = Math.min(screen.width / w, screen.height / h);
5559 w = Math.round(w * factor);
5560 h = Math.round(h * factor);
5561 }
5562 if (Browser.resizeCanvas) {
5563 if (canvas.width != w) canvas.width = w;
5564 if (canvas.height != h) canvas.height = h;
5565 if (typeof canvas.style != 'undefined') {
5566 canvas.style.removeProperty( "width");
5567 canvas.style.removeProperty("height");
5568 }
5569 } else {
5570 if (canvas.width != wNative) canvas.width = wNative;
5571 if (canvas.height != hNative) canvas.height = hNative;
5572 if (typeof canvas.style != 'undefined') {
5573 if (w != wNative || h != hNative) {
5574 canvas.style.setProperty( "width", w + "px", "important");
5575 canvas.style.setProperty("height", h + "px", "important");
5576 } else {
5577 canvas.style.removeProperty( "width");
5578 canvas.style.removeProperty("height");
5579 }
5580 }
5581 }
5582 },wgetRequests:{},nextWgetRequestHandle:0,getNextWgetRequestHandle:function () {
5583 var handle = Browser.nextWgetRequestHandle;
5584 Browser.nextWgetRequestHandle++;
5585 return handle;
5586 }};
5587
5588 function _time(ptr) {
5589 var ret = (Date.now()/1000)|0;
5590 if (ptr) {
5591 HEAP32[((ptr)>>2)]=ret;
5592 }
5593 return ret;
5594 }
5595
5596 function _pthread_self() {
5597 //FIXME: assumes only a single thread
5598 return 0;
5599 }
5600
5601 function ___syscall140(which, varargs) {SYSCALLS.varargs = varargs;
5602 try {
5603 // llseek
5604 var stream = SYSCALLS.getStreamFromFD(), offset_high = SYSCALLS.get(), offset_low = SYSCALLS.get(), result = SYSCALLS.get(), whence = SYSCALLS.get();
5605 var offset = offset_low;
5606 assert(offset_high === 0);
5607 FS.llseek(stream, offset, whence);
5608 HEAP32[((result)>>2)]=stream.position;
5609 if (stream.getdents && offset === 0 && whence === 0) stream.getdents = null; // reset readdir state
5610 return 0;
5611 } catch (e) {
5612 if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e);
5613 return -e.errno;
5614 }
5615 }
5616
5617 function ___syscall146(which, varargs) {SYSCALLS.varargs = varargs;
5618 try {
5619 // writev
5620 var stream = SYSCALLS.getStreamFromFD(), iov = SYSCALLS.get(), iovcnt = SYSCALLS.get();
5621 return SYSCALLS.doWritev(stream, iov, iovcnt);
5622 } catch (e) {
5623 if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e);
5624 return -e.errno;
5625 }
5626 }
5627
5628 function ___syscall54(which, varargs) {SYSCALLS.varargs = varargs;
5629 try {
5630 // ioctl
5631 var stream = SYSCALLS.getStreamFromFD(), op = SYSCALLS.get();
5632 switch (op) {
5633 case 21505: {
5634 if (!stream.tty) return -ERRNO_CODES.ENOTTY;
5635 return 0;
5636 }
5637 case 21506: {
5638 if (!stream.tty) return -ERRNO_CODES.ENOTTY;
5639 return 0; // no-op, not actually adjusting terminal settings
5640 }
5641 case 21519: {
5642 if (!stream.tty) return -ERRNO_CODES.ENOTTY;
5643 var argp = SYSCALLS.get();
5644 HEAP32[((argp)>>2)]=0;
5645 return 0;
5646 }
5647 case 21520: {
5648 if (!stream.tty) return -ERRNO_CODES.ENOTTY;
5649 return -ERRNO_CODES.EINVAL; // not supported
5650 }
5651 case 21531: {
5652 var argp = SYSCALLS.get();
5653 return FS.ioctl(stream, op, argp);
5654 }
5655 default: abort('bad ioctl syscall ' + op);
5656 }
5657 } catch (e) {
5658 if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e);
5659 return -e.errno;
5660 }
5661 }
5662FS.staticInit();__ATINIT__.unshift(function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() });__ATMAIN__.push(function() { FS.ignorePermissions = false });__ATEXIT__.push(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;Module["FS_unlink"] = FS.unlink;
5663__ATINIT__.unshift(function() { TTY.init() });__ATEXIT__.push(function() { TTY.shutdown() });
5664if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); var NODEJS_PATH = require("path"); NODEFS.staticInit(); }
5665Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas, vrDevice) { Browser.requestFullScreen(lockPointer, resizeCanvas, vrDevice) };
5666 Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
5667 Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
5668 Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
5669 Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
5670 Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
5671 Module["createContext"] = function Module_createContext(canvas, useWebGL, setInModule, webGLContextAttributes) { return Browser.createContext(canvas, useWebGL, setInModule, webGLContextAttributes) }
5672STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
5673
5674staticSealed = true; // seal the static portion of memory
5675
5676STACK_MAX = STACK_BASE + TOTAL_STACK;
5677
5678DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
5679
5680assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
5681
5682
5683
5684function nullFunc_ii(x) { Module["printErr"]("Invalid function pointer called with signature 'ii'. Perhaps this is an invalid value (e.g. caused by calling a virtual method on a NULL pointer)? Or calling a function with an incorrect type, which will fail? (it is worth building your source files with -Werror (warnings are errors), as warnings can indicate undefined behavior which can cause this)"); Module["printErr"]("Build with ASSERTIONS=2 for more info.");abort(x) }
5685
5686function nullFunc_iiii(x) { Module["printErr"]("Invalid function pointer called with signature 'iiii'. Perhaps this is an invalid value (e.g. caused by calling a virtual method on a NULL pointer)? Or calling a function with an incorrect type, which will fail? (it is worth building your source files with -Werror (warnings are errors), as warnings can indicate undefined behavior which can cause this)"); Module["printErr"]("Build with ASSERTIONS=2 for more info.");abort(x) }
5687
5688function nullFunc_vi(x) { Module["printErr"]("Invalid function pointer called with signature 'vi'. Perhaps this is an invalid value (e.g. caused by calling a virtual method on a NULL pointer)? Or calling a function with an incorrect type, which will fail? (it is worth building your source files with -Werror (warnings are errors), as warnings can indicate undefined behavior which can cause this)"); Module["printErr"]("Build with ASSERTIONS=2 for more info.");abort(x) }
5689
5690function invoke_ii(index,a1) {
5691 try {
5692 return Module["dynCall_ii"](index,a1);
5693 } catch(e) {
5694 if (typeof e !== 'number' && e !== 'longjmp') throw e;
5695 asm["setThrew"](1, 0);
5696 }
5697}
5698
5699function invoke_iiii(index,a1,a2,a3) {
5700 try {
5701 return Module["dynCall_iiii"](index,a1,a2,a3);
5702 } catch(e) {
5703 if (typeof e !== 'number' && e !== 'longjmp') throw e;
5704 asm["setThrew"](1, 0);
5705 }
5706}
5707
5708function invoke_vi(index,a1) {
5709 try {
5710 Module["dynCall_vi"](index,a1);
5711 } catch(e) {
5712 if (typeof e !== 'number' && e !== 'longjmp') throw e;
5713 asm["setThrew"](1, 0);
5714 }
5715}
5716
5717Module.asmGlobalArg = { "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "NaN": NaN, "Infinity": Infinity };
5718
5719Module.asmLibraryArg = { "abort": abort, "assert": assert, "nullFunc_ii": nullFunc_ii, "nullFunc_iiii": nullFunc_iiii, "nullFunc_vi": nullFunc_vi, "invoke_ii": invoke_ii, "invoke_iiii": invoke_iiii, "invoke_vi": invoke_vi, "_pthread_cleanup_pop": _pthread_cleanup_pop, "_pthread_self": _pthread_self, "_emscripten_set_main_loop": _emscripten_set_main_loop, "___lock": ___lock, "_abort": _abort, "_pthread_cleanup_push": _pthread_cleanup_push, "_llvm_stacksave": _llvm_stacksave, "_sbrk": _sbrk, "_time": _time, "___syscall6": ___syscall6, "_emscripten_set_main_loop_timing": _emscripten_set_main_loop_timing, "_emscripten_memcpy_big": _emscripten_memcpy_big, "___syscall54": ___syscall54, "___unlock": ___unlock, "___syscall140": ___syscall140, "_llvm_stackrestore": _llvm_stackrestore, "_sysconf": _sysconf, "___syscall146": ___syscall146, "___setErrNo": ___setErrNo, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT };
5720// EMSCRIPTEN_START_ASM
5721var asm = (function(global, env, buffer) {
5722 'almost asm';
5723
5724
5725 var HEAP8 = new global.Int8Array(buffer);
5726 var HEAP16 = new global.Int16Array(buffer);
5727 var HEAP32 = new global.Int32Array(buffer);
5728 var HEAPU8 = new global.Uint8Array(buffer);
5729 var HEAPU16 = new global.Uint16Array(buffer);
5730 var HEAPU32 = new global.Uint32Array(buffer);
5731 var HEAPF32 = new global.Float32Array(buffer);
5732 var HEAPF64 = new global.Float64Array(buffer);
5733
5734
5735 var STACKTOP=env.STACKTOP|0;
5736 var STACK_MAX=env.STACK_MAX|0;
5737 var tempDoublePtr=env.tempDoublePtr|0;
5738 var ABORT=env.ABORT|0;
5739
5740 var __THREW__ = 0;
5741 var threwValue = 0;
5742 var setjmpId = 0;
5743 var undef = 0;
5744 var nan = global.NaN, inf = global.Infinity;
5745 var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
5746
5747 var tempRet0 = 0;
5748 var tempRet1 = 0;
5749 var tempRet2 = 0;
5750 var tempRet3 = 0;
5751 var tempRet4 = 0;
5752 var tempRet5 = 0;
5753 var tempRet6 = 0;
5754 var tempRet7 = 0;
5755 var tempRet8 = 0;
5756 var tempRet9 = 0;
5757 var Math_floor=global.Math.floor;
5758 var Math_abs=global.Math.abs;
5759 var Math_sqrt=global.Math.sqrt;
5760 var Math_pow=global.Math.pow;
5761 var Math_cos=global.Math.cos;
5762 var Math_sin=global.Math.sin;
5763 var Math_tan=global.Math.tan;
5764 var Math_acos=global.Math.acos;
5765 var Math_asin=global.Math.asin;
5766 var Math_atan=global.Math.atan;
5767 var Math_atan2=global.Math.atan2;
5768 var Math_exp=global.Math.exp;
5769 var Math_log=global.Math.log;
5770 var Math_ceil=global.Math.ceil;
5771 var Math_imul=global.Math.imul;
5772 var Math_min=global.Math.min;
5773 var Math_clz32=global.Math.clz32;
5774 var abort=env.abort;
5775 var assert=env.assert;
5776 var nullFunc_ii=env.nullFunc_ii;
5777 var nullFunc_iiii=env.nullFunc_iiii;
5778 var nullFunc_vi=env.nullFunc_vi;
5779 var invoke_ii=env.invoke_ii;
5780 var invoke_iiii=env.invoke_iiii;
5781 var invoke_vi=env.invoke_vi;
5782 var _pthread_cleanup_pop=env._pthread_cleanup_pop;
5783 var _pthread_self=env._pthread_self;
5784 var _emscripten_set_main_loop=env._emscripten_set_main_loop;
5785 var ___lock=env.___lock;
5786 var _abort=env._abort;
5787 var _pthread_cleanup_push=env._pthread_cleanup_push;
5788 var _llvm_stacksave=env._llvm_stacksave;
5789 var _sbrk=env._sbrk;
5790 var _time=env._time;
5791 var ___syscall6=env.___syscall6;
5792 var _emscripten_set_main_loop_timing=env._emscripten_set_main_loop_timing;
5793 var _emscripten_memcpy_big=env._emscripten_memcpy_big;
5794 var ___syscall54=env.___syscall54;
5795 var ___unlock=env.___unlock;
5796 var ___syscall140=env.___syscall140;
5797 var _llvm_stackrestore=env._llvm_stackrestore;
5798 var _sysconf=env._sysconf;
5799 var ___syscall146=env.___syscall146;
5800 var ___setErrNo=env.___setErrNo;
5801 var tempFloat = 0.0;
5802
5803// EMSCRIPTEN_START_FUNCS
5804function stackAlloc(size) {
5805 size = size|0;
5806 var ret = 0;
5807 ret = STACKTOP;
5808 STACKTOP = (STACKTOP + size)|0;
5809 STACKTOP = (STACKTOP + 15)&-16;
5810if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
5811
5812 return ret|0;
5813}
5814function stackSave() {
5815 return STACKTOP|0;
5816}
5817function stackRestore(top) {
5818 top = top|0;
5819 STACKTOP = top;
5820}
5821function establishStackSpace(stackBase, stackMax) {
5822 stackBase = stackBase|0;
5823 stackMax = stackMax|0;
5824 STACKTOP = stackBase;
5825 STACK_MAX = stackMax;
5826}
5827
5828function setThrew(threw, value) {
5829 threw = threw|0;
5830 value = value|0;
5831 if ((__THREW__|0) == 0) {
5832 __THREW__ = threw;
5833 threwValue = value;
5834 }
5835}
5836function copyTempFloat(ptr) {
5837 ptr = ptr|0;
5838 HEAP8[tempDoublePtr>>0] = HEAP8[ptr>>0];
5839 HEAP8[tempDoublePtr+1>>0] = HEAP8[ptr+1>>0];
5840 HEAP8[tempDoublePtr+2>>0] = HEAP8[ptr+2>>0];
5841 HEAP8[tempDoublePtr+3>>0] = HEAP8[ptr+3>>0];
5842}
5843function copyTempDouble(ptr) {
5844 ptr = ptr|0;
5845 HEAP8[tempDoublePtr>>0] = HEAP8[ptr>>0];
5846 HEAP8[tempDoublePtr+1>>0] = HEAP8[ptr+1>>0];
5847 HEAP8[tempDoublePtr+2>>0] = HEAP8[ptr+2>>0];
5848 HEAP8[tempDoublePtr+3>>0] = HEAP8[ptr+3>>0];
5849 HEAP8[tempDoublePtr+4>>0] = HEAP8[ptr+4>>0];
5850 HEAP8[tempDoublePtr+5>>0] = HEAP8[ptr+5>>0];
5851 HEAP8[tempDoublePtr+6>>0] = HEAP8[ptr+6>>0];
5852 HEAP8[tempDoublePtr+7>>0] = HEAP8[ptr+7>>0];
5853}
5854
5855function setTempRet0(value) {
5856 value = value|0;
5857 tempRet0 = value;
5858}
5859function getTempRet0() {
5860 return tempRet0|0;
5861}
5862
5863function _loadMemory($layerData,$format,$width,$height,$outData) {
5864 $layerData = $layerData|0;
5865 $format = $format|0;
5866 $width = $width|0;
5867 $height = $height|0;
5868 $outData = $outData|0;
5869 var $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
5870 sp = STACKTOP;
5871 STACKTOP = STACKTOP + 32|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
5872 $0 = $layerData;
5873 $1 = $format;
5874 $2 = $width;
5875 $3 = $height;
5876 $4 = $outData;
5877 $5 = $1;
5878 switch ($5|0) {
5879 case 1: {
5880 $6 = $0;
5881 $7 = $2;
5882 $8 = $3;
5883 $9 = $4;
5884 __Z8loadDXT1PhjjPj($6,$7,$8,$9);
5885 break;
5886 }
5887 case 2: {
5888 $10 = $0;
5889 $11 = $2;
5890 $12 = $3;
5891 $13 = $4;
5892 __Z8loadDXT3PhjjPj($10,$11,$12,$13);
5893 break;
5894 }
5895 case 3: {
5896 $14 = $0;
5897 $15 = $2;
5898 $16 = $3;
5899 $17 = $4;
5900 __Z8loadDXT5PhjjPj($14,$15,$16,$17);
5901 break;
5902 }
5903 default: {
5904 }
5905 }
5906 STACKTOP = sp;return;
5907}
5908function __Z8loadDXT1PhjjPj($layerData,$w,$h,$outData) {
5909 $layerData = $layerData|0;
5910 $w = $w|0;
5911 $h = $h|0;
5912 $outData = $outData|0;
5913 var $$alloca_mul = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0;
5914 var $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0;
5915 var $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0;
5916 var $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0;
5917 var $9 = 0, $blockIndex = 0, $bx = 0, $by = 0, $i = 0, $ibx = 0, $iby = 0, $innerIndex = 0, $numBlocksFull = 0, $partialBlock = 0, $position = 0, $x = 0, $y = 0, label = 0, sp = 0;
5918 sp = STACKTOP;
5919 STACKTOP = STACKTOP + 80|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
5920 $position = sp + 36|0;
5921 $0 = $layerData;
5922 $1 = $w;
5923 $2 = $h;
5924 $3 = $outData;
5925 $5 = $1;
5926 $6 = $2;
5927 $7 = Math_imul($5, $6)|0;
5928 $8 = (($7>>>0) / 16)&-1;
5929 $numBlocksFull = $8;
5930 $9 = $1;
5931 $10 = $2;
5932 $11 = Math_imul($9, $10)|0;
5933 $12 = (($11>>>0) % 16)&-1;
5934 $13 = ($12|0)!=(0);
5935 $14 = $13&1;
5936 $partialBlock = $14;
5937 $15 = $numBlocksFull;
5938 $16 = $partialBlock;
5939 $17 = $16&1;
5940 $18 = $17 ? 1 : 0;
5941 $19 = (($15) + ($18))|0;
5942 $20 = $19<<4;
5943 $21 = (_llvm_stacksave()|0);
5944 $4 = $21;
5945 $$alloca_mul = $20<<2;
5946 $22 = STACKTOP; STACKTOP = STACKTOP + ((((1*$$alloca_mul)|0)+15)&-16)|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();;
5947 HEAP32[$position>>2] = 0;
5948 $i = 0;
5949 while(1) {
5950 $23 = $i;
5951 $24 = $numBlocksFull;
5952 $25 = ($23|0)<($24|0);
5953 if (!($25)) {
5954 break;
5955 }
5956 $26 = $0;
5957 $27 = $i;
5958 $28 = $27<<4;
5959 $29 = (($22) + ($28<<2)|0);
5960 __Z12dxt1GetBlockPhPjRj($26,$29,$position);
5961 $30 = $i;
5962 $31 = (($30) + 1)|0;
5963 $i = $31;
5964 }
5965 $32 = $partialBlock;
5966 $33 = $32&1;
5967 if ($33) {
5968 $34 = $0;
5969 $35 = $numBlocksFull;
5970 $36 = $35<<4;
5971 $37 = (($22) + ($36<<2)|0);
5972 __Z12dxt1GetBlockPhPjRj($34,$37,$position);
5973 }
5974 $y = 0;
5975 while(1) {
5976 $38 = $y;
5977 $39 = $2;
5978 $40 = ($38>>>0)<($39>>>0);
5979 if (!($40)) {
5980 break;
5981 }
5982 $x = 0;
5983 while(1) {
5984 $41 = $x;
5985 $42 = $1;
5986 $43 = ($41>>>0)<($42>>>0);
5987 if (!($43)) {
5988 break;
5989 }
5990 $44 = $x;
5991 $45 = (($44>>>0) / 4)&-1;
5992 $bx = $45;
5993 $46 = $y;
5994 $47 = (($46>>>0) / 4)&-1;
5995 $by = $47;
5996 $48 = $x;
5997 $49 = (($48>>>0) % 4)&-1;
5998 $ibx = $49;
5999 $50 = $y;
6000 $51 = (($50>>>0) % 4)&-1;
6001 $iby = $51;
6002 $52 = $by;
6003 $53 = $1;
6004 $54 = (($53>>>0) / 4)&-1;
6005 $55 = Math_imul($52, $54)|0;
6006 $56 = $bx;
6007 $57 = (($55) + ($56))|0;
6008 $blockIndex = $57;
6009 $58 = $iby;
6010 $59 = $58<<2;
6011 $60 = $ibx;
6012 $61 = (($59) + ($60))|0;
6013 $innerIndex = $61;
6014 $62 = $blockIndex;
6015 $63 = $62<<4;
6016 $64 = $innerIndex;
6017 $65 = (($63) + ($64))|0;
6018 $66 = (($22) + ($65<<2)|0);
6019 $67 = HEAP32[$66>>2]|0;
6020 $68 = $y;
6021 $69 = $1;
6022 $70 = Math_imul($68, $69)|0;
6023 $71 = $x;
6024 $72 = (($70) + ($71))|0;
6025 $73 = $3;
6026 $74 = (($73) + ($72<<2)|0);
6027 HEAP32[$74>>2] = $67;
6028 $75 = $x;
6029 $76 = (($75) + 1)|0;
6030 $x = $76;
6031 }
6032 $77 = $y;
6033 $78 = (($77) + 1)|0;
6034 $y = $78;
6035 }
6036 $79 = $4;
6037 _llvm_stackrestore(($79|0));
6038 STACKTOP = sp;return;
6039}
6040function __Z8loadDXT3PhjjPj($layerData,$w,$h,$outData) {
6041 $layerData = $layerData|0;
6042 $w = $w|0;
6043 $h = $h|0;
6044 $outData = $outData|0;
6045 var $$alloca_mul = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0;
6046 var $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0;
6047 var $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0;
6048 var $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0;
6049 var $9 = 0, $blockIndex = 0, $bx = 0, $by = 0, $i = 0, $ibx = 0, $iby = 0, $innerIndex = 0, $numBlocksFull = 0, $partialBlock = 0, $position = 0, $x = 0, $y = 0, label = 0, sp = 0;
6050 sp = STACKTOP;
6051 STACKTOP = STACKTOP + 80|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
6052 $position = sp + 36|0;
6053 $0 = $layerData;
6054 $1 = $w;
6055 $2 = $h;
6056 $3 = $outData;
6057 $5 = $1;
6058 $6 = $2;
6059 $7 = Math_imul($5, $6)|0;
6060 $8 = (($7>>>0) / 16)&-1;
6061 $numBlocksFull = $8;
6062 $9 = $1;
6063 $10 = $2;
6064 $11 = Math_imul($9, $10)|0;
6065 $12 = (($11>>>0) % 16)&-1;
6066 $13 = ($12|0)!=(0);
6067 $14 = $13&1;
6068 $partialBlock = $14;
6069 $15 = $numBlocksFull;
6070 $16 = $partialBlock;
6071 $17 = $16&1;
6072 $18 = $17 ? 1 : 0;
6073 $19 = (($15) + ($18))|0;
6074 $20 = $19<<4;
6075 $21 = (_llvm_stacksave()|0);
6076 $4 = $21;
6077 $$alloca_mul = $20<<2;
6078 $22 = STACKTOP; STACKTOP = STACKTOP + ((((1*$$alloca_mul)|0)+15)&-16)|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();;
6079 HEAP32[$position>>2] = 0;
6080 $i = 0;
6081 while(1) {
6082 $23 = $i;
6083 $24 = $numBlocksFull;
6084 $25 = ($23|0)<($24|0);
6085 if (!($25)) {
6086 break;
6087 }
6088 $26 = $0;
6089 $27 = $i;
6090 $28 = $27<<4;
6091 $29 = (($22) + ($28<<2)|0);
6092 __Z12dxt3GetBlockPhPjRj($26,$29,$position);
6093 $30 = $i;
6094 $31 = (($30) + 1)|0;
6095 $i = $31;
6096 }
6097 $32 = $partialBlock;
6098 $33 = $32&1;
6099 if ($33) {
6100 $34 = $0;
6101 $35 = $numBlocksFull;
6102 $36 = $35<<4;
6103 $37 = (($22) + ($36<<2)|0);
6104 __Z12dxt3GetBlockPhPjRj($34,$37,$position);
6105 }
6106 $y = 0;
6107 while(1) {
6108 $38 = $y;
6109 $39 = $2;
6110 $40 = ($38>>>0)<($39>>>0);
6111 if (!($40)) {
6112 break;
6113 }
6114 $x = 0;
6115 while(1) {
6116 $41 = $x;
6117 $42 = $1;
6118 $43 = ($41>>>0)<($42>>>0);
6119 if (!($43)) {
6120 break;
6121 }
6122 $44 = $x;
6123 $45 = (($44>>>0) / 4)&-1;
6124 $bx = $45;
6125 $46 = $y;
6126 $47 = (($46>>>0) / 4)&-1;
6127 $by = $47;
6128 $48 = $x;
6129 $49 = (($48>>>0) % 4)&-1;
6130 $ibx = $49;
6131 $50 = $y;
6132 $51 = (($50>>>0) % 4)&-1;
6133 $iby = $51;
6134 $52 = $by;
6135 $53 = $1;
6136 $54 = (($53>>>0) / 4)&-1;
6137 $55 = Math_imul($52, $54)|0;
6138 $56 = $bx;
6139 $57 = (($55) + ($56))|0;
6140 $blockIndex = $57;
6141 $58 = $iby;
6142 $59 = $58<<2;
6143 $60 = $ibx;
6144 $61 = (($59) + ($60))|0;
6145 $innerIndex = $61;
6146 $62 = $blockIndex;
6147 $63 = $62<<4;
6148 $64 = $innerIndex;
6149 $65 = (($63) + ($64))|0;
6150 $66 = (($22) + ($65<<2)|0);
6151 $67 = HEAP32[$66>>2]|0;
6152 $68 = $y;
6153 $69 = $1;
6154 $70 = Math_imul($68, $69)|0;
6155 $71 = $x;
6156 $72 = (($70) + ($71))|0;
6157 $73 = $3;
6158 $74 = (($73) + ($72<<2)|0);
6159 HEAP32[$74>>2] = $67;
6160 $75 = $x;
6161 $76 = (($75) + 1)|0;
6162 $x = $76;
6163 }
6164 $77 = $y;
6165 $78 = (($77) + 1)|0;
6166 $y = $78;
6167 }
6168 $79 = $4;
6169 _llvm_stackrestore(($79|0));
6170 STACKTOP = sp;return;
6171}
6172function __Z8loadDXT5PhjjPj($layerData,$w,$h,$outData) {
6173 $layerData = $layerData|0;
6174 $w = $w|0;
6175 $h = $h|0;
6176 $outData = $outData|0;
6177 var $$alloca_mul = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0;
6178 var $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0;
6179 var $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0;
6180 var $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0;
6181 var $9 = 0, $blockIndex = 0, $bx = 0, $by = 0, $i = 0, $ibx = 0, $iby = 0, $innerIndex = 0, $numBlocksFull = 0, $partialBlock = 0, $position = 0, $x = 0, $y = 0, label = 0, sp = 0;
6182 sp = STACKTOP;
6183 STACKTOP = STACKTOP + 80|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
6184 $position = sp + 36|0;
6185 $0 = $layerData;
6186 $1 = $w;
6187 $2 = $h;
6188 $3 = $outData;
6189 $5 = $1;
6190 $6 = $2;
6191 $7 = Math_imul($5, $6)|0;
6192 $8 = (($7>>>0) / 16)&-1;
6193 $numBlocksFull = $8;
6194 $9 = $1;
6195 $10 = $2;
6196 $11 = Math_imul($9, $10)|0;
6197 $12 = (($11>>>0) % 16)&-1;
6198 $13 = ($12|0)!=(0);
6199 $14 = $13&1;
6200 $partialBlock = $14;
6201 $15 = $numBlocksFull;
6202 $16 = $partialBlock;
6203 $17 = $16&1;
6204 $18 = $17 ? 1 : 0;
6205 $19 = (($15) + ($18))|0;
6206 $20 = $19<<4;
6207 $21 = (_llvm_stacksave()|0);
6208 $4 = $21;
6209 $$alloca_mul = $20<<2;
6210 $22 = STACKTOP; STACKTOP = STACKTOP + ((((1*$$alloca_mul)|0)+15)&-16)|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();;
6211 HEAP32[$position>>2] = 0;
6212 $i = 0;
6213 while(1) {
6214 $23 = $i;
6215 $24 = $numBlocksFull;
6216 $25 = ($23|0)<($24|0);
6217 if (!($25)) {
6218 break;
6219 }
6220 $26 = $0;
6221 $27 = $i;
6222 $28 = $27<<4;
6223 $29 = (($22) + ($28<<2)|0);
6224 __Z12dxt5GetBlockPhPjRj($26,$29,$position);
6225 $30 = $i;
6226 $31 = (($30) + 1)|0;
6227 $i = $31;
6228 }
6229 $32 = $partialBlock;
6230 $33 = $32&1;
6231 if ($33) {
6232 $34 = $0;
6233 $35 = $numBlocksFull;
6234 $36 = $35<<4;
6235 $37 = (($22) + ($36<<2)|0);
6236 __Z12dxt5GetBlockPhPjRj($34,$37,$position);
6237 }
6238 $y = 0;
6239 while(1) {
6240 $38 = $y;
6241 $39 = $2;
6242 $40 = ($38>>>0)<($39>>>0);
6243 if (!($40)) {
6244 break;
6245 }
6246 $x = 0;
6247 while(1) {
6248 $41 = $x;
6249 $42 = $1;
6250 $43 = ($41>>>0)<($42>>>0);
6251 if (!($43)) {
6252 break;
6253 }
6254 $44 = $x;
6255 $45 = (($44>>>0) / 4)&-1;
6256 $bx = $45;
6257 $46 = $y;
6258 $47 = (($46>>>0) / 4)&-1;
6259 $by = $47;
6260 $48 = $x;
6261 $49 = (($48>>>0) % 4)&-1;
6262 $ibx = $49;
6263 $50 = $y;
6264 $51 = (($50>>>0) % 4)&-1;
6265 $iby = $51;
6266 $52 = $by;
6267 $53 = $1;
6268 $54 = (($53>>>0) / 4)&-1;
6269 $55 = Math_imul($52, $54)|0;
6270 $56 = $bx;
6271 $57 = (($55) + ($56))|0;
6272 $blockIndex = $57;
6273 $58 = $iby;
6274 $59 = $58<<2;
6275 $60 = $ibx;
6276 $61 = (($59) + ($60))|0;
6277 $innerIndex = $61;
6278 $62 = $blockIndex;
6279 $63 = $62<<4;
6280 $64 = $innerIndex;
6281 $65 = (($63) + ($64))|0;
6282 $66 = (($22) + ($65<<2)|0);
6283 $67 = HEAP32[$66>>2]|0;
6284 $68 = $y;
6285 $69 = $1;
6286 $70 = Math_imul($68, $69)|0;
6287 $71 = $x;
6288 $72 = (($70) + ($71))|0;
6289 $73 = $3;
6290 $74 = (($73) + ($72<<2)|0);
6291 HEAP32[$74>>2] = $67;
6292 $75 = $x;
6293 $76 = (($75) + 1)|0;
6294 $x = $76;
6295 }
6296 $77 = $y;
6297 $78 = (($77) + 1)|0;
6298 $y = $78;
6299 }
6300 $79 = $4;
6301 _llvm_stackrestore(($79|0));
6302 STACKTOP = sp;return;
6303}
6304function __Z12dxt1GetBlockPhPjRj($layerData,$colorPtr,$position) {
6305 $layerData = $layerData|0;
6306 $colorPtr = $colorPtr|0;
6307 $position = $position|0;
6308 var $0 = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0;
6309 var $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $14 = 0, $15 = 0, $16 = 0;
6310 var $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0;
6311 var $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0;
6312 var $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0;
6313 var $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0, $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0, $89 = 0;
6314 var $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $clr1 = 0, $clr2 = 0, $clr3 = 0, $clr4 = 0, $color1 = 0, $color2 = 0, $i = 0, $i1 = 0, $i2 = 0;
6315 var $index = 0, $indices = 0, $rgbTmpArray = 0, $tableIndices = 0, $x = 0, $y = 0, dest = 0, label = 0, sp = 0, src = 0, stop = 0;
6316 sp = STACKTOP;
6317 STACKTOP = STACKTOP + 112|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
6318 $rgbTmpArray = sp + 96|0;
6319 $tableIndices = sp + 64|0;
6320 $0 = $layerData;
6321 $1 = $colorPtr;
6322 $2 = $position;
6323 dest=$rgbTmpArray; src=668; stop=dest+16|0; do { HEAP8[dest>>0]=HEAP8[src>>0]|0; dest=dest+1|0; src=src+1|0; } while ((dest|0) < (stop|0));
6324 dest=$tableIndices; stop=dest+32|0; do { HEAP16[dest>>1]=0|0; dest=dest+2|0; } while ((dest|0) < (stop|0));
6325 $3 = $2;
6326 $4 = HEAP32[$3>>2]|0;
6327 $5 = $0;
6328 $6 = (($5) + ($4)|0);
6329 $7 = HEAP16[$6>>1]|0;
6330 $color1 = $7;
6331 $8 = $2;
6332 $9 = HEAP32[$8>>2]|0;
6333 $10 = (($9) + 2)|0;
6334 HEAP32[$8>>2] = $10;
6335 $11 = $2;
6336 $12 = HEAP32[$11>>2]|0;
6337 $13 = $0;
6338 $14 = (($13) + ($12)|0);
6339 $15 = HEAP16[$14>>1]|0;
6340 $color2 = $15;
6341 $16 = $2;
6342 $17 = HEAP32[$16>>2]|0;
6343 $18 = (($17) + 2)|0;
6344 HEAP32[$16>>2] = $18;
6345 $19 = $color1;
6346 __Z17RGB565ToRGB8ArraytPh($19,$rgbTmpArray);
6347 $20 = $color2;
6348 $21 = ((($rgbTmpArray)) + 4|0);
6349 __Z17RGB565ToRGB8ArraytPh($20,$21);
6350 $clr1 = $rgbTmpArray;
6351 $22 = ((($rgbTmpArray)) + 4|0);
6352 $clr2 = $22;
6353 $23 = ((($rgbTmpArray)) + 8|0);
6354 $clr3 = $23;
6355 $24 = ((($rgbTmpArray)) + 12|0);
6356 $clr4 = $24;
6357 $25 = $color1;
6358 $26 = $25&65535;
6359 $27 = $color2;
6360 $28 = $27&65535;
6361 $29 = ($26|0)>($28|0);
6362 L1: do {
6363 if ($29) {
6364 $i = 0;
6365 while(1) {
6366 $30 = $i;
6367 $31 = ($30|0)<(3);
6368 if (!($31)) {
6369 break L1;
6370 }
6371 $32 = $i;
6372 $33 = $clr1;
6373 $34 = (($33) + ($32)|0);
6374 $35 = HEAP8[$34>>0]|0;
6375 $36 = $35&255;
6376 $37 = $i;
6377 $38 = $clr2;
6378 $39 = (($38) + ($37)|0);
6379 $40 = HEAP8[$39>>0]|0;
6380 $41 = $40&255;
6381 $42 = $41<<1;
6382 $43 = (($36) + ($42))|0;
6383 $44 = (($43|0) / 3)&-1;
6384 $45 = $44&255;
6385 $46 = $i;
6386 $47 = $clr4;
6387 $48 = (($47) + ($46)|0);
6388 HEAP8[$48>>0] = $45;
6389 $49 = $i;
6390 $50 = $clr1;
6391 $51 = (($50) + ($49)|0);
6392 $52 = HEAP8[$51>>0]|0;
6393 $53 = $52&255;
6394 $54 = $53<<1;
6395 $55 = $i;
6396 $56 = $clr2;
6397 $57 = (($56) + ($55)|0);
6398 $58 = HEAP8[$57>>0]|0;
6399 $59 = $58&255;
6400 $60 = (($54) + ($59))|0;
6401 $61 = (($60|0) / 3)&-1;
6402 $62 = $61&255;
6403 $63 = $i;
6404 $64 = $clr3;
6405 $65 = (($64) + ($63)|0);
6406 HEAP8[$65>>0] = $62;
6407 $66 = $i;
6408 $67 = (($66) + 1)|0;
6409 $i = $67;
6410 }
6411 } else {
6412 $i1 = 0;
6413 while(1) {
6414 $68 = $i1;
6415 $69 = ($68|0)<(3);
6416 if (!($69)) {
6417 break L1;
6418 }
6419 $70 = $i1;
6420 $71 = $clr1;
6421 $72 = (($71) + ($70)|0);
6422 $73 = HEAP8[$72>>0]|0;
6423 $74 = $73&255;
6424 $75 = $i1;
6425 $76 = $clr2;
6426 $77 = (($76) + ($75)|0);
6427 $78 = HEAP8[$77>>0]|0;
6428 $79 = $78&255;
6429 $80 = (($74) + ($79))|0;
6430 $81 = (($80|0) / 2)&-1;
6431 $82 = $81&255;
6432 $83 = $i1;
6433 $84 = $clr3;
6434 $85 = (($84) + ($83)|0);
6435 HEAP8[$85>>0] = $82;
6436 $86 = $i1;
6437 $87 = $clr4;
6438 $88 = (($87) + ($86)|0);
6439 HEAP8[$88>>0] = 0;
6440 $89 = $i1;
6441 $90 = (($89) + 1)|0;
6442 $i1 = $90;
6443 }
6444 }
6445 } while(0);
6446 $91 = $2;
6447 $92 = HEAP32[$91>>2]|0;
6448 $93 = $0;
6449 $94 = (($93) + ($92)|0);
6450 $95 = HEAP32[$94>>2]|0;
6451 $indices = $95;
6452 $96 = $2;
6453 $97 = HEAP32[$96>>2]|0;
6454 $98 = (($97) + 4)|0;
6455 HEAP32[$96>>2] = $98;
6456 $i2 = 0;
6457 while(1) {
6458 $99 = $i2;
6459 $100 = ($99>>>0)<(16);
6460 if (!($100)) {
6461 break;
6462 }
6463 $101 = $indices;
6464 $102 = $i2;
6465 $103 = $102<<1;
6466 $104 = $101 >>> $103;
6467 $105 = $104 & 3;
6468 $106 = $105&65535;
6469 $107 = $i2;
6470 $108 = (($tableIndices) + ($107<<1)|0);
6471 HEAP16[$108>>1] = $106;
6472 $109 = $i2;
6473 $110 = (($109) + 1)|0;
6474 $i2 = $110;
6475 }
6476 $y = 0;
6477 while(1) {
6478 $111 = $y;
6479 $112 = ($111|0)<(4);
6480 if (!($112)) {
6481 break;
6482 }
6483 $x = 0;
6484 while(1) {
6485 $113 = $x;
6486 $114 = ($113|0)<(4);
6487 $115 = $y;
6488 if (!($114)) {
6489 break;
6490 }
6491 $116 = $115<<2;
6492 $117 = $x;
6493 $118 = (($116) + ($117))|0;
6494 $index = $118;
6495 $119 = $index;
6496 $120 = (($tableIndices) + ($119<<1)|0);
6497 $121 = HEAP16[$120>>1]|0;
6498 $122 = $121&65535;
6499 $123 = (($rgbTmpArray) + ($122<<2)|0);
6500 $124 = HEAP32[$123>>2]|0;
6501 $125 = $index;
6502 $126 = $1;
6503 $127 = (($126) + ($125<<2)|0);
6504 HEAP32[$127>>2] = $124;
6505 $128 = $x;
6506 $129 = (($128) + 1)|0;
6507 $x = $129;
6508 }
6509 $130 = (($115) + 1)|0;
6510 $y = $130;
6511 }
6512 STACKTOP = sp;return;
6513}
6514function __Z12dxt3GetBlockPhPjRj($layerData,$colorPtr,$position) {
6515 $layerData = $layerData|0;
6516 $colorPtr = $colorPtr|0;
6517 $position = $position|0;
6518 var $0 = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0;
6519 var $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 0, $132 = 0, $133 = 0;
6520 var $134 = 0, $135 = 0, $136 = 0, $137 = 0, $138 = 0, $139 = 0, $14 = 0, $140 = 0, $141 = 0, $142 = 0, $143 = 0, $144 = 0, $145 = 0, $146 = 0, $147 = 0, $148 = 0, $149 = 0, $15 = 0, $150 = 0, $151 = 0;
6521 var $152 = 0, $153 = 0, $154 = 0, $155 = 0, $156 = 0, $157 = 0, $158 = 0, $159 = 0, $16 = 0, $160 = 0, $161 = 0, $162 = 0, $163 = 0, $164 = 0, $165 = 0, $166 = 0, $167 = 0, $168 = 0, $169 = 0, $17 = 0;
6522 var $170 = 0, $171 = 0, $172 = 0, $173 = 0, $174 = 0, $175 = 0, $176 = 0, $177 = 0, $178 = 0, $179 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0;
6523 var $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0.0, $34 = 0.0, $35 = 0.0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0;
6524 var $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0;
6525 var $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0;
6526 var $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0;
6527 var $alpha = 0, $alphaValues = 0, $calpha = 0, $clr1 = 0, $clr2 = 0, $clr3 = 0, $clr4 = 0, $color = 0, $color1 = 0, $color2 = 0, $i = 0, $i1 = 0, $i2 = 0, $i3 = 0, $index = 0, $indices = 0, $rgbTmpArray = 0, $tableIndices = 0, $x = 0, $y = 0;
6528 var dest = 0, label = 0, sp = 0, src = 0, stop = 0;
6529 sp = STACKTOP;
6530 STACKTOP = STACKTOP + 192|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
6531 $alphaValues = sp + 64|0;
6532 $rgbTmpArray = sp + 176|0;
6533 $tableIndices = sp + 144|0;
6534 $alpha = sp;
6535 $0 = $layerData;
6536 $1 = $colorPtr;
6537 $2 = $position;
6538 dest=$alphaValues; stop=dest+64|0; do { HEAP32[dest>>2]=0|0; dest=dest+4|0; } while ((dest|0) < (stop|0));
6539 dest=$rgbTmpArray; src=668; stop=dest+16|0; do { HEAP8[dest>>0]=HEAP8[src>>0]|0; dest=dest+1|0; src=src+1|0; } while ((dest|0) < (stop|0));
6540 dest=$tableIndices; stop=dest+32|0; do { HEAP16[dest>>1]=0|0; dest=dest+2|0; } while ((dest|0) < (stop|0));
6541 $3 = $0;
6542 $4 = $2;
6543 $5 = HEAP32[$4>>2]|0;
6544 $6 = (($3) + ($5)|0);
6545 $7 = $6;
6546 $8 = $7;
6547 $9 = HEAP32[$8>>2]|0;
6548 $10 = (($7) + 4)|0;
6549 $11 = $10;
6550 $12 = HEAP32[$11>>2]|0;
6551 $13 = $alpha;
6552 $14 = $13;
6553 HEAP32[$14>>2] = $9;
6554 $15 = (($13) + 4)|0;
6555 $16 = $15;
6556 HEAP32[$16>>2] = $12;
6557 $17 = $2;
6558 $18 = HEAP32[$17>>2]|0;
6559 $19 = (($18) + 8)|0;
6560 HEAP32[$17>>2] = $19;
6561 $i = 0;
6562 while(1) {
6563 $20 = $i;
6564 $21 = ($20|0)<(16);
6565 if (!($21)) {
6566 break;
6567 }
6568 $22 = $alpha;
6569 $23 = $22;
6570 $24 = HEAP32[$23>>2]|0;
6571 $25 = (($22) + 4)|0;
6572 $26 = $25;
6573 $27 = HEAP32[$26>>2]|0;
6574 $28 = $i;
6575 $29 = $28<<2;
6576 $30 = (_bitshift64Lshr(($24|0),($27|0),($29|0))|0);
6577 $31 = tempRet0;
6578 $32 = $30 & 15;
6579 $33 = (+($32>>>0)) + (4294967296.0*(0.0));
6580 $34 = $33 / 15.0;
6581 $35 = $34 * 255.0;
6582 $36 = (~~(($35))&255);
6583 $37 = $36&255;
6584 $38 = $i;
6585 $39 = (($alphaValues) + ($38<<2)|0);
6586 HEAP32[$39>>2] = $37;
6587 $40 = $i;
6588 $41 = (($40) + 1)|0;
6589 $i = $41;
6590 }
6591 $42 = $0;
6592 $43 = $2;
6593 $44 = HEAP32[$43>>2]|0;
6594 $45 = (($42) + ($44)|0);
6595 $46 = HEAP16[$45>>1]|0;
6596 $color1 = $46;
6597 $47 = $2;
6598 $48 = HEAP32[$47>>2]|0;
6599 $49 = (($48) + 2)|0;
6600 HEAP32[$47>>2] = $49;
6601 $50 = $0;
6602 $51 = $2;
6603 $52 = HEAP32[$51>>2]|0;
6604 $53 = (($50) + ($52)|0);
6605 $54 = HEAP16[$53>>1]|0;
6606 $color2 = $54;
6607 $55 = $2;
6608 $56 = HEAP32[$55>>2]|0;
6609 $57 = (($56) + 2)|0;
6610 HEAP32[$55>>2] = $57;
6611 $58 = $color1;
6612 __Z17RGB565ToRGB8ArraytPh($58,$rgbTmpArray);
6613 $59 = $color2;
6614 $60 = ((($rgbTmpArray)) + 4|0);
6615 __Z17RGB565ToRGB8ArraytPh($59,$60);
6616 $clr1 = $rgbTmpArray;
6617 $61 = ((($rgbTmpArray)) + 4|0);
6618 $clr2 = $61;
6619 $62 = ((($rgbTmpArray)) + 8|0);
6620 $clr3 = $62;
6621 $63 = ((($rgbTmpArray)) + 12|0);
6622 $clr4 = $63;
6623 $64 = $color1;
6624 $65 = $64&65535;
6625 $66 = $color2;
6626 $67 = $66&65535;
6627 $68 = ($65|0)>($67|0);
6628 L5: do {
6629 if ($68) {
6630 $i1 = 0;
6631 while(1) {
6632 $69 = $i1;
6633 $70 = ($69|0)<(3);
6634 if (!($70)) {
6635 break L5;
6636 }
6637 $71 = $i1;
6638 $72 = $clr1;
6639 $73 = (($72) + ($71)|0);
6640 $74 = HEAP8[$73>>0]|0;
6641 $75 = $74&255;
6642 $76 = $i1;
6643 $77 = $clr2;
6644 $78 = (($77) + ($76)|0);
6645 $79 = HEAP8[$78>>0]|0;
6646 $80 = $79&255;
6647 $81 = $80<<1;
6648 $82 = (($75) + ($81))|0;
6649 $83 = (($82|0) / 3)&-1;
6650 $84 = $83&255;
6651 $85 = $i1;
6652 $86 = $clr4;
6653 $87 = (($86) + ($85)|0);
6654 HEAP8[$87>>0] = $84;
6655 $88 = $i1;
6656 $89 = $clr1;
6657 $90 = (($89) + ($88)|0);
6658 $91 = HEAP8[$90>>0]|0;
6659 $92 = $91&255;
6660 $93 = $92<<1;
6661 $94 = $i1;
6662 $95 = $clr2;
6663 $96 = (($95) + ($94)|0);
6664 $97 = HEAP8[$96>>0]|0;
6665 $98 = $97&255;
6666 $99 = (($93) + ($98))|0;
6667 $100 = (($99|0) / 3)&-1;
6668 $101 = $100&255;
6669 $102 = $i1;
6670 $103 = $clr3;
6671 $104 = (($103) + ($102)|0);
6672 HEAP8[$104>>0] = $101;
6673 $105 = $i1;
6674 $106 = (($105) + 1)|0;
6675 $i1 = $106;
6676 }
6677 } else {
6678 $i2 = 0;
6679 while(1) {
6680 $107 = $i2;
6681 $108 = ($107|0)<(3);
6682 if (!($108)) {
6683 break L5;
6684 }
6685 $109 = $i2;
6686 $110 = $clr1;
6687 $111 = (($110) + ($109)|0);
6688 $112 = HEAP8[$111>>0]|0;
6689 $113 = $112&255;
6690 $114 = $i2;
6691 $115 = $clr2;
6692 $116 = (($115) + ($114)|0);
6693 $117 = HEAP8[$116>>0]|0;
6694 $118 = $117&255;
6695 $119 = (($113) + ($118))|0;
6696 $120 = (($119|0) / 2)&-1;
6697 $121 = $120&255;
6698 $122 = $i2;
6699 $123 = $clr3;
6700 $124 = (($123) + ($122)|0);
6701 HEAP8[$124>>0] = $121;
6702 $125 = $i2;
6703 $126 = $clr4;
6704 $127 = (($126) + ($125)|0);
6705 HEAP8[$127>>0] = 0;
6706 $128 = $i2;
6707 $129 = (($128) + 1)|0;
6708 $i2 = $129;
6709 }
6710 }
6711 } while(0);
6712 $130 = $0;
6713 $131 = $2;
6714 $132 = HEAP32[$131>>2]|0;
6715 $133 = (($130) + ($132)|0);
6716 $134 = HEAP32[$133>>2]|0;
6717 $indices = $134;
6718 $135 = $2;
6719 $136 = HEAP32[$135>>2]|0;
6720 $137 = (($136) + 4)|0;
6721 HEAP32[$135>>2] = $137;
6722 $i3 = 0;
6723 while(1) {
6724 $138 = $i3;
6725 $139 = ($138>>>0)<(16);
6726 if (!($139)) {
6727 break;
6728 }
6729 $140 = $indices;
6730 $141 = $i3;
6731 $142 = $141<<1;
6732 $143 = $140 >>> $142;
6733 $144 = $143 & 3;
6734 $145 = $144&65535;
6735 $146 = $i3;
6736 $147 = (($tableIndices) + ($146<<1)|0);
6737 HEAP16[$147>>1] = $145;
6738 $148 = $i3;
6739 $149 = (($148) + 1)|0;
6740 $i3 = $149;
6741 }
6742 $y = 0;
6743 while(1) {
6744 $150 = $y;
6745 $151 = ($150|0)<(4);
6746 if (!($151)) {
6747 break;
6748 }
6749 $x = 0;
6750 while(1) {
6751 $152 = $x;
6752 $153 = ($152|0)<(4);
6753 $154 = $y;
6754 if (!($153)) {
6755 break;
6756 }
6757 $155 = $154<<2;
6758 $156 = $x;
6759 $157 = (($155) + ($156))|0;
6760 $index = $157;
6761 $158 = $index;
6762 $159 = (($tableIndices) + ($158<<1)|0);
6763 $160 = HEAP16[$159>>1]|0;
6764 $161 = $160&65535;
6765 $162 = (($rgbTmpArray) + ($161<<2)|0);
6766 $163 = HEAP32[$162>>2]|0;
6767 $color = $163;
6768 $164 = $index;
6769 $165 = (($alphaValues) + ($164<<2)|0);
6770 $166 = HEAP32[$165>>2]|0;
6771 $calpha = $166;
6772 $167 = $color;
6773 $168 = $167 & 16777215;
6774 $color = $168;
6775 $169 = $calpha;
6776 $170 = $169 << 24;
6777 $171 = $color;
6778 $172 = $171 | $170;
6779 $color = $172;
6780 $173 = $color;
6781 $174 = $index;
6782 $175 = $1;
6783 $176 = (($175) + ($174<<2)|0);
6784 HEAP32[$176>>2] = $173;
6785 $177 = $x;
6786 $178 = (($177) + 1)|0;
6787 $x = $178;
6788 }
6789 $179 = (($154) + 1)|0;
6790 $y = $179;
6791 }
6792 STACKTOP = sp;return;
6793}
6794function __Z12dxt5GetBlockPhPjRj($layerData,$colorPtr,$position) {
6795 $layerData = $layerData|0;
6796 $colorPtr = $colorPtr|0;
6797 $position = $position|0;
6798 var $0 = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0;
6799 var $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 0, $132 = 0, $133 = 0;
6800 var $134 = 0, $135 = 0, $136 = 0, $137 = 0, $138 = 0, $139 = 0, $14 = 0, $140 = 0, $141 = 0, $142 = 0, $143 = 0, $144 = 0, $145 = 0, $146 = 0, $147 = 0, $148 = 0, $149 = 0, $15 = 0, $150 = 0, $151 = 0;
6801 var $152 = 0, $153 = 0, $154 = 0, $155 = 0, $156 = 0, $157 = 0, $158 = 0, $159 = 0, $16 = 0, $160 = 0, $161 = 0, $162 = 0, $163 = 0, $164 = 0, $165 = 0, $166 = 0, $167 = 0, $168 = 0, $169 = 0, $17 = 0;
6802 var $170 = 0, $171 = 0, $172 = 0, $173 = 0, $174 = 0, $175 = 0, $176 = 0, $177 = 0, $178 = 0, $179 = 0, $18 = 0, $180 = 0, $181 = 0, $182 = 0, $183 = 0, $184 = 0, $185 = 0, $186 = 0, $187 = 0, $188 = 0;
6803 var $189 = 0, $19 = 0, $190 = 0, $191 = 0, $192 = 0, $193 = 0, $194 = 0, $195 = 0, $196 = 0, $197 = 0, $198 = 0, $199 = 0, $2 = 0, $20 = 0, $200 = 0, $201 = 0, $202 = 0, $203 = 0, $204 = 0, $205 = 0;
6804 var $206 = 0, $207 = 0, $208 = 0, $209 = 0, $21 = 0, $210 = 0, $211 = 0, $212 = 0, $213 = 0, $214 = 0, $215 = 0, $216 = 0, $217 = 0, $218 = 0, $219 = 0, $22 = 0, $220 = 0, $221 = 0, $222 = 0, $223 = 0;
6805 var $224 = 0, $225 = 0, $226 = 0, $227 = 0, $228 = 0, $229 = 0, $23 = 0, $230 = 0, $231 = 0, $232 = 0, $233 = 0, $234 = 0, $235 = 0, $236 = 0, $237 = 0, $238 = 0, $239 = 0, $24 = 0, $240 = 0, $241 = 0;
6806 var $242 = 0, $243 = 0, $244 = 0, $245 = 0, $246 = 0, $247 = 0, $248 = 0, $249 = 0, $25 = 0, $26 = 0.0, $27 = 0.0, $28 = 0, $29 = 0.0, $3 = 0, $30 = 0.0, $31 = 0, $32 = 0.0, $33 = 0.0, $34 = 0, $35 = 0.0;
6807 var $36 = 0.0, $37 = 0.0, $38 = 0.0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0.0, $49 = 0.0, $5 = 0, $50 = 0, $51 = 0.0, $52 = 0.0, $53 = 0;
6808 var $54 = 0.0, $55 = 0.0, $56 = 0, $57 = 0.0, $58 = 0.0, $59 = 0.0, $6 = 0, $60 = 0.0, $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0;
6809 var $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0, $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0, $89 = 0, $9 = 0;
6810 var $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $alpha = 0, $alpha1 = 0, $alpha2 = 0, $alphaLookup = 0, $alphaValues = 0, $clr1 = 0, $clr2 = 0, $clr3 = 0, $clr4 = 0, $color = 0;
6811 var $color1 = 0, $color2 = 0, $i = 0, $i1 = 0, $i2 = 0, $i3 = 0, $i4 = 0, $i5 = 0, $index = 0, $indices = 0, $lookupValue = 0, $lu1 = 0, $lu2 = 0, $rgbTmpArray = 0, $tableIndices = 0, $x = 0, $y = 0, dest = 0, label = 0, sp = 0;
6812 var src = 0, stop = 0;
6813 sp = STACKTOP;
6814 STACKTOP = STACKTOP + 240|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
6815 $alphaValues = sp + 224|0;
6816 $alphaLookup = sp + 80|0;
6817 $rgbTmpArray = sp + 208|0;
6818 $tableIndices = sp + 168|0;
6819 $lookupValue = sp;
6820 $0 = $layerData;
6821 $1 = $colorPtr;
6822 $2 = $position;
6823 ;HEAP8[$alphaValues>>0]=0|0;HEAP8[$alphaValues+1>>0]=0|0;HEAP8[$alphaValues+2>>0]=0|0;HEAP8[$alphaValues+3>>0]=0|0;HEAP8[$alphaValues+4>>0]=0|0;HEAP8[$alphaValues+5>>0]=0|0;HEAP8[$alphaValues+6>>0]=0|0;HEAP8[$alphaValues+7>>0]=0|0;
6824 dest=$alphaLookup; stop=dest+64|0; do { HEAP32[dest>>2]=0|0; dest=dest+4|0; } while ((dest|0) < (stop|0));
6825 dest=$rgbTmpArray; src=668; stop=dest+16|0; do { HEAP8[dest>>0]=HEAP8[src>>0]|0; dest=dest+1|0; src=src+1|0; } while ((dest|0) < (stop|0));
6826 dest=$tableIndices; stop=dest+32|0; do { HEAP16[dest>>1]=0|0; dest=dest+2|0; } while ((dest|0) < (stop|0));
6827 $3 = $2;
6828 $4 = HEAP32[$3>>2]|0;
6829 $5 = (($4) + 1)|0;
6830 HEAP32[$3>>2] = $5;
6831 $6 = $0;
6832 $7 = (($6) + ($4)|0);
6833 $8 = HEAP8[$7>>0]|0;
6834 $alpha1 = $8;
6835 $9 = $2;
6836 $10 = HEAP32[$9>>2]|0;
6837 $11 = (($10) + 1)|0;
6838 HEAP32[$9>>2] = $11;
6839 $12 = $0;
6840 $13 = (($12) + ($10)|0);
6841 $14 = HEAP8[$13>>0]|0;
6842 $alpha2 = $14;
6843 $15 = $alpha1;
6844 HEAP8[$alphaValues>>0] = $15;
6845 $16 = $alpha2;
6846 $17 = ((($alphaValues)) + 1|0);
6847 HEAP8[$17>>0] = $16;
6848 $18 = $alpha1;
6849 $19 = $18&255;
6850 $20 = $alpha2;
6851 $21 = $20&255;
6852 $22 = ($19|0)>($21|0);
6853 L1: do {
6854 if ($22) {
6855 $i = 0;
6856 while(1) {
6857 $23 = $i;
6858 $24 = ($23|0)<(6);
6859 if (!($24)) {
6860 break L1;
6861 }
6862 $25 = $i;
6863 $26 = (+($25|0));
6864 $27 = 6.0 - $26;
6865 $28 = $alpha1;
6866 $29 = (+($28&255));
6867 $30 = $27 * $29;
6868 $31 = $i;
6869 $32 = (+($31|0));
6870 $33 = 1.0 + $32;
6871 $34 = $alpha2;
6872 $35 = (+($34&255));
6873 $36 = $33 * $35;
6874 $37 = $30 + $36;
6875 $38 = $37 / 7.0;
6876 $39 = (~~(($38))&255);
6877 $40 = $i;
6878 $41 = (($40) + 2)|0;
6879 $42 = (($alphaValues) + ($41)|0);
6880 HEAP8[$42>>0] = $39;
6881 $43 = $i;
6882 $44 = (($43) + 1)|0;
6883 $i = $44;
6884 }
6885 } else {
6886 $i1 = 0;
6887 while(1) {
6888 $45 = $i1;
6889 $46 = ($45|0)<(4);
6890 if (!($46)) {
6891 break;
6892 }
6893 $47 = $i1;
6894 $48 = (+($47|0));
6895 $49 = 4.0 - $48;
6896 $50 = $alpha1;
6897 $51 = (+($50&255));
6898 $52 = $49 * $51;
6899 $53 = $i1;
6900 $54 = (+($53|0));
6901 $55 = 1.0 + $54;
6902 $56 = $alpha2;
6903 $57 = (+($56&255));
6904 $58 = $55 * $57;
6905 $59 = $52 + $58;
6906 $60 = $59 / 5.0;
6907 $61 = (~~(($60))&255);
6908 $62 = $i1;
6909 $63 = (($62) + 2)|0;
6910 $64 = (($alphaValues) + ($63)|0);
6911 HEAP8[$64>>0] = $61;
6912 $65 = $i1;
6913 $66 = (($65) + 1)|0;
6914 $i1 = $66;
6915 }
6916 $67 = ((($alphaValues)) + 6|0);
6917 HEAP8[$67>>0] = 0;
6918 $68 = ((($alphaValues)) + 7|0);
6919 HEAP8[$68>>0] = -1;
6920 }
6921 } while(0);
6922 $69 = $2;
6923 $70 = HEAP32[$69>>2]|0;
6924 $71 = $0;
6925 $72 = (($71) + ($70)|0);
6926 $73 = HEAP32[$72>>2]|0;
6927 $lu1 = $73;
6928 $74 = $2;
6929 $75 = HEAP32[$74>>2]|0;
6930 $76 = (($75) + 4)|0;
6931 HEAP32[$74>>2] = $76;
6932 $77 = $2;
6933 $78 = HEAP32[$77>>2]|0;
6934 $79 = $0;
6935 $80 = (($79) + ($78)|0);
6936 $81 = HEAP16[$80>>1]|0;
6937 $lu2 = $81;
6938 $82 = $2;
6939 $83 = HEAP32[$82>>2]|0;
6940 $84 = (($83) + 2)|0;
6941 HEAP32[$82>>2] = $84;
6942 $85 = $lu1;
6943 $86 = $lu2;
6944 $87 = $86&65535;
6945 $88 = $lookupValue;
6946 $89 = $88;
6947 HEAP32[$89>>2] = $85;
6948 $90 = (($88) + 4)|0;
6949 $91 = $90;
6950 HEAP32[$91>>2] = $87;
6951 $i2 = 0;
6952 while(1) {
6953 $92 = $i2;
6954 $93 = ($92|0)<(16);
6955 if (!($93)) {
6956 break;
6957 }
6958 $94 = $lookupValue;
6959 $95 = $94;
6960 $96 = HEAP32[$95>>2]|0;
6961 $97 = (($94) + 4)|0;
6962 $98 = $97;
6963 $99 = HEAP32[$98>>2]|0;
6964 $100 = $i2;
6965 $101 = ($100*3)|0;
6966 $102 = (_bitshift64Lshr(($96|0),($99|0),($101|0))|0);
6967 $103 = tempRet0;
6968 $104 = $102 & 7;
6969 $105 = $i2;
6970 $106 = (($alphaLookup) + ($105<<2)|0);
6971 HEAP32[$106>>2] = $104;
6972 $107 = $i2;
6973 $108 = (($107) + 1)|0;
6974 $i2 = $108;
6975 }
6976 $109 = $2;
6977 $110 = HEAP32[$109>>2]|0;
6978 $111 = $0;
6979 $112 = (($111) + ($110)|0);
6980 $113 = HEAP16[$112>>1]|0;
6981 $color1 = $113;
6982 $114 = $2;
6983 $115 = HEAP32[$114>>2]|0;
6984 $116 = (($115) + 2)|0;
6985 HEAP32[$114>>2] = $116;
6986 $117 = $2;
6987 $118 = HEAP32[$117>>2]|0;
6988 $119 = $0;
6989 $120 = (($119) + ($118)|0);
6990 $121 = HEAP16[$120>>1]|0;
6991 $color2 = $121;
6992 $122 = $2;
6993 $123 = HEAP32[$122>>2]|0;
6994 $124 = (($123) + 2)|0;
6995 HEAP32[$122>>2] = $124;
6996 $125 = $color1;
6997 __Z17RGB565ToRGB8ArraytPh($125,$rgbTmpArray);
6998 $126 = $color2;
6999 $127 = ((($rgbTmpArray)) + 4|0);
7000 __Z17RGB565ToRGB8ArraytPh($126,$127);
7001 $clr1 = $rgbTmpArray;
7002 $128 = ((($rgbTmpArray)) + 4|0);
7003 $clr2 = $128;
7004 $129 = ((($rgbTmpArray)) + 8|0);
7005 $clr3 = $129;
7006 $130 = ((($rgbTmpArray)) + 12|0);
7007 $clr4 = $130;
7008 $131 = $color1;
7009 $132 = $131&65535;
7010 $133 = $color2;
7011 $134 = $133&65535;
7012 $135 = ($132|0)>($134|0);
7013 L16: do {
7014 if ($135) {
7015 $i3 = 0;
7016 while(1) {
7017 $136 = $i3;
7018 $137 = ($136|0)<(3);
7019 if (!($137)) {
7020 break L16;
7021 }
7022 $138 = $i3;
7023 $139 = $clr1;
7024 $140 = (($139) + ($138)|0);
7025 $141 = HEAP8[$140>>0]|0;
7026 $142 = $141&255;
7027 $143 = $i3;
7028 $144 = $clr2;
7029 $145 = (($144) + ($143)|0);
7030 $146 = HEAP8[$145>>0]|0;
7031 $147 = $146&255;
7032 $148 = $147<<1;
7033 $149 = (($142) + ($148))|0;
7034 $150 = (($149|0) / 3)&-1;
7035 $151 = $150&255;
7036 $152 = $i3;
7037 $153 = $clr4;
7038 $154 = (($153) + ($152)|0);
7039 HEAP8[$154>>0] = $151;
7040 $155 = $i3;
7041 $156 = $clr1;
7042 $157 = (($156) + ($155)|0);
7043 $158 = HEAP8[$157>>0]|0;
7044 $159 = $158&255;
7045 $160 = $159<<1;
7046 $161 = $i3;
7047 $162 = $clr2;
7048 $163 = (($162) + ($161)|0);
7049 $164 = HEAP8[$163>>0]|0;
7050 $165 = $164&255;
7051 $166 = (($160) + ($165))|0;
7052 $167 = (($166|0) / 3)&-1;
7053 $168 = $167&255;
7054 $169 = $i3;
7055 $170 = $clr3;
7056 $171 = (($170) + ($169)|0);
7057 HEAP8[$171>>0] = $168;
7058 $172 = $i3;
7059 $173 = (($172) + 1)|0;
7060 $i3 = $173;
7061 }
7062 } else {
7063 $i4 = 0;
7064 while(1) {
7065 $174 = $i4;
7066 $175 = ($174|0)<(3);
7067 if (!($175)) {
7068 break L16;
7069 }
7070 $176 = $i4;
7071 $177 = $clr1;
7072 $178 = (($177) + ($176)|0);
7073 $179 = HEAP8[$178>>0]|0;
7074 $180 = $179&255;
7075 $181 = $i4;
7076 $182 = $clr2;
7077 $183 = (($182) + ($181)|0);
7078 $184 = HEAP8[$183>>0]|0;
7079 $185 = $184&255;
7080 $186 = (($180) + ($185))|0;
7081 $187 = (($186|0) / 2)&-1;
7082 $188 = $187&255;
7083 $189 = $i4;
7084 $190 = $clr3;
7085 $191 = (($190) + ($189)|0);
7086 HEAP8[$191>>0] = $188;
7087 $192 = $i4;
7088 $193 = $clr4;
7089 $194 = (($193) + ($192)|0);
7090 HEAP8[$194>>0] = 0;
7091 $195 = $i4;
7092 $196 = (($195) + 1)|0;
7093 $i4 = $196;
7094 }
7095 }
7096 } while(0);
7097 $197 = $2;
7098 $198 = HEAP32[$197>>2]|0;
7099 $199 = $0;
7100 $200 = (($199) + ($198)|0);
7101 $201 = HEAP32[$200>>2]|0;
7102 $indices = $201;
7103 $202 = $2;
7104 $203 = HEAP32[$202>>2]|0;
7105 $204 = (($203) + 4)|0;
7106 HEAP32[$202>>2] = $204;
7107 $i5 = 0;
7108 while(1) {
7109 $205 = $i5;
7110 $206 = ($205>>>0)<(16);
7111 if (!($206)) {
7112 break;
7113 }
7114 $207 = $indices;
7115 $208 = $i5;
7116 $209 = $208<<1;
7117 $210 = $207 >>> $209;
7118 $211 = $210 & 3;
7119 $212 = $211&65535;
7120 $213 = $i5;
7121 $214 = (($tableIndices) + ($213<<1)|0);
7122 HEAP16[$214>>1] = $212;
7123 $215 = $i5;
7124 $216 = (($215) + 1)|0;
7125 $i5 = $216;
7126 }
7127 $y = 0;
7128 while(1) {
7129 $217 = $y;
7130 $218 = ($217|0)<(4);
7131 if (!($218)) {
7132 break;
7133 }
7134 $x = 0;
7135 while(1) {
7136 $219 = $x;
7137 $220 = ($219|0)<(4);
7138 $221 = $y;
7139 if (!($220)) {
7140 break;
7141 }
7142 $222 = $221<<2;
7143 $223 = $x;
7144 $224 = (($222) + ($223))|0;
7145 $index = $224;
7146 $225 = $index;
7147 $226 = (($tableIndices) + ($225<<1)|0);
7148 $227 = HEAP16[$226>>1]|0;
7149 $228 = $227&65535;
7150 $229 = (($rgbTmpArray) + ($228<<2)|0);
7151 $230 = HEAP32[$229>>2]|0;
7152 $color = $230;
7153 $231 = $index;
7154 $232 = (($alphaLookup) + ($231<<2)|0);
7155 $233 = HEAP32[$232>>2]|0;
7156 $234 = (($alphaValues) + ($233)|0);
7157 $235 = HEAP8[$234>>0]|0;
7158 $236 = $235&255;
7159 $alpha = $236;
7160 $237 = $color;
7161 $238 = $237 & 16777215;
7162 $color = $238;
7163 $239 = $alpha;
7164 $240 = $239 << 24;
7165 $241 = $color;
7166 $242 = $241 | $240;
7167 $color = $242;
7168 $243 = $color;
7169 $244 = $index;
7170 $245 = $1;
7171 $246 = (($245) + ($244<<2)|0);
7172 HEAP32[$246>>2] = $243;
7173 $247 = $x;
7174 $248 = (($247) + 1)|0;
7175 $x = $248;
7176 }
7177 $249 = (($221) + 1)|0;
7178 $y = $249;
7179 }
7180 STACKTOP = sp;return;
7181}
7182function __Z17RGB565ToRGB8ArraytPh($input,$output) {
7183 $input = $input|0;
7184 $output = $output|0;
7185 var $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0;
7186 var $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $b = 0;
7187 var $g = 0, $r = 0, label = 0, sp = 0;
7188 sp = STACKTOP;
7189 STACKTOP = STACKTOP + 32|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
7190 $0 = $input;
7191 $1 = $output;
7192 $2 = $0;
7193 $3 = $2&65535;
7194 $4 = $3 & 31;
7195 $r = $4;
7196 $5 = $0;
7197 $6 = $5&65535;
7198 $7 = $6 >> 5;
7199 $8 = $7 & 63;
7200 $g = $8;
7201 $9 = $0;
7202 $10 = $9&65535;
7203 $11 = $10 >> 11;
7204 $12 = $11 & 31;
7205 $b = $12;
7206 $13 = $r;
7207 $14 = $13 << 3;
7208 $15 = $r;
7209 $16 = $15 >>> 2;
7210 $17 = $14 | $16;
7211 $r = $17;
7212 $18 = $g;
7213 $19 = $18 << 2;
7214 $20 = $g;
7215 $21 = $20 >>> 4;
7216 $22 = $19 | $21;
7217 $g = $22;
7218 $23 = $b;
7219 $24 = $23 << 3;
7220 $25 = $b;
7221 $26 = $25 >>> 2;
7222 $27 = $24 | $26;
7223 $b = $27;
7224 $28 = $r;
7225 $29 = $28&255;
7226 $30 = $1;
7227 HEAP8[$30>>0] = $29;
7228 $31 = $g;
7229 $32 = $31&255;
7230 $33 = $1;
7231 $34 = ((($33)) + 1|0);
7232 HEAP8[$34>>0] = $32;
7233 $35 = $b;
7234 $36 = $35&255;
7235 $37 = $1;
7236 $38 = ((($37)) + 2|0);
7237 HEAP8[$38>>0] = $36;
7238 STACKTOP = sp;return;
7239}
7240function ___errno_location() {
7241 var $$0 = 0, $0 = 0, $1 = 0, $2 = 0, $3 = 0, $4 = 0, label = 0, sp = 0;
7242 sp = STACKTOP;
7243 $0 = HEAP32[8>>2]|0;
7244 $1 = ($0|0)==(0|0);
7245 if ($1) {
7246 $$0 = 56;
7247 } else {
7248 $2 = (_pthread_self()|0);
7249 $3 = ((($2)) + 60|0);
7250 $4 = HEAP32[$3>>2]|0;
7251 $$0 = $4;
7252 }
7253 return ($$0|0);
7254}
7255function ___syscall_ret($r) {
7256 $r = $r|0;
7257 var $$0 = 0, $0 = 0, $1 = 0, $2 = 0, label = 0, sp = 0;
7258 sp = STACKTOP;
7259 $0 = ($r>>>0)>(4294963200);
7260 if ($0) {
7261 $1 = (0 - ($r))|0;
7262 $2 = (___errno_location()|0);
7263 HEAP32[$2>>2] = $1;
7264 $$0 = -1;
7265 } else {
7266 $$0 = $r;
7267 }
7268 return ($$0|0);
7269}
7270function _fflush($f) {
7271 $f = $f|0;
7272 var $$0 = 0, $$01 = 0, $$012 = 0, $$014 = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0;
7273 var $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $phitmp = 0, $r$0$lcssa = 0, $r$03 = 0, $r$1 = 0, label = 0, sp = 0;
7274 sp = STACKTOP;
7275 $0 = ($f|0)==(0|0);
7276 do {
7277 if ($0) {
7278 $7 = HEAP32[52>>2]|0;
7279 $8 = ($7|0)==(0|0);
7280 if ($8) {
7281 $27 = 0;
7282 } else {
7283 $9 = HEAP32[52>>2]|0;
7284 $10 = (_fflush($9)|0);
7285 $27 = $10;
7286 }
7287 ___lock(((36)|0));
7288 $$012 = HEAP32[(32)>>2]|0;
7289 $11 = ($$012|0)==(0|0);
7290 if ($11) {
7291 $r$0$lcssa = $27;
7292 } else {
7293 $$014 = $$012;$r$03 = $27;
7294 while(1) {
7295 $12 = ((($$014)) + 76|0);
7296 $13 = HEAP32[$12>>2]|0;
7297 $14 = ($13|0)>(-1);
7298 if ($14) {
7299 $15 = (___lockfile($$014)|0);
7300 $23 = $15;
7301 } else {
7302 $23 = 0;
7303 }
7304 $16 = ((($$014)) + 20|0);
7305 $17 = HEAP32[$16>>2]|0;
7306 $18 = ((($$014)) + 28|0);
7307 $19 = HEAP32[$18>>2]|0;
7308 $20 = ($17>>>0)>($19>>>0);
7309 if ($20) {
7310 $21 = (___fflush_unlocked($$014)|0);
7311 $22 = $21 | $r$03;
7312 $r$1 = $22;
7313 } else {
7314 $r$1 = $r$03;
7315 }
7316 $24 = ($23|0)==(0);
7317 if (!($24)) {
7318 ___unlockfile($$014);
7319 }
7320 $25 = ((($$014)) + 56|0);
7321 $$01 = HEAP32[$25>>2]|0;
7322 $26 = ($$01|0)==(0|0);
7323 if ($26) {
7324 $r$0$lcssa = $r$1;
7325 break;
7326 } else {
7327 $$014 = $$01;$r$03 = $r$1;
7328 }
7329 }
7330 }
7331 ___unlock(((36)|0));
7332 $$0 = $r$0$lcssa;
7333 } else {
7334 $1 = ((($f)) + 76|0);
7335 $2 = HEAP32[$1>>2]|0;
7336 $3 = ($2|0)>(-1);
7337 if (!($3)) {
7338 $4 = (___fflush_unlocked($f)|0);
7339 $$0 = $4;
7340 break;
7341 }
7342 $5 = (___lockfile($f)|0);
7343 $phitmp = ($5|0)==(0);
7344 $6 = (___fflush_unlocked($f)|0);
7345 if ($phitmp) {
7346 $$0 = $6;
7347 } else {
7348 ___unlockfile($f);
7349 $$0 = $6;
7350 }
7351 }
7352 } while(0);
7353 return ($$0|0);
7354}
7355function ___lockfile($f) {
7356 $f = $f|0;
7357 var label = 0, sp = 0;
7358 sp = STACKTOP;
7359 return 0;
7360}
7361function ___unlockfile($f) {
7362 $f = $f|0;
7363 var label = 0, sp = 0;
7364 sp = STACKTOP;
7365 return;
7366}
7367function ___stdio_close($f) {
7368 $f = $f|0;
7369 var $0 = 0, $1 = 0, $2 = 0, $3 = 0, $vararg_buffer = 0, label = 0, sp = 0;
7370 sp = STACKTOP;
7371 STACKTOP = STACKTOP + 16|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
7372 $vararg_buffer = sp;
7373 $0 = ((($f)) + 60|0);
7374 $1 = HEAP32[$0>>2]|0;
7375 HEAP32[$vararg_buffer>>2] = $1;
7376 $2 = (___syscall6(6,($vararg_buffer|0))|0);
7377 $3 = (___syscall_ret($2)|0);
7378 STACKTOP = sp;return ($3|0);
7379}
7380function ___stdio_seek($f,$off,$whence) {
7381 $f = $f|0;
7382 $off = $off|0;
7383 $whence = $whence|0;
7384 var $$pre = 0, $0 = 0, $1 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $ret = 0, $vararg_buffer = 0, $vararg_ptr1 = 0, $vararg_ptr2 = 0, $vararg_ptr3 = 0, $vararg_ptr4 = 0, label = 0, sp = 0;
7385 sp = STACKTOP;
7386 STACKTOP = STACKTOP + 32|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
7387 $vararg_buffer = sp;
7388 $ret = sp + 20|0;
7389 $0 = ((($f)) + 60|0);
7390 $1 = HEAP32[$0>>2]|0;
7391 HEAP32[$vararg_buffer>>2] = $1;
7392 $vararg_ptr1 = ((($vararg_buffer)) + 4|0);
7393 HEAP32[$vararg_ptr1>>2] = 0;
7394 $vararg_ptr2 = ((($vararg_buffer)) + 8|0);
7395 HEAP32[$vararg_ptr2>>2] = $off;
7396 $vararg_ptr3 = ((($vararg_buffer)) + 12|0);
7397 HEAP32[$vararg_ptr3>>2] = $ret;
7398 $vararg_ptr4 = ((($vararg_buffer)) + 16|0);
7399 HEAP32[$vararg_ptr4>>2] = $whence;
7400 $2 = (___syscall140(140,($vararg_buffer|0))|0);
7401 $3 = (___syscall_ret($2)|0);
7402 $4 = ($3|0)<(0);
7403 if ($4) {
7404 HEAP32[$ret>>2] = -1;
7405 $5 = -1;
7406 } else {
7407 $$pre = HEAP32[$ret>>2]|0;
7408 $5 = $$pre;
7409 }
7410 STACKTOP = sp;return ($5|0);
7411}
7412function ___stdio_write($f,$buf,$len) {
7413 $f = $f|0;
7414 $buf = $buf|0;
7415 $len = $len|0;
7416 var $$0 = 0, $$phi$trans$insert = 0, $$pre = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0;
7417 var $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0;
7418 var $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $cnt$0 = 0, $cnt$1 = 0, $iov$0 = 0, $iov$0$lcssa11 = 0, $iov$1 = 0, $iovcnt$0 = 0;
7419 var $iovcnt$0$lcssa12 = 0, $iovcnt$1 = 0, $iovs = 0, $rem$0 = 0, $vararg_buffer = 0, $vararg_buffer3 = 0, $vararg_ptr1 = 0, $vararg_ptr2 = 0, $vararg_ptr6 = 0, $vararg_ptr7 = 0, label = 0, sp = 0;
7420 sp = STACKTOP;
7421 STACKTOP = STACKTOP + 48|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
7422 $vararg_buffer3 = sp + 16|0;
7423 $vararg_buffer = sp;
7424 $iovs = sp + 32|0;
7425 $0 = ((($f)) + 28|0);
7426 $1 = HEAP32[$0>>2]|0;
7427 HEAP32[$iovs>>2] = $1;
7428 $2 = ((($iovs)) + 4|0);
7429 $3 = ((($f)) + 20|0);
7430 $4 = HEAP32[$3>>2]|0;
7431 $5 = $4;
7432 $6 = (($5) - ($1))|0;
7433 HEAP32[$2>>2] = $6;
7434 $7 = ((($iovs)) + 8|0);
7435 HEAP32[$7>>2] = $buf;
7436 $8 = ((($iovs)) + 12|0);
7437 HEAP32[$8>>2] = $len;
7438 $9 = (($6) + ($len))|0;
7439 $10 = ((($f)) + 60|0);
7440 $11 = ((($f)) + 44|0);
7441 $iov$0 = $iovs;$iovcnt$0 = 2;$rem$0 = $9;
7442 while(1) {
7443 $12 = HEAP32[8>>2]|0;
7444 $13 = ($12|0)==(0|0);
7445 if ($13) {
7446 $17 = HEAP32[$10>>2]|0;
7447 HEAP32[$vararg_buffer3>>2] = $17;
7448 $vararg_ptr6 = ((($vararg_buffer3)) + 4|0);
7449 HEAP32[$vararg_ptr6>>2] = $iov$0;
7450 $vararg_ptr7 = ((($vararg_buffer3)) + 8|0);
7451 HEAP32[$vararg_ptr7>>2] = $iovcnt$0;
7452 $18 = (___syscall146(146,($vararg_buffer3|0))|0);
7453 $19 = (___syscall_ret($18)|0);
7454 $cnt$0 = $19;
7455 } else {
7456 _pthread_cleanup_push((4|0),($f|0));
7457 $14 = HEAP32[$10>>2]|0;
7458 HEAP32[$vararg_buffer>>2] = $14;
7459 $vararg_ptr1 = ((($vararg_buffer)) + 4|0);
7460 HEAP32[$vararg_ptr1>>2] = $iov$0;
7461 $vararg_ptr2 = ((($vararg_buffer)) + 8|0);
7462 HEAP32[$vararg_ptr2>>2] = $iovcnt$0;
7463 $15 = (___syscall146(146,($vararg_buffer|0))|0);
7464 $16 = (___syscall_ret($15)|0);
7465 _pthread_cleanup_pop(0);
7466 $cnt$0 = $16;
7467 }
7468 $20 = ($rem$0|0)==($cnt$0|0);
7469 if ($20) {
7470 label = 6;
7471 break;
7472 }
7473 $27 = ($cnt$0|0)<(0);
7474 if ($27) {
7475 $iov$0$lcssa11 = $iov$0;$iovcnt$0$lcssa12 = $iovcnt$0;
7476 label = 8;
7477 break;
7478 }
7479 $35 = (($rem$0) - ($cnt$0))|0;
7480 $36 = ((($iov$0)) + 4|0);
7481 $37 = HEAP32[$36>>2]|0;
7482 $38 = ($cnt$0>>>0)>($37>>>0);
7483 if ($38) {
7484 $39 = HEAP32[$11>>2]|0;
7485 HEAP32[$0>>2] = $39;
7486 HEAP32[$3>>2] = $39;
7487 $40 = (($cnt$0) - ($37))|0;
7488 $41 = ((($iov$0)) + 8|0);
7489 $42 = (($iovcnt$0) + -1)|0;
7490 $$phi$trans$insert = ((($iov$0)) + 12|0);
7491 $$pre = HEAP32[$$phi$trans$insert>>2]|0;
7492 $50 = $$pre;$cnt$1 = $40;$iov$1 = $41;$iovcnt$1 = $42;
7493 } else {
7494 $43 = ($iovcnt$0|0)==(2);
7495 if ($43) {
7496 $44 = HEAP32[$0>>2]|0;
7497 $45 = (($44) + ($cnt$0)|0);
7498 HEAP32[$0>>2] = $45;
7499 $50 = $37;$cnt$1 = $cnt$0;$iov$1 = $iov$0;$iovcnt$1 = 2;
7500 } else {
7501 $50 = $37;$cnt$1 = $cnt$0;$iov$1 = $iov$0;$iovcnt$1 = $iovcnt$0;
7502 }
7503 }
7504 $46 = HEAP32[$iov$1>>2]|0;
7505 $47 = (($46) + ($cnt$1)|0);
7506 HEAP32[$iov$1>>2] = $47;
7507 $48 = ((($iov$1)) + 4|0);
7508 $49 = (($50) - ($cnt$1))|0;
7509 HEAP32[$48>>2] = $49;
7510 $iov$0 = $iov$1;$iovcnt$0 = $iovcnt$1;$rem$0 = $35;
7511 }
7512 if ((label|0) == 6) {
7513 $21 = HEAP32[$11>>2]|0;
7514 $22 = ((($f)) + 48|0);
7515 $23 = HEAP32[$22>>2]|0;
7516 $24 = (($21) + ($23)|0);
7517 $25 = ((($f)) + 16|0);
7518 HEAP32[$25>>2] = $24;
7519 $26 = $21;
7520 HEAP32[$0>>2] = $26;
7521 HEAP32[$3>>2] = $26;
7522 $$0 = $len;
7523 }
7524 else if ((label|0) == 8) {
7525 $28 = ((($f)) + 16|0);
7526 HEAP32[$28>>2] = 0;
7527 HEAP32[$0>>2] = 0;
7528 HEAP32[$3>>2] = 0;
7529 $29 = HEAP32[$f>>2]|0;
7530 $30 = $29 | 32;
7531 HEAP32[$f>>2] = $30;
7532 $31 = ($iovcnt$0$lcssa12|0)==(2);
7533 if ($31) {
7534 $$0 = 0;
7535 } else {
7536 $32 = ((($iov$0$lcssa11)) + 4|0);
7537 $33 = HEAP32[$32>>2]|0;
7538 $34 = (($len) - ($33))|0;
7539 $$0 = $34;
7540 }
7541 }
7542 STACKTOP = sp;return ($$0|0);
7543}
7544function ___stdout_write($f,$buf,$len) {
7545 $f = $f|0;
7546 $buf = $buf|0;
7547 $len = $len|0;
7548 var $0 = 0, $1 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $tio = 0, $vararg_buffer = 0, $vararg_ptr1 = 0, $vararg_ptr2 = 0, label = 0, sp = 0;
7549 sp = STACKTOP;
7550 STACKTOP = STACKTOP + 80|0; if ((STACKTOP|0) >= (STACK_MAX|0)) abort();
7551 $vararg_buffer = sp;
7552 $tio = sp + 12|0;
7553 $0 = ((($f)) + 36|0);
7554 HEAP32[$0>>2] = 5;
7555 $1 = HEAP32[$f>>2]|0;
7556 $2 = $1 & 64;
7557 $3 = ($2|0)==(0);
7558 if ($3) {
7559 $4 = ((($f)) + 60|0);
7560 $5 = HEAP32[$4>>2]|0;
7561 HEAP32[$vararg_buffer>>2] = $5;
7562 $vararg_ptr1 = ((($vararg_buffer)) + 4|0);
7563 HEAP32[$vararg_ptr1>>2] = 21505;
7564 $vararg_ptr2 = ((($vararg_buffer)) + 8|0);
7565 HEAP32[$vararg_ptr2>>2] = $tio;
7566 $6 = (___syscall54(54,($vararg_buffer|0))|0);
7567 $7 = ($6|0)==(0);
7568 if (!($7)) {
7569 $8 = ((($f)) + 75|0);
7570 HEAP8[$8>>0] = -1;
7571 }
7572 }
7573 $9 = (___stdio_write($f,$buf,$len)|0);
7574 STACKTOP = sp;return ($9|0);
7575}
7576function ___fflush_unlocked($f) {
7577 $f = $f|0;
7578 var $$0 = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0;
7579 var $9 = 0, label = 0, sp = 0;
7580 sp = STACKTOP;
7581 $0 = ((($f)) + 20|0);
7582 $1 = HEAP32[$0>>2]|0;
7583 $2 = ((($f)) + 28|0);
7584 $3 = HEAP32[$2>>2]|0;
7585 $4 = ($1>>>0)>($3>>>0);
7586 if ($4) {
7587 $5 = ((($f)) + 36|0);
7588 $6 = HEAP32[$5>>2]|0;
7589 (FUNCTION_TABLE_iiii[$6 & 7]($f,0,0)|0);
7590 $7 = HEAP32[$0>>2]|0;
7591 $8 = ($7|0)==(0|0);
7592 if ($8) {
7593 $$0 = -1;
7594 } else {
7595 label = 3;
7596 }
7597 } else {
7598 label = 3;
7599 }
7600 if ((label|0) == 3) {
7601 $9 = ((($f)) + 4|0);
7602 $10 = HEAP32[$9>>2]|0;
7603 $11 = ((($f)) + 8|0);
7604 $12 = HEAP32[$11>>2]|0;
7605 $13 = ($10>>>0)<($12>>>0);
7606 if ($13) {
7607 $14 = ((($f)) + 40|0);
7608 $15 = HEAP32[$14>>2]|0;
7609 $16 = $10;
7610 $17 = $12;
7611 $18 = (($16) - ($17))|0;
7612 (FUNCTION_TABLE_iiii[$15 & 7]($f,$18,1)|0);
7613 }
7614 $19 = ((($f)) + 16|0);
7615 HEAP32[$19>>2] = 0;
7616 HEAP32[$2>>2] = 0;
7617 HEAP32[$0>>2] = 0;
7618 HEAP32[$11>>2] = 0;
7619 HEAP32[$9>>2] = 0;
7620 $$0 = 0;
7621 }
7622 return ($$0|0);
7623}
7624function _cleanup526($p) {
7625 $p = $p|0;
7626 var $0 = 0, $1 = 0, $2 = 0, label = 0, sp = 0;
7627 sp = STACKTOP;
7628 $0 = ((($p)) + 68|0);
7629 $1 = HEAP32[$0>>2]|0;
7630 $2 = ($1|0)==(0);
7631 if ($2) {
7632 ___unlockfile($p);
7633 }
7634 return;
7635}
7636function _malloc($bytes) {
7637 $bytes = $bytes|0;
7638 var $$3$i = 0, $$lcssa = 0, $$lcssa211 = 0, $$lcssa215 = 0, $$lcssa216 = 0, $$lcssa217 = 0, $$lcssa219 = 0, $$lcssa222 = 0, $$lcssa224 = 0, $$lcssa226 = 0, $$lcssa228 = 0, $$lcssa230 = 0, $$lcssa232 = 0, $$pre = 0, $$pre$i = 0, $$pre$i$i = 0, $$pre$i22$i = 0, $$pre$i25 = 0, $$pre$phi$i$iZ2D = 0, $$pre$phi$i23$iZ2D = 0;
7639 var $$pre$phi$i26Z2D = 0, $$pre$phi$iZ2D = 0, $$pre$phi58$i$iZ2D = 0, $$pre$phiZ2D = 0, $$pre105 = 0, $$pre106 = 0, $$pre14$i$i = 0, $$pre43$i = 0, $$pre56$i$i = 0, $$pre57$i$i = 0, $$pre8$i = 0, $$rsize$0$i = 0, $$rsize$3$i = 0, $$sum = 0, $$sum$i$i = 0, $$sum$i$i$i = 0, $$sum$i13$i = 0, $$sum$i14$i = 0, $$sum$i17$i = 0, $$sum$i19$i = 0;
7640 var $$sum$i2334 = 0, $$sum$i32 = 0, $$sum$i35 = 0, $$sum1 = 0, $$sum1$i = 0, $$sum1$i$i = 0, $$sum1$i15$i = 0, $$sum1$i20$i = 0, $$sum1$i24 = 0, $$sum10 = 0, $$sum10$i = 0, $$sum10$i$i = 0, $$sum11$i = 0, $$sum11$i$i = 0, $$sum1112 = 0, $$sum112$i = 0, $$sum113$i = 0, $$sum114$i = 0, $$sum115$i = 0, $$sum116$i = 0;
7641 var $$sum117$i = 0, $$sum118$i = 0, $$sum119$i = 0, $$sum12$i = 0, $$sum12$i$i = 0, $$sum120$i = 0, $$sum121$i = 0, $$sum122$i = 0, $$sum123$i = 0, $$sum124$i = 0, $$sum125$i = 0, $$sum13$i = 0, $$sum13$i$i = 0, $$sum14$i$i = 0, $$sum15$i = 0, $$sum15$i$i = 0, $$sum16$i = 0, $$sum16$i$i = 0, $$sum17$i = 0, $$sum17$i$i = 0;
7642 var $$sum18$i = 0, $$sum1819$i$i = 0, $$sum2 = 0, $$sum2$i = 0, $$sum2$i$i = 0, $$sum2$i$i$i = 0, $$sum2$i16$i = 0, $$sum2$i18$i = 0, $$sum2$i21$i = 0, $$sum20$i$i = 0, $$sum21$i$i = 0, $$sum22$i$i = 0, $$sum23$i$i = 0, $$sum24$i$i = 0, $$sum25$i$i = 0, $$sum27$i$i = 0, $$sum28$i$i = 0, $$sum29$i$i = 0, $$sum3$i = 0, $$sum3$i27 = 0;
7643 var $$sum30$i$i = 0, $$sum3132$i$i = 0, $$sum34$i$i = 0, $$sum3536$i$i = 0, $$sum3738$i$i = 0, $$sum39$i$i = 0, $$sum4 = 0, $$sum4$i = 0, $$sum4$i$i = 0, $$sum4$i28 = 0, $$sum40$i$i = 0, $$sum41$i$i = 0, $$sum42$i$i = 0, $$sum5$i = 0, $$sum5$i$i = 0, $$sum56 = 0, $$sum6$i = 0, $$sum67$i$i = 0, $$sum7$i = 0, $$sum8$i = 0;
7644 var $$sum9 = 0, $$sum9$i = 0, $$sum9$i$i = 0, $$tsize$1$i = 0, $$v$0$i = 0, $0 = 0, $1 = 0, $10 = 0, $100 = 0, $1000 = 0, $1001 = 0, $1002 = 0, $1003 = 0, $1004 = 0, $1005 = 0, $1006 = 0, $1007 = 0, $1008 = 0, $1009 = 0, $101 = 0;
7645 var $1010 = 0, $1011 = 0, $1012 = 0, $1013 = 0, $1014 = 0, $1015 = 0, $1016 = 0, $1017 = 0, $1018 = 0, $1019 = 0, $102 = 0, $1020 = 0, $1021 = 0, $1022 = 0, $1023 = 0, $1024 = 0, $1025 = 0, $1026 = 0, $1027 = 0, $1028 = 0;
7646 var $1029 = 0, $103 = 0, $1030 = 0, $1031 = 0, $1032 = 0, $1033 = 0, $1034 = 0, $1035 = 0, $1036 = 0, $1037 = 0, $1038 = 0, $1039 = 0, $104 = 0, $1040 = 0, $1041 = 0, $1042 = 0, $1043 = 0, $1044 = 0, $1045 = 0, $1046 = 0;
7647 var $1047 = 0, $1048 = 0, $1049 = 0, $105 = 0, $1050 = 0, $1051 = 0, $1052 = 0, $1053 = 0, $1054 = 0, $1055 = 0, $1056 = 0, $1057 = 0, $1058 = 0, $1059 = 0, $106 = 0, $1060 = 0, $1061 = 0, $1062 = 0, $1063 = 0, $1064 = 0;
7648 var $1065 = 0, $1066 = 0, $1067 = 0, $1068 = 0, $1069 = 0, $107 = 0, $1070 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0;
7649 var $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 0, $132 = 0, $133 = 0, $134 = 0, $135 = 0, $136 = 0, $137 = 0;
7650 var $138 = 0, $139 = 0, $14 = 0, $140 = 0, $141 = 0, $142 = 0, $143 = 0, $144 = 0, $145 = 0, $146 = 0, $147 = 0, $148 = 0, $149 = 0, $15 = 0, $150 = 0, $151 = 0, $152 = 0, $153 = 0, $154 = 0, $155 = 0;
7651 var $156 = 0, $157 = 0, $158 = 0, $159 = 0, $16 = 0, $160 = 0, $161 = 0, $162 = 0, $163 = 0, $164 = 0, $165 = 0, $166 = 0, $167 = 0, $168 = 0, $169 = 0, $17 = 0, $170 = 0, $171 = 0, $172 = 0, $173 = 0;
7652 var $174 = 0, $175 = 0, $176 = 0, $177 = 0, $178 = 0, $179 = 0, $18 = 0, $180 = 0, $181 = 0, $182 = 0, $183 = 0, $184 = 0, $185 = 0, $186 = 0, $187 = 0, $188 = 0, $189 = 0, $19 = 0, $190 = 0, $191 = 0;
7653 var $192 = 0, $193 = 0, $194 = 0, $195 = 0, $196 = 0, $197 = 0, $198 = 0, $199 = 0, $2 = 0, $20 = 0, $200 = 0, $201 = 0, $202 = 0, $203 = 0, $204 = 0, $205 = 0, $206 = 0, $207 = 0, $208 = 0, $209 = 0;
7654 var $21 = 0, $210 = 0, $211 = 0, $212 = 0, $213 = 0, $214 = 0, $215 = 0, $216 = 0, $217 = 0, $218 = 0, $219 = 0, $22 = 0, $220 = 0, $221 = 0, $222 = 0, $223 = 0, $224 = 0, $225 = 0, $226 = 0, $227 = 0;
7655 var $228 = 0, $229 = 0, $23 = 0, $230 = 0, $231 = 0, $232 = 0, $233 = 0, $234 = 0, $235 = 0, $236 = 0, $237 = 0, $238 = 0, $239 = 0, $24 = 0, $240 = 0, $241 = 0, $242 = 0, $243 = 0, $244 = 0, $245 = 0;
7656 var $246 = 0, $247 = 0, $248 = 0, $249 = 0, $25 = 0, $250 = 0, $251 = 0, $252 = 0, $253 = 0, $254 = 0, $255 = 0, $256 = 0, $257 = 0, $258 = 0, $259 = 0, $26 = 0, $260 = 0, $261 = 0, $262 = 0, $263 = 0;
7657 var $264 = 0, $265 = 0, $266 = 0, $267 = 0, $268 = 0, $269 = 0, $27 = 0, $270 = 0, $271 = 0, $272 = 0, $273 = 0, $274 = 0, $275 = 0, $276 = 0, $277 = 0, $278 = 0, $279 = 0, $28 = 0, $280 = 0, $281 = 0;
7658 var $282 = 0, $283 = 0, $284 = 0, $285 = 0, $286 = 0, $287 = 0, $288 = 0, $289 = 0, $29 = 0, $290 = 0, $291 = 0, $292 = 0, $293 = 0, $294 = 0, $295 = 0, $296 = 0, $297 = 0, $298 = 0, $299 = 0, $3 = 0;
7659 var $30 = 0, $300 = 0, $301 = 0, $302 = 0, $303 = 0, $304 = 0, $305 = 0, $306 = 0, $307 = 0, $308 = 0, $309 = 0, $31 = 0, $310 = 0, $311 = 0, $312 = 0, $313 = 0, $314 = 0, $315 = 0, $316 = 0, $317 = 0;
7660 var $318 = 0, $319 = 0, $32 = 0, $320 = 0, $321 = 0, $322 = 0, $323 = 0, $324 = 0, $325 = 0, $326 = 0, $327 = 0, $328 = 0, $329 = 0, $33 = 0, $330 = 0, $331 = 0, $332 = 0, $333 = 0, $334 = 0, $335 = 0;
7661 var $336 = 0, $337 = 0, $338 = 0, $339 = 0, $34 = 0, $340 = 0, $341 = 0, $342 = 0, $343 = 0, $344 = 0, $345 = 0, $346 = 0, $347 = 0, $348 = 0, $349 = 0, $35 = 0, $350 = 0, $351 = 0, $352 = 0, $353 = 0;
7662 var $354 = 0, $355 = 0, $356 = 0, $357 = 0, $358 = 0, $359 = 0, $36 = 0, $360 = 0, $361 = 0, $362 = 0, $363 = 0, $364 = 0, $365 = 0, $366 = 0, $367 = 0, $368 = 0, $369 = 0, $37 = 0, $370 = 0, $371 = 0;
7663 var $372 = 0, $373 = 0, $374 = 0, $375 = 0, $376 = 0, $377 = 0, $378 = 0, $379 = 0, $38 = 0, $380 = 0, $381 = 0, $382 = 0, $383 = 0, $384 = 0, $385 = 0, $386 = 0, $387 = 0, $388 = 0, $389 = 0, $39 = 0;
7664 var $390 = 0, $391 = 0, $392 = 0, $393 = 0, $394 = 0, $395 = 0, $396 = 0, $397 = 0, $398 = 0, $399 = 0, $4 = 0, $40 = 0, $400 = 0, $401 = 0, $402 = 0, $403 = 0, $404 = 0, $405 = 0, $406 = 0, $407 = 0;
7665 var $408 = 0, $409 = 0, $41 = 0, $410 = 0, $411 = 0, $412 = 0, $413 = 0, $414 = 0, $415 = 0, $416 = 0, $417 = 0, $418 = 0, $419 = 0, $42 = 0, $420 = 0, $421 = 0, $422 = 0, $423 = 0, $424 = 0, $425 = 0;
7666 var $426 = 0, $427 = 0, $428 = 0, $429 = 0, $43 = 0, $430 = 0, $431 = 0, $432 = 0, $433 = 0, $434 = 0, $435 = 0, $436 = 0, $437 = 0, $438 = 0, $439 = 0, $44 = 0, $440 = 0, $441 = 0, $442 = 0, $443 = 0;
7667 var $444 = 0, $445 = 0, $446 = 0, $447 = 0, $448 = 0, $449 = 0, $45 = 0, $450 = 0, $451 = 0, $452 = 0, $453 = 0, $454 = 0, $455 = 0, $456 = 0, $457 = 0, $458 = 0, $459 = 0, $46 = 0, $460 = 0, $461 = 0;
7668 var $462 = 0, $463 = 0, $464 = 0, $465 = 0, $466 = 0, $467 = 0, $468 = 0, $469 = 0, $47 = 0, $470 = 0, $471 = 0, $472 = 0, $473 = 0, $474 = 0, $475 = 0, $476 = 0, $477 = 0, $478 = 0, $479 = 0, $48 = 0;
7669 var $480 = 0, $481 = 0, $482 = 0, $483 = 0, $484 = 0, $485 = 0, $486 = 0, $487 = 0, $488 = 0, $489 = 0, $49 = 0, $490 = 0, $491 = 0, $492 = 0, $493 = 0, $494 = 0, $495 = 0, $496 = 0, $497 = 0, $498 = 0;
7670 var $499 = 0, $5 = 0, $50 = 0, $500 = 0, $501 = 0, $502 = 0, $503 = 0, $504 = 0, $505 = 0, $506 = 0, $507 = 0, $508 = 0, $509 = 0, $51 = 0, $510 = 0, $511 = 0, $512 = 0, $513 = 0, $514 = 0, $515 = 0;
7671 var $516 = 0, $517 = 0, $518 = 0, $519 = 0, $52 = 0, $520 = 0, $521 = 0, $522 = 0, $523 = 0, $524 = 0, $525 = 0, $526 = 0, $527 = 0, $528 = 0, $529 = 0, $53 = 0, $530 = 0, $531 = 0, $532 = 0, $533 = 0;
7672 var $534 = 0, $535 = 0, $536 = 0, $537 = 0, $538 = 0, $539 = 0, $54 = 0, $540 = 0, $541 = 0, $542 = 0, $543 = 0, $544 = 0, $545 = 0, $546 = 0, $547 = 0, $548 = 0, $549 = 0, $55 = 0, $550 = 0, $551 = 0;
7673 var $552 = 0, $553 = 0, $554 = 0, $555 = 0, $556 = 0, $557 = 0, $558 = 0, $559 = 0, $56 = 0, $560 = 0, $561 = 0, $562 = 0, $563 = 0, $564 = 0, $565 = 0, $566 = 0, $567 = 0, $568 = 0, $569 = 0, $57 = 0;
7674 var $570 = 0, $571 = 0, $572 = 0, $573 = 0, $574 = 0, $575 = 0, $576 = 0, $577 = 0, $578 = 0, $579 = 0, $58 = 0, $580 = 0, $581 = 0, $582 = 0, $583 = 0, $584 = 0, $585 = 0, $586 = 0, $587 = 0, $588 = 0;
7675 var $589 = 0, $59 = 0, $590 = 0, $591 = 0, $592 = 0, $593 = 0, $594 = 0, $595 = 0, $596 = 0, $597 = 0, $598 = 0, $599 = 0, $6 = 0, $60 = 0, $600 = 0, $601 = 0, $602 = 0, $603 = 0, $604 = 0, $605 = 0;
7676 var $606 = 0, $607 = 0, $608 = 0, $609 = 0, $61 = 0, $610 = 0, $611 = 0, $612 = 0, $613 = 0, $614 = 0, $615 = 0, $616 = 0, $617 = 0, $618 = 0, $619 = 0, $62 = 0, $620 = 0, $621 = 0, $622 = 0, $623 = 0;
7677 var $624 = 0, $625 = 0, $626 = 0, $627 = 0, $628 = 0, $629 = 0, $63 = 0, $630 = 0, $631 = 0, $632 = 0, $633 = 0, $634 = 0, $635 = 0, $636 = 0, $637 = 0, $638 = 0, $639 = 0, $64 = 0, $640 = 0, $641 = 0;
7678 var $642 = 0, $643 = 0, $644 = 0, $645 = 0, $646 = 0, $647 = 0, $648 = 0, $649 = 0, $65 = 0, $650 = 0, $651 = 0, $652 = 0, $653 = 0, $654 = 0, $655 = 0, $656 = 0, $657 = 0, $658 = 0, $659 = 0, $66 = 0;
7679 var $660 = 0, $661 = 0, $662 = 0, $663 = 0, $664 = 0, $665 = 0, $666 = 0, $667 = 0, $668 = 0, $669 = 0, $67 = 0, $670 = 0, $671 = 0, $672 = 0, $673 = 0, $674 = 0, $675 = 0, $676 = 0, $677 = 0, $678 = 0;
7680 var $679 = 0, $68 = 0, $680 = 0, $681 = 0, $682 = 0, $683 = 0, $684 = 0, $685 = 0, $686 = 0, $687 = 0, $688 = 0, $689 = 0, $69 = 0, $690 = 0, $691 = 0, $692 = 0, $693 = 0, $694 = 0, $695 = 0, $696 = 0;
7681 var $697 = 0, $698 = 0, $699 = 0, $7 = 0, $70 = 0, $700 = 0, $701 = 0, $702 = 0, $703 = 0, $704 = 0, $705 = 0, $706 = 0, $707 = 0, $708 = 0, $709 = 0, $71 = 0, $710 = 0, $711 = 0, $712 = 0, $713 = 0;
7682 var $714 = 0, $715 = 0, $716 = 0, $717 = 0, $718 = 0, $719 = 0, $72 = 0, $720 = 0, $721 = 0, $722 = 0, $723 = 0, $724 = 0, $725 = 0, $726 = 0, $727 = 0, $728 = 0, $729 = 0, $73 = 0, $730 = 0, $731 = 0;
7683 var $732 = 0, $733 = 0, $734 = 0, $735 = 0, $736 = 0, $737 = 0, $738 = 0, $739 = 0, $74 = 0, $740 = 0, $741 = 0, $742 = 0, $743 = 0, $744 = 0, $745 = 0, $746 = 0, $747 = 0, $748 = 0, $749 = 0, $75 = 0;
7684 var $750 = 0, $751 = 0, $752 = 0, $753 = 0, $754 = 0, $755 = 0, $756 = 0, $757 = 0, $758 = 0, $759 = 0, $76 = 0, $760 = 0, $761 = 0, $762 = 0, $763 = 0, $764 = 0, $765 = 0, $766 = 0, $767 = 0, $768 = 0;
7685 var $769 = 0, $77 = 0, $770 = 0, $771 = 0, $772 = 0, $773 = 0, $774 = 0, $775 = 0, $776 = 0, $777 = 0, $778 = 0, $779 = 0, $78 = 0, $780 = 0, $781 = 0, $782 = 0, $783 = 0, $784 = 0, $785 = 0, $786 = 0;
7686 var $787 = 0, $788 = 0, $789 = 0, $79 = 0, $790 = 0, $791 = 0, $792 = 0, $793 = 0, $794 = 0, $795 = 0, $796 = 0, $797 = 0, $798 = 0, $799 = 0, $8 = 0, $80 = 0, $800 = 0, $801 = 0, $802 = 0, $803 = 0;
7687 var $804 = 0, $805 = 0, $806 = 0, $807 = 0, $808 = 0, $809 = 0, $81 = 0, $810 = 0, $811 = 0, $812 = 0, $813 = 0, $814 = 0, $815 = 0, $816 = 0, $817 = 0, $818 = 0, $819 = 0, $82 = 0, $820 = 0, $821 = 0;
7688 var $822 = 0, $823 = 0, $824 = 0, $825 = 0, $826 = 0, $827 = 0, $828 = 0, $829 = 0, $83 = 0, $830 = 0, $831 = 0, $832 = 0, $833 = 0, $834 = 0, $835 = 0, $836 = 0, $837 = 0, $838 = 0, $839 = 0, $84 = 0;
7689 var $840 = 0, $841 = 0, $842 = 0, $843 = 0, $844 = 0, $845 = 0, $846 = 0, $847 = 0, $848 = 0, $849 = 0, $85 = 0, $850 = 0, $851 = 0, $852 = 0, $853 = 0, $854 = 0, $855 = 0, $856 = 0, $857 = 0, $858 = 0;
7690 var $859 = 0, $86 = 0, $860 = 0, $861 = 0, $862 = 0, $863 = 0, $864 = 0, $865 = 0, $866 = 0, $867 = 0, $868 = 0, $869 = 0, $87 = 0, $870 = 0, $871 = 0, $872 = 0, $873 = 0, $874 = 0, $875 = 0, $876 = 0;
7691 var $877 = 0, $878 = 0, $879 = 0, $88 = 0, $880 = 0, $881 = 0, $882 = 0, $883 = 0, $884 = 0, $885 = 0, $886 = 0, $887 = 0, $888 = 0, $889 = 0, $89 = 0, $890 = 0, $891 = 0, $892 = 0, $893 = 0, $894 = 0;
7692 var $895 = 0, $896 = 0, $897 = 0, $898 = 0, $899 = 0, $9 = 0, $90 = 0, $900 = 0, $901 = 0, $902 = 0, $903 = 0, $904 = 0, $905 = 0, $906 = 0, $907 = 0, $908 = 0, $909 = 0, $91 = 0, $910 = 0, $911 = 0;
7693 var $912 = 0, $913 = 0, $914 = 0, $915 = 0, $916 = 0, $917 = 0, $918 = 0, $919 = 0, $92 = 0, $920 = 0, $921 = 0, $922 = 0, $923 = 0, $924 = 0, $925 = 0, $926 = 0, $927 = 0, $928 = 0, $929 = 0, $93 = 0;
7694 var $930 = 0, $931 = 0, $932 = 0, $933 = 0, $934 = 0, $935 = 0, $936 = 0, $937 = 0, $938 = 0, $939 = 0, $94 = 0, $940 = 0, $941 = 0, $942 = 0, $943 = 0, $944 = 0, $945 = 0, $946 = 0, $947 = 0, $948 = 0;
7695 var $949 = 0, $95 = 0, $950 = 0, $951 = 0, $952 = 0, $953 = 0, $954 = 0, $955 = 0, $956 = 0, $957 = 0, $958 = 0, $959 = 0, $96 = 0, $960 = 0, $961 = 0, $962 = 0, $963 = 0, $964 = 0, $965 = 0, $966 = 0;
7696 var $967 = 0, $968 = 0, $969 = 0, $97 = 0, $970 = 0, $971 = 0, $972 = 0, $973 = 0, $974 = 0, $975 = 0, $976 = 0, $977 = 0, $978 = 0, $979 = 0, $98 = 0, $980 = 0, $981 = 0, $982 = 0, $983 = 0, $984 = 0;
7697 var $985 = 0, $986 = 0, $987 = 0, $988 = 0, $989 = 0, $99 = 0, $990 = 0, $991 = 0, $992 = 0, $993 = 0, $994 = 0, $995 = 0, $996 = 0, $997 = 0, $998 = 0, $999 = 0, $F$0$i$i = 0, $F1$0$i = 0, $F4$0 = 0, $F4$0$i$i = 0;
7698 var $F5$0$i = 0, $I1$0$i$i = 0, $I7$0$i = 0, $I7$0$i$i = 0, $K12$029$i = 0, $K2$07$i$i = 0, $K8$051$i$i = 0, $R$0$i = 0, $R$0$i$i = 0, $R$0$i$i$lcssa = 0, $R$0$i$lcssa = 0, $R$0$i18 = 0, $R$0$i18$lcssa = 0, $R$1$i = 0, $R$1$i$i = 0, $R$1$i20 = 0, $RP$0$i = 0, $RP$0$i$i = 0, $RP$0$i$i$lcssa = 0, $RP$0$i$lcssa = 0;
7699 var $RP$0$i17 = 0, $RP$0$i17$lcssa = 0, $T$0$lcssa$i = 0, $T$0$lcssa$i$i = 0, $T$0$lcssa$i25$i = 0, $T$028$i = 0, $T$028$i$lcssa = 0, $T$050$i$i = 0, $T$050$i$i$lcssa = 0, $T$06$i$i = 0, $T$06$i$i$lcssa = 0, $br$0$ph$i = 0, $cond$i = 0, $cond$i$i = 0, $cond$i21 = 0, $exitcond$i$i = 0, $i$02$i$i = 0, $idx$0$i = 0, $mem$0 = 0, $nb$0 = 0;
7700 var $not$$i = 0, $not$$i$i = 0, $not$$i26$i = 0, $oldfirst$0$i$i = 0, $or$cond$i = 0, $or$cond$i30 = 0, $or$cond1$i = 0, $or$cond19$i = 0, $or$cond2$i = 0, $or$cond3$i = 0, $or$cond5$i = 0, $or$cond57$i = 0, $or$cond6$i = 0, $or$cond8$i = 0, $or$cond9$i = 0, $qsize$0$i$i = 0, $rsize$0$i = 0, $rsize$0$i$lcssa = 0, $rsize$0$i15 = 0, $rsize$1$i = 0;
7701 var $rsize$2$i = 0, $rsize$3$lcssa$i = 0, $rsize$331$i = 0, $rst$0$i = 0, $rst$1$i = 0, $sizebits$0$i = 0, $sp$0$i$i = 0, $sp$0$i$i$i = 0, $sp$084$i = 0, $sp$084$i$lcssa = 0, $sp$183$i = 0, $sp$183$i$lcssa = 0, $ssize$0$$i = 0, $ssize$0$i = 0, $ssize$1$ph$i = 0, $ssize$2$i = 0, $t$0$i = 0, $t$0$i14 = 0, $t$1$i = 0, $t$2$ph$i = 0;
7702 var $t$2$v$3$i = 0, $t$230$i = 0, $tbase$255$i = 0, $tsize$0$ph$i = 0, $tsize$0323944$i = 0, $tsize$1$i = 0, $tsize$254$i = 0, $v$0$i = 0, $v$0$i$lcssa = 0, $v$0$i16 = 0, $v$1$i = 0, $v$2$i = 0, $v$3$lcssa$i = 0, $v$3$ph$i = 0, $v$332$i = 0, label = 0, sp = 0;
7703 sp = STACKTOP;
7704 $0 = ($bytes>>>0)<(245);
7705 do {
7706 if ($0) {
7707 $1 = ($bytes>>>0)<(11);
7708 $2 = (($bytes) + 11)|0;
7709 $3 = $2 & -8;
7710 $4 = $1 ? 16 : $3;
7711 $5 = $4 >>> 3;
7712 $6 = HEAP32[172>>2]|0;
7713 $7 = $6 >>> $5;
7714 $8 = $7 & 3;
7715 $9 = ($8|0)==(0);
7716 if (!($9)) {
7717 $10 = $7 & 1;
7718 $11 = $10 ^ 1;
7719 $12 = (($11) + ($5))|0;
7720 $13 = $12 << 1;
7721 $14 = (212 + ($13<<2)|0);
7722 $$sum10 = (($13) + 2)|0;
7723 $15 = (212 + ($$sum10<<2)|0);
7724 $16 = HEAP32[$15>>2]|0;
7725 $17 = ((($16)) + 8|0);
7726 $18 = HEAP32[$17>>2]|0;
7727 $19 = ($14|0)==($18|0);
7728 do {
7729 if ($19) {
7730 $20 = 1 << $12;
7731 $21 = $20 ^ -1;
7732 $22 = $6 & $21;
7733 HEAP32[172>>2] = $22;
7734 } else {
7735 $23 = HEAP32[(188)>>2]|0;
7736 $24 = ($18>>>0)<($23>>>0);
7737 if ($24) {
7738 _abort();
7739 // unreachable;
7740 }
7741 $25 = ((($18)) + 12|0);
7742 $26 = HEAP32[$25>>2]|0;
7743 $27 = ($26|0)==($16|0);
7744 if ($27) {
7745 HEAP32[$25>>2] = $14;
7746 HEAP32[$15>>2] = $18;
7747 break;
7748 } else {
7749 _abort();
7750 // unreachable;
7751 }
7752 }
7753 } while(0);
7754 $28 = $12 << 3;
7755 $29 = $28 | 3;
7756 $30 = ((($16)) + 4|0);
7757 HEAP32[$30>>2] = $29;
7758 $$sum1112 = $28 | 4;
7759 $31 = (($16) + ($$sum1112)|0);
7760 $32 = HEAP32[$31>>2]|0;
7761 $33 = $32 | 1;
7762 HEAP32[$31>>2] = $33;
7763 $mem$0 = $17;
7764 return ($mem$0|0);
7765 }
7766 $34 = HEAP32[(180)>>2]|0;
7767 $35 = ($4>>>0)>($34>>>0);
7768 if ($35) {
7769 $36 = ($7|0)==(0);
7770 if (!($36)) {
7771 $37 = $7 << $5;
7772 $38 = 2 << $5;
7773 $39 = (0 - ($38))|0;
7774 $40 = $38 | $39;
7775 $41 = $37 & $40;
7776 $42 = (0 - ($41))|0;
7777 $43 = $41 & $42;
7778 $44 = (($43) + -1)|0;
7779 $45 = $44 >>> 12;
7780 $46 = $45 & 16;
7781 $47 = $44 >>> $46;
7782 $48 = $47 >>> 5;
7783 $49 = $48 & 8;
7784 $50 = $49 | $46;
7785 $51 = $47 >>> $49;
7786 $52 = $51 >>> 2;
7787 $53 = $52 & 4;
7788 $54 = $50 | $53;
7789 $55 = $51 >>> $53;
7790 $56 = $55 >>> 1;
7791 $57 = $56 & 2;
7792 $58 = $54 | $57;
7793 $59 = $55 >>> $57;
7794 $60 = $59 >>> 1;
7795 $61 = $60 & 1;
7796 $62 = $58 | $61;
7797 $63 = $59 >>> $61;
7798 $64 = (($62) + ($63))|0;
7799 $65 = $64 << 1;
7800 $66 = (212 + ($65<<2)|0);
7801 $$sum4 = (($65) + 2)|0;
7802 $67 = (212 + ($$sum4<<2)|0);
7803 $68 = HEAP32[$67>>2]|0;
7804 $69 = ((($68)) + 8|0);
7805 $70 = HEAP32[$69>>2]|0;
7806 $71 = ($66|0)==($70|0);
7807 do {
7808 if ($71) {
7809 $72 = 1 << $64;
7810 $73 = $72 ^ -1;
7811 $74 = $6 & $73;
7812 HEAP32[172>>2] = $74;
7813 $88 = $34;
7814 } else {
7815 $75 = HEAP32[(188)>>2]|0;
7816 $76 = ($70>>>0)<($75>>>0);
7817 if ($76) {
7818 _abort();
7819 // unreachable;
7820 }
7821 $77 = ((($70)) + 12|0);
7822 $78 = HEAP32[$77>>2]|0;
7823 $79 = ($78|0)==($68|0);
7824 if ($79) {
7825 HEAP32[$77>>2] = $66;
7826 HEAP32[$67>>2] = $70;
7827 $$pre = HEAP32[(180)>>2]|0;
7828 $88 = $$pre;
7829 break;
7830 } else {
7831 _abort();
7832 // unreachable;
7833 }
7834 }
7835 } while(0);
7836 $80 = $64 << 3;
7837 $81 = (($80) - ($4))|0;
7838 $82 = $4 | 3;
7839 $83 = ((($68)) + 4|0);
7840 HEAP32[$83>>2] = $82;
7841 $84 = (($68) + ($4)|0);
7842 $85 = $81 | 1;
7843 $$sum56 = $4 | 4;
7844 $86 = (($68) + ($$sum56)|0);
7845 HEAP32[$86>>2] = $85;
7846 $87 = (($68) + ($80)|0);
7847 HEAP32[$87>>2] = $81;
7848 $89 = ($88|0)==(0);
7849 if (!($89)) {
7850 $90 = HEAP32[(192)>>2]|0;
7851 $91 = $88 >>> 3;
7852 $92 = $91 << 1;
7853 $93 = (212 + ($92<<2)|0);
7854 $94 = HEAP32[172>>2]|0;
7855 $95 = 1 << $91;
7856 $96 = $94 & $95;
7857 $97 = ($96|0)==(0);
7858 if ($97) {
7859 $98 = $94 | $95;
7860 HEAP32[172>>2] = $98;
7861 $$pre105 = (($92) + 2)|0;
7862 $$pre106 = (212 + ($$pre105<<2)|0);
7863 $$pre$phiZ2D = $$pre106;$F4$0 = $93;
7864 } else {
7865 $$sum9 = (($92) + 2)|0;
7866 $99 = (212 + ($$sum9<<2)|0);
7867 $100 = HEAP32[$99>>2]|0;
7868 $101 = HEAP32[(188)>>2]|0;
7869 $102 = ($100>>>0)<($101>>>0);
7870 if ($102) {
7871 _abort();
7872 // unreachable;
7873 } else {
7874 $$pre$phiZ2D = $99;$F4$0 = $100;
7875 }
7876 }
7877 HEAP32[$$pre$phiZ2D>>2] = $90;
7878 $103 = ((($F4$0)) + 12|0);
7879 HEAP32[$103>>2] = $90;
7880 $104 = ((($90)) + 8|0);
7881 HEAP32[$104>>2] = $F4$0;
7882 $105 = ((($90)) + 12|0);
7883 HEAP32[$105>>2] = $93;
7884 }
7885 HEAP32[(180)>>2] = $81;
7886 HEAP32[(192)>>2] = $84;
7887 $mem$0 = $69;
7888 return ($mem$0|0);
7889 }
7890 $106 = HEAP32[(176)>>2]|0;
7891 $107 = ($106|0)==(0);
7892 if ($107) {
7893 $nb$0 = $4;
7894 } else {
7895 $108 = (0 - ($106))|0;
7896 $109 = $106 & $108;
7897 $110 = (($109) + -1)|0;
7898 $111 = $110 >>> 12;
7899 $112 = $111 & 16;
7900 $113 = $110 >>> $112;
7901 $114 = $113 >>> 5;
7902 $115 = $114 & 8;
7903 $116 = $115 | $112;
7904 $117 = $113 >>> $115;
7905 $118 = $117 >>> 2;
7906 $119 = $118 & 4;
7907 $120 = $116 | $119;
7908 $121 = $117 >>> $119;
7909 $122 = $121 >>> 1;
7910 $123 = $122 & 2;
7911 $124 = $120 | $123;
7912 $125 = $121 >>> $123;
7913 $126 = $125 >>> 1;
7914 $127 = $126 & 1;
7915 $128 = $124 | $127;
7916 $129 = $125 >>> $127;
7917 $130 = (($128) + ($129))|0;
7918 $131 = (476 + ($130<<2)|0);
7919 $132 = HEAP32[$131>>2]|0;
7920 $133 = ((($132)) + 4|0);
7921 $134 = HEAP32[$133>>2]|0;
7922 $135 = $134 & -8;
7923 $136 = (($135) - ($4))|0;
7924 $rsize$0$i = $136;$t$0$i = $132;$v$0$i = $132;
7925 while(1) {
7926 $137 = ((($t$0$i)) + 16|0);
7927 $138 = HEAP32[$137>>2]|0;
7928 $139 = ($138|0)==(0|0);
7929 if ($139) {
7930 $140 = ((($t$0$i)) + 20|0);
7931 $141 = HEAP32[$140>>2]|0;
7932 $142 = ($141|0)==(0|0);
7933 if ($142) {
7934 $rsize$0$i$lcssa = $rsize$0$i;$v$0$i$lcssa = $v$0$i;
7935 break;
7936 } else {
7937 $144 = $141;
7938 }
7939 } else {
7940 $144 = $138;
7941 }
7942 $143 = ((($144)) + 4|0);
7943 $145 = HEAP32[$143>>2]|0;
7944 $146 = $145 & -8;
7945 $147 = (($146) - ($4))|0;
7946 $148 = ($147>>>0)<($rsize$0$i>>>0);
7947 $$rsize$0$i = $148 ? $147 : $rsize$0$i;
7948 $$v$0$i = $148 ? $144 : $v$0$i;
7949 $rsize$0$i = $$rsize$0$i;$t$0$i = $144;$v$0$i = $$v$0$i;
7950 }
7951 $149 = HEAP32[(188)>>2]|0;
7952 $150 = ($v$0$i$lcssa>>>0)<($149>>>0);
7953 if ($150) {
7954 _abort();
7955 // unreachable;
7956 }
7957 $151 = (($v$0$i$lcssa) + ($4)|0);
7958 $152 = ($v$0$i$lcssa>>>0)<($151>>>0);
7959 if (!($152)) {
7960 _abort();
7961 // unreachable;
7962 }
7963 $153 = ((($v$0$i$lcssa)) + 24|0);
7964 $154 = HEAP32[$153>>2]|0;
7965 $155 = ((($v$0$i$lcssa)) + 12|0);
7966 $156 = HEAP32[$155>>2]|0;
7967 $157 = ($156|0)==($v$0$i$lcssa|0);
7968 do {
7969 if ($157) {
7970 $167 = ((($v$0$i$lcssa)) + 20|0);
7971 $168 = HEAP32[$167>>2]|0;
7972 $169 = ($168|0)==(0|0);
7973 if ($169) {
7974 $170 = ((($v$0$i$lcssa)) + 16|0);
7975 $171 = HEAP32[$170>>2]|0;
7976 $172 = ($171|0)==(0|0);
7977 if ($172) {
7978 $R$1$i = 0;
7979 break;
7980 } else {
7981 $R$0$i = $171;$RP$0$i = $170;
7982 }
7983 } else {
7984 $R$0$i = $168;$RP$0$i = $167;
7985 }
7986 while(1) {
7987 $173 = ((($R$0$i)) + 20|0);
7988 $174 = HEAP32[$173>>2]|0;
7989 $175 = ($174|0)==(0|0);
7990 if (!($175)) {
7991 $R$0$i = $174;$RP$0$i = $173;
7992 continue;
7993 }
7994 $176 = ((($R$0$i)) + 16|0);
7995 $177 = HEAP32[$176>>2]|0;
7996 $178 = ($177|0)==(0|0);
7997 if ($178) {
7998 $R$0$i$lcssa = $R$0$i;$RP$0$i$lcssa = $RP$0$i;
7999 break;
8000 } else {
8001 $R$0$i = $177;$RP$0$i = $176;
8002 }
8003 }
8004 $179 = ($RP$0$i$lcssa>>>0)<($149>>>0);
8005 if ($179) {
8006 _abort();
8007 // unreachable;
8008 } else {
8009 HEAP32[$RP$0$i$lcssa>>2] = 0;
8010 $R$1$i = $R$0$i$lcssa;
8011 break;
8012 }
8013 } else {
8014 $158 = ((($v$0$i$lcssa)) + 8|0);
8015 $159 = HEAP32[$158>>2]|0;
8016 $160 = ($159>>>0)<($149>>>0);
8017 if ($160) {
8018 _abort();
8019 // unreachable;
8020 }
8021 $161 = ((($159)) + 12|0);
8022 $162 = HEAP32[$161>>2]|0;
8023 $163 = ($162|0)==($v$0$i$lcssa|0);
8024 if (!($163)) {
8025 _abort();
8026 // unreachable;
8027 }
8028 $164 = ((($156)) + 8|0);
8029 $165 = HEAP32[$164>>2]|0;
8030 $166 = ($165|0)==($v$0$i$lcssa|0);
8031 if ($166) {
8032 HEAP32[$161>>2] = $156;
8033 HEAP32[$164>>2] = $159;
8034 $R$1$i = $156;
8035 break;
8036 } else {
8037 _abort();
8038 // unreachable;
8039 }
8040 }
8041 } while(0);
8042 $180 = ($154|0)==(0|0);
8043 do {
8044 if (!($180)) {
8045 $181 = ((($v$0$i$lcssa)) + 28|0);
8046 $182 = HEAP32[$181>>2]|0;
8047 $183 = (476 + ($182<<2)|0);
8048 $184 = HEAP32[$183>>2]|0;
8049 $185 = ($v$0$i$lcssa|0)==($184|0);
8050 if ($185) {
8051 HEAP32[$183>>2] = $R$1$i;
8052 $cond$i = ($R$1$i|0)==(0|0);
8053 if ($cond$i) {
8054 $186 = 1 << $182;
8055 $187 = $186 ^ -1;
8056 $188 = HEAP32[(176)>>2]|0;
8057 $189 = $188 & $187;
8058 HEAP32[(176)>>2] = $189;
8059 break;
8060 }
8061 } else {
8062 $190 = HEAP32[(188)>>2]|0;
8063 $191 = ($154>>>0)<($190>>>0);
8064 if ($191) {
8065 _abort();
8066 // unreachable;
8067 }
8068 $192 = ((($154)) + 16|0);
8069 $193 = HEAP32[$192>>2]|0;
8070 $194 = ($193|0)==($v$0$i$lcssa|0);
8071 if ($194) {
8072 HEAP32[$192>>2] = $R$1$i;
8073 } else {
8074 $195 = ((($154)) + 20|0);
8075 HEAP32[$195>>2] = $R$1$i;
8076 }
8077 $196 = ($R$1$i|0)==(0|0);
8078 if ($196) {
8079 break;
8080 }
8081 }
8082 $197 = HEAP32[(188)>>2]|0;
8083 $198 = ($R$1$i>>>0)<($197>>>0);
8084 if ($198) {
8085 _abort();
8086 // unreachable;
8087 }
8088 $199 = ((($R$1$i)) + 24|0);
8089 HEAP32[$199>>2] = $154;
8090 $200 = ((($v$0$i$lcssa)) + 16|0);
8091 $201 = HEAP32[$200>>2]|0;
8092 $202 = ($201|0)==(0|0);
8093 do {
8094 if (!($202)) {
8095 $203 = ($201>>>0)<($197>>>0);
8096 if ($203) {
8097 _abort();
8098 // unreachable;
8099 } else {
8100 $204 = ((($R$1$i)) + 16|0);
8101 HEAP32[$204>>2] = $201;
8102 $205 = ((($201)) + 24|0);
8103 HEAP32[$205>>2] = $R$1$i;
8104 break;
8105 }
8106 }
8107 } while(0);
8108 $206 = ((($v$0$i$lcssa)) + 20|0);
8109 $207 = HEAP32[$206>>2]|0;
8110 $208 = ($207|0)==(0|0);
8111 if (!($208)) {
8112 $209 = HEAP32[(188)>>2]|0;
8113 $210 = ($207>>>0)<($209>>>0);
8114 if ($210) {
8115 _abort();
8116 // unreachable;
8117 } else {
8118 $211 = ((($R$1$i)) + 20|0);
8119 HEAP32[$211>>2] = $207;
8120 $212 = ((($207)) + 24|0);
8121 HEAP32[$212>>2] = $R$1$i;
8122 break;
8123 }
8124 }
8125 }
8126 } while(0);
8127 $213 = ($rsize$0$i$lcssa>>>0)<(16);
8128 if ($213) {
8129 $214 = (($rsize$0$i$lcssa) + ($4))|0;
8130 $215 = $214 | 3;
8131 $216 = ((($v$0$i$lcssa)) + 4|0);
8132 HEAP32[$216>>2] = $215;
8133 $$sum4$i = (($214) + 4)|0;
8134 $217 = (($v$0$i$lcssa) + ($$sum4$i)|0);
8135 $218 = HEAP32[$217>>2]|0;
8136 $219 = $218 | 1;
8137 HEAP32[$217>>2] = $219;
8138 } else {
8139 $220 = $4 | 3;
8140 $221 = ((($v$0$i$lcssa)) + 4|0);
8141 HEAP32[$221>>2] = $220;
8142 $222 = $rsize$0$i$lcssa | 1;
8143 $$sum$i35 = $4 | 4;
8144 $223 = (($v$0$i$lcssa) + ($$sum$i35)|0);
8145 HEAP32[$223>>2] = $222;
8146 $$sum1$i = (($rsize$0$i$lcssa) + ($4))|0;
8147 $224 = (($v$0$i$lcssa) + ($$sum1$i)|0);
8148 HEAP32[$224>>2] = $rsize$0$i$lcssa;
8149 $225 = HEAP32[(180)>>2]|0;
8150 $226 = ($225|0)==(0);
8151 if (!($226)) {
8152 $227 = HEAP32[(192)>>2]|0;
8153 $228 = $225 >>> 3;
8154 $229 = $228 << 1;
8155 $230 = (212 + ($229<<2)|0);
8156 $231 = HEAP32[172>>2]|0;
8157 $232 = 1 << $228;
8158 $233 = $231 & $232;
8159 $234 = ($233|0)==(0);
8160 if ($234) {
8161 $235 = $231 | $232;
8162 HEAP32[172>>2] = $235;
8163 $$pre$i = (($229) + 2)|0;
8164 $$pre8$i = (212 + ($$pre$i<<2)|0);
8165 $$pre$phi$iZ2D = $$pre8$i;$F1$0$i = $230;
8166 } else {
8167 $$sum3$i = (($229) + 2)|0;
8168 $236 = (212 + ($$sum3$i<<2)|0);
8169 $237 = HEAP32[$236>>2]|0;
8170 $238 = HEAP32[(188)>>2]|0;
8171 $239 = ($237>>>0)<($238>>>0);
8172 if ($239) {
8173 _abort();
8174 // unreachable;
8175 } else {
8176 $$pre$phi$iZ2D = $236;$F1$0$i = $237;
8177 }
8178 }
8179 HEAP32[$$pre$phi$iZ2D>>2] = $227;
8180 $240 = ((($F1$0$i)) + 12|0);
8181 HEAP32[$240>>2] = $227;
8182 $241 = ((($227)) + 8|0);
8183 HEAP32[$241>>2] = $F1$0$i;
8184 $242 = ((($227)) + 12|0);
8185 HEAP32[$242>>2] = $230;
8186 }
8187 HEAP32[(180)>>2] = $rsize$0$i$lcssa;
8188 HEAP32[(192)>>2] = $151;
8189 }
8190 $243 = ((($v$0$i$lcssa)) + 8|0);
8191 $mem$0 = $243;
8192 return ($mem$0|0);
8193 }
8194 } else {
8195 $nb$0 = $4;
8196 }
8197 } else {
8198 $244 = ($bytes>>>0)>(4294967231);
8199 if ($244) {
8200 $nb$0 = -1;
8201 } else {
8202 $245 = (($bytes) + 11)|0;
8203 $246 = $245 & -8;
8204 $247 = HEAP32[(176)>>2]|0;
8205 $248 = ($247|0)==(0);
8206 if ($248) {
8207 $nb$0 = $246;
8208 } else {
8209 $249 = (0 - ($246))|0;
8210 $250 = $245 >>> 8;
8211 $251 = ($250|0)==(0);
8212 if ($251) {
8213 $idx$0$i = 0;
8214 } else {
8215 $252 = ($246>>>0)>(16777215);
8216 if ($252) {
8217 $idx$0$i = 31;
8218 } else {
8219 $253 = (($250) + 1048320)|0;
8220 $254 = $253 >>> 16;
8221 $255 = $254 & 8;
8222 $256 = $250 << $255;
8223 $257 = (($256) + 520192)|0;
8224 $258 = $257 >>> 16;
8225 $259 = $258 & 4;
8226 $260 = $259 | $255;
8227 $261 = $256 << $259;
8228 $262 = (($261) + 245760)|0;
8229 $263 = $262 >>> 16;
8230 $264 = $263 & 2;
8231 $265 = $260 | $264;
8232 $266 = (14 - ($265))|0;
8233 $267 = $261 << $264;
8234 $268 = $267 >>> 15;
8235 $269 = (($266) + ($268))|0;
8236 $270 = $269 << 1;
8237 $271 = (($269) + 7)|0;
8238 $272 = $246 >>> $271;
8239 $273 = $272 & 1;
8240 $274 = $273 | $270;
8241 $idx$0$i = $274;
8242 }
8243 }
8244 $275 = (476 + ($idx$0$i<<2)|0);
8245 $276 = HEAP32[$275>>2]|0;
8246 $277 = ($276|0)==(0|0);
8247 L123: do {
8248 if ($277) {
8249 $rsize$2$i = $249;$t$1$i = 0;$v$2$i = 0;
8250 label = 86;
8251 } else {
8252 $278 = ($idx$0$i|0)==(31);
8253 $279 = $idx$0$i >>> 1;
8254 $280 = (25 - ($279))|0;
8255 $281 = $278 ? 0 : $280;
8256 $282 = $246 << $281;
8257 $rsize$0$i15 = $249;$rst$0$i = 0;$sizebits$0$i = $282;$t$0$i14 = $276;$v$0$i16 = 0;
8258 while(1) {
8259 $283 = ((($t$0$i14)) + 4|0);
8260 $284 = HEAP32[$283>>2]|0;
8261 $285 = $284 & -8;
8262 $286 = (($285) - ($246))|0;
8263 $287 = ($286>>>0)<($rsize$0$i15>>>0);
8264 if ($287) {
8265 $288 = ($285|0)==($246|0);
8266 if ($288) {
8267 $rsize$331$i = $286;$t$230$i = $t$0$i14;$v$332$i = $t$0$i14;
8268 label = 90;
8269 break L123;
8270 } else {
8271 $rsize$1$i = $286;$v$1$i = $t$0$i14;
8272 }
8273 } else {
8274 $rsize$1$i = $rsize$0$i15;$v$1$i = $v$0$i16;
8275 }
8276 $289 = ((($t$0$i14)) + 20|0);
8277 $290 = HEAP32[$289>>2]|0;
8278 $291 = $sizebits$0$i >>> 31;
8279 $292 = (((($t$0$i14)) + 16|0) + ($291<<2)|0);
8280 $293 = HEAP32[$292>>2]|0;
8281 $294 = ($290|0)==(0|0);
8282 $295 = ($290|0)==($293|0);
8283 $or$cond19$i = $294 | $295;
8284 $rst$1$i = $or$cond19$i ? $rst$0$i : $290;
8285 $296 = ($293|0)==(0|0);
8286 $297 = $sizebits$0$i << 1;
8287 if ($296) {
8288 $rsize$2$i = $rsize$1$i;$t$1$i = $rst$1$i;$v$2$i = $v$1$i;
8289 label = 86;
8290 break;
8291 } else {
8292 $rsize$0$i15 = $rsize$1$i;$rst$0$i = $rst$1$i;$sizebits$0$i = $297;$t$0$i14 = $293;$v$0$i16 = $v$1$i;
8293 }
8294 }
8295 }
8296 } while(0);
8297 if ((label|0) == 86) {
8298 $298 = ($t$1$i|0)==(0|0);
8299 $299 = ($v$2$i|0)==(0|0);
8300 $or$cond$i = $298 & $299;
8301 if ($or$cond$i) {
8302 $300 = 2 << $idx$0$i;
8303 $301 = (0 - ($300))|0;
8304 $302 = $300 | $301;
8305 $303 = $247 & $302;
8306 $304 = ($303|0)==(0);
8307 if ($304) {
8308 $nb$0 = $246;
8309 break;
8310 }
8311 $305 = (0 - ($303))|0;
8312 $306 = $303 & $305;
8313 $307 = (($306) + -1)|0;
8314 $308 = $307 >>> 12;
8315 $309 = $308 & 16;
8316 $310 = $307 >>> $309;
8317 $311 = $310 >>> 5;
8318 $312 = $311 & 8;
8319 $313 = $312 | $309;
8320 $314 = $310 >>> $312;
8321 $315 = $314 >>> 2;
8322 $316 = $315 & 4;
8323 $317 = $313 | $316;
8324 $318 = $314 >>> $316;
8325 $319 = $318 >>> 1;
8326 $320 = $319 & 2;
8327 $321 = $317 | $320;
8328 $322 = $318 >>> $320;
8329 $323 = $322 >>> 1;
8330 $324 = $323 & 1;
8331 $325 = $321 | $324;
8332 $326 = $322 >>> $324;
8333 $327 = (($325) + ($326))|0;
8334 $328 = (476 + ($327<<2)|0);
8335 $329 = HEAP32[$328>>2]|0;
8336 $t$2$ph$i = $329;$v$3$ph$i = 0;
8337 } else {
8338 $t$2$ph$i = $t$1$i;$v$3$ph$i = $v$2$i;
8339 }
8340 $330 = ($t$2$ph$i|0)==(0|0);
8341 if ($330) {
8342 $rsize$3$lcssa$i = $rsize$2$i;$v$3$lcssa$i = $v$3$ph$i;
8343 } else {
8344 $rsize$331$i = $rsize$2$i;$t$230$i = $t$2$ph$i;$v$332$i = $v$3$ph$i;
8345 label = 90;
8346 }
8347 }
8348 if ((label|0) == 90) {
8349 while(1) {
8350 label = 0;
8351 $331 = ((($t$230$i)) + 4|0);
8352 $332 = HEAP32[$331>>2]|0;
8353 $333 = $332 & -8;
8354 $334 = (($333) - ($246))|0;
8355 $335 = ($334>>>0)<($rsize$331$i>>>0);
8356 $$rsize$3$i = $335 ? $334 : $rsize$331$i;
8357 $t$2$v$3$i = $335 ? $t$230$i : $v$332$i;
8358 $336 = ((($t$230$i)) + 16|0);
8359 $337 = HEAP32[$336>>2]|0;
8360 $338 = ($337|0)==(0|0);
8361 if (!($338)) {
8362 $rsize$331$i = $$rsize$3$i;$t$230$i = $337;$v$332$i = $t$2$v$3$i;
8363 label = 90;
8364 continue;
8365 }
8366 $339 = ((($t$230$i)) + 20|0);
8367 $340 = HEAP32[$339>>2]|0;
8368 $341 = ($340|0)==(0|0);
8369 if ($341) {
8370 $rsize$3$lcssa$i = $$rsize$3$i;$v$3$lcssa$i = $t$2$v$3$i;
8371 break;
8372 } else {
8373 $rsize$331$i = $$rsize$3$i;$t$230$i = $340;$v$332$i = $t$2$v$3$i;
8374 label = 90;
8375 }
8376 }
8377 }
8378 $342 = ($v$3$lcssa$i|0)==(0|0);
8379 if ($342) {
8380 $nb$0 = $246;
8381 } else {
8382 $343 = HEAP32[(180)>>2]|0;
8383 $344 = (($343) - ($246))|0;
8384 $345 = ($rsize$3$lcssa$i>>>0)<($344>>>0);
8385 if ($345) {
8386 $346 = HEAP32[(188)>>2]|0;
8387 $347 = ($v$3$lcssa$i>>>0)<($346>>>0);
8388 if ($347) {
8389 _abort();
8390 // unreachable;
8391 }
8392 $348 = (($v$3$lcssa$i) + ($246)|0);
8393 $349 = ($v$3$lcssa$i>>>0)<($348>>>0);
8394 if (!($349)) {
8395 _abort();
8396 // unreachable;
8397 }
8398 $350 = ((($v$3$lcssa$i)) + 24|0);
8399 $351 = HEAP32[$350>>2]|0;
8400 $352 = ((($v$3$lcssa$i)) + 12|0);
8401 $353 = HEAP32[$352>>2]|0;
8402 $354 = ($353|0)==($v$3$lcssa$i|0);
8403 do {
8404 if ($354) {
8405 $364 = ((($v$3$lcssa$i)) + 20|0);
8406 $365 = HEAP32[$364>>2]|0;
8407 $366 = ($365|0)==(0|0);
8408 if ($366) {
8409 $367 = ((($v$3$lcssa$i)) + 16|0);
8410 $368 = HEAP32[$367>>2]|0;
8411 $369 = ($368|0)==(0|0);
8412 if ($369) {
8413 $R$1$i20 = 0;
8414 break;
8415 } else {
8416 $R$0$i18 = $368;$RP$0$i17 = $367;
8417 }
8418 } else {
8419 $R$0$i18 = $365;$RP$0$i17 = $364;
8420 }
8421 while(1) {
8422 $370 = ((($R$0$i18)) + 20|0);
8423 $371 = HEAP32[$370>>2]|0;
8424 $372 = ($371|0)==(0|0);
8425 if (!($372)) {
8426 $R$0$i18 = $371;$RP$0$i17 = $370;
8427 continue;
8428 }
8429 $373 = ((($R$0$i18)) + 16|0);
8430 $374 = HEAP32[$373>>2]|0;
8431 $375 = ($374|0)==(0|0);
8432 if ($375) {
8433 $R$0$i18$lcssa = $R$0$i18;$RP$0$i17$lcssa = $RP$0$i17;
8434 break;
8435 } else {
8436 $R$0$i18 = $374;$RP$0$i17 = $373;
8437 }
8438 }
8439 $376 = ($RP$0$i17$lcssa>>>0)<($346>>>0);
8440 if ($376) {
8441 _abort();
8442 // unreachable;
8443 } else {
8444 HEAP32[$RP$0$i17$lcssa>>2] = 0;
8445 $R$1$i20 = $R$0$i18$lcssa;
8446 break;
8447 }
8448 } else {
8449 $355 = ((($v$3$lcssa$i)) + 8|0);
8450 $356 = HEAP32[$355>>2]|0;
8451 $357 = ($356>>>0)<($346>>>0);
8452 if ($357) {
8453 _abort();
8454 // unreachable;
8455 }
8456 $358 = ((($356)) + 12|0);
8457 $359 = HEAP32[$358>>2]|0;
8458 $360 = ($359|0)==($v$3$lcssa$i|0);
8459 if (!($360)) {
8460 _abort();
8461 // unreachable;
8462 }
8463 $361 = ((($353)) + 8|0);
8464 $362 = HEAP32[$361>>2]|0;
8465 $363 = ($362|0)==($v$3$lcssa$i|0);
8466 if ($363) {
8467 HEAP32[$358>>2] = $353;
8468 HEAP32[$361>>2] = $356;
8469 $R$1$i20 = $353;
8470 break;
8471 } else {
8472 _abort();
8473 // unreachable;
8474 }
8475 }
8476 } while(0);
8477 $377 = ($351|0)==(0|0);
8478 do {
8479 if (!($377)) {
8480 $378 = ((($v$3$lcssa$i)) + 28|0);
8481 $379 = HEAP32[$378>>2]|0;
8482 $380 = (476 + ($379<<2)|0);
8483 $381 = HEAP32[$380>>2]|0;
8484 $382 = ($v$3$lcssa$i|0)==($381|0);
8485 if ($382) {
8486 HEAP32[$380>>2] = $R$1$i20;
8487 $cond$i21 = ($R$1$i20|0)==(0|0);
8488 if ($cond$i21) {
8489 $383 = 1 << $379;
8490 $384 = $383 ^ -1;
8491 $385 = HEAP32[(176)>>2]|0;
8492 $386 = $385 & $384;
8493 HEAP32[(176)>>2] = $386;
8494 break;
8495 }
8496 } else {
8497 $387 = HEAP32[(188)>>2]|0;
8498 $388 = ($351>>>0)<($387>>>0);
8499 if ($388) {
8500 _abort();
8501 // unreachable;
8502 }
8503 $389 = ((($351)) + 16|0);
8504 $390 = HEAP32[$389>>2]|0;
8505 $391 = ($390|0)==($v$3$lcssa$i|0);
8506 if ($391) {
8507 HEAP32[$389>>2] = $R$1$i20;
8508 } else {
8509 $392 = ((($351)) + 20|0);
8510 HEAP32[$392>>2] = $R$1$i20;
8511 }
8512 $393 = ($R$1$i20|0)==(0|0);
8513 if ($393) {
8514 break;
8515 }
8516 }
8517 $394 = HEAP32[(188)>>2]|0;
8518 $395 = ($R$1$i20>>>0)<($394>>>0);
8519 if ($395) {
8520 _abort();
8521 // unreachable;
8522 }
8523 $396 = ((($R$1$i20)) + 24|0);
8524 HEAP32[$396>>2] = $351;
8525 $397 = ((($v$3$lcssa$i)) + 16|0);
8526 $398 = HEAP32[$397>>2]|0;
8527 $399 = ($398|0)==(0|0);
8528 do {
8529 if (!($399)) {
8530 $400 = ($398>>>0)<($394>>>0);
8531 if ($400) {
8532 _abort();
8533 // unreachable;
8534 } else {
8535 $401 = ((($R$1$i20)) + 16|0);
8536 HEAP32[$401>>2] = $398;
8537 $402 = ((($398)) + 24|0);
8538 HEAP32[$402>>2] = $R$1$i20;
8539 break;
8540 }
8541 }
8542 } while(0);
8543 $403 = ((($v$3$lcssa$i)) + 20|0);
8544 $404 = HEAP32[$403>>2]|0;
8545 $405 = ($404|0)==(0|0);
8546 if (!($405)) {
8547 $406 = HEAP32[(188)>>2]|0;
8548 $407 = ($404>>>0)<($406>>>0);
8549 if ($407) {
8550 _abort();
8551 // unreachable;
8552 } else {
8553 $408 = ((($R$1$i20)) + 20|0);
8554 HEAP32[$408>>2] = $404;
8555 $409 = ((($404)) + 24|0);
8556 HEAP32[$409>>2] = $R$1$i20;
8557 break;
8558 }
8559 }
8560 }
8561 } while(0);
8562 $410 = ($rsize$3$lcssa$i>>>0)<(16);
8563 L199: do {
8564 if ($410) {
8565 $411 = (($rsize$3$lcssa$i) + ($246))|0;
8566 $412 = $411 | 3;
8567 $413 = ((($v$3$lcssa$i)) + 4|0);
8568 HEAP32[$413>>2] = $412;
8569 $$sum18$i = (($411) + 4)|0;
8570 $414 = (($v$3$lcssa$i) + ($$sum18$i)|0);
8571 $415 = HEAP32[$414>>2]|0;
8572 $416 = $415 | 1;
8573 HEAP32[$414>>2] = $416;
8574 } else {
8575 $417 = $246 | 3;
8576 $418 = ((($v$3$lcssa$i)) + 4|0);
8577 HEAP32[$418>>2] = $417;
8578 $419 = $rsize$3$lcssa$i | 1;
8579 $$sum$i2334 = $246 | 4;
8580 $420 = (($v$3$lcssa$i) + ($$sum$i2334)|0);
8581 HEAP32[$420>>2] = $419;
8582 $$sum1$i24 = (($rsize$3$lcssa$i) + ($246))|0;
8583 $421 = (($v$3$lcssa$i) + ($$sum1$i24)|0);
8584 HEAP32[$421>>2] = $rsize$3$lcssa$i;
8585 $422 = $rsize$3$lcssa$i >>> 3;
8586 $423 = ($rsize$3$lcssa$i>>>0)<(256);
8587 if ($423) {
8588 $424 = $422 << 1;
8589 $425 = (212 + ($424<<2)|0);
8590 $426 = HEAP32[172>>2]|0;
8591 $427 = 1 << $422;
8592 $428 = $426 & $427;
8593 $429 = ($428|0)==(0);
8594 if ($429) {
8595 $430 = $426 | $427;
8596 HEAP32[172>>2] = $430;
8597 $$pre$i25 = (($424) + 2)|0;
8598 $$pre43$i = (212 + ($$pre$i25<<2)|0);
8599 $$pre$phi$i26Z2D = $$pre43$i;$F5$0$i = $425;
8600 } else {
8601 $$sum17$i = (($424) + 2)|0;
8602 $431 = (212 + ($$sum17$i<<2)|0);
8603 $432 = HEAP32[$431>>2]|0;
8604 $433 = HEAP32[(188)>>2]|0;
8605 $434 = ($432>>>0)<($433>>>0);
8606 if ($434) {
8607 _abort();
8608 // unreachable;
8609 } else {
8610 $$pre$phi$i26Z2D = $431;$F5$0$i = $432;
8611 }
8612 }
8613 HEAP32[$$pre$phi$i26Z2D>>2] = $348;
8614 $435 = ((($F5$0$i)) + 12|0);
8615 HEAP32[$435>>2] = $348;
8616 $$sum15$i = (($246) + 8)|0;
8617 $436 = (($v$3$lcssa$i) + ($$sum15$i)|0);
8618 HEAP32[$436>>2] = $F5$0$i;
8619 $$sum16$i = (($246) + 12)|0;
8620 $437 = (($v$3$lcssa$i) + ($$sum16$i)|0);
8621 HEAP32[$437>>2] = $425;
8622 break;
8623 }
8624 $438 = $rsize$3$lcssa$i >>> 8;
8625 $439 = ($438|0)==(0);
8626 if ($439) {
8627 $I7$0$i = 0;
8628 } else {
8629 $440 = ($rsize$3$lcssa$i>>>0)>(16777215);
8630 if ($440) {
8631 $I7$0$i = 31;
8632 } else {
8633 $441 = (($438) + 1048320)|0;
8634 $442 = $441 >>> 16;
8635 $443 = $442 & 8;
8636 $444 = $438 << $443;
8637 $445 = (($444) + 520192)|0;
8638 $446 = $445 >>> 16;
8639 $447 = $446 & 4;
8640 $448 = $447 | $443;
8641 $449 = $444 << $447;
8642 $450 = (($449) + 245760)|0;
8643 $451 = $450 >>> 16;
8644 $452 = $451 & 2;
8645 $453 = $448 | $452;
8646 $454 = (14 - ($453))|0;
8647 $455 = $449 << $452;
8648 $456 = $455 >>> 15;
8649 $457 = (($454) + ($456))|0;
8650 $458 = $457 << 1;
8651 $459 = (($457) + 7)|0;
8652 $460 = $rsize$3$lcssa$i >>> $459;
8653 $461 = $460 & 1;
8654 $462 = $461 | $458;
8655 $I7$0$i = $462;
8656 }
8657 }
8658 $463 = (476 + ($I7$0$i<<2)|0);
8659 $$sum2$i = (($246) + 28)|0;
8660 $464 = (($v$3$lcssa$i) + ($$sum2$i)|0);
8661 HEAP32[$464>>2] = $I7$0$i;
8662 $$sum3$i27 = (($246) + 16)|0;
8663 $465 = (($v$3$lcssa$i) + ($$sum3$i27)|0);
8664 $$sum4$i28 = (($246) + 20)|0;
8665 $466 = (($v$3$lcssa$i) + ($$sum4$i28)|0);
8666 HEAP32[$466>>2] = 0;
8667 HEAP32[$465>>2] = 0;
8668 $467 = HEAP32[(176)>>2]|0;
8669 $468 = 1 << $I7$0$i;
8670 $469 = $467 & $468;
8671 $470 = ($469|0)==(0);
8672 if ($470) {
8673 $471 = $467 | $468;
8674 HEAP32[(176)>>2] = $471;
8675 HEAP32[$463>>2] = $348;
8676 $$sum5$i = (($246) + 24)|0;
8677 $472 = (($v$3$lcssa$i) + ($$sum5$i)|0);
8678 HEAP32[$472>>2] = $463;
8679 $$sum6$i = (($246) + 12)|0;
8680 $473 = (($v$3$lcssa$i) + ($$sum6$i)|0);
8681 HEAP32[$473>>2] = $348;
8682 $$sum7$i = (($246) + 8)|0;
8683 $474 = (($v$3$lcssa$i) + ($$sum7$i)|0);
8684 HEAP32[$474>>2] = $348;
8685 break;
8686 }
8687 $475 = HEAP32[$463>>2]|0;
8688 $476 = ((($475)) + 4|0);
8689 $477 = HEAP32[$476>>2]|0;
8690 $478 = $477 & -8;
8691 $479 = ($478|0)==($rsize$3$lcssa$i|0);
8692 L217: do {
8693 if ($479) {
8694 $T$0$lcssa$i = $475;
8695 } else {
8696 $480 = ($I7$0$i|0)==(31);
8697 $481 = $I7$0$i >>> 1;
8698 $482 = (25 - ($481))|0;
8699 $483 = $480 ? 0 : $482;
8700 $484 = $rsize$3$lcssa$i << $483;
8701 $K12$029$i = $484;$T$028$i = $475;
8702 while(1) {
8703 $491 = $K12$029$i >>> 31;
8704 $492 = (((($T$028$i)) + 16|0) + ($491<<2)|0);
8705 $487 = HEAP32[$492>>2]|0;
8706 $493 = ($487|0)==(0|0);
8707 if ($493) {
8708 $$lcssa232 = $492;$T$028$i$lcssa = $T$028$i;
8709 break;
8710 }
8711 $485 = $K12$029$i << 1;
8712 $486 = ((($487)) + 4|0);
8713 $488 = HEAP32[$486>>2]|0;
8714 $489 = $488 & -8;
8715 $490 = ($489|0)==($rsize$3$lcssa$i|0);
8716 if ($490) {
8717 $T$0$lcssa$i = $487;
8718 break L217;
8719 } else {
8720 $K12$029$i = $485;$T$028$i = $487;
8721 }
8722 }
8723 $494 = HEAP32[(188)>>2]|0;
8724 $495 = ($$lcssa232>>>0)<($494>>>0);
8725 if ($495) {
8726 _abort();
8727 // unreachable;
8728 } else {
8729 HEAP32[$$lcssa232>>2] = $348;
8730 $$sum11$i = (($246) + 24)|0;
8731 $496 = (($v$3$lcssa$i) + ($$sum11$i)|0);
8732 HEAP32[$496>>2] = $T$028$i$lcssa;
8733 $$sum12$i = (($246) + 12)|0;
8734 $497 = (($v$3$lcssa$i) + ($$sum12$i)|0);
8735 HEAP32[$497>>2] = $348;
8736 $$sum13$i = (($246) + 8)|0;
8737 $498 = (($v$3$lcssa$i) + ($$sum13$i)|0);
8738 HEAP32[$498>>2] = $348;
8739 break L199;
8740 }
8741 }
8742 } while(0);
8743 $499 = ((($T$0$lcssa$i)) + 8|0);
8744 $500 = HEAP32[$499>>2]|0;
8745 $501 = HEAP32[(188)>>2]|0;
8746 $502 = ($500>>>0)>=($501>>>0);
8747 $not$$i = ($T$0$lcssa$i>>>0)>=($501>>>0);
8748 $503 = $502 & $not$$i;
8749 if ($503) {
8750 $504 = ((($500)) + 12|0);
8751 HEAP32[$504>>2] = $348;
8752 HEAP32[$499>>2] = $348;
8753 $$sum8$i = (($246) + 8)|0;
8754 $505 = (($v$3$lcssa$i) + ($$sum8$i)|0);
8755 HEAP32[$505>>2] = $500;
8756 $$sum9$i = (($246) + 12)|0;
8757 $506 = (($v$3$lcssa$i) + ($$sum9$i)|0);
8758 HEAP32[$506>>2] = $T$0$lcssa$i;
8759 $$sum10$i = (($246) + 24)|0;
8760 $507 = (($v$3$lcssa$i) + ($$sum10$i)|0);
8761 HEAP32[$507>>2] = 0;
8762 break;
8763 } else {
8764 _abort();
8765 // unreachable;
8766 }
8767 }
8768 } while(0);
8769 $508 = ((($v$3$lcssa$i)) + 8|0);
8770 $mem$0 = $508;
8771 return ($mem$0|0);
8772 } else {
8773 $nb$0 = $246;
8774 }
8775 }
8776 }
8777 }
8778 }
8779 } while(0);
8780 $509 = HEAP32[(180)>>2]|0;
8781 $510 = ($509>>>0)<($nb$0>>>0);
8782 if (!($510)) {
8783 $511 = (($509) - ($nb$0))|0;
8784 $512 = HEAP32[(192)>>2]|0;
8785 $513 = ($511>>>0)>(15);
8786 if ($513) {
8787 $514 = (($512) + ($nb$0)|0);
8788 HEAP32[(192)>>2] = $514;
8789 HEAP32[(180)>>2] = $511;
8790 $515 = $511 | 1;
8791 $$sum2 = (($nb$0) + 4)|0;
8792 $516 = (($512) + ($$sum2)|0);
8793 HEAP32[$516>>2] = $515;
8794 $517 = (($512) + ($509)|0);
8795 HEAP32[$517>>2] = $511;
8796 $518 = $nb$0 | 3;
8797 $519 = ((($512)) + 4|0);
8798 HEAP32[$519>>2] = $518;
8799 } else {
8800 HEAP32[(180)>>2] = 0;
8801 HEAP32[(192)>>2] = 0;
8802 $520 = $509 | 3;
8803 $521 = ((($512)) + 4|0);
8804 HEAP32[$521>>2] = $520;
8805 $$sum1 = (($509) + 4)|0;
8806 $522 = (($512) + ($$sum1)|0);
8807 $523 = HEAP32[$522>>2]|0;
8808 $524 = $523 | 1;
8809 HEAP32[$522>>2] = $524;
8810 }
8811 $525 = ((($512)) + 8|0);
8812 $mem$0 = $525;
8813 return ($mem$0|0);
8814 }
8815 $526 = HEAP32[(184)>>2]|0;
8816 $527 = ($526>>>0)>($nb$0>>>0);
8817 if ($527) {
8818 $528 = (($526) - ($nb$0))|0;
8819 HEAP32[(184)>>2] = $528;
8820 $529 = HEAP32[(196)>>2]|0;
8821 $530 = (($529) + ($nb$0)|0);
8822 HEAP32[(196)>>2] = $530;
8823 $531 = $528 | 1;
8824 $$sum = (($nb$0) + 4)|0;
8825 $532 = (($529) + ($$sum)|0);
8826 HEAP32[$532>>2] = $531;
8827 $533 = $nb$0 | 3;
8828 $534 = ((($529)) + 4|0);
8829 HEAP32[$534>>2] = $533;
8830 $535 = ((($529)) + 8|0);
8831 $mem$0 = $535;
8832 return ($mem$0|0);
8833 }
8834 $536 = HEAP32[644>>2]|0;
8835 $537 = ($536|0)==(0);
8836 do {
8837 if ($537) {
8838 $538 = (_sysconf(30)|0);
8839 $539 = (($538) + -1)|0;
8840 $540 = $539 & $538;
8841 $541 = ($540|0)==(0);
8842 if ($541) {
8843 HEAP32[(652)>>2] = $538;
8844 HEAP32[(648)>>2] = $538;
8845 HEAP32[(656)>>2] = -1;
8846 HEAP32[(660)>>2] = -1;
8847 HEAP32[(664)>>2] = 0;
8848 HEAP32[(616)>>2] = 0;
8849 $542 = (_time((0|0))|0);
8850 $543 = $542 & -16;
8851 $544 = $543 ^ 1431655768;
8852 HEAP32[644>>2] = $544;
8853 break;
8854 } else {
8855 _abort();
8856 // unreachable;
8857 }
8858 }
8859 } while(0);
8860 $545 = (($nb$0) + 48)|0;
8861 $546 = HEAP32[(652)>>2]|0;
8862 $547 = (($nb$0) + 47)|0;
8863 $548 = (($546) + ($547))|0;
8864 $549 = (0 - ($546))|0;
8865 $550 = $548 & $549;
8866 $551 = ($550>>>0)>($nb$0>>>0);
8867 if (!($551)) {
8868 $mem$0 = 0;
8869 return ($mem$0|0);
8870 }
8871 $552 = HEAP32[(612)>>2]|0;
8872 $553 = ($552|0)==(0);
8873 if (!($553)) {
8874 $554 = HEAP32[(604)>>2]|0;
8875 $555 = (($554) + ($550))|0;
8876 $556 = ($555>>>0)<=($554>>>0);
8877 $557 = ($555>>>0)>($552>>>0);
8878 $or$cond1$i = $556 | $557;
8879 if ($or$cond1$i) {
8880 $mem$0 = 0;
8881 return ($mem$0|0);
8882 }
8883 }
8884 $558 = HEAP32[(616)>>2]|0;
8885 $559 = $558 & 4;
8886 $560 = ($559|0)==(0);
8887 L258: do {
8888 if ($560) {
8889 $561 = HEAP32[(196)>>2]|0;
8890 $562 = ($561|0)==(0|0);
8891 L260: do {
8892 if ($562) {
8893 label = 174;
8894 } else {
8895 $sp$0$i$i = (620);
8896 while(1) {
8897 $563 = HEAP32[$sp$0$i$i>>2]|0;
8898 $564 = ($563>>>0)>($561>>>0);
8899 if (!($564)) {
8900 $565 = ((($sp$0$i$i)) + 4|0);
8901 $566 = HEAP32[$565>>2]|0;
8902 $567 = (($563) + ($566)|0);
8903 $568 = ($567>>>0)>($561>>>0);
8904 if ($568) {
8905 $$lcssa228 = $sp$0$i$i;$$lcssa230 = $565;
8906 break;
8907 }
8908 }
8909 $569 = ((($sp$0$i$i)) + 8|0);
8910 $570 = HEAP32[$569>>2]|0;
8911 $571 = ($570|0)==(0|0);
8912 if ($571) {
8913 label = 174;
8914 break L260;
8915 } else {
8916 $sp$0$i$i = $570;
8917 }
8918 }
8919 $594 = HEAP32[(184)>>2]|0;
8920 $595 = (($548) - ($594))|0;
8921 $596 = $595 & $549;
8922 $597 = ($596>>>0)<(2147483647);
8923 if ($597) {
8924 $598 = (_sbrk(($596|0))|0);
8925 $599 = HEAP32[$$lcssa228>>2]|0;
8926 $600 = HEAP32[$$lcssa230>>2]|0;
8927 $601 = (($599) + ($600)|0);
8928 $602 = ($598|0)==($601|0);
8929 $$3$i = $602 ? $596 : 0;
8930 if ($602) {
8931 $603 = ($598|0)==((-1)|0);
8932 if ($603) {
8933 $tsize$0323944$i = $$3$i;
8934 } else {
8935 $tbase$255$i = $598;$tsize$254$i = $$3$i;
8936 label = 194;
8937 break L258;
8938 }
8939 } else {
8940 $br$0$ph$i = $598;$ssize$1$ph$i = $596;$tsize$0$ph$i = $$3$i;
8941 label = 184;
8942 }
8943 } else {
8944 $tsize$0323944$i = 0;
8945 }
8946 }
8947 } while(0);
8948 do {
8949 if ((label|0) == 174) {
8950 $572 = (_sbrk(0)|0);
8951 $573 = ($572|0)==((-1)|0);
8952 if ($573) {
8953 $tsize$0323944$i = 0;
8954 } else {
8955 $574 = $572;
8956 $575 = HEAP32[(648)>>2]|0;
8957 $576 = (($575) + -1)|0;
8958 $577 = $576 & $574;
8959 $578 = ($577|0)==(0);
8960 if ($578) {
8961 $ssize$0$i = $550;
8962 } else {
8963 $579 = (($576) + ($574))|0;
8964 $580 = (0 - ($575))|0;
8965 $581 = $579 & $580;
8966 $582 = (($550) - ($574))|0;
8967 $583 = (($582) + ($581))|0;
8968 $ssize$0$i = $583;
8969 }
8970 $584 = HEAP32[(604)>>2]|0;
8971 $585 = (($584) + ($ssize$0$i))|0;
8972 $586 = ($ssize$0$i>>>0)>($nb$0>>>0);
8973 $587 = ($ssize$0$i>>>0)<(2147483647);
8974 $or$cond$i30 = $586 & $587;
8975 if ($or$cond$i30) {
8976 $588 = HEAP32[(612)>>2]|0;
8977 $589 = ($588|0)==(0);
8978 if (!($589)) {
8979 $590 = ($585>>>0)<=($584>>>0);
8980 $591 = ($585>>>0)>($588>>>0);
8981 $or$cond2$i = $590 | $591;
8982 if ($or$cond2$i) {
8983 $tsize$0323944$i = 0;
8984 break;
8985 }
8986 }
8987 $592 = (_sbrk(($ssize$0$i|0))|0);
8988 $593 = ($592|0)==($572|0);
8989 $ssize$0$$i = $593 ? $ssize$0$i : 0;
8990 if ($593) {
8991 $tbase$255$i = $572;$tsize$254$i = $ssize$0$$i;
8992 label = 194;
8993 break L258;
8994 } else {
8995 $br$0$ph$i = $592;$ssize$1$ph$i = $ssize$0$i;$tsize$0$ph$i = $ssize$0$$i;
8996 label = 184;
8997 }
8998 } else {
8999 $tsize$0323944$i = 0;
9000 }
9001 }
9002 }
9003 } while(0);
9004 L280: do {
9005 if ((label|0) == 184) {
9006 $604 = (0 - ($ssize$1$ph$i))|0;
9007 $605 = ($br$0$ph$i|0)!=((-1)|0);
9008 $606 = ($ssize$1$ph$i>>>0)<(2147483647);
9009 $or$cond5$i = $606 & $605;
9010 $607 = ($545>>>0)>($ssize$1$ph$i>>>0);
9011 $or$cond6$i = $607 & $or$cond5$i;
9012 do {
9013 if ($or$cond6$i) {
9014 $608 = HEAP32[(652)>>2]|0;
9015 $609 = (($547) - ($ssize$1$ph$i))|0;
9016 $610 = (($609) + ($608))|0;
9017 $611 = (0 - ($608))|0;
9018 $612 = $610 & $611;
9019 $613 = ($612>>>0)<(2147483647);
9020 if ($613) {
9021 $614 = (_sbrk(($612|0))|0);
9022 $615 = ($614|0)==((-1)|0);
9023 if ($615) {
9024 (_sbrk(($604|0))|0);
9025 $tsize$0323944$i = $tsize$0$ph$i;
9026 break L280;
9027 } else {
9028 $616 = (($612) + ($ssize$1$ph$i))|0;
9029 $ssize$2$i = $616;
9030 break;
9031 }
9032 } else {
9033 $ssize$2$i = $ssize$1$ph$i;
9034 }
9035 } else {
9036 $ssize$2$i = $ssize$1$ph$i;
9037 }
9038 } while(0);
9039 $617 = ($br$0$ph$i|0)==((-1)|0);
9040 if ($617) {
9041 $tsize$0323944$i = $tsize$0$ph$i;
9042 } else {
9043 $tbase$255$i = $br$0$ph$i;$tsize$254$i = $ssize$2$i;
9044 label = 194;
9045 break L258;
9046 }
9047 }
9048 } while(0);
9049 $618 = HEAP32[(616)>>2]|0;
9050 $619 = $618 | 4;
9051 HEAP32[(616)>>2] = $619;
9052 $tsize$1$i = $tsize$0323944$i;
9053 label = 191;
9054 } else {
9055 $tsize$1$i = 0;
9056 label = 191;
9057 }
9058 } while(0);
9059 if ((label|0) == 191) {
9060 $620 = ($550>>>0)<(2147483647);
9061 if ($620) {
9062 $621 = (_sbrk(($550|0))|0);
9063 $622 = (_sbrk(0)|0);
9064 $623 = ($621|0)!=((-1)|0);
9065 $624 = ($622|0)!=((-1)|0);
9066 $or$cond3$i = $623 & $624;
9067 $625 = ($621>>>0)<($622>>>0);
9068 $or$cond8$i = $625 & $or$cond3$i;
9069 if ($or$cond8$i) {
9070 $626 = $622;
9071 $627 = $621;
9072 $628 = (($626) - ($627))|0;
9073 $629 = (($nb$0) + 40)|0;
9074 $630 = ($628>>>0)>($629>>>0);
9075 $$tsize$1$i = $630 ? $628 : $tsize$1$i;
9076 if ($630) {
9077 $tbase$255$i = $621;$tsize$254$i = $$tsize$1$i;
9078 label = 194;
9079 }
9080 }
9081 }
9082 }
9083 if ((label|0) == 194) {
9084 $631 = HEAP32[(604)>>2]|0;
9085 $632 = (($631) + ($tsize$254$i))|0;
9086 HEAP32[(604)>>2] = $632;
9087 $633 = HEAP32[(608)>>2]|0;
9088 $634 = ($632>>>0)>($633>>>0);
9089 if ($634) {
9090 HEAP32[(608)>>2] = $632;
9091 }
9092 $635 = HEAP32[(196)>>2]|0;
9093 $636 = ($635|0)==(0|0);
9094 L299: do {
9095 if ($636) {
9096 $637 = HEAP32[(188)>>2]|0;
9097 $638 = ($637|0)==(0|0);
9098 $639 = ($tbase$255$i>>>0)<($637>>>0);
9099 $or$cond9$i = $638 | $639;
9100 if ($or$cond9$i) {
9101 HEAP32[(188)>>2] = $tbase$255$i;
9102 }
9103 HEAP32[(620)>>2] = $tbase$255$i;
9104 HEAP32[(624)>>2] = $tsize$254$i;
9105 HEAP32[(632)>>2] = 0;
9106 $640 = HEAP32[644>>2]|0;
9107 HEAP32[(208)>>2] = $640;
9108 HEAP32[(204)>>2] = -1;
9109 $i$02$i$i = 0;
9110 while(1) {
9111 $641 = $i$02$i$i << 1;
9112 $642 = (212 + ($641<<2)|0);
9113 $$sum$i$i = (($641) + 3)|0;
9114 $643 = (212 + ($$sum$i$i<<2)|0);
9115 HEAP32[$643>>2] = $642;
9116 $$sum1$i$i = (($641) + 2)|0;
9117 $644 = (212 + ($$sum1$i$i<<2)|0);
9118 HEAP32[$644>>2] = $642;
9119 $645 = (($i$02$i$i) + 1)|0;
9120 $exitcond$i$i = ($645|0)==(32);
9121 if ($exitcond$i$i) {
9122 break;
9123 } else {
9124 $i$02$i$i = $645;
9125 }
9126 }
9127 $646 = (($tsize$254$i) + -40)|0;
9128 $647 = ((($tbase$255$i)) + 8|0);
9129 $648 = $647;
9130 $649 = $648 & 7;
9131 $650 = ($649|0)==(0);
9132 $651 = (0 - ($648))|0;
9133 $652 = $651 & 7;
9134 $653 = $650 ? 0 : $652;
9135 $654 = (($tbase$255$i) + ($653)|0);
9136 $655 = (($646) - ($653))|0;
9137 HEAP32[(196)>>2] = $654;
9138 HEAP32[(184)>>2] = $655;
9139 $656 = $655 | 1;
9140 $$sum$i13$i = (($653) + 4)|0;
9141 $657 = (($tbase$255$i) + ($$sum$i13$i)|0);
9142 HEAP32[$657>>2] = $656;
9143 $$sum2$i$i = (($tsize$254$i) + -36)|0;
9144 $658 = (($tbase$255$i) + ($$sum2$i$i)|0);
9145 HEAP32[$658>>2] = 40;
9146 $659 = HEAP32[(660)>>2]|0;
9147 HEAP32[(200)>>2] = $659;
9148 } else {
9149 $sp$084$i = (620);
9150 while(1) {
9151 $660 = HEAP32[$sp$084$i>>2]|0;
9152 $661 = ((($sp$084$i)) + 4|0);
9153 $662 = HEAP32[$661>>2]|0;
9154 $663 = (($660) + ($662)|0);
9155 $664 = ($tbase$255$i|0)==($663|0);
9156 if ($664) {
9157 $$lcssa222 = $660;$$lcssa224 = $661;$$lcssa226 = $662;$sp$084$i$lcssa = $sp$084$i;
9158 label = 204;
9159 break;
9160 }
9161 $665 = ((($sp$084$i)) + 8|0);
9162 $666 = HEAP32[$665>>2]|0;
9163 $667 = ($666|0)==(0|0);
9164 if ($667) {
9165 break;
9166 } else {
9167 $sp$084$i = $666;
9168 }
9169 }
9170 if ((label|0) == 204) {
9171 $668 = ((($sp$084$i$lcssa)) + 12|0);
9172 $669 = HEAP32[$668>>2]|0;
9173 $670 = $669 & 8;
9174 $671 = ($670|0)==(0);
9175 if ($671) {
9176 $672 = ($635>>>0)>=($$lcssa222>>>0);
9177 $673 = ($635>>>0)<($tbase$255$i>>>0);
9178 $or$cond57$i = $673 & $672;
9179 if ($or$cond57$i) {
9180 $674 = (($$lcssa226) + ($tsize$254$i))|0;
9181 HEAP32[$$lcssa224>>2] = $674;
9182 $675 = HEAP32[(184)>>2]|0;
9183 $676 = (($675) + ($tsize$254$i))|0;
9184 $677 = ((($635)) + 8|0);
9185 $678 = $677;
9186 $679 = $678 & 7;
9187 $680 = ($679|0)==(0);
9188 $681 = (0 - ($678))|0;
9189 $682 = $681 & 7;
9190 $683 = $680 ? 0 : $682;
9191 $684 = (($635) + ($683)|0);
9192 $685 = (($676) - ($683))|0;
9193 HEAP32[(196)>>2] = $684;
9194 HEAP32[(184)>>2] = $685;
9195 $686 = $685 | 1;
9196 $$sum$i17$i = (($683) + 4)|0;
9197 $687 = (($635) + ($$sum$i17$i)|0);
9198 HEAP32[$687>>2] = $686;
9199 $$sum2$i18$i = (($676) + 4)|0;
9200 $688 = (($635) + ($$sum2$i18$i)|0);
9201 HEAP32[$688>>2] = 40;
9202 $689 = HEAP32[(660)>>2]|0;
9203 HEAP32[(200)>>2] = $689;
9204 break;
9205 }
9206 }
9207 }
9208 $690 = HEAP32[(188)>>2]|0;
9209 $691 = ($tbase$255$i>>>0)<($690>>>0);
9210 if ($691) {
9211 HEAP32[(188)>>2] = $tbase$255$i;
9212 $755 = $tbase$255$i;
9213 } else {
9214 $755 = $690;
9215 }
9216 $692 = (($tbase$255$i) + ($tsize$254$i)|0);
9217 $sp$183$i = (620);
9218 while(1) {
9219 $693 = HEAP32[$sp$183$i>>2]|0;
9220 $694 = ($693|0)==($692|0);
9221 if ($694) {
9222 $$lcssa219 = $sp$183$i;$sp$183$i$lcssa = $sp$183$i;
9223 label = 212;
9224 break;
9225 }
9226 $695 = ((($sp$183$i)) + 8|0);
9227 $696 = HEAP32[$695>>2]|0;
9228 $697 = ($696|0)==(0|0);
9229 if ($697) {
9230 $sp$0$i$i$i = (620);
9231 break;
9232 } else {
9233 $sp$183$i = $696;
9234 }
9235 }
9236 if ((label|0) == 212) {
9237 $698 = ((($sp$183$i$lcssa)) + 12|0);
9238 $699 = HEAP32[$698>>2]|0;
9239 $700 = $699 & 8;
9240 $701 = ($700|0)==(0);
9241 if ($701) {
9242 HEAP32[$$lcssa219>>2] = $tbase$255$i;
9243 $702 = ((($sp$183$i$lcssa)) + 4|0);
9244 $703 = HEAP32[$702>>2]|0;
9245 $704 = (($703) + ($tsize$254$i))|0;
9246 HEAP32[$702>>2] = $704;
9247 $705 = ((($tbase$255$i)) + 8|0);
9248 $706 = $705;
9249 $707 = $706 & 7;
9250 $708 = ($707|0)==(0);
9251 $709 = (0 - ($706))|0;
9252 $710 = $709 & 7;
9253 $711 = $708 ? 0 : $710;
9254 $712 = (($tbase$255$i) + ($711)|0);
9255 $$sum112$i = (($tsize$254$i) + 8)|0;
9256 $713 = (($tbase$255$i) + ($$sum112$i)|0);
9257 $714 = $713;
9258 $715 = $714 & 7;
9259 $716 = ($715|0)==(0);
9260 $717 = (0 - ($714))|0;
9261 $718 = $717 & 7;
9262 $719 = $716 ? 0 : $718;
9263 $$sum113$i = (($719) + ($tsize$254$i))|0;
9264 $720 = (($tbase$255$i) + ($$sum113$i)|0);
9265 $721 = $720;
9266 $722 = $712;
9267 $723 = (($721) - ($722))|0;
9268 $$sum$i19$i = (($711) + ($nb$0))|0;
9269 $724 = (($tbase$255$i) + ($$sum$i19$i)|0);
9270 $725 = (($723) - ($nb$0))|0;
9271 $726 = $nb$0 | 3;
9272 $$sum1$i20$i = (($711) + 4)|0;
9273 $727 = (($tbase$255$i) + ($$sum1$i20$i)|0);
9274 HEAP32[$727>>2] = $726;
9275 $728 = ($720|0)==($635|0);
9276 L324: do {
9277 if ($728) {
9278 $729 = HEAP32[(184)>>2]|0;
9279 $730 = (($729) + ($725))|0;
9280 HEAP32[(184)>>2] = $730;
9281 HEAP32[(196)>>2] = $724;
9282 $731 = $730 | 1;
9283 $$sum42$i$i = (($$sum$i19$i) + 4)|0;
9284 $732 = (($tbase$255$i) + ($$sum42$i$i)|0);
9285 HEAP32[$732>>2] = $731;
9286 } else {
9287 $733 = HEAP32[(192)>>2]|0;
9288 $734 = ($720|0)==($733|0);
9289 if ($734) {
9290 $735 = HEAP32[(180)>>2]|0;
9291 $736 = (($735) + ($725))|0;
9292 HEAP32[(180)>>2] = $736;
9293 HEAP32[(192)>>2] = $724;
9294 $737 = $736 | 1;
9295 $$sum40$i$i = (($$sum$i19$i) + 4)|0;
9296 $738 = (($tbase$255$i) + ($$sum40$i$i)|0);
9297 HEAP32[$738>>2] = $737;
9298 $$sum41$i$i = (($736) + ($$sum$i19$i))|0;
9299 $739 = (($tbase$255$i) + ($$sum41$i$i)|0);
9300 HEAP32[$739>>2] = $736;
9301 break;
9302 }
9303 $$sum2$i21$i = (($tsize$254$i) + 4)|0;
9304 $$sum114$i = (($$sum2$i21$i) + ($719))|0;
9305 $740 = (($tbase$255$i) + ($$sum114$i)|0);
9306 $741 = HEAP32[$740>>2]|0;
9307 $742 = $741 & 3;
9308 $743 = ($742|0)==(1);
9309 if ($743) {
9310 $744 = $741 & -8;
9311 $745 = $741 >>> 3;
9312 $746 = ($741>>>0)<(256);
9313 L332: do {
9314 if ($746) {
9315 $$sum3738$i$i = $719 | 8;
9316 $$sum124$i = (($$sum3738$i$i) + ($tsize$254$i))|0;
9317 $747 = (($tbase$255$i) + ($$sum124$i)|0);
9318 $748 = HEAP32[$747>>2]|0;
9319 $$sum39$i$i = (($tsize$254$i) + 12)|0;
9320 $$sum125$i = (($$sum39$i$i) + ($719))|0;
9321 $749 = (($tbase$255$i) + ($$sum125$i)|0);
9322 $750 = HEAP32[$749>>2]|0;
9323 $751 = $745 << 1;
9324 $752 = (212 + ($751<<2)|0);
9325 $753 = ($748|0)==($752|0);
9326 do {
9327 if (!($753)) {
9328 $754 = ($748>>>0)<($755>>>0);
9329 if ($754) {
9330 _abort();
9331 // unreachable;
9332 }
9333 $756 = ((($748)) + 12|0);
9334 $757 = HEAP32[$756>>2]|0;
9335 $758 = ($757|0)==($720|0);
9336 if ($758) {
9337 break;
9338 }
9339 _abort();
9340 // unreachable;
9341 }
9342 } while(0);
9343 $759 = ($750|0)==($748|0);
9344 if ($759) {
9345 $760 = 1 << $745;
9346 $761 = $760 ^ -1;
9347 $762 = HEAP32[172>>2]|0;
9348 $763 = $762 & $761;
9349 HEAP32[172>>2] = $763;
9350 break;
9351 }
9352 $764 = ($750|0)==($752|0);
9353 do {
9354 if ($764) {
9355 $$pre57$i$i = ((($750)) + 8|0);
9356 $$pre$phi58$i$iZ2D = $$pre57$i$i;
9357 } else {
9358 $765 = ($750>>>0)<($755>>>0);
9359 if ($765) {
9360 _abort();
9361 // unreachable;
9362 }
9363 $766 = ((($750)) + 8|0);
9364 $767 = HEAP32[$766>>2]|0;
9365 $768 = ($767|0)==($720|0);
9366 if ($768) {
9367 $$pre$phi58$i$iZ2D = $766;
9368 break;
9369 }
9370 _abort();
9371 // unreachable;
9372 }
9373 } while(0);
9374 $769 = ((($748)) + 12|0);
9375 HEAP32[$769>>2] = $750;
9376 HEAP32[$$pre$phi58$i$iZ2D>>2] = $748;
9377 } else {
9378 $$sum34$i$i = $719 | 24;
9379 $$sum115$i = (($$sum34$i$i) + ($tsize$254$i))|0;
9380 $770 = (($tbase$255$i) + ($$sum115$i)|0);
9381 $771 = HEAP32[$770>>2]|0;
9382 $$sum5$i$i = (($tsize$254$i) + 12)|0;
9383 $$sum116$i = (($$sum5$i$i) + ($719))|0;
9384 $772 = (($tbase$255$i) + ($$sum116$i)|0);
9385 $773 = HEAP32[$772>>2]|0;
9386 $774 = ($773|0)==($720|0);
9387 do {
9388 if ($774) {
9389 $$sum67$i$i = $719 | 16;
9390 $$sum122$i = (($$sum2$i21$i) + ($$sum67$i$i))|0;
9391 $784 = (($tbase$255$i) + ($$sum122$i)|0);
9392 $785 = HEAP32[$784>>2]|0;
9393 $786 = ($785|0)==(0|0);
9394 if ($786) {
9395 $$sum123$i = (($$sum67$i$i) + ($tsize$254$i))|0;
9396 $787 = (($tbase$255$i) + ($$sum123$i)|0);
9397 $788 = HEAP32[$787>>2]|0;
9398 $789 = ($788|0)==(0|0);
9399 if ($789) {
9400 $R$1$i$i = 0;
9401 break;
9402 } else {
9403 $R$0$i$i = $788;$RP$0$i$i = $787;
9404 }
9405 } else {
9406 $R$0$i$i = $785;$RP$0$i$i = $784;
9407 }
9408 while(1) {
9409 $790 = ((($R$0$i$i)) + 20|0);
9410 $791 = HEAP32[$790>>2]|0;
9411 $792 = ($791|0)==(0|0);
9412 if (!($792)) {
9413 $R$0$i$i = $791;$RP$0$i$i = $790;
9414 continue;
9415 }
9416 $793 = ((($R$0$i$i)) + 16|0);
9417 $794 = HEAP32[$793>>2]|0;
9418 $795 = ($794|0)==(0|0);
9419 if ($795) {
9420 $R$0$i$i$lcssa = $R$0$i$i;$RP$0$i$i$lcssa = $RP$0$i$i;
9421 break;
9422 } else {
9423 $R$0$i$i = $794;$RP$0$i$i = $793;
9424 }
9425 }
9426 $796 = ($RP$0$i$i$lcssa>>>0)<($755>>>0);
9427 if ($796) {
9428 _abort();
9429 // unreachable;
9430 } else {
9431 HEAP32[$RP$0$i$i$lcssa>>2] = 0;
9432 $R$1$i$i = $R$0$i$i$lcssa;
9433 break;
9434 }
9435 } else {
9436 $$sum3536$i$i = $719 | 8;
9437 $$sum117$i = (($$sum3536$i$i) + ($tsize$254$i))|0;
9438 $775 = (($tbase$255$i) + ($$sum117$i)|0);
9439 $776 = HEAP32[$775>>2]|0;
9440 $777 = ($776>>>0)<($755>>>0);
9441 if ($777) {
9442 _abort();
9443 // unreachable;
9444 }
9445 $778 = ((($776)) + 12|0);
9446 $779 = HEAP32[$778>>2]|0;
9447 $780 = ($779|0)==($720|0);
9448 if (!($780)) {
9449 _abort();
9450 // unreachable;
9451 }
9452 $781 = ((($773)) + 8|0);
9453 $782 = HEAP32[$781>>2]|0;
9454 $783 = ($782|0)==($720|0);
9455 if ($783) {
9456 HEAP32[$778>>2] = $773;
9457 HEAP32[$781>>2] = $776;
9458 $R$1$i$i = $773;
9459 break;
9460 } else {
9461 _abort();
9462 // unreachable;
9463 }
9464 }
9465 } while(0);
9466 $797 = ($771|0)==(0|0);
9467 if ($797) {
9468 break;
9469 }
9470 $$sum30$i$i = (($tsize$254$i) + 28)|0;
9471 $$sum118$i = (($$sum30$i$i) + ($719))|0;
9472 $798 = (($tbase$255$i) + ($$sum118$i)|0);
9473 $799 = HEAP32[$798>>2]|0;
9474 $800 = (476 + ($799<<2)|0);
9475 $801 = HEAP32[$800>>2]|0;
9476 $802 = ($720|0)==($801|0);
9477 do {
9478 if ($802) {
9479 HEAP32[$800>>2] = $R$1$i$i;
9480 $cond$i$i = ($R$1$i$i|0)==(0|0);
9481 if (!($cond$i$i)) {
9482 break;
9483 }
9484 $803 = 1 << $799;
9485 $804 = $803 ^ -1;
9486 $805 = HEAP32[(176)>>2]|0;
9487 $806 = $805 & $804;
9488 HEAP32[(176)>>2] = $806;
9489 break L332;
9490 } else {
9491 $807 = HEAP32[(188)>>2]|0;
9492 $808 = ($771>>>0)<($807>>>0);
9493 if ($808) {
9494 _abort();
9495 // unreachable;
9496 }
9497 $809 = ((($771)) + 16|0);
9498 $810 = HEAP32[$809>>2]|0;
9499 $811 = ($810|0)==($720|0);
9500 if ($811) {
9501 HEAP32[$809>>2] = $R$1$i$i;
9502 } else {
9503 $812 = ((($771)) + 20|0);
9504 HEAP32[$812>>2] = $R$1$i$i;
9505 }
9506 $813 = ($R$1$i$i|0)==(0|0);
9507 if ($813) {
9508 break L332;
9509 }
9510 }
9511 } while(0);
9512 $814 = HEAP32[(188)>>2]|0;
9513 $815 = ($R$1$i$i>>>0)<($814>>>0);
9514 if ($815) {
9515 _abort();
9516 // unreachable;
9517 }
9518 $816 = ((($R$1$i$i)) + 24|0);
9519 HEAP32[$816>>2] = $771;
9520 $$sum3132$i$i = $719 | 16;
9521 $$sum119$i = (($$sum3132$i$i) + ($tsize$254$i))|0;
9522 $817 = (($tbase$255$i) + ($$sum119$i)|0);
9523 $818 = HEAP32[$817>>2]|0;
9524 $819 = ($818|0)==(0|0);
9525 do {
9526 if (!($819)) {
9527 $820 = ($818>>>0)<($814>>>0);
9528 if ($820) {
9529 _abort();
9530 // unreachable;
9531 } else {
9532 $821 = ((($R$1$i$i)) + 16|0);
9533 HEAP32[$821>>2] = $818;
9534 $822 = ((($818)) + 24|0);
9535 HEAP32[$822>>2] = $R$1$i$i;
9536 break;
9537 }
9538 }
9539 } while(0);
9540 $$sum120$i = (($$sum2$i21$i) + ($$sum3132$i$i))|0;
9541 $823 = (($tbase$255$i) + ($$sum120$i)|0);
9542 $824 = HEAP32[$823>>2]|0;
9543 $825 = ($824|0)==(0|0);
9544 if ($825) {
9545 break;
9546 }
9547 $826 = HEAP32[(188)>>2]|0;
9548 $827 = ($824>>>0)<($826>>>0);
9549 if ($827) {
9550 _abort();
9551 // unreachable;
9552 } else {
9553 $828 = ((($R$1$i$i)) + 20|0);
9554 HEAP32[$828>>2] = $824;
9555 $829 = ((($824)) + 24|0);
9556 HEAP32[$829>>2] = $R$1$i$i;
9557 break;
9558 }
9559 }
9560 } while(0);
9561 $$sum9$i$i = $744 | $719;
9562 $$sum121$i = (($$sum9$i$i) + ($tsize$254$i))|0;
9563 $830 = (($tbase$255$i) + ($$sum121$i)|0);
9564 $831 = (($744) + ($725))|0;
9565 $oldfirst$0$i$i = $830;$qsize$0$i$i = $831;
9566 } else {
9567 $oldfirst$0$i$i = $720;$qsize$0$i$i = $725;
9568 }
9569 $832 = ((($oldfirst$0$i$i)) + 4|0);
9570 $833 = HEAP32[$832>>2]|0;
9571 $834 = $833 & -2;
9572 HEAP32[$832>>2] = $834;
9573 $835 = $qsize$0$i$i | 1;
9574 $$sum10$i$i = (($$sum$i19$i) + 4)|0;
9575 $836 = (($tbase$255$i) + ($$sum10$i$i)|0);
9576 HEAP32[$836>>2] = $835;
9577 $$sum11$i$i = (($qsize$0$i$i) + ($$sum$i19$i))|0;
9578 $837 = (($tbase$255$i) + ($$sum11$i$i)|0);
9579 HEAP32[$837>>2] = $qsize$0$i$i;
9580 $838 = $qsize$0$i$i >>> 3;
9581 $839 = ($qsize$0$i$i>>>0)<(256);
9582 if ($839) {
9583 $840 = $838 << 1;
9584 $841 = (212 + ($840<<2)|0);
9585 $842 = HEAP32[172>>2]|0;
9586 $843 = 1 << $838;
9587 $844 = $842 & $843;
9588 $845 = ($844|0)==(0);
9589 do {
9590 if ($845) {
9591 $846 = $842 | $843;
9592 HEAP32[172>>2] = $846;
9593 $$pre$i22$i = (($840) + 2)|0;
9594 $$pre56$i$i = (212 + ($$pre$i22$i<<2)|0);
9595 $$pre$phi$i23$iZ2D = $$pre56$i$i;$F4$0$i$i = $841;
9596 } else {
9597 $$sum29$i$i = (($840) + 2)|0;
9598 $847 = (212 + ($$sum29$i$i<<2)|0);
9599 $848 = HEAP32[$847>>2]|0;
9600 $849 = HEAP32[(188)>>2]|0;
9601 $850 = ($848>>>0)<($849>>>0);
9602 if (!($850)) {
9603 $$pre$phi$i23$iZ2D = $847;$F4$0$i$i = $848;
9604 break;
9605 }
9606 _abort();
9607 // unreachable;
9608 }
9609 } while(0);
9610 HEAP32[$$pre$phi$i23$iZ2D>>2] = $724;
9611 $851 = ((($F4$0$i$i)) + 12|0);
9612 HEAP32[$851>>2] = $724;
9613 $$sum27$i$i = (($$sum$i19$i) + 8)|0;
9614 $852 = (($tbase$255$i) + ($$sum27$i$i)|0);
9615 HEAP32[$852>>2] = $F4$0$i$i;
9616 $$sum28$i$i = (($$sum$i19$i) + 12)|0;
9617 $853 = (($tbase$255$i) + ($$sum28$i$i)|0);
9618 HEAP32[$853>>2] = $841;
9619 break;
9620 }
9621 $854 = $qsize$0$i$i >>> 8;
9622 $855 = ($854|0)==(0);
9623 do {
9624 if ($855) {
9625 $I7$0$i$i = 0;
9626 } else {
9627 $856 = ($qsize$0$i$i>>>0)>(16777215);
9628 if ($856) {
9629 $I7$0$i$i = 31;
9630 break;
9631 }
9632 $857 = (($854) + 1048320)|0;
9633 $858 = $857 >>> 16;
9634 $859 = $858 & 8;
9635 $860 = $854 << $859;
9636 $861 = (($860) + 520192)|0;
9637 $862 = $861 >>> 16;
9638 $863 = $862 & 4;
9639 $864 = $863 | $859;
9640 $865 = $860 << $863;
9641 $866 = (($865) + 245760)|0;
9642 $867 = $866 >>> 16;
9643 $868 = $867 & 2;
9644 $869 = $864 | $868;
9645 $870 = (14 - ($869))|0;
9646 $871 = $865 << $868;
9647 $872 = $871 >>> 15;
9648 $873 = (($870) + ($872))|0;
9649 $874 = $873 << 1;
9650 $875 = (($873) + 7)|0;
9651 $876 = $qsize$0$i$i >>> $875;
9652 $877 = $876 & 1;
9653 $878 = $877 | $874;
9654 $I7$0$i$i = $878;
9655 }
9656 } while(0);
9657 $879 = (476 + ($I7$0$i$i<<2)|0);
9658 $$sum12$i$i = (($$sum$i19$i) + 28)|0;
9659 $880 = (($tbase$255$i) + ($$sum12$i$i)|0);
9660 HEAP32[$880>>2] = $I7$0$i$i;
9661 $$sum13$i$i = (($$sum$i19$i) + 16)|0;
9662 $881 = (($tbase$255$i) + ($$sum13$i$i)|0);
9663 $$sum14$i$i = (($$sum$i19$i) + 20)|0;
9664 $882 = (($tbase$255$i) + ($$sum14$i$i)|0);
9665 HEAP32[$882>>2] = 0;
9666 HEAP32[$881>>2] = 0;
9667 $883 = HEAP32[(176)>>2]|0;
9668 $884 = 1 << $I7$0$i$i;
9669 $885 = $883 & $884;
9670 $886 = ($885|0)==(0);
9671 if ($886) {
9672 $887 = $883 | $884;
9673 HEAP32[(176)>>2] = $887;
9674 HEAP32[$879>>2] = $724;
9675 $$sum15$i$i = (($$sum$i19$i) + 24)|0;
9676 $888 = (($tbase$255$i) + ($$sum15$i$i)|0);
9677 HEAP32[$888>>2] = $879;
9678 $$sum16$i$i = (($$sum$i19$i) + 12)|0;
9679 $889 = (($tbase$255$i) + ($$sum16$i$i)|0);
9680 HEAP32[$889>>2] = $724;
9681 $$sum17$i$i = (($$sum$i19$i) + 8)|0;
9682 $890 = (($tbase$255$i) + ($$sum17$i$i)|0);
9683 HEAP32[$890>>2] = $724;
9684 break;
9685 }
9686 $891 = HEAP32[$879>>2]|0;
9687 $892 = ((($891)) + 4|0);
9688 $893 = HEAP32[$892>>2]|0;
9689 $894 = $893 & -8;
9690 $895 = ($894|0)==($qsize$0$i$i|0);
9691 L418: do {
9692 if ($895) {
9693 $T$0$lcssa$i25$i = $891;
9694 } else {
9695 $896 = ($I7$0$i$i|0)==(31);
9696 $897 = $I7$0$i$i >>> 1;
9697 $898 = (25 - ($897))|0;
9698 $899 = $896 ? 0 : $898;
9699 $900 = $qsize$0$i$i << $899;
9700 $K8$051$i$i = $900;$T$050$i$i = $891;
9701 while(1) {
9702 $907 = $K8$051$i$i >>> 31;
9703 $908 = (((($T$050$i$i)) + 16|0) + ($907<<2)|0);
9704 $903 = HEAP32[$908>>2]|0;
9705 $909 = ($903|0)==(0|0);
9706 if ($909) {
9707 $$lcssa = $908;$T$050$i$i$lcssa = $T$050$i$i;
9708 break;
9709 }
9710 $901 = $K8$051$i$i << 1;
9711 $902 = ((($903)) + 4|0);
9712 $904 = HEAP32[$902>>2]|0;
9713 $905 = $904 & -8;
9714 $906 = ($905|0)==($qsize$0$i$i|0);
9715 if ($906) {
9716 $T$0$lcssa$i25$i = $903;
9717 break L418;
9718 } else {
9719 $K8$051$i$i = $901;$T$050$i$i = $903;
9720 }
9721 }
9722 $910 = HEAP32[(188)>>2]|0;
9723 $911 = ($$lcssa>>>0)<($910>>>0);
9724 if ($911) {
9725 _abort();
9726 // unreachable;
9727 } else {
9728 HEAP32[$$lcssa>>2] = $724;
9729 $$sum23$i$i = (($$sum$i19$i) + 24)|0;
9730 $912 = (($tbase$255$i) + ($$sum23$i$i)|0);
9731 HEAP32[$912>>2] = $T$050$i$i$lcssa;
9732 $$sum24$i$i = (($$sum$i19$i) + 12)|0;
9733 $913 = (($tbase$255$i) + ($$sum24$i$i)|0);
9734 HEAP32[$913>>2] = $724;
9735 $$sum25$i$i = (($$sum$i19$i) + 8)|0;
9736 $914 = (($tbase$255$i) + ($$sum25$i$i)|0);
9737 HEAP32[$914>>2] = $724;
9738 break L324;
9739 }
9740 }
9741 } while(0);
9742 $915 = ((($T$0$lcssa$i25$i)) + 8|0);
9743 $916 = HEAP32[$915>>2]|0;
9744 $917 = HEAP32[(188)>>2]|0;
9745 $918 = ($916>>>0)>=($917>>>0);
9746 $not$$i26$i = ($T$0$lcssa$i25$i>>>0)>=($917>>>0);
9747 $919 = $918 & $not$$i26$i;
9748 if ($919) {
9749 $920 = ((($916)) + 12|0);
9750 HEAP32[$920>>2] = $724;
9751 HEAP32[$915>>2] = $724;
9752 $$sum20$i$i = (($$sum$i19$i) + 8)|0;
9753 $921 = (($tbase$255$i) + ($$sum20$i$i)|0);
9754 HEAP32[$921>>2] = $916;
9755 $$sum21$i$i = (($$sum$i19$i) + 12)|0;
9756 $922 = (($tbase$255$i) + ($$sum21$i$i)|0);
9757 HEAP32[$922>>2] = $T$0$lcssa$i25$i;
9758 $$sum22$i$i = (($$sum$i19$i) + 24)|0;
9759 $923 = (($tbase$255$i) + ($$sum22$i$i)|0);
9760 HEAP32[$923>>2] = 0;
9761 break;
9762 } else {
9763 _abort();
9764 // unreachable;
9765 }
9766 }
9767 } while(0);
9768 $$sum1819$i$i = $711 | 8;
9769 $924 = (($tbase$255$i) + ($$sum1819$i$i)|0);
9770 $mem$0 = $924;
9771 return ($mem$0|0);
9772 } else {
9773 $sp$0$i$i$i = (620);
9774 }
9775 }
9776 while(1) {
9777 $925 = HEAP32[$sp$0$i$i$i>>2]|0;
9778 $926 = ($925>>>0)>($635>>>0);
9779 if (!($926)) {
9780 $927 = ((($sp$0$i$i$i)) + 4|0);
9781 $928 = HEAP32[$927>>2]|0;
9782 $929 = (($925) + ($928)|0);
9783 $930 = ($929>>>0)>($635>>>0);
9784 if ($930) {
9785 $$lcssa215 = $925;$$lcssa216 = $928;$$lcssa217 = $929;
9786 break;
9787 }
9788 }
9789 $931 = ((($sp$0$i$i$i)) + 8|0);
9790 $932 = HEAP32[$931>>2]|0;
9791 $sp$0$i$i$i = $932;
9792 }
9793 $$sum$i14$i = (($$lcssa216) + -47)|0;
9794 $$sum1$i15$i = (($$lcssa216) + -39)|0;
9795 $933 = (($$lcssa215) + ($$sum1$i15$i)|0);
9796 $934 = $933;
9797 $935 = $934 & 7;
9798 $936 = ($935|0)==(0);
9799 $937 = (0 - ($934))|0;
9800 $938 = $937 & 7;
9801 $939 = $936 ? 0 : $938;
9802 $$sum2$i16$i = (($$sum$i14$i) + ($939))|0;
9803 $940 = (($$lcssa215) + ($$sum2$i16$i)|0);
9804 $941 = ((($635)) + 16|0);
9805 $942 = ($940>>>0)<($941>>>0);
9806 $943 = $942 ? $635 : $940;
9807 $944 = ((($943)) + 8|0);
9808 $945 = (($tsize$254$i) + -40)|0;
9809 $946 = ((($tbase$255$i)) + 8|0);
9810 $947 = $946;
9811 $948 = $947 & 7;
9812 $949 = ($948|0)==(0);
9813 $950 = (0 - ($947))|0;
9814 $951 = $950 & 7;
9815 $952 = $949 ? 0 : $951;
9816 $953 = (($tbase$255$i) + ($952)|0);
9817 $954 = (($945) - ($952))|0;
9818 HEAP32[(196)>>2] = $953;
9819 HEAP32[(184)>>2] = $954;
9820 $955 = $954 | 1;
9821 $$sum$i$i$i = (($952) + 4)|0;
9822 $956 = (($tbase$255$i) + ($$sum$i$i$i)|0);
9823 HEAP32[$956>>2] = $955;
9824 $$sum2$i$i$i = (($tsize$254$i) + -36)|0;
9825 $957 = (($tbase$255$i) + ($$sum2$i$i$i)|0);
9826 HEAP32[$957>>2] = 40;
9827 $958 = HEAP32[(660)>>2]|0;
9828 HEAP32[(200)>>2] = $958;
9829 $959 = ((($943)) + 4|0);
9830 HEAP32[$959>>2] = 27;
9831 ;HEAP32[$944>>2]=HEAP32[(620)>>2]|0;HEAP32[$944+4>>2]=HEAP32[(620)+4>>2]|0;HEAP32[$944+8>>2]=HEAP32[(620)+8>>2]|0;HEAP32[$944+12>>2]=HEAP32[(620)+12>>2]|0;
9832 HEAP32[(620)>>2] = $tbase$255$i;
9833 HEAP32[(624)>>2] = $tsize$254$i;
9834 HEAP32[(632)>>2] = 0;
9835 HEAP32[(628)>>2] = $944;
9836 $960 = ((($943)) + 28|0);
9837 HEAP32[$960>>2] = 7;
9838 $961 = ((($943)) + 32|0);
9839 $962 = ($961>>>0)<($$lcssa217>>>0);
9840 if ($962) {
9841 $964 = $960;
9842 while(1) {
9843 $963 = ((($964)) + 4|0);
9844 HEAP32[$963>>2] = 7;
9845 $965 = ((($964)) + 8|0);
9846 $966 = ($965>>>0)<($$lcssa217>>>0);
9847 if ($966) {
9848 $964 = $963;
9849 } else {
9850 break;
9851 }
9852 }
9853 }
9854 $967 = ($943|0)==($635|0);
9855 if (!($967)) {
9856 $968 = $943;
9857 $969 = $635;
9858 $970 = (($968) - ($969))|0;
9859 $971 = HEAP32[$959>>2]|0;
9860 $972 = $971 & -2;
9861 HEAP32[$959>>2] = $972;
9862 $973 = $970 | 1;
9863 $974 = ((($635)) + 4|0);
9864 HEAP32[$974>>2] = $973;
9865 HEAP32[$943>>2] = $970;
9866 $975 = $970 >>> 3;
9867 $976 = ($970>>>0)<(256);
9868 if ($976) {
9869 $977 = $975 << 1;
9870 $978 = (212 + ($977<<2)|0);
9871 $979 = HEAP32[172>>2]|0;
9872 $980 = 1 << $975;
9873 $981 = $979 & $980;
9874 $982 = ($981|0)==(0);
9875 if ($982) {
9876 $983 = $979 | $980;
9877 HEAP32[172>>2] = $983;
9878 $$pre$i$i = (($977) + 2)|0;
9879 $$pre14$i$i = (212 + ($$pre$i$i<<2)|0);
9880 $$pre$phi$i$iZ2D = $$pre14$i$i;$F$0$i$i = $978;
9881 } else {
9882 $$sum4$i$i = (($977) + 2)|0;
9883 $984 = (212 + ($$sum4$i$i<<2)|0);
9884 $985 = HEAP32[$984>>2]|0;
9885 $986 = HEAP32[(188)>>2]|0;
9886 $987 = ($985>>>0)<($986>>>0);
9887 if ($987) {
9888 _abort();
9889 // unreachable;
9890 } else {
9891 $$pre$phi$i$iZ2D = $984;$F$0$i$i = $985;
9892 }
9893 }
9894 HEAP32[$$pre$phi$i$iZ2D>>2] = $635;
9895 $988 = ((($F$0$i$i)) + 12|0);
9896 HEAP32[$988>>2] = $635;
9897 $989 = ((($635)) + 8|0);
9898 HEAP32[$989>>2] = $F$0$i$i;
9899 $990 = ((($635)) + 12|0);
9900 HEAP32[$990>>2] = $978;
9901 break;
9902 }
9903 $991 = $970 >>> 8;
9904 $992 = ($991|0)==(0);
9905 if ($992) {
9906 $I1$0$i$i = 0;
9907 } else {
9908 $993 = ($970>>>0)>(16777215);
9909 if ($993) {
9910 $I1$0$i$i = 31;
9911 } else {
9912 $994 = (($991) + 1048320)|0;
9913 $995 = $994 >>> 16;
9914 $996 = $995 & 8;
9915 $997 = $991 << $996;
9916 $998 = (($997) + 520192)|0;
9917 $999 = $998 >>> 16;
9918 $1000 = $999 & 4;
9919 $1001 = $1000 | $996;
9920 $1002 = $997 << $1000;
9921 $1003 = (($1002) + 245760)|0;
9922 $1004 = $1003 >>> 16;
9923 $1005 = $1004 & 2;
9924 $1006 = $1001 | $1005;
9925 $1007 = (14 - ($1006))|0;
9926 $1008 = $1002 << $1005;
9927 $1009 = $1008 >>> 15;
9928 $1010 = (($1007) + ($1009))|0;
9929 $1011 = $1010 << 1;
9930 $1012 = (($1010) + 7)|0;
9931 $1013 = $970 >>> $1012;
9932 $1014 = $1013 & 1;
9933 $1015 = $1014 | $1011;
9934 $I1$0$i$i = $1015;
9935 }
9936 }
9937 $1016 = (476 + ($I1$0$i$i<<2)|0);
9938 $1017 = ((($635)) + 28|0);
9939 HEAP32[$1017>>2] = $I1$0$i$i;
9940 $1018 = ((($635)) + 20|0);
9941 HEAP32[$1018>>2] = 0;
9942 HEAP32[$941>>2] = 0;
9943 $1019 = HEAP32[(176)>>2]|0;
9944 $1020 = 1 << $I1$0$i$i;
9945 $1021 = $1019 & $1020;
9946 $1022 = ($1021|0)==(0);
9947 if ($1022) {
9948 $1023 = $1019 | $1020;
9949 HEAP32[(176)>>2] = $1023;
9950 HEAP32[$1016>>2] = $635;
9951 $1024 = ((($635)) + 24|0);
9952 HEAP32[$1024>>2] = $1016;
9953 $1025 = ((($635)) + 12|0);
9954 HEAP32[$1025>>2] = $635;
9955 $1026 = ((($635)) + 8|0);
9956 HEAP32[$1026>>2] = $635;
9957 break;
9958 }
9959 $1027 = HEAP32[$1016>>2]|0;
9960 $1028 = ((($1027)) + 4|0);
9961 $1029 = HEAP32[$1028>>2]|0;
9962 $1030 = $1029 & -8;
9963 $1031 = ($1030|0)==($970|0);
9964 L459: do {
9965 if ($1031) {
9966 $T$0$lcssa$i$i = $1027;
9967 } else {
9968 $1032 = ($I1$0$i$i|0)==(31);
9969 $1033 = $I1$0$i$i >>> 1;
9970 $1034 = (25 - ($1033))|0;
9971 $1035 = $1032 ? 0 : $1034;
9972 $1036 = $970 << $1035;
9973 $K2$07$i$i = $1036;$T$06$i$i = $1027;
9974 while(1) {
9975 $1043 = $K2$07$i$i >>> 31;
9976 $1044 = (((($T$06$i$i)) + 16|0) + ($1043<<2)|0);
9977 $1039 = HEAP32[$1044>>2]|0;
9978 $1045 = ($1039|0)==(0|0);
9979 if ($1045) {
9980 $$lcssa211 = $1044;$T$06$i$i$lcssa = $T$06$i$i;
9981 break;
9982 }
9983 $1037 = $K2$07$i$i << 1;
9984 $1038 = ((($1039)) + 4|0);
9985 $1040 = HEAP32[$1038>>2]|0;
9986 $1041 = $1040 & -8;
9987 $1042 = ($1041|0)==($970|0);
9988 if ($1042) {
9989 $T$0$lcssa$i$i = $1039;
9990 break L459;
9991 } else {
9992 $K2$07$i$i = $1037;$T$06$i$i = $1039;
9993 }
9994 }
9995 $1046 = HEAP32[(188)>>2]|0;
9996 $1047 = ($$lcssa211>>>0)<($1046>>>0);
9997 if ($1047) {
9998 _abort();
9999 // unreachable;
10000 } else {
10001 HEAP32[$$lcssa211>>2] = $635;
10002 $1048 = ((($635)) + 24|0);
10003 HEAP32[$1048>>2] = $T$06$i$i$lcssa;
10004 $1049 = ((($635)) + 12|0);
10005 HEAP32[$1049>>2] = $635;
10006 $1050 = ((($635)) + 8|0);
10007 HEAP32[$1050>>2] = $635;
10008 break L299;
10009 }
10010 }
10011 } while(0);
10012 $1051 = ((($T$0$lcssa$i$i)) + 8|0);
10013 $1052 = HEAP32[$1051>>2]|0;
10014 $1053 = HEAP32[(188)>>2]|0;
10015 $1054 = ($1052>>>0)>=($1053>>>0);
10016 $not$$i$i = ($T$0$lcssa$i$i>>>0)>=($1053>>>0);
10017 $1055 = $1054 & $not$$i$i;
10018 if ($1055) {
10019 $1056 = ((($1052)) + 12|0);
10020 HEAP32[$1056>>2] = $635;
10021 HEAP32[$1051>>2] = $635;
10022 $1057 = ((($635)) + 8|0);
10023 HEAP32[$1057>>2] = $1052;
10024 $1058 = ((($635)) + 12|0);
10025 HEAP32[$1058>>2] = $T$0$lcssa$i$i;
10026 $1059 = ((($635)) + 24|0);
10027 HEAP32[$1059>>2] = 0;
10028 break;
10029 } else {
10030 _abort();
10031 // unreachable;
10032 }
10033 }
10034 }
10035 } while(0);
10036 $1060 = HEAP32[(184)>>2]|0;
10037 $1061 = ($1060>>>0)>($nb$0>>>0);
10038 if ($1061) {
10039 $1062 = (($1060) - ($nb$0))|0;
10040 HEAP32[(184)>>2] = $1062;
10041 $1063 = HEAP32[(196)>>2]|0;
10042 $1064 = (($1063) + ($nb$0)|0);
10043 HEAP32[(196)>>2] = $1064;
10044 $1065 = $1062 | 1;
10045 $$sum$i32 = (($nb$0) + 4)|0;
10046 $1066 = (($1063) + ($$sum$i32)|0);
10047 HEAP32[$1066>>2] = $1065;
10048 $1067 = $nb$0 | 3;
10049 $1068 = ((($1063)) + 4|0);
10050 HEAP32[$1068>>2] = $1067;
10051 $1069 = ((($1063)) + 8|0);
10052 $mem$0 = $1069;
10053 return ($mem$0|0);
10054 }
10055 }
10056 $1070 = (___errno_location()|0);
10057 HEAP32[$1070>>2] = 12;
10058 $mem$0 = 0;
10059 return ($mem$0|0);
10060}
10061function _free($mem) {
10062 $mem = $mem|0;
10063 var $$lcssa = 0, $$pre = 0, $$pre$phi59Z2D = 0, $$pre$phi61Z2D = 0, $$pre$phiZ2D = 0, $$pre57 = 0, $$pre58 = 0, $$pre60 = 0, $$sum = 0, $$sum11 = 0, $$sum12 = 0, $$sum13 = 0, $$sum14 = 0, $$sum1718 = 0, $$sum19 = 0, $$sum2 = 0, $$sum20 = 0, $$sum22 = 0, $$sum23 = 0, $$sum24 = 0;
10064 var $$sum25 = 0, $$sum26 = 0, $$sum27 = 0, $$sum28 = 0, $$sum29 = 0, $$sum3 = 0, $$sum30 = 0, $$sum31 = 0, $$sum5 = 0, $$sum67 = 0, $$sum8 = 0, $$sum9 = 0, $0 = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0;
10065 var $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0;
10066 var $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 0, $132 = 0, $133 = 0, $134 = 0, $135 = 0, $136 = 0, $137 = 0, $138 = 0, $139 = 0, $14 = 0, $140 = 0;
10067 var $141 = 0, $142 = 0, $143 = 0, $144 = 0, $145 = 0, $146 = 0, $147 = 0, $148 = 0, $149 = 0, $15 = 0, $150 = 0, $151 = 0, $152 = 0, $153 = 0, $154 = 0, $155 = 0, $156 = 0, $157 = 0, $158 = 0, $159 = 0;
10068 var $16 = 0, $160 = 0, $161 = 0, $162 = 0, $163 = 0, $164 = 0, $165 = 0, $166 = 0, $167 = 0, $168 = 0, $169 = 0, $17 = 0, $170 = 0, $171 = 0, $172 = 0, $173 = 0, $174 = 0, $175 = 0, $176 = 0, $177 = 0;
10069 var $178 = 0, $179 = 0, $18 = 0, $180 = 0, $181 = 0, $182 = 0, $183 = 0, $184 = 0, $185 = 0, $186 = 0, $187 = 0, $188 = 0, $189 = 0, $19 = 0, $190 = 0, $191 = 0, $192 = 0, $193 = 0, $194 = 0, $195 = 0;
10070 var $196 = 0, $197 = 0, $198 = 0, $199 = 0, $2 = 0, $20 = 0, $200 = 0, $201 = 0, $202 = 0, $203 = 0, $204 = 0, $205 = 0, $206 = 0, $207 = 0, $208 = 0, $209 = 0, $21 = 0, $210 = 0, $211 = 0, $212 = 0;
10071 var $213 = 0, $214 = 0, $215 = 0, $216 = 0, $217 = 0, $218 = 0, $219 = 0, $22 = 0, $220 = 0, $221 = 0, $222 = 0, $223 = 0, $224 = 0, $225 = 0, $226 = 0, $227 = 0, $228 = 0, $229 = 0, $23 = 0, $230 = 0;
10072 var $231 = 0, $232 = 0, $233 = 0, $234 = 0, $235 = 0, $236 = 0, $237 = 0, $238 = 0, $239 = 0, $24 = 0, $240 = 0, $241 = 0, $242 = 0, $243 = 0, $244 = 0, $245 = 0, $246 = 0, $247 = 0, $248 = 0, $249 = 0;
10073 var $25 = 0, $250 = 0, $251 = 0, $252 = 0, $253 = 0, $254 = 0, $255 = 0, $256 = 0, $257 = 0, $258 = 0, $259 = 0, $26 = 0, $260 = 0, $261 = 0, $262 = 0, $263 = 0, $264 = 0, $265 = 0, $266 = 0, $267 = 0;
10074 var $268 = 0, $269 = 0, $27 = 0, $270 = 0, $271 = 0, $272 = 0, $273 = 0, $274 = 0, $275 = 0, $276 = 0, $277 = 0, $278 = 0, $279 = 0, $28 = 0, $280 = 0, $281 = 0, $282 = 0, $283 = 0, $284 = 0, $285 = 0;
10075 var $286 = 0, $287 = 0, $288 = 0, $289 = 0, $29 = 0, $290 = 0, $291 = 0, $292 = 0, $293 = 0, $294 = 0, $295 = 0, $296 = 0, $297 = 0, $298 = 0, $299 = 0, $3 = 0, $30 = 0, $300 = 0, $301 = 0, $302 = 0;
10076 var $303 = 0, $304 = 0, $305 = 0, $306 = 0, $307 = 0, $308 = 0, $309 = 0, $31 = 0, $310 = 0, $311 = 0, $312 = 0, $313 = 0, $314 = 0, $315 = 0, $316 = 0, $317 = 0, $318 = 0, $319 = 0, $32 = 0, $320 = 0;
10077 var $321 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0;
10078 var $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0;
10079 var $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0, $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0;
10080 var $87 = 0, $88 = 0, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $F16$0 = 0, $I18$0 = 0, $K19$052 = 0, $R$0 = 0, $R$0$lcssa = 0, $R$1 = 0;
10081 var $R7$0 = 0, $R7$0$lcssa = 0, $R7$1 = 0, $RP$0 = 0, $RP$0$lcssa = 0, $RP9$0 = 0, $RP9$0$lcssa = 0, $T$0$lcssa = 0, $T$051 = 0, $T$051$lcssa = 0, $cond = 0, $cond47 = 0, $not$ = 0, $p$0 = 0, $psize$0 = 0, $psize$1 = 0, $sp$0$i = 0, $sp$0$in$i = 0, label = 0, sp = 0;
10082 sp = STACKTOP;
10083 $0 = ($mem|0)==(0|0);
10084 if ($0) {
10085 return;
10086 }
10087 $1 = ((($mem)) + -8|0);
10088 $2 = HEAP32[(188)>>2]|0;
10089 $3 = ($1>>>0)<($2>>>0);
10090 if ($3) {
10091 _abort();
10092 // unreachable;
10093 }
10094 $4 = ((($mem)) + -4|0);
10095 $5 = HEAP32[$4>>2]|0;
10096 $6 = $5 & 3;
10097 $7 = ($6|0)==(1);
10098 if ($7) {
10099 _abort();
10100 // unreachable;
10101 }
10102 $8 = $5 & -8;
10103 $$sum = (($8) + -8)|0;
10104 $9 = (($mem) + ($$sum)|0);
10105 $10 = $5 & 1;
10106 $11 = ($10|0)==(0);
10107 do {
10108 if ($11) {
10109 $12 = HEAP32[$1>>2]|0;
10110 $13 = ($6|0)==(0);
10111 if ($13) {
10112 return;
10113 }
10114 $$sum2 = (-8 - ($12))|0;
10115 $14 = (($mem) + ($$sum2)|0);
10116 $15 = (($12) + ($8))|0;
10117 $16 = ($14>>>0)<($2>>>0);
10118 if ($16) {
10119 _abort();
10120 // unreachable;
10121 }
10122 $17 = HEAP32[(192)>>2]|0;
10123 $18 = ($14|0)==($17|0);
10124 if ($18) {
10125 $$sum3 = (($8) + -4)|0;
10126 $103 = (($mem) + ($$sum3)|0);
10127 $104 = HEAP32[$103>>2]|0;
10128 $105 = $104 & 3;
10129 $106 = ($105|0)==(3);
10130 if (!($106)) {
10131 $p$0 = $14;$psize$0 = $15;
10132 break;
10133 }
10134 HEAP32[(180)>>2] = $15;
10135 $107 = $104 & -2;
10136 HEAP32[$103>>2] = $107;
10137 $108 = $15 | 1;
10138 $$sum20 = (($$sum2) + 4)|0;
10139 $109 = (($mem) + ($$sum20)|0);
10140 HEAP32[$109>>2] = $108;
10141 HEAP32[$9>>2] = $15;
10142 return;
10143 }
10144 $19 = $12 >>> 3;
10145 $20 = ($12>>>0)<(256);
10146 if ($20) {
10147 $$sum30 = (($$sum2) + 8)|0;
10148 $21 = (($mem) + ($$sum30)|0);
10149 $22 = HEAP32[$21>>2]|0;
10150 $$sum31 = (($$sum2) + 12)|0;
10151 $23 = (($mem) + ($$sum31)|0);
10152 $24 = HEAP32[$23>>2]|0;
10153 $25 = $19 << 1;
10154 $26 = (212 + ($25<<2)|0);
10155 $27 = ($22|0)==($26|0);
10156 if (!($27)) {
10157 $28 = ($22>>>0)<($2>>>0);
10158 if ($28) {
10159 _abort();
10160 // unreachable;
10161 }
10162 $29 = ((($22)) + 12|0);
10163 $30 = HEAP32[$29>>2]|0;
10164 $31 = ($30|0)==($14|0);
10165 if (!($31)) {
10166 _abort();
10167 // unreachable;
10168 }
10169 }
10170 $32 = ($24|0)==($22|0);
10171 if ($32) {
10172 $33 = 1 << $19;
10173 $34 = $33 ^ -1;
10174 $35 = HEAP32[172>>2]|0;
10175 $36 = $35 & $34;
10176 HEAP32[172>>2] = $36;
10177 $p$0 = $14;$psize$0 = $15;
10178 break;
10179 }
10180 $37 = ($24|0)==($26|0);
10181 if ($37) {
10182 $$pre60 = ((($24)) + 8|0);
10183 $$pre$phi61Z2D = $$pre60;
10184 } else {
10185 $38 = ($24>>>0)<($2>>>0);
10186 if ($38) {
10187 _abort();
10188 // unreachable;
10189 }
10190 $39 = ((($24)) + 8|0);
10191 $40 = HEAP32[$39>>2]|0;
10192 $41 = ($40|0)==($14|0);
10193 if ($41) {
10194 $$pre$phi61Z2D = $39;
10195 } else {
10196 _abort();
10197 // unreachable;
10198 }
10199 }
10200 $42 = ((($22)) + 12|0);
10201 HEAP32[$42>>2] = $24;
10202 HEAP32[$$pre$phi61Z2D>>2] = $22;
10203 $p$0 = $14;$psize$0 = $15;
10204 break;
10205 }
10206 $$sum22 = (($$sum2) + 24)|0;
10207 $43 = (($mem) + ($$sum22)|0);
10208 $44 = HEAP32[$43>>2]|0;
10209 $$sum23 = (($$sum2) + 12)|0;
10210 $45 = (($mem) + ($$sum23)|0);
10211 $46 = HEAP32[$45>>2]|0;
10212 $47 = ($46|0)==($14|0);
10213 do {
10214 if ($47) {
10215 $$sum25 = (($$sum2) + 20)|0;
10216 $57 = (($mem) + ($$sum25)|0);
10217 $58 = HEAP32[$57>>2]|0;
10218 $59 = ($58|0)==(0|0);
10219 if ($59) {
10220 $$sum24 = (($$sum2) + 16)|0;
10221 $60 = (($mem) + ($$sum24)|0);
10222 $61 = HEAP32[$60>>2]|0;
10223 $62 = ($61|0)==(0|0);
10224 if ($62) {
10225 $R$1 = 0;
10226 break;
10227 } else {
10228 $R$0 = $61;$RP$0 = $60;
10229 }
10230 } else {
10231 $R$0 = $58;$RP$0 = $57;
10232 }
10233 while(1) {
10234 $63 = ((($R$0)) + 20|0);
10235 $64 = HEAP32[$63>>2]|0;
10236 $65 = ($64|0)==(0|0);
10237 if (!($65)) {
10238 $R$0 = $64;$RP$0 = $63;
10239 continue;
10240 }
10241 $66 = ((($R$0)) + 16|0);
10242 $67 = HEAP32[$66>>2]|0;
10243 $68 = ($67|0)==(0|0);
10244 if ($68) {
10245 $R$0$lcssa = $R$0;$RP$0$lcssa = $RP$0;
10246 break;
10247 } else {
10248 $R$0 = $67;$RP$0 = $66;
10249 }
10250 }
10251 $69 = ($RP$0$lcssa>>>0)<($2>>>0);
10252 if ($69) {
10253 _abort();
10254 // unreachable;
10255 } else {
10256 HEAP32[$RP$0$lcssa>>2] = 0;
10257 $R$1 = $R$0$lcssa;
10258 break;
10259 }
10260 } else {
10261 $$sum29 = (($$sum2) + 8)|0;
10262 $48 = (($mem) + ($$sum29)|0);
10263 $49 = HEAP32[$48>>2]|0;
10264 $50 = ($49>>>0)<($2>>>0);
10265 if ($50) {
10266 _abort();
10267 // unreachable;
10268 }
10269 $51 = ((($49)) + 12|0);
10270 $52 = HEAP32[$51>>2]|0;
10271 $53 = ($52|0)==($14|0);
10272 if (!($53)) {
10273 _abort();
10274 // unreachable;
10275 }
10276 $54 = ((($46)) + 8|0);
10277 $55 = HEAP32[$54>>2]|0;
10278 $56 = ($55|0)==($14|0);
10279 if ($56) {
10280 HEAP32[$51>>2] = $46;
10281 HEAP32[$54>>2] = $49;
10282 $R$1 = $46;
10283 break;
10284 } else {
10285 _abort();
10286 // unreachable;
10287 }
10288 }
10289 } while(0);
10290 $70 = ($44|0)==(0|0);
10291 if ($70) {
10292 $p$0 = $14;$psize$0 = $15;
10293 } else {
10294 $$sum26 = (($$sum2) + 28)|0;
10295 $71 = (($mem) + ($$sum26)|0);
10296 $72 = HEAP32[$71>>2]|0;
10297 $73 = (476 + ($72<<2)|0);
10298 $74 = HEAP32[$73>>2]|0;
10299 $75 = ($14|0)==($74|0);
10300 if ($75) {
10301 HEAP32[$73>>2] = $R$1;
10302 $cond = ($R$1|0)==(0|0);
10303 if ($cond) {
10304 $76 = 1 << $72;
10305 $77 = $76 ^ -1;
10306 $78 = HEAP32[(176)>>2]|0;
10307 $79 = $78 & $77;
10308 HEAP32[(176)>>2] = $79;
10309 $p$0 = $14;$psize$0 = $15;
10310 break;
10311 }
10312 } else {
10313 $80 = HEAP32[(188)>>2]|0;
10314 $81 = ($44>>>0)<($80>>>0);
10315 if ($81) {
10316 _abort();
10317 // unreachable;
10318 }
10319 $82 = ((($44)) + 16|0);
10320 $83 = HEAP32[$82>>2]|0;
10321 $84 = ($83|0)==($14|0);
10322 if ($84) {
10323 HEAP32[$82>>2] = $R$1;
10324 } else {
10325 $85 = ((($44)) + 20|0);
10326 HEAP32[$85>>2] = $R$1;
10327 }
10328 $86 = ($R$1|0)==(0|0);
10329 if ($86) {
10330 $p$0 = $14;$psize$0 = $15;
10331 break;
10332 }
10333 }
10334 $87 = HEAP32[(188)>>2]|0;
10335 $88 = ($R$1>>>0)<($87>>>0);
10336 if ($88) {
10337 _abort();
10338 // unreachable;
10339 }
10340 $89 = ((($R$1)) + 24|0);
10341 HEAP32[$89>>2] = $44;
10342 $$sum27 = (($$sum2) + 16)|0;
10343 $90 = (($mem) + ($$sum27)|0);
10344 $91 = HEAP32[$90>>2]|0;
10345 $92 = ($91|0)==(0|0);
10346 do {
10347 if (!($92)) {
10348 $93 = ($91>>>0)<($87>>>0);
10349 if ($93) {
10350 _abort();
10351 // unreachable;
10352 } else {
10353 $94 = ((($R$1)) + 16|0);
10354 HEAP32[$94>>2] = $91;
10355 $95 = ((($91)) + 24|0);
10356 HEAP32[$95>>2] = $R$1;
10357 break;
10358 }
10359 }
10360 } while(0);
10361 $$sum28 = (($$sum2) + 20)|0;
10362 $96 = (($mem) + ($$sum28)|0);
10363 $97 = HEAP32[$96>>2]|0;
10364 $98 = ($97|0)==(0|0);
10365 if ($98) {
10366 $p$0 = $14;$psize$0 = $15;
10367 } else {
10368 $99 = HEAP32[(188)>>2]|0;
10369 $100 = ($97>>>0)<($99>>>0);
10370 if ($100) {
10371 _abort();
10372 // unreachable;
10373 } else {
10374 $101 = ((($R$1)) + 20|0);
10375 HEAP32[$101>>2] = $97;
10376 $102 = ((($97)) + 24|0);
10377 HEAP32[$102>>2] = $R$1;
10378 $p$0 = $14;$psize$0 = $15;
10379 break;
10380 }
10381 }
10382 }
10383 } else {
10384 $p$0 = $1;$psize$0 = $8;
10385 }
10386 } while(0);
10387 $110 = ($p$0>>>0)<($9>>>0);
10388 if (!($110)) {
10389 _abort();
10390 // unreachable;
10391 }
10392 $$sum19 = (($8) + -4)|0;
10393 $111 = (($mem) + ($$sum19)|0);
10394 $112 = HEAP32[$111>>2]|0;
10395 $113 = $112 & 1;
10396 $114 = ($113|0)==(0);
10397 if ($114) {
10398 _abort();
10399 // unreachable;
10400 }
10401 $115 = $112 & 2;
10402 $116 = ($115|0)==(0);
10403 if ($116) {
10404 $117 = HEAP32[(196)>>2]|0;
10405 $118 = ($9|0)==($117|0);
10406 if ($118) {
10407 $119 = HEAP32[(184)>>2]|0;
10408 $120 = (($119) + ($psize$0))|0;
10409 HEAP32[(184)>>2] = $120;
10410 HEAP32[(196)>>2] = $p$0;
10411 $121 = $120 | 1;
10412 $122 = ((($p$0)) + 4|0);
10413 HEAP32[$122>>2] = $121;
10414 $123 = HEAP32[(192)>>2]|0;
10415 $124 = ($p$0|0)==($123|0);
10416 if (!($124)) {
10417 return;
10418 }
10419 HEAP32[(192)>>2] = 0;
10420 HEAP32[(180)>>2] = 0;
10421 return;
10422 }
10423 $125 = HEAP32[(192)>>2]|0;
10424 $126 = ($9|0)==($125|0);
10425 if ($126) {
10426 $127 = HEAP32[(180)>>2]|0;
10427 $128 = (($127) + ($psize$0))|0;
10428 HEAP32[(180)>>2] = $128;
10429 HEAP32[(192)>>2] = $p$0;
10430 $129 = $128 | 1;
10431 $130 = ((($p$0)) + 4|0);
10432 HEAP32[$130>>2] = $129;
10433 $131 = (($p$0) + ($128)|0);
10434 HEAP32[$131>>2] = $128;
10435 return;
10436 }
10437 $132 = $112 & -8;
10438 $133 = (($132) + ($psize$0))|0;
10439 $134 = $112 >>> 3;
10440 $135 = ($112>>>0)<(256);
10441 do {
10442 if ($135) {
10443 $136 = (($mem) + ($8)|0);
10444 $137 = HEAP32[$136>>2]|0;
10445 $$sum1718 = $8 | 4;
10446 $138 = (($mem) + ($$sum1718)|0);
10447 $139 = HEAP32[$138>>2]|0;
10448 $140 = $134 << 1;
10449 $141 = (212 + ($140<<2)|0);
10450 $142 = ($137|0)==($141|0);
10451 if (!($142)) {
10452 $143 = HEAP32[(188)>>2]|0;
10453 $144 = ($137>>>0)<($143>>>0);
10454 if ($144) {
10455 _abort();
10456 // unreachable;
10457 }
10458 $145 = ((($137)) + 12|0);
10459 $146 = HEAP32[$145>>2]|0;
10460 $147 = ($146|0)==($9|0);
10461 if (!($147)) {
10462 _abort();
10463 // unreachable;
10464 }
10465 }
10466 $148 = ($139|0)==($137|0);
10467 if ($148) {
10468 $149 = 1 << $134;
10469 $150 = $149 ^ -1;
10470 $151 = HEAP32[172>>2]|0;
10471 $152 = $151 & $150;
10472 HEAP32[172>>2] = $152;
10473 break;
10474 }
10475 $153 = ($139|0)==($141|0);
10476 if ($153) {
10477 $$pre58 = ((($139)) + 8|0);
10478 $$pre$phi59Z2D = $$pre58;
10479 } else {
10480 $154 = HEAP32[(188)>>2]|0;
10481 $155 = ($139>>>0)<($154>>>0);
10482 if ($155) {
10483 _abort();
10484 // unreachable;
10485 }
10486 $156 = ((($139)) + 8|0);
10487 $157 = HEAP32[$156>>2]|0;
10488 $158 = ($157|0)==($9|0);
10489 if ($158) {
10490 $$pre$phi59Z2D = $156;
10491 } else {
10492 _abort();
10493 // unreachable;
10494 }
10495 }
10496 $159 = ((($137)) + 12|0);
10497 HEAP32[$159>>2] = $139;
10498 HEAP32[$$pre$phi59Z2D>>2] = $137;
10499 } else {
10500 $$sum5 = (($8) + 16)|0;
10501 $160 = (($mem) + ($$sum5)|0);
10502 $161 = HEAP32[$160>>2]|0;
10503 $$sum67 = $8 | 4;
10504 $162 = (($mem) + ($$sum67)|0);
10505 $163 = HEAP32[$162>>2]|0;
10506 $164 = ($163|0)==($9|0);
10507 do {
10508 if ($164) {
10509 $$sum9 = (($8) + 12)|0;
10510 $175 = (($mem) + ($$sum9)|0);
10511 $176 = HEAP32[$175>>2]|0;
10512 $177 = ($176|0)==(0|0);
10513 if ($177) {
10514 $$sum8 = (($8) + 8)|0;
10515 $178 = (($mem) + ($$sum8)|0);
10516 $179 = HEAP32[$178>>2]|0;
10517 $180 = ($179|0)==(0|0);
10518 if ($180) {
10519 $R7$1 = 0;
10520 break;
10521 } else {
10522 $R7$0 = $179;$RP9$0 = $178;
10523 }
10524 } else {
10525 $R7$0 = $176;$RP9$0 = $175;
10526 }
10527 while(1) {
10528 $181 = ((($R7$0)) + 20|0);
10529 $182 = HEAP32[$181>>2]|0;
10530 $183 = ($182|0)==(0|0);
10531 if (!($183)) {
10532 $R7$0 = $182;$RP9$0 = $181;
10533 continue;
10534 }
10535 $184 = ((($R7$0)) + 16|0);
10536 $185 = HEAP32[$184>>2]|0;
10537 $186 = ($185|0)==(0|0);
10538 if ($186) {
10539 $R7$0$lcssa = $R7$0;$RP9$0$lcssa = $RP9$0;
10540 break;
10541 } else {
10542 $R7$0 = $185;$RP9$0 = $184;
10543 }
10544 }
10545 $187 = HEAP32[(188)>>2]|0;
10546 $188 = ($RP9$0$lcssa>>>0)<($187>>>0);
10547 if ($188) {
10548 _abort();
10549 // unreachable;
10550 } else {
10551 HEAP32[$RP9$0$lcssa>>2] = 0;
10552 $R7$1 = $R7$0$lcssa;
10553 break;
10554 }
10555 } else {
10556 $165 = (($mem) + ($8)|0);
10557 $166 = HEAP32[$165>>2]|0;
10558 $167 = HEAP32[(188)>>2]|0;
10559 $168 = ($166>>>0)<($167>>>0);
10560 if ($168) {
10561 _abort();
10562 // unreachable;
10563 }
10564 $169 = ((($166)) + 12|0);
10565 $170 = HEAP32[$169>>2]|0;
10566 $171 = ($170|0)==($9|0);
10567 if (!($171)) {
10568 _abort();
10569 // unreachable;
10570 }
10571 $172 = ((($163)) + 8|0);
10572 $173 = HEAP32[$172>>2]|0;
10573 $174 = ($173|0)==($9|0);
10574 if ($174) {
10575 HEAP32[$169>>2] = $163;
10576 HEAP32[$172>>2] = $166;
10577 $R7$1 = $163;
10578 break;
10579 } else {
10580 _abort();
10581 // unreachable;
10582 }
10583 }
10584 } while(0);
10585 $189 = ($161|0)==(0|0);
10586 if (!($189)) {
10587 $$sum12 = (($8) + 20)|0;
10588 $190 = (($mem) + ($$sum12)|0);
10589 $191 = HEAP32[$190>>2]|0;
10590 $192 = (476 + ($191<<2)|0);
10591 $193 = HEAP32[$192>>2]|0;
10592 $194 = ($9|0)==($193|0);
10593 if ($194) {
10594 HEAP32[$192>>2] = $R7$1;
10595 $cond47 = ($R7$1|0)==(0|0);
10596 if ($cond47) {
10597 $195 = 1 << $191;
10598 $196 = $195 ^ -1;
10599 $197 = HEAP32[(176)>>2]|0;
10600 $198 = $197 & $196;
10601 HEAP32[(176)>>2] = $198;
10602 break;
10603 }
10604 } else {
10605 $199 = HEAP32[(188)>>2]|0;
10606 $200 = ($161>>>0)<($199>>>0);
10607 if ($200) {
10608 _abort();
10609 // unreachable;
10610 }
10611 $201 = ((($161)) + 16|0);
10612 $202 = HEAP32[$201>>2]|0;
10613 $203 = ($202|0)==($9|0);
10614 if ($203) {
10615 HEAP32[$201>>2] = $R7$1;
10616 } else {
10617 $204 = ((($161)) + 20|0);
10618 HEAP32[$204>>2] = $R7$1;
10619 }
10620 $205 = ($R7$1|0)==(0|0);
10621 if ($205) {
10622 break;
10623 }
10624 }
10625 $206 = HEAP32[(188)>>2]|0;
10626 $207 = ($R7$1>>>0)<($206>>>0);
10627 if ($207) {
10628 _abort();
10629 // unreachable;
10630 }
10631 $208 = ((($R7$1)) + 24|0);
10632 HEAP32[$208>>2] = $161;
10633 $$sum13 = (($8) + 8)|0;
10634 $209 = (($mem) + ($$sum13)|0);
10635 $210 = HEAP32[$209>>2]|0;
10636 $211 = ($210|0)==(0|0);
10637 do {
10638 if (!($211)) {
10639 $212 = ($210>>>0)<($206>>>0);
10640 if ($212) {
10641 _abort();
10642 // unreachable;
10643 } else {
10644 $213 = ((($R7$1)) + 16|0);
10645 HEAP32[$213>>2] = $210;
10646 $214 = ((($210)) + 24|0);
10647 HEAP32[$214>>2] = $R7$1;
10648 break;
10649 }
10650 }
10651 } while(0);
10652 $$sum14 = (($8) + 12)|0;
10653 $215 = (($mem) + ($$sum14)|0);
10654 $216 = HEAP32[$215>>2]|0;
10655 $217 = ($216|0)==(0|0);
10656 if (!($217)) {
10657 $218 = HEAP32[(188)>>2]|0;
10658 $219 = ($216>>>0)<($218>>>0);
10659 if ($219) {
10660 _abort();
10661 // unreachable;
10662 } else {
10663 $220 = ((($R7$1)) + 20|0);
10664 HEAP32[$220>>2] = $216;
10665 $221 = ((($216)) + 24|0);
10666 HEAP32[$221>>2] = $R7$1;
10667 break;
10668 }
10669 }
10670 }
10671 }
10672 } while(0);
10673 $222 = $133 | 1;
10674 $223 = ((($p$0)) + 4|0);
10675 HEAP32[$223>>2] = $222;
10676 $224 = (($p$0) + ($133)|0);
10677 HEAP32[$224>>2] = $133;
10678 $225 = HEAP32[(192)>>2]|0;
10679 $226 = ($p$0|0)==($225|0);
10680 if ($226) {
10681 HEAP32[(180)>>2] = $133;
10682 return;
10683 } else {
10684 $psize$1 = $133;
10685 }
10686 } else {
10687 $227 = $112 & -2;
10688 HEAP32[$111>>2] = $227;
10689 $228 = $psize$0 | 1;
10690 $229 = ((($p$0)) + 4|0);
10691 HEAP32[$229>>2] = $228;
10692 $230 = (($p$0) + ($psize$0)|0);
10693 HEAP32[$230>>2] = $psize$0;
10694 $psize$1 = $psize$0;
10695 }
10696 $231 = $psize$1 >>> 3;
10697 $232 = ($psize$1>>>0)<(256);
10698 if ($232) {
10699 $233 = $231 << 1;
10700 $234 = (212 + ($233<<2)|0);
10701 $235 = HEAP32[172>>2]|0;
10702 $236 = 1 << $231;
10703 $237 = $235 & $236;
10704 $238 = ($237|0)==(0);
10705 if ($238) {
10706 $239 = $235 | $236;
10707 HEAP32[172>>2] = $239;
10708 $$pre = (($233) + 2)|0;
10709 $$pre57 = (212 + ($$pre<<2)|0);
10710 $$pre$phiZ2D = $$pre57;$F16$0 = $234;
10711 } else {
10712 $$sum11 = (($233) + 2)|0;
10713 $240 = (212 + ($$sum11<<2)|0);
10714 $241 = HEAP32[$240>>2]|0;
10715 $242 = HEAP32[(188)>>2]|0;
10716 $243 = ($241>>>0)<($242>>>0);
10717 if ($243) {
10718 _abort();
10719 // unreachable;
10720 } else {
10721 $$pre$phiZ2D = $240;$F16$0 = $241;
10722 }
10723 }
10724 HEAP32[$$pre$phiZ2D>>2] = $p$0;
10725 $244 = ((($F16$0)) + 12|0);
10726 HEAP32[$244>>2] = $p$0;
10727 $245 = ((($p$0)) + 8|0);
10728 HEAP32[$245>>2] = $F16$0;
10729 $246 = ((($p$0)) + 12|0);
10730 HEAP32[$246>>2] = $234;
10731 return;
10732 }
10733 $247 = $psize$1 >>> 8;
10734 $248 = ($247|0)==(0);
10735 if ($248) {
10736 $I18$0 = 0;
10737 } else {
10738 $249 = ($psize$1>>>0)>(16777215);
10739 if ($249) {
10740 $I18$0 = 31;
10741 } else {
10742 $250 = (($247) + 1048320)|0;
10743 $251 = $250 >>> 16;
10744 $252 = $251 & 8;
10745 $253 = $247 << $252;
10746 $254 = (($253) + 520192)|0;
10747 $255 = $254 >>> 16;
10748 $256 = $255 & 4;
10749 $257 = $256 | $252;
10750 $258 = $253 << $256;
10751 $259 = (($258) + 245760)|0;
10752 $260 = $259 >>> 16;
10753 $261 = $260 & 2;
10754 $262 = $257 | $261;
10755 $263 = (14 - ($262))|0;
10756 $264 = $258 << $261;
10757 $265 = $264 >>> 15;
10758 $266 = (($263) + ($265))|0;
10759 $267 = $266 << 1;
10760 $268 = (($266) + 7)|0;
10761 $269 = $psize$1 >>> $268;
10762 $270 = $269 & 1;
10763 $271 = $270 | $267;
10764 $I18$0 = $271;
10765 }
10766 }
10767 $272 = (476 + ($I18$0<<2)|0);
10768 $273 = ((($p$0)) + 28|0);
10769 HEAP32[$273>>2] = $I18$0;
10770 $274 = ((($p$0)) + 16|0);
10771 $275 = ((($p$0)) + 20|0);
10772 HEAP32[$275>>2] = 0;
10773 HEAP32[$274>>2] = 0;
10774 $276 = HEAP32[(176)>>2]|0;
10775 $277 = 1 << $I18$0;
10776 $278 = $276 & $277;
10777 $279 = ($278|0)==(0);
10778 L199: do {
10779 if ($279) {
10780 $280 = $276 | $277;
10781 HEAP32[(176)>>2] = $280;
10782 HEAP32[$272>>2] = $p$0;
10783 $281 = ((($p$0)) + 24|0);
10784 HEAP32[$281>>2] = $272;
10785 $282 = ((($p$0)) + 12|0);
10786 HEAP32[$282>>2] = $p$0;
10787 $283 = ((($p$0)) + 8|0);
10788 HEAP32[$283>>2] = $p$0;
10789 } else {
10790 $284 = HEAP32[$272>>2]|0;
10791 $285 = ((($284)) + 4|0);
10792 $286 = HEAP32[$285>>2]|0;
10793 $287 = $286 & -8;
10794 $288 = ($287|0)==($psize$1|0);
10795 L202: do {
10796 if ($288) {
10797 $T$0$lcssa = $284;
10798 } else {
10799 $289 = ($I18$0|0)==(31);
10800 $290 = $I18$0 >>> 1;
10801 $291 = (25 - ($290))|0;
10802 $292 = $289 ? 0 : $291;
10803 $293 = $psize$1 << $292;
10804 $K19$052 = $293;$T$051 = $284;
10805 while(1) {
10806 $300 = $K19$052 >>> 31;
10807 $301 = (((($T$051)) + 16|0) + ($300<<2)|0);
10808 $296 = HEAP32[$301>>2]|0;
10809 $302 = ($296|0)==(0|0);
10810 if ($302) {
10811 $$lcssa = $301;$T$051$lcssa = $T$051;
10812 break;
10813 }
10814 $294 = $K19$052 << 1;
10815 $295 = ((($296)) + 4|0);
10816 $297 = HEAP32[$295>>2]|0;
10817 $298 = $297 & -8;
10818 $299 = ($298|0)==($psize$1|0);
10819 if ($299) {
10820 $T$0$lcssa = $296;
10821 break L202;
10822 } else {
10823 $K19$052 = $294;$T$051 = $296;
10824 }
10825 }
10826 $303 = HEAP32[(188)>>2]|0;
10827 $304 = ($$lcssa>>>0)<($303>>>0);
10828 if ($304) {
10829 _abort();
10830 // unreachable;
10831 } else {
10832 HEAP32[$$lcssa>>2] = $p$0;
10833 $305 = ((($p$0)) + 24|0);
10834 HEAP32[$305>>2] = $T$051$lcssa;
10835 $306 = ((($p$0)) + 12|0);
10836 HEAP32[$306>>2] = $p$0;
10837 $307 = ((($p$0)) + 8|0);
10838 HEAP32[$307>>2] = $p$0;
10839 break L199;
10840 }
10841 }
10842 } while(0);
10843 $308 = ((($T$0$lcssa)) + 8|0);
10844 $309 = HEAP32[$308>>2]|0;
10845 $310 = HEAP32[(188)>>2]|0;
10846 $311 = ($309>>>0)>=($310>>>0);
10847 $not$ = ($T$0$lcssa>>>0)>=($310>>>0);
10848 $312 = $311 & $not$;
10849 if ($312) {
10850 $313 = ((($309)) + 12|0);
10851 HEAP32[$313>>2] = $p$0;
10852 HEAP32[$308>>2] = $p$0;
10853 $314 = ((($p$0)) + 8|0);
10854 HEAP32[$314>>2] = $309;
10855 $315 = ((($p$0)) + 12|0);
10856 HEAP32[$315>>2] = $T$0$lcssa;
10857 $316 = ((($p$0)) + 24|0);
10858 HEAP32[$316>>2] = 0;
10859 break;
10860 } else {
10861 _abort();
10862 // unreachable;
10863 }
10864 }
10865 } while(0);
10866 $317 = HEAP32[(204)>>2]|0;
10867 $318 = (($317) + -1)|0;
10868 HEAP32[(204)>>2] = $318;
10869 $319 = ($318|0)==(0);
10870 if ($319) {
10871 $sp$0$in$i = (628);
10872 } else {
10873 return;
10874 }
10875 while(1) {
10876 $sp$0$i = HEAP32[$sp$0$in$i>>2]|0;
10877 $320 = ($sp$0$i|0)==(0|0);
10878 $321 = ((($sp$0$i)) + 8|0);
10879 if ($320) {
10880 break;
10881 } else {
10882 $sp$0$in$i = $321;
10883 }
10884 }
10885 HEAP32[(204)>>2] = -1;
10886 return;
10887}
10888function runPostSets() {
10889}
10890function _memset(ptr, value, num) {
10891 ptr = ptr|0; value = value|0; num = num|0;
10892 var stop = 0, value4 = 0, stop4 = 0, unaligned = 0;
10893 stop = (ptr + num)|0;
10894 if ((num|0) >= 20) {
10895 // This is unaligned, but quite large, so work hard to get to aligned settings
10896 value = value & 0xff;
10897 unaligned = ptr & 3;
10898 value4 = value | (value << 8) | (value << 16) | (value << 24);
10899 stop4 = stop & ~3;
10900 if (unaligned) {
10901 unaligned = (ptr + 4 - unaligned)|0;
10902 while ((ptr|0) < (unaligned|0)) { // no need to check for stop, since we have large num
10903 HEAP8[((ptr)>>0)]=value;
10904 ptr = (ptr+1)|0;
10905 }
10906 }
10907 while ((ptr|0) < (stop4|0)) {
10908 HEAP32[((ptr)>>2)]=value4;
10909 ptr = (ptr+4)|0;
10910 }
10911 }
10912 while ((ptr|0) < (stop|0)) {
10913 HEAP8[((ptr)>>0)]=value;
10914 ptr = (ptr+1)|0;
10915 }
10916 return (ptr-num)|0;
10917}
10918function _bitshift64Lshr(low, high, bits) {
10919 low = low|0; high = high|0; bits = bits|0;
10920 var ander = 0;
10921 if ((bits|0) < 32) {
10922 ander = ((1 << bits) - 1)|0;
10923 tempRet0 = high >>> bits;
10924 return (low >>> bits) | ((high&ander) << (32 - bits));
10925 }
10926 tempRet0 = 0;
10927 return (high >>> (bits - 32))|0;
10928}
10929function _memcpy(dest, src, num) {
10930 dest = dest|0; src = src|0; num = num|0;
10931 var ret = 0;
10932 if ((num|0) >= 4096) return _emscripten_memcpy_big(dest|0, src|0, num|0)|0;
10933 ret = dest|0;
10934 if ((dest&3) == (src&3)) {
10935 while (dest & 3) {
10936 if ((num|0) == 0) return ret|0;
10937 HEAP8[((dest)>>0)]=((HEAP8[((src)>>0)])|0);
10938 dest = (dest+1)|0;
10939 src = (src+1)|0;
10940 num = (num-1)|0;
10941 }
10942 while ((num|0) >= 4) {
10943 HEAP32[((dest)>>2)]=((HEAP32[((src)>>2)])|0);
10944 dest = (dest+4)|0;
10945 src = (src+4)|0;
10946 num = (num-4)|0;
10947 }
10948 }
10949 while ((num|0) > 0) {
10950 HEAP8[((dest)>>0)]=((HEAP8[((src)>>0)])|0);
10951 dest = (dest+1)|0;
10952 src = (src+1)|0;
10953 num = (num-1)|0;
10954 }
10955 return ret|0;
10956}
10957
10958
10959function dynCall_ii(index,a1) {
10960 index = index|0;
10961 a1=a1|0;
10962 return FUNCTION_TABLE_ii[index&1](a1|0)|0;
10963}
10964
10965
10966function dynCall_iiii(index,a1,a2,a3) {
10967 index = index|0;
10968 a1=a1|0; a2=a2|0; a3=a3|0;
10969 return FUNCTION_TABLE_iiii[index&7](a1|0,a2|0,a3|0)|0;
10970}
10971
10972
10973function dynCall_vi(index,a1) {
10974 index = index|0;
10975 a1=a1|0;
10976 FUNCTION_TABLE_vi[index&7](a1|0);
10977}
10978
10979function b0(p0) {
10980 p0 = p0|0; nullFunc_ii(0);return 0;
10981}
10982function b1(p0,p1,p2) {
10983 p0 = p0|0;p1 = p1|0;p2 = p2|0; nullFunc_iiii(1);return 0;
10984}
10985function b2(p0) {
10986 p0 = p0|0; nullFunc_vi(2);
10987}
10988
10989// EMSCRIPTEN_END_FUNCS
10990var FUNCTION_TABLE_ii = [b0,___stdio_close];
10991var FUNCTION_TABLE_iiii = [b1,b1,___stdout_write,___stdio_seek,b1,___stdio_write,b1,b1];
10992var FUNCTION_TABLE_vi = [b2,b2,b2,b2,_cleanup526,b2,b2,b2];
10993
10994 return { _free: _free, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, _loadMemory: _loadMemory, _bitshift64Lshr: _bitshift64Lshr, _fflush: _fflush, ___errno_location: ___errno_location, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, establishStackSpace: establishStackSpace, setThrew: setThrew, setTempRet0: setTempRet0, getTempRet0: getTempRet0, dynCall_ii: dynCall_ii, dynCall_iiii: dynCall_iiii, dynCall_vi: dynCall_vi };
10995})
10996// EMSCRIPTEN_END_ASM
10997(Module.asmGlobalArg, Module.asmLibraryArg, buffer);
10998var real__free = asm["_free"]; asm["_free"] = function() {
10999assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11000assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11001return real__free.apply(null, arguments);
11002};
11003
11004var real__malloc = asm["_malloc"]; asm["_malloc"] = function() {
11005assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11006assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11007return real__malloc.apply(null, arguments);
11008};
11009
11010var real__loadMemory = asm["_loadMemory"]; asm["_loadMemory"] = function() {
11011assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11012assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11013return real__loadMemory.apply(null, arguments);
11014};
11015
11016var real__bitshift64Lshr = asm["_bitshift64Lshr"]; asm["_bitshift64Lshr"] = function() {
11017assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11018assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11019return real__bitshift64Lshr.apply(null, arguments);
11020};
11021
11022var real__fflush = asm["_fflush"]; asm["_fflush"] = function() {
11023assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11024assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11025return real__fflush.apply(null, arguments);
11026};
11027
11028var real____errno_location = asm["___errno_location"]; asm["___errno_location"] = function() {
11029assert(runtimeInitialized, 'you need to wait for the runtime to be ready (e.g. wait for main() to be called)');
11030assert(!runtimeExited, 'the runtime was exited (use NO_EXIT_RUNTIME to keep it alive after main() exits)');
11031return real____errno_location.apply(null, arguments);
11032};
11033var _free = Module["_free"] = asm["_free"];
11034var runPostSets = Module["runPostSets"] = asm["runPostSets"];
11035var _memset = Module["_memset"] = asm["_memset"];
11036var _malloc = Module["_malloc"] = asm["_malloc"];
11037var _memcpy = Module["_memcpy"] = asm["_memcpy"];
11038var _loadMemory = Module["_loadMemory"] = asm["_loadMemory"];
11039var _bitshift64Lshr = Module["_bitshift64Lshr"] = asm["_bitshift64Lshr"];
11040var _fflush = Module["_fflush"] = asm["_fflush"];
11041var ___errno_location = Module["___errno_location"] = asm["___errno_location"];
11042var dynCall_ii = Module["dynCall_ii"] = asm["dynCall_ii"];
11043var dynCall_iiii = Module["dynCall_iiii"] = asm["dynCall_iiii"];
11044var dynCall_vi = Module["dynCall_vi"] = asm["dynCall_vi"];
11045;
11046
11047Runtime.stackAlloc = asm['stackAlloc'];
11048Runtime.stackSave = asm['stackSave'];
11049Runtime.stackRestore = asm['stackRestore'];
11050Runtime.establishStackSpace = asm['establishStackSpace'];
11051
11052Runtime.setTempRet0 = asm['setTempRet0'];
11053Runtime.getTempRet0 = asm['getTempRet0'];
11054
11055
11056
11057// === Auto-generated postamble setup entry stuff ===
11058
11059
11060function ExitStatus(status) {
11061 this.name = "ExitStatus";
11062 this.message = "Program terminated with exit(" + status + ")";
11063 this.status = status;
11064};
11065ExitStatus.prototype = new Error();
11066ExitStatus.prototype.constructor = ExitStatus;
11067
11068var initialStackTop;
11069var preloadStartTime = null;
11070var calledMain = false;
11071
11072dependenciesFulfilled = function runCaller() {
11073 // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
11074 if (!Module['calledRun']) run();
11075 if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
11076}
11077
11078Module['callMain'] = Module.callMain = function callMain(args) {
11079 assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
11080 assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
11081
11082 args = args || [];
11083
11084 ensureInitRuntime();
11085
11086 var argc = args.length+1;
11087 function pad() {
11088 for (var i = 0; i < 4-1; i++) {
11089 argv.push(0);
11090 }
11091 }
11092 var argv = [allocate(intArrayFromString(Module['thisProgram']), 'i8', ALLOC_NORMAL) ];
11093 pad();
11094 for (var i = 0; i < argc-1; i = i + 1) {
11095 argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
11096 pad();
11097 }
11098 argv.push(0);
11099 argv = allocate(argv, 'i32', ALLOC_NORMAL);
11100
11101
11102 try {
11103
11104 var ret = Module['_main'](argc, argv, 0);
11105
11106
11107 // if we're not running an evented main loop, it's time to exit
11108 exit(ret, /* implicit = */ true);
11109 }
11110 catch(e) {
11111 if (e instanceof ExitStatus) {
11112 // exit() throws this once it's done to make sure execution
11113 // has been stopped completely
11114 return;
11115 } else if (e == 'SimulateInfiniteLoop') {
11116 // running an evented main loop, don't immediately exit
11117 Module['noExitRuntime'] = true;
11118 return;
11119 } else {
11120 if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
11121 throw e;
11122 }
11123 } finally {
11124 calledMain = true;
11125 }
11126}
11127
11128
11129
11130
11131function run(args) {
11132 args = args || Module['arguments'];
11133
11134 if (preloadStartTime === null) preloadStartTime = Date.now();
11135
11136 if (runDependencies > 0) {
11137 Module.printErr('run() called, but dependencies remain, so not running');
11138 return;
11139 }
11140
11141 preRun();
11142
11143 if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
11144 if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
11145
11146 function doRun() {
11147 if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
11148 Module['calledRun'] = true;
11149
11150 if (ABORT) return;
11151
11152 ensureInitRuntime();
11153
11154 preMain();
11155
11156 if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
11157 Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
11158 }
11159
11160 if (Module['onRuntimeInitialized']) Module['onRuntimeInitialized']();
11161
11162 if (Module['_main'] && shouldRunNow) Module['callMain'](args);
11163
11164 postRun();
11165 }
11166
11167 if (Module['setStatus']) {
11168 Module['setStatus']('Running...');
11169 setTimeout(function() {
11170 setTimeout(function() {
11171 Module['setStatus']('');
11172 }, 1);
11173 doRun();
11174 }, 1);
11175 } else {
11176 doRun();
11177 }
11178}
11179Module['run'] = Module.run = run;
11180
11181function exit(status, implicit) {
11182 if (implicit && Module['noExitRuntime']) {
11183 Module.printErr('exit(' + status + ') implicitly called by end of main(), but noExitRuntime, so not exiting the runtime (you can use emscripten_force_exit, if you want to force a true shutdown)');
11184 return;
11185 }
11186
11187 if (Module['noExitRuntime']) {
11188 Module.printErr('exit(' + status + ') called, but noExitRuntime, so halting execution but not exiting the runtime or preventing further async execution (you can use emscripten_force_exit, if you want to force a true shutdown)');
11189 } else {
11190
11191 ABORT = true;
11192 EXITSTATUS = status;
11193 STACKTOP = initialStackTop;
11194
11195 exitRuntime();
11196
11197 if (Module['onExit']) Module['onExit'](status);
11198 }
11199
11200 if (ENVIRONMENT_IS_NODE) {
11201 // Work around a node.js bug where stdout buffer is not flushed at process exit:
11202 // Instead of process.exit() directly, wait for stdout flush event.
11203 // See https://github.com/joyent/node/issues/1669 and https://github.com/kripken/emscripten/issues/2582
11204 // Workaround is based on https://github.com/RReverser/acorn/commit/50ab143cecc9ed71a2d66f78b4aec3bb2e9844f6
11205 process['stdout']['once']('drain', function () {
11206 process['exit'](status);
11207 });
11208 console.log(' '); // Make sure to print something to force the drain event to occur, in case the stdout buffer was empty.
11209 // Work around another node bug where sometimes 'drain' is never fired - make another effort
11210 // to emit the exit status, after a significant delay (if node hasn't fired drain by then, give up)
11211 setTimeout(function() {
11212 process['exit'](status);
11213 }, 500);
11214 } else
11215 if (ENVIRONMENT_IS_SHELL && typeof quit === 'function') {
11216 quit(status);
11217 }
11218 // if we reach here, we must throw an exception to halt the current execution
11219 throw new ExitStatus(status);
11220}
11221Module['exit'] = Module.exit = exit;
11222
11223var abortDecorators = [];
11224
11225function abort(what) {
11226 if (what !== undefined) {
11227 Module.print(what);
11228 Module.printErr(what);
11229 what = JSON.stringify(what)
11230 } else {
11231 what = '';
11232 }
11233
11234 ABORT = true;
11235 EXITSTATUS = 1;
11236
11237 var extra = '';
11238
11239 var output = 'abort(' + what + ') at ' + stackTrace() + extra;
11240 if (abortDecorators) {
11241 abortDecorators.forEach(function(decorator) {
11242 output = decorator(output, what);
11243 });
11244 }
11245 throw output;
11246}
11247Module['abort'] = Module.abort = abort;
11248
11249// {{PRE_RUN_ADDITIONS}}
11250
11251if (Module['preInit']) {
11252 if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
11253 while (Module['preInit'].length > 0) {
11254 Module['preInit'].pop()();
11255 }
11256}
11257
11258// shouldRunNow refers to calling main(), not run().
11259var shouldRunNow = true;
11260if (Module['noInitialRun']) {
11261 shouldRunNow = false;
11262}
11263
11264
11265run();
11266
11267// {{POST_RUN_ADDITIONS}}
11268
11269
11270
11271
11272
11273
11274// {{MODULE_ADDITIONS}}