PageRenderTime 109ms CodeModel.GetById 19ms RepoModel.GetById 0ms app.codeStats 2ms

/test/mjsunit/asm/embenchen/lua_binarytrees.js

http://v8.googlecode.com/
JavaScript | 14373 lines | 13162 code | 592 blank | 619 comment | 3858 complexity | 4bf4fb04b77a8edbd76184a5ed3432a9 MD5 | raw file
Possible License(s): BSD-3-Clause 
    

  1. // Copyright 2014 the V8 project authors. All rights reserved.
    2. 

  2. // Use of this source code is governed by a BSD-style license that can be
    3. 

  3. // found in the LICENSE file.
    4. 

  4. 

  5. var EXPECTED_OUTPUT =
    6. 

  6.   'stretch tree of depth 10\t check: -1\n' +
    7. 

  7.   '1448\t trees of depth 4\t check: -1448\n' +
    8. 

  8.   '362\t trees of depth 6\t check: -362\n' +
    9. 

  9.   '90\t trees of depth 8\t check: -90\n' +
    10. 

  10.   'long lived tree of depth 9\t check: -1\n';
    11. 

  11. var Module = {
    12. 

  12.   arguments: [1],
    13. 

  13.   print: function(x) {Module.printBuffer += x + '\n';},
    14. 

  14.   preRun: [function() {Module.printBuffer = ''}],
    15. 

  15.   postRun: [function() {
    16. 

  16.     assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
    17. 

  17.   }],
    18. 

  18. };
    19. 

  19. 

  20. var Module;
    21. 

  21. if (typeof Module === 'undefined') Module = eval('(function() { try { return Module || {} } catch(e) { return {} } })()');
    22. 

  22. if (!Module.expectedDataFileDownloads) {
    23. 

  23.   Module.expectedDataFileDownloads = 0;
    24. 

  24.   Module.finishedDataFileDownloads = 0;
    25. 

  25. }
    26. 

  26. Module.expectedDataFileDownloads++;
    27. 

  27. (function() {
    28. 

  28. 

  29.   function runWithFS() {
    30. 

  30. 

  31. function assert(check, msg) {
    32. 

  32.   if (!check) throw msg + new Error().stack;
    33. 

  33. }
    34. 

  34. Module['FS_createDataFile']('/', 'binarytrees.lua', [45, 45, 32, 84, 104, 101, 32, 67, 111, 109, 112, 117, 116, 101, 114, 32, 76, 97, 110, 103, 117, 97, 103, 101, 32, 66, 101, 110, 99, 104, 109, 97, 114, 107, 115, 32, 71, 97, 109, 101, 10, 45, 45, 32, 104, 116, 116, 112, 58, 47, 47, 98, 101, 110, 99, 104, 109, 97, 114, 107, 115, 103, 97, 109, 101, 46, 97, 108, 105, 111, 116, 104, 46, 100, 101, 98, 105, 97, 110, 46, 111, 114, 103, 47, 10, 45, 45, 32, 99, 111, 110, 116, 114, 105, 98, 117, 116, 101, 100, 32, 98, 121, 32, 77, 105, 107, 101, 32, 80, 97, 108, 108, 10, 10, 108, 111, 99, 97, 108, 32, 102, 117, 110, 99, 116, 105, 111, 110, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 116, 101, 109, 44, 32, 100, 101, 112, 116, 104, 41, 10, 32, 32, 105, 102, 32, 100, 101, 112, 116, 104, 32, 62, 32, 48, 32, 116, 104, 101, 110, 10, 32, 32, 32, 32, 108, 111, 99, 97, 108, 32, 105, 32, 61, 32, 105, 116, 101, 109, 32, 43, 32, 105, 116, 101, 109, 10, 32, 32, 32, 32, 100, 101, 112, 116, 104, 32, 61, 32, 100, 101, 112, 116, 104, 32, 45, 32, 49, 10, 32, 32, 32, 32, 108, 111, 99, 97, 108, 32, 108, 101, 102, 116, 44, 32, 114, 105, 103, 104, 116, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 45, 49, 44, 32, 100, 101, 112, 116, 104, 41, 44, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 44, 32, 100, 101, 112, 116, 104, 41, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 123, 32, 105, 116, 101, 109, 44, 32, 108, 101, 102, 116, 44, 32, 114, 105, 103, 104, 116, 32, 125, 10, 32, 32, 101, 108, 115, 101, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 123, 32, 105, 116, 101, 109, 32, 125, 10, 32, 32, 101, 110, 100, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 102, 117, 110, 99, 116, 105, 111, 110, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 41, 10, 32, 32, 105, 102, 32, 116, 114, 101, 101, 91, 50, 93, 32, 116, 104, 101, 110, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 116, 114, 101, 101, 91, 49, 93, 32, 43, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 91, 50, 93, 41, 32, 45, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 91, 51, 93, 41, 10, 32, 32, 101, 108, 115, 101, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 116, 114, 101, 101, 91, 49, 93, 10, 32, 32, 101, 110, 100, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 78, 32, 61, 32, 116, 111, 110, 117, 109, 98, 101, 114, 40, 97, 114, 103, 32, 97, 110, 100, 32, 97, 114, 103, 91, 49, 93, 41, 32, 111, 114, 32, 52, 10, 10, 105, 102, 32, 78, 32, 61, 61, 32, 48, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 48, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 49, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 57, 46, 53, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 50, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 49, 46, 57, 57, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 51, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 50, 46, 56, 53, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 52, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 52, 46, 55, 50, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 53, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 53, 46, 56, 50, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 109, 105, 110, 100, 101, 112, 116, 104, 32, 61, 32, 52, 10, 108, 111, 99, 97, 108, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 61, 32, 109, 105, 110, 100, 101, 112, 116, 104, 32, 43, 32, 50, 10, 105, 102, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 60, 32, 78, 32, 116, 104, 101, 110, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 61, 32, 78, 32, 101, 110, 100, 10, 10, 100, 111, 10, 32, 32, 108, 111, 99, 97, 108, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 32, 61, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 43, 32, 49, 10, 32, 32, 108, 111, 99, 97, 108, 32, 115, 116, 114, 101, 116, 99, 104, 116, 114, 101, 101, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 48, 44, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 41, 10, 32, 32, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 115, 116, 114, 101, 116, 99, 104, 32, 116, 114, 101, 101, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 32, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 44, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 115, 116, 114, 101, 116, 99, 104, 116, 114, 101, 101, 41, 41, 41, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 108, 111, 110, 103, 108, 105, 118, 101, 100, 116, 114, 101, 101, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 48, 44, 32, 109, 97, 120, 100, 101, 112, 116, 104, 41, 10, 10, 102, 111, 114, 32, 100, 101, 112, 116, 104, 61, 109, 105, 110, 100, 101, 112, 116, 104, 44, 109, 97, 120, 100, 101, 112, 116, 104, 44, 50, 32, 100, 111, 10, 32, 32, 108, 111, 99, 97, 108, 32, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 32, 61, 32, 50, 32, 94, 32, 40, 109, 97, 120, 100, 101, 112, 116, 104, 32, 45, 32, 100, 101, 112, 116, 104, 32, 43, 32, 109, 105, 110, 100, 101, 112, 116, 104, 41, 10, 32, 32, 108, 111, 99, 97, 108, 32, 99, 104, 101, 99, 107, 32, 61, 32, 48, 10, 32, 32, 102, 111, 114, 32, 105, 61, 49, 44, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 32, 100, 111, 10, 32, 32, 32, 32, 99, 104, 101, 99, 107, 32, 61, 32, 99, 104, 101, 99, 107, 32, 43, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 49, 44, 32, 100, 101, 112, 116, 104, 41, 41, 32, 43, 10, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 45, 49, 44, 32, 100, 101, 112, 116, 104, 41, 41, 10, 32, 32, 101, 110, 100, 10, 32, 32, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 37, 100, 92, 116, 32, 116, 114, 101, 101, 115, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 32, 32, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 42, 50, 44, 32, 100, 101, 112, 116, 104, 44, 32, 99, 104, 101, 99, 107, 41, 41, 10, 101, 110, 100, 10, 10, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 108, 111, 110, 103, 32, 108, 105, 118, 101, 100, 32, 116, 114, 101, 101, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 109, 97, 120, 100, 101, 112, 116, 104, 44, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 108, 111, 110, 103, 108, 105, 118, 101, 100, 116, 114, 101, 101, 41, 41, 41, 10], true, true);
    35. 

  35. 

  36.   }
    37. 

  37.   if (Module['calledRun']) {
    38. 

  38.     runWithFS();
    39. 

  39.   } else {
    40. 

  40.     if (!Module['preRun']) Module['preRun'] = [];
    41. 

  41.     Module["preRun"].push(runWithFS); // FS is not initialized yet, wait for it
    42. 

  42.   }
    43. 

  43. 

  44. })();
    45. 

  45. 

  46. // The Module object: Our interface to the outside world. We import
    47. 

  47. // and export values on it, and do the work to get that through
    48. 

  48. // closure compiler if necessary. There are various ways Module can be used:
    49. 

  49. // 1. Not defined. We create it here
    50. 

  50. // 2. A function parameter, function(Module) { ..generated code.. }
    51. 

  51. // 3. pre-run appended it, var Module = {}; ..generated code..
    52. 

  52. // 4. External script tag defines var Module.
    53. 

  53. // We need to do an eval in order to handle the closure compiler
    54. 

  54. // case, where this code here is minified but Module was defined
    55. 

  55. // elsewhere (e.g. case 4 above). We also need to check if Module
    56. 

  56. // already exists (e.g. case 3 above).
    57. 

  57. // Note that if you want to run closure, and also to use Module
    58. 

  58. // after the generated code, you will need to define   var Module = {};
    59. 

  59. // before the code. Then that object will be used in the code, and you
    60. 

  60. // can continue to use Module afterwards as well.
    61. 

  61. var Module;
    62. 

  62. if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
    63. 

  63. 

  64. // Sometimes an existing Module object exists with properties
    65. 

  65. // meant to overwrite the default module functionality. Here
    66. 

  66. // we collect those properties and reapply _after_ we configure
    67. 

  67. // the current environment's defaults to avoid having to be so
    68. 

  68. // defensive during initialization.
    69. 

  69. var moduleOverrides = {};
    70. 

  70. for (var key in Module) {
    71. 

  71.   if (Module.hasOwnProperty(key)) {
    72. 

  72.     moduleOverrides[key] = Module[key];
    73. 

  73.   }
    74. 

  74. }
    75. 

  75. 

  76. // The environment setup code below is customized to use Module.
    77. 

  77. // *** Environment setup code ***
    78. 

  78. var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
    79. 

  79. var ENVIRONMENT_IS_WEB = typeof window === 'object';
    80. 

  80. var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
    81. 

  81. var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
    82. 

  82. 

  83. if (ENVIRONMENT_IS_NODE) {
    84. 

  84.   // Expose functionality in the same simple way that the shells work
    85. 

  85.   // Note that we pollute the global namespace here, otherwise we break in node
    86. 

  86.   if (!Module['print']) Module['print'] = function print(x) {
    87. 

  87.     process['stdout'].write(x + '\n');
    88. 

  88.   };
    89. 

  89.   if (!Module['printErr']) Module['printErr'] = function printErr(x) {
    90. 

  90.     process['stderr'].write(x + '\n');
    91. 

  91.   };
    92. 

  92. 

  93.   var nodeFS = require('fs');
    94. 

  94.   var nodePath = require('path');
    95. 

  95. 

  96.   Module['read'] = function read(filename, binary) {
    97. 

  97.     filename = nodePath['normalize'](filename);
    98. 

  98.     var ret = nodeFS['readFileSync'](filename);
    99. 

  99.     // The path is absolute if the normalized version is the same as the resolved.
    100. 

  100.     if (!ret && filename != nodePath['resolve'](filename)) {
    101. 

  101.       filename = path.join(__dirname, '..', 'src', filename);
    102. 

  102.       ret = nodeFS['readFileSync'](filename);
    103. 

  103.     }
    104. 

  104.     if (ret && !binary) ret = ret.toString();
    105. 

  105.     return ret;
    106. 

  106.   };
    107. 

  107. 

  108.   Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
    109. 

  109. 

  110.   Module['load'] = function load(f) {
    111. 

  111.     globalEval(read(f));
    112. 

  112.   };
    113. 

  113. 

  114.   Module['arguments'] = process['argv'].slice(2);
    115. 

  115. 

  116.   module['exports'] = Module;
    117. 

  117. }
    118. 

  118. else if (ENVIRONMENT_IS_SHELL) {
    119. 

  119.   if (!Module['print']) Module['print'] = print;
    120. 

  120.   if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
    121. 

  121. 

  122.   if (typeof read != 'undefined') {
    123. 

  123.     Module['read'] = read;
    124. 

  124.   } else {
    125. 

  125.     Module['read'] = function read() { throw 'no read() available (jsc?)' };
    126. 

  126.   }
    127. 

  127. 

  128.   Module['readBinary'] = function readBinary(f) {
    129. 

  129.     return read(f, 'binary');
    130. 

  130.   };
    131. 

  131. 

  132.   if (typeof scriptArgs != 'undefined') {
    133. 

  133.     Module['arguments'] = scriptArgs;
    134. 

  134.   } else if (typeof arguments != 'undefined') {
    135. 

  135.     Module['arguments'] = arguments;
    136. 

  136.   }
    137. 

  137. 

  138.   this['Module'] = Module;
    139. 

  139. 

  140.   eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
    141. 

  141. }
    142. 

  142. else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
    143. 

  143.   Module['read'] = function read(url) {
    144. 

  144.     var xhr = new XMLHttpRequest();
    145. 

  145.     xhr.open('GET', url, false);
    146. 

  146.     xhr.send(null);
    147. 

  147.     return xhr.responseText;
    148. 

  148.   };
    149. 

  149. 

  150.   if (typeof arguments != 'undefined') {
    151. 

  151.     Module['arguments'] = arguments;
    152. 

  152.   }
    153. 

  153. 

  154.   if (typeof console !== 'undefined') {
    155. 

  155.     if (!Module['print']) Module['print'] = function print(x) {
    156. 

  156.       console.log(x);
    157. 

  157.     };
    158. 

  158.     if (!Module['printErr']) Module['printErr'] = function printErr(x) {
    159. 

  159.       console.log(x);
    160. 

  160.     };
    161. 

  161.   } else {
    162. 

  162.     // Probably a worker, and without console.log. We can do very little here...
    163. 

  163.     var TRY_USE_DUMP = false;
    164. 

  164.     if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
    165. 

  165.       dump(x);
    166. 

  166.     }) : (function(x) {
    167. 

  167.       // self.postMessage(x); // enable this if you want stdout to be sent as messages
    168. 

  168.     }));
    169. 

  169.   }
    170. 

  170. 

  171.   if (ENVIRONMENT_IS_WEB) {
    172. 

  172.     window['Module'] = Module;
    173. 

  173.   } else {
    174. 

  174.     Module['load'] = importScripts;
    175. 

  175.   }
    176. 

  176. }
    177. 

  177. else {
    178. 

  178.   // Unreachable because SHELL is dependant on the others
    179. 

  179.   throw 'Unknown runtime environment. Where are we?';
    180. 

  180. }
    181. 

  181. 

  182. function globalEval(x) {
    183. 

  183.   eval.call(null, x);
    184. 

  184. }
    185. 

  185. if (!Module['load'] == 'undefined' && Module['read']) {
    186. 

  186.   Module['load'] = function load(f) {
    187. 

  187.     globalEval(Module['read'](f));
    188. 

  188.   };
    189. 

  189. }
    190. 

  190. if (!Module['print']) {
    191. 

  191.   Module['print'] = function(){};
    192. 

  192. }
    193. 

  193. if (!Module['printErr']) {
    194. 

  194.   Module['printErr'] = Module['print'];
    195. 

  195. }
    196. 

  196. if (!Module['arguments']) {
    197. 

  197.   Module['arguments'] = [];
    198. 

  198. }
    199. 

  199. // *** Environment setup code ***
    200. 

  200. 

  201. // Closure helpers
    202. 

  202. Module.print = Module['print'];
    203. 

  203. Module.printErr = Module['printErr'];
    204. 

  204. 

  205. // Callbacks
    206. 

  206. Module['preRun'] = [];
    207. 

  207. Module['postRun'] = [];
    208. 

  208. 

  209. // Merge back in the overrides
    210. 

  210. for (var key in moduleOverrides) {
    211. 

  211.   if (moduleOverrides.hasOwnProperty(key)) {
    212. 

  212.     Module[key] = moduleOverrides[key];
    213. 

  213.   }
    214. 

  214. }
    215. 

  215. 

  216. 

  217. 

  218. // === Auto-generated preamble library stuff ===
    219. 

  219. 

  220. //========================================
    221. 

  221. // Runtime code shared with compiler
    222. 

  222. //========================================
    223. 

  223. 

  224. var Runtime = {
    225. 

  225.   stackSave: function () {
    226. 

  226.     return STACKTOP;
    227. 

  227.   },
    228. 

  228.   stackRestore: function (stackTop) {
    229. 

  229.     STACKTOP = stackTop;
    230. 

  230.   },
    231. 

  231.   forceAlign: function (target, quantum) {
    232. 

  232.     quantum = quantum || 4;
    233. 

  233.     if (quantum == 1) return target;
    234. 

  234.     if (isNumber(target) && isNumber(quantum)) {
    235. 

  235.       return Math.ceil(target/quantum)*quantum;
    236. 

  236.     } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
    237. 

  237.       return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
    238. 

  238.     }
    239. 

  239.     return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
    240. 

  240.   },
    241. 

  241.   isNumberType: function (type) {
    242. 

  242.     return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
    243. 

  243.   },
    244. 

  244.   isPointerType: function isPointerType(type) {
    245. 

  245.   return type[type.length-1] == '*';
    246. 

  246. },
    247. 

  247.   isStructType: function isStructType(type) {
    248. 

  248.   if (isPointerType(type)) return false;
    249. 

  249.   if (isArrayType(type)) return true;
    250. 

  250.   if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
    251. 

  251.   // See comment in isStructPointerType()
    252. 

  252.   return type[0] == '%';
    253. 

  253. },
    254. 

  254.   INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
    255. 

  255.   FLOAT_TYPES: {"float":0,"double":0},
    256. 

  256.   or64: function (x, y) {
    257. 

  257.     var l = (x | 0) | (y | 0);
    258. 

  258.     var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
    259. 

  259.     return l + h;
    260. 

  260.   },
    261. 

  261.   and64: function (x, y) {
    262. 

  262.     var l = (x | 0) & (y | 0);
    263. 

  263.     var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
    264. 

  264.     return l + h;
    265. 

  265.   },
    266. 

  266.   xor64: function (x, y) {
    267. 

  267.     var l = (x | 0) ^ (y | 0);
    268. 

  268.     var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
    269. 

  269.     return l + h;
    270. 

  270.   },
    271. 

  271.   getNativeTypeSize: function (type) {
    272. 

  272.     switch (type) {
    273. 

  273.       case 'i1': case 'i8': return 1;
    274. 

  274.       case 'i16': return 2;
    275. 

  275.       case 'i32': return 4;
    276. 

  276.       case 'i64': return 8;
    277. 

  277.       case 'float': return 4;
    278. 

  278.       case 'double': return 8;
    279. 

  279.       default: {
    280. 

  280.         if (type[type.length-1] === '*') {
    281. 

  281.           return Runtime.QUANTUM_SIZE; // A pointer
    282. 

  282.         } else if (type[0] === 'i') {
    283. 

  283.           var bits = parseInt(type.substr(1));
    284. 

  284.           assert(bits % 8 === 0);
    285. 

  285.           return bits/8;
    286. 

  286.         } else {
    287. 

  287.           return 0;
    288. 

  288.         }
    289. 

  289.       }
    290. 

  290.     }
    291. 

  291.   },
    292. 

  292.   getNativeFieldSize: function (type) {
    293. 

  293.     return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
    294. 

  294.   },
    295. 

  295.   dedup: function dedup(items, ident) {
    296. 

  296.   var seen = {};
    297. 

  297.   if (ident) {
    298. 

  298.     return items.filter(function(item) {
    299. 

  299.       if (seen[item[ident]]) return false;
    300. 

  300.       seen[item[ident]] = true;
    301. 

  301.       return true;
    302. 

  302.     });
    303. 

  303.   } else {
    304. 

  304.     return items.filter(function(item) {
    305. 

  305.       if (seen[item]) return false;
    306. 

  306.       seen[item] = true;
    307. 

  307.       return true;
    308. 

  308.     });
    309. 

  309.   }
    310. 

  310. },
    311. 

  311.   set: function set() {
    312. 

  312.   var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
    313. 

  313.   var ret = {};
    314. 

  314.   for (var i = 0; i < args.length; i++) {
    315. 

  315.     ret[args[i]] = 0;
    316. 

  316.   }
    317. 

  317.   return ret;
    318. 

  318. },
    319. 

  319.   STACK_ALIGN: 8,
    320. 

  320.   getAlignSize: function (type, size, vararg) {
    321. 

  321.     // we align i64s and doubles on 64-bit boundaries, unlike x86
    322. 

  322.     if (!vararg && (type == 'i64' || type == 'double')) return 8;
    323. 

  323.     if (!type) return Math.min(size, 8); // align structures internally to 64 bits
    324. 

  324.     return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
    325. 

  325.   },
    326. 

  326.   calculateStructAlignment: function calculateStructAlignment(type) {
    327. 

  327.     type.flatSize = 0;
    328. 

  328.     type.alignSize = 0;
    329. 

  329.     var diffs = [];
    330. 

  330.     var prev = -1;
    331. 

  331.     var index = 0;
    332. 

  332.     type.flatIndexes = type.fields.map(function(field) {
    333. 

  333.       index++;
    334. 

  334.       var size, alignSize;
    335. 

  335.       if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
    336. 

  336.         size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
    337. 

  337.         alignSize = Runtime.getAlignSize(field, size);
    338. 

  338.       } else if (Runtime.isStructType(field)) {
    339. 

  339.         if (field[1] === '0') {
    340. 

  340.           // this is [0 x something]. When inside another structure like here, it must be at the end,
    341. 

  341.           // and it adds no size
    342. 

  342.           // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
    343. 

  343.           size = 0;
    344. 

  344.           if (Types.types[field]) {
    345. 

  345.             alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
    346. 

  346.           } else {
    347. 

  347.             alignSize = type.alignSize || QUANTUM_SIZE;
    348. 

  348.           }
    349. 

  349.         } else {
    350. 

  350.           size = Types.types[field].flatSize;
    351. 

  351.           alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
    352. 

  352.         }
    353. 

  353.       } else if (field[0] == 'b') {
    354. 

  354.         // bN, large number field, like a [N x i8]
    355. 

  355.         size = field.substr(1)|0;
    356. 

  356.         alignSize = 1;
    357. 

  357.       } else if (field[0] === '<') {
    358. 

  358.         // vector type
    359. 

  359.         size = alignSize = Types.types[field].flatSize; // fully aligned
    360. 

  360.       } else if (field[0] === 'i') {
    361. 

  361.         // illegal integer field, that could not be legalized because it is an internal structure field
    362. 

  362.         // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
    363. 

  363.         size = alignSize = parseInt(field.substr(1))/8;
    364. 

  364.         assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
    365. 

  365.       } else {
    366. 

  366.         assert(false, 'invalid type for calculateStructAlignment');
    367. 

  367.       }
    368. 

  368.       if (type.packed) alignSize = 1;
    369. 

  369.       type.alignSize = Math.max(type.alignSize, alignSize);
    370. 

  370.       var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
    371. 

  371.       type.flatSize = curr + size;
    372. 

  372.       if (prev >= 0) {
    373. 

  373.         diffs.push(curr-prev);
    374. 

  374.       }
    375. 

  375.       prev = curr;
    376. 

  376.       return curr;
    377. 

  377.     });
    378. 

  378.     if (type.name_ && type.name_[0] === '[') {
    379. 

  379.       // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
    380. 

  380.       // allocating a potentially huge array for [999999 x i8] etc.
    381. 

  381.       type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
    382. 

  382.     }
    383. 

  383.     type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
    384. 

  384.     if (diffs.length == 0) {
    385. 

  385.       type.flatFactor = type.flatSize;
    386. 

  386.     } else if (Runtime.dedup(diffs).length == 1) {
    387. 

  387.       type.flatFactor = diffs[0];
    388. 

  388.     }
    389. 

  389.     type.needsFlattening = (type.flatFactor != 1);
    390. 

  390.     return type.flatIndexes;
    391. 

  391.   },
    392. 

  392.   generateStructInfo: function (struct, typeName, offset) {
    393. 

  393.     var type, alignment;
    394. 

  394.     if (typeName) {
    395. 

  395.       offset = offset || 0;
    396. 

  396.       type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
    397. 

  397.       if (!type) return null;
    398. 

  398.       if (type.fields.length != struct.length) {
    399. 

  399.         printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
    400. 

  400.         return null;
    401. 

  401.       }
    402. 

  402.       alignment = type.flatIndexes;
    403. 

  403.     } else {
    404. 

  404.       var type = { fields: struct.map(function(item) { return item[0] }) };
    405. 

  405.       alignment = Runtime.calculateStructAlignment(type);
    406. 

  406.     }
    407. 

  407.     var ret = {
    408. 

  408.       __size__: type.flatSize
    409. 

  409.     };
    410. 

  410.     if (typeName) {
    411. 

  411.       struct.forEach(function(item, i) {
    412. 

  412.         if (typeof item === 'string') {
    413. 

  413.           ret[item] = alignment[i] + offset;
    414. 

  414.         } else {
    415. 

  415.           // embedded struct
    416. 

  416.           var key;
    417. 

  417.           for (var k in item) key = k;
    418. 

  418.           ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
    419. 

  419.         }
    420. 

  420.       });
    421. 

  421.     } else {
    422. 

  422.       struct.forEach(function(item, i) {
    423. 

  423.         ret[item[1]] = alignment[i];
    424. 

  424.       });
    425. 

  425.     }
    426. 

  426.     return ret;
    427. 

  427.   },
    428. 

  428.   dynCall: function (sig, ptr, args) {
    429. 

  429.     if (args && args.length) {
    430. 

  430.       if (!args.splice) args = Array.prototype.slice.call(args);
    431. 

  431.       args.splice(0, 0, ptr);
    432. 

  432.       return Module['dynCall_' + sig].apply(null, args);
    433. 

  433.     } else {
    434. 

  434.       return Module['dynCall_' + sig].call(null, ptr);
    435. 

  435.     }
    436. 

  436.   },
    437. 

  437.   functionPointers: [],
    438. 

  438.   addFunction: function (func) {
    439. 

  439.     for (var i = 0; i < Runtime.functionPointers.length; i++) {
    440. 

  440.       if (!Runtime.functionPointers[i]) {
    441. 

  441.         Runtime.functionPointers[i] = func;
    442. 

  442.         return 2*(1 + i);
    443. 

  443.       }
    444. 

  444.     }
    445. 

  445.     throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
    446. 

  446.   },
    447. 

  447.   removeFunction: function (index) {
    448. 

  448.     Runtime.functionPointers[(index-2)/2] = null;
    449. 

  449.   },
    450. 

  450.   getAsmConst: function (code, numArgs) {
    451. 

  451.     // code is a constant string on the heap, so we can cache these
    452. 

  452.     if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
    453. 

  453.     var func = Runtime.asmConstCache[code];
    454. 

  454.     if (func) return func;
    455. 

  455.     var args = [];
    456. 

  456.     for (var i = 0; i < numArgs; i++) {
    457. 

  457.       args.push(String.fromCharCode(36) + i); // $0, $1 etc
    458. 

  458.     }
    459. 

  459.     var source = Pointer_stringify(code);
    460. 

  460.     if (source[0] === '"') {
    461. 

  461.       // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
    462. 

  462.       if (source.indexOf('"', 1) === source.length-1) {
    463. 

  463.         source = source.substr(1, source.length-2);
    464. 

  464.       } else {
    465. 

  465.         // something invalid happened, e.g. EM_ASM("..code($0)..", input)
    466. 

  466.         abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
    467. 

  467.       }
    468. 

  468.     }
    469. 

  469.     try {
    470. 

  470.       var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
    471. 

  471.     } catch(e) {
    472. 

  472.       Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
    473. 

  473.       throw e;
    474. 

  474.     }
    475. 

  475.     return Runtime.asmConstCache[code] = evalled;
    476. 

  476.   },
    477. 

  477.   warnOnce: function (text) {
    478. 

  478.     if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
    479. 

  479.     if (!Runtime.warnOnce.shown[text]) {
    480. 

  480.       Runtime.warnOnce.shown[text] = 1;
    481. 

  481.       Module.printErr(text);
    482. 

  482.     }
    483. 

  483.   },
    484. 

  484.   funcWrappers: {},
    485. 

  485.   getFuncWrapper: function (func, sig) {
    486. 

  486.     assert(sig);
    487. 

  487.     if (!Runtime.funcWrappers[func]) {
    488. 

  488.       Runtime.funcWrappers[func] = function dynCall_wrapper() {
    489. 

  489.         return Runtime.dynCall(sig, func, arguments);
    490. 

  490.       };
    491. 

  491.     }
    492. 

  492.     return Runtime.funcWrappers[func];
    493. 

  493.   },
    494. 

  494.   UTF8Processor: function () {
    495. 

  495.     var buffer = [];
    496. 

  496.     var needed = 0;
    497. 

  497.     this.processCChar = function (code) {
    498. 

  498.       code = code & 0xFF;
    499. 

  499. 

  500.       if (buffer.length == 0) {
    501. 

  501.         if ((code & 0x80) == 0x00) {        // 0xxxxxxx
    502. 

  502.           return String.fromCharCode(code);
    503. 

  503.         }
    504. 

  504.         buffer.push(code);
    505. 

  505.         if ((code & 0xE0) == 0xC0) {        // 110xxxxx
    506. 

  506.           needed = 1;
    507. 

  507.         } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
    508. 

  508.           needed = 2;
    509. 

  509.         } else {                            // 11110xxx
    510. 

  510.           needed = 3;
    511. 

  511.         }
    512. 

  512.         return '';
    513. 

  513.       }
    514. 

  514. 

  515.       if (needed) {
    516. 

  516.         buffer.push(code);
    517. 

  517.         needed--;
    518. 

  518.         if (needed > 0) return '';
    519. 

  519.       }
    520. 

  520. 

  521.       var c1 = buffer[0];
    522. 

  522.       var c2 = buffer[1];
    523. 

  523.       var c3 = buffer[2];
    524. 

  524.       var c4 = buffer[3];
    525. 

  525.       var ret;
    526. 

  526.       if (buffer.length == 2) {
    527. 

  527.         ret = String.fromCharCode(((c1 & 0x1F) << 6)  | (c2 & 0x3F));
    528. 

  528.       } else if (buffer.length == 3) {
    529. 

  529.         ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6)  | (c3 & 0x3F));
    530. 

  530.       } else {
    531. 

  531.         // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
    532. 

  532.         var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
    533. 

  533.                         ((c3 & 0x3F) << 6)  | (c4 & 0x3F);
    534. 

  534.         ret = String.fromCharCode(
    535. 

  535.           Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
    536. 

  536.           (codePoint - 0x10000) % 0x400 + 0xDC00);
    537. 

  537.       }
    538. 

  538.       buffer.length = 0;
    539. 

  539.       return ret;
    540. 

  540.     }
    541. 

  541.     this.processJSString = function processJSString(string) {
    542. 

  542.       /* TODO: use TextEncoder when present,
    543. 

  543.         var encoder = new TextEncoder();
    544. 

  544.         encoder['encoding'] = "utf-8";
    545. 

  545.         var utf8Array = encoder['encode'](aMsg.data);
    546. 

  546.       */
    547. 

  547.       string = unescape(encodeURIComponent(string));
    548. 

  548.       var ret = [];
    549. 

  549.       for (var i = 0; i < string.length; i++) {
    550. 

  550.         ret.push(string.charCodeAt(i));
    551. 

  551.       }
    552. 

  552.       return ret;
    553. 

  553.     }
    554. 

  554.   },
    555. 

  555.   getCompilerSetting: function (name) {
    556. 

  556.     throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
    557. 

  557.   },
    558. 

  558.   stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
    559. 

  559.   staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
    560. 

  560.   dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
    561. 

  561.   alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
    562. 

  562.   makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
    563. 

  563.   GLOBAL_BASE: 8,
    564. 

  564.   QUANTUM_SIZE: 4,
    565. 

  565.   __dummy__: 0
    566. 

  566. }
    567. 

  567. 

  568. 

  569. Module['Runtime'] = Runtime;
    570. 

  570. 

  571. 

  572. 

  573. 

  574. 

  575. 

  576. 

  577. 

  578. 

  579. //========================================
    580. 

  580. // Runtime essentials
    581. 

  581. //========================================
    582. 

  582. 

  583. var __THREW__ = 0; // Used in checking for thrown exceptions.
    584. 

  584. 

  585. var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
    586. 

  586. var EXITSTATUS = 0;
    587. 

  587. 

  588. var undef = 0;
    589. 

  589. // tempInt is used for 32-bit signed values or smaller. tempBigInt is used
    590. 

  590. // for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
    591. 

  591. var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
    592. 

  592. var tempI64, tempI64b;
    593. 

  593. var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
    594. 

  594. 

  595. function assert(condition, text) {
    596. 

  596.   if (!condition) {
    597. 

  597.     abort('Assertion failed: ' + text);
    598. 

  598.   }
    599. 

  599. }
    600. 

  600. 

  601. var globalScope = this;
    602. 

  602. 

  603. // C calling interface. A convenient way to call C functions (in C files, or
    604. 

  604. // defined with extern "C").
    605. 

  605. //
    606. 

  606. // Note: LLVM optimizations can inline and remove functions, after which you will not be
    607. 

  607. //       able to call them. Closure can also do so. To avoid that, add your function to
    608. 

  608. //       the exports using something like
    609. 

  609. //
    610. 

  610. //         -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
    611. 

  611. //
    612. 

  612. // @param ident      The name of the C function (note that C++ functions will be name-mangled - use extern "C")
    613. 

  613. // @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
    614. 

  614. //                   'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
    615. 

  615. // @param argTypes   An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
    616. 

  616. //                   except that 'array' is not possible (there is no way for us to know the length of the array)
    617. 

  617. // @param args       An array of the arguments to the function, as native JS values (as in returnType)
    618. 

  618. //                   Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
    619. 

  619. // @return           The return value, as a native JS value (as in returnType)
    620. 

  620. function ccall(ident, returnType, argTypes, args) {
    621. 

  621.   return ccallFunc(getCFunc(ident), returnType, argTypes, args);
    622. 

  622. }
    623. 

  623. Module["ccall"] = ccall;
    624. 

  624. 

  625. // Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
    626. 

  626. function getCFunc(ident) {
    627. 

  627.   try {
    628. 

  628.     var func = Module['_' + ident]; // closure exported function
    629. 

  629.     if (!func) func = eval('_' + ident); // explicit lookup
    630. 

  630.   } catch(e) {
    631. 

  631.   }
    632. 

  632.   assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
    633. 

  633.   return func;
    634. 

  634. }
    635. 

  635. 

  636. // Internal function that does a C call using a function, not an identifier
    637. 

  637. function ccallFunc(func, returnType, argTypes, args) {
    638. 

  638.   var stack = 0;
    639. 

  639.   function toC(value, type) {
    640. 

  640.     if (type == 'string') {
    641. 

  641.       if (value === null || value === undefined || value === 0) return 0; // null string
    642. 

  642.       value = intArrayFromString(value);
    643. 

  643.       type = 'array';
    644. 

  644.     }
    645. 

  645.     if (type == 'array') {
    646. 

  646.       if (!stack) stack = Runtime.stackSave();
    647. 

  647.       var ret = Runtime.stackAlloc(value.length);
    648. 

  648.       writeArrayToMemory(value, ret);
    649. 

  649.       return ret;
    650. 

  650.     }
    651. 

  651.     return value;
    652. 

  652.   }
    653. 

  653.   function fromC(value, type) {
    654. 

  654.     if (type == 'string') {
    655. 

  655.       return Pointer_stringify(value);
    656. 

  656.     }
    657. 

  657.     assert(type != 'array');
    658. 

  658.     return value;
    659. 

  659.   }
    660. 

  660.   var i = 0;
    661. 

  661.   var cArgs = args ? args.map(function(arg) {
    662. 

  662.     return toC(arg, argTypes[i++]);
    663. 

  663.   }) : [];
    664. 

  664.   var ret = fromC(func.apply(null, cArgs), returnType);
    665. 

  665.   if (stack) Runtime.stackRestore(stack);
    666. 

  666.   return ret;
    667. 

  667. }
    668. 

  668. 

  669. // Returns a native JS wrapper for a C function. This is similar to ccall, but
    670. 

  670. // returns a function you can call repeatedly in a normal way. For example:
    671. 

  671. //
    672. 

  672. //   var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
    673. 

  673. //   alert(my_function(5, 22));
    674. 

  674. //   alert(my_function(99, 12));
    675. 

  675. //
    676. 

  676. function cwrap(ident, returnType, argTypes) {
    677. 

  677.   var func = getCFunc(ident);
    678. 

  678.   return function() {
    679. 

  679.     return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
    680. 

  680.   }
    681. 

  681. }
    682. 

  682. Module["cwrap"] = cwrap;
    683. 

  683. 

  684. // Sets a value in memory in a dynamic way at run-time. Uses the
    685. 

  685. // type data. This is the same as makeSetValue, except that
    686. 

  686. // makeSetValue is done at compile-time and generates the needed
    687. 

  687. // code then, whereas this function picks the right code at
    688. 

  688. // run-time.
    689. 

  689. // Note that setValue and getValue only do *aligned* writes and reads!
    690. 

  690. // Note that ccall uses JS types as for defining types, while setValue and
    691. 

  691. // getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
    692. 

  692. function setValue(ptr, value, type, noSafe) {
    693. 

  693.   type = type || 'i8';
    694. 

  694.   if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
    695. 

  695.     switch(type) {
    696. 

  696.       case 'i1': HEAP8[(ptr)]=value; break;
    697. 

  697.       case 'i8': HEAP8[(ptr)]=value; break;
    698. 

  698.       case 'i16': HEAP16[((ptr)>>1)]=value; break;
    699. 

  699.       case 'i32': HEAP32[((ptr)>>2)]=value; break;
    700. 

  700.       case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
    701. 

  701.       case 'float': HEAPF32[((ptr)>>2)]=value; break;
    702. 

  702.       case 'double': HEAPF64[((ptr)>>3)]=value; break;
    703. 

  703.       default: abort('invalid type for setValue: ' + type);
    704. 

  704.     }
    705. 

  705. }
    706. 

  706. Module['setValue'] = setValue;
    707. 

  707. 

  708. // Parallel to setValue.
    709. 

  709. function getValue(ptr, type, noSafe) {
    710. 

  710.   type = type || 'i8';
    711. 

  711.   if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
    712. 

  712.     switch(type) {
    713. 

  713.       case 'i1': return HEAP8[(ptr)];
    714. 

  714.       case 'i8': return HEAP8[(ptr)];
    715. 

  715.       case 'i16': return HEAP16[((ptr)>>1)];
    716. 

  716.       case 'i32': return HEAP32[((ptr)>>2)];
    717. 

  717.       case 'i64': return HEAP32[((ptr)>>2)];
    718. 

  718.       case 'float': return HEAPF32[((ptr)>>2)];
    719. 

  719.       case 'double': return HEAPF64[((ptr)>>3)];
    720. 

  720.       default: abort('invalid type for setValue: ' + type);
    721. 

  721.     }
    722. 

  722.   return null;
    723. 

  723. }
    724. 

  724. Module['getValue'] = getValue;
    725. 

  725. 

  726. var ALLOC_NORMAL = 0; // Tries to use _malloc()
    727. 

  727. var ALLOC_STACK = 1; // Lives for the duration of the current function call
    728. 

  728. var ALLOC_STATIC = 2; // Cannot be freed
    729. 

  729. var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
    730. 

  730. var ALLOC_NONE = 4; // Do not allocate
    731. 

  731. Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
    732. 

  732. Module['ALLOC_STACK'] = ALLOC_STACK;
    733. 

  733. Module['ALLOC_STATIC'] = ALLOC_STATIC;
    734. 

  734. Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
    735. 

  735. Module['ALLOC_NONE'] = ALLOC_NONE;
    736. 

  736. 

  737. // allocate(): This is for internal use. You can use it yourself as well, but the interface
    738. 

  738. //             is a little tricky (see docs right below). The reason is that it is optimized
    739. 

  739. //             for multiple syntaxes to save space in generated code. So you should
    740. 

  740. //             normally not use allocate(), and instead allocate memory using _malloc(),
    741. 

  741. //             initialize it with setValue(), and so forth.
    742. 

  742. // @slab: An array of data, or a number. If a number, then the size of the block to allocate,
    743. 

  743. //        in *bytes* (note that this is sometimes confusing: the next parameter does not
    744. 

  744. //        affect this!)
    745. 

  745. // @types: Either an array of types, one for each byte (or 0 if no type at that position),
    746. 

  746. //         or a single type which is used for the entire block. This only matters if there
    747. 

  747. //         is initial data - if @slab is a number, then this does not matter at all and is
    748. 

  748. //         ignored.
    749. 

  749. // @allocator: How to allocate memory, see ALLOC_*
    750. 

  750. function allocate(slab, types, allocator, ptr) {
    751. 

  751.   var zeroinit, size;
    752. 

  752.   if (typeof slab === 'number') {
    753. 

  753.     zeroinit = true;
    754. 

  754.     size = slab;
    755. 

  755.   } else {
    756. 

  756.     zeroinit = false;
    757. 

  757.     size = slab.length;
    758. 

  758.   }
    759. 

  759. 

  760.   var singleType = typeof types === 'string' ? types : null;
    761. 

  761. 

  762.   var ret;
    763. 

  763.   if (allocator == ALLOC_NONE) {
    764. 

  764.     ret = ptr;
    765. 

  765.   } else {
    766. 

  766.     ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
    767. 

  767.   }
    768. 

  768. 

  769.   if (zeroinit) {
    770. 

  770.     var ptr = ret, stop;
    771. 

  771.     assert((ret & 3) == 0);
    772. 

  772.     stop = ret + (size & ~3);
    773. 

  773.     for (; ptr < stop; ptr += 4) {
    774. 

  774.       HEAP32[((ptr)>>2)]=0;
    775. 

  775.     }
    776. 

  776.     stop = ret + size;
    777. 

  777.     while (ptr < stop) {
    778. 

  778.       HEAP8[((ptr++)|0)]=0;
    779. 

  779.     }
    780. 

  780.     return ret;
    781. 

  781.   }
    782. 

  782. 

  783.   if (singleType === 'i8') {
    784. 

  784.     if (slab.subarray || slab.slice) {
    785. 

  785.       HEAPU8.set(slab, ret);
    786. 

  786.     } else {
    787. 

  787.       HEAPU8.set(new Uint8Array(slab), ret);
    788. 

  788.     }
    789. 

  789.     return ret;
    790. 

  790.   }
    791. 

  791. 

  792.   var i = 0, type, typeSize, previousType;
    793. 

  793.   while (i < size) {
    794. 

  794.     var curr = slab[i];
    795. 

  795. 

  796.     if (typeof curr === 'function') {
    797. 

  797.       curr = Runtime.getFunctionIndex(curr);
    798. 

  798.     }
    799. 

  799. 

  800.     type = singleType || types[i];
    801. 

  801.     if (type === 0) {
    802. 

  802.       i++;
    803. 

  803.       continue;
    804. 

  804.     }
    805. 

  805. 

  806.     if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
    807. 

  807. 

  808.     setValue(ret+i, curr, type);
    809. 

  809. 

  810.     // no need to look up size unless type changes, so cache it
    811. 

  811.     if (previousType !== type) {
    812. 

  812.       typeSize = Runtime.getNativeTypeSize(type);
    813. 

  813.       previousType = type;
    814. 

  814.     }
    815. 

  815.     i += typeSize;
    816. 

  816.   }
    817. 

  817. 

  818.   return ret;
    819. 

  819. }
    820. 

  820. Module['allocate'] = allocate;
    821. 

  821. 

  822. function Pointer_stringify(ptr, /* optional */ length) {
    823. 

  823.   // TODO: use TextDecoder
    824. 

  824.   // Find the length, and check for UTF while doing so
    825. 

  825.   var hasUtf = false;
    826. 

  826.   var t;
    827. 

  827.   var i = 0;
    828. 

  828.   while (1) {
    829. 

  829.     t = HEAPU8[(((ptr)+(i))|0)];
    830. 

  830.     if (t >= 128) hasUtf = true;
    831. 

  831.     else if (t == 0 && !length) break;
    832. 

  832.     i++;
    833. 

  833.     if (length && i == length) break;
    834. 

  834.   }
    835. 

  835.   if (!length) length = i;
    836. 

  836. 

  837.   var ret = '';
    838. 

  838. 

  839.   if (!hasUtf) {
    840. 

  840.     var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
    841. 

  841.     var curr;
    842. 

  842.     while (length > 0) {
    843. 

  843.       curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
    844. 

  844.       ret = ret ? ret + curr : curr;
    845. 

  845.       ptr += MAX_CHUNK;
    846. 

  846.       length -= MAX_CHUNK;
    847. 

  847.     }
    848. 

  848.     return ret;
    849. 

  849.   }
    850. 

  850. 

  851.   var utf8 = new Runtime.UTF8Processor();
    852. 

  852.   for (i = 0; i < length; i++) {
    853. 

  853.     t = HEAPU8[(((ptr)+(i))|0)];
    854. 

  854.     ret += utf8.processCChar(t);
    855. 

  855.   }
    856. 

  856.   return ret;
    857. 

  857. }
    858. 

  858. Module['Pointer_stringify'] = Pointer_stringify;
    859. 

  859. 

  860. // Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
    861. 

  861. // a copy of that string as a Javascript String object.
    862. 

  862. function UTF16ToString(ptr) {
    863. 

  863.   var i = 0;
    864. 

  864. 

  865.   var str = '';
    866. 

  866.   while (1) {
    867. 

  867.     var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
    868. 

  868.     if (codeUnit == 0)
    869. 

  869.       return str;
    870. 

  870.     ++i;
    871. 

  871.     // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
    872. 

  872.     str += String.fromCharCode(codeUnit);
    873. 

  873.   }
    874. 

  874. }
    875. 

  875. Module['UTF16ToString'] = UTF16ToString;
    876. 

  876. 

  877. // Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
    878. 

  878. // null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
    879. 

  879. function stringToUTF16(str, outPtr) {
    880. 

  880.   for(var i = 0; i < str.length; ++i) {
    881. 

  881.     // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
    882. 

  882.     var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
    883. 

  883.     HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
    884. 

  884.   }
    885. 

  885.   // Null-terminate the pointer to the HEAP.
    886. 

  886.   HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
    887. 

  887. }
    888. 

  888. Module['stringToUTF16'] = stringToUTF16;
    889. 

  889. 

  890. // Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
    891. 

  891. // a copy of that string as a Javascript String object.
    892. 

  892. function UTF32ToString(ptr) {
    893. 

  893.   var i = 0;
    894. 

  894. 

  895.   var str = '';
    896. 

  896.   while (1) {
    897. 

  897.     var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
    898. 

  898.     if (utf32 == 0)
    899. 

  899.       return str;
    900. 

  900.     ++i;
    901. 

  901.     // 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.
    902. 

  902.     if (utf32 >= 0x10000) {
    903. 

  903.       var ch = utf32 - 0x10000;
    904. 

  904.       str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
    905. 

  905.     } else {
    906. 

  906.       str += String.fromCharCode(utf32);
    907. 

  907.     }
    908. 

  908.   }
    909. 

  909. }
    910. 

  910. Module['UTF32ToString'] = UTF32ToString;
    911. 

  911. 

  912. // Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
    913. 

  913. // null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
    914. 

  914. // but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
    915. 

  915. function stringToUTF32(str, outPtr) {
    916. 

  916.   var iChar = 0;
    917. 

  917.   for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
    918. 

  918.     // 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.
    919. 

  919.     var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
    920. 

  920.     if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
    921. 

  921.       var trailSurrogate = str.charCodeAt(++iCodeUnit);
    922. 

  922.       codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
    923. 

  923.     }
    924. 

  924.     HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
    925. 

  925.     ++iChar;
    926. 

  926.   }
    927. 

  927.   // Null-terminate the pointer to the HEAP.
    928. 

  928.   HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
    929. 

  929. }
    930. 

  930. Module['stringToUTF32'] = stringToUTF32;
    931. 

  931. 

  932. function demangle(func) {
    933. 

  933.   var i = 3;
    934. 

  934.   // params, etc.
    935. 

  935.   var basicTypes = {
    936. 

  936.     'v': 'void',
    937. 

  937.     'b': 'bool',
    938. 

  938.     'c': 'char',
    939. 

  939.     's': 'short',
    940. 

  940.     'i': 'int',
    941. 

  941.     'l': 'long',
    942. 

  942.     'f': 'float',
    943. 

  943.     'd': 'double',
    944. 

  944.     'w': 'wchar_t',
    945. 

  945.     'a': 'signed char',
    946. 

  946.     'h': 'unsigned char',
    947. 

  947.     't': 'unsigned short',
    948. 

  948.     'j': 'unsigned int',
    949. 

  949.     'm': 'unsigned long',
    950. 

  950.     'x': 'long long',
    951. 

  951.     'y': 'unsigned long long',
    952. 

  952.     'z': '...'
    953. 

  953.   };
    954. 

  954.   var subs = [];
    955. 

  955.   var first = true;
    956. 

  956.   function dump(x) {
    957. 

  957.     //return;
    958. 

  958.     if (x) Module.print(x);
    959. 

  959.     Module.print(func);
    960. 

  960.     var pre = '';
    961. 

  961.     for (var a = 0; a < i; a++) pre += ' ';
    962. 

  962.     Module.print (pre + '^');
    963. 

  963.   }
    964. 

  964.   function parseNested() {
    965. 

  965.     i++;
    966. 

  966.     if (func[i] === 'K') i++; // ignore const
    967. 

  967.     var parts = [];
    968. 

  968.     while (func[i] !== 'E') {
    969. 

  969.       if (func[i] === 'S') { // substitution
    970. 

  970.         i++;
    971. 

  971.         var next = func.indexOf('_', i);
    972. 

  972.         var num = func.substring(i, next) || 0;
    973. 

  973.         parts.push(subs[num] || '?');
    974. 

  974.         i = next+1;
    975. 

  975.         continue;
    976. 

  976.       }
    977. 

  977.       if (func[i] === 'C') { // constructor
    978. 

  978.         parts.push(parts[parts.length-1]);
    979. 

  979.         i += 2;
    980. 

  980.         continue;
    981. 

  981.       }
    982. 

  982.       var size = parseInt(func.substr(i));
    983. 

  983.       var pre = size.toString().length;
    984. 

  984.       if (!size || !pre) { i--; break; } // counter i++ below us
    985. 

  985.       var curr = func.substr(i + pre, size);
    986. 

  986.       parts.push(curr);
    987. 

  987.       subs.push(curr);
    988. 

  988.       i += pre + size;
    989. 

  989.     }
    990. 

  990.     i++; // skip E
    991. 

  991.     return parts;
    992. 

  992.   }
    993. 

  993.   function parse(rawList, limit, allowVoid) { // main parser
    994. 

  994.     limit = limit || Infinity;
    995. 

  995.     var ret = '', list = [];
    996. 

  996.     function flushList() {
    997. 

  997.       return '(' + list.join(', ') + ')';
    998. 

  998.     }
    999. 

  999.     var name;
    1000. 

  1000.     if (func[i] === 'N') {
    1001. 

  1001.       // namespaced N-E
    1002. 

  1002.       name = parseNested().join('::');
    1003. 

  1003.       limit--;
    1004. 

  1004.       if (limit === 0) return rawList ? [name] : name;
    1005. 

  1005.     } else {
    1006. 

  1006.       // not namespaced
    1007. 

  1007.       if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
    1008. 

  1008.       var size = parseInt(func.substr(i));
    1009. 

  1009.       if (size) {
    1010. 

  1010.         var pre = size.toString().length;
    1011. 

  1011.         name = func.substr(i + pre, size);
    1012. 

  1012.         i += pre + size;
    1013. 

  1013.       }
    1014. 

  1014.     }
    1015. 

  1015.     first = false;
    1016. 

  1016.     if (func[i] === 'I') {
    1017. 

  1017.       i++;
    1018. 

  1018.       var iList = parse(true);
    1019. 

  1019.       var iRet = parse(true, 1, true);
    1020. 

  1020.       ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
    1021. 

  1021.     } else {
    1022. 

  1022.       ret = name;
    1023. 

  1023.     }
    1024. 

  1024.     paramLoop: while (i < func.length && limit-- > 0) {
    1025. 

  1025.       //dump('paramLoop');
    1026. 

  1026.       var c = func[i++];
    1027. 

  1027.       if (c in basicTypes) {
    1028. 

  1028.         list.push(basicTypes[c]);
    1029. 

  1029.       } else {
    1030. 

  1030.         switch (c) {
    1031. 

  1031.           case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
    1032. 

  1032.           case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
    1033. 

  1033.           case 'L': { // literal
    1034. 

  1034.             i++; // skip basic type
    1035. 

  1035.             var end = func.indexOf('E', i);
    1036. 

  1036.             var size = end - i;
    1037. 

  1037.             list.push(func.substr(i, size));
    1038. 

  1038.             i += size + 2; // size + 'EE'
    1039. 

  1039.             break;
    1040. 

  1040.           }
    1041. 

  1041.           case 'A': { // array
    1042. 

  1042.             var size = parseInt(func.substr(i));
    1043. 

  1043.             i += size.toString().length;
    1044. 

  1044.             if (func[i] !== '_') throw '?';
    1045. 

  1045.             i++; // skip _
    1046. 

  1046.             list.push(parse(true, 1, true)[0] + ' [' + size + ']');
    1047. 

  1047.             break;
    1048. 

  1048.           }
    1049. 

  1049.           case 'E': break paramLoop;
    1050. 

  1050.           default: ret += '?' + c; break paramLoop;
    1051. 

  1051.         }
    1052. 

  1052.       }
    1053. 

  1053.     }
    1054. 

  1054.     if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
    1055. 

  1055.     if (rawList) {
    1056. 

  1056.       if (ret) {
    1057. 

  1057.         list.push(ret + '?');
    1058. 

  1058.       }
    1059. 

  1059.       return list;
    1060. 

  1060.     } else {
    1061. 

  1061.       return ret + flushList();
    1062. 

  1062.     }
    1063. 

  1063.   }
    1064. 

  1064.   try {
    1065. 

  1065.     // Special-case the entry point, since its name differs from other name mangling.
    1066. 

  1066.     if (func == 'Object._main' || func == '_main') {
    1067. 

  1067.       return 'main()';
    1068. 

  1068.     }
    1069. 

  1069.     if (typeof func === 'number') func = Pointer_stringify(func);
    1070. 

  1070.     if (func[0] !== '_') return func;
    1071. 

  1071.     if (func[1] !== '_') return func; // C function
    1072. 

  1072.     if (func[2] !== 'Z') return func;
    1073. 

  1073.     switch (func[3]) {
    1074. 

  1074.       case 'n': return 'operator new()';
    1075. 

  1075.       case 'd': return 'operator delete()';
    1076. 

  1076.     }
    1077. 

  1077.     return parse();
    1078. 

  1078.   } catch(e) {
    1079. 

  1079.     return func;
    1080. 

  1080.   }
    1081. 

  1081. }
    1082. 

  1082. 

  1083. function demangleAll(text) {
    1084. 

  1084.   return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
    1085. 

  1085. }
    1086. 

  1086. 

  1087. function stackTrace() {
    1088. 

  1088.   var stack = new Error().stack;
    1089. 

  1089.   return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
    1090. 

  1090. }
    1091. 

  1091. 

  1092. // Memory management
    1093. 

  1093. 

  1094. var PAGE_SIZE = 4096;
    1095. 

  1095. function alignMemoryPage(x) {
    1096. 

  1096.   return (x+4095)&-4096;
    1097. 

  1097. }
    1098. 

  1098. 

  1099. var HEAP;
    1100. 

  1100. var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
    1101. 

  1101. 

  1102. var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
    1103. 

  1103. var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
    1104. 

  1104. var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
    1105. 

  1105. 

  1106. function enlargeMemory() {
    1107. 

  1107.   abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
    1108. 

  1108. }
    1109. 

  1109. 

  1110. var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
    1111. 

  1111. var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
    1112. 

  1112. var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
    1113. 

  1113. 

  1114. var totalMemory = 4096;
    1115. 

  1115. while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
    1116. 

  1116.   if (totalMemory < 16*1024*1024) {
    1117. 

  1117.     totalMemory *= 2;
    1118. 

  1118.   } else {
    1119. 

  1119.     totalMemory += 16*1024*1024
    1120. 

  1120.   }
    1121. 

  1121. }
    1122. 

  1122. if (totalMemory !== TOTAL_MEMORY) {
    1123. 

  1123.   Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
    1124. 

  1124.   TOTAL_MEMORY = totalMemory;
    1125. 

  1125. }
    1126. 

  1126. 

  1127. // Initialize the runtime's memory
    1128. 

  1128. // check for full engine support (use string 'subarray' to avoid closure compiler confusion)
    1129. 

  1129. assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
    1130. 

  1130.        'JS engine does not provide full typed array support');
    1131. 

  1131. 

  1132. var buffer = new ArrayBuffer(TOTAL_MEMORY);
    1133. 

  1133. HEAP8 = new Int8Array(buffer);
    1134. 

  1134. HEAP16 = new Int16Array(buffer);
    1135. 

  1135. HEAP32 = new Int32Array(buffer);
    1136. 

  1136. HEAPU8 = new Uint8Array(buffer);
    1137. 

  1137. HEAPU16 = new Uint16Array(buffer);
    1138. 

  1138. HEAPU32 = new Uint32Array(buffer);
    1139. 

  1139. HEAPF32 = new Float32Array(buffer);
    1140. 

  1140. HEAPF64 = new Float64Array(buffer);
    1141. 

  1141. 

  1142. // Endianness check (note: assumes compiler arch was little-endian)
    1143. 

  1143. HEAP32[0] = 255;
    1144. 

  1144. assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
    1145. 

  1145. 

  1146. Module['HEAP'] = HEAP;
    1147. 

  1147. Module['HEAP8'] = HEAP8;
    1148. 

  1148. Module['HEAP16'] = HEAP16;
    1149. 

  1149. Module['HEAP32'] = HEAP32;
    1150. 

  1150. Module['HEAPU8'] = HEAPU8;
    1151. 

  1151. Module['HEAPU16'] = HEAPU16;
    1152. 

  1152. Module['HEAPU32'] = HEAPU32;
    1153. 

  1153. Module['HEAPF32'] = HEAPF32;
    1154. 

  1154. Module['HEAPF64'] = HEAPF64;
    1155. 

  1155. 

  1156. function callRuntimeCallbacks(callbacks) {
    1157. 

  1157.   while(callbacks.length > 0) {
    1158. 

  1158.     var callback = callbacks.shift();
    1159. 

  1159.     if (typeof callback == 'function') {
    1160. 

  1160.       callback();
    1161. 

  1161.       continue;
    1162. 

  1162.     }
    1163. 

  1163.     var func = callback.func;
    1164. 

  1164.     if (typeof func === 'number') {
    1165. 

  1165.       if (callback.arg === undefined) {
    1166. 

  1166.         Runtime.dynCall('v', func);
    1167. 

  1167.       } else {
    1168. 

  1168.         Runtime.dynCall('vi', func, [callback.arg]);
    1169. 

  1169.       }
    1170. 

  1170.     } else {
    1171. 

  1171.       func(callback.arg === undefined ? null : callback.arg);
    1172. 

  1172.     }
    1173. 

  1173.   }
    1174. 

  1174. }
    1175. 

  1175. 

  1176. var __ATPRERUN__  = []; // functions called before the runtime is initialized
    1177. 

  1177. var __ATINIT__    = []; // functions called during startup
    1178. 

  1178. var __ATMAIN__    = []; // functions called when main() is to be run
    1179. 

  1179. var __ATEXIT__    = []; // functions called during shutdown
    1180. 

  1180. var __ATPOSTRUN__ = []; // functions called after the runtime has exited
    1181. 

  1181. 

  1182. var runtimeInitialized = false;
    1183. 

  1183. 

  1184. function preRun() {
    1185. 

  1185.   // compatibility - merge in anything from Module['preRun'] at this time
    1186. 

  1186.   if (Module['preRun']) {
    1187. 

  1187.     if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
    1188. 

  1188.     while (Module['preRun'].length) {
    1189. 

  1189.       addOnPreRun(Module['preRun'].shift());
    1190. 

  1190.     }
    1191. 

  1191.   }
    1192. 

  1192.   callRuntimeCallbacks(__ATPRERUN__);
    1193. 

  1193. }
    1194. 

  1194. 

  1195. function ensureInitRuntime() {
    1196. 

  1196.   if (runtimeInitialized) return;
    1197. 

  1197.   runtimeInitialized = true;
    1198. 

  1198.   callRuntimeCallbacks(__ATINIT__);
    1199. 

  1199. }
    1200. 

  1200. 

  1201. function preMain() {
    1202. 

  1202.   callRuntimeCallbacks(__ATMAIN__);
    1203. 

  1203. }
    1204. 

  1204. 

  1205. function exitRuntime() {
    1206. 

  1206.   callRuntimeCallbacks(__ATEXIT__);
    1207. 

  1207. }
    1208. 

  1208. 

  1209. function postRun() {
    1210. 

  1210.   // compatibility - merge in anything from Module['postRun'] at this time
    1211. 

  1211.   if (Module['postRun']) {
    1212. 

  1212.     if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
    1213. 

  1213.     while (Module['postRun'].length) {
    1214. 

  1214.       addOnPostRun(Module['postRun'].shift());
    1215. 

  1215.     }
    1216. 

  1216.   }
    1217. 

  1217.   callRuntimeCallbacks(__ATPOSTRUN__);
    1218. 

  1218. }
    1219. 

  1219. 

  1220. function addOnPreRun(cb) {
    1221. 

  1221.   __ATPRERUN__.unshift(cb);
    1222. 

  1222. }
    1223. 

  1223. Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
    1224. 

  1224. 

  1225. function addOnInit(cb) {
    1226. 

  1226.   __ATINIT__.unshift(cb);
    1227. 

  1227. }
    1228. 

  1228. Module['addOnInit'] = Module.addOnInit = addOnInit;
    1229. 

  1229. 

  1230. function addOnPreMain(cb) {
    1231. 

  1231.   __ATMAIN__.unshift(cb);
    1232. 

  1232. }
    1233. 

  1233. Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
    1234. 

  1234. 

  1235. function addOnExit(cb) {
    1236. 

  1236.   __ATEXIT__.unshift(cb);
    1237. 

  1237. }
    1238. 

  1238. Module['addOnExit'] = Module.addOnExit = addOnExit;
    1239. 

  1239. 

  1240. function addOnPostRun(cb) {
    1241. 

  1241.   __ATPOSTRUN__.unshift(cb);
    1242. 

  1242. }
    1243. 

  1243. Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
    1244. 

  1244. 

  1245. // Tools
    1246. 

  1246. 

  1247. // This processes a JS string into a C-line array of numbers, 0-terminated.
    1248. 

  1248. // For LLVM-originating strings, see parser.js:parseLLVMString function
    1249. 

  1249. function intArrayFromString(stringy, dontAddNull, length /* optional */) {
    1250. 

  1250.   var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
    1251. 

  1251.   if (length) {
    1252. 

  1252.     ret.length = length;
    1253. 

  1253.   }
    1254. 

  1254.   if (!dontAddNull) {
    1255. 

  1255.     ret.push(0);
    1256. 

  1256.   }
    1257. 

  1257.   return ret;
    1258. 

  1258. }
    1259. 

  1259. Module['intArrayFromString'] = intArrayFromString;
    1260. 

  1260. 

  1261. function intArrayToString(array) {
    1262. 

  1262.   var ret = [];
    1263. 

  1263.   for (var i = 0; i < array.length; i++) {
    1264. 

  1264.     var chr = array[i];
    1265. 

  1265.     if (chr > 0xFF) {
    1266. 

  1266.       chr &= 0xFF;
    1267. 

  1267.     }
    1268. 

  1268.     ret.push(String.fromCharCode(chr));
    1269. 

  1269.   }
    1270. 

  1270.   return ret.join('');
    1271. 

  1271. }
    1272. 

  1272. Module['intArrayToString'] = intArrayToString;
    1273. 

  1273. 

  1274. // Write a Javascript array to somewhere in the heap
    1275. 

  1275. function writeStringToMemory(string, buffer, dontAddNull) {
    1276. 

  1276.   var array = intArrayFromString(string, dontAddNull);
    1277. 

  1277.   var i = 0;
    1278. 

  1278.   while (i < array.length) {
    1279. 

  1279.     var chr = array[i];
    1280. 

  1280.     HEAP8[(((buffer)+(i))|0)]=chr;
    1281. 

  1281.     i = i + 1;
    1282. 

  1282.   }
    1283. 

  1283. }
    1284. 

  1284. Module['writeStringToMemory'] = writeStringToMemory;
    1285. 

  1285. 

  1286. function writeArrayToMemory(array, buffer) {
    1287. 

  1287.   for (var i = 0; i < array.length; i++) {
    1288. 

  1288.     HEAP8[(((buffer)+(i))|0)]=array[i];
    1289. 

  1289.   }
    1290. 

  1290. }
    1291. 

  1291. Module['writeArrayToMemory'] = writeArrayToMemory;
    1292. 

  1292. 

  1293. function writeAsciiToMemory(str, buffer, dontAddNull) {
    1294. 

  1294.   for (var i = 0; i < str.length; i++) {
    1295. 

  1295.     HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
    1296. 

  1296.   }
    1297. 

  1297.   if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
    1298. 

  1298. }
    1299. 

  1299. Module['writeAsciiToMemory'] = writeAsciiToMemory;
    1300. 

  1300. 

  1301. function unSign(value, bits, ignore) {
    1302. 

  1302.   if (value >= 0) {
    1303. 

  1303.     return value;
    1304. 

  1304.   }
    1305. 

  1305.   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
    1306. 

  1306.                     : Math.pow(2, bits)         + value;
    1307. 

  1307. }
    1308. 

  1308. function reSign(value, bits, ignore) {
    1309. 

  1309.   if (value <= 0) {
    1310. 

  1310.     return value;
    1311. 

  1311.   }
    1312. 

  1312.   var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
    1313. 

  1313.                         : Math.pow(2, bits-1);
    1314. 

  1314.   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
    1315. 

  1315.                                                        // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
    1316. 

  1316.                                                        // TODO: In i64 mode 1, resign the two parts separately and safely
    1317. 

  1317.     value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
    1318. 

  1318.   }
    1319. 

  1319.   return value;
    1320. 

  1320. }
    1321. 

  1321. 

  1322. // check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
    1323. 

  1323. if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
    1324. 

  1324.   var ah  = a >>> 16;
    1325. 

  1325.   var al = a & 0xffff;
    1326. 

  1326.   var bh  = b >>> 16;
    1327. 

  1327.   var bl = b & 0xffff;
    1328. 

  1328.   return (al*bl + ((ah*bl + al*bh) << 16))|0;
    1329. 

  1329. };
    1330. 

  1330. Math.imul = Math['imul'];
    1331. 

  1331. 

  1332. 

  1333. var Math_abs = Math.abs;
    1334. 

  1334. var Math_cos = Math.cos;
    1335. 

  1335. var Math_sin = Math.sin;
    1336. 

  1336. var Math_tan = Math.tan;
    1337. 

  1337. var Math_acos = Math.acos;
    1338. 

  1338. var Math_asin = Math.asin;
    1339. 

  1339. var Math_atan = Math.atan;
    1340. 

  1340. var Math_atan2 = Math.atan2;
    1341. 

  1341. var Math_exp = Math.exp;
    1342. 

  1342. var Math_log = Math.log;
    1343. 

  1343. var Math_sqrt = Math.sqrt;
    1344. 

  1344. var Math_ceil = Math.ceil;
    1345. 

  1345. var Math_floor = Math.floor;
    1346. 

  1346. var Math_pow = Math.pow;
    1347. 

  1347. var Math_imul = Math.imul;
    1348. 

  1348. var Math_fround = Math.fround;
    1349. 

  1349. var Math_min = Math.min;
    1350. 

  1350. 

  1351. // A counter of dependencies for calling run(). If we need to
    1352. 

  1352. // do asynchronous work before running, increment this and
    1353. 

  1353. // decrement it. Incrementing must happen in a place like
    1354. 

  1354. // PRE_RUN_ADDITIONS (used by emcc to add file preloading).
    1355. 

  1355. // Note that you can add dependencies in preRun, even though
    1356. 

  1356. // it happens right before run - run will be postponed until
    1357. 

  1357. // the dependencies are met.
    1358. 

  1358. var runDependencies = 0;
    1359. 

  1359. var runDependencyWatcher = null;
    1360. 

  1360. var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
    1361. 

  1361. 

  1362. function addRunDependency(id) {
    1363. 

  1363.   runDependencies++;
    1364. 

  1364.   if (Module['monitorRunDependencies']) {
    1365. 

  1365.     Module['monitorRunDependencies'](runDependencies);
    1366. 

  1366.   }
    1367. 

  1367. }
    1368. 

  1368. Module['addRunDependency'] = addRunDependency;
    1369. 

  1369. function removeRunDependency(id) {
    1370. 

  1370.   runDependencies--;
    1371. 

  1371.   if (Module['monitorRunDependencies']) {
    1372. 

  1372.     Module['monitorRunDependencies'](runDependencies);
    1373. 

  1373.   }
    1374. 

  1374.   if (runDependencies == 0) {
    1375. 

  1375.     if (runDependencyWatcher !== null) {
    1376. 

  1376.       clearInterval(runDependencyWatcher);
    1377. 

  1377.       runDependencyWatcher = null;
    1378. 

  1378.     }
    1379. 

  1379.     if (dependenciesFulfilled) {
    1380. 

  1380.       var callback = dependenciesFulfilled;
    1381. 

  1381.       dependenciesFulfilled = null;
    1382. 

  1382.       callback(); // can add another dependenciesFulfilled
    1383. 

  1383.     }
    1384. 

  1384.   }
    1385. 

  1385. }
    1386. 

  1386. Module['removeRunDependency'] = removeRunDependency;
    1387. 

  1387. 

  1388. Module["preloadedImages"] = {}; // maps url to image data
    1389. 

  1389. Module["preloadedAudios"] = {}; // maps url to audio data
    1390. 

  1390. 

  1391. 

  1392. var memoryInitializer = null;
    1393. 

  1393. 

  1394. // === Body ===
    1395. 

  1395. 

  1396. 

  1397. 

  1398. 

  1399. 

  1400. STATIC_BASE = 8;
    1401. 

  1401. 

  1402. STATICTOP = STATIC_BASE + Runtime.alignMemory(13467);
    1403. 

  1403. /* global initializers */ __ATINIT__.push();
    1404. 

  1404. 

  1405. 

  1406. /* memory initializer */ allocate([99,97,110,110,111,116,32,99,114,101,97,116,101,32,115,116,97,116,101,58,32,110,111,116,32,101,110,111,117,103,104,32,109,101,109,111,114,121,0,0,40,101,114,114,111,114,32,111,98,106,101,99,116,32,105,115,32,110,111,116,32,97,32,115,116,114,105,110,103,41,0,0,88,0,0,0,0,0,0,0,108,117,97,0,0,0,0,0,76,85,65,95,78,79,69,78,86,0,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,112,114,105,110,116,0,0,0,0,0,0,0,112,114,105,110,116,0,0,0,101,114,114,111,114,32,99,97,108,108,105,110,103,32,39,112,114,105,110,116,39,32,40,37,115,41,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,105,110,116,101,114,114,117,112,116,101,100,33,0,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,40,110,111,32,101,114,114,111,114,32,109,101,115,115,97,103,101,41,0,0,0,0,0,0,61,115,116,100,105,110,0,0,60,101,111,102,62,0,0,0,114,101,116,117,114,110,32,37,115,0,0,0,0,0,0,0,95,80,82,79,77,80,84,0,95,80,82,79,77,80,84,50,0,0,0,0,0,0,0,0,62,32,0,0,0,0,0,0,62,62,32,0,0,0,0,0,97,114,103,0,0,0,0,0,45,0,0,0,0,0,0,0,45,45,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,32,116,111,32,115,99,114,105,112,116,0,0,0,0,61,40,99,111,109,109,97,110,100,32,108,105,110,101,41,0,114,101,113,117,105,114,101,0,61,76,85,65,95,73,78,73,84,95,53,95,50,0,0,0,61,76,85,65,95,73,78,73,84,0,0,0,0,0,0,0,76,117,97,32,53,46,50,46,50,32,32,67,111,112,121,114,105,103,104,116,32,40,67,41,32,49,57,57,52,45,50,48,49,51,32,76,117,97,46,111,114,103,44,32,80,85,67,45,82,105,111,0,0,0,0,0,37,115,58,32,0,0,0,0,39,37,115,39,32,110,101,101,100,115,32,97,114,103,117,109,101,110,116,10,0,0,0,0,117,110,114,101,99,111,103,110,105,122,101,100,32,111,112,116,105,111,110,32,39,37,115,39,10,0,0,0,0,0,0,0,117,115,97,103,101,58,32,37,115,32,91,111,112,116,105,111,110,115,93,32,91,115,99,114,105,112,116,32,91,97,114,103,115,93,93,10,65,118,97,105,108,97,98,108,101,32,111,112,116,105,111,110,115,32,97,114,101,58,10,32,32,45,101,32,115,116,97,116,32,32,101,120,101,99,117,116,101,32,115,116,114,105,110,103,32,39,115,116,97,116,39,10,32,32,45,105,32,32,32,32,32,32,32,101,110,116,101,114,32,105,110,116,101,114,97,99,116,105,118,101,32,109,111,100,101,32,97,102,116,101,114,32,101,120,101,99,117,116,105,110,103,32,39,115,99,114,105,112,116,39,10,32,32,45,108,32,110,97,109,101,32,32,114,101,113,117,105,114,101,32,108,105,98,114,97,114,121,32,39,110,97,109,101,39,10,32,32,45,118,32,32,32,32,32,32,32,115,104,111,119,32,118,101,114,115,105,111,110,32,105,110,102,111,114,109,97,116,105,111,110,10,32,32,45,69,32,32,32,32,32,32,32,105,103,110,111,114,101,32,101,110,118,105,114,111,110,109,101,110,116,32,118,97,114,105,97,98,108,101,115,10,32,32,45,45,32,32,32,32,32,32,32,115,116,111,112,32,104,97,110,100,108,105,110,103,32,111,112,116,105,111,110,115,10,32,32,45,32,32,32,32,32,32,32,32,115,116,111,112,32,104,97,110,100,108,105,110,103,32,111,112,116,105,111,110,115,32,97,110,100,32,101,120,101,99,117,116,101,32,115,116,100,105,110,10,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,0,0,0,0,0,96,127,64,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,115,116,97,99,107,32,116,114,97,99,101,98,97,99,107,58,0,0,0,0,0,0,0,0,10,9,46,46,46,0,0,0,83,108,110,116,0,0,0,0,10,9,37,115,58,0,0,0,37,100,58,0,0,0,0,0,32,105,110,32,0,0,0,0,10,9,40,46,46,46,116,97,105,108,32,99,97,108,108,115,46,46,46,41,0,0,0,0,98,97,100,32,97,114,103,117,109,101,110,116,32,35,37,100,32,40,37,115,41,0,0,0,110,0,0,0,0,0,0,0,109,101,116,104,111,100,0,0,99,97,108,108,105,110,103,32,39,37,115,39,32,111,110,32,98,97,100,32,115,101,108,102,32,40,37,115,41,0,0,0,63,0,0,0,0,0,0,0,98,97,100,32,97,114,103,117,109,101,110,116,32,35,37,100,32,116,111,32,39,37,115,39,32,40,37,115,41,0,0,0,83,108,0,0,0,0,0,0,37,115,58,37,100,58,32,0,0,0,0,0,0,0,0,0,37,115,58,32,37,115,0,0,101,120,105,116,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,115,39,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,32,40,37,115,41,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,118,97,108,117,101,32,101,120,112,101,99,116,101,100,0,0,98,117,102,102,101,114,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,0,0,61,115,116,100,105,110,0,0,64,37,115,0,0,0,0,0,114,0,0,0,0,0,0,0,111,112,101,110,0,0,0,0,114,98,0,0,0,0,0,0,114,101,111,112,101,110,0,0,114,101,97,100,0,0,0,0,111,98,106,101,99,116,32,108,101,110,103,116,104,32,105,115,32,110,111,116,32,97,32,110,117,109,98,101,114,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,116,114,117,101,0,0,0,0,102,97,108,115,101,0,0,0,110,105,108,0,0,0,0,0,37,115,58,32,37,112,0,0,95,76,79,65,68,69,68,0,110,97,109,101,32,99,111,110,102,108,105,99,116,32,102,111,114,32,109,111,100,117,108,101,32,39,37,115,39,0,0,0,116,111,111,32,109,97,110,121,32,117,112,118,97,108,117,101,115,0,0,0,0,0,0,0,109,117,108,116,105,112,108,101,32,76,117,97,32,86,77,115,32,100,101,116,101,99,116,101,100,0,0,0,0,0,0,0,118,101,114,115,105,111,110,32,109,105,115,109,97,116,99,104,58,32,97,112,112,46,32,110,101,101,100,115,32,37,102,44,32,76,117,97,32,99,111,114,101,32,112,114,111,118,105,100,101,115,32,37,102,0,0,0,98,97,100,32,99,111,110,118,101,114,115,105,111,110,32,110,117,109,98,101,114,45,62,105,110,116,59,32,109,117,115,116,32,114,101,99,111,109,112,105,108,101,32,76,117,97,32,119,105,116,104,32,112,114,111,112,101,114,32,115,101,116,116,105,110,103,115,0,0,0,0,0,80,65,78,73,67,58,32,117,110,112,114,111,116,101,99,116,101,100,32,101,114,114,111,114,32,105,110,32,99,97,108,108,32,116,111,32,76,117,97,32,65,80,73,32,40,37,115,41,10,0,0,0,0,0,0,0,239,187,191,0,0,0,0,0,99,97,110,110,111,116,32,37,115,32,37,115,58,32,37,115,0,0,0,0,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,44,32,103,111,116,32,37,115,0,0,0,0,0,102,0,0,0,0,0,0,0,46,0,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,39,37,115,39,0,0,0,109,97,105,110,32,99,104,117,110,107,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,60,37,115,58,37,100,62,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,37,115,32,37,115,32,39,37,115,39,32,40,97,32,37,115,32,118,97,108,117,101,41,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,37,115,32,97,32,37,115,32,118,97,108,117,101,0,0,0,0,0,0,0,0,99,111,110,99,97,116,101,110,97,116,101,0,0,0,0,0,112,101,114,102,111,114,109,32,97,114,105,116,104,109,101,116,105,99,32,111,110,0,0,0,97,116,116,101,109,112,116,32,116,111,32,99,111,109,112,97,114,101,32,116,119,111,32,37,115,32,118,97,108,117,101,115,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,99,111,109,112,97,114,101,32,37,115,32,119,105,116,104,32,37,115,0,0,0,37,115,58,37,100,58,32,37,115,0,0,0,0,0,0,0,108,111,99,97,108,0,0,0,95,69,78,86,0,0,0,0,103,108,111,98,97,108,0,0,102,105,101,108,100,0,0,0,117,112,118,97,108,117,101,0,99,111,110,115,116,97,110,116,0,0,0,0,0,0,0,0,109,101,116,104,111,100,0,0,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,102,111,114,32,105,116,101,114,97,116,111,114,0,0,0,0,109,101,116,97,109,101,116,104,111,100,0,0,0,0,0,0,61,91,67,93,0,0,0,0,67,0,0,0,0,0,0,0,61,63,0,0,0,0,0,0,109,97,105,110,0,0,0,0,76,117,97,0,0,0,0,0,40,42,116,101,109,112,111,114,97,114,121,41,0,0,0,0,40,42,118,97,114,97,114,103,41,0,0,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,67,32,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,121,105,101,108,100,32,97,99,114,111,115,115,32,97,32,67,45,99,97,108,108,32,98,111,117,110,100,97,114,121,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,121,105,101,108,100,32,102,114,111,109,32,111,117,116,115,105,100,101,32,97,32,99,111,114,111,117,116,105,110,101,0,0,0,0,0,0,0,98,105,110,97,114,121,0,0,116,101,120,116,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,108,111,97,100,32,97,32,37,115,32,99,104,117,110,107,32,40,109,111,100,101,32,105,115,32,39,37,115,39,41,0,0,0,0,0,0,0,101,114,114,111,114,32,105,110,32,101,114,114,111,114,32,104,97,110,100,108,105,110,103,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,110,111,110,45,115,117,115,112,101,110,100,101,100,32,99,111,114,111,117,116,105,110,101,0,0,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,100,101,97,100,32,99,111,114,111,117,116,105,110,101,0,0,0,0,99,97,108,108,0,0,0,0,110,111,32,109,101,115,115,97,103,101,0,0,0,0,0,0,101,114,114,111,114,32,105,110,32,95,95,103,99,32,109,101,116,97,109,101,116,104,111,100,32,40,37,115,41,0,0,0,95,80,82,69,76,79,65,68,0,0,0,0,0,0,0,0,95,71,0,0,0,0,0,0,112,97,99,107,97,103,101,0,99,111,114,111,117,116,105,110,101,0,0,0,0,0,0,0,116,97,98,108,101,0,0,0,105,111,0,0,0,0,0,0,111,115,0,0,0,0,0,0,115,116,114,105,110,103,0,0,98,105,116,51,50,0,0,0,109,97,116,104,0,0,0,0,100,101,98,117,103,0,0,0,144,11,0,0,1,0,0,0,152,11,0,0,2,0,0,0,48,13,0,0,3,0,0,0,160,11,0,0,4,0,0,0,56,13,0,0,5,0,0,0,64,13,0,0,6,0,0,0,72,13,0,0,7,0,0,0,168,11,0,0,8,0,0,0,80,13,0,0,9,0,0,0,88,13,0,0,10,0,0,0,192,11,0,0,11,0,0,0,0,0,0,0,0,0,0,0,95,73,79,95,105,110,112,117,116,0,0,0,0,0,0,0,115,116,100,105,110,0,0,0,95,73,79,95,111,117,116,112,117,116,0,0,0,0,0,0,115,116,100,111,117,116,0,0,115,116,100,101,114,114,0,0,70,73,76,69,42,0,0,0,99,97,110,110,111,116,32,99,108,111,115,101,32,115,116,97,110,100,97,114,100,32,102,105,108,101,0,0,0,0,0,0,95,95,105,110,100,101,120,0,144,11,0,0,1,0,0,0,152,11,0,0,12,0,0,0,160,11,0,0,13,0,0,0,168,11,0,0,14,0,0,0,176,11,0,0,15,0,0,0,184,11,0,0,16,0,0,0,192,11,0,0,17,0,0,0,200,11,0,0,18,0,0,0,208,11,0,0,19,0,0,0,0,0,0,0,0,0,0,0,99,108,111,115,101,0,0,0,102,108,117,115,104,0,0,0,108,105,110,101,115,0,0,0,114,101,97,100,0,0,0,0,115,101,101,107,0,0,0,0,115,101,116,118,98,117,102,0,119,114,105,116,101,0,0,0,95,95,103,99,0,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,102,105,108,101,32,40,99,108,111,115,101,100,41,0,0,0,102,105,108,101,32,40,37,112,41,0,0,0,0,0,0,0,37,46,49,52,103,0,0,0,97,116,116,101,109,112,116,32,116,111,32,117,115,101,32,97,32,99,108,111,115,101,100,32,102,105,108,101,0,0,0,0,2,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,72,12,0,0,80,12,0,0,88,12,0,0,0,0,0,0,110,111,0,0,0,0,0,0,102,117,108,108,0,0,0,0,108,105,110,101,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,0,0,0,0,128,12,0,0,136,12,0,0,144,12,0,0,0,0,0,0,115,101,116,0,0,0,0,0,99,117,114,0,0,0,0,0,101,110,100,0,0,0,0,0,110,111,116,32,97,110,32,105,110,116,101,103,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,0,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,0,0,37,108,102,0,0,0,0,0,116,111,111,32,109,97,110,121,32,111,112,116,105,111,110,115,0,0,0,0,0,0,0,0,102,105,108,101,32,105,115,32,97,108,114,101,97,100,121,32,99,108,111,115,101,100,0,0,37,115,0,0,0,0,0,0,105,110,112,117,116,0,0,0,111,112,101,110,0,0,0,0,111,117,116,112,117,116,0,0,112,111,112,101,110,0,0,0,116,109,112,102,105,108,101,0,116,121,112,101,0,0,0,0,115,116,97,110,100,97,114,100,32,37,115,32,102,105,108,101,32,105,115,32,99,108,111,115,101,100,0,0,0,0,0,0,99,108,111,115,101,100,32,102,105,108,101,0,0,0,0,0,102,105,108,101,0,0,0,0,114,0,0,0,0,0,0,0,39,112,111,112,101,110,39,32,110,111,116,32,115,117,112,112,111,114,116,101,100,0,0,0,119,0,0,0,0,0,0,0,99,97,110,110,111,116,32,111,112,101,110,32,102,105,108,101,32,39,37,115,39,32,40,37,115,41,0,0,0,0,0,0,114,119,97,0,0,0,0,0,105,110,118,97,108,105,100,32,109,111,100,101,0,0,0,0,240,14,0,0,20,0,0,0,248,14,0,0,21,0,0,0,0,15,0,0,22,0,0,0,8,15,0,0,23,0,0,0,16,15,0,0,24,0,0,0,24,15,0,0,25,0,0,0,32,15,0,0,26,0,0,0,40,15,0,0,27,0,0,0,48,15,0,0,28,0,0,0,56,15,0,0,29,0,0,0,64,15,0,0,30,0,0,0,72,15,0,0,31,0,0,0,80,15,0,0,32,0,0,0,88,15,0,0,33,0,0,0,96,15,0,0,34,0,0,0,104,15,0,0,35,0,0,0,112,15,0,0,36,0,0,0,120,15,0,0,37,0,0,0,128,15,0,0,38,0,0,0,136,15,0,0,39,0,0,0,144,15,0,0,40,0,0,0,152,15,0,0,41,0,0,0,160,15,0,0,42,0,0,0,176,15,0,0,43,0,0,0,184,15,0,0,44,0,0,0,192,15,0,0,45,0,0,0,200,15,0,0,46,0,0,0,208,15,0,0,47,0,0,0,0,0,0,0,0,0,0,0,112,105,0,0,0,0,0,0,104,117,103,101,0,0,0,0,97,98,115,0,0,0,0,0,97,99,111,115,0,0,0,0,97,115,105,110,0,0,0,0,97,116,97,110,50,0,0,0,97,116,97,110,0,0,0,0,99,101,105,108,0,0,0,0,99,111,115,104,0,0,0,0,99,111,115,0,0,0,0,0,100,101,103,0,0,0,0,0,101,120,112,0,0,0,0,0,102,108,111,111,114,0,0,0,102,109,111,100,0,0,0,0,102,114,101,120,112,0,0,0,108,100,101,120,112,0,0,0,108,111,103,49,48,0,0,0,108,111,103,0,0,0,0,0,109,97,120,0,0,0,0,0,109,105,110,0,0,0,0,0,109,111,100,102,0,0,0,0,112,111,119,0,0,0,0,0,114,97,100,0,0,0,0,0,114,97,110,100,111,109,0,0,114,97,110,100,111,109,115,101,101,100,0,0,0,0,0,0,115,105,110,104,0,0,0,0,115,105,110,0,0,0,0,0,115,113,114,116,0,0,0,0,116,97,110,104,0,0,0,0,116,97,110,0,0,0,0,0,105,110,116,101,114,118,97,108,32,105,115,32,101,109,112,116,121,0,0,0,0,0,0,0,119,114,111,110,103,32,110,117,109,98,101,114,32,111,102,32,97,114,103,117,109,101,110,116,115,0,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,37,115,32,40,108,105,109,105,116,32,105,115,32,37,100,41,0,0,0,0,0,0,0,109,101,109,111,114,121,32,97,108,108,111,99,97,116,105,111,110,32,101,114,114,111,114,58,32,98,108,111,99,107,32,116,111,111,32,98,105,103,0,0,95,67,76,73,66,83,0,0,95,95,103,99,0,0,0,0,16,20,0,0,48,0,0,0,24,20,0,0,49,0,0,0,40,20,0,0,50,0,0,0,0,0,0,0,0,0,0,0,108,111,97,100,101,114,115,0,115,101,97,114,99,104,101,114,115,0,0,0,0,0,0,0,112,97,116,104,0,0,0,0,76,85,65,95,80,65,84,72,95,53,95,50,0,0,0,0,76,85,65,95,80,65,84,72,0,0,0,0,0,0,0,0,47,117,115,114,47,108,111,99,97,108,47,115,104,97,114,101,47,108,117,97,47,53,46,50,47,63,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,115,104,97,114,101,47,108,117,97,47,53,46,50,47,63,47,105,110,105,116,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,47,105,110,105,116,46,108,117,97,59,46,47,63,46,108,117,97,0,0,0,0,0,0,0,99,112,97,116,104,0,0,0,76,85,65,95,67,80,65,84,72,95,53,95,50,0,0,0,76,85,65,95,67,80,65,84,72,0,0,0,0,0,0,0,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,46,115,111,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,108,111,97,100,97,108,108,46,115,111,59,46,47,63,46,115,111,0,0,0,0,47,10,59,10,63,10,33,10,45,10,0,0,0,0,0,0,99,111,110,102,105,103,0,0,95,76,79,65,68,69,68,0,108,111,97,100,101,100,0,0,95,80,82,69,76,79,65,68,0,0,0,0,0,0,0,0,112,114,101,108,111,97,100,0,32,18,0,0,51,0,0,0,40,18,0,0,52,0,0,0,0,0,0,0,0,0,0,0,109,111,100,117,108,101,0,0,114,101,113,117,105,114,101,0,39,112,97,99,107,97,103,101,46,115,101,97,114,99,104,101,114,115,39,32,109,117,115,116,32,98,101,32,97,32,116,97,98,108,101,0,0,0,0,0,109,111,100,117,108,101,32,39,37,115,39,32,110,111,116,32,102,111,117,110,100,58,37,115,0,0,0,0,0,0,0,0,95,78,65,77,69,0,0,0,102,0,0,0,0,0,0,0,39,109,111,100,117,108,101,39,32,110,111,116,32,99,97,108,108,101,100,32,102,114,111,109,32,97,32,76,117,97,32,102,117,110,99,116,105,111,110,0,95,77,0,0,0,0,0,0,95,80,65,67,75,65,71,69,0,0,0,0,0,0,0,0,59,59,0,0,0,0,0,0,59,1,59,0,0,0,0,0,1,0,0,0,0,0,0,0,76,85,65,95,78,79,69,78,86,0,0,0,0,0,0,0,47,0,0,0,0,0,0,0,10,9,110,111,32,109,111,100,117,108,101,32,39,37,115,39,32,105,110,32,102,105,108,101,32,39,37,115,39,0,0,0,101,114,114,111,114,32,108,111,97,100,105,110,103,32,109,111,100,117,108,101,32,39,37,115,39,32,102,114,111,109,32,102,105,108,101,32,39,37,115,39,58,10,9,37,115,0,0,0,46,0,0,0,0,0,0,0,95,0,0,0,0,0,0,0,108,117,97,111,112,101,110,95,37,115,0,0,0,0,0,0,100,121,110,97,109,105,99,32,108,105,98,114,97,114,105,101,115,32,110,111,116,32,101,110,97,98,108,101,100,59,32,99,104,101,99,107,32,121,111,117,114,32,76,117,97,32,105,110,115,116,97,108,108,97,116,105,111,110,0,0,0,0,0,0,39,112,97,99,107,97,103,101,46,37,115,39,32,109,117,115,116,32,98,101,32,97,32,115,116,114,105,110,103,0,0,0,63,0,0,0,0,0,0,0,10,9,110,111,32,102,105,108,101,32,39,37,115,39,0,0,114,0,0,0,0,0,0,0,10,9,110,111,32,102,105,101,108,100,32,112,97,99,107,97,103,101,46,112,114,101,108,111,97,100,91,39,37,115,39,93,0,0,0,0,0,0,0,0,108,111,97,100,108,105,98,0,115,101,97,114,99,104,112,97,116,104,0,0,0,0,0,0,115,101,101,97,108,108,0,0,95,95,105,110,100,101,120,0,97,98,115,101,110,116,0,0,105,110,105,116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,110,78,0,0,0,0,0,0,120,88,0,0,0,0,0,0,40,110,117,108,108,41,0,0,37,112,0,0,0,0,0,0,37,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,37,37,99,39,32,116,111,32,39,108,117,97,95,112,117,115,104,102,115,116,114,105,110,103,39,0,0,0,0,0,0,46,46,46,0,0,0,0,0,91,115,116,114,105,110,103,32,34,0,0,0,0,0,0,0,34,93,0,0,0,0,0,0,96,113,65,84,80,80,92,108,60,16,60,84,108,124,124,124,124,124,124,96,96,96,104,34,188,188,188,132,228,84,84,16,98,98,4,98,20,81,80,23,88,22,0,0,53,0,0,0,96,22,0,0,54,0,0,0,104,22,0,0,55,0,0,0,120,22,0,0,56,0,0,0,128,22,0,0,57,0,0,0,136,22,0,0,58,0,0,0,144,22,0,0,59,0,0,0,152,22,0,0,60,0,0,0,160,22,0,0,61,0,0,0,176,22,0,0,62,0,0,0,184,22,0,0,63,0,0,0,0,0,0,0,0,0,0,0,99,108,111,99,107,0,0,0,100,97,116,101,0,0,0,0,100,105,102,102,116,105,109,101,0,0,0,0,0,0,0,0,101,120,101,99,117,116,101,0,101,120,105,116,0,0,0,0,103,101,116,101,110,118,0,0,114,101,109,111,118,101,0,0,114,101,110,97,109,101,0,0,115,101,116,108,111,99,97,108,101,0,0,0,0,0,0,0,116,105,109,101,0,0,0,0,116,109,112,110,97,109,101,0,117,110,97,98,108,101,32,116,111,32,103,101,110,101,114,97,116,101,32,97,32,117,110,105,113,117,101,32,102,105,108,101,110,97,109,101,0,0,0,0,115,101,99,0,0,0,0,0,109,105,110,0,0,0,0,0,104,111,117,114,0,0,0,0,100,97,121,0,0,0,0,0,109,111,110,116,104,0,0,0,121,101,97,114,0,0,0,0,105,115,100,115,116,0,0,0,102,105,101,108,100,32,39,37,115,39,32,109,105,115,115,105,110,103,32,105,110,32,100,97,116,101,32,116,97,98,108,101,0,0,0,0,0,0,0,0,6,0,0,0,3,0,0,0,0,0,0,0,4,0,0,0,1,0,0,0,2,0,0,0,128,23,0,0,136,23,0,0,144,23,0,0,152,23,0,0,168,23,0,0,176,22,0,0,0,0,0,0,0,0,0,0,97,108,108,0,0,0,0,0,99,111,108,108,97,116,101,0,99,116,121,112,101,0,0,0,109,111,110,101,116,97,114,121,0,0,0,0,0,0,0,0,110,117,109,101,114,105,99,0,37,99,0,0,0,0,0,0,42,116,0,0,0,0,0,0,119,100,97,121,0,0,0,0,121,100,97,121,0,0,0,0,97,65,98,66,99,100,72,73,106,109,77,112,83,85,119,87,120,88,121,89,122,37,0,0,105,110,118,97,108,105,100,32,99,111,110,118,101,114,115,105,111,110,32,115,112,101,99,105,102,105,101,114,32,39,37,37,37,115,39,0,0,0,0,0,60,37,115,62,32,97,116,32,108,105,110,101,32,37,100,32,110,111,116,32,105,110,115,105,100,101,32,97,32,108,111,111,112,0,0,0,0,0,0,0,110,111,32,118,105,115,105,98,108,101,32,108,97,98,101,108,32,39,37,115,39,32,102,111,114,32,60,103,111,116,111,62,32,97,116,32,108,105,110,101,32,37,100,0,0,0,0,0,60,103,111,116,111,32,37,115,62,32,97,116,32,108,105,110,101,32,37,100,32,106,117,109,112,115,32,105,110,116,111,32,116,104,101,32,115,99,111,112,101,32,111,102,32,108,111,99,97,108,32,39,37,115,39,0,98,114,101,97,107,0,0,0,108,97,98,101,108,115,47,103,111,116,111,115,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,0,0,0,0,0,115,121,110,116,97,120,32,101,114,114,111,114,0,0,0,0,67,32,108,101,118,101,108,115,0,0,0,0,0,0,0,0,6,6,6,6,7,7,7,7,7,7,10,9,5,4,3,3,3,3,3,3,3,3,3,3,3,3,2,2,1,1,0,0,99,97,110,110,111,116,32,117,115,101,32,39,46,46,46,39,32,111,117,116,115,105,100,101,32,97,32,118,97,114,97,114,103,32,102,117,110,99,116,105,111,110,0,0,0,0,0,0,115,101,108,102,0,0,0,0,60,110,97,109,101,62,32,111,114,32,39,46,46,46,39,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,0,0,108,111,99,97,108,32,118,97,114,105,97,98,108,101,115,0,102,117,110,99,116,105,111,110,115,0,0,0,0,0,0,0,105,116,101,109,115,32,105,110,32,97,32,99,111,110,115,116,114,117,99,116,111,114,0,0,109,97,105,110,32,102,117,110,99,116,105,111,110,0,0,0,102,117,110,99,116,105,111,110,32,97,116,32,108,105,110,101,32,37,100,0,0,0,0,0,116,111,111,32,109,97,110,121,32,37,115,32,40,108,105,109,105,116,32,105,115,32,37,100,41,32,105,110,32,37,115,0,102,117,110,99,116,105,111,110,32,97,114,103,117,109,101,110,116,115,32,101,120,112,101,99,116,101,100,0,0,0,0,0,117,110,101,120,112,101,99,116,101,100,32,115,121,109,98,111,108,0,0,0,0,0,0,0,108,97,98,101,108,32,39,37,115,39,32,97,108,114,101,97,100,121,32,100,101,102,105,110,101,100,32,111,110,32,108,105,110,101,32,37,100,0,0,0,39,61,39,32,111,114,32,39,105,110,39,32,101,120,112,101,99,116,101,100,0,0,0,0,40,102,111,114,32,103,101,110,101,114,97,116,111,114,41,0,40,102,111,114,32,115,116,97,116,101,41,0,0,0,0,0,40,102,111,114,32,99,111,110,116,114,111,108,41,0,0,0,40,102,111,114,32,105,110,100,101,120,41,0,0,0,0,0,40,102,111,114,32,108,105,109,105,116,41,0,0,0,0,0,40,102,111,114,32,115,116,101,112,41,0,0,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,32,40,116,111,32,99,108,111,115,101,32,37,115,32,97,116,32,108,105,110,101,32,37,100,41,0,0,0,0,117,112,118,97,108,117,101,115,0,0,0,0,0,0,0,0,110,111,116,32,101,110,111,117,103,104,32,109,101,109,111,114,121,0,0,0,0,0,0,0,144,27,0,0,64,0,0,0,152,27,0,0,65,0,0,0,160,27,0,0,66,0,0,0,168,27,0,0,67,0,0,0,176,27,0,0,68,0,0,0,184,27,0,0,69,0,0,0,192,27,0,0,70,0,0,0,200,27,0,0,71,0,0,0,208,27,0,0,72,0,0,0,216,27,0,0,73,0,0,0,224,27,0,0,74,0,0,0,232,27,0,0,75,0,0,0,240,27,0,0,76,0,0,0,248,27,0,0,77,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,95,95,105,110,100,101,120,0,98,121,116,101,0,0,0,0,99,104,97,114,0,0,0,0,100,117,109,112,0,0,0,0,102,105,110,100,0,0,0,0,102,111,114,109,97,116,0,0,103,109,97,116,99,104,0,0,103,115,117,98,0,0,0,0,108,101,110,0,0,0,0,0,108,111,119,101,114,0,0,0,109,97,116,99,104,0,0,0,114,101,112,0,0,0,0,0,114,101,118,101,114,115,101,0,115,117,98,0,0,0,0,0,117,112,112,101,114,0,0,0,114,101,115,117,108,116,105,110,103,32,115,116,114,105,110,103,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,99,97,112,116,117,114,101,115,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,99,97,112,116,117,114,101,32,105,110,100,101,120,0,0,0,117,110,102,105,110,105,115,104,101,100,32,99,97,112,116,117,114,101,0,0,0,0,0,0,112,97,116,116,101,114,110,32,116,111,111,32,99,111,109,112,108,101,120,0,0,0,0,0,109,105,115,115,105,110,103,32,39,91,39,32,97,102,116,101,114,32,39,37,37,102,39,32,105,110,32,112,97,116,116,101,114,110,0,0,0,0,0,0,105,110,118,97,108,105,100,32,99,97,112,116,117,114,101,32,105,110,100,101,120,32,37,37,37,100,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,101,110,100,115,32,119,105,116,104,32,39,37,37,39,41,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,109,105,115,115,105,110,103,32,39,93,39,41,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,109,105,115,115,105,110,103,32,97,114,103,117,109,101,110,116,115,32,116,111,32,39,37,37,98,39,41,0,0,105,110,118,97,108,105,100,32,112,97,116,116,101,114,110,32,99,97,112,116,117,114,101,0,94,36,42,43,63,46,40,91,37,45,0,0,0,0,0,0,115,116,114,105,110,103,47,102,117,110,99,116,105,111,110,47,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,105,110,118,97,108,105,100,32,114,101,112,108,97,99,101,109,101,110,116,32,118,97,108,117,101,32,40,97,32,37,115,41,0,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,117,115,101,32,111,102,32,39,37,99,39,32,105,110,32,114,101,112,108,97,99,101,109,101,110,116,32,115,116,114,105,110,103,0,0,0,0,0,0,0,110,111,32,118,97,108,117,101,0,0,0,0,0,0,0,0,110,111,116,32,97,32,110,117,109,98,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,0,0,110,111,116,32,97,32,110,111,110,45,110,101,103,97,116,105,118,101,32,110,117,109,98,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,37,37,99,39,32,116,111,32,39,102,111,114,109,97,116,39,0,0,0,0,0,0,0,92,37,100,0,0,0,0,0,92,37,48,51,100,0,0,0,45,43,32,35,48,0,0,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,32,40,114,101,112,101,97,116,101,100,32,102,108,97,103,115,41,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,32,40,119,105,100,116,104,32,111,114,32,112,114,101,99,105,115,105,111,110,32,116,111,111,32,108,111,110,103,41,0,0,0,0,117,110,97,98,108,101,32,116,111,32,100,117,109,112,32,103,105,118,101,110,32,102,117,110,99,116,105,111,110,0,0,0,118,97,108,117,101,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,115,116,114,105,110,103,32,115,108,105,99,101,32,116,111,111,32,108,111,110,103,0,0,0,116,97,98,108,101,32,105,110,100,101,120,32,105,115,32,110,105,108,0,0,0,0,0,0,116,97,98,108,101,32,105,110,100,101,120,32,105,115,32,78,97,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,116,97,98,108,101,32,111,118,101,114,102,108,111,119,0,0,105,110,118,97,108,105,100,32,107,101,121,32,116,111,32,39,110,101,120,116,39,0,0,0,224,31,0,0,78,0,0,0,232,31,0,0,79,0,0,0,240,31,0,0,80,0,0,0,248,31,0,0,81,0,0,0,216,31,0,0,82,0,0,0,0,32,0,0,83,0,0,0,8,32,0,0,84,0,0,0,0,0,0,0,0,0,0,0,117,110,112,97,99,107,0,0,99,111,110,99,97,116,0,0,109,97,120,110,0,0,0,0,105,110,115,101,114,116,0,0,112,97,99,107,0,0,0,0,114,101,109,111,118,101,0,0,115,111,114,116,0,0,0,0,0,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,114,100,101,114,32,102,117,110,99,116,105,111,110,32,102,111,114,32,115,111,114,116,105,110,103,0,0,0,0,0,0,112,111,115,105,116,105,111,110,32,111,117,116,32,111,102,32,98,111,117,110,100,115,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,117,110,112,97,99,107,0,0,0,0,0,0,110,0,0,0,0,0,0,0,119,114,111,110,103,32,110,117,109,98,101,114,32,111,102,32,97,114,103,117,109,101,110,116,115,32,116,111,32,39,105,110,115,101,114,116,39,0,0,0,105,110,118,97,108,105,100,32,118,97,108,117,101,32,40,37,115,41,32,97,116,32,105,110,100,101,120,32,37,100,32,105,110,32,116,97,98,108,101,32,102,111,114,32,39,99,111,110,99,97,116,39,0,0,0,0,110,111,32,118,97,108,117,101,0,0,0,0,0,0,0,0,110,105,108,0,0,0,0,0,98,111,111,108,101,97,110,0,117,115,101,114,100,97,116,97,0,0,0,0,0,0,0,0,110,117,109,98,101,114,0,0,115,116,114,105,110,103,0,0,116,97,98,108,101,0,0,0,102,117,110,99,116,105,111,110,0,0,0,0,0,0,0,0,116,104,114,101,97,100,0,0,112,114,111,116,111,0,0,0,117,112,118,97,108,0,0,0,224,32,0,0,240,32,0,0,248,32,0,0,0,33,0,0,16,33,0,0,24,33,0,0,32,33,0,0,40,33,0,0,0,33,0,0,56,33,0,0,64,33,0,0,72,33,0,0,200,33,0,0,208,33,0,0,224,33,0,0,232,33,0,0,240,33,0,0,248,33,0,0,0,34,0,0,8,34,0,0,16,34,0,0,24,34,0,0,32,34,0,0,40,34,0,0,48,34,0,0,56,34,0,0,64,34,0,0,72,34,0,0,88,34,0,0,0,0,0,0,95,95,105,110,100,101,120,0,95,95,110,101,119,105,110,100,101,120,0,0,0,0,0,0,95,95,103,99,0,0,0,0,95,95,109,111,100,101,0,0,95,95,108,101,110,0,0,0,95,95,101,113,0,0,0,0,95,95,97,100,100,0,0,0,95,95,115,117,98,0,0,0,95,95,109,117,108,0,0,0,95,95,100,105,118,0,0,0,95,95,109,111,100,0,0,0,95,95,112,111,119,0,0,0,95,95,117,110,109,0,0,0,95,95,108,116,0,0,0,0,95,95,108,101,0,0,0,0,95,95,99,111,110,99,97,116,0,0,0,0,0,0,0,0,95,95,99,97,108,108,0,0,98,105,110,97,114,121,32,115,116,114,105,110,103,0,0,0,25,147,13,10,26,10,0,0,116,114,117,110,99,97,116,101,100,0,0,0,0,0,0,0,37,115,58,32,37,115,32,112,114,101,99,111,109,112,105,108,101,100,32,99,104,117,110,107,0,0,0,0,0,0,0,0,99,111,114,114,117,112,116,101,100,0,0,0,0,0,0,0,110,111,116,32,97,0,0,0,118,101,114,115,105,111,110,32,109,105,115,109,97,116,99,104,32,105,110,0,0,0,0,0,105,110,99,111,109,112,97,116,105,98,108,101,0,0,0,0,37,46,49,52,103,0,0,0,105,110,100,101,120,0,0,0,108,111,111,112,32,105,110,32,103,101,116,116,97,98,108,101,0,0,0,0,0,0,0,0,108,111,111,112,32,105,110,32,115,101,116,116,97,98,108,101,0,0,0,0,0,0,0,0,115,116,114,105,110,103,32,108,101,110,103,116,104,32,111,118,101,114,102,108,111,119,0,0,103,101,116,32,108,101,110,103,116,104,32,111,102,0,0,0,39,102,111,114,39,32,105,110,105,116,105,97,108,32,118,97,108,117,101,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,39,102,111,114,39,32,108,105,109,105,116,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,39,102,111,114,39,32,115,116,101,112,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,0,95,71,0,0,0,0,0,0,152,36,0,0,85,0,0,0,160,36,0,0,86,0,0,0,176,36,0,0,87,0,0,0,184,36,0,0,88,0,0,0,192,36,0,0,89,0,0,0,208,36,0,0,90,0,0,0,216,36,0,0,91,0,0,0,232,36,0,0,92,0,0,0,240,36,0,0,92,0,0,0,0,37,0,0,93,0,0,0,8,37,0,0,94,0,0,0,16,37,0,0,95,0,0,0,24,37,0,0,96,0,0,0,32,37,0,0,97,0,0,0,48,37,0,0,98,0,0,0,56,37,0,0,99,0,0,0,64,37,0,0,100,0,0,0,72,37,0,0,101,0,0,0,80,37,0,0,102,0,0,0,96,37,0,0,103,0,0,0,112,37,0,0,104,0,0,0,128,37,0,0,105,0,0,0,136,37,0,0,106,0,0,0,0,0,0,0,0,0,0,0,76,117,97,32,53,46,50,0,95,86,69,82,83,73,79,78,0,0,0,0,0,0,0,0,97,115,115,101,114,116,0,0,99,111,108,108,101,99,116,103,97,114,98,97,103,101,0,0,100,111,102,105,108,101,0,0,101,114,114,111,114,0,0,0,103,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,105,112,97,105,114,115,0,0,108,111,97,100,102,105,108,101,0,0,0,0,0,0,0,0,108,111,97,100,0,0,0,0,108,111,97,100,115,116,114,105,110,103,0,0,0,0,0,0,110,101,120,116,0,0,0,0,112,97,105,114,115,0,0,0,112,99,97,108,108,0,0,0,112,114,105,110,116,0,0,0,114,97,119,101,113,117,97,108,0,0,0,0,0,0,0,0,114,97,119,108,101,110,0,0,114,97,119,103,101,116,0,0,114,97,119,115,101,116,0,0,115,101,108,101,99,116,0,0,115,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,116,111,110,117,109,98,101,114,0,0,0,0,0,0,0,0,116,111,115,116,114,105,110,103,0,0,0,0,0,0,0,0,116,121,112,101,0,0,0,0,120,112,99,97,108,108,0,0,118,97,108,117,101,32,101,120,112,101,99,116,101,100,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,98,97,115,101,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,0,32,12,10,13,9,11,0,0,110,105,108,32,111,114,32,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,0,95,95,109,101,116,97,116,97,98,108,101,0,0,0,0,0,99,97,110,110,111,116,32,99,104,97,110,103,101,32,97,32,112,114,111,116,101,99,116,101,100,32,109,101,116,97,116,97,98,108,101,0,0,0,0,0,105,110,100,101,120,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,116,97,98,108,101,32,111,114,32,115,116,114,105,110,103,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,0,0,39,116,111,115,116,114,105,110,103,39,32,109,117,115,116,32,114,101,116,117,114,110,32,97,32,115,116,114,105,110,103,32,116,111,32,39,112,114,105,110,116,39,0,0,0,0,0,0,95,95,112,97,105,114,115,0,98,116,0,0,0,0,0,0,61,40,108,111,97,100,41,0,116,111,111,32,109,97,110,121,32,110,101,115,116,101,100,32,102,117,110,99,116,105,111,110,115,0,0,0,0,0,0,0,114,101,97,100,101,114,32,102,117,110,99,116,105,111,110,32,109,117,115,116,32,114,101,116,117,114,110,32,97,32,115,116,114,105,110,103,0,0,0,0,95,95,105,112,97,105,114,115,0,0,0,0,0,0,0,0,40,39,0,0,48,39,0,0,56,39,0,0,64,39,0,0,72,39,0,0,80,39,0,0,96,39,0,0,112,39,0,0,128,39,0,0,144,39,0,0,160,39,0,0,0,0,0,0,115,116,111,112,0,0,0,0,114,101,115,116,97,114,116,0,99,111,108,108,101,99,116,0,99,111,117,110,116,0,0,0,115,116,101,112,0,0,0,0,115,101,116,112,97,117,115,101,0,0,0,0,0,0,0,0,115,101,116,115,116,101,112,109,117,108,0,0,0,0,0,0,115,101,116,109,97,106,111,114,105,110,99,0,0,0,0,0,105,115,114,117,110,110,105,110,103,0,0,0,0,0,0,0,103,101,110,101,114,97,116,105,111,110,97,108,0,0,0,0,105,110,99,114,101,109,101,110,116,97,108,0,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,5,0,0,0,6,0,0,0,7,0,0,0,8,0,0,0,9,0,0,0,10,0,0,0,11,0,0,0,0,0,0,0,37,115,0,0,0,0,0,0,97,115,115,101,114,116,105,111,110,32,102,97,105,108,101,100,33,0,0,0,0,0,0,0,104,40,0,0,107], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
    1407. 

  1407. /* memory initializer */ allocate([112,40,0,0,108,0,0,0,120,40,0,0,109,0,0,0,128,40,0,0,110,0,0,0,136,40,0,0,111,0,0,0,144,40,0,0,112,0,0,0,152,40,0,0,113,0,0,0,160,40,0,0,114,0,0,0,168,40,0,0,115,0,0,0,176,40,0,0,116,0,0,0,184,40,0,0,117,0,0,0,192,40,0,0,118,0,0,0,0,0,0,0,0,0,0,0,97,114,115,104,105,102,116,0,98,97,110,100,0,0,0,0,98,110,111,116,0,0,0,0,98,111,114,0,0,0,0,0,98,120,111,114,0,0,0,0,98,116,101,115,116,0,0,0,101,120,116,114,97,99,116,0,108,114,111,116,97,116,101,0,108,115,104,105,102,116,0,0,114,101,112,108,97,99,101,0,114,114,111,116,97,116,101,0,114,115,104,105,102,116,0,0,102,105,101,108,100,32,99,97,110,110,111,116,32,98,101,32,110,101,103,97,116,105,118,101,0,0,0,0,0,0,0,0,119,105,100,116,104,32,109,117,115,116,32,98,101,32,112,111,115,105,116,105,118,101,0,0,116,114,121,105,110,103,32,116,111,32,97,99,99,101,115,115,32,110,111,110,45,101,120,105,115,116,101,110,116,32,98,105,116,115,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,111,114,32,101,120,112,114,101,115,115,105,111,110,32,116,111,111,32,99,111,109,112,108,101,120,0,0,0,0,0,0,99,111,110,115,116,114,117,99,116,111,114,32,116,111,111,32,108,111,110,103,0,0,0,0,99,111,110,115,116,97,110,116,115,0,0,0,0,0,0,0,111,112,99,111,100,101,115,0,99,111,110,116,114,111,108,32,115,116,114,117,99,116,117,114,101,32,116,111,111,32,108,111,110,103,0,0,0,0,0,0,216,41,0,0,119,0,0,0,224,41,0,0,120,0,0,0,232,41,0,0,121,0,0,0,240,41,0,0,122,0,0,0,248,41,0,0,123,0,0,0,0,42,0,0,124,0,0,0,0,0,0,0,0,0,0,0,99,114,101,97,116,101,0,0,114,101,115,117,109,101,0,0,114,117,110,110,105,110,103,0,115,116,97,116,117,115,0,0,119,114,97,112,0,0,0,0,121,105,101,108,100,0,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,32,116,111,32,114,101,115,117,109,101,0,0,0,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,100,101,97,100,32,99,111,114,111,117,116,105,110,101,0,0,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,114,101,115,117,109,101,0,0,0,0,0,0,99,111,114,111,117,116,105,110,101,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,115,117,115,112,101,110,100,101,100,0,0,0,0,0,0,0,110,111,114,109,97,108,0,0,100,101,97,100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,8,8,8,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,22,22,22,22,22,22,22,22,22,22,4,4,4,4,4,4,4,21,21,21,21,21,21,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,5,4,21,21,21,21,21,21,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,44,0,0,125,0,0,0,56,44,0,0,126,0,0,0,72,44,0,0,127,0,0,0,80,44,0,0,128,0,0,0,88,44,0,0,129,0,0,0,104,44,0,0,130,0,0,0,120,44,0,0,131,0,0,0,136,44,0,0,132,0,0,0,152,44,0,0,133,0,0,0,168,44,0,0,134,0,0,0,184,44,0,0,135,0,0,0,200,44,0,0,136,0,0,0,208,44,0,0,137,0,0,0,224,44,0,0,138,0,0,0,240,44,0,0,139,0,0,0,0,45,0,0,140,0,0,0,0,0,0,0,0,0,0,0,100,101,98,117,103,0,0,0,103,101,116,117,115,101,114,118,97,108,117,101,0,0,0,0,103,101,116,104,111,111,107,0,103,101,116,105,110,102,111,0,103,101,116,108,111,99,97,108,0,0,0,0,0,0,0,0,103,101,116,114,101,103,105,115,116,114,121,0,0,0,0,0,103,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,103,101,116,117,112,118,97,108,117,101,0,0,0,0,0,0,117,112,118,97,108,117,101,106,111,105,110,0,0,0,0,0,117,112,118,97,108,117,101,105,100,0,0,0,0,0,0,0,115,101,116,117,115,101,114,118,97,108,117,101,0,0,0,0,115,101,116,104,111,111,107,0,115,101,116,108,111,99,97,108,0,0,0,0,0,0,0,0,115,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,115,101,116,117,112,118,97,108,117,101,0,0,0,0,0,0,116,114,97,99,101,98,97,99,107,0,0,0,0,0,0,0,110,105,108,32,111,114,32,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,0,108,101,118,101,108,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,95,72,75,69,89,0,0,0,107,0,0,0,0,0,0,0,95,95,109,111,100,101,0,0,112,45,0,0,120,45,0,0,128,45,0,0,136,45,0,0,144,45,0,0,0,0,0,0,99,97,108,108,0,0,0,0,114,101,116,117,114,110,0,0,108,105,110,101,0,0,0,0,99,111,117,110,116,0,0,0,116,97,105,108,32,99,97,108,108,0,0,0,0,0,0,0,102,117,108,108,32,117,115,101,114,100,97,116,97,32,101,120,112,101,99,116,101,100,44,32,103,111,116,32,108,105,103,104,116,32,117,115,101,114,100,97,116,97,0,0,0,0,0,0,62,117,0,0,0,0,0,0,105,110,118,97,108,105,100,32,117,112,118,97,108,117,101,32,105,110,100,101,120,0,0,0,76,117,97,32,102,117,110,99,116,105,111,110,32,101,120,112,101,99,116,101,100,0,0,0,102,108,110,83,116,117,0,0,62,37,115,0,0,0,0,0,102,117,110,99,116,105,111,110,32,111,114,32,108,101,118,101,108,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,0,0,115,111,117,114,99,101,0,0,115,104,111,114,116,95,115,114,99,0,0,0,0,0,0,0,108,105,110,101,100,101,102,105,110,101,100,0,0,0,0,0,108,97,115,116,108,105,110,101,100,101,102,105,110,101,100,0,119,104,97,116,0,0,0,0,99,117,114,114,101,110,116,108,105,110,101,0,0,0,0,0,110,117,112,115,0,0,0,0,110,112,97,114,97,109,115,0,105,115,118,97,114,97,114,103,0,0,0,0,0,0,0,0,110,97,109,101,0,0,0,0,110,97,109,101,119,104,97,116,0,0,0,0,0,0,0,0,105,115,116,97,105,108,99,97,108,108,0,0,0,0,0,0,97,99,116,105,118,101,108,105,110,101,115,0,0,0,0,0,102,117,110,99,0,0,0,0,101,120,116,101,114,110,97,108,32,104,111,111,107,0,0,0,108,117,97,95,100,101,98,117,103,62,32,0,0,0,0,0,99,111,110,116,10,0,0,0,61,40,100,101,98,117,103,32,99,111,109,109,97,110,100,41,0,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,80,49,0,0,88,49,0,0,96,49,0,0,104,49,0,0,112,49,0,0,120,49,0,0,128,49,0,0,136,49,0,0,144,49,0,0,160,49,0,0,168,49,0,0,176,49,0,0,184,49,0,0,192,49,0,0,200,49,0,0,208,49,0,0,216,49,0,0,224,49,0,0,232,49,0,0,240,49,0,0,248,49,0,0,0,50,0,0,8,50,0,0,16,50,0,0,24,50,0,0,32,50,0,0,40,50,0,0,48,50,0,0,56,50,0,0,64,50,0,0,72,50,0,0,88,50,0,0,96,50,0,0,0,0,0,0,39,37,99,39,0,0,0,0,99,104,97,114,40,37,100,41,0,0,0,0,0,0,0,0,39,37,115,39,0,0,0,0,95,69,78,86,0,0,0,0,105,110,118,97,108,105,100,32,108,111,110,103,32,115,116,114,105,110,103,32,100,101,108,105,109,105,116,101,114,0,0,0,46,0,0,0,0,0,0,0,69,101,0,0,0,0,0,0,88,120,0,0,0,0,0,0,80,112,0,0,0,0,0,0,43,45,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,110,117,109,98,101,114,0,0,0,0,0,0,0,0,108,101,120,105,99,97,108,32,101,108,101,109,101,110,116,32,116,111,111,32,108,111,110,103,0,0,0,0,0,0,0,0,117,110,102,105,110,105,115,104,101,100,32,115,116,114,105,110,103,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,101,115,99,97,112,101,32,115,101,113,117,101,110,99,101,0,100,101,99,105,109,97,108,32,101,115,99,97,112,101,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,0,0,104,101,120,97,100,101,99,105,109,97,108,32,100,105,103,105,116,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,117,110,102,105,110,105,115,104,101,100,32,108,111,110,103,32,115,116,114,105,110,103,0,0,117,110,102,105,110,105,115,104,101,100,32,108,111,110,103,32,99,111,109,109,101,110,116,0,99,104,117,110,107,32,104,97,115,32,116,111,111,32,109,97,110,121,32,108,105,110,101,115,0,0,0,0,0,0,0,0,37,115,58,37,100,58,32,37,115,0,0,0,0,0,0,0,37,115,32,110,101,97,114,32,37,115,0,0,0,0,0,0,97,110,100,0,0,0,0,0,98,114,101,97,107,0,0,0,100,111,0,0,0,0,0,0,101,108,115,101,0,0,0,0,101,108,115,101,105,102,0,0,101,110,100,0,0,0,0,0,102,97,108,115,101,0,0,0,102,111,114,0,0,0,0,0,102,117,110,99,116,105,111,110,0,0,0,0,0,0,0,0,103,111,116,111,0,0,0,0,105,102,0,0,0,0,0,0,105,110,0,0,0,0,0,0,108,111,99,97,108,0,0,0,110,105,108,0,0,0,0,0,110,111,116,0,0,0,0,0,111,114,0,0,0,0,0,0,114,101,112,101,97,116,0,0,114,101,116,117,114,110,0,0,116,104,101,110,0,0,0,0,116,114,117,101,0,0,0,0,117,110,116,105,108,0,0,0,119,104,105,108,101,0,0,0,46,46,0,0,0,0,0,0,46,46,46,0,0,0,0,0,61,61,0,0,0,0,0,0,62,61,0,0,0,0,0,0,60,61,0,0,0,0,0,0,126,61,0,0,0,0,0,0,58,58,0,0,0,0,0,0,60,101,111,102,62,0,0,0,60,110,117,109,98,101,114,62,0,0,0,0,0,0,0,0,60,110,97,109,101,62,0,0,60,115,116,114,105,110,103,62,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,105,110,102,105,110,105,116,121,0,0,0,0,0,0,0,0,110,97,110,0,0,0,0,0,95,112,137,0,255,9,47,15,10,0,0,0,100,0,0,0,232,3,0,0,16,39,0,0,160,134,1,0,64,66,15,0,128,150,152,0,0,225,245,5], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE+10240);
    1408. 

  1408. 

  1409. 

  1410. 

  1411. 

  1412. var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
    1413. 

  1413. 

  1414. assert(tempDoublePtr % 8 == 0);
    1415. 

  1415. 

  1416. function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
    1417. 

  1417. 

  1418.   HEAP8[tempDoublePtr] = HEAP8[ptr];
    1419. 

  1419. 

  1420.   HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
    1421. 

  1421. 

  1422.   HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
    1423. 

  1423. 

  1424.   HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
    1425. 

  1425. 

  1426. }
    1427. 

  1427. 

  1428. function copyTempDouble(ptr) {
    1429. 

  1429. 

  1430.   HEAP8[tempDoublePtr] = HEAP8[ptr];
    1431. 

  1431. 

  1432.   HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
    1433. 

  1433. 

  1434.   HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
    1435. 

  1435. 

  1436.   HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
    1437. 

  1437. 

  1438.   HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
    1439. 

  1439. 

  1440.   HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
    1441. 

  1441. 

  1442.   HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
    1443. 

  1443. 

  1444.   HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
    1445. 

  1445. 

  1446. }
    1447. 

  1447. 

  1448. 

  1449. 

  1450. 

  1451.   Module["_rand_r"] = _rand_r;
    1452. 

  1452. 

  1453.   var ___rand_seed=allocate([0x0273459b, 0, 0, 0], "i32", ALLOC_STATIC);
    1454. 

  1454.   Module["_rand"] = _rand;
    1455. 

  1455. 

  1456. 

  1457. 

  1458.   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};
    1459. 

  1459. 

  1460.   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"};
    1461. 

  1461. 

  1462. 

  1463.   var ___errno_state=0;function ___setErrNo(value) {
    1464. 

  1464.       // For convenient setting and returning of errno.
    1465. 

  1465.       HEAP32[((___errno_state)>>2)]=value;
    1466. 

  1466.       return value;
    1467. 

  1467.     }
    1468. 

  1468. 

  1469.   var PATH={splitPath:function (filename) {
    1470. 

  1470.         var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
    1471. 

  1471.         return splitPathRe.exec(filename).slice(1);
    1472. 

  1472.       },normalizeArray:function (parts, allowAboveRoot) {
    1473. 

  1473.         // if the path tries to go above the root, `up` ends up > 0
    1474. 

  1474.         var up = 0;
    1475. 

  1475.         for (var i = parts.length - 1; i >= 0; i--) {
    1476. 

  1476.           var last = parts[i];
    1477. 

  1477.           if (last === '.') {
    1478. 

  1478.             parts.splice(i, 1);
    1479. 

  1479.           } else if (last === '..') {
    1480. 

  1480.             parts.splice(i, 1);
    1481. 

  1481.             up++;
    1482. 

  1482.           } else if (up) {
    1483. 

  1483.             parts.splice(i, 1);
    1484. 

  1484.             up--;
    1485. 

  1485.           }
    1486. 

  1486.         }
    1487. 

  1487.         // if the path is allowed to go above the root, restore leading ..s
    1488. 

  1488.         if (allowAboveRoot) {
    1489. 

  1489.           for (; up--; up) {
    1490. 

  1490.             parts.unshift('..');
    1491. 

  1491.           }
    1492. 

  1492.         }
    1493. 

  1493.         return parts;
    1494. 

  1494.       },normalize:function (path) {
    1495. 

  1495.         var isAbsolute = path.charAt(0) === '/',
    1496. 

  1496.             trailingSlash = path.substr(-1) === '/';
    1497. 

  1497.         // Normalize the path
    1498. 

  1498.         path = PATH.normalizeArray(path.split('/').filter(function(p) {
    1499. 

  1499.           return !!p;
    1500. 

  1500.         }), !isAbsolute).join('/');
    1501. 

  1501.         if (!path && !isAbsolute) {
    1502. 

  1502.           path = '.';
    1503. 

  1503.         }
    1504. 

  1504.         if (path && trailingSlash) {
    1505. 

  1505.           path += '/';
    1506. 

  1506.         }
    1507. 

  1507.         return (isAbsolute ? '/' : '') + path;
    1508. 

  1508.       },dirname:function (path) {
    1509. 

  1509.         var result = PATH.splitPath(path),
    1510. 

  1510.             root = result[0],
    1511. 

  1511.             dir = result[1];
    1512. 

  1512.         if (!root && !dir) {
    1513. 

  1513.           // No dirname whatsoever
    1514. 

  1514.           return '.';
    1515. 

  1515.         }
    1516. 

  1516.         if (dir) {
    1517. 

  1517.           // It has a dirname, strip trailing slash
    1518. 

  1518.           dir = dir.substr(0, dir.length - 1);
    1519. 

  1519.         }
    1520. 

  1520.         return root + dir;
    1521. 

  1521.       },basename:function (path) {
    1522. 

  1522.         // EMSCRIPTEN return '/'' for '/', not an empty string
    1523. 

  1523.         if (path === '/') return '/';
    1524. 

  1524.         var lastSlash = path.lastIndexOf('/');
    1525. 

  1525.         if (lastSlash === -1) return path;
    1526. 

  1526.         return path.substr(lastSlash+1);
    1527. 

  1527.       },extname:function (path) {
    1528. 

  1528.         return PATH.splitPath(path)[3];
    1529. 

  1529.       },join:function () {
    1530. 

  1530.         var paths = Array.prototype.slice.call(arguments, 0);
    1531. 

  1531.         return PATH.normalize(paths.join('/'));
    1532. 

  1532.       },join2:function (l, r) {
    1533. 

  1533.         return PATH.normalize(l + '/' + r);
    1534. 

  1534.       },resolve:function () {
    1535. 

  1535.         var resolvedPath = '',
    1536. 

  1536.           resolvedAbsolute = false;
    1537. 

  1537.         for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
    1538. 

  1538.           var path = (i >= 0) ? arguments[i] : FS.cwd();
    1539. 

  1539.           // Skip empty and invalid entries
    1540. 

  1540.           if (typeof path !== 'string') {
    1541. 

  1541.             throw new TypeError('Arguments to path.resolve must be strings');
    1542. 

  1542.           } else if (!path) {
    1543. 

  1543.             continue;
    1544. 

  1544.           }
    1545. 

  1545.           resolvedPath = path + '/' + resolvedPath;
    1546. 

  1546.           resolvedAbsolute = path.charAt(0) === '/';
    1547. 

  1547.         }
    1548. 

  1548.         // At this point the path should be resolved to a full absolute path, but
    1549. 

  1549.         // handle relative paths to be safe (might happen when process.cwd() fails)
    1550. 

  1550.         resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
    1551. 

  1551.           return !!p;
    1552. 

  1552.         }), !resolvedAbsolute).join('/');
    1553. 

  1553.         return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
    1554. 

  1554.       },relative:function (from, to) {
    1555. 

  1555.         from = PATH.resolve(from).substr(1);
    1556. 

  1556.         to = PATH.resolve(to).substr(1);
    1557. 

  1557.         function trim(arr) {
    1558. 

  1558.           var start = 0;
    1559. 

  1559.           for (; start < arr.length; start++) {
    1560. 

  1560.             if (arr[start] !== '') break;
    1561. 

  1561.           }
    1562. 

  1562.           var end = arr.length - 1;
    1563. 

  1563.           for (; end >= 0; end--) {
    1564. 

  1564.             if (arr[end] !== '') break;
    1565. 

  1565.           }
    1566. 

  1566.           if (start > end) return [];
    1567. 

  1567.           return arr.slice(start, end - start + 1);
    1568. 

  1568.         }
    1569. 

  1569.         var fromParts = trim(from.split('/'));
    1570. 

  1570.         var toParts = trim(to.split('/'));
    1571. 

  1571.         var length = Math.min(fromParts.length, toParts.length);
    1572. 

  1572.         var samePartsLength = length;
    1573. 

  1573.         for (var i = 0; i < length; i++) {
    1574. 

  1574.           if (fromParts[i] !== toParts[i]) {
    1575. 

  1575.             samePartsLength = i;
    1576. 

  1576.             break;
    1577. 

  1577.           }
    1578. 

  1578.         }
    1579. 

  1579.         var outputParts = [];
    1580. 

  1580.         for (var i = samePartsLength; i < fromParts.length; i++) {
    1581. 

  1581.           outputParts.push('..');
    1582. 

  1582.         }
    1583. 

  1583.         outputParts = outputParts.concat(toParts.slice(samePartsLength));
    1584. 

  1584.         return outputParts.join('/');
    1585. 

  1585.       }};
    1586. 

  1586. 

  1587.   var TTY={ttys:[],init:function () {
    1588. 

  1588.         // https://github.com/kripken/emscripten/pull/1555
    1589. 

  1589.         // if (ENVIRONMENT_IS_NODE) {
    1590. 

  1590.         //   // currently, FS.init does not distinguish if process.stdin is a file or TTY
    1591. 

  1591.         //   // device, it always assumes it's a TTY device. because of this, we're forcing
    1592. 

  1592.         //   // process.stdin to UTF8 encoding to at least make stdin reading compatible
    1593. 

  1593.         //   // with text files until FS.init can be refactored.
    1594. 

  1594.         //   process['stdin']['setEncoding']('utf8');
    1595. 

  1595.         // }
    1596. 

  1596.       },shutdown:function () {
    1597. 

  1597.         // https://github.com/kripken/emscripten/pull/1555
    1598. 

  1598.         // if (ENVIRONMENT_IS_NODE) {
    1599. 

  1599.         //   // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
    1600. 

  1600.         //   // 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
    1601. 

  1601.         //   // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
    1602. 

  1602.         //   // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
    1603. 

  1603.         //   // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
    1604. 

  1604.         //   process['stdin']['pause']();
    1605. 

  1605.         // }
    1606. 

  1606.       },register:function (dev, ops) {
    1607. 

  1607.         TTY.ttys[dev] = { input: [], output: [], ops: ops };
    1608. 

  1608.         FS.registerDevice(dev, TTY.stream_ops);
    1609. 

  1609.       },stream_ops:{open:function (stream) {
    1610. 

  1610.           var tty = TTY.ttys[stream.node.rdev];
    1611. 

  1611.           if (!tty) {
    1612. 

  1612.             throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
    1613. 

  1613.           }
    1614. 

  1614.           stream.tty = tty;
    1615. 

  1615.           stream.seekable = false;
    1616. 

  1616.         },close:function (stream) {
    1617. 

  1617.           // flush any pending line data
    1618. 

  1618.           if (stream.tty.output.length) {
    1619. 

  1619.             stream.tty.ops.put_char(stream.tty, 10);
    1620. 

  1620.           }
    1621. 

  1621.         },read:function (stream, buffer, offset, length, pos /* ignored */) {
    1622. 

  1622.           if (!stream.tty || !stream.tty.ops.get_char) {
    1623. 

  1623.             throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
    1624. 

  1624.           }
    1625. 

  1625.           var bytesRead = 0;
    1626. 

  1626.           for (var i = 0; i < length; i++) {
    1627. 

  1627.             var result;
    1628. 

  1628.             try {
    1629. 

  1629.               result = stream.tty.ops.get_char(stream.tty);
    1630. 

  1630.             } catch (e) {
    1631. 

  1631.               throw new FS.ErrnoError(ERRNO_CODES.EIO);
    1632. 

  1632.             }
    1633. 

  1633.             if (result === undefined && bytesRead === 0) {
    1634. 

  1634.               throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
    1635. 

  1635.             }
    1636. 

  1636.             if (result === null || result === undefined) break;
    1637. 

  1637.             bytesRead++;
    1638. 

  1638.             buffer[offset+i] = result;
    1639. 

  1639.           }
    1640. 

  1640.           if (bytesRead) {
    1641. 

  1641.             stream.node.timestamp = Date.now();
    1642. 

  1642.           }
    1643. 

  1643.           return bytesRead;
    1644. 

  1644.         },write:function (stream, buffer, offset, length, pos) {
    1645. 

  1645.           if (!stream.tty || !stream.tty.ops.put_char) {
    1646. 

  1646.             throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
    1647. 

  1647.           }
    1648. 

  1648.           for (var i = 0; i < length; i++) {
    1649. 

  1649.             try {
    1650. 

  1650.               stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
    1651. 

  1651.             } catch (e) {
    1652. 

  1652.               throw new FS.ErrnoError(ERRNO_CODES.EIO);
    1653. 

  1653.             }
    1654. 

  1654.           }
    1655. 

  1655.           if (length) {
    1656. 

  1656.             stream.node.timestamp = Date.now();
    1657. 

  1657.           }
    1658. 

  1658.           return i;
    1659. 

  1659.         }},default_tty_ops:{get_char:function (tty) {
    1660. 

  1660.           if (!tty.input.length) {
    1661. 

  1661.             var result = null;
    1662. 

  1662.             if (ENVIRONMENT_IS_NODE) {
    1663. 

  1663.               result = process['stdin']['read']();
    1664. 

  1664.               if (!result) {
    1665. 

  1665.                 if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
    1666. 

  1666.                   return null;  // EOF
    1667. 

  1667.                 }
    1668. 

  1668.                 return undefined;  // no data available
    1669. 

  1669.               }
    1670. 

  1670.             } else if (typeof window != 'undefined' &&
    1671. 

  1671.               typeof window.prompt == 'function') {
    1672. 

  1672.               // Browser.
    1673. 

  1673.               result = window.prompt('Input: ');  // returns null on cancel
    1674. 

  1674.               if (result !== null) {
    1675. 

  1675.                 result += '\n';
    1676. 

  1676.               }
    1677. 

  1677.             } else if (typeof readline == 'function') {
    1678. 

  1678.               // Command line.
    1679. 

  1679.               result = readline();
    1680. 

  1680.               if (result !== null) {
    1681. 

  1681.                 result += '\n';
    1682. 

  1682.               }
    1683. 

  1683.             }
    1684. 

  1684.             if (!result) {
    1685. 

  1685.               return null;
    1686. 

  1686.             }
    1687. 

  1687.             tty.input = intArrayFromString(result, true);
    1688. 

  1688.           }
    1689. 

  1689.           return tty.input.shift();
    1690. 

  1690.         },put_char:function (tty, val) {
    1691. 

  1691.           if (val === null || val === 10) {
    1692. 

  1692.             Module['print'](tty.output.join(''));
    1693. 

  1693.             tty.output = [];
    1694. 

  1694.           } else {
    1695. 

  1695.             tty.output.push(TTY.utf8.processCChar(val));
    1696. 

  1696.           }
    1697. 

  1697.         }},default_tty1_ops:{put_char:function (tty, val) {
    1698. 

  1698.           if (val === null || val === 10) {
    1699. 

  1699.             Module['printErr'](tty.output.join(''));
    1700. 

  1700.             tty.output = [];
    1701. 

  1701.           } else {
    1702. 

  1702.             tty.output.push(TTY.utf8.processCChar(val));
    1703. 

  1703.           }
    1704. 

  1704.         }}};
    1705. 

  1705. 

  1706.   var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
    1707. 

  1707.         return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
    1708. 

  1708.       },createNode:function (parent, name, mode, dev) {
    1709. 

  1709.         if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
    1710. 

  1710.           // no supported
    1711. 

  1711.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    1712. 

  1712.         }
    1713. 

  1713.         if (!MEMFS.ops_table) {
    1714. 

  1714.           MEMFS.ops_table = {
    1715. 

  1715.             dir: {
    1716. 

  1716.               node: {
    1717. 

  1717.                 getattr: MEMFS.node_ops.getattr,
    1718. 

  1718.                 setattr: MEMFS.node_ops.setattr,
    1719. 

  1719.                 lookup: MEMFS.node_ops.lookup,
    1720. 

  1720.                 mknod: MEMFS.node_ops.mknod,
    1721. 

  1721.                 rename: MEMFS.node_ops.rename,
    1722. 

  1722.                 unlink: MEMFS.node_ops.unlink,
    1723. 

  1723.                 rmdir: MEMFS.node_ops.rmdir,
    1724. 

  1724.                 readdir: MEMFS.node_ops.readdir,
    1725. 

  1725.                 symlink: MEMFS.node_ops.symlink
    1726. 

  1726.               },
    1727. 

  1727.               stream: {
    1728. 

  1728.                 llseek: MEMFS.stream_ops.llseek
    1729. 

  1729.               }
    1730. 

  1730.             },
    1731. 

  1731.             file: {
    1732. 

  1732.               node: {
    1733. 

  1733.                 getattr: MEMFS.node_ops.getattr,
    1734. 

  1734.                 setattr: MEMFS.node_ops.setattr
    1735. 

  1735.               },
    1736. 

  1736.               stream: {
    1737. 

  1737.                 llseek: MEMFS.stream_ops.llseek,
    1738. 

  1738.                 read: MEMFS.stream_ops.read,
    1739. 

  1739.                 write: MEMFS.stream_ops.write,
    1740. 

  1740.                 allocate: MEMFS.stream_ops.allocate,
    1741. 

  1741.                 mmap: MEMFS.stream_ops.mmap
    1742. 

  1742.               }
    1743. 

  1743.             },
    1744. 

  1744.             link: {
    1745. 

  1745.               node: {
    1746. 

  1746.                 getattr: MEMFS.node_ops.getattr,
    1747. 

  1747.                 setattr: MEMFS.node_ops.setattr,
    1748. 

  1748.                 readlink: MEMFS.node_ops.readlink
    1749. 

  1749.               },
    1750. 

  1750.               stream: {}
    1751. 

  1751.             },
    1752. 

  1752.             chrdev: {
    1753. 

  1753.               node: {
    1754. 

  1754.                 getattr: MEMFS.node_ops.getattr,
    1755. 

  1755.                 setattr: MEMFS.node_ops.setattr
    1756. 

  1756.               },
    1757. 

  1757.               stream: FS.chrdev_stream_ops
    1758. 

  1758.             },
    1759. 

  1759.           };
    1760. 

  1760.         }
    1761. 

  1761.         var node = FS.createNode(parent, name, mode, dev);
    1762. 

  1762.         if (FS.isDir(node.mode)) {
    1763. 

  1763.           node.node_ops = MEMFS.ops_table.dir.node;
    1764. 

  1764.           node.stream_ops = MEMFS.ops_table.dir.stream;
    1765. 

  1765.           node.contents = {};
    1766. 

  1766.         } else if (FS.isFile(node.mode)) {
    1767. 

  1767.           node.node_ops = MEMFS.ops_table.file.node;
    1768. 

  1768.           node.stream_ops = MEMFS.ops_table.file.stream;
    1769. 

  1769.           node.contents = [];
    1770. 

  1770.           node.contentMode = MEMFS.CONTENT_FLEXIBLE;
    1771. 

  1771.         } else if (FS.isLink(node.mode)) {
    1772. 

  1772.           node.node_ops = MEMFS.ops_table.link.node;
    1773. 

  1773.           node.stream_ops = MEMFS.ops_table.link.stream;
    1774. 

  1774.         } else if (FS.isChrdev(node.mode)) {
    1775. 

  1775.           node.node_ops = MEMFS.ops_table.chrdev.node;
    1776. 

  1776.           node.stream_ops = MEMFS.ops_table.chrdev.stream;
    1777. 

  1777.         }
    1778. 

  1778.         node.timestamp = Date.now();
    1779. 

  1779.         // add the new node to the parent
    1780. 

  1780.         if (parent) {
    1781. 

  1781.           parent.contents[name] = node;
    1782. 

  1782.         }
    1783. 

  1783.         return node;
    1784. 

  1784.       },ensureFlexible:function (node) {
    1785. 

  1785.         if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
    1786. 

  1786.           var contents = node.contents;
    1787. 

  1787.           node.contents = Array.prototype.slice.call(contents);
    1788. 

  1788.           node.contentMode = MEMFS.CONTENT_FLEXIBLE;
    1789. 

  1789.         }
    1790. 

  1790.       },node_ops:{getattr:function (node) {
    1791. 

  1791.           var attr = {};
    1792. 

  1792.           // device numbers reuse inode numbers.
    1793. 

  1793.           attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
    1794. 

  1794.           attr.ino = node.id;
    1795. 

  1795.           attr.mode = node.mode;
    1796. 

  1796.           attr.nlink = 1;
    1797. 

  1797.           attr.uid = 0;
    1798. 

  1798.           attr.gid = 0;
    1799. 

  1799.           attr.rdev = node.rdev;
    1800. 

  1800.           if (FS.isDir(node.mode)) {
    1801. 

  1801.             attr.size = 4096;
    1802. 

  1802.           } else if (FS.isFile(node.mode)) {
    1803. 

  1803.             attr.size = node.contents.length;
    1804. 

  1804.           } else if (FS.isLink(node.mode)) {
    1805. 

  1805.             attr.size = node.link.length;
    1806. 

  1806.           } else {
    1807. 

  1807.             attr.size = 0;
    1808. 

  1808.           }
    1809. 

  1809.           attr.atime = new Date(node.timestamp);
    1810. 

  1810.           attr.mtime = new Date(node.timestamp);
    1811. 

  1811.           attr.ctime = new Date(node.timestamp);
    1812. 

  1812.           // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
    1813. 

  1813.           //       but this is not required by the standard.
    1814. 

  1814.           attr.blksize = 4096;
    1815. 

  1815.           attr.blocks = Math.ceil(attr.size / attr.blksize);
    1816. 

  1816.           return attr;
    1817. 

  1817.         },setattr:function (node, attr) {
    1818. 

  1818.           if (attr.mode !== undefined) {
    1819. 

  1819.             node.mode = attr.mode;
    1820. 

  1820.           }
    1821. 

  1821.           if (attr.timestamp !== undefined) {
    1822. 

  1822.             node.timestamp = attr.timestamp;
    1823. 

  1823.           }
    1824. 

  1824.           if (attr.size !== undefined) {
    1825. 

  1825.             MEMFS.ensureFlexible(node);
    1826. 

  1826.             var contents = node.contents;
    1827. 

  1827.             if (attr.size < contents.length) contents.length = attr.size;
    1828. 

  1828.             else while (attr.size > contents.length) contents.push(0);
    1829. 

  1829.           }
    1830. 

  1830.         },lookup:function (parent, name) {
    1831. 

  1831.           throw FS.genericErrors[ERRNO_CODES.ENOENT];
    1832. 

  1832.         },mknod:function (parent, name, mode, dev) {
    1833. 

  1833.           return MEMFS.createNode(parent, name, mode, dev);
    1834. 

  1834.         },rename:function (old_node, new_dir, new_name) {
    1835. 

  1835.           // if we're overwriting a directory at new_name, make sure it's empty.
    1836. 

  1836.           if (FS.isDir(old_node.mode)) {
    1837. 

  1837.             var new_node;
    1838. 

  1838.             try {
    1839. 

  1839.               new_node = FS.lookupNode(new_dir, new_name);
    1840. 

  1840.             } catch (e) {
    1841. 

  1841.             }
    1842. 

  1842.             if (new_node) {
    1843. 

  1843.               for (var i in new_node.contents) {
    1844. 

  1844.                 throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
    1845. 

  1845.               }
    1846. 

  1846.             }
    1847. 

  1847.           }
    1848. 

  1848.           // do the internal rewiring
    1849. 

  1849.           delete old_node.parent.contents[old_node.name];
    1850. 

  1850.           old_node.name = new_name;
    1851. 

  1851.           new_dir.contents[new_name] = old_node;
    1852. 

  1852.           old_node.parent = new_dir;
    1853. 

  1853.         },unlink:function (parent, name) {
    1854. 

  1854.           delete parent.contents[name];
    1855. 

  1855.         },rmdir:function (parent, name) {
    1856. 

  1856.           var node = FS.lookupNode(parent, name);
    1857. 

  1857.           for (var i in node.contents) {
    1858. 

  1858.             throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
    1859. 

  1859.           }
    1860. 

  1860.           delete parent.contents[name];
    1861. 

  1861.         },readdir:function (node) {
    1862. 

  1862.           var entries = ['.', '..']
    1863. 

  1863.           for (var key in node.contents) {
    1864. 

  1864.             if (!node.contents.hasOwnProperty(key)) {
    1865. 

  1865.               continue;
    1866. 

  1866.             }
    1867. 

  1867.             entries.push(key);
    1868. 

  1868.           }
    1869. 

  1869.           return entries;
    1870. 

  1870.         },symlink:function (parent, newname, oldpath) {
    1871. 

  1871.           var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
    1872. 

  1872.           node.link = oldpath;
    1873. 

  1873.           return node;
    1874. 

  1874.         },readlink:function (node) {
    1875. 

  1875.           if (!FS.isLink(node.mode)) {
    1876. 

  1876.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    1877. 

  1877.           }
    1878. 

  1878.           return node.link;
    1879. 

  1879.         }},stream_ops:{read:function (stream, buffer, offset, length, position) {
    1880. 

  1880.           var contents = stream.node.contents;
    1881. 

  1881.           if (position >= contents.length)
    1882. 

  1882.             return 0;
    1883. 

  1883.           var size = Math.min(contents.length - position, length);
    1884. 

  1884.           assert(size >= 0);
    1885. 

  1885.           if (size > 8 && contents.subarray) { // non-trivial, and typed array
    1886. 

  1886.             buffer.set(contents.subarray(position, position + size), offset);
    1887. 

  1887.           } else
    1888. 

  1888.           {
    1889. 

  1889.             for (var i = 0; i < size; i++) {
    1890. 

  1890.               buffer[offset + i] = contents[position + i];
    1891. 

  1891.             }
    1892. 

  1892.           }
    1893. 

  1893.           return size;
    1894. 

  1894.         },write:function (stream, buffer, offset, length, position, canOwn) {
    1895. 

  1895.           var node = stream.node;
    1896. 

  1896.           node.timestamp = Date.now();
    1897. 

  1897.           var contents = node.contents;
    1898. 

  1898.           if (length && contents.length === 0 && position === 0 && buffer.subarray) {
    1899. 

  1899.             // just replace it with the new data
    1900. 

  1900.             if (canOwn && offset === 0) {
    1901. 

  1901.               node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
    1902. 

  1902.               node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
    1903. 

  1903.             } else {
    1904. 

  1904.               node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
    1905. 

  1905.               node.contentMode = MEMFS.CONTENT_FIXED;
    1906. 

  1906.             }
    1907. 

  1907.             return length;
    1908. 

  1908.           }
    1909. 

  1909.           MEMFS.ensureFlexible(node);
    1910. 

  1910.           var contents = node.contents;
    1911. 

  1911.           while (contents.length < position) contents.push(0);
    1912. 

  1912.           for (var i = 0; i < length; i++) {
    1913. 

  1913.             contents[position + i] = buffer[offset + i];
    1914. 

  1914.           }
    1915. 

  1915.           return length;
    1916. 

  1916.         },llseek:function (stream, offset, whence) {
    1917. 

  1917.           var position = offset;
    1918. 

  1918.           if (whence === 1) {  // SEEK_CUR.
    1919. 

  1919.             position += stream.position;
    1920. 

  1920.           } else if (whence === 2) {  // SEEK_END.
    1921. 

  1921.             if (FS.isFile(stream.node.mode)) {
    1922. 

  1922.               position += stream.node.contents.length;
    1923. 

  1923.             }
    1924. 

  1924.           }
    1925. 

  1925.           if (position < 0) {
    1926. 

  1926.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    1927. 

  1927.           }
    1928. 

  1928.           stream.ungotten = [];
    1929. 

  1929.           stream.position = position;
    1930. 

  1930.           return position;
    1931. 

  1931.         },allocate:function (stream, offset, length) {
    1932. 

  1932.           MEMFS.ensureFlexible(stream.node);
    1933. 

  1933.           var contents = stream.node.contents;
    1934. 

  1934.           var limit = offset + length;
    1935. 

  1935.           while (limit > contents.length) contents.push(0);
    1936. 

  1936.         },mmap:function (stream, buffer, offset, length, position, prot, flags) {
    1937. 

  1937.           if (!FS.isFile(stream.node.mode)) {
    1938. 

  1938.             throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
    1939. 

  1939.           }
    1940. 

  1940.           var ptr;
    1941. 

  1941.           var allocated;
    1942. 

  1942.           var contents = stream.node.contents;
    1943. 

  1943.           // Only make a new copy when MAP_PRIVATE is specified.
    1944. 

  1944.           if ( !(flags & 2) &&
    1945. 

  1945.                 (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
    1946. 

  1946.             // We can't emulate MAP_SHARED when the file is not backed by the buffer
    1947. 

  1947.             // we're mapping to (e.g. the HEAP buffer).
    1948. 

  1948.             allocated = false;
    1949. 

  1949.             ptr = contents.byteOffset;
    1950. 

  1950.           } else {
    1951. 

  1951.             // Try to avoid unnecessary slices.
    1952. 

  1952.             if (position > 0 || position + length < contents.length) {
    1953. 

  1953.               if (contents.subarray) {
    1954. 

  1954.                 contents = contents.subarray(position, position + length);
    1955. 

  1955.               } else {
    1956. 

  1956.                 contents = Array.prototype.slice.call(contents, position, position + length);
    1957. 

  1957.               }
    1958. 

  1958.             }
    1959. 

  1959.             allocated = true;
    1960. 

  1960.             ptr = _malloc(length);
    1961. 

  1961.             if (!ptr) {
    1962. 

  1962.               throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
    1963. 

  1963.             }
    1964. 

  1964.             buffer.set(contents, ptr);
    1965. 

  1965.           }
    1966. 

  1966.           return { ptr: ptr, allocated: allocated };
    1967. 

  1967.         }}};
    1968. 

  1968. 

  1969.   var IDBFS={dbs:{},indexedDB:function () {
    1970. 

  1970.         return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
    1971. 

  1971.       },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
    1972. 

  1972.         // reuse all of the core MEMFS functionality
    1973. 

  1973.         return MEMFS.mount.apply(null, arguments);
    1974. 

  1974.       },syncfs:function (mount, populate, callback) {
    1975. 

  1975.         IDBFS.getLocalSet(mount, function(err, local) {
    1976. 

  1976.           if (err) return callback(err);
    1977. 

  1977. 

  1978.           IDBFS.getRemoteSet(mount, function(err, remote) {
    1979. 

  1979.             if (err) return callback(err);
    1980. 

  1980. 

  1981.             var src = populate ? remote : local;
    1982. 

  1982.             var dst = populate ? local : remote;
    1983. 

  1983. 

  1984.             IDBFS.reconcile(src, dst, callback);
    1985. 

  1985.           });
    1986. 

  1986.         });
    1987. 

  1987.       },getDB:function (name, callback) {
    1988. 

  1988.         // check the cache first
    1989. 

  1989.         var db = IDBFS.dbs[name];
    1990. 

  1990.         if (db) {
    1991. 

  1991.           return callback(null, db);
    1992. 

  1992.         }
    1993. 

  1993. 

  1994.         var req;
    1995. 

  1995.         try {
    1996. 

  1996.           req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
    1997. 

  1997.         } catch (e) {
    1998. 

  1998.           return callback(e);
    1999. 

  1999.         }
    2000. 

  2000.         req.onupgradeneeded = function(e) {
    2001. 

  2001.           var db = e.target.result;
    2002. 

  2002.           var transaction = e.target.transaction;
    2003. 

  2003. 

  2004.           var fileStore;
    2005. 

  2005. 

  2006.           if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
    2007. 

  2007.             fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
    2008. 

  2008.           } else {
    2009. 

  2009.             fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
    2010. 

  2010.           }
    2011. 

  2011. 

  2012.           fileStore.createIndex('timestamp', 'timestamp', { unique: false });
    2013. 

  2013.         };
    2014. 

  2014.         req.onsuccess = function() {
    2015. 

  2015.           db = req.result;
    2016. 

  2016. 

  2017.           // add to the cache
    2018. 

  2018.           IDBFS.dbs[name] = db;
    2019. 

  2019.           callback(null, db);
    2020. 

  2020.         };
    2021. 

  2021.         req.onerror = function() {
    2022. 

  2022.           callback(this.error);
    2023. 

  2023.         };
    2024. 

  2024.       },getLocalSet:function (mount, callback) {
    2025. 

  2025.         var entries = {};
    2026. 

  2026. 

  2027.         function isRealDir(p) {
    2028. 

  2028.           return p !== '.' && p !== '..';
    2029. 

  2029.         };
    2030. 

  2030.         function toAbsolute(root) {
    2031. 

  2031.           return function(p) {
    2032. 

  2032.             return PATH.join2(root, p);
    2033. 

  2033.           }
    2034. 

  2034.         };
    2035. 

  2035. 

  2036.         var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
    2037. 

  2037. 

  2038.         while (check.length) {
    2039. 

  2039.           var path = check.pop();
    2040. 

  2040.           var stat;
    2041. 

  2041. 

  2042.           try {
    2043. 

  2043.             stat = FS.stat(path);
    2044. 

  2044.           } catch (e) {
    2045. 

  2045.             return callback(e);
    2046. 

  2046.           }
    2047. 

  2047. 

  2048.           if (FS.isDir(stat.mode)) {
    2049. 

  2049.             check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
    2050. 

  2050.           }
    2051. 

  2051. 

  2052.           entries[path] = { timestamp: stat.mtime };
    2053. 

  2053.         }
    2054. 

  2054. 

  2055.         return callback(null, { type: 'local', entries: entries });
    2056. 

  2056.       },getRemoteSet:function (mount, callback) {
    2057. 

  2057.         var entries = {};
    2058. 

  2058. 

  2059.         IDBFS.getDB(mount.mountpoint, function(err, db) {
    2060. 

  2060.           if (err) return callback(err);
    2061. 

  2061. 

  2062.           var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
    2063. 

  2063.           transaction.onerror = function() { callback(this.error); };
    2064. 

  2064. 

  2065.           var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
    2066. 

  2066.           var index = store.index('timestamp');
    2067. 

  2067. 

  2068.           index.openKeyCursor().onsuccess = function(event) {
    2069. 

  2069.             var cursor = event.target.result;
    2070. 

  2070. 

  2071.             if (!cursor) {
    2072. 

  2072.               return callback(null, { type: 'remote', db: db, entries: entries });
    2073. 

  2073.             }
    2074. 

  2074. 

  2075.             entries[cursor.primaryKey] = { timestamp: cursor.key };
    2076. 

  2076. 

  2077.             cursor.continue();
    2078. 

  2078.           };
    2079. 

  2079.         });
    2080. 

  2080.       },loadLocalEntry:function (path, callback) {
    2081. 

  2081.         var stat, node;
    2082. 

  2082. 

  2083.         try {
    2084. 

  2084.           var lookup = FS.lookupPath(path);
    2085. 

  2085.           node = lookup.node;
    2086. 

  2086.           stat = FS.stat(path);
    2087. 

  2087.         } catch (e) {
    2088. 

  2088.           return callback(e);
    2089. 

  2089.         }
    2090. 

  2090. 

  2091.         if (FS.isDir(stat.mode)) {
    2092. 

  2092.           return callback(null, { timestamp: stat.mtime, mode: stat.mode });
    2093. 

  2093.         } else if (FS.isFile(stat.mode)) {
    2094. 

  2094.           return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
    2095. 

  2095.         } else {
    2096. 

  2096.           return callback(new Error('node type not supported'));
    2097. 

  2097.         }
    2098. 

  2098.       },storeLocalEntry:function (path, entry, callback) {
    2099. 

  2099.         try {
    2100. 

  2100.           if (FS.isDir(entry.mode)) {
    2101. 

  2101.             FS.mkdir(path, entry.mode);
    2102. 

  2102.           } else if (FS.isFile(entry.mode)) {
    2103. 

  2103.             FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
    2104. 

  2104.           } else {
    2105. 

  2105.             return callback(new Error('node type not supported'));
    2106. 

  2106.           }
    2107. 

  2107. 

  2108.           FS.utime(path, entry.timestamp, entry.timestamp);
    2109. 

  2109.         } catch (e) {
    2110. 

  2110.           return callback(e);
    2111. 

  2111.         }
    2112. 

  2112. 

  2113.         callback(null);
    2114. 

  2114.       },removeLocalEntry:function (path, callback) {
    2115. 

  2115.         try {
    2116. 

  2116.           var lookup = FS.lookupPath(path);
    2117. 

  2117.           var stat = FS.stat(path);
    2118. 

  2118. 

  2119.           if (FS.isDir(stat.mode)) {
    2120. 

  2120.             FS.rmdir(path);
    2121. 

  2121.           } else if (FS.isFile(stat.mode)) {
    2122. 

  2122.             FS.unlink(path);
    2123. 

  2123.           }
    2124. 

  2124.         } catch (e) {
    2125. 

  2125.           return callback(e);
    2126. 

  2126.         }
    2127. 

  2127. 

  2128.         callback(null);
    2129. 

  2129.       },loadRemoteEntry:function (store, path, callback) {
    2130. 

  2130.         var req = store.get(path);
    2131. 

  2131.         req.onsuccess = function(event) { callback(null, event.target.result); };
    2132. 

  2132.         req.onerror = function() { callback(this.error); };
    2133. 

  2133.       },storeRemoteEntry:function (store, path, entry, callback) {
    2134. 

  2134.         var req = store.put(entry, path);
    2135. 

  2135.         req.onsuccess = function() { callback(null); };
    2136. 

  2136.         req.onerror = function() { callback(this.error); };
    2137. 

  2137.       },removeRemoteEntry:function (store, path, callback) {
    2138. 

  2138.         var req = store.delete(path);
    2139. 

  2139.         req.onsuccess = function() { callback(null); };
    2140. 

  2140.         req.onerror = function() { callback(this.error); };
    2141. 

  2141.       },reconcile:function (src, dst, callback) {
    2142. 

  2142.         var total = 0;
    2143. 

  2143. 

  2144.         var create = [];
    2145. 

  2145.         Object.keys(src.entries).forEach(function (key) {
    2146. 

  2146.           var e = src.entries[key];
    2147. 

  2147.           var e2 = dst.entries[key];
    2148. 

  2148.           if (!e2 || e.timestamp > e2.timestamp) {
    2149. 

  2149.             create.push(key);
    2150. 

  2150.             total++;
    2151. 

  2151.           }
    2152. 

  2152.         });
    2153. 

  2153. 

  2154.         var remove = [];
    2155. 

  2155.         Object.keys(dst.entries).forEach(function (key) {
    2156. 

  2156.           var e = dst.entries[key];
    2157. 

  2157.           var e2 = src.entries[key];
    2158. 

  2158.           if (!e2) {
    2159. 

  2159.             remove.push(key);
    2160. 

  2160.             total++;
    2161. 

  2161.           }
    2162. 

  2162.         });
    2163. 

  2163. 

  2164.         if (!total) {
    2165. 

  2165.           return callback(null);
    2166. 

  2166.         }
    2167. 

  2167. 

  2168.         var errored = false;
    2169. 

  2169.         var completed = 0;
    2170. 

  2170.         var db = src.type === 'remote' ? src.db : dst.db;
    2171. 

  2171.         var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
    2172. 

  2172.         var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
    2173. 

  2173. 

  2174.         function done(err) {
    2175. 

  2175.           if (err) {
    2176. 

  2176.             if (!done.errored) {
    2177. 

  2177.               done.errored = true;
    2178. 

  2178.               return callback(err);
    2179. 

  2179.             }
    2180. 

  2180.             return;
    2181. 

  2181.           }
    2182. 

  2182.           if (++completed >= total) {
    2183. 

  2183.             return callback(null);
    2184. 

  2184.           }
    2185. 

  2185.         };
    2186. 

  2186. 

  2187.         transaction.onerror = function() { done(this.error); };
    2188. 

  2188. 

  2189.         // sort paths in ascending order so directory entries are created
    2190. 

  2190.         // before the files inside them
    2191. 

  2191.         create.sort().forEach(function (path) {
    2192. 

  2192.           if (dst.type === 'local') {
    2193. 

  2193.             IDBFS.loadRemoteEntry(store, path, function (err, entry) {
    2194. 

  2194.               if (err) return done(err);
    2195. 

  2195.               IDBFS.storeLocalEntry(path, entry, done);
    2196. 

  2196.             });
    2197. 

  2197.           } else {
    2198. 

  2198.             IDBFS.loadLocalEntry(path, function (err, entry) {
    2199. 

  2199.               if (err) return done(err);
    2200. 

  2200.               IDBFS.storeRemoteEntry(store, path, entry, done);
    2201. 

  2201.             });
    2202. 

  2202.           }
    2203. 

  2203.         });
    2204. 

  2204. 

  2205.         // sort paths in descending order so files are deleted before their
    2206. 

  2206.         // parent directories
    2207. 

  2207.         remove.sort().reverse().forEach(function(path) {
    2208. 

  2208.           if (dst.type === 'local') {
    2209. 

  2209.             IDBFS.removeLocalEntry(path, done);
    2210. 

  2210.           } else {
    2211. 

  2211.             IDBFS.removeRemoteEntry(store, path, done);
    2212. 

  2212.           }
    2213. 

  2213.         });
    2214. 

  2214.       }};
    2215. 

  2215. 

  2216.   var NODEFS={isWindows:false,staticInit:function () {
    2217. 

  2217.         NODEFS.isWindows = !!process.platform.match(/^win/);
    2218. 

  2218.       },mount:function (mount) {
    2219. 

  2219.         assert(ENVIRONMENT_IS_NODE);
    2220. 

  2220.         return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
    2221. 

  2221.       },createNode:function (parent, name, mode, dev) {
    2222. 

  2222.         if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
    2223. 

  2223.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    2224. 

  2224.         }
    2225. 

  2225.         var node = FS.createNode(parent, name, mode);
    2226. 

  2226.         node.node_ops = NODEFS.node_ops;
    2227. 

  2227.         node.stream_ops = NODEFS.stream_ops;
    2228. 

  2228.         return node;
    2229. 

  2229.       },getMode:function (path) {
    2230. 

  2230.         var stat;
    2231. 

  2231.         try {
    2232. 

  2232.           stat = fs.lstatSync(path);
    2233. 

  2233.           if (NODEFS.isWindows) {
    2234. 

  2234.             // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
    2235. 

  2235.             // propagate write bits to execute bits.
    2236. 

  2236.             stat.mode = stat.mode | ((stat.mode & 146) >> 1);
    2237. 

  2237.           }
    2238. 

  2238.         } catch (e) {
    2239. 

  2239.           if (!e.code) throw e;
    2240. 

  2240.           throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2241. 

  2241.         }
    2242. 

  2242.         return stat.mode;
    2243. 

  2243.       },realPath:function (node) {
    2244. 

  2244.         var parts = [];
    2245. 

  2245.         while (node.parent !== node) {
    2246. 

  2246.           parts.push(node.name);
    2247. 

  2247.           node = node.parent;
    2248. 

  2248.         }
    2249. 

  2249.         parts.push(node.mount.opts.root);
    2250. 

  2250.         parts.reverse();
    2251. 

  2251.         return PATH.join.apply(null, parts);
    2252. 

  2252.       },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) {
    2253. 

  2253.         if (flags in NODEFS.flagsToPermissionStringMap) {
    2254. 

  2254.           return NODEFS.flagsToPermissionStringMap[flags];
    2255. 

  2255.         } else {
    2256. 

  2256.           return flags;
    2257. 

  2257.         }
    2258. 

  2258.       },node_ops:{getattr:function (node) {
    2259. 

  2259.           var path = NODEFS.realPath(node);
    2260. 

  2260.           var stat;
    2261. 

  2261.           try {
    2262. 

  2262.             stat = fs.lstatSync(path);
    2263. 

  2263.           } catch (e) {
    2264. 

  2264.             if (!e.code) throw e;
    2265. 

  2265.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2266. 

  2266.           }
    2267. 

  2267.           // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
    2268. 

  2268.           // See http://support.microsoft.com/kb/140365
    2269. 

  2269.           if (NODEFS.isWindows && !stat.blksize) {
    2270. 

  2270.             stat.blksize = 4096;
    2271. 

  2271.           }
    2272. 

  2272.           if (NODEFS.isWindows && !stat.blocks) {
    2273. 

  2273.             stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
    2274. 

  2274.           }
    2275. 

  2275.           return {
    2276. 

  2276.             dev: stat.dev,
    2277. 

  2277.             ino: stat.ino,
    2278. 

  2278.             mode: stat.mode,
    2279. 

  2279.             nlink: stat.nlink,
    2280. 

  2280.             uid: stat.uid,
    2281. 

  2281.             gid: stat.gid,
    2282. 

  2282.             rdev: stat.rdev,
    2283. 

  2283.             size: stat.size,
    2284. 

  2284.             atime: stat.atime,
    2285. 

  2285.             mtime: stat.mtime,
    2286. 

  2286.             ctime: stat.ctime,
    2287. 

  2287.             blksize: stat.blksize,
    2288. 

  2288.             blocks: stat.blocks
    2289. 

  2289.           };
    2290. 

  2290.         },setattr:function (node, attr) {
    2291. 

  2291.           var path = NODEFS.realPath(node);
    2292. 

  2292.           try {
    2293. 

  2293.             if (attr.mode !== undefined) {
    2294. 

  2294.               fs.chmodSync(path, attr.mode);
    2295. 

  2295.               // update the common node structure mode as well
    2296. 

  2296.               node.mode = attr.mode;
    2297. 

  2297.             }
    2298. 

  2298.             if (attr.timestamp !== undefined) {
    2299. 

  2299.               var date = new Date(attr.timestamp);
    2300. 

  2300.               fs.utimesSync(path, date, date);
    2301. 

  2301.             }
    2302. 

  2302.             if (attr.size !== undefined) {
    2303. 

  2303.               fs.truncateSync(path, attr.size);
    2304. 

  2304.             }
    2305. 

  2305.           } catch (e) {
    2306. 

  2306.             if (!e.code) throw e;
    2307. 

  2307.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2308. 

  2308.           }
    2309. 

  2309.         },lookup:function (parent, name) {
    2310. 

  2310.           var path = PATH.join2(NODEFS.realPath(parent), name);
    2311. 

  2311.           var mode = NODEFS.getMode(path);
    2312. 

  2312.           return NODEFS.createNode(parent, name, mode);
    2313. 

  2313.         },mknod:function (parent, name, mode, dev) {
    2314. 

  2314.           var node = NODEFS.createNode(parent, name, mode, dev);
    2315. 

  2315.           // create the backing node for this in the fs root as well
    2316. 

  2316.           var path = NODEFS.realPath(node);
    2317. 

  2317.           try {
    2318. 

  2318.             if (FS.isDir(node.mode)) {
    2319. 

  2319.               fs.mkdirSync(path, node.mode);
    2320. 

  2320.             } else {
    2321. 

  2321.               fs.writeFileSync(path, '', { mode: node.mode });
    2322. 

  2322.             }
    2323. 

  2323.           } catch (e) {
    2324. 

  2324.             if (!e.code) throw e;
    2325. 

  2325.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2326. 

  2326.           }
    2327. 

  2327.           return node;
    2328. 

  2328.         },rename:function (oldNode, newDir, newName) {
    2329. 

  2329.           var oldPath = NODEFS.realPath(oldNode);
    2330. 

  2330.           var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
    2331. 

  2331.           try {
    2332. 

  2332.             fs.renameSync(oldPath, newPath);
    2333. 

  2333.           } catch (e) {
    2334. 

  2334.             if (!e.code) throw e;
    2335. 

  2335.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2336. 

  2336.           }
    2337. 

  2337.         },unlink:function (parent, name) {
    2338. 

  2338.           var path = PATH.join2(NODEFS.realPath(parent), name);
    2339. 

  2339.           try {
    2340. 

  2340.             fs.unlinkSync(path);
    2341. 

  2341.           } catch (e) {
    2342. 

  2342.             if (!e.code) throw e;
    2343. 

  2343.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2344. 

  2344.           }
    2345. 

  2345.         },rmdir:function (parent, name) {
    2346. 

  2346.           var path = PATH.join2(NODEFS.realPath(parent), name);
    2347. 

  2347.           try {
    2348. 

  2348.             fs.rmdirSync(path);
    2349. 

  2349.           } catch (e) {
    2350. 

  2350.             if (!e.code) throw e;
    2351. 

  2351.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2352. 

  2352.           }
    2353. 

  2353.         },readdir:function (node) {
    2354. 

  2354.           var path = NODEFS.realPath(node);
    2355. 

  2355.           try {
    2356. 

  2356.             return fs.readdirSync(path);
    2357. 

  2357.           } catch (e) {
    2358. 

  2358.             if (!e.code) throw e;
    2359. 

  2359.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2360. 

  2360.           }
    2361. 

  2361.         },symlink:function (parent, newName, oldPath) {
    2362. 

  2362.           var newPath = PATH.join2(NODEFS.realPath(parent), newName);
    2363. 

  2363.           try {
    2364. 

  2364.             fs.symlinkSync(oldPath, newPath);
    2365. 

  2365.           } catch (e) {
    2366. 

  2366.             if (!e.code) throw e;
    2367. 

  2367.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2368. 

  2368.           }
    2369. 

  2369.         },readlink:function (node) {
    2370. 

  2370.           var path = NODEFS.realPath(node);
    2371. 

  2371.           try {
    2372. 

  2372.             return fs.readlinkSync(path);
    2373. 

  2373.           } catch (e) {
    2374. 

  2374.             if (!e.code) throw e;
    2375. 

  2375.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2376. 

  2376.           }
    2377. 

  2377.         }},stream_ops:{open:function (stream) {
    2378. 

  2378.           var path = NODEFS.realPath(stream.node);
    2379. 

  2379.           try {
    2380. 

  2380.             if (FS.isFile(stream.node.mode)) {
    2381. 

  2381.               stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
    2382. 

  2382.             }
    2383. 

  2383.           } catch (e) {
    2384. 

  2384.             if (!e.code) throw e;
    2385. 

  2385.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2386. 

  2386.           }
    2387. 

  2387.         },close:function (stream) {
    2388. 

  2388.           try {
    2389. 

  2389.             if (FS.isFile(stream.node.mode) && stream.nfd) {
    2390. 

  2390.               fs.closeSync(stream.nfd);
    2391. 

  2391.             }
    2392. 

  2392.           } catch (e) {
    2393. 

  2393.             if (!e.code) throw e;
    2394. 

  2394.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2395. 

  2395.           }
    2396. 

  2396.         },read:function (stream, buffer, offset, length, position) {
    2397. 

  2397.           // FIXME this is terrible.
    2398. 

  2398.           var nbuffer = new Buffer(length);
    2399. 

  2399.           var res;
    2400. 

  2400.           try {
    2401. 

  2401.             res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
    2402. 

  2402.           } catch (e) {
    2403. 

  2403.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2404. 

  2404.           }
    2405. 

  2405.           if (res > 0) {
    2406. 

  2406.             for (var i = 0; i < res; i++) {
    2407. 

  2407.               buffer[offset + i] = nbuffer[i];
    2408. 

  2408.             }
    2409. 

  2409.           }
    2410. 

  2410.           return res;
    2411. 

  2411.         },write:function (stream, buffer, offset, length, position) {
    2412. 

  2412.           // FIXME this is terrible.
    2413. 

  2413.           var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
    2414. 

  2414.           var res;
    2415. 

  2415.           try {
    2416. 

  2416.             res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
    2417. 

  2417.           } catch (e) {
    2418. 

  2418.             throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2419. 

  2419.           }
    2420. 

  2420.           return res;
    2421. 

  2421.         },llseek:function (stream, offset, whence) {
    2422. 

  2422.           var position = offset;
    2423. 

  2423.           if (whence === 1) {  // SEEK_CUR.
    2424. 

  2424.             position += stream.position;
    2425. 

  2425.           } else if (whence === 2) {  // SEEK_END.
    2426. 

  2426.             if (FS.isFile(stream.node.mode)) {
    2427. 

  2427.               try {
    2428. 

  2428.                 var stat = fs.fstatSync(stream.nfd);
    2429. 

  2429.                 position += stat.size;
    2430. 

  2430.               } catch (e) {
    2431. 

  2431.                 throw new FS.ErrnoError(ERRNO_CODES[e.code]);
    2432. 

  2432.               }
    2433. 

  2433.             }
    2434. 

  2434.           }
    2435. 

  2435. 

  2436.           if (position < 0) {
    2437. 

  2437.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    2438. 

  2438.           }
    2439. 

  2439. 

  2440.           stream.position = position;
    2441. 

  2441.           return position;
    2442. 

  2442.         }}};
    2443. 

  2443. 

  2444.   var _stdin=allocate(1, "i32*", ALLOC_STATIC);
    2445. 

  2445. 

  2446.   var _stdout=allocate(1, "i32*", ALLOC_STATIC);
    2447. 

  2447. 

  2448.   var _stderr=allocate(1, "i32*", ALLOC_STATIC);
    2449. 

  2449. 

  2450.   function _fflush(stream) {
    2451. 

  2451.       // int fflush(FILE *stream);
    2452. 

  2452.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
    2453. 

  2453.       // we don't currently perform any user-space buffering of data
    2454. 

  2454.     }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
    2455. 

  2455.         if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
    2456. 

  2456.         return ___setErrNo(e.errno);
    2457. 

  2457.       },lookupPath:function (path, opts) {
    2458. 

  2458.         path = PATH.resolve(FS.cwd(), path);
    2459. 

  2459.         opts = opts || {};
    2460. 

  2460. 

  2461.         var defaults = {
    2462. 

  2462.           follow_mount: true,
    2463. 

  2463.           recurse_count: 0
    2464. 

  2464.         };
    2465. 

  2465.         for (var key in defaults) {
    2466. 

  2466.           if (opts[key] === undefined) {
    2467. 

  2467.             opts[key] = defaults[key];
    2468. 

  2468.           }
    2469. 

  2469.         }
    2470. 

  2470. 

  2471.         if (opts.recurse_count > 8) {  // max recursive lookup of 8
    2472. 

  2472.           throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
    2473. 

  2473.         }
    2474. 

  2474. 

  2475.         // split the path
    2476. 

  2476.         var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
    2477. 

  2477.           return !!p;
    2478. 

  2478.         }), false);
    2479. 

  2479. 

  2480.         // start at the root
    2481. 

  2481.         var current = FS.root;
    2482. 

  2482.         var current_path = '/';
    2483. 

  2483. 

  2484.         for (var i = 0; i < parts.length; i++) {
    2485. 

  2485.           var islast = (i === parts.length-1);
    2486. 

  2486.           if (islast && opts.parent) {
    2487. 

  2487.             // stop resolving
    2488. 

  2488.             break;
    2489. 

  2489.           }
    2490. 

  2490. 

  2491.           current = FS.lookupNode(current, parts[i]);
    2492. 

  2492.           current_path = PATH.join2(current_path, parts[i]);
    2493. 

  2493. 

  2494.           // jump to the mount's root node if this is a mountpoint
    2495. 

  2495.           if (FS.isMountpoint(current)) {
    2496. 

  2496.             if (!islast || (islast && opts.follow_mount)) {
    2497. 

  2497.               current = current.mounted.root;
    2498. 

  2498.             }
    2499. 

  2499.           }
    2500. 

  2500. 

  2501.           // by default, lookupPath will not follow a symlink if it is the final path component.
    2502. 

  2502.           // setting opts.follow = true will override this behavior.
    2503. 

  2503.           if (!islast || opts.follow) {
    2504. 

  2504.             var count = 0;
    2505. 

  2505.             while (FS.isLink(current.mode)) {
    2506. 

  2506.               var link = FS.readlink(current_path);
    2507. 

  2507.               current_path = PATH.resolve(PATH.dirname(current_path), link);
    2508. 

  2508. 

  2509.               var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
    2510. 

  2510.               current = lookup.node;
    2511. 

  2511. 

  2512.               if (count++ > 40) {  // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
    2513. 

  2513.                 throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
    2514. 

  2514.               }
    2515. 

  2515.             }
    2516. 

  2516.           }
    2517. 

  2517.         }
    2518. 

  2518. 

  2519.         return { path: current_path, node: current };
    2520. 

  2520.       },getPath:function (node) {
    2521. 

  2521.         var path;
    2522. 

  2522.         while (true) {
    2523. 

  2523.           if (FS.isRoot(node)) {
    2524. 

  2524.             var mount = node.mount.mountpoint;
    2525. 

  2525.             if (!path) return mount;
    2526. 

  2526.             return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
    2527. 

  2527.           }
    2528. 

  2528.           path = path ? node.name + '/' + path : node.name;
    2529. 

  2529.           node = node.parent;
    2530. 

  2530.         }
    2531. 

  2531.       },hashName:function (parentid, name) {
    2532. 

  2532.         var hash = 0;
    2533. 

  2533. 

  2534. 

  2535.         for (var i = 0; i < name.length; i++) {
    2536. 

  2536.           hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
    2537. 

  2537.         }
    2538. 

  2538.         return ((parentid + hash) >>> 0) % FS.nameTable.length;
    2539. 

  2539.       },hashAddNode:function (node) {
    2540. 

  2540.         var hash = FS.hashName(node.parent.id, node.name);
    2541. 

  2541.         node.name_next = FS.nameTable[hash];
    2542. 

  2542.         FS.nameTable[hash] = node;
    2543. 

  2543.       },hashRemoveNode:function (node) {
    2544. 

  2544.         var hash = FS.hashName(node.parent.id, node.name);
    2545. 

  2545.         if (FS.nameTable[hash] === node) {
    2546. 

  2546.           FS.nameTable[hash] = node.name_next;
    2547. 

  2547.         } else {
    2548. 

  2548.           var current = FS.nameTable[hash];
    2549. 

  2549.           while (current) {
    2550. 

  2550.             if (current.name_next === node) {
    2551. 

  2551.               current.name_next = node.name_next;
    2552. 

  2552.               break;
    2553. 

  2553.             }
    2554. 

  2554.             current = current.name_next;
    2555. 

  2555.           }
    2556. 

  2556.         }
    2557. 

  2557.       },lookupNode:function (parent, name) {
    2558. 

  2558.         var err = FS.mayLookup(parent);
    2559. 

  2559.         if (err) {
    2560. 

  2560.           throw new FS.ErrnoError(err);
    2561. 

  2561.         }
    2562. 

  2562.         var hash = FS.hashName(parent.id, name);
    2563. 

  2563.         for (var node = FS.nameTable[hash]; node; node = node.name_next) {
    2564. 

  2564.           var nodeName = node.name;
    2565. 

  2565.           if (node.parent.id === parent.id && nodeName === name) {
    2566. 

  2566.             return node;
    2567. 

  2567.           }
    2568. 

  2568.         }
    2569. 

  2569.         // if we failed to find it in the cache, call into the VFS
    2570. 

  2570.         return FS.lookup(parent, name);
    2571. 

  2571.       },createNode:function (parent, name, mode, rdev) {
    2572. 

  2572.         if (!FS.FSNode) {
    2573. 

  2573.           FS.FSNode = function(parent, name, mode, rdev) {
    2574. 

  2574.             if (!parent) {
    2575. 

  2575.               parent = this;  // root node sets parent to itself
    2576. 

  2576.             }
    2577. 

  2577.             this.parent = parent;
    2578. 

  2578.             this.mount = parent.mount;
    2579. 

  2579.             this.mounted = null;
    2580. 

  2580.             this.id = FS.nextInode++;
    2581. 

  2581.             this.name = name;
    2582. 

  2582.             this.mode = mode;
    2583. 

  2583.             this.node_ops = {};
    2584. 

  2584.             this.stream_ops = {};
    2585. 

  2585.             this.rdev = rdev;
    2586. 

  2586.           };
    2587. 

  2587. 

  2588.           FS.FSNode.prototype = {};
    2589. 

  2589. 

  2590.           // compatibility
    2591. 

  2591.           var readMode = 292 | 73;
    2592. 

  2592.           var writeMode = 146;
    2593. 

  2593. 

  2594.           // NOTE we must use Object.defineProperties instead of individual calls to
    2595. 

  2595.           // Object.defineProperty in order to make closure compiler happy
    2596. 

  2596.           Object.defineProperties(FS.FSNode.prototype, {
    2597. 

  2597.             read: {
    2598. 

  2598.               get: function() { return (this.mode & readMode) === readMode; },
    2599. 

  2599.               set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
    2600. 

  2600.             },
    2601. 

  2601.             write: {
    2602. 

  2602.               get: function() { return (this.mode & writeMode) === writeMode; },
    2603. 

  2603.               set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
    2604. 

  2604.             },
    2605. 

  2605.             isFolder: {
    2606. 

  2606.               get: function() { return FS.isDir(this.mode); },
    2607. 

  2607.             },
    2608. 

  2608.             isDevice: {
    2609. 

  2609.               get: function() { return FS.isChrdev(this.mode); },
    2610. 

  2610.             },
    2611. 

  2611.           });
    2612. 

  2612.         }
    2613. 

  2613. 

  2614.         var node = new FS.FSNode(parent, name, mode, rdev);
    2615. 

  2615. 

  2616.         FS.hashAddNode(node);
    2617. 

  2617. 

  2618.         return node;
    2619. 

  2619.       },destroyNode:function (node) {
    2620. 

  2620.         FS.hashRemoveNode(node);
    2621. 

  2621.       },isRoot:function (node) {
    2622. 

  2622.         return node === node.parent;
    2623. 

  2623.       },isMountpoint:function (node) {
    2624. 

  2624.         return !!node.mounted;
    2625. 

  2625.       },isFile:function (mode) {
    2626. 

  2626.         return (mode & 61440) === 32768;
    2627. 

  2627.       },isDir:function (mode) {
    2628. 

  2628.         return (mode & 61440) === 16384;
    2629. 

  2629.       },isLink:function (mode) {
    2630. 

  2630.         return (mode & 61440) === 40960;
    2631. 

  2631.       },isChrdev:function (mode) {
    2632. 

  2632.         return (mode & 61440) === 8192;
    2633. 

  2633.       },isBlkdev:function (mode) {
    2634. 

  2634.         return (mode & 61440) === 24576;
    2635. 

  2635.       },isFIFO:function (mode) {
    2636. 

  2636.         return (mode & 61440) === 4096;
    2637. 

  2637.       },isSocket:function (mode) {
    2638. 

  2638.         return (mode & 49152) === 49152;
    2639. 

  2639.       },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) {
    2640. 

  2640.         var flags = FS.flagModes[str];
    2641. 

  2641.         if (typeof flags === 'undefined') {
    2642. 

  2642.           throw new Error('Unknown file open mode: ' + str);
    2643. 

  2643.         }
    2644. 

  2644.         return flags;
    2645. 

  2645.       },flagsToPermissionString:function (flag) {
    2646. 

  2646.         var accmode = flag & 2097155;
    2647. 

  2647.         var perms = ['r', 'w', 'rw'][accmode];
    2648. 

  2648.         if ((flag & 512)) {
    2649. 

  2649.           perms += 'w';
    2650. 

  2650.         }
    2651. 

  2651.         return perms;
    2652. 

  2652.       },nodePermissions:function (node, perms) {
    2653. 

  2653.         if (FS.ignorePermissions) {
    2654. 

  2654.           return 0;
    2655. 

  2655.         }
    2656. 

  2656.         // return 0 if any user, group or owner bits are set.
    2657. 

  2657.         if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
    2658. 

  2658.           return ERRNO_CODES.EACCES;
    2659. 

  2659.         } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
    2660. 

  2660.           return ERRNO_CODES.EACCES;
    2661. 

  2661.         } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
    2662. 

  2662.           return ERRNO_CODES.EACCES;
    2663. 

  2663.         }
    2664. 

  2664.         return 0;
    2665. 

  2665.       },mayLookup:function (dir) {
    2666. 

  2666.         return FS.nodePermissions(dir, 'x');
    2667. 

  2667.       },mayCreate:function (dir, name) {
    2668. 

  2668.         try {
    2669. 

  2669.           var node = FS.lookupNode(dir, name);
    2670. 

  2670.           return ERRNO_CODES.EEXIST;
    2671. 

  2671.         } catch (e) {
    2672. 

  2672.         }
    2673. 

  2673.         return FS.nodePermissions(dir, 'wx');
    2674. 

  2674.       },mayDelete:function (dir, name, isdir) {
    2675. 

  2675.         var node;
    2676. 

  2676.         try {
    2677. 

  2677.           node = FS.lookupNode(dir, name);
    2678. 

  2678.         } catch (e) {
    2679. 

  2679.           return e.errno;
    2680. 

  2680.         }
    2681. 

  2681.         var err = FS.nodePermissions(dir, 'wx');
    2682. 

  2682.         if (err) {
    2683. 

  2683.           return err;
    2684. 

  2684.         }
    2685. 

  2685.         if (isdir) {
    2686. 

  2686.           if (!FS.isDir(node.mode)) {
    2687. 

  2687.             return ERRNO_CODES.ENOTDIR;
    2688. 

  2688.           }
    2689. 

  2689.           if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
    2690. 

  2690.             return ERRNO_CODES.EBUSY;
    2691. 

  2691.           }
    2692. 

  2692.         } else {
    2693. 

  2693.           if (FS.isDir(node.mode)) {
    2694. 

  2694.             return ERRNO_CODES.EISDIR;
    2695. 

  2695.           }
    2696. 

  2696.         }
    2697. 

  2697.         return 0;
    2698. 

  2698.       },mayOpen:function (node, flags) {
    2699. 

  2699.         if (!node) {
    2700. 

  2700.           return ERRNO_CODES.ENOENT;
    2701. 

  2701.         }
    2702. 

  2702.         if (FS.isLink(node.mode)) {
    2703. 

  2703.           return ERRNO_CODES.ELOOP;
    2704. 

  2704.         } else if (FS.isDir(node.mode)) {
    2705. 

  2705.           if ((flags & 2097155) !== 0 ||  // opening for write
    2706. 

  2706.               (flags & 512)) {
    2707. 

  2707.             return ERRNO_CODES.EISDIR;
    2708. 

  2708.           }
    2709. 

  2709.         }
    2710. 

  2710.         return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
    2711. 

  2711.       },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
    2712. 

  2712.         fd_start = fd_start || 0;
    2713. 

  2713.         fd_end = fd_end || FS.MAX_OPEN_FDS;
    2714. 

  2714.         for (var fd = fd_start; fd <= fd_end; fd++) {
    2715. 

  2715.           if (!FS.streams[fd]) {
    2716. 

  2716.             return fd;
    2717. 

  2717.           }
    2718. 

  2718.         }
    2719. 

  2719.         throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
    2720. 

  2720.       },getStream:function (fd) {
    2721. 

  2721.         return FS.streams[fd];
    2722. 

  2722.       },createStream:function (stream, fd_start, fd_end) {
    2723. 

  2723.         if (!FS.FSStream) {
    2724. 

  2724.           FS.FSStream = function(){};
    2725. 

  2725.           FS.FSStream.prototype = {};
    2726. 

  2726.           // compatibility
    2727. 

  2727.           Object.defineProperties(FS.FSStream.prototype, {
    2728. 

  2728.             object: {
    2729. 

  2729.               get: function() { return this.node; },
    2730. 

  2730.               set: function(val) { this.node = val; }
    2731. 

  2731.             },
    2732. 

  2732.             isRead: {
    2733. 

  2733.               get: function() { return (this.flags & 2097155) !== 1; }
    2734. 

  2734.             },
    2735. 

  2735.             isWrite: {
    2736. 

  2736.               get: function() { return (this.flags & 2097155) !== 0; }
    2737. 

  2737.             },
    2738. 

  2738.             isAppend: {
    2739. 

  2739.               get: function() { return (this.flags & 1024); }
    2740. 

  2740.             }
    2741. 

  2741.           });
    2742. 

  2742.         }
    2743. 

  2743.         if (0) {
    2744. 

  2744.           // reuse the object
    2745. 

  2745.           stream.__proto__ = FS.FSStream.prototype;
    2746. 

  2746.         } else {
    2747. 

  2747.           var newStream = new FS.FSStream();
    2748. 

  2748.           for (var p in stream) {
    2749. 

  2749.             newStream[p] = stream[p];
    2750. 

  2750.           }
    2751. 

  2751.           stream = newStream;
    2752. 

  2752.         }
    2753. 

  2753.         var fd = FS.nextfd(fd_start, fd_end);
    2754. 

  2754.         stream.fd = fd;
    2755. 

  2755.         FS.streams[fd] = stream;
    2756. 

  2756.         return stream;
    2757. 

  2757.       },closeStream:function (fd) {
    2758. 

  2758.         FS.streams[fd] = null;
    2759. 

  2759.       },getStreamFromPtr:function (ptr) {
    2760. 

  2760.         return FS.streams[ptr - 1];
    2761. 

  2761.       },getPtrForStream:function (stream) {
    2762. 

  2762.         return stream ? stream.fd + 1 : 0;
    2763. 

  2763.       },chrdev_stream_ops:{open:function (stream) {
    2764. 

  2764.           var device = FS.getDevice(stream.node.rdev);
    2765. 

  2765.           // override node's stream ops with the device's
    2766. 

  2766.           stream.stream_ops = device.stream_ops;
    2767. 

  2767.           // forward the open call
    2768. 

  2768.           if (stream.stream_ops.open) {
    2769. 

  2769.             stream.stream_ops.open(stream);
    2770. 

  2770.           }
    2771. 

  2771.         },llseek:function () {
    2772. 

  2772.           throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
    2773. 

  2773.         }},major:function (dev) {
    2774. 

  2774.         return ((dev) >> 8);
    2775. 

  2775.       },minor:function (dev) {
    2776. 

  2776.         return ((dev) & 0xff);
    2777. 

  2777.       },makedev:function (ma, mi) {
    2778. 

  2778.         return ((ma) << 8 | (mi));
    2779. 

  2779.       },registerDevice:function (dev, ops) {
    2780. 

  2780.         FS.devices[dev] = { stream_ops: ops };
    2781. 

  2781.       },getDevice:function (dev) {
    2782. 

  2782.         return FS.devices[dev];
    2783. 

  2783.       },getMounts:function (mount) {
    2784. 

  2784.         var mounts = [];
    2785. 

  2785.         var check = [mount];
    2786. 

  2786. 

  2787.         while (check.length) {
    2788. 

  2788.           var m = check.pop();
    2789. 

  2789. 

  2790.           mounts.push(m);
    2791. 

  2791. 

  2792.           check.push.apply(check, m.mounts);
    2793. 

  2793.         }
    2794. 

  2794. 

  2795.         return mounts;
    2796. 

  2796.       },syncfs:function (populate, callback) {
    2797. 

  2797.         if (typeof(populate) === 'function') {
    2798. 

  2798.           callback = populate;
    2799. 

  2799.           populate = false;
    2800. 

  2800.         }
    2801. 

  2801. 

  2802.         var mounts = FS.getMounts(FS.root.mount);
    2803. 

  2803.         var completed = 0;
    2804. 

  2804. 

  2805.         function done(err) {
    2806. 

  2806.           if (err) {
    2807. 

  2807.             if (!done.errored) {
    2808. 

  2808.               done.errored = true;
    2809. 

  2809.               return callback(err);
    2810. 

  2810.             }
    2811. 

  2811.             return;
    2812. 

  2812.           }
    2813. 

  2813.           if (++completed >= mounts.length) {
    2814. 

  2814.             callback(null);
    2815. 

  2815.           }
    2816. 

  2816.         };
    2817. 

  2817. 

  2818.         // sync all mounts
    2819. 

  2819.         mounts.forEach(function (mount) {
    2820. 

  2820.           if (!mount.type.syncfs) {
    2821. 

  2821.             return done(null);
    2822. 

  2822.           }
    2823. 

  2823.           mount.type.syncfs(mount, populate, done);
    2824. 

  2824.         });
    2825. 

  2825.       },mount:function (type, opts, mountpoint) {
    2826. 

  2826.         var root = mountpoint === '/';
    2827. 

  2827.         var pseudo = !mountpoint;
    2828. 

  2828.         var node;
    2829. 

  2829. 

  2830.         if (root && FS.root) {
    2831. 

  2831.           throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    2832. 

  2832.         } else if (!root && !pseudo) {
    2833. 

  2833.           var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
    2834. 

  2834. 

  2835.           mountpoint = lookup.path;  // use the absolute path
    2836. 

  2836.           node = lookup.node;
    2837. 

  2837. 

  2838.           if (FS.isMountpoint(node)) {
    2839. 

  2839.             throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    2840. 

  2840.           }
    2841. 

  2841. 

  2842.           if (!FS.isDir(node.mode)) {
    2843. 

  2843.             throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
    2844. 

  2844.           }
    2845. 

  2845.         }
    2846. 

  2846. 

  2847.         var mount = {
    2848. 

  2848.           type: type,
    2849. 

  2849.           opts: opts,
    2850. 

  2850.           mountpoint: mountpoint,
    2851. 

  2851.           mounts: []
    2852. 

  2852.         };
    2853. 

  2853. 

  2854.         // create a root node for the fs
    2855. 

  2855.         var mountRoot = type.mount(mount);
    2856. 

  2856.         mountRoot.mount = mount;
    2857. 

  2857.         mount.root = mountRoot;
    2858. 

  2858. 

  2859.         if (root) {
    2860. 

  2860.           FS.root = mountRoot;
    2861. 

  2861.         } else if (node) {
    2862. 

  2862.           // set as a mountpoint
    2863. 

  2863.           node.mounted = mount;
    2864. 

  2864. 

  2865.           // add the new mount to the current mount's children
    2866. 

  2866.           if (node.mount) {
    2867. 

  2867.             node.mount.mounts.push(mount);
    2868. 

  2868.           }
    2869. 

  2869.         }
    2870. 

  2870. 

  2871.         return mountRoot;
    2872. 

  2872.       },unmount:function (mountpoint) {
    2873. 

  2873.         var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
    2874. 

  2874. 

  2875.         if (!FS.isMountpoint(lookup.node)) {
    2876. 

  2876.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    2877. 

  2877.         }
    2878. 

  2878. 

  2879.         // destroy the nodes for this mount, and all its child mounts
    2880. 

  2880.         var node = lookup.node;
    2881. 

  2881.         var mount = node.mounted;
    2882. 

  2882.         var mounts = FS.getMounts(mount);
    2883. 

  2883. 

  2884.         Object.keys(FS.nameTable).forEach(function (hash) {
    2885. 

  2885.           var current = FS.nameTable[hash];
    2886. 

  2886. 

  2887.           while (current) {
    2888. 

  2888.             var next = current.name_next;
    2889. 

  2889. 

  2890.             if (mounts.indexOf(current.mount) !== -1) {
    2891. 

  2891.               FS.destroyNode(current);
    2892. 

  2892.             }
    2893. 

  2893. 

  2894.             current = next;
    2895. 

  2895.           }
    2896. 

  2896.         });
    2897. 

  2897. 

  2898.         // no longer a mountpoint
    2899. 

  2899.         node.mounted = null;
    2900. 

  2900. 

  2901.         // remove this mount from the child mounts
    2902. 

  2902.         var idx = node.mount.mounts.indexOf(mount);
    2903. 

  2903.         assert(idx !== -1);
    2904. 

  2904.         node.mount.mounts.splice(idx, 1);
    2905. 

  2905.       },lookup:function (parent, name) {
    2906. 

  2906.         return parent.node_ops.lookup(parent, name);
    2907. 

  2907.       },mknod:function (path, mode, dev) {
    2908. 

  2908.         var lookup = FS.lookupPath(path, { parent: true });
    2909. 

  2909.         var parent = lookup.node;
    2910. 

  2910.         var name = PATH.basename(path);
    2911. 

  2911.         var err = FS.mayCreate(parent, name);
    2912. 

  2912.         if (err) {
    2913. 

  2913.           throw new FS.ErrnoError(err);
    2914. 

  2914.         }
    2915. 

  2915.         if (!parent.node_ops.mknod) {
    2916. 

  2916.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    2917. 

  2917.         }
    2918. 

  2918.         return parent.node_ops.mknod(parent, name, mode, dev);
    2919. 

  2919.       },create:function (path, mode) {
    2920. 

  2920.         mode = mode !== undefined ? mode : 438 /* 0666 */;
    2921. 

  2921.         mode &= 4095;
    2922. 

  2922.         mode |= 32768;
    2923. 

  2923.         return FS.mknod(path, mode, 0);
    2924. 

  2924.       },mkdir:function (path, mode) {
    2925. 

  2925.         mode = mode !== undefined ? mode : 511 /* 0777 */;
    2926. 

  2926.         mode &= 511 | 512;
    2927. 

  2927.         mode |= 16384;
    2928. 

  2928.         return FS.mknod(path, mode, 0);
    2929. 

  2929.       },mkdev:function (path, mode, dev) {
    2930. 

  2930.         if (typeof(dev) === 'undefined') {
    2931. 

  2931.           dev = mode;
    2932. 

  2932.           mode = 438 /* 0666 */;
    2933. 

  2933.         }
    2934. 

  2934.         mode |= 8192;
    2935. 

  2935.         return FS.mknod(path, mode, dev);
    2936. 

  2936.       },symlink:function (oldpath, newpath) {
    2937. 

  2937.         var lookup = FS.lookupPath(newpath, { parent: true });
    2938. 

  2938.         var parent = lookup.node;
    2939. 

  2939.         var newname = PATH.basename(newpath);
    2940. 

  2940.         var err = FS.mayCreate(parent, newname);
    2941. 

  2941.         if (err) {
    2942. 

  2942.           throw new FS.ErrnoError(err);
    2943. 

  2943.         }
    2944. 

  2944.         if (!parent.node_ops.symlink) {
    2945. 

  2945.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    2946. 

  2946.         }
    2947. 

  2947.         return parent.node_ops.symlink(parent, newname, oldpath);
    2948. 

  2948.       },rename:function (old_path, new_path) {
    2949. 

  2949.         var old_dirname = PATH.dirname(old_path);
    2950. 

  2950.         var new_dirname = PATH.dirname(new_path);
    2951. 

  2951.         var old_name = PATH.basename(old_path);
    2952. 

  2952.         var new_name = PATH.basename(new_path);
    2953. 

  2953.         // parents must exist
    2954. 

  2954.         var lookup, old_dir, new_dir;
    2955. 

  2955.         try {
    2956. 

  2956.           lookup = FS.lookupPath(old_path, { parent: true });
    2957. 

  2957.           old_dir = lookup.node;
    2958. 

  2958.           lookup = FS.lookupPath(new_path, { parent: true });
    2959. 

  2959.           new_dir = lookup.node;
    2960. 

  2960.         } catch (e) {
    2961. 

  2961.           throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    2962. 

  2962.         }
    2963. 

  2963.         // need to be part of the same mount
    2964. 

  2964.         if (old_dir.mount !== new_dir.mount) {
    2965. 

  2965.           throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
    2966. 

  2966.         }
    2967. 

  2967.         // source must exist
    2968. 

  2968.         var old_node = FS.lookupNode(old_dir, old_name);
    2969. 

  2969.         // old path should not be an ancestor of the new path
    2970. 

  2970.         var relative = PATH.relative(old_path, new_dirname);
    2971. 

  2971.         if (relative.charAt(0) !== '.') {
    2972. 

  2972.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    2973. 

  2973.         }
    2974. 

  2974.         // new path should not be an ancestor of the old path
    2975. 

  2975.         relative = PATH.relative(new_path, old_dirname);
    2976. 

  2976.         if (relative.charAt(0) !== '.') {
    2977. 

  2977.           throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
    2978. 

  2978.         }
    2979. 

  2979.         // see if the new path already exists
    2980. 

  2980.         var new_node;
    2981. 

  2981.         try {
    2982. 

  2982.           new_node = FS.lookupNode(new_dir, new_name);
    2983. 

  2983.         } catch (e) {
    2984. 

  2984.           // not fatal
    2985. 

  2985.         }
    2986. 

  2986.         // early out if nothing needs to change
    2987. 

  2987.         if (old_node === new_node) {
    2988. 

  2988.           return;
    2989. 

  2989.         }
    2990. 

  2990.         // we'll need to delete the old entry
    2991. 

  2991.         var isdir = FS.isDir(old_node.mode);
    2992. 

  2992.         var err = FS.mayDelete(old_dir, old_name, isdir);
    2993. 

  2993.         if (err) {
    2994. 

  2994.           throw new FS.ErrnoError(err);
    2995. 

  2995.         }
    2996. 

  2996.         // need delete permissions if we'll be overwriting.
    2997. 

  2997.         // need create permissions if new doesn't already exist.
    2998. 

  2998.         err = new_node ?
    2999. 

  2999.           FS.mayDelete(new_dir, new_name, isdir) :
    3000. 

  3000.           FS.mayCreate(new_dir, new_name);
    3001. 

  3001.         if (err) {
    3002. 

  3002.           throw new FS.ErrnoError(err);
    3003. 

  3003.         }
    3004. 

  3004.         if (!old_dir.node_ops.rename) {
    3005. 

  3005.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3006. 

  3006.         }
    3007. 

  3007.         if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
    3008. 

  3008.           throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    3009. 

  3009.         }
    3010. 

  3010.         // if we are going to change the parent, check write permissions
    3011. 

  3011.         if (new_dir !== old_dir) {
    3012. 

  3012.           err = FS.nodePermissions(old_dir, 'w');
    3013. 

  3013.           if (err) {
    3014. 

  3014.             throw new FS.ErrnoError(err);
    3015. 

  3015.           }
    3016. 

  3016.         }
    3017. 

  3017.         // remove the node from the lookup hash
    3018. 

  3018.         FS.hashRemoveNode(old_node);
    3019. 

  3019.         // do the underlying fs rename
    3020. 

  3020.         try {
    3021. 

  3021.           old_dir.node_ops.rename(old_node, new_dir, new_name);
    3022. 

  3022.         } catch (e) {
    3023. 

  3023.           throw e;
    3024. 

  3024.         } finally {
    3025. 

  3025.           // add the node back to the hash (in case node_ops.rename
    3026. 

  3026.           // changed its name)
    3027. 

  3027.           FS.hashAddNode(old_node);
    3028. 

  3028.         }
    3029. 

  3029.       },rmdir:function (path) {
    3030. 

  3030.         var lookup = FS.lookupPath(path, { parent: true });
    3031. 

  3031.         var parent = lookup.node;
    3032. 

  3032.         var name = PATH.basename(path);
    3033. 

  3033.         var node = FS.lookupNode(parent, name);
    3034. 

  3034.         var err = FS.mayDelete(parent, name, true);
    3035. 

  3035.         if (err) {
    3036. 

  3036.           throw new FS.ErrnoError(err);
    3037. 

  3037.         }
    3038. 

  3038.         if (!parent.node_ops.rmdir) {
    3039. 

  3039.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3040. 

  3040.         }
    3041. 

  3041.         if (FS.isMountpoint(node)) {
    3042. 

  3042.           throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    3043. 

  3043.         }
    3044. 

  3044.         parent.node_ops.rmdir(parent, name);
    3045. 

  3045.         FS.destroyNode(node);
    3046. 

  3046.       },readdir:function (path) {
    3047. 

  3047.         var lookup = FS.lookupPath(path, { follow: true });
    3048. 

  3048.         var node = lookup.node;
    3049. 

  3049.         if (!node.node_ops.readdir) {
    3050. 

  3050.           throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
    3051. 

  3051.         }
    3052. 

  3052.         return node.node_ops.readdir(node);
    3053. 

  3053.       },unlink:function (path) {
    3054. 

  3054.         var lookup = FS.lookupPath(path, { parent: true });
    3055. 

  3055.         var parent = lookup.node;
    3056. 

  3056.         var name = PATH.basename(path);
    3057. 

  3057.         var node = FS.lookupNode(parent, name);
    3058. 

  3058.         var err = FS.mayDelete(parent, name, false);
    3059. 

  3059.         if (err) {
    3060. 

  3060.           // POSIX says unlink should set EPERM, not EISDIR
    3061. 

  3061.           if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
    3062. 

  3062.           throw new FS.ErrnoError(err);
    3063. 

  3063.         }
    3064. 

  3064.         if (!parent.node_ops.unlink) {
    3065. 

  3065.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3066. 

  3066.         }
    3067. 

  3067.         if (FS.isMountpoint(node)) {
    3068. 

  3068.           throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
    3069. 

  3069.         }
    3070. 

  3070.         parent.node_ops.unlink(parent, name);
    3071. 

  3071.         FS.destroyNode(node);
    3072. 

  3072.       },readlink:function (path) {
    3073. 

  3073.         var lookup = FS.lookupPath(path);
    3074. 

  3074.         var link = lookup.node;
    3075. 

  3075.         if (!link.node_ops.readlink) {
    3076. 

  3076.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3077. 

  3077.         }
    3078. 

  3078.         return link.node_ops.readlink(link);
    3079. 

  3079.       },stat:function (path, dontFollow) {
    3080. 

  3080.         var lookup = FS.lookupPath(path, { follow: !dontFollow });
    3081. 

  3081.         var node = lookup.node;
    3082. 

  3082.         if (!node.node_ops.getattr) {
    3083. 

  3083.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3084. 

  3084.         }
    3085. 

  3085.         return node.node_ops.getattr(node);
    3086. 

  3086.       },lstat:function (path) {
    3087. 

  3087.         return FS.stat(path, true);
    3088. 

  3088.       },chmod:function (path, mode, dontFollow) {
    3089. 

  3089.         var node;
    3090. 

  3090.         if (typeof path === 'string') {
    3091. 

  3091.           var lookup = FS.lookupPath(path, { follow: !dontFollow });
    3092. 

  3092.           node = lookup.node;
    3093. 

  3093.         } else {
    3094. 

  3094.           node = path;
    3095. 

  3095.         }
    3096. 

  3096.         if (!node.node_ops.setattr) {
    3097. 

  3097.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3098. 

  3098.         }
    3099. 

  3099.         node.node_ops.setattr(node, {
    3100. 

  3100.           mode: (mode & 4095) | (node.mode & ~4095),
    3101. 

  3101.           timestamp: Date.now()
    3102. 

  3102.         });
    3103. 

  3103.       },lchmod:function (path, mode) {
    3104. 

  3104.         FS.chmod(path, mode, true);
    3105. 

  3105.       },fchmod:function (fd, mode) {
    3106. 

  3106.         var stream = FS.getStream(fd);
    3107. 

  3107.         if (!stream) {
    3108. 

  3108.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3109. 

  3109.         }
    3110. 

  3110.         FS.chmod(stream.node, mode);
    3111. 

  3111.       },chown:function (path, uid, gid, dontFollow) {
    3112. 

  3112.         var node;
    3113. 

  3113.         if (typeof path === 'string') {
    3114. 

  3114.           var lookup = FS.lookupPath(path, { follow: !dontFollow });
    3115. 

  3115.           node = lookup.node;
    3116. 

  3116.         } else {
    3117. 

  3117.           node = path;
    3118. 

  3118.         }
    3119. 

  3119.         if (!node.node_ops.setattr) {
    3120. 

  3120.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3121. 

  3121.         }
    3122. 

  3122.         node.node_ops.setattr(node, {
    3123. 

  3123.           timestamp: Date.now()
    3124. 

  3124.           // we ignore the uid / gid for now
    3125. 

  3125.         });
    3126. 

  3126.       },lchown:function (path, uid, gid) {
    3127. 

  3127.         FS.chown(path, uid, gid, true);
    3128. 

  3128.       },fchown:function (fd, uid, gid) {
    3129. 

  3129.         var stream = FS.getStream(fd);
    3130. 

  3130.         if (!stream) {
    3131. 

  3131.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3132. 

  3132.         }
    3133. 

  3133.         FS.chown(stream.node, uid, gid);
    3134. 

  3134.       },truncate:function (path, len) {
    3135. 

  3135.         if (len < 0) {
    3136. 

  3136.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3137. 

  3137.         }
    3138. 

  3138.         var node;
    3139. 

  3139.         if (typeof path === 'string') {
    3140. 

  3140.           var lookup = FS.lookupPath(path, { follow: true });
    3141. 

  3141.           node = lookup.node;
    3142. 

  3142.         } else {
    3143. 

  3143.           node = path;
    3144. 

  3144.         }
    3145. 

  3145.         if (!node.node_ops.setattr) {
    3146. 

  3146.           throw new FS.ErrnoError(ERRNO_CODES.EPERM);
    3147. 

  3147.         }
    3148. 

  3148.         if (FS.isDir(node.mode)) {
    3149. 

  3149.           throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
    3150. 

  3150.         }
    3151. 

  3151.         if (!FS.isFile(node.mode)) {
    3152. 

  3152.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3153. 

  3153.         }
    3154. 

  3154.         var err = FS.nodePermissions(node, 'w');
    3155. 

  3155.         if (err) {
    3156. 

  3156.           throw new FS.ErrnoError(err);
    3157. 

  3157.         }
    3158. 

  3158.         node.node_ops.setattr(node, {
    3159. 

  3159.           size: len,
    3160. 

  3160.           timestamp: Date.now()
    3161. 

  3161.         });
    3162. 

  3162.       },ftruncate:function (fd, len) {
    3163. 

  3163.         var stream = FS.getStream(fd);
    3164. 

  3164.         if (!stream) {
    3165. 

  3165.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3166. 

  3166.         }
    3167. 

  3167.         if ((stream.flags & 2097155) === 0) {
    3168. 

  3168.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3169. 

  3169.         }
    3170. 

  3170.         FS.truncate(stream.node, len);
    3171. 

  3171.       },utime:function (path, atime, mtime) {
    3172. 

  3172.         var lookup = FS.lookupPath(path, { follow: true });
    3173. 

  3173.         var node = lookup.node;
    3174. 

  3174.         node.node_ops.setattr(node, {
    3175. 

  3175.           timestamp: Math.max(atime, mtime)
    3176. 

  3176.         });
    3177. 

  3177.       },open:function (path, flags, mode, fd_start, fd_end) {
    3178. 

  3178.         flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
    3179. 

  3179.         mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
    3180. 

  3180.         if ((flags & 64)) {
    3181. 

  3181.           mode = (mode & 4095) | 32768;
    3182. 

  3182.         } else {
    3183. 

  3183.           mode = 0;
    3184. 

  3184.         }
    3185. 

  3185.         var node;
    3186. 

  3186.         if (typeof path === 'object') {
    3187. 

  3187.           node = path;
    3188. 

  3188.         } else {
    3189. 

  3189.           path = PATH.normalize(path);
    3190. 

  3190.           try {
    3191. 

  3191.             var lookup = FS.lookupPath(path, {
    3192. 

  3192.               follow: !(flags & 131072)
    3193. 

  3193.             });
    3194. 

  3194.             node = lookup.node;
    3195. 

  3195.           } catch (e) {
    3196. 

  3196.             // ignore
    3197. 

  3197.           }
    3198. 

  3198.         }
    3199. 

  3199.         // perhaps we need to create the node
    3200. 

  3200.         if ((flags & 64)) {
    3201. 

  3201.           if (node) {
    3202. 

  3202.             // if O_CREAT and O_EXCL are set, error out if the node already exists
    3203. 

  3203.             if ((flags & 128)) {
    3204. 

  3204.               throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
    3205. 

  3205.             }
    3206. 

  3206.           } else {
    3207. 

  3207.             // node doesn't exist, try to create it
    3208. 

  3208.             node = FS.mknod(path, mode, 0);
    3209. 

  3209.           }
    3210. 

  3210.         }
    3211. 

  3211.         if (!node) {
    3212. 

  3212.           throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
    3213. 

  3213.         }
    3214. 

  3214.         // can't truncate a device
    3215. 

  3215.         if (FS.isChrdev(node.mode)) {
    3216. 

  3216.           flags &= ~512;
    3217. 

  3217.         }
    3218. 

  3218.         // check permissions
    3219. 

  3219.         var err = FS.mayOpen(node, flags);
    3220. 

  3220.         if (err) {
    3221. 

  3221.           throw new FS.ErrnoError(err);
    3222. 

  3222.         }
    3223. 

  3223.         // do truncation if necessary
    3224. 

  3224.         if ((flags & 512)) {
    3225. 

  3225.           FS.truncate(node, 0);
    3226. 

  3226.         }
    3227. 

  3227.         // we've already handled these, don't pass down to the underlying vfs
    3228. 

  3228.         flags &= ~(128 | 512);
    3229. 

  3229. 

  3230.         // register the stream with the filesystem
    3231. 

  3231.         var stream = FS.createStream({
    3232. 

  3232.           node: node,
    3233. 

  3233.           path: FS.getPath(node),  // we want the absolute path to the node
    3234. 

  3234.           flags: flags,
    3235. 

  3235.           seekable: true,
    3236. 

  3236.           position: 0,
    3237. 

  3237.           stream_ops: node.stream_ops,
    3238. 

  3238.           // used by the file family libc calls (fopen, fwrite, ferror, etc.)
    3239. 

  3239.           ungotten: [],
    3240. 

  3240.           error: false
    3241. 

  3241.         }, fd_start, fd_end);
    3242. 

  3242.         // call the new stream's open function
    3243. 

  3243.         if (stream.stream_ops.open) {
    3244. 

  3244.           stream.stream_ops.open(stream);
    3245. 

  3245.         }
    3246. 

  3246.         if (Module['logReadFiles'] && !(flags & 1)) {
    3247. 

  3247.           if (!FS.readFiles) FS.readFiles = {};
    3248. 

  3248.           if (!(path in FS.readFiles)) {
    3249. 

  3249.             FS.readFiles[path] = 1;
    3250. 

  3250.             Module['printErr']('read file: ' + path);
    3251. 

  3251.           }
    3252. 

  3252.         }
    3253. 

  3253.         return stream;
    3254. 

  3254.       },close:function (stream) {
    3255. 

  3255.         try {
    3256. 

  3256.           if (stream.stream_ops.close) {
    3257. 

  3257.             stream.stream_ops.close(stream);
    3258. 

  3258.           }
    3259. 

  3259.         } catch (e) {
    3260. 

  3260.           throw e;
    3261. 

  3261.         } finally {
    3262. 

  3262.           FS.closeStream(stream.fd);
    3263. 

  3263.         }
    3264. 

  3264.       },llseek:function (stream, offset, whence) {
    3265. 

  3265.         if (!stream.seekable || !stream.stream_ops.llseek) {
    3266. 

  3266.           throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
    3267. 

  3267.         }
    3268. 

  3268.         return stream.stream_ops.llseek(stream, offset, whence);
    3269. 

  3269.       },read:function (stream, buffer, offset, length, position) {
    3270. 

  3270.         if (length < 0 || position < 0) {
    3271. 

  3271.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3272. 

  3272.         }
    3273. 

  3273.         if ((stream.flags & 2097155) === 1) {
    3274. 

  3274.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3275. 

  3275.         }
    3276. 

  3276.         if (FS.isDir(stream.node.mode)) {
    3277. 

  3277.           throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
    3278. 

  3278.         }
    3279. 

  3279.         if (!stream.stream_ops.read) {
    3280. 

  3280.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3281. 

  3281.         }
    3282. 

  3282.         var seeking = true;
    3283. 

  3283.         if (typeof position === 'undefined') {
    3284. 

  3284.           position = stream.position;
    3285. 

  3285.           seeking = false;
    3286. 

  3286.         } else if (!stream.seekable) {
    3287. 

  3287.           throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
    3288. 

  3288.         }
    3289. 

  3289.         var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
    3290. 

  3290.         if (!seeking) stream.position += bytesRead;
    3291. 

  3291.         return bytesRead;
    3292. 

  3292.       },write:function (stream, buffer, offset, length, position, canOwn) {
    3293. 

  3293.         if (length < 0 || position < 0) {
    3294. 

  3294.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3295. 

  3295.         }
    3296. 

  3296.         if ((stream.flags & 2097155) === 0) {
    3297. 

  3297.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3298. 

  3298.         }
    3299. 

  3299.         if (FS.isDir(stream.node.mode)) {
    3300. 

  3300.           throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
    3301. 

  3301.         }
    3302. 

  3302.         if (!stream.stream_ops.write) {
    3303. 

  3303.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3304. 

  3304.         }
    3305. 

  3305.         var seeking = true;
    3306. 

  3306.         if (typeof position === 'undefined') {
    3307. 

  3307.           position = stream.position;
    3308. 

  3308.           seeking = false;
    3309. 

  3309.         } else if (!stream.seekable) {
    3310. 

  3310.           throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
    3311. 

  3311.         }
    3312. 

  3312.         if (stream.flags & 1024) {
    3313. 

  3313.           // seek to the end before writing in append mode
    3314. 

  3314.           FS.llseek(stream, 0, 2);
    3315. 

  3315.         }
    3316. 

  3316.         var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
    3317. 

  3317.         if (!seeking) stream.position += bytesWritten;
    3318. 

  3318.         return bytesWritten;
    3319. 

  3319.       },allocate:function (stream, offset, length) {
    3320. 

  3320.         if (offset < 0 || length <= 0) {
    3321. 

  3321.           throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    3322. 

  3322.         }
    3323. 

  3323.         if ((stream.flags & 2097155) === 0) {
    3324. 

  3324.           throw new FS.ErrnoError(ERRNO_CODES.EBADF);
    3325. 

  3325.         }
    3326. 

  3326.         if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
    3327. 

  3327.           throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
    3328. 

  3328.         }
    3329. 

  3329.         if (!stream.stream_ops.allocate) {
    3330. 

  3330.           throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
    3331. 

  3331.         }
    3332. 

  3332.         stream.stream_ops.allocate(stream, offset, length);
    3333. 

  3333.       },mmap:function (stream, buffer, offset, length, position, prot, flags) {
    3334. 

  3334.         // TODO if PROT is PROT_WRITE, make sure we have write access
    3335. 

  3335.         if ((stream.flags & 2097155) === 1) {
    3336. 

  3336.           throw new FS.ErrnoError(ERRNO_CODES.EACCES);
    3337. 

  3337.         }
    3338. 

  3338.         if (!stream.stream_ops.mmap) {
    3339. 

  3339.           throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
    3340. 

  3340.         }
    3341. 

  3341.         return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
    3342. 

  3342.       },ioctl:function (stream, cmd, arg) {
    3343. 

  3343.         if (!stream.stream_ops.ioctl) {
    3344. 

  3344.           throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
    3345. 

  3345.         }
    3346. 

  3346.         return stream.stream_ops.ioctl(stream, cmd, arg);
    3347. 

  3347.       },readFile:function (path, opts) {
    3348. 

  3348.         opts = opts || {};
    3349. 

  3349.         opts.flags = opts.flags || 'r';
    3350. 

  3350.         opts.encoding = opts.encoding || 'binary';
    3351. 

  3351.         if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
    3352. 

  3352.           throw new Error('Invalid encoding type "' + opts.encoding + '"');
    3353. 

  3353.         }
    3354. 

  3354.         var ret;
    3355. 

  3355.         var stream = FS.open(path, opts.flags);
    3356. 

  3356.         var stat = FS.stat(path);
    3357. 

  3357.         var length = stat.size;
    3358. 

  3358.         var buf = new Uint8Array(length);
    3359. 

  3359.         FS.read(stream, buf, 0, length, 0);
    3360. 

  3360.         if (opts.encoding === 'utf8') {
    3361. 

  3361.           ret = '';
    3362. 

  3362.           var utf8 = new Runtime.UTF8Processor();
    3363. 

  3363.           for (var i = 0; i < length; i++) {
    3364. 

  3364.             ret += utf8.processCChar(buf[i]);
    3365. 

  3365.           }
    3366. 

  3366.         } else if (opts.encoding === 'binary') {
    3367. 

  3367.           ret = buf;
    3368. 

  3368.         }
    3369. 

  3369.         FS.close(stream);
    3370. 

  3370.         return ret;
    3371. 

  3371.       },writeFile:function (path, data, opts) {
    3372. 

  3372.         opts = opts || {};
    3373. 

  3373.         opts.flags = opts.flags || 'w';
    3374. 

  3374.         opts.encoding = opts.encoding || 'utf8';
    3375. 

  3375.         if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
    3376. 

  3376.           throw new Error('Invalid encoding type "' + opts.encoding + '"');
    3377. 

  3377.         }
    3378. 

  3378.         var stream = FS.open(path, opts.flags, opts.mode);
    3379. 

  3379.         if (opts.encoding === 'utf8') {
    3380. 

  3380.           var utf8 = new Runtime.UTF8Processor();
    3381. 

  3381.           var buf = new Uint8Array(utf8.processJSString(data));
    3382. 

  3382.           FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
    3383. 

  3383.         } else if (opts.encoding === 'binary') {
    3384. 

  3384.           FS.write(stream, data, 0, data.length, 0, opts.canOwn);
    3385. 

  3385.         }
    3386. 

  3386.         FS.close(stream);
    3387. 

  3387.       },cwd:function () {
    3388. 

  3388.         return FS.currentPath;
    3389. 

  3389.       },chdir:function (path) {
    3390. 

  3390.         var lookup = FS.lookupPath(path, { follow: true });
    3391. 

  3391.         if (!FS.isDir(lookup.node.mode)) {
    3392. 

  3392.           throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
    3393. 

  3393.         }
    3394. 

  3394.         var err = FS.nodePermissions(lookup.node, 'x');
    3395. 

  3395.         if (err) {
    3396. 

  3396.           throw new FS.ErrnoError(err);
    3397. 

  3397.         }
    3398. 

  3398.         FS.currentPath = lookup.path;
    3399. 

  3399.       },createDefaultDirectories:function () {
    3400. 

  3400.         FS.mkdir('/tmp');
    3401. 

  3401.       },createDefaultDevices:function () {
    3402. 

  3402.         // create /dev
    3403. 

  3403.         FS.mkdir('/dev');
    3404. 

  3404.         // setup /dev/null
    3405. 

  3405.         FS.registerDevice(FS.makedev(1, 3), {
    3406. 

  3406.           read: function() { return 0; },
    3407. 

  3407.           write: function() { return 0; }
    3408. 

  3408.         });
    3409. 

  3409.         FS.mkdev('/dev/null', FS.makedev(1, 3));
    3410. 

  3410.         // setup /dev/tty and /dev/tty1
    3411. 

  3411.         // stderr needs to print output using Module['printErr']
    3412. 

  3412.         // so we register a second tty just for it.
    3413. 

  3413.         TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
    3414. 

  3414.         TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
    3415. 

  3415.         FS.mkdev('/dev/tty', FS.makedev(5, 0));
    3416. 

  3416.         FS.mkdev('/dev/tty1', FS.makedev(6, 0));
    3417. 

  3417.         // we're not going to emulate the actual shm device,
    3418. 

  3418.         // just create the tmp dirs that reside in it commonly
    3419. 

  3419.         FS.mkdir('/dev/shm');
    3420. 

  3420.         FS.mkdir('/dev/shm/tmp');
    3421. 

  3421.       },createStandardStreams:function () {
    3422. 

  3422.         // TODO deprecate the old functionality of a single
    3423. 

  3423.         // input / output callback and that utilizes FS.createDevice
    3424. 

  3424.         // and instead require a unique set of stream ops
    3425. 

  3425. 

  3426.         // by default, we symlink the standard streams to the
    3427. 

  3427.         // default tty devices. however, if the standard streams
    3428. 

  3428.         // have been overwritten we create a unique device for
    3429. 

  3429.         // them instead.
    3430. 

  3430.         if (Module['stdin']) {
    3431. 

  3431.           FS.createDevice('/dev', 'stdin', Module['stdin']);
    3432. 

  3432.         } else {
    3433. 

  3433.           FS.symlink('/dev/tty', '/dev/stdin');
    3434. 

  3434.         }
    3435. 

  3435.         if (Module['stdout']) {
    3436. 

  3436.           FS.createDevice('/dev', 'stdout', null, Module['stdout']);
    3437. 

  3437.         } else {
    3438. 

  3438.           FS.symlink('/dev/tty', '/dev/stdout');
    3439. 

  3439.         }
    3440. 

  3440.         if (Module['stderr']) {
    3441. 

  3441.           FS.createDevice('/dev', 'stderr', null, Module['stderr']);
    3442. 

  3442.         } else {
    3443. 

  3443.           FS.symlink('/dev/tty1', '/dev/stderr');
    3444. 

  3444.         }
    3445. 

  3445. 

  3446.         // open default streams for the stdin, stdout and stderr devices
    3447. 

  3447.         var stdin = FS.open('/dev/stdin', 'r');
    3448. 

  3448.         HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
    3449. 

  3449.         assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
    3450. 

  3450. 

  3451.         var stdout = FS.open('/dev/stdout', 'w');
    3452. 

  3452.         HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
    3453. 

  3453.         assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
    3454. 

  3454. 

  3455.         var stderr = FS.open('/dev/stderr', 'w');
    3456. 

  3456.         HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
    3457. 

  3457.         assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
    3458. 

  3458.       },ensureErrnoError:function () {
    3459. 

  3459.         if (FS.ErrnoError) return;
    3460. 

  3460.         FS.ErrnoError = function ErrnoError(errno) {
    3461. 

  3461.           this.errno = errno;
    3462. 

  3462.           for (var key in ERRNO_CODES) {
    3463. 

  3463.             if (ERRNO_CODES[key] === errno) {
    3464. 

  3464.               this.code = key;
    3465. 

  3465.               break;
    3466. 

  3466.             }
    3467. 

  3467.           }
    3468. 

  3468.           this.message = ERRNO_MESSAGES[errno];
    3469. 

  3469.         };
    3470. 

  3470.         FS.ErrnoError.prototype = new Error();
    3471. 

  3471.         FS.ErrnoError.prototype.constructor = FS.ErrnoError;
    3472. 

  3472.         // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
    3473. 

  3473.         [ERRNO_CODES.ENOENT].forEach(function(code) {
    3474. 

  3474.           FS.genericErrors[code] = new FS.ErrnoError(code);
    3475. 

  3475.           FS.genericErrors[code].stack = '<generic error, no stack>';
    3476. 

  3476.         });
    3477. 

  3477.       },staticInit:function () {
    3478. 

  3478.         FS.ensureErrnoError();
    3479. 

  3479. 

  3480.         FS.nameTable = new Array(4096);
    3481. 

  3481. 

  3482.         FS.mount(MEMFS, {}, '/');
    3483. 

  3483. 

  3484.         FS.createDefaultDirectories();
    3485. 

  3485.         FS.createDefaultDevices();
    3486. 

  3486.       },init:function (input, output, error) {
    3487. 

  3487.         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)');
    3488. 

  3488.         FS.init.initialized = true;
    3489. 

  3489. 

  3490.         FS.ensureErrnoError();
    3491. 

  3491. 

  3492.         // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
    3493. 

  3493.         Module['stdin'] = input || Module['stdin'];
    3494. 

  3494.         Module['stdout'] = output || Module['stdout'];
    3495. 

  3495.         Module['stderr'] = error || Module['stderr'];
    3496. 

  3496. 

  3497.         FS.createStandardStreams();
    3498. 

  3498.       },quit:function () {
    3499. 

  3499.         FS.init.initialized = false;
    3500. 

  3500.         for (var i = 0; i < FS.streams.length; i++) {
    3501. 

  3501.           var stream = FS.streams[i];
    3502. 

  3502.           if (!stream) {
    3503. 

  3503.             continue;
    3504. 

  3504.           }
    3505. 

  3505.           FS.close(stream);
    3506. 

  3506.         }
    3507. 

  3507.       },getMode:function (canRead, canWrite) {
    3508. 

  3508.         var mode = 0;
    3509. 

  3509.         if (canRead) mode |= 292 | 73;
    3510. 

  3510.         if (canWrite) mode |= 146;
    3511. 

  3511.         return mode;
    3512. 

  3512.       },joinPath:function (parts, forceRelative) {
    3513. 

  3513.         var path = PATH.join.apply(null, parts);
    3514. 

  3514.         if (forceRelative && path[0] == '/') path = path.substr(1);
    3515. 

  3515.         return path;
    3516. 

  3516.       },absolutePath:function (relative, base) {
    3517. 

  3517.         return PATH.resolve(base, relative);
    3518. 

  3518.       },standardizePath:function (path) {
    3519. 

  3519.         return PATH.normalize(path);
    3520. 

  3520.       },findObject:function (path, dontResolveLastLink) {
    3521. 

  3521.         var ret = FS.analyzePath(path, dontResolveLastLink);
    3522. 

  3522.         if (ret.exists) {
    3523. 

  3523.           return ret.object;
    3524. 

  3524.         } else {
    3525. 

  3525.           ___setErrNo(ret.error);
    3526. 

  3526.           return null;
    3527. 

  3527.         }
    3528. 

  3528.       },analyzePath:function (path, dontResolveLastLink) {
    3529. 

  3529.         // operate from within the context of the symlink's target
    3530. 

  3530.         try {
    3531. 

  3531.           var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
    3532. 

  3532.           path = lookup.path;
    3533. 

  3533.         } catch (e) {
    3534. 

  3534.         }
    3535. 

  3535.         var ret = {
    3536. 

  3536.           isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
    3537. 

  3537.           parentExists: false, parentPath: null, parentObject: null
    3538. 

  3538.         };
    3539. 

  3539.         try {
    3540. 

  3540.           var lookup = FS.lookupPath(path, { parent: true });
    3541. 

  3541.           ret.parentExists = true;
    3542. 

  3542.           ret.parentPath = lookup.path;
    3543. 

  3543.           ret.parentObject = lookup.node;
    3544. 

  3544.           ret.name = PATH.basename(path);
    3545. 

  3545.           lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
    3546. 

  3546.           ret.exists = true;
    3547. 

  3547.           ret.path = lookup.path;
    3548. 

  3548.           ret.object = lookup.node;
    3549. 

  3549.           ret.name = lookup.node.name;
    3550. 

  3550.           ret.isRoot = lookup.path === '/';
    3551. 

  3551.         } catch (e) {
    3552. 

  3552.           ret.error = e.errno;
    3553. 

  3553.         };
    3554. 

  3554.         return ret;
    3555. 

  3555.       },createFolder:function (parent, name, canRead, canWrite) {
    3556. 

  3556.         var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
    3557. 

  3557.         var mode = FS.getMode(canRead, canWrite);
    3558. 

  3558.         return FS.mkdir(path, mode);
    3559. 

  3559.       },createPath:function (parent, path, canRead, canWrite) {
    3560. 

  3560.         parent = typeof parent === 'string' ? parent : FS.getPath(parent);
    3561. 

  3561.         var parts = path.split('/').reverse();
    3562. 

  3562.         while (parts.length) {
    3563. 

  3563.           var part = parts.pop();
    3564. 

  3564.           if (!part) continue;
    3565. 

  3565.           var current = PATH.join2(parent, part);
    3566. 

  3566.           try {
    3567. 

  3567.             FS.mkdir(current);
    3568. 

  3568.           } catch (e) {
    3569. 

  3569.             // ignore EEXIST
    3570. 

  3570.           }
    3571. 

  3571.           parent = current;
    3572. 

  3572.         }
    3573. 

  3573.         return current;
    3574. 

  3574.       },createFile:function (parent, name, properties, canRead, canWrite) {
    3575. 

  3575.         var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
    3576. 

  3576.         var mode = FS.getMode(canRead, canWrite);
    3577. 

  3577.         return FS.create(path, mode);
    3578. 

  3578.       },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
    3579. 

  3579.         var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
    3580. 

  3580.         var mode = FS.getMode(canRead, canWrite);
    3581. 

  3581.         var node = FS.create(path, mode);
    3582. 

  3582.         if (data) {
    3583. 

  3583.           if (typeof data === 'string') {
    3584. 

  3584.             var arr = new Array(data.length);
    3585. 

  3585.             for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
    3586. 

  3586.             data = arr;
    3587. 

  3587.           }
    3588. 

  3588.           // make sure we can write to the file
    3589. 

  3589.           FS.chmod(node, mode | 146);
    3590. 

  3590.           var stream = FS.open(node, 'w');
    3591. 

  3591.           FS.write(stream, data, 0, data.length, 0, canOwn);
    3592. 

  3592.           FS.close(stream);
    3593. 

  3593.           FS.chmod(node, mode);
    3594. 

  3594.         }
    3595. 

  3595.         return node;
    3596. 

  3596.       },createDevice:function (parent, name, input, output) {
    3597. 

  3597.         var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
    3598. 

  3598.         var mode = FS.getMode(!!input, !!output);
    3599. 

  3599.         if (!FS.createDevice.major) FS.createDevice.major = 64;
    3600. 

  3600.         var dev = FS.makedev(FS.createDevice.major++, 0);
    3601. 

  3601.         // Create a fake device that a set of stream ops to emulate
    3602. 

  3602.         // the old behavior.
    3603. 

  3603.         FS.registerDevice(dev, {
    3604. 

  3604.           open: function(stream) {
    3605. 

  3605.             stream.seekable = false;
    3606. 

  3606.           },
    3607. 

  3607.           close: function(stream) {
    3608. 

  3608.             // flush any pending line data
    3609. 

  3609.             if (output && output.buffer && output.buffer.length) {
    3610. 

  3610.               output(10);
    3611. 

  3611.             }
    3612. 

  3612.           },
    3613. 

  3613.           read: function(stream, buffer, offset, length, pos /* ignored */) {
    3614. 

  3614.             var bytesRead = 0;
    3615. 

  3615.             for (var i = 0; i < length; i++) {
    3616. 

  3616.               var result;
    3617. 

  3617.               try {
    3618. 

  3618.                 result = input();
    3619. 

  3619.               } catch (e) {
    3620. 

  3620.                 throw new FS.ErrnoError(ERRNO_CODES.EIO);
    3621. 

  3621.               }
    3622. 

  3622.               if (result === undefined && bytesRead === 0) {
    3623. 

  3623.                 throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
    3624. 

  3624.               }
    3625. 

  3625.               if (result === null || result === undefined) break;
    3626. 

  3626.               bytesRead++;
    3627. 

  3627.               buffer[offset+i] = result;
    3628. 

  3628.             }
    3629. 

  3629.             if (bytesRead) {
    3630. 

  3630.               stream.node.timestamp = Date.now();
    3631. 

  3631.             }
    3632. 

  3632.             return bytesRead;
    3633. 

  3633.           },
    3634. 

  3634.           write: function(stream, buffer, offset, length, pos) {
    3635. 

  3635.             for (var i = 0; i < length; i++) {
    3636. 

  3636.               try {
    3637. 

  3637.                 output(buffer[offset+i]);
    3638. 

  3638.               } catch (e) {
    3639. 

  3639.                 throw new FS.ErrnoError(ERRNO_CODES.EIO);
    3640. 

  3640.               }
    3641. 

  3641.             }
    3642. 

  3642.             if (length) {
    3643. 

  3643.               stream.node.timestamp = Date.now();
    3644. 

  3644.             }
    3645. 

  3645.             return i;
    3646. 

  3646.           }
    3647. 

  3647.         });
    3648. 

  3648.         return FS.mkdev(path, mode, dev);
    3649. 

  3649.       },createLink:function (parent, name, target, canRead, canWrite) {
    3650. 

  3650.         var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
    3651. 

  3651.         return FS.symlink(target, path);
    3652. 

  3652.       },forceLoadFile:function (obj) {
    3653. 

  3653.         if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
    3654. 

  3654.         var success = true;
    3655. 

  3655.         if (typeof XMLHttpRequest !== 'undefined') {
    3656. 

  3656.           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.");
    3657. 

  3657.         } else if (Module['read']) {
    3658. 

  3658.           // Command-line.
    3659. 

  3659.           try {
    3660. 

  3660.             // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
    3661. 

  3661.             //          read() will try to parse UTF8.
    3662. 

  3662.             obj.contents = intArrayFromString(Module['read'](obj.url), true);
    3663. 

  3663.           } catch (e) {
    3664. 

  3664.             success = false;
    3665. 

  3665.           }
    3666. 

  3666.         } else {
    3667. 

  3667.           throw new Error('Cannot load without read() or XMLHttpRequest.');
    3668. 

  3668.         }
    3669. 

  3669.         if (!success) ___setErrNo(ERRNO_CODES.EIO);
    3670. 

  3670.         return success;
    3671. 

  3671.       },createLazyFile:function (parent, name, url, canRead, canWrite) {
    3672. 

  3672.         // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
    3673. 

  3673.         function LazyUint8Array() {
    3674. 

  3674.           this.lengthKnown = false;
    3675. 

  3675.           this.chunks = []; // Loaded chunks. Index is the chunk number
    3676. 

  3676.         }
    3677. 

  3677.         LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
    3678. 

  3678.           if (idx > this.length-1 || idx < 0) {
    3679. 

  3679.             return undefined;
    3680. 

  3680.           }
    3681. 

  3681.           var chunkOffset = idx % this.chunkSize;
    3682. 

  3682.           var chunkNum = Math.floor(idx / this.chunkSize);
    3683. 

  3683.           return this.getter(chunkNum)[chunkOffset];
    3684. 

  3684.         }
    3685. 

  3685.         LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
    3686. 

  3686.           this.getter = getter;
    3687. 

  3687.         }
    3688. 

  3688.         LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
    3689. 

  3689.             // Find length
    3690. 

  3690.             var xhr = new XMLHttpRequest();
    3691. 

  3691.             xhr.open('HEAD', url, false);
    3692. 

  3692.             xhr.send(null);
    3693. 

  3693.             if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
    3694. 

  3694.             var datalength = Number(xhr.getResponseHeader("Content-length"));
    3695. 

  3695.             var header;
    3696. 

  3696.             var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
    3697. 

  3697.             var chunkSize = 1024*1024; // Chunk size in bytes
    3698. 

  3698. 

  3699.             if (!hasByteServing) chunkSize = datalength;
    3700. 

  3700. 

  3701.             // Function to get a range from the remote URL.
    3702. 

  3702.             var doXHR = (function(from, to) {
    3703. 

  3703.               if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
    3704. 

  3704.               if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
    3705. 

  3705. 

  3706.               // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
    3707. 

  3707.               var xhr = new XMLHttpRequest();
    3708. 

  3708.               xhr.open('GET', url, false);
    3709. 

  3709.               if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
    3710. 

  3710. 

  3711.               // Some hints to the browser that we want binary data.
    3712. 

  3712.               if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
    3713. 

  3713.               if (xhr.overrideMimeType) {
    3714. 

  3714.                 xhr.overrideMimeType('text/plain; charset=x-user-defined');
    3715. 

  3715.               }
    3716. 

  3716. 

  3717.               xhr.send(null);
    3718. 

  3718.               if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
    3719. 

  3719.               if (xhr.response !== undefined) {
    3720. 

  3720.                 return new Uint8Array(xhr.response || []);
    3721. 

  3721.               } else {
    3722. 

  3722.                 return intArrayFromString(xhr.responseText || '', true);
    3723. 

  3723.               }
    3724. 

  3724.             });
    3725. 

  3725.             var lazyArray = this;
    3726. 

  3726.             lazyArray.setDataGetter(function(chunkNum) {
    3727. 

  3727.               var start = chunkNum * chunkSize;
    3728. 

  3728.               var end = (chunkNum+1) * chunkSize - 1; // including this byte
    3729. 

  3729.               end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
    3730. 

  3730.               if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
    3731. 

  3731.                 lazyArray.chunks[chunkNum] = doXHR(start, end);
    3732. 

  3732.               }
    3733. 

  3733.               if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
    3734. 

  3734.               return lazyArray.chunks[chunkNum];
    3735. 

  3735.             });
    3736. 

  3736. 

  3737.             this._length = datalength;
    3738. 

  3738.             this._chunkSize = chunkSize;
    3739. 

  3739.             this.lengthKnown = true;
    3740. 

  3740.         }
    3741. 

  3741.         if (typeof XMLHttpRequest !== 'undefined') {
    3742. 

  3742.           if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
    3743. 

  3743.           var lazyArray = new LazyUint8Array();
    3744. 

  3744.           Object.defineProperty(lazyArray, "length", {
    3745. 

  3745.               get: function() {
    3746. 

  3746.                   if(!this.lengthKnown) {
    3747. 

  3747.                       this.cacheLength();
    3748. 

  3748.                   }
    3749. 

  3749.                   return this._length;
    3750. 

  3750.               }
    3751. 

  3751.           });
    3752. 

  3752.           Object.defineProperty(lazyArray, "chunkSize", {
    3753. 

  3753.               get: function() {
    3754. 

  3754.                   if(!this.lengthKnown) {
    3755. 

  3755.                       this.cacheLength();
    3756. 

  3756.                   }
    3757. 

  3757.                   return this._chunkSize;
    3758. 

  3758.               }
    3759. 

  3759.           });
    3760. 

  3760. 

  3761.           var properties = { isDevice: false, contents: lazyArray };
    3762. 

  3762.         } else {
    3763. 

  3763.           var properties = { isDevice: false, url: url };
    3764. 

  3764.         }
    3765. 

  3765. 

  3766.         var node = FS.createFile(parent, name, properties, canRead, canWrite);
    3767. 

  3767.         // This is a total hack, but I want to get this lazy file code out of the
    3768. 

  3768.         // core of MEMFS. If we want to keep this lazy file concept I feel it should
    3769. 

  3769.         // be its own thin LAZYFS proxying calls to MEMFS.
    3770. 

  3770.         if (properties.contents) {
    3771. 

  3771.           node.contents = properties.contents;
    3772. 

  3772.         } else if (properties.url) {
    3773. 

  3773.           node.contents = null;
    3774. 

  3774.           node.url = properties.url;
    3775. 

  3775.         }
    3776. 

  3776.         // override each stream op with one that tries to force load the lazy file first
    3777. 

  3777.         var stream_ops = {};
    3778. 

  3778.         var keys = Object.keys(node.stream_ops);
    3779. 

  3779.         keys.forEach(function(key) {
    3780. 

  3780.           var fn = node.stream_ops[key];
    3781. 

  3781.           stream_ops[key] = function forceLoadLazyFile() {
    3782. 

  3782.             if (!FS.forceLoadFile(node)) {
    3783. 

  3783.               throw new FS.ErrnoError(ERRNO_CODES.EIO);
    3784. 

  3784.             }
    3785. 

  3785.             return fn.apply(null, arguments);
    3786. 

  3786.           };
    3787. 

  3787.         });
    3788. 

  3788.         // use a custom read function
    3789. 

  3789.         stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
    3790. 

  3790.           if (!FS.forceLoadFile(node)) {
    3791. 

  3791.             throw new FS.ErrnoError(ERRNO_CODES.EIO);
    3792. 

  3792.           }
    3793. 

  3793.           var contents = stream.node.contents;
    3794. 

  3794.           if (position >= contents.length)
    3795. 

  3795.             return 0;
    3796. 

  3796.           var size = Math.min(contents.length - position, length);
    3797. 

  3797.           assert(size >= 0);
    3798. 

  3798.           if (contents.slice) { // normal array
    3799. 

  3799.             for (var i = 0; i < size; i++) {
    3800. 

  3800.               buffer[offset + i] = contents[position + i];
    3801. 

  3801.             }
    3802. 

  3802.           } else {
    3803. 

  3803.             for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
    3804. 

  3804.               buffer[offset + i] = contents.get(position + i);
    3805. 

  3805.             }
    3806. 

  3806.           }
    3807. 

  3807.           return size;
    3808. 

  3808.         };
    3809. 

  3809.         node.stream_ops = stream_ops;
    3810. 

  3810.         return node;
    3811. 

  3811.       },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
    3812. 

  3812.         Browser.init();
    3813. 

  3813.         // TODO we should allow people to just pass in a complete filename instead
    3814. 

  3814.         // of parent and name being that we just join them anyways
    3815. 

  3815.         var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
    3816. 

  3816.         function processData(byteArray) {
    3817. 

  3817.           function finish(byteArray) {
    3818. 

  3818.             if (!dontCreateFile) {
    3819. 

  3819.               FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
    3820. 

  3820.             }
    3821. 

  3821.             if (onload) onload();
    3822. 

  3822.             removeRunDependency('cp ' + fullname);
    3823. 

  3823.           }
    3824. 

  3824.           var handled = false;
    3825. 

  3825.           Module['preloadPlugins'].forEach(function(plugin) {
    3826. 

  3826.             if (handled) return;
    3827. 

  3827.             if (plugin['canHandle'](fullname)) {
    3828. 

  3828.               plugin['handle'](byteArray, fullname, finish, function() {
    3829. 

  3829.                 if (onerror) onerror();
    3830. 

  3830.                 removeRunDependency('cp ' + fullname);
    3831. 

  3831.               });
    3832. 

  3832.               handled = true;
    3833. 

  3833.             }
    3834. 

  3834.           });
    3835. 

  3835.           if (!handled) finish(byteArray);
    3836. 

  3836.         }
    3837. 

  3837.         addRunDependency('cp ' + fullname);
    3838. 

  3838.         if (typeof url == 'string') {
    3839. 

  3839.           Browser.asyncLoad(url, function(byteArray) {
    3840. 

  3840.             processData(byteArray);
    3841. 

  3841.           }, onerror);
    3842. 

  3842.         } else {
    3843. 

  3843.           processData(url);
    3844. 

  3844.         }
    3845. 

  3845.       },indexedDB:function () {
    3846. 

  3846.         return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
    3847. 

  3847.       },DB_NAME:function () {
    3848. 

  3848.         return 'EM_FS_' + window.location.pathname;
    3849. 

  3849.       },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
    3850. 

  3850.         onload = onload || function(){};
    3851. 

  3851.         onerror = onerror || function(){};
    3852. 

  3852.         var indexedDB = FS.indexedDB();
    3853. 

  3853.         try {
    3854. 

  3854.           var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
    3855. 

  3855.         } catch (e) {
    3856. 

  3856.           return onerror(e);
    3857. 

  3857.         }
    3858. 

  3858.         openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
    3859. 

  3859.           console.log('creating db');
    3860. 

  3860.           var db = openRequest.result;
    3861. 

  3861.           db.createObjectStore(FS.DB_STORE_NAME);
    3862. 

  3862.         };
    3863. 

  3863.         openRequest.onsuccess = function openRequest_onsuccess() {
    3864. 

  3864.           var db = openRequest.result;
    3865. 

  3865.           var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
    3866. 

  3866.           var files = transaction.objectStore(FS.DB_STORE_NAME);
    3867. 

  3867.           var ok = 0, fail = 0, total = paths.length;
    3868. 

  3868.           function finish() {
    3869. 

  3869.             if (fail == 0) onload(); else onerror();
    3870. 

  3870.           }
    3871. 

  3871.           paths.forEach(function(path) {
    3872. 

  3872.             var putRequest = files.put(FS.analyzePath(path).object.contents, path);
    3873. 

  3873.             putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
    3874. 

  3874.             putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
    3875. 

  3875.           });
    3876. 

  3876.           transaction.onerror = onerror;
    3877. 

  3877.         };
    3878. 

  3878.         openRequest.onerror = onerror;
    3879. 

  3879.       },loadFilesFromDB:function (paths, onload, onerror) {
    3880. 

  3880.         onload = onload || function(){};
    3881. 

  3881.         onerror = onerror || function(){};
    3882. 

  3882.         var indexedDB = FS.indexedDB();
    3883. 

  3883.         try {
    3884. 

  3884.           var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
    3885. 

  3885.         } catch (e) {
    3886. 

  3886.           return onerror(e);
    3887. 

  3887.         }
    3888. 

  3888.         openRequest.onupgradeneeded = onerror; // no database to load from
    3889. 

  3889.         openRequest.onsuccess = function openRequest_onsuccess() {
    3890. 

  3890.           var db = openRequest.result;
    3891. 

  3891.           try {
    3892. 

  3892.             var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
    3893. 

  3893.           } catch(e) {
    3894. 

  3894.             onerror(e);
    3895. 

  3895.             return;
    3896. 

  3896.           }
    3897. 

  3897.           var files = transaction.objectStore(FS.DB_STORE_NAME);
    3898. 

  3898.           var ok = 0, fail = 0, total = paths.length;
    3899. 

  3899.           function finish() {
    3900. 

  3900.             if (fail == 0) onload(); else onerror();
    3901. 

  3901.           }
    3902. 

  3902.           paths.forEach(function(path) {
    3903. 

  3903.             var getRequest = files.get(path);
    3904. 

  3904.             getRequest.onsuccess = function getRequest_onsuccess() {
    3905. 

  3905.               if (FS.analyzePath(path).exists) {
    3906. 

  3906.                 FS.unlink(path);
    3907. 

  3907.               }
    3908. 

  3908.               FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
    3909. 

  3909.               ok++;
    3910. 

  3910.               if (ok + fail == total) finish();
    3911. 

  3911.             };
    3912. 

  3912.             getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
    3913. 

  3913.           });
    3914. 

  3914.           transaction.onerror = onerror;
    3915. 

  3915.         };
    3916. 

  3916.         openRequest.onerror = onerror;
    3917. 

  3917.       }};
    3918. 

  3918. 

  3919.   function _lseek(fildes, offset, whence) {
    3920. 

  3920.       // off_t lseek(int fildes, off_t offset, int whence);
    3921. 

  3921.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/lseek.html
    3922. 

  3922.       var stream = FS.getStream(fildes);
    3923. 

  3923.       if (!stream) {
    3924. 

  3924.         ___setErrNo(ERRNO_CODES.EBADF);
    3925. 

  3925.         return -1;
    3926. 

  3926.       }
    3927. 

  3927.       try {
    3928. 

  3928.         return FS.llseek(stream, offset, whence);
    3929. 

  3929.       } catch (e) {
    3930. 

  3930.         FS.handleFSError(e);
    3931. 

  3931.         return -1;
    3932. 

  3932.       }
    3933. 

  3933.     }
    3934. 

  3934. 

  3935.   function _fileno(stream) {
    3936. 

  3936.       // int fileno(FILE *stream);
    3937. 

  3937.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
    3938. 

  3938.       stream = FS.getStreamFromPtr(stream);
    3939. 

  3939.       if (!stream) return -1;
    3940. 

  3940.       return stream.fd;
    3941. 

  3941.     }function _fseek(stream, offset, whence) {
    3942. 

  3942.       // int fseek(FILE *stream, long offset, int whence);
    3943. 

  3943.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fseek.html
    3944. 

  3944.       var fd = _fileno(stream);
    3945. 

  3945.       var ret = _lseek(fd, offset, whence);
    3946. 

  3946.       if (ret == -1) {
    3947. 

  3947.         return -1;
    3948. 

  3948.       }
    3949. 

  3949.       stream = FS.getStreamFromPtr(stream);
    3950. 

  3950.       stream.eof = false;
    3951. 

  3951.       return 0;
    3952. 

  3952.     }
    3953. 

  3953. 

  3954. 

  3955.   Module["_i64Subtract"] = _i64Subtract;
    3956. 

  3956. 

  3957. 

  3958.   Module["_i64Add"] = _i64Add;
    3959. 

  3959. 

  3960.   function _setlocale(category, locale) {
    3961. 

  3961.       if (!_setlocale.ret) _setlocale.ret = allocate([0], 'i8', ALLOC_NORMAL);
    3962. 

  3962.       return _setlocale.ret;
    3963. 

  3963.     }
    3964. 

  3964. 

  3965. 

  3966.   function _close(fildes) {
    3967. 

  3967.       // int close(int fildes);
    3968. 

  3968.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/close.html
    3969. 

  3969.       var stream = FS.getStream(fildes);
    3970. 

  3970.       if (!stream) {
    3971. 

  3971.         ___setErrNo(ERRNO_CODES.EBADF);
    3972. 

  3972.         return -1;
    3973. 

  3973.       }
    3974. 

  3974.       try {
    3975. 

  3975.         FS.close(stream);
    3976. 

  3976.         return 0;
    3977. 

  3977.       } catch (e) {
    3978. 

  3978.         FS.handleFSError(e);
    3979. 

  3979.         return -1;
    3980. 

  3980.       }
    3981. 

  3981.     }
    3982. 

  3982. 

  3983.   function _fsync(fildes) {
    3984. 

  3984.       // int fsync(int fildes);
    3985. 

  3985.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fsync.html
    3986. 

  3986.       var stream = FS.getStream(fildes);
    3987. 

  3987.       if (stream) {
    3988. 

  3988.         // We write directly to the file system, so there's nothing to do here.
    3989. 

  3989.         return 0;
    3990. 

  3990.       } else {
    3991. 

  3991.         ___setErrNo(ERRNO_CODES.EBADF);
    3992. 

  3992.         return -1;
    3993. 

  3993.       }
    3994. 

  3994.     }function _fclose(stream) {
    3995. 

  3995.       // int fclose(FILE *stream);
    3996. 

  3996.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fclose.html
    3997. 

  3997.       var fd = _fileno(stream);
    3998. 

  3998.       _fsync(fd);
    3999. 

  3999.       return _close(fd);
    4000. 

  4000.     }
    4001. 

  4001. 

  4002. 

  4003. 

  4004. 

  4005. 

  4006.   function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
    4007. 

  4007.         return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
    4008. 

  4008.       },createSocket:function (family, type, protocol) {
    4009. 

  4009.         var streaming = type == 1;
    4010. 

  4010.         if (protocol) {
    4011. 

  4011.           assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
    4012. 

  4012.         }
    4013. 

  4013. 

  4014.         // create our internal socket structure
    4015. 

  4015.         var sock = {
    4016. 

  4016.           family: family,
    4017. 

  4017.           type: type,
    4018. 

  4018.           protocol: protocol,
    4019. 

  4019.           server: null,
    4020. 

  4020.           peers: {},
    4021. 

  4021.           pending: [],
    4022. 

  4022.           recv_queue: [],
    4023. 

  4023.           sock_ops: SOCKFS.websocket_sock_ops
    4024. 

  4024.         };
    4025. 

  4025. 

  4026.         // create the filesystem node to store the socket structure
    4027. 

  4027.         var name = SOCKFS.nextname();
    4028. 

  4028.         var node = FS.createNode(SOCKFS.root, name, 49152, 0);
    4029. 

  4029.         node.sock = sock;
    4030. 

  4030. 

  4031.         // and the wrapping stream that enables library functions such
    4032. 

  4032.         // as read and write to indirectly interact with the socket
    4033. 

  4033.         var stream = FS.createStream({
    4034. 

  4034.           path: name,
    4035. 

  4035.           node: node,
    4036. 

  4036.           flags: FS.modeStringToFlags('r+'),
    4037. 

  4037.           seekable: false,
    4038. 

  4038.           stream_ops: SOCKFS.stream_ops
    4039. 

  4039.         });
    4040. 

  4040. 

  4041.         // map the new stream to the socket structure (sockets have a 1:1
    4042. 

  4042.         // relationship with a stream)
    4043. 

  4043.         sock.stream = stream;
    4044. 

  4044. 

  4045.         return sock;
    4046. 

  4046.       },getSocket:function (fd) {
    4047. 

  4047.         var stream = FS.getStream(fd);
    4048. 

  4048.         if (!stream || !FS.isSocket(stream.node.mode)) {
    4049. 

  4049.           return null;
    4050. 

  4050.         }
    4051. 

  4051.         return stream.node.sock;
    4052. 

  4052.       },stream_ops:{poll:function (stream) {
    4053. 

  4053.           var sock = stream.node.sock;
    4054. 

  4054.           return sock.sock_ops.poll(sock);
    4055. 

  4055.         },ioctl:function (stream, request, varargs) {
    4056. 

  4056.           var sock = stream.node.sock;
    4057. 

  4057.           return sock.sock_ops.ioctl(sock, request, varargs);
    4058. 

  4058.         },read:function (stream, buffer, offset, length, position /* ignored */) {
    4059. 

  4059.           var sock = stream.node.sock;
    4060. 

  4060.           var msg = sock.sock_ops.recvmsg(sock, length);
    4061. 

  4061.           if (!msg) {
    4062. 

  4062.             // socket is closed
    4063. 

  4063.             return 0;
    4064. 

  4064.           }
    4065. 

  4065.           buffer.set(msg.buffer, offset);
    4066. 

  4066.           return msg.buffer.length;
    4067. 

  4067.         },write:function (stream, buffer, offset, length, position /* ignored */) {
    4068. 

  4068.           var sock = stream.node.sock;
    4069. 

  4069.           return sock.sock_ops.sendmsg(sock, buffer, offset, length);
    4070. 

  4070.         },close:function (stream) {
    4071. 

  4071.           var sock = stream.node.sock;
    4072. 

  4072.           sock.sock_ops.close(sock);
    4073. 

  4073.         }},nextname:function () {
    4074. 

  4074.         if (!SOCKFS.nextname.current) {
    4075. 

  4075.           SOCKFS.nextname.current = 0;
    4076. 

  4076.         }
    4077. 

  4077.         return 'socket[' + (SOCKFS.nextname.current++) + ']';
    4078. 

  4078.       },websocket_sock_ops:{createPeer:function (sock, addr, port) {
    4079. 

  4079.           var ws;
    4080. 

  4080. 

  4081.           if (typeof addr === 'object') {
    4082. 

  4082.             ws = addr;
    4083. 

  4083.             addr = null;
    4084. 

  4084.             port = null;
    4085. 

  4085.           }
    4086. 

  4086. 

  4087.           if (ws) {
    4088. 

  4088.             // for sockets that've already connected (e.g. we're the server)
    4089. 

  4089.             // we can inspect the _socket property for the address
    4090. 

  4090.             if (ws._socket) {
    4091. 

  4091.               addr = ws._socket.remoteAddress;
    4092. 

  4092.               port = ws._socket.remotePort;
    4093. 

  4093.             }
    4094. 

  4094.             // if we're just now initializing a connection to the remote,
    4095. 

  4095.             // inspect the url property
    4096. 

  4096.             else {
    4097. 

  4097.               var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
    4098. 

  4098.               if (!result) {
    4099. 

  4099.                 throw new Error('WebSocket URL must be in the format ws(s)://address:port');
    4100. 

  4100.               }
    4101. 

  4101.               addr = result[1];
    4102. 

  4102.               port = parseInt(result[2], 10);
    4103. 

  4103.             }
    4104. 

  4104.           } else {
    4105. 

  4105.             // create the actual websocket object and connect
    4106. 

  4106.             try {
    4107. 

  4107.               // runtimeConfig gets set to true if WebSocket runtime configuration is available.
    4108. 

  4108.               var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
    4109. 

  4109. 

  4110.               // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
    4111. 

  4111.               // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
    4112. 

  4112.               var url = 'ws:#'.replace('#', '//');
    4113. 

  4113. 

  4114.               if (runtimeConfig) {
    4115. 

  4115.                 if ('string' === typeof Module['websocket']['url']) {
    4116. 

  4116.                   url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
    4117. 

  4117.                 }
    4118. 

  4118.               }
    4119. 

  4119. 

  4120.               if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
    4121. 

  4121.                 url = url + addr + ':' + port;
    4122. 

  4122.               }
    4123. 

  4123. 

  4124.               // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
    4125. 

  4125.               var subProtocols = 'binary'; // The default value is 'binary'
    4126. 

  4126. 

  4127.               if (runtimeConfig) {
    4128. 

  4128.                 if ('string' === typeof Module['websocket']['subprotocol']) {
    4129. 

  4129.                   subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
    4130. 

  4130.                 }
    4131. 

  4131.               }
    4132. 

  4132. 

  4133.               // The regex trims the string (removes spaces at the beginning and end, then splits the string by
    4134. 

  4134.               // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
    4135. 

  4135.               subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
    4136. 

  4136. 

  4137.               // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
    4138. 

  4138.               var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
    4139. 

  4139. 

  4140.               // If node we use the ws library.
    4141. 

  4141.               var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
    4142. 

  4142.               ws = new WebSocket(url, opts);
    4143. 

  4143.               ws.binaryType = 'arraybuffer';
    4144. 

  4144.             } catch (e) {
    4145. 

  4145.               throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
    4146. 

  4146.             }
    4147. 

  4147.           }
    4148. 

  4148. 

  4149. 

  4150.           var peer = {
    4151. 

  4151.             addr: addr,
    4152. 

  4152.             port: port,
    4153. 

  4153.             socket: ws,
    4154. 

  4154.             dgram_send_queue: []
    4155. 

  4155.           };
    4156. 

  4156. 

  4157.           SOCKFS.websocket_sock_ops.addPeer(sock, peer);
    4158. 

  4158.           SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
    4159. 

  4159. 

  4160.           // if this is a bound dgram socket, send the port number first to allow
    4161. 

  4161.           // us to override the ephemeral port reported to us by remotePort on the
    4162. 

  4162.           // remote end.
    4163. 

  4163.           if (sock.type === 2 && typeof sock.sport !== 'undefined') {
    4164. 

  4164.             peer.dgram_send_queue.push(new Uint8Array([
    4165. 

  4165.                 255, 255, 255, 255,
    4166. 

  4166.                 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
    4167. 

  4167.                 ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
    4168. 

  4168.             ]));
    4169. 

  4169.           }
    4170. 

  4170. 

  4171.           return peer;
    4172. 

  4172.         },getPeer:function (sock, addr, port) {
    4173. 

  4173.           return sock.peers[addr + ':' + port];
    4174. 

  4174.         },addPeer:function (sock, peer) {
    4175. 

  4175.           sock.peers[peer.addr + ':' + peer.port] = peer;
    4176. 

  4176.         },removePeer:function (sock, peer) {
    4177. 

  4177.           delete sock.peers[peer.addr + ':' + peer.port];
    4178. 

  4178.         },handlePeerEvents:function (sock, peer) {
    4179. 

  4179.           var first = true;
    4180. 

  4180. 

  4181.           var handleOpen = function () {
    4182. 

  4182.             try {
    4183. 

  4183.               var queued = peer.dgram_send_queue.shift();
    4184. 

  4184.               while (queued) {
    4185. 

  4185.                 peer.socket.send(queued);
    4186. 

  4186.                 queued = peer.dgram_send_queue.shift();
    4187. 

  4187.               }
    4188. 

  4188.             } catch (e) {
    4189. 

  4189.               // not much we can do here in the way of proper error handling as we've already
    4190. 

  4190.               // lied and said this data was sent. shut it down.
    4191. 

  4191.               peer.socket.close();
    4192. 

  4192.             }
    4193. 

  4193.           };
    4194. 

  4194. 

  4195.           function handleMessage(data) {
    4196. 

  4196.             assert(typeof data !== 'string' && data.byteLength !== undefined);  // must receive an ArrayBuffer
    4197. 

  4197.             data = new Uint8Array(data);  // make a typed array view on the array buffer
    4198. 

  4198. 

  4199. 

  4200.             // if this is the port message, override the peer's port with it
    4201. 

  4201.             var wasfirst = first;
    4202. 

  4202.             first = false;
    4203. 

  4203.             if (wasfirst &&
    4204. 

  4204.                 data.length === 10 &&
    4205. 

  4205.                 data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
    4206. 

  4206.                 data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
    4207. 

  4207.               // update the peer's port and it's key in the peer map
    4208. 

  4208.               var newport = ((data[8] << 8) | data[9]);
    4209. 

  4209.               SOCKFS.websocket_sock_ops.removePeer(sock, peer);
    4210. 

  4210.               peer.port = newport;
    4211. 

  4211.               SOCKFS.websocket_sock_ops.addPeer(sock, peer);
    4212. 

  4212.               return;
    4213. 

  4213.             }
    4214. 

  4214. 

  4215.             sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
    4216. 

  4216.           };
    4217. 

  4217. 

  4218.           if (ENVIRONMENT_IS_NODE) {
    4219. 

  4219.             peer.socket.on('open', handleOpen);
    4220. 

  4220.             peer.socket.on('message', function(data, flags) {
    4221. 

  4221.               if (!flags.binary) {
    4222. 

  4222.                 return;
    4223. 

  4223.               }
    4224. 

  4224.               handleMessage((new Uint8Array(data)).buffer);  // copy from node Buffer -> ArrayBuffer
    4225. 

  4225.             });
    4226. 

  4226.             peer.socket.on('error', function() {
    4227. 

  4227.               // don't throw
    4228. 

  4228.             });
    4229. 

  4229.           } else {
    4230. 

  4230.             peer.socket.onopen = handleOpen;
    4231. 

  4231.             peer.socket.onmessage = function peer_socket_onmessage(event) {
    4232. 

  4232.               handleMessage(event.data);
    4233. 

  4233.             };
    4234. 

  4234.           }
    4235. 

  4235.         },poll:function (sock) {
    4236. 

  4236.           if (sock.type === 1 && sock.server) {
    4237. 

  4237.             // listen sockets should only say they're available for reading
    4238. 

  4238.             // if there are pending clients.
    4239. 

  4239.             return sock.pending.length ? (64 | 1) : 0;
    4240. 

  4240.           }
    4241. 

  4241. 

  4242.           var mask = 0;
    4243. 

  4243.           var dest = sock.type === 1 ?  // we only care about the socket state for connection-based sockets
    4244. 

  4244.             SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
    4245. 

  4245.             null;
    4246. 

  4246. 

  4247.           if (sock.recv_queue.length ||
    4248. 

  4248.               !dest ||  // connection-less sockets are always ready to read
    4249. 

  4249.               (dest && dest.socket.readyState === dest.socket.CLOSING) ||
    4250. 

  4250.               (dest && dest.socket.readyState === dest.socket.CLOSED)) {  // let recv return 0 once closed
    4251. 

  4251.             mask |= (64 | 1);
    4252. 

  4252.           }
    4253. 

  4253. 

  4254.           if (!dest ||  // connection-less sockets are always ready to write
    4255. 

  4255.               (dest && dest.socket.readyState === dest.socket.OPEN)) {
    4256. 

  4256.             mask |= 4;
    4257. 

  4257.           }
    4258. 

  4258. 

  4259.           if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
    4260. 

  4260.               (dest && dest.socket.readyState === dest.socket.CLOSED)) {
    4261. 

  4261.             mask |= 16;
    4262. 

  4262.           }
    4263. 

  4263. 

  4264.           return mask;
    4265. 

  4265.         },ioctl:function (sock, request, arg) {
    4266. 

  4266.           switch (request) {
    4267. 

  4267.             case 21531:
    4268. 

  4268.               var bytes = 0;
    4269. 

  4269.               if (sock.recv_queue.length) {
    4270. 

  4270.                 bytes = sock.recv_queue[0].data.length;
    4271. 

  4271.               }
    4272. 

  4272.               HEAP32[((arg)>>2)]=bytes;
    4273. 

  4273.               return 0;
    4274. 

  4274.             default:
    4275. 

  4275.               return ERRNO_CODES.EINVAL;
    4276. 

  4276.           }
    4277. 

  4277.         },close:function (sock) {
    4278. 

  4278.           // if we've spawned a listen server, close it
    4279. 

  4279.           if (sock.server) {
    4280. 

  4280.             try {
    4281. 

  4281.               sock.server.close();
    4282. 

  4282.             } catch (e) {
    4283. 

  4283.             }
    4284. 

  4284.             sock.server = null;
    4285. 

  4285.           }
    4286. 

  4286.           // close any peer connections
    4287. 

  4287.           var peers = Object.keys(sock.peers);
    4288. 

  4288.           for (var i = 0; i < peers.length; i++) {
    4289. 

  4289.             var peer = sock.peers[peers[i]];
    4290. 

  4290.             try {
    4291. 

  4291.               peer.socket.close();
    4292. 

  4292.             } catch (e) {
    4293. 

  4293.             }
    4294. 

  4294.             SOCKFS.websocket_sock_ops.removePeer(sock, peer);
    4295. 

  4295.           }
    4296. 

  4296.           return 0;
    4297. 

  4297.         },bind:function (sock, addr, port) {
    4298. 

  4298.           if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
    4299. 

  4299.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);  // already bound
    4300. 

  4300.           }
    4301. 

  4301.           sock.saddr = addr;
    4302. 

  4302.           sock.sport = port || _mkport();
    4303. 

  4303.           // in order to emulate dgram sockets, we need to launch a listen server when
    4304. 

  4304.           // binding on a connection-less socket
    4305. 

  4305.           // note: this is only required on the server side
    4306. 

  4306.           if (sock.type === 2) {
    4307. 

  4307.             // close the existing server if it exists
    4308. 

  4308.             if (sock.server) {
    4309. 

  4309.               sock.server.close();
    4310. 

  4310.               sock.server = null;
    4311. 

  4311.             }
    4312. 

  4312.             // swallow error operation not supported error that occurs when binding in the
    4313. 

  4313.             // browser where this isn't supported
    4314. 

  4314.             try {
    4315. 

  4315.               sock.sock_ops.listen(sock, 0);
    4316. 

  4316.             } catch (e) {
    4317. 

  4317.               if (!(e instanceof FS.ErrnoError)) throw e;
    4318. 

  4318.               if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
    4319. 

  4319.             }
    4320. 

  4320.           }
    4321. 

  4321.         },connect:function (sock, addr, port) {
    4322. 

  4322.           if (sock.server) {
    4323. 

  4323.             throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
    4324. 

  4324.           }
    4325. 

  4325. 

  4326.           // TODO autobind
    4327. 

  4327.           // if (!sock.addr && sock.type == 2) {
    4328. 

  4328.           // }
    4329. 

  4329. 

  4330.           // early out if we're already connected / in the middle of connecting
    4331. 

  4331.           if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
    4332. 

  4332.             var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
    4333. 

  4333.             if (dest) {
    4334. 

  4334.               if (dest.socket.readyState === dest.socket.CONNECTING) {
    4335. 

  4335.                 throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
    4336. 

  4336.               } else {
    4337. 

  4337.                 throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
    4338. 

  4338.               }
    4339. 

  4339.             }
    4340. 

  4340.           }
    4341. 

  4341. 

  4342.           // add the socket to our peer list and set our
    4343. 

  4343.           // destination address / port to match
    4344. 

  4344.           var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
    4345. 

  4345.           sock.daddr = peer.addr;
    4346. 

  4346.           sock.dport = peer.port;
    4347. 

  4347. 

  4348.           // always "fail" in non-blocking mode
    4349. 

  4349.           throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
    4350. 

  4350.         },listen:function (sock, backlog) {
    4351. 

  4351.           if (!ENVIRONMENT_IS_NODE) {
    4352. 

  4352.             throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
    4353. 

  4353.           }
    4354. 

  4354.           if (sock.server) {
    4355. 

  4355.              throw new FS.ErrnoError(ERRNO_CODES.EINVAL);  // already listening
    4356. 

  4356.           }
    4357. 

  4357.           var WebSocketServer = require('ws').Server;
    4358. 

  4358.           var host = sock.saddr;
    4359. 

  4359.           sock.server = new WebSocketServer({
    4360. 

  4360.             host: host,
    4361. 

  4361.             port: sock.sport
    4362. 

  4362.             // TODO support backlog
    4363. 

  4363.           });
    4364. 

  4364. 

  4365.           sock.server.on('connection', function(ws) {
    4366. 

  4366.             if (sock.type === 1) {
    4367. 

  4367.               var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
    4368. 

  4368. 

  4369.               // create a peer on the new socket
    4370. 

  4370.               var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
    4371. 

  4371.               newsock.daddr = peer.addr;
    4372. 

  4372.               newsock.dport = peer.port;
    4373. 

  4373. 

  4374.               // push to queue for accept to pick up
    4375. 

  4375.               sock.pending.push(newsock);
    4376. 

  4376.             } else {
    4377. 

  4377.               // create a peer on the listen socket so calling sendto
    4378. 

  4378.               // with the listen socket and an address will resolve
    4379. 

  4379.               // to the correct client
    4380. 

  4380.               SOCKFS.websocket_sock_ops.createPeer(sock, ws);
    4381. 

  4381.             }
    4382. 

  4382.           });
    4383. 

  4383.           sock.server.on('closed', function() {
    4384. 

  4384.             sock.server = null;
    4385. 

  4385.           });
    4386. 

  4386.           sock.server.on('error', function() {
    4387. 

  4387.             // don't throw
    4388. 

  4388.           });
    4389. 

  4389.         },accept:function (listensock) {
    4390. 

  4390.           if (!listensock.server) {
    4391. 

  4391.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    4392. 

  4392.           }
    4393. 

  4393.           var newsock = listensock.pending.shift();
    4394. 

  4394.           newsock.stream.flags = listensock.stream.flags;
    4395. 

  4395.           return newsock;
    4396. 

  4396.         },getname:function (sock, peer) {
    4397. 

  4397.           var addr, port;
    4398. 

  4398.           if (peer) {
    4399. 

  4399.             if (sock.daddr === undefined || sock.dport === undefined) {
    4400. 

  4400.               throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
    4401. 

  4401.             }
    4402. 

  4402.             addr = sock.daddr;
    4403. 

  4403.             port = sock.dport;
    4404. 

  4404.           } else {
    4405. 

  4405.             // TODO saddr and sport will be set for bind()'d UDP sockets, but what
    4406. 

  4406.             // should we be returning for TCP sockets that've been connect()'d?
    4407. 

  4407.             addr = sock.saddr || 0;
    4408. 

  4408.             port = sock.sport || 0;
    4409. 

  4409.           }
    4410. 

  4410.           return { addr: addr, port: port };
    4411. 

  4411.         },sendmsg:function (sock, buffer, offset, length, addr, port) {
    4412. 

  4412.           if (sock.type === 2) {
    4413. 

  4413.             // connection-less sockets will honor the message address,
    4414. 

  4414.             // and otherwise fall back to the bound destination address
    4415. 

  4415.             if (addr === undefined || port === undefined) {
    4416. 

  4416.               addr = sock.daddr;
    4417. 

  4417.               port = sock.dport;
    4418. 

  4418.             }
    4419. 

  4419.             // if there was no address to fall back to, error out
    4420. 

  4420.             if (addr === undefined || port === undefined) {
    4421. 

  4421.               throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
    4422. 

  4422.             }
    4423. 

  4423.           } else {
    4424. 

  4424.             // connection-based sockets will only use the bound
    4425. 

  4425.             addr = sock.daddr;
    4426. 

  4426.             port = sock.dport;
    4427. 

  4427.           }
    4428. 

  4428. 

  4429.           // find the peer for the destination address
    4430. 

  4430.           var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
    4431. 

  4431. 

  4432.           // early out if not connected with a connection-based socket
    4433. 

  4433.           if (sock.type === 1) {
    4434. 

  4434.             if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
    4435. 

  4435.               throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
    4436. 

  4436.             } else if (dest.socket.readyState === dest.socket.CONNECTING) {
    4437. 

  4437.               throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
    4438. 

  4438.             }
    4439. 

  4439.           }
    4440. 

  4440. 

  4441.           // create a copy of the incoming data to send, as the WebSocket API
    4442. 

  4442.           // doesn't work entirely with an ArrayBufferView, it'll just send
    4443. 

  4443.           // the entire underlying buffer
    4444. 

  4444.           var data;
    4445. 

  4445.           if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
    4446. 

  4446.             data = buffer.slice(offset, offset + length);
    4447. 

  4447.           } else {  // ArrayBufferView
    4448. 

  4448.             data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
    4449. 

  4449.           }
    4450. 

  4450. 

  4451.           // if we're emulating a connection-less dgram socket and don't have
    4452. 

  4452.           // a cached connection, queue the buffer to send upon connect and
    4453. 

  4453.           // lie, saying the data was sent now.
    4454. 

  4454.           if (sock.type === 2) {
    4455. 

  4455.             if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
    4456. 

  4456.               // if we're not connected, open a new connection
    4457. 

  4457.               if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
    4458. 

  4458.                 dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
    4459. 

  4459.               }
    4460. 

  4460.               dest.dgram_send_queue.push(data);
    4461. 

  4461.               return length;
    4462. 

  4462.             }
    4463. 

  4463.           }
    4464. 

  4464. 

  4465.           try {
    4466. 

  4466.             // send the actual data
    4467. 

  4467.             dest.socket.send(data);
    4468. 

  4468.             return length;
    4469. 

  4469.           } catch (e) {
    4470. 

  4470.             throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
    4471. 

  4471.           }
    4472. 

  4472.         },recvmsg:function (sock, length) {
    4473. 

  4473.           // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
    4474. 

  4474.           if (sock.type === 1 && sock.server) {
    4475. 

  4475.             // tcp servers should not be recv()'ing on the listen socket
    4476. 

  4476.             throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
    4477. 

  4477.           }
    4478. 

  4478. 

  4479.           var queued = sock.recv_queue.shift();
    4480. 

  4480.           if (!queued) {
    4481. 

  4481.             if (sock.type === 1) {
    4482. 

  4482.               var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
    4483. 

  4483. 

  4484.               if (!dest) {
    4485. 

  4485.                 // if we have a destination address but are not connected, error out
    4486. 

  4486.                 throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
    4487. 

  4487.               }
    4488. 

  4488.               else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
    4489. 

  4489.                 // return null if the socket has closed
    4490. 

  4490.                 return null;
    4491. 

  4491.               }
    4492. 

  4492.               else {
    4493. 

  4493.                 // else, our socket is in a valid state but truly has nothing available
    4494. 

  4494.                 throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
    4495. 

  4495.               }
    4496. 

  4496.             } else {
    4497. 

  4497.               throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
    4498. 

  4498.             }
    4499. 

  4499.           }
    4500. 

  4500. 

  4501.           // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
    4502. 

  4502.           // requeued TCP data it'll be an ArrayBufferView
    4503. 

  4503.           var queuedLength = queued.data.byteLength || queued.data.length;
    4504. 

  4504.           var queuedOffset = queued.data.byteOffset || 0;
    4505. 

  4505.           var queuedBuffer = queued.data.buffer || queued.data;
    4506. 

  4506.           var bytesRead = Math.min(length, queuedLength);
    4507. 

  4507.           var res = {
    4508. 

  4508.             buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
    4509. 

  4509.             addr: queued.addr,
    4510. 

  4510.             port: queued.port
    4511. 

  4511.           };
    4512. 

  4512. 

  4513. 

  4514.           // push back any unread data for TCP connections
    4515. 

  4515.           if (sock.type === 1 && bytesRead < queuedLength) {
    4516. 

  4516.             var bytesRemaining = queuedLength - bytesRead;
    4517. 

  4517.             queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
    4518. 

  4518.             sock.recv_queue.unshift(queued);
    4519. 

  4519.           }
    4520. 

  4520. 

  4521.           return res;
    4522. 

  4522.         }}};function _recv(fd, buf, len, flags) {
    4523. 

  4523.       var sock = SOCKFS.getSocket(fd);
    4524. 

  4524.       if (!sock) {
    4525. 

  4525.         ___setErrNo(ERRNO_CODES.EBADF);
    4526. 

  4526.         return -1;
    4527. 

  4527.       }
    4528. 

  4528.       // TODO honor flags
    4529. 

  4529.       return _read(fd, buf, len);
    4530. 

  4530.     }
    4531. 

  4531. 

  4532.   function _pread(fildes, buf, nbyte, offset) {
    4533. 

  4533.       // ssize_t pread(int fildes, void *buf, size_t nbyte, off_t offset);
    4534. 

  4534.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/read.html
    4535. 

  4535.       var stream = FS.getStream(fildes);
    4536. 

  4536.       if (!stream) {
    4537. 

  4537.         ___setErrNo(ERRNO_CODES.EBADF);
    4538. 

  4538.         return -1;
    4539. 

  4539.       }
    4540. 

  4540.       try {
    4541. 

  4541.         var slab = HEAP8;
    4542. 

  4542.         return FS.read(stream, slab, buf, nbyte, offset);
    4543. 

  4543.       } catch (e) {
    4544. 

  4544.         FS.handleFSError(e);
    4545. 

  4545.         return -1;
    4546. 

  4546.       }
    4547. 

  4547.     }function _read(fildes, buf, nbyte) {
    4548. 

  4548.       // ssize_t read(int fildes, void *buf, size_t nbyte);
    4549. 

  4549.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/read.html
    4550. 

  4550.       var stream = FS.getStream(fildes);
    4551. 

  4551.       if (!stream) {
    4552. 

  4552.         ___setErrNo(ERRNO_CODES.EBADF);
    4553. 

  4553.         return -1;
    4554. 

  4554.       }
    4555. 

  4555. 

  4556. 

  4557.       try {
    4558. 

  4558.         var slab = HEAP8;
    4559. 

  4559.         return FS.read(stream, slab, buf, nbyte);
    4560. 

  4560.       } catch (e) {
    4561. 

  4561.         FS.handleFSError(e);
    4562. 

  4562.         return -1;
    4563. 

  4563.       }
    4564. 

  4564.     }function _fread(ptr, size, nitems, stream) {
    4565. 

  4565.       // size_t fread(void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
    4566. 

  4566.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fread.html
    4567. 

  4567.       var bytesToRead = nitems * size;
    4568. 

  4568.       if (bytesToRead == 0) {
    4569. 

  4569.         return 0;
    4570. 

  4570.       }
    4571. 

  4571.       var bytesRead = 0;
    4572. 

  4572.       var streamObj = FS.getStreamFromPtr(stream);
    4573. 

  4573.       if (!streamObj) {
    4574. 

  4574.         ___setErrNo(ERRNO_CODES.EBADF);
    4575. 

  4575.         return 0;
    4576. 

  4576.       }
    4577. 

  4577.       while (streamObj.ungotten.length && bytesToRead > 0) {
    4578. 

  4578.         HEAP8[((ptr++)|0)]=streamObj.ungotten.pop();
    4579. 

  4579.         bytesToRead--;
    4580. 

  4580.         bytesRead++;
    4581. 

  4581.       }
    4582. 

  4582.       var err = _read(streamObj.fd, ptr, bytesToRead);
    4583. 

  4583.       if (err == -1) {
    4584. 

  4584.         if (streamObj) streamObj.error = true;
    4585. 

  4585.         return 0;
    4586. 

  4586.       }
    4587. 

  4587.       bytesRead += err;
    4588. 

  4588.       if (bytesRead < bytesToRead) streamObj.eof = true;
    4589. 

  4589.       return Math.floor(bytesRead / size);
    4590. 

  4590.     }
    4591. 

  4591. 

  4592.   function _toupper(chr) {
    4593. 

  4593.       if (chr >= 97 && chr <= 122) {
    4594. 

  4594.         return chr - 97 + 65;
    4595. 

  4595.       } else {
    4596. 

  4596.         return chr;
    4597. 

  4597.       }
    4598. 

  4598.     }
    4599. 

  4599. 

  4600. 

  4601. 

  4602.   function _open(path, oflag, varargs) {
    4603. 

  4603.       // int open(const char *path, int oflag, ...);
    4604. 

  4604.       // http://pubs.opengroup.org/onlinepubs/009695399/functions/open.html
    4605. 

  4605.       var mode = HEAP32[((varargs)>>2)];
    4606. 

  4606.       path = Pointer_stringify(path);
    4607. 

  4607.       try {
    4608. 

  4608.         var stream = FS.open(path, oflag, mode);
    4609. 

  4609.         return stream.fd;
    4610. 

  4610.       } catch (e) {
    4611. 

  4611.         FS.handleFSError(e);
    4612. 

  4612.         return -1;
    4613. 

  4613.       }
    4614. 

  4614.     }function _fopen(filename, mode) {
    4615. 

  4615.       // FILE *fopen(const char *restrict filename, const char *restrict mode);
    4616. 

  4616.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fopen.html
    4617. 

  4617.       var flags;
    4618. 

  4618.       mode = Pointer_stringify(mode);
    4619. 

  4619.       if (mode[0] == 'r') {
    4620. 

  4620.         if (mode.indexOf('+') != -1) {
    4621. 

  4621.           flags = 2;
    4622. 

  4622.         } else {
    4623. 

  4623.           flags = 0;
    4624. 

  4624.         }
    4625. 

  4625.       } else if (mode[0] == 'w') {
    4626. 

  4626.         if (mode.indexOf('+') != -1) {
    4627. 

  4627.           flags = 2;
    4628. 

  4628.         } else {
    4629. 

  4629.           flags = 1;
    4630. 

  4630.         }
    4631. 

  4631.         flags |= 64;
    4632. 

  4632.         flags |= 512;
    4633. 

  4633.       } else if (mode[0] == 'a') {
    4634. 

  4634.         if (mode.indexOf('+') != -1) {
    4635. 

  4635.           flags = 2;
    4636. 

  4636.         } else {
    4637. 

  4637.           flags = 1;
    4638. 

  4638.         }
    4639. 

  4639.         flags |= 64;
    4640. 

  4640.         flags |= 1024;
    4641. 

  4641.       } else {
    4642. 

  4642.         ___setErrNo(ERRNO_CODES.EINVAL);
    4643. 

  4643.         return 0;
    4644. 

  4644.       }
    4645. 

  4645.       var fd = _open(filename, flags, allocate([0x1FF, 0, 0, 0], 'i32', ALLOC_STACK));  // All creation permissions.
    4646. 

  4646.       return fd === -1 ? 0 : FS.getPtrForStream(FS.getStream(fd));
    4647. 

  4647.     }
    4648. 

  4648. 

  4649.   var _emscripten_check_longjmp=true;
    4650. 

  4650. 

  4651. 

  4652. 

  4653.   function _send(fd, buf, len, flags) {
    4654. 

  4654.       var sock = SOCKFS.getSocket(fd);
    4655. 

  4655.       if (!sock) {
    4656. 

  4656.         ___setErrNo(ERRNO_CODES.EBADF);
    4657. 

  4657.         return -1;
    4658. 

  4658.       }
    4659. 

  4659.       // TODO honor flags
    4660. 

  4660.       return _write(fd, buf, len);
    4661. 

  4661.     }
    4662. 

  4662. 

  4663.   function _pwrite(fildes, buf, nbyte, offset) {
    4664. 

  4664.       // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
    4665. 

  4665.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
    4666. 

  4666.       var stream = FS.getStream(fildes);
    4667. 

  4667.       if (!stream) {
    4668. 

  4668.         ___setErrNo(ERRNO_CODES.EBADF);
    4669. 

  4669.         return -1;
    4670. 

  4670.       }
    4671. 

  4671.       try {
    4672. 

  4672.         var slab = HEAP8;
    4673. 

  4673.         return FS.write(stream, slab, buf, nbyte, offset);
    4674. 

  4674.       } catch (e) {
    4675. 

  4675.         FS.handleFSError(e);
    4676. 

  4676.         return -1;
    4677. 

  4677.       }
    4678. 

  4678.     }function _write(fildes, buf, nbyte) {
    4679. 

  4679.       // ssize_t write(int fildes, const void *buf, size_t nbyte);
    4680. 

  4680.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
    4681. 

  4681.       var stream = FS.getStream(fildes);
    4682. 

  4682.       if (!stream) {
    4683. 

  4683.         ___setErrNo(ERRNO_CODES.EBADF);
    4684. 

  4684.         return -1;
    4685. 

  4685.       }
    4686. 

  4686. 

  4687. 

  4688.       try {
    4689. 

  4689.         var slab = HEAP8;
    4690. 

  4690.         return FS.write(stream, slab, buf, nbyte);
    4691. 

  4691.       } catch (e) {
    4692. 

  4692.         FS.handleFSError(e);
    4693. 

  4693.         return -1;
    4694. 

  4694.       }
    4695. 

  4695.     }function _fputc(c, stream) {
    4696. 

  4696.       // int fputc(int c, FILE *stream);
    4697. 

  4697.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
    4698. 

  4698.       var chr = unSign(c & 0xFF);
    4699. 

  4699.       HEAP8[((_fputc.ret)|0)]=chr;
    4700. 

  4700.       var fd = _fileno(stream);
    4701. 

  4701.       var ret = _write(fd, _fputc.ret, 1);
    4702. 

  4702.       if (ret == -1) {
    4703. 

  4703.         var streamObj = FS.getStreamFromPtr(stream);
    4704. 

  4704.         if (streamObj) streamObj.error = true;
    4705. 

  4705.         return -1;
    4706. 

  4706.       } else {
    4707. 

  4707.         return chr;
    4708. 

  4708.       }
    4709. 

  4709.     }
    4710. 

  4710. 

  4711.   var _log=Math_log;
    4712. 

  4712. 

  4713.   var _emscripten_postinvoke=true;
    4714. 

  4714. 

  4715. 

  4716.   function _putchar(c) {
    4717. 

  4717.       // int putchar(int c);
    4718. 

  4718.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/putchar.html
    4719. 

  4719.       return _fputc(c, HEAP32[((_stdout)>>2)]);
    4720. 

  4720.     }
    4721. 

  4721.   Module["_saveSetjmp"] = _saveSetjmp;
    4722. 

  4722. 

  4723.   function _fwrite(ptr, size, nitems, stream) {
    4724. 

  4724.       // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
    4725. 

  4725.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
    4726. 

  4726.       var bytesToWrite = nitems * size;
    4727. 

  4727.       if (bytesToWrite == 0) return 0;
    4728. 

  4728.       var fd = _fileno(stream);
    4729. 

  4729.       var bytesWritten = _write(fd, ptr, bytesToWrite);
    4730. 

  4730.       if (bytesWritten == -1) {
    4731. 

  4731.         var streamObj = FS.getStreamFromPtr(stream);
    4732. 

  4732.         if (streamObj) streamObj.error = true;
    4733. 

  4733.         return 0;
    4734. 

  4734.       } else {
    4735. 

  4735.         return Math.floor(bytesWritten / size);
    4736. 

  4736.       }
    4737. 

  4737.     }
    4738. 

  4738. 

  4739.   function _system(command) {
    4740. 

  4740.       // int system(const char *command);
    4741. 

  4741.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/system.html
    4742. 

  4742.       // Can't call external programs.
    4743. 

  4743.       ___setErrNo(ERRNO_CODES.EAGAIN);
    4744. 

  4744.       return -1;
    4745. 

  4745.     }
    4746. 

  4746. 

  4747.   function _frexp(x, exp_addr) {
    4748. 

  4748.       var sig = 0, exp_ = 0;
    4749. 

  4749.       if (x !== 0) {
    4750. 

  4750.         var sign = 1;
    4751. 

  4751.         if (x < 0) {
    4752. 

  4752.           x = -x;
    4753. 

  4753.           sign = -1;
    4754. 

  4754.         }
    4755. 

  4755.         var raw_exp = Math.log(x)/Math.log(2);
    4756. 

  4756.         exp_ = Math.ceil(raw_exp);
    4757. 

  4757.         if (exp_ === raw_exp) exp_ += 1;
    4758. 

  4758.         sig = sign*x/Math.pow(2, exp_);
    4759. 

  4759.       }
    4760. 

  4760.       HEAP32[((exp_addr)>>2)]=exp_;
    4761. 

  4761.       return sig;
    4762. 

  4762.     }
    4763. 

  4763. 

  4764. 

  4765. 

  4766.   var _tzname=allocate(8, "i32*", ALLOC_STATIC);
    4767. 

  4767. 

  4768.   var _daylight=allocate(1, "i32*", ALLOC_STATIC);
    4769. 

  4769. 

  4770.   var _timezone=allocate(1, "i32*", ALLOC_STATIC);function _tzset() {
    4771. 

  4771.       // TODO: Use (malleable) environment variables instead of system settings.
    4772. 

  4772.       if (_tzset.called) return;
    4773. 

  4773.       _tzset.called = true;
    4774. 

  4774. 

  4775.       HEAP32[((_timezone)>>2)]=-(new Date()).getTimezoneOffset() * 60;
    4776. 

  4776. 

  4777.       var winter = new Date(2000, 0, 1);
    4778. 

  4778.       var summer = new Date(2000, 6, 1);
    4779. 

  4779.       HEAP32[((_daylight)>>2)]=Number(winter.getTimezoneOffset() != summer.getTimezoneOffset());
    4780. 

  4780. 

  4781.       var winterName = 'GMT'; // XXX do not rely on browser timezone info, it is very unpredictable | winter.toString().match(/\(([A-Z]+)\)/)[1];
    4782. 

  4782.       var summerName = 'GMT'; // XXX do not rely on browser timezone info, it is very unpredictable | summer.toString().match(/\(([A-Z]+)\)/)[1];
    4783. 

  4783.       var winterNamePtr = allocate(intArrayFromString(winterName), 'i8', ALLOC_NORMAL);
    4784. 

  4784.       var summerNamePtr = allocate(intArrayFromString(summerName), 'i8', ALLOC_NORMAL);
    4785. 

  4785.       HEAP32[((_tzname)>>2)]=winterNamePtr;
    4786. 

  4786.       HEAP32[(((_tzname)+(4))>>2)]=summerNamePtr;
    4787. 

  4787.     }function _mktime(tmPtr) {
    4788. 

  4788.       _tzset();
    4789. 

  4789.       var year = HEAP32[(((tmPtr)+(20))>>2)];
    4790. 

  4790.       var timestamp = new Date(year >= 1900 ? year : year + 1900,
    4791. 

  4791.                                HEAP32[(((tmPtr)+(16))>>2)],
    4792. 

  4792.                                HEAP32[(((tmPtr)+(12))>>2)],
    4793. 

  4793.                                HEAP32[(((tmPtr)+(8))>>2)],
    4794. 

  4794.                                HEAP32[(((tmPtr)+(4))>>2)],
    4795. 

  4795.                                HEAP32[((tmPtr)>>2)],
    4796. 

  4796.                                0).getTime() / 1000;
    4797. 

  4797.       HEAP32[(((tmPtr)+(24))>>2)]=new Date(timestamp).getDay();
    4798. 

  4798.       var yday = Math.round((timestamp - (new Date(year, 0, 1)).getTime()) / (1000 * 60 * 60 * 24));
    4799. 

  4799.       HEAP32[(((tmPtr)+(28))>>2)]=yday;
    4800. 

  4800.       return timestamp;
    4801. 

  4801.     }
    4802. 

  4802. 

  4803.   function _isalpha(chr) {
    4804. 

  4804.       return (chr >= 97 && chr <= 122) ||
    4805. 

  4805.              (chr >= 65 && chr <= 90);
    4806. 

  4806.     }
    4807. 

  4807. 

  4808. 

  4809.   function _malloc(bytes) {
    4810. 

  4810.       /* Over-allocate to make sure it is byte-aligned by 8.
    4811. 

  4811.        * This will leak memory, but this is only the dummy
    4812. 

  4812.        * implementation (replaced by dlmalloc normally) so
    4813. 

  4813.        * not an issue.
    4814. 

  4814.        */
    4815. 

  4815.       var ptr = Runtime.dynamicAlloc(bytes + 8);
    4816. 

  4816.       return (ptr+8) & 0xFFFFFFF8;
    4817. 

  4817.     }
    4818. 

  4818.   Module["_malloc"] = _malloc;function _tmpnam(s, dir, prefix) {
    4819. 

  4819.       // char *tmpnam(char *s);
    4820. 

  4820.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/tmpnam.html
    4821. 

  4821.       // NOTE: The dir and prefix arguments are for internal use only.
    4822. 

  4822.       var folder = FS.findObject(dir || '/tmp');
    4823. 

  4823.       if (!folder || !folder.isFolder) {
    4824. 

  4824.         dir = '/tmp';
    4825. 

  4825.         folder = FS.findObject(dir);
    4826. 

  4826.         if (!folder || !folder.isFolder) return 0;
    4827. 

  4827.       }
    4828. 

  4828.       var name = prefix || 'file';
    4829. 

  4829.       do {
    4830. 

  4830.         name += String.fromCharCode(65 + Math.floor(Math.random() * 25));
    4831. 

  4831.       } while (name in folder.contents);
    4832. 

  4832.       var result = dir + '/' + name;
    4833. 

  4833.       if (!_tmpnam.buffer) _tmpnam.buffer = _malloc(256);
    4834. 

  4834.       if (!s) s = _tmpnam.buffer;
    4835. 

  4835.       writeAsciiToMemory(result, s);
    4836. 

  4836.       return s;
    4837. 

  4837.     }
    4838. 

  4838. 

  4839.   var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
    4840. 

  4840.           Browser.mainLoop.shouldPause = true;
    4841. 

  4841.         },resume:function () {
    4842. 

  4842.           if (Browser.mainLoop.paused) {
    4843. 

  4843.             Browser.mainLoop.paused = false;
    4844. 

  4844.             Browser.mainLoop.scheduler();
    4845. 

  4845.           }
    4846. 

  4846.           Browser.mainLoop.shouldPause = false;
    4847. 

  4847.         },updateStatus:function () {
    4848. 

  4848.           if (Module['setStatus']) {
    4849. 

  4849.             var message = Module['statusMessage'] || 'Please wait...';
    4850. 

  4850.             var remaining = Browser.mainLoop.remainingBlockers;
    4851. 

  4851.             var expected = Browser.mainLoop.expectedBlockers;
    4852. 

  4852.             if (remaining) {
    4853. 

  4853.               if (remaining < expected) {
    4854. 

  4854.                 Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
    4855. 

  4855.               } else {
    4856. 

  4856.                 Module['setStatus'](message);
    4857. 

  4857.               }
    4858. 

  4858.             } else {
    4859. 

  4859.               Module['setStatus']('');
    4860. 

  4860.             }
    4861. 

  4861.           }
    4862. 

  4862.         }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
    4863. 

  4863.         if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
    4864. 

  4864. 

  4865.         if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
    4866. 

  4866.         Browser.initted = true;
    4867. 

  4867. 

  4868.         try {
    4869. 

  4869.           new Blob();
    4870. 

  4870.           Browser.hasBlobConstructor = true;
    4871. 

  4871.         } catch(e) {
    4872. 

  4872.           Browser.hasBlobConstructor = false;
    4873. 

  4873.           console.log("warning: no blob constructor, cannot create blobs with mimetypes");
    4874. 

  4874.         }
    4875. 

  4875.         Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
    4876. 

  4876.         Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
    4877. 

  4877.         if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
    4878. 

  4878.           console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
    4879. 

  4879.           Module.noImageDecoding = true;
    4880. 

  4880.         }
    4881. 

  4881. 

  4882.         // Support for plugins that can process preloaded files. You can add more of these to
    4883. 

  4883.         // your app by creating and appending to Module.preloadPlugins.
    4884. 

  4884.         //
    4885. 

  4885.         // Each plugin is asked if it can handle a file based on the file's name. If it can,
    4886. 

  4886.         // it is given the file's raw data. When it is done, it calls a callback with the file's
    4887. 

  4887.         // (possibly modified) data. For example, a plugin might decompress a file, or it
    4888. 

  4888.         // might create some side data structure for use later (like an Image element, etc.).
    4889. 

  4889. 

  4890.         var imagePlugin = {};
    4891. 

  4891.         imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
    4892. 

  4892.           return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
    4893. 

  4893.         };
    4894. 

  4894.         imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
    4895. 

  4895.           var b = null;
    4896. 

  4896.           if (Browser.hasBlobConstructor) {
    4897. 

  4897.             try {
    4898. 

  4898.               b = new Blob([byteArray], { type: Browser.getMimetype(name) });
    4899. 

  4899.               if (b.size !== byteArray.length) { // Safari bug #118630
    4900. 

  4900.                 // Safari's Blob can only take an ArrayBuffer
    4901. 

  4901.                 b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
    4902. 

  4902.               }
    4903. 

  4903.             } catch(e) {
    4904. 

  4904.               Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
    4905. 

  4905.             }
    4906. 

  4906.           }
    4907. 

  4907.           if (!b) {
    4908. 

  4908.             var bb = new Browser.BlobBuilder();
    4909. 

  4909.             bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
    4910. 

  4910.             b = bb.getBlob();
    4911. 

  4911.           }
    4912. 

  4912.           var url = Browser.URLObject.createObjectURL(b);
    4913. 

  4913.           var img = new Image();
    4914. 

  4914.           img.onload = function img_onload() {
    4915. 

  4915.             assert(img.complete, 'Image ' + name + ' could not be decoded');
    4916. 

  4916.             var canvas = document.createElement('canvas');
    4917. 

  4917.             canvas.width = img.width;
    4918. 

  4918.             canvas.height = img.height;
    4919. 

  4919.             var ctx = canvas.getContext('2d');
    4920. 

  4920.             ctx.drawImage(img, 0, 0);
    4921. 

  4921.             Module["preloadedImages"][name] = canvas;
    4922. 

  4922.             Browser.URLObject.revokeObjectURL(url);
    4923. 

  4923.             if (onload) onload(byteArray);
    4924. 

  4924.           };
    4925. 

  4925.           img.onerror = function img_onerror(event) {
    4926. 

  4926.             console.log('Image ' + url + ' could not be decoded');
    4927. 

  4927.             if (onerror) onerror();
    4928. 

  4928.           };
    4929. 

  4929.           img.src = url;
    4930. 

  4930.         };
    4931. 

  4931.         Module['preloadPlugins'].push(imagePlugin);
    4932. 

  4932. 

  4933.         var audioPlugin = {};
    4934. 

  4934.         audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
    4935. 

  4935.           return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
    4936. 

  4936.         };
    4937. 

  4937.         audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
    4938. 

  4938.           var done = false;
    4939. 

  4939.           function finish(audio) {
    4940. 

  4940.             if (done) return;
    4941. 

  4941.             done = true;
    4942. 

  4942.             Module["preloadedAudios"][name] = audio;
    4943. 

  4943.             if (onload) onload(byteArray);
    4944. 

  4944.           }
    4945. 

  4945.           function fail() {
    4946. 

  4946.             if (done) return;
    4947. 

  4947.             done = true;
    4948. 

  4948.             Module["preloadedAudios"][name] = new Audio(); // empty shim
    4949. 

  4949.             if (onerror) onerror();
    4950. 

  4950.           }
    4951. 

  4951.           if (Browser.hasBlobConstructor) {
    4952. 

  4952.             try {
    4953. 

  4953.               var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
    4954. 

  4954.             } catch(e) {
    4955. 

  4955.               return fail();
    4956. 

  4956.             }
    4957. 

  4957.             var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
    4958. 

  4958.             var audio = new Audio();
    4959. 

  4959.             audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
    4960. 

  4960.             audio.onerror = function audio_onerror(event) {
    4961. 

  4961.               if (done) return;
    4962. 

  4962.               console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
    4963. 

  4963.               function encode64(data) {
    4964. 

  4964.                 var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
    4965. 

  4965.                 var PAD = '=';
    4966. 

  4966.                 var ret = '';
    4967. 

  4967.                 var leftchar = 0;
    4968. 

  4968.                 var leftbits = 0;
    4969. 

  4969.                 for (var i = 0; i < data.length; i++) {
    4970. 

  4970.                   leftchar = (leftchar << 8) | data[i];
    4971. 

  4971.                   leftbits += 8;
    4972. 

  4972.                   while (leftbits >= 6) {
    4973. 

  4973.                     var curr = (leftchar >> (leftbits-6)) & 0x3f;
    4974. 

  4974.                     leftbits -= 6;
    4975. 

  4975.                     ret += BASE[curr];
    4976. 

  4976.                   }
    4977. 

  4977.                 }
    4978. 

  4978.                 if (leftbits == 2) {
    4979. 

  4979.                   ret += BASE[(leftchar&3) << 4];
    4980. 

  4980.                   ret += PAD + PAD;
    4981. 

  4981.                 } else if (leftbits == 4) {
    4982. 

  4982.                   ret += BASE[(leftchar&0xf) << 2];
    4983. 

  4983.                   ret += PAD;
    4984. 

  4984.                 }
    4985. 

  4985.                 return ret;
    4986. 

  4986.               }
    4987. 

  4987.               audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
    4988. 

  4988.               finish(audio); // we don't wait for confirmation this worked - but it's worth trying
    4989. 

  4989.             };
    4990. 

  4990.             audio.src = url;
    4991. 

  4991.             // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
    4992. 

  4992.             Browser.safeSetTimeout(function() {
    4993. 

  4993.               finish(audio); // try to use it even though it is not necessarily ready to play
    4994. 

  4994.             }, 10000);
    4995. 

  4995.           } else {
    4996. 

  4996.             return fail();
    4997. 

  4997.           }
    4998. 

  4998.         };
    4999. 

  4999.         Module['preloadPlugins'].push(audioPlugin);
    5000. 

  5000. 

  5001.         // Canvas event setup
    5002. 

  5002. 

  5003.         var canvas = Module['canvas'];
    5004. 

  5004. 

  5005.         // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
    5006. 

  5006.         // Module['forcedAspectRatio'] = 4 / 3;
    5007. 

  5007. 

  5008.         canvas.requestPointerLock = canvas['requestPointerLock'] ||
    5009. 

  5009.                                     canvas['mozRequestPointerLock'] ||
    5010. 

  5010.                                     canvas['webkitRequestPointerLock'] ||
    5011. 

  5011.                                     canvas['msRequestPointerLock'] ||
    5012. 

  5012.                                     function(){};
    5013. 

  5013.         canvas.exitPointerLock = document['exitPointerLock'] ||
    5014. 

  5014.                                  document['mozExitPointerLock'] ||
    5015. 

  5015.                                  document['webkitExitPointerLock'] ||
    5016. 

  5016.                                  document['msExitPointerLock'] ||
    5017. 

  5017.                                  function(){}; // no-op if function does not exist
    5018. 

  5018.         canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
    5019. 

  5019. 

  5020.         function pointerLockChange() {
    5021. 

  5021.           Browser.pointerLock = document['pointerLockElement'] === canvas ||
    5022. 

  5022.                                 document['mozPointerLockElement'] === canvas ||
    5023. 

  5023.                                 document['webkitPointerLockElement'] === canvas ||
    5024. 

  5024.                                 document['msPointerLockElement'] === canvas;
    5025. 

  5025.         }
    5026. 

  5026. 

  5027.         document.addEventListener('pointerlockchange', pointerLockChange, false);
    5028. 

  5028.         document.addEventListener('mozpointerlockchange', pointerLockChange, false);
    5029. 

  5029.         document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
    5030. 

  5030.         document.addEventListener('mspointerlockchange', pointerLockChange, false);
    5031. 

  5031. 

  5032.         if (Module['elementPointerLock']) {
    5033. 

  5033.           canvas.addEventListener("click", function(ev) {
    5034. 

  5034.             if (!Browser.pointerLock && canvas.requestPointerLock) {
    5035. 

  5035.               canvas.requestPointerLock();
    5036. 

  5036.               ev.preventDefault();
    5037. 

  5037.             }
    5038. 

  5038.           }, false);
    5039. 

  5039.         }
    5040. 

  5040.       },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
    5041. 

  5041.         var ctx;
    5042. 

  5042.         var errorInfo = '?';
    5043. 

  5043.         function onContextCreationError(event) {
    5044. 

  5044.           errorInfo = event.statusMessage || errorInfo;
    5045. 

  5045.         }
    5046. 

  5046.         try {
    5047. 

  5047.           if (useWebGL) {
    5048. 

  5048.             var contextAttributes = {
    5049. 

  5049.               antialias: false,
    5050. 

  5050.               alpha: false
    5051. 

  5051.             };
    5052. 

  5052. 

  5053.             if (webGLContextAttributes) {
    5054. 

  5054.               for (var attribute in webGLContextAttributes) {
    5055. 

  5055.                 contextAttributes[attribute] = webGLContextAttributes[attribute];
    5056. 

  5056.               }
    5057. 

  5057.             }
    5058. 

  5058. 

  5059. 

  5060.             canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
    5061. 

  5061.             try {
    5062. 

  5062.               ['experimental-webgl', 'webgl'].some(function(webglId) {
    5063. 

  5063.                 return ctx = canvas.getContext(webglId, contextAttributes);
    5064. 

  5064.               });
    5065. 

  5065.             } finally {
    5066. 

  5066.               canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
    5067. 

  5067.             }
    5068. 

  5068.           } else {
    5069. 

  5069.             ctx = canvas.getContext('2d');
    5070. 

  5070.           }
    5071. 

  5071.           if (!ctx) throw ':(';
    5072. 

  5072.         } catch (e) {
    5073. 

  5073.           Module.print('Could not create canvas: ' + [errorInfo, e]);
    5074. 

  5074.           return null;
    5075. 

  5075.         }
    5076. 

  5076.         if (useWebGL) {
    5077. 

  5077.           // Set the background of the WebGL canvas to black
    5078. 

  5078.           canvas.style.backgroundColor = "black";
    5079. 

  5079. 

  5080.           // Warn on context loss
    5081. 

  5081.           canvas.addEventListener('webglcontextlost', function(event) {
    5082. 

  5082.             alert('WebGL context lost. You will need to reload the page.');
    5083. 

  5083.           }, false);
    5084. 

  5084.         }
    5085. 

  5085.         if (setInModule) {
    5086. 

  5086.           GLctx = Module.ctx = ctx;
    5087. 

  5087.           Module.useWebGL = useWebGL;
    5088. 

  5088.           Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
    5089. 

  5089.           Browser.init();
    5090. 

  5090.         }
    5091. 

  5091.         return ctx;
    5092. 

  5092.       },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
    5093. 

  5093.         Browser.lockPointer = lockPointer;
    5094. 

  5094.         Browser.resizeCanvas = resizeCanvas;
    5095. 

  5095.         if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
    5096. 

  5096.         if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
    5097. 

  5097. 

  5098.         var canvas = Module['canvas'];
    5099. 

  5099.         function fullScreenChange() {
    5100. 

  5100.           Browser.isFullScreen = false;
    5101. 

  5101.           var canvasContainer = canvas.parentNode;
    5102. 

  5102.           if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
    5103. 

  5103.                document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
    5104. 

  5104.                document['fullScreenElement'] || document['fullscreenElement'] ||
    5105. 

  5105.                document['msFullScreenElement'] || document['msFullscreenElement'] ||
    5106. 

  5106.                document['webkitCurrentFullScreenElement']) === canvasContainer) {
    5107. 

  5107.             canvas.cancelFullScreen = document['cancelFullScreen'] ||
    5108. 

  5108.                                       document['mozCancelFullScreen'] ||
    5109. 

  5109.                                       document['webkitCancelFullScreen'] ||
    5110. 

  5110.                                       document['msExitFullscreen'] ||
    5111. 

  5111.                                       document['exitFullscreen'] ||
    5112. 

  5112.                                       function() {};
    5113. 

  5113.             canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
    5114. 

  5114.             if (Browser.lockPointer) canvas.requestPointerLock();
    5115. 

  5115.             Browser.isFullScreen = true;
    5116. 

  5116.             if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
    5117. 

  5117.           } else {
    5118. 

  5118. 

  5119.             // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
    5120. 

  5120.             canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
    5121. 

  5121.             canvasContainer.parentNode.removeChild(canvasContainer);
    5122. 

  5122. 

  5123.             if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
    5124. 

  5124.           }
    5125. 

  5125.           if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
    5126. 

  5126.           Browser.updateCanvasDimensions(canvas);
    5127. 

  5127.         }
    5128. 

  5128. 

  5129.         if (!Browser.fullScreenHandlersInstalled) {
    5130. 

  5130.           Browser.fullScreenHandlersInstalled = true;
    5131. 

  5131.           document.addEventListener('fullscreenchange', fullScreenChange, false);
    5132. 

  5132.           document.addEventListener('mozfullscreenchange', fullScreenChange, false);
    5133. 

  5133.           document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
    5134. 

  5134.           document.addEventListener('MSFullscreenChange', fullScreenChange, false);
    5135. 

  5135.         }
    5136. 

  5136. 

  5137.         // 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
    5138. 

  5138.         var canvasContainer = document.createElement("div");
    5139. 

  5139.         canvas.parentNode.insertBefore(canvasContainer, canvas);
    5140. 

  5140.         canvasContainer.appendChild(canvas);
    5141. 

  5141. 

  5142.         // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
    5143. 

  5143.         canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
    5144. 

  5144.                                             canvasContainer['mozRequestFullScreen'] ||
    5145. 

  5145.                                             canvasContainer['msRequestFullscreen'] ||
    5146. 

  5146.                                            (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
    5147. 

  5147.         canvasContainer.requestFullScreen();
    5148. 

  5148.       },requestAnimationFrame:function requestAnimationFrame(func) {
    5149. 

  5149.         if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
    5150. 

  5150.           setTimeout(func, 1000/60);
    5151. 

  5151.         } else {
    5152. 

  5152.           if (!window.requestAnimationFrame) {
    5153. 

  5153.             window.requestAnimationFrame = window['requestAnimationFrame'] ||
    5154. 

  5154.                                            window['mozRequestAnimationFrame'] ||
    5155. 

  5155.                                            window['webkitRequestAnimationFrame'] ||
    5156. 

  5156.                                            window['msRequestAnimationFrame'] ||
    5157. 

  5157.                                            window['oRequestAnimationFrame'] ||
    5158. 

  5158.                                            window['setTimeout'];
    5159. 

  5159.           }
    5160. 

  5160.           window.requestAnimationFrame(func);
    5161. 

  5161.         }
    5162. 

  5162.       },safeCallback:function (func) {
    5163. 

  5163.         return function() {
    5164. 

  5164.           if (!ABORT) return func.apply(null, arguments);
    5165. 

  5165.         };
    5166. 

  5166.       },safeRequestAnimationFrame:function (func) {
    5167. 

  5167.         return Browser.requestAnimationFrame(function() {
    5168. 

  5168.           if (!ABORT) func();
    5169. 

  5169.         });
    5170. 

  5170.       },safeSetTimeout:function (func, timeout) {
    5171. 

  5171.         return setTimeout(function() {
    5172. 

  5172.           if (!ABORT) func();
    5173. 

  5173.         }, timeout);
    5174. 

  5174.       },safeSetInterval:function (func, timeout) {
    5175. 

  5175.         return setInterval(function() {
    5176. 

  5176.           if (!ABORT) func();
    5177. 

  5177.         }, timeout);
    5178. 

  5178.       },getMimetype:function (name) {
    5179. 

  5179.         return {
    5180. 

  5180.           'jpg': 'image/jpeg',
    5181. 

  5181.           'jpeg': 'image/jpeg',
    5182. 

  5182.           'png': 'image/png',
    5183. 

  5183.           'bmp': 'image/bmp',
    5184. 

  5184.           'ogg': 'audio/ogg',
    5185. 

  5185.           'wav': 'audio/wav',
    5186. 

  5186.           'mp3': 'audio/mpeg'
    5187. 

  5187.         }[name.substr(name.lastIndexOf('.')+1)];
    5188. 

  5188.       },getUserMedia:function (func) {
    5189. 

  5189.         if(!window.getUserMedia) {
    5190. 

  5190.           window.getUserMedia = navigator['getUserMedia'] ||
    5191. 

  5191.                                 navigator['mozGetUserMedia'];
    5192. 

  5192.         }
    5193. 

  5193.         window.getUserMedia(func);
    5194. 

  5194.       },getMovementX:function (event) {
    5195. 

  5195.         return event['movementX'] ||
    5196. 

  5196.                event['mozMovementX'] ||
    5197. 

  5197.                event['webkitMovementX'] ||
    5198. 

  5198.                0;
    5199. 

  5199.       },getMovementY:function (event) {
    5200. 

  5200.         return event['movementY'] ||
    5201. 

  5201.                event['mozMovementY'] ||
    5202. 

  5202.                event['webkitMovementY'] ||
    5203. 

  5203.                0;
    5204. 

  5204.       },getMouseWheelDelta:function (event) {
    5205. 

  5205.         return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
    5206. 

  5206.       },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
    5207. 

  5207.         if (Browser.pointerLock) {
    5208. 

  5208.           // When the pointer is locked, calculate the coordinates
    5209. 

  5209.           // based on the movement of the mouse.
    5210. 

  5210.           // Workaround for Firefox bug 764498
    5211. 

  5211.           if (event.type != 'mousemove' &&
    5212. 

  5212.               ('mozMovementX' in event)) {
    5213. 

  5213.             Browser.mouseMovementX = Browser.mouseMovementY = 0;
    5214. 

  5214.           } else {
    5215. 

  5215.             Browser.mouseMovementX = Browser.getMovementX(event);
    5216. 

  5216.             Browser.mouseMovementY = Browser.getMovementY(event);
    5217. 

  5217.           }
    5218. 

  5218. 

  5219.           // check if SDL is available
    5220. 

  5220.           if (typeof SDL != "undefined") {
    5221. 

  5221.             Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
    5222. 

  5222.             Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
    5223. 

  5223.           } else {
    5224. 

  5224.             // just add the mouse delta to the current absolut mouse position
    5225. 

  5225.             // FIXME: ideally this should be clamped against the canvas size and zero
    5226. 

  5226.             Browser.mouseX += Browser.mouseMovementX;
    5227. 

  5227.             Browser.mouseY += Browser.mouseMovementY;
    5228. 

  5228.           }
    5229. 

  5229.         } else {
    5230. 

  5230.           // Otherwise, calculate the movement based on the changes
    5231. 

  5231.           // in the coordinates.
    5232. 

  5232.           var rect = Module["canvas"].getBoundingClientRect();
    5233. 

  5233.           var x, y;
    5234. 

  5234. 

  5235.           // Neither .scrollX or .pageXOffset are defined in a spec, but
    5236. 

  5236.           // we prefer .scrollX because it is currently in a spec draft.
    5237. 

  5237.           // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
    5238. 

  5238.           var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
    5239. 

  5239.           var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
    5240. 

  5240.           if (event.type == 'touchstart' ||
    5241. 

  5241.               event.type == 'touchend' ||
    5242. 

  5242.               event.type == 'touchmove') {
    5243. 

  5243.             var t = event.touches.item(0);
    5244. 

  5244.             if (t) {
    5245. 

  5245.               x = t.pageX - (scrollX + rect.left);
    5246. 

  5246.               y = t.pageY - (scrollY + rect.top);
    5247. 

  5247.             } else {
    5248. 

  5248.               return;
    5249. 

  5249.             }
    5250. 

  5250.           } else {
    5251. 

  5251.             x = event.pageX - (scrollX + rect.left);
    5252. 

  5252.             y = event.pageY - (scrollY + rect.top);
    5253. 

  5253.           }
    5254. 

  5254. 

  5255.           // the canvas might be CSS-scaled compared to its backbuffer;
    5256. 

  5256.           // SDL-using content will want mouse coordinates in terms
    5257. 

  5257.           // of backbuffer units.
    5258. 

  5258.           var cw = Module["canvas"].width;
    5259. 

  5259.           var ch = Module["canvas"].height;
    5260. 

  5260.           x = x * (cw / rect.width);
    5261. 

  5261.           y = y * (ch / rect.height);
    5262. 

  5262. 

  5263.           Browser.mouseMovementX = x - Browser.mouseX;
    5264. 

  5264.           Browser.mouseMovementY = y - Browser.mouseY;
    5265. 

  5265.           Browser.mouseX = x;
    5266. 

  5266.           Browser.mouseY = y;
    5267. 

  5267.         }
    5268. 

  5268.       },xhrLoad:function (url, onload, onerror) {
    5269. 

  5269.         var xhr = new XMLHttpRequest();
    5270. 

  5270.         xhr.open('GET', url, true);
    5271. 

  5271.         xhr.responseType = 'arraybuffer';
    5272. 

  5272.         xhr.onload = function xhr_onload() {
    5273. 

  5273.           if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
    5274. 

  5274.             onload(xhr.response);
    5275. 

  5275.           } else {
    5276. 

  5276.             onerror();
    5277. 

  5277.           }
    5278. 

  5278.         };
    5279. 

  5279.         xhr.onerror = onerror;
    5280. 

  5280.         xhr.send(null);
    5281. 

  5281.       },asyncLoad:function (url, onload, onerror, noRunDep) {
    5282. 

  5282.         Browser.xhrLoad(url, function(arrayBuffer) {
    5283. 

  5283.           assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
    5284. 

  5284.           onload(new Uint8Array(arrayBuffer));
    5285. 

  5285.           if (!noRunDep) removeRunDependency('al ' + url);
    5286. 

  5286.         }, function(event) {
    5287. 

  5287.           if (onerror) {
    5288. 

  5288.             onerror();
    5289. 

  5289.           } else {
    5290. 

  5290.             throw 'Loading data file "' + url + '" failed.';
    5291. 

  5291.           }
    5292. 

  5292.         });
    5293. 

  5293.         if (!noRunDep) addRunDependency('al ' + url);
    5294. 

  5294.       },resizeListeners:[],updateResizeListeners:function () {
    5295. 

  5295.         var canvas = Module['canvas'];
    5296. 

  5296.         Browser.resizeListeners.forEach(function(listener) {
    5297. 

  5297.           listener(canvas.width, canvas.height);
    5298. 

  5298.         });
    5299. 

  5299.       },setCanvasSize:function (width, height, noUpdates) {
    5300. 

  5300.         var canvas = Module['canvas'];
    5301. 

  5301.         Browser.updateCanvasDimensions(canvas, width, height);
    5302. 

  5302.         if (!noUpdates) Browser.updateResizeListeners();
    5303. 

  5303.       },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
    5304. 

  5304.         // check if SDL is available
    5305. 

  5305.         if (typeof SDL != "undefined") {
    5306. 

  5306.           var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
    5307. 

  5307.           flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
    5308. 

  5308.           HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
    5309. 

  5309.         }
    5310. 

  5310.         Browser.updateResizeListeners();
    5311. 

  5311.       },setWindowedCanvasSize:function () {
    5312. 

  5312.         // check if SDL is available
    5313. 

  5313.         if (typeof SDL != "undefined") {
    5314. 

  5314.           var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
    5315. 

  5315.           flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
    5316. 

  5316.           HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
    5317. 

  5317.         }
    5318. 

  5318.         Browser.updateResizeListeners();
    5319. 

  5319.       },updateCanvasDimensions:function (canvas, wNative, hNative) {
    5320. 

  5320.         if (wNative && hNative) {
    5321. 

  5321.           canvas.widthNative = wNative;
    5322. 

  5322.           canvas.heightNative = hNative;
    5323. 

  5323.         } else {
    5324. 

  5324.           wNative = canvas.widthNative;
    5325. 

  5325.           hNative = canvas.heightNative;
    5326. 

  5326.         }
    5327. 

  5327.         var w = wNative;
    5328. 

  5328.         var h = hNative;
    5329. 

  5329.         if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
    5330. 

  5330.           if (w/h < Module['forcedAspectRatio']) {
    5331. 

  5331.             w = Math.round(h * Module['forcedAspectRatio']);
    5332. 

  5332.           } else {
    5333. 

  5333.             h = Math.round(w / Module['forcedAspectRatio']);
    5334. 

  5334.           }
    5335. 

  5335.         }
    5336. 

  5336.         if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
    5337. 

  5337.              document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
    5338. 

  5338.              document['fullScreenElement'] || document['fullscreenElement'] ||
    5339. 

  5339.              document['msFullScreenElement'] || document['msFullscreenElement'] ||
    5340. 

  5340.              document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
    5341. 

  5341.            var factor = Math.min(screen.width / w, screen.height / h);
    5342. 

  5342.            w = Math.round(w * factor);
    5343. 

  5343.            h = Math.round(h * factor);
    5344. 

  5344.         }
    5345. 

  5345.         if (Browser.resizeCanvas) {
    5346. 

  5346.           if (canvas.width  != w) canvas.width  = w;
    5347. 

  5347.           if (canvas.height != h) canvas.height = h;
    5348. 

  5348.           if (typeof canvas.style != 'undefined') {
    5349. 

  5349.             canvas.style.removeProperty( "width");
    5350. 

  5350.             canvas.style.removeProperty("height");
    5351. 

  5351.           }
    5352. 

  5352.         } else {
    5353. 

  5353.           if (canvas.width  != wNative) canvas.width  = wNative;
    5354. 

  5354.           if (canvas.height != hNative) canvas.height = hNative;
    5355. 

  5355.           if (typeof canvas.style != 'undefined') {
    5356. 

  5356.             if (w != wNative || h != hNative) {
    5357. 

  5357.               canvas.style.setProperty( "width", w + "px", "important");
    5358. 

  5358.               canvas.style.setProperty("height", h + "px", "important");
    5359. 

  5359.             } else {
    5360. 

  5360.               canvas.style.removeProperty( "width");
    5361. 

  5361.               canvas.style.removeProperty("height");
    5362. 

  5362.             }
    5363. 

  5363.           }
    5364. 

  5364.         }
    5365. 

  5365.       }};
    5366. 

  5366. 

  5367.   function _log10(x) {
    5368. 

  5368.       return Math.log(x) / Math.LN10;
    5369. 

  5369.     }
    5370. 

  5370. 

  5371.   function _isspace(chr) {
    5372. 

  5372.       return (chr == 32) || (chr >= 9 && chr <= 13);
    5373. 

  5373.     }
    5374. 

  5374. 

  5375. 

  5376.   var ___tm_current=allocate(44, "i8", ALLOC_STATIC);
    5377. 

  5377. 

  5378. 

  5379.   var ___tm_timezone=allocate(intArrayFromString("GMT"), "i8", ALLOC_STATIC);function _localtime_r(time, tmPtr) {
    5380. 

  5380.       _tzset();
    5381. 

  5381.       var date = new Date(HEAP32[((time)>>2)]*1000);
    5382. 

  5382.       HEAP32[((tmPtr)>>2)]=date.getSeconds();
    5383. 

  5383.       HEAP32[(((tmPtr)+(4))>>2)]=date.getMinutes();
    5384. 

  5384.       HEAP32[(((tmPtr)+(8))>>2)]=date.getHours();
    5385. 

  5385.       HEAP32[(((tmPtr)+(12))>>2)]=date.getDate();
    5386. 

  5386.       HEAP32[(((tmPtr)+(16))>>2)]=date.getMonth();
    5387. 

  5387.       HEAP32[(((tmPtr)+(20))>>2)]=date.getFullYear()-1900;
    5388. 

  5388.       HEAP32[(((tmPtr)+(24))>>2)]=date.getDay();
    5389. 

  5389. 

  5390.       var start = new Date(date.getFullYear(), 0, 1);
    5391. 

  5391.       var yday = Math.floor((date.getTime() - start.getTime()) / (1000 * 60 * 60 * 24));
    5392. 

  5392.       HEAP32[(((tmPtr)+(28))>>2)]=yday;
    5393. 

  5393.       HEAP32[(((tmPtr)+(36))>>2)]=start.getTimezoneOffset() * 60;
    5394. 

  5394. 

  5395.       var dst = Number(start.getTimezoneOffset() != date.getTimezoneOffset());
    5396. 

  5396.       HEAP32[(((tmPtr)+(32))>>2)]=dst;
    5397. 

  5397. 

  5398.       HEAP32[(((tmPtr)+(40))>>2)]=___tm_timezone;
    5399. 

  5399. 

  5400.       return tmPtr;
    5401. 

  5401.     }function _localtime(time) {
    5402. 

  5402.       return _localtime_r(time, ___tm_current);
    5403. 

  5403.     }
    5404. 

  5404. 

  5405.   function _srand(seed) {
    5406. 

  5406.       HEAP32[((___rand_seed)>>2)]=seed
    5407. 

  5407.     }
    5408. 

  5408. 

  5409.   var _emscripten_prep_setjmp=true;
    5410. 

  5410. 

  5411. 

  5412. 

  5413. 

  5414.   Module["_testSetjmp"] = _testSetjmp;function _longjmp(env, value) {
    5415. 

  5415.       asm['setThrew'](env, value || 1);
    5416. 

  5416.       throw 'longjmp';
    5417. 

  5417.     }function _emscripten_longjmp(env, value) {
    5418. 

  5418.       _longjmp(env, value);
    5419. 

  5419.     }
    5420. 

  5420. 

  5421.   var _ceil=Math_ceil;
    5422. 

  5422. 

  5423. 

  5424.   function _emscripten_memcpy_big(dest, src, num) {
    5425. 

  5425.       HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
    5426. 

  5426.       return dest;
    5427. 

  5427.     }
    5428. 

  5428.   Module["_memcpy"] = _memcpy;
    5429. 

  5429. 

  5430.   var _llvm_pow_f64=Math_pow;
    5431. 

  5431. 

  5432. 

  5433. 

  5434.   Module["_strlen"] = _strlen;function _fputs(s, stream) {
    5435. 

  5435.       // int fputs(const char *restrict s, FILE *restrict stream);
    5436. 

  5436.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
    5437. 

  5437.       var fd = _fileno(stream);
    5438. 

  5438.       return _write(fd, s, _strlen(s));
    5439. 

  5439.     }
    5440. 

  5440. 

  5441.   function _sbrk(bytes) {
    5442. 

  5442.       // Implement a Linux-like 'memory area' for our 'process'.
    5443. 

  5443.       // Changes the size of the memory area by |bytes|; returns the
    5444. 

  5444.       // address of the previous top ('break') of the memory area
    5445. 

  5445.       // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
    5446. 

  5446.       var self = _sbrk;
    5447. 

  5447.       if (!self.called) {
    5448. 

  5448.         DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
    5449. 

  5449.         self.called = true;
    5450. 

  5450.         assert(Runtime.dynamicAlloc);
    5451. 

  5451.         self.alloc = Runtime.dynamicAlloc;
    5452. 

  5452.         Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
    5453. 

  5453.       }
    5454. 

  5454.       var ret = DYNAMICTOP;
    5455. 

  5455.       if (bytes != 0) self.alloc(bytes);
    5456. 

  5456.       return ret;  // Previous break location.
    5457. 

  5457.     }
    5458. 

  5458. 

  5459. 

  5460.   function _sinh(x) {
    5461. 

  5461.       var p = Math.pow(Math.E, x);
    5462. 

  5462.       return (p - (1 / p)) / 2;
    5463. 

  5463.     }
    5464. 

  5464. 

  5465.   function _cosh(x) {
    5466. 

  5466.       var p = Math.pow(Math.E, x);
    5467. 

  5467.       return (p + (1 / p)) / 2;
    5468. 

  5468.     }function _tanh(x) {
    5469. 

  5469.       return _sinh(x) / _cosh(x);
    5470. 

  5470.     }
    5471. 

  5471. 

  5472.   function _signal(sig, func) {
    5473. 

  5473.       // TODO
    5474. 

  5474.       return 0;
    5475. 

  5475.     }
    5476. 

  5476. 

  5477. 

  5478. 

  5479.   function __getFloat(text) {
    5480. 

  5480.       return /^[+-]?[0-9]*\.?[0-9]+([eE][+-]?[0-9]+)?/.exec(text);
    5481. 

  5481.     }function __scanString(format, get, unget, varargs) {
    5482. 

  5482.       if (!__scanString.whiteSpace) {
    5483. 

  5483.         __scanString.whiteSpace = {};
    5484. 

  5484.         __scanString.whiteSpace[32] = 1;
    5485. 

  5485.         __scanString.whiteSpace[9] = 1;
    5486. 

  5486.         __scanString.whiteSpace[10] = 1;
    5487. 

  5487.         __scanString.whiteSpace[11] = 1;
    5488. 

  5488.         __scanString.whiteSpace[12] = 1;
    5489. 

  5489.         __scanString.whiteSpace[13] = 1;
    5490. 

  5490.       }
    5491. 

  5491.       // Supports %x, %4x, %d.%d, %lld, %s, %f, %lf.
    5492. 

  5492.       // TODO: Support all format specifiers.
    5493. 

  5493.       format = Pointer_stringify(format);
    5494. 

  5494.       var soFar = 0;
    5495. 

  5495.       if (format.indexOf('%n') >= 0) {
    5496. 

  5496.         // need to track soFar
    5497. 

  5497.         var _get = get;
    5498. 

  5498.         get = function get() {
    5499. 

  5499.           soFar++;
    5500. 

  5500.           return _get();
    5501. 

  5501.         }
    5502. 

  5502.         var _unget = unget;
    5503. 

  5503.         unget = function unget() {
    5504. 

  5504.           soFar--;
    5505. 

  5505.           return _unget();
    5506. 

  5506.         }
    5507. 

  5507.       }
    5508. 

  5508.       var formatIndex = 0;
    5509. 

  5509.       var argsi = 0;
    5510. 

  5510.       var fields = 0;
    5511. 

  5511.       var argIndex = 0;
    5512. 

  5512.       var next;
    5513. 

  5513. 

  5514.       mainLoop:
    5515. 

  5515.       for (var formatIndex = 0; formatIndex < format.length;) {
    5516. 

  5516.         if (format[formatIndex] === '%' && format[formatIndex+1] == 'n') {
    5517. 

  5517.           var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
    5518. 

  5518.           argIndex += Runtime.getAlignSize('void*', null, true);
    5519. 

  5519.           HEAP32[((argPtr)>>2)]=soFar;
    5520. 

  5520.           formatIndex += 2;
    5521. 

  5521.           continue;
    5522. 

  5522.         }
    5523. 

  5523. 

  5524.         if (format[formatIndex] === '%') {
    5525. 

  5525.           var nextC = format.indexOf('c', formatIndex+1);
    5526. 

  5526.           if (nextC > 0) {
    5527. 

  5527.             var maxx = 1;
    5528. 

  5528.             if (nextC > formatIndex+1) {
    5529. 

  5529.               var sub = format.substring(formatIndex+1, nextC);
    5530. 

  5530.               maxx = parseInt(sub);
    5531. 

  5531.               if (maxx != sub) maxx = 0;
    5532. 

  5532.             }
    5533. 

  5533.             if (maxx) {
    5534. 

  5534.               var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
    5535. 

  5535.               argIndex += Runtime.getAlignSize('void*', null, true);
    5536. 

  5536.               fields++;
    5537. 

  5537.               for (var i = 0; i < maxx; i++) {
    5538. 

  5538.                 next = get();
    5539. 

  5539.                 HEAP8[((argPtr++)|0)]=next;
    5540. 

  5540.                 if (next === 0) return i > 0 ? fields : fields-1; // we failed to read the full length of this field
    5541. 

  5541.               }
    5542. 

  5542.               formatIndex += nextC - formatIndex + 1;
    5543. 

  5543.               continue;
    5544. 

  5544.             }
    5545. 

  5545.           }
    5546. 

  5546.         }
    5547. 

  5547. 

  5548.         // handle %[...]
    5549. 

  5549.         if (format[formatIndex] === '%' && format.indexOf('[', formatIndex+1) > 0) {
    5550. 

  5550.           var match = /\%([0-9]*)\[(\^)?(\]?[^\]]*)\]/.exec(format.substring(formatIndex));
    5551. 

  5551.           if (match) {
    5552. 

  5552.             var maxNumCharacters = parseInt(match[1]) || Infinity;
    5553. 

  5553.             var negateScanList = (match[2] === '^');
    5554. 

  5554.             var scanList = match[3];
    5555. 

  5555. 

  5556.             // expand "middle" dashs into character sets
    5557. 

  5557.             var middleDashMatch;
    5558. 

  5558.             while ((middleDashMatch = /([^\-])\-([^\-])/.exec(scanList))) {
    5559. 

  5559.               var rangeStartCharCode = middleDashMatch[1].charCodeAt(0);
    5560. 

  5560.               var rangeEndCharCode = middleDashMatch[2].charCodeAt(0);
    5561. 

  5561.               for (var expanded = ''; rangeStartCharCode <= rangeEndCharCode; expanded += String.fromCharCode(rangeStartCharCode++));
    5562. 

  5562.               scanList = scanList.replace(middleDashMatch[1] + '-' + middleDashMatch[2], expanded);
    5563. 

  5563.             }
    5564. 

  5564. 

  5565.             var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
    5566. 

  5566.             argIndex += Runtime.getAlignSize('void*', null, true);
    5567. 

  5567.             fields++;
    5568. 

  5568. 

  5569.             for (var i = 0; i < maxNumCharacters; i++) {
    5570. 

  5570.               next = get();
    5571. 

  5571.               if (negateScanList) {
    5572. 

  5572.                 if (scanList.indexOf(String.fromCharCode(next)) < 0) {
    5573. 

  5573.                   HEAP8[((argPtr++)|0)]=next;
    5574. 

  5574.                 } else {
    5575. 

  5575.                   unget();
    5576. 

  5576.                   break;
    5577. 

  5577.                 }
    5578. 

  5578.               } else {
    5579. 

  5579.                 if (scanList.indexOf(String.fromCharCode(next)) >= 0) {
    5580. 

  5580.                   HEAP8[((argPtr++)|0)]=next;
    5581. 

  5581.                 } else {
    5582. 

  5582.                   unget();
    5583. 

  5583.                   break;
    5584. 

  5584.                 }
    5585. 

  5585.               }
    5586. 

  5586.             }
    5587. 

  5587. 

  5588.             // write out null-terminating character
    5589. 

  5589.             HEAP8[((argPtr++)|0)]=0;
    5590. 

  5590.             formatIndex += match[0].length;
    5591. 

  5591. 

  5592.             continue;
    5593. 

  5593.           }
    5594. 

  5594.         }
    5595. 

  5595.         // remove whitespace
    5596. 

  5596.         while (1) {
    5597. 

  5597.           next = get();
    5598. 

  5598.           if (next == 0) return fields;
    5599. 

  5599.           if (!(next in __scanString.whiteSpace)) break;
    5600. 

  5600.         }
    5601. 

  5601.         unget();
    5602. 

  5602. 

  5603.         if (format[formatIndex] === '%') {
    5604. 

  5604.           formatIndex++;
    5605. 

  5605.           var suppressAssignment = false;
    5606. 

  5606.           if (format[formatIndex] == '*') {
    5607. 

  5607.             suppressAssignment = true;
    5608. 

  5608.             formatIndex++;
    5609. 

  5609.           }
    5610. 

  5610.           var maxSpecifierStart = formatIndex;
    5611. 

  5611.           while (format[formatIndex].charCodeAt(0) >= 48 &&
    5612. 

  5612.                  format[formatIndex].charCodeAt(0) <= 57) {
    5613. 

  5613.             formatIndex++;
    5614. 

  5614.           }
    5615. 

  5615.           var max_;
    5616. 

  5616.           if (formatIndex != maxSpecifierStart) {
    5617. 

  5617.             max_ = parseInt(format.slice(maxSpecifierStart, formatIndex), 10);
    5618. 

  5618.           }
    5619. 

  5619.           var long_ = false;
    5620. 

  5620.           var half = false;
    5621. 

  5621.           var longLong = false;
    5622. 

  5622.           if (format[formatIndex] == 'l') {
    5623. 

  5623.             long_ = true;
    5624. 

  5624.             formatIndex++;
    5625. 

  5625.             if (format[formatIndex] == 'l') {
    5626. 

  5626.               longLong = true;
    5627. 

  5627.               formatIndex++;
    5628. 

  5628.             }
    5629. 

  5629.           } else if (format[formatIndex] == 'h') {
    5630. 

  5630.             half = true;
    5631. 

  5631.             formatIndex++;
    5632. 

  5632.           }
    5633. 

  5633.           var type = format[formatIndex];
    5634. 

  5634.           formatIndex++;
    5635. 

  5635.           var curr = 0;
    5636. 

  5636.           var buffer = [];
    5637. 

  5637.           // Read characters according to the format. floats are trickier, they may be in an unfloat state in the middle, then be a valid float later
    5638. 

  5638.           if (type == 'f' || type == 'e' || type == 'g' ||
    5639. 

  5639.               type == 'F' || type == 'E' || type == 'G') {
    5640. 

  5640.             next = get();
    5641. 

  5641.             while (next > 0 && (!(next in __scanString.whiteSpace)))  {
    5642. 

  5642.               buffer.push(String.fromCharCode(next));
    5643. 

  5643.               next = get();
    5644. 

  5644.             }
    5645. 

  5645.             var m = __getFloat(buffer.join(''));
    5646. 

  5646.             var last = m ? m[0].length : 0;
    5647. 

  5647.             for (var i = 0; i < buffer.length - last + 1; i++) {
    5648. 

  5648.               unget();
    5649. 

  5649.             }
    5650. 

  5650.             buffer.length = last;
    5651. 

  5651.           } else {
    5652. 

  5652.             next = get();
    5653. 

  5653.             var first = true;
    5654. 

  5654. 

  5655.             // Strip the optional 0x prefix for %x.
    5656. 

  5656.             if ((type == 'x' || type == 'X') && (next == 48)) {
    5657. 

  5657.               var peek = get();
    5658. 

  5658.               if (peek == 120 || peek == 88) {
    5659. 

  5659.                 next = get();
    5660. 

  5660.               } else {
    5661. 

  5661.                 unget();
    5662. 

  5662.               }
    5663. 

  5663.             }
    5664. 

  5664. 

  5665.             while ((curr < max_ || isNaN(max_)) && next > 0) {
    5666. 

  5666.               if (!(next in __scanString.whiteSpace) && // stop on whitespace
    5667. 

  5667.                   (type == 's' ||
    5668. 

  5668.                    ((type === 'd' || type == 'u' || type == 'i') && ((next >= 48 && next <= 57) ||
    5669. 

  5669.                                                                      (first && next == 45))) ||
    5670. 

  5670.                    ((type === 'x' || type === 'X') && (next >= 48 && next <= 57 ||
    5671. 

  5671.                                      next >= 97 && next <= 102 ||
    5672. 

  5672.                                      next >= 65 && next <= 70))) &&
    5673. 

  5673.                   (formatIndex >= format.length || next !== format[formatIndex].charCodeAt(0))) { // Stop when we read something that is coming up
    5674. 

  5674.                 buffer.push(String.fromCharCode(next));
    5675. 

  5675.                 next = get();
    5676. 

  5676.                 curr++;
    5677. 

  5677.                 first = false;
    5678. 

  5678.               } else {
    5679. 

  5679.                 break;
    5680. 

  5680.               }
    5681. 

  5681.             }
    5682. 

  5682.             unget();
    5683. 

  5683.           }
    5684. 

  5684.           if (buffer.length === 0) return 0;  // Failure.
    5685. 

  5685.           if (suppressAssignment) continue;
    5686. 

  5686. 

  5687.           var text = buffer.join('');
    5688. 

  5688.           var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
    5689. 

  5689.           argIndex += Runtime.getAlignSize('void*', null, true);
    5690. 

  5690.           switch (type) {
    5691. 

  5691.             case 'd': case 'u': case 'i':
    5692. 

  5692.               if (half) {
    5693. 

  5693.                 HEAP16[((argPtr)>>1)]=parseInt(text, 10);
    5694. 

  5694.               } else if (longLong) {
    5695. 

  5695.                 (tempI64 = [parseInt(text, 10)>>>0,(tempDouble=parseInt(text, 10),(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((argPtr)>>2)]=tempI64[0],HEAP32[(((argPtr)+(4))>>2)]=tempI64[1]);
    5696. 

  5696.               } else {
    5697. 

  5697.                 HEAP32[((argPtr)>>2)]=parseInt(text, 10);
    5698. 

  5698.               }
    5699. 

  5699.               break;
    5700. 

  5700.             case 'X':
    5701. 

  5701.             case 'x':
    5702. 

  5702.               HEAP32[((argPtr)>>2)]=parseInt(text, 16);
    5703. 

  5703.               break;
    5704. 

  5704.             case 'F':
    5705. 

  5705.             case 'f':
    5706. 

  5706.             case 'E':
    5707. 

  5707.             case 'e':
    5708. 

  5708.             case 'G':
    5709. 

  5709.             case 'g':
    5710. 

  5710.             case 'E':
    5711. 

  5711.               // fallthrough intended
    5712. 

  5712.               if (long_) {
    5713. 

  5713.                 HEAPF64[((argPtr)>>3)]=parseFloat(text);
    5714. 

  5714.               } else {
    5715. 

  5715.                 HEAPF32[((argPtr)>>2)]=parseFloat(text);
    5716. 

  5716.               }
    5717. 

  5717.               break;
    5718. 

  5718.             case 's':
    5719. 

  5719.               var array = intArrayFromString(text);
    5720. 

  5720.               for (var j = 0; j < array.length; j++) {
    5721. 

  5721.                 HEAP8[(((argPtr)+(j))|0)]=array[j];
    5722. 

  5722.               }
    5723. 

  5723.               break;
    5724. 

  5724.           }
    5725. 

  5725.           fields++;
    5726. 

  5726.         } else if (format[formatIndex].charCodeAt(0) in __scanString.whiteSpace) {
    5727. 

  5727.           next = get();
    5728. 

  5728.           while (next in __scanString.whiteSpace) {
    5729. 

  5729.             if (next <= 0) break mainLoop;  // End of input.
    5730. 

  5730.             next = get();
    5731. 

  5731.           }
    5732. 

  5732.           unget(next);
    5733. 

  5733.           formatIndex++;
    5734. 

  5734.         } else {
    5735. 

  5735.           // Not a specifier.
    5736. 

  5736.           next = get();
    5737. 

  5737.           if (format[formatIndex].charCodeAt(0) !== next) {
    5738. 

  5738.             unget(next);
    5739. 

  5739.             break mainLoop;
    5740. 

  5740.           }
    5741. 

  5741.           formatIndex++;
    5742. 

  5742.         }
    5743. 

  5743.       }
    5744. 

  5744.       return fields;
    5745. 

  5745.     }
    5746. 

  5746. 

  5747.   function _fgetc(stream) {
    5748. 

  5748.       // int fgetc(FILE *stream);
    5749. 

  5749.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fgetc.html
    5750. 

  5750.       var streamObj = FS.getStreamFromPtr(stream);
    5751. 

  5751.       if (!streamObj) return -1;
    5752. 

  5752.       if (streamObj.eof || streamObj.error) return -1;
    5753. 

  5753.       var ret = _fread(_fgetc.ret, 1, 1, stream);
    5754. 

  5754.       if (ret == 0) {
    5755. 

  5755.         return -1;
    5756. 

  5756.       } else if (ret == -1) {
    5757. 

  5757.         streamObj.error = true;
    5758. 

  5758.         return -1;
    5759. 

  5759.       } else {
    5760. 

  5760.         return HEAPU8[((_fgetc.ret)|0)];
    5761. 

  5761.       }
    5762. 

  5762.     }
    5763. 

  5763. 

  5764.   function _ungetc(c, stream) {
    5765. 

  5765.       // int ungetc(int c, FILE *stream);
    5766. 

  5766.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/ungetc.html
    5767. 

  5767.       stream = FS.getStreamFromPtr(stream);
    5768. 

  5768.       if (!stream) {
    5769. 

  5769.         return -1;
    5770. 

  5770.       }
    5771. 

  5771.       if (c === -1) {
    5772. 

  5772.         // do nothing for EOF character
    5773. 

  5773.         return c;
    5774. 

  5774.       }
    5775. 

  5775.       c = unSign(c & 0xFF);
    5776. 

  5776.       stream.ungotten.push(c);
    5777. 

  5777.       stream.eof = false;
    5778. 

  5778.       return c;
    5779. 

  5779.     }function _fscanf(stream, format, varargs) {
    5780. 

  5780.       // int fscanf(FILE *restrict stream, const char *restrict format, ... );
    5781. 

  5781.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/scanf.html
    5782. 

  5782.       var streamObj = FS.getStreamFromPtr(stream);
    5783. 

  5783.       if (!streamObj) {
    5784. 

  5784.         return -1;
    5785. 

  5785.       }
    5786. 

  5786.       var buffer = [];
    5787. 

  5787.       function get() {
    5788. 

  5788.         var c = _fgetc(stream);
    5789. 

  5789.         buffer.push(c);
    5790. 

  5790.         return c;
    5791. 

  5791.       };
    5792. 

  5792.       function unget() {
    5793. 

  5793.         _ungetc(buffer.pop(), stream);
    5794. 

  5794.       };
    5795. 

  5795.       return __scanString(format, get, unget, varargs);
    5796. 

  5796.     }
    5797. 

  5797. 

  5798.   var _emscripten_preinvoke=true;
    5799. 

  5799. 

  5800.   function _localeconv() {
    5801. 

  5801.       // %struct.timeval = type { char* decimal point, other stuff... }
    5802. 

  5802.       // var indexes = Runtime.calculateStructAlignment({ fields: ['i32', 'i32'] });
    5803. 

  5803.       var me = _localeconv;
    5804. 

  5804.       if (!me.ret) {
    5805. 

  5805.       // These are defaults from the "C" locale
    5806. 

  5806.         me.ret = allocate([
    5807. 

  5807.           allocate(intArrayFromString('.'), 'i8', ALLOC_NORMAL),0,0,0, // decimal_point
    5808. 

  5808.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // thousands_sep
    5809. 

  5809.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // grouping
    5810. 

  5810.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // int_curr_symbol
    5811. 

  5811.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // currency_symbol
    5812. 

  5812.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_decimal_point
    5813. 

  5813.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_thousands_sep
    5814. 

  5814.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_grouping
    5815. 

  5815.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // positive_sign
    5816. 

  5816.           allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0 // negative_sign
    5817. 

  5817.         ], 'i8*', ALLOC_NORMAL); // Allocate strings in lconv, still don't allocate chars
    5818. 

  5818.       }
    5819. 

  5819.       return me.ret;
    5820. 

  5820.     }
    5821. 

  5821. 

  5822. 

  5823.   function _unlink(path) {
    5824. 

  5824.       // int unlink(const char *path);
    5825. 

  5825.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/unlink.html
    5826. 

  5826.       path = Pointer_stringify(path);
    5827. 

  5827.       try {
    5828. 

  5828.         FS.unlink(path);
    5829. 

  5829.         return 0;
    5830. 

  5830.       } catch (e) {
    5831. 

  5831.         FS.handleFSError(e);
    5832. 

  5832.         return -1;
    5833. 

  5833.       }
    5834. 

  5834.     }
    5835. 

  5835. 

  5836.   function _rmdir(path) {
    5837. 

  5837.       // int rmdir(const char *path);
    5838. 

  5838.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/rmdir.html
    5839. 

  5839.       path = Pointer_stringify(path);
    5840. 

  5840.       try {
    5841. 

  5841.         FS.rmdir(path);
    5842. 

  5842.         return 0;
    5843. 

  5843.       } catch (e) {
    5844. 

  5844.         FS.handleFSError(e);
    5845. 

  5845.         return -1;
    5846. 

  5846.       }
    5847. 

  5847.     }function _remove(path) {
    5848. 

  5848.       // int remove(const char *path);
    5849. 

  5849.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/remove.html
    5850. 

  5850.       var ret = _unlink(path);
    5851. 

  5851.       if (ret == -1) ret = _rmdir(path);
    5852. 

  5852.       return ret;
    5853. 

  5853.     }
    5854. 

  5854. 

  5855.   function _freopen(filename, mode, stream) {
    5856. 

  5856.       // FILE *freopen(const char *restrict filename, const char *restrict mode, FILE *restrict stream);
    5857. 

  5857.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/freopen.html
    5858. 

  5858.       if (!filename) {
    5859. 

  5859.         var streamObj = FS.getStreamFromPtr(stream);
    5860. 

  5860.         if (!streamObj) {
    5861. 

  5861.           ___setErrNo(ERRNO_CODES.EBADF);
    5862. 

  5862.           return 0;
    5863. 

  5863.         }
    5864. 

  5864.         if (_freopen.buffer) _free(_freopen.buffer);
    5865. 

  5865.         filename = intArrayFromString(streamObj.path);
    5866. 

  5866.         filename = allocate(filename, 'i8', ALLOC_NORMAL);
    5867. 

  5867.       }
    5868. 

  5868.       _fclose(stream);
    5869. 

  5869.       return _fopen(filename, mode);
    5870. 

  5870.     }
    5871. 

  5871. 

  5872. 

  5873.   function _rename(old_path, new_path) {
    5874. 

  5874.       // int rename(const char *old, const char *new);
    5875. 

  5875.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/rename.html
    5876. 

  5876.       old_path = Pointer_stringify(old_path);
    5877. 

  5877.       new_path = Pointer_stringify(new_path);
    5878. 

  5878.       try {
    5879. 

  5879.         FS.rename(old_path, new_path);
    5880. 

  5880.         return 0;
    5881. 

  5881.       } catch (e) {
    5882. 

  5882.         FS.handleFSError(e);
    5883. 

  5883.         return -1;
    5884. 

  5884.       }
    5885. 

  5885.     }
    5886. 

  5886. 

  5887.   function _tmpfile() {
    5888. 

  5888.       // FILE *tmpfile(void);
    5889. 

  5889.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/tmpfile.html
    5890. 

  5890.       // TODO: Delete the created file on closing.
    5891. 

  5891.       if (_tmpfile.mode) {
    5892. 

  5892.         _tmpfile.mode = allocate(intArrayFromString('w+'), 'i8', ALLOC_NORMAL);
    5893. 

  5893.       }
    5894. 

  5894.       return _fopen(_tmpnam(0), _tmpfile.mode);
    5895. 

  5895.     }
    5896. 

  5896. 

  5897.   function _sysconf(name) {
    5898. 

  5898.       // long sysconf(int name);
    5899. 

  5899.       // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
    5900. 

  5900.       switch(name) {
    5901. 

  5901.         case 30: return PAGE_SIZE;
    5902. 

  5902.         case 132:
    5903. 

  5903.         case 133:
    5904. 

  5904.         case 12:
    5905. 

  5905.         case 137:
    5906. 

  5906.         case 138:
    5907. 

  5907.         case 15:
    5908. 

  5908.         case 235:
    5909. 

  5909.         case 16:
    5910. 

  5910.         case 17:
    5911. 

  5911.         case 18:
    5912. 

  5912.         case 19:
    5913. 

  5913.         case 20:
    5914. 

  5914.         case 149:
    5915. 

  5915.         case 13:
    5916. 

  5916.         case 10:
    5917. 

  5917.         case 236:
    5918. 

  5918.         case 153:
    5919. 

  5919.         case 9:
    5920. 

  5920.         case 21:
    5921. 

  5921.         case 22:
    5922. 

  5922.         case 159:
    5923. 

  5923.         case 154:
    5924. 

  5924.         case 14:
    5925. 

  5925.         case 77:
    5926. 

  5926.         case 78:
    5927. 

  5927.         case 139:
    5928. 

  5928.         case 80:
    5929. 

  5929.         case 81:
    5930. 

  5930.         case 79:
    5931. 

  5931.         case 82:
    5932. 

  5932.         case 68:
    5933. 

  5933.         case 67:
    5934. 

  5934.         case 164:
    5935. 

  5935.         case 11:
    5936. 

  5936.         case 29:
    5937. 

  5937.         case 47:
    5938. 

  5938.         case 48:
    5939. 

  5939.         case 95:
    5940. 

  5940.         case 52:
    5941. 

  5941.         case 51:
    5942. 

  5942.         case 46:
    5943. 

  5943.           return 200809;
    5944. 

  5944.         case 27:
    5945. 

  5945.         case 246:
    5946. 

  5946.         case 127:
    5947. 

  5947.         case 128:
    5948. 

  5948.         case 23:
    5949. 

  5949.         case 24:
    5950. 

  5950.         case 160:
    5951. 

  5951.         case 161:
    5952. 

  5952.         case 181:
    5953. 

  5953.         case 182:
    5954. 

  5954.         case 242:
    5955. 

  5955.         case 183:
    5956. 

  5956.         case 184:
    5957. 

  5957.         case 243:
    5958. 

  5958.         case 244:
    5959. 

  5959.         case 245:
    5960. 

  5960.         case 165:
    5961. 

  5961.         case 178:
    5962. 

  5962.         case 179:
    5963. 

  5963.         case 49:
    5964. 

  5964.         case 50:
    5965. 

  5965.         case 168:
    5966. 

  5966.         case 169:
    5967. 

  5967.         case 175:
    5968. 

  5968.         case 170:
    5969. 

  5969.         case 171:
    5970. 

  5970.         case 172:
    5971. 

  5971.         case 97:
    5972. 

  5972.         case 76:
    5973. 

  5973.         case 32:
    5974. 

  5974.         case 173:
    5975. 

  5975.         case 35:
    5976. 

  5976.           return -1;
    5977. 

  5977.         case 176:
    5978. 

  5978.         case 177:
    5979. 

  5979.         case 7:
    5980. 

  5980.         case 155:
    5981. 

  5981.         case 8:
    5982. 

  5982.         case 157:
    5983. 

  5983.         case 125:
    5984. 

  5984.         case 126:
    5985. 

  5985.         case 92:
    5986. 

  5986.         case 93:
    5987. 

  5987.         case 129:
    5988. 

  5988.         case 130:
    5989. 

  5989.         case 131:
    5990. 

  5990.         case 94:
    5991. 

  5991.         case 91:
    5992. 

  5992.           return 1;
    5993. 

  5993.         case 74:
    5994. 

  5994.         case 60:
    5995. 

  5995.         case 69:
    5996. 

  5996.         case 70:
    5997. 

  5997.         case 4:
    5998. 

  5998.           return 1024;
    5999. 

  5999.         case 31:
    6000. 

  6000.         case 42:
    6001. 

  6001.         case 72:
    6002. 

  6002.           return 32;
    6003. 

  6003.         case 87:
    6004. 

  6004.         case 26:
    6005. 

  6005.         case 33:
    6006. 

  6006.           return 2147483647;
    6007. 

  6007.         case 34:
    6008. 

  6008.         case 1:
    6009. 

  6009.           return 47839;
    6010. 

  6010.         case 38:
    6011. 

  6011.         case 36:
    6012. 

  6012.           return 99;
    6013. 

  6013.         case 43:
    6014. 

  6014.         case 37:
    6015. 

  6015.           return 2048;
    6016. 

  6016.         case 0: return 2097152;
    6017. 

  6017.         case 3: return 65536;
    6018. 

  6018.         case 28: return 32768;
    6019. 

  6019.         case 44: return 32767;
    6020. 

  6020.         case 75: return 16384;
    6021. 

  6021.         case 39: return 1000;
    6022. 

  6022.         case 89: return 700;
    6023. 

  6023.         case 71: return 256;
    6024. 

  6024.         case 40: return 255;
    6025. 

  6025.         case 2: return 100;
    6026. 

  6026.         case 180: return 64;
    6027. 

  6027.         case 25: return 20;
    6028. 

  6028.         case 5: return 16;
    6029. 

  6029.         case 6: return 6;
    6030. 

  6030.         case 73: return 4;
    6031. 

  6031.         case 84: return 1;
    6032. 

  6032.       }
    6033. 

  6033.       ___setErrNo(ERRNO_CODES.EINVAL);
    6034. 

  6034.       return -1;
    6035. 

  6035.     }
    6036. 

  6036. 

  6037. 

  6038.   function ___errno_location() {
    6039. 

  6039.       return ___errno_state;
    6040. 

  6040.     }
    6041. 

  6041. 

  6042. 

  6043.   Module["_memset"] = _memset;
    6044. 

  6044. 

  6045. 

  6046. 

  6047.   Module["_bitshift64Shl"] = _bitshift64Shl;
    6048. 

  6048. 

  6049.   function _abort() {
    6050. 

  6050.       Module['abort']();
    6051. 

  6051.     }
    6052. 

  6052. 

  6053. 

  6054. 

  6055.   function __reallyNegative(x) {
    6056. 

  6056.       return x < 0 || (x === 0 && (1/x) === -Infinity);
    6057. 

  6057.     }function __formatString(format, varargs) {
    6058. 

  6058.       var textIndex = format;
    6059. 

  6059.       var argIndex = 0;
    6060. 

  6060.       function getNextArg(type) {
    6061. 

  6061.         // NOTE: Explicitly ignoring type safety. Otherwise this fails:
    6062. 

  6062.         //       int x = 4; printf("%c\n", (char)x);
    6063. 

  6063.         var ret;
    6064. 

  6064.         if (type === 'double') {
    6065. 

  6065.           ret = HEAPF64[(((varargs)+(argIndex))>>3)];
    6066. 

  6066.         } else if (type == 'i64') {
    6067. 

  6067.           ret = [HEAP32[(((varargs)+(argIndex))>>2)],
    6068. 

  6068.                  HEAP32[(((varargs)+(argIndex+4))>>2)]];
    6069. 

  6069. 

  6070.         } else {
    6071. 

  6071.           type = 'i32'; // varargs are always i32, i64, or double
    6072. 

  6072.           ret = HEAP32[(((varargs)+(argIndex))>>2)];
    6073. 

  6073.         }
    6074. 

  6074.         argIndex += Runtime.getNativeFieldSize(type);
    6075. 

  6075.         return ret;
    6076. 

  6076.       }
    6077. 

  6077. 

  6078.       var ret = [];
    6079. 

  6079.       var curr, next, currArg;
    6080. 

  6080.       while(1) {
    6081. 

  6081.         var startTextIndex = textIndex;
    6082. 

  6082.         curr = HEAP8[(textIndex)];
    6083. 

  6083.         if (curr === 0) break;
    6084. 

  6084.         next = HEAP8[((textIndex+1)|0)];
    6085. 

  6085.         if (curr == 37) {
    6086. 

  6086.           // Handle flags.
    6087. 

  6087.           var flagAlwaysSigned = false;
    6088. 

  6088.           var flagLeftAlign = false;
    6089. 

  6089.           var flagAlternative = false;
    6090. 

  6090.           var flagZeroPad = false;
    6091. 

  6091.           var flagPadSign = false;
    6092. 

  6092.           flagsLoop: while (1) {
    6093. 

  6093.             switch (next) {
    6094. 

  6094.               case 43:
    6095. 

  6095.                 flagAlwaysSigned = true;
    6096. 

  6096.                 break;
    6097. 

  6097.               case 45:
    6098. 

  6098.                 flagLeftAlign = true;
    6099. 

  6099.                 break;
    6100. 

  6100.               case 35:
    6101. 

  6101.                 flagAlternative = true;
    6102. 

  6102.                 break;
    6103. 

  6103.               case 48:
    6104. 

  6104.                 if (flagZeroPad) {
    6105. 

  6105.                   break flagsLoop;
    6106. 

  6106.                 } else {
    6107. 

  6107.                   flagZeroPad = true;
    6108. 

  6108.                   break;
    6109. 

  6109.                 }
    6110. 

  6110.               case 32:
    6111. 

  6111.                 flagPadSign = true;
    6112. 

  6112.                 break;
    6113. 

  6113.               default:
    6114. 

  6114.                 break flagsLoop;
    6115. 

  6115.             }
    6116. 

  6116.             textIndex++;
    6117. 

  6117.             next = HEAP8[((textIndex+1)|0)];
    6118. 

  6118.           }
    6119. 

  6119. 

  6120.           // Handle width.
    6121. 

  6121.           var width = 0;
    6122. 

  6122.           if (next == 42) {
    6123. 

  6123.             width = getNextArg('i32');
    6124. 

  6124.             textIndex++;
    6125. 

  6125.             next = HEAP8[((textIndex+1)|0)];
    6126. 

  6126.           } else {
    6127. 

  6127.             while (next >= 48 && next <= 57) {
    6128. 

  6128.               width = width * 10 + (next - 48);
    6129. 

  6129.               textIndex++;
    6130. 

  6130.               next = HEAP8[((textIndex+1)|0)];
    6131. 

  6131.             }
    6132. 

  6132.           }
    6133. 

  6133. 

  6134.           // Handle precision.
    6135. 

  6135.           var precisionSet = false, precision = -1;
    6136. 

  6136.           if (next == 46) {
    6137. 

  6137.             precision = 0;
    6138. 

  6138.             precisionSet = true;
    6139. 

  6139.             textIndex++;
    6140. 

  6140.             next = HEAP8[((textIndex+1)|0)];
    6141. 

  6141.             if (next == 42) {
    6142. 

  6142.               precision = getNextArg('i32');
    6143. 

  6143.               textIndex++;
    6144. 

  6144.             } else {
    6145. 

  6145.               while(1) {
    6146. 

  6146.                 var precisionChr = HEAP8[((textIndex+1)|0)];
    6147. 

  6147.                 if (precisionChr < 48 ||
    6148. 

  6148.                     precisionChr > 57) break;
    6149. 

  6149.                 precision = precision * 10 + (precisionChr - 48);
    6150. 

  6150.                 textIndex++;
    6151. 

  6151.               }
    6152. 

  6152.             }
    6153. 

  6153.             next = HEAP8[((textIndex+1)|0)];
    6154. 

  6154.           }
    6155. 

  6155.           if (precision < 0) {
    6156. 

  6156.             precision = 6; // Standard default.
    6157. 

  6157.             precisionSet = false;
    6158. 

  6158.           }
    6159. 

  6159. 

  6160.           // Handle integer sizes. WARNING: These assume a 32-bit architecture!
    6161. 

  6161.           var argSize;
    6162. 

  6162.           switch (String.fromCharCode(next)) {
    6163. 

  6163.             case 'h':
    6164. 

  6164.               var nextNext = HEAP8[((textIndex+2)|0)];
    6165. 

  6165.               if (nextNext == 104) {
    6166. 

  6166.                 textIndex++;
    6167. 

  6167.                 argSize = 1; // char (actually i32 in varargs)
    6168. 

  6168.               } else {
    6169. 

  6169.                 argSize = 2; // short (actually i32 in varargs)
    6170. 

  6170.               }
    6171. 

  6171.               break;
    6172. 

  6172.             case 'l':
    6173. 

  6173.               var nextNext = HEAP8[((textIndex+2)|0)];
    6174. 

  6174.               if (nextNext == 108) {
    6175. 

  6175.                 textIndex++;
    6176. 

  6176.                 argSize = 8; // long long
    6177. 

  6177.               } else {
    6178. 

  6178.                 argSize = 4; // long
    6179. 

  6179.               }
    6180. 

  6180.               break;
    6181. 

  6181.             case 'L': // long long
    6182. 

  6182.             case 'q': // int64_t
    6183. 

  6183.             case 'j': // intmax_t
    6184. 

  6184.               argSize = 8;
    6185. 

  6185.               break;
    6186. 

  6186.             case 'z': // size_t
    6187. 

  6187.             case 't': // ptrdiff_t
    6188. 

  6188.             case 'I': // signed ptrdiff_t or unsigned size_t
    6189. 

  6189.               argSize = 4;
    6190. 

  6190.               break;
    6191. 

  6191.             default:
    6192. 

  6192.               argSize = null;
    6193. 

  6193.           }
    6194. 

  6194.           if (argSize) textIndex++;
    6195. 

  6195.           next = HEAP8[((textIndex+1)|0)];
    6196. 

  6196. 

  6197.           // Handle type specifier.
    6198. 

  6198.           switch (String.fromCharCode(next)) {
    6199. 

  6199.             case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
    6200. 

  6200.               // Integer.
    6201. 

  6201.               var signed = next == 100 || next == 105;
    6202. 

  6202.               argSize = argSize || 4;
    6203. 

  6203.               var currArg = getNextArg('i' + (argSize * 8));
    6204. 

  6204.               var origArg = currArg;
    6205. 

  6205.               var argText;
    6206. 

  6206.               // Flatten i64-1 [low, high] into a (slightly rounded) double
    6207. 

  6207.               if (argSize == 8) {
    6208. 

  6208.                 currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
    6209. 

  6209.               }
    6210. 

  6210.               // Truncate to requested size.
    6211. 

  6211.               if (argSize <= 4) {
    6212. 

  6212.                 var limit = Math.pow(256, argSize) - 1;
    6213. 

  6213.                 currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
    6214. 

  6214.               }
    6215. 

  6215.               // Format the number.
    6216. 

  6216.               var currAbsArg = Math.abs(currArg);
    6217. 

  6217.               var prefix = '';
    6218. 

  6218.               if (next == 100 || next == 105) {
    6219. 

  6219.                 if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], null); else
    6220. 

  6220.                 argText = reSign(currArg, 8 * argSize, 1).toString(10);
    6221. 

  6221.               } else if (next == 117) {
    6222. 

  6222.                 if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], true); else
    6223. 

  6223.                 argText = unSign(currArg, 8 * argSize, 1).toString(10);
    6224. 

  6224.                 currArg = Math.abs(currArg);
    6225. 

  6225.               } else if (next == 111) {
    6226. 

  6226.                 argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
    6227. 

  6227.               } else if (next == 120 || next == 88) {
    6228. 

  6228.                 prefix = (flagAlternative && currArg != 0) ? '0x' : '';
    6229. 

  6229.                 if (argSize == 8 && i64Math) {
    6230. 

  6230.                   if (origArg[1]) {
    6231. 

  6231.                     argText = (origArg[1]>>>0).toString(16);
    6232. 

  6232.                     var lower = (origArg[0]>>>0).toString(16);
    6233. 

  6233.                     while (lower.length < 8) lower = '0' + lower;
    6234. 

  6234.                     argText += lower;
    6235. 

  6235.                   } else {
    6236. 

  6236.                     argText = (origArg[0]>>>0).toString(16);
    6237. 

  6237.                   }
    6238. 

  6238.                 } else
    6239. 

  6239.                 if (currArg < 0) {
    6240. 

  6240.                   // Represent negative numbers in hex as 2's complement.
    6241. 

  6241.                   currArg = -currArg;
    6242. 

  6242.                   argText = (currAbsArg - 1).toString(16);
    6243. 

  6243.                   var buffer = [];
    6244. 

  6244.                   for (var i = 0; i < argText.length; i++) {
    6245. 

  6245.                     buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
    6246. 

  6246.                   }
    6247. 

  6247.                   argText = buffer.join('');
    6248. 

  6248.                   while (argText.length < argSize * 2) argText = 'f' + argText;
    6249. 

  6249.                 } else {
    6250. 

  6250.                   argText = currAbsArg.toString(16);
    6251. 

  6251.                 }
    6252. 

  6252.                 if (next == 88) {
    6253. 

  6253.                   prefix = prefix.toUpperCase();
    6254. 

  6254.                   argText = argText.toUpperCase();
    6255. 

  6255.                 }
    6256. 

  6256.               } else if (next == 112) {
    6257. 

  6257.                 if (currAbsArg === 0) {
    6258. 

  6258.                   argText = '(nil)';
    6259. 

  6259.                 } else {
    6260. 

  6260.                   prefix = '0x';
    6261. 

  6261.                   argText = currAbsArg.toString(16);
    6262. 

  6262.                 }
    6263. 

  6263.               }
    6264. 

  6264.               if (precisionSet) {
    6265. 

  6265.                 while (argText.length < precision) {
    6266. 

  6266.                   argText = '0' + argText;
    6267. 

  6267.                 }
    6268. 

  6268.               }
    6269. 

  6269. 

  6270.               // Add sign if needed
    6271. 

  6271.               if (currArg >= 0) {
    6272. 

  6272.                 if (flagAlwaysSigned) {
    6273. 

  6273.                   prefix = '+' + prefix;
    6274. 

  6274.                 } else if (flagPadSign) {
    6275. 

  6275.                   prefix = ' ' + prefix;
    6276. 

  6276.                 }
    6277. 

  6277.               }
    6278. 

  6278. 

  6279.               // Move sign to prefix so we zero-pad after the sign
    6280. 

  6280.               if (argText.charAt(0) == '-') {
    6281. 

  6281.                 prefix = '-' + prefix;
    6282. 

  6282.                 argText = argText.substr(1);
    6283. 

  6283.               }
    6284. 

  6284. 

  6285.               // Add padding.
    6286. 

  6286.               while (prefix.length + argText.length < width) {
    6287. 

  6287.                 if (flagLeftAlign) {
    6288. 

  6288.                   argText += ' ';
    6289. 

  6289.                 } else {
    6290. 

  6290.                   if (flagZeroPad) {
    6291. 

  6291.                     argText = '0' + argText;
    6292. 

  6292.                   } else {
    6293. 

  6293.                     prefix = ' ' + prefix;
    6294. 

  6294.                   }
    6295. 

  6295.                 }
    6296. 

  6296.               }
    6297. 

  6297. 

  6298.               // Insert the result into the buffer.
    6299. 

  6299.               argText = prefix + argText;
    6300. 

  6300.               argText.split('').forEach(function(chr) {
    6301. 

  6301.                 ret.push(chr.charCodeAt(0));
    6302. 

  6302.               });
    6303. 

  6303.               break;
    6304. 

  6304.             }
    6305. 

  6305.             case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
    6306. 

  6306.               // Float.
    6307. 

  6307.               var currArg = getNextArg('double');
    6308. 

  6308.               var argText;
    6309. 

  6309.               if (isNaN(currArg)) {
    6310. 

  6310.                 argText = 'nan';
    6311. 

  6311.                 flagZeroPad = false;
    6312. 

  6312.               } else if (!isFinite(currArg)) {
    6313. 

  6313.                 argText = (currArg < 0 ? '-' : '') + 'inf';
    6314. 

  6314.                 flagZeroPad = false;
    6315. 

  6315.               } else {
    6316. 

  6316.                 var isGeneral = false;
    6317. 

  6317.                 var effectivePrecision = Math.min(precision, 20);
    6318. 

  6318. 

  6319.                 // Convert g/G to f/F or e/E, as per:
    6320. 

  6320.                 // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
    6321. 

  6321.                 if (next == 103 || next == 71) {
    6322. 

  6322.                   isGeneral = true;
    6323. 

  6323.                   precision = precision || 1;
    6324. 

  6324.                   var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
    6325. 

  6325.                   if (precision > exponent && exponent >= -4) {
    6326. 

  6326.                     next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
    6327. 

  6327.                     precision -= exponent + 1;
    6328. 

  6328.                   } else {
    6329. 

  6329.                     next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
    6330. 

  6330.                     precision--;
    6331. 

  6331.                   }
    6332. 

  6332.                   effectivePrecision = Math.min(precision, 20);
    6333. 

  6333.                 }
    6334. 

  6334. 

  6335.                 if (next == 101 || next == 69) {
    6336. 

  6336.                   argText = currArg.toExponential(effectivePrecision);
    6337. 

  6337.                   // Make sure the exponent has at least 2 digits.
    6338. 

  6338.                   if (/[eE][-+]\d$/.test(argText)) {
    6339. 

  6339.                     argText = argText.slice(0, -1) + '0' + argText.slice(-1);
    6340. 

  6340.                   }
    6341. 

  6341.                 } else if (next == 102 || next == 70) {
    6342. 

  6342.                   argText = currArg.toFixed(effectivePrecision);
    6343. 

  6343.                   if (currArg === 0 && __reallyNegative(currArg)) {
    6344. 

  6344.                     argText = '-' + argText;
    6345. 

  6345.                   }
    6346. 

  6346.                 }
    6347. 

  6347. 

  6348.                 var parts = argText.split('e');
    6349. 

  6349.                 if (isGeneral && !flagAlternative) {
    6350. 

  6350.                   // Discard trailing zeros and periods.
    6351. 

  6351.                   while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
    6352. 

  6352.                          (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
    6353. 

  6353.                     parts[0] = parts[0].slice(0, -1);
    6354. 

  6354.                   }
    6355. 

  6355.                 } else {
    6356. 

  6356.                   // Make sure we have a period in alternative mode.
    6357. 

  6357.                   if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
    6358. 

  6358.                   // Zero pad until required precision.
    6359. 

  6359.                   while (precision > effectivePrecision++) parts[0] += '0';
    6360. 

  6360.                 }
    6361. 

  6361.                 argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
    6362. 

  6362. 

  6363.                 // Capitalize 'E' if needed.
    6364. 

  6364.                 if (next == 69) argText = argText.toUpperCase();
    6365. 

  6365. 

  6366.                 // Add sign.
    6367. 

  6367.                 if (currArg >= 0) {
    6368. 

  6368.                   if (flagAlwaysSigned) {
    6369. 

  6369.                     argText = '+' + argText;
    6370. 

  6370.                   } else if (flagPadSign) {
    6371. 

  6371.                     argText = ' ' + argText;
    6372. 

  6372.                   }
    6373. 

  6373.                 }
    6374. 

  6374.               }
    6375. 

  6375. 

  6376.               // Add padding.
    6377. 

  6377.               while (argText.length < width) {
    6378. 

  6378.                 if (flagLeftAlign) {
    6379. 

  6379.                   argText += ' ';
    6380. 

  6380.                 } else {
    6381. 

  6381.                   if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
    6382. 

  6382.                     argText = argText[0] + '0' + argText.slice(1);
    6383. 

  6383.                   } else {
    6384. 

  6384.                     argText = (flagZeroPad ? '0' : ' ') + argText;
    6385. 

  6385.                   }
    6386. 

  6386.                 }
    6387. 

  6387.               }
    6388. 

  6388. 

  6389.               // Adjust case.
    6390. 

  6390.               if (next < 97) argText = argText.toUpperCase();
    6391. 

  6391. 

  6392.               // Insert the result into the buffer.
    6393. 

  6393.               argText.split('').forEach(function(chr) {
    6394. 

  6394.                 ret.push(chr.charCodeAt(0));
    6395. 

  6395.               });
    6396. 

  6396.               break;
    6397. 

  6397.             }
    6398. 

  6398.             case 's': {
    6399. 

  6399.               // String.
    6400. 

  6400.               var arg = getNextArg('i8*');
    6401. 

  6401.               var argLength = arg ? _strlen(arg) : '(null)'.length;
    6402. 

  6402.               if (precisionSet) argLength = Math.min(argLength, precision);
    6403. 

  6403.               if (!flagLeftAlign) {
    6404. 

  6404.                 while (argLength < width--) {
    6405. 

  6405.                   ret.push(32);
    6406. 

  6406.                 }
    6407. 

  6407.               }
    6408. 

  6408.               if (arg) {
    6409. 

  6409.                 for (var i = 0; i < argLength; i++) {
    6410. 

  6410.                   ret.push(HEAPU8[((arg++)|0)]);
    6411. 

  6411.                 }
    6412. 

  6412.               } else {
    6413. 

  6413.                 ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
    6414. 

  6414.               }
    6415. 

  6415.               if (flagLeftAlign) {
    6416. 

  6416.                 while (argLength < width--) {
    6417. 

  6417.                   ret.push(32);
    6418. 

  6418.                 }
    6419. 

  6419.               }
    6420. 

  6420.               break;
    6421. 

  6421.             }
    6422. 

  6422.             case 'c': {
    6423. 

  6423.               // Character.
    6424. 

  6424.               if (flagLeftAlign) ret.push(getNextArg('i8'));
    6425. 

  6425.               while (--width > 0) {
    6426. 

  6426.                 ret.push(32);
    6427. 

  6427.               }
    6428. 

  6428.               if (!flagLeftAlign) ret.push(getNextArg('i8'));
    6429. 

  6429.               break;
    6430. 

  6430.             }
    6431. 

  6431.             case 'n': {
    6432. 

  6432.               // Write the length written so far to the next parameter.
    6433. 

  6433.               var ptr = getNextArg('i32*');
    6434. 

  6434.               HEAP32[((ptr)>>2)]=ret.length;
    6435. 

  6435.               break;
    6436. 

  6436.             }
    6437. 

  6437.             case '%': {
    6438. 

  6438.               // Literal percent sign.
    6439. 

  6439.               ret.push(curr);
    6440. 

  6440.               break;
    6441. 

  6441.             }
    6442. 

  6442.             default: {
    6443. 

  6443.               // Unknown specifiers remain untouched.
    6444. 

  6444.               for (var i = startTextIndex; i < textIndex + 2; i++) {
    6445. 

  6445.                 ret.push(HEAP8[(i)]);
    6446. 

  6446.               }
    6447. 

  6447.             }
    6448. 

  6448.           }
    6449. 

  6449.           textIndex += 2;
    6450. 

  6450.           // TODO: Support a/A (hex float) and m (last error) specifiers.
    6451. 

  6451.           // TODO: Support %1${specifier} for arg selection.
    6452. 

  6452.         } else {
    6453. 

  6453.           ret.push(curr);
    6454. 

  6454.           textIndex += 1;
    6455. 

  6455.         }
    6456. 

  6456.       }
    6457. 

  6457.       return ret;
    6458. 

  6458.     }function _fprintf(stream, format, varargs) {
    6459. 

  6459.       // int fprintf(FILE *restrict stream, const char *restrict format, ...);
    6460. 

  6460.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
    6461. 

  6461.       var result = __formatString(format, varargs);
    6462. 

  6462.       var stack = Runtime.stackSave();
    6463. 

  6463.       var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
    6464. 

  6464.       Runtime.stackRestore(stack);
    6465. 

  6465.       return ret;
    6466. 

  6466.     }
    6467. 

  6467. 

  6468.   function _fgets(s, n, stream) {
    6469. 

  6469.       // char *fgets(char *restrict s, int n, FILE *restrict stream);
    6470. 

  6470.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/fgets.html
    6471. 

  6471.       var streamObj = FS.getStreamFromPtr(stream);
    6472. 

  6472.       if (!streamObj) return 0;
    6473. 

  6473.       if (streamObj.error || streamObj.eof) return 0;
    6474. 

  6474.       var byte_;
    6475. 

  6475.       for (var i = 0; i < n - 1 && byte_ != 10; i++) {
    6476. 

  6476.         byte_ = _fgetc(stream);
    6477. 

  6477.         if (byte_ == -1) {
    6478. 

  6478.           if (streamObj.error || (streamObj.eof && i == 0)) return 0;
    6479. 

  6479.           else if (streamObj.eof) break;
    6480. 

  6480.         }
    6481. 

  6481.         HEAP8[(((s)+(i))|0)]=byte_;
    6482. 

  6482.       }
    6483. 

  6483.       HEAP8[(((s)+(i))|0)]=0;
    6484. 

  6484.       return s;
    6485. 

  6485.     }
    6486. 

  6486. 

  6487.   var _tan=Math_tan;
    6488. 

  6488. 

  6489.   function _ispunct(chr) {
    6490. 

  6490.       return (chr >= 33 && chr <= 47) ||
    6491. 

  6491.              (chr >= 58 && chr <= 64) ||
    6492. 

  6492.              (chr >= 91 && chr <= 96) ||
    6493. 

  6493.              (chr >= 123 && chr <= 126);
    6494. 

  6494.     }
    6495. 

  6495. 

  6496.   function _feof(stream) {
    6497. 

  6497.       // int feof(FILE *stream);
    6498. 

  6498.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/feof.html
    6499. 

  6499.       stream = FS.getStreamFromPtr(stream);
    6500. 

  6500.       return Number(stream && stream.eof);
    6501. 

  6501.     }
    6502. 

  6502. 

  6503. 

  6504.   Module["_tolower"] = _tolower;
    6505. 

  6505. 

  6506.   var _asin=Math_asin;
    6507. 

  6507. 

  6508.   function _clearerr(stream) {
    6509. 

  6509.       // void clearerr(FILE *stream);
    6510. 

  6510.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/clearerr.html
    6511. 

  6511.       stream = FS.getStreamFromPtr(stream);
    6512. 

  6512.       if (!stream) {
    6513. 

  6513.         return;
    6514. 

  6514.       }
    6515. 

  6515.       stream.eof = false;
    6516. 

  6516.       stream.error = false;
    6517. 

  6517.     }
    6518. 

  6518. 

  6519.   var _fabs=Math_abs;
    6520. 

  6520. 

  6521.   function _clock() {
    6522. 

  6522.       if (_clock.start === undefined) _clock.start = Date.now();
    6523. 

  6523.       return Math.floor((Date.now() - _clock.start) * (1000000/1000));
    6524. 

  6524.     }
    6525. 

  6525. 

  6526. 

  6527.   var _getc=_fgetc;
    6528. 

  6528. 

  6529.   function _modf(x, intpart) {
    6530. 

  6530.       HEAPF64[((intpart)>>3)]=Math.floor(x);
    6531. 

  6531.       return x - HEAPF64[((intpart)>>3)];
    6532. 

  6532.     }
    6533. 

  6533. 

  6534.   var _sqrt=Math_sqrt;
    6535. 

  6535. 

  6536.   function _isxdigit(chr) {
    6537. 

  6537.       return (chr >= 48 && chr <= 57) ||
    6538. 

  6538.              (chr >= 97 && chr <= 102) ||
    6539. 

  6539.              (chr >= 65 && chr <= 70);
    6540. 

  6540.     }
    6541. 

  6541. 

  6542.   function _ftell(stream) {
    6543. 

  6543.       // long ftell(FILE *stream);
    6544. 

  6544.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/ftell.html
    6545. 

  6545.       stream = FS.getStreamFromPtr(stream);
    6546. 

  6546.       if (!stream) {
    6547. 

  6547.         ___setErrNo(ERRNO_CODES.EBADF);
    6548. 

  6548.         return -1;
    6549. 

  6549.       }
    6550. 

  6550.       if (FS.isChrdev(stream.node.mode)) {
    6551. 

  6551.         ___setErrNo(ERRNO_CODES.ESPIPE);
    6552. 

  6552.         return -1;
    6553. 

  6553.       } else {
    6554. 

  6554.         return stream.position;
    6555. 

  6555.       }
    6556. 

  6556.     }
    6557. 

  6557. 

  6558. 

  6559.   function __exit(status) {
    6560. 

  6560.       // void _exit(int status);
    6561. 

  6561.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/exit.html
    6562. 

  6562.       Module['exit'](status);
    6563. 

  6563.     }function _exit(status) {
    6564. 

  6564.       __exit(status);
    6565. 

  6565.     }
    6566. 

  6566. 

  6567. 

  6568.   function _snprintf(s, n, format, varargs) {
    6569. 

  6569.       // int snprintf(char *restrict s, size_t n, const char *restrict format, ...);
    6570. 

  6570.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
    6571. 

  6571.       var result = __formatString(format, varargs);
    6572. 

  6572.       var limit = (n === undefined) ? result.length
    6573. 

  6573.                                     : Math.min(result.length, Math.max(n - 1, 0));
    6574. 

  6574.       if (s < 0) {
    6575. 

  6575.         s = -s;
    6576. 

  6576.         var buf = _malloc(limit+1);
    6577. 

  6577.         HEAP32[((s)>>2)]=buf;
    6578. 

  6578.         s = buf;
    6579. 

  6579.       }
    6580. 

  6580.       for (var i = 0; i < limit; i++) {
    6581. 

  6581.         HEAP8[(((s)+(i))|0)]=result[i];
    6582. 

  6582.       }
    6583. 

  6583.       if (limit < n || (n === undefined)) HEAP8[(((s)+(i))|0)]=0;
    6584. 

  6584.       return result.length;
    6585. 

  6585.     }function _sprintf(s, format, varargs) {
    6586. 

  6586.       // int sprintf(char *restrict s, const char *restrict format, ...);
    6587. 

  6587.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
    6588. 

  6588.       return _snprintf(s, undefined, format, varargs);
    6589. 

  6589.     }
    6590. 

  6590. 

  6591.   var _emscripten_get_longjmp_result=true;
    6592. 

  6592. 

  6593.   var _sin=Math_sin;
    6594. 

  6594. 

  6595. 

  6596.   function _fmod(x, y) {
    6597. 

  6597.       return x % y;
    6598. 

  6598.     }var _fmodl=_fmod;
    6599. 

  6599. 

  6600. 

  6601. 

  6602.   var _atan=Math_atan;
    6603. 

  6603. 

  6604.   function _ferror(stream) {
    6605. 

  6605.       // int ferror(FILE *stream);
    6606. 

  6606.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/ferror.html
    6607. 

  6607.       stream = FS.getStreamFromPtr(stream);
    6608. 

  6608.       return Number(stream && stream.error);
    6609. 

  6609.     }
    6610. 

  6610. 

  6611.   function _time(ptr) {
    6612. 

  6612.       var ret = Math.floor(Date.now()/1000);
    6613. 

  6613.       if (ptr) {
    6614. 

  6614.         HEAP32[((ptr)>>2)]=ret;
    6615. 

  6615.       }
    6616. 

  6616.       return ret;
    6617. 

  6617.     }
    6618. 

  6618. 

  6619.   function _copysign(a, b) {
    6620. 

  6620.       return __reallyNegative(a) === __reallyNegative(b) ? a : -a;
    6621. 

  6621.     }
    6622. 

  6622. 

  6623. 

  6624.   function _gmtime_r(time, tmPtr) {
    6625. 

  6625.       var date = new Date(HEAP32[((time)>>2)]*1000);
    6626. 

  6626.       HEAP32[((tmPtr)>>2)]=date.getUTCSeconds();
    6627. 

  6627.       HEAP32[(((tmPtr)+(4))>>2)]=date.getUTCMinutes();
    6628. 

  6628.       HEAP32[(((tmPtr)+(8))>>2)]=date.getUTCHours();
    6629. 

  6629.       HEAP32[(((tmPtr)+(12))>>2)]=date.getUTCDate();
    6630. 

  6630.       HEAP32[(((tmPtr)+(16))>>2)]=date.getUTCMonth();
    6631. 

  6631.       HEAP32[(((tmPtr)+(20))>>2)]=date.getUTCFullYear()-1900;
    6632. 

  6632.       HEAP32[(((tmPtr)+(24))>>2)]=date.getUTCDay();
    6633. 

  6633.       HEAP32[(((tmPtr)+(36))>>2)]=0;
    6634. 

  6634.       HEAP32[(((tmPtr)+(32))>>2)]=0;
    6635. 

  6635.       var start = new Date(date); // define date using UTC, start from Jan 01 00:00:00 UTC
    6636. 

  6636.       start.setUTCDate(1);
    6637. 

  6637.       start.setUTCMonth(0);
    6638. 

  6638.       start.setUTCHours(0);
    6639. 

  6639.       start.setUTCMinutes(0);
    6640. 

  6640.       start.setUTCSeconds(0);
    6641. 

  6641.       start.setUTCMilliseconds(0);
    6642. 

  6642.       var yday = Math.floor((date.getTime() - start.getTime()) / (1000 * 60 * 60 * 24));
    6643. 

  6643.       HEAP32[(((tmPtr)+(28))>>2)]=yday;
    6644. 

  6644.       HEAP32[(((tmPtr)+(40))>>2)]=___tm_timezone;
    6645. 

  6645. 

  6646.       return tmPtr;
    6647. 

  6647.     }function _gmtime(time) {
    6648. 

  6648.       return _gmtime_r(time, ___tm_current);
    6649. 

  6649.     }
    6650. 

  6650. 

  6651.   function _isgraph(chr) {
    6652. 

  6652.       return 0x20 < chr && chr < 0x7F;
    6653. 

  6653.     }
    6654. 

  6654. 

  6655. 

  6656. 

  6657.   function _strerror_r(errnum, strerrbuf, buflen) {
    6658. 

  6658.       if (errnum in ERRNO_MESSAGES) {
    6659. 

  6659.         if (ERRNO_MESSAGES[errnum].length > buflen - 1) {
    6660. 

  6660.           return ___setErrNo(ERRNO_CODES.ERANGE);
    6661. 

  6661.         } else {
    6662. 

  6662.           var msg = ERRNO_MESSAGES[errnum];
    6663. 

  6663.           writeAsciiToMemory(msg, strerrbuf);
    6664. 

  6664.           return 0;
    6665. 

  6665.         }
    6666. 

  6666.       } else {
    6667. 

  6667.         return ___setErrNo(ERRNO_CODES.EINVAL);
    6668. 

  6668.       }
    6669. 

  6669.     }function _strerror(errnum) {
    6670. 

  6670.       if (!_strerror.buffer) _strerror.buffer = _malloc(256);
    6671. 

  6671.       _strerror_r(errnum, _strerror.buffer, 256);
    6672. 

  6672.       return _strerror.buffer;
    6673. 

  6673.     }
    6674. 

  6674. 

  6675. 

  6676. 

  6677. 

  6678. 

  6679.   var _environ=allocate(1, "i32*", ALLOC_STATIC);var ___environ=_environ;function ___buildEnvironment(env) {
    6680. 

  6680.       // WARNING: Arbitrary limit!
    6681. 

  6681.       var MAX_ENV_VALUES = 64;
    6682. 

  6682.       var TOTAL_ENV_SIZE = 1024;
    6683. 

  6683. 

  6684.       // Statically allocate memory for the environment.
    6685. 

  6685.       var poolPtr;
    6686. 

  6686.       var envPtr;
    6687. 

  6687.       if (!___buildEnvironment.called) {
    6688. 

  6688.         ___buildEnvironment.called = true;
    6689. 

  6689.         // Set default values. Use string keys for Closure Compiler compatibility.
    6690. 

  6690.         ENV['USER'] = 'root';
    6691. 

  6691.         ENV['PATH'] = '/';
    6692. 

  6692.         ENV['PWD'] = '/';
    6693. 

  6693.         ENV['HOME'] = '/home/emscripten';
    6694. 

  6694.         ENV['LANG'] = 'en_US.UTF-8';
    6695. 

  6695.         ENV['_'] = './this.program';
    6696. 

  6696.         // Allocate memory.
    6697. 

  6697.         poolPtr = allocate(TOTAL_ENV_SIZE, 'i8', ALLOC_STATIC);
    6698. 

  6698.         envPtr = allocate(MAX_ENV_VALUES * 4,
    6699. 

  6699.                           'i8*', ALLOC_STATIC);
    6700. 

  6700.         HEAP32[((envPtr)>>2)]=poolPtr;
    6701. 

  6701.         HEAP32[((_environ)>>2)]=envPtr;
    6702. 

  6702.       } else {
    6703. 

  6703.         envPtr = HEAP32[((_environ)>>2)];
    6704. 

  6704.         poolPtr = HEAP32[((envPtr)>>2)];
    6705. 

  6705.       }
    6706. 

  6706. 

  6707.       // Collect key=value lines.
    6708. 

  6708.       var strings = [];
    6709. 

  6709.       var totalSize = 0;
    6710. 

  6710.       for (var key in env) {
    6711. 

  6711.         if (typeof env[key] === 'string') {
    6712. 

  6712.           var line = key + '=' + env[key];
    6713. 

  6713.           strings.push(line);
    6714. 

  6714.           totalSize += line.length;
    6715. 

  6715.         }
    6716. 

  6716.       }
    6717. 

  6717.       if (totalSize > TOTAL_ENV_SIZE) {
    6718. 

  6718.         throw new Error('Environment size exceeded TOTAL_ENV_SIZE!');
    6719. 

  6719.       }
    6720. 

  6720. 

  6721.       // Make new.
    6722. 

  6722.       var ptrSize = 4;
    6723. 

  6723.       for (var i = 0; i < strings.length; i++) {
    6724. 

  6724.         var line = strings[i];
    6725. 

  6725.         writeAsciiToMemory(line, poolPtr);
    6726. 

  6726.         HEAP32[(((envPtr)+(i * ptrSize))>>2)]=poolPtr;
    6727. 

  6727.         poolPtr += line.length + 1;
    6728. 

  6728.       }
    6729. 

  6729.       HEAP32[(((envPtr)+(strings.length * ptrSize))>>2)]=0;
    6730. 

  6730.     }var ENV={};function _getenv(name) {
    6731. 

  6731.       // char *getenv(const char *name);
    6732. 

  6732.       // http://pubs.opengroup.org/onlinepubs/009695399/functions/getenv.html
    6733. 

  6733.       if (name === 0) return 0;
    6734. 

  6734.       name = Pointer_stringify(name);
    6735. 

  6735.       if (!ENV.hasOwnProperty(name)) return 0;
    6736. 

  6736. 

  6737.       if (_getenv.ret) _free(_getenv.ret);
    6738. 

  6738.       _getenv.ret = allocate(intArrayFromString(ENV[name]), 'i8', ALLOC_NORMAL);
    6739. 

  6739.       return _getenv.ret;
    6740. 

  6740.     }
    6741. 

  6741. 

  6742.   var _emscripten_setjmp=true;
    6743. 

  6743. 

  6744.   var _cos=Math_cos;
    6745. 

  6745. 

  6746.   function _isalnum(chr) {
    6747. 

  6747.       return (chr >= 48 && chr <= 57) ||
    6748. 

  6748.              (chr >= 97 && chr <= 122) ||
    6749. 

  6749.              (chr >= 65 && chr <= 90);
    6750. 

  6750.     }
    6751. 

  6751. 

  6752.   var _BItoD=true;
    6753. 

  6753. 

  6754.   function _difftime(time1, time0) {
    6755. 

  6755.       return time1 - time0;
    6756. 

  6756.     }
    6757. 

  6757. 

  6758.   var _floor=Math_floor;
    6759. 

  6759. 

  6760.   function _iscntrl(chr) {
    6761. 

  6761.       return (0 <= chr && chr <= 0x1F) || chr === 0x7F;
    6762. 

  6762.     }
    6763. 

  6763. 

  6764.   var _atan2=Math_atan2;
    6765. 

  6765. 

  6766.   function _setvbuf(stream, buf, type, size) {
    6767. 

  6767.       // int setvbuf(FILE *restrict stream, char *restrict buf, int type, size_t size);
    6768. 

  6768.       // http://pubs.opengroup.org/onlinepubs/000095399/functions/setvbuf.html
    6769. 

  6769.       // TODO: Implement custom buffering.
    6770. 

  6770.       return 0;
    6771. 

  6771.     }
    6772. 

  6772. 

  6773.   var _exp=Math_exp;
    6774. 

  6774. 

  6775.   var _copysignl=_copysign;
    6776. 

  6776. 

  6777.   function _islower(chr) {
    6778. 

  6778.       return chr >= 97 && chr <= 122;
    6779. 

  6779.     }
    6780. 

  6780. 

  6781.   var _acos=Math_acos;
    6782. 

  6782. 

  6783.   function _isupper(chr) {
    6784. 

  6784.       return chr >= 65 && chr <= 90;
    6785. 

  6785.     }
    6786. 

  6786. 

  6787. 

  6788.   function __isLeapYear(year) {
    6789. 

  6789.         return year%4 === 0 && (year%100 !== 0 || year%400 === 0);
    6790. 

  6790.     }
    6791. 

  6791. 

  6792.   function __arraySum(array, index) {
    6793. 

  6793.       var sum = 0;
    6794. 

  6794.       for (var i = 0; i <= index; sum += array[i++]);
    6795. 

  6795.       return sum;
    6796. 

  6796.     }
    6797. 

  6797. 

  6798. 

  6799.   var __MONTH_DAYS_LEAP=[31,29,31,30,31,30,31,31,30,31,30,31];
    6800. 

  6800. 

  6801.   var __MONTH_DAYS_REGULAR=[31,28,31,30,31,30,31,31,30,31,30,31];function __addDays(date, days) {
    6802. 

  6802.       var newDate = new Date(date.getTime());
    6803. 

  6803.       while(days > 0) {
    6804. 

  6804.         var leap = __isLeapYear(newDate.getFullYear());
    6805. 

  6805.         var currentMonth = newDate.getMonth();
    6806. 

  6806.         var daysInCurrentMonth = (leap ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR)[currentMonth];
    6807. 

  6807. 

  6808.         if (days > daysInCurrentMonth-newDate.getDate()) {
    6809. 

  6809.           // we spill over to next month
    6810. 

  6810.           days -= (daysInCurrentMonth-newDate.getDate()+1);
    6811. 

  6811.           newDate.setDate(1);
    6812. 

  6812.           if (currentMonth < 11) {
    6813. 

  6813.             newDate.setMonth(currentMonth+1)
    6814. 

  6814.           } else {
    6815. 

  6815.             newDate.setMonth(0);
    6816. 

  6816.             newDate.setFullYear(newDate.getFullYear()+1);
    6817. 

  6817.           }
    6818. 

  6818.         } else {
    6819. 

  6819.           // we stay in current month
    6820. 

  6820.           newDate.setDate(newDate.getDate()+days);
    6821. 

  6821.           return newDate;
    6822. 

  6822.         }
    6823. 

  6823.       }
    6824. 

  6824. 

  6825.       return newDate;
    6826. 

  6826.     }function _strftime(s, maxsize, format, tm) {
    6827. 

  6827.       // size_t strftime(char *restrict s, size_t maxsize, const char *restrict format, const struct tm *restrict timeptr);
    6828. 

  6828.       // http://pubs.opengroup.org/onlinepubs/009695399/functions/strftime.html
    6829. 

  6829. 

  6830.       var date = {
    6831. 

  6831.         tm_sec: HEAP32[((tm)>>2)],
    6832. 

  6832.         tm_min: HEAP32[(((tm)+(4))>>2)],
    6833. 

  6833.         tm_hour: HEAP32[(((tm)+(8))>>2)],
    6834. 

  6834.         tm_mday: HEAP32[(((tm)+(12))>>2)],
    6835. 

  6835.         tm_mon: HEAP32[(((tm)+(16))>>2)],
    6836. 

  6836.         tm_year: HEAP32[(((tm)+(20))>>2)],
    6837. 

  6837.         tm_wday: HEAP32[(((tm)+(24))>>2)],
    6838. 

  6838.         tm_yday: HEAP32[(((tm)+(28))>>2)],
    6839. 

  6839.         tm_isdst: HEAP32[(((tm)+(32))>>2)]
    6840. 

  6840.       };
    6841. 

  6841. 

  6842.       var pattern = Pointer_stringify(format);
    6843. 

  6843. 

  6844.       // expand format
    6845. 

  6845.       var EXPANSION_RULES_1 = {
    6846. 

  6846.         '%c': '%a %b %d %H:%M:%S %Y',     // Replaced by the locale's appropriate date and time representation - e.g., Mon Aug  3 14:02:01 2013
    6847. 

  6847.         '%D': '%m/%d/%y',                 // Equivalent to %m / %d / %y
    6848. 

  6848.         '%F': '%Y-%m-%d',                 // Equivalent to %Y - %m - %d
    6849. 

  6849.         '%h': '%b',                       // Equivalent to %b
    6850. 

  6850.         '%r': '%I:%M:%S %p',              // Replaced by the time in a.m. and p.m. notation
    6851. 

  6851.         '%R': '%H:%M',                    // Replaced by the time in 24-hour notation
    6852. 

  6852.         '%T': '%H:%M:%S',                 // Replaced by the time
    6853. 

  6853.         '%x': '%m/%d/%y',                 // Replaced by the locale's appropriate date representation
    6854. 

  6854.         '%X': '%H:%M:%S',                 // Replaced by the locale's appropriate date representation
    6855. 

  6855.       };
    6856. 

  6856.       for (var rule in EXPANSION_RULES_1) {
    6857. 

  6857.         pattern = pattern.replace(new RegExp(rule, 'g'), EXPANSION_RULES_1[rule]);
    6858. 

  6858.       }
    6859. 

  6859. 

  6860.       var WEEKDAYS = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
    6861. 

  6861.       var MONTHS = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
    6862. 

  6862. 

  6863.       function leadingSomething(value, digits, character) {
    6864. 

  6864.         var str = typeof value === 'number' ? value.toString() : (value || '');
    6865. 

  6865.         while (str.length < digits) {
    6866. 

  6866.           str = character[0]+str;
    6867. 

  6867.         }
    6868. 

  6868.         return str;
    6869. 

  6869.       };
    6870. 

  6870. 

  6871.       function leadingNulls(value, digits) {
    6872. 

  6872.         return leadingSomething(value, digits, '0');
    6873. 

  6873.       };
    6874. 

  6874. 

  6875.       function compareByDay(date1, date2) {
    6876. 

  6876.         function sgn(value) {
    6877. 

  6877.           return value < 0 ? -1 : (value > 0 ? 1 : 0);
    6878. 

  6878.         };
    6879. 

  6879. 

  6880.         var compare;
    6881. 

  6881.         if ((compare = sgn(date1.getFullYear()-date2.getFullYear())) === 0) {
    6882. 

  6882.           if ((compare = sgn(date1.getMonth()-date2.getMonth())) === 0) {
    6883. 

  6883.             compare = sgn(date1.getDate()-date2.getDate());
    6884. 

  6884.           }
    6885. 

  6885.         }
    6886. 

  6886.         return compare;
    6887. 

  6887.       };
    6888. 

  6888. 

  6889.       function getFirstWeekStartDate(janFourth) {
    6890. 

  6890.           switch (janFourth.getDay()) {
    6891. 

  6891.             case 0: // Sunday
    6892. 

  6892.               return new Date(janFourth.getFullYear()-1, 11, 29);
    6893. 

  6893.             case 1: // Monday
    6894. 

  6894.               return janFourth;
    6895. 

  6895.             case 2: // Tuesday
    6896. 

  6896.               return new Date(janFourth.getFullYear(), 0, 3);
    6897. 

  6897.             case 3: // Wednesday
    6898. 

  6898.               return new Date(janFourth.getFullYear(), 0, 2);
    6899. 

  6899.             case 4: // Thursday
    6900. 

  6900.               return new Date(janFourth.getFullYear(), 0, 1);
    6901. 

  6901.             case 5: // Friday
    6902. 

  6902.               return new Date(janFourth.getFullYear()-1, 11, 31);
    6903. 

  6903.             case 6: // Saturday
    6904. 

  6904.               return new Date(janFourth.getFullYear()-1, 11, 30);
    6905. 

  6905.           }
    6906. 

  6906.       };
    6907. 

  6907. 

  6908.       function getWeekBasedYear(date) {
    6909. 

  6909.           var thisDate = __addDays(new Date(date.tm_year+1900, 0, 1), date.tm_yday);
    6910. 

  6910. 

  6911.           var janFourthThisYear = new Date(thisDate.getFullYear(), 0, 4);
    6912. 

  6912.           var janFourthNextYear = new Date(thisDate.getFullYear()+1, 0, 4);
    6913. 

  6913. 

  6914.           var firstWeekStartThisYear = getFirstWeekStartDate(janFourthThisYear);
    6915. 

  6915.           var firstWeekStartNextYear = getFirstWeekStartDate(janFourthNextYear);
    6916. 

  6916. 

  6917.           if (compareByDay(firstWeekStartThisYear, thisDate) <= 0) {
    6918. 

  6918.             // this date is after the start of the first week of this year
    6919. 

  6919.             if (compareByDay(firstWeekStartNextYear, thisDate) <= 0) {
    6920. 

  6920.               return thisDate.getFullYear()+1;
    6921. 

  6921.             } else {
    6922. 

  6922.               return thisDate.getFullYear();
    6923. 

  6923.             }
    6924. 

  6924.           } else {
    6925. 

  6925.             return thisDate.getFullYear()-1;
    6926. 

  6926.           }
    6927. 

  6927.       };
    6928. 

  6928. 

  6929.       var EXPANSION_RULES_2 = {
    6930. 

  6930.         '%a': function(date) {
    6931. 

  6931.           return WEEKDAYS[date.tm_wday].substring(0,3);
    6932. 

  6932.         },
    6933. 

  6933.         '%A': function(date) {
    6934. 

  6934.           return WEEKDAYS[date.tm_wday];
    6935. 

  6935.         },
    6936. 

  6936.         '%b': function(date) {
    6937. 

  6937.           return MONTHS[date.tm_mon].substring(0,3);
    6938. 

  6938.         },
    6939. 

  6939.         '%B': function(date) {
    6940. 

  6940.           return MONTHS[date.tm_mon];
    6941. 

  6941.         },
    6942. 

  6942.         '%C': function(date) {
    6943. 

  6943.           var year = date.tm_year+1900;
    6944. 

  6944.           return leadingNulls(Math.floor(year/100),2);
    6945. 

  6945.         },
    6946. 

  6946.         '%d': function(date) {
    6947. 

  6947.           return leadingNulls(date.tm_mday, 2);
    6948. 

  6948.         },
    6949. 

  6949.         '%e': function(date) {
    6950. 

  6950.           return leadingSomething(date.tm_mday, 2, ' ');
    6951. 

  6951.         },
    6952. 

  6952.         '%g': function(date) {
    6953. 

  6953.           // %g, %G, and %V give values according to the ISO 8601:2000 standard week-based year.
    6954. 

  6954.           // In this system, weeks begin on a Monday and week 1 of the year is the week that includes
    6955. 

  6955.           // January 4th, which is also the week that includes the first Thursday of the year, and
    6956. 

  6956.           // is also the first week that contains at least four days in the year.
    6957. 

  6957.           // If the first Monday of January is the 2nd, 3rd, or 4th, the preceding days are part of
    6958. 

  6958.           // the last week of the preceding year; thus, for Saturday 2nd January 1999,
    6959. 

  6959.           // %G is replaced by 1998 and %V is replaced by 53. If December 29th, 30th,
    6960. 

  6960.           // or 31st is a Monday, it and any following days are part of week 1 of the following year.
    6961. 

  6961.           // Thus, for Tuesday 30th December 1997, %G is replaced by 1998 and %V is replaced by 01.
    6962. 

  6962. 

  6963.           return getWeekBasedYear(date).toString().substring(2);
    6964. 

  6964.         },
    6965. 

  6965.         '%G': function(date) {
    6966. 

  6966.           return getWeekBasedYear(date);
    6967. 

  6967.         },
    6968. 

  6968.         '%H': function(date) {
    6969. 

  6969.           return leadingNulls(date.tm_hour, 2);
    6970. 

  6970.         },
    6971. 

  6971.         '%I': function(date) {
    6972. 

  6972.           return leadingNulls(date.tm_hour < 13 ? date.tm_hour : date.tm_hour-12, 2);
    6973. 

  6973.         },
    6974. 

  6974.         '%j': function(date) {
    6975. 

  6975.           // Day of the year (001-366)
    6976. 

  6976.           return leadingNulls(date.tm_mday+__arraySum(__isLeapYear(date.tm_year+1900) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, date.tm_mon-1), 3);
    6977. 

  6977.         },
    6978. 

  6978.         '%m': function(date) {
    6979. 

  6979.           return leadingNulls(date.tm_mon+1, 2);
    6980. 

  6980.         },
    6981. 

  6981.         '%M': function(date) {
    6982. 

  6982.           return leadingNulls(date.tm_min, 2);
    6983. 

  6983.         },
    6984. 

  6984.         '%n': function() {
    6985. 

  6985.           return '\n';
    6986. 

  6986.         },
    6987. 

  6987.         '%p': function(date) {
    6988. 

  6988.           if (date.tm_hour > 0 && date.tm_hour < 13) {
    6989. 

  6989.             return 'AM';
    6990. 

  6990.           } else {
    6991. 

  6991.             return 'PM';
    6992. 

  6992.           }
    6993. 

  6993.         },
    6994. 

  6994.         '%S': function(date) {
    6995. 

  6995.           return leadingNulls(date.tm_sec, 2);
    6996. 

  6996.         },
    6997. 

  6997.         '%t': function() {
    6998. 

  6998.           return '\t';
    6999. 

  6999.         },
    7000. 

  7000.         '%u': function(date) {
    7001. 

  7001.           var day = new Date(date.tm_year+1900, date.tm_mon+1, date.tm_mday, 0, 0, 0, 0);
    7002. 

  7002.           return day.getDay() || 7;
    7003. 

  7003.         },
    7004. 

  7004.         '%U': function(date) {
    7005. 

  7005.           // Replaced by the week number of the year as a decimal number [00,53].
    7006. 

  7006.           // The first Sunday of January is the first day of week 1;
    7007. 

  7007.           // days in the new year before this are in week 0. [ tm_year, tm_wday, tm_yday]
    7008. 

  7008.           var janFirst = new Date(date.tm_year+1900, 0, 1);
    7009. 

  7009.           var firstSunday = janFirst.getDay() === 0 ? janFirst : __addDays(janFirst, 7-janFirst.getDay());
    7010. 

  7010.           var endDate = new Date(date.tm_year+1900, date.tm_mon, date.tm_mday);
    7011. 

  7011. 

  7012.           // is target date after the first Sunday?
    7013. 

  7013.           if (compareByDay(firstSunday, endDate) < 0) {
    7014. 

  7014.             // calculate difference in days between first Sunday and endDate
    7015. 

  7015.             var februaryFirstUntilEndMonth = __arraySum(__isLeapYear(endDate.getFullYear()) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, endDate.getMonth()-1)-31;
    7016. 

  7016.             var firstSundayUntilEndJanuary = 31-firstSunday.getDate();
    7017. 

  7017.             var days = firstSundayUntilEndJanuary+februaryFirstUntilEndMonth+endDate.getDate();
    7018. 

  7018.             return leadingNulls(Math.ceil(days/7), 2);
    7019. 

  7019.           }
    7020. 

  7020. 

  7021.           return compareByDay(firstSunday, janFirst) === 0 ? '01': '00';
    7022. 

  7022.         },
    7023. 

  7023.         '%V': function(date) {
    7024. 

  7024.           // Replaced by the week number of the year (Monday as the first day of the week)
    7025. 

  7025.           // as a decimal number [01,53]. If the week containing 1 January has four
    7026. 

  7026.           // or more days in the new year, then it is considered week 1.
    7027. 

  7027.           // Otherwise, it is the last week of the previous year, and the next week is week 1.
    7028. 

  7028.           // Both January 4th and the first Thursday of January are always in week 1. [ tm_year, tm_wday, tm_yday]
    7029. 

  7029.           var janFourthThisYear = new Date(date.tm_year+1900, 0, 4);
    7030. 

  7030.           var janFourthNextYear = new Date(date.tm_year+1901, 0, 4);
    7031. 

  7031. 

  7032.           var firstWeekStartThisYear = getFirstWeekStartDate(janFourthThisYear);
    7033. 

  7033.           var firstWeekStartNextYear = getFirstWeekStartDate(janFourthNextYear);
    7034. 

  7034. 

  7035.           var endDate = __addDays(new Date(date.tm_year+1900, 0, 1), date.tm_yday);
    7036. 

  7036. 

  7037.           if (compareByDay(endDate, firstWeekStartThisYear) < 0) {
    7038. 

  7038.             // if given date is before this years first week, then it belongs to the 53rd week of last year
    7039. 

  7039.             return '53';
    7040. 

  7040.           }
    7041. 

  7041. 

  7042.           if (compareByDay(firstWeekStartNextYear, endDate) <= 0) {
    7043. 

  7043.             // if given date is after next years first week, then it belongs to the 01th week of next year
    7044. 

  7044.             return '01';
    7045. 

  7045.           }
    7046. 

  7046. 

  7047.           // given date is in between CW 01..53 of this calendar year
    7048. 

  7048.           var daysDifference;
    7049. 

  7049.           if (firstWeekStartThisYear.getFullYear() < date.tm_year+1900) {
    7050. 

  7050.             // first CW of this year starts last year
    7051. 

  7051.             daysDifference = date.tm_yday+32-firstWeekStartThisYear.getDate()
    7052. 

  7052.           } else {
    7053. 

  7053.             // first CW of this year starts this year
    7054. 

  7054.             daysDifference = date.tm_yday+1-firstWeekStartThisYear.getDate();
    7055. 

  7055.           }
    7056. 

  7056.           return leadingNulls(Math.ceil(daysDifference/7), 2);
    7057. 

  7057.         },
    7058. 

  7058.         '%w': function(date) {
    7059. 

  7059.           var day = new Date(date.tm_year+1900, date.tm_mon+1, date.tm_mday, 0, 0, 0, 0);
    7060. 

  7060.           return day.getDay();
    7061. 

  7061.         },
    7062. 

  7062.         '%W': function(date) {
    7063. 

  7063.           // Replaced by the week number of the year as a decimal number [00,53].
    7064. 

  7064.           // The first Monday of January is the first day of week 1;
    7065. 

  7065.           // days in the new year before this are in week 0. [ tm_year, tm_wday, tm_yday]
    7066. 

  7066.           var janFirst = new Date(date.tm_year, 0, 1);
    7067. 

  7067.           var firstMonday = janFirst.getDay() === 1 ? janFirst : __addDays(janFirst, janFirst.getDay() === 0 ? 1 : 7-janFirst.getDay()+1);
    7068. 

  7068.           var endDate = new Date(date.tm_year+1900, date.tm_mon, date.tm_mday);
    7069. 

  7069. 

  7070.           // is target date after the first Monday?
    7071. 

  7071.           if (compareByDay(firstMonday, endDate) < 0) {
    7072. 

  7072.             var februaryFirstUntilEndMonth = __arraySum(__isLeapYear(endDate.getFullYear()) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, endDate.getMonth()-1)-31;
    7073. 

  7073.             var firstMondayUntilEndJanuary = 31-firstMonday.getDate();
    7074. 

  7074.             var days = firstMondayUntilEndJanuary+februaryFirstUntilEndMonth+endDate.getDate();
    7075. 

  7075.             return leadingNulls(Math.ceil(days/7), 2);
    7076. 

  7076.           }
    7077. 

  7077.           return compareByDay(firstMonday, janFirst) === 0 ? '01': '00';
    7078. 

  7078.         },
    7079. 

  7079.         '%y': function(date) {
    7080. 

  7080.           // Replaced by the last two digits of the year as a decimal number [00,99]. [ tm_year]
    7081. 

  7081.           return (date.tm_year+1900).toString().substring(2);
    7082. 

  7082.         },
    7083. 

  7083.         '%Y': function(date) {
    7084. 

  7084.           // Replaced by the year as a decimal number (for example, 1997). [ tm_year]
    7085. 

  7085.           return date.tm_year+1900;
    7086. 

  7086.         },
    7087. 

  7087.         '%z': function(date) {
    7088. 

  7088.           // Replaced by the offset from UTC in the ISO 8601:2000 standard format ( +hhmm or -hhmm ),
    7089. 

  7089.           // or by no characters if no timezone is determinable.
    7090. 

  7090.           // For example, "-0430" means 4 hours 30 minutes behind UTC (west of Greenwich).
    7091. 

  7091.           // If tm_isdst is zero, the standard time offset is used.
    7092. 

  7092.           // If tm_isdst is greater than zero, the daylight savings time offset is used.
    7093. 

  7093.           // If tm_isdst is negative, no characters are returned.
    7094. 

  7094.           // FIXME: we cannot determine time zone (or can we?)
    7095. 

  7095.           return '';
    7096. 

  7096.         },
    7097. 

  7097.         '%Z': function(date) {
    7098. 

  7098.           // Replaced by the timezone name or abbreviation, or by no bytes if no timezone information exists. [ tm_isdst]
    7099. 

  7099.           // FIXME: we cannot determine time zone (or can we?)
    7100. 

  7100.           return '';
    7101. 

  7101.         },
    7102. 

  7102.         '%%': function() {
    7103. 

  7103.           return '%';
    7104. 

  7104.         }
    7105. 

  7105.       };
    7106. 

  7106.       for (var rule in EXPANSION_RULES_2) {
    7107. 

  7107.         if (pattern.indexOf(rule) >= 0) {
    7108. 

  7108.           pattern = pattern.replace(new RegExp(rule, 'g'), EXPANSION_RULES_2[rule](date));
    7109. 

  7109.         }
    7110. 

  7110.       }
    7111. 

  7111. 

  7112.       var bytes = intArrayFromString(pattern, false);
    7113. 

  7113.       if (bytes.length > maxsize) {
    7114. 

  7114.         return 0;
    7115. 

  7115.       }
    7116. 

  7116. 

  7117.       writeArrayToMemory(bytes, s);
    7118. 

  7118.       return bytes.length-1;
    7119. 

  7119.     }
    7120. 

  7120. 

  7121. 

  7122. 

  7123. FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
    7124. 

  7124. ___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
    7125. 

  7125. __ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
    7126. 

  7126. if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
    7127. 

  7127. __ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
    7128. 

  7128. _fputc.ret = allocate([0], "i8", ALLOC_STATIC);
    7129. 

  7129. Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
    7130. 

  7130.   Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
    7131. 

  7131.   Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
    7132. 

  7132.   Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
    7133. 

  7133.   Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
    7134. 

  7134.   Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
    7135. 

  7135. _fgetc.ret = allocate([0], "i8", ALLOC_STATIC);
    7136. 

  7136. ___buildEnvironment(ENV);
    7137. 

  7137. STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
    7138. 

  7138. 

  7139. staticSealed = true; // seal the static portion of memory
    7140. 

  7140. 

  7141. STACK_MAX = STACK_BASE + 5242880;
    7142. 

  7142. 

  7143. DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
    7144. 

  7144. 

  7145. assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
    7146. 

  7146. 

  7147.  var ctlz_i8 = allocate([8,7,6,6,5,5,5,5,4,4,4,4,4,4,4,4,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_DYNAMIC);
    7148. 

  7148.  var cttz_i8 = allocate([8,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,7,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0], "i8", ALLOC_DYNAMIC);
    7149. 

  7149. 

  7150. var Math_min = Math.min;
    7151. 

  7151. function invoke_iiii(index,a1,a2,a3) {
    7152. 

  7152.   try {
    7153. 

  7153.     return Module["dynCall_iiii"](index,a1,a2,a3);
    7154. 

  7154.   } catch(e) {
    7155. 

  7155.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7156. 

  7156.     asm["setThrew"](1, 0);
    7157. 

  7157.   }
    7158. 

  7158. }
    7159. 

  7159. 

  7160. function invoke_vi(index,a1) {
    7161. 

  7161.   try {
    7162. 

  7162.     Module["dynCall_vi"](index,a1);
    7163. 

  7163.   } catch(e) {
    7164. 

  7164.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7165. 

  7165.     asm["setThrew"](1, 0);
    7166. 

  7166.   }
    7167. 

  7167. }
    7168. 

  7168. 

  7169. function invoke_vii(index,a1,a2) {
    7170. 

  7170.   try {
    7171. 

  7171.     Module["dynCall_vii"](index,a1,a2);
    7172. 

  7172.   } catch(e) {
    7173. 

  7173.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7174. 

  7174.     asm["setThrew"](1, 0);
    7175. 

  7175.   }
    7176. 

  7176. }
    7177. 

  7177. 

  7178. function invoke_ii(index,a1) {
    7179. 

  7179.   try {
    7180. 

  7180.     return Module["dynCall_ii"](index,a1);
    7181. 

  7181.   } catch(e) {
    7182. 

  7182.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7183. 

  7183.     asm["setThrew"](1, 0);
    7184. 

  7184.   }
    7185. 

  7185. }
    7186. 

  7186. 

  7187. function invoke_iiiii(index,a1,a2,a3,a4) {
    7188. 

  7188.   try {
    7189. 

  7189.     return Module["dynCall_iiiii"](index,a1,a2,a3,a4);
    7190. 

  7190.   } catch(e) {
    7191. 

  7191.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7192. 

  7192.     asm["setThrew"](1, 0);
    7193. 

  7193.   }
    7194. 

  7194. }
    7195. 

  7195. 

  7196. function invoke_iii(index,a1,a2) {
    7197. 

  7197.   try {
    7198. 

  7198.     return Module["dynCall_iii"](index,a1,a2);
    7199. 

  7199.   } catch(e) {
    7200. 

  7200.     if (typeof e !== 'number' && e !== 'longjmp') throw e;
    7201. 

  7201.     asm["setThrew"](1, 0);
    7202. 

  7202.   }
    7203. 

  7203. }
    7204. 

  7204. 

  7205. function asmPrintInt(x, y) {
    7206. 

  7206.   Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
    7207. 

  7207. }
    7208. 

  7208. function asmPrintFloat(x, y) {
    7209. 

  7209.   Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
    7210. 

  7210. }
    7211. 

  7211. // EMSCRIPTEN_START_ASM
    7212. 

  7212. var asm = (function(global, env, buffer) {
    7213. 

  7213.   'use asm';
    7214. 

  7214.   var HEAP8 = new global.Int8Array(buffer);
    7215. 

  7215.   var HEAP16 = new global.Int16Array(buffer);
    7216. 

  7216.   var HEAP32 = new global.Int32Array(buffer);
    7217. 

  7217.   var HEAPU8 = new global.Uint8Array(buffer);
    7218. 

  7218.   var HEAPU16 = new global.Uint16Array(buffer);
    7219. 

  7219.   var HEAPU32 = new global.Uint32Array(buffer);
    7220. 

  7220.   var HEAPF32 = new global.Float32Array(buffer);
    7221. 

  7221.   var HEAPF64 = new global.Float64Array(buffer);
    7222. 

  7222. 

  7223.   var STACKTOP=env.STACKTOP|0;
    7224. 

  7224.   var STACK_MAX=env.STACK_MAX|0;
    7225. 

  7225.   var tempDoublePtr=env.tempDoublePtr|0;
    7226. 

  7226.   var ABORT=env.ABORT|0;
    7227. 

  7227.   var cttz_i8=env.cttz_i8|0;
    7228. 

  7228.   var ctlz_i8=env.ctlz_i8|0;
    7229. 

  7229.   var ___rand_seed=env.___rand_seed|0;
    7230. 

  7230.   var _stderr=env._stderr|0;
    7231. 

  7231.   var _stdin=env._stdin|0;
    7232. 

  7232.   var _stdout=env._stdout|0;
    7233. 

  7233. 

  7234.   var __THREW__ = 0;
    7235. 

  7235.   var threwValue = 0;
    7236. 

  7236.   var setjmpId = 0;
    7237. 

  7237.   var undef = 0;
    7238. 

  7238.   var nan = +env.NaN, inf = +env.Infinity;
    7239. 

  7239.   var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
    7240. 

  7240. 

  7241.   var tempRet0 = 0;
    7242. 

  7242.   var tempRet1 = 0;
    7243. 

  7243.   var tempRet2 = 0;
    7244. 

  7244.   var tempRet3 = 0;
    7245. 

  7245.   var tempRet4 = 0;
    7246. 

  7246.   var tempRet5 = 0;
    7247. 

  7247.   var tempRet6 = 0;
    7248. 

  7248.   var tempRet7 = 0;
    7249. 

  7249.   var tempRet8 = 0;
    7250. 

  7250.   var tempRet9 = 0;
    7251. 

  7251.   var Math_floor=global.Math.floor;
    7252. 

  7252.   var Math_abs=global.Math.abs;
    7253. 

  7253.   var Math_sqrt=global.Math.sqrt;
    7254. 

  7254.   var Math_pow=global.Math.pow;
    7255. 

  7255.   var Math_cos=global.Math.cos;
    7256. 

  7256.   var Math_sin=global.Math.sin;
    7257. 

  7257.   var Math_tan=global.Math.tan;
    7258. 

  7258.   var Math_acos=global.Math.acos;
    7259. 

  7259.   var Math_asin=global.Math.asin;
    7260. 

  7260.   var Math_atan=global.Math.atan;
    7261. 

  7261.   var Math_atan2=global.Math.atan2;
    7262. 

  7262.   var Math_exp=global.Math.exp;
    7263. 

  7263.   var Math_log=global.Math.log;
    7264. 

  7264.   var Math_ceil=global.Math.ceil;
    7265. 

  7265.   var Math_imul=global.Math.imul;
    7266. 

  7266.   var abort=env.abort;
    7267. 

  7267.   var assert=env.assert;
    7268. 

  7268.   var asmPrintInt=env.asmPrintInt;
    7269. 

  7269.   var asmPrintFloat=env.asmPrintFloat;
    7270. 

  7270.   var Math_min=env.min;
    7271. 

  7271.   var invoke_iiii=env.invoke_iiii;
    7272. 

  7272.   var invoke_vi=env.invoke_vi;
    7273. 

  7273.   var invoke_vii=env.invoke_vii;
    7274. 

  7274.   var invoke_ii=env.invoke_ii;
    7275. 

  7275.   var invoke_iiiii=env.invoke_iiiii;
    7276. 

  7276.   var invoke_iii=env.invoke_iii;
    7277. 

  7277.   var _isalnum=env._isalnum;
    7278. 

  7278.   var _fabs=env._fabs;
    7279. 

  7279.   var _frexp=env._frexp;
    7280. 

  7280.   var _exp=env._exp;
    7281. 

  7281.   var _fread=env._fread;
    7282. 

  7282.   var __reallyNegative=env.__reallyNegative;
    7283. 

  7283.   var _longjmp=env._longjmp;
    7284. 

  7284.   var __addDays=env.__addDays;
    7285. 

  7285.   var _fsync=env._fsync;
    7286. 

  7286.   var _signal=env._signal;
    7287. 

  7287.   var _rename=env._rename;
    7288. 

  7288.   var _sbrk=env._sbrk;
    7289. 

  7289.   var _emscripten_memcpy_big=env._emscripten_memcpy_big;
    7290. 

  7290.   var _sinh=env._sinh;
    7291. 

  7291.   var _sysconf=env._sysconf;
    7292. 

  7292.   var _close=env._close;
    7293. 

  7293.   var _ferror=env._ferror;
    7294. 

  7294.   var _clock=env._clock;
    7295. 

  7295.   var _cos=env._cos;
    7296. 

  7296.   var _tanh=env._tanh;
    7297. 

  7297.   var _unlink=env._unlink;
    7298. 

  7298.   var _write=env._write;
    7299. 

  7299.   var __isLeapYear=env.__isLeapYear;
    7300. 

  7300.   var _ftell=env._ftell;
    7301. 

  7301.   var _isupper=env._isupper;
    7302. 

  7302.   var _gmtime_r=env._gmtime_r;
    7303. 

  7303.   var _islower=env._islower;
    7304. 

  7304.   var _tmpnam=env._tmpnam;
    7305. 

  7305.   var _tmpfile=env._tmpfile;
    7306. 

  7306.   var _send=env._send;
    7307. 

  7307.   var _abort=env._abort;
    7308. 

  7308.   var _setvbuf=env._setvbuf;
    7309. 

  7309.   var _atan2=env._atan2;
    7310. 

  7310.   var _setlocale=env._setlocale;
    7311. 

  7311.   var _isgraph=env._isgraph;
    7312. 

  7312.   var _modf=env._modf;
    7313. 

  7313.   var _strerror_r=env._strerror_r;
    7314. 

  7314.   var _fscanf=env._fscanf;
    7315. 

  7315.   var ___setErrNo=env.___setErrNo;
    7316. 

  7316.   var _isalpha=env._isalpha;
    7317. 

  7317.   var _srand=env._srand;
    7318. 

  7318.   var _mktime=env._mktime;
    7319. 

  7319.   var _putchar=env._putchar;
    7320. 

  7320.   var _gmtime=env._gmtime;
    7321. 

  7321.   var _localeconv=env._localeconv;
    7322. 

  7322.   var _sprintf=env._sprintf;
    7323. 

  7323.   var _localtime=env._localtime;
    7324. 

  7324.   var _read=env._read;
    7325. 

  7325.   var _fwrite=env._fwrite;
    7326. 

  7326.   var _time=env._time;
    7327. 

  7327.   var _fprintf=env._fprintf;
    7328. 

  7328.   var _exit=env._exit;
    7329. 

  7329.   var _freopen=env._freopen;
    7330. 

  7330.   var _llvm_pow_f64=env._llvm_pow_f64;
    7331. 

  7331.   var _fgetc=env._fgetc;
    7332. 

  7332.   var _fmod=env._fmod;
    7333. 

  7333.   var _lseek=env._lseek;
    7334. 

  7334.   var _rmdir=env._rmdir;
    7335. 

  7335.   var _asin=env._asin;
    7336. 

  7336.   var _floor=env._floor;
    7337. 

  7337.   var _pwrite=env._pwrite;
    7338. 

  7338.   var _localtime_r=env._localtime_r;
    7339. 

  7339.   var _tzset=env._tzset;
    7340. 

  7340.   var _open=env._open;
    7341. 

  7341.   var _remove=env._remove;
    7342. 

  7342.   var _snprintf=env._snprintf;
    7343. 

  7343.   var __scanString=env.__scanString;
    7344. 

  7344.   var _strftime=env._strftime;
    7345. 

  7345.   var _fseek=env._fseek;
    7346. 

  7346.   var _iscntrl=env._iscntrl;
    7347. 

  7347.   var _isxdigit=env._isxdigit;
    7348. 

  7348.   var _fclose=env._fclose;
    7349. 

  7349.   var _log=env._log;
    7350. 

  7350.   var _recv=env._recv;
    7351. 

  7351.   var _tan=env._tan;
    7352. 

  7352.   var _copysign=env._copysign;
    7353. 

  7353.   var __getFloat=env.__getFloat;
    7354. 

  7354.   var _fputc=env._fputc;
    7355. 

  7355.   var _ispunct=env._ispunct;
    7356. 

  7356.   var _ceil=env._ceil;
    7357. 

  7357.   var _isspace=env._isspace;
    7358. 

  7358.   var _fopen=env._fopen;
    7359. 

  7359.   var _sin=env._sin;
    7360. 

  7360.   var _acos=env._acos;
    7361. 

  7361.   var _cosh=env._cosh;
    7362. 

  7362.   var ___buildEnvironment=env.___buildEnvironment;
    7363. 

  7363.   var _difftime=env._difftime;
    7364. 

  7364.   var _ungetc=env._ungetc;
    7365. 

  7365.   var _system=env._system;
    7366. 

  7366.   var _fflush=env._fflush;
    7367. 

  7367.   var _log10=env._log10;
    7368. 

  7368.   var _fileno=env._fileno;
    7369. 

  7369.   var __exit=env.__exit;
    7370. 

  7370.   var __arraySum=env.__arraySum;
    7371. 

  7371.   var _fgets=env._fgets;
    7372. 

  7372.   var _atan=env._atan;
    7373. 

  7373.   var _pread=env._pread;
    7374. 

  7374.   var _mkport=env._mkport;
    7375. 

  7375.   var _toupper=env._toupper;
    7376. 

  7376.   var _feof=env._feof;
    7377. 

  7377.   var ___errno_location=env.___errno_location;
    7378. 

  7378.   var _clearerr=env._clearerr;
    7379. 

  7379.   var _getenv=env._getenv;
    7380. 

  7380.   var _strerror=env._strerror;
    7381. 

  7381.   var _emscripten_longjmp=env._emscripten_longjmp;
    7382. 

  7382.   var __formatString=env.__formatString;
    7383. 

  7383.   var _fputs=env._fputs;
    7384. 

  7384.   var _sqrt=env._sqrt;
    7385. 

  7385.   var tempFloat = 0.0;
    7386. 

  7386. 

  7387. // EMSCRIPTEN_START_FUNCS
    7388. 

  7388. function _malloc(i12) {
    7389. 

  7389.  i12 = i12 | 0;
    7390. 

  7390.  var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
    7391. 

  7391.  i1 = STACKTOP;
    7392. 

  7392.  do {
    7393. 

  7393.   if (i12 >>> 0 < 245) {
    7394. 

  7394.    if (i12 >>> 0 < 11) {
    7395. 

  7395.     i12 = 16;
    7396. 

  7396.    } else {
    7397. 

  7397.     i12 = i12 + 11 & -8;
    7398. 

  7398.    }
    7399. 

  7399.    i20 = i12 >>> 3;
    7400. 

  7400.    i18 = HEAP32[3228] | 0;
    7401. 

  7401.    i21 = i18 >>> i20;
    7402. 

  7402.    if ((i21 & 3 | 0) != 0) {
    7403. 

  7403.     i6 = (i21 & 1 ^ 1) + i20 | 0;
    7404. 

  7404.     i5 = i6 << 1;
    7405. 

  7405.     i3 = 12952 + (i5 << 2) | 0;
    7406. 

  7406.     i5 = 12952 + (i5 + 2 << 2) | 0;
    7407. 

  7407.     i7 = HEAP32[i5 >> 2] | 0;
    7408. 

  7408.     i2 = i7 + 8 | 0;
    7409. 

  7409.     i4 = HEAP32[i2 >> 2] | 0;
    7410. 

  7410.     do {
    7411. 

  7411.      if ((i3 | 0) != (i4 | 0)) {
    7412. 

  7412.       if (i4 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7413. 

  7413.        _abort();
    7414. 

  7414.       }
    7415. 

  7415.       i8 = i4 + 12 | 0;
    7416. 

  7416.       if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
    7417. 

  7417.        HEAP32[i8 >> 2] = i3;
    7418. 

  7418.        HEAP32[i5 >> 2] = i4;
    7419. 

  7419.        break;
    7420. 

  7420.       } else {
    7421. 

  7421.        _abort();
    7422. 

  7422.       }
    7423. 

  7423.      } else {
    7424. 

  7424.       HEAP32[3228] = i18 & ~(1 << i6);
    7425. 

  7425.      }
    7426. 

  7426.     } while (0);
    7427. 

  7427.     i32 = i6 << 3;
    7428. 

  7428.     HEAP32[i7 + 4 >> 2] = i32 | 3;
    7429. 

  7429.     i32 = i7 + (i32 | 4) | 0;
    7430. 

  7430.     HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
    7431. 

  7431.     i32 = i2;
    7432. 

  7432.     STACKTOP = i1;
    7433. 

  7433.     return i32 | 0;
    7434. 

  7434.    }
    7435. 

  7435.    if (i12 >>> 0 > (HEAP32[12920 >> 2] | 0) >>> 0) {
    7436. 

  7436.     if ((i21 | 0) != 0) {
    7437. 

  7437.      i7 = 2 << i20;
    7438. 

  7438.      i7 = i21 << i20 & (i7 | 0 - i7);
    7439. 

  7439.      i7 = (i7 & 0 - i7) + -1 | 0;
    7440. 

  7440.      i2 = i7 >>> 12 & 16;
    7441. 

  7441.      i7 = i7 >>> i2;
    7442. 

  7442.      i6 = i7 >>> 5 & 8;
    7443. 

  7443.      i7 = i7 >>> i6;
    7444. 

  7444.      i5 = i7 >>> 2 & 4;
    7445. 

  7445.      i7 = i7 >>> i5;
    7446. 

  7446.      i4 = i7 >>> 1 & 2;
    7447. 

  7447.      i7 = i7 >>> i4;
    7448. 

  7448.      i3 = i7 >>> 1 & 1;
    7449. 

  7449.      i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
    7450. 

  7450.      i7 = i3 << 1;
    7451. 

  7451.      i4 = 12952 + (i7 << 2) | 0;
    7452. 

  7452.      i7 = 12952 + (i7 + 2 << 2) | 0;
    7453. 

  7453.      i5 = HEAP32[i7 >> 2] | 0;
    7454. 

  7454.      i2 = i5 + 8 | 0;
    7455. 

  7455.      i6 = HEAP32[i2 >> 2] | 0;
    7456. 

  7456.      do {
    7457. 

  7457.       if ((i4 | 0) != (i6 | 0)) {
    7458. 

  7458.        if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7459. 

  7459.         _abort();
    7460. 

  7460.        }
    7461. 

  7461.        i8 = i6 + 12 | 0;
    7462. 

  7462.        if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
    7463. 

  7463.         HEAP32[i8 >> 2] = i4;
    7464. 

  7464.         HEAP32[i7 >> 2] = i6;
    7465. 

  7465.         break;
    7466. 

  7466.        } else {
    7467. 

  7467.         _abort();
    7468. 

  7468.        }
    7469. 

  7469.       } else {
    7470. 

  7470.        HEAP32[3228] = i18 & ~(1 << i3);
    7471. 

  7471.       }
    7472. 

  7472.      } while (0);
    7473. 

  7473.      i6 = i3 << 3;
    7474. 

  7474.      i4 = i6 - i12 | 0;
    7475. 

  7475.      HEAP32[i5 + 4 >> 2] = i12 | 3;
    7476. 

  7476.      i3 = i5 + i12 | 0;
    7477. 

  7477.      HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
    7478. 

  7478.      HEAP32[i5 + i6 >> 2] = i4;
    7479. 

  7479.      i6 = HEAP32[12920 >> 2] | 0;
    7480. 

  7480.      if ((i6 | 0) != 0) {
    7481. 

  7481.       i5 = HEAP32[12932 >> 2] | 0;
    7482. 

  7482.       i8 = i6 >>> 3;
    7483. 

  7483.       i9 = i8 << 1;
    7484. 

  7484.       i6 = 12952 + (i9 << 2) | 0;
    7485. 

  7485.       i7 = HEAP32[3228] | 0;
    7486. 

  7486.       i8 = 1 << i8;
    7487. 

  7487.       if ((i7 & i8 | 0) != 0) {
    7488. 

  7488.        i7 = 12952 + (i9 + 2 << 2) | 0;
    7489. 

  7489.        i8 = HEAP32[i7 >> 2] | 0;
    7490. 

  7490.        if (i8 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7491. 

  7491.         _abort();
    7492. 

  7492.        } else {
    7493. 

  7493.         i28 = i7;
    7494. 

  7494.         i27 = i8;
    7495. 

  7495.        }
    7496. 

  7496.       } else {
    7497. 

  7497.        HEAP32[3228] = i7 | i8;
    7498. 

  7498.        i28 = 12952 + (i9 + 2 << 2) | 0;
    7499. 

  7499.        i27 = i6;
    7500. 

  7500.       }
    7501. 

  7501.       HEAP32[i28 >> 2] = i5;
    7502. 

  7502.       HEAP32[i27 + 12 >> 2] = i5;
    7503. 

  7503.       HEAP32[i5 + 8 >> 2] = i27;
    7504. 

  7504.       HEAP32[i5 + 12 >> 2] = i6;
    7505. 

  7505.      }
    7506. 

  7506.      HEAP32[12920 >> 2] = i4;
    7507. 

  7507.      HEAP32[12932 >> 2] = i3;
    7508. 

  7508.      i32 = i2;
    7509. 

  7509.      STACKTOP = i1;
    7510. 

  7510.      return i32 | 0;
    7511. 

  7511.     }
    7512. 

  7512.     i18 = HEAP32[12916 >> 2] | 0;
    7513. 

  7513.     if ((i18 | 0) != 0) {
    7514. 

  7514.      i2 = (i18 & 0 - i18) + -1 | 0;
    7515. 

  7515.      i31 = i2 >>> 12 & 16;
    7516. 

  7516.      i2 = i2 >>> i31;
    7517. 

  7517.      i30 = i2 >>> 5 & 8;
    7518. 

  7518.      i2 = i2 >>> i30;
    7519. 

  7519.      i32 = i2 >>> 2 & 4;
    7520. 

  7520.      i2 = i2 >>> i32;
    7521. 

  7521.      i6 = i2 >>> 1 & 2;
    7522. 

  7522.      i2 = i2 >>> i6;
    7523. 

  7523.      i3 = i2 >>> 1 & 1;
    7524. 

  7524.      i3 = HEAP32[13216 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
    7525. 

  7525.      i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
    7526. 

  7526.      i6 = i3;
    7527. 

  7527.      while (1) {
    7528. 

  7528.       i5 = HEAP32[i6 + 16 >> 2] | 0;
    7529. 

  7529.       if ((i5 | 0) == 0) {
    7530. 

  7530.        i5 = HEAP32[i6 + 20 >> 2] | 0;
    7531. 

  7531.        if ((i5 | 0) == 0) {
    7532. 

  7532.         break;
    7533. 

  7533.        }
    7534. 

  7534.       }
    7535. 

  7535.       i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
    7536. 

  7536.       i4 = i6 >>> 0 < i2 >>> 0;
    7537. 

  7537.       i2 = i4 ? i6 : i2;
    7538. 

  7538.       i6 = i5;
    7539. 

  7539.       i3 = i4 ? i5 : i3;
    7540. 

  7540.      }
    7541. 

  7541.      i6 = HEAP32[12928 >> 2] | 0;
    7542. 

  7542.      if (i3 >>> 0 < i6 >>> 0) {
    7543. 

  7543.       _abort();
    7544. 

  7544.      }
    7545. 

  7545.      i4 = i3 + i12 | 0;
    7546. 

  7546.      if (!(i3 >>> 0 < i4 >>> 0)) {
    7547. 

  7547.       _abort();
    7548. 

  7548.      }
    7549. 

  7549.      i5 = HEAP32[i3 + 24 >> 2] | 0;
    7550. 

  7550.      i7 = HEAP32[i3 + 12 >> 2] | 0;
    7551. 

  7551.      do {
    7552. 

  7552.       if ((i7 | 0) == (i3 | 0)) {
    7553. 

  7553.        i8 = i3 + 20 | 0;
    7554. 

  7554.        i7 = HEAP32[i8 >> 2] | 0;
    7555. 

  7555.        if ((i7 | 0) == 0) {
    7556. 

  7556.         i8 = i3 + 16 | 0;
    7557. 

  7557.         i7 = HEAP32[i8 >> 2] | 0;
    7558. 

  7558.         if ((i7 | 0) == 0) {
    7559. 

  7559.          i26 = 0;
    7560. 

  7560.          break;
    7561. 

  7561.         }
    7562. 

  7562.        }
    7563. 

  7563.        while (1) {
    7564. 

  7564.         i10 = i7 + 20 | 0;
    7565. 

  7565.         i9 = HEAP32[i10 >> 2] | 0;
    7566. 

  7566.         if ((i9 | 0) != 0) {
    7567. 

  7567.          i7 = i9;
    7568. 

  7568.          i8 = i10;
    7569. 

  7569.          continue;
    7570. 

  7570.         }
    7571. 

  7571.         i10 = i7 + 16 | 0;
    7572. 

  7572.         i9 = HEAP32[i10 >> 2] | 0;
    7573. 

  7573.         if ((i9 | 0) == 0) {
    7574. 

  7574.          break;
    7575. 

  7575.         } else {
    7576. 

  7576.          i7 = i9;
    7577. 

  7577.          i8 = i10;
    7578. 

  7578.         }
    7579. 

  7579.        }
    7580. 

  7580.        if (i8 >>> 0 < i6 >>> 0) {
    7581. 

  7581.         _abort();
    7582. 

  7582.        } else {
    7583. 

  7583.         HEAP32[i8 >> 2] = 0;
    7584. 

  7584.         i26 = i7;
    7585. 

  7585.         break;
    7586. 

  7586.        }
    7587. 

  7587.       } else {
    7588. 

  7588.        i8 = HEAP32[i3 + 8 >> 2] | 0;
    7589. 

  7589.        if (i8 >>> 0 < i6 >>> 0) {
    7590. 

  7590.         _abort();
    7591. 

  7591.        }
    7592. 

  7592.        i6 = i8 + 12 | 0;
    7593. 

  7593.        if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
    7594. 

  7594.         _abort();
    7595. 

  7595.        }
    7596. 

  7596.        i9 = i7 + 8 | 0;
    7597. 

  7597.        if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
    7598. 

  7598.         HEAP32[i6 >> 2] = i7;
    7599. 

  7599.         HEAP32[i9 >> 2] = i8;
    7600. 

  7600.         i26 = i7;
    7601. 

  7601.         break;
    7602. 

  7602.        } else {
    7603. 

  7603.         _abort();
    7604. 

  7604.        }
    7605. 

  7605.       }
    7606. 

  7606.      } while (0);
    7607. 

  7607.      do {
    7608. 

  7608.       if ((i5 | 0) != 0) {
    7609. 

  7609.        i7 = HEAP32[i3 + 28 >> 2] | 0;
    7610. 

  7610.        i6 = 13216 + (i7 << 2) | 0;
    7611. 

  7611.        if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
    7612. 

  7612.         HEAP32[i6 >> 2] = i26;
    7613. 

  7613.         if ((i26 | 0) == 0) {
    7614. 

  7614.          HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i7);
    7615. 

  7615.          break;
    7616. 

  7616.         }
    7617. 

  7617.        } else {
    7618. 

  7618.         if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7619. 

  7619.          _abort();
    7620. 

  7620.         }
    7621. 

  7621.         i6 = i5 + 16 | 0;
    7622. 

  7622.         if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
    7623. 

  7623.          HEAP32[i6 >> 2] = i26;
    7624. 

  7624.         } else {
    7625. 

  7625.          HEAP32[i5 + 20 >> 2] = i26;
    7626. 

  7626.         }
    7627. 

  7627.         if ((i26 | 0) == 0) {
    7628. 

  7628.          break;
    7629. 

  7629.         }
    7630. 

  7630.        }
    7631. 

  7631.        if (i26 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7632. 

  7632.         _abort();
    7633. 

  7633.        }
    7634. 

  7634.        HEAP32[i26 + 24 >> 2] = i5;
    7635. 

  7635.        i5 = HEAP32[i3 + 16 >> 2] | 0;
    7636. 

  7636.        do {
    7637. 

  7637.         if ((i5 | 0) != 0) {
    7638. 

  7638.          if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7639. 

  7639.           _abort();
    7640. 

  7640.          } else {
    7641. 

  7641.           HEAP32[i26 + 16 >> 2] = i5;
    7642. 

  7642.           HEAP32[i5 + 24 >> 2] = i26;
    7643. 

  7643.           break;
    7644. 

  7644.          }
    7645. 

  7645.         }
    7646. 

  7646.        } while (0);
    7647. 

  7647.        i5 = HEAP32[i3 + 20 >> 2] | 0;
    7648. 

  7648.        if ((i5 | 0) != 0) {
    7649. 

  7649.         if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7650. 

  7650.          _abort();
    7651. 

  7651.         } else {
    7652. 

  7652.          HEAP32[i26 + 20 >> 2] = i5;
    7653. 

  7653.          HEAP32[i5 + 24 >> 2] = i26;
    7654. 

  7654.          break;
    7655. 

  7655.         }
    7656. 

  7656.        }
    7657. 

  7657.       }
    7658. 

  7658.      } while (0);
    7659. 

  7659.      if (i2 >>> 0 < 16) {
    7660. 

  7660.       i32 = i2 + i12 | 0;
    7661. 

  7661.       HEAP32[i3 + 4 >> 2] = i32 | 3;
    7662. 

  7662.       i32 = i3 + (i32 + 4) | 0;
    7663. 

  7663.       HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
    7664. 

  7664.      } else {
    7665. 

  7665.       HEAP32[i3 + 4 >> 2] = i12 | 3;
    7666. 

  7666.       HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
    7667. 

  7667.       HEAP32[i3 + (i2 + i12) >> 2] = i2;
    7668. 

  7668.       i6 = HEAP32[12920 >> 2] | 0;
    7669. 

  7669.       if ((i6 | 0) != 0) {
    7670. 

  7670.        i5 = HEAP32[12932 >> 2] | 0;
    7671. 

  7671.        i8 = i6 >>> 3;
    7672. 

  7672.        i9 = i8 << 1;
    7673. 

  7673.        i6 = 12952 + (i9 << 2) | 0;
    7674. 

  7674.        i7 = HEAP32[3228] | 0;
    7675. 

  7675.        i8 = 1 << i8;
    7676. 

  7676.        if ((i7 & i8 | 0) != 0) {
    7677. 

  7677.         i7 = 12952 + (i9 + 2 << 2) | 0;
    7678. 

  7678.         i8 = HEAP32[i7 >> 2] | 0;
    7679. 

  7679.         if (i8 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7680. 

  7680.          _abort();
    7681. 

  7681.         } else {
    7682. 

  7682.          i25 = i7;
    7683. 

  7683.          i24 = i8;
    7684. 

  7684.         }
    7685. 

  7685.        } else {
    7686. 

  7686.         HEAP32[3228] = i7 | i8;
    7687. 

  7687.         i25 = 12952 + (i9 + 2 << 2) | 0;
    7688. 

  7688.         i24 = i6;
    7689. 

  7689.        }
    7690. 

  7690.        HEAP32[i25 >> 2] = i5;
    7691. 

  7691.        HEAP32[i24 + 12 >> 2] = i5;
    7692. 

  7692.        HEAP32[i5 + 8 >> 2] = i24;
    7693. 

  7693.        HEAP32[i5 + 12 >> 2] = i6;
    7694. 

  7694.       }
    7695. 

  7695.       HEAP32[12920 >> 2] = i2;
    7696. 

  7696.       HEAP32[12932 >> 2] = i4;
    7697. 

  7697.      }
    7698. 

  7698.      i32 = i3 + 8 | 0;
    7699. 

  7699.      STACKTOP = i1;
    7700. 

  7700.      return i32 | 0;
    7701. 

  7701.     }
    7702. 

  7702.    }
    7703. 

  7703.   } else {
    7704. 

  7704.    if (!(i12 >>> 0 > 4294967231)) {
    7705. 

  7705.     i24 = i12 + 11 | 0;
    7706. 

  7706.     i12 = i24 & -8;
    7707. 

  7707.     i26 = HEAP32[12916 >> 2] | 0;
    7708. 

  7708.     if ((i26 | 0) != 0) {
    7709. 

  7709.      i25 = 0 - i12 | 0;
    7710. 

  7710.      i24 = i24 >>> 8;
    7711. 

  7711.      if ((i24 | 0) != 0) {
    7712. 

  7712.       if (i12 >>> 0 > 16777215) {
    7713. 

  7713.        i27 = 31;
    7714. 

  7714.       } else {
    7715. 

  7715.        i31 = (i24 + 1048320 | 0) >>> 16 & 8;
    7716. 

  7716.        i32 = i24 << i31;
    7717. 

  7717.        i30 = (i32 + 520192 | 0) >>> 16 & 4;
    7718. 

  7718.        i32 = i32 << i30;
    7719. 

  7719.        i27 = (i32 + 245760 | 0) >>> 16 & 2;
    7720. 

  7720.        i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
    7721. 

  7721.        i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
    7722. 

  7722.       }
    7723. 

  7723.      } else {
    7724. 

  7724.       i27 = 0;
    7725. 

  7725.      }
    7726. 

  7726.      i30 = HEAP32[13216 + (i27 << 2) >> 2] | 0;
    7727. 

  7727.      L126 : do {
    7728. 

  7728.       if ((i30 | 0) == 0) {
    7729. 

  7729.        i29 = 0;
    7730. 

  7730.        i24 = 0;
    7731. 

  7731.       } else {
    7732. 

  7732.        if ((i27 | 0) == 31) {
    7733. 

  7733.         i24 = 0;
    7734. 

  7734.        } else {
    7735. 

  7735.         i24 = 25 - (i27 >>> 1) | 0;
    7736. 

  7736.        }
    7737. 

  7737.        i29 = 0;
    7738. 

  7738.        i28 = i12 << i24;
    7739. 

  7739.        i24 = 0;
    7740. 

  7740.        while (1) {
    7741. 

  7741.         i32 = HEAP32[i30 + 4 >> 2] & -8;
    7742. 

  7742.         i31 = i32 - i12 | 0;
    7743. 

  7743.         if (i31 >>> 0 < i25 >>> 0) {
    7744. 

  7744.          if ((i32 | 0) == (i12 | 0)) {
    7745. 

  7745.           i25 = i31;
    7746. 

  7746.           i29 = i30;
    7747. 

  7747.           i24 = i30;
    7748. 

  7748.           break L126;
    7749. 

  7749.          } else {
    7750. 

  7750.           i25 = i31;
    7751. 

  7751.           i24 = i30;
    7752. 

  7752.          }
    7753. 

  7753.         }
    7754. 

  7754.         i31 = HEAP32[i30 + 20 >> 2] | 0;
    7755. 

  7755.         i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
    7756. 

  7756.         i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
    7757. 

  7757.         if ((i30 | 0) == 0) {
    7758. 

  7758.          break;
    7759. 

  7759.         } else {
    7760. 

  7760.          i28 = i28 << 1;
    7761. 

  7761.         }
    7762. 

  7762.        }
    7763. 

  7763.       }
    7764. 

  7764.      } while (0);
    7765. 

  7765.      if ((i29 | 0) == 0 & (i24 | 0) == 0) {
    7766. 

  7766.       i32 = 2 << i27;
    7767. 

  7767.       i26 = i26 & (i32 | 0 - i32);
    7768. 

  7768.       if ((i26 | 0) == 0) {
    7769. 

  7769.        break;
    7770. 

  7770.       }
    7771. 

  7771.       i32 = (i26 & 0 - i26) + -1 | 0;
    7772. 

  7772.       i28 = i32 >>> 12 & 16;
    7773. 

  7773.       i32 = i32 >>> i28;
    7774. 

  7774.       i27 = i32 >>> 5 & 8;
    7775. 

  7775.       i32 = i32 >>> i27;
    7776. 

  7776.       i30 = i32 >>> 2 & 4;
    7777. 

  7777.       i32 = i32 >>> i30;
    7778. 

  7778.       i31 = i32 >>> 1 & 2;
    7779. 

  7779.       i32 = i32 >>> i31;
    7780. 

  7780.       i29 = i32 >>> 1 & 1;
    7781. 

  7781.       i29 = HEAP32[13216 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
    7782. 

  7782.      }
    7783. 

  7783.      if ((i29 | 0) != 0) {
    7784. 

  7784.       while (1) {
    7785. 

  7785.        i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
    7786. 

  7786.        i26 = i27 >>> 0 < i25 >>> 0;
    7787. 

  7787.        i25 = i26 ? i27 : i25;
    7788. 

  7788.        i24 = i26 ? i29 : i24;
    7789. 

  7789.        i26 = HEAP32[i29 + 16 >> 2] | 0;
    7790. 

  7790.        if ((i26 | 0) != 0) {
    7791. 

  7791.         i29 = i26;
    7792. 

  7792.         continue;
    7793. 

  7793.        }
    7794. 

  7794.        i29 = HEAP32[i29 + 20 >> 2] | 0;
    7795. 

  7795.        if ((i29 | 0) == 0) {
    7796. 

  7796.         break;
    7797. 

  7797.        }
    7798. 

  7798.       }
    7799. 

  7799.      }
    7800. 

  7800.      if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[12920 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
    7801. 

  7801.       i4 = HEAP32[12928 >> 2] | 0;
    7802. 

  7802.       if (i24 >>> 0 < i4 >>> 0) {
    7803. 

  7803.        _abort();
    7804. 

  7804.       }
    7805. 

  7805.       i2 = i24 + i12 | 0;
    7806. 

  7806.       if (!(i24 >>> 0 < i2 >>> 0)) {
    7807. 

  7807.        _abort();
    7808. 

  7808.       }
    7809. 

  7809.       i3 = HEAP32[i24 + 24 >> 2] | 0;
    7810. 

  7810.       i6 = HEAP32[i24 + 12 >> 2] | 0;
    7811. 

  7811.       do {
    7812. 

  7812.        if ((i6 | 0) == (i24 | 0)) {
    7813. 

  7813.         i6 = i24 + 20 | 0;
    7814. 

  7814.         i5 = HEAP32[i6 >> 2] | 0;
    7815. 

  7815.         if ((i5 | 0) == 0) {
    7816. 

  7816.          i6 = i24 + 16 | 0;
    7817. 

  7817.          i5 = HEAP32[i6 >> 2] | 0;
    7818. 

  7818.          if ((i5 | 0) == 0) {
    7819. 

  7819.           i22 = 0;
    7820. 

  7820.           break;
    7821. 

  7821.          }
    7822. 

  7822.         }
    7823. 

  7823.         while (1) {
    7824. 

  7824.          i8 = i5 + 20 | 0;
    7825. 

  7825.          i7 = HEAP32[i8 >> 2] | 0;
    7826. 

  7826.          if ((i7 | 0) != 0) {
    7827. 

  7827.           i5 = i7;
    7828. 

  7828.           i6 = i8;
    7829. 

  7829.           continue;
    7830. 

  7830.          }
    7831. 

  7831.          i7 = i5 + 16 | 0;
    7832. 

  7832.          i8 = HEAP32[i7 >> 2] | 0;
    7833. 

  7833.          if ((i8 | 0) == 0) {
    7834. 

  7834.           break;
    7835. 

  7835.          } else {
    7836. 

  7836.           i5 = i8;
    7837. 

  7837.           i6 = i7;
    7838. 

  7838.          }
    7839. 

  7839.         }
    7840. 

  7840.         if (i6 >>> 0 < i4 >>> 0) {
    7841. 

  7841.          _abort();
    7842. 

  7842.         } else {
    7843. 

  7843.          HEAP32[i6 >> 2] = 0;
    7844. 

  7844.          i22 = i5;
    7845. 

  7845.          break;
    7846. 

  7846.         }
    7847. 

  7847.        } else {
    7848. 

  7848.         i5 = HEAP32[i24 + 8 >> 2] | 0;
    7849. 

  7849.         if (i5 >>> 0 < i4 >>> 0) {
    7850. 

  7850.          _abort();
    7851. 

  7851.         }
    7852. 

  7852.         i7 = i5 + 12 | 0;
    7853. 

  7853.         if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
    7854. 

  7854.          _abort();
    7855. 

  7855.         }
    7856. 

  7856.         i4 = i6 + 8 | 0;
    7857. 

  7857.         if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
    7858. 

  7858.          HEAP32[i7 >> 2] = i6;
    7859. 

  7859.          HEAP32[i4 >> 2] = i5;
    7860. 

  7860.          i22 = i6;
    7861. 

  7861.          break;
    7862. 

  7862.         } else {
    7863. 

  7863.          _abort();
    7864. 

  7864.         }
    7865. 

  7865.        }
    7866. 

  7866.       } while (0);
    7867. 

  7867.       do {
    7868. 

  7868.        if ((i3 | 0) != 0) {
    7869. 

  7869.         i4 = HEAP32[i24 + 28 >> 2] | 0;
    7870. 

  7870.         i5 = 13216 + (i4 << 2) | 0;
    7871. 

  7871.         if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
    7872. 

  7872.          HEAP32[i5 >> 2] = i22;
    7873. 

  7873.          if ((i22 | 0) == 0) {
    7874. 

  7874.           HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i4);
    7875. 

  7875.           break;
    7876. 

  7876.          }
    7877. 

  7877.         } else {
    7878. 

  7878.          if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7879. 

  7879.           _abort();
    7880. 

  7880.          }
    7881. 

  7881.          i4 = i3 + 16 | 0;
    7882. 

  7882.          if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
    7883. 

  7883.           HEAP32[i4 >> 2] = i22;
    7884. 

  7884.          } else {
    7885. 

  7885.           HEAP32[i3 + 20 >> 2] = i22;
    7886. 

  7886.          }
    7887. 

  7887.          if ((i22 | 0) == 0) {
    7888. 

  7888.           break;
    7889. 

  7889.          }
    7890. 

  7890.         }
    7891. 

  7891.         if (i22 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7892. 

  7892.          _abort();
    7893. 

  7893.         }
    7894. 

  7894.         HEAP32[i22 + 24 >> 2] = i3;
    7895. 

  7895.         i3 = HEAP32[i24 + 16 >> 2] | 0;
    7896. 

  7896.         do {
    7897. 

  7897.          if ((i3 | 0) != 0) {
    7898. 

  7898.           if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7899. 

  7899.            _abort();
    7900. 

  7900.           } else {
    7901. 

  7901.            HEAP32[i22 + 16 >> 2] = i3;
    7902. 

  7902.            HEAP32[i3 + 24 >> 2] = i22;
    7903. 

  7903.            break;
    7904. 

  7904.           }
    7905. 

  7905.          }
    7906. 

  7906.         } while (0);
    7907. 

  7907.         i3 = HEAP32[i24 + 20 >> 2] | 0;
    7908. 

  7908.         if ((i3 | 0) != 0) {
    7909. 

  7909.          if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7910. 

  7910.           _abort();
    7911. 

  7911.          } else {
    7912. 

  7912.           HEAP32[i22 + 20 >> 2] = i3;
    7913. 

  7913.           HEAP32[i3 + 24 >> 2] = i22;
    7914. 

  7914.           break;
    7915. 

  7915.          }
    7916. 

  7916.         }
    7917. 

  7917.        }
    7918. 

  7918.       } while (0);
    7919. 

  7919.       L204 : do {
    7920. 

  7920.        if (!(i25 >>> 0 < 16)) {
    7921. 

  7921.         HEAP32[i24 + 4 >> 2] = i12 | 3;
    7922. 

  7922.         HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
    7923. 

  7923.         HEAP32[i24 + (i25 + i12) >> 2] = i25;
    7924. 

  7924.         i4 = i25 >>> 3;
    7925. 

  7925.         if (i25 >>> 0 < 256) {
    7926. 

  7926.          i6 = i4 << 1;
    7927. 

  7927.          i3 = 12952 + (i6 << 2) | 0;
    7928. 

  7928.          i5 = HEAP32[3228] | 0;
    7929. 

  7929.          i4 = 1 << i4;
    7930. 

  7930.          if ((i5 & i4 | 0) != 0) {
    7931. 

  7931.           i5 = 12952 + (i6 + 2 << 2) | 0;
    7932. 

  7932.           i4 = HEAP32[i5 >> 2] | 0;
    7933. 

  7933.           if (i4 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    7934. 

  7934.            _abort();
    7935. 

  7935.           } else {
    7936. 

  7936.            i21 = i5;
    7937. 

  7937.            i20 = i4;
    7938. 

  7938.           }
    7939. 

  7939.          } else {
    7940. 

  7940.           HEAP32[3228] = i5 | i4;
    7941. 

  7941.           i21 = 12952 + (i6 + 2 << 2) | 0;
    7942. 

  7942.           i20 = i3;
    7943. 

  7943.          }
    7944. 

  7944.          HEAP32[i21 >> 2] = i2;
    7945. 

  7945.          HEAP32[i20 + 12 >> 2] = i2;
    7946. 

  7946.          HEAP32[i24 + (i12 + 8) >> 2] = i20;
    7947. 

  7947.          HEAP32[i24 + (i12 + 12) >> 2] = i3;
    7948. 

  7948.          break;
    7949. 

  7949.         }
    7950. 

  7950.         i3 = i25 >>> 8;
    7951. 

  7951.         if ((i3 | 0) != 0) {
    7952. 

  7952.          if (i25 >>> 0 > 16777215) {
    7953. 

  7953.           i3 = 31;
    7954. 

  7954.          } else {
    7955. 

  7955.           i31 = (i3 + 1048320 | 0) >>> 16 & 8;
    7956. 

  7956.           i32 = i3 << i31;
    7957. 

  7957.           i30 = (i32 + 520192 | 0) >>> 16 & 4;
    7958. 

  7958.           i32 = i32 << i30;
    7959. 

  7959.           i3 = (i32 + 245760 | 0) >>> 16 & 2;
    7960. 

  7960.           i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
    7961. 

  7961.           i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
    7962. 

  7962.          }
    7963. 

  7963.         } else {
    7964. 

  7964.          i3 = 0;
    7965. 

  7965.         }
    7966. 

  7966.         i6 = 13216 + (i3 << 2) | 0;
    7967. 

  7967.         HEAP32[i24 + (i12 + 28) >> 2] = i3;
    7968. 

  7968.         HEAP32[i24 + (i12 + 20) >> 2] = 0;
    7969. 

  7969.         HEAP32[i24 + (i12 + 16) >> 2] = 0;
    7970. 

  7970.         i4 = HEAP32[12916 >> 2] | 0;
    7971. 

  7971.         i5 = 1 << i3;
    7972. 

  7972.         if ((i4 & i5 | 0) == 0) {
    7973. 

  7973.          HEAP32[12916 >> 2] = i4 | i5;
    7974. 

  7974.          HEAP32[i6 >> 2] = i2;
    7975. 

  7975.          HEAP32[i24 + (i12 + 24) >> 2] = i6;
    7976. 

  7976.          HEAP32[i24 + (i12 + 12) >> 2] = i2;
    7977. 

  7977.          HEAP32[i24 + (i12 + 8) >> 2] = i2;
    7978. 

  7978.          break;
    7979. 

  7979.         }
    7980. 

  7980.         i4 = HEAP32[i6 >> 2] | 0;
    7981. 

  7981.         if ((i3 | 0) == 31) {
    7982. 

  7982.          i3 = 0;
    7983. 

  7983.         } else {
    7984. 

  7984.          i3 = 25 - (i3 >>> 1) | 0;
    7985. 

  7985.         }
    7986. 

  7986.         L225 : do {
    7987. 

  7987.          if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
    7988. 

  7988.           i3 = i25 << i3;
    7989. 

  7989.           while (1) {
    7990. 

  7990.            i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
    7991. 

  7991.            i5 = HEAP32[i6 >> 2] | 0;
    7992. 

  7992.            if ((i5 | 0) == 0) {
    7993. 

  7993.             break;
    7994. 

  7994.            }
    7995. 

  7995.            if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
    7996. 

  7996.             i18 = i5;
    7997. 

  7997.             break L225;
    7998. 

  7998.            } else {
    7999. 

  7999.             i3 = i3 << 1;
    8000. 

  8000.             i4 = i5;
    8001. 

  8001.            }
    8002. 

  8002.           }
    8003. 

  8003.           if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8004. 

  8004.            _abort();
    8005. 

  8005.           } else {
    8006. 

  8006.            HEAP32[i6 >> 2] = i2;
    8007. 

  8007.            HEAP32[i24 + (i12 + 24) >> 2] = i4;
    8008. 

  8008.            HEAP32[i24 + (i12 + 12) >> 2] = i2;
    8009. 

  8009.            HEAP32[i24 + (i12 + 8) >> 2] = i2;
    8010. 

  8010.            break L204;
    8011. 

  8011.           }
    8012. 

  8012.          } else {
    8013. 

  8013.           i18 = i4;
    8014. 

  8014.          }
    8015. 

  8015.         } while (0);
    8016. 

  8016.         i4 = i18 + 8 | 0;
    8017. 

  8017.         i3 = HEAP32[i4 >> 2] | 0;
    8018. 

  8018.         i5 = HEAP32[12928 >> 2] | 0;
    8019. 

  8019.         if (i18 >>> 0 < i5 >>> 0) {
    8020. 

  8020.          _abort();
    8021. 

  8021.         }
    8022. 

  8022.         if (i3 >>> 0 < i5 >>> 0) {
    8023. 

  8023.          _abort();
    8024. 

  8024.         } else {
    8025. 

  8025.          HEAP32[i3 + 12 >> 2] = i2;
    8026. 

  8026.          HEAP32[i4 >> 2] = i2;
    8027. 

  8027.          HEAP32[i24 + (i12 + 8) >> 2] = i3;
    8028. 

  8028.          HEAP32[i24 + (i12 + 12) >> 2] = i18;
    8029. 

  8029.          HEAP32[i24 + (i12 + 24) >> 2] = 0;
    8030. 

  8030.          break;
    8031. 

  8031.         }
    8032. 

  8032.        } else {
    8033. 

  8033.         i32 = i25 + i12 | 0;
    8034. 

  8034.         HEAP32[i24 + 4 >> 2] = i32 | 3;
    8035. 

  8035.         i32 = i24 + (i32 + 4) | 0;
    8036. 

  8036.         HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
    8037. 

  8037.        }
    8038. 

  8038.       } while (0);
    8039. 

  8039.       i32 = i24 + 8 | 0;
    8040. 

  8040.       STACKTOP = i1;
    8041. 

  8041.       return i32 | 0;
    8042. 

  8042.      }
    8043. 

  8043.     }
    8044. 

  8044.    } else {
    8045. 

  8045.     i12 = -1;
    8046. 

  8046.    }
    8047. 

  8047.   }
    8048. 

  8048.  } while (0);
    8049. 

  8049.  i18 = HEAP32[12920 >> 2] | 0;
    8050. 

  8050.  if (!(i12 >>> 0 > i18 >>> 0)) {
    8051. 

  8051.   i3 = i18 - i12 | 0;
    8052. 

  8052.   i2 = HEAP32[12932 >> 2] | 0;
    8053. 

  8053.   if (i3 >>> 0 > 15) {
    8054. 

  8054.    HEAP32[12932 >> 2] = i2 + i12;
    8055. 

  8055.    HEAP32[12920 >> 2] = i3;
    8056. 

  8056.    HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
    8057. 

  8057.    HEAP32[i2 + i18 >> 2] = i3;
    8058. 

  8058.    HEAP32[i2 + 4 >> 2] = i12 | 3;
    8059. 

  8059.   } else {
    8060. 

  8060.    HEAP32[12920 >> 2] = 0;
    8061. 

  8061.    HEAP32[12932 >> 2] = 0;
    8062. 

  8062.    HEAP32[i2 + 4 >> 2] = i18 | 3;
    8063. 

  8063.    i32 = i2 + (i18 + 4) | 0;
    8064. 

  8064.    HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
    8065. 

  8065.   }
    8066. 

  8066.   i32 = i2 + 8 | 0;
    8067. 

  8067.   STACKTOP = i1;
    8068. 

  8068.   return i32 | 0;
    8069. 

  8069.  }
    8070. 

  8070.  i18 = HEAP32[12924 >> 2] | 0;
    8071. 

  8071.  if (i12 >>> 0 < i18 >>> 0) {
    8072. 

  8072.   i31 = i18 - i12 | 0;
    8073. 

  8073.   HEAP32[12924 >> 2] = i31;
    8074. 

  8074.   i32 = HEAP32[12936 >> 2] | 0;
    8075. 

  8075.   HEAP32[12936 >> 2] = i32 + i12;
    8076. 

  8076.   HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
    8077. 

  8077.   HEAP32[i32 + 4 >> 2] = i12 | 3;
    8078. 

  8078.   i32 = i32 + 8 | 0;
    8079. 

  8079.   STACKTOP = i1;
    8080. 

  8080.   return i32 | 0;
    8081. 

  8081.  }
    8082. 

  8082.  do {
    8083. 

  8083.   if ((HEAP32[3346] | 0) == 0) {
    8084. 

  8084.    i18 = _sysconf(30) | 0;
    8085. 

  8085.    if ((i18 + -1 & i18 | 0) == 0) {
    8086. 

  8086.     HEAP32[13392 >> 2] = i18;
    8087. 

  8087.     HEAP32[13388 >> 2] = i18;
    8088. 

  8088.     HEAP32[13396 >> 2] = -1;
    8089. 

  8089.     HEAP32[13400 >> 2] = -1;
    8090. 

  8090.     HEAP32[13404 >> 2] = 0;
    8091. 

  8091.     HEAP32[13356 >> 2] = 0;
    8092. 

  8092.     HEAP32[3346] = (_time(0) | 0) & -16 ^ 1431655768;
    8093. 

  8093.     break;
    8094. 

  8094.    } else {
    8095. 

  8095.     _abort();
    8096. 

  8096.    }
    8097. 

  8097.   }
    8098. 

  8098.  } while (0);
    8099. 

  8099.  i20 = i12 + 48 | 0;
    8100. 

  8100.  i25 = HEAP32[13392 >> 2] | 0;
    8101. 

  8101.  i21 = i12 + 47 | 0;
    8102. 

  8102.  i22 = i25 + i21 | 0;
    8103. 

  8103.  i25 = 0 - i25 | 0;
    8104. 

  8104.  i18 = i22 & i25;
    8105. 

  8105.  if (!(i18 >>> 0 > i12 >>> 0)) {
    8106. 

  8106.   i32 = 0;
    8107. 

  8107.   STACKTOP = i1;
    8108. 

  8108.   return i32 | 0;
    8109. 

  8109.  }
    8110. 

  8110.  i24 = HEAP32[13352 >> 2] | 0;
    8111. 

  8111.  if ((i24 | 0) != 0 ? (i31 = HEAP32[13344 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
    8112. 

  8112.   i32 = 0;
    8113. 

  8113.   STACKTOP = i1;
    8114. 

  8114.   return i32 | 0;
    8115. 

  8115.  }
    8116. 

  8116.  L269 : do {
    8117. 

  8117.   if ((HEAP32[13356 >> 2] & 4 | 0) == 0) {
    8118. 

  8118.    i26 = HEAP32[12936 >> 2] | 0;
    8119. 

  8119.    L271 : do {
    8120. 

  8120.     if ((i26 | 0) != 0) {
    8121. 

  8121.      i24 = 13360 | 0;
    8122. 

  8122.      while (1) {
    8123. 

  8123.       i27 = HEAP32[i24 >> 2] | 0;
    8124. 

  8124.       if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
    8125. 

  8125.        break;
    8126. 

  8126.       }
    8127. 

  8127.       i24 = HEAP32[i24 + 8 >> 2] | 0;
    8128. 

  8128.       if ((i24 | 0) == 0) {
    8129. 

  8129.        i13 = 182;
    8130. 

  8130.        break L271;
    8131. 

  8131.       }
    8132. 

  8132.      }
    8133. 

  8133.      if ((i24 | 0) != 0) {
    8134. 

  8134.       i25 = i22 - (HEAP32[12924 >> 2] | 0) & i25;
    8135. 

  8135.       if (i25 >>> 0 < 2147483647) {
    8136. 

  8136.        i13 = _sbrk(i25 | 0) | 0;
    8137. 

  8137.        i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
    8138. 

  8138.        i22 = i13;
    8139. 

  8139.        i24 = i25;
    8140. 

  8140.        i23 = i26 ? i13 : -1;
    8141. 

  8141.        i25 = i26 ? i25 : 0;
    8142. 

  8142.        i13 = 191;
    8143. 

  8143.       } else {
    8144. 

  8144.        i25 = 0;
    8145. 

  8145.       }
    8146. 

  8146.      } else {
    8147. 

  8147.       i13 = 182;
    8148. 

  8148.      }
    8149. 

  8149.     } else {
    8150. 

  8150.      i13 = 182;
    8151. 

  8151.     }
    8152. 

  8152.    } while (0);
    8153. 

  8153.    do {
    8154. 

  8154.     if ((i13 | 0) == 182) {
    8155. 

  8155.      i23 = _sbrk(0) | 0;
    8156. 

  8156.      if ((i23 | 0) != (-1 | 0)) {
    8157. 

  8157.       i24 = i23;
    8158. 

  8158.       i22 = HEAP32[13388 >> 2] | 0;
    8159. 

  8159.       i25 = i22 + -1 | 0;
    8160. 

  8160.       if ((i25 & i24 | 0) == 0) {
    8161. 

  8161.        i25 = i18;
    8162. 

  8162.       } else {
    8163. 

  8163.        i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
    8164. 

  8164.       }
    8165. 

  8165.       i24 = HEAP32[13344 >> 2] | 0;
    8166. 

  8166.       i26 = i24 + i25 | 0;
    8167. 

  8167.       if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
    8168. 

  8168.        i22 = HEAP32[13352 >> 2] | 0;
    8169. 

  8169.        if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
    8170. 

  8170.         i25 = 0;
    8171. 

  8171.         break;
    8172. 

  8172.        }
    8173. 

  8173.        i22 = _sbrk(i25 | 0) | 0;
    8174. 

  8174.        i13 = (i22 | 0) == (i23 | 0);
    8175. 

  8175.        i24 = i25;
    8176. 

  8176.        i23 = i13 ? i23 : -1;
    8177. 

  8177.        i25 = i13 ? i25 : 0;
    8178. 

  8178.        i13 = 191;
    8179. 

  8179.       } else {
    8180. 

  8180.        i25 = 0;
    8181. 

  8181.       }
    8182. 

  8182.      } else {
    8183. 

  8183.       i25 = 0;
    8184. 

  8184.      }
    8185. 

  8185.     }
    8186. 

  8186.    } while (0);
    8187. 

  8187.    L291 : do {
    8188. 

  8188.     if ((i13 | 0) == 191) {
    8189. 

  8189.      i13 = 0 - i24 | 0;
    8190. 

  8190.      if ((i23 | 0) != (-1 | 0)) {
    8191. 

  8191.       i17 = i23;
    8192. 

  8192.       i14 = i25;
    8193. 

  8193.       i13 = 202;
    8194. 

  8194.       break L269;
    8195. 

  8195.      }
    8196. 

  8196.      do {
    8197. 

  8197.       if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[13392 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
    8198. 

  8198.        if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
    8199. 

  8199.         _sbrk(i13 | 0) | 0;
    8200. 

  8200.         break L291;
    8201. 

  8201.        } else {
    8202. 

  8202.         i24 = i19 + i24 | 0;
    8203. 

  8203.         break;
    8204. 

  8204.        }
    8205. 

  8205.       }
    8206. 

  8206.      } while (0);
    8207. 

  8207.      if ((i22 | 0) != (-1 | 0)) {
    8208. 

  8208.       i17 = i22;
    8209. 

  8209.       i14 = i24;
    8210. 

  8210.       i13 = 202;
    8211. 

  8211.       break L269;
    8212. 

  8212.      }
    8213. 

  8213.     }
    8214. 

  8214.    } while (0);
    8215. 

  8215.    HEAP32[13356 >> 2] = HEAP32[13356 >> 2] | 4;
    8216. 

  8216.    i13 = 199;
    8217. 

  8217.   } else {
    8218. 

  8218.    i25 = 0;
    8219. 

  8219.    i13 = 199;
    8220. 

  8220.   }
    8221. 

  8221.  } while (0);
    8222. 

  8222.  if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
    8223. 

  8223.   i14 = i14 ? i15 : i25;
    8224. 

  8224.   i13 = 202;
    8225. 

  8225.  }
    8226. 

  8226.  if ((i13 | 0) == 202) {
    8227. 

  8227.   i15 = (HEAP32[13344 >> 2] | 0) + i14 | 0;
    8228. 

  8228.   HEAP32[13344 >> 2] = i15;
    8229. 

  8229.   if (i15 >>> 0 > (HEAP32[13348 >> 2] | 0) >>> 0) {
    8230. 

  8230.    HEAP32[13348 >> 2] = i15;
    8231. 

  8231.   }
    8232. 

  8232.   i15 = HEAP32[12936 >> 2] | 0;
    8233. 

  8233.   L311 : do {
    8234. 

  8234.    if ((i15 | 0) != 0) {
    8235. 

  8235.     i21 = 13360 | 0;
    8236. 

  8236.     while (1) {
    8237. 

  8237.      i16 = HEAP32[i21 >> 2] | 0;
    8238. 

  8238.      i19 = i21 + 4 | 0;
    8239. 

  8239.      i20 = HEAP32[i19 >> 2] | 0;
    8240. 

  8240.      if ((i17 | 0) == (i16 + i20 | 0)) {
    8241. 

  8241.       i13 = 214;
    8242. 

  8242.       break;
    8243. 

  8243.      }
    8244. 

  8244.      i18 = HEAP32[i21 + 8 >> 2] | 0;
    8245. 

  8245.      if ((i18 | 0) == 0) {
    8246. 

  8246.       break;
    8247. 

  8247.      } else {
    8248. 

  8248.       i21 = i18;
    8249. 

  8249.      }
    8250. 

  8250.     }
    8251. 

  8251.     if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
    8252. 

  8252.      HEAP32[i19 >> 2] = i20 + i14;
    8253. 

  8253.      i2 = (HEAP32[12924 >> 2] | 0) + i14 | 0;
    8254. 

  8254.      i3 = i15 + 8 | 0;
    8255. 

  8255.      if ((i3 & 7 | 0) == 0) {
    8256. 

  8256.       i3 = 0;
    8257. 

  8257.      } else {
    8258. 

  8258.       i3 = 0 - i3 & 7;
    8259. 

  8259.      }
    8260. 

  8260.      i32 = i2 - i3 | 0;
    8261. 

  8261.      HEAP32[12936 >> 2] = i15 + i3;
    8262. 

  8262.      HEAP32[12924 >> 2] = i32;
    8263. 

  8263.      HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
    8264. 

  8264.      HEAP32[i15 + (i2 + 4) >> 2] = 40;
    8265. 

  8265.      HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
    8266. 

  8266.      break;
    8267. 

  8267.     }
    8268. 

  8268.     if (i17 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8269. 

  8269.      HEAP32[12928 >> 2] = i17;
    8270. 

  8270.     }
    8271. 

  8271.     i19 = i17 + i14 | 0;
    8272. 

  8272.     i16 = 13360 | 0;
    8273. 

  8273.     while (1) {
    8274. 

  8274.      if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
    8275. 

  8275.       i13 = 224;
    8276. 

  8276.       break;
    8277. 

  8277.      }
    8278. 

  8278.      i18 = HEAP32[i16 + 8 >> 2] | 0;
    8279. 

  8279.      if ((i18 | 0) == 0) {
    8280. 

  8280.       break;
    8281. 

  8281.      } else {
    8282. 

  8282.       i16 = i18;
    8283. 

  8283.      }
    8284. 

  8284.     }
    8285. 

  8285.     if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
    8286. 

  8286.      HEAP32[i16 >> 2] = i17;
    8287. 

  8287.      i6 = i16 + 4 | 0;
    8288. 

  8288.      HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
    8289. 

  8289.      i6 = i17 + 8 | 0;
    8290. 

  8290.      if ((i6 & 7 | 0) == 0) {
    8291. 

  8291.       i6 = 0;
    8292. 

  8292.      } else {
    8293. 

  8293.       i6 = 0 - i6 & 7;
    8294. 

  8294.      }
    8295. 

  8295.      i7 = i17 + (i14 + 8) | 0;
    8296. 

  8296.      if ((i7 & 7 | 0) == 0) {
    8297. 

  8297.       i13 = 0;
    8298. 

  8298.      } else {
    8299. 

  8299.       i13 = 0 - i7 & 7;
    8300. 

  8300.      }
    8301. 

  8301.      i15 = i17 + (i13 + i14) | 0;
    8302. 

  8302.      i8 = i6 + i12 | 0;
    8303. 

  8303.      i7 = i17 + i8 | 0;
    8304. 

  8304.      i10 = i15 - (i17 + i6) - i12 | 0;
    8305. 

  8305.      HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
    8306. 

  8306.      L348 : do {
    8307. 

  8307.       if ((i15 | 0) != (HEAP32[12936 >> 2] | 0)) {
    8308. 

  8308.        if ((i15 | 0) == (HEAP32[12932 >> 2] | 0)) {
    8309. 

  8309.         i32 = (HEAP32[12920 >> 2] | 0) + i10 | 0;
    8310. 

  8310.         HEAP32[12920 >> 2] = i32;
    8311. 

  8311.         HEAP32[12932 >> 2] = i7;
    8312. 

  8312.         HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
    8313. 

  8313.         HEAP32[i17 + (i32 + i8) >> 2] = i32;
    8314. 

  8314.         break;
    8315. 

  8315.        }
    8316. 

  8316.        i12 = i14 + 4 | 0;
    8317. 

  8317.        i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
    8318. 

  8318.        if ((i18 & 3 | 0) == 1) {
    8319. 

  8319.         i11 = i18 & -8;
    8320. 

  8320.         i16 = i18 >>> 3;
    8321. 

  8321.         do {
    8322. 

  8322.          if (!(i18 >>> 0 < 256)) {
    8323. 

  8323.           i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
    8324. 

  8324.           i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
    8325. 

  8325.           do {
    8326. 

  8326.            if ((i19 | 0) == (i15 | 0)) {
    8327. 

  8327.             i19 = i13 | 16;
    8328. 

  8328.             i18 = i17 + (i12 + i19) | 0;
    8329. 

  8329.             i16 = HEAP32[i18 >> 2] | 0;
    8330. 

  8330.             if ((i16 | 0) == 0) {
    8331. 

  8331.              i18 = i17 + (i19 + i14) | 0;
    8332. 

  8332.              i16 = HEAP32[i18 >> 2] | 0;
    8333. 

  8333.              if ((i16 | 0) == 0) {
    8334. 

  8334.               i5 = 0;
    8335. 

  8335.               break;
    8336. 

  8336.              }
    8337. 

  8337.             }
    8338. 

  8338.             while (1) {
    8339. 

  8339.              i20 = i16 + 20 | 0;
    8340. 

  8340.              i19 = HEAP32[i20 >> 2] | 0;
    8341. 

  8341.              if ((i19 | 0) != 0) {
    8342. 

  8342.               i16 = i19;
    8343. 

  8343.               i18 = i20;
    8344. 

  8344.               continue;
    8345. 

  8345.              }
    8346. 

  8346.              i19 = i16 + 16 | 0;
    8347. 

  8347.              i20 = HEAP32[i19 >> 2] | 0;
    8348. 

  8348.              if ((i20 | 0) == 0) {
    8349. 

  8349.               break;
    8350. 

  8350.              } else {
    8351. 

  8351.               i16 = i20;
    8352. 

  8352.               i18 = i19;
    8353. 

  8353.              }
    8354. 

  8354.             }
    8355. 

  8355.             if (i18 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8356. 

  8356.              _abort();
    8357. 

  8357.             } else {
    8358. 

  8358.              HEAP32[i18 >> 2] = 0;
    8359. 

  8359.              i5 = i16;
    8360. 

  8360.              break;
    8361. 

  8361.             }
    8362. 

  8362.            } else {
    8363. 

  8363.             i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
    8364. 

  8364.             if (i18 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8365. 

  8365.              _abort();
    8366. 

  8366.             }
    8367. 

  8367.             i16 = i18 + 12 | 0;
    8368. 

  8368.             if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
    8369. 

  8369.              _abort();
    8370. 

  8370.             }
    8371. 

  8371.             i20 = i19 + 8 | 0;
    8372. 

  8372.             if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
    8373. 

  8373.              HEAP32[i16 >> 2] = i19;
    8374. 

  8374.              HEAP32[i20 >> 2] = i18;
    8375. 

  8375.              i5 = i19;
    8376. 

  8376.              break;
    8377. 

  8377.             } else {
    8378. 

  8378.              _abort();
    8379. 

  8379.             }
    8380. 

  8380.            }
    8381. 

  8381.           } while (0);
    8382. 

  8382.           if ((i9 | 0) != 0) {
    8383. 

  8383.            i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
    8384. 

  8384.            i18 = 13216 + (i16 << 2) | 0;
    8385. 

  8385.            if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
    8386. 

  8386.             HEAP32[i18 >> 2] = i5;
    8387. 

  8387.             if ((i5 | 0) == 0) {
    8388. 

  8388.              HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i16);
    8389. 

  8389.              break;
    8390. 

  8390.             }
    8391. 

  8391.            } else {
    8392. 

  8392.             if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8393. 

  8393.              _abort();
    8394. 

  8394.             }
    8395. 

  8395.             i16 = i9 + 16 | 0;
    8396. 

  8396.             if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
    8397. 

  8397.              HEAP32[i16 >> 2] = i5;
    8398. 

  8398.             } else {
    8399. 

  8399.              HEAP32[i9 + 20 >> 2] = i5;
    8400. 

  8400.             }
    8401. 

  8401.             if ((i5 | 0) == 0) {
    8402. 

  8402.              break;
    8403. 

  8403.             }
    8404. 

  8404.            }
    8405. 

  8405.            if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8406. 

  8406.             _abort();
    8407. 

  8407.            }
    8408. 

  8408.            HEAP32[i5 + 24 >> 2] = i9;
    8409. 

  8409.            i15 = i13 | 16;
    8410. 

  8410.            i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
    8411. 

  8411.            do {
    8412. 

  8412.             if ((i9 | 0) != 0) {
    8413. 

  8413.              if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8414. 

  8414.               _abort();
    8415. 

  8415.              } else {
    8416. 

  8416.               HEAP32[i5 + 16 >> 2] = i9;
    8417. 

  8417.               HEAP32[i9 + 24 >> 2] = i5;
    8418. 

  8418.               break;
    8419. 

  8419.              }
    8420. 

  8420.             }
    8421. 

  8421.            } while (0);
    8422. 

  8422.            i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
    8423. 

  8423.            if ((i9 | 0) != 0) {
    8424. 

  8424.             if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8425. 

  8425.              _abort();
    8426. 

  8426.             } else {
    8427. 

  8427.              HEAP32[i5 + 20 >> 2] = i9;
    8428. 

  8428.              HEAP32[i9 + 24 >> 2] = i5;
    8429. 

  8429.              break;
    8430. 

  8430.             }
    8431. 

  8431.            }
    8432. 

  8432.           }
    8433. 

  8433.          } else {
    8434. 

  8434.           i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
    8435. 

  8435.           i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
    8436. 

  8436.           i18 = 12952 + (i16 << 1 << 2) | 0;
    8437. 

  8437.           if ((i5 | 0) != (i18 | 0)) {
    8438. 

  8438.            if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8439. 

  8439.             _abort();
    8440. 

  8440.            }
    8441. 

  8441.            if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
    8442. 

  8442.             _abort();
    8443. 

  8443.            }
    8444. 

  8444.           }
    8445. 

  8445.           if ((i12 | 0) == (i5 | 0)) {
    8446. 

  8446.            HEAP32[3228] = HEAP32[3228] & ~(1 << i16);
    8447. 

  8447.            break;
    8448. 

  8448.           }
    8449. 

  8449.           if ((i12 | 0) != (i18 | 0)) {
    8450. 

  8450.            if (i12 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8451. 

  8451.             _abort();
    8452. 

  8452.            }
    8453. 

  8453.            i16 = i12 + 8 | 0;
    8454. 

  8454.            if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
    8455. 

  8455.             i9 = i16;
    8456. 

  8456.            } else {
    8457. 

  8457.             _abort();
    8458. 

  8458.            }
    8459. 

  8459.           } else {
    8460. 

  8460.            i9 = i12 + 8 | 0;
    8461. 

  8461.           }
    8462. 

  8462.           HEAP32[i5 + 12 >> 2] = i12;
    8463. 

  8463.           HEAP32[i9 >> 2] = i5;
    8464. 

  8464.          }
    8465. 

  8465.         } while (0);
    8466. 

  8466.         i15 = i17 + ((i11 | i13) + i14) | 0;
    8467. 

  8467.         i10 = i11 + i10 | 0;
    8468. 

  8468.        }
    8469. 

  8469.        i5 = i15 + 4 | 0;
    8470. 

  8470.        HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
    8471. 

  8471.        HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
    8472. 

  8472.        HEAP32[i17 + (i10 + i8) >> 2] = i10;
    8473. 

  8473.        i5 = i10 >>> 3;
    8474. 

  8474.        if (i10 >>> 0 < 256) {
    8475. 

  8475.         i10 = i5 << 1;
    8476. 

  8476.         i2 = 12952 + (i10 << 2) | 0;
    8477. 

  8477.         i9 = HEAP32[3228] | 0;
    8478. 

  8478.         i5 = 1 << i5;
    8479. 

  8479.         if ((i9 & i5 | 0) != 0) {
    8480. 

  8480.          i9 = 12952 + (i10 + 2 << 2) | 0;
    8481. 

  8481.          i5 = HEAP32[i9 >> 2] | 0;
    8482. 

  8482.          if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8483. 

  8483.           _abort();
    8484. 

  8484.          } else {
    8485. 

  8485.           i3 = i9;
    8486. 

  8486.           i4 = i5;
    8487. 

  8487.          }
    8488. 

  8488.         } else {
    8489. 

  8489.          HEAP32[3228] = i9 | i5;
    8490. 

  8490.          i3 = 12952 + (i10 + 2 << 2) | 0;
    8491. 

  8491.          i4 = i2;
    8492. 

  8492.         }
    8493. 

  8493.         HEAP32[i3 >> 2] = i7;
    8494. 

  8494.         HEAP32[i4 + 12 >> 2] = i7;
    8495. 

  8495.         HEAP32[i17 + (i8 + 8) >> 2] = i4;
    8496. 

  8496.         HEAP32[i17 + (i8 + 12) >> 2] = i2;
    8497. 

  8497.         break;
    8498. 

  8498.        }
    8499. 

  8499.        i3 = i10 >>> 8;
    8500. 

  8500.        if ((i3 | 0) != 0) {
    8501. 

  8501.         if (i10 >>> 0 > 16777215) {
    8502. 

  8502.          i3 = 31;
    8503. 

  8503.         } else {
    8504. 

  8504.          i31 = (i3 + 1048320 | 0) >>> 16 & 8;
    8505. 

  8505.          i32 = i3 << i31;
    8506. 

  8506.          i30 = (i32 + 520192 | 0) >>> 16 & 4;
    8507. 

  8507.          i32 = i32 << i30;
    8508. 

  8508.          i3 = (i32 + 245760 | 0) >>> 16 & 2;
    8509. 

  8509.          i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
    8510. 

  8510.          i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
    8511. 

  8511.         }
    8512. 

  8512.        } else {
    8513. 

  8513.         i3 = 0;
    8514. 

  8514.        }
    8515. 

  8515.        i4 = 13216 + (i3 << 2) | 0;
    8516. 

  8516.        HEAP32[i17 + (i8 + 28) >> 2] = i3;
    8517. 

  8517.        HEAP32[i17 + (i8 + 20) >> 2] = 0;
    8518. 

  8518.        HEAP32[i17 + (i8 + 16) >> 2] = 0;
    8519. 

  8519.        i9 = HEAP32[12916 >> 2] | 0;
    8520. 

  8520.        i5 = 1 << i3;
    8521. 

  8521.        if ((i9 & i5 | 0) == 0) {
    8522. 

  8522.         HEAP32[12916 >> 2] = i9 | i5;
    8523. 

  8523.         HEAP32[i4 >> 2] = i7;
    8524. 

  8524.         HEAP32[i17 + (i8 + 24) >> 2] = i4;
    8525. 

  8525.         HEAP32[i17 + (i8 + 12) >> 2] = i7;
    8526. 

  8526.         HEAP32[i17 + (i8 + 8) >> 2] = i7;
    8527. 

  8527.         break;
    8528. 

  8528.        }
    8529. 

  8529.        i4 = HEAP32[i4 >> 2] | 0;
    8530. 

  8530.        if ((i3 | 0) == 31) {
    8531. 

  8531.         i3 = 0;
    8532. 

  8532.        } else {
    8533. 

  8533.         i3 = 25 - (i3 >>> 1) | 0;
    8534. 

  8534.        }
    8535. 

  8535.        L445 : do {
    8536. 

  8536.         if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
    8537. 

  8537.          i3 = i10 << i3;
    8538. 

  8538.          while (1) {
    8539. 

  8539.           i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
    8540. 

  8540.           i9 = HEAP32[i5 >> 2] | 0;
    8541. 

  8541.           if ((i9 | 0) == 0) {
    8542. 

  8542.            break;
    8543. 

  8543.           }
    8544. 

  8544.           if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
    8545. 

  8545.            i2 = i9;
    8546. 

  8546.            break L445;
    8547. 

  8547.           } else {
    8548. 

  8548.            i3 = i3 << 1;
    8549. 

  8549.            i4 = i9;
    8550. 

  8550.           }
    8551. 

  8551.          }
    8552. 

  8552.          if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8553. 

  8553.           _abort();
    8554. 

  8554.          } else {
    8555. 

  8555.           HEAP32[i5 >> 2] = i7;
    8556. 

  8556.           HEAP32[i17 + (i8 + 24) >> 2] = i4;
    8557. 

  8557.           HEAP32[i17 + (i8 + 12) >> 2] = i7;
    8558. 

  8558.           HEAP32[i17 + (i8 + 8) >> 2] = i7;
    8559. 

  8559.           break L348;
    8560. 

  8560.          }
    8561. 

  8561.         } else {
    8562. 

  8562.          i2 = i4;
    8563. 

  8563.         }
    8564. 

  8564.        } while (0);
    8565. 

  8565.        i4 = i2 + 8 | 0;
    8566. 

  8566.        i3 = HEAP32[i4 >> 2] | 0;
    8567. 

  8567.        i5 = HEAP32[12928 >> 2] | 0;
    8568. 

  8568.        if (i2 >>> 0 < i5 >>> 0) {
    8569. 

  8569.         _abort();
    8570. 

  8570.        }
    8571. 

  8571.        if (i3 >>> 0 < i5 >>> 0) {
    8572. 

  8572.         _abort();
    8573. 

  8573.        } else {
    8574. 

  8574.         HEAP32[i3 + 12 >> 2] = i7;
    8575. 

  8575.         HEAP32[i4 >> 2] = i7;
    8576. 

  8576.         HEAP32[i17 + (i8 + 8) >> 2] = i3;
    8577. 

  8577.         HEAP32[i17 + (i8 + 12) >> 2] = i2;
    8578. 

  8578.         HEAP32[i17 + (i8 + 24) >> 2] = 0;
    8579. 

  8579.         break;
    8580. 

  8580.        }
    8581. 

  8581.       } else {
    8582. 

  8582.        i32 = (HEAP32[12924 >> 2] | 0) + i10 | 0;
    8583. 

  8583.        HEAP32[12924 >> 2] = i32;
    8584. 

  8584.        HEAP32[12936 >> 2] = i7;
    8585. 

  8585.        HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
    8586. 

  8586.       }
    8587. 

  8587.      } while (0);
    8588. 

  8588.      i32 = i17 + (i6 | 8) | 0;
    8589. 

  8589.      STACKTOP = i1;
    8590. 

  8590.      return i32 | 0;
    8591. 

  8591.     }
    8592. 

  8592.     i3 = 13360 | 0;
    8593. 

  8593.     while (1) {
    8594. 

  8594.      i2 = HEAP32[i3 >> 2] | 0;
    8595. 

  8595.      if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
    8596. 

  8596.       break;
    8597. 

  8597.      }
    8598. 

  8598.      i3 = HEAP32[i3 + 8 >> 2] | 0;
    8599. 

  8599.     }
    8600. 

  8600.     i3 = i2 + (i11 + -39) | 0;
    8601. 

  8601.     if ((i3 & 7 | 0) == 0) {
    8602. 

  8602.      i3 = 0;
    8603. 

  8603.     } else {
    8604. 

  8604.      i3 = 0 - i3 & 7;
    8605. 

  8605.     }
    8606. 

  8606.     i2 = i2 + (i11 + -47 + i3) | 0;
    8607. 

  8607.     i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
    8608. 

  8608.     i3 = i2 + 8 | 0;
    8609. 

  8609.     i4 = i17 + 8 | 0;
    8610. 

  8610.     if ((i4 & 7 | 0) == 0) {
    8611. 

  8611.      i4 = 0;
    8612. 

  8612.     } else {
    8613. 

  8613.      i4 = 0 - i4 & 7;
    8614. 

  8614.     }
    8615. 

  8615.     i32 = i14 + -40 - i4 | 0;
    8616. 

  8616.     HEAP32[12936 >> 2] = i17 + i4;
    8617. 

  8617.     HEAP32[12924 >> 2] = i32;
    8618. 

  8618.     HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
    8619. 

  8619.     HEAP32[i17 + (i14 + -36) >> 2] = 40;
    8620. 

  8620.     HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
    8621. 

  8621.     HEAP32[i2 + 4 >> 2] = 27;
    8622. 

  8622.     HEAP32[i3 + 0 >> 2] = HEAP32[13360 >> 2];
    8623. 

  8623.     HEAP32[i3 + 4 >> 2] = HEAP32[13364 >> 2];
    8624. 

  8624.     HEAP32[i3 + 8 >> 2] = HEAP32[13368 >> 2];
    8625. 

  8625.     HEAP32[i3 + 12 >> 2] = HEAP32[13372 >> 2];
    8626. 

  8626.     HEAP32[13360 >> 2] = i17;
    8627. 

  8627.     HEAP32[13364 >> 2] = i14;
    8628. 

  8628.     HEAP32[13372 >> 2] = 0;
    8629. 

  8629.     HEAP32[13368 >> 2] = i3;
    8630. 

  8630.     i4 = i2 + 28 | 0;
    8631. 

  8631.     HEAP32[i4 >> 2] = 7;
    8632. 

  8632.     if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
    8633. 

  8633.      while (1) {
    8634. 

  8634.       i3 = i4 + 4 | 0;
    8635. 

  8635.       HEAP32[i3 >> 2] = 7;
    8636. 

  8636.       if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
    8637. 

  8637.        i4 = i3;
    8638. 

  8638.       } else {
    8639. 

  8639.        break;
    8640. 

  8640.       }
    8641. 

  8641.      }
    8642. 

  8642.     }
    8643. 

  8643.     if ((i2 | 0) != (i15 | 0)) {
    8644. 

  8644.      i2 = i2 - i15 | 0;
    8645. 

  8645.      i3 = i15 + (i2 + 4) | 0;
    8646. 

  8646.      HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
    8647. 

  8647.      HEAP32[i15 + 4 >> 2] = i2 | 1;
    8648. 

  8648.      HEAP32[i15 + i2 >> 2] = i2;
    8649. 

  8649.      i3 = i2 >>> 3;
    8650. 

  8650.      if (i2 >>> 0 < 256) {
    8651. 

  8651.       i4 = i3 << 1;
    8652. 

  8652.       i2 = 12952 + (i4 << 2) | 0;
    8653. 

  8653.       i5 = HEAP32[3228] | 0;
    8654. 

  8654.       i3 = 1 << i3;
    8655. 

  8655.       if ((i5 & i3 | 0) != 0) {
    8656. 

  8656.        i4 = 12952 + (i4 + 2 << 2) | 0;
    8657. 

  8657.        i3 = HEAP32[i4 >> 2] | 0;
    8658. 

  8658.        if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8659. 

  8659.         _abort();
    8660. 

  8660.        } else {
    8661. 

  8661.         i7 = i4;
    8662. 

  8662.         i8 = i3;
    8663. 

  8663.        }
    8664. 

  8664.       } else {
    8665. 

  8665.        HEAP32[3228] = i5 | i3;
    8666. 

  8666.        i7 = 12952 + (i4 + 2 << 2) | 0;
    8667. 

  8667.        i8 = i2;
    8668. 

  8668.       }
    8669. 

  8669.       HEAP32[i7 >> 2] = i15;
    8670. 

  8670.       HEAP32[i8 + 12 >> 2] = i15;
    8671. 

  8671.       HEAP32[i15 + 8 >> 2] = i8;
    8672. 

  8672.       HEAP32[i15 + 12 >> 2] = i2;
    8673. 

  8673.       break;
    8674. 

  8674.      }
    8675. 

  8675.      i3 = i2 >>> 8;
    8676. 

  8676.      if ((i3 | 0) != 0) {
    8677. 

  8677.       if (i2 >>> 0 > 16777215) {
    8678. 

  8678.        i3 = 31;
    8679. 

  8679.       } else {
    8680. 

  8680.        i31 = (i3 + 1048320 | 0) >>> 16 & 8;
    8681. 

  8681.        i32 = i3 << i31;
    8682. 

  8682.        i30 = (i32 + 520192 | 0) >>> 16 & 4;
    8683. 

  8683.        i32 = i32 << i30;
    8684. 

  8684.        i3 = (i32 + 245760 | 0) >>> 16 & 2;
    8685. 

  8685.        i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
    8686. 

  8686.        i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
    8687. 

  8687.       }
    8688. 

  8688.      } else {
    8689. 

  8689.       i3 = 0;
    8690. 

  8690.      }
    8691. 

  8691.      i7 = 13216 + (i3 << 2) | 0;
    8692. 

  8692.      HEAP32[i15 + 28 >> 2] = i3;
    8693. 

  8693.      HEAP32[i15 + 20 >> 2] = 0;
    8694. 

  8694.      HEAP32[i15 + 16 >> 2] = 0;
    8695. 

  8695.      i4 = HEAP32[12916 >> 2] | 0;
    8696. 

  8696.      i5 = 1 << i3;
    8697. 

  8697.      if ((i4 & i5 | 0) == 0) {
    8698. 

  8698.       HEAP32[12916 >> 2] = i4 | i5;
    8699. 

  8699.       HEAP32[i7 >> 2] = i15;
    8700. 

  8700.       HEAP32[i15 + 24 >> 2] = i7;
    8701. 

  8701.       HEAP32[i15 + 12 >> 2] = i15;
    8702. 

  8702.       HEAP32[i15 + 8 >> 2] = i15;
    8703. 

  8703.       break;
    8704. 

  8704.      }
    8705. 

  8705.      i4 = HEAP32[i7 >> 2] | 0;
    8706. 

  8706.      if ((i3 | 0) == 31) {
    8707. 

  8707.       i3 = 0;
    8708. 

  8708.      } else {
    8709. 

  8709.       i3 = 25 - (i3 >>> 1) | 0;
    8710. 

  8710.      }
    8711. 

  8711.      L499 : do {
    8712. 

  8712.       if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
    8713. 

  8713.        i3 = i2 << i3;
    8714. 

  8714.        while (1) {
    8715. 

  8715.         i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
    8716. 

  8716.         i5 = HEAP32[i7 >> 2] | 0;
    8717. 

  8717.         if ((i5 | 0) == 0) {
    8718. 

  8718.          break;
    8719. 

  8719.         }
    8720. 

  8720.         if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
    8721. 

  8721.          i6 = i5;
    8722. 

  8722.          break L499;
    8723. 

  8723.         } else {
    8724. 

  8724.          i3 = i3 << 1;
    8725. 

  8725.          i4 = i5;
    8726. 

  8726.         }
    8727. 

  8727.        }
    8728. 

  8728.        if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    8729. 

  8729.         _abort();
    8730. 

  8730.        } else {
    8731. 

  8731.         HEAP32[i7 >> 2] = i15;
    8732. 

  8732.         HEAP32[i15 + 24 >> 2] = i4;
    8733. 

  8733.         HEAP32[i15 + 12 >> 2] = i15;
    8734. 

  8734.         HEAP32[i15 + 8 >> 2] = i15;
    8735. 

  8735.         break L311;
    8736. 

  8736.        }
    8737. 

  8737.       } else {
    8738. 

  8738.        i6 = i4;
    8739. 

  8739.       }
    8740. 

  8740.      } while (0);
    8741. 

  8741.      i4 = i6 + 8 | 0;
    8742. 

  8742.      i3 = HEAP32[i4 >> 2] | 0;
    8743. 

  8743.      i2 = HEAP32[12928 >> 2] | 0;
    8744. 

  8744.      if (i6 >>> 0 < i2 >>> 0) {
    8745. 

  8745.       _abort();
    8746. 

  8746.      }
    8747. 

  8747.      if (i3 >>> 0 < i2 >>> 0) {
    8748. 

  8748.       _abort();
    8749. 

  8749.      } else {
    8750. 

  8750.       HEAP32[i3 + 12 >> 2] = i15;
    8751. 

  8751.       HEAP32[i4 >> 2] = i15;
    8752. 

  8752.       HEAP32[i15 + 8 >> 2] = i3;
    8753. 

  8753.       HEAP32[i15 + 12 >> 2] = i6;
    8754. 

  8754.       HEAP32[i15 + 24 >> 2] = 0;
    8755. 

  8755.       break;
    8756. 

  8756.      }
    8757. 

  8757.     }
    8758. 

  8758.    } else {
    8759. 

  8759.     i32 = HEAP32[12928 >> 2] | 0;
    8760. 

  8760.     if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
    8761. 

  8761.      HEAP32[12928 >> 2] = i17;
    8762. 

  8762.     }
    8763. 

  8763.     HEAP32[13360 >> 2] = i17;
    8764. 

  8764.     HEAP32[13364 >> 2] = i14;
    8765. 

  8765.     HEAP32[13372 >> 2] = 0;
    8766. 

  8766.     HEAP32[12948 >> 2] = HEAP32[3346];
    8767. 

  8767.     HEAP32[12944 >> 2] = -1;
    8768. 

  8768.     i2 = 0;
    8769. 

  8769.     do {
    8770. 

  8770.      i32 = i2 << 1;
    8771. 

  8771.      i31 = 12952 + (i32 << 2) | 0;
    8772. 

  8772.      HEAP32[12952 + (i32 + 3 << 2) >> 2] = i31;
    8773. 

  8773.      HEAP32[12952 + (i32 + 2 << 2) >> 2] = i31;
    8774. 

  8774.      i2 = i2 + 1 | 0;
    8775. 

  8775.     } while ((i2 | 0) != 32);
    8776. 

  8776.     i2 = i17 + 8 | 0;
    8777. 

  8777.     if ((i2 & 7 | 0) == 0) {
    8778. 

  8778.      i2 = 0;
    8779. 

  8779.     } else {
    8780. 

  8780.      i2 = 0 - i2 & 7;
    8781. 

  8781.     }
    8782. 

  8782.     i32 = i14 + -40 - i2 | 0;
    8783. 

  8783.     HEAP32[12936 >> 2] = i17 + i2;
    8784. 

  8784.     HEAP32[12924 >> 2] = i32;
    8785. 

  8785.     HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
    8786. 

  8786.     HEAP32[i17 + (i14 + -36) >> 2] = 40;
    8787. 

  8787.     HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
    8788. 

  8788.    }
    8789. 

  8789.   } while (0);
    8790. 

  8790.   i2 = HEAP32[12924 >> 2] | 0;
    8791. 

  8791.   if (i2 >>> 0 > i12 >>> 0) {
    8792. 

  8792.    i31 = i2 - i12 | 0;
    8793. 

  8793.    HEAP32[12924 >> 2] = i31;
    8794. 

  8794.    i32 = HEAP32[12936 >> 2] | 0;
    8795. 

  8795.    HEAP32[12936 >> 2] = i32 + i12;
    8796. 

  8796.    HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
    8797. 

  8797.    HEAP32[i32 + 4 >> 2] = i12 | 3;
    8798. 

  8798.    i32 = i32 + 8 | 0;
    8799. 

  8799.    STACKTOP = i1;
    8800. 

  8800.    return i32 | 0;
    8801. 

  8801.   }
    8802. 

  8802.  }
    8803. 

  8803.  HEAP32[(___errno_location() | 0) >> 2] = 12;
    8804. 

  8804.  i32 = 0;
    8805. 

  8805.  STACKTOP = i1;
    8806. 

  8806.  return i32 | 0;
    8807. 

  8807. }
    8808. 

  8808. function _llex(i2, i3) {
    8809. 

  8809.  i2 = i2 | 0;
    8810. 

  8810.  i3 = i3 | 0;
    8811. 

  8811.  var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0;
    8812. 

  8812.  i1 = STACKTOP;
    8813. 

  8813.  STACKTOP = STACKTOP + 16 | 0;
    8814. 

  8814.  i12 = i1;
    8815. 

  8815.  i4 = i2 + 60 | 0;
    8816. 

  8816.  HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
    8817. 

  8817.  i5 = i2 + 56 | 0;
    8818. 

  8818.  L1 : while (1) {
    8819. 

  8819.   i13 = HEAP32[i2 >> 2] | 0;
    8820. 

  8820.   L3 : while (1) {
    8821. 

  8821.    switch (i13 | 0) {
    8822. 

  8822.    case 11:
    8823. 

  8823.    case 9:
    8824. 

  8824.    case 12:
    8825. 

  8825.    case 32:
    8826. 

  8826.     {
    8827. 

  8827.      break;
    8828. 

  8828.     }
    8829. 

  8829.    case 91:
    8830. 

  8830.     {
    8831. 

  8831.      i9 = 25;
    8832. 

  8832.      break L1;
    8833. 

  8833.     }
    8834. 

  8834.    case 62:
    8835. 

  8835.     {
    8836. 

  8836.      i9 = 45;
    8837. 

  8837.      break L1;
    8838. 

  8838.     }
    8839. 

  8839.    case 46:
    8840. 

  8840.     {
    8841. 

  8841.      i9 = 161;
    8842. 

  8842.      break L1;
    8843. 

  8843.     }
    8844. 

  8844.    case 13:
    8845. 

  8845.    case 10:
    8846. 

  8846.     {
    8847. 

  8847.      i9 = 4;
    8848. 

  8848.      break L3;
    8849. 

  8849.     }
    8850. 

  8850.    case 45:
    8851. 

  8851.     {
    8852. 

  8852.      break L3;
    8853. 

  8853.     }
    8854. 

  8854.    case 61:
    8855. 

  8855.     {
    8856. 

  8856.      i9 = 29;
    8857. 

  8857.      break L1;
    8858. 

  8858.     }
    8859. 

  8859.    case 39:
    8860. 

  8860.    case 34:
    8861. 

  8861.     {
    8862. 

  8862.      i9 = 69;
    8863. 

  8863.      break L1;
    8864. 

  8864.     }
    8865. 

  8865.    case 126:
    8866. 

  8866.     {
    8867. 

  8867.      i9 = 53;
    8868. 

  8868.      break L1;
    8869. 

  8869.     }
    8870. 

  8870.    case 60:
    8871. 

  8871.     {
    8872. 

  8872.      i9 = 37;
    8873. 

  8873.      break L1;
    8874. 

  8874.     }
    8875. 

  8875.    case 58:
    8876. 

  8876.     {
    8877. 

  8877.      i9 = 61;
    8878. 

  8878.      break L1;
    8879. 

  8879.     }
    8880. 

  8880.    case 57:
    8881. 

  8881.    case 56:
    8882. 

  8882.    case 55:
    8883. 

  8883.    case 54:
    8884. 

  8884.    case 53:
    8885. 

  8885.    case 52:
    8886. 

  8886.    case 51:
    8887. 

  8887.    case 50:
    8888. 

  8888.    case 49:
    8889. 

  8889.    case 48:
    8890. 

  8890.     {
    8891. 

  8891.      i20 = i13;
    8892. 

  8892.      break L1;
    8893. 

  8893.     }
    8894. 

  8894.    case -1:
    8895. 

  8895.     {
    8896. 

  8896.      i2 = 286;
    8897. 

  8897.      i9 = 306;
    8898. 

  8898.      break L1;
    8899. 

  8899.     }
    8900. 

  8900.    default:
    8901. 

  8901.     {
    8902. 

  8902.      i9 = 283;
    8903. 

  8903.      break L1;
    8904. 

  8904.     }
    8905. 

  8905.    }
    8906. 

  8906.    i13 = HEAP32[i5 >> 2] | 0;
    8907. 

  8907.    i27 = HEAP32[i13 >> 2] | 0;
    8908. 

  8908.    HEAP32[i13 >> 2] = i27 + -1;
    8909. 

  8909.    if ((i27 | 0) == 0) {
    8910. 

  8910.     i13 = _luaZ_fill(i13) | 0;
    8911. 

  8911.    } else {
    8912. 

  8912.     i27 = i13 + 4 | 0;
    8913. 

  8913.     i13 = HEAP32[i27 >> 2] | 0;
    8914. 

  8914.     HEAP32[i27 >> 2] = i13 + 1;
    8915. 

  8915.     i13 = HEAPU8[i13] | 0;
    8916. 

  8916.    }
    8917. 

  8917.    HEAP32[i2 >> 2] = i13;
    8918. 

  8918.   }
    8919. 

  8919.   if ((i9 | 0) == 4) {
    8920. 

  8920.    i9 = 0;
    8921. 

  8921.    _inclinenumber(i2);
    8922. 

  8922.    continue;
    8923. 

  8923.   }
    8924. 

  8924.   i13 = HEAP32[i5 >> 2] | 0;
    8925. 

  8925.   i27 = HEAP32[i13 >> 2] | 0;
    8926. 

  8926.   HEAP32[i13 >> 2] = i27 + -1;
    8927. 

  8927.   if ((i27 | 0) == 0) {
    8928. 

  8928.    i13 = _luaZ_fill(i13) | 0;
    8929. 

  8929.   } else {
    8930. 

  8930.    i27 = i13 + 4 | 0;
    8931. 

  8931.    i13 = HEAP32[i27 >> 2] | 0;
    8932. 

  8932.    HEAP32[i27 >> 2] = i13 + 1;
    8933. 

  8933.    i13 = HEAPU8[i13] | 0;
    8934. 

  8934.   }
    8935. 

  8935.   HEAP32[i2 >> 2] = i13;
    8936. 

  8936.   if ((i13 | 0) != 45) {
    8937. 

  8937.    i2 = 45;
    8938. 

  8938.    i9 = 306;
    8939. 

  8939.    break;
    8940. 

  8940.   }
    8941. 

  8941.   i13 = HEAP32[i5 >> 2] | 0;
    8942. 

  8942.   i27 = HEAP32[i13 >> 2] | 0;
    8943. 

  8943.   HEAP32[i13 >> 2] = i27 + -1;
    8944. 

  8944.   if ((i27 | 0) == 0) {
    8945. 

  8945.    i13 = _luaZ_fill(i13) | 0;
    8946. 

  8946.   } else {
    8947. 

  8947.    i27 = i13 + 4 | 0;
    8948. 

  8948.    i13 = HEAP32[i27 >> 2] | 0;
    8949. 

  8949.    HEAP32[i27 >> 2] = i13 + 1;
    8950. 

  8950.    i13 = HEAPU8[i13] | 0;
    8951. 

  8951.   }
    8952. 

  8952.   HEAP32[i2 >> 2] = i13;
    8953. 

  8953.   do {
    8954. 

  8954.    if ((i13 | 0) == 91) {
    8955. 

  8955.     i13 = _skip_sep(i2) | 0;
    8956. 

  8956.     HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
    8957. 

  8957.     if ((i13 | 0) > -1) {
    8958. 

  8958.      _read_long_string(i2, 0, i13);
    8959. 

  8959.      HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
    8960. 

  8960.      continue L1;
    8961. 

  8961.     } else {
    8962. 

  8962.      i13 = HEAP32[i2 >> 2] | 0;
    8963. 

  8963.      break;
    8964. 

  8964.     }
    8965. 

  8965.    }
    8966. 

  8966.   } while (0);
    8967. 

  8967.   while (1) {
    8968. 

  8968.    if ((i13 | 0) == -1 | (i13 | 0) == 13 | (i13 | 0) == 10) {
    8969. 

  8969.     continue L1;
    8970. 

  8970.    }
    8971. 

  8971.    i13 = HEAP32[i5 >> 2] | 0;
    8972. 

  8972.    i27 = HEAP32[i13 >> 2] | 0;
    8973. 

  8973.    HEAP32[i13 >> 2] = i27 + -1;
    8974. 

  8974.    if ((i27 | 0) == 0) {
    8975. 

  8975.     i13 = _luaZ_fill(i13) | 0;
    8976. 

  8976.    } else {
    8977. 

  8977.     i27 = i13 + 4 | 0;
    8978. 

  8978.     i13 = HEAP32[i27 >> 2] | 0;
    8979. 

  8979.     HEAP32[i27 >> 2] = i13 + 1;
    8980. 

  8980.     i13 = HEAPU8[i13] | 0;
    8981. 

  8981.    }
    8982. 

  8982.    HEAP32[i2 >> 2] = i13;
    8983. 

  8983.   }
    8984. 

  8984.  }
    8985. 

  8985.  if ((i9 | 0) == 25) {
    8986. 

  8986.   i9 = _skip_sep(i2) | 0;
    8987. 

  8987.   if ((i9 | 0) > -1) {
    8988. 

  8988.    _read_long_string(i2, i3, i9);
    8989. 

  8989.    i27 = 289;
    8990. 

  8990.    STACKTOP = i1;
    8991. 

  8991.    return i27 | 0;
    8992. 

  8992.   }
    8993. 

  8993.   if ((i9 | 0) == -1) {
    8994. 

  8994.    i27 = 91;
    8995. 

  8995.    STACKTOP = i1;
    8996. 

  8996.    return i27 | 0;
    8997. 

  8997.   } else {
    8998. 

  8998.    _lexerror(i2, 12272, 289);
    8999. 

  8999.   }
    9000. 

  9000.  } else if ((i9 | 0) == 29) {
    9001. 

  9001.   i3 = HEAP32[i5 >> 2] | 0;
    9002. 

  9002.   i27 = HEAP32[i3 >> 2] | 0;
    9003. 

  9003.   HEAP32[i3 >> 2] = i27 + -1;
    9004. 

  9004.   if ((i27 | 0) == 0) {
    9005. 

  9005.    i3 = _luaZ_fill(i3) | 0;
    9006. 

  9006.   } else {
    9007. 

  9007.    i27 = i3 + 4 | 0;
    9008. 

  9008.    i3 = HEAP32[i27 >> 2] | 0;
    9009. 

  9009.    HEAP32[i27 >> 2] = i3 + 1;
    9010. 

  9010.    i3 = HEAPU8[i3] | 0;
    9011. 

  9011.   }
    9012. 

  9012.   HEAP32[i2 >> 2] = i3;
    9013. 

  9013.   if ((i3 | 0) != 61) {
    9014. 

  9014.    i27 = 61;
    9015. 

  9015.    STACKTOP = i1;
    9016. 

  9016.    return i27 | 0;
    9017. 

  9017.   }
    9018. 

  9018.   i3 = HEAP32[i5 >> 2] | 0;
    9019. 

  9019.   i27 = HEAP32[i3 >> 2] | 0;
    9020. 

  9020.   HEAP32[i3 >> 2] = i27 + -1;
    9021. 

  9021.   if ((i27 | 0) == 0) {
    9022. 

  9022.    i3 = _luaZ_fill(i3) | 0;
    9023. 

  9023.   } else {
    9024. 

  9024.    i27 = i3 + 4 | 0;
    9025. 

  9025.    i3 = HEAP32[i27 >> 2] | 0;
    9026. 

  9026.    HEAP32[i27 >> 2] = i3 + 1;
    9027. 

  9027.    i3 = HEAPU8[i3] | 0;
    9028. 

  9028.   }
    9029. 

  9029.   HEAP32[i2 >> 2] = i3;
    9030. 

  9030.   i27 = 281;
    9031. 

  9031.   STACKTOP = i1;
    9032. 

  9032.   return i27 | 0;
    9033. 

  9033.  } else if ((i9 | 0) == 37) {
    9034. 

  9034.   i3 = HEAP32[i5 >> 2] | 0;
    9035. 

  9035.   i27 = HEAP32[i3 >> 2] | 0;
    9036. 

  9036.   HEAP32[i3 >> 2] = i27 + -1;
    9037. 

  9037.   if ((i27 | 0) == 0) {
    9038. 

  9038.    i3 = _luaZ_fill(i3) | 0;
    9039. 

  9039.   } else {
    9040. 

  9040.    i27 = i3 + 4 | 0;
    9041. 

  9041.    i3 = HEAP32[i27 >> 2] | 0;
    9042. 

  9042.    HEAP32[i27 >> 2] = i3 + 1;
    9043. 

  9043.    i3 = HEAPU8[i3] | 0;
    9044. 

  9044.   }
    9045. 

  9045.   HEAP32[i2 >> 2] = i3;
    9046. 

  9046.   if ((i3 | 0) != 61) {
    9047. 

  9047.    i27 = 60;
    9048. 

  9048.    STACKTOP = i1;
    9049. 

  9049.    return i27 | 0;
    9050. 

  9050.   }
    9051. 

  9051.   i3 = HEAP32[i5 >> 2] | 0;
    9052. 

  9052.   i27 = HEAP32[i3 >> 2] | 0;
    9053. 

  9053.   HEAP32[i3 >> 2] = i27 + -1;
    9054. 

  9054.   if ((i27 | 0) == 0) {
    9055. 

  9055.    i3 = _luaZ_fill(i3) | 0;
    9056. 

  9056.   } else {
    9057. 

  9057.    i27 = i3 + 4 | 0;
    9058. 

  9058.    i3 = HEAP32[i27 >> 2] | 0;
    9059. 

  9059.    HEAP32[i27 >> 2] = i3 + 1;
    9060. 

  9060.    i3 = HEAPU8[i3] | 0;
    9061. 

  9061.   }
    9062. 

  9062.   HEAP32[i2 >> 2] = i3;
    9063. 

  9063.   i27 = 283;
    9064. 

  9064.   STACKTOP = i1;
    9065. 

  9065.   return i27 | 0;
    9066. 

  9066.  } else if ((i9 | 0) == 45) {
    9067. 

  9067.   i3 = HEAP32[i5 >> 2] | 0;
    9068. 

  9068.   i27 = HEAP32[i3 >> 2] | 0;
    9069. 

  9069.   HEAP32[i3 >> 2] = i27 + -1;
    9070. 

  9070.   if ((i27 | 0) == 0) {
    9071. 

  9071.    i3 = _luaZ_fill(i3) | 0;
    9072. 

  9072.   } else {
    9073. 

  9073.    i27 = i3 + 4 | 0;
    9074. 

  9074.    i3 = HEAP32[i27 >> 2] | 0;
    9075. 

  9075.    HEAP32[i27 >> 2] = i3 + 1;
    9076. 

  9076.    i3 = HEAPU8[i3] | 0;
    9077. 

  9077.   }
    9078. 

  9078.   HEAP32[i2 >> 2] = i3;
    9079. 

  9079.   if ((i3 | 0) != 61) {
    9080. 

  9080.    i27 = 62;
    9081. 

  9081.    STACKTOP = i1;
    9082. 

  9082.    return i27 | 0;
    9083. 

  9083.   }
    9084. 

  9084.   i3 = HEAP32[i5 >> 2] | 0;
    9085. 

  9085.   i27 = HEAP32[i3 >> 2] | 0;
    9086. 

  9086.   HEAP32[i3 >> 2] = i27 + -1;
    9087. 

  9087.   if ((i27 | 0) == 0) {
    9088. 

  9088.    i3 = _luaZ_fill(i3) | 0;
    9089. 

  9089.   } else {
    9090. 

  9090.    i27 = i3 + 4 | 0;
    9091. 

  9091.    i3 = HEAP32[i27 >> 2] | 0;
    9092. 

  9092.    HEAP32[i27 >> 2] = i3 + 1;
    9093. 

  9093.    i3 = HEAPU8[i3] | 0;
    9094. 

  9094.   }
    9095. 

  9095.   HEAP32[i2 >> 2] = i3;
    9096. 

  9096.   i27 = 282;
    9097. 

  9097.   STACKTOP = i1;
    9098. 

  9098.   return i27 | 0;
    9099. 

  9099.  } else if ((i9 | 0) == 53) {
    9100. 

  9100.   i3 = HEAP32[i5 >> 2] | 0;
    9101. 

  9101.   i27 = HEAP32[i3 >> 2] | 0;
    9102. 

  9102.   HEAP32[i3 >> 2] = i27 + -1;
    9103. 

  9103.   if ((i27 | 0) == 0) {
    9104. 

  9104.    i3 = _luaZ_fill(i3) | 0;
    9105. 

  9105.   } else {
    9106. 

  9106.    i27 = i3 + 4 | 0;
    9107. 

  9107.    i3 = HEAP32[i27 >> 2] | 0;
    9108. 

  9108.    HEAP32[i27 >> 2] = i3 + 1;
    9109. 

  9109.    i3 = HEAPU8[i3] | 0;
    9110. 

  9110.   }
    9111. 

  9111.   HEAP32[i2 >> 2] = i3;
    9112. 

  9112.   if ((i3 | 0) != 61) {
    9113. 

  9113.    i27 = 126;
    9114. 

  9114.    STACKTOP = i1;
    9115. 

  9115.    return i27 | 0;
    9116. 

  9116.   }
    9117. 

  9117.   i3 = HEAP32[i5 >> 2] | 0;
    9118. 

  9118.   i27 = HEAP32[i3 >> 2] | 0;
    9119. 

  9119.   HEAP32[i3 >> 2] = i27 + -1;
    9120. 

  9120.   if ((i27 | 0) == 0) {
    9121. 

  9121.    i3 = _luaZ_fill(i3) | 0;
    9122. 

  9122.   } else {
    9123. 

  9123.    i27 = i3 + 4 | 0;
    9124. 

  9124.    i3 = HEAP32[i27 >> 2] | 0;
    9125. 

  9125.    HEAP32[i27 >> 2] = i3 + 1;
    9126. 

  9126.    i3 = HEAPU8[i3] | 0;
    9127. 

  9127.   }
    9128. 

  9128.   HEAP32[i2 >> 2] = i3;
    9129. 

  9129.   i27 = 284;
    9130. 

  9130.   STACKTOP = i1;
    9131. 

  9131.   return i27 | 0;
    9132. 

  9132.  } else if ((i9 | 0) == 61) {
    9133. 

  9133.   i3 = HEAP32[i5 >> 2] | 0;
    9134. 

  9134.   i27 = HEAP32[i3 >> 2] | 0;
    9135. 

  9135.   HEAP32[i3 >> 2] = i27 + -1;
    9136. 

  9136.   if ((i27 | 0) == 0) {
    9137. 

  9137.    i3 = _luaZ_fill(i3) | 0;
    9138. 

  9138.   } else {
    9139. 

  9139.    i27 = i3 + 4 | 0;
    9140. 

  9140.    i3 = HEAP32[i27 >> 2] | 0;
    9141. 

  9141.    HEAP32[i27 >> 2] = i3 + 1;
    9142. 

  9142.    i3 = HEAPU8[i3] | 0;
    9143. 

  9143.   }
    9144. 

  9144.   HEAP32[i2 >> 2] = i3;
    9145. 

  9145.   if ((i3 | 0) != 58) {
    9146. 

  9146.    i27 = 58;
    9147. 

  9147.    STACKTOP = i1;
    9148. 

  9148.    return i27 | 0;
    9149. 

  9149.   }
    9150. 

  9150.   i3 = HEAP32[i5 >> 2] | 0;
    9151. 

  9151.   i27 = HEAP32[i3 >> 2] | 0;
    9152. 

  9152.   HEAP32[i3 >> 2] = i27 + -1;
    9153. 

  9153.   if ((i27 | 0) == 0) {
    9154. 

  9154.    i3 = _luaZ_fill(i3) | 0;
    9155. 

  9155.   } else {
    9156. 

  9156.    i27 = i3 + 4 | 0;
    9157. 

  9157.    i3 = HEAP32[i27 >> 2] | 0;
    9158. 

  9158.    HEAP32[i27 >> 2] = i3 + 1;
    9159. 

  9159.    i3 = HEAPU8[i3] | 0;
    9160. 

  9160.   }
    9161. 

  9161.   HEAP32[i2 >> 2] = i3;
    9162. 

  9162.   i27 = 285;
    9163. 

  9163.   STACKTOP = i1;
    9164. 

  9164.   return i27 | 0;
    9165. 

  9165.  } else if ((i9 | 0) == 69) {
    9166. 

  9166.   i14 = HEAP32[i4 >> 2] | 0;
    9167. 

  9167.   i7 = i14 + 4 | 0;
    9168. 

  9168.   i15 = HEAP32[i7 >> 2] | 0;
    9169. 

  9169.   i8 = i14 + 8 | 0;
    9170. 

  9170.   i6 = HEAP32[i8 >> 2] | 0;
    9171. 

  9171.   do {
    9172. 

  9172.    if ((i15 + 1 | 0) >>> 0 > i6 >>> 0) {
    9173. 

  9173.     if (i6 >>> 0 > 2147483645) {
    9174. 

  9174.      _lexerror(i2, 12368, 0);
    9175. 

  9175.     }
    9176. 

  9176.     i16 = i6 << 1;
    9177. 

  9177.     i15 = HEAP32[i2 + 52 >> 2] | 0;
    9178. 

  9178.     if ((i16 | 0) == -2) {
    9179. 

  9179.      _luaM_toobig(i15);
    9180. 

  9180.     } else {
    9181. 

  9181.      i24 = _luaM_realloc_(i15, HEAP32[i14 >> 2] | 0, i6, i16) | 0;
    9182. 

  9182.      HEAP32[i14 >> 2] = i24;
    9183. 

  9183.      HEAP32[i8 >> 2] = i16;
    9184. 

  9184.      i23 = HEAP32[i7 >> 2] | 0;
    9185. 

  9185.      break;
    9186. 

  9186.     }
    9187. 

  9187.    } else {
    9188. 

  9188.     i23 = i15;
    9189. 

  9189.     i24 = HEAP32[i14 >> 2] | 0;
    9190. 

  9190.    }
    9191. 

  9191.   } while (0);
    9192. 

  9192.   i6 = i13 & 255;
    9193. 

  9193.   HEAP32[i7 >> 2] = i23 + 1;
    9194. 

  9194.   HEAP8[i24 + i23 | 0] = i6;
    9195. 

  9195.   i7 = HEAP32[i5 >> 2] | 0;
    9196. 

  9196.   i27 = HEAP32[i7 >> 2] | 0;
    9197. 

  9197.   HEAP32[i7 >> 2] = i27 + -1;
    9198. 

  9198.   if ((i27 | 0) == 0) {
    9199. 

  9199.    i14 = _luaZ_fill(i7) | 0;
    9200. 

  9200.   } else {
    9201. 

  9201.    i27 = i7 + 4 | 0;
    9202. 

  9202.    i14 = HEAP32[i27 >> 2] | 0;
    9203. 

  9203.    HEAP32[i27 >> 2] = i14 + 1;
    9204. 

  9204.    i14 = HEAPU8[i14] | 0;
    9205. 

  9205.   }
    9206. 

  9206.   HEAP32[i2 >> 2] = i14;
    9207. 

  9207.   L139 : do {
    9208. 

  9208.    if ((i14 | 0) != (i13 | 0)) {
    9209. 

  9209.     i7 = i2 + 52 | 0;
    9210. 

  9210.     L141 : while (1) {
    9211. 

  9211.      L143 : do {
    9212. 

  9212.       if ((i14 | 0) == 92) {
    9213. 

  9213.        i8 = HEAP32[i5 >> 2] | 0;
    9214. 

  9214.        i27 = HEAP32[i8 >> 2] | 0;
    9215. 

  9215.        HEAP32[i8 >> 2] = i27 + -1;
    9216. 

  9216.        if ((i27 | 0) == 0) {
    9217. 

  9217.         i8 = _luaZ_fill(i8) | 0;
    9218. 

  9218.        } else {
    9219. 

  9219.         i27 = i8 + 4 | 0;
    9220. 

  9220.         i8 = HEAP32[i27 >> 2] | 0;
    9221. 

  9221.         HEAP32[i27 >> 2] = i8 + 1;
    9222. 

  9222.         i8 = HEAPU8[i8] | 0;
    9223. 

  9223.        }
    9224. 

  9224.        HEAP32[i2 >> 2] = i8;
    9225. 

  9225.        switch (i8 | 0) {
    9226. 

  9226.        case 13:
    9227. 

  9227.        case 10:
    9228. 

  9228.         {
    9229. 

  9229.          _inclinenumber(i2);
    9230. 

  9230.          i8 = 10;
    9231. 

  9231.          break;
    9232. 

  9232.         }
    9233. 

  9233.        case 39:
    9234. 

  9234.        case 34:
    9235. 

  9235.        case 92:
    9236. 

  9236.         {
    9237. 

  9237.          i9 = 124;
    9238. 

  9238.          break;
    9239. 

  9239.         }
    9240. 

  9240.        case 122:
    9241. 

  9241.         {
    9242. 

  9242.          i8 = HEAP32[i5 >> 2] | 0;
    9243. 

  9243.          i27 = HEAP32[i8 >> 2] | 0;
    9244. 

  9244.          HEAP32[i8 >> 2] = i27 + -1;
    9245. 

  9245.          if ((i27 | 0) == 0) {
    9246. 

  9246.           i14 = _luaZ_fill(i8) | 0;
    9247. 

  9247.          } else {
    9248. 

  9248.           i27 = i8 + 4 | 0;
    9249. 

  9249.           i14 = HEAP32[i27 >> 2] | 0;
    9250. 

  9250.           HEAP32[i27 >> 2] = i14 + 1;
    9251. 

  9251.           i14 = HEAPU8[i14] | 0;
    9252. 

  9252.          }
    9253. 

  9253.          HEAP32[i2 >> 2] = i14;
    9254. 

  9254.          if ((HEAP8[i14 + 10913 | 0] & 8) == 0) {
    9255. 

  9255.           break L143;
    9256. 

  9256.          }
    9257. 

  9257.          while (1) {
    9258. 

  9258.           if ((i14 | 0) == 13 | (i14 | 0) == 10) {
    9259. 

  9259.            _inclinenumber(i2);
    9260. 

  9260.            i14 = HEAP32[i2 >> 2] | 0;
    9261. 

  9261.           } else {
    9262. 

  9262.            i8 = HEAP32[i5 >> 2] | 0;
    9263. 

  9263.            i27 = HEAP32[i8 >> 2] | 0;
    9264. 

  9264.            HEAP32[i8 >> 2] = i27 + -1;
    9265. 

  9265.            if ((i27 | 0) == 0) {
    9266. 

  9266.             i14 = _luaZ_fill(i8) | 0;
    9267. 

  9267.            } else {
    9268. 

  9268.             i27 = i8 + 4 | 0;
    9269. 

  9269.             i14 = HEAP32[i27 >> 2] | 0;
    9270. 

  9270.             HEAP32[i27 >> 2] = i14 + 1;
    9271. 

  9271.             i14 = HEAPU8[i14] | 0;
    9272. 

  9272.            }
    9273. 

  9273.            HEAP32[i2 >> 2] = i14;
    9274. 

  9274.           }
    9275. 

  9275.           if ((HEAP8[i14 + 10913 | 0] & 8) == 0) {
    9276. 

  9276.            break L143;
    9277. 

  9277.           }
    9278. 

  9278.          }
    9279. 

  9279.         }
    9280. 

  9280.        case 118:
    9281. 

  9281.         {
    9282. 

  9282.          i8 = 11;
    9283. 

  9283.          i9 = 124;
    9284. 

  9284.          break;
    9285. 

  9285.         }
    9286. 

  9286.        case 120:
    9287. 

  9287.         {
    9288. 

  9288.          HEAP32[i12 >> 2] = 120;
    9289. 

  9289.          i14 = 1;
    9290. 

  9290.          i8 = 0;
    9291. 

  9291.          while (1) {
    9292. 

  9292.           i9 = HEAP32[i5 >> 2] | 0;
    9293. 

  9293.           i27 = HEAP32[i9 >> 2] | 0;
    9294. 

  9294.           HEAP32[i9 >> 2] = i27 + -1;
    9295. 

  9295.           if ((i27 | 0) == 0) {
    9296. 

  9296.            i9 = _luaZ_fill(i9) | 0;
    9297. 

  9297.           } else {
    9298. 

  9298.            i27 = i9 + 4 | 0;
    9299. 

  9299.            i9 = HEAP32[i27 >> 2] | 0;
    9300. 

  9300.            HEAP32[i27 >> 2] = i9 + 1;
    9301. 

  9301.            i9 = HEAPU8[i9] | 0;
    9302. 

  9302.           }
    9303. 

  9303.           HEAP32[i2 >> 2] = i9;
    9304. 

  9304.           HEAP32[i12 + (i14 << 2) >> 2] = i9;
    9305. 

  9305.           if ((HEAP8[i9 + 10913 | 0] & 16) == 0) {
    9306. 

  9306.            i9 = 100;
    9307. 

  9307.            break L141;
    9308. 

  9308.           }
    9309. 

  9309.           i8 = (_luaO_hexavalue(i9) | 0) + (i8 << 4) | 0;
    9310. 

  9310.           i14 = i14 + 1 | 0;
    9311. 

  9311.           if ((i14 | 0) >= 3) {
    9312. 

  9312.            i9 = 124;
    9313. 

  9313.            break;
    9314. 

  9314.           }
    9315. 

  9315.          }
    9316. 

  9316.          break;
    9317. 

  9317.         }
    9318. 

  9318.        case -1:
    9319. 

  9319.         {
    9320. 

  9320.          i14 = -1;
    9321. 

  9321.          break L143;
    9322. 

  9322.         }
    9323. 

  9323.        case 98:
    9324. 

  9324.         {
    9325. 

  9325.          i8 = 8;
    9326. 

  9326.          i9 = 124;
    9327. 

  9327.          break;
    9328. 

  9328.         }
    9329. 

  9329.        case 102:
    9330. 

  9330.         {
    9331. 

  9331.          i8 = 12;
    9332. 

  9332.          i9 = 124;
    9333. 

  9333.          break;
    9334. 

  9334.         }
    9335. 

  9335.        case 110:
    9336. 

  9336.         {
    9337. 

  9337.          i8 = 10;
    9338. 

  9338.          i9 = 124;
    9339. 

  9339.          break;
    9340. 

  9340.         }
    9341. 

  9341.        case 114:
    9342. 

  9342.         {
    9343. 

  9343.          i8 = 13;
    9344. 

  9344.          i9 = 124;
    9345. 

  9345.          break;
    9346. 

  9346.         }
    9347. 

  9347.        case 116:
    9348. 

  9348.         {
    9349. 

  9349.          i8 = 9;
    9350. 

  9350.          i9 = 124;
    9351. 

  9351.          break;
    9352. 

  9352.         }
    9353. 

  9353.        case 97:
    9354. 

  9354.         {
    9355. 

  9355.          i8 = 7;
    9356. 

  9356.          i9 = 124;
    9357. 

  9357.          break;
    9358. 

  9358.         }
    9359. 

  9359.        default:
    9360. 

  9360.         {
    9361. 

  9361.          if ((HEAP8[i8 + 10913 | 0] & 2) == 0) {
    9362. 

  9362.           i9 = 116;
    9363. 

  9363.           break L141;
    9364. 

  9364.          } else {
    9365. 

  9365.           i15 = i8;
    9366. 

  9366.           i14 = 0;
    9367. 

  9367.           i8 = 0;
    9368. 

  9368.          }
    9369. 

  9369.          do {
    9370. 

  9370.           if ((HEAP8[i15 + 10913 | 0] & 2) == 0) {
    9371. 

  9371.            break;
    9372. 

  9372.           }
    9373. 

  9373.           HEAP32[i12 + (i14 << 2) >> 2] = i15;
    9374. 

  9374.           i8 = i15 + -48 + (i8 * 10 | 0) | 0;
    9375. 

  9375.           i15 = HEAP32[i5 >> 2] | 0;
    9376. 

  9376.           i27 = HEAP32[i15 >> 2] | 0;
    9377. 

  9377.           HEAP32[i15 >> 2] = i27 + -1;
    9378. 

  9378.           if ((i27 | 0) == 0) {
    9379. 

  9379.            i15 = _luaZ_fill(i15) | 0;
    9380. 

  9380.           } else {
    9381. 

  9381.            i27 = i15 + 4 | 0;
    9382. 

  9382.            i15 = HEAP32[i27 >> 2] | 0;
    9383. 

  9383.            HEAP32[i27 >> 2] = i15 + 1;
    9384. 

  9384.            i15 = HEAPU8[i15] | 0;
    9385. 

  9385.           }
    9386. 

  9386.           HEAP32[i2 >> 2] = i15;
    9387. 

  9387.           i14 = i14 + 1 | 0;
    9388. 

  9388.          } while ((i14 | 0) < 3);
    9389. 

  9389.          if ((i8 | 0) > 255) {
    9390. 

  9390.           i9 = 123;
    9391. 

  9391.           break L141;
    9392. 

  9392.          }
    9393. 

  9393.         }
    9394. 

  9394.        }
    9395. 

  9395.        if ((i9 | 0) == 124) {
    9396. 

  9396.         i9 = 0;
    9397. 

  9397.         i14 = HEAP32[i5 >> 2] | 0;
    9398. 

  9398.         i27 = HEAP32[i14 >> 2] | 0;
    9399. 

  9399.         HEAP32[i14 >> 2] = i27 + -1;
    9400. 

  9400.         if ((i27 | 0) == 0) {
    9401. 

  9401.          i14 = _luaZ_fill(i14) | 0;
    9402. 

  9402.         } else {
    9403. 

  9403.          i27 = i14 + 4 | 0;
    9404. 

  9404.          i14 = HEAP32[i27 >> 2] | 0;
    9405. 

  9405.          HEAP32[i27 >> 2] = i14 + 1;
    9406. 

  9406.          i14 = HEAPU8[i14] | 0;
    9407. 

  9407.         }
    9408. 

  9408.         HEAP32[i2 >> 2] = i14;
    9409. 

  9409.        }
    9410. 

  9410.        i15 = HEAP32[i4 >> 2] | 0;
    9411. 

  9411.        i14 = i15 + 4 | 0;
    9412. 

  9412.        i18 = HEAP32[i14 >> 2] | 0;
    9413. 

  9413.        i16 = i15 + 8 | 0;
    9414. 

  9414.        i17 = HEAP32[i16 >> 2] | 0;
    9415. 

  9415.        if ((i18 + 1 | 0) >>> 0 > i17 >>> 0) {
    9416. 

  9416.         if (i17 >>> 0 > 2147483645) {
    9417. 

  9417.          i9 = 131;
    9418. 

  9418.          break L141;
    9419. 

  9419.         }
    9420. 

  9420.         i18 = i17 << 1;
    9421. 

  9421.         i19 = HEAP32[i7 >> 2] | 0;
    9422. 

  9422.         if ((i18 | 0) == -2) {
    9423. 

  9423.          i9 = 133;
    9424. 

  9424.          break L141;
    9425. 

  9425.         }
    9426. 

  9426.         i27 = _luaM_realloc_(i19, HEAP32[i15 >> 2] | 0, i17, i18) | 0;
    9427. 

  9427.         HEAP32[i15 >> 2] = i27;
    9428. 

  9428.         HEAP32[i16 >> 2] = i18;
    9429. 

  9429.         i18 = HEAP32[i14 >> 2] | 0;
    9430. 

  9430.         i15 = i27;
    9431. 

  9431.        } else {
    9432. 

  9432.         i15 = HEAP32[i15 >> 2] | 0;
    9433. 

  9433.        }
    9434. 

  9434.        HEAP32[i14 >> 2] = i18 + 1;
    9435. 

  9435.        HEAP8[i15 + i18 | 0] = i8;
    9436. 

  9436.        i14 = HEAP32[i2 >> 2] | 0;
    9437. 

  9437.       } else if ((i14 | 0) == -1) {
    9438. 

  9438.        i9 = 82;
    9439. 

  9439.        break L141;
    9440. 

  9440.       } else if ((i14 | 0) == 13 | (i14 | 0) == 10) {
    9441. 

  9441.        i9 = 83;
    9442. 

  9442.        break L141;
    9443. 

  9443.       } else {
    9444. 

  9444.        i15 = HEAP32[i4 >> 2] | 0;
    9445. 

  9445.        i8 = i15 + 4 | 0;
    9446. 

  9446.        i18 = HEAP32[i8 >> 2] | 0;
    9447. 

  9447.        i17 = i15 + 8 | 0;
    9448. 

  9448.        i16 = HEAP32[i17 >> 2] | 0;
    9449. 

  9449.        if ((i18 + 1 | 0) >>> 0 > i16 >>> 0) {
    9450. 

  9450.         if (i16 >>> 0 > 2147483645) {
    9451. 

  9451.          i9 = 139;
    9452. 

  9452.          break L141;
    9453. 

  9453.         }
    9454. 

  9454.         i19 = i16 << 1;
    9455. 

  9455.         i18 = HEAP32[i7 >> 2] | 0;
    9456. 

  9456.         if ((i19 | 0) == -2) {
    9457. 

  9457.          i9 = 141;
    9458. 

  9458.          break L141;
    9459. 

  9459.         }
    9460. 

  9460.         i27 = _luaM_realloc_(i18, HEAP32[i15 >> 2] | 0, i16, i19) | 0;
    9461. 

  9461.         HEAP32[i15 >> 2] = i27;
    9462. 

  9462.         HEAP32[i17 >> 2] = i19;
    9463. 

  9463.         i18 = HEAP32[i8 >> 2] | 0;
    9464. 

  9464.         i15 = i27;
    9465. 

  9465.        } else {
    9466. 

  9466.         i15 = HEAP32[i15 >> 2] | 0;
    9467. 

  9467.        }
    9468. 

  9468.        HEAP32[i8 >> 2] = i18 + 1;
    9469. 

  9469.        HEAP8[i15 + i18 | 0] = i14;
    9470. 

  9470.        i8 = HEAP32[i5 >> 2] | 0;
    9471. 

  9471.        i27 = HEAP32[i8 >> 2] | 0;
    9472. 

  9472.        HEAP32[i8 >> 2] = i27 + -1;
    9473. 

  9473.        if ((i27 | 0) == 0) {
    9474. 

  9474.         i14 = _luaZ_fill(i8) | 0;
    9475. 

  9475.        } else {
    9476. 

  9476.         i27 = i8 + 4 | 0;
    9477. 

  9477.         i14 = HEAP32[i27 >> 2] | 0;
    9478. 

  9478.         HEAP32[i27 >> 2] = i14 + 1;
    9479. 

  9479.         i14 = HEAPU8[i14] | 0;
    9480. 

  9480.        }
    9481. 

  9481.        HEAP32[i2 >> 2] = i14;
    9482. 

  9482.       }
    9483. 

  9483.      } while (0);
    9484. 

  9484.      if ((i14 | 0) == (i13 | 0)) {
    9485. 

  9485.       break L139;
    9486. 

  9486.      }
    9487. 

  9487.     }
    9488. 

  9488.     if ((i9 | 0) == 82) {
    9489. 

  9489.      _lexerror(i2, 12400, 286);
    9490. 

  9490.     } else if ((i9 | 0) == 83) {
    9491. 

  9491.      _lexerror(i2, 12400, 289);
    9492. 

  9492.     } else if ((i9 | 0) == 100) {
    9493. 

  9493.      _escerror(i2, i12, i14 + 1 | 0, 12480);
    9494. 

  9494.     } else if ((i9 | 0) == 116) {
    9495. 

  9495.      _escerror(i2, i2, 1, 12424);
    9496. 

  9496.     } else if ((i9 | 0) == 123) {
    9497. 

  9497.      _escerror(i2, i12, i14, 12448);
    9498. 

  9498.     } else if ((i9 | 0) == 131) {
    9499. 

  9499.      _lexerror(i2, 12368, 0);
    9500. 

  9500.     } else if ((i9 | 0) == 133) {
    9501. 

  9501.      _luaM_toobig(i19);
    9502. 

  9502.     } else if ((i9 | 0) == 139) {
    9503. 

  9503.      _lexerror(i2, 12368, 0);
    9504. 

  9504.     } else if ((i9 | 0) == 141) {
    9505. 

  9505.      _luaM_toobig(i18);
    9506. 

  9506.     }
    9507. 

  9507.    }
    9508. 

  9508.   } while (0);
    9509. 

  9509.   i7 = HEAP32[i4 >> 2] | 0;
    9510. 

  9510.   i8 = i7 + 4 | 0;
    9511. 

  9511.   i13 = HEAP32[i8 >> 2] | 0;
    9512. 

  9512.   i12 = i7 + 8 | 0;
    9513. 

  9513.   i9 = HEAP32[i12 >> 2] | 0;
    9514. 

  9514.   do {
    9515. 

  9515.    if ((i13 + 1 | 0) >>> 0 > i9 >>> 0) {
    9516. 

  9516.     if (i9 >>> 0 > 2147483645) {
    9517. 

  9517.      _lexerror(i2, 12368, 0);
    9518. 

  9518.     }
    9519. 

  9519.     i14 = i9 << 1;
    9520. 

  9520.     i13 = HEAP32[i2 + 52 >> 2] | 0;
    9521. 

  9521.     if ((i14 | 0) == -2) {
    9522. 

  9522.      _luaM_toobig(i13);
    9523. 

  9523.     } else {
    9524. 

  9524.      i11 = _luaM_realloc_(i13, HEAP32[i7 >> 2] | 0, i9, i14) | 0;
    9525. 

  9525.      HEAP32[i7 >> 2] = i11;
    9526. 

  9526.      HEAP32[i12 >> 2] = i14;
    9527. 

  9527.      i10 = HEAP32[i8 >> 2] | 0;
    9528. 

  9528.      break;
    9529. 

  9529.     }
    9530. 

  9530.    } else {
    9531. 

  9531.     i10 = i13;
    9532. 

  9532.     i11 = HEAP32[i7 >> 2] | 0;
    9533. 

  9533.    }
    9534. 

  9534.   } while (0);
    9535. 

  9535.   HEAP32[i8 >> 2] = i10 + 1;
    9536. 

  9536.   HEAP8[i11 + i10 | 0] = i6;
    9537. 

  9537.   i5 = HEAP32[i5 >> 2] | 0;
    9538. 

  9538.   i27 = HEAP32[i5 >> 2] | 0;
    9539. 

  9539.   HEAP32[i5 >> 2] = i27 + -1;
    9540. 

  9540.   if ((i27 | 0) == 0) {
    9541. 

  9541.    i5 = _luaZ_fill(i5) | 0;
    9542. 

  9542.   } else {
    9543. 

  9543.    i27 = i5 + 4 | 0;
    9544. 

  9544.    i5 = HEAP32[i27 >> 2] | 0;
    9545. 

  9545.    HEAP32[i27 >> 2] = i5 + 1;
    9546. 

  9546.    i5 = HEAPU8[i5] | 0;
    9547. 

  9547.   }
    9548. 

  9548.   HEAP32[i2 >> 2] = i5;
    9549. 

  9549.   i5 = HEAP32[i4 >> 2] | 0;
    9550. 

  9550.   i4 = HEAP32[i2 + 52 >> 2] | 0;
    9551. 

  9551.   i5 = _luaS_newlstr(i4, (HEAP32[i5 >> 2] | 0) + 1 | 0, (HEAP32[i5 + 4 >> 2] | 0) + -2 | 0) | 0;
    9552. 

  9552.   i6 = i4 + 8 | 0;
    9553. 

  9553.   i7 = HEAP32[i6 >> 2] | 0;
    9554. 

  9554.   HEAP32[i6 >> 2] = i7 + 16;
    9555. 

  9555.   HEAP32[i7 >> 2] = i5;
    9556. 

  9556.   HEAP32[i7 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 64;
    9557. 

  9557.   i7 = _luaH_set(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i6 >> 2] | 0) + -16 | 0) | 0;
    9558. 

  9558.   i2 = i7 + 8 | 0;
    9559. 

  9559.   if ((HEAP32[i2 >> 2] | 0) == 0 ? (HEAP32[i7 >> 2] = 1, HEAP32[i2 >> 2] = 1, (HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
    9560. 

  9560.    _luaC_step(i4);
    9561. 

  9561.   }
    9562. 

  9562.   HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + -16;
    9563. 

  9563.   HEAP32[i3 >> 2] = i5;
    9564. 

  9564.   i27 = 289;
    9565. 

  9565.   STACKTOP = i1;
    9566. 

  9566.   return i27 | 0;
    9567. 

  9567.  } else if ((i9 | 0) == 161) {
    9568. 

  9568.   i10 = HEAP32[i4 >> 2] | 0;
    9569. 

  9569.   i9 = i10 + 4 | 0;
    9570. 

  9570.   i13 = HEAP32[i9 >> 2] | 0;
    9571. 

  9571.   i12 = i10 + 8 | 0;
    9572. 

  9572.   i11 = HEAP32[i12 >> 2] | 0;
    9573. 

  9573.   do {
    9574. 

  9574.    if ((i13 + 1 | 0) >>> 0 > i11 >>> 0) {
    9575. 

  9575.     if (i11 >>> 0 > 2147483645) {
    9576. 

  9576.      _lexerror(i2, 12368, 0);
    9577. 

  9577.     }
    9578. 

  9578.     i13 = i11 << 1;
    9579. 

  9579.     i20 = HEAP32[i2 + 52 >> 2] | 0;
    9580. 

  9580.     if ((i13 | 0) == -2) {
    9581. 

  9581.      _luaM_toobig(i20);
    9582. 

  9582.     } else {
    9583. 

  9583.      i25 = _luaM_realloc_(i20, HEAP32[i10 >> 2] | 0, i11, i13) | 0;
    9584. 

  9584.      HEAP32[i10 >> 2] = i25;
    9585. 

  9585.      HEAP32[i12 >> 2] = i13;
    9586. 

  9586.      i26 = HEAP32[i9 >> 2] | 0;
    9587. 

  9587.      break;
    9588. 

  9588.     }
    9589. 

  9589.    } else {
    9590. 

  9590.     i26 = i13;
    9591. 

  9591.     i25 = HEAP32[i10 >> 2] | 0;
    9592. 

  9592.    }
    9593. 

  9593.   } while (0);
    9594. 

  9594.   HEAP32[i9 >> 2] = i26 + 1;
    9595. 

  9595.   HEAP8[i25 + i26 | 0] = 46;
    9596. 

  9596.   i9 = HEAP32[i5 >> 2] | 0;
    9597. 

  9597.   i27 = HEAP32[i9 >> 2] | 0;
    9598. 

  9598.   HEAP32[i9 >> 2] = i27 + -1;
    9599. 

  9599.   if ((i27 | 0) == 0) {
    9600. 

  9600.    i20 = _luaZ_fill(i9) | 0;
    9601. 

  9601.   } else {
    9602. 

  9602.    i27 = i9 + 4 | 0;
    9603. 

  9603.    i20 = HEAP32[i27 >> 2] | 0;
    9604. 

  9604.    HEAP32[i27 >> 2] = i20 + 1;
    9605. 

  9605.    i20 = HEAPU8[i20] | 0;
    9606. 

  9606.   }
    9607. 

  9607.   HEAP32[i2 >> 2] = i20;
    9608. 

  9608.   if ((i20 | 0) != 0 ? (_memchr(12304, i20, 2) | 0) != 0 : 0) {
    9609. 

  9609.    i6 = HEAP32[i4 >> 2] | 0;
    9610. 

  9610.    i3 = i6 + 4 | 0;
    9611. 

  9611.    i9 = HEAP32[i3 >> 2] | 0;
    9612. 

  9612.    i8 = i6 + 8 | 0;
    9613. 

  9613.    i7 = HEAP32[i8 >> 2] | 0;
    9614. 

  9614.    do {
    9615. 

  9615.     if ((i9 + 1 | 0) >>> 0 > i7 >>> 0) {
    9616. 

  9616.      if (i7 >>> 0 > 2147483645) {
    9617. 

  9617.       _lexerror(i2, 12368, 0);
    9618. 

  9618.      }
    9619. 

  9619.      i9 = i7 << 1;
    9620. 

  9620.      i10 = HEAP32[i2 + 52 >> 2] | 0;
    9621. 

  9621.      if ((i9 | 0) == -2) {
    9622. 

  9622.       _luaM_toobig(i10);
    9623. 

  9623.      } else {
    9624. 

  9624.       i21 = _luaM_realloc_(i10, HEAP32[i6 >> 2] | 0, i7, i9) | 0;
    9625. 

  9625.       HEAP32[i6 >> 2] = i21;
    9626. 

  9626.       HEAP32[i8 >> 2] = i9;
    9627. 

  9627.       i22 = HEAP32[i3 >> 2] | 0;
    9628. 

  9628.       break;
    9629. 

  9629.      }
    9630. 

  9630.     } else {
    9631. 

  9631.      i22 = i9;
    9632. 

  9632.      i21 = HEAP32[i6 >> 2] | 0;
    9633. 

  9633.     }
    9634. 

  9634.    } while (0);
    9635. 

  9635.    HEAP32[i3 >> 2] = i22 + 1;
    9636. 

  9636.    HEAP8[i21 + i22 | 0] = i20;
    9637. 

  9637.    i3 = HEAP32[i5 >> 2] | 0;
    9638. 

  9638.    i27 = HEAP32[i3 >> 2] | 0;
    9639. 

  9639.    HEAP32[i3 >> 2] = i27 + -1;
    9640. 

  9640.    if ((i27 | 0) == 0) {
    9641. 

  9641.     i3 = _luaZ_fill(i3) | 0;
    9642. 

  9642.    } else {
    9643. 

  9643.     i27 = i3 + 4 | 0;
    9644. 

  9644.     i3 = HEAP32[i27 >> 2] | 0;
    9645. 

  9645.     HEAP32[i27 >> 2] = i3 + 1;
    9646. 

  9646.     i3 = HEAPU8[i3] | 0;
    9647. 

  9647.    }
    9648. 

  9648.    HEAP32[i2 >> 2] = i3;
    9649. 

  9649.    if ((i3 | 0) == 0) {
    9650. 

  9650.     i27 = 279;
    9651. 

  9651.     STACKTOP = i1;
    9652. 

  9652.     return i27 | 0;
    9653. 

  9653.    }
    9654. 

  9654.    if ((_memchr(12304, i3, 2) | 0) == 0) {
    9655. 

  9655.     i27 = 279;
    9656. 

  9656.     STACKTOP = i1;
    9657. 

  9657.     return i27 | 0;
    9658. 

  9658.    }
    9659. 

  9659.    i6 = HEAP32[i4 >> 2] | 0;
    9660. 

  9660.    i7 = i6 + 4 | 0;
    9661. 

  9661.    i9 = HEAP32[i7 >> 2] | 0;
    9662. 

  9662.    i8 = i6 + 8 | 0;
    9663. 

  9663.    i4 = HEAP32[i8 >> 2] | 0;
    9664. 

  9664.    do {
    9665. 

  9665.     if ((i9 + 1 | 0) >>> 0 > i4 >>> 0) {
    9666. 

  9666.      if (i4 >>> 0 > 2147483645) {
    9667. 

  9667.       _lexerror(i2, 12368, 0);
    9668. 

  9668.      }
    9669. 

  9669.      i10 = i4 << 1;
    9670. 

  9670.      i9 = HEAP32[i2 + 52 >> 2] | 0;
    9671. 

  9671.      if ((i10 | 0) == -2) {
    9672. 

  9672.       _luaM_toobig(i9);
    9673. 

  9673.      } else {
    9674. 

  9674.       i18 = _luaM_realloc_(i9, HEAP32[i6 >> 2] | 0, i4, i10) | 0;
    9675. 

  9675.       HEAP32[i6 >> 2] = i18;
    9676. 

  9676.       HEAP32[i8 >> 2] = i10;
    9677. 

  9677.       i19 = HEAP32[i7 >> 2] | 0;
    9678. 

  9678.       break;
    9679. 

  9679.      }
    9680. 

  9680.     } else {
    9681. 

  9681.      i19 = i9;
    9682. 

  9682.      i18 = HEAP32[i6 >> 2] | 0;
    9683. 

  9683.     }
    9684. 

  9684.    } while (0);
    9685. 

  9685.    HEAP32[i7 >> 2] = i19 + 1;
    9686. 

  9686.    HEAP8[i18 + i19 | 0] = i3;
    9687. 

  9687.    i3 = HEAP32[i5 >> 2] | 0;
    9688. 

  9688.    i27 = HEAP32[i3 >> 2] | 0;
    9689. 

  9689.    HEAP32[i3 >> 2] = i27 + -1;
    9690. 

  9690.    if ((i27 | 0) == 0) {
    9691. 

  9691.     i3 = _luaZ_fill(i3) | 0;
    9692. 

  9692.    } else {
    9693. 

  9693.     i27 = i3 + 4 | 0;
    9694. 

  9694.     i3 = HEAP32[i27 >> 2] | 0;
    9695. 

  9695.     HEAP32[i27 >> 2] = i3 + 1;
    9696. 

  9696.     i3 = HEAPU8[i3] | 0;
    9697. 

  9697.    }
    9698. 

  9698.    HEAP32[i2 >> 2] = i3;
    9699. 

  9699.    i27 = 280;
    9700. 

  9700.    STACKTOP = i1;
    9701. 

  9701.    return i27 | 0;
    9702. 

  9702.   }
    9703. 

  9703.   if ((HEAP8[i20 + 10913 | 0] & 2) == 0) {
    9704. 

  9704.    i27 = 46;
    9705. 

  9705.    STACKTOP = i1;
    9706. 

  9706.    return i27 | 0;
    9707. 

  9707.   }
    9708. 

  9708.  } else if ((i9 | 0) == 283) {
    9709. 

  9709.   if ((HEAP8[i13 + 10913 | 0] & 1) == 0) {
    9710. 

  9710.    i3 = HEAP32[i5 >> 2] | 0;
    9711. 

  9711.    i27 = HEAP32[i3 >> 2] | 0;
    9712. 

  9712.    HEAP32[i3 >> 2] = i27 + -1;
    9713. 

  9713.    if ((i27 | 0) == 0) {
    9714. 

  9714.     i3 = _luaZ_fill(i3) | 0;
    9715. 

  9715.    } else {
    9716. 

  9716.     i27 = i3 + 4 | 0;
    9717. 

  9717.     i3 = HEAP32[i27 >> 2] | 0;
    9718. 

  9718.     HEAP32[i27 >> 2] = i3 + 1;
    9719. 

  9719.     i3 = HEAPU8[i3] | 0;
    9720. 

  9720.    }
    9721. 

  9721.    HEAP32[i2 >> 2] = i3;
    9722. 

  9722.    i27 = i13;
    9723. 

  9723.    STACKTOP = i1;
    9724. 

  9724.    return i27 | 0;
    9725. 

  9725.   }
    9726. 

  9726.   i10 = i2 + 52 | 0;
    9727. 

  9727.   while (1) {
    9728. 

  9728.    i11 = HEAP32[i4 >> 2] | 0;
    9729. 

  9729.    i9 = i11 + 4 | 0;
    9730. 

  9730.    i12 = HEAP32[i9 >> 2] | 0;
    9731. 

  9731.    i19 = i11 + 8 | 0;
    9732. 

  9732.    i18 = HEAP32[i19 >> 2] | 0;
    9733. 

  9733.    if ((i12 + 1 | 0) >>> 0 > i18 >>> 0) {
    9734. 

  9734.     if (i18 >>> 0 > 2147483645) {
    9735. 

  9735.      i9 = 288;
    9736. 

  9736.      break;
    9737. 

  9737.     }
    9738. 

  9738.     i21 = i18 << 1;
    9739. 

  9739.     i12 = HEAP32[i10 >> 2] | 0;
    9740. 

  9740.     if ((i21 | 0) == -2) {
    9741. 

  9741.      i9 = 290;
    9742. 

  9742.      break;
    9743. 

  9743.     }
    9744. 

  9744.     i27 = _luaM_realloc_(i12, HEAP32[i11 >> 2] | 0, i18, i21) | 0;
    9745. 

  9745.     HEAP32[i11 >> 2] = i27;
    9746. 

  9746.     HEAP32[i19 >> 2] = i21;
    9747. 

  9747.     i12 = HEAP32[i9 >> 2] | 0;
    9748. 

  9748.     i11 = i27;
    9749. 

  9749.    } else {
    9750. 

  9750.     i11 = HEAP32[i11 >> 2] | 0;
    9751. 

  9751.    }
    9752. 

  9752.    HEAP32[i9 >> 2] = i12 + 1;
    9753. 

  9753.    HEAP8[i11 + i12 | 0] = i13;
    9754. 

  9754.    i9 = HEAP32[i5 >> 2] | 0;
    9755. 

  9755.    i27 = HEAP32[i9 >> 2] | 0;
    9756. 

  9756.    HEAP32[i9 >> 2] = i27 + -1;
    9757. 

  9757.    if ((i27 | 0) == 0) {
    9758. 

  9758.     i13 = _luaZ_fill(i9) | 0;
    9759. 

  9759.    } else {
    9760. 

  9760.     i27 = i9 + 4 | 0;
    9761. 

  9761.     i13 = HEAP32[i27 >> 2] | 0;
    9762. 

  9762.     HEAP32[i27 >> 2] = i13 + 1;
    9763. 

  9763.     i13 = HEAPU8[i13] | 0;
    9764. 

  9764.    }
    9765. 

  9765.    HEAP32[i2 >> 2] = i13;
    9766. 

  9766.    if ((HEAP8[i13 + 10913 | 0] & 3) == 0) {
    9767. 

  9767.     i9 = 296;
    9768. 

  9768.     break;
    9769. 

  9769.    }
    9770. 

  9770.   }
    9771. 

  9771.   if ((i9 | 0) == 288) {
    9772. 

  9772.    _lexerror(i2, 12368, 0);
    9773. 

  9773.   } else if ((i9 | 0) == 290) {
    9774. 

  9774.    _luaM_toobig(i12);
    9775. 

  9775.   } else if ((i9 | 0) == 296) {
    9776. 

  9776.    i6 = HEAP32[i4 >> 2] | 0;
    9777. 

  9777.    i4 = HEAP32[i10 >> 2] | 0;
    9778. 

  9778.    i6 = _luaS_newlstr(i4, HEAP32[i6 >> 2] | 0, HEAP32[i6 + 4 >> 2] | 0) | 0;
    9779. 

  9779.    i7 = i4 + 8 | 0;
    9780. 

  9780.    i8 = HEAP32[i7 >> 2] | 0;
    9781. 

  9781.    HEAP32[i7 >> 2] = i8 + 16;
    9782. 

  9782.    HEAP32[i8 >> 2] = i6;
    9783. 

  9783.    i5 = i6 + 4 | 0;
    9784. 

  9784.    HEAP32[i8 + 8 >> 2] = HEAPU8[i5] | 64;
    9785. 

  9785.    i8 = _luaH_set(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i7 >> 2] | 0) + -16 | 0) | 0;
    9786. 

  9786.    i2 = i8 + 8 | 0;
    9787. 

  9787.    if ((HEAP32[i2 >> 2] | 0) == 0 ? (HEAP32[i8 >> 2] = 1, HEAP32[i2 >> 2] = 1, (HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
    9788. 

  9788.     _luaC_step(i4);
    9789. 

  9789.    }
    9790. 

  9790.    HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + -16;
    9791. 

  9791.    HEAP32[i3 >> 2] = i6;
    9792. 

  9792.    if ((HEAP8[i5] | 0) != 4) {
    9793. 

  9793.     i27 = 288;
    9794. 

  9794.     STACKTOP = i1;
    9795. 

  9795.     return i27 | 0;
    9796. 

  9796.    }
    9797. 

  9797.    i2 = HEAP8[i6 + 6 | 0] | 0;
    9798. 

  9798.    if (i2 << 24 >> 24 == 0) {
    9799. 

  9799.     i27 = 288;
    9800. 

  9800.     STACKTOP = i1;
    9801. 

  9801.     return i27 | 0;
    9802. 

  9802.    }
    9803. 

  9803.    i27 = i2 & 255 | 256;
    9804. 

  9804.    STACKTOP = i1;
    9805. 

  9805.    return i27 | 0;
    9806. 

  9806.   }
    9807. 

  9807.  } else if ((i9 | 0) == 306) {
    9808. 

  9808.   STACKTOP = i1;
    9809. 

  9809.   return i2 | 0;
    9810. 

  9810.  }
    9811. 

  9811.  i9 = HEAP32[i4 >> 2] | 0;
    9812. 

  9812.  i12 = i9 + 4 | 0;
    9813. 

  9813.  i13 = HEAP32[i12 >> 2] | 0;
    9814. 

  9814.  i11 = i9 + 8 | 0;
    9815. 

  9815.  i10 = HEAP32[i11 >> 2] | 0;
    9816. 

  9816.  do {
    9817. 

  9817.   if ((i13 + 1 | 0) >>> 0 > i10 >>> 0) {
    9818. 

  9818.    if (i10 >>> 0 > 2147483645) {
    9819. 

  9819.     _lexerror(i2, 12368, 0);
    9820. 

  9820.    }
    9821. 

  9821.    i18 = i10 << 1;
    9822. 

  9822.    i13 = HEAP32[i2 + 52 >> 2] | 0;
    9823. 

  9823.    if ((i18 | 0) == -2) {
    9824. 

  9824.     _luaM_toobig(i13);
    9825. 

  9825.    } else {
    9826. 

  9826.     i16 = _luaM_realloc_(i13, HEAP32[i9 >> 2] | 0, i10, i18) | 0;
    9827. 

  9827.     HEAP32[i9 >> 2] = i16;
    9828. 

  9828.     HEAP32[i11 >> 2] = i18;
    9829. 

  9829.     i17 = HEAP32[i12 >> 2] | 0;
    9830. 

  9830.     break;
    9831. 

  9831.    }
    9832. 

  9832.   } else {
    9833. 

  9833.    i17 = i13;
    9834. 

  9834.    i16 = HEAP32[i9 >> 2] | 0;
    9835. 

  9835.   }
    9836. 

  9836.  } while (0);
    9837. 

  9837.  HEAP32[i12 >> 2] = i17 + 1;
    9838. 

  9838.  HEAP8[i16 + i17 | 0] = i20;
    9839. 

  9839.  i9 = HEAP32[i5 >> 2] | 0;
    9840. 

  9840.  i27 = HEAP32[i9 >> 2] | 0;
    9841. 

  9841.  HEAP32[i9 >> 2] = i27 + -1;
    9842. 

  9842.  if ((i27 | 0) == 0) {
    9843. 

  9843.   i9 = _luaZ_fill(i9) | 0;
    9844. 

  9844.  } else {
    9845. 

  9845.   i27 = i9 + 4 | 0;
    9846. 

  9846.   i9 = HEAP32[i27 >> 2] | 0;
    9847. 

  9847.   HEAP32[i27 >> 2] = i9 + 1;
    9848. 

  9848.   i9 = HEAPU8[i9] | 0;
    9849. 

  9849.  }
    9850. 

  9850.  HEAP32[i2 >> 2] = i9;
    9851. 

  9851.  if ((i20 | 0) == 48) {
    9852. 

  9852.   if ((i9 | 0) != 0) {
    9853. 

  9853.    if ((_memchr(12320, i9, 3) | 0) == 0) {
    9854. 

  9854.     i15 = i9;
    9855. 

  9855.     i9 = 12312;
    9856. 

  9856.    } else {
    9857. 

  9857.     i10 = HEAP32[i4 >> 2] | 0;
    9858. 

  9858.     i13 = i10 + 4 | 0;
    9859. 

  9859.     i16 = HEAP32[i13 >> 2] | 0;
    9860. 

  9860.     i11 = i10 + 8 | 0;
    9861. 

  9861.     i12 = HEAP32[i11 >> 2] | 0;
    9862. 

  9862.     do {
    9863. 

  9863.      if ((i16 + 1 | 0) >>> 0 > i12 >>> 0) {
    9864. 

  9864.       if (i12 >>> 0 > 2147483645) {
    9865. 

  9865.        _lexerror(i2, 12368, 0);
    9866. 

  9866.       }
    9867. 

  9867.       i17 = i12 << 1;
    9868. 

  9868.       i16 = HEAP32[i2 + 52 >> 2] | 0;
    9869. 

  9869.       if ((i17 | 0) == -2) {
    9870. 

  9870.        _luaM_toobig(i16);
    9871. 

  9871.       } else {
    9872. 

  9872.        i15 = _luaM_realloc_(i16, HEAP32[i10 >> 2] | 0, i12, i17) | 0;
    9873. 

  9873.        HEAP32[i10 >> 2] = i15;
    9874. 

  9874.        HEAP32[i11 >> 2] = i17;
    9875. 

  9875.        i14 = HEAP32[i13 >> 2] | 0;
    9876. 

  9876.        break;
    9877. 

  9877.       }
    9878. 

  9878.      } else {
    9879. 

  9879.       i14 = i16;
    9880. 

  9880.       i15 = HEAP32[i10 >> 2] | 0;
    9881. 

  9881.      }
    9882. 

  9882.     } while (0);
    9883. 

  9883.     HEAP32[i13 >> 2] = i14 + 1;
    9884. 

  9884.     HEAP8[i15 + i14 | 0] = i9;
    9885. 

  9885.     i9 = HEAP32[i5 >> 2] | 0;
    9886. 

  9886.     i27 = HEAP32[i9 >> 2] | 0;
    9887. 

  9887.     HEAP32[i9 >> 2] = i27 + -1;
    9888. 

  9888.     if ((i27 | 0) == 0) {
    9889. 

  9889.      i15 = _luaZ_fill(i9) | 0;
    9890. 

  9890.     } else {
    9891. 

  9891.      i27 = i9 + 4 | 0;
    9892. 

  9892.      i15 = HEAP32[i27 >> 2] | 0;
    9893. 

  9893.      HEAP32[i27 >> 2] = i15 + 1;
    9894. 

  9894.      i15 = HEAPU8[i15] | 0;
    9895. 

  9895.     }
    9896. 

  9896.     HEAP32[i2 >> 2] = i15;
    9897. 

  9897.     i9 = 12328;
    9898. 

  9898.    }
    9899. 

  9899.   } else {
    9900. 

  9900.    i15 = 0;
    9901. 

  9901.    i9 = 12312;
    9902. 

  9902.   }
    9903. 

  9903.  } else {
    9904. 

  9904.   i15 = i9;
    9905. 

  9905.   i9 = 12312;
    9906. 

  9906.  }
    9907. 

  9907.  i10 = i2 + 52 | 0;
    9908. 

  9908.  while (1) {
    9909. 

  9909.   if ((i15 | 0) != 0) {
    9910. 

  9910.    if ((_memchr(i9, i15, 3) | 0) != 0) {
    9911. 

  9911.     i12 = HEAP32[i4 >> 2] | 0;
    9912. 

  9912.     i11 = i12 + 4 | 0;
    9913. 

  9913.     i16 = HEAP32[i11 >> 2] | 0;
    9914. 

  9914.     i14 = i12 + 8 | 0;
    9915. 

  9915.     i13 = HEAP32[i14 >> 2] | 0;
    9916. 

  9916.     if ((i16 + 1 | 0) >>> 0 > i13 >>> 0) {
    9917. 

  9917.      if (i13 >>> 0 > 2147483645) {
    9918. 

  9918.       i9 = 227;
    9919. 

  9919.       break;
    9920. 

  9920.      }
    9921. 

  9921.      i17 = i13 << 1;
    9922. 

  9922.      i16 = HEAP32[i10 >> 2] | 0;
    9923. 

  9923.      if ((i17 | 0) == -2) {
    9924. 

  9924.       i9 = 229;
    9925. 

  9925.       break;
    9926. 

  9926.      }
    9927. 

  9927.      i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
    9928. 

  9928.      HEAP32[i12 >> 2] = i27;
    9929. 

  9929.      HEAP32[i14 >> 2] = i17;
    9930. 

  9930.      i16 = HEAP32[i11 >> 2] | 0;
    9931. 

  9931.      i12 = i27;
    9932. 

  9932.     } else {
    9933. 

  9933.      i12 = HEAP32[i12 >> 2] | 0;
    9934. 

  9934.     }
    9935. 

  9935.     HEAP32[i11 >> 2] = i16 + 1;
    9936. 

  9936.     HEAP8[i12 + i16 | 0] = i15;
    9937. 

  9937.     i11 = HEAP32[i5 >> 2] | 0;
    9938. 

  9938.     i27 = HEAP32[i11 >> 2] | 0;
    9939. 

  9939.     HEAP32[i11 >> 2] = i27 + -1;
    9940. 

  9940.     if ((i27 | 0) == 0) {
    9941. 

  9941.      i15 = _luaZ_fill(i11) | 0;
    9942. 

  9942.     } else {
    9943. 

  9943.      i27 = i11 + 4 | 0;
    9944. 

  9944.      i15 = HEAP32[i27 >> 2] | 0;
    9945. 

  9945.      HEAP32[i27 >> 2] = i15 + 1;
    9946. 

  9946.      i15 = HEAPU8[i15] | 0;
    9947. 

  9947.     }
    9948. 

  9948.     HEAP32[i2 >> 2] = i15;
    9949. 

  9949.     if ((i15 | 0) != 0) {
    9950. 

  9950.      if ((_memchr(12336, i15, 3) | 0) != 0) {
    9951. 

  9951.       i12 = HEAP32[i4 >> 2] | 0;
    9952. 

  9952.       i11 = i12 + 4 | 0;
    9953. 

  9953.       i16 = HEAP32[i11 >> 2] | 0;
    9954. 

  9954.       i14 = i12 + 8 | 0;
    9955. 

  9955.       i13 = HEAP32[i14 >> 2] | 0;
    9956. 

  9956.       if ((i16 + 1 | 0) >>> 0 > i13 >>> 0) {
    9957. 

  9957.        if (i13 >>> 0 > 2147483645) {
    9958. 

  9958.         i9 = 239;
    9959. 

  9959.         break;
    9960. 

  9960.        }
    9961. 

  9961.        i17 = i13 << 1;
    9962. 

  9962.        i16 = HEAP32[i10 >> 2] | 0;
    9963. 

  9963.        if ((i17 | 0) == -2) {
    9964. 

  9964.         i9 = 241;
    9965. 

  9965.         break;
    9966. 

  9966.        }
    9967. 

  9967.        i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
    9968. 

  9968.        HEAP32[i12 >> 2] = i27;
    9969. 

  9969.        HEAP32[i14 >> 2] = i17;
    9970. 

  9970.        i16 = HEAP32[i11 >> 2] | 0;
    9971. 

  9971.        i12 = i27;
    9972. 

  9972.       } else {
    9973. 

  9973.        i12 = HEAP32[i12 >> 2] | 0;
    9974. 

  9974.       }
    9975. 

  9975.       HEAP32[i11 >> 2] = i16 + 1;
    9976. 

  9976.       HEAP8[i12 + i16 | 0] = i15;
    9977. 

  9977.       i11 = HEAP32[i5 >> 2] | 0;
    9978. 

  9978.       i27 = HEAP32[i11 >> 2] | 0;
    9979. 

  9979.       HEAP32[i11 >> 2] = i27 + -1;
    9980. 

  9980.       if ((i27 | 0) == 0) {
    9981. 

  9981.        i15 = _luaZ_fill(i11) | 0;
    9982. 

  9982.       } else {
    9983. 

  9983.        i27 = i11 + 4 | 0;
    9984. 

  9984.        i15 = HEAP32[i27 >> 2] | 0;
    9985. 

  9985.        HEAP32[i27 >> 2] = i15 + 1;
    9986. 

  9986.        i15 = HEAPU8[i15] | 0;
    9987. 

  9987.       }
    9988. 

  9988.       HEAP32[i2 >> 2] = i15;
    9989. 

  9989.      }
    9990. 

  9990.     } else {
    9991. 

  9991.      i15 = 0;
    9992. 

  9992.     }
    9993. 

  9993.    }
    9994. 

  9994.   } else {
    9995. 

  9995.    i15 = 0;
    9996. 

  9996.   }
    9997. 

  9997.   i12 = HEAP32[i4 >> 2] | 0;
    9998. 

  9998.   i11 = i12 + 4 | 0;
    9999. 

  9999.   i17 = HEAP32[i11 >> 2] | 0;
    10000. 

  10000.   i14 = i12 + 8 | 0;
    10001. 

  10001.   i13 = HEAP32[i14 >> 2] | 0;
    10002. 

  10002.   i16 = (i17 + 1 | 0) >>> 0 > i13 >>> 0;
    10003. 

  10003.   if (!((HEAP8[i15 + 10913 | 0] & 16) != 0 | (i15 | 0) == 46)) {
    10004. 

  10004.    i9 = 259;
    10005. 

  10005.    break;
    10006. 

  10006.   }
    10007. 

  10007.   if (i16) {
    10008. 

  10008.    if (i13 >>> 0 > 2147483645) {
    10009. 

  10009.     i9 = 251;
    10010. 

  10010.     break;
    10011. 

  10011.    }
    10012. 

  10012.    i17 = i13 << 1;
    10013. 

  10013.    i16 = HEAP32[i10 >> 2] | 0;
    10014. 

  10014.    if ((i17 | 0) == -2) {
    10015. 

  10015.     i9 = 253;
    10016. 

  10016.     break;
    10017. 

  10017.    }
    10018. 

  10018.    i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
    10019. 

  10019.    HEAP32[i12 >> 2] = i27;
    10020. 

  10020.    HEAP32[i14 >> 2] = i17;
    10021. 

  10021.    i17 = HEAP32[i11 >> 2] | 0;
    10022. 

  10022.    i12 = i27;
    10023. 

  10023.   } else {
    10024. 

  10024.    i12 = HEAP32[i12 >> 2] | 0;
    10025. 

  10025.   }
    10026. 

  10026.   HEAP32[i11 >> 2] = i17 + 1;
    10027. 

  10027.   HEAP8[i12 + i17 | 0] = i15;
    10028. 

  10028.   i11 = HEAP32[i5 >> 2] | 0;
    10029. 

  10029.   i27 = HEAP32[i11 >> 2] | 0;
    10030. 

  10030.   HEAP32[i11 >> 2] = i27 + -1;
    10031. 

  10031.   if ((i27 | 0) == 0) {
    10032. 

  10032.    i15 = _luaZ_fill(i11) | 0;
    10033. 

  10033.   } else {
    10034. 

  10034.    i27 = i11 + 4 | 0;
    10035. 

  10035.    i15 = HEAP32[i27 >> 2] | 0;
    10036. 

  10036.    HEAP32[i27 >> 2] = i15 + 1;
    10037. 

  10037.    i15 = HEAPU8[i15] | 0;
    10038. 

  10038.   }
    10039. 

  10039.   HEAP32[i2 >> 2] = i15;
    10040. 

  10040.  }
    10041. 

  10041.  if ((i9 | 0) == 227) {
    10042. 

  10042.   _lexerror(i2, 12368, 0);
    10043. 

  10043.  } else if ((i9 | 0) == 229) {
    10044. 

  10044.   _luaM_toobig(i16);
    10045. 

  10045.  } else if ((i9 | 0) == 239) {
    10046. 

  10046.   _lexerror(i2, 12368, 0);
    10047. 

  10047.  } else if ((i9 | 0) == 241) {
    10048. 

  10048.   _luaM_toobig(i16);
    10049. 

  10049.  } else if ((i9 | 0) == 251) {
    10050. 

  10050.   _lexerror(i2, 12368, 0);
    10051. 

  10051.  } else if ((i9 | 0) == 253) {
    10052. 

  10052.   _luaM_toobig(i16);
    10053. 

  10053.  } else if ((i9 | 0) == 259) {
    10054. 

  10054.   do {
    10055. 

  10055.    if (i16) {
    10056. 

  10056.     if (i13 >>> 0 > 2147483645) {
    10057. 

  10057.      _lexerror(i2, 12368, 0);
    10058. 

  10058.     }
    10059. 

  10059.     i5 = i13 << 1;
    10060. 

  10060.     i9 = HEAP32[i10 >> 2] | 0;
    10061. 

  10061.     if ((i5 | 0) == -2) {
    10062. 

  10062.      _luaM_toobig(i9);
    10063. 

  10063.     } else {
    10064. 

  10064.      i7 = _luaM_realloc_(i9, HEAP32[i12 >> 2] | 0, i13, i5) | 0;
    10065. 

  10065.      HEAP32[i12 >> 2] = i7;
    10066. 

  10066.      HEAP32[i14 >> 2] = i5;
    10067. 

  10067.      i8 = HEAP32[i11 >> 2] | 0;
    10068. 

  10068.      break;
    10069. 

  10069.     }
    10070. 

  10070.    } else {
    10071. 

  10071.     i8 = i17;
    10072. 

  10072.     i7 = HEAP32[i12 >> 2] | 0;
    10073. 

  10073.    }
    10074. 

  10074.   } while (0);
    10075. 

  10075.   HEAP32[i11 >> 2] = i8 + 1;
    10076. 

  10076.   HEAP8[i7 + i8 | 0] = 0;
    10077. 

  10077.   i5 = i2 + 76 | 0;
    10078. 

  10078.   i7 = HEAP8[i5] | 0;
    10079. 

  10079.   i10 = HEAP32[i4 >> 2] | 0;
    10080. 

  10080.   i8 = HEAP32[i10 >> 2] | 0;
    10081. 

  10081.   i10 = HEAP32[i10 + 4 >> 2] | 0;
    10082. 

  10082.   if ((i10 | 0) == 0) {
    10083. 

  10083.    i7 = -1;
    10084. 

  10084.   } else {
    10085. 

  10085.    do {
    10086. 

  10086.     i10 = i10 + -1 | 0;
    10087. 

  10087.     i9 = i8 + i10 | 0;
    10088. 

  10088.     if ((HEAP8[i9] | 0) == 46) {
    10089. 

  10089.      HEAP8[i9] = i7;
    10090. 

  10090.     }
    10091. 

  10091.    } while ((i10 | 0) != 0);
    10092. 

  10092.    i7 = HEAP32[i4 >> 2] | 0;
    10093. 

  10093.    i8 = HEAP32[i7 >> 2] | 0;
    10094. 

  10094.    i7 = (HEAP32[i7 + 4 >> 2] | 0) + -1 | 0;
    10095. 

  10095.   }
    10096. 

  10096.   if ((_luaO_str2d(i8, i7, i3) | 0) != 0) {
    10097. 

  10097.    i27 = 287;
    10098. 

  10098.    STACKTOP = i1;
    10099. 

  10099.    return i27 | 0;
    10100. 

  10100.   }
    10101. 

  10101.   i9 = HEAP8[i5] | 0;
    10102. 

  10102.   i8 = HEAP8[HEAP32[(_localeconv() | 0) >> 2] | 0] | 0;
    10103. 

  10103.   HEAP8[i5] = i8;
    10104. 

  10104.   i10 = HEAP32[i4 >> 2] | 0;
    10105. 

  10105.   i7 = HEAP32[i10 >> 2] | 0;
    10106. 

  10106.   i10 = HEAP32[i10 + 4 >> 2] | 0;
    10107. 

  10107.   if ((i10 | 0) == 0) {
    10108. 

  10108.    i8 = -1;
    10109. 

  10109.   } else {
    10110. 

  10110.    do {
    10111. 

  10111.     i10 = i10 + -1 | 0;
    10112. 

  10112.     i11 = i7 + i10 | 0;
    10113. 

  10113.     if ((HEAP8[i11] | 0) == i9 << 24 >> 24) {
    10114. 

  10114.      HEAP8[i11] = i8;
    10115. 

  10115.     }
    10116. 

  10116.    } while ((i10 | 0) != 0);
    10117. 

  10117.    i8 = HEAP32[i4 >> 2] | 0;
    10118. 

  10118.    i7 = HEAP32[i8 >> 2] | 0;
    10119. 

  10119.    i8 = (HEAP32[i8 + 4 >> 2] | 0) + -1 | 0;
    10120. 

  10120.   }
    10121. 

  10121.   if ((_luaO_str2d(i7, i8, i3) | 0) != 0) {
    10122. 

  10122.    i27 = 287;
    10123. 

  10123.    STACKTOP = i1;
    10124. 

  10124.    return i27 | 0;
    10125. 

  10125.   }
    10126. 

  10126.   i1 = HEAP8[i5] | 0;
    10127. 

  10127.   i4 = HEAP32[i4 >> 2] | 0;
    10128. 

  10128.   i3 = HEAP32[i4 >> 2] | 0;
    10129. 

  10129.   i4 = HEAP32[i4 + 4 >> 2] | 0;
    10130. 

  10130.   if ((i4 | 0) == 0) {
    10131. 

  10131.    _lexerror(i2, 12344, 287);
    10132. 

  10132.   } else {
    10133. 

  10133.    i6 = i4;
    10134. 

  10134.   }
    10135. 

  10135.   do {
    10136. 

  10136.    i6 = i6 + -1 | 0;
    10137. 

  10137.    i4 = i3 + i6 | 0;
    10138. 

  10138.    if ((HEAP8[i4] | 0) == i1 << 24 >> 24) {
    10139. 

  10139.     HEAP8[i4] = 46;
    10140. 

  10140.    }
    10141. 

  10141.   } while ((i6 | 0) != 0);
    10142. 

  10142.   _lexerror(i2, 12344, 287);
    10143. 

  10143.  }
    10144. 

  10144.  return 0;
    10145. 

  10145. }
    10146. 

  10146. function _luaV_execute(i1) {
    10147. 

  10147.  i1 = i1 | 0;
    10148. 

  10148.  var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, d37 = 0.0, d38 = 0.0, d39 = 0.0;
    10149. 

  10149.  i12 = STACKTOP;
    10150. 

  10150.  STACKTOP = STACKTOP + 32 | 0;
    10151. 

  10151.  i13 = i12 + 24 | 0;
    10152. 

  10152.  i10 = i12 + 16 | 0;
    10153. 

  10153.  i9 = i12 + 8 | 0;
    10154. 

  10154.  i8 = i12;
    10155. 

  10155.  i3 = i1 + 16 | 0;
    10156. 

  10156.  i4 = i1 + 40 | 0;
    10157. 

  10157.  i6 = i1 + 12 | 0;
    10158. 

  10158.  i5 = i1 + 8 | 0;
    10159. 

  10159.  i11 = i1 + 24 | 0;
    10160. 

  10160.  i17 = i1 + 48 | 0;
    10161. 

  10161.  i2 = i1 + 20 | 0;
    10162. 

  10162.  i16 = i1 + 6 | 0;
    10163. 

  10163.  i7 = i1 + 44 | 0;
    10164. 

  10164.  i19 = HEAP32[i3 >> 2] | 0;
    10165. 

  10165.  L1 : while (1) {
    10166. 

  10166.   i22 = HEAP32[HEAP32[i19 >> 2] >> 2] | 0;
    10167. 

  10167.   i18 = i22 + 12 | 0;
    10168. 

  10168.   i23 = HEAP32[(HEAP32[i18 >> 2] | 0) + 8 >> 2] | 0;
    10169. 

  10169.   i20 = i19 + 24 | 0;
    10170. 

  10170.   i21 = i19 + 28 | 0;
    10171. 

  10171.   i22 = i22 + 16 | 0;
    10172. 

  10172.   i24 = i19 + 4 | 0;
    10173. 

  10173.   i25 = HEAP32[i20 >> 2] | 0;
    10174. 

  10174.   L3 : while (1) {
    10175. 

  10175.    i28 = HEAP32[i21 >> 2] | 0;
    10176. 

  10176.    HEAP32[i21 >> 2] = i28 + 4;
    10177. 

  10177.    i28 = HEAP32[i28 >> 2] | 0;
    10178. 

  10178.    i27 = HEAP8[i4] | 0;
    10179. 

  10179.    do {
    10180. 

  10180.     if (!((i27 & 12) == 0)) {
    10181. 

  10181.      i26 = (HEAP32[i17 >> 2] | 0) + -1 | 0;
    10182. 

  10182.      HEAP32[i17 >> 2] = i26;
    10183. 

  10183.      i26 = (i26 | 0) == 0;
    10184. 

  10184.      if (!i26 ? (i27 & 4) == 0 : 0) {
    10185. 

  10185.       break;
    10186. 

  10186.      }
    10187. 

  10187.      i25 = HEAP32[i3 >> 2] | 0;
    10188. 

  10188.      i29 = i27 & 255;
    10189. 

  10189.      if ((i29 & 8 | 0) == 0 | i26 ^ 1) {
    10190. 

  10190.       i27 = 0;
    10191. 

  10191.      } else {
    10192. 

  10192.       HEAP32[i17 >> 2] = HEAP32[i7 >> 2];
    10193. 

  10193.       i27 = 1;
    10194. 

  10194.      }
    10195. 

  10195.      i26 = i25 + 18 | 0;
    10196. 

  10196.      i30 = HEAPU8[i26] | 0;
    10197. 

  10197.      if ((i30 & 128 | 0) == 0) {
    10198. 

  10198.       if (i27) {
    10199. 

  10199.        _luaD_hook(i1, 3, -1);
    10200. 

  10200.       }
    10201. 

  10201.       do {
    10202. 

  10202.        if ((i29 & 4 | 0) == 0) {
    10203. 

  10203.         i29 = i25 + 28 | 0;
    10204. 

  10204.        } else {
    10205. 

  10205.         i34 = HEAP32[(HEAP32[HEAP32[i25 >> 2] >> 2] | 0) + 12 >> 2] | 0;
    10206. 

  10206.         i29 = i25 + 28 | 0;
    10207. 

  10207.         i32 = HEAP32[i29 >> 2] | 0;
    10208. 

  10208.         i35 = HEAP32[i34 + 12 >> 2] | 0;
    10209. 

  10209.         i33 = (i32 - i35 >> 2) + -1 | 0;
    10210. 

  10210.         i34 = HEAP32[i34 + 20 >> 2] | 0;
    10211. 

  10211.         i31 = (i34 | 0) == 0;
    10212. 

  10212.         if (i31) {
    10213. 

  10213.          i30 = 0;
    10214. 

  10214.         } else {
    10215. 

  10215.          i30 = HEAP32[i34 + (i33 << 2) >> 2] | 0;
    10216. 

  10216.         }
    10217. 

  10217.         if ((i33 | 0) != 0 ? (i14 = HEAP32[i2 >> 2] | 0, i32 >>> 0 > i14 >>> 0) : 0) {
    10218. 

  10218.          if (i31) {
    10219. 

  10219.           i31 = 0;
    10220. 

  10220.          } else {
    10221. 

  10221.           i31 = HEAP32[i34 + ((i14 - i35 >> 2) + -1 << 2) >> 2] | 0;
    10222. 

  10222.          }
    10223. 

  10223.          if ((i30 | 0) == (i31 | 0)) {
    10224. 

  10224.           break;
    10225. 

  10225.          }
    10226. 

  10226.         }
    10227. 

  10227.         _luaD_hook(i1, 2, i30);
    10228. 

  10228.        }
    10229. 

  10229.       } while (0);
    10230. 

  10230.       HEAP32[i2 >> 2] = HEAP32[i29 >> 2];
    10231. 

  10231.       if ((HEAP8[i16] | 0) == 1) {
    10232. 

  10232.        i15 = 23;
    10233. 

  10233.        break L1;
    10234. 

  10234.       }
    10235. 

  10235.      } else {
    10236. 

  10236.       HEAP8[i26] = i30 & 127;
    10237. 

  10237.      }
    10238. 

  10238.      i25 = HEAP32[i20 >> 2] | 0;
    10239. 

  10239.     }
    10240. 

  10240.    } while (0);
    10241. 

  10241.    i26 = i28 >>> 6 & 255;
    10242. 

  10242.    i27 = i25 + (i26 << 4) | 0;
    10243. 

  10243.    switch (i28 & 63 | 0) {
    10244. 

  10244.    case 9:
    10245. 

  10245.     {
    10246. 

  10246.      i28 = HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0;
    10247. 

  10247.      i35 = HEAP32[i28 + 8 >> 2] | 0;
    10248. 

  10248.      i33 = i27;
    10249. 

  10249.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10250. 

  10250.      i36 = i35;
    10251. 

  10251.      HEAP32[i36 >> 2] = HEAP32[i33 >> 2];
    10252. 

  10252.      HEAP32[i36 + 4 >> 2] = i34;
    10253. 

  10253.      i36 = i25 + (i26 << 4) + 8 | 0;
    10254. 

  10254.      HEAP32[i35 + 8 >> 2] = HEAP32[i36 >> 2];
    10255. 

  10255.      if ((HEAP32[i36 >> 2] & 64 | 0) == 0) {
    10256. 

  10256.       continue L3;
    10257. 

  10257.      }
    10258. 

  10258.      i26 = HEAP32[i27 >> 2] | 0;
    10259. 

  10259.      if ((HEAP8[i26 + 5 | 0] & 3) == 0) {
    10260. 

  10260.       continue L3;
    10261. 

  10261.      }
    10262. 

  10262.      if ((HEAP8[i28 + 5 | 0] & 4) == 0) {
    10263. 

  10263.       continue L3;
    10264. 

  10264.      }
    10265. 

  10265.      _luaC_barrier_(i1, i28, i26);
    10266. 

  10266.      continue L3;
    10267. 

  10267.     }
    10268. 

  10268.    case 10:
    10269. 

  10269.     {
    10270. 

  10270.      i26 = i28 >>> 23;
    10271. 

  10271.      if ((i26 & 256 | 0) == 0) {
    10272. 

  10272.       i26 = i25 + (i26 << 4) | 0;
    10273. 

  10273.      } else {
    10274. 

  10274.       i26 = i23 + ((i26 & 255) << 4) | 0;
    10275. 

  10275.      }
    10276. 

  10276.      i28 = i28 >>> 14;
    10277. 

  10277.      if ((i28 & 256 | 0) == 0) {
    10278. 

  10278.       i25 = i25 + ((i28 & 511) << 4) | 0;
    10279. 

  10279.      } else {
    10280. 

  10280.       i25 = i23 + ((i28 & 255) << 4) | 0;
    10281. 

  10281.      }
    10282. 

  10282.      _luaV_settable(i1, i27, i26, i25);
    10283. 

  10283.      i25 = HEAP32[i20 >> 2] | 0;
    10284. 

  10284.      continue L3;
    10285. 

  10285.     }
    10286. 

  10286.    case 17:
    10287. 

  10287.     {
    10288. 

  10288.      i29 = i28 >>> 23;
    10289. 

  10289.      if ((i29 & 256 | 0) == 0) {
    10290. 

  10290.       i29 = i25 + (i29 << 4) | 0;
    10291. 

  10291.      } else {
    10292. 

  10292.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10293. 

  10293.      }
    10294. 

  10294.      i28 = i28 >>> 14;
    10295. 

  10295.      if ((i28 & 256 | 0) == 0) {
    10296. 

  10296.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10297. 

  10297.      } else {
    10298. 

  10298.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10299. 

  10299.      }
    10300. 

  10300.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10301. 

  10301.       d37 = +HEAPF64[i29 >> 3];
    10302. 

  10302.       d38 = +HEAPF64[i28 >> 3];
    10303. 

  10303.       HEAPF64[i27 >> 3] = d37 - d38 * +Math_floor(+(d37 / d38));
    10304. 

  10304.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10305. 

  10305.       continue L3;
    10306. 

  10306.      }
    10307. 

  10307.      _luaV_arith(i1, i27, i29, i28, 10);
    10308. 

  10308.      i25 = HEAP32[i20 >> 2] | 0;
    10309. 

  10309.      continue L3;
    10310. 

  10310.     }
    10311. 

  10311.    case 23:
    10312. 

  10312.     {
    10313. 

  10313.      if ((i26 | 0) != 0) {
    10314. 

  10314.       _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i26 + -1 << 4) | 0);
    10315. 

  10315.      }
    10316. 

  10316.      HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
    10317. 

  10317.      continue L3;
    10318. 

  10318.     }
    10319. 

  10319.    case 24:
    10320. 

  10320.     {
    10321. 

  10321.      i27 = i28 >>> 23;
    10322. 

  10322.      if ((i27 & 256 | 0) == 0) {
    10323. 

  10323.       i27 = i25 + (i27 << 4) | 0;
    10324. 

  10324.      } else {
    10325. 

  10325.       i27 = i23 + ((i27 & 255) << 4) | 0;
    10326. 

  10326.      }
    10327. 

  10327.      i28 = i28 >>> 14;
    10328. 

  10328.      if ((i28 & 256 | 0) == 0) {
    10329. 

  10329.       i25 = i25 + ((i28 & 511) << 4) | 0;
    10330. 

  10330.      } else {
    10331. 

  10331.       i25 = i23 + ((i28 & 255) << 4) | 0;
    10332. 

  10332.      }
    10333. 

  10333.      if ((HEAP32[i27 + 8 >> 2] | 0) == (HEAP32[i25 + 8 >> 2] | 0)) {
    10334. 

  10334.       i27 = (_luaV_equalobj_(i1, i27, i25) | 0) != 0;
    10335. 

  10335.      } else {
    10336. 

  10336.       i27 = 0;
    10337. 

  10337.      }
    10338. 

  10338.      i25 = HEAP32[i21 >> 2] | 0;
    10339. 

  10339.      if ((i27 & 1 | 0) == (i26 | 0)) {
    10340. 

  10340.       i26 = HEAP32[i25 >> 2] | 0;
    10341. 

  10341.       i27 = i26 >>> 6 & 255;
    10342. 

  10342.       if ((i27 | 0) != 0) {
    10343. 

  10343.        _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
    10344. 

  10344.        i25 = HEAP32[i21 >> 2] | 0;
    10345. 

  10345.       }
    10346. 

  10346.       i25 = i25 + ((i26 >>> 14) + -131070 << 2) | 0;
    10347. 

  10347.      } else {
    10348. 

  10348.       i25 = i25 + 4 | 0;
    10349. 

  10349.      }
    10350. 

  10350.      HEAP32[i21 >> 2] = i25;
    10351. 

  10351.      i25 = HEAP32[i20 >> 2] | 0;
    10352. 

  10352.      continue L3;
    10353. 

  10353.     }
    10354. 

  10354.    case 18:
    10355. 

  10355.     {
    10356. 

  10356.      i29 = i28 >>> 23;
    10357. 

  10357.      if ((i29 & 256 | 0) == 0) {
    10358. 

  10358.       i29 = i25 + (i29 << 4) | 0;
    10359. 

  10359.      } else {
    10360. 

  10360.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10361. 

  10361.      }
    10362. 

  10362.      i28 = i28 >>> 14;
    10363. 

  10363.      if ((i28 & 256 | 0) == 0) {
    10364. 

  10364.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10365. 

  10365.      } else {
    10366. 

  10366.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10367. 

  10367.      }
    10368. 

  10368.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10369. 

  10369.       HEAPF64[i27 >> 3] = +Math_pow(+(+HEAPF64[i29 >> 3]), +(+HEAPF64[i28 >> 3]));
    10370. 

  10370.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10371. 

  10371.       continue L3;
    10372. 

  10372.      }
    10373. 

  10373.      _luaV_arith(i1, i27, i29, i28, 11);
    10374. 

  10374.      i25 = HEAP32[i20 >> 2] | 0;
    10375. 

  10375.      continue L3;
    10376. 

  10376.     }
    10377. 

  10377.    case 1:
    10378. 

  10378.     {
    10379. 

  10379.      i36 = i28 >>> 14;
    10380. 

  10380.      i33 = i23 + (i36 << 4) | 0;
    10381. 

  10381.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10382. 

  10382.      i35 = i27;
    10383. 

  10383.      HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    10384. 

  10384.      HEAP32[i35 + 4 >> 2] = i34;
    10385. 

  10385.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i23 + (i36 << 4) + 8 >> 2];
    10386. 

  10386.      continue L3;
    10387. 

  10387.     }
    10388. 

  10388.    case 0:
    10389. 

  10389.     {
    10390. 

  10390.      i36 = i28 >>> 23;
    10391. 

  10391.      i33 = i25 + (i36 << 4) | 0;
    10392. 

  10392.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10393. 

  10393.      i35 = i27;
    10394. 

  10394.      HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    10395. 

  10395.      HEAP32[i35 + 4 >> 2] = i34;
    10396. 

  10396.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
    10397. 

  10397.      continue L3;
    10398. 

  10398.     }
    10399. 

  10399.    case 2:
    10400. 

  10400.     {
    10401. 

  10401.      i36 = HEAP32[i21 >> 2] | 0;
    10402. 

  10402.      HEAP32[i21 >> 2] = i36 + 4;
    10403. 

  10403.      i36 = (HEAP32[i36 >> 2] | 0) >>> 6;
    10404. 

  10404.      i33 = i23 + (i36 << 4) | 0;
    10405. 

  10405.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10406. 

  10406.      i35 = i27;
    10407. 

  10407.      HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    10408. 

  10408.      HEAP32[i35 + 4 >> 2] = i34;
    10409. 

  10409.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i23 + (i36 << 4) + 8 >> 2];
    10410. 

  10410.      continue L3;
    10411. 

  10411.     }
    10412. 

  10412.    case 5:
    10413. 

  10413.     {
    10414. 

  10414.      i36 = HEAP32[(HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0) + 8 >> 2] | 0;
    10415. 

  10415.      i33 = i36;
    10416. 

  10416.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10417. 

  10417.      i35 = i27;
    10418. 

  10418.      HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    10419. 

  10419.      HEAP32[i35 + 4 >> 2] = i34;
    10420. 

  10420.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i36 + 8 >> 2];
    10421. 

  10421.      continue L3;
    10422. 

  10422.     }
    10423. 

  10423.    case 3:
    10424. 

  10424.     {
    10425. 

  10425.      HEAP32[i27 >> 2] = i28 >>> 23;
    10426. 

  10426.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = 1;
    10427. 

  10427.      if ((i28 & 8372224 | 0) == 0) {
    10428. 

  10428.       continue L3;
    10429. 

  10429.      }
    10430. 

  10430.      HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
    10431. 

  10431.      continue L3;
    10432. 

  10432.     }
    10433. 

  10433.    case 7:
    10434. 

  10434.     {
    10435. 

  10435.      i26 = i28 >>> 14;
    10436. 

  10436.      if ((i26 & 256 | 0) == 0) {
    10437. 

  10437.       i26 = i25 + ((i26 & 511) << 4) | 0;
    10438. 

  10438.      } else {
    10439. 

  10439.       i26 = i23 + ((i26 & 255) << 4) | 0;
    10440. 

  10440.      }
    10441. 

  10441.      _luaV_gettable(i1, i25 + (i28 >>> 23 << 4) | 0, i26, i27);
    10442. 

  10442.      i25 = HEAP32[i20 >> 2] | 0;
    10443. 

  10443.      continue L3;
    10444. 

  10444.     }
    10445. 

  10445.    case 12:
    10446. 

  10446.     {
    10447. 

  10447.      i36 = i28 >>> 23;
    10448. 

  10448.      i29 = i25 + (i36 << 4) | 0;
    10449. 

  10449.      i26 = i26 + 1 | 0;
    10450. 

  10450.      i33 = i29;
    10451. 

  10451.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10452. 

  10452.      i35 = i25 + (i26 << 4) | 0;
    10453. 

  10453.      HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    10454. 

  10454.      HEAP32[i35 + 4 >> 2] = i34;
    10455. 

  10455.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
    10456. 

  10456.      i26 = i28 >>> 14;
    10457. 

  10457.      if ((i26 & 256 | 0) == 0) {
    10458. 

  10458.       i25 = i25 + ((i26 & 511) << 4) | 0;
    10459. 

  10459.      } else {
    10460. 

  10460.       i25 = i23 + ((i26 & 255) << 4) | 0;
    10461. 

  10461.      }
    10462. 

  10462.      _luaV_gettable(i1, i29, i25, i27);
    10463. 

  10463.      i25 = HEAP32[i20 >> 2] | 0;
    10464. 

  10464.      continue L3;
    10465. 

  10465.     }
    10466. 

  10466.    case 13:
    10467. 

  10467.     {
    10468. 

  10468.      i29 = i28 >>> 23;
    10469. 

  10469.      if ((i29 & 256 | 0) == 0) {
    10470. 

  10470.       i29 = i25 + (i29 << 4) | 0;
    10471. 

  10471.      } else {
    10472. 

  10472.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10473. 

  10473.      }
    10474. 

  10474.      i28 = i28 >>> 14;
    10475. 

  10475.      if ((i28 & 256 | 0) == 0) {
    10476. 

  10476.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10477. 

  10477.      } else {
    10478. 

  10478.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10479. 

  10479.      }
    10480. 

  10480.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10481. 

  10481.       HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] + +HEAPF64[i28 >> 3];
    10482. 

  10482.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10483. 

  10483.       continue L3;
    10484. 

  10484.      }
    10485. 

  10485.      _luaV_arith(i1, i27, i29, i28, 6);
    10486. 

  10486.      i25 = HEAP32[i20 >> 2] | 0;
    10487. 

  10487.      continue L3;
    10488. 

  10488.     }
    10489. 

  10489.    case 14:
    10490. 

  10490.     {
    10491. 

  10491.      i29 = i28 >>> 23;
    10492. 

  10492.      if ((i29 & 256 | 0) == 0) {
    10493. 

  10493.       i29 = i25 + (i29 << 4) | 0;
    10494. 

  10494.      } else {
    10495. 

  10495.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10496. 

  10496.      }
    10497. 

  10497.      i28 = i28 >>> 14;
    10498. 

  10498.      if ((i28 & 256 | 0) == 0) {
    10499. 

  10499.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10500. 

  10500.      } else {
    10501. 

  10501.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10502. 

  10502.      }
    10503. 

  10503.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10504. 

  10504.       HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] - +HEAPF64[i28 >> 3];
    10505. 

  10505.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10506. 

  10506.       continue L3;
    10507. 

  10507.      }
    10508. 

  10508.      _luaV_arith(i1, i27, i29, i28, 7);
    10509. 

  10509.      i25 = HEAP32[i20 >> 2] | 0;
    10510. 

  10510.      continue L3;
    10511. 

  10511.     }
    10512. 

  10512.    case 6:
    10513. 

  10513.     {
    10514. 

  10514.      i26 = i28 >>> 14;
    10515. 

  10515.      if ((i26 & 256 | 0) == 0) {
    10516. 

  10516.       i25 = i25 + ((i26 & 511) << 4) | 0;
    10517. 

  10517.      } else {
    10518. 

  10518.       i25 = i23 + ((i26 & 255) << 4) | 0;
    10519. 

  10519.      }
    10520. 

  10520.      _luaV_gettable(i1, HEAP32[(HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0) + 8 >> 2] | 0, i25, i27);
    10521. 

  10521.      i25 = HEAP32[i20 >> 2] | 0;
    10522. 

  10522.      continue L3;
    10523. 

  10523.     }
    10524. 

  10524.    case 4:
    10525. 

  10525.     {
    10526. 

  10526.      i26 = i28 >>> 23;
    10527. 

  10527.      while (1) {
    10528. 

  10528.       HEAP32[i27 + 8 >> 2] = 0;
    10529. 

  10529.       if ((i26 | 0) == 0) {
    10530. 

  10530.        continue L3;
    10531. 

  10531.       } else {
    10532. 

  10532.        i26 = i26 + -1 | 0;
    10533. 

  10533.        i27 = i27 + 16 | 0;
    10534. 

  10534.       }
    10535. 

  10535.      }
    10536. 

  10536.     }
    10537. 

  10537.    case 8:
    10538. 

  10538.     {
    10539. 

  10539.      i27 = i28 >>> 23;
    10540. 

  10540.      if ((i27 & 256 | 0) == 0) {
    10541. 

  10541.       i27 = i25 + (i27 << 4) | 0;
    10542. 

  10542.      } else {
    10543. 

  10543.       i27 = i23 + ((i27 & 255) << 4) | 0;
    10544. 

  10544.      }
    10545. 

  10545.      i28 = i28 >>> 14;
    10546. 

  10546.      if ((i28 & 256 | 0) == 0) {
    10547. 

  10547.       i25 = i25 + ((i28 & 511) << 4) | 0;
    10548. 

  10548.      } else {
    10549. 

  10549.       i25 = i23 + ((i28 & 255) << 4) | 0;
    10550. 

  10550.      }
    10551. 

  10551.      _luaV_settable(i1, HEAP32[(HEAP32[i22 + (i26 << 2) >> 2] | 0) + 8 >> 2] | 0, i27, i25);
    10552. 

  10552.      i25 = HEAP32[i20 >> 2] | 0;
    10553. 

  10553.      continue L3;
    10554. 

  10554.     }
    10555. 

  10555.    case 11:
    10556. 

  10556.     {
    10557. 

  10557.      i29 = i28 >>> 23;
    10558. 

  10558.      i28 = i28 >>> 14 & 511;
    10559. 

  10559.      i30 = _luaH_new(i1) | 0;
    10560. 

  10560.      HEAP32[i27 >> 2] = i30;
    10561. 

  10561.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = 69;
    10562. 

  10562.      if ((i28 | i29 | 0) != 0) {
    10563. 

  10563.       i36 = _luaO_fb2int(i29) | 0;
    10564. 

  10564.       _luaH_resize(i1, i30, i36, _luaO_fb2int(i28) | 0);
    10565. 

  10565.      }
    10566. 

  10566.      if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
    10567. 

  10567.       HEAP32[i5 >> 2] = i25 + (i26 + 1 << 4);
    10568. 

  10568.       _luaC_step(i1);
    10569. 

  10569.       HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    10570. 

  10570.      }
    10571. 

  10571.      i25 = HEAP32[i20 >> 2] | 0;
    10572. 

  10572.      continue L3;
    10573. 

  10573.     }
    10574. 

  10574.    case 19:
    10575. 

  10575.     {
    10576. 

  10576.      i36 = i28 >>> 23;
    10577. 

  10577.      i28 = i25 + (i36 << 4) | 0;
    10578. 

  10578.      if ((HEAP32[i25 + (i36 << 4) + 8 >> 2] | 0) == 3) {
    10579. 

  10579.       HEAPF64[i27 >> 3] = -+HEAPF64[i28 >> 3];
    10580. 

  10580.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10581. 

  10581.       continue L3;
    10582. 

  10582.      } else {
    10583. 

  10583.       _luaV_arith(i1, i27, i28, i28, 12);
    10584. 

  10584.       i25 = HEAP32[i20 >> 2] | 0;
    10585. 

  10585.       continue L3;
    10586. 

  10586.      }
    10587. 

  10587.     }
    10588. 

  10588.    case 15:
    10589. 

  10589.     {
    10590. 

  10590.      i29 = i28 >>> 23;
    10591. 

  10591.      if ((i29 & 256 | 0) == 0) {
    10592. 

  10592.       i29 = i25 + (i29 << 4) | 0;
    10593. 

  10593.      } else {
    10594. 

  10594.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10595. 

  10595.      }
    10596. 

  10596.      i28 = i28 >>> 14;
    10597. 

  10597.      if ((i28 & 256 | 0) == 0) {
    10598. 

  10598.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10599. 

  10599.      } else {
    10600. 

  10600.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10601. 

  10601.      }
    10602. 

  10602.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10603. 

  10603.       HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] * +HEAPF64[i28 >> 3];
    10604. 

  10604.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10605. 

  10605.       continue L3;
    10606. 

  10606.      }
    10607. 

  10607.      _luaV_arith(i1, i27, i29, i28, 8);
    10608. 

  10608.      i25 = HEAP32[i20 >> 2] | 0;
    10609. 

  10609.      continue L3;
    10610. 

  10610.     }
    10611. 

  10611.    case 16:
    10612. 

  10612.     {
    10613. 

  10613.      i29 = i28 >>> 23;
    10614. 

  10614.      if ((i29 & 256 | 0) == 0) {
    10615. 

  10615.       i29 = i25 + (i29 << 4) | 0;
    10616. 

  10616.      } else {
    10617. 

  10617.       i29 = i23 + ((i29 & 255) << 4) | 0;
    10618. 

  10618.      }
    10619. 

  10619.      i28 = i28 >>> 14;
    10620. 

  10620.      if ((i28 & 256 | 0) == 0) {
    10621. 

  10621.       i28 = i25 + ((i28 & 511) << 4) | 0;
    10622. 

  10622.      } else {
    10623. 

  10623.       i28 = i23 + ((i28 & 255) << 4) | 0;
    10624. 

  10624.      }
    10625. 

  10625.      if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
    10626. 

  10626.       HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] / +HEAPF64[i28 >> 3];
    10627. 

  10627.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10628. 

  10628.       continue L3;
    10629. 

  10629.      }
    10630. 

  10630.      _luaV_arith(i1, i27, i29, i28, 9);
    10631. 

  10631.      i25 = HEAP32[i20 >> 2] | 0;
    10632. 

  10632.      continue L3;
    10633. 

  10633.     }
    10634. 

  10634.    case 20:
    10635. 

  10635.     {
    10636. 

  10636.      i29 = i28 >>> 23;
    10637. 

  10637.      i28 = HEAP32[i25 + (i29 << 4) + 8 >> 2] | 0;
    10638. 

  10638.      if ((i28 | 0) != 0) {
    10639. 

  10639.       if ((i28 | 0) == 1) {
    10640. 

  10640.        i28 = (HEAP32[i25 + (i29 << 4) >> 2] | 0) == 0;
    10641. 

  10641.       } else {
    10642. 

  10642.        i28 = 0;
    10643. 

  10643.       }
    10644. 

  10644.      } else {
    10645. 

  10645.       i28 = 1;
    10646. 

  10646.      }
    10647. 

  10647.      HEAP32[i27 >> 2] = i28 & 1;
    10648. 

  10648.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = 1;
    10649. 

  10649.      continue L3;
    10650. 

  10650.     }
    10651. 

  10651.    case 21:
    10652. 

  10652.     {
    10653. 

  10653.      _luaV_objlen(i1, i27, i25 + (i28 >>> 23 << 4) | 0);
    10654. 

  10654.      i25 = HEAP32[i20 >> 2] | 0;
    10655. 

  10655.      continue L3;
    10656. 

  10656.     }
    10657. 

  10657.    case 22:
    10658. 

  10658.     {
    10659. 

  10659.      i27 = i28 >>> 23;
    10660. 

  10660.      i28 = i28 >>> 14 & 511;
    10661. 

  10661.      HEAP32[i5 >> 2] = i25 + (i28 + 1 << 4);
    10662. 

  10662.      _luaV_concat(i1, 1 - i27 + i28 | 0);
    10663. 

  10663.      i25 = HEAP32[i20 >> 2] | 0;
    10664. 

  10664.      i28 = i25 + (i27 << 4) | 0;
    10665. 

  10665.      i34 = i28;
    10666. 

  10666.      i35 = HEAP32[i34 + 4 >> 2] | 0;
    10667. 

  10667.      i36 = i25 + (i26 << 4) | 0;
    10668. 

  10668.      HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
    10669. 

  10669.      HEAP32[i36 + 4 >> 2] = i35;
    10670. 

  10670.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i27 << 4) + 8 >> 2];
    10671. 

  10671.      if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
    10672. 

  10672.       if (!(i26 >>> 0 < i27 >>> 0)) {
    10673. 

  10673.        i28 = i25 + (i26 + 1 << 4) | 0;
    10674. 

  10674.       }
    10675. 

  10675.       HEAP32[i5 >> 2] = i28;
    10676. 

  10676.       _luaC_step(i1);
    10677. 

  10677.       HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    10678. 

  10678.      }
    10679. 

  10679.      i25 = HEAP32[i20 >> 2] | 0;
    10680. 

  10680.      HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    10681. 

  10681.      continue L3;
    10682. 

  10682.     }
    10683. 

  10683.    case 25:
    10684. 

  10684.     {
    10685. 

  10685.      i27 = i28 >>> 23;
    10686. 

  10686.      if ((i27 & 256 | 0) == 0) {
    10687. 

  10687.       i27 = i25 + (i27 << 4) | 0;
    10688. 

  10688.      } else {
    10689. 

  10689.       i27 = i23 + ((i27 & 255) << 4) | 0;
    10690. 

  10690.      }
    10691. 

  10691.      i28 = i28 >>> 14;
    10692. 

  10692.      if ((i28 & 256 | 0) == 0) {
    10693. 

  10693.       i25 = i25 + ((i28 & 511) << 4) | 0;
    10694. 

  10694.      } else {
    10695. 

  10695.       i25 = i23 + ((i28 & 255) << 4) | 0;
    10696. 

  10696.      }
    10697. 

  10697.      i36 = (_luaV_lessthan(i1, i27, i25) | 0) == (i26 | 0);
    10698. 

  10698.      i26 = HEAP32[i21 >> 2] | 0;
    10699. 

  10699.      if (i36) {
    10700. 

  10700.       i25 = HEAP32[i26 >> 2] | 0;
    10701. 

  10701.       i27 = i25 >>> 6 & 255;
    10702. 

  10702.       if ((i27 | 0) != 0) {
    10703. 

  10703.        _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
    10704. 

  10704.        i26 = HEAP32[i21 >> 2] | 0;
    10705. 

  10705.       }
    10706. 

  10706.       i25 = i26 + ((i25 >>> 14) + -131070 << 2) | 0;
    10707. 

  10707.      } else {
    10708. 

  10708.       i25 = i26 + 4 | 0;
    10709. 

  10709.      }
    10710. 

  10710.      HEAP32[i21 >> 2] = i25;
    10711. 

  10711.      i25 = HEAP32[i20 >> 2] | 0;
    10712. 

  10712.      continue L3;
    10713. 

  10713.     }
    10714. 

  10714.    case 27:
    10715. 

  10715.     {
    10716. 

  10716.      i29 = HEAP32[i25 + (i26 << 4) + 8 >> 2] | 0;
    10717. 

  10717.      i26 = (i29 | 0) == 0;
    10718. 

  10718.      if ((i28 & 8372224 | 0) == 0) {
    10719. 

  10719.       if (!i26) {
    10720. 

  10720.        if (!((i29 | 0) == 1 ? (HEAP32[i27 >> 2] | 0) == 0 : 0)) {
    10721. 

  10721.         i15 = 192;
    10722. 

  10722.        }
    10723. 

  10723.       }
    10724. 

  10724.      } else {
    10725. 

  10725.       if (!i26) {
    10726. 

  10726.        if ((i29 | 0) == 1 ? (HEAP32[i27 >> 2] | 0) == 0 : 0) {
    10727. 

  10727.         i15 = 192;
    10728. 

  10728.        }
    10729. 

  10729.       } else {
    10730. 

  10730.        i15 = 192;
    10731. 

  10731.       }
    10732. 

  10732.      }
    10733. 

  10733.      if ((i15 | 0) == 192) {
    10734. 

  10734.       i15 = 0;
    10735. 

  10735.       HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
    10736. 

  10736.       continue L3;
    10737. 

  10737.      }
    10738. 

  10738.      i27 = HEAP32[i21 >> 2] | 0;
    10739. 

  10739.      i26 = HEAP32[i27 >> 2] | 0;
    10740. 

  10740.      i28 = i26 >>> 6 & 255;
    10741. 

  10741.      if ((i28 | 0) != 0) {
    10742. 

  10742.       _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i28 + -1 << 4) | 0);
    10743. 

  10743.       i27 = HEAP32[i21 >> 2] | 0;
    10744. 

  10744.      }
    10745. 

  10745.      HEAP32[i21 >> 2] = i27 + ((i26 >>> 14) + -131070 << 2);
    10746. 

  10746.      continue L3;
    10747. 

  10747.     }
    10748. 

  10748.    case 26:
    10749. 

  10749.     {
    10750. 

  10750.      i27 = i28 >>> 23;
    10751. 

  10751.      if ((i27 & 256 | 0) == 0) {
    10752. 

  10752.       i27 = i25 + (i27 << 4) | 0;
    10753. 

  10753.      } else {
    10754. 

  10754.       i27 = i23 + ((i27 & 255) << 4) | 0;
    10755. 

  10755.      }
    10756. 

  10756.      i28 = i28 >>> 14;
    10757. 

  10757.      if ((i28 & 256 | 0) == 0) {
    10758. 

  10758.       i25 = i25 + ((i28 & 511) << 4) | 0;
    10759. 

  10759.      } else {
    10760. 

  10760.       i25 = i23 + ((i28 & 255) << 4) | 0;
    10761. 

  10761.      }
    10762. 

  10762.      i36 = (_luaV_lessequal(i1, i27, i25) | 0) == (i26 | 0);
    10763. 

  10763.      i26 = HEAP32[i21 >> 2] | 0;
    10764. 

  10764.      if (i36) {
    10765. 

  10765.       i25 = HEAP32[i26 >> 2] | 0;
    10766. 

  10766.       i27 = i25 >>> 6 & 255;
    10767. 

  10767.       if ((i27 | 0) != 0) {
    10768. 

  10768.        _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
    10769. 

  10769.        i26 = HEAP32[i21 >> 2] | 0;
    10770. 

  10770.       }
    10771. 

  10771.       i25 = i26 + ((i25 >>> 14) + -131070 << 2) | 0;
    10772. 

  10772.      } else {
    10773. 

  10773.       i25 = i26 + 4 | 0;
    10774. 

  10774.      }
    10775. 

  10775.      HEAP32[i21 >> 2] = i25;
    10776. 

  10776.      i25 = HEAP32[i20 >> 2] | 0;
    10777. 

  10777.      continue L3;
    10778. 

  10778.     }
    10779. 

  10779.    case 28:
    10780. 

  10780.     {
    10781. 

  10781.      i30 = i28 >>> 23;
    10782. 

  10782.      i29 = i25 + (i30 << 4) | 0;
    10783. 

  10783.      i30 = HEAP32[i25 + (i30 << 4) + 8 >> 2] | 0;
    10784. 

  10784.      i31 = (i30 | 0) == 0;
    10785. 

  10785.      if ((i28 & 8372224 | 0) == 0) {
    10786. 

  10786.       if (!i31) {
    10787. 

  10787.        if (!((i30 | 0) == 1 ? (HEAP32[i29 >> 2] | 0) == 0 : 0)) {
    10788. 

  10788.         i15 = 203;
    10789. 

  10789.        }
    10790. 

  10790.       }
    10791. 

  10791.      } else {
    10792. 

  10792.       if (!i31) {
    10793. 

  10793.        if ((i30 | 0) == 1 ? (HEAP32[i29 >> 2] | 0) == 0 : 0) {
    10794. 

  10794.         i15 = 203;
    10795. 

  10795.        }
    10796. 

  10796.       } else {
    10797. 

  10797.        i15 = 203;
    10798. 

  10798.       }
    10799. 

  10799.      }
    10800. 

  10800.      if ((i15 | 0) == 203) {
    10801. 

  10801.       i15 = 0;
    10802. 

  10802.       HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
    10803. 

  10803.       continue L3;
    10804. 

  10804.      }
    10805. 

  10805.      i36 = i29;
    10806. 

  10806.      i28 = HEAP32[i36 + 4 >> 2] | 0;
    10807. 

  10807.      HEAP32[i27 >> 2] = HEAP32[i36 >> 2];
    10808. 

  10808.      HEAP32[i27 + 4 >> 2] = i28;
    10809. 

  10809.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = i30;
    10810. 

  10810.      i27 = HEAP32[i21 >> 2] | 0;
    10811. 

  10811.      i26 = HEAP32[i27 >> 2] | 0;
    10812. 

  10812.      i28 = i26 >>> 6 & 255;
    10813. 

  10813.      if ((i28 | 0) != 0) {
    10814. 

  10814.       _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i28 + -1 << 4) | 0);
    10815. 

  10815.       i27 = HEAP32[i21 >> 2] | 0;
    10816. 

  10816.      }
    10817. 

  10817.      HEAP32[i21 >> 2] = i27 + ((i26 >>> 14) + -131070 << 2);
    10818. 

  10818.      continue L3;
    10819. 

  10819.     }
    10820. 

  10820.    case 30:
    10821. 

  10821.     {
    10822. 

  10822.      i28 = i28 >>> 23;
    10823. 

  10823.      if ((i28 | 0) != 0) {
    10824. 

  10824.       HEAP32[i5 >> 2] = i25 + (i26 + i28 << 4);
    10825. 

  10825.      }
    10826. 

  10826.      if ((_luaD_precall(i1, i27, -1) | 0) == 0) {
    10827. 

  10827.       i15 = 218;
    10828. 

  10828.       break L3;
    10829. 

  10829.      }
    10830. 

  10830.      i25 = HEAP32[i20 >> 2] | 0;
    10831. 

  10831.      continue L3;
    10832. 

  10832.     }
    10833. 

  10833.    case 29:
    10834. 

  10834.     {
    10835. 

  10835.      i29 = i28 >>> 23;
    10836. 

  10836.      i28 = i28 >>> 14 & 511;
    10837. 

  10837.      if ((i29 | 0) != 0) {
    10838. 

  10838.       HEAP32[i5 >> 2] = i25 + (i26 + i29 << 4);
    10839. 

  10839.      }
    10840. 

  10840.      if ((_luaD_precall(i1, i27, i28 + -1 | 0) | 0) == 0) {
    10841. 

  10841.       i15 = 213;
    10842. 

  10842.       break L3;
    10843. 

  10843.      }
    10844. 

  10844.      if ((i28 | 0) != 0) {
    10845. 

  10845.       HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    10846. 

  10846.      }
    10847. 

  10847.      i25 = HEAP32[i20 >> 2] | 0;
    10848. 

  10848.      continue L3;
    10849. 

  10849.     }
    10850. 

  10850.    case 32:
    10851. 

  10851.     {
    10852. 

  10852.      d39 = +HEAPF64[i25 + (i26 + 2 << 4) >> 3];
    10853. 

  10853.      d38 = d39 + +HEAPF64[i27 >> 3];
    10854. 

  10854.      d37 = +HEAPF64[i25 + (i26 + 1 << 4) >> 3];
    10855. 

  10855.      if (d39 > 0.0) {
    10856. 

  10856.       if (!(d38 <= d37)) {
    10857. 

  10857.        continue L3;
    10858. 

  10858.       }
    10859. 

  10859.      } else {
    10860. 

  10860.       if (!(d37 <= d38)) {
    10861. 

  10861.        continue L3;
    10862. 

  10862.       }
    10863. 

  10863.      }
    10864. 

  10864.      HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
    10865. 

  10865.      HEAPF64[i27 >> 3] = d38;
    10866. 

  10866.      HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
    10867. 

  10867.      i36 = i26 + 3 | 0;
    10868. 

  10868.      HEAPF64[i25 + (i36 << 4) >> 3] = d38;
    10869. 

  10869.      HEAP32[i25 + (i36 << 4) + 8 >> 2] = 3;
    10870. 

  10870.      continue L3;
    10871. 

  10871.     }
    10872. 

  10872.    case 33:
    10873. 

  10873.     {
    10874. 

  10874.      i32 = i26 + 1 | 0;
    10875. 

  10875.      i30 = i25 + (i32 << 4) | 0;
    10876. 

  10876.      i31 = i26 + 2 | 0;
    10877. 

  10877.      i29 = i25 + (i31 << 4) | 0;
    10878. 

  10878.      i26 = i25 + (i26 << 4) + 8 | 0;
    10879. 

  10879.      i33 = HEAP32[i26 >> 2] | 0;
    10880. 

  10880.      if ((i33 | 0) != 3) {
    10881. 

  10881.       if ((i33 & 15 | 0) != 4) {
    10882. 

  10882.        i15 = 239;
    10883. 

  10883.        break L1;
    10884. 

  10884.       }
    10885. 

  10885.       i36 = HEAP32[i27 >> 2] | 0;
    10886. 

  10886.       if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i8) | 0) == 0) {
    10887. 

  10887.        i15 = 239;
    10888. 

  10888.        break L1;
    10889. 

  10889.       }
    10890. 

  10890.       HEAPF64[i27 >> 3] = +HEAPF64[i8 >> 3];
    10891. 

  10891.       HEAP32[i26 >> 2] = 3;
    10892. 

  10892.       if ((i27 | 0) == 0) {
    10893. 

  10893.        i15 = 239;
    10894. 

  10894.        break L1;
    10895. 

  10895.       }
    10896. 

  10896.      }
    10897. 

  10897.      i33 = i25 + (i32 << 4) + 8 | 0;
    10898. 

  10898.      i32 = HEAP32[i33 >> 2] | 0;
    10899. 

  10899.      if ((i32 | 0) != 3) {
    10900. 

  10900.       if ((i32 & 15 | 0) != 4) {
    10901. 

  10901.        i15 = 244;
    10902. 

  10902.        break L1;
    10903. 

  10903.       }
    10904. 

  10904.       i36 = HEAP32[i30 >> 2] | 0;
    10905. 

  10905.       if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i9) | 0) == 0) {
    10906. 

  10906.        i15 = 244;
    10907. 

  10907.        break L1;
    10908. 

  10908.       }
    10909. 

  10909.       HEAPF64[i30 >> 3] = +HEAPF64[i9 >> 3];
    10910. 

  10910.       HEAP32[i33 >> 2] = 3;
    10911. 

  10911.      }
    10912. 

  10912.      i31 = i25 + (i31 << 4) + 8 | 0;
    10913. 

  10913.      i30 = HEAP32[i31 >> 2] | 0;
    10914. 

  10914.      if ((i30 | 0) != 3) {
    10915. 

  10915.       if ((i30 & 15 | 0) != 4) {
    10916. 

  10916.        i15 = 249;
    10917. 

  10917.        break L1;
    10918. 

  10918.       }
    10919. 

  10919.       i36 = HEAP32[i29 >> 2] | 0;
    10920. 

  10920.       if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i10) | 0) == 0) {
    10921. 

  10921.        i15 = 249;
    10922. 

  10922.        break L1;
    10923. 

  10923.       }
    10924. 

  10924.       HEAPF64[i29 >> 3] = +HEAPF64[i10 >> 3];
    10925. 

  10925.       HEAP32[i31 >> 2] = 3;
    10926. 

  10926.      }
    10927. 

  10927.      HEAPF64[i27 >> 3] = +HEAPF64[i27 >> 3] - +HEAPF64[i29 >> 3];
    10928. 

  10928.      HEAP32[i26 >> 2] = 3;
    10929. 

  10929.      HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
    10930. 

  10930.      continue L3;
    10931. 

  10931.     }
    10932. 

  10932.    case 31:
    10933. 

  10933.     {
    10934. 

  10934.      i15 = 223;
    10935. 

  10935.      break L3;
    10936. 

  10936.     }
    10937. 

  10937.    case 34:
    10938. 

  10938.     {
    10939. 

  10939.      i35 = i26 + 3 | 0;
    10940. 

  10940.      i36 = i25 + (i35 << 4) | 0;
    10941. 

  10941.      i33 = i26 + 2 | 0;
    10942. 

  10942.      i34 = i26 + 5 | 0;
    10943. 

  10943.      i32 = i25 + (i33 << 4) | 0;
    10944. 

  10944.      i31 = HEAP32[i32 + 4 >> 2] | 0;
    10945. 

  10945.      i30 = i25 + (i34 << 4) | 0;
    10946. 

  10946.      HEAP32[i30 >> 2] = HEAP32[i32 >> 2];
    10947. 

  10947.      HEAP32[i30 + 4 >> 2] = i31;
    10948. 

  10948.      HEAP32[i25 + (i34 << 4) + 8 >> 2] = HEAP32[i25 + (i33 << 4) + 8 >> 2];
    10949. 

  10949.      i34 = i26 + 1 | 0;
    10950. 

  10950.      i33 = i26 + 4 | 0;
    10951. 

  10951.      i30 = i25 + (i34 << 4) | 0;
    10952. 

  10952.      i31 = HEAP32[i30 + 4 >> 2] | 0;
    10953. 

  10953.      i32 = i25 + (i33 << 4) | 0;
    10954. 

  10954.      HEAP32[i32 >> 2] = HEAP32[i30 >> 2];
    10955. 

  10955.      HEAP32[i32 + 4 >> 2] = i31;
    10956. 

  10956.      HEAP32[i25 + (i33 << 4) + 8 >> 2] = HEAP32[i25 + (i34 << 4) + 8 >> 2];
    10957. 

  10957.      i33 = i27;
    10958. 

  10958.      i34 = HEAP32[i33 + 4 >> 2] | 0;
    10959. 

  10959.      i27 = i36;
    10960. 

  10960.      HEAP32[i27 >> 2] = HEAP32[i33 >> 2];
    10961. 

  10961.      HEAP32[i27 + 4 >> 2] = i34;
    10962. 

  10962.      HEAP32[i25 + (i35 << 4) + 8 >> 2] = HEAP32[i25 + (i26 << 4) + 8 >> 2];
    10963. 

  10963.      HEAP32[i5 >> 2] = i25 + (i26 + 6 << 4);
    10964. 

  10964.      _luaD_call(i1, i36, i28 >>> 14 & 511, 1);
    10965. 

  10965.      i36 = HEAP32[i20 >> 2] | 0;
    10966. 

  10966.      HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    10967. 

  10967.      i27 = HEAP32[i21 >> 2] | 0;
    10968. 

  10968.      HEAP32[i21 >> 2] = i27 + 4;
    10969. 

  10969.      i27 = HEAP32[i27 >> 2] | 0;
    10970. 

  10970.      i25 = i36;
    10971. 

  10971.      i28 = i27;
    10972. 

  10972.      i27 = i36 + ((i27 >>> 6 & 255) << 4) | 0;
    10973. 

  10973.      break;
    10974. 

  10974.     }
    10975. 

  10975.    case 35:
    10976. 

  10976.     {
    10977. 

  10977.      break;
    10978. 

  10978.     }
    10979. 

  10979.    case 36:
    10980. 

  10980.     {
    10981. 

  10981.      i29 = i28 >>> 23;
    10982. 

  10982.      i28 = i28 >>> 14 & 511;
    10983. 

  10983.      if ((i29 | 0) == 0) {
    10984. 

  10984.       i29 = ((HEAP32[i5 >> 2] | 0) - i27 >> 4) + -1 | 0;
    10985. 

  10985.      }
    10986. 

  10986.      if ((i28 | 0) == 0) {
    10987. 

  10987.       i28 = HEAP32[i21 >> 2] | 0;
    10988. 

  10988.       HEAP32[i21 >> 2] = i28 + 4;
    10989. 

  10989.       i28 = (HEAP32[i28 >> 2] | 0) >>> 6;
    10990. 

  10990.      }
    10991. 

  10991.      i27 = HEAP32[i27 >> 2] | 0;
    10992. 

  10992.      i30 = i29 + -50 + (i28 * 50 | 0) | 0;
    10993. 

  10993.      if ((i30 | 0) > (HEAP32[i27 + 28 >> 2] | 0)) {
    10994. 

  10994.       _luaH_resizearray(i1, i27, i30);
    10995. 

  10995.      }
    10996. 

  10996.      if ((i29 | 0) > 0) {
    10997. 

  10997.       i28 = i27 + 5 | 0;
    10998. 

  10998.       while (1) {
    10999. 

  10999.        i36 = i29 + i26 | 0;
    11000. 

  11000.        i32 = i25 + (i36 << 4) | 0;
    11001. 

  11001.        i31 = i30 + -1 | 0;
    11002. 

  11002.        _luaH_setint(i1, i27, i30, i32);
    11003. 

  11003.        if (((HEAP32[i25 + (i36 << 4) + 8 >> 2] & 64 | 0) != 0 ? !((HEAP8[(HEAP32[i32 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) ? !((HEAP8[i28] & 4) == 0) : 0) {
    11004. 

  11004.         _luaC_barrierback_(i1, i27);
    11005. 

  11005.        }
    11006. 

  11006.        i29 = i29 + -1 | 0;
    11007. 

  11007.        if ((i29 | 0) > 0) {
    11008. 

  11008.         i30 = i31;
    11009. 

  11009.        } else {
    11010. 

  11010.         break;
    11011. 

  11011.        }
    11012. 

  11012.       }
    11013. 

  11013.      }
    11014. 

  11014.      HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    11015. 

  11015.      continue L3;
    11016. 

  11016.     }
    11017. 

  11017.    case 37:
    11018. 

  11018.     {
    11019. 

  11019.      i29 = HEAP32[(HEAP32[(HEAP32[i18 >> 2] | 0) + 16 >> 2] | 0) + (i28 >>> 14 << 2) >> 2] | 0;
    11020. 

  11020.      i28 = i29 + 32 | 0;
    11021. 

  11021.      i33 = HEAP32[i28 >> 2] | 0;
    11022. 

  11022.      i30 = HEAP32[i29 + 40 >> 2] | 0;
    11023. 

  11023.      i31 = HEAP32[i29 + 28 >> 2] | 0;
    11024. 

  11024.      L323 : do {
    11025. 

  11025.       if ((i33 | 0) == 0) {
    11026. 

  11026.        i15 = 276;
    11027. 

  11027.       } else {
    11028. 

  11028.        if ((i30 | 0) > 0) {
    11029. 

  11029.         i34 = i33 + 16 | 0;
    11030. 

  11030.         i32 = 0;
    11031. 

  11031.         while (1) {
    11032. 

  11032.          i35 = HEAPU8[i31 + (i32 << 3) + 5 | 0] | 0;
    11033. 

  11033.          if ((HEAP8[i31 + (i32 << 3) + 4 | 0] | 0) == 0) {
    11034. 

  11034.           i36 = HEAP32[(HEAP32[i22 + (i35 << 2) >> 2] | 0) + 8 >> 2] | 0;
    11035. 

  11035.          } else {
    11036. 

  11036.           i36 = i25 + (i35 << 4) | 0;
    11037. 

  11037.          }
    11038. 

  11038.          i35 = i32 + 1 | 0;
    11039. 

  11039.          if ((HEAP32[(HEAP32[i34 + (i32 << 2) >> 2] | 0) + 8 >> 2] | 0) != (i36 | 0)) {
    11040. 

  11040.           i15 = 276;
    11041. 

  11041.           break L323;
    11042. 

  11042.          }
    11043. 

  11043.          if ((i35 | 0) < (i30 | 0)) {
    11044. 

  11044.           i32 = i35;
    11045. 

  11045.          } else {
    11046. 

  11046.           break;
    11047. 

  11047.          }
    11048. 

  11048.         }
    11049. 

  11049.        }
    11050. 

  11050.        HEAP32[i27 >> 2] = i33;
    11051. 

  11051.        HEAP32[i25 + (i26 << 4) + 8 >> 2] = 70;
    11052. 

  11052.       }
    11053. 

  11053.      } while (0);
    11054. 

  11054.      if ((i15 | 0) == 276) {
    11055. 

  11055.       i15 = 0;
    11056. 

  11056.       i32 = _luaF_newLclosure(i1, i30) | 0;
    11057. 

  11057.       HEAP32[i32 + 12 >> 2] = i29;
    11058. 

  11058.       HEAP32[i27 >> 2] = i32;
    11059. 

  11059.       HEAP32[i25 + (i26 << 4) + 8 >> 2] = 70;
    11060. 

  11060.       if ((i30 | 0) > 0) {
    11061. 

  11061.        i27 = i32 + 16 | 0;
    11062. 

  11062.        i34 = 0;
    11063. 

  11063.        do {
    11064. 

  11064.         i33 = HEAPU8[i31 + (i34 << 3) + 5 | 0] | 0;
    11065. 

  11065.         if ((HEAP8[i31 + (i34 << 3) + 4 | 0] | 0) == 0) {
    11066. 

  11066.          HEAP32[i27 + (i34 << 2) >> 2] = HEAP32[i22 + (i33 << 2) >> 2];
    11067. 

  11067.         } else {
    11068. 

  11068.          HEAP32[i27 + (i34 << 2) >> 2] = _luaF_findupval(i1, i25 + (i33 << 4) | 0) | 0;
    11069. 

  11069.         }
    11070. 

  11070.         i34 = i34 + 1 | 0;
    11071. 

  11071.        } while ((i34 | 0) != (i30 | 0));
    11072. 

  11072.       }
    11073. 

  11073.       if (!((HEAP8[i29 + 5 | 0] & 4) == 0)) {
    11074. 

  11074.        _luaC_barrierproto_(i1, i29, i32);
    11075. 

  11075.       }
    11076. 

  11076.       HEAP32[i28 >> 2] = i32;
    11077. 

  11077.      }
    11078. 

  11078.      if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
    11079. 

  11079.       HEAP32[i5 >> 2] = i25 + (i26 + 1 << 4);
    11080. 

  11080.       _luaC_step(i1);
    11081. 

  11081.       HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
    11082. 

  11082.      }
    11083. 

  11083.      i25 = HEAP32[i20 >> 2] | 0;
    11084. 

  11084.      continue L3;
    11085. 

  11085.     }
    11086. 

  11086.    case 38:
    11087. 

  11087.     {
    11088. 

  11088.      i36 = i28 >>> 23;
    11089. 

  11089.      i29 = i36 + -1 | 0;
    11090. 

  11090.      i30 = (i25 - (HEAP32[i19 >> 2] | 0) >> 4) - (HEAPU8[(HEAP32[i18 >> 2] | 0) + 76 | 0] | 0) | 0;
    11091. 

  11091.      i28 = i30 + -1 | 0;
    11092. 

  11092.      if ((i36 | 0) == 0) {
    11093. 

  11093.       if (((HEAP32[i11 >> 2] | 0) - (HEAP32[i5 >> 2] | 0) >> 4 | 0) <= (i28 | 0)) {
    11094. 

  11094.        _luaD_growstack(i1, i28);
    11095. 

  11095.       }
    11096. 

  11096.       i27 = HEAP32[i20 >> 2] | 0;
    11097. 

  11097.       HEAP32[i5 >> 2] = i27 + (i28 + i26 << 4);
    11098. 

  11098.       i29 = i28;
    11099. 

  11099.       i25 = i27;
    11100. 

  11100.       i27 = i27 + (i26 << 4) | 0;
    11101. 

  11101.      }
    11102. 

  11102.      if ((i29 | 0) <= 0) {
    11103. 

  11103.       continue L3;
    11104. 

  11104.      }
    11105. 

  11105.      i26 = 1 - i30 | 0;
    11106. 

  11106.      i30 = 0;
    11107. 

  11107.      while (1) {
    11108. 

  11108.       if ((i30 | 0) < (i28 | 0)) {
    11109. 

  11109.        i36 = i30 + i26 | 0;
    11110. 

  11110.        i33 = i25 + (i36 << 4) | 0;
    11111. 

  11111.        i34 = HEAP32[i33 + 4 >> 2] | 0;
    11112. 

  11112.        i35 = i27 + (i30 << 4) | 0;
    11113. 

  11113.        HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
    11114. 

  11114.        HEAP32[i35 + 4 >> 2] = i34;
    11115. 

  11115.        HEAP32[i27 + (i30 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
    11116. 

  11116.       } else {
    11117. 

  11117.        HEAP32[i27 + (i30 << 4) + 8 >> 2] = 0;
    11118. 

  11118.       }
    11119. 

  11119.       i30 = i30 + 1 | 0;
    11120. 

  11120.       if ((i30 | 0) == (i29 | 0)) {
    11121. 

  11121.        continue L3;
    11122. 

  11122.       }
    11123. 

  11123.      }
    11124. 

  11124.     }
    11125. 

  11125.    default:
    11126. 

  11126.     {
    11127. 

  11127.      continue L3;
    11128. 

  11128.     }
    11129. 

  11129.    }
    11130. 

  11130.    i26 = HEAP32[i27 + 24 >> 2] | 0;
    11131. 

  11131.    if ((i26 | 0) == 0) {
    11132. 

  11132.     continue;
    11133. 

  11133.    }
    11134. 

  11134.    i34 = i27 + 16 | 0;
    11135. 

  11135.    i35 = HEAP32[i34 + 4 >> 2] | 0;
    11136. 

  11136.    i36 = i27;
    11137. 

  11137.    HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
    11138. 

  11138.    HEAP32[i36 + 4 >> 2] = i35;
    11139. 

  11139.    HEAP32[i27 + 8 >> 2] = i26;
    11140. 

  11140.    HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
    11141. 

  11141.   }
    11142. 

  11142.   if ((i15 | 0) == 213) {
    11143. 

  11143.    i15 = 0;
    11144. 

  11144.    i19 = HEAP32[i3 >> 2] | 0;
    11145. 

  11145.    i36 = i19 + 18 | 0;
    11146. 

  11146.    HEAP8[i36] = HEAPU8[i36] | 4;
    11147. 

  11147.    continue;
    11148. 

  11148.   } else if ((i15 | 0) == 218) {
    11149. 

  11149.    i15 = 0;
    11150. 

  11150.    i22 = HEAP32[i3 >> 2] | 0;
    11151. 

  11151.    i19 = HEAP32[i22 + 8 >> 2] | 0;
    11152. 

  11152.    i23 = HEAP32[i22 >> 2] | 0;
    11153. 

  11153.    i24 = HEAP32[i19 >> 2] | 0;
    11154. 

  11154.    i20 = i22 + 24 | 0;
    11155. 

  11155.    i21 = (HEAP32[i20 >> 2] | 0) + (HEAPU8[(HEAP32[(HEAP32[i23 >> 2] | 0) + 12 >> 2] | 0) + 76 | 0] << 4) | 0;
    11156. 

  11156.    if ((HEAP32[(HEAP32[i18 >> 2] | 0) + 56 >> 2] | 0) > 0) {
    11157. 

  11157.     _luaF_close(i1, HEAP32[i19 + 24 >> 2] | 0);
    11158. 

  11158.    }
    11159. 

  11159.    if (i23 >>> 0 < i21 >>> 0) {
    11160. 

  11160.     i25 = i23;
    11161. 

  11161.     i18 = 0;
    11162. 

  11162.     do {
    11163. 

  11163.      i34 = i25;
    11164. 

  11164.      i35 = HEAP32[i34 + 4 >> 2] | 0;
    11165. 

  11165.      i36 = i24 + (i18 << 4) | 0;
    11166. 

  11166.      HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
    11167. 

  11167.      HEAP32[i36 + 4 >> 2] = i35;
    11168. 

  11168.      HEAP32[i24 + (i18 << 4) + 8 >> 2] = HEAP32[i23 + (i18 << 4) + 8 >> 2];
    11169. 

  11169.      i18 = i18 + 1 | 0;
    11170. 

  11170.      i25 = i23 + (i18 << 4) | 0;
    11171. 

  11171.     } while (i25 >>> 0 < i21 >>> 0);
    11172. 

  11172.    }
    11173. 

  11173.    i36 = i23;
    11174. 

  11174.    HEAP32[i19 + 24 >> 2] = i24 + ((HEAP32[i20 >> 2] | 0) - i36 >> 4 << 4);
    11175. 

  11175.    i36 = i24 + ((HEAP32[i5 >> 2] | 0) - i36 >> 4 << 4) | 0;
    11176. 

  11176.    HEAP32[i5 >> 2] = i36;
    11177. 

  11177.    HEAP32[i19 + 4 >> 2] = i36;
    11178. 

  11178.    HEAP32[i19 + 28 >> 2] = HEAP32[i22 + 28 >> 2];
    11179. 

  11179.    i36 = i19 + 18 | 0;
    11180. 

  11180.    HEAP8[i36] = HEAPU8[i36] | 64;
    11181. 

  11181.    HEAP32[i3 >> 2] = i19;
    11182. 

  11182.    continue;
    11183. 

  11183.   } else if ((i15 | 0) == 223) {
    11184. 

  11184.    i15 = 0;
    11185. 

  11185.    i20 = i28 >>> 23;
    11186. 

  11186.    if ((i20 | 0) != 0) {
    11187. 

  11187.     HEAP32[i5 >> 2] = i25 + (i20 + -1 + i26 << 4);
    11188. 

  11188.    }
    11189. 

  11189.    if ((HEAP32[(HEAP32[i18 >> 2] | 0) + 56 >> 2] | 0) > 0) {
    11190. 

  11190.     _luaF_close(i1, i25);
    11191. 

  11191.    }
    11192. 

  11192.    i18 = _luaD_poscall(i1, i27) | 0;
    11193. 

  11193.    if ((HEAP8[i19 + 18 | 0] & 4) == 0) {
    11194. 

  11194.     i15 = 228;
    11195. 

  11195.     break;
    11196. 

  11196.    }
    11197. 

  11197.    i19 = HEAP32[i3 >> 2] | 0;
    11198. 

  11198.    if ((i18 | 0) == 0) {
    11199. 

  11199.     continue;
    11200. 

  11200.    }
    11201. 

  11201.    HEAP32[i5 >> 2] = HEAP32[i19 + 4 >> 2];
    11202. 

  11202.    continue;
    11203. 

  11203.   }
    11204. 

  11204.  }
    11205. 

  11205.  if ((i15 | 0) == 23) {
    11206. 

  11206.   if (!i27) {
    11207. 

  11207.    i36 = HEAP32[i29 >> 2] | 0;
    11208. 

  11208.    i36 = i36 + -4 | 0;
    11209. 

  11209.    HEAP32[i29 >> 2] = i36;
    11210. 

  11210.    i36 = HEAP8[i26] | 0;
    11211. 

  11211.    i36 = i36 & 255;
    11212. 

  11212.    i36 = i36 | 128;
    11213. 

  11213.    i36 = i36 & 255;
    11214. 

  11214.    HEAP8[i26] = i36;
    11215. 

  11215.    i36 = HEAP32[i5 >> 2] | 0;
    11216. 

  11216.    i36 = i36 + -16 | 0;
    11217. 

  11217.    HEAP32[i25 >> 2] = i36;
    11218. 

  11218.    _luaD_throw(i1, 1);
    11219. 

  11219.   }
    11220. 

  11220.   HEAP32[i17 >> 2] = 1;
    11221. 

  11221.   i36 = HEAP32[i29 >> 2] | 0;
    11222. 

  11222.   i36 = i36 + -4 | 0;
    11223. 

  11223.   HEAP32[i29 >> 2] = i36;
    11224. 

  11224.   i36 = HEAP8[i26] | 0;
    11225. 

  11225.   i36 = i36 & 255;
    11226. 

  11226.   i36 = i36 | 128;
    11227. 

  11227.   i36 = i36 & 255;
    11228. 

  11228.   HEAP8[i26] = i36;
    11229. 

  11229.   i36 = HEAP32[i5 >> 2] | 0;
    11230. 

  11230.   i36 = i36 + -16 | 0;
    11231. 

  11231.   HEAP32[i25 >> 2] = i36;
    11232. 

  11232.   _luaD_throw(i1, 1);
    11233. 

  11233.  } else if ((i15 | 0) == 228) {
    11234. 

  11234.   STACKTOP = i12;
    11235. 

  11235.   return;
    11236. 

  11236.  } else if ((i15 | 0) == 239) {
    11237. 

  11237.   _luaG_runerror(i1, 9040, i13);
    11238. 

  11238.  } else if ((i15 | 0) == 244) {
    11239. 

  11239.   _luaG_runerror(i1, 9080, i13);
    11240. 

  11240.  } else if ((i15 | 0) == 249) {
    11241. 

  11241.   _luaG_runerror(i1, 9112, i13);
    11242. 

  11242.  }
    11243. 

  11243. }
    11244. 

  11244. function ___floatscan(i8, i2, i11) {
    11245. 

  11245.  i8 = i8 | 0;
    11246. 

  11246.  i2 = i2 | 0;
    11247. 

  11247.  i11 = i11 | 0;
    11248. 

  11248.  var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, d14 = 0.0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, d28 = 0.0, i29 = 0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0;
    11249. 

  11249.  i1 = STACKTOP;
    11250. 

  11250.  STACKTOP = STACKTOP + 512 | 0;
    11251. 

  11251.  i5 = i1;
    11252. 

  11252.  if ((i2 | 0) == 1) {
    11253. 

  11253.   i2 = 53;
    11254. 

  11254.   i3 = -1074;
    11255. 

  11255.  } else if ((i2 | 0) == 2) {
    11256. 

  11256.   i2 = 53;
    11257. 

  11257.   i3 = -1074;
    11258. 

  11258.  } else if ((i2 | 0) == 0) {
    11259. 

  11259.   i2 = 24;
    11260. 

  11260.   i3 = -149;
    11261. 

  11261.  } else {
    11262. 

  11262.   d31 = 0.0;
    11263. 

  11263.   STACKTOP = i1;
    11264. 

  11264.   return +d31;
    11265. 

  11265.  }
    11266. 

  11266.  i9 = i8 + 4 | 0;
    11267. 

  11267.  i10 = i8 + 100 | 0;
    11268. 

  11268.  do {
    11269. 

  11269.   i4 = HEAP32[i9 >> 2] | 0;
    11270. 

  11270.   if (i4 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11271. 

  11271.    HEAP32[i9 >> 2] = i4 + 1;
    11272. 

  11272.    i21 = HEAPU8[i4] | 0;
    11273. 

  11273.   } else {
    11274. 

  11274.    i21 = ___shgetc(i8) | 0;
    11275. 

  11275.   }
    11276. 

  11276.  } while ((_isspace(i21 | 0) | 0) != 0);
    11277. 

  11277.  do {
    11278. 

  11278.   if ((i21 | 0) == 43 | (i21 | 0) == 45) {
    11279. 

  11279.    i4 = 1 - (((i21 | 0) == 45) << 1) | 0;
    11280. 

  11280.    i7 = HEAP32[i9 >> 2] | 0;
    11281. 

  11281.    if (i7 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11282. 

  11282.     HEAP32[i9 >> 2] = i7 + 1;
    11283. 

  11283.     i21 = HEAPU8[i7] | 0;
    11284. 

  11284.     break;
    11285. 

  11285.    } else {
    11286. 

  11286.     i21 = ___shgetc(i8) | 0;
    11287. 

  11287.     break;
    11288. 

  11288.    }
    11289. 

  11289.   } else {
    11290. 

  11290.    i4 = 1;
    11291. 

  11291.   }
    11292. 

  11292.  } while (0);
    11293. 

  11293.  i7 = 0;
    11294. 

  11294.  do {
    11295. 

  11295.   if ((i21 | 32 | 0) != (HEAP8[13408 + i7 | 0] | 0)) {
    11296. 

  11296.    break;
    11297. 

  11297.   }
    11298. 

  11298.   do {
    11299. 

  11299.    if (i7 >>> 0 < 7) {
    11300. 

  11300.     i12 = HEAP32[i9 >> 2] | 0;
    11301. 

  11301.     if (i12 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11302. 

  11302.      HEAP32[i9 >> 2] = i12 + 1;
    11303. 

  11303.      i21 = HEAPU8[i12] | 0;
    11304. 

  11304.      break;
    11305. 

  11305.     } else {
    11306. 

  11306.      i21 = ___shgetc(i8) | 0;
    11307. 

  11307.      break;
    11308. 

  11308.     }
    11309. 

  11309.    }
    11310. 

  11310.   } while (0);
    11311. 

  11311.   i7 = i7 + 1 | 0;
    11312. 

  11312.  } while (i7 >>> 0 < 8);
    11313. 

  11313.  do {
    11314. 

  11314.   if ((i7 | 0) == 3) {
    11315. 

  11315.    i13 = 23;
    11316. 

  11316.   } else if ((i7 | 0) != 8) {
    11317. 

  11317.    i12 = (i11 | 0) == 0;
    11318. 

  11318.    if (!(i7 >>> 0 < 4 | i12)) {
    11319. 

  11319.     if ((i7 | 0) == 8) {
    11320. 

  11320.      break;
    11321. 

  11321.     } else {
    11322. 

  11322.      i13 = 23;
    11323. 

  11323.      break;
    11324. 

  11324.     }
    11325. 

  11325.    }
    11326. 

  11326.    L34 : do {
    11327. 

  11327.     if ((i7 | 0) == 0) {
    11328. 

  11328.      i7 = 0;
    11329. 

  11329.      do {
    11330. 

  11330.       if ((i21 | 32 | 0) != (HEAP8[13424 + i7 | 0] | 0)) {
    11331. 

  11331.        break L34;
    11332. 

  11332.       }
    11333. 

  11333.       do {
    11334. 

  11334.        if (i7 >>> 0 < 2) {
    11335. 

  11335.         i15 = HEAP32[i9 >> 2] | 0;
    11336. 

  11336.         if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11337. 

  11337.          HEAP32[i9 >> 2] = i15 + 1;
    11338. 

  11338.          i21 = HEAPU8[i15] | 0;
    11339. 

  11339.          break;
    11340. 

  11340.         } else {
    11341. 

  11341.          i21 = ___shgetc(i8) | 0;
    11342. 

  11342.          break;
    11343. 

  11343.         }
    11344. 

  11344.        }
    11345. 

  11345.       } while (0);
    11346. 

  11346.       i7 = i7 + 1 | 0;
    11347. 

  11347.      } while (i7 >>> 0 < 3);
    11348. 

  11348.     }
    11349. 

  11349.    } while (0);
    11350. 

  11350.    if ((i7 | 0) == 0) {
    11351. 

  11351.     do {
    11352. 

  11352.      if ((i21 | 0) == 48) {
    11353. 

  11353.       i7 = HEAP32[i9 >> 2] | 0;
    11354. 

  11354.       if (i7 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11355. 

  11355.        HEAP32[i9 >> 2] = i7 + 1;
    11356. 

  11356.        i7 = HEAPU8[i7] | 0;
    11357. 

  11357.       } else {
    11358. 

  11358.        i7 = ___shgetc(i8) | 0;
    11359. 

  11359.       }
    11360. 

  11360.       if ((i7 | 32 | 0) != 120) {
    11361. 

  11361.        if ((HEAP32[i10 >> 2] | 0) == 0) {
    11362. 

  11362.         i21 = 48;
    11363. 

  11363.         break;
    11364. 

  11364.        }
    11365. 

  11365.        HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11366. 

  11366.        i21 = 48;
    11367. 

  11367.        break;
    11368. 

  11368.       }
    11369. 

  11369.       i5 = HEAP32[i9 >> 2] | 0;
    11370. 

  11370.       if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11371. 

  11371.        HEAP32[i9 >> 2] = i5 + 1;
    11372. 

  11372.        i21 = HEAPU8[i5] | 0;
    11373. 

  11373.        i19 = 0;
    11374. 

  11374.       } else {
    11375. 

  11375.        i21 = ___shgetc(i8) | 0;
    11376. 

  11376.        i19 = 0;
    11377. 

  11377.       }
    11378. 

  11378.       while (1) {
    11379. 

  11379.        if ((i21 | 0) == 46) {
    11380. 

  11380.         i13 = 70;
    11381. 

  11381.         break;
    11382. 

  11382.        } else if ((i21 | 0) != 48) {
    11383. 

  11383.         i5 = 0;
    11384. 

  11384.         i7 = 0;
    11385. 

  11385.         i15 = 0;
    11386. 

  11386.         i16 = 0;
    11387. 

  11387.         i18 = 0;
    11388. 

  11388.         i20 = 0;
    11389. 

  11389.         d28 = 1.0;
    11390. 

  11390.         i17 = 0;
    11391. 

  11391.         d14 = 0.0;
    11392. 

  11392.         break;
    11393. 

  11393.        }
    11394. 

  11394.        i5 = HEAP32[i9 >> 2] | 0;
    11395. 

  11395.        if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11396. 

  11396.         HEAP32[i9 >> 2] = i5 + 1;
    11397. 

  11397.         i21 = HEAPU8[i5] | 0;
    11398. 

  11398.         i19 = 1;
    11399. 

  11399.         continue;
    11400. 

  11400.        } else {
    11401. 

  11401.         i21 = ___shgetc(i8) | 0;
    11402. 

  11402.         i19 = 1;
    11403. 

  11403.         continue;
    11404. 

  11404.        }
    11405. 

  11405.       }
    11406. 

  11406.       L66 : do {
    11407. 

  11407.        if ((i13 | 0) == 70) {
    11408. 

  11408.         i5 = HEAP32[i9 >> 2] | 0;
    11409. 

  11409.         if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11410. 

  11410.          HEAP32[i9 >> 2] = i5 + 1;
    11411. 

  11411.          i21 = HEAPU8[i5] | 0;
    11412. 

  11412.         } else {
    11413. 

  11413.          i21 = ___shgetc(i8) | 0;
    11414. 

  11414.         }
    11415. 

  11415.         if ((i21 | 0) == 48) {
    11416. 

  11416.          i15 = -1;
    11417. 

  11417.          i16 = -1;
    11418. 

  11418.          while (1) {
    11419. 

  11419.           i5 = HEAP32[i9 >> 2] | 0;
    11420. 

  11420.           if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11421. 

  11421.            HEAP32[i9 >> 2] = i5 + 1;
    11422. 

  11422.            i21 = HEAPU8[i5] | 0;
    11423. 

  11423.           } else {
    11424. 

  11424.            i21 = ___shgetc(i8) | 0;
    11425. 

  11425.           }
    11426. 

  11426.           if ((i21 | 0) != 48) {
    11427. 

  11427.            i5 = 0;
    11428. 

  11428.            i7 = 0;
    11429. 

  11429.            i19 = 1;
    11430. 

  11430.            i18 = 1;
    11431. 

  11431.            i20 = 0;
    11432. 

  11432.            d28 = 1.0;
    11433. 

  11433.            i17 = 0;
    11434. 

  11434.            d14 = 0.0;
    11435. 

  11435.            break L66;
    11436. 

  11436.           }
    11437. 

  11437.           i29 = _i64Add(i15 | 0, i16 | 0, -1, -1) | 0;
    11438. 

  11438.           i15 = i29;
    11439. 

  11439.           i16 = tempRet0;
    11440. 

  11440.          }
    11441. 

  11441.         } else {
    11442. 

  11442.          i5 = 0;
    11443. 

  11443.          i7 = 0;
    11444. 

  11444.          i15 = 0;
    11445. 

  11445.          i16 = 0;
    11446. 

  11446.          i18 = 1;
    11447. 

  11447.          i20 = 0;
    11448. 

  11448.          d28 = 1.0;
    11449. 

  11449.          i17 = 0;
    11450. 

  11450.          d14 = 0.0;
    11451. 

  11451.         }
    11452. 

  11452.        }
    11453. 

  11453.       } while (0);
    11454. 

  11454.       L79 : while (1) {
    11455. 

  11455.        i24 = i21 + -48 | 0;
    11456. 

  11456.        do {
    11457. 

  11457.         if (!(i24 >>> 0 < 10)) {
    11458. 

  11458.          i23 = i21 | 32;
    11459. 

  11459.          i22 = (i21 | 0) == 46;
    11460. 

  11460.          if (!((i23 + -97 | 0) >>> 0 < 6 | i22)) {
    11461. 

  11461.           break L79;
    11462. 

  11462.          }
    11463. 

  11463.          if (i22) {
    11464. 

  11464.           if ((i18 | 0) == 0) {
    11465. 

  11465.            i15 = i7;
    11466. 

  11466.            i16 = i5;
    11467. 

  11467.            i18 = 1;
    11468. 

  11468.            break;
    11469. 

  11469.           } else {
    11470. 

  11470.            i21 = 46;
    11471. 

  11471.            break L79;
    11472. 

  11472.           }
    11473. 

  11473.          } else {
    11474. 

  11474.           i24 = (i21 | 0) > 57 ? i23 + -87 | 0 : i24;
    11475. 

  11475.           i13 = 84;
    11476. 

  11476.           break;
    11477. 

  11477.          }
    11478. 

  11478.         } else {
    11479. 

  11479.          i13 = 84;
    11480. 

  11480.         }
    11481. 

  11481.        } while (0);
    11482. 

  11482.        if ((i13 | 0) == 84) {
    11483. 

  11483.         i13 = 0;
    11484. 

  11484.         do {
    11485. 

  11485.          if (!((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8)) {
    11486. 

  11486.           if ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 14) {
    11487. 

  11487.            d31 = d28 * .0625;
    11488. 

  11488.            d30 = d31;
    11489. 

  11489.            d14 = d14 + d31 * +(i24 | 0);
    11490. 

  11490.            break;
    11491. 

  11491.           }
    11492. 

  11492.           if ((i24 | 0) != 0 & (i20 | 0) == 0) {
    11493. 

  11493.            i20 = 1;
    11494. 

  11494.            d30 = d28;
    11495. 

  11495.            d14 = d14 + d28 * .5;
    11496. 

  11496.           } else {
    11497. 

  11497.            d30 = d28;
    11498. 

  11498.           }
    11499. 

  11499.          } else {
    11500. 

  11500.           d30 = d28;
    11501. 

  11501.           i17 = i24 + (i17 << 4) | 0;
    11502. 

  11502.          }
    11503. 

  11503.         } while (0);
    11504. 

  11504.         i7 = _i64Add(i7 | 0, i5 | 0, 1, 0) | 0;
    11505. 

  11505.         i5 = tempRet0;
    11506. 

  11506.         i19 = 1;
    11507. 

  11507.         d28 = d30;
    11508. 

  11508.        }
    11509. 

  11509.        i21 = HEAP32[i9 >> 2] | 0;
    11510. 

  11510.        if (i21 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11511. 

  11511.         HEAP32[i9 >> 2] = i21 + 1;
    11512. 

  11512.         i21 = HEAPU8[i21] | 0;
    11513. 

  11513.         continue;
    11514. 

  11514.        } else {
    11515. 

  11515.         i21 = ___shgetc(i8) | 0;
    11516. 

  11516.         continue;
    11517. 

  11517.        }
    11518. 

  11518.       }
    11519. 

  11519.       if ((i19 | 0) == 0) {
    11520. 

  11520.        i2 = (HEAP32[i10 >> 2] | 0) == 0;
    11521. 

  11521.        if (!i2) {
    11522. 

  11522.         HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11523. 

  11523.        }
    11524. 

  11524.        if (!i12) {
    11525. 

  11525.         if (!i2 ? (i6 = HEAP32[i9 >> 2] | 0, HEAP32[i9 >> 2] = i6 + -1, (i18 | 0) != 0) : 0) {
    11526. 

  11526.          HEAP32[i9 >> 2] = i6 + -2;
    11527. 

  11527.         }
    11528. 

  11528.        } else {
    11529. 

  11529.         ___shlim(i8, 0);
    11530. 

  11530.        }
    11531. 

  11531.        d31 = +(i4 | 0) * 0.0;
    11532. 

  11532.        STACKTOP = i1;
    11533. 

  11533.        return +d31;
    11534. 

  11534.       }
    11535. 

  11535.       i13 = (i18 | 0) == 0;
    11536. 

  11536.       i6 = i13 ? i7 : i15;
    11537. 

  11537.       i13 = i13 ? i5 : i16;
    11538. 

  11538.       if ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8) {
    11539. 

  11539.        do {
    11540. 

  11540.         i17 = i17 << 4;
    11541. 

  11541.         i7 = _i64Add(i7 | 0, i5 | 0, 1, 0) | 0;
    11542. 

  11542.         i5 = tempRet0;
    11543. 

  11543.        } while ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8);
    11544. 

  11544.       }
    11545. 

  11545.       do {
    11546. 

  11546.        if ((i21 | 32 | 0) == 112) {
    11547. 

  11547.         i7 = _scanexp(i8, i11) | 0;
    11548. 

  11548.         i5 = tempRet0;
    11549. 

  11549.         if ((i7 | 0) == 0 & (i5 | 0) == -2147483648) {
    11550. 

  11550.          if (i12) {
    11551. 

  11551.           ___shlim(i8, 0);
    11552. 

  11552.           d31 = 0.0;
    11553. 

  11553.           STACKTOP = i1;
    11554. 

  11554.           return +d31;
    11555. 

  11555.          } else {
    11556. 

  11556.           if ((HEAP32[i10 >> 2] | 0) == 0) {
    11557. 

  11557.            i7 = 0;
    11558. 

  11558.            i5 = 0;
    11559. 

  11559.            break;
    11560. 

  11560.           }
    11561. 

  11561.           HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11562. 

  11562.           i7 = 0;
    11563. 

  11563.           i5 = 0;
    11564. 

  11564.           break;
    11565. 

  11565.          }
    11566. 

  11566.         }
    11567. 

  11567.        } else {
    11568. 

  11568.         if ((HEAP32[i10 >> 2] | 0) == 0) {
    11569. 

  11569.          i7 = 0;
    11570. 

  11570.          i5 = 0;
    11571. 

  11571.         } else {
    11572. 

  11572.          HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11573. 

  11573.          i7 = 0;
    11574. 

  11574.          i5 = 0;
    11575. 

  11575.         }
    11576. 

  11576.        }
    11577. 

  11577.       } while (0);
    11578. 

  11578.       i6 = _bitshift64Shl(i6 | 0, i13 | 0, 2) | 0;
    11579. 

  11579.       i6 = _i64Add(i6 | 0, tempRet0 | 0, -32, -1) | 0;
    11580. 

  11580.       i5 = _i64Add(i6 | 0, tempRet0 | 0, i7 | 0, i5 | 0) | 0;
    11581. 

  11581.       i6 = tempRet0;
    11582. 

  11582.       if ((i17 | 0) == 0) {
    11583. 

  11583.        d31 = +(i4 | 0) * 0.0;
    11584. 

  11584.        STACKTOP = i1;
    11585. 

  11585.        return +d31;
    11586. 

  11586.       }
    11587. 

  11587.       if ((i6 | 0) > 0 | (i6 | 0) == 0 & i5 >>> 0 > (0 - i3 | 0) >>> 0) {
    11588. 

  11588.        HEAP32[(___errno_location() | 0) >> 2] = 34;
    11589. 

  11589.        d31 = +(i4 | 0) * 1.7976931348623157e+308 * 1.7976931348623157e+308;
    11590. 

  11590.        STACKTOP = i1;
    11591. 

  11591.        return +d31;
    11592. 

  11592.       }
    11593. 

  11593.       i29 = i3 + -106 | 0;
    11594. 

  11594.       i27 = ((i29 | 0) < 0) << 31 >> 31;
    11595. 

  11595.       if ((i6 | 0) < (i27 | 0) | (i6 | 0) == (i27 | 0) & i5 >>> 0 < i29 >>> 0) {
    11596. 

  11596.        HEAP32[(___errno_location() | 0) >> 2] = 34;
    11597. 

  11597.        d31 = +(i4 | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
    11598. 

  11598.        STACKTOP = i1;
    11599. 

  11599.        return +d31;
    11600. 

  11600.       }
    11601. 

  11601.       if ((i17 | 0) > -1) {
    11602. 

  11602.        do {
    11603. 

  11603.         i17 = i17 << 1;
    11604. 

  11604.         if (!(d14 >= .5)) {
    11605. 

  11605.          d28 = d14;
    11606. 

  11606.         } else {
    11607. 

  11607.          d28 = d14 + -1.0;
    11608. 

  11608.          i17 = i17 | 1;
    11609. 

  11609.         }
    11610. 

  11610.         d14 = d14 + d28;
    11611. 

  11611.         i5 = _i64Add(i5 | 0, i6 | 0, -1, -1) | 0;
    11612. 

  11612.         i6 = tempRet0;
    11613. 

  11613.        } while ((i17 | 0) > -1);
    11614. 

  11614.       }
    11615. 

  11615.       i3 = _i64Subtract(32, 0, i3 | 0, ((i3 | 0) < 0) << 31 >> 31 | 0) | 0;
    11616. 

  11616.       i3 = _i64Add(i5 | 0, i6 | 0, i3 | 0, tempRet0 | 0) | 0;
    11617. 

  11617.       i29 = tempRet0;
    11618. 

  11618.       if (0 > (i29 | 0) | 0 == (i29 | 0) & i2 >>> 0 > i3 >>> 0) {
    11619. 

  11619.        i2 = (i3 | 0) < 0 ? 0 : i3;
    11620. 

  11620.       }
    11621. 

  11621.       if ((i2 | 0) < 53) {
    11622. 

  11622.        d28 = +(i4 | 0);
    11623. 

  11623.        d30 = +_copysign(+(+_scalbn(1.0, 84 - i2 | 0)), +d28);
    11624. 

  11624.        if ((i2 | 0) < 32 & d14 != 0.0) {
    11625. 

  11625.         i29 = i17 & 1;
    11626. 

  11626.         i17 = (i29 ^ 1) + i17 | 0;
    11627. 

  11627.         d14 = (i29 | 0) == 0 ? 0.0 : d14;
    11628. 

  11628.        }
    11629. 

  11629.       } else {
    11630. 

  11630.        d28 = +(i4 | 0);
    11631. 

  11631.        d30 = 0.0;
    11632. 

  11632.       }
    11633. 

  11633.       d14 = d28 * d14 + (d30 + d28 * +(i17 >>> 0)) - d30;
    11634. 

  11634.       if (!(d14 != 0.0)) {
    11635. 

  11635.        HEAP32[(___errno_location() | 0) >> 2] = 34;
    11636. 

  11636.       }
    11637. 

  11637.       d31 = +_scalbnl(d14, i5);
    11638. 

  11638.       STACKTOP = i1;
    11639. 

  11639.       return +d31;
    11640. 

  11640.      }
    11641. 

  11641.     } while (0);
    11642. 

  11642.     i7 = i3 + i2 | 0;
    11643. 

  11643.     i6 = 0 - i7 | 0;
    11644. 

  11644.     i20 = 0;
    11645. 

  11645.     while (1) {
    11646. 

  11646.      if ((i21 | 0) == 46) {
    11647. 

  11647.       i13 = 139;
    11648. 

  11648.       break;
    11649. 

  11649.      } else if ((i21 | 0) != 48) {
    11650. 

  11650.       i25 = 0;
    11651. 

  11651.       i22 = 0;
    11652. 

  11652.       i19 = 0;
    11653. 

  11653.       break;
    11654. 

  11654.      }
    11655. 

  11655.      i15 = HEAP32[i9 >> 2] | 0;
    11656. 

  11656.      if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11657. 

  11657.       HEAP32[i9 >> 2] = i15 + 1;
    11658. 

  11658.       i21 = HEAPU8[i15] | 0;
    11659. 

  11659.       i20 = 1;
    11660. 

  11660.       continue;
    11661. 

  11661.      } else {
    11662. 

  11662.       i21 = ___shgetc(i8) | 0;
    11663. 

  11663.       i20 = 1;
    11664. 

  11664.       continue;
    11665. 

  11665.      }
    11666. 

  11666.     }
    11667. 

  11667.     L168 : do {
    11668. 

  11668.      if ((i13 | 0) == 139) {
    11669. 

  11669.       i15 = HEAP32[i9 >> 2] | 0;
    11670. 

  11670.       if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11671. 

  11671.        HEAP32[i9 >> 2] = i15 + 1;
    11672. 

  11672.        i21 = HEAPU8[i15] | 0;
    11673. 

  11673.       } else {
    11674. 

  11674.        i21 = ___shgetc(i8) | 0;
    11675. 

  11675.       }
    11676. 

  11676.       if ((i21 | 0) == 48) {
    11677. 

  11677.        i25 = -1;
    11678. 

  11678.        i22 = -1;
    11679. 

  11679.        while (1) {
    11680. 

  11680.         i15 = HEAP32[i9 >> 2] | 0;
    11681. 

  11681.         if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11682. 

  11682.          HEAP32[i9 >> 2] = i15 + 1;
    11683. 

  11683.          i21 = HEAPU8[i15] | 0;
    11684. 

  11684.         } else {
    11685. 

  11685.          i21 = ___shgetc(i8) | 0;
    11686. 

  11686.         }
    11687. 

  11687.         if ((i21 | 0) != 48) {
    11688. 

  11688.          i20 = 1;
    11689. 

  11689.          i19 = 1;
    11690. 

  11690.          break L168;
    11691. 

  11691.         }
    11692. 

  11692.         i29 = _i64Add(i25 | 0, i22 | 0, -1, -1) | 0;
    11693. 

  11693.         i25 = i29;
    11694. 

  11694.         i22 = tempRet0;
    11695. 

  11695.        }
    11696. 

  11696.       } else {
    11697. 

  11697.        i25 = 0;
    11698. 

  11698.        i22 = 0;
    11699. 

  11699.        i19 = 1;
    11700. 

  11700.       }
    11701. 

  11701.      }
    11702. 

  11702.     } while (0);
    11703. 

  11703.     HEAP32[i5 >> 2] = 0;
    11704. 

  11704.     i26 = i21 + -48 | 0;
    11705. 

  11705.     i27 = (i21 | 0) == 46;
    11706. 

  11706.     L182 : do {
    11707. 

  11707.      if (i26 >>> 0 < 10 | i27) {
    11708. 

  11708.       i15 = i5 + 496 | 0;
    11709. 

  11709.       i24 = 0;
    11710. 

  11710.       i23 = 0;
    11711. 

  11711.       i18 = 0;
    11712. 

  11712.       i17 = 0;
    11713. 

  11713.       i16 = 0;
    11714. 

  11714.       while (1) {
    11715. 

  11715.        do {
    11716. 

  11716.         if (i27) {
    11717. 

  11717.          if ((i19 | 0) == 0) {
    11718. 

  11718.           i25 = i24;
    11719. 

  11719.           i22 = i23;
    11720. 

  11720.           i19 = 1;
    11721. 

  11721.          } else {
    11722. 

  11722.           break L182;
    11723. 

  11723.          }
    11724. 

  11724.         } else {
    11725. 

  11725.          i27 = _i64Add(i24 | 0, i23 | 0, 1, 0) | 0;
    11726. 

  11726.          i23 = tempRet0;
    11727. 

  11727.          i29 = (i21 | 0) != 48;
    11728. 

  11728.          if ((i17 | 0) >= 125) {
    11729. 

  11729.           if (!i29) {
    11730. 

  11730.            i24 = i27;
    11731. 

  11731.            break;
    11732. 

  11732.           }
    11733. 

  11733.           HEAP32[i15 >> 2] = HEAP32[i15 >> 2] | 1;
    11734. 

  11734.           i24 = i27;
    11735. 

  11735.           break;
    11736. 

  11736.          }
    11737. 

  11737.          i20 = i5 + (i17 << 2) | 0;
    11738. 

  11738.          if ((i18 | 0) != 0) {
    11739. 

  11739.           i26 = i21 + -48 + ((HEAP32[i20 >> 2] | 0) * 10 | 0) | 0;
    11740. 

  11740.          }
    11741. 

  11741.          HEAP32[i20 >> 2] = i26;
    11742. 

  11742.          i18 = i18 + 1 | 0;
    11743. 

  11743.          i21 = (i18 | 0) == 9;
    11744. 

  11744.          i24 = i27;
    11745. 

  11745.          i20 = 1;
    11746. 

  11746.          i18 = i21 ? 0 : i18;
    11747. 

  11747.          i17 = (i21 & 1) + i17 | 0;
    11748. 

  11748.          i16 = i29 ? i27 : i16;
    11749. 

  11749.         }
    11750. 

  11750.        } while (0);
    11751. 

  11751.        i21 = HEAP32[i9 >> 2] | 0;
    11752. 

  11752.        if (i21 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    11753. 

  11753.         HEAP32[i9 >> 2] = i21 + 1;
    11754. 

  11754.         i21 = HEAPU8[i21] | 0;
    11755. 

  11755.        } else {
    11756. 

  11756.         i21 = ___shgetc(i8) | 0;
    11757. 

  11757.        }
    11758. 

  11758.        i26 = i21 + -48 | 0;
    11759. 

  11759.        i27 = (i21 | 0) == 46;
    11760. 

  11760.        if (!(i26 >>> 0 < 10 | i27)) {
    11761. 

  11761.         i13 = 162;
    11762. 

  11762.         break;
    11763. 

  11763.        }
    11764. 

  11764.       }
    11765. 

  11765.      } else {
    11766. 

  11766.       i24 = 0;
    11767. 

  11767.       i23 = 0;
    11768. 

  11768.       i18 = 0;
    11769. 

  11769.       i17 = 0;
    11770. 

  11770.       i16 = 0;
    11771. 

  11771.       i13 = 162;
    11772. 

  11772.      }
    11773. 

  11773.     } while (0);
    11774. 

  11774.     if ((i13 | 0) == 162) {
    11775. 

  11775.      i13 = (i19 | 0) == 0;
    11776. 

  11776.      i25 = i13 ? i24 : i25;
    11777. 

  11777.      i22 = i13 ? i23 : i22;
    11778. 

  11778.     }
    11779. 

  11779.     i13 = (i20 | 0) != 0;
    11780. 

  11780.     if (i13 ? (i21 | 32 | 0) == 101 : 0) {
    11781. 

  11781.      i15 = _scanexp(i8, i11) | 0;
    11782. 

  11782.      i11 = tempRet0;
    11783. 

  11783.      do {
    11784. 

  11784.       if ((i15 | 0) == 0 & (i11 | 0) == -2147483648) {
    11785. 

  11785.        if (i12) {
    11786. 

  11786.         ___shlim(i8, 0);
    11787. 

  11787.         d31 = 0.0;
    11788. 

  11788.         STACKTOP = i1;
    11789. 

  11789.         return +d31;
    11790. 

  11790.        } else {
    11791. 

  11791.         if ((HEAP32[i10 >> 2] | 0) == 0) {
    11792. 

  11792.          i15 = 0;
    11793. 

  11793.          i11 = 0;
    11794. 

  11794.          break;
    11795. 

  11795.         }
    11796. 

  11796.         HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11797. 

  11797.         i15 = 0;
    11798. 

  11798.         i11 = 0;
    11799. 

  11799.         break;
    11800. 

  11800.        }
    11801. 

  11801.       }
    11802. 

  11802.      } while (0);
    11803. 

  11803.      i9 = _i64Add(i15 | 0, i11 | 0, i25 | 0, i22 | 0) | 0;
    11804. 

  11804.      i22 = tempRet0;
    11805. 

  11805.     } else {
    11806. 

  11806.      if ((i21 | 0) > -1 ? (HEAP32[i10 >> 2] | 0) != 0 : 0) {
    11807. 

  11807.       HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    11808. 

  11808.       i9 = i25;
    11809. 

  11809.      } else {
    11810. 

  11810.       i9 = i25;
    11811. 

  11811.      }
    11812. 

  11812.     }
    11813. 

  11813.     if (!i13) {
    11814. 

  11814.      HEAP32[(___errno_location() | 0) >> 2] = 22;
    11815. 

  11815.      ___shlim(i8, 0);
    11816. 

  11816.      d31 = 0.0;
    11817. 

  11817.      STACKTOP = i1;
    11818. 

  11818.      return +d31;
    11819. 

  11819.     }
    11820. 

  11820.     i8 = HEAP32[i5 >> 2] | 0;
    11821. 

  11821.     if ((i8 | 0) == 0) {
    11822. 

  11822.      d31 = +(i4 | 0) * 0.0;
    11823. 

  11823.      STACKTOP = i1;
    11824. 

  11824.      return +d31;
    11825. 

  11825.     }
    11826. 

  11826.     do {
    11827. 

  11827.      if ((i9 | 0) == (i24 | 0) & (i22 | 0) == (i23 | 0) & ((i23 | 0) < 0 | (i23 | 0) == 0 & i24 >>> 0 < 10)) {
    11828. 

  11828.       if (!(i2 >>> 0 > 30) ? (i8 >>> i2 | 0) != 0 : 0) {
    11829. 

  11829.        break;
    11830. 

  11830.       }
    11831. 

  11831.       d31 = +(i4 | 0) * +(i8 >>> 0);
    11832. 

  11832.       STACKTOP = i1;
    11833. 

  11833.       return +d31;
    11834. 

  11834.      }
    11835. 

  11835.     } while (0);
    11836. 

  11836.     i29 = (i3 | 0) / -2 | 0;
    11837. 

  11837.     i27 = ((i29 | 0) < 0) << 31 >> 31;
    11838. 

  11838.     if ((i22 | 0) > (i27 | 0) | (i22 | 0) == (i27 | 0) & i9 >>> 0 > i29 >>> 0) {
    11839. 

  11839.      HEAP32[(___errno_location() | 0) >> 2] = 34;
    11840. 

  11840.      d31 = +(i4 | 0) * 1.7976931348623157e+308 * 1.7976931348623157e+308;
    11841. 

  11841.      STACKTOP = i1;
    11842. 

  11842.      return +d31;
    11843. 

  11843.     }
    11844. 

  11844.     i29 = i3 + -106 | 0;
    11845. 

  11845.     i27 = ((i29 | 0) < 0) << 31 >> 31;
    11846. 

  11846.     if ((i22 | 0) < (i27 | 0) | (i22 | 0) == (i27 | 0) & i9 >>> 0 < i29 >>> 0) {
    11847. 

  11847.      HEAP32[(___errno_location() | 0) >> 2] = 34;
    11848. 

  11848.      d31 = +(i4 | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
    11849. 

  11849.      STACKTOP = i1;
    11850. 

  11850.      return +d31;
    11851. 

  11851.     }
    11852. 

  11852.     if ((i18 | 0) != 0) {
    11853. 

  11853.      if ((i18 | 0) < 9) {
    11854. 

  11854.       i8 = i5 + (i17 << 2) | 0;
    11855. 

  11855.       i10 = HEAP32[i8 >> 2] | 0;
    11856. 

  11856.       do {
    11857. 

  11857.        i10 = i10 * 10 | 0;
    11858. 

  11858.        i18 = i18 + 1 | 0;
    11859. 

  11859.       } while ((i18 | 0) != 9);
    11860. 

  11860.       HEAP32[i8 >> 2] = i10;
    11861. 

  11861.      }
    11862. 

  11862.      i17 = i17 + 1 | 0;
    11863. 

  11863.     }
    11864. 

  11864.     do {
    11865. 

  11865.      if ((i16 | 0) < 9 ? (i16 | 0) <= (i9 | 0) & (i9 | 0) < 18 : 0) {
    11866. 

  11866.       if ((i9 | 0) == 9) {
    11867. 

  11867.        d31 = +(i4 | 0) * +((HEAP32[i5 >> 2] | 0) >>> 0);
    11868. 

  11868.        STACKTOP = i1;
    11869. 

  11869.        return +d31;
    11870. 

  11870.       }
    11871. 

  11871.       if ((i9 | 0) < 9) {
    11872. 

  11872.        d31 = +(i4 | 0) * +((HEAP32[i5 >> 2] | 0) >>> 0) / +(HEAP32[13440 + (8 - i9 << 2) >> 2] | 0);
    11873. 

  11873.        STACKTOP = i1;
    11874. 

  11874.        return +d31;
    11875. 

  11875.       }
    11876. 

  11876.       i10 = i2 + 27 + (Math_imul(i9, -3) | 0) | 0;
    11877. 

  11877.       i8 = HEAP32[i5 >> 2] | 0;
    11878. 

  11878.       if ((i10 | 0) <= 30 ? (i8 >>> i10 | 0) != 0 : 0) {
    11879. 

  11879.        break;
    11880. 

  11880.       }
    11881. 

  11881.       d31 = +(i4 | 0) * +(i8 >>> 0) * +(HEAP32[13440 + (i9 + -10 << 2) >> 2] | 0);
    11882. 

  11882.       STACKTOP = i1;
    11883. 

  11883.       return +d31;
    11884. 

  11884.      }
    11885. 

  11885.     } while (0);
    11886. 

  11886.     i8 = (i9 | 0) % 9 | 0;
    11887. 

  11887.     if ((i8 | 0) == 0) {
    11888. 

  11888.      i8 = 0;
    11889. 

  11889.      i10 = 0;
    11890. 

  11890.     } else {
    11891. 

  11891.      i11 = (i9 | 0) > -1 ? i8 : i8 + 9 | 0;
    11892. 

  11892.      i12 = HEAP32[13440 + (8 - i11 << 2) >> 2] | 0;
    11893. 

  11893.      if ((i17 | 0) != 0) {
    11894. 

  11894.       i10 = 1e9 / (i12 | 0) | 0;
    11895. 

  11895.       i8 = 0;
    11896. 

  11896.       i16 = 0;
    11897. 

  11897.       i15 = 0;
    11898. 

  11898.       while (1) {
    11899. 

  11899.        i27 = i5 + (i15 << 2) | 0;
    11900. 

  11900.        i13 = HEAP32[i27 >> 2] | 0;
    11901. 

  11901.        i29 = ((i13 >>> 0) / (i12 >>> 0) | 0) + i16 | 0;
    11902. 

  11902.        HEAP32[i27 >> 2] = i29;
    11903. 

  11903.        i16 = Math_imul((i13 >>> 0) % (i12 >>> 0) | 0, i10) | 0;
    11904. 

  11904.        i13 = i15 + 1 | 0;
    11905. 

  11905.        if ((i15 | 0) == (i8 | 0) & (i29 | 0) == 0) {
    11906. 

  11906.         i8 = i13 & 127;
    11907. 

  11907.         i9 = i9 + -9 | 0;
    11908. 

  11908.        }
    11909. 

  11909.        if ((i13 | 0) == (i17 | 0)) {
    11910. 

  11910.         break;
    11911. 

  11911.        } else {
    11912. 

  11912.         i15 = i13;
    11913. 

  11913.        }
    11914. 

  11914.       }
    11915. 

  11915.       if ((i16 | 0) != 0) {
    11916. 

  11916.        HEAP32[i5 + (i17 << 2) >> 2] = i16;
    11917. 

  11917.        i17 = i17 + 1 | 0;
    11918. 

  11918.       }
    11919. 

  11919.      } else {
    11920. 

  11920.       i8 = 0;
    11921. 

  11921.       i17 = 0;
    11922. 

  11922.      }
    11923. 

  11923.      i10 = 0;
    11924. 

  11924.      i9 = 9 - i11 + i9 | 0;
    11925. 

  11925.     }
    11926. 

  11926.     L280 : while (1) {
    11927. 

  11927.      i11 = i5 + (i8 << 2) | 0;
    11928. 

  11928.      if ((i9 | 0) < 18) {
    11929. 

  11929.       do {
    11930. 

  11930.        i13 = 0;
    11931. 

  11931.        i11 = i17 + 127 | 0;
    11932. 

  11932.        while (1) {
    11933. 

  11933.         i11 = i11 & 127;
    11934. 

  11934.         i12 = i5 + (i11 << 2) | 0;
    11935. 

  11935.         i15 = _bitshift64Shl(HEAP32[i12 >> 2] | 0, 0, 29) | 0;
    11936. 

  11936.         i15 = _i64Add(i15 | 0, tempRet0 | 0, i13 | 0, 0) | 0;
    11937. 

  11937.         i13 = tempRet0;
    11938. 

  11938.         if (i13 >>> 0 > 0 | (i13 | 0) == 0 & i15 >>> 0 > 1e9) {
    11939. 

  11939.          i29 = ___udivdi3(i15 | 0, i13 | 0, 1e9, 0) | 0;
    11940. 

  11940.          i15 = ___uremdi3(i15 | 0, i13 | 0, 1e9, 0) | 0;
    11941. 

  11941.          i13 = i29;
    11942. 

  11942.         } else {
    11943. 

  11943.          i13 = 0;
    11944. 

  11944.         }
    11945. 

  11945.         HEAP32[i12 >> 2] = i15;
    11946. 

  11946.         i12 = (i11 | 0) == (i8 | 0);
    11947. 

  11947.         if (!((i11 | 0) != (i17 + 127 & 127 | 0) | i12)) {
    11948. 

  11948.          i17 = (i15 | 0) == 0 ? i11 : i17;
    11949. 

  11949.         }
    11950. 

  11950.         if (i12) {
    11951. 

  11951.          break;
    11952. 

  11952.         } else {
    11953. 

  11953.          i11 = i11 + -1 | 0;
    11954. 

  11954.         }
    11955. 

  11955.        }
    11956. 

  11956.        i10 = i10 + -29 | 0;
    11957. 

  11957.       } while ((i13 | 0) == 0);
    11958. 

  11958.      } else {
    11959. 

  11959.       if ((i9 | 0) != 18) {
    11960. 

  11960.        break;
    11961. 

  11961.       }
    11962. 

  11962.       do {
    11963. 

  11963.        if (!((HEAP32[i11 >> 2] | 0) >>> 0 < 9007199)) {
    11964. 

  11964.         i9 = 18;
    11965. 

  11965.         break L280;
    11966. 

  11966.        }
    11967. 

  11967.        i13 = 0;
    11968. 

  11968.        i12 = i17 + 127 | 0;
    11969. 

  11969.        while (1) {
    11970. 

  11970.         i12 = i12 & 127;
    11971. 

  11971.         i15 = i5 + (i12 << 2) | 0;
    11972. 

  11972.         i16 = _bitshift64Shl(HEAP32[i15 >> 2] | 0, 0, 29) | 0;
    11973. 

  11973.         i16 = _i64Add(i16 | 0, tempRet0 | 0, i13 | 0, 0) | 0;
    11974. 

  11974.         i13 = tempRet0;
    11975. 

  11975.         if (i13 >>> 0 > 0 | (i13 | 0) == 0 & i16 >>> 0 > 1e9) {
    11976. 

  11976.          i29 = ___udivdi3(i16 | 0, i13 | 0, 1e9, 0) | 0;
    11977. 

  11977.          i16 = ___uremdi3(i16 | 0, i13 | 0, 1e9, 0) | 0;
    11978. 

  11978.          i13 = i29;
    11979. 

  11979.         } else {
    11980. 

  11980.          i13 = 0;
    11981. 

  11981.         }
    11982. 

  11982.         HEAP32[i15 >> 2] = i16;
    11983. 

  11983.         i15 = (i12 | 0) == (i8 | 0);
    11984. 

  11984.         if (!((i12 | 0) != (i17 + 127 & 127 | 0) | i15)) {
    11985. 

  11985.          i17 = (i16 | 0) == 0 ? i12 : i17;
    11986. 

  11986.         }
    11987. 

  11987.         if (i15) {
    11988. 

  11988.          break;
    11989. 

  11989.         } else {
    11990. 

  11990.          i12 = i12 + -1 | 0;
    11991. 

  11991.         }
    11992. 

  11992.        }
    11993. 

  11993.        i10 = i10 + -29 | 0;
    11994. 

  11994.       } while ((i13 | 0) == 0);
    11995. 

  11995.      }
    11996. 

  11996.      i8 = i8 + 127 & 127;
    11997. 

  11997.      if ((i8 | 0) == (i17 | 0)) {
    11998. 

  11998.       i29 = i17 + 127 & 127;
    11999. 

  11999.       i17 = i5 + ((i17 + 126 & 127) << 2) | 0;
    12000. 

  12000.       HEAP32[i17 >> 2] = HEAP32[i17 >> 2] | HEAP32[i5 + (i29 << 2) >> 2];
    12001. 

  12001.       i17 = i29;
    12002. 

  12002.      }
    12003. 

  12003.      HEAP32[i5 + (i8 << 2) >> 2] = i13;
    12004. 

  12004.      i9 = i9 + 9 | 0;
    12005. 

  12005.     }
    12006. 

  12006.     L311 : while (1) {
    12007. 

  12007.      i11 = i17 + 1 & 127;
    12008. 

  12008.      i12 = i5 + ((i17 + 127 & 127) << 2) | 0;
    12009. 

  12009.      while (1) {
    12010. 

  12010.       i15 = (i9 | 0) == 18;
    12011. 

  12011.       i13 = (i9 | 0) > 27 ? 9 : 1;
    12012. 

  12012.       while (1) {
    12013. 

  12013.        i16 = 0;
    12014. 

  12014.        while (1) {
    12015. 

  12015.         i18 = i16 + i8 & 127;
    12016. 

  12016.         if ((i18 | 0) == (i17 | 0)) {
    12017. 

  12017.          i16 = 2;
    12018. 

  12018.          break;
    12019. 

  12019.         }
    12020. 

  12020.         i18 = HEAP32[i5 + (i18 << 2) >> 2] | 0;
    12021. 

  12021.         i19 = HEAP32[13432 + (i16 << 2) >> 2] | 0;
    12022. 

  12022.         if (i18 >>> 0 < i19 >>> 0) {
    12023. 

  12023.          i16 = 2;
    12024. 

  12024.          break;
    12025. 

  12025.         }
    12026. 

  12026.         i20 = i16 + 1 | 0;
    12027. 

  12027.         if (i18 >>> 0 > i19 >>> 0) {
    12028. 

  12028.          break;
    12029. 

  12029.         }
    12030. 

  12030.         if ((i20 | 0) < 2) {
    12031. 

  12031.          i16 = i20;
    12032. 

  12032.         } else {
    12033. 

  12033.          i16 = i20;
    12034. 

  12034.          break;
    12035. 

  12035.         }
    12036. 

  12036.        }
    12037. 

  12037.        if ((i16 | 0) == 2 & i15) {
    12038. 

  12038.         break L311;
    12039. 

  12039.        }
    12040. 

  12040.        i10 = i13 + i10 | 0;
    12041. 

  12041.        if ((i8 | 0) == (i17 | 0)) {
    12042. 

  12042.         i8 = i17;
    12043. 

  12043.        } else {
    12044. 

  12044.         break;
    12045. 

  12045.        }
    12046. 

  12046.       }
    12047. 

  12047.       i15 = (1 << i13) + -1 | 0;
    12048. 

  12048.       i19 = 1e9 >>> i13;
    12049. 

  12049.       i18 = i8;
    12050. 

  12050.       i16 = 0;
    12051. 

  12051.       do {
    12052. 

  12052.        i27 = i5 + (i8 << 2) | 0;
    12053. 

  12053.        i29 = HEAP32[i27 >> 2] | 0;
    12054. 

  12054.        i20 = (i29 >>> i13) + i16 | 0;
    12055. 

  12055.        HEAP32[i27 >> 2] = i20;
    12056. 

  12056.        i16 = Math_imul(i29 & i15, i19) | 0;
    12057. 

  12057.        i20 = (i8 | 0) == (i18 | 0) & (i20 | 0) == 0;
    12058. 

  12058.        i8 = i8 + 1 & 127;
    12059. 

  12059.        i9 = i20 ? i9 + -9 | 0 : i9;
    12060. 

  12060.        i18 = i20 ? i8 : i18;
    12061. 

  12061.       } while ((i8 | 0) != (i17 | 0));
    12062. 

  12062.       if ((i16 | 0) == 0) {
    12063. 

  12063.        i8 = i18;
    12064. 

  12064.        continue;
    12065. 

  12065.       }
    12066. 

  12066.       if ((i11 | 0) != (i18 | 0)) {
    12067. 

  12067.        break;
    12068. 

  12068.       }
    12069. 

  12069.       HEAP32[i12 >> 2] = HEAP32[i12 >> 2] | 1;
    12070. 

  12070.       i8 = i18;
    12071. 

  12071.      }
    12072. 

  12072.      HEAP32[i5 + (i17 << 2) >> 2] = i16;
    12073. 

  12073.      i8 = i18;
    12074. 

  12074.      i17 = i11;
    12075. 

  12075.     }
    12076. 

  12076.     i9 = i8 & 127;
    12077. 

  12077.     if ((i9 | 0) == (i17 | 0)) {
    12078. 

  12078.      HEAP32[i5 + (i11 + -1 << 2) >> 2] = 0;
    12079. 

  12079.      i17 = i11;
    12080. 

  12080.     }
    12081. 

  12081.     d28 = +((HEAP32[i5 + (i9 << 2) >> 2] | 0) >>> 0);
    12082. 

  12082.     i9 = i8 + 1 & 127;
    12083. 

  12083.     if ((i9 | 0) == (i17 | 0)) {
    12084. 

  12084.      i17 = i17 + 1 & 127;
    12085. 

  12085.      HEAP32[i5 + (i17 + -1 << 2) >> 2] = 0;
    12086. 

  12086.     }
    12087. 

  12087.     d14 = +(i4 | 0);
    12088. 

  12088.     d30 = d14 * (d28 * 1.0e9 + +((HEAP32[i5 + (i9 << 2) >> 2] | 0) >>> 0));
    12089. 

  12089.     i4 = i10 + 53 | 0;
    12090. 

  12090.     i3 = i4 - i3 | 0;
    12091. 

  12091.     if ((i3 | 0) < (i2 | 0)) {
    12092. 

  12092.      i2 = (i3 | 0) < 0 ? 0 : i3;
    12093. 

  12093.      i9 = 1;
    12094. 

  12094.     } else {
    12095. 

  12095.      i9 = 0;
    12096. 

  12096.     }
    12097. 

  12097.     if ((i2 | 0) < 53) {
    12098. 

  12098.      d33 = +_copysign(+(+_scalbn(1.0, 105 - i2 | 0)), +d30);
    12099. 

  12099.      d32 = +_fmod(+d30, +(+_scalbn(1.0, 53 - i2 | 0)));
    12100. 

  12100.      d28 = d33;
    12101. 

  12101.      d31 = d32;
    12102. 

  12102.      d30 = d33 + (d30 - d32);
    12103. 

  12103.     } else {
    12104. 

  12104.      d28 = 0.0;
    12105. 

  12105.      d31 = 0.0;
    12106. 

  12106.     }
    12107. 

  12107.     i11 = i8 + 2 & 127;
    12108. 

  12108.     if ((i11 | 0) != (i17 | 0)) {
    12109. 

  12109.      i5 = HEAP32[i5 + (i11 << 2) >> 2] | 0;
    12110. 

  12110.      do {
    12111. 

  12111.       if (!(i5 >>> 0 < 5e8)) {
    12112. 

  12112.        if (i5 >>> 0 > 5e8) {
    12113. 

  12113.         d31 = d14 * .75 + d31;
    12114. 

  12114.         break;
    12115. 

  12115.        }
    12116. 

  12116.        if ((i8 + 3 & 127 | 0) == (i17 | 0)) {
    12117. 

  12117.         d31 = d14 * .5 + d31;
    12118. 

  12118.         break;
    12119. 

  12119.        } else {
    12120. 

  12120.         d31 = d14 * .75 + d31;
    12121. 

  12121.         break;
    12122. 

  12122.        }
    12123. 

  12123.       } else {
    12124. 

  12124.        if ((i5 | 0) == 0 ? (i8 + 3 & 127 | 0) == (i17 | 0) : 0) {
    12125. 

  12125.         break;
    12126. 

  12126.        }
    12127. 

  12127.        d31 = d14 * .25 + d31;
    12128. 

  12128.       }
    12129. 

  12129.      } while (0);
    12130. 

  12130.      if ((53 - i2 | 0) > 1 ? !(+_fmod(+d31, 1.0) != 0.0) : 0) {
    12131. 

  12131.       d31 = d31 + 1.0;
    12132. 

  12132.      }
    12133. 

  12133.     }
    12134. 

  12134.     d14 = d30 + d31 - d28;
    12135. 

  12135.     do {
    12136. 

  12136.      if ((i4 & 2147483647 | 0) > (-2 - i7 | 0)) {
    12137. 

  12137.       if (+Math_abs(+d14) >= 9007199254740992.0) {
    12138. 

  12138.        i9 = (i9 | 0) != 0 & (i2 | 0) == (i3 | 0) ? 0 : i9;
    12139. 

  12139.        i10 = i10 + 1 | 0;
    12140. 

  12140.        d14 = d14 * .5;
    12141. 

  12141.       }
    12142. 

  12142.       if ((i10 + 50 | 0) <= (i6 | 0) ? !((i9 | 0) != 0 & d31 != 0.0) : 0) {
    12143. 

  12143.        break;
    12144. 

  12144.       }
    12145. 

  12145.       HEAP32[(___errno_location() | 0) >> 2] = 34;
    12146. 

  12146.      }
    12147. 

  12147.     } while (0);
    12148. 

  12148.     d33 = +_scalbnl(d14, i10);
    12149. 

  12149.     STACKTOP = i1;
    12150. 

  12150.     return +d33;
    12151. 

  12151.    } else if ((i7 | 0) == 3) {
    12152. 

  12152.     i2 = HEAP32[i9 >> 2] | 0;
    12153. 

  12153.     if (i2 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    12154. 

  12154.      HEAP32[i9 >> 2] = i2 + 1;
    12155. 

  12155.      i2 = HEAPU8[i2] | 0;
    12156. 

  12156.     } else {
    12157. 

  12157.      i2 = ___shgetc(i8) | 0;
    12158. 

  12158.     }
    12159. 

  12159.     if ((i2 | 0) == 40) {
    12160. 

  12160.      i2 = 1;
    12161. 

  12161.     } else {
    12162. 

  12162.      if ((HEAP32[i10 >> 2] | 0) == 0) {
    12163. 

  12163.       d33 = nan;
    12164. 

  12164.       STACKTOP = i1;
    12165. 

  12165.       return +d33;
    12166. 

  12166.      }
    12167. 

  12167.      HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12168. 

  12168.      d33 = nan;
    12169. 

  12169.      STACKTOP = i1;
    12170. 

  12170.      return +d33;
    12171. 

  12171.     }
    12172. 

  12172.     while (1) {
    12173. 

  12173.      i3 = HEAP32[i9 >> 2] | 0;
    12174. 

  12174.      if (i3 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
    12175. 

  12175.       HEAP32[i9 >> 2] = i3 + 1;
    12176. 

  12176.       i3 = HEAPU8[i3] | 0;
    12177. 

  12177.      } else {
    12178. 

  12178.       i3 = ___shgetc(i8) | 0;
    12179. 

  12179.      }
    12180. 

  12180.      if (!((i3 + -48 | 0) >>> 0 < 10 | (i3 + -65 | 0) >>> 0 < 26) ? !((i3 + -97 | 0) >>> 0 < 26 | (i3 | 0) == 95) : 0) {
    12181. 

  12181.       break;
    12182. 

  12182.      }
    12183. 

  12183.      i2 = i2 + 1 | 0;
    12184. 

  12184.     }
    12185. 

  12185.     if ((i3 | 0) == 41) {
    12186. 

  12186.      d33 = nan;
    12187. 

  12187.      STACKTOP = i1;
    12188. 

  12188.      return +d33;
    12189. 

  12189.     }
    12190. 

  12190.     i3 = (HEAP32[i10 >> 2] | 0) == 0;
    12191. 

  12191.     if (!i3) {
    12192. 

  12192.      HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12193. 

  12193.     }
    12194. 

  12194.     if (i12) {
    12195. 

  12195.      HEAP32[(___errno_location() | 0) >> 2] = 22;
    12196. 

  12196.      ___shlim(i8, 0);
    12197. 

  12197.      d33 = 0.0;
    12198. 

  12198.      STACKTOP = i1;
    12199. 

  12199.      return +d33;
    12200. 

  12200.     }
    12201. 

  12201.     if ((i2 | 0) == 0 | i3) {
    12202. 

  12202.      d33 = nan;
    12203. 

  12203.      STACKTOP = i1;
    12204. 

  12204.      return +d33;
    12205. 

  12205.     }
    12206. 

  12206.     while (1) {
    12207. 

  12207.      i2 = i2 + -1 | 0;
    12208. 

  12208.      HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12209. 

  12209.      if ((i2 | 0) == 0) {
    12210. 

  12210.       d14 = nan;
    12211. 

  12211.       break;
    12212. 

  12212.      }
    12213. 

  12213.     }
    12214. 

  12214.     STACKTOP = i1;
    12215. 

  12215.     return +d14;
    12216. 

  12216.    } else {
    12217. 

  12217.     if ((HEAP32[i10 >> 2] | 0) != 0) {
    12218. 

  12218.      HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12219. 

  12219.     }
    12220. 

  12220.     HEAP32[(___errno_location() | 0) >> 2] = 22;
    12221. 

  12221.     ___shlim(i8, 0);
    12222. 

  12222.     d33 = 0.0;
    12223. 

  12223.     STACKTOP = i1;
    12224. 

  12224.     return +d33;
    12225. 

  12225.    }
    12226. 

  12226.   }
    12227. 

  12227.  } while (0);
    12228. 

  12228.  if ((i13 | 0) == 23) {
    12229. 

  12229.   i2 = (HEAP32[i10 >> 2] | 0) == 0;
    12230. 

  12230.   if (!i2) {
    12231. 

  12231.    HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12232. 

  12232.   }
    12233. 

  12233.   if (!(i7 >>> 0 < 4 | (i11 | 0) == 0 | i2)) {
    12234. 

  12234.    do {
    12235. 

  12235.     HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
    12236. 

  12236.     i7 = i7 + -1 | 0;
    12237. 

  12237.    } while (i7 >>> 0 > 3);
    12238. 

  12238.   }
    12239. 

  12239.  }
    12240. 

  12240.  d33 = +(i4 | 0) * inf;
    12241. 

  12241.  STACKTOP = i1;
    12242. 

  12242.  return +d33;
    12243. 

  12243. }
    12244. 

  12244. function _statement(i4) {
    12245. 

  12245.  i4 = i4 | 0;
    12246. 

  12246.  var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0;
    12247. 

  12247.  i2 = STACKTOP;
    12248. 

  12248.  STACKTOP = STACKTOP + 160 | 0;
    12249. 

  12249.  i8 = i2 + 120 | 0;
    12250. 

  12250.  i24 = i2 + 96 | 0;
    12251. 

  12251.  i15 = i2 + 72 | 0;
    12252. 

  12252.  i25 = i2 + 48 | 0;
    12253. 

  12253.  i20 = i2 + 24 | 0;
    12254. 

  12254.  i21 = i2;
    12255. 

  12255.  i19 = i4 + 4 | 0;
    12256. 

  12256.  i6 = HEAP32[i19 >> 2] | 0;
    12257. 

  12257.  i3 = i4 + 48 | 0;
    12258. 

  12258.  i9 = HEAP32[i3 >> 2] | 0;
    12259. 

  12259.  i1 = i4 + 52 | 0;
    12260. 

  12260.  i26 = (HEAP32[i1 >> 2] | 0) + 38 | 0;
    12261. 

  12261.  i27 = (HEAP16[i26 >> 1] | 0) + 1 << 16 >> 16;
    12262. 

  12262.  HEAP16[i26 >> 1] = i27;
    12263. 

  12263.  if ((i27 & 65535) > 200) {
    12264. 

  12264.   i27 = i9 + 12 | 0;
    12265. 

  12265.   i26 = HEAP32[(HEAP32[i27 >> 2] | 0) + 52 >> 2] | 0;
    12266. 

  12266.   i5 = HEAP32[(HEAP32[i9 >> 2] | 0) + 64 >> 2] | 0;
    12267. 

  12267.   if ((i5 | 0) == 0) {
    12268. 

  12268.    i29 = 6552;
    12269. 

  12269.    HEAP32[i8 >> 2] = 6360;
    12270. 

  12270.    i28 = i8 + 4 | 0;
    12271. 

  12271.    HEAP32[i28 >> 2] = 200;
    12272. 

  12272.    i28 = i8 + 8 | 0;
    12273. 

  12273.    HEAP32[i28 >> 2] = i29;
    12274. 

  12274.    i28 = _luaO_pushfstring(i26, 6592, i8) | 0;
    12275. 

  12275.    i29 = HEAP32[i27 >> 2] | 0;
    12276. 

  12276.    _luaX_syntaxerror(i29, i28);
    12277. 

  12277.   }
    12278. 

  12278.   HEAP32[i8 >> 2] = i5;
    12279. 

  12279.   i28 = _luaO_pushfstring(i26, 6568, i8) | 0;
    12280. 

  12280.   HEAP32[i8 >> 2] = 6360;
    12281. 

  12281.   i29 = i8 + 4 | 0;
    12282. 

  12282.   HEAP32[i29 >> 2] = 200;
    12283. 

  12283.   i29 = i8 + 8 | 0;
    12284. 

  12284.   HEAP32[i29 >> 2] = i28;
    12285. 

  12285.   i29 = _luaO_pushfstring(i26, 6592, i8) | 0;
    12286. 

  12286.   i28 = HEAP32[i27 >> 2] | 0;
    12287. 

  12287.   _luaX_syntaxerror(i28, i29);
    12288. 

  12288.  }
    12289. 

  12289.  i5 = i4 + 16 | 0;
    12290. 

  12290.  L8 : do {
    12291. 

  12291.   switch (HEAP32[i5 >> 2] | 0) {
    12292. 

  12292.   case 59:
    12293. 

  12293.    {
    12294. 

  12294.     _luaX_next(i4);
    12295. 

  12295.     break;
    12296. 

  12296.    }
    12297. 

  12297.   case 267:
    12298. 

  12298.    {
    12299. 

  12299.     HEAP32[i21 >> 2] = -1;
    12300. 

  12300.     _test_then_block(i4, i21);
    12301. 

  12301.     while (1) {
    12302. 

  12302.      i8 = HEAP32[i5 >> 2] | 0;
    12303. 

  12303.      if ((i8 | 0) == 260) {
    12304. 

  12304.       i7 = 10;
    12305. 

  12305.       break;
    12306. 

  12306.      } else if ((i8 | 0) != 261) {
    12307. 

  12307.       break;
    12308. 

  12308.      }
    12309. 

  12309.      _test_then_block(i4, i21);
    12310. 

  12310.     }
    12311. 

  12311.     if ((i7 | 0) == 10) {
    12312. 

  12312.      _luaX_next(i4);
    12313. 

  12313.      i7 = HEAP32[i3 >> 2] | 0;
    12314. 

  12314.      HEAP8[i20 + 10 | 0] = 0;
    12315. 

  12315.      HEAP8[i20 + 8 | 0] = HEAP8[i7 + 46 | 0] | 0;
    12316. 

  12316.      i29 = HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] | 0;
    12317. 

  12317.      HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12318. 

  12318.      HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12319. 

  12319.      HEAP8[i20 + 9 | 0] = 0;
    12320. 

  12320.      i29 = i7 + 16 | 0;
    12321. 

  12321.      HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
    12322. 

  12322.      HEAP32[i29 >> 2] = i20;
    12323. 

  12323.      L16 : do {
    12324. 

  12324.       i8 = HEAP32[i5 >> 2] | 0;
    12325. 

  12325.       switch (i8 | 0) {
    12326. 

  12326.       case 277:
    12327. 

  12327.       case 286:
    12328. 

  12328.       case 262:
    12329. 

  12329.       case 261:
    12330. 

  12330.       case 260:
    12331. 

  12331.        {
    12332. 

  12332.         break L16;
    12333. 

  12333.        }
    12334. 

  12334.       default:
    12335. 

  12335.        {}
    12336. 

  12336.       }
    12337. 

  12337.       _statement(i4);
    12338. 

  12338.      } while ((i8 | 0) != 274);
    12339. 

  12339.      _leaveblock(i7);
    12340. 

  12340.     }
    12341. 

  12341.     _check_match(i4, 262, 267, i6);
    12342. 

  12342.     _luaK_patchtohere(i9, HEAP32[i21 >> 2] | 0);
    12343. 

  12343.     break;
    12344. 

  12344.    }
    12345. 

  12345.   case 259:
    12346. 

  12346.    {
    12347. 

  12347.     _luaX_next(i4);
    12348. 

  12348.     i7 = HEAP32[i3 >> 2] | 0;
    12349. 

  12349.     HEAP8[i20 + 10 | 0] = 0;
    12350. 

  12350.     HEAP8[i20 + 8 | 0] = HEAP8[i7 + 46 | 0] | 0;
    12351. 

  12351.     i29 = HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] | 0;
    12352. 

  12352.     HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12353. 

  12353.     HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12354. 

  12354.     HEAP8[i20 + 9 | 0] = 0;
    12355. 

  12355.     i29 = i7 + 16 | 0;
    12356. 

  12356.     HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
    12357. 

  12357.     HEAP32[i29 >> 2] = i20;
    12358. 

  12358.     L22 : do {
    12359. 

  12359.      i8 = HEAP32[i5 >> 2] | 0;
    12360. 

  12360.      switch (i8 | 0) {
    12361. 

  12361.      case 277:
    12362. 

  12362.      case 286:
    12363. 

  12363.      case 262:
    12364. 

  12364.      case 261:
    12365. 

  12365.      case 260:
    12366. 

  12366.       {
    12367. 

  12367.        break L22;
    12368. 

  12368.       }
    12369. 

  12369.      default:
    12370. 

  12370.       {}
    12371. 

  12371.      }
    12372. 

  12372.      _statement(i4);
    12373. 

  12373.     } while ((i8 | 0) != 274);
    12374. 

  12374.     _leaveblock(i7);
    12375. 

  12375.     _check_match(i4, 262, 259, i6);
    12376. 

  12376.     break;
    12377. 

  12377.    }
    12378. 

  12378.   case 269:
    12379. 

  12379.    {
    12380. 

  12380.     _luaX_next(i4);
    12381. 

  12381.     i6 = HEAP32[i5 >> 2] | 0;
    12382. 

  12382.     if ((i6 | 0) == 265) {
    12383. 

  12383.      _luaX_next(i4);
    12384. 

  12384.      i7 = HEAP32[i3 >> 2] | 0;
    12385. 

  12385.      if ((HEAP32[i5 >> 2] | 0) == 288) {
    12386. 

  12386.       i29 = HEAP32[i4 + 24 >> 2] | 0;
    12387. 

  12387.       _luaX_next(i4);
    12388. 

  12388.       _new_localvar(i4, i29);
    12389. 

  12389.       i29 = HEAP32[i3 >> 2] | 0;
    12390. 

  12390.       i27 = i29 + 46 | 0;
    12391. 

  12391.       i28 = (HEAPU8[i27] | 0) + 1 | 0;
    12392. 

  12392.       HEAP8[i27] = i28;
    12393. 

  12393.       HEAP32[(HEAP32[(HEAP32[i29 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i29 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((i28 & 255) + -1 + (HEAP32[i29 + 40 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i29 + 20 >> 2];
    12394. 

  12394.       _body(i4, i25, 0, HEAP32[i19 >> 2] | 0);
    12395. 

  12395.       HEAP32[(HEAP32[(HEAP32[i7 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((HEAP32[i7 + 40 >> 2] | 0) + (HEAP32[i25 + 8 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i7 + 20 >> 2];
    12396. 

  12396.       break L8;
    12397. 

  12397.      } else {
    12398. 

  12398.       _error_expected(i4, 288);
    12399. 

  12399.      }
    12400. 

  12400.     }
    12401. 

  12401.     if ((i6 | 0) != 288) {
    12402. 

  12402.      _error_expected(i4, 288);
    12403. 

  12403.     }
    12404. 

  12404.     i7 = i4 + 24 | 0;
    12405. 

  12405.     i6 = 1;
    12406. 

  12406.     while (1) {
    12407. 

  12407.      i8 = HEAP32[i7 >> 2] | 0;
    12408. 

  12408.      _luaX_next(i4);
    12409. 

  12409.      _new_localvar(i4, i8);
    12410. 

  12410.      i8 = HEAP32[i5 >> 2] | 0;
    12411. 

  12411.      if ((i8 | 0) == 61) {
    12412. 

  12412.       i7 = 81;
    12413. 

  12413.       break;
    12414. 

  12414.      } else if ((i8 | 0) != 44) {
    12415. 

  12415.       i7 = 83;
    12416. 

  12416.       break;
    12417. 

  12417.      }
    12418. 

  12418.      _luaX_next(i4);
    12419. 

  12419.      if ((HEAP32[i5 >> 2] | 0) == 288) {
    12420. 

  12420.       i6 = i6 + 1 | 0;
    12421. 

  12421.      } else {
    12422. 

  12422.       i7 = 78;
    12423. 

  12423.       break;
    12424. 

  12424.      }
    12425. 

  12425.     }
    12426. 

  12426.     do {
    12427. 

  12427.      if ((i7 | 0) == 78) {
    12428. 

  12428.       _error_expected(i4, 288);
    12429. 

  12429.      } else if ((i7 | 0) == 81) {
    12430. 

  12430.       _luaX_next(i4);
    12431. 

  12431.       _subexpr(i4, i15, 0) | 0;
    12432. 

  12432.       if ((HEAP32[i5 >> 2] | 0) == 44) {
    12433. 

  12433.        i8 = 1;
    12434. 

  12434.        do {
    12435. 

  12435.         _luaX_next(i4);
    12436. 

  12436.         _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i15);
    12437. 

  12437.         _subexpr(i4, i15, 0) | 0;
    12438. 

  12438.         i8 = i8 + 1 | 0;
    12439. 

  12439.        } while ((HEAP32[i5 >> 2] | 0) == 44);
    12440. 

  12440.       } else {
    12441. 

  12441.        i8 = 1;
    12442. 

  12442.       }
    12443. 

  12443.       i5 = HEAP32[i15 >> 2] | 0;
    12444. 

  12444.       i4 = HEAP32[i3 >> 2] | 0;
    12445. 

  12445.       i8 = i6 - i8 | 0;
    12446. 

  12446.       if ((i5 | 0) == 0) {
    12447. 

  12447.        i17 = i8;
    12448. 

  12448.        i18 = i4;
    12449. 

  12449.        i7 = 88;
    12450. 

  12450.        break;
    12451. 

  12451.       } else if (!((i5 | 0) == 13 | (i5 | 0) == 12)) {
    12452. 

  12452.        _luaK_exp2nextreg(i4, i15);
    12453. 

  12453.        i17 = i8;
    12454. 

  12454.        i18 = i4;
    12455. 

  12455.        i7 = 88;
    12456. 

  12456.        break;
    12457. 

  12457.       }
    12458. 

  12458.       i5 = i8 + 1 | 0;
    12459. 

  12459.       i5 = (i5 | 0) < 0 ? 0 : i5;
    12460. 

  12460.       _luaK_setreturns(i4, i15, i5);
    12461. 

  12461.       if ((i5 | 0) > 1) {
    12462. 

  12462.        _luaK_reserveregs(i4, i5 + -1 | 0);
    12463. 

  12463.       }
    12464. 

  12464.      } else if ((i7 | 0) == 83) {
    12465. 

  12465.       HEAP32[i15 >> 2] = 0;
    12466. 

  12466.       i17 = i6;
    12467. 

  12467.       i18 = HEAP32[i3 >> 2] | 0;
    12468. 

  12468.       i7 = 88;
    12469. 

  12469.      }
    12470. 

  12470.     } while (0);
    12471. 

  12471.     if ((i7 | 0) == 88 ? (i17 | 0) > 0 : 0) {
    12472. 

  12472.      i29 = HEAPU8[i18 + 48 | 0] | 0;
    12473. 

  12473.      _luaK_reserveregs(i18, i17);
    12474. 

  12474.      _luaK_nil(i18, i29, i17);
    12475. 

  12475.     }
    12476. 

  12476.     i5 = HEAP32[i3 >> 2] | 0;
    12477. 

  12477.     i4 = i5 + 46 | 0;
    12478. 

  12478.     i7 = (HEAPU8[i4] | 0) + i6 | 0;
    12479. 

  12479.     HEAP8[i4] = i7;
    12480. 

  12480.     if ((i6 | 0) != 0 ? (i11 = i5 + 20 | 0, i14 = i5 + 40 | 0, i12 = HEAP32[(HEAP32[i5 >> 2] | 0) + 24 >> 2] | 0, i13 = HEAP32[HEAP32[(HEAP32[i5 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0, HEAP32[i12 + ((HEAP16[i13 + ((i7 & 255) - i6 + (HEAP32[i14 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i11 >> 2], i16 = i6 + -1 | 0, (i16 | 0) != 0) : 0) {
    12481. 

  12481.      do {
    12482. 

  12482.       HEAP32[i12 + ((HEAP16[i13 + ((HEAPU8[i4] | 0) - i16 + (HEAP32[i14 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i11 >> 2];
    12483. 

  12483.       i16 = i16 + -1 | 0;
    12484. 

  12484.      } while ((i16 | 0) != 0);
    12485. 

  12485.     }
    12486. 

  12486.     break;
    12487. 

  12487.    }
    12488. 

  12488.   case 264:
    12489. 

  12489.    {
    12490. 

  12490.     HEAP8[i24 + 10 | 0] = 1;
    12491. 

  12491.     HEAP8[i24 + 8 | 0] = HEAP8[i9 + 46 | 0] | 0;
    12492. 

  12492.     i29 = HEAP32[(HEAP32[i9 + 12 >> 2] | 0) + 64 >> 2] | 0;
    12493. 

  12493.     HEAP16[i24 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12494. 

  12494.     HEAP16[i24 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12495. 

  12495.     HEAP8[i24 + 9 | 0] = 0;
    12496. 

  12496.     i29 = i9 + 16 | 0;
    12497. 

  12497.     HEAP32[i24 >> 2] = HEAP32[i29 >> 2];
    12498. 

  12498.     HEAP32[i29 >> 2] = i24;
    12499. 

  12499.     _luaX_next(i4);
    12500. 

  12500.     if ((HEAP32[i5 >> 2] | 0) != 288) {
    12501. 

  12501.      _error_expected(i4, 288);
    12502. 

  12502.     }
    12503. 

  12503.     i14 = i4 + 24 | 0;
    12504. 

  12504.     i13 = HEAP32[i14 >> 2] | 0;
    12505. 

  12505.     _luaX_next(i4);
    12506. 

  12506.     i11 = HEAP32[i5 >> 2] | 0;
    12507. 

  12507.     if ((i11 | 0) == 268 | (i11 | 0) == 44) {
    12508. 

  12508.      i12 = HEAP32[i3 >> 2] | 0;
    12509. 

  12509.      i11 = HEAPU8[i12 + 48 | 0] | 0;
    12510. 

  12510.      _new_localvar(i4, _luaX_newstring(i4, 6744, 15) | 0);
    12511. 

  12511.      _new_localvar(i4, _luaX_newstring(i4, 6760, 11) | 0);
    12512. 

  12512.      _new_localvar(i4, _luaX_newstring(i4, 6776, 13) | 0);
    12513. 

  12513.      _new_localvar(i4, i13);
    12514. 

  12514.      i13 = HEAP32[i5 >> 2] | 0;
    12515. 

  12515.      do {
    12516. 

  12516.       if ((i13 | 0) == 44) {
    12517. 

  12517.        i15 = 4;
    12518. 

  12518.        while (1) {
    12519. 

  12519.         _luaX_next(i4);
    12520. 

  12520.         if ((HEAP32[i5 >> 2] | 0) != 288) {
    12521. 

  12521.          i7 = 40;
    12522. 

  12522.          break;
    12523. 

  12523.         }
    12524. 

  12524.         i13 = HEAP32[i14 >> 2] | 0;
    12525. 

  12525.         _luaX_next(i4);
    12526. 

  12526.         _new_localvar(i4, i13);
    12527. 

  12527.         i13 = HEAP32[i5 >> 2] | 0;
    12528. 

  12528.         if ((i13 | 0) == 44) {
    12529. 

  12529.          i15 = i15 + 1 | 0;
    12530. 

  12530.         } else {
    12531. 

  12531.          i7 = 42;
    12532. 

  12532.          break;
    12533. 

  12533.         }
    12534. 

  12534.        }
    12535. 

  12535.        if ((i7 | 0) == 40) {
    12536. 

  12536.         _error_expected(i4, 288);
    12537. 

  12537.        } else if ((i7 | 0) == 42) {
    12538. 

  12538.         i22 = i13;
    12539. 

  12539.         i10 = i15 + -2 | 0;
    12540. 

  12540.         break;
    12541. 

  12541.        }
    12542. 

  12542.       } else {
    12543. 

  12543.        i22 = i13;
    12544. 

  12544.        i10 = 1;
    12545. 

  12545.       }
    12546. 

  12546.      } while (0);
    12547. 

  12547.      if ((i22 | 0) != 268) {
    12548. 

  12548.       _error_expected(i4, 268);
    12549. 

  12549.      }
    12550. 

  12550.      _luaX_next(i4);
    12551. 

  12551.      i13 = HEAP32[i19 >> 2] | 0;
    12552. 

  12552.      _subexpr(i4, i8, 0) | 0;
    12553. 

  12553.      if ((HEAP32[i5 >> 2] | 0) == 44) {
    12554. 

  12554.       i14 = 1;
    12555. 

  12555.       do {
    12556. 

  12556.        _luaX_next(i4);
    12557. 

  12557.        _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
    12558. 

  12558.        _subexpr(i4, i8, 0) | 0;
    12559. 

  12559.        i14 = i14 + 1 | 0;
    12560. 

  12560.       } while ((HEAP32[i5 >> 2] | 0) == 44);
    12561. 

  12561.      } else {
    12562. 

  12562.       i14 = 1;
    12563. 

  12563.      }
    12564. 

  12564.      i5 = HEAP32[i3 >> 2] | 0;
    12565. 

  12565.      i14 = 3 - i14 | 0;
    12566. 

  12566.      i15 = HEAP32[i8 >> 2] | 0;
    12567. 

  12567.      if ((i15 | 0) == 0) {
    12568. 

  12568.       i7 = 51;
    12569. 

  12569.      } else if ((i15 | 0) == 13 | (i15 | 0) == 12) {
    12570. 

  12570.       i15 = i14 + 1 | 0;
    12571. 

  12571.       i15 = (i15 | 0) < 0 ? 0 : i15;
    12572. 

  12572.       _luaK_setreturns(i5, i8, i15);
    12573. 

  12573.       if ((i15 | 0) > 1) {
    12574. 

  12574.        _luaK_reserveregs(i5, i15 + -1 | 0);
    12575. 

  12575.       }
    12576. 

  12576.      } else {
    12577. 

  12577.       _luaK_exp2nextreg(i5, i8);
    12578. 

  12578.       i7 = 51;
    12579. 

  12579.      }
    12580. 

  12580.      if ((i7 | 0) == 51 ? (i14 | 0) > 0 : 0) {
    12581. 

  12581.       i29 = HEAPU8[i5 + 48 | 0] | 0;
    12582. 

  12582.       _luaK_reserveregs(i5, i14);
    12583. 

  12583.       _luaK_nil(i5, i29, i14);
    12584. 

  12584.      }
    12585. 

  12585.      _luaK_checkstack(i12, 3);
    12586. 

  12586.      _forbody(i4, i11, i13, i10, 0);
    12587. 

  12587.     } else if ((i11 | 0) == 61) {
    12588. 

  12588.      i11 = HEAP32[i3 >> 2] | 0;
    12589. 

  12589.      i7 = i11 + 48 | 0;
    12590. 

  12590.      i10 = HEAPU8[i7] | 0;
    12591. 

  12591.      _new_localvar(i4, _luaX_newstring(i4, 6792, 11) | 0);
    12592. 

  12592.      _new_localvar(i4, _luaX_newstring(i4, 6808, 11) | 0);
    12593. 

  12593.      _new_localvar(i4, _luaX_newstring(i4, 6824, 10) | 0);
    12594. 

  12594.      _new_localvar(i4, i13);
    12595. 

  12595.      if ((HEAP32[i5 >> 2] | 0) != 61) {
    12596. 

  12596.       _error_expected(i4, 61);
    12597. 

  12597.      }
    12598. 

  12598.      _luaX_next(i4);
    12599. 

  12599.      _subexpr(i4, i8, 0) | 0;
    12600. 

  12600.      _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
    12601. 

  12601.      if ((HEAP32[i5 >> 2] | 0) != 44) {
    12602. 

  12602.       _error_expected(i4, 44);
    12603. 

  12603.      }
    12604. 

  12604.      _luaX_next(i4);
    12605. 

  12605.      _subexpr(i4, i8, 0) | 0;
    12606. 

  12606.      _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
    12607. 

  12607.      if ((HEAP32[i5 >> 2] | 0) == 44) {
    12608. 

  12608.       _luaX_next(i4);
    12609. 

  12609.       _subexpr(i4, i8, 0) | 0;
    12610. 

  12610.       _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
    12611. 

  12611.      } else {
    12612. 

  12612.       i29 = HEAPU8[i7] | 0;
    12613. 

  12613.       _luaK_codek(i11, i29, _luaK_numberK(i11, 1.0) | 0) | 0;
    12614. 

  12614.       _luaK_reserveregs(i11, 1);
    12615. 

  12615.      }
    12616. 

  12616.      _forbody(i4, i10, i6, 1, 1);
    12617. 

  12617.     } else {
    12618. 

  12618.      _luaX_syntaxerror(i4, 6720);
    12619. 

  12619.     }
    12620. 

  12620.     _check_match(i4, 262, 264, i6);
    12621. 

  12621.     _leaveblock(i9);
    12622. 

  12622.     break;
    12623. 

  12623.    }
    12624. 

  12624.   case 265:
    12625. 

  12625.    {
    12626. 

  12626.     _luaX_next(i4);
    12627. 

  12627.     if ((HEAP32[i5 >> 2] | 0) != 288) {
    12628. 

  12628.      _error_expected(i4, 288);
    12629. 

  12629.     }
    12630. 

  12630.     i8 = HEAP32[i4 + 24 >> 2] | 0;
    12631. 

  12631.     _luaX_next(i4);
    12632. 

  12632.     i9 = HEAP32[i3 >> 2] | 0;
    12633. 

  12633.     if ((_singlevaraux(i9, i8, i20, 1) | 0) == 0) {
    12634. 

  12634.      _singlevaraux(i9, HEAP32[i4 + 72 >> 2] | 0, i20, 1) | 0;
    12635. 

  12635.      i29 = _luaK_stringK(HEAP32[i3 >> 2] | 0, i8) | 0;
    12636. 

  12636.      HEAP32[i25 + 16 >> 2] = -1;
    12637. 

  12637.      HEAP32[i25 + 20 >> 2] = -1;
    12638. 

  12638.      HEAP32[i25 >> 2] = 4;
    12639. 

  12639.      HEAP32[i25 + 8 >> 2] = i29;
    12640. 

  12640.      _luaK_indexed(i9, i20, i25);
    12641. 

  12641.     }
    12642. 

  12642.     while (1) {
    12643. 

  12643.      i8 = HEAP32[i5 >> 2] | 0;
    12644. 

  12644.      if ((i8 | 0) == 58) {
    12645. 

  12645.       i7 = 70;
    12646. 

  12646.       break;
    12647. 

  12647.      } else if ((i8 | 0) != 46) {
    12648. 

  12648.       i5 = 0;
    12649. 

  12649.       break;
    12650. 

  12650.      }
    12651. 

  12651.      _fieldsel(i4, i20);
    12652. 

  12652.     }
    12653. 

  12653.     if ((i7 | 0) == 70) {
    12654. 

  12654.      _fieldsel(i4, i20);
    12655. 

  12655.      i5 = 1;
    12656. 

  12656.     }
    12657. 

  12657.     _body(i4, i21, i5, i6);
    12658. 

  12658.     _luaK_storevar(HEAP32[i3 >> 2] | 0, i20, i21);
    12659. 

  12659.     _luaK_fixline(HEAP32[i3 >> 2] | 0, i6);
    12660. 

  12660.     break;
    12661. 

  12661.    }
    12662. 

  12662.   case 278:
    12663. 

  12663.    {
    12664. 

  12664.     _luaX_next(i4);
    12665. 

  12665.     i7 = _luaK_getlabel(i9) | 0;
    12666. 

  12666.     _subexpr(i4, i20, 0) | 0;
    12667. 

  12667.     if ((HEAP32[i20 >> 2] | 0) == 1) {
    12668. 

  12668.      HEAP32[i20 >> 2] = 3;
    12669. 

  12669.     }
    12670. 

  12670.     _luaK_goiftrue(HEAP32[i3 >> 2] | 0, i20);
    12671. 

  12671.     i8 = HEAP32[i20 + 20 >> 2] | 0;
    12672. 

  12672.     HEAP8[i21 + 10 | 0] = 1;
    12673. 

  12673.     HEAP8[i21 + 8 | 0] = HEAP8[i9 + 46 | 0] | 0;
    12674. 

  12674.     i29 = HEAP32[(HEAP32[i9 + 12 >> 2] | 0) + 64 >> 2] | 0;
    12675. 

  12675.     HEAP16[i21 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12676. 

  12676.     HEAP16[i21 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12677. 

  12677.     HEAP8[i21 + 9 | 0] = 0;
    12678. 

  12678.     i29 = i9 + 16 | 0;
    12679. 

  12679.     HEAP32[i21 >> 2] = HEAP32[i29 >> 2];
    12680. 

  12680.     HEAP32[i29 >> 2] = i21;
    12681. 

  12681.     if ((HEAP32[i5 >> 2] | 0) != 259) {
    12682. 

  12682.      _error_expected(i4, 259);
    12683. 

  12683.     }
    12684. 

  12684.     _luaX_next(i4);
    12685. 

  12685.     i10 = HEAP32[i3 >> 2] | 0;
    12686. 

  12686.     HEAP8[i20 + 10 | 0] = 0;
    12687. 

  12687.     HEAP8[i20 + 8 | 0] = HEAP8[i10 + 46 | 0] | 0;
    12688. 

  12688.     i29 = HEAP32[(HEAP32[i10 + 12 >> 2] | 0) + 64 >> 2] | 0;
    12689. 

  12689.     HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12690. 

  12690.     HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12691. 

  12691.     HEAP8[i20 + 9 | 0] = 0;
    12692. 

  12692.     i29 = i10 + 16 | 0;
    12693. 

  12693.     HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
    12694. 

  12694.     HEAP32[i29 >> 2] = i20;
    12695. 

  12695.     L119 : do {
    12696. 

  12696.      i11 = HEAP32[i5 >> 2] | 0;
    12697. 

  12697.      switch (i11 | 0) {
    12698. 

  12698.      case 277:
    12699. 

  12699.      case 286:
    12700. 

  12700.      case 262:
    12701. 

  12701.      case 261:
    12702. 

  12702.      case 260:
    12703. 

  12703.       {
    12704. 

  12704.        break L119;
    12705. 

  12705.       }
    12706. 

  12706.      default:
    12707. 

  12707.       {}
    12708. 

  12708.      }
    12709. 

  12709.      _statement(i4);
    12710. 

  12710.     } while ((i11 | 0) != 274);
    12711. 

  12711.     _leaveblock(i10);
    12712. 

  12712.     _luaK_patchlist(i9, _luaK_jump(i9) | 0, i7);
    12713. 

  12713.     _check_match(i4, 262, 278, i6);
    12714. 

  12714.     _leaveblock(i9);
    12715. 

  12715.     _luaK_patchtohere(i9, i8);
    12716. 

  12716.     break;
    12717. 

  12717.    }
    12718. 

  12718.   case 273:
    12719. 

  12719.    {
    12720. 

  12720.     i7 = _luaK_getlabel(i9) | 0;
    12721. 

  12721.     HEAP8[i24 + 10 | 0] = 1;
    12722. 

  12722.     i28 = i9 + 46 | 0;
    12723. 

  12723.     HEAP8[i24 + 8 | 0] = HEAP8[i28] | 0;
    12724. 

  12724.     i11 = i9 + 12 | 0;
    12725. 

  12725.     i29 = HEAP32[(HEAP32[i11 >> 2] | 0) + 64 >> 2] | 0;
    12726. 

  12726.     HEAP16[i24 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
    12727. 

  12727.     HEAP16[i24 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
    12728. 

  12728.     HEAP8[i24 + 9 | 0] = 0;
    12729. 

  12729.     i29 = i9 + 16 | 0;
    12730. 

  12730.     HEAP32[i24 >> 2] = HEAP32[i29 >> 2];
    12731. 

  12731.     HEAP32[i29 >> 2] = i24;
    12732. 

  12732.     HEAP8[i15 + 10 | 0] = 0;
    12733. 

  12733.     i10 = i15 + 8 | 0;
    12734. 

  12734.     HEAP8[i10] = HEAP8[i28] | 0;
    12735. 

  12735.     i11 = HEAP32[(HEAP32[i11 >> 2] | 0) + 64 >> 2] | 0;
    12736. 

  12736.     HEAP16[i15 + 4 >> 1] = HEAP32[i11 + 28 >> 2];
    12737. 

  12737.     HEAP16[i15 + 6 >> 1] = HEAP32[i11 + 16 >> 2];
    12738. 

  12738.     i11 = i15 + 9 | 0;
    12739. 

  12739.     HEAP8[i11] = 0;
    12740. 

  12740.     HEAP32[i15 >> 2] = HEAP32[i29 >> 2];
    12741. 

  12741.     HEAP32[i29 >> 2] = i15;
    12742. 

  12742.     _luaX_next(i4);
    12743. 

  12743.     L124 : do {
    12744. 

  12744.      i12 = HEAP32[i5 >> 2] | 0;
    12745. 

  12745.      switch (i12 | 0) {
    12746. 

  12746.      case 277:
    12747. 

  12747.      case 286:
    12748. 

  12748.      case 262:
    12749. 

  12749.      case 261:
    12750. 

  12750.      case 260:
    12751. 

  12751.       {
    12752. 

  12752.        break L124;
    12753. 

  12753.       }
    12754. 

  12754.      default:
    12755. 

  12755.       {}
    12756. 

  12756.      }
    12757. 

  12757.      _statement(i4);
    12758. 

  12758.     } while ((i12 | 0) != 274);
    12759. 

  12759.     _check_match(i4, 277, 273, i6);
    12760. 

  12760.     _subexpr(i4, i8, 0) | 0;
    12761. 

  12761.     if ((HEAP32[i8 >> 2] | 0) == 1) {
    12762. 

  12762.      HEAP32[i8 >> 2] = 3;
    12763. 

  12763.     }
    12764. 

  12764.     _luaK_goiftrue(HEAP32[i3 >> 2] | 0, i8);
    12765. 

  12765.     i4 = HEAP32[i8 + 20 >> 2] | 0;
    12766. 

  12766.     if ((HEAP8[i11] | 0) != 0) {
    12767. 

  12767.      _luaK_patchclose(i9, i4, HEAPU8[i10] | 0);
    12768. 

  12768.     }
    12769. 

  12769.     _leaveblock(i9);
    12770. 

  12770.     _luaK_patchlist(i9, i4, i7);
    12771. 

  12771.     _leaveblock(i9);
    12772. 

  12772.     break;
    12773. 

  12773.    }
    12774. 

  12774.   case 285:
    12775. 

  12775.    {
    12776. 

  12776.     _luaX_next(i4);
    12777. 

  12777.     if ((HEAP32[i5 >> 2] | 0) != 288) {
    12778. 

  12778.      _error_expected(i4, 288);
    12779. 

  12779.     }
    12780. 

  12780.     i10 = HEAP32[i4 + 24 >> 2] | 0;
    12781. 

  12781.     _luaX_next(i4);
    12782. 

  12782.     i15 = HEAP32[i3 >> 2] | 0;
    12783. 

  12783.     i9 = i4 + 64 | 0;
    12784. 

  12784.     i14 = HEAP32[i9 >> 2] | 0;
    12785. 

  12785.     i12 = i14 + 24 | 0;
    12786. 

  12786.     i11 = i15 + 16 | 0;
    12787. 

  12787.     i16 = HEAP16[(HEAP32[i11 >> 2] | 0) + 4 >> 1] | 0;
    12788. 

  12788.     i13 = i14 + 28 | 0;
    12789. 

  12789.     L138 : do {
    12790. 

  12790.      if ((i16 | 0) < (HEAP32[i13 >> 2] | 0)) {
    12791. 

  12791.       while (1) {
    12792. 

  12792.        i17 = i16 + 1 | 0;
    12793. 

  12793.        if ((_luaS_eqstr(i10, HEAP32[(HEAP32[i12 >> 2] | 0) + (i16 << 4) >> 2] | 0) | 0) != 0) {
    12794. 

  12794.         break;
    12795. 

  12795.        }
    12796. 

  12796.        if ((i17 | 0) < (HEAP32[i13 >> 2] | 0)) {
    12797. 

  12797.         i16 = i17;
    12798. 

  12798.        } else {
    12799. 

  12799.         break L138;
    12800. 

  12800.        }
    12801. 

  12801.       }
    12802. 

  12802.       i28 = i15 + 12 | 0;
    12803. 

  12803.       i29 = HEAP32[(HEAP32[i28 >> 2] | 0) + 52 >> 2] | 0;
    12804. 

  12804.       i27 = HEAP32[(HEAP32[i12 >> 2] | 0) + (i16 << 4) + 8 >> 2] | 0;
    12805. 

  12805.       HEAP32[i8 >> 2] = i10 + 16;
    12806. 

  12806.       HEAP32[i8 + 4 >> 2] = i27;
    12807. 

  12807.       i29 = _luaO_pushfstring(i29, 6680, i8) | 0;
    12808. 

  12808.       _semerror(HEAP32[i28 >> 2] | 0, i29);
    12809. 

  12809.      }
    12810. 

  12810.     } while (0);
    12811. 

  12811.     if ((HEAP32[i5 >> 2] | 0) != 285) {
    12812. 

  12812.      _error_expected(i4, 285);
    12813. 

  12813.     }
    12814. 

  12814.     _luaX_next(i4);
    12815. 

  12815.     i8 = HEAP32[i15 + 20 >> 2] | 0;
    12816. 

  12816.     i15 = HEAP32[i13 >> 2] | 0;
    12817. 

  12817.     i14 = i14 + 32 | 0;
    12818. 

  12818.     if ((i15 | 0) < (HEAP32[i14 >> 2] | 0)) {
    12819. 

  12819.      i14 = HEAP32[i12 >> 2] | 0;
    12820. 

  12820.     } else {
    12821. 

  12821.      i14 = _luaM_growaux_(HEAP32[i1 >> 2] | 0, HEAP32[i12 >> 2] | 0, i14, 16, 32767, 6312) | 0;
    12822. 

  12822.      HEAP32[i12 >> 2] = i14;
    12823. 

  12823.     }
    12824. 

  12824.     HEAP32[i14 + (i15 << 4) >> 2] = i10;
    12825. 

  12825.     i29 = HEAP32[i12 >> 2] | 0;
    12826. 

  12826.     HEAP32[i29 + (i15 << 4) + 8 >> 2] = i6;
    12827. 

  12827.     HEAP8[i29 + (i15 << 4) + 12 | 0] = HEAP8[(HEAP32[i3 >> 2] | 0) + 46 | 0] | 0;
    12828. 

  12828.     HEAP32[(HEAP32[i12 >> 2] | 0) + (i15 << 4) + 4 >> 2] = i8;
    12829. 

  12829.     HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + 1;
    12830. 

  12830.     L152 : while (1) {
    12831. 

  12831.      switch (HEAP32[i5 >> 2] | 0) {
    12832. 

  12832.      case 285:
    12833. 

  12833.      case 59:
    12834. 

  12834.       {
    12835. 

  12835.        break;
    12836. 

  12836.       }
    12837. 

  12837.      case 286:
    12838. 

  12838.      case 262:
    12839. 

  12839.      case 261:
    12840. 

  12840.      case 260:
    12841. 

  12841.       {
    12842. 

  12842.        i7 = 108;
    12843. 

  12843.        break L152;
    12844. 

  12844.       }
    12845. 

  12845.      default:
    12846. 

  12846.       {
    12847. 

  12847.        break L152;
    12848. 

  12848.       }
    12849. 

  12849.      }
    12850. 

  12850.      _statement(i4);
    12851. 

  12851.     }
    12852. 

  12852.     if ((i7 | 0) == 108) {
    12853. 

  12853.      HEAP8[(HEAP32[i12 >> 2] | 0) + (i15 << 4) + 12 | 0] = HEAP8[(HEAP32[i11 >> 2] | 0) + 8 | 0] | 0;
    12854. 

  12854.     }
    12855. 

  12855.     i5 = (HEAP32[i12 >> 2] | 0) + (i15 << 4) | 0;
    12856. 

  12856.     i8 = HEAP32[i9 >> 2] | 0;
    12857. 

  12857.     i7 = HEAP16[(HEAP32[(HEAP32[i3 >> 2] | 0) + 16 >> 2] | 0) + 6 >> 1] | 0;
    12858. 

  12858.     i6 = i8 + 16 | 0;
    12859. 

  12859.     if ((i7 | 0) < (HEAP32[i6 >> 2] | 0)) {
    12860. 

  12860.      i8 = i8 + 12 | 0;
    12861. 

  12861.      do {
    12862. 

  12862.       while (1) {
    12863. 

  12863.        if ((_luaS_eqstr(HEAP32[(HEAP32[i8 >> 2] | 0) + (i7 << 4) >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0) == 0) {
    12864. 

  12864.         break;
    12865. 

  12865.        }
    12866. 

  12866.        _closegoto(i4, i7, i5);
    12867. 

  12867.        if ((i7 | 0) >= (HEAP32[i6 >> 2] | 0)) {
    12868. 

  12868.         break L8;
    12869. 

  12869.        }
    12870. 

  12870.       }
    12871. 

  12871.       i7 = i7 + 1 | 0;
    12872. 

  12872.      } while ((i7 | 0) < (HEAP32[i6 >> 2] | 0));
    12873. 

  12873.     }
    12874. 

  12874.     break;
    12875. 

  12875.    }
    12876. 

  12876.   case 274:
    12877. 

  12877.    {
    12878. 

  12878.     _luaX_next(i4);
    12879. 

  12879.     i6 = HEAP32[i3 >> 2] | 0;
    12880. 

  12880.     L166 : do {
    12881. 

  12881.      switch (HEAP32[i5 >> 2] | 0) {
    12882. 

  12882.      case 59:
    12883. 

  12883.      case 277:
    12884. 

  12884.      case 286:
    12885. 

  12885.      case 262:
    12886. 

  12886.      case 261:
    12887. 

  12887.      case 260:
    12888. 

  12888.       {
    12889. 

  12889.        i8 = 0;
    12890. 

  12890.        i7 = 0;
    12891. 

  12891.        break;
    12892. 

  12892.       }
    12893. 

  12893.      default:
    12894. 

  12894.       {
    12895. 

  12895.        _subexpr(i4, i24, 0) | 0;
    12896. 

  12896.        if ((HEAP32[i5 >> 2] | 0) == 44) {
    12897. 

  12897.         i7 = 1;
    12898. 

  12898.         do {
    12899. 

  12899.          _luaX_next(i4);
    12900. 

  12900.          _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i24);
    12901. 

  12901.          _subexpr(i4, i24, 0) | 0;
    12902. 

  12902.          i7 = i7 + 1 | 0;
    12903. 

  12903.         } while ((HEAP32[i5 >> 2] | 0) == 44);
    12904. 

  12904.        } else {
    12905. 

  12905.         i7 = 1;
    12906. 

  12906.        }
    12907. 

  12907.        if (!(((HEAP32[i24 >> 2] | 0) + -12 | 0) >>> 0 < 2)) {
    12908. 

  12908.         if ((i7 | 0) == 1) {
    12909. 

  12909.          i8 = _luaK_exp2anyreg(i6, i24) | 0;
    12910. 

  12910.          i7 = 1;
    12911. 

  12911.          break L166;
    12912. 

  12912.         } else {
    12913. 

  12913.          _luaK_exp2nextreg(i6, i24);
    12914. 

  12914.          i8 = HEAPU8[i6 + 46 | 0] | 0;
    12915. 

  12915.          break L166;
    12916. 

  12916.         }
    12917. 

  12917.        } else {
    12918. 

  12918.         _luaK_setreturns(i6, i24, -1);
    12919. 

  12919.         if ((HEAP32[i24 >> 2] | 0) == 12 & (i7 | 0) == 1) {
    12920. 

  12920.          i29 = (HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i24 + 8 >> 2] << 2) | 0;
    12921. 

  12921.          HEAP32[i29 >> 2] = HEAP32[i29 >> 2] & -64 | 30;
    12922. 

  12922.         }
    12923. 

  12923.         i8 = HEAPU8[i6 + 46 | 0] | 0;
    12924. 

  12924.         i7 = -1;
    12925. 

  12925.         break L166;
    12926. 

  12926.        }
    12927. 

  12927.       }
    12928. 

  12928.      }
    12929. 

  12929.     } while (0);
    12930. 

  12930.     _luaK_ret(i6, i8, i7);
    12931. 

  12931.     if ((HEAP32[i5 >> 2] | 0) == 59) {
    12932. 

  12932.      _luaX_next(i4);
    12933. 

  12933.     }
    12934. 

  12934.     break;
    12935. 

  12935.    }
    12936. 

  12936.   case 266:
    12937. 

  12937.   case 258:
    12938. 

  12938.    {
    12939. 

  12939.     i6 = _luaK_jump(i9) | 0;
    12940. 

  12940.     i7 = HEAP32[i19 >> 2] | 0;
    12941. 

  12941.     i29 = (HEAP32[i5 >> 2] | 0) == 266;
    12942. 

  12942.     _luaX_next(i4);
    12943. 

  12943.     do {
    12944. 

  12944.      if (i29) {
    12945. 

  12945.       if ((HEAP32[i5 >> 2] | 0) == 288) {
    12946. 

  12946.        i23 = HEAP32[i4 + 24 >> 2] | 0;
    12947. 

  12947.        _luaX_next(i4);
    12948. 

  12948.        break;
    12949. 

  12949.       } else {
    12950. 

  12950.        _error_expected(i4, 288);
    12951. 

  12951.       }
    12952. 

  12952.      } else {
    12953. 

  12953.       i23 = _luaS_new(HEAP32[i1 >> 2] | 0, 6304) | 0;
    12954. 

  12954.      }
    12955. 

  12955.     } while (0);
    12956. 

  12956.     i10 = HEAP32[i4 + 64 >> 2] | 0;
    12957. 

  12957.     i9 = i10 + 12 | 0;
    12958. 

  12958.     i5 = i10 + 16 | 0;
    12959. 

  12959.     i8 = HEAP32[i5 >> 2] | 0;
    12960. 

  12960.     i10 = i10 + 20 | 0;
    12961. 

  12961.     if ((i8 | 0) < (HEAP32[i10 >> 2] | 0)) {
    12962. 

  12962.      i10 = HEAP32[i9 >> 2] | 0;
    12963. 

  12963.     } else {
    12964. 

  12964.      i10 = _luaM_growaux_(HEAP32[i1 >> 2] | 0, HEAP32[i9 >> 2] | 0, i10, 16, 32767, 6312) | 0;
    12965. 

  12965.      HEAP32[i9 >> 2] = i10;
    12966. 

  12966.     }
    12967. 

  12967.     HEAP32[i10 + (i8 << 4) >> 2] = i23;
    12968. 

  12968.     i29 = HEAP32[i9 >> 2] | 0;
    12969. 

  12969.     HEAP32[i29 + (i8 << 4) + 8 >> 2] = i7;
    12970. 

  12970.     HEAP8[i29 + (i8 << 4) + 12 | 0] = HEAP8[(HEAP32[i3 >> 2] | 0) + 46 | 0] | 0;
    12971. 

  12971.     HEAP32[(HEAP32[i9 >> 2] | 0) + (i8 << 4) + 4 >> 2] = i6;
    12972. 

  12972.     HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
    12973. 

  12973.     _findlabel(i4, i8) | 0;
    12974. 

  12974.     break;
    12975. 

  12975.    }
    12976. 

  12976.   default:
    12977. 

  12977.    {
    12978. 

  12978.     i6 = i8 + 8 | 0;
    12979. 

  12979.     _suffixedexp(i4, i6);
    12980. 

  12980.     i29 = HEAP32[i5 >> 2] | 0;
    12981. 

  12981.     if ((i29 | 0) == 44 | (i29 | 0) == 61) {
    12982. 

  12982.      HEAP32[i8 >> 2] = 0;
    12983. 

  12983.      _assignment(i4, i8, 1);
    12984. 

  12984.      break L8;
    12985. 

  12985.     }
    12986. 

  12986.     if ((HEAP32[i6 >> 2] | 0) == 12) {
    12987. 

  12987.      i29 = (HEAP32[(HEAP32[i9 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i8 + 16 >> 2] << 2) | 0;
    12988. 

  12988.      HEAP32[i29 >> 2] = HEAP32[i29 >> 2] & -8372225 | 16384;
    12989. 

  12989.      break L8;
    12990. 

  12990.     } else {
    12991. 

  12991.      _luaX_syntaxerror(i4, 6344);
    12992. 

  12992.     }
    12993. 

  12993.    }
    12994. 

  12994.   }
    12995. 

  12995.  } while (0);
    12996. 

  12996.  i29 = HEAP32[i3 >> 2] | 0;
    12997. 

  12997.  HEAP8[i29 + 48 | 0] = HEAP8[i29 + 46 | 0] | 0;
    12998. 

  12998.  i29 = (HEAP32[i1 >> 2] | 0) + 38 | 0;
    12999. 

  12999.  HEAP16[i29 >> 1] = (HEAP16[i29 >> 1] | 0) + -1 << 16 >> 16;
    13000. 

  13000.  STACKTOP = i2;
    13001. 

  13001.  return;
    13002. 

  13002. }
    13003. 

  13003. function _match(i1, i12, i11) {
    13004. 

  13004.  i1 = i1 | 0;
    13005. 

  13005.  i12 = i12 | 0;
    13006. 

  13006.  i11 = i11 | 0;
    13007. 

  13007.  var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
    13008. 

  13008.  i2 = STACKTOP;
    13009. 

  13009.  STACKTOP = STACKTOP + 16 | 0;
    13010. 

  13010.  i8 = i2;
    13011. 

  13011.  i32 = HEAP32[i1 >> 2] | 0;
    13012. 

  13012.  HEAP32[i1 >> 2] = i32 + -1;
    13013. 

  13013.  if ((i32 | 0) == 0) {
    13014. 

  13014.   _luaL_error(HEAP32[i1 + 16 >> 2] | 0, 7272, i8) | 0;
    13015. 

  13015.  }
    13016. 

  13016.  i14 = i1 + 12 | 0;
    13017. 

  13017.  i22 = HEAP32[i14 >> 2] | 0;
    13018. 

  13018.  L4 : do {
    13019. 

  13019.   if ((i22 | 0) != (i11 | 0)) {
    13020. 

  13020.    i3 = i1 + 8 | 0;
    13021. 

  13021.    i9 = i1 + 16 | 0;
    13022. 

  13022.    i16 = i1 + 4 | 0;
    13023. 

  13023.    i10 = i1 + 20 | 0;
    13024. 

  13024.    L6 : while (1) {
    13025. 

  13025.     i19 = i12 + 1 | 0;
    13026. 

  13026.     i20 = i12 + -1 | 0;
    13027. 

  13027.     L8 : while (1) {
    13028. 

  13028.      i23 = HEAP8[i11] | 0;
    13029. 

  13029.      i21 = i23 << 24 >> 24;
    13030. 

  13030.      L10 : do {
    13031. 

  13031.       if ((i21 | 0) == 36) {
    13032. 

  13032.        i7 = i11 + 1 | 0;
    13033. 

  13033.        if ((i7 | 0) == (i22 | 0)) {
    13034. 

  13034.         i7 = 23;
    13035. 

  13035.         break L6;
    13036. 

  13036.        } else {
    13037. 

  13037.         i22 = i7;
    13038. 

  13038.         i21 = i7;
    13039. 

  13039.         i7 = 89;
    13040. 

  13040.        }
    13041. 

  13041.       } else if ((i21 | 0) == 37) {
    13042. 

  13042.        i21 = i11 + 1 | 0;
    13043. 

  13043.        i23 = HEAP8[i21] | 0;
    13044. 

  13044.        switch (i23 << 24 >> 24 | 0) {
    13045. 

  13045.        case 57:
    13046. 

  13046.        case 56:
    13047. 

  13047.        case 55:
    13048. 

  13048.        case 54:
    13049. 

  13049.        case 53:
    13050. 

  13050.        case 52:
    13051. 

  13051.        case 51:
    13052. 

  13052.        case 50:
    13053. 

  13053.        case 49:
    13054. 

  13054.        case 48:
    13055. 

  13055.         {
    13056. 

  13056.          i7 = 69;
    13057. 

  13057.          break L8;
    13058. 

  13058.         }
    13059. 

  13059.        case 98:
    13060. 

  13060.         {
    13061. 

  13061.          i7 = 25;
    13062. 

  13062.          break L8;
    13063. 

  13063.         }
    13064. 

  13064.        case 102:
    13065. 

  13065.         {
    13066. 

  13066.          break;
    13067. 

  13067.         }
    13068. 

  13068.        default:
    13069. 

  13069.         {
    13070. 

  13070.          if ((i21 | 0) == (i22 | 0)) {
    13071. 

  13071.           _luaL_error(HEAP32[i9 >> 2] | 0, 7368, i8) | 0;
    13072. 

  13072.          }
    13073. 

  13073.          i22 = i11 + 2 | 0;
    13074. 

  13074.          i7 = 89;
    13075. 

  13075.          break L10;
    13076. 

  13076.         }
    13077. 

  13077.        }
    13078. 

  13078.        i22 = i11 + 2 | 0;
    13079. 

  13079.        if ((HEAP8[i22] | 0) == 91) {
    13080. 

  13080.         i21 = 91;
    13081. 

  13081.        } else {
    13082. 

  13082.         _luaL_error(HEAP32[i9 >> 2] | 0, 7296, i8) | 0;
    13083. 

  13083.         i21 = HEAP8[i22] | 0;
    13084. 

  13084.        }
    13085. 

  13085.        i23 = i11 + 3 | 0;
    13086. 

  13086.        i21 = i21 << 24 >> 24;
    13087. 

  13087.        if ((i21 | 0) == 91) {
    13088. 

  13088.         i21 = (HEAP8[i23] | 0) == 94 ? i11 + 4 | 0 : i23;
    13089. 

  13089.         while (1) {
    13090. 

  13090.          if ((i21 | 0) == (HEAP32[i14 >> 2] | 0)) {
    13091. 

  13091.           _luaL_error(HEAP32[i9 >> 2] | 0, 7408, i8) | 0;
    13092. 

  13092.          }
    13093. 

  13093.          i11 = i21 + 1 | 0;
    13094. 

  13094.          if ((HEAP8[i21] | 0) == 37) {
    13095. 

  13095.           i11 = i11 >>> 0 < (HEAP32[i14 >> 2] | 0) >>> 0 ? i21 + 2 | 0 : i11;
    13096. 

  13096.          }
    13097. 

  13097.          if ((HEAP8[i11] | 0) == 93) {
    13098. 

  13098.           break;
    13099. 

  13099.          } else {
    13100. 

  13100.           i21 = i11;
    13101. 

  13101.          }
    13102. 

  13102.         }
    13103. 

  13103.         i11 = i11 + 1 | 0;
    13104. 

  13104.        } else if ((i21 | 0) == 37) {
    13105. 

  13105.         if ((i23 | 0) == (HEAP32[i14 >> 2] | 0)) {
    13106. 

  13106.          _luaL_error(HEAP32[i9 >> 2] | 0, 7368, i8) | 0;
    13107. 

  13107.         }
    13108. 

  13108.         i11 = i11 + 4 | 0;
    13109. 

  13109.        } else {
    13110. 

  13110.         i11 = i23;
    13111. 

  13111.        }
    13112. 

  13112.        if ((i12 | 0) == (HEAP32[i16 >> 2] | 0)) {
    13113. 

  13113.         i25 = 0;
    13114. 

  13114.        } else {
    13115. 

  13115.         i25 = HEAP8[i20] | 0;
    13116. 

  13116.        }
    13117. 

  13117.        i24 = i25 & 255;
    13118. 

  13118.        i21 = i11 + -1 | 0;
    13119. 

  13119.        i26 = (HEAP8[i23] | 0) == 94;
    13120. 

  13120.        i28 = i26 ? i23 : i22;
    13121. 

  13121.        i27 = i26 & 1;
    13122. 

  13122.        i26 = i27 ^ 1;
    13123. 

  13123.        i30 = i28 + 1 | 0;
    13124. 

  13124.        L41 : do {
    13125. 

  13125.         if (i30 >>> 0 < i21 >>> 0) {
    13126. 

  13126.          while (1) {
    13127. 

  13127.           i32 = HEAP8[i30] | 0;
    13128. 

  13128.           i29 = i28 + 2 | 0;
    13129. 

  13129.           i31 = HEAP8[i29] | 0;
    13130. 

  13130.           do {
    13131. 

  13131.            if (i32 << 24 >> 24 == 37) {
    13132. 

  13132.             if ((_match_class(i24, i31 & 255) | 0) == 0) {
    13133. 

  13133.              i28 = i29;
    13134. 

  13134.             } else {
    13135. 

  13135.              break L41;
    13136. 

  13136.             }
    13137. 

  13137.            } else {
    13138. 

  13138.             if (i31 << 24 >> 24 == 45 ? (i18 = i28 + 3 | 0, i18 >>> 0 < i21 >>> 0) : 0) {
    13139. 

  13139.              if ((i32 & 255) > (i25 & 255)) {
    13140. 

  13140.               i28 = i18;
    13141. 

  13141.               break;
    13142. 

  13142.              }
    13143. 

  13143.              if ((HEAPU8[i18] | 0) < (i25 & 255)) {
    13144. 

  13144.               i28 = i18;
    13145. 

  13145.               break;
    13146. 

  13146.              } else {
    13147. 

  13147.               break L41;
    13148. 

  13148.              }
    13149. 

  13149.             }
    13150. 

  13150.             if (i32 << 24 >> 24 == i25 << 24 >> 24) {
    13151. 

  13151.              break L41;
    13152. 

  13152.             } else {
    13153. 

  13153.              i28 = i30;
    13154. 

  13154.             }
    13155. 

  13155.            }
    13156. 

  13156.           } while (0);
    13157. 

  13157.           i30 = i28 + 1 | 0;
    13158. 

  13158.           if (!(i30 >>> 0 < i21 >>> 0)) {
    13159. 

  13159.            i26 = i27;
    13160. 

  13160.            break;
    13161. 

  13161.           }
    13162. 

  13162.          }
    13163. 

  13163.         } else {
    13164. 

  13164.          i26 = i27;
    13165. 

  13165.         }
    13166. 

  13166.        } while (0);
    13167. 

  13167.        if ((i26 | 0) != 0) {
    13168. 

  13168.         i12 = 0;
    13169. 

  13169.         break L4;
    13170. 

  13170.        }
    13171. 

  13171.        i24 = HEAP8[i12] | 0;
    13172. 

  13172.        i25 = i24 & 255;
    13173. 

  13173.        i27 = (HEAP8[i23] | 0) == 94;
    13174. 

  13174.        i26 = i27 ? i23 : i22;
    13175. 

  13175.        i22 = i27 & 1;
    13176. 

  13176.        i23 = i22 ^ 1;
    13177. 

  13177.        i30 = i26 + 1 | 0;
    13178. 

  13178.        L55 : do {
    13179. 

  13179.         if (i30 >>> 0 < i21 >>> 0) {
    13180. 

  13180.          do {
    13181. 

  13181.           i29 = HEAP8[i30] | 0;
    13182. 

  13182.           i28 = i26 + 2 | 0;
    13183. 

  13183.           i27 = HEAP8[i28] | 0;
    13184. 

  13184.           do {
    13185. 

  13185.            if (i29 << 24 >> 24 == 37) {
    13186. 

  13186.             if ((_match_class(i25, i27 & 255) | 0) == 0) {
    13187. 

  13187.              i26 = i28;
    13188. 

  13188.             } else {
    13189. 

  13189.              i22 = i23;
    13190. 

  13190.              break L55;
    13191. 

  13191.             }
    13192. 

  13192.            } else {
    13193. 

  13193.             if (i27 << 24 >> 24 == 45 ? (i17 = i26 + 3 | 0, i17 >>> 0 < i21 >>> 0) : 0) {
    13194. 

  13194.              if ((i29 & 255) > (i24 & 255)) {
    13195. 

  13195.               i26 = i17;
    13196. 

  13196.               break;
    13197. 

  13197.              }
    13198. 

  13198.              if ((HEAPU8[i17] | 0) < (i24 & 255)) {
    13199. 

  13199.               i26 = i17;
    13200. 

  13200.               break;
    13201. 

  13201.              } else {
    13202. 

  13202.               i22 = i23;
    13203. 

  13203.               break L55;
    13204. 

  13204.              }
    13205. 

  13205.             }
    13206. 

  13206.             if (i29 << 24 >> 24 == i24 << 24 >> 24) {
    13207. 

  13207.              i22 = i23;
    13208. 

  13208.              break L55;
    13209. 

  13209.             } else {
    13210. 

  13210.              i26 = i30;
    13211. 

  13211.             }
    13212. 

  13212.            }
    13213. 

  13213.           } while (0);
    13214. 

  13214.           i30 = i26 + 1 | 0;
    13215. 

  13215.          } while (i30 >>> 0 < i21 >>> 0);
    13216. 

  13216.         }
    13217. 

  13217.        } while (0);
    13218. 

  13218.        if ((i22 | 0) == 0) {
    13219. 

  13219.         i12 = 0;
    13220. 

  13220.         break L4;
    13221. 

  13221.        }
    13222. 

  13222.       } else if ((i21 | 0) == 40) {
    13223. 

  13223.        i7 = 7;
    13224. 

  13224.        break L6;
    13225. 

  13225.       } else if ((i21 | 0) != 41) {
    13226. 

  13226.        i21 = i11 + 1 | 0;
    13227. 

  13227.        if (i23 << 24 >> 24 == 91) {
    13228. 

  13228.         i7 = (HEAP8[i21] | 0) == 94 ? i11 + 2 | 0 : i21;
    13229. 

  13229.         while (1) {
    13230. 

  13230.          if ((i7 | 0) == (i22 | 0)) {
    13231. 

  13231.           _luaL_error(HEAP32[i9 >> 2] | 0, 7408, i8) | 0;
    13232. 

  13232.          }
    13233. 

  13233.          i22 = i7 + 1 | 0;
    13234. 

  13234.          if ((HEAP8[i7] | 0) == 37) {
    13235. 

  13235.           i7 = i22 >>> 0 < (HEAP32[i14 >> 2] | 0) >>> 0 ? i7 + 2 | 0 : i22;
    13236. 

  13236.          } else {
    13237. 

  13237.           i7 = i22;
    13238. 

  13238.          }
    13239. 

  13239.          if ((HEAP8[i7] | 0) == 93) {
    13240. 

  13240.           break;
    13241. 

  13241.          }
    13242. 

  13242.          i22 = HEAP32[i14 >> 2] | 0;
    13243. 

  13243.         }
    13244. 

  13244.         i22 = i7 + 1 | 0;
    13245. 

  13245.         i7 = 89;
    13246. 

  13246.        } else {
    13247. 

  13247.         i22 = i21;
    13248. 

  13248.         i7 = 89;
    13249. 

  13249.        }
    13250. 

  13250.       } else {
    13251. 

  13251.        i7 = 16;
    13252. 

  13252.        break L6;
    13253. 

  13253.       }
    13254. 

  13254.      } while (0);
    13255. 

  13255.      L80 : do {
    13256. 

  13256.       if ((i7 | 0) == 89) {
    13257. 

  13257.        i7 = 0;
    13258. 

  13258.        do {
    13259. 

  13259.         if ((HEAP32[i3 >> 2] | 0) >>> 0 > i12 >>> 0) {
    13260. 

  13260.          i23 = HEAP8[i12] | 0;
    13261. 

  13261.          i24 = i23 & 255;
    13262. 

  13262.          i26 = HEAP8[i11] | 0;
    13263. 

  13263.          i25 = i26 << 24 >> 24;
    13264. 

  13264.          L85 : do {
    13265. 

  13265.           if ((i25 | 0) == 46) {
    13266. 

  13266.            i23 = HEAP8[i22] | 0;
    13267. 

  13267.           } else if ((i25 | 0) == 37) {
    13268. 

  13268.            i25 = _match_class(i24, HEAPU8[i21] | 0) | 0;
    13269. 

  13269.            i7 = 104;
    13270. 

  13270.           } else if ((i25 | 0) == 91) {
    13271. 

  13271.            i7 = i22 + -1 | 0;
    13272. 

  13272.            i25 = (HEAP8[i21] | 0) == 94;
    13273. 

  13273.            i27 = i25 ? i21 : i11;
    13274. 

  13274.            i26 = i25 & 1;
    13275. 

  13275.            i25 = i26 ^ 1;
    13276. 

  13276.            i30 = i27 + 1 | 0;
    13277. 

  13277.            if (i30 >>> 0 < i7 >>> 0) {
    13278. 

  13278.             while (1) {
    13279. 

  13279.              i31 = HEAP8[i30] | 0;
    13280. 

  13280.              i29 = i27 + 2 | 0;
    13281. 

  13281.              i28 = HEAP8[i29] | 0;
    13282. 

  13282.              do {
    13283. 

  13283.               if (i31 << 24 >> 24 == 37) {
    13284. 

  13284.                if ((_match_class(i24, i28 & 255) | 0) == 0) {
    13285. 

  13285.                 i27 = i29;
    13286. 

  13286.                } else {
    13287. 

  13287.                 i7 = 104;
    13288. 

  13288.                 break L85;
    13289. 

  13289.                }
    13290. 

  13290.               } else {
    13291. 

  13291.                if (i28 << 24 >> 24 == 45 ? (i13 = i27 + 3 | 0, i13 >>> 0 < i7 >>> 0) : 0) {
    13292. 

  13292.                 if ((i31 & 255) > (i23 & 255)) {
    13293. 

  13293.                  i27 = i13;
    13294. 

  13294.                  break;
    13295. 

  13295.                 }
    13296. 

  13296.                 if ((HEAPU8[i13] | 0) < (i23 & 255)) {
    13297. 

  13297.                  i27 = i13;
    13298. 

  13298.                  break;
    13299. 

  13299.                 } else {
    13300. 

  13300.                  i7 = 104;
    13301. 

  13301.                  break L85;
    13302. 

  13302.                 }
    13303. 

  13303.                }
    13304. 

  13304.                if (i31 << 24 >> 24 == i23 << 24 >> 24) {
    13305. 

  13305.                 i7 = 104;
    13306. 

  13306.                 break L85;
    13307. 

  13307.                } else {
    13308. 

  13308.                 i27 = i30;
    13309. 

  13309.                }
    13310. 

  13310.               }
    13311. 

  13311.              } while (0);
    13312. 

  13312.              i30 = i27 + 1 | 0;
    13313. 

  13313.              if (!(i30 >>> 0 < i7 >>> 0)) {
    13314. 

  13314.               i25 = i26;
    13315. 

  13315.               i7 = 104;
    13316. 

  13316.               break;
    13317. 

  13317.              }
    13318. 

  13318.             }
    13319. 

  13319.            } else {
    13320. 

  13320.             i25 = i26;
    13321. 

  13321.             i7 = 104;
    13322. 

  13322.            }
    13323. 

  13323.           } else {
    13324. 

  13324.            i25 = i26 << 24 >> 24 == i23 << 24 >> 24 | 0;
    13325. 

  13325.            i7 = 104;
    13326. 

  13326.           }
    13327. 

  13327.          } while (0);
    13328. 

  13328.          if ((i7 | 0) == 104) {
    13329. 

  13329.           i7 = 0;
    13330. 

  13330.           i23 = HEAP8[i22] | 0;
    13331. 

  13331.           if ((i25 | 0) == 0) {
    13332. 

  13332.            break;
    13333. 

  13333.           }
    13334. 

  13334.          }
    13335. 

  13335.          i23 = i23 << 24 >> 24;
    13336. 

  13336.          if ((i23 | 0) == 45) {
    13337. 

  13337.           i7 = 109;
    13338. 

  13338.           break L6;
    13339. 

  13339.          } else if ((i23 | 0) == 42) {
    13340. 

  13340.           i7 = 112;
    13341. 

  13341.           break L6;
    13342. 

  13342.          } else if ((i23 | 0) == 43) {
    13343. 

  13343.           break L6;
    13344. 

  13344.          } else if ((i23 | 0) != 63) {
    13345. 

  13345.           i12 = i19;
    13346. 

  13346.           i11 = i22;
    13347. 

  13347.           break L8;
    13348. 

  13348.          }
    13349. 

  13349.          i11 = i22 + 1 | 0;
    13350. 

  13350.          i21 = _match(i1, i19, i11) | 0;
    13351. 

  13351.          if ((i21 | 0) == 0) {
    13352. 

  13352.           break L80;
    13353. 

  13353.          } else {
    13354. 

  13354.           i12 = i21;
    13355. 

  13355.           break L4;
    13356. 

  13356.          }
    13357. 

  13357.         } else {
    13358. 

  13358.          i23 = HEAP8[i22] | 0;
    13359. 

  13359.         }
    13360. 

  13360.        } while (0);
    13361. 

  13361.        if (!(i23 << 24 >> 24 == 45 | i23 << 24 >> 24 == 63 | i23 << 24 >> 24 == 42)) {
    13362. 

  13362.         i12 = 0;
    13363. 

  13363.         break L4;
    13364. 

  13364.        }
    13365. 

  13365.        i11 = i22 + 1 | 0;
    13366. 

  13366.       }
    13367. 

  13367.      } while (0);
    13368. 

  13368.      i22 = HEAP32[i14 >> 2] | 0;
    13369. 

  13369.      if ((i11 | 0) == (i22 | 0)) {
    13370. 

  13370.       break L4;
    13371. 

  13371.      }
    13372. 

  13372.     }
    13373. 

  13373.     if ((i7 | 0) == 25) {
    13374. 

  13374.      i7 = 0;
    13375. 

  13375.      i21 = i11 + 2 | 0;
    13376. 

  13376.      if (!((i22 + -1 | 0) >>> 0 > i21 >>> 0)) {
    13377. 

  13377.       _luaL_error(HEAP32[i9 >> 2] | 0, 7440, i8) | 0;
    13378. 

  13378.      }
    13379. 

  13379.      i20 = HEAP8[i12] | 0;
    13380. 

  13380.      if (!(i20 << 24 >> 24 == (HEAP8[i21] | 0))) {
    13381. 

  13381.       i12 = 0;
    13382. 

  13382.       break L4;
    13383. 

  13383.      }
    13384. 

  13384.      i21 = HEAP8[i11 + 3 | 0] | 0;
    13385. 

  13385.      i22 = HEAP32[i3 >> 2] | 0;
    13386. 

  13386.      if (i19 >>> 0 < i22 >>> 0) {
    13387. 

  13387.       i24 = 1;
    13388. 

  13388.      } else {
    13389. 

  13389.       i12 = 0;
    13390. 

  13390.       break L4;
    13391. 

  13391.      }
    13392. 

  13392.      while (1) {
    13393. 

  13393.       i23 = HEAP8[i19] | 0;
    13394. 

  13394.       if (i23 << 24 >> 24 == i21 << 24 >> 24) {
    13395. 

  13395.        i24 = i24 + -1 | 0;
    13396. 

  13396.        if ((i24 | 0) == 0) {
    13397. 

  13397.         break;
    13398. 

  13398.        }
    13399. 

  13399.       } else {
    13400. 

  13400.        i24 = (i23 << 24 >> 24 == i20 << 24 >> 24) + i24 | 0;
    13401. 

  13401.       }
    13402. 

  13402.       i12 = i19 + 1 | 0;
    13403. 

  13403.       if (i12 >>> 0 < i22 >>> 0) {
    13404. 

  13404.        i32 = i19;
    13405. 

  13405.        i19 = i12;
    13406. 

  13406.        i12 = i32;
    13407. 

  13407.       } else {
    13408. 

  13408.        i12 = 0;
    13409. 

  13409.        break L4;
    13410. 

  13410.       }
    13411. 

  13411.      }
    13412. 

  13412.      i12 = i12 + 2 | 0;
    13413. 

  13413.      i11 = i11 + 4 | 0;
    13414. 

  13414.     } else if ((i7 | 0) == 69) {
    13415. 

  13415.      i7 = 0;
    13416. 

  13416.      i20 = i23 & 255;
    13417. 

  13417.      i19 = i20 + -49 | 0;
    13418. 

  13418.      if (((i19 | 0) >= 0 ? (i19 | 0) < (HEAP32[i10 >> 2] | 0) : 0) ? (i15 = HEAP32[i1 + (i19 << 3) + 28 >> 2] | 0, !((i15 | 0) == -1)) : 0) {
    13419. 

  13419.       i20 = i15;
    13420. 

  13420.      } else {
    13421. 

  13421.       i19 = HEAP32[i9 >> 2] | 0;
    13422. 

  13422.       HEAP32[i8 >> 2] = i20 + -48;
    13423. 

  13423.       i20 = _luaL_error(i19, 7336, i8) | 0;
    13424. 

  13424.       i19 = i20;
    13425. 

  13425.       i20 = HEAP32[i1 + (i20 << 3) + 28 >> 2] | 0;
    13426. 

  13426.      }
    13427. 

  13427.      if (((HEAP32[i3 >> 2] | 0) - i12 | 0) >>> 0 < i20 >>> 0) {
    13428. 

  13428.       i12 = 0;
    13429. 

  13429.       break L4;
    13430. 

  13430.      }
    13431. 

  13431.      if ((_memcmp(HEAP32[i1 + (i19 << 3) + 24 >> 2] | 0, i12, i20) | 0) != 0) {
    13432. 

  13432.       i12 = 0;
    13433. 

  13433.       break L4;
    13434. 

  13434.      }
    13435. 

  13435.      i12 = i12 + i20 | 0;
    13436. 

  13436.      if ((i12 | 0) == 0) {
    13437. 

  13437.       i12 = 0;
    13438. 

  13438.       break L4;
    13439. 

  13439.      }
    13440. 

  13440.      i11 = i11 + 2 | 0;
    13441. 

  13441.     }
    13442. 

  13442.     i22 = HEAP32[i14 >> 2] | 0;
    13443. 

  13443.     if ((i11 | 0) == (i22 | 0)) {
    13444. 

  13444.      break L4;
    13445. 

  13445.     }
    13446. 

  13446.    }
    13447. 

  13447.    if ((i7 | 0) == 7) {
    13448. 

  13448.     i3 = i11 + 1 | 0;
    13449. 

  13449.     if ((HEAP8[i3] | 0) == 41) {
    13450. 

  13450.      i3 = HEAP32[i10 >> 2] | 0;
    13451. 

  13451.      if ((i3 | 0) > 31) {
    13452. 

  13452.       _luaL_error(HEAP32[i9 >> 2] | 0, 7200, i8) | 0;
    13453. 

  13453.      }
    13454. 

  13454.      HEAP32[i1 + (i3 << 3) + 24 >> 2] = i12;
    13455. 

  13455.      HEAP32[i1 + (i3 << 3) + 28 >> 2] = -2;
    13456. 

  13456.      HEAP32[i10 >> 2] = i3 + 1;
    13457. 

  13457.      i12 = _match(i1, i12, i11 + 2 | 0) | 0;
    13458. 

  13458.      if ((i12 | 0) != 0) {
    13459. 

  13459.       break;
    13460. 

  13460.      }
    13461. 

  13461.      HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
    13462. 

  13462.      i12 = 0;
    13463. 

  13463.      break;
    13464. 

  13464.     } else {
    13465. 

  13465.      i4 = HEAP32[i10 >> 2] | 0;
    13466. 

  13466.      if ((i4 | 0) > 31) {
    13467. 

  13467.       _luaL_error(HEAP32[i9 >> 2] | 0, 7200, i8) | 0;
    13468. 

  13468.      }
    13469. 

  13469.      HEAP32[i1 + (i4 << 3) + 24 >> 2] = i12;
    13470. 

  13470.      HEAP32[i1 + (i4 << 3) + 28 >> 2] = -1;
    13471. 

  13471.      HEAP32[i10 >> 2] = i4 + 1;
    13472. 

  13472.      i12 = _match(i1, i12, i3) | 0;
    13473. 

  13473.      if ((i12 | 0) != 0) {
    13474. 

  13474.       break;
    13475. 

  13475.      }
    13476. 

  13476.      HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
    13477. 

  13477.      i12 = 0;
    13478. 

  13478.      break;
    13479. 

  13479.     }
    13480. 

  13480.    } else if ((i7 | 0) == 16) {
    13481. 

  13481.     i3 = i11 + 1 | 0;
    13482. 

  13482.     i5 = HEAP32[i10 >> 2] | 0;
    13483. 

  13483.     while (1) {
    13484. 

  13484.      i4 = i5 + -1 | 0;
    13485. 

  13485.      if ((i5 | 0) <= 0) {
    13486. 

  13486.       i7 = 19;
    13487. 

  13487.       break;
    13488. 

  13488.      }
    13489. 

  13489.      if ((HEAP32[i1 + (i4 << 3) + 28 >> 2] | 0) == -1) {
    13490. 

  13490.       break;
    13491. 

  13491.      } else {
    13492. 

  13492.       i5 = i4;
    13493. 

  13493.      }
    13494. 

  13494.     }
    13495. 

  13495.     if ((i7 | 0) == 19) {
    13496. 

  13496.      i4 = _luaL_error(HEAP32[i9 >> 2] | 0, 7488, i8) | 0;
    13497. 

  13497.     }
    13498. 

  13498.     i5 = i1 + (i4 << 3) + 28 | 0;
    13499. 

  13499.     HEAP32[i5 >> 2] = i12 - (HEAP32[i1 + (i4 << 3) + 24 >> 2] | 0);
    13500. 

  13500.     i12 = _match(i1, i12, i3) | 0;
    13501. 

  13501.     if ((i12 | 0) != 0) {
    13502. 

  13502.      break;
    13503. 

  13503.     }
    13504. 

  13504.     HEAP32[i5 >> 2] = -1;
    13505. 

  13505.     i12 = 0;
    13506. 

  13506.     break;
    13507. 

  13507.    } else if ((i7 | 0) == 23) {
    13508. 

  13508.     i12 = (i12 | 0) == (HEAP32[i3 >> 2] | 0) ? i12 : 0;
    13509. 

  13509.     break;
    13510. 

  13510.    } else if ((i7 | 0) == 109) {
    13511. 

  13511.     i4 = i22 + 1 | 0;
    13512. 

  13512.     i8 = _match(i1, i12, i4) | 0;
    13513. 

  13513.     if ((i8 | 0) != 0) {
    13514. 

  13514.      i12 = i8;
    13515. 

  13515.      break;
    13516. 

  13516.     }
    13517. 

  13517.     i8 = i22 + -1 | 0;
    13518. 

  13518.     while (1) {
    13519. 

  13519.      if (!((HEAP32[i3 >> 2] | 0) >>> 0 > i12 >>> 0)) {
    13520. 

  13520.       i12 = 0;
    13521. 

  13521.       break L4;
    13522. 

  13522.      }
    13523. 

  13523.      i9 = HEAP8[i12] | 0;
    13524. 

  13524.      i10 = i9 & 255;
    13525. 

  13525.      i14 = HEAP8[i11] | 0;
    13526. 

  13526.      i13 = i14 << 24 >> 24;
    13527. 

  13527.      L139 : do {
    13528. 

  13528.       if ((i13 | 0) == 91) {
    13529. 

  13529.        i6 = (HEAP8[i21] | 0) == 94;
    13530. 

  13530.        i13 = i6 ? i21 : i11;
    13531. 

  13531.        i6 = i6 & 1;
    13532. 

  13532.        i7 = i6 ^ 1;
    13533. 

  13533.        i14 = i13 + 1 | 0;
    13534. 

  13534.        if (i14 >>> 0 < i8 >>> 0) {
    13535. 

  13535.         while (1) {
    13536. 

  13536.          i17 = HEAP8[i14] | 0;
    13537. 

  13537.          i15 = i13 + 2 | 0;
    13538. 

  13538.          i16 = HEAP8[i15] | 0;
    13539. 

  13539.          do {
    13540. 

  13540.           if (i17 << 24 >> 24 == 37) {
    13541. 

  13541.            if ((_match_class(i10, i16 & 255) | 0) == 0) {
    13542. 

  13542.             i13 = i15;
    13543. 

  13543.            } else {
    13544. 

  13544.             i6 = i7;
    13545. 

  13545.             i7 = 147;
    13546. 

  13546.             break L139;
    13547. 

  13547.            }
    13548. 

  13548.           } else {
    13549. 

  13549.            if (i16 << 24 >> 24 == 45 ? (i5 = i13 + 3 | 0, i5 >>> 0 < i8 >>> 0) : 0) {
    13550. 

  13550.             if ((i17 & 255) > (i9 & 255)) {
    13551. 

  13551.              i13 = i5;
    13552. 

  13552.              break;
    13553. 

  13553.             }
    13554. 

  13554.             if ((HEAPU8[i5] | 0) < (i9 & 255)) {
    13555. 

  13555.              i13 = i5;
    13556. 

  13556.              break;
    13557. 

  13557.             } else {
    13558. 

  13558.              i6 = i7;
    13559. 

  13559.              i7 = 147;
    13560. 

  13560.              break L139;
    13561. 

  13561.             }
    13562. 

  13562.            }
    13563. 

  13563.            if (i17 << 24 >> 24 == i9 << 24 >> 24) {
    13564. 

  13564.             i6 = i7;
    13565. 

  13565.             i7 = 147;
    13566. 

  13566.             break L139;
    13567. 

  13567.            } else {
    13568. 

  13568.             i13 = i14;
    13569. 

  13569.            }
    13570. 

  13570.           }
    13571. 

  13571.          } while (0);
    13572. 

  13572.          i14 = i13 + 1 | 0;
    13573. 

  13573.          if (!(i14 >>> 0 < i8 >>> 0)) {
    13574. 

  13574.           i7 = 147;
    13575. 

  13575.           break;
    13576. 

  13576.          }
    13577. 

  13577.         }
    13578. 

  13578.        } else {
    13579. 

  13579.         i7 = 147;
    13580. 

  13580.        }
    13581. 

  13581.       } else if ((i13 | 0) == 37) {
    13582. 

  13582.        i6 = _match_class(i10, HEAPU8[i21] | 0) | 0;
    13583. 

  13583.        i7 = 147;
    13584. 

  13584.       } else if ((i13 | 0) != 46) {
    13585. 

  13585.        i6 = i14 << 24 >> 24 == i9 << 24 >> 24 | 0;
    13586. 

  13586.        i7 = 147;
    13587. 

  13587.       }
    13588. 

  13588.      } while (0);
    13589. 

  13589.      if ((i7 | 0) == 147 ? (i7 = 0, (i6 | 0) == 0) : 0) {
    13590. 

  13590.       i12 = 0;
    13591. 

  13591.       break L4;
    13592. 

  13592.      }
    13593. 

  13593.      i9 = i12 + 1 | 0;
    13594. 

  13594.      i12 = _match(i1, i9, i4) | 0;
    13595. 

  13595.      if ((i12 | 0) == 0) {
    13596. 

  13596.       i12 = i9;
    13597. 

  13597.      } else {
    13598. 

  13598.       break L4;
    13599. 

  13599.      }
    13600. 

  13600.     }
    13601. 

  13601.    } else if ((i7 | 0) == 112) {
    13602. 

  13602.     i19 = i12;
    13603. 

  13603.    }
    13604. 

  13604.    i10 = HEAP32[i3 >> 2] | 0;
    13605. 

  13605.    if (i10 >>> 0 > i19 >>> 0) {
    13606. 

  13606.     i5 = i22 + -1 | 0;
    13607. 

  13607.     i8 = i19;
    13608. 

  13608.     i6 = 0;
    13609. 

  13609.     do {
    13610. 

  13610.      i8 = HEAP8[i8] | 0;
    13611. 

  13611.      i9 = i8 & 255;
    13612. 

  13612.      i13 = HEAP8[i11] | 0;
    13613. 

  13613.      i12 = i13 << 24 >> 24;
    13614. 

  13614.      L183 : do {
    13615. 

  13615.       if ((i12 | 0) == 37) {
    13616. 

  13616.        i10 = _match_class(i9, HEAPU8[i21] | 0) | 0;
    13617. 

  13617.        i7 = 129;
    13618. 

  13618.       } else if ((i12 | 0) == 91) {
    13619. 

  13619.        i7 = (HEAP8[i21] | 0) == 94;
    13620. 

  13620.        i12 = i7 ? i21 : i11;
    13621. 

  13621.        i10 = i7 & 1;
    13622. 

  13622.        i7 = i10 ^ 1;
    13623. 

  13623.        i13 = i12 + 1 | 0;
    13624. 

  13624.        if (i13 >>> 0 < i5 >>> 0) {
    13625. 

  13625.         while (1) {
    13626. 

  13626.          i14 = HEAP8[i13] | 0;
    13627. 

  13627.          i16 = i12 + 2 | 0;
    13628. 

  13628.          i15 = HEAP8[i16] | 0;
    13629. 

  13629.          do {
    13630. 

  13630.           if (i14 << 24 >> 24 == 37) {
    13631. 

  13631.            if ((_match_class(i9, i15 & 255) | 0) == 0) {
    13632. 

  13632.             i12 = i16;
    13633. 

  13633.            } else {
    13634. 

  13634.             i10 = i7;
    13635. 

  13635.             i7 = 129;
    13636. 

  13636.             break L183;
    13637. 

  13637.            }
    13638. 

  13638.           } else {
    13639. 

  13639.            if (i15 << 24 >> 24 == 45 ? (i4 = i12 + 3 | 0, i4 >>> 0 < i5 >>> 0) : 0) {
    13640. 

  13640.             if ((i14 & 255) > (i8 & 255)) {
    13641. 

  13641.              i12 = i4;
    13642. 

  13642.              break;
    13643. 

  13643.             }
    13644. 

  13644.             if ((HEAPU8[i4] | 0) < (i8 & 255)) {
    13645. 

  13645.              i12 = i4;
    13646. 

  13646.              break;
    13647. 

  13647.             } else {
    13648. 

  13648.              i10 = i7;
    13649. 

  13649.              i7 = 129;
    13650. 

  13650.              break L183;
    13651. 

  13651.             }
    13652. 

  13652.            }
    13653. 

  13653.            if (i14 << 24 >> 24 == i8 << 24 >> 24) {
    13654. 

  13654.             i10 = i7;
    13655. 

  13655.             i7 = 129;
    13656. 

  13656.             break L183;
    13657. 

  13657.            } else {
    13658. 

  13658.             i12 = i13;
    13659. 

  13659.            }
    13660. 

  13660.           }
    13661. 

  13661.          } while (0);
    13662. 

  13662.          i13 = i12 + 1 | 0;
    13663. 

  13663.          if (!(i13 >>> 0 < i5 >>> 0)) {
    13664. 

  13664.           i7 = 129;
    13665. 

  13665.           break;
    13666. 

  13666.          }
    13667. 

  13667.         }
    13668. 

  13668.        } else {
    13669. 

  13669.         i7 = 129;
    13670. 

  13670.        }
    13671. 

  13671.       } else if ((i12 | 0) != 46) {
    13672. 

  13672.        i10 = i13 << 24 >> 24 == i8 << 24 >> 24 | 0;
    13673. 

  13673.        i7 = 129;
    13674. 

  13674.       }
    13675. 

  13675.      } while (0);
    13676. 

  13676.      if ((i7 | 0) == 129) {
    13677. 

  13677.       i7 = 0;
    13678. 

  13678.       if ((i10 | 0) == 0) {
    13679. 

  13679.        break;
    13680. 

  13680.       }
    13681. 

  13681.       i10 = HEAP32[i3 >> 2] | 0;
    13682. 

  13682.      }
    13683. 

  13683.      i6 = i6 + 1 | 0;
    13684. 

  13684.      i8 = i19 + i6 | 0;
    13685. 

  13685.     } while (i10 >>> 0 > i8 >>> 0);
    13686. 

  13686.     if (!((i6 | 0) > -1)) {
    13687. 

  13687.      i12 = 0;
    13688. 

  13688.      break;
    13689. 

  13689.     }
    13690. 

  13690.    } else {
    13691. 

  13691.     i6 = 0;
    13692. 

  13692.    }
    13693. 

  13693.    i3 = i22 + 1 | 0;
    13694. 

  13694.    while (1) {
    13695. 

  13695.     i12 = _match(i1, i19 + i6 | 0, i3) | 0;
    13696. 

  13696.     if ((i12 | 0) != 0) {
    13697. 

  13697.      break L4;
    13698. 

  13698.     }
    13699. 

  13699.     if ((i6 | 0) > 0) {
    13700. 

  13700.      i6 = i6 + -1 | 0;
    13701. 

  13701.     } else {
    13702. 

  13702.      i12 = 0;
    13703. 

  13703.      break;
    13704. 

  13704.     }
    13705. 

  13705.    }
    13706. 

  13706.   }
    13707. 

  13707.  } while (0);
    13708. 

  13708.  HEAP32[i1 >> 2] = (HEAP32[i1 >> 2] | 0) + 1;
    13709. 

  13709.  STACKTOP = i2;
    13710. 

  13710.  return i12 | 0;
    13711. 

  13711. }
    13712. 

  13712. function _free(i7) {
    13713. 

  13713.  i7 = i7 | 0;
    13714. 

  13714.  var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
    13715. 

  13715.  i1 = STACKTOP;
    13716. 

  13716.  if ((i7 | 0) == 0) {
    13717. 

  13717.   STACKTOP = i1;
    13718. 

  13718.   return;
    13719. 

  13719.  }
    13720. 

  13720.  i15 = i7 + -8 | 0;
    13721. 

  13721.  i16 = HEAP32[12928 >> 2] | 0;
    13722. 

  13722.  if (i15 >>> 0 < i16 >>> 0) {
    13723. 

  13723.   _abort();
    13724. 

  13724.  }
    13725. 

  13725.  i13 = HEAP32[i7 + -4 >> 2] | 0;
    13726. 

  13726.  i12 = i13 & 3;
    13727. 

  13727.  if ((i12 | 0) == 1) {
    13728. 

  13728.   _abort();
    13729. 

  13729.  }
    13730. 

  13730.  i8 = i13 & -8;
    13731. 

  13731.  i6 = i7 + (i8 + -8) | 0;
    13732. 

  13732.  do {
    13733. 

  13733.   if ((i13 & 1 | 0) == 0) {
    13734. 

  13734.    i19 = HEAP32[i15 >> 2] | 0;
    13735. 

  13735.    if ((i12 | 0) == 0) {
    13736. 

  13736.     STACKTOP = i1;
    13737. 

  13737.     return;
    13738. 

  13738.    }
    13739. 

  13739.    i15 = -8 - i19 | 0;
    13740. 

  13740.    i13 = i7 + i15 | 0;
    13741. 

  13741.    i12 = i19 + i8 | 0;
    13742. 

  13742.    if (i13 >>> 0 < i16 >>> 0) {
    13743. 

  13743.     _abort();
    13744. 

  13744.    }
    13745. 

  13745.    if ((i13 | 0) == (HEAP32[12932 >> 2] | 0)) {
    13746. 

  13746.     i2 = i7 + (i8 + -4) | 0;
    13747. 

  13747.     if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
    13748. 

  13748.      i2 = i13;
    13749. 

  13749.      i11 = i12;
    13750. 

  13750.      break;
    13751. 

  13751.     }
    13752. 

  13752.     HEAP32[12920 >> 2] = i12;
    13753. 

  13753.     HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
    13754. 

  13754.     HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
    13755. 

  13755.     HEAP32[i6 >> 2] = i12;
    13756. 

  13756.     STACKTOP = i1;
    13757. 

  13757.     return;
    13758. 

  13758.    }
    13759. 

  13759.    i18 = i19 >>> 3;
    13760. 

  13760.    if (i19 >>> 0 < 256) {
    13761. 

  13761.     i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
    13762. 

  13762.     i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
    13763. 

  13763.     i14 = 12952 + (i18 << 1 << 2) | 0;
    13764. 

  13764.     if ((i2 | 0) != (i14 | 0)) {
    13765. 

  13765.      if (i2 >>> 0 < i16 >>> 0) {
    13766. 

  13766.       _abort();
    13767. 

  13767.      }
    13768. 

  13768.      if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
    13769. 

  13769.       _abort();
    13770. 

  13770.      }
    13771. 

  13771.     }
    13772. 

  13772.     if ((i11 | 0) == (i2 | 0)) {
    13773. 

  13773.      HEAP32[3228] = HEAP32[3228] & ~(1 << i18);
    13774. 

  13774.      i2 = i13;
    13775. 

  13775.      i11 = i12;
    13776. 

  13776.      break;
    13777. 

  13777.     }
    13778. 

  13778.     if ((i11 | 0) != (i14 | 0)) {
    13779. 

  13779.      if (i11 >>> 0 < i16 >>> 0) {
    13780. 

  13780.       _abort();
    13781. 

  13781.      }
    13782. 

  13782.      i14 = i11 + 8 | 0;
    13783. 

  13783.      if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
    13784. 

  13784.       i17 = i14;
    13785. 

  13785.      } else {
    13786. 

  13786.       _abort();
    13787. 

  13787.      }
    13788. 

  13788.     } else {
    13789. 

  13789.      i17 = i11 + 8 | 0;
    13790. 

  13790.     }
    13791. 

  13791.     HEAP32[i2 + 12 >> 2] = i11;
    13792. 

  13792.     HEAP32[i17 >> 2] = i2;
    13793. 

  13793.     i2 = i13;
    13794. 

  13794.     i11 = i12;
    13795. 

  13795.     break;
    13796. 

  13796.    }
    13797. 

  13797.    i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
    13798. 

  13798.    i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
    13799. 

  13799.    do {
    13800. 

  13800.     if ((i18 | 0) == (i13 | 0)) {
    13801. 

  13801.      i19 = i7 + (i15 + 20) | 0;
    13802. 

  13802.      i18 = HEAP32[i19 >> 2] | 0;
    13803. 

  13803.      if ((i18 | 0) == 0) {
    13804. 

  13804.       i19 = i7 + (i15 + 16) | 0;
    13805. 

  13805.       i18 = HEAP32[i19 >> 2] | 0;
    13806. 

  13806.       if ((i18 | 0) == 0) {
    13807. 

  13807.        i14 = 0;
    13808. 

  13808.        break;
    13809. 

  13809.       }
    13810. 

  13810.      }
    13811. 

  13811.      while (1) {
    13812. 

  13812.       i21 = i18 + 20 | 0;
    13813. 

  13813.       i20 = HEAP32[i21 >> 2] | 0;
    13814. 

  13814.       if ((i20 | 0) != 0) {
    13815. 

  13815.        i18 = i20;
    13816. 

  13816.        i19 = i21;
    13817. 

  13817.        continue;
    13818. 

  13818.       }
    13819. 

  13819.       i20 = i18 + 16 | 0;
    13820. 

  13820.       i21 = HEAP32[i20 >> 2] | 0;
    13821. 

  13821.       if ((i21 | 0) == 0) {
    13822. 

  13822.        break;
    13823. 

  13823.       } else {
    13824. 

  13824.        i18 = i21;
    13825. 

  13825.        i19 = i20;
    13826. 

  13826.       }
    13827. 

  13827.      }
    13828. 

  13828.      if (i19 >>> 0 < i16 >>> 0) {
    13829. 

  13829.       _abort();
    13830. 

  13830.      } else {
    13831. 

  13831.       HEAP32[i19 >> 2] = 0;
    13832. 

  13832.       i14 = i18;
    13833. 

  13833.       break;
    13834. 

  13834.      }
    13835. 

  13835.     } else {
    13836. 

  13836.      i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
    13837. 

  13837.      if (i19 >>> 0 < i16 >>> 0) {
    13838. 

  13838.       _abort();
    13839. 

  13839.      }
    13840. 

  13840.      i16 = i19 + 12 | 0;
    13841. 

  13841.      if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
    13842. 

  13842.       _abort();
    13843. 

  13843.      }
    13844. 

  13844.      i20 = i18 + 8 | 0;
    13845. 

  13845.      if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
    13846. 

  13846.       HEAP32[i16 >> 2] = i18;
    13847. 

  13847.       HEAP32[i20 >> 2] = i19;
    13848. 

  13848.       i14 = i18;
    13849. 

  13849.       break;
    13850. 

  13850.      } else {
    13851. 

  13851.       _abort();
    13852. 

  13852.      }
    13853. 

  13853.     }
    13854. 

  13854.    } while (0);
    13855. 

  13855.    if ((i17 | 0) != 0) {
    13856. 

  13856.     i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
    13857. 

  13857.     i16 = 13216 + (i18 << 2) | 0;
    13858. 

  13858.     if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
    13859. 

  13859.      HEAP32[i16 >> 2] = i14;
    13860. 

  13860.      if ((i14 | 0) == 0) {
    13861. 

  13861.       HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i18);
    13862. 

  13862.       i2 = i13;
    13863. 

  13863.       i11 = i12;
    13864. 

  13864.       break;
    13865. 

  13865.      }
    13866. 

  13866.     } else {
    13867. 

  13867.      if (i17 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13868. 

  13868.       _abort();
    13869. 

  13869.      }
    13870. 

  13870.      i16 = i17 + 16 | 0;
    13871. 

  13871.      if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
    13872. 

  13872.       HEAP32[i16 >> 2] = i14;
    13873. 

  13873.      } else {
    13874. 

  13874.       HEAP32[i17 + 20 >> 2] = i14;
    13875. 

  13875.      }
    13876. 

  13876.      if ((i14 | 0) == 0) {
    13877. 

  13877.       i2 = i13;
    13878. 

  13878.       i11 = i12;
    13879. 

  13879.       break;
    13880. 

  13880.      }
    13881. 

  13881.     }
    13882. 

  13882.     if (i14 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13883. 

  13883.      _abort();
    13884. 

  13884.     }
    13885. 

  13885.     HEAP32[i14 + 24 >> 2] = i17;
    13886. 

  13886.     i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
    13887. 

  13887.     do {
    13888. 

  13888.      if ((i16 | 0) != 0) {
    13889. 

  13889.       if (i16 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13890. 

  13890.        _abort();
    13891. 

  13891.       } else {
    13892. 

  13892.        HEAP32[i14 + 16 >> 2] = i16;
    13893. 

  13893.        HEAP32[i16 + 24 >> 2] = i14;
    13894. 

  13894.        break;
    13895. 

  13895.       }
    13896. 

  13896.      }
    13897. 

  13897.     } while (0);
    13898. 

  13898.     i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
    13899. 

  13899.     if ((i15 | 0) != 0) {
    13900. 

  13900.      if (i15 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13901. 

  13901.       _abort();
    13902. 

  13902.      } else {
    13903. 

  13903.       HEAP32[i14 + 20 >> 2] = i15;
    13904. 

  13904.       HEAP32[i15 + 24 >> 2] = i14;
    13905. 

  13905.       i2 = i13;
    13906. 

  13906.       i11 = i12;
    13907. 

  13907.       break;
    13908. 

  13908.      }
    13909. 

  13909.     } else {
    13910. 

  13910.      i2 = i13;
    13911. 

  13911.      i11 = i12;
    13912. 

  13912.     }
    13913. 

  13913.    } else {
    13914. 

  13914.     i2 = i13;
    13915. 

  13915.     i11 = i12;
    13916. 

  13916.    }
    13917. 

  13917.   } else {
    13918. 

  13918.    i2 = i15;
    13919. 

  13919.    i11 = i8;
    13920. 

  13920.   }
    13921. 

  13921.  } while (0);
    13922. 

  13922.  if (!(i2 >>> 0 < i6 >>> 0)) {
    13923. 

  13923.   _abort();
    13924. 

  13924.  }
    13925. 

  13925.  i12 = i7 + (i8 + -4) | 0;
    13926. 

  13926.  i13 = HEAP32[i12 >> 2] | 0;
    13927. 

  13927.  if ((i13 & 1 | 0) == 0) {
    13928. 

  13928.   _abort();
    13929. 

  13929.  }
    13930. 

  13930.  if ((i13 & 2 | 0) == 0) {
    13931. 

  13931.   if ((i6 | 0) == (HEAP32[12936 >> 2] | 0)) {
    13932. 

  13932.    i21 = (HEAP32[12924 >> 2] | 0) + i11 | 0;
    13933. 

  13933.    HEAP32[12924 >> 2] = i21;
    13934. 

  13934.    HEAP32[12936 >> 2] = i2;
    13935. 

  13935.    HEAP32[i2 + 4 >> 2] = i21 | 1;
    13936. 

  13936.    if ((i2 | 0) != (HEAP32[12932 >> 2] | 0)) {
    13937. 

  13937.     STACKTOP = i1;
    13938. 

  13938.     return;
    13939. 

  13939.    }
    13940. 

  13940.    HEAP32[12932 >> 2] = 0;
    13941. 

  13941.    HEAP32[12920 >> 2] = 0;
    13942. 

  13942.    STACKTOP = i1;
    13943. 

  13943.    return;
    13944. 

  13944.   }
    13945. 

  13945.   if ((i6 | 0) == (HEAP32[12932 >> 2] | 0)) {
    13946. 

  13946.    i21 = (HEAP32[12920 >> 2] | 0) + i11 | 0;
    13947. 

  13947.    HEAP32[12920 >> 2] = i21;
    13948. 

  13948.    HEAP32[12932 >> 2] = i2;
    13949. 

  13949.    HEAP32[i2 + 4 >> 2] = i21 | 1;
    13950. 

  13950.    HEAP32[i2 + i21 >> 2] = i21;
    13951. 

  13951.    STACKTOP = i1;
    13952. 

  13952.    return;
    13953. 

  13953.   }
    13954. 

  13954.   i11 = (i13 & -8) + i11 | 0;
    13955. 

  13955.   i12 = i13 >>> 3;
    13956. 

  13956.   do {
    13957. 

  13957.    if (!(i13 >>> 0 < 256)) {
    13958. 

  13958.     i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
    13959. 

  13959.     i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
    13960. 

  13960.     do {
    13961. 

  13961.      if ((i15 | 0) == (i6 | 0)) {
    13962. 

  13962.       i13 = i7 + (i8 + 12) | 0;
    13963. 

  13963.       i12 = HEAP32[i13 >> 2] | 0;
    13964. 

  13964.       if ((i12 | 0) == 0) {
    13965. 

  13965.        i13 = i7 + (i8 + 8) | 0;
    13966. 

  13966.        i12 = HEAP32[i13 >> 2] | 0;
    13967. 

  13967.        if ((i12 | 0) == 0) {
    13968. 

  13968.         i9 = 0;
    13969. 

  13969.         break;
    13970. 

  13970.        }
    13971. 

  13971.       }
    13972. 

  13972.       while (1) {
    13973. 

  13973.        i14 = i12 + 20 | 0;
    13974. 

  13974.        i15 = HEAP32[i14 >> 2] | 0;
    13975. 

  13975.        if ((i15 | 0) != 0) {
    13976. 

  13976.         i12 = i15;
    13977. 

  13977.         i13 = i14;
    13978. 

  13978.         continue;
    13979. 

  13979.        }
    13980. 

  13980.        i14 = i12 + 16 | 0;
    13981. 

  13981.        i15 = HEAP32[i14 >> 2] | 0;
    13982. 

  13982.        if ((i15 | 0) == 0) {
    13983. 

  13983.         break;
    13984. 

  13984.        } else {
    13985. 

  13985.         i12 = i15;
    13986. 

  13986.         i13 = i14;
    13987. 

  13987.        }
    13988. 

  13988.       }
    13989. 

  13989.       if (i13 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13990. 

  13990.        _abort();
    13991. 

  13991.       } else {
    13992. 

  13992.        HEAP32[i13 >> 2] = 0;
    13993. 

  13993.        i9 = i12;
    13994. 

  13994.        break;
    13995. 

  13995.       }
    13996. 

  13996.      } else {
    13997. 

  13997.       i13 = HEAP32[i7 + i8 >> 2] | 0;
    13998. 

  13998.       if (i13 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    13999. 

  13999.        _abort();
    14000. 

  14000.       }
    14001. 

  14001.       i14 = i13 + 12 | 0;
    14002. 

  14002.       if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
    14003. 

  14003.        _abort();
    14004. 

  14004.       }
    14005. 

  14005.       i12 = i15 + 8 | 0;
    14006. 

  14006.       if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
    14007. 

  14007.        HEAP32[i14 >> 2] = i15;
    14008. 

  14008.        HEAP32[i12 >> 2] = i13;
    14009. 

  14009.        i9 = i15;
    14010. 

  14010.        break;
    14011. 

  14011.       } else {
    14012. 

  14012.        _abort();
    14013. 

  14013.       }
    14014. 

  14014.      }
    14015. 

  14015.     } while (0);
    14016. 

  14016.     if ((i10 | 0) != 0) {
    14017. 

  14017.      i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
    14018. 

  14018.      i13 = 13216 + (i12 << 2) | 0;
    14019. 

  14019.      if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
    14020. 

  14020.       HEAP32[i13 >> 2] = i9;
    14021. 

  14021.       if ((i9 | 0) == 0) {
    14022. 

  14022.        HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i12);
    14023. 

  14023.        break;
    14024. 

  14024.       }
    14025. 

  14025.      } else {
    14026. 

  14026.       if (i10 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14027. 

  14027.        _abort();
    14028. 

  14028.       }
    14029. 

  14029.       i12 = i10 + 16 | 0;
    14030. 

  14030.       if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
    14031. 

  14031.        HEAP32[i12 >> 2] = i9;
    14032. 

  14032.       } else {
    14033. 

  14033.        HEAP32[i10 + 20 >> 2] = i9;
    14034. 

  14034.       }
    14035. 

  14035.       if ((i9 | 0) == 0) {
    14036. 

  14036.        break;
    14037. 

  14037.       }
    14038. 

  14038.      }
    14039. 

  14039.      if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14040. 

  14040.       _abort();
    14041. 

  14041.      }
    14042. 

  14042.      HEAP32[i9 + 24 >> 2] = i10;
    14043. 

  14043.      i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
    14044. 

  14044.      do {
    14045. 

  14045.       if ((i6 | 0) != 0) {
    14046. 

  14046.        if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14047. 

  14047.         _abort();
    14048. 

  14048.        } else {
    14049. 

  14049.         HEAP32[i9 + 16 >> 2] = i6;
    14050. 

  14050.         HEAP32[i6 + 24 >> 2] = i9;
    14051. 

  14051.         break;
    14052. 

  14052.        }
    14053. 

  14053.       }
    14054. 

  14054.      } while (0);
    14055. 

  14055.      i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
    14056. 

  14056.      if ((i6 | 0) != 0) {
    14057. 

  14057.       if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14058. 

  14058.        _abort();
    14059. 

  14059.       } else {
    14060. 

  14060.        HEAP32[i9 + 20 >> 2] = i6;
    14061. 

  14061.        HEAP32[i6 + 24 >> 2] = i9;
    14062. 

  14062.        break;
    14063. 

  14063.       }
    14064. 

  14064.      }
    14065. 

  14065.     }
    14066. 

  14066.    } else {
    14067. 

  14067.     i9 = HEAP32[i7 + i8 >> 2] | 0;
    14068. 

  14068.     i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
    14069. 

  14069.     i8 = 12952 + (i12 << 1 << 2) | 0;
    14070. 

  14070.     if ((i9 | 0) != (i8 | 0)) {
    14071. 

  14071.      if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14072. 

  14072.       _abort();
    14073. 

  14073.      }
    14074. 

  14074.      if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
    14075. 

  14075.       _abort();
    14076. 

  14076.      }
    14077. 

  14077.     }
    14078. 

  14078.     if ((i7 | 0) == (i9 | 0)) {
    14079. 

  14079.      HEAP32[3228] = HEAP32[3228] & ~(1 << i12);
    14080. 

  14080.      break;
    14081. 

  14081.     }
    14082. 

  14082.     if ((i7 | 0) != (i8 | 0)) {
    14083. 

  14083.      if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14084. 

  14084.       _abort();
    14085. 

  14085.      }
    14086. 

  14086.      i8 = i7 + 8 | 0;
    14087. 

  14087.      if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
    14088. 

  14088.       i10 = i8;
    14089. 

  14089.      } else {
    14090. 

  14090.       _abort();
    14091. 

  14091.      }
    14092. 

  14092.     } else {
    14093. 

  14093.      i10 = i7 + 8 | 0;
    14094. 

  14094.     }
    14095. 

  14095.     HEAP32[i9 + 12 >> 2] = i7;
    14096. 

  14096.     HEAP32[i10 >> 2] = i9;
    14097. 

  14097.    }
    14098. 

  14098.   } while (0);
    14099. 

  14099.   HEAP32[i2 + 4 >> 2] = i11 | 1;
    14100. 

  14100.   HEAP32[i2 + i11 >> 2] = i11;
    14101. 

  14101.   if ((i2 | 0) == (HEAP32[12932 >> 2] | 0)) {
    14102. 

  14102.    HEAP32[12920 >> 2] = i11;
    14103. 

  14103.    STACKTOP = i1;
    14104. 

  14104.    return;
    14105. 

  14105.   }
    14106. 

  14106.  } else {
    14107. 

  14107.   HEAP32[i12 >> 2] = i13 & -2;
    14108. 

  14108.   HEAP32[i2 + 4 >> 2] = i11 | 1;
    14109. 

  14109.   HEAP32[i2 + i11 >> 2] = i11;
    14110. 

  14110.  }
    14111. 

  14111.  i6 = i11 >>> 3;
    14112. 

  14112.  if (i11 >>> 0 < 256) {
    14113. 

  14113.   i7 = i6 << 1;
    14114. 

  14114.   i3 = 12952 + (i7 << 2) | 0;
    14115. 

  14115.   i8 = HEAP32[3228] | 0;
    14116. 

  14116.   i6 = 1 << i6;
    14117. 

  14117.   if ((i8 & i6 | 0) != 0) {
    14118. 

  14118.    i6 = 12952 + (i7 + 2 << 2) | 0;
    14119. 

  14119.    i7 = HEAP32[i6 >> 2] | 0;
    14120. 

  14120.    if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14121. 

  14121.     _abort();
    14122. 

  14122.    } else {
    14123. 

  14123.     i4 = i6;
    14124. 

  14124.     i5 = i7;
    14125. 

  14125.    }
    14126. 

  14126.   } else {
    14127. 

  14127.    HEAP32[3228] = i8 | i6;
    14128. 

  14128.    i4 = 12952 + (i7 + 2 << 2) | 0;
    14129. 

  14129.    i5 = i3;
    14130. 

  14130.   }
    14131. 

  14131.   HEAP32[i4 >> 2] = i2;
    14132. 

  14132.   HEAP32[i5 + 12 >> 2] = i2;
    14133. 

  14133.   HEAP32[i2 + 8 >> 2] = i5;
    14134. 

  14134.   HEAP32[i2 + 12 >> 2] = i3;
    14135. 

  14135.   STACKTOP = i1;
    14136. 

  14136.   return;
    14137. 

  14137.  }
    14138. 

  14138.  i4 = i11 >>> 8;
    14139. 

  14139.  if ((i4 | 0) != 0) {
    14140. 

  14140.   if (i11 >>> 0 > 16777215) {
    14141. 

  14141.    i4 = 31;
    14142. 

  14142.   } else {
    14143. 

  14143.    i20 = (i4 + 1048320 | 0) >>> 16 & 8;
    14144. 

  14144.    i21 = i4 << i20;
    14145. 

  14145.    i19 = (i21 + 520192 | 0) >>> 16 & 4;
    14146. 

  14146.    i21 = i21 << i19;
    14147. 

  14147.    i4 = (i21 + 245760 | 0) >>> 16 & 2;
    14148. 

  14148.    i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
    14149. 

  14149.    i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
    14150. 

  14150.   }
    14151. 

  14151.  } else {
    14152. 

  14152.   i4 = 0;
    14153. 

  14153.  }
    14154. 

  14154.  i5 = 13216 + (i4 << 2) | 0;
    14155. 

  14155.  HEAP32[i2 + 28 >> 2] = i4;
    14156. 

  14156.  HEAP32[i2 + 20 >> 2] = 0;
    14157. 

  14157.  HEAP32[i2 + 16 >> 2] = 0;
    14158. 

  14158.  i7 = HEAP32[12916 >> 2] | 0;
    14159. 

  14159.  i6 = 1 << i4;
    14160. 

  14160.  L199 : do {
    14161. 

  14161.   if ((i7 & i6 | 0) != 0) {
    14162. 

  14162.    i5 = HEAP32[i5 >> 2] | 0;
    14163. 

  14163.    if ((i4 | 0) == 31) {
    14164. 

  14164.     i4 = 0;
    14165. 

  14165.    } else {
    14166. 

  14166.     i4 = 25 - (i4 >>> 1) | 0;
    14167. 

  14167.    }
    14168. 

  14168.    L204 : do {
    14169. 

  14169.     if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
    14170. 

  14170.      i4 = i11 << i4;
    14171. 

  14171.      i7 = i5;
    14172. 

  14172.      while (1) {
    14173. 

  14173.       i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
    14174. 

  14174.       i5 = HEAP32[i6 >> 2] | 0;
    14175. 

  14175.       if ((i5 | 0) == 0) {
    14176. 

  14176.        break;
    14177. 

  14177.       }
    14178. 

  14178.       if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
    14179. 

  14179.        i3 = i5;
    14180. 

  14180.        break L204;
    14181. 

  14181.       } else {
    14182. 

  14182.        i4 = i4 << 1;
    14183. 

  14183.        i7 = i5;
    14184. 

  14184.       }
    14185. 

  14185.      }
    14186. 

  14186.      if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
    14187. 

  14187.       _abort();
    14188. 

  14188.      } else {
    14189. 

  14189.       HEAP32[i6 >> 2] = i2;
    14190. 

  14190.       HEAP32[i2 + 24 >> 2] = i7;
    14191. 

  14191.       HEAP32[i2 + 12 >> 2] = i2;
    14192. 

  14192.       HEAP32[i2 + 8 >> 2] = i2;
    14193. 

  14193.       break L199;
    14194. 

  14194.      }
    14195. 

  14195.     } else {
    14196. 

  14196.      i3 = i5;
    14197. 

  14197.     }
    14198. 

  14198.    } while (0);
    14199. 

  14199.    i5 = i3 + 8 | 0;
    14200. 

  14200.    i4 = HEAP32[i5 >> 2] | 0;
    14201. 

  14201.    i6 = HEAP32[12928 >> 2] | 0;
    14202. 

  14202.    if (i3 >>> 0 < i6 >>> 0) {
    14203. 

  14203.     _abort();
    14204. 

  14204.    }
    14205. 

  14205.    if (i4 >>> 0 < i6 >>> 0) {
    14206. 

  14206.     _abort();
    14207. 

  14207.    } else {
    14208. 

  14208.     HEAP32[i4 + 12 >> 2] = i2;
    14209. 

  14209.     HEAP32[i5 >> 2] = i2;
    14210. 

  14210.     HEAP32[i2 + 8 >> 2] = i4;
    14211. 

  14211.     HEAP32[i2 + 12 >> 2] = i3;
    14212. 

  14212.     HEAP32[i2 + 24 >> 2] = 0;
    14213. 

  14213.     break;
    14214. 

  14214.    }
    14215. 

  14215.   } else {
    14216. 

  14216.    HEAP32[12916 >> 2] = i7 | i6;
    14217. 

  14217.    HEAP32[i5 >> 2] = i2;
    14218. 

  14218.    HEAP32[i2 + 24 >> 2] = i5;
    14219. 

  14219.    HEAP32[i2 + 12 >> 2] = i2;
    14220. 

  14220.    HEAP32[i2 + 8 >> 2] = i2;
    14221. 

  14221.   }
    14222. 

  14222.  } while (0);
    14223. 

  14223.  i21 = (HEAP32[12944 >> 2] | 0) + -1 | 0;
    14224. 

  14224.  HEAP32[12944 >> 2] = i21;
    14225. 

  14225.  if ((i21 | 0) == 0) {
    14226. 

  14226.   i2 = 13368 | 0;
    14227. 

  14227.  } else {
    14228. 

  14228.   STACKTOP = i1;
    14229. 

  14229.   return;
    14230. 

  14230.  }
    14231. 

  14231.  while (1) {
    14232. 

  14232.   i2 = HEAP32[i2 >> 2] | 0;
    14233. 

  14233.   if ((i2 | 0) == 0) {
    14234. 

  14234.    break;
    14235. 

  14235.   } else {
    14236. 

  14236.    i2 = i2 + 8 | 0;
    14237. 

  14237.   }
    14238. 

  14238.  }
    14239. 

  14239.  HEAP32[12944 >> 2] = -1;
    14240. 

  14240.  STACKTOP = i1;
    14241. 

  14241.  return;
    14242. 

  14242. }
    14243. 

  14243. function _dispose_chunk(i6, i7) {
    14244. 

  14244.  i6 = i6 | 0;
    14245. 

  14245.  i7 = i7 | 0;
    14246. 

  14246.  var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
    14247. 

  14247.  i1 = STACKTOP;
    14248. 

  14248.  i5 = i6 + i7 | 0;
    14249. 

  14249.  i10 = HEAP32[i6 + 4 >> 2] | 0;
    14250. 

  14250.  do {
    14251. 

  14251.   if ((i10 & 1 | 0) == 0) {
    14252. 

  14252.    i14 = HEAP32[i6 >> 2] | 0;
    14253. 

  14253.    if ((i10 & 3 | 0) == 0) {
    14254. 

  14254.     STACKTOP = i1;
    14255. 

  14255.     return;
    14256. 

  14256.    }
    14257. 

  14257.    i10 = i6 + (0 - i14) | 0;
    14258. 

  14258.    i11 = i14 + i7 | 0;
    14259. 

  14259.    i15 = HEAP32[12928 >> 2] | 0;
    14260. 

  14260.    if (i10 >>> 0 < i15 >>> 0) {
    14261. 

  14261.     _abort();
    14262. 

  14262.    }
    14263. 

  14263.    if ((i10 | 0) == (HEAP32[12932 >> 2] | 0)) {
    14264. 

  14264.     i2 = i6 + (i7 + 4) | 0;
    14265. 

  14265.     if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
    14266. 

  14266.      i2 = i10;
    14267. 

  14267.      i12 = i11;
    14268. 

  14268.      break;
    14269. 

  14269.     }
    14270. 

  14270.     HEAP32[12920 >> 2] = i11;
    14271. 

  14271.     HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
    14272. 

  14272.     HEAP32[i6 + (4 - i14) >> 2] = i11 | 1;
    14273. 

  14273.     HEAP32[i5 >> 2] = i11;
    14274. 

  14274.     STACKTOP = i1;
    14275. 

  14275.     return;
    14276. 

  14276.    }
    14277. 

  14277.    i17 = i14 >>> 3;
    14278. 

  14278.    if (i14 >>> 0 < 256) {
    14279. 

  14279.     i2 = HEAP32[i6 + (8 - i14) >> 2] | 0;
    14280. 

  14280.     i12 = HEAP32[i6 + (12 - i14) >> 2] | 0;
    14281. 

  14281.     i13 = 12952 + (i17 << 1 << 2) | 0;
    14282. 

  14282.     if ((i2 | 0) != (i13 | 0)) {
    14283. 

  14283.      if (i2 >>> 0 < i15 >>> 0) {
    14284. 

  14284.       _abort();
    14285. 

  14285.      }
    14286. 

  14286.      if ((HEAP32[i2 + 12 >> 2] | 0) != (i10 | 0)) {
    14287. 

  14287.       _abort();
    14288. 

  14288.      }
    14289. 

  14289.     }
    14290. 

  14290.     if ((i12 | 0) == (i2 | 0)) {
    14291. 

  14291.      HEAP32[3228] = HEAP32[3228] & ~(1 << i17);
    14292. 

  14292.      i2 = i10;
    14293. 

  14293.      i12 = i11;
    14294. 

  14294.      break;
    14295. 

  14295.     }
    14296. 

  14296.     if ((i12 | 0) != (i13 | 0)) {
    14297. 

  14297.      if (i12 >>> 0 < i15 >>> 0) {
    14298. 

  14298.       _abort();
    14299. 

  14299.      }
    14300. 

  14300.      i13 = i12 + 8 | 0;
    14301. 

  14301.      if ((HEAP32[i13 >> 2] | 0) == (i10 | 0)) {
    14302. 

  14302.       i16 = i13;
    14303. 

  14303.      } else {
    14304. 

  14304.       _abort();
    14305. 

  14305.      }
    14306. 

  14306.     } else {
    14307. 

  14307.      i16 = i12 + 8 | 0;
    14308. 

  14308.     }
    14309. 

  14309.     HEAP32[i2 + 12 >> 2] = i12;
    14310. 

  14310.     HEAP32[i16 >> 2] = i2;
    14311. 

  14311.     i2 = i10;
    14312. 

  14312.     i12 = i11;
    14313. 

  14313.     break;
    14314. 

  14314.    }
    14315. 

  14315.    i16 = HEAP32[i6 + (24 - i14) >> 2] | 0;
    14316. 

  14316.    i18 = HEAP32[i6 + (12 - i14) >> 2] | 0;
    14317. 

  14317.    do {
    14318. 

  14318.     if ((i18 | 0) == (i10 | 0)) {
    14319. 

  14319.      i19 = 16 - i14 | 0;
    14320. 

  14320.      i18 = i6 + (i19 + 4) | 0;
    14321. 

  14321.      i17 = HEAP32[i18 >> 2] | 0;
    14322. 

  14322.      if ((i17 | 0) == 0) {
    14323. 

  14323.       i18 = i6 + i19 | 0;
    14324. 

  14324.       i17 = HEAP32[i18 >> 2] | 0;
    14325. 

  14325.       if ((i17 | 0) == 0) {
    14326. 

  14326.        i13 = 0;
    14327. 

  14327.        break;
    14328. 

  14328.       }
    14329. 

  14329.      }
    14330. 

  14330.      while (1) {
    14331. 

  14331.       i19 = i17 + 20 | 0;
    14332. 

  14332.       i20 = HEAP32[i19 >> 2] | 0;
    14333. 

  14333.       if ((i20 | 0) != 0) {
    14334. 

  14334.        i17 = i20;
    14335. 

  14335.        i18 = i19;
    14336. 

  14336.        continue;
    14337. 

  14337.       }
    14338. 

  14338.       i20 = i17 + 16 | 0;
    14339. 

  14339.       i19 = HEAP32[i20 >> 2] | 0;
    14340. 

  14340.       if ((i19 | 0) == 0) {
    14341. 

  14341.        break;
    14342. 

  14342.       } else {
    14343. 

  14343.        i17 = i19;
    14344. 

  14344.        i18 = i20;
    14345. 

  14345.       }
    14346. 

  14346.      }
    14347. 

  14347.      if (i18 >>> 0 < i15 >>> 0) {
    14348. 

  14348.       _abort();
    14349. 

  14349.      } else {
    14350. 

  14350.       HEAP32[i18 >> 2] = 0;
    14351. 

  14351.       i13 = i17;
    14352. 

  14352.       break;
    14353. 

  14353.      }
    14354. 

  14354.     } else {
    14355. 

  14355.      i17 = HEAP32[i6 + (8 - i14) >> 2] | 0;
    14356. 

  14356.      if (i17 >>> 0 < i15 >>> 0) {
    14357. 

  14357.       _abort();
    14358. 

  14358.      }
    14359. 

  14359.      i19 = i17 + 12 | 0;
    14360. 

  14360.      if ((HEAP32[i19 >> 2] | 0) != (i10 | 0)) {
    14361. 

  14361.       _abort();
    14362. 

  14362.      }
    14363. 

  14363.      i15 = i18 + 8 | 0;
    14364. 

  14364.      if ((HEAP32[i15 >> 2] | 0) == (i10 | 0)) {
    14365. 

  14365.       HEAP32[i19 >> 2] = i18;
    14366. 

  14366.       HEAP32[i15 >> 2] = i17;
    14367. 

  14367.       i13 = i18;
    14368. 

  14368.       break;
    14369. 

  14369.      } else {
    14370. 

  14370.       _abort();
    14371. 

  14371.      }
    14372. 

  14372.     }
    14373. 

  14373.    } whil
    14374.