rapx 0.7.20

A static analysis platform for Rust program analysis and verification
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

use rustc_hir::def_id::DefId;

use std::collections::HashSet;

use crate::analysis::path_analysis::{PathNode, PathTree};
use crate::compat::{FxHashMap, FxHashSet};

use super::value::Value;
use super::{graph::*, *};

#[derive(Clone)]
struct MopStateSnapshot {
    values: Vec<Value>,
    constants: FxHashMap<usize, usize>,
    alias_sets: Vec<FxHashSet<usize>>,
}

impl<'tcx> AliasGraph<'tcx> {
    fn snapshot_state(&self) -> MopStateSnapshot {
        MopStateSnapshot {
            values: self.values.clone(),
            constants: self.constants.clone(),
            alias_sets: self.alias_sets.clone(),
        }
    }

    fn restore_state(&mut self, snapshot: &MopStateSnapshot) {
        self.values = snapshot.values.clone();
        self.constants = snapshot.constants.clone();
        self.alias_sets = snapshot.alias_sets.clone();
    }

    /// Process pre-enumerated whole-function paths via DFS on the path tree.
    ///
    /// Shared prefixes are processed once. State is saved at branch points
    /// and restored before processing sibling subtrees, avoiding redundant
    /// re-analysis of common path prefixes.
    ///
    /// If `precomputed_paths` is `Some`, it is used directly instead of
    /// re-enumerating from the internal `PathGraph`. This allows callers
    /// that have already cached a `PathTree` (e.g., via `PathAnalyzer`) to
    /// avoid redundant work.
    pub fn process_function_paths(
        &mut self,
        fn_map: &mut MopFnAliasMap,
        recursion_set: &mut HashSet<DefId>,
    ) {
        self.process_function_paths_opt(None, fn_map, recursion_set)
    }

    /// Like `process_function_paths` but accepts an optional precomputed `PathTree`.
    pub fn process_function_paths_opt(
        &mut self,
        precomputed_paths: Option<PathTree>,
        fn_map: &mut MopFnAliasMap,
        recursion_set: &mut HashSet<DefId>,
    ) {
        rap_debug!(
            "process_function_paths: def_id={:?} blocks={}",
            self.def_id(),
            self.path_graph.cfg.blocks.len()
        );
        let paths = precomputed_paths.unwrap_or_else(|| self.enumerate_paths());
        rap_debug!(
            "process_function_paths: def_id={:?} paths_enumerated={}",
            self.def_id(),
            paths.len()
        );

        let Some(root) = paths.root() else {
            return;
        };
        let mut path = Vec::new();
        let _ = self.dfs_mop(root, &mut path, fn_map, recursion_set);
    }

    fn dfs_mop(
        &mut self,
        node: &PathNode,
        path: &mut Vec<usize>,
        fn_map: &mut MopFnAliasMap,
        recursion_set: &mut HashSet<DefId>,
    ) -> Result<(), ()> {
        path.push(node.block);
        self.alias_bb(node.block);
        self.alias_bbcall(node.block, fn_map, recursion_set);

        let saved_state = self.snapshot_state();
        let saved_recursion = recursion_set.clone();

        if node.is_path_end {
            self.increment_visit_times();
            if self.visit_times() > VISIT_LIMIT {
                path.pop();
                return Err(());
            }
            self.merge_results();
        }

        for child in &node.children {
            self.restore_state(&saved_state);
            *recursion_set = saved_recursion.clone();
            self.dfs_mop(child, path, fn_map, recursion_set)?;
        }

        path.pop();
        Ok(())
    }
}