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

Generated by: LCOV version 2.1-beta