udevrs 0.5.0

Pure Rust implementation of the user-land udev library
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

use std::mem;

use crate::{hwdb, Error, Result};

/// Trie node in the hardware database.
#[repr(C, packed(8))]
#[derive(Clone, Copy, Debug, Default, PartialEq)]
pub struct TrieNode {
    prefix_off: u64,
    children_count: u8,
    _padding: [u8; 7],
    values_count: u64,
}

impl TrieNode {
    /// Creates a new [TrieNode].
    pub const fn new() -> Self {
        Self {
            prefix_off: 0,
            children_count: 0,
            _padding: [0u8; 7],
            values_count: 0,
        }
    }

    /// Gets the length of the encoded [TrieNode].
    pub fn len(&self) -> usize {
        hwdb::node_size()
    }

    /// Gets whether the [TrieNode] is empty.
    pub const fn is_empty(&self) -> bool {
        self.children_count == 0 && self.values_count == 0
    }

    /// Gets the prefix of the lookup string, shared by all children.
    pub const fn prefix_off(&self) -> u64 {
        self.prefix_off
    }

    /// Sets the prefix of the lookup string, shared by all children.
    pub fn set_prefix_off(&mut self, val: u64) {
        self.prefix_off = val;
    }

    /// Builder function that sets the prefix of the lookup string, shared by all children.
    pub fn with_prefix_off(mut self, val: u64) -> Self {
        self.set_prefix_off(val);
        self
    }

    /// Gets the size of children entry array appended to the node.
    pub const fn children_count(&self) -> u8 {
        self.children_count
    }

    /// Sets the size of children entry array appended to the node.
    pub fn set_children_count(&mut self, val: u8) {
        self.children_count = val;
    }

    /// Builder function that sets the size of children entry array appended to the node.
    pub fn with_children_count(mut self, val: u8) -> Self {
        self.set_children_count(val);
        self
    }

    /// Gets the size of value entry array appended to the node.
    pub const fn values_count(&self) -> u64 {
        self.values_count
    }

    /// Sets the size of value entry array appended to the node.
    pub fn set_values_count(&mut self, val: u64) {
        self.values_count = val;
    }

    /// Builder function that sets the size of value entry array appended to the node.
    pub fn with_values_count(mut self, val: u64) -> Self {
        self.set_values_count(val);
        self
    }
}

impl TryFrom<&[u8]> for TrieNode {
    type Error = Error;

    fn try_from(val: &[u8]) -> Result<Self> {
        if val.len() < mem::size_of::<Self>() {
            Err(Error::InvalidLen(val.len()))
        } else {
            let mut idx = 0usize;

            let prefix_off = u64::from_le_bytes(val[idx..idx + 8].try_into()?);
            idx += mem::size_of::<u64>();

            let children_count = val[idx];
            let _padding = [0u8; 7];

            // skip past the children count + padding
            idx += 8;

            let values_count = u64::from_le_bytes(
                val.get(idx..idx + 8)
                    .ok_or(Error::InvalidLen(val.len()))?
                    .try_into()?,
            );

            if values_count > 64 {
                Err(Error::InvalidLen(values_count as usize))
            } else {
                Ok(Self {
                    prefix_off,
                    children_count,
                    _padding,
                    values_count,
                })
            }
        }
    }
}