git-fs-s3 0.4.0 → 0.5.0

package/dist/http.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/http/index.ts","../src/http/info-refs.ts","../src/edge-utils.ts","../src/ops/branch.ts","../src/refs.ts","../src/http/pkt-line.ts","../src/http/types.ts","../src/http/reachability.ts","../src/http/receive-pack.ts","../src/http/repack.ts","../src/pack-files.ts","../src/http/pack-reuse.ts","../src/http/upload-pack.ts"],"sourcesContent":["export {\n\ttype GitService,\n\thandleInfoRefs,\n\ttype InfoRefsOptions,\n\tlistAllRefs,\n} from \"./info-refs.js\";\nexport {\n\tFLUSH,\n\tparsePktLines,\n\tpktLine,\n\tpktLineBuffer,\n\tsideBandPackfile,\n} from \"./pkt-line.js\";\nexport {\n\tcollectReachableOids,\n\ttype ReachabilityResult,\n} from \"./reachability.js\";\nexport {\n\ttype ApplyReceivePackOptions,\n\tapplyReceivePack,\n\tapplyRefUpdates,\n\tensureRepoInitialized,\n\tindexIncomingPack,\n\tparseReceivePackBody,\n\ttype RefUpdateCommand,\n\ttype RefUpdateResult,\n\treceivePackResponse,\n} from \"./receive-pack.js\";\nexport {\n\tREPACK_PACK_COUNT_THRESHOLD,\n\ttype RepackOptions,\n\trepackRepository,\n} from \"./repack.js\";\nexport {\n\ttype GitHttpResult,\n\ttype HttpHooks,\n\ttype RawFsPromises,\n\trawFs,\n} from \"./types.js\";\nexport { handleUploadPack, type UploadPackOptions } from \"./upload-pack.js\";\n","import git from \"isomorphic-git\";\nimport { concat } from \"../edge-utils.js\";\nimport {\n\tlistBranches,\n\tlistLooseRefNames,\n\tresolveLooseRefFast,\n} from \"../ops/branch.js\";\nimport type { Repo } from \"../ops/types.js\";\nimport { FLUSH, pktLine } from \"./pkt-line.js\";\nimport { type GitHttpResult, type HttpHooks, runStep } from \"./types.js\";\n\nexport type GitService = \"git-upload-pack\" | \"git-receive-pack\";\n\n/** All refs with resolved oids, plus the symref HEAD should advertise. */\nexport async function listAllRefs(repo: Repo, defaultBranch = \"main\") {\n\tconst [branches, tagNames] = await Promise.all([\n\t\tlistBranches(repo),\n\t\tlistLooseRefNames(repo, \"refs/tags\").then(\n\t\t\t(names) => names ?? git.listTags(repo),\n\t\t),\n\t]);\n\tconst tagRefs = await Promise.all(\n\t\ttagNames.map(async (tag) => {\n\t\t\tconst name = `refs/tags/${tag}`;\n\t\t\treturn resolveLooseRefFast(repo, name)\n\t\t\t\t.then((oid) => ({ name, oid }))\n\t\t\t\t.catch(() => null);\n\t\t}),\n\t);\n\tconst branchRefs = branches.map((b) => ({\n\t\tname: `refs/heads/${b.name}`,\n\t\toid: b.commit,\n\t}));\n\tconst defaultRef = branches.find((b) => b.isDefault);\n\tconst headSymref = defaultRef\n\t\t? `refs/heads/${defaultRef.name}`\n\t\t: await Promise.resolve(git.currentBranch({ ...repo, fullname: true }))\n\t\t\t\t.then((cb) => cb ?? `refs/heads/${defaultBranch}`)\n\t\t\t\t.catch(() => `refs/heads/${defaultBranch}`);\n\n\t// HEAD in a bare repo is almost always a symref to a branch whose oid\n\t// branchRefs already resolved above with one direct GET each — reuse it\n\t// instead of a second, separate resolveRef(\"HEAD\") call. isomorphic-git's\n\t// ref resolution runs its full multi-candidate expansion (refs/%s,\n\t// refs/tags/%s, refs/heads/%s, refs/remotes/%s, refs/remotes/%s/HEAD)\n\t// even when the symref target is already fully qualified, which used to\n\t// cost several guaranteed-404 R2 reads on every clone/fetch. Falls back\n\t// to the slow-but-correct path only when that lookup misses: detached\n\t// HEAD (points at a raw sha, not a symref) or a symref to a branch that\n\t// doesn't exist yet (freshly initialized, still-empty repo).\n\tconst headOid =\n\t\tbranchRefs.find((r) => r?.name === headSymref)?.oid ??\n\t\t(await git.resolveRef({ ...repo, ref: \"HEAD\" }).catch(() => null));\n\n\tconst refs: Array<{ name: string; oid: string }> = [];\n\tif (headOid) refs.push({ name: \"HEAD\", oid: headOid });\n\tfor (const r of branchRefs) if (r) refs.push(r);\n\tfor (const r of tagRefs) if (r) refs.push(r);\n\n\treturn { refs, headSymref };\n}\n\nexport interface InfoRefsOptions {\n\tservice: GitService;\n\tdefaultBranch?: string;\n\t/** Advertised in the agent capability. Default \"git-fs-s3\". */\n\tagent?: string;\n}\n\n/**\n * `GET …/info/refs?service=…` — the ref advertisement. Authentication and\n * authorization are the caller's job before invoking this.\n *\n * Capabilities advertised match what the sibling handlers implement:\n * side-band-64k (honored by handleUploadPack's response framing — clients\n * like isomorphic-git unconditionally expect it), tip/reachable sha1 wants,\n * delete-refs and report-status for pushes.\n */\nexport async function handleInfoRefs(\n\trepo: Repo,\n\toptions: InfoRefsOptions,\n\thooks?: HttpHooks,\n): Promise<GitHttpResult> {\n\tconst { service } = options;\n\tconst agent = options.agent ?? \"git-fs-s3\";\n\tconst { refs, headSymref } = await runStep(hooks, \"listAllRefs\", () =>\n\t\tlistAllRefs(repo, options.defaultBranch ?? \"main\"),\n\t);\n\n\tconst isUpload = service === \"git-upload-pack\";\n\tconst caps = isUpload\n\t\t? `no-progress side-band-64k symref=HEAD:${headSymref} allow-tip-sha1-in-want allow-reachable-sha1-in-want agent=${agent}`\n\t\t: `delete-refs report-status no-done agent=${agent}`;\n\n\tconst parts: Uint8Array[] = [pktLine(`# service=${service}\\n`), FLUSH];\n\n\tif (refs.length === 0) {\n\t\t// Empty repo: git needs this exact sentinel\n\t\tparts.push(\n\t\t\tpktLine(\n\t\t\t\t`0000000000000000000000000000000000000000 capabilities^{}\\0${caps}\\n`,\n\t\t\t),\n\t\t);\n\t} else {\n\t\tlet first = true;\n\t\tfor (const { name, oid } of refs) {\n\t\t\tparts.push(\n\t\t\t\tpktLine(first ? `${oid} ${name}\\0${caps}\\n` : `${oid} ${name}\\n`),\n\t\t\t);\n\t\t\tfirst = false;\n\t\t}\n\t}\n\tparts.push(FLUSH);\n\n\treturn {\n\t\tstatus: 200,\n\t\theaders: {\n\t\t\t\"Content-Type\": `application/x-${service}-advertisement`,\n\t\t\t\"Cache-Control\": \"no-cache\",\n\t\t},\n\t\tbody: concat(...parts),\n\t};\n}\n","/**\n * Edge-compatible utilities replacing node:crypto, node:zlib, and Buffer.\n *\n * Every function here uses only Web APIs (SubtleCrypto, CompressionStream,\n * TextEncoder/TextDecoder) — no Node built-ins. They work on Cloudflare\n * Workers, Vercel Edge, Deno Deploy, and Node >= 18.\n */\n\nconst textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\n\n// ---------------------------------------------------------------------------\n// Text\n// ---------------------------------------------------------------------------\n\n/**\n * Encode a UTF-8 string to bytes.\n *\n * Return type pinned to `Uint8Array<ArrayBuffer>` (not the bare `Uint8Array`,\n * whose default type argument differs across TypeScript versions) so it's\n * always assignable to Fetch API `BodyInit` regardless of a consumer's own\n * TypeScript/lib version.\n */\nexport function encodeUtf8(data: string): Uint8Array<ArrayBuffer> {\n\treturn textEncoder.encode(data);\n}\n\n/** Decode bytes as UTF-8. */\nexport function decodeUtf8(data: Uint8Array): string {\n\treturn textDecoder.decode(data);\n}\n\n/** Decode bytes as ASCII. */\nexport function decodeAscii(data: Uint8Array): string {\n\tlet s = \"\";\n\tfor (let i = 0; i < data.length; i++)\n\t\ts += String.fromCharCode(data[i] as number);\n\treturn s;\n}\n\n// ---------------------------------------------------------------------------\n// Array manipulation\n// ---------------------------------------------------------------------------\n\n/** Concatenate any number of Uint8Arrays into one. */\nexport function concat(...parts: Uint8Array[]): Uint8Array<ArrayBuffer> {\n\tlet total = 0;\n\tfor (const p of parts) total += p.length;\n\tconst out = new Uint8Array(total);\n\tlet offset = 0;\n\tfor (const p of parts) {\n\t\tout.set(p, offset);\n\t\toffset += p.length;\n\t}\n\treturn out;\n}\n\n// ---------------------------------------------------------------------------\n// Encoding\n// ---------------------------------------------------------------------------\n\n/** Uint8Array → lowercase hex string. */\nexport function toHex(data: Uint8Array): string {\n\tlet hex = \"\";\n\tfor (let i = 0; i < data.length; i++)\n\t\thex += (data[i] as number).toString(16).padStart(2, \"0\");\n\treturn hex;\n}\n\n/** Uint8Array → base64 string. */\nexport function toBase64(data: Uint8Array): string {\n\tlet binary = \"\";\n\tfor (let i = 0; i < data.length; i++)\n\t\tbinary += String.fromCharCode(data[i] as number);\n\treturn btoa(binary);\n}\n\n/** Hex string → Uint8Array. */\nexport function fromHex(hex: string): Uint8Array<ArrayBuffer> {\n\tconst bytes = new Uint8Array(hex.length / 2);\n\tfor (let i = 0; i < bytes.length; i++) {\n\t\tbytes[i] = Number.parseInt(hex.slice(i * 2, i * 2 + 2), 16);\n\t}\n\treturn bytes;\n}\n\n// ---------------------------------------------------------------------------\n// Crypto\n// ---------------------------------------------------------------------------\n\n/** SHA-1 hash via Web Crypto API. Returns a hex string. */\nexport async function sha1(data: Uint8Array | string): Promise<string> {\n\tconst bytes = typeof data === \"string\" ? encodeUtf8(data) : data;\n\tconst hash = await globalThis.crypto.subtle.digest(\"SHA-1\", bytes);\n\treturn toHex(new Uint8Array(hash));\n}\n\n// ---------------------------------------------------------------------------\n// Compression\n// ---------------------------------------------------------------------------\n\n/**\n * Deflate compress via the CompressionStream Web API.\n * Falls back to throwing if CompressionStream is unavailable (very old runtimes).\n */\nexport async function deflate(\n\tdata: Uint8Array,\n): Promise<Uint8Array<ArrayBuffer>> {\n\tconst stream = new Blob([data])\n\t\t.stream()\n\t\t.pipeThrough(new CompressionStream(\"deflate\"));\n\treturn new Uint8Array(await new Response(stream).arrayBuffer());\n}\n\n// ---------------------------------------------------------------------------\n// Binary detection (replaces Buffer.includes(0) pattern)\n// ---------------------------------------------------------------------------\n\n/** Check if a Uint8Array contains a null byte. */\nexport function hasNullByte(data: Uint8Array): boolean {\n\treturn data.includes(0);\n}\n\n/**\n * Read a blob as text or binary metadata — the edge-compatible replacement\n * for the `Buffer.from(blob)` pattern used throughout diff.ts and history.ts.\n */\nexport function readBlobContent(blob: Uint8Array): {\n\tisBinary: boolean;\n\ttext: string;\n\tbytes: Uint8Array;\n} {\n\tconst isBinary = hasNullByte(blob);\n\treturn {\n\t\tisBinary,\n\t\ttext: isBinary ? \"\" : decodeUtf8(blob),\n\t\tbytes: blob,\n\t};\n}\n","import git from \"isomorphic-git\";\nimport { GitInvalidRequestError } from \"../git-errors.js\";\nimport { isSafeBranchName } from \"../refs.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface Branch {\n\tname: string;\n\tcommit: string;\n\tisDefault: boolean;\n}\n\n/**\n * Defense in depth for every branch-name argument below: `git.deleteBranch`\n * and raw resolveRef/writeRef reads don't validate ref names internally the\n * way `git.branch` does (see refs.ts) — guard at the point the primitives are\n * actually called, not just at an API boundary far above.\n */\nexport function assertSafeBranchName(name: string): void {\n\tif (!isSafeBranchName(name)) {\n\t\tthrow new GitInvalidRequestError(`Invalid branch name: ${name}`);\n\t}\n}\n\nconst FULL_SHA_RE = /^[0-9a-f]{40}$/i;\n\ntype RecursiveFileLister = {\n\tlistFilesRecursively(dirpath: string): Promise<string[]>;\n};\n\nfunction hasRecursiveFileLister(\n\tfs: Repo[\"fs\"],\n): fs is Repo[\"fs\"] & RecursiveFileLister {\n\treturn (\n\t\ttypeof fs === \"object\" &&\n\t\tfs !== null &&\n\t\t\"listFilesRecursively\" in fs &&\n\t\ttypeof (fs as Partial<RecursiveFileLister>).listFilesRecursively ===\n\t\t\t\"function\"\n\t);\n}\n\ntype PromisesFs = {\n\treadFile(path: string, encoding: \"utf8\"): Promise<string | Uint8Array>;\n};\n\n// Repo.fs is typed as isomorphic-git's own fs union (promise- or\n// callback-based) since that's what git.readTree's signature allows, but\n// every fs this package actually constructs (git-fs.ts) is promise-based —\n// this just keeps the callback-style branch honest instead of crashing on\n// it. Shared by every loose-ref fast path below instead of each repeating\n// the same cast + presence check.\nfunction getPromisesFs(fs: Repo[\"fs\"]): PromisesFs | null {\n\tconst promises = (fs as { promises?: PromisesFs }).promises;\n\treturn promises ?? null;\n}\n\nfunction decodeFileContent(content: string | Uint8Array): string {\n\treturn typeof content === \"string\"\n\t\t? content\n\t\t: new TextDecoder().decode(content);\n}\n\n/**\n * Lists loose branch names without isomorphic-git's recursive readdir/stat\n * traversal. Object stores already return only leaf keys in a recursive LIST,\n * so this is one request regardless of branch-name nesting. Ordinary\n * filesystems retain isomorphic-git's implementation and packed refs remain\n * supported there.\n */\nasync function listLooseBranches(repo: Repo): Promise<string[] | null> {\n\treturn listLooseRefNames(repo, \"refs/heads\");\n}\n\n/**\n * Loose ref names under `dir` (e.g. `refs/tags`) in one recursive listing,\n * or `null` when the fs can't list recursively (use isomorphic-git's walk).\n */\nexport async function listLooseRefNames(\n\trepo: Repo,\n\tdir: \"refs/heads\" | \"refs/tags\",\n): Promise<string[] | null> {\n\tif (!hasRecursiveFileLister(repo.fs)) return null;\n\tconst names = await repo.fs.listFilesRecursively(`${repo.gitdir}/${dir}`);\n\treturn names.filter(isSafeBranchName);\n}\n\n/** Read packed branch refs so the object-store fast path preserves Git semantics. */\nasync function readPackedBranches(repo: Repo): Promise<Map<string, string>> {\n\tif (!hasRecursiveFileLister(repo.fs)) return new Map();\n\tconst promisesFs = getPromisesFs(repo.fs);\n\tif (!promisesFs) return new Map();\n\ttry {\n\t\tconst content = await promisesFs.readFile(\n\t\t\t`${repo.gitdir}/packed-refs`,\n\t\t\t\"utf8\",\n\t\t);\n\t\tconst refs = new Map<string, string>();\n\t\tfor (const line of decodeFileContent(content).split(\"\\n\")) {\n\t\t\tconst match = /^([0-9a-f]{40}) refs\\/heads\\/(.+)$/i.exec(line);\n\t\t\tif (match?.[1] && match[2] && isSafeBranchName(match[2])) {\n\t\t\t\trefs.set(match[2], match[1]);\n\t\t\t}\n\t\t}\n\t\treturn refs;\n\t} catch {\n\t\treturn new Map();\n\t}\n}\n\n/** Read the symbolic HEAD directly when the object-store fs is available. */\nasync function getCurrentLooseBranch(repo: Repo): Promise<string | null> {\n\tif (!hasRecursiveFileLister(repo.fs)) return null;\n\tconst promisesFs = getPromisesFs(repo.fs);\n\tif (!promisesFs) return null;\n\ttry {\n\t\tconst content = await promisesFs.readFile(`${repo.gitdir}/HEAD`, \"utf8\");\n\t\tconst head = decodeFileContent(content).trim();\n\t\tconst match = /^ref: refs\\/heads\\/(.+)$/.exec(head);\n\t\treturn match?.[1] && isSafeBranchName(match[1]) ? match[1] : null;\n\t} catch {\n\t\treturn null;\n\t}\n}\n\n/**\n * Resolve a fully-qualified ref's oid with one read instead of isomorphic-\n * git's own `resolveRef`, which does a stat *then* a read for a loose ref\n * (two round trips against object storage) — wasteful specifically here,\n * where the caller already knows the ref exists (it came from a directory\n * listing moments earlier). Reads the loose file directly and falls back to\n * `git.resolveRef` only when that doesn't pan out (packed-refs, or anything\n * else the plain-loose-file assumption doesn't cover), so correctness for\n * those cases is unchanged — this only removes the redundant round trip on\n * the common path.\n */\nexport async function resolveLooseRefFast(\n\trepo: Repo,\n\tref: string,\n): Promise<string> {\n\tconst promisesFs = getPromisesFs(repo.fs);\n\tif (promisesFs) {\n\t\ttry {\n\t\t\tconst content = await promisesFs.readFile(\n\t\t\t\t`${repo.gitdir}/${ref}`,\n\t\t\t\t\"utf8\",\n\t\t\t);\n\t\t\tconst oid = decodeFileContent(content).trim();\n\t\t\tif (FULL_SHA_RE.test(oid)) return oid;\n\t\t} catch {\n\t\t\t// Not a loose file (packed-refs, or genuinely absent) — fall through.\n\t\t}\n\t}\n\treturn git.resolveRef({ ...repo, ref });\n}\n\n/** All branches with their tip commits; [] for an empty repository. */\nexport async function listBranches(repo: Repo): Promise<Branch[]> {\n\ttry {\n\t\tconst [looseBranches, looseCurrentBranch, packedBranches] =\n\t\t\tawait Promise.all([\n\t\t\t\tlistLooseBranches(repo),\n\t\t\t\tgetCurrentLooseBranch(repo),\n\t\t\t\treadPackedBranches(repo),\n\t\t\t]);\n\t\tconst branches =\n\t\t\tlooseBranches === null\n\t\t\t\t? await git.listBranches(repo)\n\t\t\t\t: [...new Set([...looseBranches, ...packedBranches.keys()])].sort();\n\t\tconst currentBranch =\n\t\t\tlooseBranches === null\n\t\t\t\t? await git\n\t\t\t\t\t\t.currentBranch({ ...repo, fullname: false })\n\t\t\t\t\t\t.catch(() => null)\n\t\t\t\t: looseCurrentBranch;\n\n\t\treturn Promise.all(\n\t\t\tbranches.map(async (branch) => {\n\t\t\t\tconst packedCommit = packedBranches.get(branch);\n\t\t\t\treturn {\n\t\t\t\t\tname: branch,\n\t\t\t\t\tcommit:\n\t\t\t\t\t\tpackedCommit && !looseBranches?.includes(branch)\n\t\t\t\t\t\t\t? packedCommit\n\t\t\t\t\t\t\t: await resolveLooseRefFast(repo, `refs/heads/${branch}`),\n\t\t\t\t\tisDefault: branch === currentBranch,\n\t\t\t\t};\n\t\t\t}),\n\t\t);\n\t} catch (err: unknown) {\n\t\tif ((err as { code?: string }).code === \"NotFoundError\") return [];\n\t\tthrow err;\n\t}\n}\n\n/** Create `name` pointing at the tip of `startPoint` (no checkout). */\nexport async function createBranchFrom(\n\trepo: Repo,\n\tname: string,\n\tstartPoint = \"main\",\n): Promise<void> {\n\tassertSafeBranchName(name);\n\tassertSafeBranchName(startPoint);\n\tconst object = await resolveLooseRefFast(repo, `refs/heads/${startPoint}`);\n\tawait git.branch({ ...repo, ref: name, checkout: false, object });\n}\n\n/** Delete a branch ref (validated — deleteBranch has no internal ref check). */\nexport async function deleteBranchByName(\n\trepo: Repo,\n\tname: string,\n): Promise<void> {\n\tassertSafeBranchName(name);\n\tawait git.deleteBranch({ ...repo, ref: name });\n}\n\n/** Throws (NotFoundError) unless the branch resolves. */\nexport async function assertBranchExists(\n\trepo: Repo,\n\tname: string,\n): Promise<void> {\n\tassertSafeBranchName(name);\n\tawait resolveLooseRefFast(repo, `refs/heads/${name}`);\n}\n","/**\n * Git ref-name validation, mirroring isomorphic-git's own internal `isValidRef`\n * character-class rules (the check `git.branch` and top-level `git.writeRef`\n * run before touching disk).\n *\n * Several of isomorphic-git's OTHER ref-touching primitives — `git.commit`,\n * `git.merge`, `git.deleteBranch`, and top-level `git.resolveRef`/\n * `git.deleteRef` — do NOT run this check internally: they resolve straight\n * through `fs.write`/`fs.rm(join(gitdir, ref))` with no jail to the gitdir.\n * On a shared-storage server (many repos under one prefix or base directory),\n * every branch/ref name that originates from request input must be validated\n * against these predicates before it reaches any of those primitives —\n * otherwise a `\"../\"`-laden name lets a caller with write access to any single\n * repo read, corrupt, or delete another repo's ref/object files.\n */\n\nconst BAD_REF_COMPONENT =\n\t// biome-ignore lint/suspicious/noControlCharactersInRegex: control chars are exactly what git's own ref-name rules reject — this needs to match the same range.\n\t/(^|[/.])([/.]|$)|^@$|@\\{|[\\x00-\\x20\\x7f~^:?*[\\\\]|\\.lock(\\/|$)/;\n\nconst FULL_SHA_RE = /^[0-9a-f]{40}$/i;\n\n/** Validates a fully-qualified ref (must start with refs/heads/ or refs/tags/). */\nexport function isSafeFullRefName(ref: string): boolean {\n\tif (!ref.startsWith(\"refs/heads/\") && !ref.startsWith(\"refs/tags/\")) {\n\t\treturn false;\n\t}\n\treturn !BAD_REF_COMPONENT.test(ref);\n}\n\n/**\n * Validates a bare branch name (no refs/ prefix). Rejects anything that looks\n * like a full ref path — a name of `\"refs/heads/x\"` would otherwise sail\n * through unprefixed at call sites that build `refs/heads/${name}` themselves\n * (doubling the prefix into something that still resolves), or be used as-is\n * at call sites that pass a name already containing `\"refs/\"` straight\n * through. Also rejects 40-hex SHA-shaped values so a stored branch name can\n * never be ambiguous with a commit SHA at write time; use\n * {@link isSafeRefName} on read paths that accept both shapes.\n */\nexport function isSafeBranchName(name: string): boolean {\n\tif (!name || name.startsWith(\"refs/\") || name === \"HEAD\") return false;\n\tif (FULL_SHA_RE.test(name)) return false;\n\treturn !BAD_REF_COMPONENT.test(name);\n}\n\n/** True for a full 40-hex-char commit SHA — the shape {@link isSafeBranchName} deliberately rejects. */\nexport function isFullSha(value: string): boolean {\n\treturn FULL_SHA_RE.test(value);\n}\n\n/**\n * Validates a \"ref\" field that may name either a branch or a commit SHA it's\n * pinned to — the shape read-path route params take (permalinks, raw links).\n * Both shapes still go through the traversal check.\n */\nexport function isSafeRefName(value: string): boolean {\n\treturn isSafeBranchName(value) || isFullSha(value);\n}\n\n/**\n * Validates a repo-relative file path from request input: relative, no `..`\n * segments, no `.git/` prefix, no null bytes. Use this anywhere a path\n * segment comes straight off a URL or form field rather than re-deriving the\n * checks ad hoc.\n */\nexport function isSafeRepoPath(p: string): boolean {\n\tif (p.startsWith(\"/\")) return false;\n\tif (p.split(\"/\").some((segment) => segment === \"..\")) return false;\n\tif (/^\\.git(\\/|$)/i.test(p)) return false;\n\tif (p.includes(\"\\0\")) return false;\n\treturn true;\n}\n\n/**\n * Qualify a bare branch name to `refs/heads/<name>` before handing it to\n * isomorphic-git. `resolveRef`/`expand` try several candidate paths in\n * sequence for a bare name — `ref`, `refs/ref`, `refs/tags/ref`,\n * `refs/heads/ref`, … — missing (and, against object storage, paying a real\n * round trip for) the first three every time. For a branch-only ref model,\n * skip straight to the winner. Left untouched: already-qualified refs,\n * `\"HEAD\"` (its own first candidate, already optimal), and 40-hex oids\n * (resolved locally by isomorphic-git with no I/O at all).\n */\nexport function qualifyBranchRef(ref: string): string {\n\tif (ref.startsWith(\"refs/\") || ref === \"HEAD\" || FULL_SHA_RE.test(ref)) {\n\t\treturn ref;\n\t}\n\treturn `refs/heads/${ref}`;\n}\n","/**\n * Git pkt-line framing (smart HTTP protocol wire format).\n *\n * Edge-compatible: uses Uint8Array instead of Buffer.\n */\n\nimport { concat, decodeAscii, decodeUtf8, encodeUtf8 } from \"../edge-utils.js\";\n\n/** Flush packet: exactly four zero bytes. */\nexport const FLUSH: Uint8Array<ArrayBuffer> = new Uint8Array([\n\t0x30, 0x30, 0x30, 0x30,\n]); // \"0000\"\n\n/** Frame a UTF-8 string as one pkt-line. */\nexport function pktLine(data: string): Uint8Array<ArrayBuffer> {\n\tconst body = encodeUtf8(data);\n\tconst len = (body.length + 4).toString(16).padStart(4, \"0\");\n\treturn concat(encodeUtf8(len), body);\n}\n\n/** Frame raw bytes as one pkt-line. */\nexport function pktLineBuffer(body: Uint8Array): Uint8Array<ArrayBuffer> {\n\tconst len = (body.length + 4).toString(16).padStart(4, \"0\");\n\treturn concat(encodeUtf8(len), body);\n}\n\n/** Decode pkt-lines to strings; `null` marks a flush-pkt. Stops on garbage. */\nexport function parsePktLines(buf: Uint8Array): Array<string | null> {\n\tconst lines: Array<string | null> = [];\n\tlet pos = 0;\n\twhile (pos + 4 <= buf.length) {\n\t\tconst len = Number.parseInt(decodeAscii(buf.subarray(pos, pos + 4)), 16);\n\t\tif (len === 0) {\n\t\t\tlines.push(null);\n\t\t\tpos += 4;\n\t\t} else if (len >= 4) {\n\t\t\tlines.push(decodeUtf8(buf.subarray(pos + 4, pos + len)));\n\t\t\tpos += len;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn lines;\n}\n\n/**\n * Per the git protocol, once side-band-64k has been negotiated, packfile\n * bytes in the upload-pack response must be chunked into pkt-lines each\n * prefixed with a control byte (0x01 = packfile data), terminated by a\n * flush-pkt. Without this, clients that don't special-case \"no side-band\" —\n * e.g. isomorphic-git's GitSideBand.demux, which always treats the response\n * as side-band-framed — misparse the raw packfile bytes as bogus pkt-line\n * length headers and spin forever. (Native `git` tolerates a raw unframed\n * stream when side-band isn't negotiated, so this only surfaces with\n * isomorphic-git as the HTTP client.)\n */\nconst SIDE_BAND_MAX_CHUNK = 65515;\n\nexport function sideBandPackfile(\n\tpackData: Uint8Array,\n): Uint8Array<ArrayBuffer> {\n\tconst parts: Uint8Array[] = [];\n\tfor (\n\t\tlet offset = 0;\n\t\toffset < packData.length;\n\t\toffset += SIDE_BAND_MAX_CHUNK\n\t) {\n\t\tconst chunk = packData.subarray(offset, offset + SIDE_BAND_MAX_CHUNK);\n\t\tparts.push(pktLineBuffer(concat(new Uint8Array([1]), chunk)));\n\t}\n\tparts.push(FLUSH);\n\treturn concat(...parts);\n}\n","import type { Repo } from \"../ops/types.js\";\n\n/**\n * Transport-agnostic HTTP response the handlers produce.\n *\n * `body` is pinned to `Uint8Array<ArrayBuffer>` (not the bare `Uint8Array`,\n * whose default type argument isn't consistent across TypeScript versions)\n * so it's always assignable to Fetch API `BodyInit` regardless of which\n * TypeScript/lib version a consumer compiles against — every producer here\n * (`concat`, `pktLine`, `TextEncoder.encode`) is ArrayBuffer-backed already.\n */\nexport interface GitHttpResult {\n\tstatus: number;\n\theaders: Record<string, string>;\n\tbody: Uint8Array<ArrayBuffer>;\n}\n\n/** Optional instrumentation hooks shared by the /http handlers. */\nexport interface HttpHooks {\n\t/** Wrap a timed sub-step. Default: run directly. */\n\tstep?: <T>(label: string, fn: () => Promise<T>) => Promise<T>;\n\t/** Non-fatal problem sink (missing objects, failed repacks). */\n\tonWarn?: (message: string, error?: unknown) => void;\n}\n\nexport const runStep = <T>(\n\thooks: HttpHooks | undefined,\n\tlabel: string,\n\tfn: () => Promise<T>,\n): Promise<T> => (hooks?.step ? hooks.step(label, fn) : fn());\n\n/**\n * The raw promise-fs surface some /http paths need beyond isomorphic-git's\n * plumbing (writing an incoming pack file, listing/deleting pack files).\n * Both `node:fs` and this package's `GitFs` satisfy it via `.promises`.\n */\nexport interface RawFsPromises {\n\treadFile(path: string): Promise<Uint8Array | string>;\n\twriteFile(path: string, data: Uint8Array | string): Promise<void>;\n\tunlink(path: string): Promise<void>;\n\treaddir(path: string): Promise<string[]>;\n\tmkdir(path: string, options?: { recursive?: boolean }): Promise<unknown>;\n\tstat(path: string): Promise<unknown>;\n}\n\n/** Duck-type the `.promises` surface off a repo's fs. */\nexport function rawFs(repo: Repo): RawFsPromises {\n\tconst fs = repo.fs as { promises?: RawFsPromises };\n\tif (!fs?.promises) {\n\t\tthrow new TypeError(\n\t\t\t\"This operation needs a promise fs (`fs.promises`) — node:fs and createGitFs both provide one\",\n\t\t);\n\t}\n\treturn fs.promises;\n}\n","import git from \"isomorphic-git\";\nimport type { Repo } from \"../ops/types.js\";\nimport type { HttpHooks } from \"./types.js\";\n\nexport interface ReachabilityResult {\n\toids: string[];\n\t/**\n\t * False if any object in the graph couldn't be read — repack uses this\n\t * (not a raw object-count comparison) to decide whether it's safe to\n\t * delete old packs: counts alone can't distinguish \"everything read fine\"\n\t * from \"some objects silently failed\".\n\t */\n\tcomplete: boolean;\n}\n\nconst delay = (ms: number) => new Promise((resolve) => setTimeout(resolve, ms));\n\n/**\n * A read landing in the gap between a repack's new consolidated pack being\n * uploaded and the stale-pack cleanup finishing can transiently miss an\n * object that is not actually lost — it exists in the new pack the whole\n * time; the reader's cached pack listing was just taken mid-transition. One\n * retry after a short delay is enough to observe the consistent listing.\n */\nconst MISSING_OBJECT_RETRY_DELAY_MS = 200;\n\n/**\n * Walk the object graph from `startOids`, returning every reachable oid.\n * Concurrent traversal paths are deduplicated promise-per-oid; a missing\n * object is retried once, then reported through `hooks.onWarn` and\n * reflected in `complete: false`.\n *\n * `haveOids` bounds the walk: any oid in this set is assumed already\n * verified (it was reachable from a ref that existed before this call) and\n * is recorded in `seen` without being read or descended into. Without a\n * boundary, every call re-walks the *entire* history from scratch — for\n * receive-pack validation (see receive-pack.ts) that means every push pays\n * for reading every object in the repo, not just the ones it introduced,\n * and one transient read failure anywhere in that whole history rejects an\n * otherwise-valid push.\n *\n * Commits, trees and tags are read once each (parsed). Blobs have no\n * children, so `verifyBlobs: false` records a blob from its tree entry\n * without reading (and inflating) it — for callers that read every blob\n * themselves afterwards anyway, like upload-pack's `packObjects`. Leave it\n * true wherever the walk *is* the existence check (receive-pack, repack).\n */\nexport async function collectReachableOids(\n\trepo: Repo,\n\tstartOids: string[],\n\thooks?: HttpHooks,\n\thaveOids?: ReadonlySet<string> | readonly string[],\n\toptions?: { verifyBlobs?: boolean },\n): Promise<ReachabilityResult> {\n\tconst verifyBlobs = options?.verifyBlobs ?? true;\n\tconst have = haveOids instanceof Set ? haveOids : new Set(haveOids ?? []);\n\tconst seen = new Set<string>();\n\tlet complete = true;\n\tconst promises = new Map<string, Promise<void>>();\n\n\tasync function readAndVisitChildren(oid: string): Promise<void> {\n\t\tconst obj = await git.readObject({ ...repo, oid });\n\t\tseen.add(oid);\n\t\tconst children: [string, string | undefined][] = [];\n\t\tif (obj.type === \"commit\") {\n\t\t\tconst commit = obj.object as { tree: string; parent: string[] };\n\t\t\tchildren.push([commit.tree, \"tree\"]);\n\t\t\tfor (const parent of commit.parent) children.push([parent, \"commit\"]);\n\t\t} else if (obj.type === \"tree\") {\n\t\t\tconst tree = obj.object as { oid: string; type: string }[];\n\t\t\tfor (const entry of tree) {\n\t\t\t\t// Gitlinks (submodules, mode 160000) point at commits in another\n\t\t\t\t// repository; git never stores them here, so following one would\n\t\t\t\t// report a \"missing\" object and fail every walk over that history.\n\t\t\t\tif (entry.type === \"commit\") continue;\n\t\t\t\tchildren.push([entry.oid, entry.type]);\n\t\t\t}\n\t\t} else if (obj.type === \"tag\") {\n\t\t\tchildren.push([(obj.object as { object: string }).object, undefined]);\n\t\t}\n\t\tawait Promise.all(children.map(([child, type]) => visit(child, type)));\n\t}\n\n\tfunction visit(oid: string, type?: string): Promise<void> {\n\t\tconst existing = promises.get(oid);\n\t\tif (existing) return existing;\n\n\t\tif (have.has(oid) || (type === \"blob\" && !verifyBlobs)) {\n\t\t\tseen.add(oid);\n\t\t\tconst p = Promise.resolve();\n\t\t\tpromises.set(oid, p);\n\t\t\treturn p;\n\t\t}\n\n\t\tconst p = (async () => {\n\t\t\ttry {\n\t\t\t\tawait readAndVisitChildren(oid);\n\t\t\t} catch {\n\t\t\t\ttry {\n\t\t\t\t\tawait delay(MISSING_OBJECT_RETRY_DELAY_MS);\n\t\t\t\t\tawait readAndVisitChildren(oid);\n\t\t\t\t} catch (err) {\n\t\t\t\t\tcomplete = false;\n\t\t\t\t\thooks?.onWarn?.(`missing object ${oid}`, err);\n\t\t\t\t}\n\t\t\t}\n\t\t})();\n\n\t\tpromises.set(oid, p);\n\t\treturn p;\n\t}\n\n\tawait Promise.all(startOids.map((oid) => visit(oid)));\n\treturn { oids: Array.from(seen), complete };\n}\n","import git from \"isomorphic-git\";\nimport { concat, decodeAscii, decodeUtf8 } from \"../edge-utils.js\";\nimport type { Repo } from \"../ops/types.js\";\nimport { isSafeFullRefName } from \"../refs.js\";\nimport { FLUSH, pktLine } from \"./pkt-line.js\";\nimport { collectReachableOids } from \"./reachability.js\";\nimport { type RepackOptions, repackRepository } from \"./repack.js\";\nimport { type GitHttpResult, type HttpHooks, rawFs, runStep } from \"./types.js\";\n\nconst ZERO_OID = \"0\".repeat(40);\n\nexport interface RefUpdateCommand {\n\toldOid: string;\n\tnewOid: string;\n\trefName: string;\n}\n\nexport interface RefUpdateResult {\n\trefName: string;\n\tok: boolean;\n\treason?: string;\n}\n\n/** Split a receive-pack body: pkt-line ref commands, flush, then raw PACK. */\nexport function parseReceivePackBody(body: Uint8Array): {\n\trefUpdates: RefUpdateCommand[];\n\tpackData: Uint8Array;\n} {\n\tconst refUpdates: RefUpdateCommand[] = [];\n\tlet pos = 0;\n\twhile (pos + 4 <= body.length) {\n\t\tconst len = Number.parseInt(decodeAscii(body.subarray(pos, pos + 4)), 16);\n\t\tif (len === 0) {\n\t\t\tpos += 4;\n\t\t\tbreak; // flush = end of ref update commands\n\t\t}\n\t\tif (len < 4) break;\n\t\t// Strip NUL-separated capabilities from the first command line\n\t\tconst line = decodeUtf8(body.subarray(pos + 4, pos + len))\n\t\t\t.replace(/\\n$/, \"\")\n\t\t\t.split(\"\\0\")[0];\n\t\tpos += len;\n\t\tconst parts = (line ?? \"\").split(\" \");\n\t\tconst [oldOid, newOid, refName] = parts;\n\t\tif (oldOid && newOid && refName) {\n\t\t\trefUpdates.push({ oldOid, newOid, refName });\n\t\t}\n\t}\n\treturn { refUpdates, packData: body.subarray(pos) };\n}\n\n/** Initialize the repo when its HEAD doesn't exist yet (first push). */\nexport async function ensureRepoInitialized(\n\trepo: Repo,\n\tdefaultBranch = \"main\",\n): Promise<void> {\n\tconst fsp = rawFs(repo);\n\ttry {\n\t\tawait fsp.stat(`${repo.gitdir}/HEAD`);\n\t} catch {\n\t\tawait fsp.mkdir(repo.gitdir, { recursive: true }).catch(() => {});\n\t\tawait git.init({ ...repo, dir: repo.gitdir, defaultBranch, bare: true });\n\t}\n}\n\n/** Write the incoming PACK into objects/pack/ and index it. */\nexport async function indexIncomingPack(\n\trepo: Repo,\n\tpackData: Uint8Array,\n\thooks?: HttpHooks,\n): Promise<string[]> {\n\tif (packData.length < 4) return [];\n\tconst packName = await runStep(\n\t\thooks,\n\t\t\"write + indexPack incoming pack\",\n\t\tasync () => {\n\t\t\tconst fsp = rawFs(repo);\n\t\t\tconst packDir = `${repo.gitdir}/objects/pack`;\n\t\t\tawait fsp.mkdir(packDir, { recursive: true });\n\n\t\t\tconst packName = `recv-${Date.now()}`;\n\t\t\tawait fsp.writeFile(`${packDir}/${packName}.pack`, packData);\n\n\t\t\tawait git.indexPack({\n\t\t\t\t...repo,\n\t\t\t\tdir: packDir,\n\t\t\t\tfilepath: `${packName}.pack`,\n\t\t\t});\n\t\t\treturn packName;\n\t\t},\n\t);\n\treturn [\n\t\t`${repo.gitdir}/objects/pack/${packName}.pack`,\n\t\t`${repo.gitdir}/objects/pack/${packName}.idx`,\n\t];\n}\n\n/**\n * Validate a ref name and compare-and-swap it against its claimed current\n * oid. Returns the failure result to report if either check fails, or\n * `null` when both pass — shared by the preflight check (`validateRefUpdates`,\n * run before the possibly-slow pack indexing/graph-walk work, purely to\n * avoid doing that work for an update already doomed to fail) and the real\n * atomicity guarantee (`applyRefUpdates`, run again right before writing,\n * since a concurrent push could have moved the ref in the time that work\n * took).\n */\nasync function checkRefCas(\n\trepo: Repo,\n\trefName: string,\n\toldOid: string,\n): Promise<RefUpdateResult | null> {\n\tif (!isSafeFullRefName(refName)) {\n\t\treturn { refName, ok: false, reason: \"invalid ref name\" };\n\t}\n\tconst currentOid = await git\n\t\t.resolveRef({ ...repo, ref: refName })\n\t\t.catch(() => ZERO_OID);\n\treturn currentOid === oldOid\n\t\t? null\n\t\t: {\n\t\t\t\trefName,\n\t\t\t\tok: false,\n\t\t\t\treason: \"non-fast-forward, ref updated by another push\",\n\t\t\t};\n}\n\n/** Every branch/tag tip currently in the repo, as a validation boundary — see\n * its call site in {@link applyReceivePack}. */\nasync function collectExistingRefTips(repo: Repo): Promise<Set<string>> {\n\tconst [branches, tags] = await Promise.all([\n\t\tgit.listBranches(repo),\n\t\tgit.listTags(repo),\n\t]);\n\tconst refs = [\n\t\t...branches.map((b) => `refs/heads/${b}`),\n\t\t...tags.map((t) => `refs/tags/${t}`),\n\t];\n\tconst oids = await Promise.all(\n\t\trefs.map((ref) => git.resolveRef({ ...repo, ref }).catch(() => null)),\n\t);\n\treturn new Set(oids.filter((oid): oid is string => oid !== null));\n}\n\nasync function validateRefUpdates(\n\trepo: Repo,\n\trefUpdates: RefUpdateCommand[],\n): Promise<RefUpdateResult[]> {\n\treturn Promise.all(\n\t\trefUpdates.map(\n\t\t\tasync ({ oldOid, refName }) =>\n\t\t\t\t(await checkRefCas(repo, refName, oldOid)) ?? { refName, ok: true },\n\t\t),\n\t);\n}\n\n/**\n * Apply ref updates, enforcing compare-and-swap against each command's\n * claimed oldOid. Every client-supplied refName is validated before any\n * filesystem call reads or writes through it.\n */\nexport async function applyRefUpdates(\n\trepo: Repo,\n\trefUpdates: RefUpdateCommand[],\n\thooks?: HttpHooks,\n): Promise<RefUpdateResult[]> {\n\treturn runStep(hooks, \"apply ref updates\", () =>\n\t\tPromise.all(\n\t\t\trefUpdates.map(async ({ oldOid, newOid, refName }) => {\n\t\t\t\tconst failure = await checkRefCas(repo, refName, oldOid);\n\t\t\t\tif (failure) return failure;\n\n\t\t\t\tif (newOid === ZERO_OID) {\n\t\t\t\t\tawait git.deleteRef({ ...repo, ref: refName }).catch(() => {});\n\t\t\t\t} else {\n\t\t\t\t\tawait git.writeRef({\n\t\t\t\t\t\t...repo,\n\t\t\t\t\t\tref: refName,\n\t\t\t\t\t\tvalue: newOid,\n\t\t\t\t\t\tforce: true,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\treturn { refName, ok: true };\n\t\t\t}),\n\t\t),\n\t);\n}\n\n/** The report-status response body for a set of ref-update results. */\nexport function receivePackResponse(results: RefUpdateResult[]): GitHttpResult {\n\tconst responseBody = concat(\n\t\tpktLine(\"unpack ok\\n\"),\n\t\t...results.map(({ refName, ok, reason }) =>\n\t\t\tpktLine(ok ? `ok ${refName}\\n` : `ng ${refName} ${reason}\\n`),\n\t\t),\n\t\tFLUSH,\n\t);\n\n\treturn {\n\t\tstatus: 200,\n\t\theaders: {\n\t\t\t\"Content-Type\": \"application/x-git-receive-pack-result\",\n\t\t\t\"Cache-Control\": \"no-cache\",\n\t\t},\n\t\tbody: responseBody,\n\t};\n}\n\nexport interface ApplyReceivePackOptions {\n\tdefaultBranch?: string;\n\t/**\n\t * Repack tuning, or `false` to skip repacking entirely. The returned\n\t * `stalePackPaths` are gitdir-relative pack files the repack deleted from\n\t * this repo — after syncing to any secondary storage, delete them there\n\t * too.\n\t */\n\trepack?: RepackOptions | false;\n}\n\n/**\n * The storage half of a push against `repo`: initialize if needed, index the\n * incoming pack, CAS-apply ref updates, then repack when enough packs have\n * accumulated. Serialize concurrent pushes to the same repo externally (a\n * per-repo lock); build the HTTP response afterwards with\n * {@link receivePackResponse}.\n */\nexport async function applyReceivePack(\n\trepo: Repo,\n\tparsed: { refUpdates: RefUpdateCommand[]; packData: Uint8Array },\n\toptions?: ApplyReceivePackOptions,\n\thooks?: HttpHooks,\n): Promise<{ results: RefUpdateResult[]; stalePackPaths: string[] }> {\n\tawait ensureRepoInitialized(repo, options?.defaultBranch ?? \"main\");\n\tconst preflight = await validateRefUpdates(repo, parsed.refUpdates);\n\tconst acceptedUpdates = parsed.refUpdates.filter(\n\t\t(_, index) => preflight[index]?.ok,\n\t);\n\tconst incomingPackPaths = await indexIncomingPack(\n\t\trepo,\n\t\tacceptedUpdates.some((update) => update.newOid !== ZERO_OID)\n\t\t\t? parsed.packData\n\t\t\t: new Uint8Array(),\n\t\thooks,\n\t);\n\n\tconst newTips = acceptedUpdates\n\t\t.filter((update) => update.newOid !== ZERO_OID)\n\t\t.map((update) => update.newOid);\n\tif (newTips.length > 0) {\n\t\t// Every oid reachable from an existing ref was already accepted by an\n\t\t// earlier push — not just the ref(s) this push happens to touch. A\n\t\t// brand-new branch (oldOid === ZERO_OID, so it has no pre-image of its\n\t\t// own) is the common case this matters for: creating a branch off an\n\t\t// existing one is still just one new commit's worth of new objects,\n\t\t// and shouldn't cost a walk of the entire repo history to validate.\n\t\tconst haveOids = await collectExistingRefTips(repo);\n\t\tfor (const update of acceptedUpdates) {\n\t\t\tif (update.oldOid !== ZERO_OID) haveOids.add(update.oldOid);\n\t\t}\n\t\tconst { complete } = await collectReachableOids(\n\t\t\trepo,\n\t\t\tnewTips,\n\t\t\thooks,\n\t\t\thaveOids,\n\t\t);\n\t\tif (!complete) {\n\t\t\tawait Promise.all(\n\t\t\t\tincomingPackPaths.map((filepath) =>\n\t\t\t\t\trawFs(repo)\n\t\t\t\t\t\t.unlink(filepath)\n\t\t\t\t\t\t.catch(() => {}),\n\t\t\t\t),\n\t\t\t);\n\t\t\treturn {\n\t\t\t\tresults: preflight.map((result) =>\n\t\t\t\t\tresult.ok\n\t\t\t\t\t\t? { ...result, ok: false, reason: \"incomplete object graph\" }\n\t\t\t\t\t\t: result,\n\t\t\t\t),\n\t\t\t\tstalePackPaths: [],\n\t\t\t};\n\t\t}\n\t}\n\n\tconst applied = await applyRefUpdates(repo, acceptedUpdates, hooks);\n\tconst results = preflight.map((result, index) =>\n\t\tresult.ok\n\t\t\t? (applied.find(\n\t\t\t\t\t(entry) => entry.refName === parsed.refUpdates[index]?.refName,\n\t\t\t\t) ?? result)\n\t\t\t: result,\n\t);\n\tconst repackOptions = options?.repack;\n\tconst stalePackPaths =\n\t\trepackOptions === false || !results.some((result) => result.ok)\n\t\t\t? []\n\t\t\t: await runStep(hooks, \"repack\", () =>\n\t\t\t\t\trepackRepository(repo, repackOptions, hooks),\n\t\t\t\t);\n\treturn { results, stalePackPaths };\n}\n","/**\n * Pack consolidation: merge all packs into one, reusing stored (possibly\n * deltified) entries when every object is packed.\n *\n * Edge-compatible: uses Web Crypto (SHA-1), CompressionStream (deflate),\n * and Uint8Array throughout — no node:crypto, node:zlib, or Buffer.\n */\n\nimport git from \"isomorphic-git\";\nimport { concat, deflate, encodeUtf8, fromHex, sha1 } from \"../edge-utils.js\";\nimport type { Repo } from \"../ops/types.js\";\nimport {\n\ttype PackFileName,\n\tpackFileName,\n\tparsePackDirectory,\n} from \"../pack-files.js\";\nimport { buildPackFromExistingPacks } from \"./pack-reuse.js\";\nimport { collectReachableOids } from \"./reachability.js\";\nimport { type HttpHooks, rawFs } from \"./types.js\";\n\ntype PackObjectType = \"commit\" | \"tree\" | \"blob\" | \"tag\";\n\n// Git pack object type bits (bits 6-4 of the header's first byte) — same\n// constants real git and isomorphic-git's own (de)serializers use.\nconst PACK_OBJECT_TYPE_BITS: Record<PackObjectType, number> = {\n\tcommit: 0b0010000,\n\ttree: 0b0100000,\n\tblob: 0b0110000,\n\ttag: 0b1000000,\n};\n\n// Git's pack object header: first byte packs (continuation bit | 3-bit type |\n// low 4 bits of length); any remaining length is emitted 7 bits at a time,\n// each with its own continuation bit, little-endian.\nfunction encodePackObjectHeader(\n\ttype: PackObjectType,\n\tlength: number,\n): Uint8Array {\n\tconst bytes: number[] = [];\n\tlet more = length > 0b1111;\n\tbytes.push(\n\t\t(more ? 0b10000000 : 0) | PACK_OBJECT_TYPE_BITS[type] | (length & 0b1111),\n\t);\n\tlength >>>= 4;\n\twhile (more) {\n\t\tmore = length > 0b01111111;\n\t\tbytes.push((more ? 0b10000000 : 0) | (length & 0b01111111));\n\t\tlength >>>= 7;\n\t}\n\treturn new Uint8Array(bytes);\n}\n\n// Git's object hash: sha1(\"<type> <byte length>\\0<content>\") — matches\n// isomorphic-git's internal GitObject.wrap + shasum, computed independently\n// here rather than trusted from isomorphic-git's own read path.\nasync function hashGitObject(\n\ttype: string,\n\tcontent: Uint8Array,\n): Promise<string> {\n\tconst prefix = encodeUtf8(`${type} ${content.length}\\0`);\n\treturn sha1(concat(prefix, content));\n}\n\ntype VerifiedObject = { type: PackObjectType; content: Uint8Array };\n\n/**\n * Read every reachable object and independently re-derive its oid from the\n * bytes isomorphic-git handed back, instead of trusting the oid it was asked\n * for. isomorphic-git's *packed*-object read path never verifies the\n * resolved content's SHA-1 against the requested oid — only the\n * loose-object branch does.\n */\nasync function readAndVerifyObjects(\n\trepo: Repo,\n\toids: string[],\n): Promise<Map<string, VerifiedObject>> {\n\tconst objects = new Map<string, VerifiedObject>();\n\tconst BATCH_SIZE = 100;\n\tfor (let i = 0; i < oids.length; i += BATCH_SIZE) {\n\t\tconst batch = oids.slice(i, i + BATCH_SIZE);\n\t\tconst entries = await Promise.all(\n\t\t\tbatch.map(async (oid) => {\n\t\t\t\tconst { type, object } = await git.readObject({\n\t\t\t\t\t...repo,\n\t\t\t\t\toid,\n\t\t\t\t\tformat: \"content\",\n\t\t\t\t});\n\t\t\t\tconst content = object as unknown as Uint8Array;\n\t\t\t\tconst actualOid = await hashGitObject(type, content);\n\t\t\t\tif (actualOid !== oid) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t`repack: object ${oid} failed independent SHA-1 verification ` +\n\t\t\t\t\t\t\t`(recomputed ${actualOid}) — refusing to trust this read, aborting repack`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\treturn { oid, type: type as PackObjectType, content };\n\t\t\t}),\n\t\t);\n\t\tfor (const { oid, type, content } of entries) {\n\t\t\tobjects.set(oid, { type, content });\n\t\t}\n\t}\n\treturn objects;\n}\n\n/**\n * Serialize verified objects into a pack containing only full (never\n * deltified) entries, in the given oid order.\n */\nasync function buildVerifiedPack(\n\toids: string[],\n\tobjects: Map<string, VerifiedObject>,\n): Promise<Uint8Array> {\n\t// PACK header: \"PACK\" + version(2) + count, all big-endian uint32\n\tconst header = new Uint8Array(12);\n\tconst view = new DataView(header.buffer);\n\theader.set(encodeUtf8(\"PACK\"), 0);\n\tview.setUint32(4, 2, false); // version 2\n\tview.setUint32(8, oids.length, false); // object count\n\n\tconst chunks: Uint8Array[] = [header];\n\n\tconst BATCH_SIZE = 100;\n\tfor (let i = 0; i < oids.length; i += BATCH_SIZE) {\n\t\tconst batch = oids.slice(i, i + BATCH_SIZE);\n\t\tconst encoded = await Promise.all(\n\t\t\tbatch.map(async (oid) => {\n\t\t\t\tconst entry = objects.get(oid);\n\t\t\t\tif (!entry) {\n\t\t\t\t\tthrow new Error(`repack: missing verified object for ${oid}`);\n\t\t\t\t}\n\t\t\t\tconst objHeader = encodePackObjectHeader(\n\t\t\t\t\tentry.type,\n\t\t\t\t\tentry.content.length,\n\t\t\t\t);\n\t\t\t\tconst compressed = await deflate(entry.content);\n\t\t\t\treturn concat(objHeader, compressed);\n\t\t\t}),\n\t\t);\n\t\tchunks.push(...encoded);\n\t}\n\n\t// Git's pack trailer is the SHA-1 of every preceding byte (header +\n\t// every object entry) as a single digest — NOT an incremental/chained\n\t// hash. Web Crypto's subtle.digest has no streaming mode, so unlike\n\t// Node's crypto.createHash this can't be folded into the loop above;\n\t// everything is already buffered in `chunks`, so hash it in one pass.\n\tconst packBody = concat(...chunks);\n\tconst trailer = fromHex(await sha1(packBody));\n\treturn concat(packBody, trailer);\n}\n\n/**\n * Default repack threshold. Consolidating is O(total repo object count) —\n * so paying it on every push makes push latency grow with repo size forever.\n */\nexport const REPACK_PACK_COUNT_THRESHOLD = 4;\n\nasync function readPackDirectory(repo: Repo): Promise<PackFileName[]> {\n\tconst entries = await rawFs(repo)\n\t\t.readdir(`${repo.gitdir}/objects/pack`)\n\t\t.catch(() => [] as string[]);\n\treturn parsePackDirectory(entries);\n}\n\nasync function countPacks(repo: Repo): Promise<number> {\n\tconst files = await readPackDirectory(repo);\n\treturn files.filter((file) => file.kind === \"pack\").length;\n}\n\nexport interface RepackOptions {\n\t/** Skip repacking below this many accumulated packs. Default 4. */\n\tthreshold?: number;\n}\n\n/**\n * Consolidate all pack files into one, returning the gitdir-relative paths\n * of the old .pack/.idx files it removed — after syncing the new pack to any\n * secondary storage, delete those same paths there too.\n */\nexport async function repackRepository(\n\trepo: Repo,\n\toptions?: RepackOptions,\n\thooks?: HttpHooks,\n): Promise<string[]> {\n\tconst threshold = options?.threshold ?? REPACK_PACK_COUNT_THRESHOLD;\n\tconst fsp = rawFs(repo);\n\ttry {\n\t\tif ((await countPacks(repo)) < threshold) {\n\t\t\treturn [];\n\t\t}\n\n\t\tconst [branches, tags] = await Promise.all([\n\t\t\tgit.listBranches(repo),\n\t\t\tgit.listTags(repo),\n\t\t]);\n\t\tconst refNames = [\n\t\t\t...branches.map((b) => `refs/heads/${b}`),\n\t\t\t...tags.map((t) => `refs/tags/${t}`),\n\t\t];\n\t\tconst tipOids = (\n\t\t\tawait Promise.all(\n\t\t\t\trefNames.map((ref) =>\n\t\t\t\t\tgit.resolveRef({ ...repo, ref }).catch(() => null),\n\t\t\t\t),\n\t\t\t)\n\t\t).filter((oid): oid is string => oid !== null);\n\t\tif (tipOids.length === 0) return [];\n\n\t\tconst { oids: reachable, complete } = await collectReachableOids(\n\t\t\trepo,\n\t\t\ttipOids,\n\t\t\thooks,\n\t\t);\n\t\tif (!complete || reachable.length === 0) return [];\n\n\t\tconst packDir = `${repo.gitdir}/objects/pack`;\n\t\t// Copy stored entries when everything is packed: keeps deltas, so\n\t\t// the consolidated pack is as compact as its sources. Loose objects\n\t\t// fall back to a verified, non-deltified rebuild.\n\t\tconst packBuffer =\n\t\t\t(await buildPackFromExistingPacks(repo, reachable)) ??\n\t\t\t(await buildVerifiedPack(\n\t\t\t\treachable,\n\t\t\t\tawait readAndVerifyObjects(repo, reachable),\n\t\t\t));\n\n\t\tawait fsp.mkdir(packDir, { recursive: true });\n\t\tconst newBase = `pack-${Date.now()}`;\n\t\tconst newPackFile = packFileName(newBase, \"pack\");\n\t\tawait fsp.writeFile(`${packDir}/${newPackFile}`, packBuffer);\n\n\t\tconst { oids: indexedOids } = await git.indexPack({\n\t\t\t...repo,\n\t\t\tdir: packDir,\n\t\t\tfilepath: newPackFile,\n\t\t});\n\n\t\t// indexPack re-hashes every object it indexes, so this also verifies\n\t\t// the content. Reused packs may carry extra delta bases: superset is fine.\n\t\tconst indexed = new Set(indexedOids);\n\t\tif (reachable.some((oid) => !indexed.has(oid))) {\n\t\t\tawait Promise.all(\n\t\t\t\t([\"pack\", \"idx\"] as const).map((kind) =>\n\t\t\t\t\tfsp\n\t\t\t\t\t\t.unlink(`${packDir}/${packFileName(newBase, kind)}`)\n\t\t\t\t\t\t.catch(() => {}),\n\t\t\t\t),\n\t\t\t);\n\t\t\tthrow new Error(\n\t\t\t\t\"repack: indexed pack is missing reachable objects — aborting\",\n\t\t\t);\n\t\t}\n\n\t\tconst stale = (await readPackDirectory(repo)).filter(\n\t\t\t(file) => file.base !== newBase,\n\t\t);\n\t\tawait Promise.all(\n\t\t\tstale.map((file) =>\n\t\t\t\tfsp.unlink(`${packDir}/${file.name}`).catch(() => {}),\n\t\t\t),\n\t\t);\n\t\treturn stale.map((file) => `objects/pack/${file.name}`);\n\t} catch (err) {\n\t\thooks?.onWarn?.(\"repack failed (non-fatal)\", err);\n\t\treturn [];\n\t}\n}\n","/**\n * Typed view of a git `objects/pack` directory listing.\n *\n * Every pack is a set of sibling files sharing one base name\n * (`pack-<hash>.pack`, `.idx`, and optionally `.keep`/`.bitmap`/`.rev`).\n * Parsing names once into {@link PackFileName} lets callers group, filter and\n * rename by kind instead of re-matching filename strings at each call site.\n *\n * Edge-compatible: no node: imports.\n */\n\n/** Every file kind git writes into `objects/pack`. */\nexport const PACK_FILE_KINDS = [\n\t\"pack\",\n\t\"idx\",\n\t\"keep\",\n\t\"bitmap\",\n\t\"rev\",\n] as const;\nexport type PackFileKind = (typeof PACK_FILE_KINDS)[number];\n\n/** Kinds isomorphic-git actually reads; the rest are git-CLI accelerators. */\nexport const READABLE_PACK_FILE_KINDS: ReadonlySet<PackFileKind> = new Set([\n\t\"pack\",\n\t\"idx\",\n]);\n\nexport interface PackFileName {\n\t/** Shared base of a pack's sibling files, e.g. `pack-1a2b…`. */\n\treadonly base: string;\n\treadonly kind: PackFileKind;\n\t/** The file name as listed, e.g. `pack-1a2b….idx`. */\n\treadonly name: string;\n}\n\nconst KNOWN_KINDS: ReadonlySet<string> = new Set(PACK_FILE_KINDS);\n\nfunction isPackFileKind(value: string): value is PackFileKind {\n\treturn KNOWN_KINDS.has(value);\n}\n\n/** Parse a pack-directory entry; `null` for anything git didn't put there. */\nexport function parsePackFileName(name: string): PackFileName | null {\n\tconst dot = name.lastIndexOf(\".\");\n\tif (dot <= 0) return null;\n\tconst kind = name.slice(dot + 1);\n\tif (!isPackFileKind(kind)) return null;\n\treturn { base: name.slice(0, dot), kind, name };\n}\n\n/** File name of the `kind` sibling of the pack with this base name. */\nexport function packFileName(base: string, kind: PackFileKind): string {\n\treturn `${base}.${kind}`;\n}\n\n/** Parse a directory listing, dropping entries that aren't pack files. */\nexport function parsePackDirectory(entries: readonly string[]): PackFileName[] {\n\treturn entries\n\t\t.map(parsePackFileName)\n\t\t.filter((file): file is PackFileName => file !== null);\n}\n","/**\n * Build a packfile by copying already-compressed entries out of existing\n * packs (\"pack reuse\"), instead of inflating and re-deflating every object.\n *\n * Entries keep their stored form, deltas included, so the output is as\n * compact as the packs it came from. `OFS_DELTA` entries are rewritten as\n * `REF_DELTA` (base named by oid), since offsets don't survive the move into\n * a new pack; delta bases are always included and written before the deltas\n * that use them. Formats: gitformat-pack(5).\n *\n * Edge-compatible: Web Crypto SHA-1 and Uint8Array only.\n */\n\nimport { concat, encodeUtf8, fromHex, sha1, toHex } from \"../edge-utils.js\";\nimport type { Repo } from \"../ops/types.js\";\nimport { packFileName, parsePackDirectory } from \"../pack-files.js\";\nimport { rawFs } from \"./types.js\";\n\nconst OBJ_OFS_DELTA = 6;\nconst OBJ_REF_DELTA = 7;\nconst OID_BYTES = 20;\nconst PACK_TRAILER_BYTES = 20;\n\nconst IDX_V2 = {\n\tmagic: 0xff744f63,\n\tversion: 2,\n\theaderBytes: 8,\n\tfanoutEntries: 256,\n\t/** Offsets with this bit set index the 64-bit large-offset table. */\n\tlargeOffsetFlag: 0x80000000,\n} as const;\n\n/** One object's stored entry inside a pack. */\ninterface PackEntry {\n\treadonly pack: Uint8Array;\n\treadonly start: number;\n\treadonly end: number;\n}\n\n/** Every object stored in a pack, by oid, plus its offset → oid inverse. */\ninterface IndexedPack {\n\treadonly entries: Map<string, PackEntry>;\n\treadonly oidAtOffset: Map<number, string>;\n}\n\n/** An object's position in a pack, as listed by its `.idx`. */\nexport interface PackIndexEntry {\n\treadonly oid: string;\n\treadonly offset: number;\n}\n\n/** Entries of a version-2 `.idx`; `null` for any other format. */\nexport function readPackIndex(idx: Uint8Array): PackIndexEntry[] | null {\n\tconst view = new DataView(idx.buffer, idx.byteOffset, idx.byteLength);\n\tconst namesStart = IDX_V2.headerBytes + IDX_V2.fanoutEntries * 4;\n\tif (\n\t\tidx.byteLength < namesStart ||\n\t\tview.getUint32(0) !== IDX_V2.magic ||\n\t\tview.getUint32(4) !== IDX_V2.version\n\t) {\n\t\treturn null;\n\t}\n\t// The last fanout slot counts every object in the pack.\n\tconst count = view.getUint32(namesStart - 4);\n\tconst crcStart = namesStart + count * OID_BYTES;\n\tconst offsetsStart = crcStart + count * 4;\n\tif (idx.byteLength < offsetsStart + count * 4) return null;\n\n\tconst entries: PackIndexEntry[] = [];\n\tfor (let i = 0; i < count; i++) {\n\t\tconst offset = view.getUint32(offsetsStart + i * 4);\n\t\t// Packs over 2 GiB never reach this in-memory path; let the caller\n\t\t// fall back instead of half-supporting the large-offset table.\n\t\tif (offset & IDX_V2.largeOffsetFlag) return null;\n\t\tconst at = namesStart + i * OID_BYTES;\n\t\tentries.push({ oid: toHex(idx.subarray(at, at + OID_BYTES)), offset });\n\t}\n\treturn entries;\n}\n\n/** Locate every entry of `pack` using its `.idx`. */\nfunction indexPack(idx: Uint8Array, pack: Uint8Array): IndexedPack | null {\n\tconst located = readPackIndex(idx);\n\tif (!located) return null;\n\n\t// An entry runs until the next entry's offset (or the pack trailer).\n\tlocated.sort((a, b) => a.offset - b.offset);\n\tconst entries = new Map<string, PackEntry>();\n\tconst oidAtOffset = new Map<number, string>();\n\tconst packEnd = pack.byteLength - PACK_TRAILER_BYTES;\n\tfor (let i = 0; i < located.length; i++) {\n\t\tconst { oid, offset } = located[i] as PackIndexEntry;\n\t\tconst end = located[i + 1]?.offset ?? packEnd;\n\t\tentries.set(oid, { pack, start: offset, end });\n\t\toidAtOffset.set(offset, oid);\n\t}\n\treturn { entries, oidAtOffset };\n}\n\n/** The variable-length type/size header that starts every pack entry. */\ninterface EntryHeader {\n\treadonly type: number;\n\treadonly size: number;\n\t/** Bytes the header occupies. */\n\treadonly length: number;\n}\n\nfunction readEntryHeader(bytes: Uint8Array, start: number): EntryHeader {\n\tlet byte = bytes[start] as number;\n\tconst type = (byte >> 4) & 0b111;\n\tlet size = byte & 0b1111;\n\tlet shift = 4;\n\tlet at = start + 1;\n\twhile (byte & 0x80) {\n\t\tbyte = bytes[at++] as number;\n\t\tsize += (byte & 0x7f) * 2 ** shift;\n\t\tshift += 7;\n\t}\n\treturn { type, size, length: at - start };\n}\n\nfunction encodeEntryHeader(type: number, size: number): Uint8Array {\n\tconst bytes: number[] = [];\n\tlet rest = Math.floor(size / 16);\n\tbytes.push((rest > 0 ? 0x80 : 0) | (type << 4) | (size % 16));\n\twhile (rest > 0) {\n\t\tconst low = rest % 128;\n\t\trest = Math.floor(rest / 128);\n\t\tbytes.push((rest > 0 ? 0x80 : 0) | low);\n\t}\n\treturn new Uint8Array(bytes);\n}\n\n/** `OFS_DELTA`'s negative base offset: big-endian base-128 with +1 carries. */\nfunction readOfsDeltaOffset(\n\tbytes: Uint8Array,\n\tstart: number,\n): { distance: number; length: number } {\n\tlet at = start;\n\tlet byte = bytes[at++] as number;\n\tlet distance = byte & 0x7f;\n\twhile (byte & 0x80) {\n\t\tbyte = bytes[at++] as number;\n\t\tdistance = (distance + 1) * 128 + (byte & 0x7f);\n\t}\n\treturn { distance, length: at - start };\n}\n\n/** A pack entry ready to copy, with the oid of its delta base if any. */\ninterface ReusableEntry {\n\treadonly bytes: Uint8Array;\n\treadonly baseOid: string | null;\n}\n\n/** Copy one entry, rewriting `OFS_DELTA` to `REF_DELTA`. */\nfunction reusableEntry(\n\tentry: PackEntry,\n\tindexed: IndexedPack,\n): ReusableEntry | null {\n\tconst { pack, start, end } = entry;\n\tconst header = readEntryHeader(pack, start);\n\tconst bodyStart = start + header.length;\n\tif (header.type === OBJ_REF_DELTA) {\n\t\treturn {\n\t\t\tbytes: pack.subarray(start, end),\n\t\t\tbaseOid: toHex(pack.subarray(bodyStart, bodyStart + OID_BYTES)),\n\t\t};\n\t}\n\tif (header.type !== OBJ_OFS_DELTA) {\n\t\treturn { bytes: pack.subarray(start, end), baseOid: null };\n\t}\n\tconst { distance, length } = readOfsDeltaOffset(pack, bodyStart);\n\tconst baseOid = indexed.oidAtOffset.get(start - distance);\n\tif (baseOid === undefined) return null;\n\treturn {\n\t\tbytes: concat(\n\t\t\tencodeEntryHeader(OBJ_REF_DELTA, header.size),\n\t\t\tfromHex(baseOid),\n\t\t\tpack.subarray(bodyStart + length, end),\n\t\t),\n\t\tbaseOid,\n\t};\n}\n\n/**\n * A pack holding at least `oids`, built from stored entries, or `null` when\n * any of them (or a delta base they need) isn't in a readable pack — e.g. a\n * loose object — so the caller should build the pack another way.\n */\nexport async function buildPackFromExistingPacks(\n\trepo: Repo,\n\toids: readonly string[],\n): Promise<Uint8Array | null> {\n\tconst fsp = rawFs(repo);\n\tconst packDir = `${repo.gitdir}/objects/pack`;\n\tconst packs = parsePackDirectory(\n\t\tawait fsp.readdir(packDir).catch(() => [] as string[]),\n\t).filter((file) => file.kind === \"pack\");\n\n\tconst indexes: IndexedPack[] = [];\n\tfor (const { base } of packs) {\n\t\t// A pack without a readable index can't be reused.\n\t\tconst [pack, idx] = await Promise.all([\n\t\t\tfsp.readFile(`${packDir}/${packFileName(base, \"pack\")}`),\n\t\t\tfsp.readFile(`${packDir}/${packFileName(base, \"idx\")}`),\n\t\t]).catch(() => [null, null]);\n\t\tif (!(pack instanceof Uint8Array) || !(idx instanceof Uint8Array)) {\n\t\t\treturn null;\n\t\t}\n\t\tconst indexed = indexPack(idx, pack);\n\t\tif (!indexed) return null;\n\t\tindexes.push(indexed);\n\t}\n\n\tconst locate = (oid: string): ReusableEntry | null => {\n\t\tfor (const indexed of indexes) {\n\t\t\tconst entry = indexed.entries.get(oid);\n\t\t\tif (entry) return reusableEntry(entry, indexed);\n\t\t}\n\t\treturn null;\n\t};\n\n\t// Depth-first so every base is written before the deltas that use it.\n\tconst ordered: Uint8Array[] = [];\n\tconst done = new Set<string>();\n\tconst pending = new Set<string>();\n\tconst visit = (oid: string): boolean => {\n\t\tif (done.has(oid)) return true;\n\t\tif (pending.has(oid)) return false; // a delta cycle means corruption\n\t\tconst entry = locate(oid);\n\t\tif (!entry) return false;\n\t\tpending.add(oid);\n\t\tif (entry.baseOid !== null && !visit(entry.baseOid)) return false;\n\t\tpending.delete(oid);\n\t\tdone.add(oid);\n\t\tordered.push(entry.bytes);\n\t\treturn true;\n\t};\n\tfor (const oid of oids) {\n\t\tif (!visit(oid)) return null;\n\t}\n\n\tconst header = new Uint8Array(12);\n\theader.set(encodeUtf8(\"PACK\"), 0);\n\tconst view = new DataView(header.buffer);\n\tview.setUint32(4, 2);\n\tview.setUint32(8, ordered.length);\n\tconst body = concat(header, ...ordered);\n\treturn concat(body, fromHex(await sha1(body)));\n}\n","import git from \"isomorphic-git\";\nimport { concat } from \"../edge-utils.js\";\nimport type { Repo } from \"../ops/types.js\";\nimport { parsePackDirectory } from \"../pack-files.js\";\nimport { buildPackFromExistingPacks } from \"./pack-reuse.js\";\nimport { parsePktLines, pktLine, sideBandPackfile } from \"./pkt-line.js\";\nimport { collectReachableOids } from \"./reachability.js\";\nimport { type GitHttpResult, type HttpHooks, rawFs, runStep } from \"./types.js\";\n\nconst ZERO_OID = \"0\".repeat(40);\n\nexport interface UploadPackOptions {\n\t/**\n\t * Called once before the reachability walk — wire loose-object detection\n\t * (`GitFs.detectLooseObjects`) here so a fully packed repo's walk doesn't\n\t * pay a doomed loose-object probe per object.\n\t */\n\tbeforeWalk?: () => Promise<void>;\n}\n\n/**\n * `POST …/git-upload-pack` — serve a clone/fetch. Authorization is the\n * caller's job. Negotiation is client-driven (no multi_ack advertised):\n * \"have\" batches without \"done\" get a bare NAK; the final batch gets the\n * packfile, side-band-64k framed.\n *\n * Fast path: a fresh clone (no haves) of a repo consolidated down to a\n * single pack serves that pack's bytes directly — skipping the O(objects)\n * traversal + repack entirely.\n */\nexport async function handleUploadPack(\n\trepo: Repo,\n\tbody: Uint8Array,\n\toptions?: UploadPackOptions,\n\thooks?: HttpHooks,\n): Promise<GitHttpResult> {\n\tconst lines = parsePktLines(body);\n\n\tconst wants: string[] = [];\n\tconst haves: string[] = [];\n\tlet done = false;\n\tfor (const line of lines) {\n\t\tif (!line) continue;\n\t\tif (line.startsWith(\"want \")) {\n\t\t\twants.push(line.slice(5, 45));\n\t\t}\n\t\tif (line.startsWith(\"have \")) {\n\t\t\tconst sha = line.slice(5, 45);\n\t\t\tif (sha !== ZERO_OID) {\n\t\t\t\thaves.push(sha);\n\t\t\t}\n\t\t}\n\t\tif (line.startsWith(\"done\")) {\n\t\t\tdone = true;\n\t\t}\n\t}\n\n\tif (wants.length === 0) {\n\t\treturn {\n\t\t\tstatus: 200,\n\t\t\theaders: { \"Content-Type\": \"application/x-git-upload-pack-result\" },\n\t\t\tbody: concat(pktLine(\"NAK\\n\")),\n\t\t};\n\t}\n\n\tif (haves.length > 0 && !done) {\n\t\treturn {\n\t\t\tstatus: 200,\n\t\t\theaders: { \"Content-Type\": \"application/x-git-upload-pack-result\" },\n\t\t\tbody: concat(pktLine(\"NAK\\n\")),\n\t\t};\n\t}\n\n\t// Fresh clone = no haves, so all objects are needed. When the repo is down\n\t// to a single pack, serve it directly and skip the traversal + pack build.\n\tif (haves.length === 0) {\n\t\tconst packDirPath = `${repo.gitdir}/objects/pack`;\n\t\tconst entries = await runStep(hooks, \"readdir objects/pack\", () =>\n\t\t\trawFs(repo)\n\t\t\t\t.readdir(packDirPath)\n\t\t\t\t.catch(() => [] as string[]),\n\t\t);\n\t\tconst packNames = parsePackDirectory(entries)\n\t\t\t.filter((file) => file.kind === \"pack\")\n\t\t\t.map((file) => file.name);\n\t\tconst packName = packNames[0];\n\t\tif (packNames.length === 1 && packName !== undefined) {\n\t\t\tconst packData = await runStep(\n\t\t\t\thooks,\n\t\t\t\t\"read consolidated pack (fast path)\",\n\t\t\t\t() => rawFs(repo).readFile(`${packDirPath}/${packName}`),\n\t\t\t);\n\t\t\tconst bytes =\n\t\t\t\tpackData instanceof Uint8Array\n\t\t\t\t\t? packData\n\t\t\t\t\t: new TextEncoder().encode(packData as string);\n\t\t\treturn {\n\t\t\t\tstatus: 200,\n\t\t\t\theaders: {\n\t\t\t\t\t\"Content-Type\": \"application/x-git-upload-pack-result\",\n\t\t\t\t\t\"Cache-Control\": \"no-cache\",\n\t\t\t\t},\n\t\t\t\tbody: concat(pktLine(\"NAK\\n\"), sideBandPackfile(bytes)),\n\t\t\t};\n\t\t}\n\t}\n\n\tif (options?.beforeWalk) {\n\t\tawait runStep(hooks, \"beforeWalk\", options.beforeWalk);\n\t}\n\n\t// Walk haves first so the wants walk can stop at anything the client\n\t// already has, instead of re-walking all shared history a second time.\n\tlet haveSet: ReadonlySet<string> | undefined;\n\tif (haves.length > 0) {\n\t\tconst { oids: haveOids } = await runStep(\n\t\t\thooks,\n\t\t\t\"collectReachableOids(haves)\",\n\t\t\t() =>\n\t\t\t\tcollectReachableOids(repo, haves, hooks, undefined, {\n\t\t\t\t\tverifyBlobs: false,\n\t\t\t\t}),\n\t\t);\n\t\thaveSet = new Set(haveOids);\n\t}\n\n\tconst { oids: wantOids } = await runStep(\n\t\thooks,\n\t\t\"collectReachableOids(wants)\",\n\t\t() =>\n\t\t\tcollectReachableOids(repo, wants, hooks, haveSet, {\n\t\t\t\tverifyBlobs: false,\n\t\t\t}),\n\t);\n\t// Boundary oids are recorded as seen by the walk; drop them from the pack.\n\tconst oids = haveSet ? wantOids.filter((oid) => !haveSet.has(oid)) : wantOids;\n\n\t// Copy stored (already compressed, possibly deltified) entries when every\n\t// object is packed; build from scratch only when some aren't.\n\tconst reused = await runStep(\n\t\thooks,\n\t\t`reuse pack entries (${oids.length} oids)`,\n\t\t() => buildPackFromExistingPacks(repo, oids),\n\t);\n\tconst packBytes =\n\t\treused ??\n\t\t(await runStep(hooks, `packObjects (${oids.length} oids)`, async () => {\n\t\t\tconst { packfile } = await git.packObjects({ ...repo, oids });\n\t\t\treturn packfile instanceof Uint8Array\n\t\t\t\t? packfile\n\t\t\t\t: new Uint8Array(packfile ?? []);\n\t\t}));\n\n\treturn {\n\t\tstatus: 200,\n\t\theaders: {\n\t\t\t\"Content-Type\": \"application/x-git-upload-pack-result\",\n\t\t\t\"Cache-Control\": \"no-cache\",\n\t\t},\n\t\tbody: concat(pktLine(\"NAK\\n\"), sideBandPackfile(packBytes)),\n\t};\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,IAAAA,yBAAgB;;;ACQhB,IAAM,cAAc,IAAI,YAAY;AACpC,IAAM,cAAc,IAAI,YAAY;AAc7B,SAAS,WAAW,MAAuC;AACjE,SAAO,YAAY,OAAO,IAAI;AAC/B;AAGO,SAAS,WAAW,MAA0B;AACpD,SAAO,YAAY,OAAO,IAAI;AAC/B;AAGO,SAAS,YAAY,MAA0B;AACrD,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ;AAChC,SAAK,OAAO,aAAa,KAAK,CAAC,CAAW;AAC3C,SAAO;AACR;AAOO,SAAS,UAAU,OAA8C;AACvE,MAAI,QAAQ;AACZ,aAAW,KAAK,MAAO,UAAS,EAAE;AAClC,QAAM,MAAM,IAAI,WAAW,KAAK;AAChC,MAAI,SAAS;AACb,aAAW,KAAK,OAAO;AACtB,QAAI,IAAI,GAAG,MAAM;AACjB,cAAU,EAAE;AAAA,EACb;AACA,SAAO;AACR;AAOO,SAAS,MAAM,MAA0B;AAC/C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ;AAChC,WAAQ,KAAK,CAAC,EAAa,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AACxD,SAAO;AACR;AAWO,SAAS,QAAQ,KAAsC;AAC7D,QAAM,QAAQ,IAAI,WAAW,IAAI,SAAS,CAAC;AAC3C,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACtC,UAAM,CAAC,IAAI,OAAO,SAAS,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE;AAAA,EAC3D;AACA,SAAO;AACR;AAOA,eAAsB,KAAK,MAA4C;AACtE,QAAM,QAAQ,OAAO,SAAS,WAAW,WAAW,IAAI,IAAI;AAC5D,QAAM,OAAO,MAAM,WAAW,OAAO,OAAO,OAAO,SAAS,KAAK;AACjE,SAAO,MAAM,IAAI,WAAW,IAAI,CAAC;AAClC;AAUA,eAAsB,QACrB,MACmC;AACnC,QAAM,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,EAC5B,OAAO,EACP,YAAY,IAAI,kBAAkB,SAAS,CAAC;AAC9C,SAAO,IAAI,WAAW,MAAM,IAAI,SAAS,MAAM,EAAE,YAAY,CAAC;AAC/D;;;AChHA,4BAAgB;;;ACgBhB,IAAM;AAAA;AAAA,EAEL;AAAA;AAED,IAAM,cAAc;AAGb,SAAS,kBAAkB,KAAsB;AACvD,MAAI,CAAC,IAAI,WAAW,aAAa,KAAK,CAAC,IAAI,WAAW,YAAY,GAAG;AACpE,WAAO;AAAA,EACR;AACA,SAAO,CAAC,kBAAkB,KAAK,GAAG;AACnC;AAYO,SAAS,iBAAiB,MAAuB;AACvD,MAAI,CAAC,QAAQ,KAAK,WAAW,OAAO,KAAK,SAAS,OAAQ,QAAO;AACjE,MAAI,YAAY,KAAK,IAAI,EAAG,QAAO;AACnC,SAAO,CAAC,kBAAkB,KAAK,IAAI;AACpC;;;ADrBA,IAAMC,eAAc;AAMpB,SAAS,uBACR,IACyC;AACzC,SACC,OAAO,OAAO,YACd,OAAO,QACP,0BAA0B,MAC1B,OAAQ,GAAoC,yBAC3C;AAEH;AAYA,SAAS,cAAc,IAAmC;AACzD,QAAM,WAAY,GAAiC;AACnD,SAAO,YAAY;AACpB;AAEA,SAAS,kBAAkB,SAAsC;AAChE,SAAO,OAAO,YAAY,WACvB,UACA,IAAI,YAAY,EAAE,OAAO,OAAO;AACpC;AASA,eAAe,kBAAkB,MAAsC;AACtE,SAAO,kBAAkB,MAAM,YAAY;AAC5C;AAMA,eAAsB,kBACrB,MACA,KAC2B;AAC3B,MAAI,CAAC,uBAAuB,KAAK,EAAE,EAAG,QAAO;AAC7C,QAAM,QAAQ,MAAM,KAAK,GAAG,qBAAqB,GAAG,KAAK,MAAM,IAAI,GAAG,EAAE;AACxE,SAAO,MAAM,OAAO,gBAAgB;AACrC;AAGA,eAAe,mBAAmB,MAA0C;AAC3E,MAAI,CAAC,uBAAuB,KAAK,EAAE,EAAG,QAAO,oBAAI,IAAI;AACrD,QAAM,aAAa,cAAc,KAAK,EAAE;AACxC,MAAI,CAAC,WAAY,QAAO,oBAAI,IAAI;AAChC,MAAI;AACH,UAAM,UAAU,MAAM,WAAW;AAAA,MAChC,GAAG,KAAK,MAAM;AAAA,MACd;AAAA,IACD;AACA,UAAM,OAAO,oBAAI,IAAoB;AACrC,eAAW,QAAQ,kBAAkB,OAAO,EAAE,MAAM,IAAI,GAAG;AAC1D,YAAM,QAAQ,sCAAsC,KAAK,IAAI;AAC7D,UAAI,QAAQ,CAAC,KAAK,MAAM,CAAC,KAAK,iBAAiB,MAAM,CAAC,CAAC,GAAG;AACzD,aAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,MAC5B;AAAA,IACD;AACA,WAAO;AAAA,EACR,QAAQ;AACP,WAAO,oBAAI,IAAI;AAAA,EAChB;AACD;AAGA,eAAe,sBAAsB,MAAoC;AACxE,MAAI,CAAC,uBAAuB,KAAK,EAAE,EAAG,QAAO;AAC7C,QAAM,aAAa,cAAc,KAAK,EAAE;AACxC,MAAI,CAAC,WAAY,QAAO;AACxB,MAAI;AACH,UAAM,UAAU,MAAM,WAAW,SAAS,GAAG,KAAK,MAAM,SAAS,MAAM;AACvE,UAAM,OAAO,kBAAkB,OAAO,EAAE,KAAK;AAC7C,UAAM,QAAQ,2BAA2B,KAAK,IAAI;AAClD,WAAO,QAAQ,CAAC,KAAK,iBAAiB,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI;AAAA,EAC9D,QAAQ;AACP,WAAO;AAAA,EACR;AACD;AAaA,eAAsB,oBACrB,MACA,KACkB;AAClB,QAAM,aAAa,cAAc,KAAK,EAAE;AACxC,MAAI,YAAY;AACf,QAAI;AACH,YAAM,UAAU,MAAM,WAAW;AAAA,QAChC,GAAG,KAAK,MAAM,IAAI,GAAG;AAAA,QACrB;AAAA,MACD;AACA,YAAM,MAAM,kBAAkB,OAAO,EAAE,KAAK;AAC5C,UAAIA,aAAY,KAAK,GAAG,EAAG,QAAO;AAAA,IACnC,QAAQ;AAAA,IAER;AAAA,EACD;AACA,SAAO,sBAAAC,QAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC;AACvC;AAGA,eAAsB,aAAa,MAA+B;AACjE,MAAI;AACH,UAAM,CAAC,eAAe,oBAAoB,cAAc,IACvD,MAAM,QAAQ,IAAI;AAAA,MACjB,kBAAkB,IAAI;AAAA,MACtB,sBAAsB,IAAI;AAAA,MAC1B,mBAAmB,IAAI;AAAA,IACxB,CAAC;AACF,UAAM,WACL,kBAAkB,OACf,MAAM,sBAAAA,QAAI,aAAa,IAAI,IAC3B,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,eAAe,GAAG,eAAe,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK;AACpE,UAAM,gBACL,kBAAkB,OACf,MAAM,sBAAAA,QACL,cAAc,EAAE,GAAG,MAAM,UAAU,MAAM,CAAC,EAC1C,MAAM,MAAM,IAAI,IACjB;AAEJ,WAAO,QAAQ;AAAA,MACd,SAAS,IAAI,OAAO,WAAW;AAC9B,cAAM,eAAe,eAAe,IAAI,MAAM;AAC9C,eAAO;AAAA,UACN,MAAM;AAAA,UACN,QACC,gBAAgB,CAAC,eAAe,SAAS,MAAM,IAC5C,eACA,MAAM,oBAAoB,MAAM,cAAc,MAAM,EAAE;AAAA,UAC1D,WAAW,WAAW;AAAA,QACvB;AAAA,MACD,CAAC;AAAA,IACF;AAAA,EACD,SAAS,KAAc;AACtB,QAAK,IAA0B,SAAS,gBAAiB,QAAO,CAAC;AACjE,UAAM;AAAA,EACP;AACD;;;AEvLO,IAAM,QAAiC,IAAI,WAAW;AAAA,EAC5D;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AACnB,CAAC;AAGM,SAAS,QAAQ,MAAuC;AAC9D,QAAM,OAAO,WAAW,IAAI;AAC5B,QAAM,OAAO,KAAK,SAAS,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC1D,SAAO,OAAO,WAAW,GAAG,GAAG,IAAI;AACpC;AAGO,SAAS,cAAc,MAA2C;AACxE,QAAM,OAAO,KAAK,SAAS,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC1D,SAAO,OAAO,WAAW,GAAG,GAAG,IAAI;AACpC;AAGO,SAAS,cAAc,KAAuC;AACpE,QAAM,QAA8B,CAAC;AACrC,MAAI,MAAM;AACV,SAAO,MAAM,KAAK,IAAI,QAAQ;AAC7B,UAAM,MAAM,OAAO,SAAS,YAAY,IAAI,SAAS,KAAK,MAAM,CAAC,CAAC,GAAG,EAAE;AACvE,QAAI,QAAQ,GAAG;AACd,YAAM,KAAK,IAAI;AACf,aAAO;AAAA,IACR,WAAW,OAAO,GAAG;AACpB,YAAM,KAAK,WAAW,IAAI,SAAS,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;AACvD,aAAO;AAAA,IACR,OAAO;AACN;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAaA,IAAM,sBAAsB;AAErB,SAAS,iBACf,UAC0B;AAC1B,QAAM,QAAsB,CAAC;AAC7B,WACK,SAAS,GACb,SAAS,SAAS,QAClB,UAAU,qBACT;AACD,UAAM,QAAQ,SAAS,SAAS,QAAQ,SAAS,mBAAmB;AACpE,UAAM,KAAK,cAAc,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,EAC7D;AACA,QAAM,KAAK,KAAK;AAChB,SAAO,OAAO,GAAG,KAAK;AACvB;;;AC/CO,IAAM,UAAU,CACtB,OACA,OACA,OACiB,OAAO,OAAO,MAAM,KAAK,OAAO,EAAE,IAAI,GAAG;AAiBpD,SAAS,MAAM,MAA2B;AAChD,QAAM,KAAK,KAAK;AAChB,MAAI,CAAC,IAAI,UAAU;AAClB,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AAAA,EACD;AACA,SAAO,GAAG;AACX;;;ALxCA,eAAsB,YAAY,MAAY,gBAAgB,QAAQ;AACrE,QAAM,CAAC,UAAU,QAAQ,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC9C,aAAa,IAAI;AAAA,IACjB,kBAAkB,MAAM,WAAW,EAAE;AAAA,MACpC,CAAC,UAAU,SAAS,uBAAAC,QAAI,SAAS,IAAI;AAAA,IACtC;AAAA,EACD,CAAC;AACD,QAAM,UAAU,MAAM,QAAQ;AAAA,IAC7B,SAAS,IAAI,OAAO,QAAQ;AAC3B,YAAM,OAAO,aAAa,GAAG;AAC7B,aAAO,oBAAoB,MAAM,IAAI,EACnC,KAAK,CAAC,SAAS,EAAE,MAAM,IAAI,EAAE,EAC7B,MAAM,MAAM,IAAI;AAAA,IACnB,CAAC;AAAA,EACF;AACA,QAAM,aAAa,SAAS,IAAI,CAAC,OAAO;AAAA,IACvC,MAAM,cAAc,EAAE,IAAI;AAAA,IAC1B,KAAK,EAAE;AAAA,EACR,EAAE;AACF,QAAM,aAAa,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS;AACnD,QAAM,aAAa,aAChB,cAAc,WAAW,IAAI,KAC7B,MAAM,QAAQ,QAAQ,uBAAAA,QAAI,cAAc,EAAE,GAAG,MAAM,UAAU,KAAK,CAAC,CAAC,EACnE,KAAK,CAAC,OAAO,MAAM,cAAc,aAAa,EAAE,EAChD,MAAM,MAAM,cAAc,aAAa,EAAE;AAY7C,QAAM,UACL,WAAW,KAAK,CAAC,MAAM,GAAG,SAAS,UAAU,GAAG,OAC/C,MAAM,uBAAAA,QAAI,WAAW,EAAE,GAAG,MAAM,KAAK,OAAO,CAAC,EAAE,MAAM,MAAM,IAAI;AAEjE,QAAM,OAA6C,CAAC;AACpD,MAAI,QAAS,MAAK,KAAK,EAAE,MAAM,QAAQ,KAAK,QAAQ,CAAC;AACrD,aAAW,KAAK,WAAY,KAAI,EAAG,MAAK,KAAK,CAAC;AAC9C,aAAW,KAAK,QAAS,KAAI,EAAG,MAAK,KAAK,CAAC;AAE3C,SAAO,EAAE,MAAM,WAAW;AAC3B;AAkBA,eAAsB,eACrB,MACA,SACA,OACyB;AACzB,QAAM,EAAE,QAAQ,IAAI;AACpB,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,EAAE,MAAM,WAAW,IAAI,MAAM;AAAA,IAAQ;AAAA,IAAO;AAAA,IAAe,MAChE,YAAY,MAAM,QAAQ,iBAAiB,MAAM;AAAA,EAClD;AAEA,QAAM,WAAW,YAAY;AAC7B,QAAM,OAAO,WACV,yCAAyC,UAAU,8DAA8D,KAAK,KACtH,2CAA2C,KAAK;AAEnD,QAAM,QAAsB,CAAC,QAAQ,aAAa,OAAO;AAAA,CAAI,GAAG,KAAK;AAErE,MAAI,KAAK,WAAW,GAAG;AAEtB,UAAM;AAAA,MACL;AAAA,QACC,6DAA6D,IAAI;AAAA;AAAA,MAClE;AAAA,IACD;AAAA,EACD,OAAO;AACN,QAAI,QAAQ;AACZ,eAAW,EAAE,MAAM,IAAI,KAAK,MAAM;AACjC,YAAM;AAAA,QACL,QAAQ,QAAQ,GAAG,GAAG,IAAI,IAAI,KAAK,IAAI;AAAA,IAAO,GAAG,GAAG,IAAI,IAAI;AAAA,CAAI;AAAA,MACjE;AACA,cAAQ;AAAA,IACT;AAAA,EACD;AACA,QAAM,KAAK,KAAK;AAEhB,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,MACR,gBAAgB,iBAAiB,OAAO;AAAA,MACxC,iBAAiB;AAAA,IAClB;AAAA,IACA,MAAM,OAAO,GAAG,KAAK;AAAA,EACtB;AACD;;;AM1HA,IAAAC,yBAAgB;AAehB,IAAM,QAAQ,CAAC,OAAe,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AAS9E,IAAM,gCAAgC;AAuBtC,eAAsB,qBACrB,MACA,WACA,OACA,UACA,SAC8B;AAC9B,QAAM,cAAc,SAAS,eAAe;AAC5C,QAAM,OAAO,oBAAoB,MAAM,WAAW,IAAI,IAAI,YAAY,CAAC,CAAC;AACxE,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI,WAAW;AACf,QAAM,WAAW,oBAAI,IAA2B;AAEhD,iBAAe,qBAAqB,KAA4B;AAC/D,UAAM,MAAM,MAAM,uBAAAC,QAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC;AACjD,SAAK,IAAI,GAAG;AACZ,UAAM,WAA2C,CAAC;AAClD,QAAI,IAAI,SAAS,UAAU;AAC1B,YAAM,SAAS,IAAI;AACnB,eAAS,KAAK,CAAC,OAAO,MAAM,MAAM,CAAC;AACnC,iBAAW,UAAU,OAAO,OAAQ,UAAS,KAAK,CAAC,QAAQ,QAAQ,CAAC;AAAA,IACrE,WAAW,IAAI,SAAS,QAAQ;AAC/B,YAAM,OAAO,IAAI;AACjB,iBAAW,SAAS,MAAM;AAIzB,YAAI,MAAM,SAAS,SAAU;AAC7B,iBAAS,KAAK,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,MACtC;AAAA,IACD,WAAW,IAAI,SAAS,OAAO;AAC9B,eAAS,KAAK,CAAE,IAAI,OAA8B,QAAQ,MAAS,CAAC;AAAA,IACrE;AACA,UAAM,QAAQ,IAAI,SAAS,IAAI,CAAC,CAAC,OAAO,IAAI,MAAM,MAAM,OAAO,IAAI,CAAC,CAAC;AAAA,EACtE;AAEA,WAAS,MAAM,KAAa,MAA8B;AACzD,UAAM,WAAW,SAAS,IAAI,GAAG;AACjC,QAAI,SAAU,QAAO;AAErB,QAAI,KAAK,IAAI,GAAG,KAAM,SAAS,UAAU,CAAC,aAAc;AACvD,WAAK,IAAI,GAAG;AACZ,YAAMC,KAAI,QAAQ,QAAQ;AAC1B,eAAS,IAAI,KAAKA,EAAC;AACnB,aAAOA;AAAA,IACR;AAEA,UAAM,KAAK,YAAY;AACtB,UAAI;AACH,cAAM,qBAAqB,GAAG;AAAA,MAC/B,QAAQ;AACP,YAAI;AACH,gBAAM,MAAM,6BAA6B;AACzC,gBAAM,qBAAqB,GAAG;AAAA,QAC/B,SAAS,KAAK;AACb,qBAAW;AACX,iBAAO,SAAS,kBAAkB,GAAG,IAAI,GAAG;AAAA,QAC7C;AAAA,MACD;AAAA,IACD,GAAG;AAEH,aAAS,IAAI,KAAK,CAAC;AACnB,WAAO;AAAA,EACR;AAEA,QAAM,QAAQ,IAAI,UAAU,IAAI,CAAC,QAAQ,MAAM,GAAG,CAAC,CAAC;AACpD,SAAO,EAAE,MAAM,MAAM,KAAK,IAAI,GAAG,SAAS;AAC3C;;;AClHA,IAAAC,yBAAgB;;;ACQhB,IAAAC,yBAAgB;;;ACIT,IAAM,kBAAkB;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AAiBA,IAAM,cAAmC,IAAI,IAAI,eAAe;AAEhE,SAAS,eAAe,OAAsC;AAC7D,SAAO,YAAY,IAAI,KAAK;AAC7B;AAGO,SAAS,kBAAkB,MAAmC;AACpE,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,OAAO,EAAG,QAAO;AACrB,QAAM,OAAO,KAAK,MAAM,MAAM,CAAC;AAC/B,MAAI,CAAC,eAAe,IAAI,EAAG,QAAO;AAClC,SAAO,EAAE,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,MAAM,KAAK;AAC/C;AAGO,SAAS,aAAa,MAAc,MAA4B;AACtE,SAAO,GAAG,IAAI,IAAI,IAAI;AACvB;AAGO,SAAS,mBAAmB,SAA4C;AAC9E,SAAO,QACL,IAAI,iBAAiB,EACrB,OAAO,CAAC,SAA+B,SAAS,IAAI;AACvD;;;AC1CA,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AACtB,IAAM,YAAY;AAClB,IAAM,qBAAqB;AAE3B,IAAM,SAAS;AAAA,EACd,OAAO;AAAA,EACP,SAAS;AAAA,EACT,aAAa;AAAA,EACb,eAAe;AAAA;AAAA,EAEf,iBAAiB;AAClB;AAsBO,SAAS,cAAc,KAA0C;AACvE,QAAM,OAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AACpE,QAAM,aAAa,OAAO,cAAc,OAAO,gBAAgB;AAC/D,MACC,IAAI,aAAa,cACjB,KAAK,UAAU,CAAC,MAAM,OAAO,SAC7B,KAAK,UAAU,CAAC,MAAM,OAAO,SAC5B;AACD,WAAO;AAAA,EACR;AAEA,QAAM,QAAQ,KAAK,UAAU,aAAa,CAAC;AAC3C,QAAM,WAAW,aAAa,QAAQ;AACtC,QAAM,eAAe,WAAW,QAAQ;AACxC,MAAI,IAAI,aAAa,eAAe,QAAQ,EAAG,QAAO;AAEtD,QAAM,UAA4B,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/B,UAAM,SAAS,KAAK,UAAU,eAAe,IAAI,CAAC;AAGlD,QAAI,SAAS,OAAO,gBAAiB,QAAO;AAC5C,UAAM,KAAK,aAAa,IAAI;AAC5B,YAAQ,KAAK,EAAE,KAAK,MAAM,IAAI,SAAS,IAAI,KAAK,SAAS,CAAC,GAAG,OAAO,CAAC;AAAA,EACtE;AACA,SAAO;AACR;AAGA,SAAS,UAAU,KAAiB,MAAsC;AACzE,QAAM,UAAU,cAAc,GAAG;AACjC,MAAI,CAAC,QAAS,QAAO;AAGrB,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAC1C,QAAM,UAAU,oBAAI,IAAuB;AAC3C,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,UAAU,KAAK,aAAa;AAClC,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACxC,UAAM,EAAE,KAAK,OAAO,IAAI,QAAQ,CAAC;AACjC,UAAM,MAAM,QAAQ,IAAI,CAAC,GAAG,UAAU;AACtC,YAAQ,IAAI,KAAK,EAAE,MAAM,OAAO,QAAQ,IAAI,CAAC;AAC7C,gBAAY,IAAI,QAAQ,GAAG;AAAA,EAC5B;AACA,SAAO,EAAE,SAAS,YAAY;AAC/B;AAUA,SAAS,gBAAgB,OAAmB,OAA4B;AACvE,MAAI,OAAO,MAAM,KAAK;AACtB,QAAM,OAAQ,QAAQ,IAAK;AAC3B,MAAI,OAAO,OAAO;AAClB,MAAI,QAAQ;AACZ,MAAI,KAAK,QAAQ;AACjB,SAAO,OAAO,KAAM;AACnB,WAAO,MAAM,IAAI;AACjB,aAAS,OAAO,OAAQ,KAAK;AAC7B,aAAS;AAAA,EACV;AACA,SAAO,EAAE,MAAM,MAAM,QAAQ,KAAK,MAAM;AACzC;AAEA,SAAS,kBAAkB,MAAc,MAA0B;AAClE,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO,KAAK,MAAM,OAAO,EAAE;AAC/B,QAAM,MAAM,OAAO,IAAI,MAAO,KAAM,QAAQ,IAAM,OAAO,EAAG;AAC5D,SAAO,OAAO,GAAG;AAChB,UAAM,MAAM,OAAO;AACnB,WAAO,KAAK,MAAM,OAAO,GAAG;AAC5B,UAAM,MAAM,OAAO,IAAI,MAAO,KAAK,GAAG;AAAA,EACvC;AACA,SAAO,IAAI,WAAW,KAAK;AAC5B;AAGA,SAAS,mBACR,OACA,OACuC;AACvC,MAAI,KAAK;AACT,MAAI,OAAO,MAAM,IAAI;AACrB,MAAI,WAAW,OAAO;AACtB,SAAO,OAAO,KAAM;AACnB,WAAO,MAAM,IAAI;AACjB,gBAAY,WAAW,KAAK,OAAO,OAAO;AAAA,EAC3C;AACA,SAAO,EAAE,UAAU,QAAQ,KAAK,MAAM;AACvC;AASA,SAAS,cACR,OACA,SACuB;AACvB,QAAM,EAAE,MAAM,OAAO,IAAI,IAAI;AAC7B,QAAM,SAAS,gBAAgB,MAAM,KAAK;AAC1C,QAAM,YAAY,QAAQ,OAAO;AACjC,MAAI,OAAO,SAAS,eAAe;AAClC,WAAO;AAAA,MACN,OAAO,KAAK,SAAS,OAAO,GAAG;AAAA,MAC/B,SAAS,MAAM,KAAK,SAAS,WAAW,YAAY,SAAS,CAAC;AAAA,IAC/D;AAAA,EACD;AACA,MAAI,OAAO,SAAS,eAAe;AAClC,WAAO,EAAE,OAAO,KAAK,SAAS,OAAO,GAAG,GAAG,SAAS,KAAK;AAAA,EAC1D;AACA,QAAM,EAAE,UAAU,OAAO,IAAI,mBAAmB,MAAM,SAAS;AAC/D,QAAM,UAAU,QAAQ,YAAY,IAAI,QAAQ,QAAQ;AACxD,MAAI,YAAY,OAAW,QAAO;AAClC,SAAO;AAAA,IACN,OAAO;AAAA,MACN,kBAAkB,eAAe,OAAO,IAAI;AAAA,MAC5C,QAAQ,OAAO;AAAA,MACf,KAAK,SAAS,YAAY,QAAQ,GAAG;AAAA,IACtC;AAAA,IACA;AAAA,EACD;AACD;AAOA,eAAsB,2BACrB,MACA,MAC6B;AAC7B,QAAM,MAAM,MAAM,IAAI;AACtB,QAAM,UAAU,GAAG,KAAK,MAAM;AAC9B,QAAM,QAAQ;AAAA,IACb,MAAM,IAAI,QAAQ,OAAO,EAAE,MAAM,MAAM,CAAC,CAAa;AAAA,EACtD,EAAE,OAAO,CAAC,SAAS,KAAK,SAAS,MAAM;AAEvC,QAAM,UAAyB,CAAC;AAChC,aAAW,EAAE,KAAK,KAAK,OAAO;AAE7B,UAAM,CAAC,MAAM,GAAG,IAAI,MAAM,QAAQ,IAAI;AAAA,MACrC,IAAI,SAAS,GAAG,OAAO,IAAI,aAAa,MAAM,MAAM,CAAC,EAAE;AAAA,MACvD,IAAI,SAAS,GAAG,OAAO,IAAI,aAAa,MAAM,KAAK,CAAC,EAAE;AAAA,IACvD,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,IAAI,CAAC;AAC3B,QAAI,EAAE,gBAAgB,eAAe,EAAE,eAAe,aAAa;AAClE,aAAO;AAAA,IACR;AACA,UAAM,UAAU,UAAU,KAAK,IAAI;AACnC,QAAI,CAAC,QAAS,QAAO;AACrB,YAAQ,KAAK,OAAO;AAAA,EACrB;AAEA,QAAM,SAAS,CAAC,QAAsC;AACrD,eAAW,WAAW,SAAS;AAC9B,YAAM,QAAQ,QAAQ,QAAQ,IAAI,GAAG;AACrC,UAAI,MAAO,QAAO,cAAc,OAAO,OAAO;AAAA,IAC/C;AACA,WAAO;AAAA,EACR;AAGA,QAAM,UAAwB,CAAC;AAC/B,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,QAAQ,CAAC,QAAyB;AACvC,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,QAAI,QAAQ,IAAI,GAAG,EAAG,QAAO;AAC7B,UAAM,QAAQ,OAAO,GAAG;AACxB,QAAI,CAAC,MAAO,QAAO;AACnB,YAAQ,IAAI,GAAG;AACf,QAAI,MAAM,YAAY,QAAQ,CAAC,MAAM,MAAM,OAAO,EAAG,QAAO;AAC5D,YAAQ,OAAO,GAAG;AAClB,SAAK,IAAI,GAAG;AACZ,YAAQ,KAAK,MAAM,KAAK;AACxB,WAAO;AAAA,EACR;AACA,aAAW,OAAO,MAAM;AACvB,QAAI,CAAC,MAAM,GAAG,EAAG,QAAO;AAAA,EACzB;AAEA,QAAM,SAAS,IAAI,WAAW,EAAE;AAChC,SAAO,IAAI,WAAW,MAAM,GAAG,CAAC;AAChC,QAAM,OAAO,IAAI,SAAS,OAAO,MAAM;AACvC,OAAK,UAAU,GAAG,CAAC;AACnB,OAAK,UAAU,GAAG,QAAQ,MAAM;AAChC,QAAM,OAAO,OAAO,QAAQ,GAAG,OAAO;AACtC,SAAO,OAAO,MAAM,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC;AAC9C;;;AFjOA,IAAM,wBAAwD;AAAA,EAC7D,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AACN;AAKA,SAAS,uBACR,MACA,QACa;AACb,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO,SAAS;AACpB,QAAM;AAAA,KACJ,OAAO,MAAa,KAAK,sBAAsB,IAAI,IAAK,SAAS;AAAA,EACnE;AACA,cAAY;AACZ,SAAO,MAAM;AACZ,WAAO,SAAS;AAChB,UAAM,MAAM,OAAO,MAAa,KAAM,SAAS,GAAW;AAC1D,gBAAY;AAAA,EACb;AACA,SAAO,IAAI,WAAW,KAAK;AAC5B;AAKA,eAAe,cACd,MACA,SACkB;AAClB,QAAM,SAAS,WAAW,GAAG,IAAI,IAAI,QAAQ,MAAM,IAAI;AACvD,SAAO,KAAK,OAAO,QAAQ,OAAO,CAAC;AACpC;AAWA,eAAe,qBACd,MACA,MACuC;AACvC,QAAM,UAAU,oBAAI,IAA4B;AAChD,QAAM,aAAa;AACnB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,YAAY;AACjD,UAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,UAAU;AAC1C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,MAAM,IAAI,OAAO,QAAQ;AACxB,cAAM,EAAE,MAAM,OAAO,IAAI,MAAM,uBAAAC,QAAI,WAAW;AAAA,UAC7C,GAAG;AAAA,UACH;AAAA,UACA,QAAQ;AAAA,QACT,CAAC;AACD,cAAM,UAAU;AAChB,cAAM,YAAY,MAAM,cAAc,MAAM,OAAO;AACnD,YAAI,cAAc,KAAK;AACtB,gBAAM,IAAI;AAAA,YACT,kBAAkB,GAAG,sDACL,SAAS;AAAA,UAC1B;AAAA,QACD;AACA,eAAO,EAAE,KAAK,MAA8B,QAAQ;AAAA,MACrD,CAAC;AAAA,IACF;AACA,eAAW,EAAE,KAAK,MAAM,QAAQ,KAAK,SAAS;AAC7C,cAAQ,IAAI,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,IACnC;AAAA,EACD;AACA,SAAO;AACR;AAMA,eAAe,kBACd,MACA,SACsB;AAEtB,QAAM,SAAS,IAAI,WAAW,EAAE;AAChC,QAAM,OAAO,IAAI,SAAS,OAAO,MAAM;AACvC,SAAO,IAAI,WAAW,MAAM,GAAG,CAAC;AAChC,OAAK,UAAU,GAAG,GAAG,KAAK;AAC1B,OAAK,UAAU,GAAG,KAAK,QAAQ,KAAK;AAEpC,QAAM,SAAuB,CAAC,MAAM;AAEpC,QAAM,aAAa;AACnB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,YAAY;AACjD,UAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,UAAU;AAC1C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,MAAM,IAAI,OAAO,QAAQ;AACxB,cAAM,QAAQ,QAAQ,IAAI,GAAG;AAC7B,YAAI,CAAC,OAAO;AACX,gBAAM,IAAI,MAAM,uCAAuC,GAAG,EAAE;AAAA,QAC7D;AACA,cAAM,YAAY;AAAA,UACjB,MAAM;AAAA,UACN,MAAM,QAAQ;AAAA,QACf;AACA,cAAM,aAAa,MAAM,QAAQ,MAAM,OAAO;AAC9C,eAAO,OAAO,WAAW,UAAU;AAAA,MACpC,CAAC;AAAA,IACF;AACA,WAAO,KAAK,GAAG,OAAO;AAAA,EACvB;AAOA,QAAM,WAAW,OAAO,GAAG,MAAM;AACjC,QAAM,UAAU,QAAQ,MAAM,KAAK,QAAQ,CAAC;AAC5C,SAAO,OAAO,UAAU,OAAO;AAChC;AAMO,IAAM,8BAA8B;AAE3C,eAAe,kBAAkB,MAAqC;AACrE,QAAM,UAAU,MAAM,MAAM,IAAI,EAC9B,QAAQ,GAAG,KAAK,MAAM,eAAe,EACrC,MAAM,MAAM,CAAC,CAAa;AAC5B,SAAO,mBAAmB,OAAO;AAClC;AAEA,eAAe,WAAW,MAA6B;AACtD,QAAM,QAAQ,MAAM,kBAAkB,IAAI;AAC1C,SAAO,MAAM,OAAO,CAAC,SAAS,KAAK,SAAS,MAAM,EAAE;AACrD;AAYA,eAAsB,iBACrB,MACA,SACA,OACoB;AACpB,QAAM,YAAY,SAAS,aAAa;AACxC,QAAM,MAAM,MAAM,IAAI;AACtB,MAAI;AACH,QAAK,MAAM,WAAW,IAAI,IAAK,WAAW;AACzC,aAAO,CAAC;AAAA,IACT;AAEA,UAAM,CAAC,UAAU,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC1C,uBAAAA,QAAI,aAAa,IAAI;AAAA,MACrB,uBAAAA,QAAI,SAAS,IAAI;AAAA,IAClB,CAAC;AACD,UAAM,WAAW;AAAA,MAChB,GAAG,SAAS,IAAI,CAAC,MAAM,cAAc,CAAC,EAAE;AAAA,MACxC,GAAG,KAAK,IAAI,CAAC,MAAM,aAAa,CAAC,EAAE;AAAA,IACpC;AACA,UAAM,WACL,MAAM,QAAQ;AAAA,MACb,SAAS;AAAA,QAAI,CAAC,QACb,uBAAAA,QAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,MAAM,MAAM,IAAI;AAAA,MAClD;AAAA,IACD,GACC,OAAO,CAAC,QAAuB,QAAQ,IAAI;AAC7C,QAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAElC,UAAM,EAAE,MAAM,WAAW,SAAS,IAAI,MAAM;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,QAAI,CAAC,YAAY,UAAU,WAAW,EAAG,QAAO,CAAC;AAEjD,UAAM,UAAU,GAAG,KAAK,MAAM;AAI9B,UAAM,aACJ,MAAM,2BAA2B,MAAM,SAAS,KAChD,MAAM;AAAA,MACN;AAAA,MACA,MAAM,qBAAqB,MAAM,SAAS;AAAA,IAC3C;AAED,UAAM,IAAI,MAAM,SAAS,EAAE,WAAW,KAAK,CAAC;AAC5C,UAAM,UAAU,QAAQ,KAAK,IAAI,CAAC;AAClC,UAAM,cAAc,aAAa,SAAS,MAAM;AAChD,UAAM,IAAI,UAAU,GAAG,OAAO,IAAI,WAAW,IAAI,UAAU;AAE3D,UAAM,EAAE,MAAM,YAAY,IAAI,MAAM,uBAAAA,QAAI,UAAU;AAAA,MACjD,GAAG;AAAA,MACH,KAAK;AAAA,MACL,UAAU;AAAA,IACX,CAAC;AAID,UAAM,UAAU,IAAI,IAAI,WAAW;AACnC,QAAI,UAAU,KAAK,CAAC,QAAQ,CAAC,QAAQ,IAAI,GAAG,CAAC,GAAG;AAC/C,YAAM,QAAQ;AAAA,QACZ,CAAC,QAAQ,KAAK,EAAY;AAAA,UAAI,CAAC,SAC/B,IACE,OAAO,GAAG,OAAO,IAAI,aAAa,SAAS,IAAI,CAAC,EAAE,EAClD,MAAM,MAAM;AAAA,UAAC,CAAC;AAAA,QACjB;AAAA,MACD;AACA,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAEA,UAAM,SAAS,MAAM,kBAAkB,IAAI,GAAG;AAAA,MAC7C,CAAC,SAAS,KAAK,SAAS;AAAA,IACzB;AACA,UAAM,QAAQ;AAAA,MACb,MAAM;AAAA,QAAI,CAAC,SACV,IAAI,OAAO,GAAG,OAAO,IAAI,KAAK,IAAI,EAAE,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AAAA,MACrD;AAAA,IACD;AACA,WAAO,MAAM,IAAI,CAAC,SAAS,gBAAgB,KAAK,IAAI,EAAE;AAAA,EACvD,SAAS,KAAK;AACb,WAAO,SAAS,6BAA6B,GAAG;AAChD,WAAO,CAAC;AAAA,EACT;AACD;;;ADlQA,IAAM,WAAW,IAAI,OAAO,EAAE;AAevB,SAAS,qBAAqB,MAGnC;AACD,QAAM,aAAiC,CAAC;AACxC,MAAI,MAAM;AACV,SAAO,MAAM,KAAK,KAAK,QAAQ;AAC9B,UAAM,MAAM,OAAO,SAAS,YAAY,KAAK,SAAS,KAAK,MAAM,CAAC,CAAC,GAAG,EAAE;AACxE,QAAI,QAAQ,GAAG;AACd,aAAO;AACP;AAAA,IACD;AACA,QAAI,MAAM,EAAG;AAEb,UAAM,OAAO,WAAW,KAAK,SAAS,MAAM,GAAG,MAAM,GAAG,CAAC,EACvD,QAAQ,OAAO,EAAE,EACjB,MAAM,IAAI,EAAE,CAAC;AACf,WAAO;AACP,UAAM,SAAS,QAAQ,IAAI,MAAM,GAAG;AACpC,UAAM,CAAC,QAAQ,QAAQ,OAAO,IAAI;AAClC,QAAI,UAAU,UAAU,SAAS;AAChC,iBAAW,KAAK,EAAE,QAAQ,QAAQ,QAAQ,CAAC;AAAA,IAC5C;AAAA,EACD;AACA,SAAO,EAAE,YAAY,UAAU,KAAK,SAAS,GAAG,EAAE;AACnD;AAGA,eAAsB,sBACrB,MACA,gBAAgB,QACA;AAChB,QAAM,MAAM,MAAM,IAAI;AACtB,MAAI;AACH,UAAM,IAAI,KAAK,GAAG,KAAK,MAAM,OAAO;AAAA,EACrC,QAAQ;AACP,UAAM,IAAI,MAAM,KAAK,QAAQ,EAAE,WAAW,KAAK,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAChE,UAAM,uBAAAC,QAAI,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,QAAQ,eAAe,MAAM,KAAK,CAAC;AAAA,EACxE;AACD;AAGA,eAAsB,kBACrB,MACA,UACA,OACoB;AACpB,MAAI,SAAS,SAAS,EAAG,QAAO,CAAC;AACjC,QAAM,WAAW,MAAM;AAAA,IACtB;AAAA,IACA;AAAA,IACA,YAAY;AACX,YAAM,MAAM,MAAM,IAAI;AACtB,YAAM,UAAU,GAAG,KAAK,MAAM;AAC9B,YAAM,IAAI,MAAM,SAAS,EAAE,WAAW,KAAK,CAAC;AAE5C,YAAMC,YAAW,QAAQ,KAAK,IAAI,CAAC;AACnC,YAAM,IAAI,UAAU,GAAG,OAAO,IAAIA,SAAQ,SAAS,QAAQ;AAE3D,YAAM,uBAAAD,QAAI,UAAU;AAAA,QACnB,GAAG;AAAA,QACH,KAAK;AAAA,QACL,UAAU,GAAGC,SAAQ;AAAA,MACtB,CAAC;AACD,aAAOA;AAAA,IACR;AAAA,EACD;AACA,SAAO;AAAA,IACN,GAAG,KAAK,MAAM,iBAAiB,QAAQ;AAAA,IACvC,GAAG,KAAK,MAAM,iBAAiB,QAAQ;AAAA,EACxC;AACD;AAYA,eAAe,YACd,MACA,SACA,QACkC;AAClC,MAAI,CAAC,kBAAkB,OAAO,GAAG;AAChC,WAAO,EAAE,SAAS,IAAI,OAAO,QAAQ,mBAAmB;AAAA,EACzD;AACA,QAAM,aAAa,MAAM,uBAAAD,QACvB,WAAW,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,EACpC,MAAM,MAAM,QAAQ;AACtB,SAAO,eAAe,SACnB,OACA;AAAA,IACA;AAAA,IACA,IAAI;AAAA,IACJ,QAAQ;AAAA,EACT;AACH;AAIA,eAAe,uBAAuB,MAAkC;AACvE,QAAM,CAAC,UAAU,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC1C,uBAAAA,QAAI,aAAa,IAAI;AAAA,IACrB,uBAAAA,QAAI,SAAS,IAAI;AAAA,EAClB,CAAC;AACD,QAAM,OAAO;AAAA,IACZ,GAAG,SAAS,IAAI,CAAC,MAAM,cAAc,CAAC,EAAE;AAAA,IACxC,GAAG,KAAK,IAAI,CAAC,MAAM,aAAa,CAAC,EAAE;AAAA,EACpC;AACA,QAAM,OAAO,MAAM,QAAQ;AAAA,IAC1B,KAAK,IAAI,CAAC,QAAQ,uBAAAA,QAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,MAAM,MAAM,IAAI,CAAC;AAAA,EACrE;AACA,SAAO,IAAI,IAAI,KAAK,OAAO,CAAC,QAAuB,QAAQ,IAAI,CAAC;AACjE;AAEA,eAAe,mBACd,MACA,YAC6B;AAC7B,SAAO,QAAQ;AAAA,IACd,WAAW;AAAA,MACV,OAAO,EAAE,QAAQ,QAAQ,MACvB,MAAM,YAAY,MAAM,SAAS,MAAM,KAAM,EAAE,SAAS,IAAI,KAAK;AAAA,IACpE;AAAA,EACD;AACD;AAOA,eAAsB,gBACrB,MACA,YACA,OAC6B;AAC7B,SAAO;AAAA,IAAQ;AAAA,IAAO;AAAA,IAAqB,MAC1C,QAAQ;AAAA,MACP,WAAW,IAAI,OAAO,EAAE,QAAQ,QAAQ,QAAQ,MAAM;AACrD,cAAM,UAAU,MAAM,YAAY,MAAM,SAAS,MAAM;AACvD,YAAI,QAAS,QAAO;AAEpB,YAAI,WAAW,UAAU;AACxB,gBAAM,uBAAAA,QAAI,UAAU,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AAAA,QAC9D,OAAO;AACN,gBAAM,uBAAAA,QAAI,SAAS;AAAA,YAClB,GAAG;AAAA,YACH,KAAK;AAAA,YACL,OAAO;AAAA,YACP,OAAO;AAAA,UACR,CAAC;AAAA,QACF;AACA,eAAO,EAAE,SAAS,IAAI,KAAK;AAAA,MAC5B,CAAC;AAAA,IACF;AAAA,EACD;AACD;AAGO,SAAS,oBAAoB,SAA2C;AAC9E,QAAM,eAAe;AAAA,IACpB,QAAQ,aAAa;AAAA,IACrB,GAAG,QAAQ;AAAA,MAAI,CAAC,EAAE,SAAS,IAAI,OAAO,MACrC,QAAQ,KAAK,MAAM,OAAO;AAAA,IAAO,MAAM,OAAO,IAAI,MAAM;AAAA,CAAI;AAAA,IAC7D;AAAA,IACA;AAAA,EACD;AAEA,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,MACR,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,IAClB;AAAA,IACA,MAAM;AAAA,EACP;AACD;AAoBA,eAAsB,iBACrB,MACA,QACA,SACA,OACoE;AACpE,QAAM,sBAAsB,MAAM,SAAS,iBAAiB,MAAM;AAClE,QAAM,YAAY,MAAM,mBAAmB,MAAM,OAAO,UAAU;AAClE,QAAM,kBAAkB,OAAO,WAAW;AAAA,IACzC,CAAC,GAAG,UAAU,UAAU,KAAK,GAAG;AAAA,EACjC;AACA,QAAM,oBAAoB,MAAM;AAAA,IAC/B;AAAA,IACA,gBAAgB,KAAK,CAAC,WAAW,OAAO,WAAW,QAAQ,IACxD,OAAO,WACP,IAAI,WAAW;AAAA,IAClB;AAAA,EACD;AAEA,QAAM,UAAU,gBACd,OAAO,CAAC,WAAW,OAAO,WAAW,QAAQ,EAC7C,IAAI,CAAC,WAAW,OAAO,MAAM;AAC/B,MAAI,QAAQ,SAAS,GAAG;AAOvB,UAAM,WAAW,MAAM,uBAAuB,IAAI;AAClD,eAAW,UAAU,iBAAiB;AACrC,UAAI,OAAO,WAAW,SAAU,UAAS,IAAI,OAAO,MAAM;AAAA,IAC3D;AACA,UAAM,EAAE,SAAS,IAAI,MAAM;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,QAAI,CAAC,UAAU;AACd,YAAM,QAAQ;AAAA,QACb,kBAAkB;AAAA,UAAI,CAAC,aACtB,MAAM,IAAI,EACR,OAAO,QAAQ,EACf,MAAM,MAAM;AAAA,UAAC,CAAC;AAAA,QACjB;AAAA,MACD;AACA,aAAO;AAAA,QACN,SAAS,UAAU;AAAA,UAAI,CAAC,WACvB,OAAO,KACJ,EAAE,GAAG,QAAQ,IAAI,OAAO,QAAQ,0BAA0B,IAC1D;AAAA,QACJ;AAAA,QACA,gBAAgB,CAAC;AAAA,MAClB;AAAA,IACD;AAAA,EACD;AAEA,QAAM,UAAU,MAAM,gBAAgB,MAAM,iBAAiB,KAAK;AAClE,QAAM,UAAU,UAAU;AAAA,IAAI,CAAC,QAAQ,UACtC,OAAO,KACH,QAAQ;AAAA,MACT,CAAC,UAAU,MAAM,YAAY,OAAO,WAAW,KAAK,GAAG;AAAA,IACxD,KAAK,SACJ;AAAA,EACJ;AACA,QAAM,gBAAgB,SAAS;AAC/B,QAAM,iBACL,kBAAkB,SAAS,CAAC,QAAQ,KAAK,CAAC,WAAW,OAAO,EAAE,IAC3D,CAAC,IACD,MAAM;AAAA,IAAQ;AAAA,IAAO;AAAA,IAAU,MAC/B,iBAAiB,MAAM,eAAe,KAAK;AAAA,EAC5C;AACH,SAAO,EAAE,SAAS,eAAe;AAClC;;;AI5SA,IAAAE,yBAAgB;AAShB,IAAMC,YAAW,IAAI,OAAO,EAAE;AAqB9B,eAAsB,iBACrB,MACA,MACA,SACA,OACyB;AACzB,QAAM,QAAQ,cAAc,IAAI;AAEhC,QAAM,QAAkB,CAAC;AACzB,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AACX,aAAW,QAAQ,OAAO;AACzB,QAAI,CAAC,KAAM;AACX,QAAI,KAAK,WAAW,OAAO,GAAG;AAC7B,YAAM,KAAK,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IAC7B;AACA,QAAI,KAAK,WAAW,OAAO,GAAG;AAC7B,YAAM,MAAM,KAAK,MAAM,GAAG,EAAE;AAC5B,UAAI,QAAQA,WAAU;AACrB,cAAM,KAAK,GAAG;AAAA,MACf;AAAA,IACD;AACA,QAAI,KAAK,WAAW,MAAM,GAAG;AAC5B,aAAO;AAAA,IACR;AAAA,EACD;AAEA,MAAI,MAAM,WAAW,GAAG;AACvB,WAAO;AAAA,MACN,QAAQ;AAAA,MACR,SAAS,EAAE,gBAAgB,uCAAuC;AAAA,MAClE,MAAM,OAAO,QAAQ,OAAO,CAAC;AAAA,IAC9B;AAAA,EACD;AAEA,MAAI,MAAM,SAAS,KAAK,CAAC,MAAM;AAC9B,WAAO;AAAA,MACN,QAAQ;AAAA,MACR,SAAS,EAAE,gBAAgB,uCAAuC;AAAA,MAClE,MAAM,OAAO,QAAQ,OAAO,CAAC;AAAA,IAC9B;AAAA,EACD;AAIA,MAAI,MAAM,WAAW,GAAG;AACvB,UAAM,cAAc,GAAG,KAAK,MAAM;AAClC,UAAM,UAAU,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAwB,MAC5D,MAAM,IAAI,EACR,QAAQ,WAAW,EACnB,MAAM,MAAM,CAAC,CAAa;AAAA,IAC7B;AACA,UAAM,YAAY,mBAAmB,OAAO,EAC1C,OAAO,CAAC,SAAS,KAAK,SAAS,MAAM,EACrC,IAAI,CAAC,SAAS,KAAK,IAAI;AACzB,UAAM,WAAW,UAAU,CAAC;AAC5B,QAAI,UAAU,WAAW,KAAK,aAAa,QAAW;AACrD,YAAM,WAAW,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA,MAAM,MAAM,IAAI,EAAE,SAAS,GAAG,WAAW,IAAI,QAAQ,EAAE;AAAA,MACxD;AACA,YAAM,QACL,oBAAoB,aACjB,WACA,IAAI,YAAY,EAAE,OAAO,QAAkB;AAC/C,aAAO;AAAA,QACN,QAAQ;AAAA,QACR,SAAS;AAAA,UACR,gBAAgB;AAAA,UAChB,iBAAiB;AAAA,QAClB;AAAA,QACA,MAAM,OAAO,QAAQ,OAAO,GAAG,iBAAiB,KAAK,CAAC;AAAA,MACvD;AAAA,IACD;AAAA,EACD;AAEA,MAAI,SAAS,YAAY;AACxB,UAAM,QAAQ,OAAO,cAAc,QAAQ,UAAU;AAAA,EACtD;AAIA,MAAI;AACJ,MAAI,MAAM,SAAS,GAAG;AACrB,UAAM,EAAE,MAAM,SAAS,IAAI,MAAM;AAAA,MAChC;AAAA,MACA;AAAA,MACA,MACC,qBAAqB,MAAM,OAAO,OAAO,QAAW;AAAA,QACnD,aAAa;AAAA,MACd,CAAC;AAAA,IACH;AACA,cAAU,IAAI,IAAI,QAAQ;AAAA,EAC3B;AAEA,QAAM,EAAE,MAAM,SAAS,IAAI,MAAM;AAAA,IAChC;AAAA,IACA;AAAA,IACA,MACC,qBAAqB,MAAM,OAAO,OAAO,SAAS;AAAA,MACjD,aAAa;AAAA,IACd,CAAC;AAAA,EACH;AAEA,QAAM,OAAO,UAAU,SAAS,OAAO,CAAC,QAAQ,CAAC,QAAQ,IAAI,GAAG,CAAC,IAAI;AAIrE,QAAM,SAAS,MAAM;AAAA,IACpB;AAAA,IACA,uBAAuB,KAAK,MAAM;AAAA,IAClC,MAAM,2BAA2B,MAAM,IAAI;AAAA,EAC5C;AACA,QAAM,YACL,UACC,MAAM,QAAQ,OAAO,gBAAgB,KAAK,MAAM,UAAU,YAAY;AACtE,UAAM,EAAE,SAAS,IAAI,MAAM,uBAAAC,QAAI,YAAY,EAAE,GAAG,MAAM,KAAK,CAAC;AAC5D,WAAO,oBAAoB,aACxB,WACA,IAAI,WAAW,YAAY,CAAC,CAAC;AAAA,EACjC,CAAC;AAEF,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,MACR,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,IAClB;AAAA,IACA,MAAM,OAAO,QAAQ,OAAO,GAAG,iBAAiB,SAAS,CAAC;AAAA,EAC3D;AACD;","names":["import_isomorphic_git","FULL_SHA_RE","git","git","import_isomorphic_git","git","p","import_isomorphic_git","import_isomorphic_git","git","git","packName","import_isomorphic_git","ZERO_OID","git"]}

