@l1yp/file-viewer 0.1.0

package/dist/lib/binobj.js

@@ -0,0 +1,430 @@
+//#region src/lib/binobj.ts
+var e = class extends Error {
+	constructor(e) {
+		super(e), this.name = "UnsupportedBinaryError";
+	}
+}, t = 2, n = 11, r = 2, i = 10, a = 0, o = {
+	2: "sparc",
+	3: "i386",
+	8: "mips",
+	20: "ppc",
+	21: "ppc64",
+	22: "s390",
+	40: "arm",
+	42: "sh",
+	50: "ia-64",
+	62: "x86-64",
+	183: "aarch64",
+	243: "riscv"
+}, s = {
+	332: "i386",
+	358: "mips",
+	448: "arm",
+	452: "arm-thumb2",
+	512: "ia-64",
+	20580: "riscv64",
+	34404: "x86-64",
+	43620: "aarch64"
+}, c = {
+	0: "local",
+	1: "global",
+	2: "weak"
+}, l = {
+	[r]: "func",
+	[i]: "ifunc"
+}, u = 6, d = 3, f = 4, p = 0, m = 1, h = 14, g = 15, _ = 29, v = 3, y = {
+	1: "可重定位 (REL)",
+	2: "可执行 (EXEC)",
+	3: "共享对象 (DYN/PIE)",
+	4: "核心转储 (CORE)"
+}, b = {
+	0: "System V",
+	1: "HP-UX",
+	2: "NetBSD",
+	3: "Linux",
+	6: "Solaris",
+	7: "AIX",
+	9: "FreeBSD",
+	12: "OpenBSD"
+}, x = {
+	1: "Native",
+	2: "Windows GUI",
+	3: "Windows 控制台",
+	5: "OS/2 控制台",
+	7: "POSIX 控制台",
+	9: "Windows CE GUI",
+	10: "EFI 应用",
+	11: "EFI 启动驱动",
+	12: "EFI 运行时驱动",
+	13: "EFI ROM",
+	14: "Xbox"
+}, S = 3, C = 14, w = 16, T = {
+	CompanyName: "公司",
+	FileDescription: "描述",
+	FileVersion: "文件版本",
+	InternalName: "内部名称",
+	LegalCopyright: "版权",
+	OriginalFilename: "原始文件名",
+	ProductName: "产品",
+	ProductVersion: "产品版本",
+	Comments: "备注",
+	LegalTrademarks: "商标"
+}, E = class {
+	buf;
+	le;
+	dv;
+	constructor(e, t) {
+		this.buf = e, this.le = t, this.dv = new DataView(e);
+	}
+	get length() {
+		return this.dv.byteLength;
+	}
+	u8(e) {
+		return this.dv.getUint8(e);
+	}
+	u16(e) {
+		return this.dv.getUint16(e, this.le);
+	}
+	u32(e) {
+		return this.dv.getUint32(e, this.le);
+	}
+	u64(e) {
+		return Number(this.dv.getBigUint64(e, this.le));
+	}
+	str(e) {
+		if (e < 0 || e >= this.length) return "";
+		let t = e;
+		for (; t < this.length && this.dv.getUint8(t) !== 0;) t++;
+		return new TextDecoder("utf-8").decode(new Uint8Array(this.buf, e, t - e));
+	}
+	slice(e, t) {
+		if (e < 0 || e >= this.length || t <= 0) return new Uint8Array();
+		let n = Math.min(this.length, e + t);
+		return new Uint8Array(this.buf.slice(e, n));
+	}
+	utf16(e, t) {
+		let n = Math.min(this.length, e + t), r = "";
+		for (let t = e; t + 1 < n; t += 2) {
+			let e = this.dv.getUint16(t, !0);
+			if (e === 0) break;
+			r += String.fromCharCode(e);
+		}
+		return r;
+	}
+};
+function D(t) {
+	if (t.byteLength < 64) throw new e("文件过小，不是有效的 ELF/PE");
+	let n = new DataView(t);
+	if (n.getUint32(0, !1) === 2135247942) return O(t);
+	if (n.getUint8(0) === 77 && n.getUint8(1) === 90) return M(t);
+	throw new e("无法识别的二进制格式（既不是 ELF 也不是 PE）");
+}
+function O(s) {
+	let u = new DataView(s), d = u.getUint8(4), f = u.getUint8(5);
+	if (d !== 1 && d !== 2) throw new e("未知 ELF 位宽");
+	let p = d === 2 ? 64 : 32, m = f !== 2, h = new E(s, m), g = h.u16(18), _ = o[g] ?? `0x${g.toString(16)}`, v = p === 64 ? h.u64(40) : h.u32(32), y = h.u16(p === 64 ? 58 : 46), b = h.u16(p === 64 ? 60 : 48), x = (e) => v + e * y, S = [];
+	for (let e = 0; e < b; e++) {
+		let t = x(e);
+		S.push({
+			type: h.u32(t + 4),
+			offset: p === 64 ? h.u64(t + 24) : h.u32(t + 16),
+			size: p === 64 ? h.u64(t + 32) : h.u32(t + 20),
+			link: h.u32(t + (p === 64 ? 40 : 24)),
+			entsize: p === 64 ? h.u64(t + 56) : h.u32(t + 36)
+		});
+	}
+	let C = S.find((e) => e.type === t), w = S.find((e) => e.type === n), T = C ?? w, D = !C, O = [];
+	try {
+		O = A(h, p, S);
+	} catch {}
+	let k = {
+		format: "elf",
+		arch: _,
+		bits: p,
+		endian: m ? "le" : "be",
+		stripped: D,
+		symbols: [],
+		meta: O
+	};
+	if (!T) return k.note = "未找到符号表（.symtab/.dynsym 均缺失，文件被完全剥离）", k;
+	let j = S[T.link];
+	if (!j) return k.note = "符号表缺少关联的字符串表", k;
+	let M = T.entsize || (p === 64 ? 24 : 16), N = Math.floor(T.size / M), P = [];
+	for (let e = 0; e < N; e++) {
+		let t = T.offset + e * M, n, o, s, u, d;
+		p === 64 ? (n = h.u32(t), o = h.u8(t + 4), s = h.u16(t + 6), u = h.u64(t + 8), d = h.u64(t + 16)) : (n = h.u32(t), u = h.u32(t + 4), d = h.u32(t + 8), o = h.u8(t + 12), s = h.u16(t + 14));
+		let f = o & 15;
+		if (f !== r && f !== i || s === a || n === 0) continue;
+		let m = h.str(j.offset + n);
+		m && P.push({
+			name: m,
+			address: u,
+			size: d || void 0,
+			kind: l[f] ?? "func",
+			bind: c[o >> 4],
+			source: C ? ".symtab" : ".dynsym"
+		});
+	}
+	return P.sort((e, t) => e.address - t.address || e.name.localeCompare(t.name)), k.symbols = P, P.length || (k.note = D ? "动态符号表中没有已定义的函数" : "未找到函数符号"), k;
+}
+var k = (e) => e + 3 & -4;
+function A(e, t, n) {
+	let r = e.u16(16), i = e.u8(7), a = t === 64 ? e.u64(24) : e.u32(24), o = t === 64 ? e.u64(32) : e.u32(28), s = e.u16(t === 64 ? 54 : 42), c = e.u16(t === 64 ? 56 : 44), l = "", v = "";
+	if (o && c && s >= (t === 64 ? 56 : 32)) for (let n = 0; n < c; n++) {
+		let r = o + n * s, i = e.u32(r), a = t === 64 ? e.u64(r + 8) : e.u32(r + 4);
+		i === d ? l = e.str(a).trim() : i === f && !v && (v = j(e, a, t === 64 ? e.u64(r + 32) : e.u32(r + 16)));
+	}
+	let x = "", S = "", C = [], w = n.find((e) => e.type === u);
+	if (w) {
+		let r = n[w.link], i = r ? r.offset : 0, a = w.entsize || (t === 64 ? 16 : 8), o = Math.floor(w.size / a);
+		for (let n = 0; n < o; n++) {
+			let r = w.offset + n * a, o = t === 64 ? e.u64(r) : e.u32(r), s = t === 64 ? e.u64(r + 8) : e.u32(r + 4);
+			if (o === p) break;
+			if (o === m) {
+				let t = e.str(i + s);
+				t && C.push(t);
+			} else o === h ? x = e.str(i + s) : (o === g || o === _) && (S = e.str(i + s));
+		}
+	}
+	let T = [
+		{
+			label: "类型",
+			value: y[r] ?? `0x${r.toString(16)}`
+		},
+		{
+			label: "ABI",
+			value: b[i] ?? `0x${i.toString(16)}`
+		},
+		{
+			label: "入口",
+			value: `0x${a.toString(16)}`
+		}
+	];
+	return l && T.push({
+		label: "解释器",
+		value: l
+	}), x && T.push({
+		label: "SONAME",
+		value: x
+	}), C.length && T.push({
+		label: `依赖 (${C.length})`,
+		value: C.join(", ")
+	}), S && T.push({
+		label: "RPATH",
+		value: S
+	}), v && T.push({
+		label: "构建 ID",
+		value: v
+	}), T;
+}
+function j(e, t, n) {
+	let r = t, i = t + n;
+	for (; r + 12 <= i;) {
+		let t = e.u32(r), n = e.u32(r + 4), i = e.u32(r + 8), a = t ? e.str(r + 12) : "", o = r + 12 + k(t);
+		if (i === v && a === "GNU" && n > 0) return Array.from(e.slice(o, n)).map((e) => e.toString(16).padStart(2, "0")).join("");
+		let s = o + k(n);
+		if (s <= r) break;
+		r = s;
+	}
+	return "";
+}
+function M(t) {
+	let n = new E(t, !0), r = n.u32(60);
+	if (n.u32(r) !== 17744) throw new e("缺少 PE 签名");
+	let i = r + 4, a = n.u16(i), o = s[a] ?? `0x${a.toString(16)}`, c = n.u16(i + 2), l = n.u32(i + 8), u = n.u16(i + 18), d = n.u16(i + 16), f = i + 20, p = n.u16(f) === 523 ? 64 : 32, m = {
+		format: "pe",
+		arch: o,
+		bits: p,
+		endian: "le",
+		stripped: !0,
+		symbols: [],
+		meta: []
+	};
+	if (d === 0) return m.note = "该 PE 无可选头", m;
+	let h = [], g = f + d;
+	for (let e = 0; e < c; e++) {
+		let t = g + e * 40;
+		h.push({
+			vsize: n.u32(t + 8),
+			va: n.u32(t + 12),
+			rawSize: n.u32(t + 16),
+			raw: n.u32(t + 20)
+		});
+	}
+	let _ = (e) => {
+		for (let t of h) {
+			let n = Math.max(t.vsize, t.rawSize);
+			if (e >= t.va && e < t.va + n) return e - t.va + t.raw;
+		}
+		return null;
+	};
+	m.meta.push({
+		label: "类型",
+		value: u & 8192 ? "动态链接库 (DLL)" : "可执行文件 (EXE)"
+	});
+	let v = n.u16(f + 68);
+	m.meta.push({
+		label: "子系统",
+		value: x[v] ?? `0x${v.toString(16)}`
+	}), m.meta.push({
+		label: "入口",
+		value: `0x${n.u32(f + 16).toString(16)}`
+	});
+	let y = p === 64 ? n.u64(f + 24) : n.u32(f + 28);
+	m.meta.push({
+		label: "镜像基址",
+		value: `0x${y.toString(16)}`
+	}), l > 0 && l < 4294967295 && m.meta.push({
+		label: "链接时间",
+		value: N(l)
+	});
+	let b = f + (p === 64 ? 112 : 96), S = (() => {
+		let e = n.u32(b + 16);
+		return e ? _(e) : null;
+	})();
+	if (S != null) {
+		try {
+			for (let [e, t] of L(n, S, _)) m.meta.push({
+				label: T[e] ?? e,
+				value: t
+			});
+		} catch {}
+		try {
+			let e = B(n, S, _);
+			e && (m.iconDataUrl = e);
+		} catch {}
+	}
+	let C = n.u32(b);
+	if (!C) return m.note = "该 PE 没有导出表（无导出函数）", m;
+	let w = _(C);
+	if (w == null) return m.note = "导出表 RVA 无法定位", m;
+	let D = n.u32(w + 16), O = n.u32(w + 24), k = _(n.u32(w + 28)), A = _(n.u32(w + 32)), j = _(n.u32(w + 36));
+	if (k == null || A == null || j == null) return m.note = "导出表结构无法定位", m;
+	let M = [];
+	for (let e = 0; e < O; e++) {
+		let t = _(n.u32(A + e * 4)), r = t == null ? "" : n.str(t);
+		if (!r) continue;
+		let i = n.u16(j + e * 2), a = n.u32(k + i * 4);
+		M.push({
+			name: r,
+			address: a,
+			kind: "export",
+			source: "export",
+			ordinal: D + i
+		});
+	}
+	return M.sort((e, t) => e.address - t.address || e.name.localeCompare(t.name)), m.symbols = M, !M.length && !m.note && (m.note = "导出表中没有具名函数"), m;
+}
+function N(e) {
+	return (/* @__PURE__ */ new Date(e * 1e3)).toISOString().slice(0, 10);
+}
+function P(e, t) {
+	let n = e.u16(t + 12), r = e.u16(t + 14), i = [];
+	for (let a = 0; a < n + r; a++) {
+		let n = t + 16 + a * 8, r = e.u32(n), o = e.u32(n + 4);
+		i.push({
+			id: r & 2147483647,
+			named: (r & 2147483648) != 0,
+			isDir: (o & 2147483648) != 0,
+			offset: o & 2147483647
+		});
+	}
+	return i;
+}
+function F(e, t, n) {
+	let r = n(e.u32(t));
+	return r == null ? null : {
+		off: r,
+		size: e.u32(t + 4)
+	};
+}
+function I(e, t, n, r, i) {
+	let a = P(e, t).find((e) => !e.named && e.id === n && e.isDir);
+	if (!a) return null;
+	let o = P(e, t + a.offset), s = r == null ? o[0] : o.find((e) => !e.named && e.id === r);
+	if (!s) return null;
+	let c = t + s.offset;
+	if (s.isDir) {
+		let n = P(e, t + s.offset)[0];
+		if (!n || n.isDir) return null;
+		c = t + n.offset;
+	}
+	return F(e, c, i);
+}
+function L(e, t, n) {
+	let r = I(e, t, w, null, n);
+	return r ? z(e, r.off, r.size) : [];
+}
+function R(e, t) {
+	let n = e.u16(t), r = e.u16(t + 2), i = e.u16(t + 4), a = e.utf16(t + 6, 512), o = k(t + 6 + (a.length + 1) * 2), s = i === 1 ? r * 2 : r;
+	return {
+		key: a,
+		length: n,
+		valOff: o,
+		valLen: s,
+		wType: i,
+		childOff: k(o + s)
+	};
+}
+function z(e, t, n) {
+	let r = [], i = t + n, a = R(e, t);
+	if (a.key !== "VS_VERSION_INFO" || a.length === 0) return r;
+	let o = Math.min(i, t + a.length), s = a.childOff;
+	for (; s + 6 <= o;) {
+		let t = R(e, s);
+		if (t.length === 0) break;
+		if (t.key === "StringFileInfo") {
+			let n = Math.min(o, s + t.length), i = t.childOff;
+			for (; i + 6 <= n;) {
+				let t = R(e, i);
+				if (t.length === 0) break;
+				let a = Math.min(n, i + t.length), o = t.childOff;
+				for (; o + 6 <= a;) {
+					let t = R(e, o);
+					if (t.length === 0) break;
+					let n = t.wType === 1 ? e.utf16(t.valOff, t.valLen + 2).trim() : "";
+					t.key && n && r.push([t.key, n]), o = k(o + t.length);
+				}
+				i = k(i + t.length);
+			}
+			break;
+		}
+		s = k(s + t.length);
+	}
+	return r;
+}
+function B(e, t, n) {
+	let r = I(e, t, C, null, n);
+	if (!r) return null;
+	let i = e.u16(r.off + 4);
+	if (!i) return null;
+	let a = -1, o = -1;
+	for (let t = 0; t < i; t++) {
+		let n = r.off + 6 + t * 14, i = (e.u8(n) || 256) * (e.u8(n + 1) || 256) * 1e3 + e.u16(n + 6);
+		i > o && (o = i, a = t);
+	}
+	if (a < 0) return null;
+	let s = r.off + 6 + a * 14, c = {
+		w: e.u8(s),
+		h: e.u8(s + 1),
+		colorCount: e.u8(s + 2),
+		planes: e.u16(s + 4),
+		bitCount: e.u16(s + 6),
+		bytesInRes: e.u32(s + 8),
+		iconId: e.u16(s + 12)
+	}, l = I(e, t, S, c.iconId, n);
+	if (!l) return null;
+	let u = e.slice(l.off, Math.min(l.size, c.bytesInRes || l.size));
+	return u.length ? u.length > 8 && u[0] === 137 && u[1] === 80 && u[2] === 78 && u[3] === 71 ? `data:image/png;base64,${H(u)}` : `data:image/x-icon;base64,${H(V(c, u))}` : null;
+}
+function V(e, t) {
+	let n = new Uint8Array(22 + t.length), r = new DataView(n.buffer);
+	return r.setUint16(2, 1, !0), r.setUint16(4, 1, !0), n[6] = e.w & 255, n[7] = e.h & 255, n[8] = e.colorCount & 255, r.setUint16(10, e.planes, !0), r.setUint16(12, e.bitCount, !0), r.setUint32(14, t.length, !0), r.setUint32(18, 22, !0), n.set(t, 22), n;
+}
+function H(e) {
+	let t = "", n = 32768;
+	for (let r = 0; r < e.length; r += n) t += String.fromCharCode(...e.subarray(r, r + n));
+	return btoa(t);
+}
+//#endregion
+export { e as UnsupportedBinaryError, D as parseBinObj };

