LCOV - code coverage report
Current view: top level - safekeeper/tests/walproposer_sim - block_storage.rs (source / functions) Coverage Total Hit
Test: 2e3a7638747e564a4f6d1af1cc0c3b3438fbb740.info Lines: 92.3 % 39 36
Test Date: 2024-11-20 01:36:58 Functions: 75.0 % 12 9

            Line data    Source code
       1              : use std::collections::HashMap;
       2              : 
       3              : const BLOCK_SIZE: usize = 8192;
       4              : 
       5              : /// A simple in-memory implementation of a block storage. Can be used to implement external
       6              : /// storage in tests.
       7              : pub struct BlockStorage {
       8              :     blocks: HashMap<u64, [u8; BLOCK_SIZE]>,
       9              : }
      10              : 
      11              : impl Default for BlockStorage {
      12            0 :     fn default() -> Self {
      13            0 :         Self::new()
      14            0 :     }
      15              : }
      16              : 
      17              : impl BlockStorage {
      18        11059 :     pub fn new() -> Self {
      19        11059 :         BlockStorage {
      20        11059 :             blocks: HashMap::new(),
      21        11059 :         }
      22        11059 :     }
      23              : 
      24         1797 :     pub fn read(&self, pos: u64, buf: &mut [u8]) {
      25         1797 :         let mut buf_offset = 0;
      26         1797 :         let mut storage_pos = pos;
      27         4302 :         while buf_offset < buf.len() {
      28         2505 :             let block_id = storage_pos / BLOCK_SIZE as u64;
      29         2505 :             let block = self.blocks.get(&block_id).unwrap_or(&[0; BLOCK_SIZE]);
      30         2505 :             let block_offset = storage_pos % BLOCK_SIZE as u64;
      31         2505 :             let block_len = BLOCK_SIZE as u64 - block_offset;
      32         2505 :             let buf_len = buf.len() - buf_offset;
      33         2505 :             let copy_len = std::cmp::min(block_len as usize, buf_len);
      34         2505 :             buf[buf_offset..buf_offset + copy_len]
      35         2505 :                 .copy_from_slice(&block[block_offset as usize..block_offset as usize + copy_len]);
      36         2505 :             buf_offset += copy_len;
      37         2505 :             storage_pos += copy_len as u64;
      38         2505 :         }
      39         1797 :     }
      40              : 
      41        12782 :     pub fn write(&mut self, pos: u64, buf: &[u8]) {
      42        12782 :         let mut buf_offset = 0;
      43        12782 :         let mut storage_pos = pos;
      44        25818 :         while buf_offset < buf.len() {
      45        13036 :             let block_id = storage_pos / BLOCK_SIZE as u64;
      46        13036 :             let block = self.blocks.entry(block_id).or_insert([0; BLOCK_SIZE]);
      47        13036 :             let block_offset = storage_pos % BLOCK_SIZE as u64;
      48        13036 :             let block_len = BLOCK_SIZE as u64 - block_offset;
      49        13036 :             let buf_len = buf.len() - buf_offset;
      50        13036 :             let copy_len = std::cmp::min(block_len as usize, buf_len);
      51        13036 :             block[block_offset as usize..block_offset as usize + copy_len]
      52        13036 :                 .copy_from_slice(&buf[buf_offset..buf_offset + copy_len]);
      53        13036 :             buf_offset += copy_len;
      54        13036 :             storage_pos += copy_len as u64
      55              :         }
      56        12782 :     }
      57              : }
        

Generated by: LCOV version 2.1-beta