soloforge 1.1.2 → 1.2.0

package/dist/engine/llm_gateway.js

@@ -0,0 +1,220 @@
+import { loadKnowledgeConfig, extractNumberRule } from "./knowledge_config_loader.js";
+// ── 操作配置表 ──
+const OPERATION_PROFILES = {
+    intent_refinement: { tier: "medium", estimated_tokens: 2000, description: "意图理解深化" },
+    solution_brainstorm: { tier: "heavy", estimated_tokens: 4000, description: "方案脑暴推演" },
+    verification_reasoning: { tier: "heavy", estimated_tokens: 3000, description: "复杂验证推理" },
+    code_generation: { tier: "heavy", estimated_tokens: 5000, description: "代码生成" },
+    test_generation: { tier: "medium", estimated_tokens: 3000, description: "测试用例生成" },
+    review_deep_analysis: { tier: "heavy", estimated_tokens: 4000, description: "深度审查分析" },
+    debug_analysis: { tier: "medium", estimated_tokens: 2500, description: "排障推理" },
+};
+/** 从知识库 decision_gateway.md 读取阈值，文件不存在时使用硬编码兜底 */
+function loadGatewayConfig(projectPath) {
+    const config = loadKnowledgeConfig("patterns/core/decision_gateway.md", projectPath);
+    const body = config?.body ?? "";
+    return {
+        budget_total: extractNumberRule(body, "Budget_Total") ?? 100_000,
+        task_budget: extractNumberRule(body, "Task_Budget") ?? 30_000,
+        circuit_breaker_ratio: extractNumberRule(body, "Circuit_Breaker_Ratio") ?? 0.9,
+        heartbeat_interval: extractNumberRule(body, "Heartbeat_Interval") ?? 5000,
+        confidence_threshold: extractNumberRule(body, "Confidence_Threshold") ?? 0.95,
+    };
+}
+const DEFAULT_CONFIG = loadGatewayConfig();
+// ── 网关核心 ──
+export class LLMGateway {
+    budgetTotal;
+    budgetUsed = 0;
+    taskBudget;
+    taskTokensUsed = 0;
+    currentTaskId = null;
+    callCount = 0;
+    blockedCount = 0;
+    auditLog = [];
+    circuitOpen = false;
+    heartbeatTimer = null;
+    heartbeatCallback = null;
+    operationStart = 0;
+    currentOperation = null;
+    config = DEFAULT_CONFIG;
+    constructor(budget, taskBudget) {
+        this.budgetTotal = budget ?? this.config.budget_total;
+        this.taskBudget = taskBudget ?? this.config.task_budget;
+    }
+    /** 设置心跳回调（用于 stdio 输出进度） */
+    setHeartbeatCallback(cb) {
+        this.heartbeatCallback = cb;
+    }
+    /** 开始新任务的 Token 计量 */
+    beginTask(taskId) {
+        this.currentTaskId = taskId;
+        this.taskTokensUsed = 0;
+    }
+    /** 结束任务计量 */
+    endTask() {
+        this.currentTaskId = null;
+        this.taskTokensUsed = 0;
+        this.stopHeartbeat();
+    }
+    request(operation, taskId) {
+        const profile = OPERATION_PROFILES[operation];
+        const tid = taskId ?? this.currentTaskId ?? undefined;
+        const entry = {
+            operation,
+            estimated_tokens: profile.estimated_tokens,
+            timestamp: new Date().toISOString(),
+            blocked: false,
+            task_id: tid,
+        };
+        // 单任务阈值检查
+        if (this.taskTokensUsed + profile.estimated_tokens > this.taskBudget) {
+            this.blockedCount++;
+            entry.blocked = true;
+            this.auditLog.push(entry);
+            return {
+                allowed: false,
+                estimated_tokens: profile.estimated_tokens,
+                remaining_budget: this.budgetTotal - this.budgetUsed,
+                remaining_task_budget: this.taskBudget - this.taskTokensUsed,
+                reason: `单任务 Token 阈值触发: 当前任务已使用 ${this.taskTokensUsed}/${this.taskBudget}，${profile.description} 需要 ~${profile.estimated_tokens}。建议拆分任务或减少范围`,
+            };
+        }
+        // 全局熔断检查
+        if (this.circuitOpen || (this.budgetUsed / this.budgetTotal) >= this.config.circuit_breaker_ratio) {
+            this.circuitOpen = true;
+            this.blockedCount++;
+            entry.blocked = true;
+            this.auditLog.push(entry);
+            return {
+                allowed: false,
+                estimated_tokens: profile.estimated_tokens,
+                remaining_budget: this.budgetTotal - this.budgetUsed,
+                remaining_task_budget: this.taskBudget - this.taskTokensUsed,
+                reason: `Token 预告警: 已使用 ${this.budgetUsed}/${this.budgetTotal}（${((this.budgetUsed / this.budgetTotal) * 100).toFixed(0)}%）。${profile.description} 需要 ~${profile.estimated_tokens} Token，超出安全阈值`,
+            };
+        }
+        if (this.budgetUsed + profile.estimated_tokens > this.budgetTotal) {
+            this.blockedCount++;
+            entry.blocked = true;
+            this.auditLog.push(entry);
+            return {
+                allowed: false,
+                estimated_tokens: profile.estimated_tokens,
+                remaining_budget: this.budgetTotal - this.budgetUsed,
+                remaining_task_budget: this.taskBudget - this.taskTokensUsed,
+                reason: `Token 预算不足: 剩余 ${this.budgetTotal - this.budgetUsed}，需要 ~${profile.estimated_tokens}`,
+            };
+        }
+        this.budgetUsed += profile.estimated_tokens;
+        this.taskTokensUsed += profile.estimated_tokens;
+        this.callCount++;
+        this.auditLog.push(entry);
+        // 重型操作启动心跳
+        if (profile.tier === "heavy") {
+            this.startHeartbeat(operation);
+        }
+        return {
+            allowed: true,
+            estimated_tokens: profile.estimated_tokens,
+            remaining_budget: this.budgetTotal - this.budgetUsed,
+            remaining_task_budget: this.taskBudget - this.taskTokensUsed,
+        };
+    }
+    /** 置信度闸口: 低于阈值禁止执行代码，必须调用 sf_brainstorm */
+    confidenceGate(confidence) {
+        const threshold = this.config.confidence_threshold;
+        if (confidence < threshold) {
+            return {
+                allowed: false,
+                threshold,
+                reason: `置信度 ${confidence.toFixed(2)} 低于阈值 ${threshold}，禁止直接输出执行代码，必须调用 sf_brainstorm 展示三轨方案`,
+            };
+        }
+        return { allowed: true, threshold };
+    }
+    /** 标记操作完成，停止心跳 */
+    completeOperation() {
+        this.stopHeartbeat();
+        this.currentOperation = null;
+    }
+    reportActualUsage(operation, actualTokens) {
+        const profile = OPERATION_PROFILES[operation];
+        const diff = actualTokens - profile.estimated_tokens;
+        if (diff > 0) {
+            this.budgetUsed += diff;
+            this.taskTokensUsed += diff;
+            if ((this.budgetUsed / this.budgetTotal) >= this.config.circuit_breaker_ratio) {
+                this.circuitOpen = true;
+            }
+        }
+        else {
+            this.budgetUsed = Math.max(0, this.budgetUsed + diff);
+            this.taskTokensUsed = Math.max(0, this.taskTokensUsed + diff);
+        }
+    }
+    getStatus() {
+        return {
+            budget_total: this.budgetTotal,
+            budget_used: this.budgetUsed,
+            budget_remaining: this.budgetTotal - this.budgetUsed,
+            usage_ratio: this.budgetUsed / this.budgetTotal,
+            circuit_open: this.circuitOpen,
+            call_count: this.callCount,
+            blocked_count: this.blockedCount,
+            task_tokens_used: this.taskTokensUsed,
+            audit_log: [...this.auditLog],
+        };
+    }
+    reset(budget) {
+        this.budgetTotal = budget ?? this.config.budget_total;
+        this.budgetUsed = 0;
+        this.callCount = 0;
+        this.blockedCount = 0;
+        this.auditLog = [];
+        this.circuitOpen = false;
+        this.taskTokensUsed = 0;
+        this.stopHeartbeat();
+    }
+    static isLocalOperation(op) {
+        const LOCAL_OPS = [
+            "classify", "scope_resolve", "knowledge_match", "pattern_extract",
+            "drift_detect", "mutation_test", "coverage_scan", "dependency_scan",
+            "migration_check", "contract_check", "debt_scan", "build_run",
+        ];
+        return LOCAL_OPS.includes(op);
+    }
+    static isAIOperation(op) {
+        return op in OPERATION_PROFILES;
+    }
+    static getProfile(op) {
+        return OPERATION_PROFILES[op];
+    }
+    // ── 流式心跳 ──
+    startHeartbeat(operation) {
+        this.stopHeartbeat();
+        this.operationStart = Date.now();
+        this.currentOperation = operation;
+        if (!this.heartbeatCallback)
+            return;
+        this.heartbeatTimer = setInterval(() => {
+            if (!this.heartbeatCallback || !this.currentOperation)
+                return;
+            const elapsed = Date.now() - this.operationStart;
+            const profile = OPERATION_PROFILES[this.currentOperation];
+            this.heartbeatCallback({
+                elapsed_ms: elapsed,
+                tokens_used: this.taskTokensUsed,
+                operation: this.currentOperation,
+                message: `[SoloForge Heartbeat] ${profile.description} 执行中... 已耗时 ${(elapsed / 1000).toFixed(0)}s，当前任务已用 ${this.taskTokensUsed}/${this.taskBudget} Token`,
+            });
+        }, this.config.heartbeat_interval);
+    }
+    stopHeartbeat() {
+        if (this.heartbeatTimer) {
+            clearInterval(this.heartbeatTimer);
+            this.heartbeatTimer = null;
+        }
+    }
+}
+//# sourceMappingURL=llm_gateway.js.map

