logfs 0.1.1

Simple append-only log based filesystem with encryption and compression
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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
use std::{
    io::{self, BufReader, Read, Seek, SeekFrom},
    sync::Arc,
};

use crate::{LogFsError, crypto::Crypto, journal::SequenceId, state::KeyPointer};

use super::{
    ENTRY_ACTION_CHUNK, ENTRY_FIRST_DATA_CHUNK, ENTRY_HEADER_CHUNK, IndexedSuperBlock,
    PersistedEntry,
    data::{self, EntryPointer},
};

pub struct LogReader<'a, R> {
    base_offset: u64,
    offset: u64,
    // TODO: should be private!
    pub next_sequence: SequenceId,
    crypto: Option<&'a Crypto>,
    buffer: Vec<u8>,
    // TODO: should be private!
    pub reader: BufReader<R>,
}

impl<'a, R: std::io::Read + std::io::Seek> LogReader<'a, R> {
    pub fn new_start(reader: R, base_offset: u64, crypto: Option<&'a Crypto>) -> Self {
        Self {
            base_offset,
            offset: base_offset,
            next_sequence: SequenceId::first(),
            crypto,
            buffer: Vec::new(),
            reader: BufReader::new(reader),
        }
    }

    pub(super) fn read_superblocks(&mut self) -> Result<IndexedSuperBlock, LogFsError> {
        let mut best_block: Option<IndexedSuperBlock> = None;
        debug_assert_eq!(self.reader.stream_position().unwrap(), self.base_offset);

        let mut buf = Vec::new();
        for index in 0..data::Superblock::HEADER_COUNT {
            buf.resize(data::Superblock::SERIALIZED_LEN as usize, 0);
            self.reader.read_exact(&mut buf)?;

            if let Some(crypto) = self.crypto.as_ref() {
                buf = match crypto.decrypt_data(0, index as u32, std::mem::take(&mut buf)) {
                    Ok(b) => b,
                    Err(_err) => {
                        continue;
                    }
                };
            }

            match bincode::deserialize::<data::Superblock>(&buf) {
                Ok(block) => {
                    best_block = if let Some(old_block) = best_block {
                        if block.active_sequence > old_block.block.active_sequence {
                            Some(IndexedSuperBlock {
                                index: index as usize,
                                block,
                            })
                        } else {
                            Some(old_block)
                        }
                    } else {
                        Some(IndexedSuperBlock {
                            block,
                            index: index as usize,
                        })
                    };
                }
                Err(_err) => {}
            }
        }

        let block =
            best_block.ok_or_else(|| LogFsError::new_internal("Could not find a superblock"))?;
        self.offset = self.reader.stream_position()?;
        debug_assert_eq!(
            self.offset,
            data::Superblock::HEADER_SIZE + self.base_offset
        );

        Ok(block)
    }

    #[allow(dead_code)]
    pub(super) fn rewind_to_first_entry(&mut self) -> Result<(), LogFsError> {
        let target = self.base_offset + data::Superblock::HEADER_SIZE;
        self.reader.seek(io::SeekFrom::Start(target))?;
        self.offset = target;
        Ok(())
    }

    pub(super) fn seek_to_pointer(&mut self, entry: EntryPointer) -> Result<(), LogFsError> {
        let start = self.offset;
        debug_assert_eq!(start, self.reader.stream_position()? + self.base_offset);

        let offset = self.base_offset + entry.offset;
        match self.reader.seek(SeekFrom::Start(offset)) {
            Ok(_) => {
                self.offset = offset;
                self.next_sequence = entry.sequence;
                Ok(())
            }
            Err(err) => {
                self.reader
                    .seek(SeekFrom::Start(start))
                    .expect("Could not restore reader to origina position after seek error");
                Err(err.into())
            }
        }
    }

    /* fn skip_superblocks(&mut self) -> Result<(), LogFsError> {
        self.reader.seek_relative(
            data::Superblock::HEADER_COUNT as i64 * data::Superblock::SERIALIZED_LEN as i64,
        )?;
        Ok(())
    } */

