1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//! `Cognitive` implementation for Lua.
#![allow(
clippy::enum_glob_use,
clippy::match_same_arms,
clippy::needless_pass_by_value,
clippy::wildcard_imports
)]
#![allow(
clippy::cast_precision_loss,
clippy::cast_possible_truncation,
clippy::cast_sign_loss
)]
use super::*;
impl Cognitive for LuaCode {
fn compute<'a>(
node: &Node<'a>,
_code: &'a [u8],
stats: &mut Stats,
nesting_map: &mut HashMap<usize, (usize, usize, usize)>,
) {
use Lua::*;
let (mut nesting, mut depth, mut lambda) = get_nesting_from_map(node, nesting_map);
match node.kind_id().into() {
// `is_else_if` returns true for `ElseifStatement`, but Lua's
// grammar makes that node a child field of `IfStatement` rather
// than a nested `if_statement`, so the guard is defensive only.
IfStatement if !Self::is_else_if(node) => {
increase_nesting(stats, &mut nesting, depth, lambda);
}
// `elseif` adds +1 at the same nesting level as the parent `if`,
// matching how Tcl/Bash handle their dedicated elseif/elif nodes.
ElseifStatement => {
increment_branch_extension(stats);
}
ForStatement | WhileStatement | RepeatStatement => {
increase_nesting(stats, &mut nesting, depth, lambda);
}
// `else` increments without nesting. Lua's `break` is always
// unlabeled (the grammar has no labeled break, and no
// `continue`), so per SonarSource Cognitive Complexity §B2 it
// adds +0 — the enclosing loop's nesting already accounts for
// it. Only `goto label` is a genuinely unstructured jump and
// adds +1.
ElseStatement | GotoStatement => {
increment_by_one(stats);
}
BinaryExpression => {
compute_booleans(node, stats, And, Or);
}
FunctionDeclaration | FunctionDeclaration2 | FunctionDeclaration3 => {
nesting = 0;
increment_function_depth(
&mut depth,
node,
&[
FunctionDeclaration,
FunctionDeclaration2,
FunctionDeclaration3,
],
);
}
FunctionDefinition => {
lambda += 1;
}
_ => {}
}
nesting_map.insert(node.id(), (nesting, depth, lambda));
}
}