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
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

use super::reaching_defs_step;
use vyre_primitives::graph::program_graph::ProgramGraphShape;

pub fn prepare_reaching_graph(
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
) -> Result<crate::fixed_point_graph::FixedPointForwardGraph, String> {
    let mut scratch = crate::fixed_point_scratch::FixedPointScratch::default();
    scratch.prepare_edge_kind_masks(
        edge_kind_mask,
        vyre_primitives::predicate::edge_kind::CONTROL,
    )?;
    crate::fixed_point_graph::FixedPointForwardGraph::new_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "reaching_closure",
        node_count,
        edge_offsets,
        edge_targets,
        &scratch.edge_kind_masks,
    )
}

/// Repack invariant reaching graph buffers into an existing prepared graph.
pub fn prepare_reaching_graph_into(
    graph: &mut crate::fixed_point_graph::FixedPointForwardGraph,
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
) -> Result<(), String> {
    let mut scratch = crate::fixed_point_scratch::FixedPointScratch::default();
    scratch.prepare_edge_kind_masks(
        edge_kind_mask,
        vyre_primitives::predicate::edge_kind::CONTROL,
    )?;
    graph.replace_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "reaching_closure",
        node_count,
        edge_offsets,
        edge_targets,
        &scratch.edge_kind_masks,
    )
}

/// Prepare invariant reaching graph buffers using caller-owned scratch for
/// edge-kind filtering.
pub fn prepare_reaching_graph_with_scratch(
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
    scratch: &mut crate::fixed_point_scratch::FixedPointScratch,
) -> Result<crate::fixed_point_graph::FixedPointForwardGraph, String> {
    scratch.prepare_edge_kind_masks(
        edge_kind_mask,
        vyre_primitives::predicate::edge_kind::CONTROL,
    )?;
    crate::fixed_point_graph::FixedPointForwardGraph::new_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "reaching_closure",
        node_count,
        edge_offsets,
        edge_targets,
        &scratch.edge_kind_masks,
    )
}

/// Repack invariant reaching graph buffers into an existing prepared graph
/// using caller-owned scratch for edge-kind filtering.
pub fn prepare_reaching_graph_into_with_scratch(
    graph: &mut crate::fixed_point_graph::FixedPointForwardGraph,
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
    scratch: &mut crate::fixed_point_scratch::FixedPointScratch,
) -> Result<(), String> {
    scratch.prepare_edge_kind_masks(
        edge_kind_mask,
        vyre_primitives::predicate::edge_kind::CONTROL,
    )?;
    graph.replace_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "reaching_closure",
        node_count,
        edge_offsets,
        edge_targets,
        &scratch.edge_kind_masks,
    )
}

/// Prepare invariant reaching graph buffers and emitted Program once.
pub fn prepare_reaching_plan(
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
) -> Result<crate::fixed_point_graph::FixedPointAnalysisPlan, String> {
    let graph = prepare_reaching_graph(node_count, edge_offsets, edge_targets, edge_kind_mask)?;
    let program = reaching_defs_step(
        ProgramGraphShape::new(graph.node_count, graph.edge_count),
        "fin",
        "fout",
    );
    Ok(
        crate::fixed_point_graph::FixedPointAnalysisPlan::new_for_kind(
            crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
            graph,
            program,
        ),
    )
}

/// Prepare invariant reaching graph buffers and emitted Program once using
/// caller-owned scratch for edge-kind filtering.
pub fn prepare_reaching_plan_with_scratch(
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
    scratch: &mut crate::fixed_point_scratch::FixedPointScratch,
) -> Result<crate::fixed_point_graph::FixedPointAnalysisPlan, String> {
    scratch.prepare_edge_kind_masks(
        edge_kind_mask,
        vyre_primitives::predicate::edge_kind::CONTROL,
    )?;
    let graph = crate::fixed_point_graph::FixedPointForwardGraph::new_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "reaching_closure",
        node_count,
        edge_offsets,
        edge_targets,
        &scratch.edge_kind_masks,
    )?;
    let program = reaching_defs_step(
        ProgramGraphShape::new(graph.node_count, graph.edge_count),
        "fin",
        "fout",
    );
    Ok(
        crate::fixed_point_graph::FixedPointAnalysisPlan::new_for_kind(
            crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
            graph,
            program,
        ),
    )
}

/// Repack reaching graph buffers and refresh the emitted Program in place.
pub fn prepare_reaching_plan_into(
    plan: &mut crate::fixed_point_graph::FixedPointAnalysisPlan,
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
) -> Result<(), String> {
    plan.require_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "prepare_reaching_plan_into",
    )?;
    prepare_reaching_graph_into(
        plan.graph_mut(),
        node_count,
        edge_offsets,
        edge_targets,
        edge_kind_mask,
    )?;
    let program = reaching_defs_step(
        ProgramGraphShape::new(plan.graph().node_count, plan.graph().edge_count),
        "fin",
        "fout",
    );
    plan.replace_program_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        program,
    );
    Ok(())
}

/// Repack reaching graph buffers and refresh the emitted Program in place
/// using caller-owned scratch for edge-kind filtering.
pub fn prepare_reaching_plan_into_with_scratch(
    plan: &mut crate::fixed_point_graph::FixedPointAnalysisPlan,
    node_count: u32,
    edge_offsets: &[u32],
    edge_targets: &[u32],
    edge_kind_mask: &[u32],
    scratch: &mut crate::fixed_point_scratch::FixedPointScratch,
) -> Result<(), String> {
    plan.require_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        "prepare_reaching_plan_into_with_scratch",
    )?;
    prepare_reaching_graph_into_with_scratch(
        plan.graph_mut(),
        node_count,
        edge_offsets,
        edge_targets,
        edge_kind_mask,
        scratch,
    )?;
    let program = reaching_defs_step(
        ProgramGraphShape::new(plan.graph().node_count, plan.graph().edge_count),
        "fin",
        "fout",
    );
    plan.replace_program_for_kind(
        crate::fixed_point_graph::FixedPointAnalysisKind::Reaching,
        program,
    );
    Ok(())
}