gam-gpu 0.3.157

GPU (CUDA/NVRTC) dispatch, device runtime, and BLAS kernels for the gam penalized-likelihood engine
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


#[derive(Clone, Debug)]
pub struct DeviceBuffer<T> {
    host_shadow: Vec<T>,
}

impl<T> DeviceBuffer<T> {
    pub const fn from_host_shadow(host_shadow: Vec<T>) -> Self {
        Self { host_shadow }
    }

    pub const fn len(&self) -> usize {
        self.host_shadow.len()
    }

    pub const fn is_empty(&self) -> bool {
        self.host_shadow.len() == 0
    }

    pub fn host_shadow(&self) -> &[T] {
        &self.host_shadow
    }
}

#[derive(Clone, Debug)]
pub struct DeviceVector {
    pub len: usize,
    pub data: DeviceBuffer<f64>,
}

#[derive(Clone, Debug)]
pub struct DeviceMatrix {
    pub rows: usize,
    pub cols: usize,
    pub data: DeviceBuffer<f64>,
    pub column_major: bool,
}

impl DeviceMatrix {

    pub const fn bytes(&self) -> usize {
        self.rows
            .saturating_mul(self.cols)
            .saturating_mul(std::mem::size_of::<f64>())
    }
}

#[derive(Clone, Debug)]
pub struct DeviceCsrMatrix {
    pub rows: usize,
    pub cols: usize,
    pub rowptr: DeviceBuffer<i32>,
    pub colidx: DeviceBuffer<i32>,
    pub values: DeviceBuffer<f64>,
}

impl DeviceCsrMatrix {
    /// Construct a CSR matrix, enforcing the structural invariant that `rowptr`
    /// holds exactly `rows + 1` entries.
    ///
    /// A CSR row-pointer array must have one slot per row plus a trailing slot
    /// equal to `nnz`. If the supplied `rowptr` violates this (too short or too
    /// long), it is canonicalized to `rows + 1` monotone entries: a short
    /// `rowptr` is padded with its final value (marking the remaining rows as
    /// empty) and an over-long `rowptr` is truncated. This prevents downstream
    /// row-slice and deallocation paths from indexing `rowptr[row + 1]` out of
    /// bounds, which would be an invalid-free / out-of-bounds deallocation
    /// hazard.
    pub fn new(
        rows: usize,
        cols: usize,
        rowptr: DeviceBuffer<i32>,
        colidx: DeviceBuffer<i32>,
        values: DeviceBuffer<f64>,
    ) -> Self {
        let expected = rows + 1;
        let mut ptr = rowptr.host_shadow().to_vec();
        if ptr.len() != expected {
            let fill = ptr.last().copied().unwrap_or(0);
            ptr.resize(expected, fill);
        }
        Self {
            rows,
            cols,
            rowptr: DeviceBuffer::from_host_shadow(ptr),
            colidx,
            values,
        }
    }

    pub const fn nnz(&self) -> usize {
        self.values.len()
    }
}