dsh-git-push 2.20.19 → 3.0.0
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 +3 -2
- package/cli-tool.mjs +2 -4
- package/cli.mjs +7 -1
- package/lib/app/apply.js +4 -4
- package/lib/app/command-registry.js +22 -17
- package/lib/app/handlers/meta.js +2 -2
- package/lib/app/handlers/preprocess.js +107 -0
- package/lib/app/handlers/repo-actions.js +2 -2
- package/lib/app/http-handlers.js +13 -42
- package/lib/app/index.js +2 -1
- package/lib/app/inject-text.js +3 -3
- package/lib/app/preprocess-client.js +136 -0
- package/lib/app/repo-ownership.js +1 -1
- package/lib/app/schema.js +3 -3
- package/lib/app/severity.js +14 -0
- package/lib/app/slash-commands.js +5 -164
- package/lib/app/tool-call.js +73 -144
- package/lib/cli/commands-preprocess.mjs +74 -0
- package/lib/cli/commands-tool.mjs +3 -2
- package/lib/cli/commands-vcs.mjs +4 -4
- package/lib/cli/shared.mjs +35 -9
- package/lib/commit-push/pre-commit-engine.js +57 -10
- package/lib/commit-push.js +71 -27
- package/lib/{exempt/index.js → git/exempt-markers.js} +8 -1
- package/lib/git/ignore.js +1 -1
- package/lib/git/repos.js +2 -2
- package/lib/git/sensitive.js +1 -1
- package/lib/npm/publish.js +20 -5
- package/lib/plugin/auto-push.js +2 -2
- package/lib/preprocess/providers.js +191 -0
- package/lib/self/index.js +1 -1
- package/lib/skip-dirs.js +14 -55
- package/package.json +29 -37
- package/scripts/build-client.mjs +2 -0
- package/scripts/check.mjs +4 -2
- package/scripts/local-registry.mjs +2 -1
- package/cli-audit.mjs +0 -141
- package/lib/app/audit-api.js +0 -173
- package/lib/app/handlers/audit.js +0 -150
- package/lib/app/host-doc-checks.js +0 -25
- package/lib/app/scope-check.js +0 -69
- package/lib/ast/brace.js +0 -120
- package/lib/ast/callgraph.js +0 -135
- package/lib/ast/code-lines.js +0 -175
- package/lib/ast/consts.js +0 -12
- package/lib/ast/control-flow.js +0 -470
- package/lib/ast/credential.js +0 -315
- package/lib/ast/dataflow.js +0 -391
- package/lib/ast/dup-code.js +0 -165
- package/lib/ast/fs-hotspots.js +0 -154
- package/lib/ast/index.js +0 -38
- package/lib/ast/io-risk-const.js +0 -95
- package/lib/ast/io-risk-fn.js +0 -208
- package/lib/ast/io-risk-loop.js +0 -308
- package/lib/ast/io-risk.js +0 -314
- package/lib/ast/lang.js +0 -156
- package/lib/ast/line-count.js +0 -52
- package/lib/ast/magic-number.js +0 -272
- package/lib/ast/naming.js +0 -292
- package/lib/ast/perf.js +0 -488
- package/lib/ast/scope-collisions.js +0 -228
- package/lib/ast/scope.js +0 -241
- package/lib/ast/shell.js +0 -131
- package/lib/ast/size.js +0 -448
- package/lib/ast/symbol-index.js +0 -399
- package/lib/ast/tokenizer.js +0 -421
- package/lib/ast/treesitter.js +0 -413
- package/lib/audit/analysis-coverage.js +0 -98
- package/lib/audit/audit-file.js +0 -205
- package/lib/audit/auditignore-rules.js +0 -148
- package/lib/audit/checks.js +0 -17
- package/lib/audit/client-entry.js +0 -93
- package/lib/audit/collector.js +0 -610
- package/lib/audit/ext-runner.js +0 -80
- package/lib/audit/file-context.js +0 -391
- package/lib/audit/finding.js +0 -101
- package/lib/audit/gitignore-match.js +0 -113
- package/lib/audit/glob.js +0 -63
- package/lib/audit/history-report.js +0 -100
- package/lib/audit/history.js +0 -126
- package/lib/audit/ignore-blind.js +0 -102
- package/lib/audit/index.js +0 -33
- package/lib/audit/orchestrate.js +0 -672
- package/lib/audit/public.js +0 -24
- package/lib/audit/repo-level.js +0 -30
- package/lib/audit/report-yaml.js +0 -90
- package/lib/audit/scope-policy.js +0 -110
- package/lib/audit/slot.js +0 -66
- package/lib/audit-rules/audit-rules-comment.yml +0 -199
- package/lib/audit-rules/audit-rules-cpp.yml +0 -114
- package/lib/audit-rules/audit-rules-csharp.yml +0 -82
- package/lib/audit-rules/audit-rules-docs.yml +0 -32
- package/lib/audit-rules/audit-rules-dsh.yml +0 -177
- package/lib/audit-rules/audit-rules-filehealth.yml +0 -42
- package/lib/audit-rules/audit-rules-folder.yml +0 -99
- package/lib/audit-rules/audit-rules-frontend.yml +0 -335
- package/lib/audit-rules/audit-rules-go.yml +0 -103
- package/lib/audit-rules/audit-rules-i18n.yml +0 -45
- package/lib/audit-rules/audit-rules-java.yml +0 -105
- package/lib/audit-rules/audit-rules-nodejs.yml +0 -662
- package/lib/audit-rules/audit-rules-npm.yml +0 -187
- package/lib/audit-rules/audit-rules-paths.yml +0 -98
- package/lib/audit-rules/audit-rules-performance.yml +0 -245
- package/lib/audit-rules/audit-rules-php.yml +0 -101
- package/lib/audit-rules/audit-rules-private.yml +0 -24
- package/lib/audit-rules/audit-rules-python.yml +0 -106
- package/lib/audit-rules/audit-rules-robustness.yml +0 -31
- package/lib/audit-rules/audit-rules-rust.yml +0 -109
- package/lib/audit-rules/audit-rules-structure.yml +0 -158
- package/lib/audit-rules/audit-rules-swift.yml +0 -99
- package/lib/audit-rules/audit-rules-template.yml +0 -108
- package/lib/audit-ui-sdk/contract.js +0 -117
- package/lib/audit-ui-sdk/index.js +0 -17
- package/lib/checks/button-bind.js +0 -347
- package/lib/checks/common.js +0 -170
- package/lib/checks/credential-file.js +0 -43
- package/lib/checks/dataflow.js +0 -40
- package/lib/checks/dispatch.js +0 -117
- package/lib/checks/dup-code.js +0 -69
- package/lib/checks/dup-const.js +0 -232
- package/lib/checks/file-health.js +0 -150
- package/lib/checks/filter.js +0 -137
- package/lib/checks/folder.js +0 -173
- package/lib/checks/fs-scanner.js +0 -57
- package/lib/checks/hardcoded-path.js +0 -98
- package/lib/checks/index.js +0 -49
- package/lib/checks/io.js +0 -66
- package/lib/checks/magic-number.js +0 -42
- package/lib/checks/npm-json.js +0 -273
- package/lib/checks/private.js +0 -64
- package/lib/checks/regex.js +0 -298
- package/lib/checks/scope-collision.js +0 -68
- package/lib/checks/semantic.js +0 -134
- package/lib/checks/structural.js +0 -281
- package/lib/cli/commands-audit.mjs +0 -142
- package/lib/cli/commands-doc.mjs +0 -127
- package/lib/client-parts/audit/audit.js +0 -301
- package/lib/exempt/tool.js +0 -198
- package/lib/git/module-splitter.js +0 -47
- package/lib/link-check/index.js +0 -187
- package/lib/lint-adapter/detect.js +0 -161
- package/lib/lint-adapter/index.js +0 -50
- package/lib/lint-adapter/runner.js +0 -133
- package/lib/preprocess/audit.js +0 -98
- package/lib/preprocess/index.js +0 -78
- package/lib/rule/compilers/credential.js +0 -62
- package/lib/rule/compilers/dataflow.js +0 -38
- package/lib/rule/compilers/file-health.js +0 -75
- package/lib/rule/compilers/frontend.js +0 -86
- package/lib/rule/compilers/func.js +0 -35
- package/lib/rule/compilers/helpers.js +0 -71
- package/lib/rule/compilers/index.js +0 -29
- package/lib/rule/compilers/link-semantic.js +0 -45
- package/lib/rule/compilers/list-kinds.js +0 -12
- package/lib/rule/compilers/numeric-kinds.js +0 -73
- package/lib/rule/compilers/regex.js +0 -78
- package/lib/rule/compilers/structure.js +0 -107
- package/lib/rule/compilers.js +0 -17
- package/lib/rule/homoglyph.js +0 -45
- package/lib/rule/loader.js +0 -274
- package/lib/rule/registry.js +0 -122
- package/lib/rule/scope.js +0 -67
- package/lib/score/docs-score.js +0 -166
- package/lib/score/index.js +0 -234
- package/scripts/__pycache__/module-splitter.cpython-38.pyc +0 -0
- package/scripts/audit-ext/_example-readme-present.mjs +0 -34
- package/scripts/audit-ext/dsh-inject-declarations.mjs +0 -209
- package/scripts/audit-ext/variable-min-length.mjs +0 -102
- package/scripts/audit-gate.mjs +0 -235
- package/scripts/audit-runner.mjs +0 -35
- package/scripts/audit-runtime-check.mjs +0 -129
- package/scripts/browser-page-probe.mjs +0 -271
- package/scripts/check-js-scope.mjs +0 -87
- package/scripts/clean-date-comments.py +0 -102
- package/scripts/cpu-sample.mjs +0 -188
- package/scripts/doc-drift.mjs +0 -200
- package/scripts/hot-path-probe-cjs.cjs +0 -71
- package/scripts/hot-path-probe-fs-shim.mjs +0 -28
- package/scripts/hot-path-probe-fsp-shim.mjs +0 -31
- package/scripts/hot-path-probe.mjs +0 -153
- package/scripts/module-splitter.py +0 -800
- package/scripts/picker-repro.mjs +0 -115
- package/scripts/platform-scan.mjs +0 -168
- package/scripts/probe-recheck.mjs +0 -47
- package/scripts/rename-locator.mjs +0 -97
- package/scripts/rule-switch.mjs +0 -97
- package/scripts/rules-solo-audit.mjs +0 -173
- package/scripts/scan-file-io.mjs +0 -717
- package/scripts/scan-fs-hotspots.mjs +0 -107
- package/scripts/symbol-index.mjs +0 -85
- package/scripts/verify-prestep.mjs +0 -100
- package/skills/dev/audit-rule-authoring.md +0 -58
- package/skills/guide/guide-audit.md +0 -270
- /package/lib/{audit → app}/ownership.js +0 -0
- /package/lib/app/{schema-audit.js → schema-preprocess.js} +0 -0
- /package/lib/{audit-defaults.js → git/defaults.js} +0 -0
package/lib/ast/dataflow.js
DELETED
|
@@ -1,391 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* AST 实现层 · 数据流检查(三层审计 L2)
|
|
3
|
-
*
|
|
4
|
-
* 职责:同函数内的「清空后访问」数据流判定——变量/对象先被清空
|
|
5
|
-
* (clear()/reset()/splice(0)/length=0/=[]/=null/delete),之后在同一
|
|
6
|
-
* 函数体内又被读取/访问(.get()/.at()/[下标] 等),构成「读已清空对象」
|
|
7
|
-
* 风险(拿到 undefined / 空值)。
|
|
8
|
-
*
|
|
9
|
-
* 为什么是 L2(AST+YAML)而不是 L1(正则):
|
|
10
|
-
* L1 正则只能筛「文件里同时出现过清空词和访问词」,无法区分两者是否
|
|
11
|
-
* 在同一函数内、是否先后有序。L2 用 token 级函数区间(collectInnerFnRanges)
|
|
12
|
-
* 精确到「同一函数体、清空行 < 访问行」才算命中。
|
|
13
|
-
*
|
|
14
|
-
* 为什么够不到 L3(运行时):
|
|
15
|
-
* 闭包捕获、跨模块引用、异步回调里的真实时序(清空在 setTimeout 后执行、
|
|
16
|
-
* 访问在 Promise resolve 时)静态无法确定——那是 scripts/audit-runtime-check.mjs
|
|
17
|
-
* 的职责,本模块只在静态可判定时给结论。
|
|
18
|
-
*
|
|
19
|
-
* 判定保守(宁漏不误报):
|
|
20
|
-
* ① 只统计同一函数体区间内的动作(顶层/function/方法/箭头函数体);
|
|
21
|
-
* ② 清空与访问必须命中**同一个对象名**(ident 相同);
|
|
22
|
-
* ③ 访问行必须在清空行**之后**(行号单调);
|
|
23
|
-
* ④ **写回撤销**:清空后被重新填充(push/set/add/重新赋值)→ 撤销清空标记,
|
|
24
|
-
* 其后访问不算命中(对象已被重新填充,不是「读已清空对象」)。
|
|
25
|
-
*/
|
|
26
|
-
|
|
27
|
-
import { tokenize } from './tokenizer.js';
|
|
28
|
-
import { matchBrace } from './brace.js';
|
|
29
|
-
|
|
30
|
-
/** 清空动作:方法调用(对象.clear() / .reset() / .flush() / .purge())。
|
|
31
|
-
* **刻意不含 empty**:empty() 在各语言都是**查询**(Python Queue.empty() / C++ vector.empty()
|
|
32
|
-
* 返回 bool,JS 库的 isEmpty 同义),把它当清空会制造系统性误报——
|
|
33
|
-
* 实测真实语料:`while not q.empty():` 之后的 `q.get()` 被误报成"清空后访问"。
|
|
34
|
-
* **刻意不含 reset**(2026-11-06 实测追加):业务代码里 reset() 绝大多数是
|
|
35
|
-
* 「**恢复默认值/重置状态**」而不是「清空容器」——被重置后对象**仍有内容**,之后读取完全安全。
|
|
36
|
-
* 实测证据:某配置类 `reset() -> bool`,测试断言 `cfg.reset()` 后 `cfg.get("general.theme") == "dark"`
|
|
37
|
-
* (有效值,不是空);同语料 13 条命中里 **12 条**都源于把 reset() 当清空。
|
|
38
|
-
* 真正的容器清空在各语言里用 clear()(本表保留)。若某库确把 reset() 用作清空,宁可漏报。 */
|
|
39
|
-
const CLEAR_METHODS = new Set(['clear', 'flush', 'purge']);
|
|
40
|
-
/** 访问动作:方法读——清空后调用会拿 undefined(.get() / .at(0) / .first() / .peek())。
|
|
41
|
-
* shift/pop 是「消费式访问」,常见于 `while (len) { shift() }` 保护模式,不报(宁漏不误报)。 */
|
|
42
|
-
const ACCESS_METHODS = new Set(['get', 'at', 'first', 'last', 'peek', 'head']);
|
|
43
|
-
/** 写回动作:清空后重新填充(push/add/set/append/unshift/assign)→ 撤销清空标记。 */
|
|
44
|
-
const WRITE_METHODS = new Set(['push', 'add', 'set', 'append', 'unshift', 'assign', 'insert']);
|
|
45
|
-
|
|
46
|
-
/**
|
|
47
|
-
* 收集文本里所有「函数体 token 区间」——function 声明 + 方法 + 箭头函数,
|
|
48
|
-
* 以及**排除函数体后**的顶层作用域孤岛区间。
|
|
49
|
-
*
|
|
50
|
-
* 互斥性(修复跨函数误连):
|
|
51
|
-
* 旧实现把顶层作用域 = 整个文件区间,导致「模块级清空(顶层 `resultsByIndex =
|
|
52
|
-
* new Map()` 重置)→ 另一函数里的访问」被误判为同函数。正确做法是:
|
|
53
|
-
* 顶层只保留**不属于任何函数体**的 token 段(变量声明/模块级语句),
|
|
54
|
-
* 与各函数体区间互斥,各自独立扫描——清空动作和访问动作必须落在同一区间。
|
|
55
|
-
*
|
|
56
|
-
* @param {Array} tokens token 流
|
|
57
|
-
* @returns {Array<[number, number]>} [startIdx, endIdx](含大括号,闭区间;互斥不重叠)
|
|
58
|
-
*/
|
|
59
|
-
/** 段①:函数声明/表达式体(function f() {...} / const f = function() {...})。 */
|
|
60
|
-
function collectDeclaredFnBodies(tokens) {
|
|
61
|
-
const fnRanges = [];
|
|
62
|
-
for (let i = 0; i < tokens.length; i++) {
|
|
63
|
-
const t = tokens[i];
|
|
64
|
-
if (!(t.type === 'ident' && t.value === 'function')) continue;
|
|
65
|
-
let openIdx = -1;
|
|
66
|
-
for (let j = i + 1; j < Math.min(tokens.length, i + 24); j++) {
|
|
67
|
-
if (tokens[j].type === 'punct' && tokens[j].value === '{') { openIdx = j; break; }
|
|
68
|
-
}
|
|
69
|
-
if (openIdx === -1) continue;
|
|
70
|
-
const r = matchBrace(tokens, openIdx);
|
|
71
|
-
if (r) fnRanges.push(r);
|
|
72
|
-
}
|
|
73
|
-
return fnRanges;
|
|
74
|
-
}
|
|
75
|
-
|
|
76
|
-
/** 段②:箭头函数体(() => {...})与方法简写(method() {...})。 */
|
|
77
|
-
function collectArrowMethodBodies(tokens) {
|
|
78
|
-
const fnRanges = [];
|
|
79
|
-
for (let i = 0; i < tokens.length - 1; i++) {
|
|
80
|
-
const t = tokens[i];
|
|
81
|
-
if (t.type === 'punct' && t.value === '=>' && tokens[i + 1]?.type === 'punct' && tokens[i + 1]?.value === '{') {
|
|
82
|
-
const r = matchBrace(tokens, i + 1);
|
|
83
|
-
if (r) fnRanges.push(r);
|
|
84
|
-
}
|
|
85
|
-
if (t.type === 'punct' && t.value === ')' && tokens[i + 1]?.type === 'punct' && tokens[i + 1]?.value === '{') {
|
|
86
|
-
let prev = null;
|
|
87
|
-
for (let j = i - 1; j >= 0; j--) {
|
|
88
|
-
if (tokens[j].type === 'ws' || tokens[j].type === 'comment') continue;
|
|
89
|
-
prev = tokens[j];
|
|
90
|
-
break;
|
|
91
|
-
}
|
|
92
|
-
if (prev && prev.type === 'ident') {
|
|
93
|
-
const r = matchBrace(tokens, i + 1);
|
|
94
|
-
if (r) fnRanges.push(r);
|
|
95
|
-
}
|
|
96
|
-
}
|
|
97
|
-
}
|
|
98
|
-
return fnRanges;
|
|
99
|
-
}
|
|
100
|
-
|
|
101
|
-
/**
|
|
102
|
-
* 段③·前:Python 缩进式函数体区间(`def f():` / `async def f():`)。
|
|
103
|
-
*
|
|
104
|
-
* 为什么必须单独一段:前面两段都只认 **JS 风格**——`function` 关键字与 `) {`。
|
|
105
|
-
* Python 用 `def` + 缩进,两者都不命中,于是 `fnRanges` 为空,
|
|
106
|
-
* `mergeFnRanges` 的第 3 步退化成「整个文件一个区间」⇒ 同文件内**任意位置**的
|
|
107
|
-
* 清空与访问都会被配成一对(实测:clear 在 invalidate()、访问在 build_index(),
|
|
108
|
-
* 相距 177 行仍被报)。这是结构性失真,不能靠调判据修补。
|
|
109
|
-
*
|
|
110
|
-
* 块范围判据(与 Python 语法一致):从 `def` 行起,向下直到首个
|
|
111
|
-
* **非空、非注释且缩进 ≤ def 缩进** 的行(该行已属同级/外层,不属于本函数体)。
|
|
112
|
-
* 嵌套 def 会被各自识别并**独立成体**(不做父子合并,数据流不跨函数体)。
|
|
113
|
-
* @param {string} text 源文本
|
|
114
|
-
* @param {Array} tokens token 流(用于把行号换算成 token 下标,并确认 `def` 是真标识符)
|
|
115
|
-
* @returns {Array<[number, number]>} token 下标闭区间
|
|
116
|
-
*/
|
|
117
|
-
function collectPythonDefBodies(text, tokens) {
|
|
118
|
-
const src = String(text || '');
|
|
119
|
-
if (!/^[ \t]*(async[ \t]+)?def[ \t]+\w+[ \t]*\(/m.test(src)) return [];
|
|
120
|
-
const lines = src.split('\n');
|
|
121
|
-
// tab 按 4 空格折算(与常见 Python 风格一致;混用缩进本身是语法错误,不深究)
|
|
122
|
-
const indentOf = (s) => {
|
|
123
|
-
const m = s.match(/^[ \t]*/);
|
|
124
|
-
return m ? m[0].replace(/\t/g, ' ').length : 0;
|
|
125
|
-
};
|
|
126
|
-
const isBlankOrComment = (s) => !s.trim() || /^\s*#/.test(s);
|
|
127
|
-
// 行号(1-based) → 该行首个/末个有效 token 下标
|
|
128
|
-
const firstTokOfLine = new Map();
|
|
129
|
-
const lastTokOfLine = new Map();
|
|
130
|
-
for (let i = 0; i < tokens.length; i++) {
|
|
131
|
-
const tk = tokens[i];
|
|
132
|
-
if (tk.type === 'ws' || tk.type === 'comment') continue;
|
|
133
|
-
const ln = Number(tk.line) || 0;
|
|
134
|
-
if (!ln) continue;
|
|
135
|
-
if (!firstTokOfLine.has(ln)) firstTokOfLine.set(ln, i);
|
|
136
|
-
lastTokOfLine.set(ln, i);
|
|
137
|
-
}
|
|
138
|
-
const ranges = [];
|
|
139
|
-
for (let li = 0; li < lines.length; li++) {
|
|
140
|
-
const m = lines[li].match(/^([ \t]*)(?:async[ \t]+)?def[ \t]+\w+[ \t]*\(/);
|
|
141
|
-
if (!m) continue;
|
|
142
|
-
const lineNo = li + 1;
|
|
143
|
-
// 必须确认该行的 def 是**真 token**(避免三引号字符串/注释里的 "def ")
|
|
144
|
-
const firstIdx = firstTokOfLine.get(lineNo);
|
|
145
|
-
const firstTok = firstIdx === undefined ? null : tokens[firstIdx];
|
|
146
|
-
const looksLikeDef = firstTok && (firstTok.value === 'def' || firstTok.value === 'async');
|
|
147
|
-
const lineHasDefTok = looksLikeDef || [...(firstTokOfLine.keys())].length === 0;
|
|
148
|
-
if (!lineHasDefTok) continue;
|
|
149
|
-
const base = indentOf(lines[li]);
|
|
150
|
-
let endLine = lineNo;
|
|
151
|
-
for (let lj = li + 1; lj < lines.length; lj++) {
|
|
152
|
-
const cur = lines[lj];
|
|
153
|
-
if (isBlankOrComment(cur)) continue; // 空行/注释不结束块
|
|
154
|
-
if (indentOf(cur) <= base) break; // 回到同级/外层 ⇒ 块结束
|
|
155
|
-
endLine = lj + 1;
|
|
156
|
-
}
|
|
157
|
-
const startTok = firstTokOfLine.get(lineNo);
|
|
158
|
-
const endTok = lastTokOfLine.get(endLine);
|
|
159
|
-
if (startTok === undefined || endTok === undefined || endTok < startTok) continue;
|
|
160
|
-
ranges.push([startTok, endTok]);
|
|
161
|
-
}
|
|
162
|
-
return ranges;
|
|
163
|
-
}
|
|
164
|
-
|
|
165
|
-
/** 段③:排序去重叠(嵌套只留最外层)+ 补顶层作用域孤岛(函数外 token 段)。 */
|
|
166
|
-
function mergeFnRanges(fnRanges, tokens) {
|
|
167
|
-
fnRanges.sort((a, b) => a[0] - b[0]);
|
|
168
|
-
const merged = [];
|
|
169
|
-
for (const r of fnRanges) {
|
|
170
|
-
const last = merged[merged.length - 1];
|
|
171
|
-
if (last && r[0] <= last[1]) { last[1] = Math.max(last[1], r[1]); continue; } // 重叠/嵌套 → 合并
|
|
172
|
-
merged.push([r[0], r[1]]);
|
|
173
|
-
}
|
|
174
|
-
const bodies = [...merged];
|
|
175
|
-
// 顶层孤岛 = [0, lastCode] 减去所有函数体区间
|
|
176
|
-
let lastCode = tokens.length - 1;
|
|
177
|
-
while (lastCode >= 0 && (tokens[lastCode].type === 'comment' || tokens[lastCode].type === 'ws')) lastCode--;
|
|
178
|
-
if (lastCode >= 0) {
|
|
179
|
-
let cursor = 0;
|
|
180
|
-
for (const [fs, fe] of merged) {
|
|
181
|
-
if (fs > cursor) bodies.push([cursor, fs - 1]); // 函数前的顶层段
|
|
182
|
-
cursor = Math.max(cursor, fe + 1);
|
|
183
|
-
}
|
|
184
|
-
if (cursor <= lastCode) bodies.push([cursor, lastCode]); // 函数后的顶层段
|
|
185
|
-
}
|
|
186
|
-
return bodies;
|
|
187
|
-
}
|
|
188
|
-
|
|
189
|
-
/**
|
|
190
|
-
* 收集全部函数体区间(声明/表达式/箭头/方法 + Python def 缩进体 + 顶层孤岛)。
|
|
191
|
-
* @param {Array} tokens token 流
|
|
192
|
-
* @param {string} [text] 源文本(Python 缩进体解析必需;缺省则退化为仅花括号语言)
|
|
193
|
-
*/
|
|
194
|
-
function collectFnBodies(tokens, text = '') {
|
|
195
|
-
const fnRanges = [
|
|
196
|
-
...collectDeclaredFnBodies(tokens),
|
|
197
|
-
...collectArrowMethodBodies(tokens),
|
|
198
|
-
...collectPythonDefBodies(text, tokens),
|
|
199
|
-
];
|
|
200
|
-
return mergeFnRanges(fnRanges, tokens);
|
|
201
|
-
}
|
|
202
|
-
|
|
203
|
-
/** 从 i 向前跳过空白/注释,取最近一个有效 token。 */
|
|
204
|
-
function prevNonWs(tokens, i) {
|
|
205
|
-
for (let j = i - 1; j >= 0; j--) {
|
|
206
|
-
if (tokens[j].type === 'ws' || tokens[j].type === 'comment') continue;
|
|
207
|
-
return tokens[j];
|
|
208
|
-
}
|
|
209
|
-
return null;
|
|
210
|
-
}
|
|
211
|
-
|
|
212
|
-
/** 从 i 向后(含 i)跳过空白/注释,取最近一个有效 token。 */
|
|
213
|
-
function nextNonWs(tokens, i, to) {
|
|
214
|
-
for (let j = i; j <= to; j++) {
|
|
215
|
-
const tj = tokens[j];
|
|
216
|
-
if (tj?.type === 'ws' || tj?.type === 'comment') continue;
|
|
217
|
-
return tj;
|
|
218
|
-
}
|
|
219
|
-
return null;
|
|
220
|
-
}
|
|
221
|
-
|
|
222
|
-
/** obj 位于实参位(前 token 是 '(' 或 ',',后 token 是 ',' 或 ')')→ 可能被引用填充,撤销清空。 */
|
|
223
|
-
function applyArgWriteback(tokens, i, nxt, obj, clearMap) {
|
|
224
|
-
if (!(nxt?.type === 'punct' && (nxt.value === ',' || nxt.value === ')'))) return false;
|
|
225
|
-
const prev = prevNonWs(tokens, i);
|
|
226
|
-
if (prev && prev.type === 'punct' && (prev.value === '(' || prev.value === ',')) {
|
|
227
|
-
clearMap.delete(obj);
|
|
228
|
-
}
|
|
229
|
-
return true;
|
|
230
|
-
}
|
|
231
|
-
|
|
232
|
-
/**
|
|
233
|
-
* obj = rhs:rhs 是 null/undefined/[] 记清空;声明初始化不算清空;其它赋值记写回。
|
|
234
|
-
* @returns {boolean} 本 token 已按赋值处理
|
|
235
|
-
*/
|
|
236
|
-
function applyAssignClearOrWriteback(tokens, i, to, t, nxt, obj, clearMap) {
|
|
237
|
-
if (!(nxt?.type === 'punct' && nxt.value === '=')) return false;
|
|
238
|
-
const rhs = nextNonWs(tokens, i + 2, to);
|
|
239
|
-
if (!rhs) return true;
|
|
240
|
-
const isEmptyAssign = (rhs.type === 'ident' && (rhs.value === 'null' || rhs.value === 'undefined'))
|
|
241
|
-
|| (rhs.type === 'punct' && rhs.value === '[' && tokens[i + 3]?.type === 'punct' && tokens[i + 3].value === ']');
|
|
242
|
-
if (!isEmptyAssign) {
|
|
243
|
-
clearMap.delete(obj);
|
|
244
|
-
return true;
|
|
245
|
-
}
|
|
246
|
-
// 声明初始化(var/let/const 变量 = [] / = null)不算清空
|
|
247
|
-
const prev = prevNonWs(tokens, i);
|
|
248
|
-
const decl = prev && prev.type === 'ident' && (prev.value === 'var' || prev.value === 'let' || prev.value === 'const');
|
|
249
|
-
// ① 注解位:`self._x: list = []` 里被赋空值的是 **_x**,但扫描到 `list` 时它也满足
|
|
250
|
-
// 「ident 紧跟 =」——`list` 前面是 `:`(PEP 526 注解分隔符)⇒ 它在注解位,不是赋值目标。
|
|
251
|
-
// ⚠️ `:` 前面必须是**标识符**:Python 函数定义的 `def f(c):` 也用冒号,但其前是 `)`,
|
|
252
|
-
// 若不加这条就会把函数体第一条语句的赋值误当注解位 —— 实测会压制真缺陷
|
|
253
|
-
// (`def f(c): c = []` 后 `c[0]` 本该报却不报)。
|
|
254
|
-
const colonPrev = prev && prev.type === 'punct' && prev.value === ':'
|
|
255
|
-
? prevNonWs(tokens, prevNonWs(tokens, i) === prev ? i - 1 : i - 1)
|
|
256
|
-
: null;
|
|
257
|
-
const annPos = !!colonPrev && colonPrev.type === 'ident';
|
|
258
|
-
// ② 多目标解包:`result, last = [], {}` 中 last 后面紧跟 `=`,但 `[]` 属于 **result**。
|
|
259
|
-
// 判据:obj 之前(同语句内)出现过 `,` 而尚未出现 `=` ⇒ 它是解包目标之一,rhs 不归它。
|
|
260
|
-
const unpackTarget = prev && prev.type === 'punct' && prev.value === ',';
|
|
261
|
-
if (!decl && !annPos && !unpackTarget) {
|
|
262
|
-
clearMap.set(obj, { line: t.line, op: `= ${rhs.value === '[' ? '[]' : rhs.value}` });
|
|
263
|
-
}
|
|
264
|
-
return true;
|
|
265
|
-
}
|
|
266
|
-
|
|
267
|
-
/**
|
|
268
|
-
* 方法清空:.clear()/.reset()/.flush()、.splice(0)、.length = 0。
|
|
269
|
-
* @returns {number} 新的循环下标 i;未命中返回原 i
|
|
270
|
-
*/
|
|
271
|
-
function applyClearMethods(t, member, memberIdx, callOpen, tokens, obj, clearMap, i) {
|
|
272
|
-
if (callOpen && CLEAR_METHODS.has(member)) {
|
|
273
|
-
clearMap.set(obj, { line: t.line, op: `.${member}()` });
|
|
274
|
-
return memberIdx + 1;
|
|
275
|
-
}
|
|
276
|
-
if (callOpen && member === 'splice') {
|
|
277
|
-
const arg1 = tokens[memberIdx + 2];
|
|
278
|
-
if (!arg1 || (arg1.type === 'num' && Number(arg1.value) === 0)) {
|
|
279
|
-
clearMap.set(obj, { line: t.line, op: '.splice(0)' });
|
|
280
|
-
}
|
|
281
|
-
return memberIdx + 1;
|
|
282
|
-
}
|
|
283
|
-
if (member === 'length' && tokens[memberIdx + 1]?.type === 'punct' && tokens[memberIdx + 1].value === '='
|
|
284
|
-
&& tokens[memberIdx + 2]?.type === 'num' && Number(tokens[memberIdx + 2].value) === 0) {
|
|
285
|
-
clearMap.set(obj, { line: t.line, op: '.length = 0' });
|
|
286
|
-
return memberIdx + 2;
|
|
287
|
-
}
|
|
288
|
-
return i;
|
|
289
|
-
}
|
|
290
|
-
|
|
291
|
-
/**
|
|
292
|
-
* 清空后访问:.get()/.at() 或 [下标]。命中则记一条并撤销该对象标记(同对象只报一次)。
|
|
293
|
-
* @returns {number} 新的循环下标 i
|
|
294
|
-
*/
|
|
295
|
-
function applyAccessAfterClear(t, nxt, member, memberIdx, callOpen, tokens, i, obj, clearMap, out, to) {
|
|
296
|
-
if (!clearMap.has(obj)) return i;
|
|
297
|
-
const cleared = clearMap.get(obj);
|
|
298
|
-
if (callOpen && ACCESS_METHODS.has(member)) {
|
|
299
|
-
out.push({ line: t.line, obj, clearLine: cleared.line, clearOp: cleared.op, accessOp: `.${member}()` });
|
|
300
|
-
clearMap.delete(obj);
|
|
301
|
-
return memberIdx + 1;
|
|
302
|
-
}
|
|
303
|
-
if (nxt?.type === 'punct' && nxt.value === '[') {
|
|
304
|
-
const idx = tokens[i + 2];
|
|
305
|
-
// 写目标不是读:`obj[k] = v` / `obj[k] += v` 的 `[k]` 是**写入下标**,
|
|
306
|
-
// 读一个刚清空的容器才危险,往刚清空的容器里写恰恰是"重新填充"(安全)。
|
|
307
|
-
// 判据:配对 `]` 之后的下一个实义 token 若是 `=`/复合赋值,按写回处理(撤销清空),不报。
|
|
308
|
-
if (idx && (idx.type === 'num' || idx.type === 'ident') && !isWriteSubscript(tokens, i, to)) {
|
|
309
|
-
out.push({ line: t.line, obj, clearLine: cleared.line, clearOp: cleared.op, accessOp: `[${idx.value}]` });
|
|
310
|
-
clearMap.delete(obj);
|
|
311
|
-
} else if (idx && isWriteSubscript(tokens, i, to)) {
|
|
312
|
-
clearMap.delete(obj); // 写入 = 重新填充,撤销清空标记(与 push/set 同口径)
|
|
313
|
-
}
|
|
314
|
-
}
|
|
315
|
-
return i;
|
|
316
|
-
}
|
|
317
|
-
|
|
318
|
-
/** `obj[...]` 是否是**写入**目标(配对 `]` 后紧跟 `=` / 复合赋值)。 */
|
|
319
|
-
function isWriteSubscript(tokens, objIdx, to) {
|
|
320
|
-
// 方括号配对自己走(brace.js 的 matchBrace 只处理 {},且返回数组)
|
|
321
|
-
let depth = 0;
|
|
322
|
-
let close = -1;
|
|
323
|
-
for (let k = objIdx + 1; k <= to && k < tokens.length; k++) {
|
|
324
|
-
const tk = tokens[k];
|
|
325
|
-
if (tk.type !== 'punct') continue;
|
|
326
|
-
if (tk.value === '[') depth++;
|
|
327
|
-
else if (tk.value === ']') {
|
|
328
|
-
depth--;
|
|
329
|
-
if (depth === 0) { close = k; break; }
|
|
330
|
-
}
|
|
331
|
-
}
|
|
332
|
-
if (close < 0) return false;
|
|
333
|
-
const after = nextNonWs(tokens, close + 1, to);
|
|
334
|
-
if (!after || after.type !== 'punct') return false;
|
|
335
|
-
return ['=', '+=', '-=', '*=', '/='].includes(after.value);
|
|
336
|
-
}
|
|
337
|
-
|
|
338
|
-
/**
|
|
339
|
-
* 在单个函数体区间内判定「清空后访问」。
|
|
340
|
-
*
|
|
341
|
-
* @param {Array} tokens token 流
|
|
342
|
-
* @param {number} from 区间起点(含)
|
|
343
|
-
* @param {number} to 区间终点(含)
|
|
344
|
-
* @returns {Array<{line:number, obj:string, clearLine:number, clearOp:string, accessOp:string}>}
|
|
345
|
-
*/
|
|
346
|
-
function scanClearThenAccess(tokens, from, to) {
|
|
347
|
-
const out = [];
|
|
348
|
-
const clearMap = new Map(); // obj -> { line, op }
|
|
349
|
-
for (let i = from; i <= to; i++) {
|
|
350
|
-
const t = tokens[i];
|
|
351
|
-
if (t.type !== 'ident') continue;
|
|
352
|
-
const identName = t.value;
|
|
353
|
-
const nxt = tokens[i + 1];
|
|
354
|
-
const memberIdx = (nxt?.type === 'punct' && nxt.value === '.') ? i + 2 : -1;
|
|
355
|
-
const member = memberIdx >= 0 && tokens[memberIdx]?.type === 'ident' ? tokens[memberIdx].value : null;
|
|
356
|
-
const callOpen = memberIdx >= 0 && tokens[memberIdx + 1]?.type === 'punct' && tokens[memberIdx + 1].value === '(';
|
|
357
|
-
|
|
358
|
-
if (callOpen && WRITE_METHODS.has(member)) {
|
|
359
|
-
clearMap.delete(identName);
|
|
360
|
-
continue;
|
|
361
|
-
}
|
|
362
|
-
if (applyArgWriteback(tokens, i, nxt, identName, clearMap)) continue;
|
|
363
|
-
if (applyAssignClearOrWriteback(tokens, i, to, t, nxt, identName, clearMap)) continue;
|
|
364
|
-
const afterClear = applyClearMethods(t, member, memberIdx, callOpen, tokens, identName, clearMap, i);
|
|
365
|
-
if (afterClear !== i) { i = afterClear; continue; }
|
|
366
|
-
i = applyAccessAfterClear(t, nxt, member, memberIdx, callOpen, tokens, i, identName, clearMap, out, to);
|
|
367
|
-
}
|
|
368
|
-
return out;
|
|
369
|
-
}
|
|
370
|
-
|
|
371
|
-
/**
|
|
372
|
-
* 三层审计 L2 入口:同函数「清空后访问」数据流检测。
|
|
373
|
-
*
|
|
374
|
-
* @param {string} text 文件全文
|
|
375
|
-
* @returns {Array<{line:number, obj:string, clearLine:number, clearOp:string, accessOp:string}>}
|
|
376
|
-
*/
|
|
377
|
-
export function checkClearAccessAst(text = '') {
|
|
378
|
-
const tokens = tokenize(text);
|
|
379
|
-
const bodies = collectFnBodies(tokens, String(text || ''));
|
|
380
|
-
const seen = new Set(); // 去重(同一行同对象只报一次)
|
|
381
|
-
const out = [];
|
|
382
|
-
for (const [from, to] of bodies) {
|
|
383
|
-
for (const hit of scanClearThenAccess(tokens, from, to)) {
|
|
384
|
-
const key = `${hit.line}:${hit.obj}`;
|
|
385
|
-
if (seen.has(key)) continue;
|
|
386
|
-
seen.add(key);
|
|
387
|
-
out.push(hit);
|
|
388
|
-
}
|
|
389
|
-
}
|
|
390
|
-
return out;
|
|
391
|
-
}
|
package/lib/ast/dup-code.js
DELETED
|
@@ -1,165 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* AST 实现层 · 重复代码检测(抽公共函数候选)
|
|
3
|
-
*
|
|
4
|
-
* 判定标准(量化判定标准,量化版):
|
|
5
|
-
* 「三处重复、五行以上、未来会改」——满足就抽。本检测自动化前两条:
|
|
6
|
-
* · 重复次数 ≥ 3 处(2 次观察,3 次必须抽)
|
|
7
|
-
* · 函数体 ≥ 5 行(少于 5 行的重复,抽出来反而增加跳转成本)
|
|
8
|
-
* 第三条「未来会改」无法静态判定,留给人工。
|
|
9
|
-
*
|
|
10
|
-
* 不该抽的形态(自动排除):
|
|
11
|
-
* · 纯语法糖/单行表达式(如 arr.filter(x => x))
|
|
12
|
-
* · 依赖 this/闭包状态、参数是上下文对象(无法安全抽取)
|
|
13
|
-
* · 布尔 flag 参数控制分支的「伪公共」函数
|
|
14
|
-
* · 参数 > 5 个(职责不清)
|
|
15
|
-
* · test/ 夹具内的重复(测试各自独立,抽公共测试工具另说)
|
|
16
|
-
*
|
|
17
|
-
* 归一化策略(找"结构相同"而非"文本相同"的重复):
|
|
18
|
-
* 变量名符号化(ident → V)、数字符号化(num → N)、字符串保留原文
|
|
19
|
-
* (字符串内容不同通常语义不同)、注释与空白剔除。这样
|
|
20
|
-
* `const a = x + 1` 与 `const total = count + 1` 视为同一结构。
|
|
21
|
-
*/
|
|
22
|
-
|
|
23
|
-
import { tokenize } from './tokenizer.js';
|
|
24
|
-
import { collectNamedFnRanges } from './callgraph.js';
|
|
25
|
-
|
|
26
|
-
/** 重复判定阈值:同一结构函数体出现 ≥ 此数即候选(量化标准:≥3 处必须抽)。 */
|
|
27
|
-
const DUP_COUNT_MIN = 3;
|
|
28
|
-
/** 函数体最少行数:少于 5 行的重复不值得抽(跳转成本 > 收益)。 */
|
|
29
|
-
const DUP_LINES_MIN = 5;
|
|
30
|
-
/** 参数上限:超过 5 个参数的函数不报(职责不清,抽了也难维护)。 */
|
|
31
|
-
const PARAMS_MAX = 5;
|
|
32
|
-
/** 布尔 flag 参数名清单(有这些参数的函数视为"伪公共",不报)。 */
|
|
33
|
-
const BOOL_FLAG_NAMES = new Set(['flag', 'force', 'enabled', 'disabled', 'dryRun', 'dryrun', 'isAdmin', 'isMobile', 'isDark', 'verbose', 'quiet', 'useCache', 'skipCache', 'silent']);
|
|
34
|
-
|
|
35
|
-
/**
|
|
36
|
-
* 提取单个文件的具名函数体,归一化后返回候选列表。
|
|
37
|
-
* @param {string} text 文件全文
|
|
38
|
-
* @param {string} file 文件路径(供 finding 定位)
|
|
39
|
-
* @returns {Array<{file:string, name:string, line:number, hash:string, lines:number, params:number, hasBoolFlag:boolean}>}
|
|
40
|
-
*/
|
|
41
|
-
export function collectDupCodeCandidates(text, file = '') {
|
|
42
|
-
const tokens = tokenize(text);
|
|
43
|
-
const ranges = collectNamedFnRanges(tokens);
|
|
44
|
-
const out = [];
|
|
45
|
-
for (const [name, [openIdx, closeIdx]] of ranges) {
|
|
46
|
-
if (!name || name === '(匿名)') continue;
|
|
47
|
-
// 提取函数体 token(openIdx+1 .. closeIdx-1,跳过 {} 本身)
|
|
48
|
-
const bodyTokens = tokens.slice(openIdx + 1, closeIdx);
|
|
49
|
-
// 行数:函数体 token 跨度(openIdx 的 { 到 closeIdx 的 },含两端)——视觉行数,
|
|
50
|
-
// 与量化标准「重复行数 ≥5」的口径一致(5 行 = 从 function 签名行到闭括号行)
|
|
51
|
-
if (closeIdx <= openIdx) continue;
|
|
52
|
-
const bodyLines = tokens[closeIdx].line - tokens[openIdx].line + 1;
|
|
53
|
-
if (bodyLines < DUP_LINES_MIN) continue;
|
|
54
|
-
|
|
55
|
-
// 归一化哈希:变量名/数字符号化,剔 ws/comment,字符串保留
|
|
56
|
-
const parts = [];
|
|
57
|
-
for (const t of bodyTokens) {
|
|
58
|
-
if (t.type === 'ws' || t.type === 'comment') continue;
|
|
59
|
-
if (t.type === 'ident') parts.push('V');
|
|
60
|
-
else if (t.type === 'num') parts.push('N');
|
|
61
|
-
else if (t.type === 'str' || t.type === 'tmpl') parts.push(`S(${t.value.length})`); // 字符串按长度,避免「内容不同但结构同」误合并
|
|
62
|
-
else parts.push(t.value);
|
|
63
|
-
}
|
|
64
|
-
if (parts.length < 8) continue; // 函数体太短(<8 token)视为语法糖,不值得抽
|
|
65
|
-
const hash = parts.join('\u0001'); // 用不可打印分隔符,避免与 || 等运算符字符冲突
|
|
66
|
-
|
|
67
|
-
// 参数个数与布尔 flag 判定(从函数签名 token 区间取——openIdx 之前的 '(' ... ')')
|
|
68
|
-
const params = countParams(tokens, openIdx);
|
|
69
|
-
const hasBoolFlag = hasBoolFlagParam(tokens, openIdx);
|
|
70
|
-
|
|
71
|
-
// 纯语法糖排除:函数体归一化后 ≤ 2 种 token 类型 且 无 ident → 如 (x) => x
|
|
72
|
-
const typeSet = new Set(parts);
|
|
73
|
-
if (typeSet.size <= 1) continue; // 全是同一符号(如 V|V|V)→ 语法糖
|
|
74
|
-
|
|
75
|
-
out.push({ file, name, line: tokens[openIdx].line, hash, lines: bodyLines, params, hasBoolFlag });
|
|
76
|
-
}
|
|
77
|
-
return out;
|
|
78
|
-
}
|
|
79
|
-
|
|
80
|
-
/**
|
|
81
|
-
* 跨文件聚合重复候选:同一归一化结构出现 ≥3 处的函数体。
|
|
82
|
-
* @param {Array<Array<{file,name,line,hash,lines,params,hasBoolFlag}>>} perFileCandidates
|
|
83
|
-
* @param {object} [opts] { minLines=5, minOccurrences=3 } 阈值(可被规则 yml 覆盖)
|
|
84
|
-
* @returns {Array<{hash:string, lines:number, instances:Array<{file,name,line}>}>}
|
|
85
|
-
*/
|
|
86
|
-
export function findDuplicateBodies(perFileCandidates, opts = {}) {
|
|
87
|
-
const minLines = Number(opts.minLines) || DUP_LINES_MIN;
|
|
88
|
-
const minOcc = Number(opts.minOccurrences) || DUP_COUNT_MIN;
|
|
89
|
-
const byHash = new Map();
|
|
90
|
-
for (const list of perFileCandidates) {
|
|
91
|
-
for (const c of list) {
|
|
92
|
-
if (c.hasBoolFlag) continue; // 伪公共不报
|
|
93
|
-
if (c.params > PARAMS_MAX) continue; // 参数太多不报
|
|
94
|
-
if (c.lines < minLines) continue; // 行数不足不报
|
|
95
|
-
if (!byHash.has(c.hash)) byHash.set(c.hash, []);
|
|
96
|
-
byHash.get(c.hash).push(c);
|
|
97
|
-
}
|
|
98
|
-
}
|
|
99
|
-
const out = [];
|
|
100
|
-
for (const [hash, instances] of byHash) {
|
|
101
|
-
// 同一结构出现 ≥ 阈值即报(量化标准:2 次观察、3 次必须抽)——
|
|
102
|
-
// 不区分同文件/跨文件:同文件 3 个相同函数体同样是「该抽」信号
|
|
103
|
-
if (instances.length >= minOcc) {
|
|
104
|
-
out.push({ hash, lines: instances[0].lines, instances });
|
|
105
|
-
}
|
|
106
|
-
}
|
|
107
|
-
// 行数多的优先(更值得抽)
|
|
108
|
-
out.sort((a, b) => b.lines - a.lines);
|
|
109
|
-
return out;
|
|
110
|
-
}
|
|
111
|
-
|
|
112
|
-
/** 从函数体 openIdx 回找签名括号,数参数个数(顶层逗号 + 1;无参数 0)。 */
|
|
113
|
-
function countParams(tokens, openIdx) {
|
|
114
|
-
let closeIdx = -1;
|
|
115
|
-
let parenDepth = 0;
|
|
116
|
-
// 回找与 openIdx 前最近的 ')' 配对的 '(':从 openIdx-1 向左扫
|
|
117
|
-
for (let j = openIdx - 1; j >= 0; j--) {
|
|
118
|
-
const t = tokens[j];
|
|
119
|
-
if (t.type !== 'punct') continue;
|
|
120
|
-
if (t.value === ')') { parenDepth++; closeIdx = j; break; }
|
|
121
|
-
if (t.value === ';' || t.value === '{') break;
|
|
122
|
-
}
|
|
123
|
-
if (closeIdx === -1) return 0;
|
|
124
|
-
// 在 closeIdx 内找配对 '('
|
|
125
|
-
let depth = 0, openParen = -1;
|
|
126
|
-
for (let j = closeIdx; j >= 0; j--) {
|
|
127
|
-
const t = tokens[j];
|
|
128
|
-
if (t.type !== 'punct') continue;
|
|
129
|
-
if (t.value === ')') depth++;
|
|
130
|
-
else if (t.value === '(') { depth--; if (depth === 0) { openParen = j; break; } }
|
|
131
|
-
}
|
|
132
|
-
if (openParen === -1) return 0;
|
|
133
|
-
let commas = 0;
|
|
134
|
-
let inner = 0;
|
|
135
|
-
for (let j = openParen + 1; j < closeIdx; j++) {
|
|
136
|
-
const t = tokens[j];
|
|
137
|
-
if (t.type !== 'punct') continue;
|
|
138
|
-
if (t.value === '(' || t.value === '[' || t.value === '{') inner++;
|
|
139
|
-
else if (t.value === ')' || t.value === ']' || t.value === '}') inner--;
|
|
140
|
-
else if (t.value === ',' && inner === 0) commas++;
|
|
141
|
-
}
|
|
142
|
-
return commas + (closeIdx - openParen > 1 ? 1 : 0);
|
|
143
|
-
}
|
|
144
|
-
|
|
145
|
-
/** 签名括号内是否含布尔 flag 参数名。 */
|
|
146
|
-
function hasBoolFlagParam(tokens, openIdx) {
|
|
147
|
-
let closeIdx = -1;
|
|
148
|
-
for (let j = openIdx - 1; j >= 0; j--) {
|
|
149
|
-
const t = tokens[j];
|
|
150
|
-
if (t.type !== 'punct') continue;
|
|
151
|
-
if (t.value === ')') { closeIdx = j; break; }
|
|
152
|
-
if (t.value === ';' || t.value === '{') break;
|
|
153
|
-
}
|
|
154
|
-
if (closeIdx === -1) return false;
|
|
155
|
-
// 从 closeIdx 向左扫到签名 '(':ident 是参数名,命中布尔 flag 词表即伪公共
|
|
156
|
-
for (let j = closeIdx; j >= 0; j--) {
|
|
157
|
-
const t = tokens[j];
|
|
158
|
-
if (t.type === 'punct') {
|
|
159
|
-
if (t.value === '(') break; // 到签名起点
|
|
160
|
-
continue;
|
|
161
|
-
}
|
|
162
|
-
if (t.type === 'ident' && BOOL_FLAG_NAMES.has(t.value)) return true;
|
|
163
|
-
}
|
|
164
|
-
return false;
|
|
165
|
-
}
|