package/dist/engine/llm_gateway.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm_gateway.js","sourceRoot":"","sources":["../../src/engine/llm_gateway.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAkEtF,cAAc;AAEd,MAAM,kBAAkB,GAA8C;IACpE,iBAAiB,EAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE;IACzF,mBAAmB,EAAK,EAAE,IAAI,EAAE,OAAO,EAAG,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE;IACzF,sBAAsB,EAAE,EAAE,IAAI,EAAE,OAAO,EAAG,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE;IACzF,eAAe,EAAS,EAAE,IAAI,EAAE,OAAO,EAAG,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE;IACvF,eAAe,EAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE;IACzF,oBAAoB,EAAI,EAAE,IAAI,EAAE,OAAO,EAAG,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE;IACzF,cAAc,EAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE;CACxF,CAAC;AAEF,kDAAkD;AAClD,SAAS,iBAAiB,CAAC,WAAoB;IAO7C,MAAM,MAAM,GAAG,mBAAmB,CAAC,mCAAmC,EAAE,WAAW,CAAC,CAAC;IACrF,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;IAChC,OAAO;QACL,YAAY,EAAE,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,OAAO;QAChE,WAAW,EAAE,iBAAiB,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,MAAM;QAC7D,qBAAqB,EAAE,iBAAiB,CAAC,IAAI,EAAE,uBAAuB,CAAC,IAAI,GAAG;QAC9E,kBAAkB,EAAE,iBAAiB,CAAC,IAAI,EAAE,oBAAoB,CAAC,IAAI,IAAI;QACzE,oBAAoB,EAAE,iBAAiB,CAAC,IAAI,EAAE,sBAAsB,CAAC,IAAI,IAAI;KAC9E,CAAC;AACJ,CAAC;AAED,MAAM,cAAc,GAAG,iBAAiB,EAAE,CAAC;AAE3C,aAAa;AAEb,MAAM,OAAO,UAAU;IACb,WAAW,CAAS;IACpB,UAAU,GAAG,CAAC,CAAC;IACf,UAAU,CAAS;IACnB,cAAc,GAAG,CAAC,CAAC;IACnB,aAAa,GAAkB,IAAI,CAAC;IACpC,SAAS,GAAG,CAAC,CAAC;IACd,YAAY,GAAG,CAAC,CAAC;IACjB,QAAQ,GAAwB,EAAE,CAAC;IACnC,WAAW,GAAG,KAAK,CAAC;IACpB,cAAc,GAA0C,IAAI,CAAC;IAC7D,iBAAiB,GAA6B,IAAI,CAAC;IACnD,cAAc,GAAW,CAAC,CAAC;IAC3B,gBAAgB,GAA2B,IAAI,CAAC;IAEhD,MAAM,GAAG,cAAc,CAAC;IAEhC,YAAY,MAAe,EAAE,UAAmB;QAC9C,IAAI,CAAC,WAAW,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;QACtD,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;IAC1D,CAAC;IAED,4BAA4B;IAC5B,oBAAoB,CAAC,EAAqB;QACxC,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;IAC9B,CAAC;IAED,sBAAsB;IACtB,SAAS,CAAC,MAAc;QACtB,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,aAAa;IACb,OAAO;QACL,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,SAA0B,EAAE,MAAe;QAOjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,aAAa,IAAI,SAAS,CAAC;QACtD,MAAM,KAAK,GAAsB;YAC/B,SAAS;YACT,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;YAC1C,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,GAAG;SACb,CAAC;QAEF,UAAU;QACV,IAAI,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACrE,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;gBAC1C,gBAAgB,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU;gBACpD,qBAAqB,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc;gBAC5D,MAAM,EAAE,2BAA2B,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,WAAW,QAAQ,OAAO,CAAC,gBAAgB,cAAc;aAC/I,CAAC;QACJ,CAAC;QAED,SAAS;QACT,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;YAClG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;gBAC1C,gBAAgB,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU;gBACpD,qBAAqB,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc;gBAC5D,MAAM,EAAE,kBAAkB,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,WAAW,QAAQ,OAAO,CAAC,gBAAgB,eAAe;aACjM,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAClE,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;gBAC1C,gBAAgB,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU;gBACpD,qBAAqB,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc;gBAC5D,MAAM,EAAE,kBAAkB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,QAAQ,OAAO,CAAC,gBAAgB,EAAE;aAC/F,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,gBAAgB,CAAC;QAC5C,IAAI,CAAC,cAAc,IAAI,OAAO,CAAC,gBAAgB,CAAC;QAChD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE1B,WAAW;QACX,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC;QAED,OAAO;YACL,OAAO,EAAE,IAAI;YACb,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;YAC1C,gBAAgB,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU;YACpD,qBAAqB,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc;SAC7D,CAAC;IACJ,CAAC;IAED,2CAA2C;IAC3C,cAAc,CAAC,UAAkB;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC;QACnD,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,SAAS;gBACT,MAAM,EAAE,OAAO,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,SAAS,uCAAuC;aAC9F,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACtC,CAAC;IAED,kBAAkB;IAClB,iBAAiB;QACf,IAAI,CAAC,aAAa,EAAE,CAAC;QACrB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAC/B,CAAC;IAED,iBAAiB,CAAC,SAA0B,EAAE,YAAoB;QAChE,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,YAAY,GAAG,OAAO,CAAC,gBAAgB,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;YACxB,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;gBAC9E,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YAC1B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;YACtD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,SAAS;QACP,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,WAAW;YAC9B,WAAW,EAAE,IAAI,CAAC,UAAU;YAC5B,gBAAgB,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU;YACpD,WAAW,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW;YAC/C,YAAY,EAAE,IAAI,CAAC,WAAW;YAC9B,UAAU,EAAE,IAAI,CAAC,SAAS;YAC1B,aAAa,EAAE,IAAI,CAAC,YAAY;YAChC,gBAAgB,EAAE,IAAI,CAAC,cAAc;YACrC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;SAC9B,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,MAAe;QACnB,IAAI,CAAC,WAAW,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;QACtD,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,gBAAgB,CAAC,EAAU;QAChC,MAAM,SAAS,GAAG;YAChB,UAAU,EAAE,eAAe,EAAE,iBAAiB,EAAE,iBAAiB;YACjE,cAAc,EAAE,eAAe,EAAE,eAAe,EAAE,iBAAiB;YACnE,iBAAiB,EAAE,gBAAgB,EAAE,WAAW,EAAE,WAAW;SAC9D,CAAC;QACF,OAAO,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,CAAC,aAAa,CAAC,EAAmB;QACtC,OAAO,EAAE,IAAI,kBAAkB,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,EAAmB;QACnC,OAAO,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,aAAa;IAEL,cAAc,CAAC,SAA0B;QAC/C,IAAI,CAAC,aAAa,EAAE,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAElC,IAAI,CAAC,IAAI,CAAC,iBAAiB;YAAE,OAAO;QAEpC,IAAI,CAAC,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,IAAI,CAAC,gBAAgB;gBAAE,OAAO;YAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YACjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC1D,IAAI,CAAC,iBAAiB,CAAC;gBACrB,UAAU,EAAE,OAAO;gBACnB,WAAW,EAAE,IAAI,CAAC,cAAc;gBAChC,SAAS,EAAE,IAAI,CAAC,gBAAgB;gBAChC,OAAO,EAAE,yBAAyB,OAAO,CAAC,WAAW,eAAe,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,UAAU,QAAQ;aAC1J,CAAC,CAAC;QACL,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;IACrC,CAAC;IAEO,aAAa;QACnB,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACnC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC7B,CAAC;IACH,CAAC;CACF"}

