|
| 1 | +import type { CodeChunk, CodebaseHealthArtifact, CodebaseHealthFile } from '../types/index.js'; |
| 2 | +import { InternalFileGraph } from '../utils/usage-tracker.js'; |
| 3 | + |
| 4 | +interface DeriveCodebaseHealthParams { |
| 5 | + buildId: string; |
| 6 | + formatVersion: number; |
| 7 | + generatedAt: string; |
| 8 | + chunks: CodeChunk[]; |
| 9 | + graph: InternalFileGraph; |
| 10 | +} |
| 11 | + |
| 12 | +interface FileMetrics { |
| 13 | + importCount: number; |
| 14 | + importerCount: number; |
| 15 | + cycleCount: number; |
| 16 | + maxCyclomaticComplexity: number; |
| 17 | + hotspotRank?: number; |
| 18 | +} |
| 19 | + |
| 20 | +type FileMetricsMap = Map<string, FileMetrics>; |
| 21 | + |
| 22 | +function normalizePathLike(filePath: string): string { |
| 23 | + return filePath.replace(/\\/g, '/').replace(/^\.\//, ''); |
| 24 | +} |
| 25 | + |
| 26 | +function collectFileMetrics(chunks: CodeChunk[], graph: InternalFileGraph): FileMetricsMap { |
| 27 | + const metrics = new Map<string, FileMetrics>(); |
| 28 | + const graphJson = graph.toJSON(); |
| 29 | + const reverseImports = new Map<string, Set<string>>(); |
| 30 | + |
| 31 | + for (const [file, deps] of Object.entries(graphJson.imports)) { |
| 32 | + const normalizedFile = normalizePathLike(file); |
| 33 | + const fileMetrics = metrics.get(normalizedFile) ?? { |
| 34 | + importCount: 0, |
| 35 | + importerCount: 0, |
| 36 | + cycleCount: 0, |
| 37 | + maxCyclomaticComplexity: 0 |
| 38 | + }; |
| 39 | + fileMetrics.importCount = deps.length; |
| 40 | + metrics.set(normalizedFile, fileMetrics); |
| 41 | + |
| 42 | + for (const dependency of deps) { |
| 43 | + const normalizedDependency = normalizePathLike(dependency); |
| 44 | + const importers = reverseImports.get(normalizedDependency) ?? new Set<string>(); |
| 45 | + importers.add(normalizedFile); |
| 46 | + reverseImports.set(normalizedDependency, importers); |
| 47 | + } |
| 48 | + } |
| 49 | + |
| 50 | + for (const [file, importers] of reverseImports.entries()) { |
| 51 | + const fileMetrics = metrics.get(file) ?? { |
| 52 | + importCount: 0, |
| 53 | + importerCount: 0, |
| 54 | + cycleCount: 0, |
| 55 | + maxCyclomaticComplexity: 0 |
| 56 | + }; |
| 57 | + fileMetrics.importerCount = importers.size; |
| 58 | + metrics.set(file, fileMetrics); |
| 59 | + } |
| 60 | + |
| 61 | + for (const chunk of chunks) { |
| 62 | + const file = normalizePathLike(chunk.relativePath || chunk.filePath); |
| 63 | + const fileMetrics = metrics.get(file) ?? { |
| 64 | + importCount: 0, |
| 65 | + importerCount: 0, |
| 66 | + cycleCount: 0, |
| 67 | + maxCyclomaticComplexity: 0 |
| 68 | + }; |
| 69 | + const chunkComplexity = |
| 70 | + typeof chunk.metadata?.cyclomaticComplexity === 'number' |
| 71 | + ? chunk.metadata.cyclomaticComplexity |
| 72 | + : typeof chunk.metadata?.complexity === 'number' |
| 73 | + ? chunk.metadata.complexity |
| 74 | + : 0; |
| 75 | + fileMetrics.maxCyclomaticComplexity = Math.max( |
| 76 | + fileMetrics.maxCyclomaticComplexity, |
| 77 | + chunkComplexity |
| 78 | + ); |
| 79 | + metrics.set(file, fileMetrics); |
| 80 | + } |
| 81 | + |
| 82 | + const hotspotRanks = Array.from(metrics.entries()) |
| 83 | + .map(([file, fileMetrics]) => ({ |
| 84 | + file, |
| 85 | + combined: fileMetrics.importCount + fileMetrics.importerCount |
| 86 | + })) |
| 87 | + .filter((entry) => entry.combined > 0) |
| 88 | + .sort((a, b) => b.combined - a.combined || a.file.localeCompare(b.file)); |
| 89 | + |
| 90 | + hotspotRanks.forEach((entry, index) => { |
| 91 | + const fileMetrics = metrics.get(entry.file); |
| 92 | + if (fileMetrics) { |
| 93 | + fileMetrics.hotspotRank = index + 1; |
| 94 | + } |
| 95 | + }); |
| 96 | + |
| 97 | + for (const cycle of graph.findCycles()) { |
| 98 | + for (const file of cycle.files.slice(0, -1)) { |
| 99 | + const normalizedFile = normalizePathLike(file); |
| 100 | + const fileMetrics = metrics.get(normalizedFile) ?? { |
| 101 | + importCount: 0, |
| 102 | + importerCount: 0, |
| 103 | + cycleCount: 0, |
| 104 | + maxCyclomaticComplexity: 0 |
| 105 | + }; |
| 106 | + fileMetrics.cycleCount += 1; |
| 107 | + metrics.set(normalizedFile, fileMetrics); |
| 108 | + } |
| 109 | + } |
| 110 | + |
| 111 | + return metrics; |
| 112 | +} |
| 113 | + |
| 114 | +function getHealthLevel(fileMetrics: FileMetrics): CodebaseHealthFile { |
| 115 | + const reasons: string[] = []; |
| 116 | + let score = 0; |
| 117 | + |
| 118 | + if (fileMetrics.cycleCount > 0) { |
| 119 | + score += 3; |
| 120 | + reasons.push( |
| 121 | + `Participates in ${fileMetrics.cycleCount} circular dependenc${fileMetrics.cycleCount === 1 ? 'y' : 'ies'}` |
| 122 | + ); |
| 123 | + } |
| 124 | + |
| 125 | + if (fileMetrics.importerCount >= 8) { |
| 126 | + score += 2; |
| 127 | + reasons.push(`High fan-in: ${fileMetrics.importerCount} files depend on it`); |
| 128 | + } else if (fileMetrics.importerCount >= 4) { |
| 129 | + score += 1; |
| 130 | + reasons.push(`Shared dependency for ${fileMetrics.importerCount} files`); |
| 131 | + } |
| 132 | + |
| 133 | + if (fileMetrics.hotspotRank && fileMetrics.hotspotRank <= 5) { |
| 134 | + score += 2; |
| 135 | + reasons.push(`Hotspot rank #${fileMetrics.hotspotRank} by graph centrality`); |
| 136 | + } else if (fileMetrics.hotspotRank && fileMetrics.hotspotRank <= 10) { |
| 137 | + score += 1; |
| 138 | + reasons.push('Top-10 hotspot by graph centrality'); |
| 139 | + } |
| 140 | + |
| 141 | + if (fileMetrics.maxCyclomaticComplexity >= 18) { |
| 142 | + score += 2; |
| 143 | + reasons.push(`Complex implementation (cyclomatic ${fileMetrics.maxCyclomaticComplexity})`); |
| 144 | + } else if (fileMetrics.maxCyclomaticComplexity >= 10) { |
| 145 | + score += 1; |
| 146 | + reasons.push(`Moderate code complexity (cyclomatic ${fileMetrics.maxCyclomaticComplexity})`); |
| 147 | + } |
| 148 | + |
| 149 | + const level = score >= 4 ? 'high' : score >= 2 ? 'medium' : ('low' as const); |
| 150 | + |
| 151 | + return { |
| 152 | + file: '', |
| 153 | + level, |
| 154 | + score, |
| 155 | + reasons: reasons.slice(0, 3), |
| 156 | + signals: { |
| 157 | + ...(fileMetrics.hotspotRank ? { hotspotRank: fileMetrics.hotspotRank } : {}), |
| 158 | + ...(fileMetrics.importerCount > 0 ? { importerCount: fileMetrics.importerCount } : {}), |
| 159 | + ...(fileMetrics.importCount > 0 ? { importCount: fileMetrics.importCount } : {}), |
| 160 | + ...(fileMetrics.cycleCount > 0 ? { cycleCount: fileMetrics.cycleCount } : {}), |
| 161 | + ...(fileMetrics.maxCyclomaticComplexity > 0 |
| 162 | + ? { maxCyclomaticComplexity: fileMetrics.maxCyclomaticComplexity } |
| 163 | + : {}) |
| 164 | + } |
| 165 | + }; |
| 166 | +} |
| 167 | + |
| 168 | +export function deriveCodebaseHealth({ |
| 169 | + buildId, |
| 170 | + formatVersion, |
| 171 | + generatedAt, |
| 172 | + chunks, |
| 173 | + graph |
| 174 | +}: DeriveCodebaseHealthParams): CodebaseHealthArtifact { |
| 175 | + const fileMetrics = collectFileMetrics(chunks, graph); |
| 176 | + const files = Array.from(fileMetrics.entries()) |
| 177 | + .map(([file, metrics]) => { |
| 178 | + const health = getHealthLevel(metrics); |
| 179 | + return { |
| 180 | + ...health, |
| 181 | + file |
| 182 | + }; |
| 183 | + }) |
| 184 | + .sort((a, b) => { |
| 185 | + const priority = { high: 0, medium: 1, low: 2 }; |
| 186 | + const levelDelta = priority[a.level] - priority[b.level]; |
| 187 | + if (levelDelta !== 0) return levelDelta; |
| 188 | + if (b.score !== a.score) return b.score - a.score; |
| 189 | + return a.file.localeCompare(b.file); |
| 190 | + }); |
| 191 | + |
| 192 | + const highRiskFiles = files.filter((file) => file.level === 'high').length; |
| 193 | + const mediumRiskFiles = files.filter((file) => file.level === 'medium').length; |
| 194 | + const lowRiskFiles = files.length - highRiskFiles - mediumRiskFiles; |
| 195 | + |
| 196 | + return { |
| 197 | + header: { buildId, formatVersion }, |
| 198 | + generatedAt, |
| 199 | + summary: { |
| 200 | + files: files.length, |
| 201 | + highRiskFiles, |
| 202 | + mediumRiskFiles, |
| 203 | + lowRiskFiles |
| 204 | + }, |
| 205 | + files |
| 206 | + }; |
| 207 | +} |
0 commit comments