hotspots-core 1.21.1

Core library for static analysis and Local Risk Score (LRS) computation across TypeScript, JavaScript, Go, Python, Rust, Java, 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

//! Tests for Control Flow Graph

#[cfg(test)]
mod cfg_tests {
    use crate::cfg::{Cfg, NodeId, NodeKind};

    #[test]
    fn test_empty_cfg_construction() {
        let cfg = Cfg::new();
        assert_eq!(cfg.nodes.len(), 2, "Should have entry and exit nodes");
        assert_eq!(cfg.edge_count(), 0, "Empty CFG should have no edges");
        assert_eq!(cfg.node_count(), 2, "Should have exactly 2 nodes");
    }

    #[test]
    fn test_empty_cfg_validation() {
        let cfg = Cfg::new();
        let result = cfg.validate();
        assert!(
            result.is_ok(),
            "Empty CFG should validate (entry can reach exit via direct edge)"
        );
    }

    #[test]
    fn test_cfg_has_entry_and_exit() {
        let cfg = Cfg::new();
        let entry_nodes: Vec<_> = cfg
            .nodes
            .iter()
            .filter(|n| matches!(n.kind, NodeKind::Entry))
            .collect();
        let exit_nodes: Vec<_> = cfg
            .nodes
            .iter()
            .filter(|n| matches!(n.kind, NodeKind::Exit))
            .collect();

        assert_eq!(entry_nodes.len(), 1, "Should have exactly one entry node");
        assert_eq!(exit_nodes.len(), 1, "Should have exactly one exit node");
        assert_eq!(cfg.entry, entry_nodes[0].id);
        assert_eq!(cfg.exit, exit_nodes[0].id);
    }

    #[test]
    fn test_cfg_add_node() {
        let mut cfg = Cfg::new();
        let node_id = cfg.add_node(NodeKind::Statement);

        assert_eq!(
            cfg.nodes.len(),
            3,
            "Should have 3 nodes (entry, exit, statement)"
        );
        assert_eq!(node_id, NodeId(2), "Node ID should be 2");
        assert!(matches!(cfg.nodes[2].kind, NodeKind::Statement));
    }

    #[test]
    fn test_cfg_add_edge() {
        let mut cfg = Cfg::new();
        let node_id = cfg.add_node(NodeKind::Statement);
        cfg.add_edge(cfg.entry, node_id);
        cfg.add_edge(node_id, cfg.exit);

        assert_eq!(cfg.edge_count(), 2, "Should have 2 edges");
        assert_eq!(cfg.edges[0].from, cfg.entry);
        assert_eq!(cfg.edges[0].to, node_id);
        assert_eq!(cfg.edges[1].from, node_id);
        assert_eq!(cfg.edges[1].to, cfg.exit);
    }

    #[test]
    fn test_cfg_validation_reachable_from_entry() {
        let mut cfg = Cfg::new();
        let node_id = cfg.add_node(NodeKind::Statement);
        cfg.add_edge(cfg.entry, node_id);
        cfg.add_edge(node_id, cfg.exit);

        let result = cfg.validate();
        assert!(
            result.is_ok(),
            "CFG with path entry -> node -> exit should validate"
        );
    }

    #[test]
    fn test_cfg_validation_unreachable_node() {
        let mut cfg = Cfg::new();
        let _unreachable_id = cfg.add_node(NodeKind::Statement);
        // Don't add edge from entry to unreachable_id
        cfg.add_edge(cfg.entry, cfg.exit); // Entry can reach exit

        let result = cfg.validate();
        assert!(
            result.is_err(),
            "CFG with unreachable node should fail validation"
        );
        let err_msg = result.unwrap_err();
        assert!(
            err_msg.contains("not reachable") || err_msg.contains("unreachable"),
            "Error should mention unreachable nodes, got: {}",
            err_msg
        );
    }

    #[test]
    fn test_cfg_validation_entry_to_exit_direct() {
        let mut cfg = Cfg::new();
        cfg.add_edge(cfg.entry, cfg.exit);

        let result = cfg.validate();
        assert!(result.is_ok(), "CFG with entry -> exit should validate");
    }

    #[test]
    fn test_cfg_reachable_from() {
        let mut cfg = Cfg::new();
        let node1 = cfg.add_node(NodeKind::Statement);
        let node2 = cfg.add_node(NodeKind::Statement);
        cfg.add_edge(cfg.entry, node1);
        cfg.add_edge(node1, node2);
        cfg.add_edge(node2, cfg.exit);

        let reachable = cfg.reachable_from(cfg.entry);
        assert!(reachable.contains(&cfg.entry));
        assert!(reachable.contains(&node1));
        assert!(reachable.contains(&node2));
        assert!(reachable.contains(&cfg.exit));
    }

    #[test]
    fn test_cfg_reachable_to() {
        let mut cfg = Cfg::new();
        let node1 = cfg.add_node(NodeKind::Statement);
        let node2 = cfg.add_node(NodeKind::Statement);
        cfg.add_edge(cfg.entry, node1);
        cfg.add_edge(node1, node2);
        cfg.add_edge(node2, cfg.exit);

        let can_reach_exit = cfg.reachable_to(cfg.exit);
        assert!(can_reach_exit.contains(&cfg.entry));
        assert!(can_reach_exit.contains(&node1));
        assert!(can_reach_exit.contains(&node2));
        assert!(can_reach_exit.contains(&cfg.exit));
    }
}