audit-tools 0.55.13 → 0.55.15
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +1 -1
- package/dist/audit/cli/auditStep.d.ts.map +1 -1
- package/dist/audit/cli/auditStep.js +5 -2
- package/dist/audit/cli/auditStep.js.map +1 -1
- package/dist/audit/cli/cleanup.d.ts +1 -0
- package/dist/audit/cli/cleanup.d.ts.map +1 -1
- package/dist/audit/cli/cleanup.js +1 -1
- package/dist/audit/cli/cleanup.js.map +1 -1
- package/dist/audit/cli/cleanupCommand.d.ts.map +1 -1
- package/dist/audit/cli/cleanupCommand.js +3 -2
- package/dist/audit/cli/cleanupCommand.js.map +1 -1
- package/dist/audit/cli/confirmIntentStep.d.ts.map +1 -1
- package/dist/audit/cli/confirmIntentStep.js +25 -11
- package/dist/audit/cli/confirmIntentStep.js.map +1 -1
- package/dist/audit/cli/dispatch/hostHandoff.d.ts.map +1 -1
- package/dist/audit/cli/dispatch/hostHandoff.js +5 -2
- package/dist/audit/cli/dispatch/hostHandoff.js.map +1 -1
- package/dist/audit/cli/functionalPreflight.d.ts.map +1 -1
- package/dist/audit/cli/functionalPreflight.js +5 -1
- package/dist/audit/cli/functionalPreflight.js.map +1 -1
- package/dist/audit/cli/nextStepCommand.d.ts.map +1 -1
- package/dist/audit/cli/nextStepCommand.js +6 -4
- package/dist/audit/cli/nextStepCommand.js.map +1 -1
- package/dist/audit/cli/nextStepHelpers.js +18 -5
- package/dist/audit/cli/nextStepHelpers.js.map +1 -1
- package/dist/audit/cli/prompts.d.ts.map +1 -1
- package/dist/audit/cli/prompts.js +9 -2
- package/dist/audit/cli/prompts.js.map +1 -1
- package/dist/audit/extractors/analyzers/complexityDuplication.d.ts +50 -10
- package/dist/audit/extractors/analyzers/complexityDuplication.d.ts.map +1 -1
- package/dist/audit/extractors/analyzers/complexityDuplication.js +178 -28
- package/dist/audit/extractors/analyzers/complexityDuplication.js.map +1 -1
- package/dist/audit/extractors/analyzers/treeSitter.d.ts +2 -0
- package/dist/audit/extractors/analyzers/treeSitter.d.ts.map +1 -1
- package/dist/audit/extractors/analyzers/treeSitter.js +7 -1
- package/dist/audit/extractors/analyzers/treeSitter.js.map +1 -1
- package/dist/audit/extractors/analyzers/treeSitterBatch.d.ts.map +1 -1
- package/dist/audit/extractors/analyzers/treeSitterBatch.js +30 -20
- package/dist/audit/extractors/analyzers/treeSitterBatch.js.map +1 -1
- package/dist/audit/extractors/designAssessment.d.ts.map +1 -1
- package/dist/audit/extractors/designAssessment.js +186 -143
- package/dist/audit/extractors/designAssessment.js.map +1 -1
- package/dist/audit/extractors/docsDigest.d.ts.map +1 -1
- package/dist/audit/extractors/docsDigest.js +6 -0
- package/dist/audit/extractors/docsDigest.js.map +1 -1
- package/dist/audit/extractors/flows.d.ts +9 -5
- package/dist/audit/extractors/flows.d.ts.map +1 -1
- package/dist/audit/extractors/flows.js +59 -9
- package/dist/audit/extractors/flows.js.map +1 -1
- package/dist/audit/extractors/fsIntake.d.ts +1 -0
- package/dist/audit/extractors/fsIntake.d.ts.map +1 -1
- package/dist/audit/extractors/fsIntake.js +5 -3
- package/dist/audit/extractors/fsIntake.js.map +1 -1
- package/dist/audit/extractors/graph.d.ts +8 -1
- package/dist/audit/extractors/graph.d.ts.map +1 -1
- package/dist/audit/extractors/graph.js +16 -6
- package/dist/audit/extractors/graph.js.map +1 -1
- package/dist/audit/extractors/graphSignals.d.ts +1 -1
- package/dist/audit/extractors/graphSignals.d.ts.map +1 -1
- package/dist/audit/extractors/pathPatterns.d.ts +5 -0
- package/dist/audit/extractors/pathPatterns.d.ts.map +1 -1
- package/dist/audit/extractors/pathPatterns.js +53 -3
- package/dist/audit/extractors/pathPatterns.js.map +1 -1
- package/dist/audit/extractors/risk.d.ts.map +1 -1
- package/dist/audit/extractors/risk.js +3 -6
- package/dist/audit/extractors/risk.js.map +1 -1
- package/dist/audit/io/rollover.d.ts +1 -1
- package/dist/audit/io/rollover.d.ts.map +1 -1
- package/dist/audit/io/rollover.js +2 -2
- package/dist/audit/io/rollover.js.map +1 -1
- package/dist/audit/io/runSnapshot.d.ts +2 -2
- package/dist/audit/io/runSnapshot.d.ts.map +1 -1
- package/dist/audit/io/runSnapshot.js +148 -15
- package/dist/audit/io/runSnapshot.js.map +1 -1
- package/dist/audit/orchestrator/artifactMetadata.d.ts.map +1 -1
- package/dist/audit/orchestrator/artifactMetadata.js +7 -0
- package/dist/audit/orchestrator/artifactMetadata.js.map +1 -1
- package/dist/audit/orchestrator/autoFixExecutor.js +3 -3
- package/dist/audit/orchestrator/autoFixExecutor.js.map +1 -1
- package/dist/audit/orchestrator/coverageElementBaseline.d.ts +1 -1
- package/dist/audit/orchestrator/coverageElementBaseline.d.ts.map +1 -1
- package/dist/audit/orchestrator/coverageElementBaseline.js +8 -10
- package/dist/audit/orchestrator/coverageElementBaseline.js.map +1 -1
- package/dist/audit/orchestrator/dependencyMap.d.ts.map +1 -1
- package/dist/audit/orchestrator/dependencyMap.js +5 -0
- package/dist/audit/orchestrator/dependencyMap.js.map +1 -1
- package/dist/audit/orchestrator/dependencySlices.d.ts.map +1 -1
- package/dist/audit/orchestrator/dependencySlices.js +2 -3
- package/dist/audit/orchestrator/dependencySlices.js.map +1 -1
- package/dist/audit/orchestrator/designReviewPrompt.d.ts.map +1 -1
- package/dist/audit/orchestrator/designReviewPrompt.js +69 -3
- package/dist/audit/orchestrator/designReviewPrompt.js.map +1 -1
- package/dist/audit/orchestrator/ingestionExecutors.d.ts.map +1 -1
- package/dist/audit/orchestrator/ingestionExecutors.js +8 -4
- package/dist/audit/orchestrator/ingestionExecutors.js.map +1 -1
- package/dist/audit/orchestrator/intentCheckpointExecutor.d.ts.map +1 -1
- package/dist/audit/orchestrator/intentCheckpointExecutor.js +40 -22
- package/dist/audit/orchestrator/intentCheckpointExecutor.js.map +1 -1
- package/dist/audit/orchestrator/intentScopeDisposition.d.ts +5 -5
- package/dist/audit/orchestrator/intentScopeDisposition.d.ts.map +1 -1
- package/dist/audit/orchestrator/intentScopeDisposition.js +7 -6
- package/dist/audit/orchestrator/intentScopeDisposition.js.map +1 -1
- package/dist/audit/orchestrator/planningExecutors.d.ts.map +1 -1
- package/dist/audit/orchestrator/planningExecutors.js +6 -7
- package/dist/audit/orchestrator/planningExecutors.js.map +1 -1
- package/dist/audit/orchestrator/runtimeValidation.d.ts +7 -1
- package/dist/audit/orchestrator/runtimeValidation.d.ts.map +1 -1
- package/dist/audit/orchestrator/runtimeValidation.js +42 -3
- package/dist/audit/orchestrator/runtimeValidation.js.map +1 -1
- package/dist/audit/orchestrator/state.d.ts.map +1 -1
- package/dist/audit/orchestrator/state.js +3 -1
- package/dist/audit/orchestrator/state.js.map +1 -1
- package/dist/audit/orchestrator/structureExecutors.d.ts.map +1 -1
- package/dist/audit/orchestrator/structureExecutors.js +2 -1
- package/dist/audit/orchestrator/structureExecutors.js.map +1 -1
- package/dist/audit/orchestrator/synthesisExecutors.d.ts.map +1 -1
- package/dist/audit/orchestrator/synthesisExecutors.js +2 -1
- package/dist/audit/orchestrator/synthesisExecutors.js.map +1 -1
- package/dist/audit/reporting/mergeFindings.d.ts +2 -2
- package/dist/audit/reporting/mergeFindings.d.ts.map +1 -1
- package/dist/audit/reporting/mergeFindings.js +7 -11
- package/dist/audit/reporting/mergeFindings.js.map +1 -1
- package/dist/audit/reporting/synthesis.d.ts +3 -0
- package/dist/audit/reporting/synthesis.d.ts.map +1 -1
- package/dist/audit/reporting/synthesis.js +31 -16
- package/dist/audit/reporting/synthesis.js.map +1 -1
- package/dist/audit/types/artifactMetadata.d.ts +2 -0
- package/dist/audit/types/artifactMetadata.d.ts.map +1 -1
- package/dist/audit/validation/artifacts.d.ts.map +1 -1
- package/dist/audit/validation/artifacts.js +13 -8
- package/dist/audit/validation/artifacts.js.map +1 -1
- package/dist/remediate/intent/checkpointFilter.js +2 -2
- package/dist/remediate/intent/checkpointFilter.js.map +1 -1
- package/dist/remediate/state/runStatus.d.ts +1 -1
- package/dist/remediate/state/runStatus.js +1 -1
- package/dist/remediate/state/store.d.ts +2 -0
- package/dist/remediate/state/store.d.ts.map +1 -1
- package/dist/remediate/state/store.js +10 -7
- package/dist/remediate/state/store.js.map +1 -1
- package/dist/remediate/steps/contractPipeline.d.ts +1 -1
- package/dist/remediate/steps/contractPipeline.d.ts.map +1 -1
- package/dist/remediate/steps/contractPipeline.js +10 -3
- package/dist/remediate/steps/contractPipeline.js.map +1 -1
- package/dist/remediate/steps/dispatch/hostHandoff.d.ts +7 -0
- package/dist/remediate/steps/dispatch/hostHandoff.d.ts.map +1 -1
- package/dist/remediate/steps/dispatch/hostHandoff.js +28 -0
- package/dist/remediate/steps/dispatch/hostHandoff.js.map +1 -1
- package/dist/remediate/steps/intakeResolver.d.ts.map +1 -1
- package/dist/remediate/steps/intakeResolver.js +6 -4
- package/dist/remediate/steps/intakeResolver.js.map +1 -1
- package/dist/remediate/steps/nextStep.d.ts +2 -0
- package/dist/remediate/steps/nextStep.d.ts.map +1 -1
- package/dist/remediate/steps/nextStep.js +16 -8
- package/dist/remediate/steps/nextStep.js.map +1 -1
- package/dist/remediate/validation/artifacts.d.ts +3 -0
- package/dist/remediate/validation/artifacts.d.ts.map +1 -1
- package/dist/remediate/validation/artifacts.js +143 -3
- package/dist/remediate/validation/artifacts.js.map +1 -1
- package/dist/remediate/validation/verificationReport.d.ts.map +1 -1
- package/dist/remediate/validation/verificationReport.js +32 -15
- package/dist/remediate/validation/verificationReport.js.map +1 -1
- package/dist/shared/analyzers/acquisitionEngine.d.ts +18 -0
- package/dist/shared/analyzers/acquisitionEngine.d.ts.map +1 -1
- package/dist/shared/analyzers/acquisitionEngine.js +19 -1
- package/dist/shared/analyzers/acquisitionEngine.js.map +1 -1
- package/dist/shared/analyzers/candidates.d.ts.map +1 -1
- package/dist/shared/analyzers/candidates.js +109 -13
- package/dist/shared/analyzers/candidates.js.map +1 -1
- package/dist/shared/findingIdentitySignature.d.ts.map +1 -1
- package/dist/shared/findingIdentitySignature.js +3 -0
- package/dist/shared/findingIdentitySignature.js.map +1 -1
- package/dist/shared/git.js +2 -2
- package/dist/shared/git.js.map +1 -1
- package/dist/shared/hash.d.ts +2 -0
- package/dist/shared/hash.d.ts.map +1 -1
- package/dist/shared/hash.js +8 -0
- package/dist/shared/hash.js.map +1 -1
- package/dist/shared/index.d.ts +3 -3
- package/dist/shared/index.d.ts.map +1 -1
- package/dist/shared/index.js +2 -2
- package/dist/shared/index.js.map +1 -1
- package/dist/shared/intent/pathScope.d.ts +9 -13
- package/dist/shared/intent/pathScope.d.ts.map +1 -1
- package/dist/shared/intent/pathScope.js +16 -25
- package/dist/shared/intent/pathScope.js.map +1 -1
- package/dist/shared/io/artifactTreeHold.d.ts +2 -1
- package/dist/shared/io/artifactTreeHold.d.ts.map +1 -1
- package/dist/shared/io/artifactTreeHold.js.map +1 -1
- package/dist/shared/io/fileLock.d.ts +12 -1
- package/dist/shared/io/fileLock.d.ts.map +1 -1
- package/dist/shared/io/fileLock.js +43 -3
- package/dist/shared/io/fileLock.js.map +1 -1
- package/dist/shared/prompts.js +1 -1
- package/dist/shared/prompts.js.map +1 -1
- package/dist/shared/reporting/lensCoverage.d.ts +4 -12
- package/dist/shared/reporting/lensCoverage.d.ts.map +1 -1
- package/dist/shared/reporting/lensCoverage.js +5 -13
- package/dist/shared/reporting/lensCoverage.js.map +1 -1
- package/dist/shared/types/finding.d.ts +4 -4
- package/dist/shared/types/finding.js +4 -4
- package/dist/shared/validation/citationGrounding.d.ts.map +1 -1
- package/dist/shared/validation/citationGrounding.js +2 -39
- package/dist/shared/validation/citationGrounding.js.map +1 -1
- package/dist/shared/validation/findingGrounding.d.ts +20 -1
- package/dist/shared/validation/findingGrounding.d.ts.map +1 -1
- package/dist/shared/validation/findingGrounding.js +55 -3
- package/dist/shared/validation/findingGrounding.js.map +1 -1
- package/package.json +1 -1
|
@@ -1,6 +1,9 @@
|
|
|
1
|
+
import { getTreeSitterParser } from "./treeSitter.js";
|
|
1
2
|
/**
|
|
2
|
-
*
|
|
3
|
-
* source string
|
|
3
|
+
* Per-node structural analyzers. The compute helpers do no IO — they read only a
|
|
4
|
+
* passed-in source string and, for complexity, already-loaded tree-sitter
|
|
5
|
+
* parsers ({@link loadFunctionComplexityParsers} is the one async loader).
|
|
6
|
+
* Each helper returns a {@link NodeMetric} for js/ts source and
|
|
4
7
|
* `undefined` for everything else, so the bundle records ABSENCE (never a
|
|
5
8
|
* zero-filled metric) for non-js/ts files.
|
|
6
9
|
*/
|
|
@@ -23,26 +26,156 @@ export function isJsTsPath(path) {
|
|
|
23
26
|
return false;
|
|
24
27
|
return JS_TS_EXTENSIONS.some((extension) => lower.endsWith(extension));
|
|
25
28
|
}
|
|
26
|
-
|
|
29
|
+
/**
|
|
30
|
+
* The per-MODULE (single routine) cyclomatic limit recommended by McCabe and
|
|
31
|
+
* Watson, NIST SP 500-235 (1996): a module whose complexity EXCEEDS 10 needs
|
|
32
|
+
* justification, so a routine at exactly 10 is within the limit.
|
|
33
|
+
*/
|
|
34
|
+
const MCCABE_MODULE_LIMIT = 10;
|
|
35
|
+
/**
|
|
36
|
+
* A complexity hotspot: a routine above the McCabe limit. Only the
|
|
37
|
+
* `cyclomatic-max-function` measure is a per-routine number. The file-level proxy
|
|
38
|
+
* (`cyclomatic-approx-file`, used when no grammar gave function boundaries) sums
|
|
39
|
+
* every branch in the file, so comparing it with a per-routine limit would flag
|
|
40
|
+
* a file of many small functions; it makes no hotspot claim at all.
|
|
41
|
+
*/
|
|
42
|
+
export function isComplexityHotspot(metric) {
|
|
43
|
+
return metric.measure === "cyclomatic-max-function" && metric.value > MCCABE_MODULE_LIMIT;
|
|
44
|
+
}
|
|
45
|
+
/**
|
|
46
|
+
* A duplication signal: at least one line inside a repeated block. The block
|
|
47
|
+
* size itself ({@link CLONE_MIN_LINES}) is the cited threshold; any line the
|
|
48
|
+
* measure counts is already part of a clone.
|
|
49
|
+
*/
|
|
50
|
+
export function hasDuplicatedBlock(metric) {
|
|
51
|
+
return metric.value > 0;
|
|
52
|
+
}
|
|
53
|
+
/**
|
|
54
|
+
* Load the three js/ts grammars (`tree-sitter-wasms`, a runtime dependency). The
|
|
55
|
+
* caller owns the returned parsers and deletes them when its build ends.
|
|
56
|
+
*/
|
|
57
|
+
export async function loadFunctionComplexityParsers() {
|
|
58
|
+
const [typescript, tsx, javascript] = await Promise.all([
|
|
59
|
+
getTreeSitterParser("typescript"),
|
|
60
|
+
getTreeSitterParser("tsx"),
|
|
61
|
+
getTreeSitterParser("javascript"),
|
|
62
|
+
]);
|
|
63
|
+
return { typescript, tsx, javascript };
|
|
64
|
+
}
|
|
65
|
+
function parserFor(path, parsers) {
|
|
66
|
+
if (!parsers)
|
|
67
|
+
return undefined;
|
|
68
|
+
const lower = path.toLowerCase();
|
|
69
|
+
if (lower.endsWith(".tsx"))
|
|
70
|
+
return parsers.tsx;
|
|
71
|
+
if (lower.endsWith(".ts") || lower.endsWith(".mts") || lower.endsWith(".cts"))
|
|
72
|
+
return parsers.typescript;
|
|
73
|
+
// The javascript grammar parses JSX.
|
|
74
|
+
return parsers.javascript;
|
|
75
|
+
}
|
|
76
|
+
/**
|
|
77
|
+
* Which complexity measure a file gets under `parsers` — part of the graph
|
|
78
|
+
* edge-cache key, so a contribution built with function boundaries and one built
|
|
79
|
+
* from the file-level proxy are never replayed for each other.
|
|
80
|
+
*/
|
|
81
|
+
export function complexityScope(path, parsers) {
|
|
82
|
+
return parserFor(path, parsers) ? "function" : "file";
|
|
83
|
+
}
|
|
84
|
+
// Function-like nodes in the tree-sitter javascript / typescript / tsx grammars.
|
|
85
|
+
// Each opens its own cyclomatic count; its decisions never reach its parent.
|
|
86
|
+
const FUNCTION_NODE_TYPES = new Set([
|
|
87
|
+
"function_declaration",
|
|
88
|
+
"function_expression",
|
|
89
|
+
"function",
|
|
90
|
+
"generator_function_declaration",
|
|
91
|
+
"generator_function",
|
|
92
|
+
"arrow_function",
|
|
93
|
+
"method_definition",
|
|
94
|
+
]);
|
|
95
|
+
// One decision point each (`else if` is a nested if_statement; `for…of` and
|
|
96
|
+
// `for…in` are for_in_statement; `default:` is a switch_default, not a decision).
|
|
97
|
+
const DECISION_NODE_TYPES = new Set([
|
|
98
|
+
"if_statement",
|
|
99
|
+
"for_statement",
|
|
100
|
+
"for_in_statement",
|
|
101
|
+
"while_statement",
|
|
102
|
+
"do_statement",
|
|
103
|
+
"switch_case",
|
|
104
|
+
"catch_clause",
|
|
105
|
+
"ternary_expression",
|
|
106
|
+
]);
|
|
107
|
+
const SHORT_CIRCUIT_OPERATORS = new Set(["&&", "||", "??"]);
|
|
108
|
+
/**
|
|
109
|
+
* The highest cyclomatic number (decisions + 1) of any function in the tree;
|
|
110
|
+
* code outside every function counts as one more routine. Iterative, so a
|
|
111
|
+
* deeply nested expression cannot exhaust the call stack.
|
|
112
|
+
*/
|
|
113
|
+
function maxFunctionComplexity(root) {
|
|
114
|
+
const counters = [{ decisions: 0 }];
|
|
115
|
+
const stack = [
|
|
116
|
+
{ node: root, counter: counters[0] },
|
|
117
|
+
];
|
|
118
|
+
while (stack.length > 0) {
|
|
119
|
+
const { node, counter } = stack.pop();
|
|
120
|
+
for (const child of node.namedChildren) {
|
|
121
|
+
if (FUNCTION_NODE_TYPES.has(child.type)) {
|
|
122
|
+
const own = { decisions: 0 };
|
|
123
|
+
counters.push(own);
|
|
124
|
+
stack.push({ node: child, counter: own });
|
|
125
|
+
continue;
|
|
126
|
+
}
|
|
127
|
+
if (DECISION_NODE_TYPES.has(child.type) ||
|
|
128
|
+
(child.type === "binary_expression" &&
|
|
129
|
+
SHORT_CIRCUIT_OPERATORS.has(child.childForFieldName("operator")?.type ?? ""))) {
|
|
130
|
+
counter.decisions += 1;
|
|
131
|
+
}
|
|
132
|
+
stack.push({ node: child, counter });
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
return counters.reduce((max, c) => Math.max(max, c.decisions + 1), 1);
|
|
136
|
+
}
|
|
137
|
+
// Branch / decision keywords used by the lexical file-level proxy. Counting
|
|
27
138
|
// these (plus one base path) approximates the number of independent paths
|
|
28
|
-
// through the
|
|
29
|
-
//
|
|
30
|
-
|
|
139
|
+
// through the WHOLE file without a parse — strings, comments and `?:` optional
|
|
140
|
+
// markers included, every function summed together.
|
|
141
|
+
// `??` is matched before the bare `?` alternative so nullish-coalescing
|
|
142
|
+
// counts as ONE branch token, like `&&`/`||`, not two bare `?` matches.
|
|
143
|
+
const BRANCH_KEYWORD_PATTERN = /\b(?:if|else\s+if|for|while|case|catch|do)\b|&&|\|\||\?\?|\?(?!\.)/g;
|
|
31
144
|
/**
|
|
32
|
-
*
|
|
33
|
-
*
|
|
34
|
-
*
|
|
145
|
+
* Cyclomatic complexity of js/ts source. With a parser for the file's grammar,
|
|
146
|
+
* the highest per-function cyclomatic number (`cyclomatic-max-function`).
|
|
147
|
+
* Without one, or if the parse throws, a lexical branch count over the whole
|
|
148
|
+
* file — a FILE-LEVEL PROXY (`cyclomatic-approx-file`), which overcounts against
|
|
149
|
+
* a per-function limit. Returns `undefined` for non-js/ts source.
|
|
35
150
|
*/
|
|
36
|
-
export function computeComplexityMetric(path, source) {
|
|
151
|
+
export function computeComplexityMetric(path, source, parsers) {
|
|
37
152
|
if (!isJsTsPath(path))
|
|
38
153
|
return undefined;
|
|
154
|
+
const parser = parserFor(path, parsers);
|
|
155
|
+
if (parser) {
|
|
156
|
+
let tree;
|
|
157
|
+
try {
|
|
158
|
+
tree = parser.parse(source);
|
|
159
|
+
return {
|
|
160
|
+
value: maxFunctionComplexity(tree.rootNode),
|
|
161
|
+
measure: "cyclomatic-max-function",
|
|
162
|
+
reach: "js-ts-effective",
|
|
163
|
+
};
|
|
164
|
+
}
|
|
165
|
+
catch {
|
|
166
|
+
// Fall through to the file-level proxy: a parse failure must not drop the metric.
|
|
167
|
+
}
|
|
168
|
+
finally {
|
|
169
|
+
tree?.delete();
|
|
170
|
+
}
|
|
171
|
+
}
|
|
39
172
|
BRANCH_KEYWORD_PATTERN.lastIndex = 0;
|
|
40
173
|
let branches = 0;
|
|
41
174
|
while (BRANCH_KEYWORD_PATTERN.exec(source) !== null)
|
|
42
175
|
branches += 1;
|
|
43
176
|
return {
|
|
44
177
|
value: branches + 1,
|
|
45
|
-
measure: "cyclomatic-approx",
|
|
178
|
+
measure: "cyclomatic-approx-file",
|
|
46
179
|
reach: "js-ts-effective",
|
|
47
180
|
};
|
|
48
181
|
}
|
|
@@ -55,30 +188,47 @@ function normalizeLine(line) {
|
|
|
55
188
|
return line.trim().replace(/\s+/g, " ");
|
|
56
189
|
}
|
|
57
190
|
/**
|
|
58
|
-
*
|
|
59
|
-
*
|
|
60
|
-
*
|
|
61
|
-
*
|
|
62
|
-
*
|
|
191
|
+
* Smallest run of consecutive lines that counts as a clone: jscpd's documented
|
|
192
|
+
* default minimum clone size (its `--min-lines` option, 5). A repeated single
|
|
193
|
+
* LINE is not duplicated code — every
|
|
194
|
+
* file repeats `});`, `/**`, `try {` — and counting lines flagged 1147 of 1285
|
|
195
|
+
* js/ts files on this repository's own dogfood audit (2026-11-04).
|
|
196
|
+
*/
|
|
197
|
+
const CLONE_MIN_LINES = 5;
|
|
198
|
+
/**
|
|
199
|
+
* Duplication measure: the number of non-trivial source lines that lie inside a
|
|
200
|
+
* repeated block — a run of {@link CLONE_MIN_LINES} consecutive lines whose
|
|
201
|
+
* content already appeared earlier in the file, not overlapping that earlier
|
|
202
|
+
* copy (the first copy is the original and is not counted). Lines are
|
|
203
|
+
* normalized (trimmed + whitespace collapsed); blank lines and lines shorter
|
|
204
|
+
* than 3 chars are skipped before blocks are formed. Tagged
|
|
205
|
+
* `duplicate-block-lines`. Returns `undefined` for non-js/ts source.
|
|
63
206
|
*/
|
|
64
207
|
export function computeDuplicationMetric(path, source) {
|
|
65
208
|
if (!isJsTsPath(path))
|
|
66
209
|
return undefined;
|
|
67
|
-
const
|
|
210
|
+
const lines = [];
|
|
68
211
|
for (const rawLine of source.split(/\r?\n/)) {
|
|
69
212
|
const normalized = normalizeLine(rawLine);
|
|
70
|
-
if (normalized.length
|
|
71
|
-
|
|
72
|
-
counts.set(normalized, (counts.get(normalized) ?? 0) + 1);
|
|
213
|
+
if (normalized.length >= 3)
|
|
214
|
+
lines.push(normalized);
|
|
73
215
|
}
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
216
|
+
const firstStart = new Map();
|
|
217
|
+
const duplicated = new Set();
|
|
218
|
+
for (let start = 0; start + CLONE_MIN_LINES <= lines.length; start += 1) {
|
|
219
|
+
const block = lines.slice(start, start + CLONE_MIN_LINES).join("\n");
|
|
220
|
+
const earlier = firstStart.get(block);
|
|
221
|
+
if (earlier === undefined) {
|
|
222
|
+
firstStart.set(block, start);
|
|
223
|
+
}
|
|
224
|
+
else if (earlier + CLONE_MIN_LINES <= start) {
|
|
225
|
+
for (let line = start; line < start + CLONE_MIN_LINES; line += 1)
|
|
226
|
+
duplicated.add(line);
|
|
227
|
+
}
|
|
78
228
|
}
|
|
79
229
|
return {
|
|
80
|
-
value: duplicated,
|
|
81
|
-
measure: "duplicate-
|
|
230
|
+
value: duplicated.size,
|
|
231
|
+
measure: "duplicate-block-lines",
|
|
82
232
|
reach: "js-ts-effective",
|
|
83
233
|
};
|
|
84
234
|
}
|
|
@@ -87,10 +237,10 @@ export function computeDuplicationMetric(path, source) {
|
|
|
87
237
|
* (so the caller records no entry at all). For js/ts, always returns both a
|
|
88
238
|
* complexity and a duplication metric.
|
|
89
239
|
*/
|
|
90
|
-
export function computeNodeMetricsForFile(path, source) {
|
|
240
|
+
export function computeNodeMetricsForFile(path, source, parsers) {
|
|
91
241
|
if (!isJsTsPath(path))
|
|
92
242
|
return undefined;
|
|
93
|
-
const complexity = computeComplexityMetric(path, source);
|
|
243
|
+
const complexity = computeComplexityMetric(path, source, parsers);
|
|
94
244
|
const duplication = computeDuplicationMetric(path, source);
|
|
95
245
|
const entry = {};
|
|
96
246
|
if (complexity)
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"complexityDuplication.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AAEA
|
|
1
|
+
{"version":3,"file":"complexityDuplication.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,mBAAmB,EAA2C,MAAM,iBAAiB,CAAC;AAE/F;;;;;;;GAOG;AAEH,MAAM,gBAAgB,GAAG;IACvB,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;CACP,CAAC;AAEF,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,0EAA0E;IAC1E,uDAAuD;IACvD,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AACzE,CAAC;AAED;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAA6C;IAC/E,OAAO,MAAM,CAAC,OAAO,KAAK,yBAAyB,IAAI,MAAM,CAAC,KAAK,GAAG,mBAAmB,CAAC;AAC5F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAiC;IAClE,OAAO,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;AAC1B,CAAC;AAaD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,6BAA6B;IACjD,MAAM,CAAC,UAAU,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACtD,mBAAmB,CAAC,YAAY,CAAC;QACjC,mBAAmB,CAAC,KAAK,CAAC;QAC1B,mBAAmB,CAAC,YAAY,CAAC;KAClC,CAAC,CAAC;IACH,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAED,SAAS,SAAS,CAAC,IAAY,EAAE,OAA8C;IAC7E,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,GAAG,CAAC;IAC/C,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACzG,qCAAqC;IACrC,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,OAA8C;IAC1F,OAAO,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;AACxD,CAAC;AAED,iFAAiF;AACjF,6EAA6E;AAC7E,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,sBAAsB;IACtB,qBAAqB;IACrB,UAAU;IACV,gCAAgC;IAChC,oBAAoB;IACpB,gBAAgB;IAChB,mBAAmB;CACpB,CAAC,CAAC;AACH,4EAA4E;AAC5E,kFAAkF;AAClF,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,cAAc;IACd,eAAe;IACf,kBAAkB;IAClB,iBAAiB;IACjB,cAAc;IACd,aAAa;IACb,cAAc;IACd,oBAAoB;CACrB,CAAC,CAAC;AACH,MAAM,uBAAuB,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAE5D;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,QAAQ,GAAiC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IAClE,MAAM,KAAK,GAA4D;QACrE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE;KACtC,CAAC;IACF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;gBAC7B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,SAAS;YACX,CAAC;YACD,IACE,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;gBACnC,CAAC,KAAK,CAAC,IAAI,KAAK,mBAAmB;oBACjC,uBAAuB,CAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,EAC/E,CAAC;gBACD,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxE,CAAC;AAED,4EAA4E;AAC5E,0EAA0E;AAC1E,+EAA+E;AAC/E,oDAAoD;AACpD,wEAAwE;AACxE,wEAAwE;AACxE,MAAM,sBAAsB,GAC1B,qEAAqE,CAAC;AAExE;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,IAAY,EACZ,MAAc,EACd,OAAmC;IAEnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACxC,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,IAAwB,CAAC;QAC7B,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5B,OAAO;gBACL,KAAK,EAAE,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC3C,OAAO,EAAE,yBAAyB;gBAClC,KAAK,EAAE,iBAAiB;aACzB,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,kFAAkF;QACpF,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IACD,sBAAsB,CAAC,SAAS,GAAG,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI;QAAE,QAAQ,IAAI,CAAC,CAAC;IACnE,OAAO;QACL,KAAK,EAAE,QAAQ,GAAG,CAAC;QACnB,OAAO,EAAE,wBAAwB;QACjC,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,MAAc;IAEd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,eAAe,IAAI,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;aAAM,IAAI,OAAO,GAAG,eAAe,IAAI,KAAK,EAAE,CAAC;YAC9C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,KAAK,GAAG,eAAe,EAAE,IAAI,IAAI,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IACD,OAAO;QACL,KAAK,EAAE,UAAU,CAAC,IAAI;QACtB,OAAO,EAAE,uBAAuB;QAChC,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAY,EACZ,MAAc,EACd,OAAmC;IAEnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,UAAU,GAAG,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAClE,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,KAAK,GAA0D,EAAE,CAAC;IACxE,IAAI,UAAU;QAAE,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9C,IAAI,WAAW;QAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;IACjD,OAAO,KAAK,CAAC;AACf,CAAC"}
|
|
@@ -17,6 +17,7 @@ export interface TsNode {
|
|
|
17
17
|
}
|
|
18
18
|
export interface TsTree {
|
|
19
19
|
rootNode: TsNode;
|
|
20
|
+
delete(): void;
|
|
20
21
|
}
|
|
21
22
|
export interface TsLanguage {
|
|
22
23
|
__brand?: "tree-sitter-language";
|
|
@@ -24,6 +25,7 @@ export interface TsLanguage {
|
|
|
24
25
|
export interface TsParser {
|
|
25
26
|
setLanguage(language: TsLanguage): void;
|
|
26
27
|
parse(source: string): TsTree;
|
|
28
|
+
delete(): void;
|
|
27
29
|
}
|
|
28
30
|
/**
|
|
29
31
|
* Return the number of times tree-sitter fell back to the regex floor since
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"treeSitter.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitter.ts"],"names":[],"mappings":"AAIA;;;;;;;;;GASG;
|
|
1
|
+
{"version":3,"file":"treeSitter.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitter.ts"],"names":[],"mappings":"AAIA;;;;;;;;;GASG;AAKH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IAChD,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;CACtD;AACD,MAAM,WAAW,MAAM;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,IAAI,IAAI,CAAC;CAChB;AACD,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,sBAAsB,CAAC;CAClC;AACD,MAAM,WAAW,QAAQ;IACvB,WAAW,CAAC,QAAQ,EAAE,UAAU,GAAG,IAAI,CAAC;IACxC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,MAAM,IAAI,IAAI,CAAC;CAChB;AAgBD;;;;;;;GAOG;AACH,wBAAgB,6BAA6B,IAAI,MAAM,CAEtD;AA6HD;;;GAGG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,MAAM,EACf,cAAc,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC,CAsB/B;AAED,oFAAoF;AACpF,wBAAgB,yBAAyB,IAAI,IAAI,CAKhD"}
|
|
@@ -129,7 +129,13 @@ export async function getTreeSitterParser(grammar, dependencyPath) {
|
|
|
129
129
|
return undefined;
|
|
130
130
|
try {
|
|
131
131
|
const parser = new parserModule.Parser();
|
|
132
|
-
|
|
132
|
+
try {
|
|
133
|
+
parser.setLanguage(language);
|
|
134
|
+
}
|
|
135
|
+
catch (e) {
|
|
136
|
+
parser.delete();
|
|
137
|
+
throw e;
|
|
138
|
+
}
|
|
133
139
|
return parser;
|
|
134
140
|
}
|
|
135
141
|
catch (e) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"treeSitter.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;
|
|
1
|
+
{"version":3,"file":"treeSitter.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AA8CzC,MAAM,eAAe,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAEvD,IAAI,iBAAiB,GAAG,CAAC,CAAC;AAE1B;;;;;;;GAOG;AACH,MAAM,UAAU,6BAA6B;IAC3C,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED,8EAA8E;AAC9E,2EAA2E;AAC3E,yEAAyE;AACzE,oDAAoD;AACpD,MAAM,WAAW,GAAG,IAAI,GAAG,EAA6C,CAAC;AACzE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;AAC5D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAgD,CAAC;AAE9E,KAAK,UAAU,kBAAkB,CAC/B,cAAuB;IAEvB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,cAAc,EAAE,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,eAAe,CAC9B,IAAI,CAAC,cAAc,EAAE,cAAc,CAAC,CACC,CAAC;YACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,IAAI,UAAU,CAAC;YAC7D,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnE,CAAC;QAAC,MAAM,CAAC;YACP,sCAAsC;QACxC,CAAC;IACH,CAAC;IACD,UAAU,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAEnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,CAAC,MAAM,MAAM,CAAC,SAAS,CAAC,CAEnC,CAAC;YACF,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAEnC,CAAC;YACd,IAAI,QAAQ,EAAE,MAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBAC1C,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,iBAAiB,IAAI,CAAC,CAAC;YACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,+CAA+C,SAAS,MAAO,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CACpG,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,KAAK,UAAU,SAAS,CACtB,cAAuB;IAEvB,MAAM,GAAG,GAAG,cAAc,IAAI,EAAE,CAAC;IACjC,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,kBAAkB,CAAC,cAAc,CAAC,CAAC;QAC5C,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,YAA0B;IAClD,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACzC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE;aAChC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;aAChB,KAAK,CAAC,CAAC,CAAU,EAAE,EAAE;YACpB,iBAAiB,IAAI,CAAC,CAAC;YACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,mDAAoD,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CACzF,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACL,SAAS,CAAC,GAAG,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,OAAe;IACzC,+EAA+E;IAC/E,IAAI,CAAC;QACH,OAAO,eAAe,CAAC,OAAO,CAC5B,qCAAqC,OAAO,OAAO,CACpD,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,oEAAoE;IACtE,CAAC;IACD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,eAAe,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,eAAe,OAAO,OAAO,CAAC,CAAC;IAClE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,YAA0B,EAC1B,OAAe;IAEf,IAAI,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAChD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,aAAa,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,OAAO,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC;IAC7C,CAAC;IACD,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAChD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/D,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,iBAAiB,IAAI,CAAC,CAAC;QACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,qDAAqD,OAAO,WAAW,WAAW,MAAO,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAC9H,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,OAAe,EACf,cAAuB;IAEvB,MAAM,YAAY,GAAG,MAAM,SAAS,CAAC,cAAc,CAAC,CAAC;IACrD,IAAI,CAAC,YAAY;QAAE,OAAO,SAAS,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC,YAAY,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACxD,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;IAC3D,IAAI,CAAC,QAAQ;QAAE,OAAO,SAAS,CAAC;IAChC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;QACzC,IAAI,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,CAAC;QACV,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,iBAAiB,IAAI,CAAC,CAAC;QACvB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,uEAAuE,OAAO,MAAO,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAC1H,CAAC;QACF,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,yBAAyB;IACvC,WAAW,CAAC,KAAK,EAAE,CAAC;IACpB,SAAS,CAAC,KAAK,EAAE,CAAC;IAClB,aAAa,CAAC,KAAK,EAAE,CAAC;IACtB,iBAAiB,GAAG,CAAC,CAAC;AACxB,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"treeSitterBatch.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitterBatch.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEpD,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,KAAK,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAKnE,qFAAqF;AACrF,wBAAsB,sBAAsB,CAC1C,KAAK,EAAE,MAAM,EAAE,EACf,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE,MAAM,EACf,YAAY,EAAE,MAAM,EACpB,gBAAgB,EAAE,CAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC/B,KAAK,EAAE,SAAS,EAAE,KACf,IAAI,EACT,UAAU,GAAE,OAAO,mBAAyC,EAC5D,YAAY,CAAC,EAAE,MAAM,IAAI,GACxB,OAAO,CAAC,cAAc,CAAC,
|
|
1
|
+
{"version":3,"file":"treeSitterBatch.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitterBatch.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEpD,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,KAAK,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAKnE,qFAAqF;AACrF,wBAAsB,sBAAsB,CAC1C,KAAK,EAAE,MAAM,EAAE,EACf,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE,MAAM,EACf,YAAY,EAAE,MAAM,EACpB,gBAAgB,EAAE,CAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC/B,KAAK,EAAE,SAAS,EAAE,KACf,IAAI,EACT,UAAU,GAAE,OAAO,mBAAyC,EAC5D,YAAY,CAAC,EAAE,MAAM,IAAI,GACxB,OAAO,CAAC,cAAc,CAAC,CAgCzB"}
|
|
@@ -12,27 +12,37 @@ export async function analyzeTreeSitterFiles(files, context, grammar, warningLab
|
|
|
12
12
|
const parser = await loadParser(grammar, context.dependencyPath);
|
|
13
13
|
if (!parser)
|
|
14
14
|
return { edges: [] };
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
15
|
+
try {
|
|
16
|
+
prepareBatch?.();
|
|
17
|
+
const root = resolve(context.root);
|
|
18
|
+
const edges = [];
|
|
19
|
+
for (const file of files) {
|
|
20
|
+
let content;
|
|
21
|
+
try {
|
|
22
|
+
content = await readFile(resolve(root, file), "utf8");
|
|
23
|
+
}
|
|
24
|
+
catch {
|
|
25
|
+
continue;
|
|
26
|
+
}
|
|
27
|
+
if (content.length > MAX_SOURCE_CODE_UNITS)
|
|
28
|
+
continue;
|
|
29
|
+
try {
|
|
30
|
+
const tree = parser.parse(content);
|
|
31
|
+
try {
|
|
32
|
+
collectFileEdges(normalizeGraphPath(file), tree.rootNode, context.pathLookup, edges);
|
|
33
|
+
}
|
|
34
|
+
finally {
|
|
35
|
+
tree.delete();
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
catch (e) {
|
|
39
|
+
process.stderr.write(`[audit-code] ${warningLabel}: parse failed for '${file}': ${e.message ?? String(e)}\n`);
|
|
40
|
+
}
|
|
34
41
|
}
|
|
42
|
+
return { edges };
|
|
43
|
+
}
|
|
44
|
+
finally {
|
|
45
|
+
parser.delete();
|
|
35
46
|
}
|
|
36
|
-
return { edges };
|
|
37
47
|
}
|
|
38
48
|
//# sourceMappingURL=treeSitterBatch.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"treeSitterBatch.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitterBatch.ts"],"names":[],"mappings":"AAAA,iGAAiG;AACjG,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,mBAAmB,EAAe,MAAM,iBAAiB,CAAC;AAEnE,8EAA8E;AAC9E,MAAM,qBAAqB,GAAG,GAAG,GAAG,IAAI,CAAC;AAEzC,qFAAqF;AACrF,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,KAAe,EACf,OAAwB,EACxB,OAAe,EACf,YAAoB,EACpB,gBAKS,EACT,aAAyC,mBAAmB,EAC5D,YAAyB;IAEzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC7C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACjE,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAClC,YAAY,EAAE,EAAE,CAAC;
|
|
1
|
+
{"version":3,"file":"treeSitterBatch.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/treeSitterBatch.ts"],"names":[],"mappings":"AAAA,iGAAiG;AACjG,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,mBAAmB,EAAe,MAAM,iBAAiB,CAAC;AAEnE,8EAA8E;AAC9E,MAAM,qBAAqB,GAAG,GAAG,GAAG,IAAI,CAAC;AAEzC,qFAAqF;AACrF,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,KAAe,EACf,OAAwB,EACxB,OAAe,EACf,YAAoB,EACpB,gBAKS,EACT,aAAyC,mBAAmB,EAC5D,YAAyB;IAEzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC7C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACjE,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAClC,IAAI,CAAC;QACH,YAAY,EAAE,EAAE,CAAC;QAEjB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAe,CAAC;YACpB,IAAI,CAAC;gBACH,OAAO,GAAG,MAAM,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YACxD,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,GAAG,qBAAqB;gBAAE,SAAS;YACrD,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACnC,IAAI,CAAC;oBACH,gBAAgB,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBACvF,CAAC;wBAAS,CAAC;oBACT,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,YAAY,uBAAuB,IAAI,MAAO,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3H,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,CAAC;IACnB,CAAC;YAAS,CAAC;QACT,MAAM,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;AACH,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"designAssessment.d.ts","sourceRoot":"","sources":["../../../src/audit/extractors/designAssessment.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"designAssessment.d.ts","sourceRoot":"","sources":["../../../src/audit/extractors/designAssessment.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAW,YAAY,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,oBAAoB,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAG1F,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AA8ZrE,wBAAgB,qBAAqB,CAAC,MAAM,EAAE;IAC5C,YAAY,EAAE,YAAY,CAAC;IAC3B,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,oBAAoB,CAAC;IACpC,YAAY,EAAE,YAAY,CAAC;CAC5B,GAAG,gBAAgB,CA6BnB"}
|