Dashboard sipadu mbip
選択できるのは25トピックまでです。 トピックは、先頭が英数字で、英数字とダッシュ('-')を使用した35文字以内のものにしてください。

xlscfb.flow.js 48KB

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