package/dist/engine/test_quality.d.ts

@@ -12,5 +12,19 @@ import type { TestQualityReport } from "../types.js";
  * @param sourceContent - 可选的被测源码内容（用于变异测试）
  * @returns 测试质量报告，包含总分(0-100)、各项检查结果和改进建议列表
  */
-export declare function analyzeTestQuality(testContent: string, filename: string, sourceContent?: string): TestQualityReport;
+export declare function analyzeTestQuality(testContent: string, filename: string, sourceContent?: string, coverageMap?: CoverageMap, sourceFilePath?: string): TestQualityReport;
+/** lcov 报告解析结果: 文件路径 → 已覆盖行号集合 */
+export type CoverageMap = Map<string, Set<number>>;
+/**
+ * 解析 lcov.info 报告，提取每个文件的已覆盖行号。
+ * lcov 格式:
+ *   SF:path/to/file.ts
+ *   DA:10,1
+ *   DA:25,0
+ *   end_of_record
+ * DA 行中第二个字段 > 0 表示该行被执行过（已覆盖）。
+ * @param lcovContent - lcov.info 文件内容
+ * @returns 覆盖率映射（文件路径 → 已覆盖行号集合）
+ */
+export declare function parseLcov(lcovContent: string): CoverageMap;
 //# sourceMappingURL=test_quality.d.ts.map

