@eldrforge/kodrdriv 1.2.22 → 1.2.24

package/dist/util/dependencyGraph.js

@@ -0,0 +1,224 @@
+import path__default from 'path';
+import fs from 'fs/promises';
+import { safeJsonParse, validatePackageJson } from '@eldrforge/git-tools';
+import { getLogger } from '../logging.js';
+import { create } from './storage.js';
+
+/**
+ * Check if a file path matches a glob pattern
+ */ const matchesPattern = (filePath, pattern)=>{
+    // Convert simple glob patterns to regex
+    const regexPattern = pattern.replace(/\\/g, '\\\\') // Escape backslashes
+    .replace(/\*\*/g, '.*') // ** matches any path segments
+    .replace(/\*/g, '[^/]*') // * matches any characters except path separator
+    .replace(/\?/g, '.') // ? matches any single character
+    .replace(/\./g, '\\.'); // Escape literal dots
+    const regex = new RegExp(`^${regexPattern}$`);
+    return regex.test(filePath) || regex.test(path__default.basename(filePath));
+};
+/**
+ * Check if a package should be excluded based on patterns
+ */ function shouldExclude(packageJsonPath, excludedPatterns) {
+    if (!excludedPatterns || excludedPatterns.length === 0) {
+        return false;
+    }
+    // Check both the full path and relative path patterns
+    const relativePath = path__default.relative(process.cwd(), packageJsonPath);
+    return excludedPatterns.some((pattern)=>matchesPattern(packageJsonPath, pattern) || matchesPattern(relativePath, pattern) || matchesPattern(path__default.dirname(packageJsonPath), pattern) || matchesPattern(path__default.dirname(relativePath), pattern));
+}
+/**
+ * Scan directory for package.json files
+ */ async function scanForPackageJsonFiles(directory, excludedPatterns = []) {
+    const logger = getLogger();
+    const packageJsonPaths = [];
+    try {
+        // First check if there's a package.json in the specified directory itself
+        const directPackageJsonPath = path__default.join(directory, 'package.json');
+        try {
+            await fs.access(directPackageJsonPath);
+            // Check if this package should be excluded
+            if (!shouldExclude(directPackageJsonPath, excludedPatterns)) {
+                packageJsonPaths.push(directPackageJsonPath);
+                logger.verbose(`Found package.json at: ${directPackageJsonPath}`);
+            } else {
+                logger.verbose(`Excluding package.json at: ${directPackageJsonPath} (matches exclusion pattern)`);
+            }
+        } catch  {
+        // No package.json in the root of this directory, that's fine
+        }
+        // Then scan subdirectories for package.json files
+        const entries = await fs.readdir(directory, {
+            withFileTypes: true
+        });
+        for (const entry of entries){
+            if (entry.isDirectory()) {
+                const subDirPath = path__default.join(directory, entry.name);
+                const packageJsonPath = path__default.join(subDirPath, 'package.json');
+                try {
+                    await fs.access(packageJsonPath);
+                    // Check if this package should be excluded
+                    if (shouldExclude(packageJsonPath, excludedPatterns)) {
+                        logger.verbose(`Excluding package.json at: ${packageJsonPath} (matches exclusion pattern)`);
+                        continue;
+                    }
+                    packageJsonPaths.push(packageJsonPath);
+                    logger.verbose(`Found package.json at: ${packageJsonPath}`);
+                } catch  {
+                // No package.json in this directory, continue
+                }
+            }
+        }
+    } catch (error) {
+        logger.error(`Failed to scan directory ${directory}: ${error}`);
+        throw error;
+    }
+    return packageJsonPaths;
+}
+/**
+ * Parse a single package.json file
+ */ async function parsePackageJson(packageJsonPath) {
+    const logger = getLogger();
+    const storage = create({
+        log: logger.info
+    });
+    try {
+        const content = await storage.readFile(packageJsonPath, 'utf-8');
+        const parsed = safeJsonParse(content, packageJsonPath);
+        const packageJson = validatePackageJson(parsed, packageJsonPath);
+        if (!packageJson.name) {
+            throw new Error(`Package at ${packageJsonPath} has no name field`);
+        }
+        const dependencies = new Set();
+        const devDependencies = new Set();
+        // Collect all types of dependencies
+        const depTypes = [
+            'dependencies',
+            'devDependencies',
+            'peerDependencies',
+            'optionalDependencies'
+        ];
+        for (const depType of depTypes){
+            if (packageJson[depType]) {
+                Object.keys(packageJson[depType]).forEach((dep)=>{
+                    dependencies.add(dep);
+                    if (depType === 'devDependencies') {
+                        devDependencies.add(dep);
+                    }
+                });
+            }
+        }
+        return {
+            name: packageJson.name,
+            version: packageJson.version || '0.0.0',
+            path: path__default.dirname(packageJsonPath),
+            dependencies,
+            devDependencies,
+            localDependencies: new Set() // Will be populated later
+        };
+    } catch (error) {
+        logger.error(`Failed to parse package.json at ${packageJsonPath}: ${error}`);
+        throw error;
+    }
+}
+/**
+ * Build dependency graph from package.json paths
+ */ async function buildDependencyGraph(packageJsonPaths) {
+    const logger = getLogger();
+    const packages = new Map();
+    const edges = new Map();
+    // First pass: parse all package.json files
+    for (const packageJsonPath of packageJsonPaths){
+        const packageInfo = await parsePackageJson(packageJsonPath);
+        packages.set(packageInfo.name, packageInfo);
+        logger.verbose(`Parsed package: ${packageInfo.name} at ${packageInfo.path}`);
+    }
+    // Second pass: identify local dependencies and build edges
+    for (const [packageName, packageInfo] of packages){
+        const localDeps = new Set();
+        const edgesSet = new Set();
+        for (const dep of packageInfo.dependencies){
+            if (packages.has(dep)) {
+                localDeps.add(dep);
+                edgesSet.add(dep);
+                logger.verbose(`${packageName} depends on local package: ${dep}`);
+            }
+        }
+        packageInfo.localDependencies = localDeps;
+        edges.set(packageName, edgesSet);
+    }
+    // Build reverse edges (dependents)
+    const reverseEdges = buildReverseGraph(edges);
+    return {
+        packages,
+        edges,
+        reverseEdges
+    };
+}
+/**
+ * Build reverse dependency graph (package -> dependents)
+ */ function buildReverseGraph(edges) {
+    const reverse = new Map();
+    for (const [pkg, deps] of edges){
+        for (const dep of deps){
+            if (!reverse.has(dep)) {
+                reverse.set(dep, new Set());
+            }
+            reverse.get(dep).add(pkg);
+        }
+    }
+    return reverse;
+}
+/**
+ * Perform topological sort on dependency graph
+ */ function topologicalSort(graph) {
+    const logger = getLogger();
+    const { packages, edges } = graph;
+    const visited = new Set();
+    const visiting = new Set();
+    const result = [];
+    const visit = (packageName)=>{
+        if (visited.has(packageName)) {
+            return;
+        }
+        if (visiting.has(packageName)) {
+            throw new Error(`Circular dependency detected involving package: ${packageName}`);
+        }
+        visiting.add(packageName);
+        // Visit all dependencies first
+        const deps = edges.get(packageName) || new Set();
+        for (const dep of deps){
+            visit(dep);
+        }
+        visiting.delete(packageName);
+        visited.add(packageName);
+        result.push(packageName);
+    };
+    // Visit all packages
+    for (const packageName of packages.keys()){
+        if (!visited.has(packageName)) {
+            visit(packageName);
+        }
+    }
+    logger.verbose(`Topological sort completed. Build order determined for ${result.length} packages.`);
+    return result;
+}
+/**
+ * Find all dependents of a package (packages that depend on it)
+ */ function findAllDependents(packageName, graph) {
+    const dependents = new Set();
+    const visited = new Set();
+    const traverse = (pkg)=>{
+        if (visited.has(pkg)) return;
+        visited.add(pkg);
+        const directDependents = graph.reverseEdges.get(pkg) || new Set();
+        for (const dependent of directDependents){
+            dependents.add(dependent);
+            traverse(dependent);
+        }
+    };
+    traverse(packageName);
+    return dependents;
+}
+
+export { buildDependencyGraph, buildReverseGraph, findAllDependents, parsePackageJson, scanForPackageJsonFiles, shouldExclude, topologicalSort };
+//# sourceMappingURL=dependencyGraph.js.map

