pmat 3.11.0

PMAT - Zero-config AI context generation and code quality toolkit (CLI, MCP, HTTP)
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156

// Included from accurate_complexity_analyzer.rs — NO use imports or #! attributes

/// AST visitor for calculating complexity metrics
struct ComplexityVisitor {
    cyclomatic: u32,
    cognitive: u32,
    nesting_level: u32,
    function_name: Option<String>,
}

impl ComplexityVisitor {
    fn new() -> Self {
        Self {
            cyclomatic: 1, // Base complexity
            cognitive: 0,
            nesting_level: 0,
            function_name: None,
        }
    }

    fn with_function_name(mut self, name: String) -> Self {
        self.function_name = Some(name);
        self
    }

    fn add_cyclomatic(&mut self, amount: u32) {
        self.cyclomatic += amount;
    }

    fn add_cognitive(&mut self, base: u32) {
        // Add base cognitive complexity plus nesting penalty
        // According to SonarSource spec, nesting adds extra cognitive load
        self.cognitive += base + self.nesting_level;
    }
}

impl ComplexityVisitor {
    fn visit_if_expr(&mut self, if_expr: &syn::ExprIf) {
        self.add_cyclomatic(1);
        self.add_cognitive(1);

        self.visit_expr(&if_expr.cond);
        self.nesting_level += 1;
        for stmt in &if_expr.then_branch.stmts {
            self.visit_stmt(stmt);
        }
        self.nesting_level -= 1;

        if let Some((_, else_expr)) = &if_expr.else_branch {
            self.visit_else_branch(else_expr);
        }
    }

    fn visit_else_branch(&mut self, else_expr: &Expr) {
        match else_expr {
            Expr::If(_) => self.visit_expr(else_expr),
            _ => {
                self.nesting_level += 1;
                self.visit_expr(else_expr);
                self.nesting_level -= 1;
            }
        }
    }

    fn visit_match_expr(&mut self, match_expr: &syn::ExprMatch) {
        self.add_cyclomatic(1);
        self.add_cognitive(1);
        self.visit_expr(&match_expr.expr);

        for arm in &match_expr.arms {
            if let Some((_, guard)) = &arm.guard {
                self.add_cyclomatic(1);
                self.add_cognitive(1);
                self.visit_expr(guard);
            }
        }

        self.nesting_level += 1;
        for arm in &match_expr.arms {
            self.visit_expr(&arm.body);
        }
        self.nesting_level -= 1;
    }

    fn visit_loop_body_stmts(&mut self, stmts: &[Stmt]) {
        self.add_cyclomatic(1);
        self.add_cognitive(1);
        self.nesting_level += 1;
        for stmt in stmts {
            self.visit_stmt(stmt);
        }
        self.nesting_level -= 1;
    }

    fn check_recursive_call(&mut self, call: &syn::ExprCall) {
        let is_recursive = matches!(
            call.func.as_ref(),
            Expr::Path(path) if path.path.segments.last()
                .map(|seg| self.function_name.as_ref().is_some_and(|name| seg.ident == name))
                .unwrap_or(false)
        );
        if is_recursive {
            self.add_cognitive(1);
        }
    }
}

impl<'ast> Visit<'ast> for ComplexityVisitor {
    fn visit_expr(&mut self, expr: &'ast Expr) {
        match expr {
            Expr::If(if_expr) => self.visit_if_expr(if_expr),
            Expr::Match(match_expr) => self.visit_match_expr(match_expr),
            Expr::While(w) => {
                self.visit_expr(&w.cond);
                self.visit_loop_body_stmts(&w.body.stmts);
            }
            Expr::ForLoop(f) => {
                self.visit_expr(&f.expr);
                self.visit_loop_body_stmts(&f.body.stmts);
            }
            Expr::Loop(l) => self.visit_loop_body_stmts(&l.body.stmts),
            Expr::Binary(bin) => {
                use syn::BinOp;
                if matches!(bin.op, BinOp::And(_) | BinOp::Or(_)) {
                    self.add_cyclomatic(1);
                    self.add_cognitive(1);
                }
                syn::visit::visit_expr(self, expr);
            }
            Expr::Try(_) => {
                self.add_cyclomatic(1);
                self.add_cognitive(1);
                syn::visit::visit_expr(self, expr);
            }
            Expr::Break(_) | Expr::Continue(_) => {
                self.add_cognitive(1);
                syn::visit::visit_expr(self, expr);
            }
            Expr::Return(_) => {
                if self.nesting_level > 0 {
                    self.add_cognitive(1);
                }
                syn::visit::visit_expr(self, expr);
            }
            Expr::Call(call) => {
                self.check_recursive_call(call);
                syn::visit::visit_expr(self, expr);
            }
            _ => syn::visit::visit_expr(self, expr),
        }
    }

    fn visit_stmt(&mut self, stmt: &'ast Stmt) {
        syn::visit::visit_stmt(self, stmt);
    }
}