weirflow 0.1.0

GPU-first dataflow analysis primitives for Vyre and Santh compiler pipelines.
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

use super::{CsrGraph, FixedPointBatch};

impl<'a, F> FixedPointBatch<'a, F>
where
    F: Fn(&vyre::ir::Program, &[&[u8]], Option<[u32; 3]>, &mut Vec<Vec<u8>>) -> Result<(), String>,
{
    pub fn points_to_subset(
        &mut self,
        graph: CsrGraph<'_>,
        seed_bits: &[u32],
        max_iterations: u32,
    ) -> Result<Vec<u32>, String> {
        crate::points_to::subset_closure_borrowed_into_with_scratch_via(
            self.dispatch,
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
            seed_bits,
            max_iterations,
            &mut self.scratch,
        )
    }

    /// Run Andersen subset closure into caller-owned result storage.
    pub fn points_to_subset_into(
        &mut self,
        graph: CsrGraph<'_>,
        seed_bits: &[u32],
        max_iterations: u32,
        result: &mut Vec<u32>,
    ) -> Result<(), String> {
        crate::points_to::subset_closure_borrowed_into_result_with_scratch_via(
            self.dispatch,
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
            seed_bits,
            max_iterations,
            &mut self.scratch,
            result,
        )
    }

    /// Prepare points-to subset graph buffers for repeated batch runs.
    pub fn prepare_points_to_subset(
        &self,
        graph: CsrGraph<'_>,
    ) -> Result<crate::fixed_point_graph::FixedPointForwardGraph, String> {
        crate::points_to::prepare_points_to_subset_graph(
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
        )
    }

    /// Repack points-to subset graph buffers into an existing prepared graph.
    pub fn prepare_points_to_subset_into(
        &self,
        graph: CsrGraph<'_>,
        prepared: &mut crate::fixed_point_graph::FixedPointForwardGraph,
    ) -> Result<(), String> {
        crate::points_to::prepare_points_to_subset_graph_into(
            prepared,
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
        )
    }

    /// Prepare points-to subset graph buffers and Program for repeated runs.
    pub fn prepare_points_to_subset_plan(
        &self,
        graph: CsrGraph<'_>,
    ) -> Result<crate::fixed_point_graph::FixedPointAnalysisPlan, String> {
        crate::points_to::prepare_points_to_subset_plan(
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
        )
    }

    /// Repack a points-to subset plan in place for a new graph layout.
    pub fn prepare_points_to_subset_plan_into(
        &self,
        graph: CsrGraph<'_>,
        plan: &mut crate::fixed_point_graph::FixedPointAnalysisPlan,
    ) -> Result<(), String> {
        crate::points_to::prepare_points_to_subset_plan_into(
            plan,
            graph.node_count,
            graph.edge_offsets,
            graph.edge_targets,
            graph.edge_kind_mask,
        )
    }

    /// Run points-to subset closure against prepared graph buffers.
    pub fn points_to_subset_prepared(
        &mut self,
        graph: &crate::fixed_point_graph::FixedPointForwardGraph,
        seed_bits: &[u32],
        max_iterations: u32,
    ) -> Result<Vec<u32>, String> {
        crate::points_to::subset_closure_prepared_borrowed_into_with_scratch_via(
            self.dispatch,
            graph,
            seed_bits,
            max_iterations,
            &mut self.scratch,
        )
    }

    /// Run points-to subset closure against prepared graph buffers into
    /// caller-owned result storage.
    pub fn points_to_subset_prepared_into(
        &mut self,
        graph: &crate::fixed_point_graph::FixedPointForwardGraph,
        seed_bits: &[u32],
        max_iterations: u32,
        result: &mut Vec<u32>,
    ) -> Result<(), String> {
        crate::points_to::subset_closure_prepared_borrowed_into_result_with_scratch_via(
            self.dispatch,
            graph,
            seed_bits,
            max_iterations,
            &mut self.scratch,
            result,
        )
    }

    /// Run points-to subset closure against a prepared graph+Program plan.
    pub fn points_to_subset_plan(
        &mut self,
        plan: &crate::fixed_point_graph::FixedPointAnalysisPlan,
        seed_bits: &[u32],
        max_iterations: u32,
    ) -> Result<Vec<u32>, String> {
        crate::points_to::subset_closure_plan_borrowed_into_with_scratch_via(
            self.dispatch,
            plan,
            seed_bits,
            max_iterations,
            &mut self.scratch,
        )
    }

    /// Run points-to subset closure against a prepared graph+Program plan into
    /// caller-owned result storage.
    pub fn points_to_subset_plan_into(
        &mut self,
        plan: &crate::fixed_point_graph::FixedPointAnalysisPlan,
        seed_bits: &[u32],
        max_iterations: u32,
        result: &mut Vec<u32>,
    ) -> Result<(), String> {
        crate::points_to::subset_closure_plan_borrowed_into_result_with_scratch_via(
            self.dispatch,
            plan,
            seed_bits,
            max_iterations,
            &mut self.scratch,
            result,
        )
    }
}