package/dist/util/dependencyGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.js","sources":["../../src/util/dependencyGraph.ts"],"sourcesContent":["import path from 'path';\nimport fs from 'fs/promises';\nimport { safeJsonParse, validatePackageJson } from '@eldrforge/git-tools';\nimport { getLogger } from '../logging';\nimport { create as createStorage } from './storage';\n\n/**\n * Check if a file path matches a glob pattern\n */\nconst matchesPattern = (filePath: string, pattern: string): boolean => {\n    // Convert simple glob patterns to regex\n    const regexPattern = pattern\n        .replace(/\\\\/g, '\\\\\\\\')  // Escape backslashes\n        .replace(/\\*\\*/g, '.*')  // ** matches any path segments\n        .replace(/\\*/g, '[^/]*') // * matches any characters except path separator\n        .replace(/\\?/g, '.')     // ? matches any single character\n        .replace(/\\./g, '\\\\.');  // Escape literal dots\n\n    const regex = new RegExp(`^${regexPattern}$`);\n    return regex.test(filePath) || regex.test(path.basename(filePath));\n};\n\n/**\n * Check if a package should be excluded based on patterns\n */\nexport function shouldExclude(packageJsonPath: string, excludedPatterns: string[]): boolean {\n    if (!excludedPatterns || excludedPatterns.length === 0) {\n        return false;\n    }\n\n    // Check both the full path and relative path patterns\n    const relativePath = path.relative(process.cwd(), packageJsonPath);\n\n    return excludedPatterns.some(pattern =>\n        matchesPattern(packageJsonPath, pattern) ||\n        matchesPattern(relativePath, pattern) ||\n        matchesPattern(path.dirname(packageJsonPath), pattern) ||\n        matchesPattern(path.dirname(relativePath), pattern)\n    );\n}\n\nexport interface PackageInfo {\n    name: string;\n    version: string;\n    path: string;\n    dependencies: Set<string>;\n    devDependencies: Set<string>;\n    localDependencies: Set<string>;\n}\n\nexport interface DependencyGraph {\n    packages: Map<string, PackageInfo>;\n    edges: Map<string, Set<string>>; // package -> dependencies\n    reverseEdges: Map<string, Set<string>>; // package -> dependents\n}\n\nexport interface SerializedGraph {\n    packages: Array<{\n        name: string;\n        version: string;\n        path: string;\n        dependencies: string[];\n    }>;\n    edges: Array<[string, string[]]>;\n}\n\n/**\n * Scan directory for package.json files\n */\nexport async function scanForPackageJsonFiles(\n    directory: string,\n    excludedPatterns: string[] = []\n): Promise<string[]> {\n    const logger = getLogger();\n    const packageJsonPaths: string[] = [];\n\n    try {\n        // First check if there's a package.json in the specified directory itself\n        const directPackageJsonPath = path.join(directory, 'package.json');\n        try {\n            await fs.access(directPackageJsonPath);\n\n            // Check if this package should be excluded\n            if (!shouldExclude(directPackageJsonPath, excludedPatterns)) {\n                packageJsonPaths.push(directPackageJsonPath);\n                logger.verbose(`Found package.json at: ${directPackageJsonPath}`);\n            } else {\n                logger.verbose(`Excluding package.json at: ${directPackageJsonPath} (matches exclusion pattern)`);\n            }\n        } catch {\n            // No package.json in the root of this directory, that's fine\n        }\n\n        // Then scan subdirectories for package.json files\n        const entries = await fs.readdir(directory, { withFileTypes: true });\n\n        for (const entry of entries) {\n            if (entry.isDirectory()) {\n                const subDirPath = path.join(directory, entry.name);\n                const packageJsonPath = path.join(subDirPath, 'package.json');\n\n                try {\n                    await fs.access(packageJsonPath);\n\n                    // Check if this package should be excluded\n                    if (shouldExclude(packageJsonPath, excludedPatterns)) {\n                        logger.verbose(`Excluding package.json at: ${packageJsonPath} (matches exclusion pattern)`);\n                        continue;\n                    }\n\n                    packageJsonPaths.push(packageJsonPath);\n                    logger.verbose(`Found package.json at: ${packageJsonPath}`);\n                } catch {\n                    // No package.json in this directory, continue\n                }\n            }\n        }\n    } catch (error) {\n        logger.error(`Failed to scan directory ${directory}: ${error}`);\n        throw error;\n    }\n\n    return packageJsonPaths;\n}\n\n/**\n * Parse a single package.json file\n */\nexport async function parsePackageJson(packageJsonPath: string): Promise<PackageInfo> {\n    const logger = getLogger();\n    const storage = createStorage({ log: logger.info });\n\n    try {\n        const content = await storage.readFile(packageJsonPath, 'utf-8');\n        const parsed = safeJsonParse(content, packageJsonPath);\n        const packageJson = validatePackageJson(parsed, packageJsonPath);\n\n        if (!packageJson.name) {\n            throw new Error(`Package at ${packageJsonPath} has no name field`);\n        }\n\n        const dependencies = new Set<string>();\n        const devDependencies = new Set<string>();\n\n        // Collect all types of dependencies\n        const depTypes = ['dependencies', 'devDependencies', 'peerDependencies', 'optionalDependencies'];\n        for (const depType of depTypes) {\n            if (packageJson[depType]) {\n                Object.keys(packageJson[depType]).forEach(dep => {\n                    dependencies.add(dep);\n                    if (depType === 'devDependencies') {\n                        devDependencies.add(dep);\n                    }\n                });\n            }\n        }\n\n        return {\n            name: packageJson.name,\n            version: packageJson.version || '0.0.0',\n            path: path.dirname(packageJsonPath),\n            dependencies,\n            devDependencies,\n            localDependencies: new Set() // Will be populated later\n        };\n    } catch (error) {\n        logger.error(`Failed to parse package.json at ${packageJsonPath}: ${error}`);\n        throw error;\n    }\n}\n\n/**\n * Build dependency graph from package.json paths\n */\nexport async function buildDependencyGraph(\n    packageJsonPaths: string[]\n): Promise<DependencyGraph> {\n    const logger = getLogger();\n    const packages = new Map<string, PackageInfo>();\n    const edges = new Map<string, Set<string>>();\n\n    // First pass: parse all package.json files\n    for (const packageJsonPath of packageJsonPaths) {\n        const packageInfo = await parsePackageJson(packageJsonPath);\n        packages.set(packageInfo.name, packageInfo);\n        logger.verbose(`Parsed package: ${packageInfo.name} at ${packageInfo.path}`);\n    }\n\n    // Second pass: identify local dependencies and build edges\n    for (const [packageName, packageInfo] of packages) {\n        const localDeps = new Set<string>();\n        const edgesSet = new Set<string>();\n\n        for (const dep of packageInfo.dependencies) {\n            if (packages.has(dep)) {\n                localDeps.add(dep);\n                edgesSet.add(dep);\n                logger.verbose(`${packageName} depends on local package: ${dep}`);\n            }\n        }\n\n        packageInfo.localDependencies = localDeps;\n        edges.set(packageName, edgesSet);\n    }\n\n    // Build reverse edges (dependents)\n    const reverseEdges = buildReverseGraph(edges);\n\n    return { packages, edges, reverseEdges };\n}\n\n/**\n * Build reverse dependency graph (package -> dependents)\n */\nexport function buildReverseGraph(\n    edges: Map<string, Set<string>>\n): Map<string, Set<string>> {\n    const reverse = new Map<string, Set<string>>();\n\n    for (const [pkg, deps] of edges) {\n        for (const dep of deps) {\n            if (!reverse.has(dep)) {\n                reverse.set(dep, new Set());\n            }\n            reverse.get(dep)!.add(pkg);\n        }\n    }\n\n    return reverse;\n}\n\n/**\n * Perform topological sort on dependency graph\n */\nexport function topologicalSort(graph: DependencyGraph): string[] {\n    const logger = getLogger();\n    const { packages, edges } = graph;\n    const visited = new Set<string>();\n    const visiting = new Set<string>();\n    const result: string[] = [];\n\n    const visit = (packageName: string): void => {\n        if (visited.has(packageName)) {\n            return;\n        }\n\n        if (visiting.has(packageName)) {\n            throw new Error(`Circular dependency detected involving package: ${packageName}`);\n        }\n\n        visiting.add(packageName);\n\n        // Visit all dependencies first\n        const deps = edges.get(packageName) || new Set();\n        for (const dep of deps) {\n            visit(dep);\n        }\n\n        visiting.delete(packageName);\n        visited.add(packageName);\n        result.push(packageName);\n    };\n\n    // Visit all packages\n    for (const packageName of packages.keys()) {\n        if (!visited.has(packageName)) {\n            visit(packageName);\n        }\n    }\n\n    logger.verbose(`Topological sort completed. Build order determined for ${result.length} packages.`);\n    return result;\n}\n\n/**\n * Find all dependents of a package (packages that depend on it)\n */\nexport function findAllDependents(\n    packageName: string,\n    graph: DependencyGraph\n): Set<string> {\n    const dependents = new Set<string>();\n    const visited = new Set<string>();\n\n    const traverse = (pkg: string) => {\n        if (visited.has(pkg)) return;\n        visited.add(pkg);\n\n        const directDependents = graph.reverseEdges.get(pkg) || new Set();\n        for (const dependent of directDependents) {\n            dependents.add(dependent);\n            traverse(dependent);\n        }\n    };\n\n    traverse(packageName);\n    return dependents;\n}\n\n/**\n * Serialize graph for checkpoint persistence\n */\nexport function serializeGraph(graph: DependencyGraph): SerializedGraph {\n    return {\n        packages: Array.from(graph.packages.values()).map(pkg => ({\n            name: pkg.name,\n            version: pkg.version,\n            path: pkg.path,\n            dependencies: Array.from(pkg.dependencies)\n        })),\n        edges: Array.from(graph.edges.entries()).map(([pkg, deps]) => [\n            pkg,\n            Array.from(deps)\n        ])\n    };\n}\n\n/**\n * Deserialize graph from checkpoint\n */\nexport function deserializeGraph(serialized: SerializedGraph): DependencyGraph {\n    const packages = new Map<string, PackageInfo>();\n    const edges = new Map<string, Set<string>>();\n\n    // Restore packages\n    for (const pkg of serialized.packages) {\n        packages.set(pkg.name, {\n            name: pkg.name,\n            version: pkg.version,\n            path: pkg.path,\n            dependencies: new Set(pkg.dependencies),\n            devDependencies: new Set(),\n            localDependencies: new Set()\n        });\n    }\n\n    // Restore edges\n    for (const [pkg, deps] of serialized.edges) {\n        edges.set(pkg, new Set(deps));\n    }\n\n    // Build reverse edges\n    const reverseEdges = buildReverseGraph(edges);\n\n    return { packages, edges, reverseEdges };\n}\n\n/**\n * Validate graph integrity\n */\nexport function validateGraph(graph: DependencyGraph): {\n    valid: boolean;\n    errors: string[];\n} {\n    const errors: string[] = [];\n\n    // Check all edge targets exist\n    for (const [pkg, deps] of graph.edges) {\n        for (const dep of deps) {\n            if (!graph.packages.has(dep)) {\n                errors.push(`Package ${pkg} depends on ${dep} which doesn't exist`);\n            }\n        }\n    }\n\n    // Check for circular dependencies\n    try {\n        topologicalSort(graph);\n    } catch (error: any) {\n        errors.push(error.message);\n    }\n\n    return {\n        valid: errors.length === 0,\n        errors\n    };\n}\n"],"names":["matchesPattern","filePath","pattern","regexPattern","replace","regex","RegExp","test","path","basename","shouldExclude","packageJsonPath","excludedPatterns","length","relativePath","relative","process","cwd","some","dirname","scanForPackageJsonFiles","directory","logger","getLogger","packageJsonPaths","directPackageJsonPath","join","fs","access","push","verbose","entries","readdir","withFileTypes","entry","isDirectory","subDirPath","name","error","parsePackageJson","storage","createStorage","log","info","content","readFile","parsed","safeJsonParse","packageJson","validatePackageJson","Error","dependencies","Set","devDependencies","depTypes","depType","Object","keys","forEach","dep","add","version","localDependencies","buildDependencyGraph","packages","Map","edges","packageInfo","set","packageName","localDeps","edgesSet","has","reverseEdges","buildReverseGraph","reverse","pkg","deps","get","topologicalSort","graph","visited","visiting","result","visit","delete","findAllDependents","dependents","traverse","directDependents","dependent"],"mappings":";;;;;;AAMA;;IAGA,MAAMA,cAAAA,GAAiB,CAACC,QAAAA,EAAkBC,OAAAA,GAAAA;;AAEtC,IAAA,MAAMC,eAAeD,OAAAA,CAChBE,OAAO,CAAC,KAAA,EAAO;KACfA,OAAO,CAAC,OAAA,EAAS,IAAA,CAAA;KACjBA,OAAO,CAAC,KAAA,EAAO,OAAA,CAAA;KACfA,OAAO,CAAC,KAAA,EAAO,GAAA,CAAA;KACfA,OAAO,CAAC,KAAA,EAAO,KAAA,CAAA,CAAA;IAEpB,MAAMC,KAAAA,GAAQ,IAAIC,MAAAA,CAAO,CAAC,CAAC,EAAEH,YAAAA,CAAa,CAAC,CAAC,CAAA;IAC5C,OAAOE,KAAAA,CAAME,IAAI,CAACN,QAAAA,CAAAA,IAAaI,MAAME,IAAI,CAACC,aAAAA,CAAKC,QAAQ,CAACR,QAAAA,CAAAA,CAAAA;AAC5D,CAAA;AAEA;;AAEC,IACM,SAASS,aAAAA,CAAcC,eAAuB,EAAEC,gBAA0B,EAAA;AAC7E,IAAA,IAAI,CAACA,gBAAAA,IAAoBA,gBAAAA,CAAiBC,MAAM,KAAK,CAAA,EAAG;QACpD,OAAO,KAAA;AACX,IAAA;;AAGA,IAAA,MAAMC,eAAeN,aAAAA,CAAKO,QAAQ,CAACC,OAAAA,CAAQC,GAAG,EAAA,EAAIN,eAAAA,CAAAA;IAElD,OAAOC,gBAAAA,CAAiBM,IAAI,CAAChB,CAAAA,UACzBF,cAAAA,CAAeW,eAAAA,EAAiBT,YAChCF,cAAAA,CAAec,YAAAA,EAAcZ,YAC7BF,cAAAA,CAAeQ,aAAAA,CAAKW,OAAO,CAACR,eAAAA,CAAAA,EAAkBT,YAC9CF,cAAAA,CAAeQ,aAAAA,CAAKW,OAAO,CAACL,YAAAA,CAAAA,EAAeZ,OAAAA,CAAAA,CAAAA;AAEnD;AA2BA;;AAEC,IACM,eAAekB,uBAAAA,CAClBC,SAAiB,EACjBT,mBAA6B,EAAE,EAAA;AAE/B,IAAA,MAAMU,MAAAA,GAASC,SAAAA,EAAAA;AACf,IAAA,MAAMC,mBAA6B,EAAE;IAErC,IAAI;;AAEA,QAAA,MAAMC,qBAAAA,GAAwBjB,aAAAA,CAAKkB,IAAI,CAACL,SAAAA,EAAW,cAAA,CAAA;QACnD,IAAI;YACA,MAAMM,EAAAA,CAAGC,MAAM,CAACH,qBAAAA,CAAAA;;YAGhB,IAAI,CAACf,aAAAA,CAAce,qBAAAA,EAAuBb,gBAAAA,CAAAA,EAAmB;AACzDY,gBAAAA,gBAAAA,CAAiBK,IAAI,CAACJ,qBAAAA,CAAAA;AACtBH,gBAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAC,uBAAuB,EAAEL,qBAAAA,CAAAA,CAAuB,CAAA;YACpE,CAAA,MAAO;AACHH,gBAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAC,2BAA2B,EAAEL,qBAAAA,CAAsB,4BAA4B,CAAC,CAAA;AACpG,YAAA;AACJ,QAAA,CAAA,CAAE,OAAM;;AAER,QAAA;;AAGA,QAAA,MAAMM,OAAAA,GAAU,MAAMJ,EAAAA,CAAGK,OAAO,CAACX,SAAAA,EAAW;YAAEY,aAAAA,EAAe;AAAK,SAAA,CAAA;QAElE,KAAK,MAAMC,SAASH,OAAAA,CAAS;YACzB,IAAIG,KAAAA,CAAMC,WAAW,EAAA,EAAI;AACrB,gBAAA,MAAMC,aAAa5B,aAAAA,CAAKkB,IAAI,CAACL,SAAAA,EAAWa,MAAMG,IAAI,CAAA;AAClD,gBAAA,MAAM1B,eAAAA,GAAkBH,aAAAA,CAAKkB,IAAI,CAACU,UAAAA,EAAY,cAAA,CAAA;gBAE9C,IAAI;oBACA,MAAMT,EAAAA,CAAGC,MAAM,CAACjB,eAAAA,CAAAA;;oBAGhB,IAAID,aAAAA,CAAcC,iBAAiBC,gBAAAA,CAAAA,EAAmB;AAClDU,wBAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAC,2BAA2B,EAAEnB,eAAAA,CAAgB,4BAA4B,CAAC,CAAA;AAC1F,wBAAA;AACJ,oBAAA;AAEAa,oBAAAA,gBAAAA,CAAiBK,IAAI,CAAClB,eAAAA,CAAAA;AACtBW,oBAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAC,uBAAuB,EAAEnB,eAAAA,CAAAA,CAAiB,CAAA;AAC9D,gBAAA,CAAA,CAAE,OAAM;;AAER,gBAAA;AACJ,YAAA;AACJ,QAAA;AACJ,IAAA,CAAA,CAAE,OAAO2B,KAAAA,EAAO;QACZhB,MAAAA,CAAOgB,KAAK,CAAC,CAAC,yBAAyB,EAAEjB,SAAAA,CAAU,EAAE,EAAEiB,KAAAA,CAAAA,CAAO,CAAA;QAC9D,MAAMA,KAAAA;AACV,IAAA;IAEA,OAAOd,gBAAAA;AACX;AAEA;;IAGO,eAAee,gBAAAA,CAAiB5B,eAAuB,EAAA;AAC1D,IAAA,MAAMW,MAAAA,GAASC,SAAAA,EAAAA;AACf,IAAA,MAAMiB,UAAUC,MAAAA,CAAc;AAAEC,QAAAA,GAAAA,EAAKpB,OAAOqB;AAAK,KAAA,CAAA;IAEjD,IAAI;AACA,QAAA,MAAMC,OAAAA,GAAU,MAAMJ,OAAAA,CAAQK,QAAQ,CAAClC,eAAAA,EAAiB,OAAA,CAAA;QACxD,MAAMmC,MAAAA,GAASC,cAAcH,OAAAA,EAASjC,eAAAA,CAAAA;QACtC,MAAMqC,WAAAA,GAAcC,oBAAoBH,MAAAA,EAAQnC,eAAAA,CAAAA;QAEhD,IAAI,CAACqC,WAAAA,CAAYX,IAAI,EAAE;AACnB,YAAA,MAAM,IAAIa,KAAAA,CAAM,CAAC,WAAW,EAAEvC,eAAAA,CAAgB,kBAAkB,CAAC,CAAA;AACrE,QAAA;AAEA,QAAA,MAAMwC,eAAe,IAAIC,GAAAA,EAAAA;AACzB,QAAA,MAAMC,kBAAkB,IAAID,GAAAA,EAAAA;;AAG5B,QAAA,MAAME,QAAAA,GAAW;AAAC,YAAA,cAAA;AAAgB,YAAA,iBAAA;AAAmB,YAAA,kBAAA;AAAoB,YAAA;AAAuB,SAAA;QAChG,KAAK,MAAMC,WAAWD,QAAAA,CAAU;YAC5B,IAAIN,WAAW,CAACO,OAAAA,CAAQ,EAAE;gBACtBC,MAAAA,CAAOC,IAAI,CAACT,WAAW,CAACO,QAAQ,CAAA,CAAEG,OAAO,CAACC,CAAAA,GAAAA,GAAAA;AACtCR,oBAAAA,YAAAA,CAAaS,GAAG,CAACD,GAAAA,CAAAA;AACjB,oBAAA,IAAIJ,YAAY,iBAAA,EAAmB;AAC/BF,wBAAAA,eAAAA,CAAgBO,GAAG,CAACD,GAAAA,CAAAA;AACxB,oBAAA;AACJ,gBAAA,CAAA,CAAA;AACJ,YAAA;AACJ,QAAA;QAEA,OAAO;AACHtB,YAAAA,IAAAA,EAAMW,YAAYX,IAAI;YACtBwB,OAAAA,EAASb,WAAAA,CAAYa,OAAO,IAAI,OAAA;YAChCrD,IAAAA,EAAMA,aAAAA,CAAKW,OAAO,CAACR,eAAAA,CAAAA;AACnBwC,YAAAA,YAAAA;AACAE,YAAAA,eAAAA;YACAS,iBAAAA,EAAmB,IAAIV;AAC3B,SAAA;AACJ,IAAA,CAAA,CAAE,OAAOd,KAAAA,EAAO;QACZhB,MAAAA,CAAOgB,KAAK,CAAC,CAAC,gCAAgC,EAAE3B,eAAAA,CAAgB,EAAE,EAAE2B,KAAAA,CAAAA,CAAO,CAAA;QAC3E,MAAMA,KAAAA;AACV,IAAA;AACJ;AAEA;;IAGO,eAAeyB,oBAAAA,CAClBvC,gBAA0B,EAAA;AAE1B,IAAA,MAAMF,MAAAA,GAASC,SAAAA,EAAAA;AACf,IAAA,MAAMyC,WAAW,IAAIC,GAAAA,EAAAA;AACrB,IAAA,MAAMC,QAAQ,IAAID,GAAAA,EAAAA;;IAGlB,KAAK,MAAMtD,mBAAmBa,gBAAAA,CAAkB;QAC5C,MAAM2C,WAAAA,GAAc,MAAM5B,gBAAAA,CAAiB5B,eAAAA,CAAAA;AAC3CqD,QAAAA,QAAAA,CAASI,GAAG,CAACD,WAAAA,CAAY9B,IAAI,EAAE8B,WAAAA,CAAAA;AAC/B7C,QAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAC,gBAAgB,EAAEqC,WAAAA,CAAY9B,IAAI,CAAC,IAAI,EAAE8B,WAAAA,CAAY3D,IAAI,CAAA,CAAE,CAAA;AAC/E,IAAA;;AAGA,IAAA,KAAK,MAAM,CAAC6D,WAAAA,EAAaF,WAAAA,CAAY,IAAIH,QAAAA,CAAU;AAC/C,QAAA,MAAMM,YAAY,IAAIlB,GAAAA,EAAAA;AACtB,QAAA,MAAMmB,WAAW,IAAInB,GAAAA,EAAAA;AAErB,QAAA,KAAK,MAAMO,GAAAA,IAAOQ,WAAAA,CAAYhB,YAAY,CAAE;YACxC,IAAIa,QAAAA,CAASQ,GAAG,CAACb,GAAAA,CAAAA,EAAM;AACnBW,gBAAAA,SAAAA,CAAUV,GAAG,CAACD,GAAAA,CAAAA;AACdY,gBAAAA,QAAAA,CAASX,GAAG,CAACD,GAAAA,CAAAA;AACbrC,gBAAAA,MAAAA,CAAOQ,OAAO,CAAC,CAAA,EAAGuC,WAAAA,CAAY,2BAA2B,EAAEV,GAAAA,CAAAA,CAAK,CAAA;AACpE,YAAA;AACJ,QAAA;AAEAQ,QAAAA,WAAAA,CAAYL,iBAAiB,GAAGQ,SAAAA;QAChCJ,KAAAA,CAAME,GAAG,CAACC,WAAAA,EAAaE,QAAAA,CAAAA;AAC3B,IAAA;;AAGA,IAAA,MAAME,eAAeC,iBAAAA,CAAkBR,KAAAA,CAAAA;IAEvC,OAAO;AAAEF,QAAAA,QAAAA;AAAUE,QAAAA,KAAAA;AAAOO,QAAAA;AAAa,KAAA;AAC3C;AAEA;;IAGO,SAASC,iBAAAA,CACZR,KAA+B,EAAA;AAE/B,IAAA,MAAMS,UAAU,IAAIV,GAAAA,EAAAA;AAEpB,IAAA,KAAK,MAAM,CAACW,GAAAA,EAAKC,IAAAA,CAAK,IAAIX,KAAAA,CAAO;QAC7B,KAAK,MAAMP,OAAOkB,IAAAA,CAAM;AACpB,YAAA,IAAI,CAACF,OAAAA,CAAQH,GAAG,CAACb,GAAAA,CAAAA,EAAM;gBACnBgB,OAAAA,CAAQP,GAAG,CAACT,GAAAA,EAAK,IAAIP,GAAAA,EAAAA,CAAAA;AACzB,YAAA;AACAuB,YAAAA,OAAAA,CAAQG,GAAG,CAACnB,GAAAA,CAAAA,CAAMC,GAAG,CAACgB,GAAAA,CAAAA;AAC1B,QAAA;AACJ,IAAA;IAEA,OAAOD,OAAAA;AACX;AAEA;;IAGO,SAASI,eAAAA,CAAgBC,KAAsB,EAAA;AAClD,IAAA,MAAM1D,MAAAA,GAASC,SAAAA,EAAAA;AACf,IAAA,MAAM,EAAEyC,QAAQ,EAAEE,KAAK,EAAE,GAAGc,KAAAA;AAC5B,IAAA,MAAMC,UAAU,IAAI7B,GAAAA,EAAAA;AACpB,IAAA,MAAM8B,WAAW,IAAI9B,GAAAA,EAAAA;AACrB,IAAA,MAAM+B,SAAmB,EAAE;AAE3B,IAAA,MAAMC,QAAQ,CAACf,WAAAA,GAAAA;QACX,IAAIY,OAAAA,CAAQT,GAAG,CAACH,WAAAA,CAAAA,EAAc;AAC1B,YAAA;AACJ,QAAA;QAEA,IAAIa,QAAAA,CAASV,GAAG,CAACH,WAAAA,CAAAA,EAAc;AAC3B,YAAA,MAAM,IAAInB,KAAAA,CAAM,CAAC,gDAAgD,EAAEmB,WAAAA,CAAAA,CAAa,CAAA;AACpF,QAAA;AAEAa,QAAAA,QAAAA,CAAStB,GAAG,CAACS,WAAAA,CAAAA;;AAGb,QAAA,MAAMQ,IAAAA,GAAOX,KAAAA,CAAMY,GAAG,CAACT,gBAAgB,IAAIjB,GAAAA,EAAAA;QAC3C,KAAK,MAAMO,OAAOkB,IAAAA,CAAM;YACpBO,KAAAA,CAAMzB,GAAAA,CAAAA;AACV,QAAA;AAEAuB,QAAAA,QAAAA,CAASG,MAAM,CAAChB,WAAAA,CAAAA;AAChBY,QAAAA,OAAAA,CAAQrB,GAAG,CAACS,WAAAA,CAAAA;AACZc,QAAAA,MAAAA,CAAOtD,IAAI,CAACwC,WAAAA,CAAAA;AAChB,IAAA,CAAA;;AAGA,IAAA,KAAK,MAAMA,WAAAA,IAAeL,QAAAA,CAASP,IAAI,EAAA,CAAI;AACvC,QAAA,IAAI,CAACwB,OAAAA,CAAQT,GAAG,CAACH,WAAAA,CAAAA,EAAc;YAC3Be,KAAAA,CAAMf,WAAAA,CAAAA;AACV,QAAA;AACJ,IAAA;IAEA/C,MAAAA,CAAOQ,OAAO,CAAC,CAAC,uDAAuD,EAAEqD,MAAAA,CAAOtE,MAAM,CAAC,UAAU,CAAC,CAAA;IAClG,OAAOsE,MAAAA;AACX;AAEA;;AAEC,IACM,SAASG,iBAAAA,CACZjB,WAAmB,EACnBW,KAAsB,EAAA;AAEtB,IAAA,MAAMO,aAAa,IAAInC,GAAAA,EAAAA;AACvB,IAAA,MAAM6B,UAAU,IAAI7B,GAAAA,EAAAA;AAEpB,IAAA,MAAMoC,WAAW,CAACZ,GAAAA,GAAAA;QACd,IAAIK,OAAAA,CAAQT,GAAG,CAACI,GAAAA,CAAAA,EAAM;AACtBK,QAAAA,OAAAA,CAAQrB,GAAG,CAACgB,GAAAA,CAAAA;AAEZ,QAAA,MAAMa,mBAAmBT,KAAAA,CAAMP,YAAY,CAACK,GAAG,CAACF,QAAQ,IAAIxB,GAAAA,EAAAA;QAC5D,KAAK,MAAMsC,aAAaD,gBAAAA,CAAkB;AACtCF,YAAAA,UAAAA,CAAW3B,GAAG,CAAC8B,SAAAA,CAAAA;YACfF,QAAAA,CAASE,SAAAA,CAAAA;AACb,QAAA;AACJ,IAAA,CAAA;IAEAF,QAAAA,CAASnB,WAAAA,CAAAA;IACT,OAAOkB,UAAAA;AACX;;;;"}

package/dist/util/fileLock.js

@@ -0,0 +1,204 @@
+import * as fs from 'fs';
+import * as path from 'path';
+import * as os from 'os';
+import { getLogger } from '../logging.js';
+
+// eslint-disable-next-line no-restricted-imports
+function _define_property(obj, key, value) {
+    if (key in obj) {
+        Object.defineProperty(obj, key, {
+            value: value,
+            enumerable: true,
+            configurable: true,
+            writable: true
+        });
+    } else {
+        obj[key] = value;
+    }
+    return obj;
+}
+/**
+ * File-based lock for cross-process synchronization
+ * Uses atomic file operations to coordinate across multiple Node processes
+ */ class FileLock {
+    /**
+     * Acquire the file lock with exponential backoff retry
+     */ async lock() {
+        let attempts = 0;
+        let currentDelay = this.retryDelay;
+        while(attempts < this.maxRetries){
+            try {
+                // Try to create lock file atomically with 'wx' flag (fails if exists)
+                const lockData = {
+                    pid: process.pid,
+                    timestamp: Date.now(),
+                    hostname: os.hostname()
+                };
+                // Check if lock file exists and is stale
+                if (fs.existsSync(this.lockPath)) {
+                    const lockContent = fs.readFileSync(this.lockPath, 'utf-8');
+                    try {
+                        const existingLock = JSON.parse(lockContent);
+                        const lockAge = Date.now() - existingLock.timestamp;
+                        // If lock is stale, try to remove it
+                        if (lockAge > this.lockTimeout) {
+                            this.logger.debug(`Removing stale lock file (age: ${lockAge}ms, pid: ${existingLock.pid})`);
+                            try {
+                                fs.unlinkSync(this.lockPath);
+                            } catch  {
+                            // Lock might have been removed by another process, continue
+                            }
+                        }
+                    } catch  {
+                        // Invalid lock file, try to remove it
+                        try {
+                            fs.unlinkSync(this.lockPath);
+                        } catch  {
+                        // Ignore errors
+                        }
+                    }
+                }
+                // Try to acquire lock
+                fs.writeFileSync(this.lockPath, JSON.stringify(lockData, null, 2), {
+                    flag: 'wx'
+                });
+                this.lockAcquired = true;
+                if (attempts > 0) {
+                    this.logger.debug(`Acquired file lock after ${attempts} attempts: ${this.lockPath}`);
+                }
+                return;
+            } catch (error) {
+                if (error.code === 'EEXIST') {
+                    // Lock file exists, retry with backoff
+                    attempts++;
+                    if (attempts === 1 || attempts % 10 === 0) {
+                        this.logger.verbose(`Waiting for file lock (attempt ${attempts}/${this.maxRetries}): ${this.lockPath}`);
+                    }
+                    await new Promise((resolve)=>setTimeout(resolve, currentDelay));
+                    // Exponential backoff
+                    currentDelay = Math.min(currentDelay * 1.5, this.maxRetryDelay);
+                } else {
+                    // Unexpected error
+                    throw new Error(`Failed to acquire file lock ${this.lockPath}: ${error.message}`);
+                }
+            }
+        }
+        throw new Error(`Failed to acquire file lock after ${this.maxRetries} attempts: ${this.lockPath}`);
+    }
+    /**
+     * Release the file lock
+     */ unlock() {
+        if (!this.lockAcquired) {
+            return;
+        }
+        try {
+            if (fs.existsSync(this.lockPath)) {
+                fs.unlinkSync(this.lockPath);
+            }
+            this.lockAcquired = false;
+            this.logger.silly(`Released file lock: ${this.lockPath}`);
+        } catch (error) {
+            // Lock file might have been removed by another process or stale lock cleanup
+            this.logger.debug(`Error releasing file lock ${this.lockPath}: ${error.message}`);
+            this.lockAcquired = false;
+        }
+    }
+    /**
+     * Check if this instance currently holds the lock
+     */ isLocked() {
+        return this.lockAcquired;
+    }
+    constructor(lockPath){
+        _define_property(this, "lockPath", void 0);
+        _define_property(this, "lockAcquired", false);
+        _define_property(this, "maxRetries", 100); // Maximum number of lock attempts
+        _define_property(this, "retryDelay", 100); // Initial retry delay in ms
+        _define_property(this, "maxRetryDelay", 2000); // Maximum retry delay in ms
+        _define_property(this, "lockTimeout", 30000); // Consider lock stale after 30 seconds
+        _define_property(this, "logger", getLogger());
+        this.lockPath = lockPath;
+    }
+}
+/**
+ * Manages file-based locks for git repositories (cross-process safe)
+ */ class RepositoryFileLockManager {
+    /**
+     * Get or create a file lock for a specific git repository
+     * @param repoPath Path to the git repository root
+     * @returns FileLock for this repository
+     */ getRepositoryLock(repoPath) {
+        const normalizedPath = path.resolve(repoPath);
+        if (!this.locks.has(normalizedPath)) {
+            // Create lock file in .git directory to ensure it's in the repo
+            const lockPath = path.join(normalizedPath, '.git', 'kodrdriv.lock');
+            this.logger.debug(`Creating file lock for repository: ${normalizedPath}`);
+            this.locks.set(normalizedPath, new FileLock(lockPath));
+            // Register cleanup handler on first lock creation
+            if (!this.cleanupRegistered) {
+                this.registerCleanupHandlers();
+                this.cleanupRegistered = true;
+            }
+        }
+        return this.locks.get(normalizedPath);
+    }
+    /**
+     * Register cleanup handlers to release locks on process exit
+     */ registerCleanupHandlers() {
+        const cleanup = ()=>{
+            this.destroy();
+        };
+        // Handle various exit scenarios
+        process.on('exit', cleanup);
+        process.on('SIGINT', ()=>{
+            cleanup();
+            process.exit(130); // Standard exit code for SIGINT
+        });
+        process.on('SIGTERM', ()=>{
+            cleanup();
+            process.exit(143); // Standard exit code for SIGTERM
+        });
+        process.on('uncaughtException', (error)=>{
+            this.logger.error('Uncaught exception, cleaning up locks:', error);
+            cleanup();
+            process.exit(1);
+        });
+    }
+    /**
+     * Execute a git operation with repository-level file locking
+     * @param repoPath Path to the git repository root
+     * @param operation The async operation to execute under lock
+     * @param operationName Optional name for logging
+     * @returns Result of the operation
+     */ async withGitLock(repoPath, operation, operationName) {
+        const lock = this.getRepositoryLock(repoPath);
+        const startWait = Date.now();
+        this.logger.silly(`Acquiring file lock for ${repoPath}${operationName ? ` for: ${operationName}` : ''}`);
+        await lock.lock();
+        const waitTime = Date.now() - startWait;
+        if (waitTime > 100) {
+            this.logger.debug(`Acquired file lock for ${repoPath} after ${waitTime}ms${operationName ? ` for: ${operationName}` : ''}`);
+        }
+        try {
+            return await operation();
+        } finally{
+            lock.unlock();
+        }
+    }
+    /**
+     * Clean up all locks
+     */ destroy() {
+        this.logger.debug(`Cleaning up ${this.locks.size} file lock(s)`);
+        for (const lock of this.locks.values()){
+            lock.unlock();
+        }
+        this.locks.clear();
+    }
+    constructor(){
+        _define_property(this, "locks", new Map());
+        _define_property(this, "logger", getLogger());
+        _define_property(this, "cleanupRegistered", false);
+    }
+}
+
+export { FileLock, RepositoryFileLockManager };
+//# sourceMappingURL=fileLock.js.map

package/dist/util/fileLock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fileLock.js","sources":["../../src/util/fileLock.ts"],"sourcesContent":["// eslint-disable-next-line no-restricted-imports\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport * as os from 'os';\nimport { getLogger } from '../logging';\n\n/**\n * File-based lock for cross-process synchronization\n * Uses atomic file operations to coordinate across multiple Node processes\n */\nexport class FileLock {\n    private lockPath: string;\n    private lockAcquired = false;\n    private maxRetries = 100; // Maximum number of lock attempts\n    private retryDelay = 100; // Initial retry delay in ms\n    private maxRetryDelay = 2000; // Maximum retry delay in ms\n    private lockTimeout = 30000; // Consider lock stale after 30 seconds\n    private logger = getLogger();\n\n    constructor(lockPath: string) {\n        this.lockPath = lockPath;\n    }\n\n    /**\n     * Acquire the file lock with exponential backoff retry\n     */\n    async lock(): Promise<void> {\n        let attempts = 0;\n        let currentDelay = this.retryDelay;\n\n        while (attempts < this.maxRetries) {\n            try {\n                // Try to create lock file atomically with 'wx' flag (fails if exists)\n                const lockData = {\n                    pid: process.pid,\n                    timestamp: Date.now(),\n                    hostname: os.hostname()\n                };\n\n                // Check if lock file exists and is stale\n                if (fs.existsSync(this.lockPath)) {\n                    const lockContent = fs.readFileSync(this.lockPath, 'utf-8');\n                    try {\n                        const existingLock = JSON.parse(lockContent);\n                        const lockAge = Date.now() - existingLock.timestamp;\n\n                        // If lock is stale, try to remove it\n                        if (lockAge > this.lockTimeout) {\n                            this.logger.debug(`Removing stale lock file (age: ${lockAge}ms, pid: ${existingLock.pid})`);\n                            try {\n                                fs.unlinkSync(this.lockPath);\n                            } catch {\n                                // Lock might have been removed by another process, continue\n                            }\n                        }\n                    } catch {\n                        // Invalid lock file, try to remove it\n                        try {\n                            fs.unlinkSync(this.lockPath);\n                        } catch {\n                            // Ignore errors\n                        }\n                    }\n                }\n\n                // Try to acquire lock\n                fs.writeFileSync(this.lockPath, JSON.stringify(lockData, null, 2), { flag: 'wx' });\n                this.lockAcquired = true;\n\n                if (attempts > 0) {\n                    this.logger.debug(`Acquired file lock after ${attempts} attempts: ${this.lockPath}`);\n                }\n\n                return;\n            } catch (error: any) {\n                if (error.code === 'EEXIST') {\n                    // Lock file exists, retry with backoff\n                    attempts++;\n\n                    if (attempts === 1 || attempts % 10 === 0) {\n                        this.logger.verbose(`Waiting for file lock (attempt ${attempts}/${this.maxRetries}): ${this.lockPath}`);\n                    }\n\n                    await new Promise(resolve => setTimeout(resolve, currentDelay));\n\n                    // Exponential backoff\n                    currentDelay = Math.min(currentDelay * 1.5, this.maxRetryDelay);\n                } else {\n                    // Unexpected error\n                    throw new Error(`Failed to acquire file lock ${this.lockPath}: ${error.message}`);\n                }\n            }\n        }\n\n        throw new Error(`Failed to acquire file lock after ${this.maxRetries} attempts: ${this.lockPath}`);\n    }\n\n    /**\n     * Release the file lock\n     */\n    unlock(): void {\n        if (!this.lockAcquired) {\n            return;\n        }\n\n        try {\n            if (fs.existsSync(this.lockPath)) {\n                fs.unlinkSync(this.lockPath);\n            }\n            this.lockAcquired = false;\n            this.logger.silly(`Released file lock: ${this.lockPath}`);\n        } catch (error: any) {\n            // Lock file might have been removed by another process or stale lock cleanup\n            this.logger.debug(`Error releasing file lock ${this.lockPath}: ${error.message}`);\n            this.lockAcquired = false;\n        }\n    }\n\n    /**\n     * Check if this instance currently holds the lock\n     */\n    isLocked(): boolean {\n        return this.lockAcquired;\n    }\n}\n\n/**\n * Manages file-based locks for git repositories (cross-process safe)\n */\nexport class RepositoryFileLockManager {\n    private locks: Map<string, FileLock> = new Map();\n    private logger = getLogger();\n    private cleanupRegistered = false;\n\n    /**\n     * Get or create a file lock for a specific git repository\n     * @param repoPath Path to the git repository root\n     * @returns FileLock for this repository\n     */\n    getRepositoryLock(repoPath: string): FileLock {\n        const normalizedPath = path.resolve(repoPath);\n\n        if (!this.locks.has(normalizedPath)) {\n            // Create lock file in .git directory to ensure it's in the repo\n            const lockPath = path.join(normalizedPath, '.git', 'kodrdriv.lock');\n            this.logger.debug(`Creating file lock for repository: ${normalizedPath}`);\n            this.locks.set(normalizedPath, new FileLock(lockPath));\n\n            // Register cleanup handler on first lock creation\n            if (!this.cleanupRegistered) {\n                this.registerCleanupHandlers();\n                this.cleanupRegistered = true;\n            }\n        }\n\n        return this.locks.get(normalizedPath)!;\n    }\n\n    /**\n     * Register cleanup handlers to release locks on process exit\n     */\n    private registerCleanupHandlers(): void {\n        const cleanup = () => {\n            this.destroy();\n        };\n\n        // Handle various exit scenarios\n        process.on('exit', cleanup);\n        process.on('SIGINT', () => {\n            cleanup();\n            process.exit(130); // Standard exit code for SIGINT\n        });\n        process.on('SIGTERM', () => {\n            cleanup();\n            process.exit(143); // Standard exit code for SIGTERM\n        });\n        process.on('uncaughtException', (error) => {\n            this.logger.error('Uncaught exception, cleaning up locks:', error);\n            cleanup();\n            process.exit(1);\n        });\n    }\n\n    /**\n     * Execute a git operation with repository-level file locking\n     * @param repoPath Path to the git repository root\n     * @param operation The async operation to execute under lock\n     * @param operationName Optional name for logging\n     * @returns Result of the operation\n     */\n    async withGitLock<T>(\n        repoPath: string,\n        operation: () => Promise<T>,\n        operationName?: string\n    ): Promise<T> {\n        const lock = this.getRepositoryLock(repoPath);\n        const startWait = Date.now();\n\n        this.logger.silly(\n            `Acquiring file lock for ${repoPath}${operationName ? ` for: ${operationName}` : ''}`\n        );\n\n        await lock.lock();\n\n        const waitTime = Date.now() - startWait;\n        if (waitTime > 100) {\n            this.logger.debug(\n                `Acquired file lock for ${repoPath} after ${waitTime}ms${operationName ? ` for: ${operationName}` : ''}`\n            );\n        }\n\n        try {\n            return await operation();\n        } finally {\n            lock.unlock();\n        }\n    }\n\n    /**\n     * Clean up all locks\n     */\n    destroy(): void {\n        this.logger.debug(`Cleaning up ${this.locks.size} file lock(s)`);\n        for (const lock of this.locks.values()) {\n            lock.unlock();\n        }\n        this.locks.clear();\n    }\n}\n"],"names":["FileLock","lock","attempts","currentDelay","retryDelay","maxRetries","lockData","pid","process","timestamp","Date","now","hostname","os","fs","existsSync","lockPath","lockContent","readFileSync","existingLock","JSON","parse","lockAge","lockTimeout","logger","debug","unlinkSync","writeFileSync","stringify","flag","lockAcquired","error","code","verbose","Promise","resolve","setTimeout","Math","min","maxRetryDelay","Error","message","unlock","silly","isLocked","getLogger","RepositoryFileLockManager","getRepositoryLock","repoPath","normalizedPath","path","locks","has","join","set","cleanupRegistered","registerCleanupHandlers","get","cleanup","destroy","on","exit","withGitLock","operation","operationName","startWait","waitTime","size","values","clear","Map"],"mappings":";;;;;AAAA;;;;;;;;;;;;;;AAMA;;;AAGC,IACM,MAAMA,QAAAA,CAAAA;AAaT;;AAEC,QACD,MAAMC,IAAAA,GAAsB;AACxB,QAAA,IAAIC,QAAAA,GAAW,CAAA;QACf,IAAIC,YAAAA,GAAe,IAAI,CAACC,UAAU;AAElC,QAAA,MAAOF,QAAAA,GAAW,IAAI,CAACG,UAAU,CAAE;YAC/B,IAAI;;AAEA,gBAAA,MAAMC,QAAAA,GAAW;AACbC,oBAAAA,GAAAA,EAAKC,QAAQD,GAAG;AAChBE,oBAAAA,SAAAA,EAAWC,KAAKC,GAAG,EAAA;AACnBC,oBAAAA,QAAAA,EAAUC,GAAGD,QAAQ;AACzB,iBAAA;;AAGA,gBAAA,IAAIE,GAAGC,UAAU,CAAC,IAAI,CAACC,QAAQ,CAAA,EAAG;AAC9B,oBAAA,MAAMC,cAAcH,EAAAA,CAAGI,YAAY,CAAC,IAAI,CAACF,QAAQ,EAAE,OAAA,CAAA;oBACnD,IAAI;wBACA,MAAMG,YAAAA,GAAeC,IAAAA,CAAKC,KAAK,CAACJ,WAAAA,CAAAA;AAChC,wBAAA,MAAMK,OAAAA,GAAUZ,IAAAA,CAAKC,GAAG,EAAA,GAAKQ,aAAaV,SAAS;;AAGnD,wBAAA,IAAIa,OAAAA,GAAU,IAAI,CAACC,WAAW,EAAE;AAC5B,4BAAA,IAAI,CAACC,MAAM,CAACC,KAAK,CAAC,CAAC,+BAA+B,EAAEH,OAAAA,CAAQ,SAAS,EAAEH,YAAAA,CAAaZ,GAAG,CAAC,CAAC,CAAC,CAAA;4BAC1F,IAAI;AACAO,gCAAAA,EAAAA,CAAGY,UAAU,CAAC,IAAI,CAACV,QAAQ,CAAA;AAC/B,4BAAA,CAAA,CAAE,OAAM;;AAER,4BAAA;AACJ,wBAAA;AACJ,oBAAA,CAAA,CAAE,OAAM;;wBAEJ,IAAI;AACAF,4BAAAA,EAAAA,CAAGY,UAAU,CAAC,IAAI,CAACV,QAAQ,CAAA;AAC/B,wBAAA,CAAA,CAAE,OAAM;;AAER,wBAAA;AACJ,oBAAA;AACJ,gBAAA;;gBAGAF,EAAAA,CAAGa,aAAa,CAAC,IAAI,CAACX,QAAQ,EAAEI,IAAAA,CAAKQ,SAAS,CAACtB,QAAAA,EAAU,IAAA,EAAM,CAAA,CAAA,EAAI;oBAAEuB,IAAAA,EAAM;AAAK,iBAAA,CAAA;gBAChF,IAAI,CAACC,YAAY,GAAG,IAAA;AAEpB,gBAAA,IAAI5B,WAAW,CAAA,EAAG;AACd,oBAAA,IAAI,CAACsB,MAAM,CAACC,KAAK,CAAC,CAAC,yBAAyB,EAAEvB,QAAAA,CAAS,WAAW,EAAE,IAAI,CAACc,QAAQ,CAAA,CAAE,CAAA;AACvF,gBAAA;AAEA,gBAAA;AACJ,YAAA,CAAA,CAAE,OAAOe,KAAAA,EAAY;gBACjB,IAAIA,KAAAA,CAAMC,IAAI,KAAK,QAAA,EAAU;;AAEzB9B,oBAAAA,QAAAA,EAAAA;AAEA,oBAAA,IAAIA,QAAAA,KAAa,CAAA,IAAKA,QAAAA,GAAW,EAAA,KAAO,CAAA,EAAG;wBACvC,IAAI,CAACsB,MAAM,CAACS,OAAO,CAAC,CAAC,+BAA+B,EAAE/B,QAAAA,CAAS,CAAC,EAAE,IAAI,CAACG,UAAU,CAAC,GAAG,EAAE,IAAI,CAACW,QAAQ,CAAA,CAAE,CAAA;AAC1G,oBAAA;AAEA,oBAAA,MAAM,IAAIkB,OAAAA,CAAQC,CAAAA,OAAAA,GAAWC,WAAWD,OAAAA,EAAShC,YAAAA,CAAAA,CAAAA;;AAGjDA,oBAAAA,YAAAA,GAAekC,KAAKC,GAAG,CAACnC,eAAe,GAAA,EAAK,IAAI,CAACoC,aAAa,CAAA;gBAClE,CAAA,MAAO;;AAEH,oBAAA,MAAM,IAAIC,KAAAA,CAAM,CAAC,4BAA4B,EAAE,IAAI,CAACxB,QAAQ,CAAC,EAAE,EAAEe,KAAAA,CAAMU,OAAO,CAAA,CAAE,CAAA;AACpF,gBAAA;AACJ,YAAA;AACJ,QAAA;AAEA,QAAA,MAAM,IAAID,KAAAA,CAAM,CAAC,kCAAkC,EAAE,IAAI,CAACnC,UAAU,CAAC,WAAW,EAAE,IAAI,CAACW,QAAQ,CAAA,CAAE,CAAA;AACrG,IAAA;AAEA;;AAEC,QACD0B,MAAAA,GAAe;AACX,QAAA,IAAI,CAAC,IAAI,CAACZ,YAAY,EAAE;AACpB,YAAA;AACJ,QAAA;QAEA,IAAI;AACA,YAAA,IAAIhB,GAAGC,UAAU,CAAC,IAAI,CAACC,QAAQ,CAAA,EAAG;AAC9BF,gBAAAA,EAAAA,CAAGY,UAAU,CAAC,IAAI,CAACV,QAAQ,CAAA;AAC/B,YAAA;YACA,IAAI,CAACc,YAAY,GAAG,KAAA;YACpB,IAAI,CAACN,MAAM,CAACmB,KAAK,CAAC,CAAC,oBAAoB,EAAE,IAAI,CAAC3B,QAAQ,CAAA,CAAE,CAAA;AAC5D,QAAA,CAAA,CAAE,OAAOe,KAAAA,EAAY;;AAEjB,YAAA,IAAI,CAACP,MAAM,CAACC,KAAK,CAAC,CAAC,0BAA0B,EAAE,IAAI,CAACT,QAAQ,CAAC,EAAE,EAAEe,KAAAA,CAAMU,OAAO,CAAA,CAAE,CAAA;YAChF,IAAI,CAACX,YAAY,GAAG,KAAA;AACxB,QAAA;AACJ,IAAA;AAEA;;AAEC,QACDc,QAAAA,GAAoB;QAChB,OAAO,IAAI,CAACd,YAAY;AAC5B,IAAA;AAxGA,IAAA,WAAA,CAAYd,QAAgB,CAAE;AAR9B,QAAA,gBAAA,CAAA,IAAA,EAAQA,YAAR,MAAA,CAAA;AACA,QAAA,gBAAA,CAAA,IAAA,EAAQc,cAAAA,EAAe,KAAA,CAAA;QACvB,gBAAA,CAAA,IAAA,EAAQzB,YAAAA,EAAa;QACrB,gBAAA,CAAA,IAAA,EAAQD,YAAAA,EAAa;QACrB,gBAAA,CAAA,IAAA,EAAQmC,eAAAA,EAAgB;QACxB,gBAAA,CAAA,IAAA,EAAQhB,aAAAA,EAAc;AACtB,QAAA,gBAAA,CAAA,IAAA,EAAQC,QAAAA,EAASqB,SAAAA,EAAAA,CAAAA;QAGb,IAAI,CAAC7B,QAAQ,GAAGA,QAAAA;AACpB,IAAA;AAuGJ;AAEA;;AAEC,IACM,MAAM8B,yBAAAA,CAAAA;AAKT;;;;QAKAC,iBAAAA,CAAkBC,QAAgB,EAAY;QAC1C,MAAMC,cAAAA,GAAiBC,IAAAA,CAAKf,OAAO,CAACa,QAAAA,CAAAA;AAEpC,QAAA,IAAI,CAAC,IAAI,CAACG,KAAK,CAACC,GAAG,CAACH,cAAAA,CAAAA,EAAiB;;AAEjC,YAAA,MAAMjC,QAAAA,GAAWkC,IAAAA,CAAKG,IAAI,CAACJ,gBAAgB,MAAA,EAAQ,eAAA,CAAA;YACnD,IAAI,CAACzB,MAAM,CAACC,KAAK,CAAC,CAAC,mCAAmC,EAAEwB,cAAAA,CAAAA,CAAgB,CAAA;AACxE,YAAA,IAAI,CAACE,KAAK,CAACG,GAAG,CAACL,cAAAA,EAAgB,IAAIjD,QAAAA,CAASgB,QAAAA,CAAAA,CAAAA;;AAG5C,YAAA,IAAI,CAAC,IAAI,CAACuC,iBAAiB,EAAE;AACzB,gBAAA,IAAI,CAACC,uBAAuB,EAAA;gBAC5B,IAAI,CAACD,iBAAiB,GAAG,IAAA;AAC7B,YAAA;AACJ,QAAA;AAEA,QAAA,OAAO,IAAI,CAACJ,KAAK,CAACM,GAAG,CAACR,cAAAA,CAAAA;AAC1B,IAAA;AAEA;;AAEC,QACD,uBAAQO,GAAgC;AACpC,QAAA,MAAME,OAAAA,GAAU,IAAA;AACZ,YAAA,IAAI,CAACC,OAAO,EAAA;AAChB,QAAA,CAAA;;QAGAnD,OAAAA,CAAQoD,EAAE,CAAC,MAAA,EAAQF,OAAAA,CAAAA;QACnBlD,OAAAA,CAAQoD,EAAE,CAAC,QAAA,EAAU,IAAA;AACjBF,YAAAA,OAAAA,EAAAA;YACAlD,OAAAA,CAAQqD,IAAI,CAAC,GAAA,CAAA,CAAA;AACjB,QAAA,CAAA,CAAA;QACArD,OAAAA,CAAQoD,EAAE,CAAC,SAAA,EAAW,IAAA;AAClBF,YAAAA,OAAAA,EAAAA;YACAlD,OAAAA,CAAQqD,IAAI,CAAC,GAAA,CAAA,CAAA;AACjB,QAAA,CAAA,CAAA;QACArD,OAAAA,CAAQoD,EAAE,CAAC,mBAAA,EAAqB,CAAC7B,KAAAA,GAAAA;AAC7B,YAAA,IAAI,CAACP,MAAM,CAACO,KAAK,CAAC,wCAAA,EAA0CA,KAAAA,CAAAA;AAC5D2B,YAAAA,OAAAA,EAAAA;AACAlD,YAAAA,OAAAA,CAAQqD,IAAI,CAAC,CAAA,CAAA;AACjB,QAAA,CAAA,CAAA;AACJ,IAAA;AAEA;;;;;;AAMC,QACD,MAAMC,WAAAA,CACFd,QAAgB,EAChBe,SAA2B,EAC3BC,aAAsB,EACZ;AACV,QAAA,MAAM/D,IAAAA,GAAO,IAAI,CAAC8C,iBAAiB,CAACC,QAAAA,CAAAA;QACpC,MAAMiB,SAAAA,GAAYvD,KAAKC,GAAG,EAAA;AAE1B,QAAA,IAAI,CAACa,MAAM,CAACmB,KAAK,CACb,CAAC,wBAAwB,EAAEK,QAAAA,CAAAA,EAAWgB,gBAAgB,CAAC,MAAM,EAAEA,aAAAA,CAAAA,CAAe,GAAG,EAAA,CAAA,CAAI,CAAA;AAGzF,QAAA,MAAM/D,KAAKA,IAAI,EAAA;QAEf,MAAMiE,QAAAA,GAAWxD,IAAAA,CAAKC,GAAG,EAAA,GAAKsD,SAAAA;AAC9B,QAAA,IAAIC,WAAW,GAAA,EAAK;YAChB,IAAI,CAAC1C,MAAM,CAACC,KAAK,CACb,CAAC,uBAAuB,EAAEuB,QAAAA,CAAS,OAAO,EAAEkB,QAAAA,CAAS,EAAE,EAAEF,aAAAA,GAAgB,CAAC,MAAM,EAAEA,aAAAA,CAAAA,CAAe,GAAG,EAAA,CAAA,CAAI,CAAA;AAEhH,QAAA;QAEA,IAAI;AACA,YAAA,OAAO,MAAMD,SAAAA,EAAAA;QACjB,CAAA,QAAU;AACN9D,YAAAA,IAAAA,CAAKyC,MAAM,EAAA;AACf,QAAA;AACJ,IAAA;AAEA;;AAEC,QACDiB,OAAAA,GAAgB;AACZ,QAAA,IAAI,CAACnC,MAAM,CAACC,KAAK,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC0B,KAAK,CAACgB,IAAI,CAAC,aAAa,CAAC,CAAA;AAC/D,QAAA,KAAK,MAAMlE,IAAAA,IAAQ,IAAI,CAACkD,KAAK,CAACiB,MAAM,EAAA,CAAI;AACpCnE,YAAAA,IAAAA,CAAKyC,MAAM,EAAA;AACf,QAAA;QACA,IAAI,CAACS,KAAK,CAACkB,KAAK,EAAA;AACpB,IAAA;;AAjGA,QAAA,gBAAA,CAAA,IAAA,EAAQlB,SAA+B,IAAImB,GAAAA,EAAAA,CAAAA;AAC3C,QAAA,gBAAA,CAAA,IAAA,EAAQ9C,QAAAA,EAASqB,SAAAA,EAAAA,CAAAA;AACjB,QAAA,gBAAA,CAAA,IAAA,EAAQU,mBAAAA,EAAoB,KAAA,CAAA;;AAgGhC;;;;"}

package/dist/util/general.js

@@ -1,4 +1,4 @@
-import path from 'path';
+import path__default from 'path';
 import { create } from './storage.js';
 import { getLogger } from '../logging.js';
 import * as fs from 'fs';
@@ -416,7 +416,7 @@ const confirmVersionInteractively = async (currentVersion, proposedVersion, targ
     }
 };
 const getOutputPath = (outputDirectory, filename)=>{
-    return path.join(outputDirectory, filename);
+    return path__default.join(outputDirectory, filename);
 };
 const getTimestampedFilename = (baseName, extension = '.json')=>{
     const now = new Date();
@@ -471,13 +471,13 @@ const getTimestampedArchivedTranscriptFilename = ()=>{
         // Ensure the output directory exists (should already be output/kodrdriv)
         await storage.ensureDirectory(outputDirectory);
         // Get file extension from original audio file
-        const originalExtension = path.extname(originalAudioPath);
+        const originalExtension = path__default.extname(originalAudioPath);
         // Generate timestamped filenames
         const archivedAudioFilename = getTimestampedArchivedAudioFilename(originalExtension);
         const archivedTranscriptFilename = getTimestampedArchivedTranscriptFilename();
         // Full paths for archived files - directly in the output directory
-        const archivedAudioPath = path.join(outputDirectory, archivedAudioFilename);
-        const archivedTranscriptPath = path.join(outputDirectory, archivedTranscriptFilename);
+        const archivedAudioPath = path__default.join(outputDirectory, archivedAudioFilename);
+        const archivedTranscriptPath = path__default.join(outputDirectory, archivedTranscriptFilename);
         // Copy audio file if it exists
         if (await storage.isFileReadable(originalAudioPath)) {
             // Read original audio file as buffer using fs directly for binary files