package/dist/lib/brotli.d.ts

@@ -0,0 +1,14 @@
+/**
+ * In-browser Brotli decompression, wrapping the WASM decoder (brotli-dec-wasm).
+ *
+ * Browsers ship native gzip/deflate (DecompressionStream) but NOT Brotli, and a faithful Brotli decoder is
+ * far too large to hand-roll (it carries a ~120KB static dictionary plus context modeling). So — like rar —
+ * this leans on a compiled WASM decoder: brotli-dec-wasm's `web` (wasm-bindgen) build, decode-only, ~250KB.
+ * The wasm is fetched as a same-origin asset (Vite emits it via the `?url` import) and instantiated from the
+ * fetched bytes (no streaming, so the server's wasm MIME type is irrelevant). Pulled in lazily by
+ * {@link lib/tarball} only when a `.br` / `.tar.br` is actually opened.
+ *
+ * Brotli is a raw stream with no magic bytes, so callers route to it by extension, not by sniffing.
+ */
+/** Decompress a complete Brotli stream into its raw bytes. */
+export declare function brotliDecode(data: Uint8Array): Promise<Uint8Array>;

package/dist/lib/brotli.js

@@ -0,0 +1,16 @@
+import e, { decompress as t } from "brotli-dec-wasm/web";
+import n from "brotli-dec-wasm/web/bg.wasm?url";
+//#region src/lib/brotli.ts
+var r = null;
+function i() {
+	return r ||= (async () => {
+		let t = await fetch(n);
+		if (!t.ok) throw Error(`无法加载 brotli wasm（HTTP ${t.status}）`);
+		await e({ module_or_path: await t.arrayBuffer() });
+	})(), r;
+}
+async function a(e) {
+	return await i(), t(e);
+}
+//#endregion
+export { a as brotliDecode };