    /// Read the next journal entry.
    ///
    /// If data_buffer is provided, the entry data will be written to the buffer
    /// in its entirety. Otherwise the data is skipped.
    pub(super) fn next_entry<'b>(
        &mut self,
        data_buffer: Option<&'b mut Vec<u8>>,
    ) -> Result<(PersistedEntry, &'b [u8]), LogFsError> {
        let chunk_padding = self.crypto.map(|c| c.extra_payload_len()).unwrap_or(0) as usize;
        let start_offset = self.offset;
        let buffer = &mut self.buffer;
        let sequence = self.next_sequence;

        debug_assert_eq!(self.reader.stream_position()?, start_offset);

        let header_size = data::JournalEntryHeader::SERIALIZED_LEN + chunk_padding;

        // Read journal entry header.
        buffer.resize(header_size, 0);

        self.reader.read_exact(&mut *buffer)?;

        let header_data = if let Some(crypto) = &self.crypto {
            crypto.decrypt_data_ref(sequence.as_u64(), ENTRY_HEADER_CHUNK, buffer)?
        } else {
            buffer.as_slice()
        };
        let header: data::JournalEntryHeader = bincode::deserialize(header_data)?;
        tracing::trace!(?header, "read entry header");

        if sequence != header.sequence_id {
            return Err(LogFsError::new_internal(format!(
                "Corrupted log: log entry sequence number for sequence {:?}",
                sequence,
            )));
        }
        if start_offset - self.base_offset != header.offset {
            return Err(LogFsError::new_internal(format!(
                "Corrupted log: log entry offset does not match actual offset for sequence {:?}",
                self.next_sequence
            )));
        }

        // Read the journal action.

        // Make sure the buffer can hold the data.
        let action_size = header.action_size as usize;
        buffer.resize(action_size, 0);
        // Read into buffer.
        self.reader.read_exact(buffer)?;

        // Decrypt.

        let action_data = if let Some(crypto) = &self.crypto {
            crypto.decrypt_data_ref(sequence.as_u64(), ENTRY_ACTION_CHUNK, buffer)?
        } else {
            buffer.as_slice()
        };

        let action: data::JournalAction = bincode::deserialize(action_data)?;
        let data_len = action.payload_len(self.crypto);

        let data_offset = start_offset + header_size as u64 + action_size as u64;
        let next_entry_offset = data_offset + data_len;

        let decrypted_data: &'b [u8] = if let Some(buffer_ref) = data_buffer {
            debug_assert_eq!(data_offset, self.reader.stream_position().unwrap());

            buffer_ref.resize(data_len as usize, 0);
            self.reader.read_exact(buffer_ref)?;

            if let Some(crypto) = &self.crypto {
                crypto.decrypt_data_ref(sequence.as_u64(), ENTRY_FIRST_DATA_CHUNK, buffer_ref)?
            } else {
                buffer_ref.as_slice()
            }
        } else {
            self.reader.seek(SeekFrom::Current(data_len as i64))?;
            &[]
        };

        self.offset = next_entry_offset;
        self.next_sequence = self.next_sequence.try_increment()?;

        assert_eq!(self.offset, self.reader.stream_position()?);

        let entry = PersistedEntry {
            entry: data::JournalEntry { header, action },
            file_data_offset: data_offset,
        };
        Ok((entry, decrypted_data))
    }
}

pub struct KeyDataReader {
    crypto: Option<Arc<Crypto>>,
    reader: BufReader<std::fs::File>,
    sequence: SequenceId,
    chunk_size: usize,
    total_size: u64,
    last_chunk_index: data::ChunkIndex,
    last_chunk_size: usize,

    next_chunk: data::ChunkIndex,
}

impl KeyDataReader {
    pub fn new(
        crypto: Option<Arc<Crypto>>,
        pointer: &KeyPointer,
        mut file: std::fs::File,
    ) -> Result<Self, LogFsError> {
        file.seek(SeekFrom::Start(pointer.file_offset))?;
        let reader = BufReader::new(file);
        let chunk_count = pointer
            .chunk_size
            .map(|chunk_size| data::compute_chunk_count(pointer.size, chunk_size))
            .unwrap_or(1);

        let last_chunk_index = chunk_count - 1 + ENTRY_FIRST_DATA_CHUNK;
        let last_chunk_size = pointer
            .chunk_size
            .map(|s| pointer.size - (s as u64 * (chunk_count as u64 - 1)))
            .unwrap_or(pointer.size) as usize;

        Ok(Self {
            crypto,
            reader,
            sequence: SequenceId::from_u64(pointer.sequence_id),
            chunk_size: pointer
                .chunk_size
                .map(|x| x as usize)
                .unwrap_or(pointer.size as usize),
            total_size: pointer.size,
            last_chunk_index,
            last_chunk_size,
            next_chunk: ENTRY_FIRST_DATA_CHUNK,
        })
    }

    pub fn read_all(mut self) -> Result<(Vec<u8>, std::fs::File), LogFsError> {
        let mut data = Vec::with_capacity(self.total_size as usize);

        while self.next_chunk < self.last_chunk_index {
            data.extend(self.read_next_chunk(Vec::with_capacity(self.chunk_size))?);
        }

        data.extend(self.read_next_chunk(Vec::with_capacity(self.last_chunk_size))?);

        Ok((data, self.reader.into_inner()))
    }

