rapx 0.6.252

A static analysis platform for use-after-free, memory leakage detection, etc
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

use annotate_snippets::{Level, Renderer, Snippet};

use once_cell::sync::OnceCell;

use crate::{
    analysis::{
        core::dataflow::{graph::*, *},
        opt::OptCheck,
        utils::def_path::DefPath,
    },
    utils::log::{relative_pos_range, span_to_filename, span_to_line_number, span_to_source_code},
};
use rustc_hir::def_id::DefId;
use rustc_middle::ty::TyCtxt;
use rustc_span::Span;

static DEFPATHS: OnceCell<DefPaths> = OnceCell::new();
struct DefPaths {
    hashset_new: DefPath,
    hashset_with_capacity: DefPath,
    hashmap_new: DefPath,
    hashmap_with_capacity: DefPath,
    btreeset_new: DefPath,
    btreemap_new: DefPath,
}

impl DefPaths {
    pub fn new(tcx: &TyCtxt<'_>) -> Self {
        Self {
            hashset_new: DefPath::new("std::collections::HashSet::new", tcx),
            hashset_with_capacity: DefPath::new("std::collections::HashSet::with_capacity", tcx),
            hashmap_new: DefPath::new("std::collections::HashMap::new", tcx),
            hashmap_with_capacity: DefPath::new("std::collections::HashMap::with_capacity", tcx),
            btreeset_new: DefPath::new("std::collections::BTreeSet::new", tcx),
            btreemap_new: DefPath::new("std::collections::BTreeMap::new", tcx),
        }
    }

    fn has_id(&self, id: DefId) -> bool {
        id == self.hashset_new.last_def_id()
            || id == self.hashmap_new.last_def_id()
            || id == self.btreemap_new.last_def_id()
            || id == self.btreeset_new.last_def_id()
            || id == self.hashmap_with_capacity.last_def_id()
            || id == self.hashset_with_capacity.last_def_id()
    }
}

pub struct ParticipantCheck {
    record: Vec<Span>, //Can split into 4 categories
}

impl OptCheck for ParticipantCheck {
    fn new() -> Self {
        Self { record: vec![] }
    }

    fn check(&mut self, graph: &Graph, tcx: &TyCtxt) {
        let def_paths = &DEFPATHS.get_or_init(|| DefPaths::new(tcx));
        for node in graph.nodes.iter() {
            for op in node.ops.iter() {
                if let NodeOp::Call(def_id) = op {
                    if def_paths.has_id(*def_id) {
                        self.record.push(node.span);
                    }
                }
            }
        }
    }

    fn report(&self, graph: &Graph) {
        for span in self.record.iter() {
            report_participant(graph, *span);
        }
    }

    fn cnt(&self) -> usize {
        self.record.len()
    }
}

fn report_participant(graph: &Graph, span: Span) {
    let code_source = span_to_source_code(graph.span);
    let filename = span_to_filename(span);
    let snippet = Snippet::source(&code_source)
        .line_start(span_to_line_number(graph.span))
        .origin(&filename)
        .fold(true)
        .annotation(
            Level::Error
                .span(relative_pos_range(graph.span, span))
                .label("Data collection created here"),
        );
    let message = Level::Warning
        .title("Suboptimal data collection detected")
        .snippet(snippet)
        .footer(Level::Help.title("Use faster data collection or hash operators instead. Static container is also a choice"));
    let renderer = Renderer::styled();
    println!("{}", renderer.render(message));
}