LCOV - code coverage report
Current view: top level - safekeeper/tests/walproposer_sim - block_storage.rs (source / functions) Coverage Total Hit
Test: b4ae4c4857f9ef3e144e982a35ee23bc84c71983.info Lines: 92.3 % 39 36
Test Date: 2024-10-22 22:13:45 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        10810 :     pub fn new() -> Self {
      19        10810 :         BlockStorage {
      20        10810 :             blocks: HashMap::new(),
      21        10810 :         }
      22        10810 :     }
      23              : 
      24         5164 :     pub fn read(&self, pos: u64, buf: &mut [u8]) {
      25         5164 :         let mut buf_offset = 0;
      26         5164 :         let mut storage_pos = pos;
      27         7639 :         while buf_offset < buf.len() {
      28         2475 :             let block_id = storage_pos / BLOCK_SIZE as u64;
      29         2475 :             let block = self.blocks.get(&block_id).unwrap_or(&[0; BLOCK_SIZE]);
      30         2475 :             let block_offset = storage_pos % BLOCK_SIZE as u64;
      31         2475 :             let block_len = BLOCK_SIZE as u64 - block_offset;
      32         2475 :             let buf_len = buf.len() - buf_offset;
      33         2475 :             let copy_len = std::cmp::min(block_len as usize, buf_len);
      34         2475 :             buf[buf_offset..buf_offset + copy_len]
      35         2475 :                 .copy_from_slice(&block[block_offset as usize..block_offset as usize + copy_len]);
      36         2475 :             buf_offset += copy_len;
      37         2475 :             storage_pos += copy_len as u64;
      38         2475 :         }
      39         5164 :     }
      40              : 
      41        47922 :     pub fn write(&mut self, pos: u64, buf: &[u8]) {
      42        47922 :         let mut buf_offset = 0;
      43        47922 :         let mut storage_pos = pos;
      44        96010 :         while buf_offset < buf.len() {
      45        48088 :             let block_id = storage_pos / BLOCK_SIZE as u64;
      46        48088 :             let block = self.blocks.entry(block_id).or_insert([0; BLOCK_SIZE]);
      47        48088 :             let block_offset = storage_pos % BLOCK_SIZE as u64;
      48        48088 :             let block_len = BLOCK_SIZE as u64 - block_offset;
      49        48088 :             let buf_len = buf.len() - buf_offset;
      50        48088 :             let copy_len = std::cmp::min(block_len as usize, buf_len);
      51        48088 :             block[block_offset as usize..block_offset as usize + copy_len]
      52        48088 :                 .copy_from_slice(&buf[buf_offset..buf_offset + copy_len]);
      53        48088 :             buf_offset += copy_len;
      54        48088 :             storage_pos += copy_len as u64
      55              :         }
      56        47922 :     }
      57              : }
        

Generated by: LCOV version 2.1-beta