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

use super::*;

#[test]
fn direct_ifds_memory_budget_rejects_graph_before_resident_prepare() {
    let mut batch = super::DirectResidentIfdsBatch::<u64>::with_memory_budget(2, 23);
    let dispatch = FreeOnlyDispatch {
        freed: RefCell::new(Vec::new()),
    };
    let graph_key = DirectResidentIfdsGraphKey::from_edges(1, 1, 1, &[], &[], &[], &[]);
    let seed = [(0u32, 0u32, 0u32)];
    let mut results = Vec::new();

    let error = batch
        .solve_many_with_graph_key_into(
            &dispatch,
            graph_key,
            1,
            1,
            1,
            &[],
            &[],
            &[],
            &[],
            &[&seed[..]],
            1,
            &mut results,
        )
        .expect_err("direct IFDS memory budget must reject oversized resident CSR");

    assert!(
        error.contains("requires 24 retained bytes") && error.contains("allows 23"),
        "direct IFDS memory-budget error must report required and allowed retained bytes"
    );
    assert!(
        dispatch.freed.borrow().is_empty(),
        "direct IFDS budget rejection must happen before resident allocation or eviction"
    );
    assert_eq!(batch.stats().retained_bytes, 0);
    assert_eq!(batch.stats().direct_prepare_bytes, 0);
}

#[test]
fn direct_ifds_cached_key_requires_warm_resident_graph() {
    let mut batch = super::DirectResidentIfdsBatch::<u64>::with_max_entries(2);
    let dispatch = FreeOnlyDispatch {
        freed: RefCell::new(Vec::new()),
    };
    let graph_key = DirectResidentIfdsGraphKey::from_edges(1, 1, 1, &[], &[], &[], &[]);
    let seed = [(0u32, 0u32, 0u32)];
    let mut results = Vec::new();

    let error = batch
        .solve_cached_with_graph_key_into(&dispatch, graph_key, &[&seed[..]], 1, &mut results)
        .expect_err("cached-key IFDS hot path must reject a cold graph key");

    assert!(
        error.contains("call solve_many_with_graph_key_into once"),
        "cached-key IFDS error must explain the required warm-up path"
    );
    assert!(results.is_empty());
}