package/dist/lib/bzip2.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Minimal in-browser bzip2 decoder — no dependency, no WASM.
+ *
+ * Browsers ship a native gzip/deflate inflate (DecompressionStream) but nothing for bzip2's Burrows–Wheeler
+ * pipeline, so — like {@link lib/lzma} does for 7z — the tar-family reader ({@link lib/tarball}) carries its
+ * own. This is a from-scratch port of the bzip2 block format (the algorithm Julian Seward's reference
+ * `bzip2`/libbzip2 implements): a bit reader, canonical-Huffman group tables, the MTF + RLE2 symbol decode,
+ * the inverse Burrows–Wheeler transform, and the final RLE1 run expansion.
+ *
+ * One synchronous entry point, {@link bzip2Decode}, returns the full decompressed bytes. Randomized blocks
+ * (a pre-0.9.5 quirk modern bzip2 never emits) and malformed streams are surfaced as errors.
+ */
+/** Decode a complete bzip2 stream ("BZh" + level + one or more blocks) into its raw bytes. */
+export declare function bzip2Decode(data: Uint8Array): Uint8Array;

package/dist/lib/bzip2.js

@@ -0,0 +1,161 @@
+//#region src/lib/bzip2.ts
+var e = 3227993, t = 2511705, n = 1536581, r = 3690640, i = 0, a = 1, o = class {
+	data;
+	pos = 0;
+	buf = 0;
+	count = 0;
+	constructor(e) {
+		this.data = e;
+	}
+	bit() {
+		return this.count === 0 && (this.buf = this.pos < this.data.length ? this.data[this.pos++] : 0, this.count = 8), this.count--, this.buf >> this.count & 1;
+	}
+	bits(e) {
+		let t = 0;
+		for (let n = 0; n < e; n++) t = t << 1 | this.bit();
+		return t;
+	}
+};
+function s(e, t) {
+	let n = 32, r = 0;
+	for (let i = 0; i < t; i++) e[i] > r && (r = e[i]), e[i] < n && (n = e[i]);
+	let i = new Int32Array(t), a = 0;
+	for (let o = n; o <= r; o++) for (let n = 0; n < t; n++) e[n] === o && (i[a++] = n);
+	let o = new Int32Array(r + 2);
+	for (let n = 0; n < t; n++) o[e[n] + 1]++;
+	for (let e = 1; e < o.length; e++) o[e] += o[e - 1];
+	let s = new Int32Array(r + 2), c = 0;
+	for (let e = n; e <= r; e++) c += o[e + 1] - o[e], s[e] = c - 1, c <<= 1;
+	for (let e = n + 1; e <= r; e++) o[e] = (s[e - 1] + 1 << 1) - o[e];
+	return {
+		minLen: n,
+		maxLen: r,
+		limit: s,
+		base: o,
+		perm: i
+	};
+}
+function c(e, t) {
+	let n = t.minLen, r = e.bits(n);
+	for (; n <= t.maxLen && r > t.limit[n];) n++, r = r << 1 | e.bit();
+	return t.perm[r - t.base[n]];
+}
+function l(e, t) {
+	if (e.bits(16), e.bits(16), e.bit() !== 0) throw Error("不支持随机化的 bzip2 块");
+	let n = e.bits(24), r = e.bits(16), o = [];
+	for (let t = 0; t < 16; t++) if (r & 32768 >> t) {
+		let n = e.bits(16);
+		for (let e = 0; e < 16; e++) n & 32768 >> e && o.push(t * 16 + e);
+	}
+	let l = o.length;
+	if (l === 0) throw Error("bzip2 块符号表为空");
+	let d = l + 2, f = d - 1, p = e.bits(3);
+	if (p < 2 || p > 6) throw Error("bzip2 Huffman 组数非法");
+	let m = e.bits(15), h = new Int32Array(p);
+	for (let e = 0; e < p; e++) h[e] = e;
+	let g = new Uint8Array(m);
+	for (let t = 0; t < m; t++) {
+		let n = 0;
+		for (; e.bit() === 1;) if (n++, n >= p) throw Error("bzip2 选择器越界");
+		let r = h[n];
+		for (let e = n; e > 0; e--) h[e] = h[e - 1];
+		h[0] = r, g[t] = r;
+	}
+	let _ = [];
+	for (let t = 0; t < p; t++) {
+		let t = new Uint8Array(d), n = e.bits(5);
+		for (let r = 0; r < d; r++) {
+			for (;;) {
+				if (n < 1 || n > 20) throw Error("bzip2 码长非法");
+				if (e.bit() === 0) break;
+				e.bit() === 0 ? n++ : n--;
+			}
+			t[r] = n;
+		}
+		_.push(s(t, d));
+	}
+	let v = new Uint32Array(t), y = new Int32Array(256), b = o.slice(), x = 0, S = -1, C = 0, w = _[0], T = () => {
+		if (C === 0) {
+			if (S++, S >= m) throw Error("bzip2 选择器不足");
+			C = 50, w = _[g[S]];
+		}
+		return C--, c(e, w);
+	}, E = T();
+	for (; E !== f;) {
+		if (E === i || E === a) {
+			let e = -1, n = 1;
+			do
+				E === i ? e += n : e += n << 1, n <<= 1, E = T();
+			while (E === i || E === a);
+			e++;
+			let r = b[0];
+			if (y[r] += e, x + e > t) throw Error("bzip2 块溢出");
+			for (; e-- > 0;) v[x++] = r;
+			continue;
+		}
+		let e = E - 1, n = b[e];
+		for (let t = e; t > 0; t--) b[t] = b[t - 1];
+		if (b[0] = n, y[n]++, x >= t) throw Error("bzip2 块溢出");
+		v[x++] = n, E = T();
+	}
+	if (n >= x) throw Error("bzip2 origPtr 越界");
+	let D = new Int32Array(257);
+	for (let e = 0; e < 256; e++) D[e + 1] = y[e];
+	for (let e = 1; e <= 256; e++) D[e] += D[e - 1];
+	for (let e = 0; e < x; e++) {
+		let t = v[e] & 255;
+		v[D[t]] |= e << 8, D[t]++;
+	}
+	let O = v[n] >>> 8, k = new Uint8Array(x);
+	for (let e = 0; e < x; e++) O = v[O], k[e] = O & 255, O >>>= 8;
+	let A = new u(x), j = 0;
+	for (; j < x;) {
+		let e = k[j], t = 1;
+		for (; j + t < x && t < 4 && k[j + t] === e;) t++;
+		if (A.pushRepeat(e, t), j += t, t === 4) {
+			let t = k[j];
+			A.pushRepeat(e, t), j++;
+		}
+	}
+	return A.slice();
+}
+var u = class {
+	buf;
+	len = 0;
+	constructor(e) {
+		this.buf = new Uint8Array(Math.max(64, e));
+	}
+	ensure(e) {
+		let t = this.len + e;
+		if (t <= this.buf.length) return;
+		let n = this.buf.length * 2;
+		for (; n < t;) n *= 2;
+		let r = new Uint8Array(n);
+		r.set(this.buf.subarray(0, this.len)), this.buf = r;
+	}
+	pushRepeat(e, t) {
+		t <= 0 || (this.ensure(t), this.buf.fill(e, this.len, this.len + t), this.len += t);
+	}
+	slice() {
+		return this.buf.slice(0, this.len);
+	}
+};
+function d(i) {
+	if (i.length < 4 || i[0] !== 66 || i[1] !== 90 || i[2] !== 104) throw Error("不是有效的 bzip2 文件");
+	let a = i[3] - 48;
+	if (a < 1 || a > 9) throw Error("bzip2 块大小非法");
+	let s = a * 1e5, c = new o(i.subarray(4)), u = [];
+	for (;;) {
+		let i = c.bits(24), a = c.bits(24);
+		if (i === n && a === r) break;
+		if (i !== e || a !== t) throw Error("bzip2 块标记损坏");
+		u.push(l(c, s + 10));
+	}
+	let d = 0;
+	for (let e of u) d += e.length;
+	let f = new Uint8Array(d), p = 0;
+	for (let e of u) f.set(e, p), p += e.length;
+	return f;
+}
+//#endregion
+export { d as bzip2Decode };