package/dist/engine/test_quality.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"test_quality.d.ts","sourceRoot":"","sources":["../../src/engine/test_quality.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAoB,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEvE;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,EAChB,aAAa,CAAC,EAAE,MAAM,GACrB,iBAAiB,CAqEnB"}
+{"version":3,"file":"test_quality.d.ts","sourceRoot":"","sources":["../../src/engine/test_quality.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAoB,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAGvE;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,EAChB,aAAa,CAAC,EAAE,MAAM,EACtB,WAAW,CAAC,EAAE,WAAW,EACzB,cAAc,CAAC,EAAE,MAAM,GACtB,iBAAiB,CAuEnB;AAidD,kCAAkC;AAClC,MAAM,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAEnD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,WAAW,CAyB1D"}

package/dist/engine/test_quality.js

@@ -1,3 +1,4 @@
+import { loadKnowledgeConfig, extractNumberRule, extractListRule } from "./knowledge_config_loader.js";
 /**
  * 测试质量分析器 — 对测试文件进行纯规则维度的质量评估，包含断言密度、边界覆盖、
  * 命名规范性、断言重复和场景覆盖五个检查维度。零 AI 依赖。
@@ -11,7 +12,7 @@
  * @param sourceContent - 可选的被测源码内容（用于变异测试）
  * @returns 测试质量报告，包含总分(0-100)、各项检查结果和改进建议列表
  */
-export function analyzeTestQuality(testContent, filename, sourceContent) {
+export function analyzeTestQuality(testContent, filename, sourceContent, coverageMap, sourceFilePath) {
     const checks = [];
     const suggestions = [];
     // ── 1. assertion_density ──
@@ -41,9 +42,9 @@ export function analyzeTestQuality(testContent, filename, sourceContent) {
     // ── 5. scenario_coverage ──
     const scenarioCheck = checkScenarioCoverage();
     checks.push(scenarioCheck);
-    // ── 6. mutation_audit (机制 4: 变异测试防造假) ──
+    // ── 6. mutation_audit (机制 4: 变异测试防造假 + 覆盖率联动) ──
     if (sourceContent) {
-        const mutationCheck = checkMutationResistance(testContent, sourceContent);
+        const mutationCheck = checkMutationResistanceWithCoverage(testContent, sourceContent, coverageMap, sourceFilePath);
         checks.push(mutationCheck);
         if (!mutationCheck.passed) {
             suggestions.push("测试可能存在'自己证明自己'问题：变异后断言仍能通过。建议增加反向用例和精确断言");
@@ -288,6 +289,19 @@ function checkScenarioCoverage() {
         detail: "需结合知识模板验收项进行交叉检查",
     };
 }
+// ── 机制 4: 变异测试防造假（知识库驱动） ──
+/** 从知识库 mutation_audit.md 读取变异审计配置 */
+function loadMutationConfig() {
+    const config = loadKnowledgeConfig("patterns/core/mutation_audit.md");
+    const body = config?.body ?? "";
+    return {
+        precision_threshold: extractNumberRule(body, "Precision_Threshold") ?? 0.5,
+        max_sample_lines: 8,
+        whitelist_keywords: extractListRule(body, "变异白名单") ?? ["if", "else", "switch", "===", "!=="],
+        blacklist_keywords: extractListRule(body, "变异黑名单") ?? ["console.log", "import", "export", "debugger"],
+    };
+}
+const MUTATION_CONFIG = loadMutationConfig();
 /** 预定义变异操作集 */
 const MUTATION_OPERATORS = [
     {
@@ -341,32 +355,85 @@ const MUTATION_OPERATORS = [
         },
     },
 ];
+// ── 变异白名单: AST 级别节点过滤 ──
+/**
+ * 判断一行代码是否属于可变异的白名单节点。
+ * 白名单: 条件分支(if/else/switch)、比较/逻辑操作符、return 语句、算术表达式。
+ * 黑名单: console.log、注释、import/export、纯字符串/变量名赋值、类型声明。
+ */
+function isMutationCandidate(line) {
+    const trimmed = line.trim();
+    // 黑名单: 跳过注释
+    if (trimmed.startsWith("//") || trimmed.startsWith("*") || trimmed.startsWith("/*"))
+        return false;
+    // 黑名单: 跳过 import/export 声明
+    if (/^(import |export |from )/.test(trimmed))
+        return false;
+    // 黑名单: 跳过 console.log / console.warn / console.error 等无副作用日志
+    if (/console\.(log|warn|error|info|debug)\s*\(/.test(trimmed))
+        return false;
+    // 黑名单: 跳过纯类型声明（TypeScript interface/type/enum）
+    if (/^(interface |type |enum |declare )/.test(trimmed))
+        return false;
+    // 黑名单: 跳过纯字符串字面量行（无逻辑）
+    if (/^['"\`]/.test(trimmed) && trimmed.endsWith(';'))
+        return false;
+    // 黑名单: 跳过 debugger / breakpoint
+    if (/^debugger/.test(trimmed))
+        return false;
+    // 白名单: 条件分支 (if / else if / switch / case / ternary)
+    if (/\b(if|else|switch|case)\b/.test(trimmed) && /[(){}?]/.test(trimmed))
+        return true;
+    // 白名单: 比较操作符
+    if (/(===|!==|==|!=|>=|<=|>|<)/.test(trimmed))
+        return true;
+    // 白名单: 逻辑操作符 (&& ||)
+    if (/(&&|\|\|)/.test(trimmed))
+        return true;
+    // 白名单: return 语句（非 return void）
+    if (/\breturn\b/.test(trimmed) && !/return\s*;\s*$/.test(trimmed))
+        return true;
+    // 白名单: 布尔字面量在表达式中
+    if (/\b(true|false)\b/.test(trimmed) && /[=(){}?]/.test(trimmed))
+        return true;
+    // 白名单: 算术表达式在赋值/返回中
+    if (/[+\-*/%]/.test(trimmed) && /[=()]/.test(trimmed))
+        return true;
+    return false;
+}
 /**
  * 变异测试防造假 — 通过对源码模拟变异，检查测试的断言是否精确到能检测变异。
- * 策略: 从源码中提取含关键逻辑的行，执行变异，检查测试中是否有断言针对这些逻辑的精确值。
+ * 策略: 从源码中提取白名单关键逻辑行（AST 级别过滤），执行变异，
+ * 检查测试中是否有断言针对这些逻辑的精确值。
  * 若测试只含模糊断言（如 toBeTruthy），判定为可能存在"自己证明自己"问题。
  */
+/** 伪随机数生成器 (基于种子，确保可复现且不由 AI 控制) */
+function seededRandom(seed) {
+    let s = seed;
+    return () => {
+        s = (s * 1103515245 + 12345) & 0x7fffffff;
+        return s / 0x7fffffff;
+    };
+}
 function checkMutationResistance(testContent, sourceContent) {
-    // 提取源码中的关键逻辑行（含比较运算、返回值、布尔值）
-    const keyLines = sourceContent.split("\n").filter((line) => {
-        const trimmed = line.trim();
-        return trimmed.length > 0
-            && !trimmed.startsWith("//")
-            && !trimmed.startsWith("import ")
-            && !trimmed.startsWith("export ")
-            && (/===|!==|>=|<=|>|<|return|true|false/.test(trimmed));
-    });
-    if (keyLines.length === 0) {
+    // 提取白名单关键逻辑行（AST 级别过滤，跳过 console.log 等无副作用代码）
+    const allKeyLines = sourceContent.split("\n").filter(isMutationCandidate);
+    if (allKeyLines.length === 0) {
         return {
             dimension: "scenario_coverage",
             passed: true,
             detail: "无可变异的关键逻辑行，跳过变异测试",
         };
     }
+    // 强制随机抽取: 使用源码哈希作为种子，确保可复现但不由 AI 选择位置
+    // 从所有关键行中随机抽取 min(行数, 8) 行进行变异，防止 AI 避开弱点行
+    const seed = sourceContent.split("").reduce((acc, ch) => acc + ch.charCodeAt(0), 0);
+    const rng = seededRandom(seed);
+    const sampleSize = Math.min(allKeyLines.length, 8);
+    const keyLines = seededSample(allKeyLines, sampleSize, rng);
     // 检查测试中的断言精确度
     const preciseAssertions = testContent.match(/\bexpect\s*\([^)]*\)\s*\.\s*(toBe|toEqual|toStrictEqual|toBeLessThan|toBeGreaterThan|toThrow|toThrowError)/g) ?? [];
     const looseAssertions = testContent.match(/\bexpect\s*\([^)]*\)\s*\.\s*(toBeTruthy|toBeFalsy|toBeDefined|toBeUndefined|toBeDefined)/g) ?? [];
-    // 变异可检测性评估: 精确断言/总断言 比率
     const totalAssertions = preciseAssertions.length + looseAssertions.length;
     if (totalAssertions === 0) {
         return {
@@ -376,38 +443,183 @@ function checkMutationResistance(testContent, sourceContent) {
         };
     }
     const precisionRatio = preciseAssertions.length / totalAssertions;
-    // 抽样执行变异操作，检查是否有对应检测能力
+    // 对随机抽取的行执行变异操作，检查是否有对应检测能力
     let mutationsApplied = 0;
     let mutationsUndetected = 0;
-    for (const keyLine of keyLines.slice(0, 5)) {
-        for (const mut of MUTATION_OPERATORS) {
+    for (const keyLine of keyLines) {
+        // 每行随机选一个能产生有效变异的操作符（防止 AI 预测哪个操作符会被选中）
+        const shuffledOps = seededSample([...MUTATION_OPERATORS], MUTATION_OPERATORS.length, rng);
+        for (const mut of shuffledOps) {
             const mutated = mut.mutate(keyLine);
             if (mutated !== keyLine) {
                 mutationsApplied++;
-                // 简化检测: 如果测试中存在针对被变异值的精确断言，认为可检测
                 const mutatedValues = mutated.match(/(!==|===|<=|>=|>|<|\b\d+\b|true|false)/g) ?? [];
                 const hasDetection = mutatedValues.some((v) => testContent.includes(v));
                 if (!hasDetection) {
                     mutationsUndetected++;
                 }
+                // 每行最多应用 1 个变异操作符（随机化后无需覆盖全部）
+                break;
+            }
+        }
+    }
+    const passThreshold = MUTATION_CONFIG.precision_threshold;
+    const precisionOk = precisionRatio >= passThreshold;
+    const detectionOk = mutationsApplied === 0 || (mutationsUndetected / mutationsApplied) < passThreshold;
+    if (precisionOk && detectionOk) {
+        return {
+            dimension: "scenario_coverage",
+            passed: true,
+            detail: `变异测试通过（随机抽样 ${keyLines.length} 行）— 精确断言率 ${(precisionRatio * 100).toFixed(0)}%，${mutationsApplied} 次变异中 ${mutationsApplied - mutationsUndetected} 次可检测`,
+        };
+    }
+    return {
+        dimension: "scenario_coverage",
+        passed: false,
+        detail: `变异测试未通过（随机抽样 ${keyLines.length} 行）— 精确断言率 ${(precisionRatio * 100).toFixed(0)}%（阈值 50%），${mutationsApplied} 次变异中 ${mutationsUndetected} 次不可检测。测试可能存在"自己证明自己"问题`,
+    };
+}
+/** 基于 RNG 的随机抽样（Fisher-Yates 部分洗牌）*/
+function seededSample(arr, count, rng) {
+    const result = [...arr];
+    const n = Math.min(count, result.length);
+    for (let i = 0; i < n; i++) {
+        const j = i + Math.floor(rng() * (result.length - i));
+        [result[i], result[j]] = [result[j], result[i]];
+    }
+    return result.slice(0, n);
+}
+/**
+ * 解析 lcov.info 报告，提取每个文件的已覆盖行号。
+ * lcov 格式:
+ *   SF:path/to/file.ts
+ *   DA:10,1
+ *   DA:25,0
+ *   end_of_record
+ * DA 行中第二个字段 > 0 表示该行被执行过（已覆盖）。
+ * @param lcovContent - lcov.info 文件内容
+ * @returns 覆盖率映射（文件路径 → 已覆盖行号集合）
+ */
+export function parseLcov(lcovContent) {
+    const map = new Map();
+    let currentFile = "";
+    for (const line of lcovContent.split("\n")) {
+        const sfMatch = line.match(/^SF:(.+)$/);
+        if (sfMatch) {
+            currentFile = sfMatch[1];
+            continue;
+        }
+        const daMatch = line.match(/^DA:(\d+),(\d+)/);
+        if (daMatch && currentFile) {
+            const lineNum = parseInt(daMatch[1], 10);
+            const hitCount = parseInt(daMatch[2], 10);
+            if (hitCount > 0) {
+                if (!map.has(currentFile))
+                    map.set(currentFile, new Set());
+                map.get(currentFile).add(lineNum);
+            }
+        }
+        if (line === "end_of_record") {
+            currentFile = "";
+        }
+    }
+    return map;
+}
+/**
+ * 带覆盖率联动的变异测试 — 只变异被测试覆盖的代码行。
+ * 若变异了未覆盖行，该变异无法被测试检测到，审计结果无效。
+ * @param testContent - 测试文件内容
+ * @param sourceContent - 被测源码内容
+ * @param coverageMap - 可选的覆盖率映射（文件 → 已覆盖行号），无则退化为全行变异
+ * @param sourceFilePath - 源码文件路径，用于在 coverageMap 中查找覆盖行
+ */
+function checkMutationResistanceWithCoverage(testContent, sourceContent, coverageMap, sourceFilePath) {
+    const sourceLines = sourceContent.split("\n");
+    const coveredLineNumbers = (sourceFilePath && coverageMap) ? coverageMap.get(sourceFilePath) : undefined;
+    // 提取白名单关键逻辑行，并记录行号
+    const candidates = [];
+    for (let i = 0; i < sourceLines.length; i++) {
+        if (isMutationCandidate(sourceLines[i])) {
+            candidates.push({ line: sourceLines[i], lineNum: i + 1 });
+        }
+    }
+    if (candidates.length === 0) {
+        return {
+            dimension: "scenario_coverage",
+            passed: true,
+            detail: "无可变异的关键逻辑行，跳过变异测试",
+        };
+    }
+    // 覆盖率过滤: 只保留被测试覆盖的行
+    let filteredCandidates = candidates;
+    const hasCoverageData = coverageMap !== undefined && sourceFilePath !== undefined;
+    if (hasCoverageData) {
+        const covered = coveredLineNumbers ?? new Set();
+        const beforeCount = candidates.length;
+        if (covered.size === 0) {
+            return {
+                dimension: "scenario_coverage",
+                passed: false,
+                detail: `变异审计无效: ${beforeCount} 个可变异行均未被测试覆盖（覆盖率联动）`,
+            };
+        }
+        filteredCandidates = candidates.filter((c) => covered.has(c.lineNum));
+        if (filteredCandidates.length === 0) {
+            return {
+                dimension: "scenario_coverage",
+                passed: false,
+                detail: `变异审计无效: ${beforeCount} 个可变异行均未被测试覆盖（覆盖率联动）`,
+            };
+        }
+    }
+    // 随机抽样
+    const seed = sourceContent.split("").reduce((acc, ch) => acc + ch.charCodeAt(0), 0);
+    const rng = seededRandom(seed);
+    const sampleSize = Math.min(filteredCandidates.length, 8);
+    const keyLines = seededSample(filteredCandidates, sampleSize, rng);
+    // 断言精确度检查 — 使用宽松正则以支持嵌套括号如 expect(fn(a, b))
+    const preciseAssertions = testContent.match(/\bexpect\b.*?\.(toBe|toEqual|toStrictEqual|toBeLessThan|toBeGreaterThan|toThrow|toThrowError)\s*\(/g) ?? [];
+    const looseAssertions = testContent.match(/\bexpect\b.*?\.(toBeTruthy|toBeFalsy|toBeDefined|toBeUndefined)\s*\(/g) ?? [];
+    const totalAssertions = preciseAssertions.length + looseAssertions.length;
+    if (totalAssertions === 0) {
+        return {
+            dimension: "scenario_coverage",
+            passed: false,
+            detail: "无断言，无法检测源码变异（变异测试防造假失败）",
+        };
+    }
+    const precisionRatio = preciseAssertions.length / totalAssertions;
+    let mutationsApplied = 0;
+    let mutationsUndetected = 0;
+    for (const item of keyLines) {
+        const shuffledOps = seededSample([...MUTATION_OPERATORS], MUTATION_OPERATORS.length, rng);
+        for (const mut of shuffledOps) {
+            const mutated = mut.mutate(item.line);
+            if (mutated !== item.line) {
+                mutationsApplied++;
+                const mutatedValues = mutated.match(/(!==|===|<=|>=|>|<|\b\d+\b|true|false)/g) ?? [];
+                const hasDetection = mutatedValues.some((v) => testContent.includes(v));
+                if (!hasDetection)
+                    mutationsUndetected++;
+                break;
             }
         }
     }
-    // 综合评估: 精确断言率 > 50% 且 不可检测变异 < 50%
-    const passThreshold = 0.5;
+    const passThreshold = MUTATION_CONFIG.precision_threshold;
     const precisionOk = precisionRatio >= passThreshold;
     const detectionOk = mutationsApplied === 0 || (mutationsUndetected / mutationsApplied) < passThreshold;
+    const coverageNote = hasCoverageData ? `（覆盖率联动: ${filteredCandidates.length}/${candidates.length} 可变异行已被覆盖）` : "";
     if (precisionOk && detectionOk) {
         return {
             dimension: "scenario_coverage",
             passed: true,
-            detail: `变异测试通过 — 精确断言率 ${(precisionRatio * 100).toFixed(0)}%，${mutationsApplied} 次变异中 ${mutationsApplied - mutationsUndetected} 次可检测`,
+            detail: `变异测试通过（随机抽样 ${keyLines.length} 行${coverageNote}）— 精确断言率 ${(precisionRatio * 100).toFixed(0)}%，${mutationsApplied} 次变异中 ${mutationsApplied - mutationsUndetected} 次可检测`,
         };
     }
     return {
         dimension: "scenario_coverage",
         passed: false,
-        detail: `变异测试未通过 — 精确断言率 ${(precisionRatio * 100).toFixed(0)}%（阈值 50%），${mutationsApplied} 次变异中 ${mutationsUndetected} 次不可检测。测试可能存在"自己证明自己"问题`,
+        detail: `变异测试未通过（随机抽样 ${keyLines.length} 行${coverageNote}）— 精确断言率 ${(precisionRatio * 100).toFixed(0)}%（阈值 50%），${mutationsApplied} 次变异中 ${mutationsUndetected} 次不可检测。测试可能存在"自己证明自己"问题`,
     };
 }
 //# sourceMappingURL=test_quality.js.map