Dashboard sipadu mbip
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

cfb.js 50KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608
  1. /* cfb.js (C) 2013-present SheetJS -- http://sheetjs.com */
  2. /* vim: set ts=2: */
  3. /*jshint eqnull:true */
  4. /*exported CFB */
  5. /*global module, require:false, process:false, Buffer:false, Uint8Array:false, Uint16Array:false */
  6. var Base64 = (function make_b64(){
  7. var map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
  8. return {
  9. encode: function(input) {
  10. var o = "";
  11. var c1=0, c2=0, c3=0, e1=0, e2=0, e3=0, e4=0;
  12. for(var i = 0; i < input.length; ) {
  13. c1 = input.charCodeAt(i++);
  14. e1 = (c1 >> 2);
  15. c2 = input.charCodeAt(i++);
  16. e2 = ((c1 & 3) << 4) | (c2 >> 4);
  17. c3 = input.charCodeAt(i++);
  18. e3 = ((c2 & 15) << 2) | (c3 >> 6);
  19. e4 = (c3 & 63);
  20. if (isNaN(c2)) { e3 = e4 = 64; }
  21. else if (isNaN(c3)) { e4 = 64; }
  22. o += map.charAt(e1) + map.charAt(e2) + map.charAt(e3) + map.charAt(e4);
  23. }
  24. return o;
  25. },
  26. decode: function b64_decode(input) {
  27. var o = "";
  28. var c1=0, c2=0, c3=0, e1=0, e2=0, e3=0, e4=0;
  29. input = input.replace(/[^\w\+\/\=]/g, "");
  30. for(var i = 0; i < input.length;) {
  31. e1 = map.indexOf(input.charAt(i++));
  32. e2 = map.indexOf(input.charAt(i++));
  33. c1 = (e1 << 2) | (e2 >> 4);
  34. o += String.fromCharCode(c1);
  35. e3 = map.indexOf(input.charAt(i++));
  36. c2 = ((e2 & 15) << 4) | (e3 >> 2);
  37. if (e3 !== 64) { o += String.fromCharCode(c2); }
  38. e4 = map.indexOf(input.charAt(i++));
  39. c3 = ((e3 & 3) << 6) | e4;
  40. if (e4 !== 64) { o += String.fromCharCode(c3); }
  41. }
  42. return o;
  43. }
  44. };
  45. })();
  46. var has_buf = (typeof Buffer !== 'undefined' && typeof process !== 'undefined' && typeof process.versions !== 'undefined' && process.versions.node);
  47. var Buffer_from = function(){};
  48. if(typeof Buffer !== 'undefined') {
  49. var nbfs = !Buffer.from;
  50. if(!nbfs) try { Buffer.from("foo", "utf8"); } catch(e) { nbfs = true; }
  51. Buffer_from = nbfs ? function(buf, enc) { return (enc) ? new Buffer(buf, enc) : new Buffer(buf); } : Buffer.from.bind(Buffer);
  52. // $FlowIgnore
  53. if(!Buffer.alloc) Buffer.alloc = function(n) { return new Buffer(n); };
  54. // $FlowIgnore
  55. if(!Buffer.allocUnsafe) Buffer.allocUnsafe = function(n) { return new Buffer(n); };
  56. }
  57. function new_raw_buf(len) {
  58. /* jshint -W056 */
  59. return has_buf ? Buffer.alloc(len) : new Array(len);
  60. /* jshint +W056 */
  61. }
  62. function new_unsafe_buf(len) {
  63. /* jshint -W056 */
  64. return has_buf ? Buffer.allocUnsafe(len) : new Array(len);
  65. /* jshint +W056 */
  66. }
  67. var s2a = function s2a(s) {
  68. if(has_buf) return Buffer_from(s, "binary");
  69. return s.split("").map(function(x){ return x.charCodeAt(0) & 0xff; });
  70. };
  71. var chr0 = /\u0000/g, chr1 = /[\u0001-\u0006]/g;
  72. var __toBuffer = function(bufs) { var x = []; for(var i = 0; i < bufs[0].length; ++i) { x.push.apply(x, bufs[0][i]); } return x; };
  73. var ___toBuffer = __toBuffer;
  74. var __utf16le = function(b,s,e) { var ss=[]; for(var i=s; i<e; i+=2) ss.push(String.fromCharCode(__readUInt16LE(b,i))); return ss.join("").replace(chr0,''); };
  75. var ___utf16le = __utf16le;
  76. var __hexlify = function(b,s,l) { var ss=[]; for(var i=s; i<s+l; ++i) ss.push(("0" + b[i].toString(16)).slice(-2)); return ss.join(""); };
  77. var ___hexlify = __hexlify;
  78. var __bconcat = function(bufs) {
  79. if(Array.isArray(bufs[0])) return [].concat.apply([], bufs);
  80. var maxlen = 0, i = 0;
  81. for(i = 0; i < bufs.length; ++i) maxlen += bufs[i].length;
  82. var o = new Uint8Array(maxlen);
  83. for(i = 0, maxlen = 0; i < bufs.length; maxlen += bufs[i].length, ++i) o.set(bufs[i], maxlen);
  84. return o;
  85. };
  86. var bconcat = __bconcat;
  87. if(has_buf) {
  88. __utf16le = function(b,s,e) {
  89. if(!Buffer.isBuffer(b)) return ___utf16le(b,s,e);
  90. return b.toString('utf16le',s,e).replace(chr0,'')/*.replace(chr1,'!')*/;
  91. };
  92. __hexlify = function(b,s,l) { return Buffer.isBuffer(b) ? b.toString('hex',s,s+l) : ___hexlify(b,s,l); };
  93. __toBuffer = function(bufs) { return (bufs[0].length > 0 && Buffer.isBuffer(bufs[0][0])) ? Buffer.concat((bufs[0])) : ___toBuffer(bufs);};
  94. s2a = function(s) { return Buffer_from(s, "binary"); };
  95. bconcat = function(bufs) { return Buffer.isBuffer(bufs[0]) ? Buffer.concat(bufs) : __bconcat(bufs); };
  96. }
  97. var __readUInt8 = function(b, idx) { return b[idx]; };
  98. var __readUInt16LE = function(b, idx) { return b[idx+1]*(1<<8)+b[idx]; };
  99. var __readInt16LE = function(b, idx) { var u = b[idx+1]*(1<<8)+b[idx]; return (u < 0x8000) ? u : (0xffff - u + 1) * -1; };
  100. var __readUInt32LE = function(b, idx) { return b[idx+3]*(1<<24)+(b[idx+2]<<16)+(b[idx+1]<<8)+b[idx]; };
  101. var __readInt32LE = function(b, idx) { return (b[idx+3]<<24)+(b[idx+2]<<16)+(b[idx+1]<<8)+b[idx]; };
  102. function ReadShift(size, t) {
  103. var oI, oS, type = 0;
  104. switch(size) {
  105. case 1: oI = __readUInt8(this, this.l); break;
  106. case 2: oI = (t !== 'i' ? __readUInt16LE : __readInt16LE)(this, this.l); break;
  107. case 4: oI = __readInt32LE(this, this.l); break;
  108. case 16: type = 2; oS = __hexlify(this, this.l, size);
  109. }
  110. this.l += size; if(type === 0) return oI; return oS;
  111. }
  112. var __writeUInt32LE = function(b, val, idx) { b[idx] = (val & 0xFF); b[idx+1] = ((val >>> 8) & 0xFF); b[idx+2] = ((val >>> 16) & 0xFF); b[idx+3] = ((val >>> 24) & 0xFF); };
  113. var __writeInt32LE = function(b, val, idx) { b[idx] = (val & 0xFF); b[idx+1] = ((val >> 8) & 0xFF); b[idx+2] = ((val >> 16) & 0xFF); b[idx+3] = ((val >> 24) & 0xFF); };
  114. function WriteShift(t, val, f) {
  115. var size = 0, i = 0;
  116. switch(f) {
  117. case "hex": for(; i < t; ++i) {
  118. this[this.l++] = parseInt(val.slice(2*i, 2*i+2), 16)||0;
  119. } return this;
  120. case "utf16le":
  121. var end = this.l + t;
  122. for(i = 0; i < Math.min(val.length, t); ++i) {
  123. var cc = val.charCodeAt(i);
  124. this[this.l++] = cc & 0xff;
  125. this[this.l++] = cc >> 8;
  126. }
  127. while(this.l < end) this[this.l++] = 0;
  128. return this;
  129. }
  130. switch(t) {
  131. case 1: size = 1; this[this.l] = val&0xFF; break;
  132. case 2: size = 2; this[this.l] = val&0xFF; val >>>= 8; this[this.l+1] = val&0xFF; break;
  133. case 4: size = 4; __writeUInt32LE(this, val, this.l); break;
  134. case -4: size = 4; __writeInt32LE(this, val, this.l); break;
  135. }
  136. this.l += size; return this;
  137. }
  138. function CheckField(hexstr, fld) {
  139. var m = __hexlify(this,this.l,hexstr.length>>1);
  140. if(m !== hexstr) throw new Error(fld + 'Expected ' + hexstr + ' saw ' + m);
  141. this.l += hexstr.length>>1;
  142. }
  143. function prep_blob(blob, pos) {
  144. blob.l = pos;
  145. blob.read_shift = ReadShift;
  146. blob.chk = CheckField;
  147. blob.write_shift = WriteShift;
  148. }
  149. function new_buf(sz) {
  150. var o = (new_raw_buf(sz));
  151. prep_blob(o, 0);
  152. return o;
  153. }
  154. /* crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */
  155. /* vim: set ts=2: */
  156. /*exported CRC32 */
  157. var CRC32;
  158. (function (factory) {
  159. /*jshint ignore:start */
  160. /*eslint-disable */
  161. factory(CRC32 = {});
  162. /*eslint-enable */
  163. /*jshint ignore:end */
  164. }(function(CRC32) {
  165. CRC32.version = '1.2.0';
  166. /* see perf/crc32table.js */
  167. /*global Int32Array */
  168. function signed_crc_table() {
  169. var c = 0, table = new Array(256);
  170. for(var n =0; n != 256; ++n){
  171. c = n;
  172. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  173. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  174. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  175. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  176. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  177. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  178. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  179. c = ((c&1) ? (-306674912 ^ (c >>> 1)) : (c >>> 1));
  180. table[n] = c;
  181. }
  182. return typeof Int32Array !== 'undefined' ? new Int32Array(table) : table;
  183. }
  184. var T = signed_crc_table();
  185. function crc32_bstr(bstr, seed) {
  186. var C = seed ^ -1, L = bstr.length - 1;
  187. for(var i = 0; i < L;) {
  188. C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
  189. C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
  190. }
  191. if(i === L) C = (C>>>8) ^ T[(C ^ bstr.charCodeAt(i))&0xFF];
  192. return C ^ -1;
  193. }
  194. function crc32_buf(buf, seed) {
  195. if(buf.length > 10000) return crc32_buf_8(buf, seed);
  196. var C = seed ^ -1, L = buf.length - 3;
  197. for(var i = 0; i < L;) {
  198. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  199. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  200. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  201. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  202. }
  203. while(i < L+3) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  204. return C ^ -1;
  205. }
  206. function crc32_buf_8(buf, seed) {
  207. var C = seed ^ -1, L = buf.length - 7;
  208. for(var i = 0; i < L;) {
  209. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  210. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  211. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  212. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  213. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  214. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  215. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  216. C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  217. }
  218. while(i < L+7) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
  219. return C ^ -1;
  220. }
  221. function crc32_str(str, seed) {
  222. var C = seed ^ -1;
  223. for(var i = 0, L=str.length, c, d; i < L;) {
  224. c = str.charCodeAt(i++);
  225. if(c < 0x80) {
  226. C = (C>>>8) ^ T[(C ^ c)&0xFF];
  227. } else if(c < 0x800) {
  228. C = (C>>>8) ^ T[(C ^ (192|((c>>6)&31)))&0xFF];
  229. C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
  230. } else if(c >= 0xD800 && c < 0xE000) {
  231. c = (c&1023)+64; d = str.charCodeAt(i++)&1023;
  232. C = (C>>>8) ^ T[(C ^ (240|((c>>8)&7)))&0xFF];
  233. C = (C>>>8) ^ T[(C ^ (128|((c>>2)&63)))&0xFF];
  234. C = (C>>>8) ^ T[(C ^ (128|((d>>6)&15)|((c&3)<<4)))&0xFF];
  235. C = (C>>>8) ^ T[(C ^ (128|(d&63)))&0xFF];
  236. } else {
  237. C = (C>>>8) ^ T[(C ^ (224|((c>>12)&15)))&0xFF];
  238. C = (C>>>8) ^ T[(C ^ (128|((c>>6)&63)))&0xFF];
  239. C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
  240. }
  241. }
  242. return C ^ -1;
  243. }
  244. CRC32.table = T;
  245. CRC32.bstr = crc32_bstr;
  246. CRC32.buf = crc32_buf;
  247. CRC32.str = crc32_str;
  248. }));
  249. /* [MS-CFB] v20171201 */
  250. var CFB = (function _CFB(){
  251. var exports = {};
  252. exports.version = '1.1.3';
  253. /* [MS-CFB] 2.6.4 */
  254. function namecmp(l, r) {
  255. var L = l.split("/"), R = r.split("/");
  256. for(var i = 0, c = 0, Z = Math.min(L.length, R.length); i < Z; ++i) {
  257. if((c = L[i].length - R[i].length)) return c;
  258. if(L[i] != R[i]) return L[i] < R[i] ? -1 : 1;
  259. }
  260. return L.length - R.length;
  261. }
  262. function dirname(p) {
  263. if(p.charAt(p.length - 1) == "/") return (p.slice(0,-1).indexOf("/") === -1) ? p : dirname(p.slice(0, -1));
  264. var c = p.lastIndexOf("/");
  265. return (c === -1) ? p : p.slice(0, c+1);
  266. }
  267. function filename(p) {
  268. if(p.charAt(p.length - 1) == "/") return filename(p.slice(0, -1));
  269. var c = p.lastIndexOf("/");
  270. return (c === -1) ? p : p.slice(c+1);
  271. }
  272. /* -------------------------------------------------------------------------- */
  273. /* DOS Date format:
  274. high|YYYYYYYm.mmmddddd.HHHHHMMM.MMMSSSSS|low
  275. add 1980 to stored year
  276. stored second should be doubled
  277. */
  278. /* write JS date to buf as a DOS date */
  279. function write_dos_date(buf, date) {
  280. if(typeof date === "string") date = new Date(date);
  281. var hms = date.getHours();
  282. hms = hms << 6 | date.getMinutes();
  283. hms = hms << 5 | (date.getSeconds()>>>1);
  284. buf.write_shift(2, hms);
  285. var ymd = (date.getFullYear() - 1980);
  286. ymd = ymd << 4 | (date.getMonth()+1);
  287. ymd = ymd << 5 | date.getDate();
  288. buf.write_shift(2, ymd);
  289. }
  290. /* read four bytes from buf and interpret as a DOS date */
  291. function parse_dos_date(buf) {
  292. var hms = buf.read_shift(2) & 0xFFFF;
  293. var ymd = buf.read_shift(2) & 0xFFFF;
  294. var val = new Date();
  295. var d = ymd & 0x1F; ymd >>>= 5;
  296. var m = ymd & 0x0F; ymd >>>= 4;
  297. val.setMilliseconds(0);
  298. val.setFullYear(ymd + 1980);
  299. val.setMonth(m-1);
  300. val.setDate(d);
  301. var S = hms & 0x1F; hms >>>= 5;
  302. var M = hms & 0x3F; hms >>>= 6;
  303. val.setHours(hms);
  304. val.setMinutes(M);
  305. val.setSeconds(S<<1);
  306. return val;
  307. }
  308. function parse_extra_field(blob) {
  309. prep_blob(blob, 0);
  310. var o = {};
  311. var flags = 0;
  312. while(blob.l <= blob.length - 4) {
  313. var type = blob.read_shift(2);
  314. var sz = blob.read_shift(2), tgt = blob.l + sz;
  315. var p = {};
  316. switch(type) {
  317. /* UNIX-style Timestamps */
  318. case 0x5455: {
  319. flags = blob.read_shift(1);
  320. if(flags & 1) p.mtime = blob.read_shift(4);
  321. /* for some reason, CD flag corresponds to LFH */
  322. if(sz > 5) {
  323. if(flags & 2) p.atime = blob.read_shift(4);
  324. if(flags & 4) p.ctime = blob.read_shift(4);
  325. }
  326. if(p.mtime) p.mt = new Date(p.mtime*1000);
  327. }
  328. break;
  329. }
  330. blob.l = tgt;
  331. o[type] = p;
  332. }
  333. return o;
  334. }
  335. var fs;
  336. function get_fs() { return fs || (fs = require('fs')); }
  337. function parse(file, options) {
  338. if(file[0] == 0x50 && file[1] == 0x4b) return parse_zip(file, options);
  339. if(file.length < 512) throw new Error("CFB file size " + file.length + " < 512");
  340. var mver = 3;
  341. var ssz = 512;
  342. var nmfs = 0; // number of mini FAT sectors
  343. var difat_sec_cnt = 0;
  344. var dir_start = 0;
  345. var minifat_start = 0;
  346. var difat_start = 0;
  347. var fat_addrs = []; // locations of FAT sectors
  348. /* [MS-CFB] 2.2 Compound File Header */
  349. var blob = file.slice(0,512);
  350. prep_blob(blob, 0);
  351. /* major version */
  352. var mv = check_get_mver(blob);
  353. mver = mv[0];
  354. switch(mver) {
  355. case 3: ssz = 512; break; case 4: ssz = 4096; break;
  356. case 0: if(mv[1] == 0) return parse_zip(file, options);
  357. /* falls through */
  358. default: throw new Error("Major Version: Expected 3 or 4 saw " + mver);
  359. }
  360. /* reprocess header */
  361. if(ssz !== 512) { blob = file.slice(0,ssz); prep_blob(blob, 28 /* blob.l */); }
  362. /* Save header for final object */
  363. var header = file.slice(0,ssz);
  364. check_shifts(blob, mver);
  365. // Number of Directory Sectors
  366. var dir_cnt = blob.read_shift(4, 'i');
  367. if(mver === 3 && dir_cnt !== 0) throw new Error('# Directory Sectors: Expected 0 saw ' + dir_cnt);
  368. // Number of FAT Sectors
  369. blob.l += 4;
  370. // First Directory Sector Location
  371. dir_start = blob.read_shift(4, 'i');
  372. // Transaction Signature
  373. blob.l += 4;
  374. // Mini Stream Cutoff Size
  375. blob.chk('00100000', 'Mini Stream Cutoff Size: ');
  376. // First Mini FAT Sector Location
  377. minifat_start = blob.read_shift(4, 'i');
  378. // Number of Mini FAT Sectors
  379. nmfs = blob.read_shift(4, 'i');
  380. // First DIFAT sector location
  381. difat_start = blob.read_shift(4, 'i');
  382. // Number of DIFAT Sectors
  383. difat_sec_cnt = blob.read_shift(4, 'i');
  384. // Grab FAT Sector Locations
  385. for(var q = -1, j = 0; j < 109; ++j) { /* 109 = (512 - blob.l)>>>2; */
  386. q = blob.read_shift(4, 'i');
  387. if(q<0) break;
  388. fat_addrs[j] = q;
  389. }
  390. /** Break the file up into sectors */
  391. var sectors = sectorify(file, ssz);
  392. sleuth_fat(difat_start, difat_sec_cnt, sectors, ssz, fat_addrs);
  393. /** Chains */
  394. var sector_list = make_sector_list(sectors, dir_start, fat_addrs, ssz);
  395. sector_list[dir_start].name = "!Directory";
  396. if(nmfs > 0 && minifat_start !== ENDOFCHAIN) sector_list[minifat_start].name = "!MiniFAT";
  397. sector_list[fat_addrs[0]].name = "!FAT";
  398. sector_list.fat_addrs = fat_addrs;
  399. sector_list.ssz = ssz;
  400. /* [MS-CFB] 2.6.1 Compound File Directory Entry */
  401. var files = {}, Paths = [], FileIndex = [], FullPaths = [];
  402. read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex, minifat_start);
  403. build_full_paths(FileIndex, FullPaths, Paths);
  404. Paths.shift();
  405. var o = {
  406. FileIndex: FileIndex,
  407. FullPaths: FullPaths
  408. };
  409. // $FlowIgnore
  410. if(options && options.raw) o.raw = {header: header, sectors: sectors};
  411. return o;
  412. } // parse
  413. /* [MS-CFB] 2.2 Compound File Header -- read up to major version */
  414. function check_get_mver(blob) {
  415. if(blob[blob.l] == 0x50 && blob[blob.l + 1] == 0x4b) return [0, 0];
  416. // header signature 8
  417. blob.chk(HEADER_SIGNATURE, 'Header Signature: ');
  418. // clsid 16
  419. //blob.chk(HEADER_CLSID, 'CLSID: ');
  420. blob.l += 16;
  421. // minor version 2
  422. var mver = blob.read_shift(2, 'u');
  423. return [blob.read_shift(2,'u'), mver];
  424. }
  425. function check_shifts(blob, mver) {
  426. var shift = 0x09;
  427. // Byte Order
  428. //blob.chk('feff', 'Byte Order: '); // note: some writers put 0xffff
  429. blob.l += 2;
  430. // Sector Shift
  431. switch((shift = blob.read_shift(2))) {
  432. case 0x09: if(mver != 3) throw new Error('Sector Shift: Expected 9 saw ' + shift); break;
  433. case 0x0c: if(mver != 4) throw new Error('Sector Shift: Expected 12 saw ' + shift); break;
  434. default: throw new Error('Sector Shift: Expected 9 or 12 saw ' + shift);
  435. }
  436. // Mini Sector Shift
  437. blob.chk('0600', 'Mini Sector Shift: ');
  438. // Reserved
  439. blob.chk('000000000000', 'Reserved: ');
  440. }
  441. /** Break the file up into sectors */
  442. function sectorify(file, ssz) {
  443. var nsectors = Math.ceil(file.length/ssz)-1;
  444. var sectors = [];
  445. for(var i=1; i < nsectors; ++i) sectors[i-1] = file.slice(i*ssz,(i+1)*ssz);
  446. sectors[nsectors-1] = file.slice(nsectors*ssz);
  447. return sectors;
  448. }
  449. /* [MS-CFB] 2.6.4 Red-Black Tree */
  450. function build_full_paths(FI, FP, Paths) {
  451. var i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;
  452. var dad = [], q = [];
  453. for(; i < pl; ++i) { dad[i]=q[i]=i; FP[i]=Paths[i]; }
  454. for(; j < q.length; ++j) {
  455. i = q[j];
  456. L = FI[i].L; R = FI[i].R; C = FI[i].C;
  457. if(dad[i] === i) {
  458. if(L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];
  459. if(R !== -1 && dad[R] !== R) dad[i] = dad[R];
  460. }
  461. if(C !== -1 /*NOSTREAM*/) dad[C] = i;
  462. if(L !== -1 && i != dad[i]) { dad[L] = dad[i]; if(q.lastIndexOf(L) < j) q.push(L); }
  463. if(R !== -1 && i != dad[i]) { dad[R] = dad[i]; if(q.lastIndexOf(R) < j) q.push(R); }
  464. }
  465. for(i=1; i < pl; ++i) if(dad[i] === i) {
  466. if(R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];
  467. else if(L !== -1 && dad[L] !== L) dad[i] = dad[L];
  468. }
  469. for(i=1; i < pl; ++i) {
  470. if(FI[i].type === 0 /* unknown */) continue;
  471. j = i;
  472. if(j != dad[j]) do {
  473. j = dad[j];
  474. FP[i] = FP[j] + "/" + FP[i];
  475. } while (j !== 0 && -1 !== dad[j] && j != dad[j]);
  476. dad[i] = -1;
  477. }
  478. FP[0] += "/";
  479. for(i=1; i < pl; ++i) {
  480. if(FI[i].type !== 2 /* stream */) FP[i] += "/";
  481. }
  482. }
  483. function get_mfat_entry(entry, payload, mini) {
  484. var start = entry.start, size = entry.size;
  485. //return (payload.slice(start*MSSZ, start*MSSZ + size));
  486. var o = [];
  487. var idx = start;
  488. while(mini && size > 0 && idx >= 0) {
  489. o.push(payload.slice(idx * MSSZ, idx * MSSZ + MSSZ));
  490. size -= MSSZ;
  491. idx = __readInt32LE(mini, idx * 4);
  492. }
  493. if(o.length === 0) return (new_buf(0));
  494. return (bconcat(o).slice(0, entry.size));
  495. }
  496. /** Chase down the rest of the DIFAT chain to build a comprehensive list
  497. DIFAT chains by storing the next sector number as the last 32 bits */
  498. function sleuth_fat(idx, cnt, sectors, ssz, fat_addrs) {
  499. var q = ENDOFCHAIN;
  500. if(idx === ENDOFCHAIN) {
  501. if(cnt !== 0) throw new Error("DIFAT chain shorter than expected");
  502. } else if(idx !== -1 /*FREESECT*/) {
  503. var sector = sectors[idx], m = (ssz>>>2)-1;
  504. if(!sector) return;
  505. for(var i = 0; i < m; ++i) {
  506. if((q = __readInt32LE(sector,i*4)) === ENDOFCHAIN) break;
  507. fat_addrs.push(q);
  508. }
  509. sleuth_fat(__readInt32LE(sector,ssz-4),cnt - 1, sectors, ssz, fat_addrs);
  510. }
  511. }
  512. /** Follow the linked list of sectors for a given starting point */
  513. function get_sector_list(sectors, start, fat_addrs, ssz, chkd) {
  514. var buf = [], buf_chain = [];
  515. if(!chkd) chkd = [];
  516. var modulus = ssz - 1, j = 0, jj = 0;
  517. for(j=start; j>=0;) {
  518. chkd[j] = true;
  519. buf[buf.length] = j;
  520. buf_chain.push(sectors[j]);
  521. var addr = fat_addrs[Math.floor(j*4/ssz)];
  522. jj = ((j*4) & modulus);
  523. if(ssz < 4 + jj) throw new Error("FAT boundary crossed: " + j + " 4 "+ssz);
  524. if(!sectors[addr]) break;
  525. j = __readInt32LE(sectors[addr], jj);
  526. }
  527. return {nodes: buf, data:__toBuffer([buf_chain])};
  528. }
  529. /** Chase down the sector linked lists */
  530. function make_sector_list(sectors, dir_start, fat_addrs, ssz) {
  531. var sl = sectors.length, sector_list = ([]);
  532. var chkd = [], buf = [], buf_chain = [];
  533. var modulus = ssz - 1, i=0, j=0, k=0, jj=0;
  534. for(i=0; i < sl; ++i) {
  535. buf = ([]);
  536. k = (i + dir_start); if(k >= sl) k-=sl;
  537. if(chkd[k]) continue;
  538. buf_chain = [];
  539. for(j=k; j>=0;) {
  540. chkd[j] = true;
  541. buf[buf.length] = j;
  542. buf_chain.push(sectors[j]);
  543. var addr = fat_addrs[Math.floor(j*4/ssz)];
  544. jj = ((j*4) & modulus);
  545. if(ssz < 4 + jj) throw new Error("FAT boundary crossed: " + j + " 4 "+ssz);
  546. if(!sectors[addr]) break;
  547. j = __readInt32LE(sectors[addr], jj);
  548. }
  549. sector_list[k] = ({nodes: buf, data:__toBuffer([buf_chain])});
  550. }
  551. return sector_list;
  552. }
  553. /* [MS-CFB] 2.6.1 Compound File Directory Entry */
  554. function read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex, mini) {
  555. var minifat_store = 0, pl = (Paths.length?2:0);
  556. var sector = sector_list[dir_start].data;
  557. var i = 0, namelen = 0, name;
  558. for(; i < sector.length; i+= 128) {
  559. var blob = sector.slice(i, i+128);
  560. prep_blob(blob, 64);
  561. namelen = blob.read_shift(2);
  562. name = __utf16le(blob,0,namelen-pl);
  563. Paths.push(name);
  564. var o = ({
  565. name: name,
  566. type: blob.read_shift(1),
  567. color: blob.read_shift(1),
  568. L: blob.read_shift(4, 'i'),
  569. R: blob.read_shift(4, 'i'),
  570. C: blob.read_shift(4, 'i'),
  571. clsid: blob.read_shift(16),
  572. state: blob.read_shift(4, 'i'),
  573. start: 0,
  574. size: 0
  575. });
  576. var ctime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);
  577. if(ctime !== 0) o.ct = read_date(blob, blob.l-8);
  578. var mtime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);
  579. if(mtime !== 0) o.mt = read_date(blob, blob.l-8);
  580. o.start = blob.read_shift(4, 'i');
  581. o.size = blob.read_shift(4, 'i');
  582. if(o.size < 0 && o.start < 0) { o.size = o.type = 0; o.start = ENDOFCHAIN; o.name = ""; }
  583. if(o.type === 5) { /* root */
  584. minifat_store = o.start;
  585. if(nmfs > 0 && minifat_store !== ENDOFCHAIN) sector_list[minifat_store].name = "!StreamData";
  586. /*minifat_size = o.size;*/
  587. } else if(o.size >= 4096 /* MSCSZ */) {
  588. o.storage = 'fat';
  589. if(sector_list[o.start] === undefined) sector_list[o.start] = get_sector_list(sectors, o.start, sector_list.fat_addrs, sector_list.ssz);
  590. sector_list[o.start].name = o.name;
  591. o.content = (sector_list[o.start].data.slice(0,o.size));
  592. } else {
  593. o.storage = 'minifat';
  594. if(o.size < 0) o.size = 0;
  595. else if(minifat_store !== ENDOFCHAIN && o.start !== ENDOFCHAIN && sector_list[minifat_store]) {
  596. o.content = get_mfat_entry(o, sector_list[minifat_store].data, (sector_list[mini]||{}).data);
  597. }
  598. }
  599. if(o.content) prep_blob(o.content, 0);
  600. files[name] = o;
  601. FileIndex.push(o);
  602. }
  603. }
  604. function read_date(blob, offset) {
  605. return new Date(( ( (__readUInt32LE(blob,offset+4)/1e7)*Math.pow(2,32)+__readUInt32LE(blob,offset)/1e7 ) - 11644473600)*1000);
  606. }
  607. function read_file(filename, options) {
  608. get_fs();
  609. return parse(fs.readFileSync(filename), options);
  610. }
  611. function read(blob, options) {
  612. switch(options && options.type || "base64") {
  613. case "file": return read_file(blob, options);
  614. case "base64": return parse(s2a(Base64.decode(blob)), options);
  615. case "binary": return parse(s2a(blob), options);
  616. }
  617. return parse(blob, options);
  618. }
  619. function init_cfb(cfb, opts) {
  620. var o = opts || {}, root = o.root || "Root Entry";
  621. if(!cfb.FullPaths) cfb.FullPaths = [];
  622. if(!cfb.FileIndex) cfb.FileIndex = [];
  623. if(cfb.FullPaths.length !== cfb.FileIndex.length) throw new Error("inconsistent CFB structure");
  624. if(cfb.FullPaths.length === 0) {
  625. cfb.FullPaths[0] = root + "/";
  626. cfb.FileIndex[0] = ({ name: root, type: 5 });
  627. }
  628. if(o.CLSID) cfb.FileIndex[0].clsid = o.CLSID;
  629. seed_cfb(cfb);
  630. }
  631. function seed_cfb(cfb) {
  632. var nm = "\u0001Sh33tJ5";
  633. if(CFB.find(cfb, "/" + nm)) return;
  634. var p = new_buf(4); p[0] = 55; p[1] = p[3] = 50; p[2] = 54;
  635. cfb.FileIndex.push(({ name: nm, type: 2, content:p, size:4, L:69, R:69, C:69 }));
  636. cfb.FullPaths.push(cfb.FullPaths[0] + nm);
  637. rebuild_cfb(cfb);
  638. }
  639. function rebuild_cfb(cfb, f) {
  640. init_cfb(cfb);
  641. var gc = false, s = false;
  642. for(var i = cfb.FullPaths.length - 1; i >= 0; --i) {
  643. var _file = cfb.FileIndex[i];
  644. switch(_file.type) {
  645. case 0:
  646. if(s) gc = true;
  647. else { cfb.FileIndex.pop(); cfb.FullPaths.pop(); }
  648. break;
  649. case 1: case 2: case 5:
  650. s = true;
  651. if(isNaN(_file.R * _file.L * _file.C)) gc = true;
  652. if(_file.R > -1 && _file.L > -1 && _file.R == _file.L) gc = true;
  653. break;
  654. default: gc = true; break;
  655. }
  656. }
  657. if(!gc && !f) return;
  658. var now = new Date(1987, 1, 19), j = 0;
  659. var data = [];
  660. for(i = 0; i < cfb.FullPaths.length; ++i) {
  661. if(cfb.FileIndex[i].type === 0) continue;
  662. data.push([cfb.FullPaths[i], cfb.FileIndex[i]]);
  663. }
  664. for(i = 0; i < data.length; ++i) {
  665. var dad = dirname(data[i][0]);
  666. s = false;
  667. for(j = 0; j < data.length; ++j) if(data[j][0] === dad) s = true;
  668. if(!s) data.push([dad, ({
  669. name: filename(dad).replace("/",""),
  670. type: 1,
  671. clsid: HEADER_CLSID,
  672. ct: now, mt: now,
  673. content: null
  674. })]);
  675. }
  676. data.sort(function(x,y) { return namecmp(x[0], y[0]); });
  677. cfb.FullPaths = []; cfb.FileIndex = [];
  678. for(i = 0; i < data.length; ++i) { cfb.FullPaths[i] = data[i][0]; cfb.FileIndex[i] = data[i][1]; }
  679. for(i = 0; i < data.length; ++i) {
  680. var elt = cfb.FileIndex[i];
  681. var nm = cfb.FullPaths[i];
  682. elt.name = filename(nm).replace("/","");
  683. elt.L = elt.R = elt.C = -(elt.color = 1);
  684. elt.size = elt.content ? elt.content.length : 0;
  685. elt.start = 0;
  686. elt.clsid = (elt.clsid || HEADER_CLSID);
  687. if(i === 0) {
  688. elt.C = data.length > 1 ? 1 : -1;
  689. elt.size = 0;
  690. elt.type = 5;
  691. } else if(nm.slice(-1) == "/") {
  692. for(j=i+1;j < data.length; ++j) if(dirname(cfb.FullPaths[j])==nm) break;
  693. elt.C = j >= data.length ? -1 : j;
  694. for(j=i+1;j < data.length; ++j) if(dirname(cfb.FullPaths[j])==dirname(nm)) break;
  695. elt.R = j >= data.length ? -1 : j;
  696. elt.type = 1;
  697. } else {
  698. if(dirname(cfb.FullPaths[i+1]||"") == dirname(nm)) elt.R = i + 1;
  699. elt.type = 2;
  700. }
  701. }
  702. }
  703. function _write(cfb, options) {
  704. var _opts = options || {};
  705. rebuild_cfb(cfb);
  706. if(_opts.fileType == 'zip') return write_zip(cfb, _opts);
  707. var L = (function(cfb){
  708. var mini_size = 0, fat_size = 0;
  709. for(var i = 0; i < cfb.FileIndex.length; ++i) {
  710. var file = cfb.FileIndex[i];
  711. if(!file.content) continue;
  712. var flen = file.content.length;
  713. if(flen > 0){
  714. if(flen < 0x1000) mini_size += (flen + 0x3F) >> 6;
  715. else fat_size += (flen + 0x01FF) >> 9;
  716. }
  717. }
  718. var dir_cnt = (cfb.FullPaths.length +3) >> 2;
  719. var mini_cnt = (mini_size + 7) >> 3;
  720. var mfat_cnt = (mini_size + 0x7F) >> 7;
  721. var fat_base = mini_cnt + fat_size + dir_cnt + mfat_cnt;
  722. var fat_cnt = (fat_base + 0x7F) >> 7;
  723. var difat_cnt = fat_cnt <= 109 ? 0 : Math.ceil((fat_cnt-109)/0x7F);
  724. while(((fat_base + fat_cnt + difat_cnt + 0x7F) >> 7) > fat_cnt) difat_cnt = ++fat_cnt <= 109 ? 0 : Math.ceil((fat_cnt-109)/0x7F);
  725. var L = [1, difat_cnt, fat_cnt, mfat_cnt, dir_cnt, fat_size, mini_size, 0];
  726. cfb.FileIndex[0].size = mini_size << 6;
  727. L[7] = (cfb.FileIndex[0].start=L[0]+L[1]+L[2]+L[3]+L[4]+L[5])+((L[6]+7) >> 3);
  728. return L;
  729. })(cfb);
  730. var o = new_buf(L[7] << 9);
  731. var i = 0, T = 0;
  732. {
  733. for(i = 0; i < 8; ++i) o.write_shift(1, HEADER_SIG[i]);
  734. for(i = 0; i < 8; ++i) o.write_shift(2, 0);
  735. o.write_shift(2, 0x003E);
  736. o.write_shift(2, 0x0003);
  737. o.write_shift(2, 0xFFFE);
  738. o.write_shift(2, 0x0009);
  739. o.write_shift(2, 0x0006);
  740. for(i = 0; i < 3; ++i) o.write_shift(2, 0);
  741. o.write_shift(4, 0);
  742. o.write_shift(4, L[2]);
  743. o.write_shift(4, L[0] + L[1] + L[2] + L[3] - 1);
  744. o.write_shift(4, 0);
  745. o.write_shift(4, 1<<12);
  746. o.write_shift(4, L[3] ? L[0] + L[1] + L[2] - 1: ENDOFCHAIN);
  747. o.write_shift(4, L[3]);
  748. o.write_shift(-4, L[1] ? L[0] - 1: ENDOFCHAIN);
  749. o.write_shift(4, L[1]);
  750. for(i = 0; i < 109; ++i) o.write_shift(-4, i < L[2] ? L[1] + i : -1);
  751. }
  752. if(L[1]) {
  753. for(T = 0; T < L[1]; ++T) {
  754. for(; i < 236 + T * 127; ++i) o.write_shift(-4, i < L[2] ? L[1] + i : -1);
  755. o.write_shift(-4, T === L[1] - 1 ? ENDOFCHAIN : T + 1);
  756. }
  757. }
  758. var chainit = function(w) {
  759. for(T += w; i<T-1; ++i) o.write_shift(-4, i+1);
  760. if(w) { ++i; o.write_shift(-4, ENDOFCHAIN); }
  761. };
  762. T = i = 0;
  763. for(T+=L[1]; i<T; ++i) o.write_shift(-4, consts.DIFSECT);
  764. for(T+=L[2]; i<T; ++i) o.write_shift(-4, consts.FATSECT);
  765. chainit(L[3]);
  766. chainit(L[4]);
  767. var j = 0, flen = 0;
  768. var file = cfb.FileIndex[0];
  769. for(; j < cfb.FileIndex.length; ++j) {
  770. file = cfb.FileIndex[j];
  771. if(!file.content) continue;
  772. flen = file.content.length;
  773. if(flen < 0x1000) continue;
  774. file.start = T;
  775. chainit((flen + 0x01FF) >> 9);
  776. }
  777. chainit((L[6] + 7) >> 3);
  778. while(o.l & 0x1FF) o.write_shift(-4, consts.ENDOFCHAIN);
  779. T = i = 0;
  780. for(j = 0; j < cfb.FileIndex.length; ++j) {
  781. file = cfb.FileIndex[j];
  782. if(!file.content) continue;
  783. flen = file.content.length;
  784. if(!flen || flen >= 0x1000) continue;
  785. file.start = T;
  786. chainit((flen + 0x3F) >> 6);
  787. }
  788. while(o.l & 0x1FF) o.write_shift(-4, consts.ENDOFCHAIN);
  789. for(i = 0; i < L[4]<<2; ++i) {
  790. var nm = cfb.FullPaths[i];
  791. if(!nm || nm.length === 0) {
  792. for(j = 0; j < 17; ++j) o.write_shift(4, 0);
  793. for(j = 0; j < 3; ++j) o.write_shift(4, -1);
  794. for(j = 0; j < 12; ++j) o.write_shift(4, 0);
  795. continue;
  796. }
  797. file = cfb.FileIndex[i];
  798. if(i === 0) file.start = file.size ? file.start - 1 : ENDOFCHAIN;
  799. var _nm = (i === 0 && _opts.root) || file.name;
  800. flen = 2*(_nm.length+1);
  801. o.write_shift(64, _nm, "utf16le");
  802. o.write_shift(2, flen);
  803. o.write_shift(1, file.type);
  804. o.write_shift(1, file.color);
  805. o.write_shift(-4, file.L);
  806. o.write_shift(-4, file.R);
  807. o.write_shift(-4, file.C);
  808. if(!file.clsid) for(j = 0; j < 4; ++j) o.write_shift(4, 0);
  809. else o.write_shift(16, file.clsid, "hex");
  810. o.write_shift(4, file.state || 0);
  811. o.write_shift(4, 0); o.write_shift(4, 0);
  812. o.write_shift(4, 0); o.write_shift(4, 0);
  813. o.write_shift(4, file.start);
  814. o.write_shift(4, file.size); o.write_shift(4, 0);
  815. }
  816. for(i = 1; i < cfb.FileIndex.length; ++i) {
  817. file = cfb.FileIndex[i];
  818. if(file.size >= 0x1000) {
  819. o.l = (file.start+1) << 9;
  820. for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
  821. for(; j & 0x1FF; ++j) o.write_shift(1, 0);
  822. }
  823. }
  824. for(i = 1; i < cfb.FileIndex.length; ++i) {
  825. file = cfb.FileIndex[i];
  826. if(file.size > 0 && file.size < 0x1000) {
  827. for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
  828. for(; j & 0x3F; ++j) o.write_shift(1, 0);
  829. }
  830. }
  831. while(o.l < o.length) o.write_shift(1, 0);
  832. return o;
  833. }
  834. /* [MS-CFB] 2.6.4 (Unicode 3.0.1 case conversion) */
  835. function find(cfb, path) {
  836. var UCFullPaths = cfb.FullPaths.map(function(x) { return x.toUpperCase(); });
  837. var UCPaths = UCFullPaths.map(function(x) { var y = x.split("/"); return y[y.length - (x.slice(-1) == "/" ? 2 : 1)]; });
  838. var k = false;
  839. if(path.charCodeAt(0) === 47 /* "/" */) { k = true; path = UCFullPaths[0].slice(0, -1) + path; }
  840. else k = path.indexOf("/") !== -1;
  841. var UCPath = path.toUpperCase();
  842. var w = k === true ? UCFullPaths.indexOf(UCPath) : UCPaths.indexOf(UCPath);
  843. if(w !== -1) return cfb.FileIndex[w];
  844. var m = !UCPath.match(chr1);
  845. UCPath = UCPath.replace(chr0,'');
  846. if(m) UCPath = UCPath.replace(chr1,'!');
  847. for(w = 0; w < UCFullPaths.length; ++w) {
  848. if((m ? UCFullPaths[w].replace(chr1,'!') : UCFullPaths[w]).replace(chr0,'') == UCPath) return cfb.FileIndex[w];
  849. if((m ? UCPaths[w].replace(chr1,'!') : UCPaths[w]).replace(chr0,'') == UCPath) return cfb.FileIndex[w];
  850. }
  851. return null;
  852. }
  853. /** CFB Constants */
  854. var MSSZ = 64; /* Mini Sector Size = 1<<6 */
  855. //var MSCSZ = 4096; /* Mini Stream Cutoff Size */
  856. /* 2.1 Compound File Sector Numbers and Types */
  857. var ENDOFCHAIN = -2;
  858. /* 2.2 Compound File Header */
  859. var HEADER_SIGNATURE = 'd0cf11e0a1b11ae1';
  860. var HEADER_SIG = [0xD0, 0xCF, 0x11, 0xE0, 0xA1, 0xB1, 0x1A, 0xE1];
  861. var HEADER_CLSID = '00000000000000000000000000000000';
  862. var consts = {
  863. /* 2.1 Compund File Sector Numbers and Types */
  864. MAXREGSECT: -6,
  865. DIFSECT: -4,
  866. FATSECT: -3,
  867. ENDOFCHAIN: ENDOFCHAIN,
  868. FREESECT: -1,
  869. /* 2.2 Compound File Header */
  870. HEADER_SIGNATURE: HEADER_SIGNATURE,
  871. HEADER_MINOR_VERSION: '3e00',
  872. MAXREGSID: -6,
  873. NOSTREAM: -1,
  874. HEADER_CLSID: HEADER_CLSID,
  875. /* 2.6.1 Compound File Directory Entry */
  876. EntryTypes: ['unknown','storage','stream','lockbytes','property','root']
  877. };
  878. function write_file(cfb, filename, options) {
  879. get_fs();
  880. var o = _write(cfb, options);
  881. fs.writeFileSync(filename, o);
  882. }
  883. function a2s(o) {
  884. var out = new Array(o.length);
  885. for(var i = 0; i < o.length; ++i) out[i] = String.fromCharCode(o[i]);
  886. return out.join("");
  887. }
  888. function write(cfb, options) {
  889. var o = _write(cfb, options);
  890. switch(options && options.type) {
  891. case "file": get_fs(); fs.writeFileSync(options.filename, (o)); return o;
  892. case "binary": return a2s(o);
  893. case "base64": return Base64.encode(a2s(o));
  894. }
  895. return o;
  896. }
  897. /* node < 8.1 zlib does not expose bytesRead, so default to pure JS */
  898. var _zlib;
  899. function use_zlib(zlib) { try {
  900. var InflateRaw = zlib.InflateRaw;
  901. var InflRaw = new InflateRaw();
  902. InflRaw._processChunk(new Uint8Array([3, 0]), InflRaw._finishFlushFlag);
  903. if(InflRaw.bytesRead) _zlib = zlib;
  904. else throw new Error("zlib does not expose bytesRead");
  905. } catch(e) {console.error("cannot use native zlib: " + (e.message || e)); } }
  906. function _inflateRawSync(payload, usz) {
  907. if(!_zlib) return _inflate(payload, usz);
  908. var InflateRaw = _zlib.InflateRaw;
  909. var InflRaw = new InflateRaw();
  910. var out = InflRaw._processChunk(payload.slice(payload.l), InflRaw._finishFlushFlag);
  911. payload.l += InflRaw.bytesRead;
  912. return out;
  913. }
  914. function _deflateRawSync(payload) {
  915. return _zlib ? _zlib.deflateRawSync(payload) : _deflate(payload);
  916. }
  917. var CLEN_ORDER = [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];
  918. /* LEN_ID = [ 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285 ]; */
  919. var LEN_LN = [ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13 , 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258 ];
  920. /* DST_ID = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29 ]; */
  921. var DST_LN = [ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577 ];
  922. function bit_swap_8(n) { var t = (((((n<<1)|(n<<11)) & 0x22110) | (((n<<5)|(n<<15)) & 0x88440))); return ((t>>16) | (t>>8) |t)&0xFF; }
  923. var use_typed_arrays = typeof Uint8Array !== 'undefined';
  924. var bitswap8 = use_typed_arrays ? new Uint8Array(1<<8) : [];
  925. for(var q = 0; q < (1<<8); ++q) bitswap8[q] = bit_swap_8(q);
  926. function bit_swap_n(n, b) {
  927. var rev = bitswap8[n & 0xFF];
  928. if(b <= 8) return rev >>> (8-b);
  929. rev = (rev << 8) | bitswap8[(n>>8)&0xFF];
  930. if(b <= 16) return rev >>> (16-b);
  931. rev = (rev << 8) | bitswap8[(n>>16)&0xFF];
  932. return rev >>> (24-b);
  933. }
  934. /* helpers for unaligned bit reads */
  935. function read_bits_2(buf, bl) { var w = (bl&7), h = (bl>>>3); return ((buf[h]|(w <= 6 ? 0 : buf[h+1]<<8))>>>w)& 0x03; }
  936. function read_bits_3(buf, bl) { var w = (bl&7), h = (bl>>>3); return ((buf[h]|(w <= 5 ? 0 : buf[h+1]<<8))>>>w)& 0x07; }
  937. function read_bits_4(buf, bl) { var w = (bl&7), h = (bl>>>3); return ((buf[h]|(w <= 4 ? 0 : buf[h+1]<<8))>>>w)& 0x0F; }
  938. function read_bits_5(buf, bl) { var w = (bl&7), h = (bl>>>3); return ((buf[h]|(w <= 3 ? 0 : buf[h+1]<<8))>>>w)& 0x1F; }
  939. function read_bits_7(buf, bl) { var w = (bl&7), h = (bl>>>3); return ((buf[h]|(w <= 1 ? 0 : buf[h+1]<<8))>>>w)& 0x7F; }
  940. /* works up to n = 3 * 8 + 1 = 25 */
  941. function read_bits_n(buf, bl, n) {
  942. var w = (bl&7), h = (bl>>>3), f = ((1<<n)-1);
  943. var v = buf[h] >>> w;
  944. if(n < 8 - w) return v & f;
  945. v |= buf[h+1]<<(8-w);
  946. if(n < 16 - w) return v & f;
  947. v |= buf[h+2]<<(16-w);
  948. if(n < 24 - w) return v & f;
  949. v |= buf[h+3]<<(24-w);
  950. return v & f;
  951. }
  952. /* until ArrayBuffer#realloc is a thing, fake a realloc */
  953. function realloc(b, sz) {
  954. var L = b.length, M = 2*L > sz ? 2*L : sz + 5, i = 0;
  955. if(L >= sz) return b;
  956. if(has_buf) {
  957. var o = new_unsafe_buf(M);
  958. // $FlowIgnore
  959. if(b.copy) b.copy(o);
  960. else for(; i < b.length; ++i) o[i] = b[i];
  961. return o;
  962. } else if(use_typed_arrays) {
  963. var a = new Uint8Array(M);
  964. if(a.set) a.set(b);
  965. else for(; i < b.length; ++i) a[i] = b[i];
  966. return a;
  967. }
  968. b.length = M;
  969. return b;
  970. }
  971. /* zero-filled arrays for older browsers */
  972. function zero_fill_array(n) {
  973. var o = new Array(n);
  974. for(var i = 0; i < n; ++i) o[i] = 0;
  975. return o;
  976. }var _deflate = (function() {
  977. var _deflateRaw = (function() {
  978. return function deflateRaw(data, out) {
  979. var boff = 0;
  980. while(boff < data.length) {
  981. var L = Math.min(0xFFFF, data.length - boff);
  982. var h = boff + L == data.length;
  983. /* TODO: this is only type 0 stored */
  984. out.write_shift(1, +h);
  985. out.write_shift(2, L);
  986. out.write_shift(2, (~L) & 0xFFFF);
  987. while(L-- > 0) out[out.l++] = data[boff++];
  988. }
  989. return out.l;
  990. };
  991. })();
  992. return function(data) {
  993. var buf = new_buf(50+Math.floor(data.length*1.1));
  994. var off = _deflateRaw(data, buf);
  995. return buf.slice(0, off);
  996. };
  997. })();
  998. /* modified inflate function also moves original read head */
  999. /* build tree (used for literals and lengths) */
  1000. function build_tree(clens, cmap, MAX) {
  1001. var maxlen = 1, w = 0, i = 0, j = 0, ccode = 0, L = clens.length;
  1002. var bl_count = use_typed_arrays ? new Uint16Array(32) : zero_fill_array(32);
  1003. for(i = 0; i < 32; ++i) bl_count[i] = 0;
  1004. for(i = L; i < MAX; ++i) clens[i] = 0;
  1005. L = clens.length;
  1006. var ctree = use_typed_arrays ? new Uint16Array(L) : zero_fill_array(L); // []
  1007. /* build code tree */
  1008. for(i = 0; i < L; ++i) {
  1009. bl_count[(w = clens[i])]++;
  1010. if(maxlen < w) maxlen = w;
  1011. ctree[i] = 0;
  1012. }
  1013. bl_count[0] = 0;
  1014. for(i = 1; i <= maxlen; ++i) bl_count[i+16] = (ccode = (ccode + bl_count[i-1])<<1);
  1015. for(i = 0; i < L; ++i) {
  1016. ccode = clens[i];
  1017. if(ccode != 0) ctree[i] = bl_count[ccode+16]++;
  1018. }
  1019. /* cmap[maxlen + 4 bits] = (off&15) + (lit<<4) reverse mapping */
  1020. var cleni = 0;
  1021. for(i = 0; i < L; ++i) {
  1022. cleni = clens[i];
  1023. if(cleni != 0) {
  1024. ccode = bit_swap_n(ctree[i], maxlen)>>(maxlen-cleni);
  1025. for(j = (1<<(maxlen + 4 - cleni)) - 1; j>=0; --j)
  1026. cmap[ccode|(j<<cleni)] = (cleni&15) | (i<<4);
  1027. }
  1028. }
  1029. return maxlen;
  1030. }
  1031. var fix_lmap = use_typed_arrays ? new Uint16Array(512) : zero_fill_array(512);
  1032. var fix_dmap = use_typed_arrays ? new Uint16Array(32) : zero_fill_array(32);
  1033. if(!use_typed_arrays) {
  1034. for(var i = 0; i < 512; ++i) fix_lmap[i] = 0;
  1035. for(i = 0; i < 32; ++i) fix_dmap[i] = 0;
  1036. }
  1037. (function() {
  1038. var dlens = [];
  1039. var i = 0;
  1040. for(;i<32; i++) dlens.push(5);
  1041. build_tree(dlens, fix_dmap, 32);
  1042. var clens = [];
  1043. i = 0;
  1044. for(; i<=143; i++) clens.push(8);
  1045. for(; i<=255; i++) clens.push(9);
  1046. for(; i<=279; i++) clens.push(7);
  1047. for(; i<=287; i++) clens.push(8);
  1048. build_tree(clens, fix_lmap, 288);
  1049. })();
  1050. var dyn_lmap = use_typed_arrays ? new Uint16Array(32768) : zero_fill_array(32768);
  1051. var dyn_dmap = use_typed_arrays ? new Uint16Array(32768) : zero_fill_array(32768);
  1052. var dyn_cmap = use_typed_arrays ? new Uint16Array(128) : zero_fill_array(128);
  1053. var dyn_len_1 = 1, dyn_len_2 = 1;
  1054. /* 5.5.3 Expanding Huffman Codes */
  1055. function dyn(data, boff) {
  1056. /* nomenclature from RFC1951 refers to bit values; these are offset by the implicit constant */
  1057. var _HLIT = read_bits_5(data, boff) + 257; boff += 5;
  1058. var _HDIST = read_bits_5(data, boff) + 1; boff += 5;
  1059. var _HCLEN = read_bits_4(data, boff) + 4; boff += 4;
  1060. var w = 0;
  1061. /* grab and store code lengths */
  1062. var clens = use_typed_arrays ? new Uint8Array(19) : zero_fill_array(19);
  1063. var ctree = [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ];
  1064. var maxlen = 1;
  1065. var bl_count = use_typed_arrays ? new Uint8Array(8) : zero_fill_array(8);
  1066. var next_code = use_typed_arrays ? new Uint8Array(8) : zero_fill_array(8);
  1067. var L = clens.length; /* 19 */
  1068. for(var i = 0; i < _HCLEN; ++i) {
  1069. clens[CLEN_ORDER[i]] = w = read_bits_3(data, boff);
  1070. if(maxlen < w) maxlen = w;
  1071. bl_count[w]++;
  1072. boff += 3;
  1073. }
  1074. /* build code tree */
  1075. var ccode = 0;
  1076. bl_count[0] = 0;
  1077. for(i = 1; i <= maxlen; ++i) next_code[i] = ccode = (ccode + bl_count[i-1])<<1;
  1078. for(i = 0; i < L; ++i) if((ccode = clens[i]) != 0) ctree[i] = next_code[ccode]++;
  1079. /* cmap[7 bits from stream] = (off&7) + (lit<<3) */
  1080. var cleni = 0;
  1081. for(i = 0; i < L; ++i) {
  1082. cleni = clens[i];
  1083. if(cleni != 0) {
  1084. ccode = bitswap8[ctree[i]]>>(8-cleni);
  1085. for(var j = (1<<(7-cleni))-1; j>=0; --j) dyn_cmap[ccode|(j<<cleni)] = (cleni&7) | (i<<3);
  1086. }
  1087. }
  1088. /* read literal and dist codes at once */
  1089. var hcodes = [];
  1090. maxlen = 1;
  1091. for(; hcodes.length < _HLIT + _HDIST;) {
  1092. ccode = dyn_cmap[read_bits_7(data, boff)];
  1093. boff += ccode & 7;
  1094. switch((ccode >>>= 3)) {
  1095. case 16:
  1096. w = 3 + read_bits_2(data, boff); boff += 2;
  1097. ccode = hcodes[hcodes.length - 1];
  1098. while(w-- > 0) hcodes.push(ccode);
  1099. break;
  1100. case 17:
  1101. w = 3 + read_bits_3(data, boff); boff += 3;
  1102. while(w-- > 0) hcodes.push(0);
  1103. break;
  1104. case 18:
  1105. w = 11 + read_bits_7(data, boff); boff += 7;
  1106. while(w -- > 0) hcodes.push(0);
  1107. break;
  1108. default:
  1109. hcodes.push(ccode);
  1110. if(maxlen < ccode) maxlen = ccode;
  1111. break;
  1112. }
  1113. }
  1114. /* build literal / length trees */
  1115. var h1 = hcodes.slice(0, _HLIT), h2 = hcodes.slice(_HLIT);
  1116. for(i = _HLIT; i < 286; ++i) h1[i] = 0;
  1117. for(i = _HDIST; i < 30; ++i) h2[i] = 0;
  1118. dyn_len_1 = build_tree(h1, dyn_lmap, 286);
  1119. dyn_len_2 = build_tree(h2, dyn_dmap, 30);
  1120. return boff;
  1121. }
  1122. /* return [ data, bytesRead ] */
  1123. function inflate(data, usz) {
  1124. /* shortcircuit for empty buffer [0x03, 0x00] */
  1125. if(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }
  1126. /* bit offset */
  1127. var boff = 0;
  1128. /* header includes final bit and type bits */
  1129. var header = 0;
  1130. var outbuf = new_unsafe_buf(usz ? usz : (1<<18));
  1131. var woff = 0;
  1132. var OL = outbuf.length>>>0;
  1133. var max_len_1 = 0, max_len_2 = 0;
  1134. while((header&1) == 0) {
  1135. header = read_bits_3(data, boff); boff += 3;
  1136. if((header >>> 1) == 0) {
  1137. /* Stored block */
  1138. if(boff & 7) boff += 8 - (boff&7);
  1139. /* 2 bytes sz, 2 bytes bit inverse */
  1140. var sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;
  1141. boff += 32;
  1142. /* push sz bytes */
  1143. if(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }
  1144. if(typeof data.copy === 'function') {
  1145. // $FlowIgnore
  1146. data.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);
  1147. woff += sz; boff += 8*sz;
  1148. } else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }
  1149. continue;
  1150. } else if((header >>> 1) == 1) {
  1151. /* Fixed Huffman */
  1152. max_len_1 = 9; max_len_2 = 5;
  1153. } else {
  1154. /* Dynamic Huffman */
  1155. boff = dyn(data, boff);
  1156. max_len_1 = dyn_len_1; max_len_2 = dyn_len_2;
  1157. }
  1158. if(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }
  1159. for(;;) { // while(true) is apparently out of vogue in modern JS circles
  1160. /* ingest code and move read head */
  1161. var bits = read_bits_n(data, boff, max_len_1);
  1162. var code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];
  1163. boff += code & 15; code >>>= 4;
  1164. /* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */
  1165. if(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;
  1166. else if(code == 256) break;
  1167. else {
  1168. code -= 257;
  1169. var len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;
  1170. var tgt = woff + LEN_LN[code];
  1171. /* length extra bits */
  1172. if(len_eb > 0) {
  1173. tgt += read_bits_n(data, boff, len_eb);
  1174. boff += len_eb;
  1175. }
  1176. /* dist code */
  1177. bits = read_bits_n(data, boff, max_len_2);
  1178. code = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];
  1179. boff += code & 15; code >>>= 4;
  1180. var dst_eb = (code < 4 ? 0 : (code-2)>>1);
  1181. var dst = DST_LN[code];
  1182. /* dist extra bits */
  1183. if(dst_eb > 0) {
  1184. dst += read_bits_n(data, boff, dst_eb);
  1185. boff += dst_eb;
  1186. }
  1187. /* in the common case, manual byte copy is faster than TA set / Buffer copy */
  1188. if(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }
  1189. while(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }
  1190. }
  1191. }
  1192. }
  1193. return [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];
  1194. }
  1195. function _inflate(payload, usz) {
  1196. var data = payload.slice(payload.l||0);
  1197. var out = inflate(data, usz);
  1198. payload.l += out[1];
  1199. return out[0];
  1200. }
  1201. function warn_or_throw(wrn, msg) {
  1202. if(wrn) { if(typeof console !== 'undefined') console.error(msg); }
  1203. else throw new Error(msg);
  1204. }
  1205. function parse_zip(file, options) {
  1206. var blob = file;
  1207. prep_blob(blob, 0);
  1208. var FileIndex = [], FullPaths = [];
  1209. var o = {
  1210. FileIndex: FileIndex,
  1211. FullPaths: FullPaths
  1212. };
  1213. init_cfb(o, { root: options.root });
  1214. /* find end of central directory, start just after signature */
  1215. var i = blob.length - 4;
  1216. while((blob[i] != 0x50 || blob[i+1] != 0x4b || blob[i+2] != 0x05 || blob[i+3] != 0x06) && i >= 0) --i;
  1217. blob.l = i + 4;
  1218. /* parse end of central directory */
  1219. blob.l += 4;
  1220. var fcnt = blob.read_shift(2);
  1221. blob.l += 6;
  1222. var start_cd = blob.read_shift(4);
  1223. /* parse central directory */
  1224. blob.l = start_cd;
  1225. for(i = 0; i < fcnt; ++i) {
  1226. /* trust local file header instead of CD entry */
  1227. blob.l += 20;
  1228. var csz = blob.read_shift(4);
  1229. var usz = blob.read_shift(4);
  1230. var namelen = blob.read_shift(2);
  1231. var efsz = blob.read_shift(2);
  1232. var fcsz = blob.read_shift(2);
  1233. blob.l += 8;
  1234. var offset = blob.read_shift(4);
  1235. var EF = parse_extra_field(blob.slice(blob.l+namelen, blob.l+namelen+efsz));
  1236. blob.l += namelen + efsz + fcsz;
  1237. var L = blob.l;
  1238. blob.l = offset + 4;
  1239. parse_local_file(blob, csz, usz, o, EF);
  1240. blob.l = L;
  1241. }
  1242. return o;
  1243. }
  1244. /* head starts just after local file header signature */
  1245. function parse_local_file(blob, csz, usz, o, EF) {
  1246. /* [local file header] */
  1247. blob.l += 2;
  1248. var flags = blob.read_shift(2);
  1249. var meth = blob.read_shift(2);
  1250. var date = parse_dos_date(blob);
  1251. if(flags & 0x2041) throw new Error("Unsupported ZIP encryption");
  1252. var crc32 = blob.read_shift(4);
  1253. var _csz = blob.read_shift(4);
  1254. var _usz = blob.read_shift(4);
  1255. var namelen = blob.read_shift(2);
  1256. var efsz = blob.read_shift(2);
  1257. // TODO: flags & (1<<11) // UTF8
  1258. var name = ""; for(var i = 0; i < namelen; ++i) name += String.fromCharCode(blob[blob.l++]);
  1259. if(efsz) {
  1260. var ef = parse_extra_field(blob.slice(blob.l, blob.l + efsz));
  1261. if((ef[0x5455]||{}).mt) date = ef[0x5455].mt;
  1262. if(((EF||{})[0x5455]||{}).mt) date = EF[0x5455].mt;
  1263. }
  1264. blob.l += efsz;
  1265. /* [encryption header] */
  1266. /* [file data] */
  1267. var data = blob.slice(blob.l, blob.l + _csz);
  1268. switch(meth) {
  1269. case 8: data = _inflateRawSync(blob, _usz); break;
  1270. case 0: break;
  1271. default: throw new Error("Unsupported ZIP Compression method " + meth);
  1272. }
  1273. /* [data descriptor] */
  1274. var wrn = false;
  1275. if(flags & 8) {
  1276. crc32 = blob.read_shift(4);
  1277. if(crc32 == 0x08074b50) { crc32 = blob.read_shift(4); wrn = true; }
  1278. _csz = blob.read_shift(4);
  1279. _usz = blob.read_shift(4);
  1280. }
  1281. if(_csz != csz) warn_or_throw(wrn, "Bad compressed size: " + csz + " != " + _csz);
  1282. if(_usz != usz) warn_or_throw(wrn, "Bad uncompressed size: " + usz + " != " + _usz);
  1283. var _crc32 = CRC32.buf(data, 0);
  1284. if((crc32>>0) != (_crc32>>0)) warn_or_throw(wrn, "Bad CRC32 checksum: " + crc32 + " != " + _crc32);
  1285. cfb_add(o, name, data, {unsafe: true, mt: date});
  1286. }
  1287. function write_zip(cfb, options) {
  1288. var _opts = options || {};
  1289. var out = [], cdirs = [];
  1290. var o = new_buf(1);
  1291. var method = (_opts.compression ? 8 : 0), flags = 0;
  1292. var desc = false;
  1293. if(desc) flags |= 8;
  1294. var i = 0, j = 0;
  1295. var start_cd = 0, fcnt = 0;
  1296. var root = cfb.FullPaths[0], fp = root, fi = cfb.FileIndex[0];
  1297. var crcs = [];
  1298. var sz_cd = 0;
  1299. for(i = 1; i < cfb.FullPaths.length; ++i) {
  1300. fp = cfb.FullPaths[i].slice(root.length); fi = cfb.FileIndex[i];
  1301. if(!fi.size || !fi.content || fp == "\u0001Sh33tJ5") continue;
  1302. var start = start_cd;
  1303. /* TODO: CP437 filename */
  1304. var namebuf = new_buf(fp.length);
  1305. for(j = 0; j < fp.length; ++j) namebuf.write_shift(1, fp.charCodeAt(j) & 0x7F);
  1306. namebuf = namebuf.slice(0, namebuf.l);
  1307. crcs[fcnt] = CRC32.buf(fi.content, 0);
  1308. var outbuf = fi.content;
  1309. if(method == 8) outbuf = _deflateRawSync(outbuf);
  1310. /* local file header */
  1311. o = new_buf(30);
  1312. o.write_shift(4, 0x04034b50);
  1313. o.write_shift(2, 20);
  1314. o.write_shift(2, flags);
  1315. o.write_shift(2, method);
  1316. /* TODO: last mod file time/date */
  1317. if(fi.mt) write_dos_date(o, fi.mt);
  1318. else o.write_shift(4, 0);
  1319. o.write_shift(-4, (flags & 8) ? 0 : crcs[fcnt]);
  1320. o.write_shift(4, (flags & 8) ? 0 : outbuf.length);
  1321. o.write_shift(4, (flags & 8) ? 0 : fi.content.length);
  1322. o.write_shift(2, namebuf.length);
  1323. o.write_shift(2, 0);
  1324. start_cd += o.length;
  1325. out.push(o);
  1326. start_cd += namebuf.length;
  1327. out.push(namebuf);
  1328. /* TODO: encryption header ? */
  1329. start_cd += outbuf.length;
  1330. out.push(outbuf);
  1331. /* data descriptor */
  1332. if(flags & 8) {
  1333. o = new_buf(12);
  1334. o.write_shift(-4, crcs[fcnt]);
  1335. o.write_shift(4, outbuf.length);
  1336. o.write_shift(4, fi.content.length);
  1337. start_cd += o.l;
  1338. out.push(o);
  1339. }
  1340. /* central directory */
  1341. o = new_buf(46);
  1342. o.write_shift(4, 0x02014b50);
  1343. o.write_shift(2, 0);
  1344. o.write_shift(2, 20);
  1345. o.write_shift(2, flags);
  1346. o.write_shift(2, method);
  1347. o.write_shift(4, 0); /* TODO: last mod file time/date */
  1348. o.write_shift(-4, crcs[fcnt]);
  1349. o.write_shift(4, outbuf.length);
  1350. o.write_shift(4, fi.content.length);
  1351. o.write_shift(2, namebuf.length);
  1352. o.write_shift(2, 0);
  1353. o.write_shift(2, 0);
  1354. o.write_shift(2, 0);
  1355. o.write_shift(2, 0);
  1356. o.write_shift(4, 0);
  1357. o.write_shift(4, start);
  1358. sz_cd += o.l;
  1359. cdirs.push(o);
  1360. sz_cd += namebuf.length;
  1361. cdirs.push(namebuf);
  1362. ++fcnt;
  1363. }
  1364. /* end of central directory */
  1365. o = new_buf(22);
  1366. o.write_shift(4, 0x06054b50);
  1367. o.write_shift(2, 0);
  1368. o.write_shift(2, 0);
  1369. o.write_shift(2, fcnt);
  1370. o.write_shift(2, fcnt);
  1371. o.write_shift(4, sz_cd);
  1372. o.write_shift(4, start_cd);
  1373. o.write_shift(2, 0);
  1374. return bconcat(([bconcat((out)), bconcat(cdirs), o]));
  1375. }
  1376. function cfb_new(opts) {
  1377. var o = ({});
  1378. init_cfb(o, opts);
  1379. return o;
  1380. }
  1381. function cfb_add(cfb, name, content, opts) {
  1382. var unsafe = opts && opts.unsafe;
  1383. if(!unsafe) init_cfb(cfb);
  1384. var file = !unsafe && CFB.find(cfb, name);
  1385. if(!file) {
  1386. var fpath = cfb.FullPaths[0];
  1387. if(name.slice(0, fpath.length) == fpath) fpath = name;
  1388. else {
  1389. if(fpath.slice(-1) != "/") fpath += "/";
  1390. fpath = (fpath + name).replace("//","/");
  1391. }
  1392. file = ({name: filename(name), type: 2});
  1393. cfb.FileIndex.push(file);
  1394. cfb.FullPaths.push(fpath);
  1395. if(!unsafe) CFB.utils.cfb_gc(cfb);
  1396. }
  1397. file.content = (content);
  1398. file.size = content ? content.length : 0;
  1399. if(opts) {
  1400. if(opts.CLSID) file.clsid = opts.CLSID;
  1401. if(opts.mt) file.mt = opts.mt;
  1402. if(opts.ct) file.ct = opts.ct;
  1403. }
  1404. return file;
  1405. }
  1406. function cfb_del(cfb, name) {
  1407. init_cfb(cfb);
  1408. var file = CFB.find(cfb, name);
  1409. if(file) for(var j = 0; j < cfb.FileIndex.length; ++j) if(cfb.FileIndex[j] == file) {
  1410. cfb.FileIndex.splice(j, 1);
  1411. cfb.FullPaths.splice(j, 1);
  1412. return true;
  1413. }
  1414. return false;
  1415. }
  1416. function cfb_mov(cfb, old_name, new_name) {
  1417. init_cfb(cfb);
  1418. var file = CFB.find(cfb, old_name);
  1419. if(file) for(var j = 0; j < cfb.FileIndex.length; ++j) if(cfb.FileIndex[j] == file) {
  1420. cfb.FileIndex[j].name = filename(new_name);
  1421. cfb.FullPaths[j] = new_name;
  1422. return true;
  1423. }
  1424. return false;
  1425. }
  1426. function cfb_gc(cfb) { rebuild_cfb(cfb, true); }
  1427. exports.find = find;
  1428. exports.read = read;
  1429. exports.parse = parse;
  1430. exports.write = write;
  1431. exports.writeFile = write_file;
  1432. exports.utils = {
  1433. cfb_new: cfb_new,
  1434. cfb_add: cfb_add,
  1435. cfb_del: cfb_del,
  1436. cfb_mov: cfb_mov,
  1437. cfb_gc: cfb_gc,
  1438. ReadShift: ReadShift,
  1439. CheckField: CheckField,
  1440. prep_blob: prep_blob,
  1441. bconcat: bconcat,
  1442. use_zlib: use_zlib,
  1443. _deflateRaw: _deflate,
  1444. _inflateRaw: _inflate,
  1445. consts: consts
  1446. };
  1447. return exports;
  1448. })();
  1449. if(typeof require !== 'undefined' && typeof module !== 'undefined' && typeof DO_NOT_EXPORT_CFB === 'undefined') { module.exports = CFB; }