teamy-mft 0.5.0

TeamDman's Master File Table CLI and library for NTFS.
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

use std::io::Write;

// idxf[impl search-index.header.magic]
pub const SEARCH_INDEX_MAGIC: &[u8; 8] = b"TMFTIDX\0";
// idxf[impl search-index.header.version]
pub const SEARCH_INDEX_VERSION: u16 = 7;
pub const SEARCH_INDEX_HEADER_LEN: usize = 8 + 2 + 2 + 1 + 8 + 8;

// idxf[impl search-index.row.deleted-flag]
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct SearchIndexPathRow {
    pub path: String,
    pub has_deleted_entries: bool,
}

// idxf[impl search-index.header.drive-letter]
// idxf[impl search-index.header.source-mft-length]
// idxf[impl search-index.header.node-count]
#[derive(Debug, Clone, Copy, Eq, PartialEq)]
pub struct SearchIndexHeader {
    pub version: u16,
    pub flags: u16,
    pub drive_letter: u8,
    pub source_mft_len_bytes: u64,
    pub node_count: u64,
}

impl SearchIndexHeader {
    #[must_use]
    pub fn new(drive_letter: char, source_mft_len_bytes: u64, node_count: u64) -> Self {
        Self {
            version: SEARCH_INDEX_VERSION,
            flags: 0,
            drive_letter: drive_letter as u8,
            source_mft_len_bytes,
            node_count,
        }
    }

    /// Write the serialized search index header bytes to a writer.
    ///
    /// # Errors
    ///
    /// Returns an error if the writer cannot accept the complete header.
    pub fn write_to(&self, writer: &mut impl Write) -> std::io::Result<()> {
        writer.write_all(SEARCH_INDEX_MAGIC)?;
        writer.write_all(&self.version.to_le_bytes())?;
        writer.write_all(&self.flags.to_le_bytes())?;
        writer.write_all(&self.drive_letter.to_le_bytes())?;
        writer.write_all(&self.source_mft_len_bytes.to_le_bytes())?;
        writer.write_all(&self.node_count.to_le_bytes())?;
        Ok(())
    }

    pub fn extend_vec(&self, bytes: &mut Vec<u8>) {
        bytes.extend_from_slice(SEARCH_INDEX_MAGIC);
        bytes.extend_from_slice(&self.version.to_le_bytes());
        bytes.extend_from_slice(&self.flags.to_le_bytes());
        bytes.extend_from_slice(&self.drive_letter.to_le_bytes());
        bytes.extend_from_slice(&self.source_mft_len_bytes.to_le_bytes());
        bytes.extend_from_slice(&self.node_count.to_le_bytes());
    }
}