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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
//! `Cognitive` implementation for C++.
#![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 CppCode {
fn compute<'a>(
node: &Node<'a>,
_code: &'a [u8],
ancestors: Ancestors<'a, '_>,
stats: &mut Stats,
nesting_map: &mut NestingMap,
) {
use Cpp::*;
// Macro expansion is not tracked; macros are treated as opaque tokens.
let mut nesting = get_nesting_from_map(node, nesting_map);
// A requires clause or requires-expression is compile-time and
// branches nothing, parenthesised or not, so nothing in one
// scores; cyclomatic and ABC agree (#1533).
let opens = matches!(node.kind_id().into(), RequiresClause | RequiresExpression);
let in_constraint = stats.constraint.covers(node, opens);
match node.kind_id().into() {
_ if in_constraint => {}
IfStatement if !Self::is_else_if(node, ancestors) => {
increase_nesting(stats, &mut nesting);
}
ForStatement
| ForRangeLoop
| WhileStatement
| DoStatement
| SwitchStatement
| CatchClause
| ConditionalExpression => {
increase_nesting(stats, &mut nesting);
}
// `Else` here is the `else` keyword token, which the grammar
// also emits for the `else` of an `else if` — so this arm
// covers both.
GotoStatement | Else => {
increment_by_one(stats);
}
// `and` / `or` are the ISO alternative spellings of `&&` /
// `||` ([lex.digraph]) and get kinds of their own, so each is
// keyed to its symbol: a chain that mixes the spellings of
// one operator is one sequence, as it is when spelled alike
// (#1522). A fold applies its operator once, so `(... && a)`
// is one sequence too, as cyclomatic counts it once (#1533);
// a binary fold's second spelling continues it.
BinaryExpression2 | FoldExpression => {
compute_booleans_keyed(node, stats, |id| match id.into() {
AMPAMP | And => Some(AMPAMP as u16),
PIPEPIPE | Or => Some(PIPEPIPE as u16),
_ => None,
});
}
LambdaExpression => {
nesting.lambda += 1;
}
// At a (possibly nested) function-definition boundary, reset
// structural nesting to zero and bump the function-depth
// surcharge when this definition is itself nested inside
// another — matching Rust and the 9-of-13 sibling
// families. Without this, a method defined inside a control
// construct inherited the enclosing nesting and every nested
// definition missed the SonarSource B-nesting amplification
// (#696).
FunctionDefinition | FunctionDefinition2 | FunctionDefinition3
| FunctionDefinition4 => {
enter_function_boundary(
&mut nesting,
node,
ancestors,
&[
FunctionDefinition,
FunctionDefinition2,
FunctionDefinition3,
FunctionDefinition4,
],
);
}
_ => {}
}
nesting_map.insert(node.id(), nesting);
}
}