    fn read_next_chunk(&mut self, mut buffer: Vec<u8>) -> Result<Vec<u8>, LogFsError> {
        debug_assert!(self.next_chunk >= ENTRY_FIRST_DATA_CHUNK);
        assert!(self.next_chunk <= self.last_chunk_index);

        let chunk = self.next_chunk;
        let is_last = chunk == self.last_chunk_index;

        let size = if is_last {
            if self.last_chunk_index == ENTRY_FIRST_DATA_CHUNK {
                self.total_size as usize
            } else {
                (self.total_size
                    - (self.last_chunk_index - ENTRY_FIRST_DATA_CHUNK) as u64
                        * self.chunk_size as u64) as usize
            }
        } else {
            self.chunk_size
        };

        let padding = self
            .crypto
            .as_ref()
            .map(|c| c.extra_payload_len() as usize)
            .unwrap_or_default();

        let size = size + padding;
        buffer.resize(size, 0);
        self.reader.read_exact(&mut buffer)?;

        let data = if let Some(crypto) = self.crypto.as_ref() {
            crypto.decrypt_data(self.sequence.as_u64(), chunk, buffer)?
        } else {
            buffer
        };

        self.next_chunk += 1;

        Ok(data)
    }

    fn skip_chunks(&mut self, count: u32) -> Result<(), LogFsError> {
        let target_chunk = self.next_chunk + count;
        if target_chunk > self.last_chunk_index {
            return Err(LogFsError::new_internal("Chunk index out of range"));
        }

        let padding = self
            .crypto
            .as_ref()
            .map(|c| c.extra_payload_len() as usize)
            .unwrap_or_default();

        let bytes_to_skip = count as u64 * (self.chunk_size as u64 + padding as u64);
        self.reader
            .seek(std::io::SeekFrom::Current(bytes_to_skip as i64))?;
        self.next_chunk = target_chunk;

        Ok(())
    }

    fn is_finished(&self) -> bool {
        self.next_chunk > self.last_chunk_index
    }

    /* fn close(self) -> std::fs::File {
        self.reader.into_inner()
    } */
}

pub struct StdKeyReader {
    reader: Option<KeyDataReader>,
    buffer: Vec<u8>,
    buffer_offset: usize,
}

impl StdKeyReader {
    pub fn new(reader: KeyDataReader) -> Self {
        Self {
            reader: Some(reader),
            buffer: Vec::new(),
            buffer_offset: 0,
        }
    }
}

impl std::io::Read for StdKeyReader {
    fn read(&mut self, buf: &mut [u8]) -> std::io::Result<usize> {
        if !self.buffer.is_empty() {
            let remaining_in_buffer = self.buffer.len() - self.buffer_offset;

            let to_write = std::cmp::min(buf.len(), remaining_in_buffer);
            buf[0..to_write]
                .copy_from_slice(&self.buffer[self.buffer_offset..self.buffer_offset + to_write]);

            if to_write >= remaining_in_buffer {
                self.buffer.clear();
            } else {
                self.buffer_offset += to_write;
            }
            return Ok(to_write);
        }

        let mut reader = if let Some(reader) = self.reader.take() {
            reader
        } else {
            return Ok(0);
        };

        let res = reader.read_next_chunk(std::mem::take(&mut self.buffer));

        match res {
            Ok(new_buffer) => {
                self.buffer = new_buffer;
                self.buffer_offset = 0;
                self.reader = if reader.next_chunk <= reader.last_chunk_index {
                    Some(reader)
                } else {
                    None
                };

                self.read(buf)
            }
            Err(err) => {
                self.reader = Some(reader);
                Err(err.into_io())
            }
        }
        // FIXME: write tests!
    }
}

pub struct KeyChunkIter {
    reader: KeyDataReader,
    /// Buffer for partial chunks.
    /// Required when Self::seek targets a partial chunk.
    partial_buffer: Option<Vec<u8>>,
}

impl KeyChunkIter {
    pub fn new(reader: KeyDataReader) -> Self {
        Self {
            reader,
            partial_buffer: None,
        }
    }

    pub fn skip_bytes(&mut self, offset: u64) -> Result<(), LogFsError> {
        let to_skip = u32::try_from(offset / self.reader.chunk_size as u64)
            .map_err(|_| LogFsError::new_internal("Seek out of bounds"))?;
        self.reader.skip_chunks(to_skip)?;

        let partial = (offset % self.reader.chunk_size as u64) as usize;
        if partial > 0 {
            // Partial chunk read.
            // Need to read and buffer the next chunk.
            let mut data = self.reader.read_next_chunk(Vec::new())?;
            data.drain(..partial);
            debug_assert!(!data.is_empty());
            self.partial_buffer = Some(data);
        }
        Ok(())
    }
}

impl Iterator for KeyChunkIter {
    type Item = Result<Vec<u8>, LogFsError>;

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(partial) = self.partial_buffer.take() {
            Some(Ok(partial))
        } else if self.reader.is_finished() {
            None
        } else {
            Some(self.reader.read_next_chunk(Vec::new()))
        }
    }
}