hotspots-core 1.26.0

Core library for static analysis and Local Risk Score (LRS) computation across TypeScript, JavaScript, Go, Python, Rust, Java, C#, and C
Documentation
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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
//! C# CFG builder implementation

use crate::ast::FunctionNode;
use crate::cfg::{Cfg, NodeId, NodeKind};
use crate::language::cfg_builder::CfgBuilder;
use crate::language::tree_sitter_utils::{
    find_child_by_kind, find_function_by_start, with_cached_csharp_tree,
};
use tree_sitter::Node;

pub struct CSharpCfgBuilder;

impl CfgBuilder for CSharpCfgBuilder {
    fn build(&self, function: &FunctionNode) -> Cfg {
        let (_body_node_id, source) = function.body.as_csharp();

        let result = with_cached_csharp_tree(source, |root| {
            let func_node = find_function_by_start(
                root,
                function.span.start,
                &[
                    "method_declaration",
                    "constructor_declaration",
                    "local_function_statement",
                    "operator_declaration",
                    "conversion_operator_declaration",
                ],
            )?;
            let body_node = find_child_by_kind(func_node, "block")?;
            let mut builder = CSharpCfgBuilderState::new();
            builder.build_from_block(&body_node, source);
            Some(builder.cfg)
        });

        result.unwrap_or_else(|| {
            let mut cfg = Cfg::new();
            cfg.add_edge(cfg.entry, cfg.exit);
            cfg
        })
    }
}

struct CSharpCfgBuilderState {
    cfg: Cfg,
    current_node: Option<NodeId>,
    loop_stack: Vec<LoopContext>,
}

struct LoopContext {
    break_target: NodeId,
    continue_target: NodeId,
}

impl CSharpCfgBuilderState {
    fn new() -> Self {
        let cfg = Cfg::new();
        let entry = cfg.entry;
        CSharpCfgBuilderState {
            cfg,
            current_node: Some(entry),
            loop_stack: Vec::new(),
        }
    }

    fn build_from_block(&mut self, block: &Node, source: &str) {
        let mut cursor = block.walk();
        for child in block.children(&mut cursor) {
            if child.is_named() {
                self.visit_node(&child, source);
            }
        }

        if let Some(last_node) = self.current_node {
            if last_node != self.cfg.exit {
                let has_exit_edge = self
                    .cfg
                    .edges
                    .iter()
                    .any(|e| e.from == last_node && e.to == self.cfg.exit);
                if !has_exit_edge {
                    self.cfg.add_edge(last_node, self.cfg.exit);
                }
            }
        }
    }

    fn visit_node(&mut self, node: &Node, source: &str) {
        match node.kind() {
            "if_statement" => self.visit_if(node, source),
            "while_statement" => self.visit_while(node, source),
            "do_statement" => self.visit_do_while(node, source),
            "for_statement" => self.visit_for(node, source),
            "foreach_statement" => self.visit_foreach(node, source),
            "switch_statement" => self.visit_switch(node, source),
            "try_statement" => self.visit_try(node, source),
            "return_statement" => self.visit_return(),
            "throw_statement" => self.visit_throw(),
            "break_statement" => self.visit_break(),
            "continue_statement" => self.visit_continue(),
            "local_function_statement" => {
                // Local functions are discovered separately; skip the body here
            }
            _ => self.visit_simple_statement(),
        }
    }

    fn visit_if(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let condition = self.cfg.add_node(NodeKind::Condition);
        self.cfg.add_edge(current, condition);

        let join = self.cfg.add_node(NodeKind::Statement);

        // Then branch: first "block" child
        let then_block = find_child_by_kind(*node, "block");
        if let Some(block) = then_block {
            self.current_node = Some(condition);
            self.visit_block(&block, source);
            if let Some(last) = self.current_node {
                if last != self.cfg.exit {
                    self.cfg.add_edge(last, join);
                }
            }
        } else {
            self.cfg.add_edge(condition, join);
        }

        // Else branch: "else_clause" child
        let else_clause = find_child_by_kind(*node, "else_clause");
        if let Some(else_node) = else_clause {
            self.current_node = Some(condition);
            let mut cursor = else_node.walk();
            for child in else_node.children(&mut cursor) {
                if child.is_named() {
                    if child.kind() == "if_statement" {
                        self.visit_if(&child, source);
                    } else if child.kind() == "block" {
                        self.visit_block(&child, source);
                    }
                }
            }
            if let Some(last) = self.current_node {
                if last != self.cfg.exit {
                    self.cfg.add_edge(last, join);
                }
            }
        } else {
            self.cfg.add_edge(condition, join);
        }

        self.current_node = Some(join);
    }