package/dist/http.d.cts

@@ -1,215 +0,0 @@
-import { R as Repo } from './types-BHoHOaQt.cjs';
-import 'isomorphic-git';
-
-/**
- * Transport-agnostic HTTP response the handlers produce.
- *
- * `body` is pinned to `Uint8Array<ArrayBuffer>` (not the bare `Uint8Array`,
- * whose default type argument isn't consistent across TypeScript versions)
- * so it's always assignable to Fetch API `BodyInit` regardless of which
- * TypeScript/lib version a consumer compiles against — every producer here
- * (`concat`, `pktLine`, `TextEncoder.encode`) is ArrayBuffer-backed already.
- */
-interface GitHttpResult {
-    status: number;
-    headers: Record<string, string>;
-    body: Uint8Array<ArrayBuffer>;
-}
-/** Optional instrumentation hooks shared by the /http handlers. */
-interface HttpHooks {
-    /** Wrap a timed sub-step. Default: run directly. */
-    step?: <T>(label: string, fn: () => Promise<T>) => Promise<T>;
-    /** Non-fatal problem sink (missing objects, failed repacks). */
-    onWarn?: (message: string, error?: unknown) => void;
-}
-/**
- * The raw promise-fs surface some /http paths need beyond isomorphic-git's
- * plumbing (writing an incoming pack file, listing/deleting pack files).
- * Both `node:fs` and this package's `GitFs` satisfy it via `.promises`.
- */
-interface RawFsPromises {
-    readFile(path: string): Promise<Uint8Array | string>;
-    writeFile(path: string, data: Uint8Array | string): Promise<void>;
-    unlink(path: string): Promise<void>;
-    readdir(path: string): Promise<string[]>;
-    mkdir(path: string, options?: {
-        recursive?: boolean;
-    }): Promise<unknown>;
-    stat(path: string): Promise<unknown>;
-}
-/** Duck-type the `.promises` surface off a repo's fs. */
-declare function rawFs(repo: Repo): RawFsPromises;
-
-type GitService = "git-upload-pack" | "git-receive-pack";
-/** All refs with resolved oids, plus the symref HEAD should advertise. */
-declare function listAllRefs(repo: Repo, defaultBranch?: string): Promise<{
-    refs: {
-        name: string;
-        oid: string;
-    }[];
-    headSymref: string;
-}>;
-interface InfoRefsOptions {
-    service: GitService;
-    defaultBranch?: string;
-    /** Advertised in the agent capability. Default "git-fs-s3". */
-    agent?: string;
-}
-/**
- * `GET …/info/refs?service=…` — the ref advertisement. Authentication and
- * authorization are the caller's job before invoking this.
- *
- * Capabilities advertised match what the sibling handlers implement:
- * side-band-64k (honored by handleUploadPack's response framing — clients
- * like isomorphic-git unconditionally expect it), tip/reachable sha1 wants,
- * delete-refs and report-status for pushes.
- */
-declare function handleInfoRefs(repo: Repo, options: InfoRefsOptions, hooks?: HttpHooks): Promise<GitHttpResult>;
-
-/**
- * Git pkt-line framing (smart HTTP protocol wire format).
- *
- * Edge-compatible: uses Uint8Array instead of Buffer.
- */
-/** Flush packet: exactly four zero bytes. */
-declare const FLUSH: Uint8Array<ArrayBuffer>;
-/** Frame a UTF-8 string as one pkt-line. */
-declare function pktLine(data: string): Uint8Array<ArrayBuffer>;
-/** Frame raw bytes as one pkt-line. */
-declare function pktLineBuffer(body: Uint8Array): Uint8Array<ArrayBuffer>;
-/** Decode pkt-lines to strings; `null` marks a flush-pkt. Stops on garbage. */
-declare function parsePktLines(buf: Uint8Array): Array<string | null>;
-declare function sideBandPackfile(packData: Uint8Array): Uint8Array<ArrayBuffer>;
-
-interface ReachabilityResult {
-    oids: string[];
-    /**
-     * False if any object in the graph couldn't be read — repack uses this
-     * (not a raw object-count comparison) to decide whether it's safe to
-     * delete old packs: counts alone can't distinguish "everything read fine"
-     * from "some objects silently failed".
-     */
-    complete: boolean;
-}
-/**
- * Walk the object graph from `startOids`, returning every reachable oid.
- * Concurrent traversal paths are deduplicated promise-per-oid; a missing
- * object is retried once, then reported through `hooks.onWarn` and
- * reflected in `complete: false`.
- *
- * `haveOids` bounds the walk: any oid in this set is assumed already
- * verified (it was reachable from a ref that existed before this call) and
- * is recorded in `seen` without being read or descended into. Without a
- * boundary, every call re-walks the *entire* history from scratch — for
- * receive-pack validation (see receive-pack.ts) that means every push pays
- * for reading every object in the repo, not just the ones it introduced,
- * and one transient read failure anywhere in that whole history rejects an
- * otherwise-valid push.
- *
- * Commits, trees and tags are read once each (parsed). Blobs have no
- * children, so `verifyBlobs: false` records a blob from its tree entry
- * without reading (and inflating) it — for callers that read every blob
- * themselves afterwards anyway, like upload-pack's `packObjects`. Leave it
- * true wherever the walk *is* the existence check (receive-pack, repack).
- */
-declare function collectReachableOids(repo: Repo, startOids: string[], hooks?: HttpHooks, haveOids?: ReadonlySet<string> | readonly string[], options?: {
-    verifyBlobs?: boolean;
-}): Promise<ReachabilityResult>;
-
-/**
- * Pack consolidation: merge all packs into one, reusing stored (possibly
- * deltified) entries when every object is packed.
- *
- * Edge-compatible: uses Web Crypto (SHA-1), CompressionStream (deflate),
- * and Uint8Array throughout — no node:crypto, node:zlib, or Buffer.
- */
-
-/**
- * Default repack threshold. Consolidating is O(total repo object count) —
- * so paying it on every push makes push latency grow with repo size forever.
- */
-declare const REPACK_PACK_COUNT_THRESHOLD = 4;
-interface RepackOptions {
-    /** Skip repacking below this many accumulated packs. Default 4. */
-    threshold?: number;
-}
-/**
- * Consolidate all pack files into one, returning the gitdir-relative paths
- * of the old .pack/.idx files it removed — after syncing the new pack to any
- * secondary storage, delete those same paths there too.
- */
-declare function repackRepository(repo: Repo, options?: RepackOptions, hooks?: HttpHooks): Promise<string[]>;
-
-interface RefUpdateCommand {
-    oldOid: string;
-    newOid: string;
-    refName: string;
-}
-interface RefUpdateResult {
-    refName: string;
-    ok: boolean;
-    reason?: string;
-}
-/** Split a receive-pack body: pkt-line ref commands, flush, then raw PACK. */
-declare function parseReceivePackBody(body: Uint8Array): {
-    refUpdates: RefUpdateCommand[];
-    packData: Uint8Array;
-};
-/** Initialize the repo when its HEAD doesn't exist yet (first push). */
-declare function ensureRepoInitialized(repo: Repo, defaultBranch?: string): Promise<void>;
-/** Write the incoming PACK into objects/pack/ and index it. */
-declare function indexIncomingPack(repo: Repo, packData: Uint8Array, hooks?: HttpHooks): Promise<string[]>;
-/**
- * Apply ref updates, enforcing compare-and-swap against each command's
- * claimed oldOid. Every client-supplied refName is validated before any
- * filesystem call reads or writes through it.
- */
-declare function applyRefUpdates(repo: Repo, refUpdates: RefUpdateCommand[], hooks?: HttpHooks): Promise<RefUpdateResult[]>;
-/** The report-status response body for a set of ref-update results. */
-declare function receivePackResponse(results: RefUpdateResult[]): GitHttpResult;
-interface ApplyReceivePackOptions {
-    defaultBranch?: string;
-    /**
-     * Repack tuning, or `false` to skip repacking entirely. The returned
-     * `stalePackPaths` are gitdir-relative pack files the repack deleted from
-     * this repo — after syncing to any secondary storage, delete them there
-     * too.
-     */
-    repack?: RepackOptions | false;
-}
-/**
- * The storage half of a push against `repo`: initialize if needed, index the
- * incoming pack, CAS-apply ref updates, then repack when enough packs have
- * accumulated. Serialize concurrent pushes to the same repo externally (a
- * per-repo lock); build the HTTP response afterwards with
- * {@link receivePackResponse}.
- */
-declare function applyReceivePack(repo: Repo, parsed: {
-    refUpdates: RefUpdateCommand[];
-    packData: Uint8Array;
-}, options?: ApplyReceivePackOptions, hooks?: HttpHooks): Promise<{
-    results: RefUpdateResult[];
-    stalePackPaths: string[];
-}>;
-
-interface UploadPackOptions {
-    /**
-     * Called once before the reachability walk — wire loose-object detection
-     * (`GitFs.detectLooseObjects`) here so a fully packed repo's walk doesn't
-     * pay a doomed loose-object probe per object.
-     */
-    beforeWalk?: () => Promise<void>;
-}
-/**
- * `POST …/git-upload-pack` — serve a clone/fetch. Authorization is the
- * caller's job. Negotiation is client-driven (no multi_ack advertised):
- * "have" batches without "done" get a bare NAK; the final batch gets the
- * packfile, side-band-64k framed.
- *
- * Fast path: a fresh clone (no haves) of a repo consolidated down to a
- * single pack serves that pack's bytes directly — skipping the O(objects)
- * traversal + repack entirely.
- */
-declare function handleUploadPack(repo: Repo, body: Uint8Array, options?: UploadPackOptions, hooks?: HttpHooks): Promise<GitHttpResult>;
-
-export { type ApplyReceivePackOptions, FLUSH, type GitHttpResult, type GitService, type HttpHooks, type InfoRefsOptions, REPACK_PACK_COUNT_THRESHOLD, type RawFsPromises, type ReachabilityResult, type RefUpdateCommand, type RefUpdateResult, type RepackOptions, type UploadPackOptions, applyReceivePack, applyRefUpdates, collectReachableOids, ensureRepoInitialized, handleInfoRefs, handleUploadPack, indexIncomingPack, listAllRefs, parsePktLines, parseReceivePackBody, pktLine, pktLineBuffer, rawFs, receivePackResponse, repackRepository, sideBandPackfile };