    fn visit_while(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let condition = self.cfg.add_node(NodeKind::Condition);
        self.cfg.add_edge(current, condition);

        let after_loop = self.cfg.add_node(NodeKind::Statement);

        self.loop_stack.push(LoopContext {
            break_target: after_loop,
            continue_target: condition,
        });

        if let Some(body) = find_child_by_kind(*node, "block") {
            self.current_node = Some(condition);
            self.visit_block(&body, source);
            if let Some(last) = self.current_node {
                if last != self.cfg.exit {
                    self.cfg.add_edge(last, condition);
                }
            }
        }

        self.cfg.add_edge(condition, after_loop);
        self.loop_stack.pop();
        self.current_node = Some(after_loop);
    }

    fn visit_do_while(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let body_entry = self.cfg.add_node(NodeKind::Statement);
        self.cfg.add_edge(current, body_entry);

        let condition = self.cfg.add_node(NodeKind::Condition);
        let after_loop = self.cfg.add_node(NodeKind::Statement);

        self.loop_stack.push(LoopContext {
            break_target: after_loop,
            continue_target: condition,
        });

        if let Some(body) = find_child_by_kind(*node, "block") {
            self.current_node = Some(body_entry);
            self.visit_block(&body, source);
            if let Some(last) = self.current_node {
                if last != self.cfg.exit {
                    self.cfg.add_edge(last, condition);
                }
            }
        } else {
            self.cfg.add_edge(body_entry, condition);
        }

        self.cfg.add_edge(condition, body_entry);
        self.cfg.add_edge(condition, after_loop);
        self.loop_stack.pop();
        self.current_node = Some(after_loop);
    }

    fn visit_for(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let condition = self.cfg.add_node(NodeKind::Condition);
        self.cfg.add_edge(current, condition);

        let after_loop = self.cfg.add_node(NodeKind::Statement);

        self.loop_stack.push(LoopContext {
            break_target: after_loop,
            continue_target: condition,
        });

        if let Some(body) = find_child_by_kind(*node, "block") {
            self.current_node = Some(condition);
            self.visit_block(&body, source);
            if let Some(last) = self.current_node {
                if last != self.cfg.exit {
                    self.cfg.add_edge(last, condition);
                }
            }
        }

        self.cfg.add_edge(condition, after_loop);
        self.loop_stack.pop();
        self.current_node = Some(after_loop);
    }

    fn visit_foreach(&mut self, node: &Node, source: &str) {
        // foreach is structurally identical to for from a CFG perspective
        self.visit_for(node, source);
    }

    fn visit_switch(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let switch_node = self.cfg.add_node(NodeKind::Condition);
        self.cfg.add_edge(current, switch_node);

        let join = self.cfg.add_node(NodeKind::Statement);

        self.loop_stack.push(LoopContext {
            break_target: join,
            continue_target: join,
        });

        // C# switch_statement contains a switch_body with switch_section children
        if let Some(body) = find_child_by_kind(*node, "switch_body") {
            let mut cursor = body.walk();
            let mut has_default = false;

            for child in body.children(&mut cursor) {
                if child.kind() == "switch_section" {
                    let case_node = self.cfg.add_node(NodeKind::Statement);
                    self.cfg.add_edge(switch_node, case_node);

                    // Check for default label
                    let mut inner = child.walk();
                    for label in child.children(&mut inner) {
                        if label.kind() == "default_switch_label" {
                            has_default = true;
                        }
                    }

                    self.current_node = Some(case_node);
                    let mut stmt_cursor = child.walk();
                    for stmt in child.children(&mut stmt_cursor) {
                        if stmt.is_named()
                            && stmt.kind() != "case_switch_label"
                            && stmt.kind() != "default_switch_label"
                        {
                            self.visit_node(&stmt, source);
                        }
                    }

                    if let Some(last) = self.current_node {
                        if last != self.cfg.exit {
                            self.cfg.add_edge(last, join);
                        }
                    }
                }
            }

            if !has_default {
                self.cfg.add_edge(switch_node, join);
            }
        } else {
            self.cfg.add_edge(switch_node, join);
        }

        self.loop_stack.pop();
        self.current_node = Some(join);
    }

    fn visit_try(&mut self, node: &Node, source: &str) {
        let Some(current) = self.current_node else {
            return;
        };

        let try_entry = self.cfg.add_node(NodeKind::Statement);
        self.cfg.add_edge(current, try_entry);

        let mut branch_ends = Vec::new();

        if let Some(try_body) = find_child_by_kind(*node, "block") {
            self.current_node = Some(try_entry);
            self.visit_block(&try_body, source);
            if let Some(last) = self.current_node {
                branch_ends.push(last);
            }
        } else {
            branch_ends.push(try_entry);
        }

        // catch_clause children
        let mut cursor = node.walk();
        for child in node.children(&mut cursor) {
            if child.kind() == "catch_clause" {
                let catch_node = self.cfg.add_node(NodeKind::Condition);
                self.cfg.add_edge(try_entry, catch_node);

                if let Some(catch_body) = find_child_by_kind(child, "block") {
                    self.current_node = Some(catch_node);
                    self.visit_block(&catch_body, source);
                    if let Some(last) = self.current_node {
                        branch_ends.push(last);
                    }
                } else {
                    branch_ends.push(catch_node);
                }
            }
        }

        let non_exit: Vec<_> = branch_ends
            .into_iter()
            .filter(|&end| end != self.cfg.exit)
            .collect();

        if !non_exit.is_empty() {
            let join = self.cfg.add_node(NodeKind::Statement);
            for end in non_exit {
                self.cfg.add_edge(end, join);
            }
            self.current_node = Some(join);
        } else {
            self.current_node = Some(self.cfg.exit);
        }
    }

    fn visit_return(&mut self) {
        if let Some(current) = self.current_node {
            self.cfg.add_edge(current, self.cfg.exit);
            self.current_node = None;
        }
    }

    fn visit_throw(&mut self) {
        if let Some(current) = self.current_node {
            self.cfg.add_edge(current, self.cfg.exit);
            self.current_node = None;
        }
    }

    fn visit_break(&mut self) {
        if let Some(current) = self.current_node {
            if let Some(ctx) = self.loop_stack.last() {
                self.cfg.add_edge(current, ctx.break_target);
            } else {
                self.cfg.add_edge(current, self.cfg.exit);
            }
            self.current_node = None;
        }
    }

    fn visit_continue(&mut self) {
        if let Some(current) = self.current_node {
            if let Some(ctx) = self.loop_stack.last() {
                self.cfg.add_edge(current, ctx.continue_target);
            } else {
                self.cfg.add_edge(current, self.cfg.exit);
            }
            self.current_node = None;
        }
    }

    fn visit_simple_statement(&mut self) {
        if let Some(current) = self.current_node {
            let node = self.cfg.add_node(NodeKind::Statement);
            self.cfg.add_edge(current, node);
            self.current_node = Some(node);
        }
    }

    fn visit_block(&mut self, block: &Node, source: &str) {
        let mut cursor = block.walk();
        for child in block.children(&mut cursor) {
            if child.is_named() {
                self.visit_node(&child, source);
            }
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::ast::FunctionId;
    use crate::language::{FunctionBody, SourceSpan};

    fn make_test_function(source: &str, start_byte: usize, end_byte: usize) -> FunctionNode {
        FunctionNode {
            id: FunctionId {
                file_index: 0,
                local_index: 0,
            },
            name: Some("test".to_string()),
            span: SourceSpan::new(start_byte, end_byte, 1, 1, 0),
            body: FunctionBody::CSharp {
                body_node: 0,
                source: source.to_string(),
            },
            suppression_reason: None,
        }
    }

    #[test]
    fn test_simple_method() {
        let source = r#"
public class Test {
    public void Foo() {
        int x = 1;
    }
}
"#;
        let start = source.find("public void Foo").unwrap();
        let function = make_test_function(source, start, source.len());
        let cfg = CSharpCfgBuilder.build(&function);
        cfg.validate().unwrap();
        assert!(cfg.node_count() >= 2);
    }

    #[test]
    fn test_if_statement() {
        let source = r#"
public class Test {
    public void Foo(int x) {
        if (x > 0) {
            return;
        }
    }
}
"#;
        let start = source.find("public void Foo").unwrap();
        let function = make_test_function(source, start, source.len());
        let cfg = CSharpCfgBuilder.build(&function);
        cfg.validate().unwrap();
        assert!(cfg.node_count() >= 3);
    }

    #[test]
    fn test_while_loop() {
        let source = r#"
public class Test {
    public void Foo(int n) {
        int i = 0;
        while (i < n) {
            i++;
        }
    }
}
"#;
        let start = source.find("public void Foo").unwrap();
        let function = make_test_function(source, start, source.len());
        let cfg = CSharpCfgBuilder.build(&function);
        cfg.validate().unwrap();
        assert!(cfg.node_count() >= 3);
    }

    #[test]
    fn test_foreach_loop() {
        let source = r#"
public class Test {
    public void Foo(int[] items) {
        foreach (var item in items) {
            Console.WriteLine(item);
        }
    }
}
"#;
        let start = source.find("public void Foo").unwrap();
        let function = make_test_function(source, start, source.len());
        let cfg = CSharpCfgBuilder.build(&function);
        cfg.validate().unwrap();
        assert!(cfg.node_count() >= 3);
    }

    #[test]
    fn test_try_catch() {
        let source = r#"
public class Test {
    public void Foo(int x) {
        try {
            int result = 10 / x;
        } catch (DivideByZeroException e) {
            Console.WriteLine("error");
        }
    }
}
"#;
        let start = source.find("public void Foo").unwrap();
        let function = make_test_function(source, start, source.len());
        let cfg = CSharpCfgBuilder.build(&function);
        cfg.validate().unwrap();
        assert!(cfg.node_count() >= 4);
    }
}