simd-r-drive 0.16.0-alpha

use crate::storage_engine::constants::*;
use crate::storage_engine::digest::{
    Xxh3BuildHasher, compute_checksum, compute_hash, compute_hash_batch,
};
use crate::storage_engine::simd_copy;
use crate::storage_engine::{EntryIterator, EntryStream, KeyIndexer};
use crate::traits::{DataStoreReader, DataStoreWriter};
use crate::utils::verify_file_existence;
use memmap2::Mmap;
use simd_r_drive_entry_handle::{EntryHandle, EntryMetadata};
use std::collections::HashSet;
use std::convert::From;
use std::fs::{File, OpenOptions};
use std::io::{BufWriter, Error, Read, Result, Seek, SeekFrom, Write};
use std::path::{Path, PathBuf};
use std::sync::atomic::{AtomicU64, Ordering};
use std::sync::{Arc, Mutex, RwLock, RwLockReadGuard};
use tracing::{debug, info, warn};

#[cfg(any(test, debug_assertions))]
use simd_r_drive_entry_handle::debug_assert_aligned_offset;

#[cfg(feature = "parallel")]
use rayon::prelude::*;

/// Append-Only Storage Engine
pub struct DataStore {
    file: Arc<RwLock<BufWriter<File>>>,
    mmap: Arc<Mutex<Arc<Mmap>>>,
    tail_offset: AtomicU64,
    key_indexer: Arc<RwLock<KeyIndexer>>,
    path: PathBuf,
}

/// Provides a **consuming sequential** iterator over the valid entries.
///
/// This allows a `DataStore` to be consumed to produce a sequential
/// iterator. For non-consuming iteration, iterate over a reference
/// (`&storage`).
///
/// The iterator produced is **sequential**. For parallel processing,
/// enable the `parallel` feature and use the `.par_iter_entries()`
/// method instead.
impl IntoIterator for DataStore {
    type Item = EntryHandle;
    type IntoIter = EntryIterator;

    fn into_iter(self) -> Self::IntoIter {
        self.iter_entries()
    }
}

impl From<PathBuf> for DataStore {
    /// Creates an `DataStore` instance from a `PathBuf`.
    ///
    /// This allows creating a storage instance **directly from a file
    /// path**.
    ///
    /// # Panics:
    /// - If the file cannot be opened or mapped into memory.
    fn from(path: PathBuf) -> Self {
        DataStore::open(&path).expect("Failed to open storage file")
    }
}

impl DataStore {
    /// Opens an **existing** or **new** append-only storage file.
    ///
    /// This function:
    /// 1. **Opens the file** in read/write mode (creating it if
    ///    necessary).
    /// 2. **Maps the file** into memory using `mmap` for fast access.
    /// 3. **Recovers the valid chain**, ensuring **data integrity**.
    /// 4. **Re-maps** the file after recovery to reflect the correct
    ///    state.
    /// 5. **Builds an in-memory index** for **fast key lookups**.
    ///
    /// # Parameters:
    /// - `path`: The **file path** where the storage is located.
    ///
    /// # Returns:
    /// - `Ok(DataStore)`: A **new storage instance**.
    /// - `Err(std::io::Error)`: If any file operation fails.
    pub fn open(path: &Path) -> Result<Self> {
        let file = Self::open_file_in_append_mode(path)?;
        let file_len = file.get_ref().metadata()?.len();

        let mmap = Self::init_mmap(&file)?;
        let final_len = Self::recover_valid_chain(&mmap, file_len)?;

        if final_len < file_len {
            warn!(
                "Truncating corrupted data in {} from offset {} to {}.",
                path.display(),
                final_len,
                file_len
            );
            drop(mmap);
            drop(file);
            let file = OpenOptions::new().read(true).write(true).open(path)?;
            file.set_len(final_len)?;
            file.sync_all()?;
            return Self::open(path);
        }

        let mmap_arc = Arc::new(mmap);
        let mmap_for_indexer: &'static Mmap = unsafe { &*(Arc::as_ptr(&mmap_arc)) };
        let key_indexer = KeyIndexer::build(mmap_for_indexer, final_len);

        Ok(Self {
            file: Arc::new(RwLock::new(file)),
            mmap: Arc::new(Mutex::new(mmap_arc)),
            tail_offset: final_len.into(),
            key_indexer: Arc::new(RwLock::new(key_indexer)),
            path: path.to_path_buf(),
        })
    }

    /// Opens an **existing** append-only storage file.
    ///
    /// This function verifies that the file exists before attempting to
    /// open it. If the file does not exist or is not a valid file, an
    /// error is returned.
    ///
    /// # Parameters:
    /// - `path`: The **file path** of the storage file.
    ///
    /// # Returns:
    /// - `Ok(DataStore)`: A **new storage instance** if the file exists
    ///   and can be opened.
    /// - `Err(std::io::Error)`: If the file does not exist or is
    ///   invalid.
    ///
    /// # Notes:
    /// - Unlike `open()`, this function **does not create** a new
    ///   storage file if the specified file does not exist.
    /// - If the file is **missing** or is not a regular file, an error
    ///   is returned.
    /// - This is useful in scenarios where the caller needs to **ensure**
    ///   that they are working with an already existing storage file.
    pub fn open_existing(path: &Path) -> Result<Self> {
        verify_file_existence(path)?;
        Self::open(path)
    }

    /// Workaround for directly opening in **append mode** causing
    /// permissions issues on Windows
    ///
    /// The file is opened normally and the **cursor is moved to the
    /// end.
    ///
    /// Unix family unaffected by this issue, but this standardizes
    /// their handling.
    ///
    /// # Parameters:
    /// - `path`: The **file path** of the storage file.
    ///
    /// # Returns:
    /// - `Ok(BufWriter<File>)`: A buffered writer pointing to the file.
    /// - `Err(std::io::Error)`: If the file could not be opened.
    fn open_file_in_append_mode(path: &Path) -> Result<BufWriter<File>> {
        let mut file = OpenOptions::new()
            .read(true)
            .write(true)
            .create(true)
            .truncate(false)
            .open(path)?;
        file.seek(SeekFrom::End(0))?;
        Ok(BufWriter::new(file))
    }

    fn init_mmap(file: &BufWriter<File>) -> Result<Mmap> {
        unsafe { memmap2::MmapOptions::new().map(file.get_ref()) }
    }

    /// Re-maps the storage file and updates the key index after a write
    /// operation.
    ///
    /// This function performs two key tasks:
    /// 1. **Re-maps the file (`mmap`)**: Ensures that newly written data
    ///    is visible to readers by creating a fresh memory-mapped view of
    ///    the storage file.
    /// 2. **Updates the key index**: Inserts new key hash-to-offset
    ///    mappings into the in-memory key index, ensuring efficient key
    ///    lookups for future reads.
    ///
    /// # Parameters:
    /// - `write_guard`: A locked reference to the `BufWriter<File>`,
    ///   ensuring that writes are completed before remapping and
    ///   indexing.
    /// - `key_hash_offsets`: A slice of `(key_hash, tail_offset)`
    ///   tuples containing the latest key mappings to be added to the
    ///   index.
    /// - `tail_offset`: The **new absolute file offset** after the most
    ///   recent write. This represents the byte position where the next
    ///   write operation should begin. It is updated to reflect the
    ///   latest valid data in the storage.
    ///
    /// # Returns:
    /// - `Ok(())` if the reindexing process completes successfully.
    /// - `Err(std::io::Error)` if file metadata retrieval, memory
    ///   mapping, or key index updates fail.
    ///
    /// # Important:
    /// - **The write operation must be flushed before calling
    ///   `reindex`** to ensure all pending writes are persisted and
    ///   visible in the new memory-mapped file. This prevents potential
    ///   inconsistencies where written data is not reflected in the
    ///   remapped view.
    ///
    /// # Safety:
    /// - This function should be called **immediately after a write
    ///   operation** to ensure the file is in a consistent state before
    ///   remapping.
    /// - The function acquires locks on both the `mmap` and
    ///   `key_indexer` to prevent race conditions while updating shared
    ///   structures.
    ///
    /// # Locks Acquired:
    /// - `mmap` (`Mutex<Arc<Mmap>>`) is locked to update the
    ///   memory-mapped file.
    /// - `key_indexer` (`RwLock<HashMap<u64, u64>>`) is locked to
    ///   modify key mappings.
    fn reindex(
        &self,
        write_guard: &std::sync::RwLockWriteGuard<'_, BufWriter<File>>,
        key_hash_offsets: &[(u64, u64)],
        tail_offset: u64,
        deleted_keys: Option<&HashSet<u64>>,
    ) -> std::io::Result<()> {
        let new_mmap = Self::init_mmap(write_guard)?;
        let mut mmap_guard = self.mmap.lock().unwrap();
        let mut key_indexer_guard = self
            .key_indexer
            .write()
            .map_err(|_| std::io::Error::other("Failed to acquire index lock"))?;

        for (key_hash, offset) in key_hash_offsets.iter() {
            if deleted_keys
                .as_ref()
                .is_some_and(|set| set.contains(key_hash))
            {
                key_indexer_guard.remove(key_hash);
            } else {
                // Handle the Result from the new insert method
                if let Err(e) = key_indexer_guard.insert(*key_hash, *offset) {
                    // A collision was detected on write. The entire batch
                    // operation should fail to prevent an inconsistent state.
                    warn!("Write operation aborted due to hash collision: {}", e);
                    return Err(std::io::Error::other(e));
                }
            }
        }

        *mmap_guard = Arc::new(new_mmap);
        self.tail_offset.store(tail_offset, Ordering::Release);

        Ok(())
    }

    /// Returns the storage file path.
    ///
    /// # Returns:
    /// - A `PathBuf` containing the path to the storage file.
    pub fn get_path(&self) -> PathBuf {
        self.path.clone()
    }

    /// Retrieves an iterator over all valid entries in the storage.
    ///
    /// This iterator allows scanning the storage file and retrieving
    /// **only the most recent** versions of each key.
    ///
    /// # Returns:
    /// - An `EntryIterator` instance for iterating over valid entries.
    pub fn iter_entries(&self) -> EntryIterator {
        let mmap_clone = self.get_mmap_arc();
        let tail_offset = self.tail_offset.load(Ordering::Acquire);
        EntryIterator::new(mmap_clone, tail_offset)
    }

    /// Provides a parallel iterator over all valid entries in the
    /// storage.
    ///
    /// This method is only available when the `parallel` feature is
    /// enabled. It leverages the Rayon crate to process entries across
    /// multiple threads, which can be significantly faster for bulk
    /// operations on multi-core machines.
    ///
    /// The iterator is efficient, collecting only the necessary entry
    /// offsets first and then constructing the `EntryHandle` objects in
    /// parallel.
    ///
    /// # Returns
    /// - A Rayon `ParallelIterator` that yields `EntryHandle` items.
    #[cfg(feature = "parallel")]
    pub fn par_iter_entries(&self) -> impl ParallelIterator<Item = EntryHandle> {
        // First, acquire a read lock and collect all the packed offset
        // values. This is a short, fast operation.
        let key_indexer_guard = self.key_indexer.read().unwrap();
        let packed_values: Vec<u64> = key_indexer_guard.values().cloned().collect();
        drop(key_indexer_guard); // Release the lock as soon as possible.

        // Clone the mmap Arc once to be moved into the parallel iterator.
        let mmap_arc = self.get_mmap_arc();

        // Create a parallel iterator over the collected offsets. The
        // `filter_map` operation is the part that will run in parallel
        // across threads.
        packed_values.into_par_iter().filter_map(move |packed| {
            let (_tag, offset) = KeyIndexer::unpack(packed);
            let offset = offset as usize;

            // This logic is a simplified, read-only version of
            // `read_entry_with_context`. We perform basic bounds checks
            // to ensure safety.
            if offset + METADATA_SIZE > mmap_arc.len() {
                return None;
            }

            let metadata_bytes = &mmap_arc[offset..offset + METADATA_SIZE];
            let metadata = EntryMetadata::deserialize(metadata_bytes);

            // Derive aligned start from previous tail. For tombstones
            // (single NULL byte without pre-pad), also support legacy
            // no-prepad case.
            let prev_tail = metadata.prev_offset;
            let derived = prev_tail + Self::prepad_len(prev_tail) as u64;
            let entry_end = offset;

            let mut entry_start = derived as usize;

            // Tombstone detection (no pre-pad case).
            if entry_end > prev_tail as usize
                && entry_end - prev_tail as usize == 1
                && mmap_arc[prev_tail as usize..entry_end] == NULL_BYTE
            {
                entry_start = prev_tail as usize;
            }

            if entry_start >= entry_end || entry_end > mmap_arc.len() {
                return None;
            }

            // Filter out tombstones (single NULL byte region).
            if entry_end - entry_start == 1 && mmap_arc[entry_start..entry_end] == NULL_BYTE {
                return None;
            }

            #[cfg(any(test, debug_assertions))]
            {
                debug_assert_aligned_offset(entry_start as u64);
            }

            Some(EntryHandle {
                mmap_arc: mmap_arc.clone(),
                range: entry_start..entry_end,
                metadata,
            })
        })
    }

    /// Recovers the **latest valid chain** of entries from the storage
    /// file.
    ///
    /// This function **scans backward** through the file, verifying that
    /// each entry correctly references the previous offset. It
    /// determines the **last valid storage position** to ensure data
    /// integrity.
    ///
    /// # How It Works:
    /// - Scans from the last written offset **backward**.
    /// - Ensures each entry correctly points to its **previous offset**.
    /// - Stops at the **deepest valid chain** that reaches offset `0`.
    ///
    /// # Parameters:
    /// - `mmap`: A reference to the **memory-mapped file**.
    /// - `file_len`: The **current size** of the file in bytes.
    ///
    /// # Returns:
    /// - `Ok(final_valid_offset)`: The last **valid** byte offset.
    /// - `Err(std::io::Error)`: If a file read or integrity check fails
    fn recover_valid_chain(mmap: &Mmap, file_len: u64) -> Result<u64> {
        if file_len < METADATA_SIZE as u64 {
            return Ok(0);
        }

        let mut cursor = file_len;
        let mut best_valid_offset = None;
        while cursor >= METADATA_SIZE as u64 {
            let metadata_offset = cursor - METADATA_SIZE as u64;
            let metadata_bytes =
                &mmap[metadata_offset as usize..(metadata_offset as usize + METADATA_SIZE)];
            let metadata = EntryMetadata::deserialize(metadata_bytes);

            // Stored `prev_offset` is the **previous tail**.
            let prev_tail = metadata.prev_offset;

            // Derive start; handle tombstone (no pre-pad) as a special
            // case so chain length math stays correct.
            let derived_start = prev_tail + Self::prepad_len(prev_tail) as u64;
            let entry_end = metadata_offset;

            let entry_start = if entry_end > prev_tail
                && entry_end - prev_tail == 1
                && mmap[prev_tail as usize..entry_end as usize] == NULL_BYTE
            {
                prev_tail
            } else {
                #[cfg(any(test, debug_assertions))]
                {
                    debug_assert_aligned_offset(derived_start);
                }

                derived_start
            };

            if entry_start >= metadata_offset {
                cursor -= 1;
                continue;
            }

            let mut chain_valid = true;
            let mut back_cursor = prev_tail; // walk by tails
            // size of current entry data region
            let mut total_size = (metadata_offset - entry_start) + METADATA_SIZE as u64;

            while back_cursor != 0 {
                if back_cursor < METADATA_SIZE as u64 {
                    chain_valid = false;
                    break;
                }

                let prev_metadata_offset = back_cursor - METADATA_SIZE as u64;
                if prev_metadata_offset as usize + METADATA_SIZE > mmap.len() {
                    chain_valid = false;
                    break;
                }

                let prev_metadata_bytes = &mmap[prev_metadata_offset as usize
                    ..(prev_metadata_offset as usize + METADATA_SIZE)];
                let prev_metadata = EntryMetadata::deserialize(prev_metadata_bytes);

                let prev_prev_tail = prev_metadata.prev_offset;

                // Size of the previous entry’s data region
                let prev_entry_start = if prev_metadata_offset > prev_prev_tail
                    && prev_metadata_offset - prev_prev_tail == 1
                    && mmap[prev_prev_tail as usize..prev_metadata_offset as usize] == NULL_BYTE
                {
                    prev_prev_tail
                } else {
                    prev_prev_tail + Self::prepad_len(prev_prev_tail) as u64
                };

                if prev_entry_start >= prev_metadata_offset {
                    chain_valid = false;
                    break;
                }

                let entry_size = prev_metadata_offset.saturating_sub(prev_entry_start);

                total_size += entry_size + METADATA_SIZE as u64;

                if prev_prev_tail >= prev_metadata_offset {
                    chain_valid = false;
                    break;
                }

                back_cursor = prev_prev_tail;
            }

            if chain_valid && back_cursor == 0 && total_size <= file_len {
                best_valid_offset = Some(metadata_offset + METADATA_SIZE as u64);
                break;
            }

            cursor -= 1;
        }

        Ok(best_valid_offset.unwrap_or(0))
    }

    /// Performs the core logic of reading an entry from the store.
    ///
    /// This private helper centralizes the logic for both `read` and
    /// `batch_read`. It takes all necessary context to perform a safe
    /// lookup, including the key, its hash, the memory map, and a read
    /// guard for the key indexer.
    ///
    /// # Parameters
    /// - `key`: The original key bytes used for tag verification.
    /// - `key_hash`: The pre-computed hash of the key for index lookup.
    /// - `mmap_arc`: A reference to the active memory map.
    /// - `key_indexer_guard`: A read-lock guard for the key index.
    ///
    /// # Returns
    /// - `Some(EntryHandle)` if the key is found and all checks pass.
    /// - `None` if the key is not found, a tag mismatch occurs
    ///   (collision/corruption), or the entry is a tombstone.
    #[inline]
    fn read_entry_with_context<'a>(
        &self,
        non_hashed_key: Option<&[u8]>,
        key_hash: u64,
        mmap_arc: &Arc<Mmap>,
        key_indexer_guard: &RwLockReadGuard<'a, KeyIndexer>,
    ) -> Option<EntryHandle> {
        let packed = *key_indexer_guard.get_packed(&key_hash)?;
        let (tag, offset) = KeyIndexer::unpack(packed);

        // The crucial verification check, now centralized.
        if let Some(non_hashed_key) = non_hashed_key
            && tag != KeyIndexer::tag_from_key(non_hashed_key)
        {
            warn!(
                "Tag mismatch detected for `non_hashed_key`, likely a \
                 hash collision or index corruption."
            );
            return None;
        }

        let offset = offset as usize;
        if offset + METADATA_SIZE > mmap_arc.len() {
            return None;
        }

        let metadata_bytes = &mmap_arc[offset..offset + METADATA_SIZE];
        let metadata = EntryMetadata::deserialize(metadata_bytes);

        // Derive aligned payload start from stored previous tail. Support
        // tombstones (single NULL byte without pre-pad).
        let prev_tail = metadata.prev_offset;
        let derived = prev_tail + Self::prepad_len(prev_tail) as u64;
        let entry_end = offset;

        let mut entry_start = derived as usize;

        if entry_end > prev_tail as usize
            && entry_end - prev_tail as usize == 1
            && mmap_arc[prev_tail as usize..entry_end] == NULL_BYTE
        {
            entry_start = prev_tail as usize;
        }

        if entry_start >= entry_end || entry_end > mmap_arc.len() {
            return None;
        }

        // Tombstone (single null byte)
        if entry_end - entry_start == 1 && mmap_arc[entry_start..entry_end] == NULL_BYTE {
            return None;
        }

        #[cfg(any(test, debug_assertions))]
        {
            debug_assert_aligned_offset(entry_start as u64);
        }

        Some(EntryHandle {
            mmap_arc: mmap_arc.clone(),
            range: entry_start..entry_end,
            metadata,
        })
    }

    /// Copies an entry handle to a **different storage container**.
    ///
    /// This function:
    /// - Extracts metadata and content from the given `EntryHandle`.
    /// - Writes the entry into the `target` storage.
    ///
    /// # Parameters:
    /// - `entry`: The **entry handle** to be copied.
    /// - `target`: The **destination storage** where the entry should be
    ///   copied.
    ///
    /// # Returns:
    /// - `Ok(target_offset)`: The file offset where the copied entry was
    ///   written.
    /// - `Err(std::io::Error)`: If a write operation fails.
    ///
    /// # Notes:
    /// - This is a **low-level function** used by `copy` and related
    ///   operations.
    /// - The `entry` remains **unchanged** in the original storage.
    fn copy_handle(&self, entry: &EntryHandle, target: &DataStore) -> Result<u64> {
        let mut entry_stream = EntryStream::from(entry.clone_arc());
        target.write_stream_with_key_hash(entry.key_hash(), &mut entry_stream)
    }

    /// Estimates the potential space savings from compaction.
    ///
    /// This method scans the storage file and calculates the difference
    /// between the total file size and the size required to keep only
    /// the latest versions of all keys.
    ///
    /// # How It Works:
    /// - Iterates through the entries, tracking the **latest version** of
    ///   each key.
    /// - Ignores older versions of keys to estimate the **optimized**
    ///   storage footprint.
    /// - Returns the **difference** between the total file size and the
    ///   estimated compacted size.
    pub fn estimate_compaction_savings(&self) -> u64 {
        let total_size = self.file_size().unwrap_or(0);
        let mut unique_entry_size: u64 = 0;
        let mut seen_keys = HashSet::with_hasher(Xxh3BuildHasher);

        for entry in self.iter_entries() {
            if seen_keys.insert(entry.key_hash()) {
                unique_entry_size += entry.file_size() as u64;
            }
        }
        total_size.saturating_sub(unique_entry_size)
    }

    /// Provides access to the shared memory-mapped file (`Arc<Mmap>`)
    /// for testing.
    ///
    /// This method returns a cloned `Arc<Mmap>`, allowing test cases to
    /// inspect the memory-mapped region while ensuring reference
    /// counting remains intact.
    ///
    /// # Notes:
    /// - The returned `Arc<Mmap>` ensures safe access without
    ///   invalidating the mmap.
    /// - This function is only available in **test** and **debug**
    ///   builds.
    #[cfg(any(test, debug_assertions))]
    pub fn get_mmap_arc_for_testing(&self) -> Arc<Mmap> {
        self.get_mmap_arc()
    }

    /// Provides direct access to the raw pointer of the underlying
    /// memory map for testing.
    ///
    /// This method retrieves a raw pointer (`*const u8`) to the start of
    /// the memory-mapped file. It is useful for validating zero-copy
    /// behavior and memory alignment in test cases.
    ///
    /// # Safety Considerations:
    /// - The pointer remains valid **as long as** the mmap is not
    ///   remapped or dropped.
    /// - Dereferencing this pointer outside of controlled test
    ///   environments **is unsafe** and may result in undefined
    ///   behavior.
    ///
    /// # Notes:
    /// - This function is only available in **test** and **debug**
    ///   builds.
    #[cfg(any(test, debug_assertions))]
    pub fn arc_ptr(&self) -> *const u8 {
        self.get_mmap_arc().as_ptr()
    }

    #[inline]
    fn get_mmap_arc(&self) -> Arc<Mmap> {
        let guard = self.mmap.lock().unwrap();
        let mmap_clone = guard.clone();
        drop(guard);
        mmap_clone
    }

    // --- Alignment helper -------------------------------------------------

    /// Compute the number of pre-pad bytes required to align `offset` to
    /// `PAYLOAD_ALIGNMENT`. `PAYLOAD_ALIGNMENT` is a power of two.
    #[inline]
    fn prepad_len(offset: u64) -> usize {
        let a = PAYLOAD_ALIGNMENT;
        ((a - (offset % a)) & (a - 1)) as usize
    }

    // ---------------------------------------------------------------------

    // TODO: Determine thread count *before* running this OR [somehow]
    // make it thread safe.
    /// Compacts the storage by keeping only the latest version of each
    /// key.
    ///
    /// # ⚠️ WARNING:
    /// - **This function should only be used when a single thread is
    ///   accessing the storage.**
    /// - While `&mut self` prevents concurrent **mutations**, it **does
    ///   not** prevent other threads from holding shared references
    ///   (`&DataStore`) and performing reads.
    /// - If the `DataStore` instance is wrapped in `Arc<DataStore>`,
    ///   multiple threads may still hold **read** references while
    ///   compaction is running, potentially leading to inconsistent
    ///   reads.
    /// - If stricter concurrency control is required, **manual
    ///   synchronization should be enforced externally.**
    ///
    /// # Behavior:
    /// - Creates a **temporary compacted file** containing only the
    ///   latest versions of stored keys.
    /// - Swaps the original file with the compacted version upon
    ///   success.
    /// - Does **not** remove tombstone (deleted) entries due to the
    ///   append-only model.
    ///
    /// # Returns:
    /// - `Ok(())` if compaction completes successfully.
    /// - `Err(std::io::Error)` if an I/O operation fails.
    pub fn compact(&mut self) -> Result<()> {
        let compacted_path = crate::utils::append_extension(&self.path, "bk");
        info!("Starting compaction. Writing to: {:?}", compacted_path);

        let compacted_storage = DataStore::open(&compacted_path)?;
        let mut index_pairs: Vec<(u64, u64)> = Vec::new();
        let mut compacted_data_size: u64 = 0;

        for entry in self.iter_entries() {
            let new_tail_offset = self.copy_handle(&entry, &compacted_storage)?;
            let stored_metadata_offset = new_tail_offset - METADATA_SIZE as u64;
            index_pairs.push((entry.key_hash(), stored_metadata_offset));
            compacted_data_size += entry.file_size() as u64;
        }

        let size_before = self.file_size()?;

        // Note: The current implementation should never increase space,
        // but if an additional indexer is ever used, this may change.
        //
        // Only write the static index if it actually saves space
        if size_before > compacted_data_size {
            info!("Compaction will save space. Writing static index.");

            let mut file_guard = compacted_storage
                .file
                .write()
                .map_err(|e| std::io::Error::other(format!("Lock poisoned: {e}")))?;
            file_guard.flush()?;
        } else {
            info!(
                "Compaction would increase file size \
                 (data w/ indexing: {compacted_data_size}). \
                 Skipping static index generation.",
            );
        }

        drop(compacted_storage);

        debug!("Compaction successful. Swapping files...");
        std::fs::rename(&compacted_path, &self.path)?;
        info!("Compaction file swap complete.");
        Ok(())
    }
}

impl DataStoreWriter for DataStore {
    fn write_stream<R: Read>(&self, key: &[u8], reader: &mut R) -> Result<u64> {
        let key_hash = compute_hash(key);
        self.write_stream_with_key_hash(key_hash, reader)
    }

    fn write_stream_with_key_hash<R: Read>(&self, key_hash: u64, reader: &mut R) -> Result<u64> {
        let mut file = self
            .file
            .write()
            .map_err(|_| std::io::Error::other("Failed to acquire file lock"))?;
        let prev_tail = self.tail_offset.load(Ordering::Acquire);

        // Pre-align payload start so typed views can be zero-copy.
        let prepad = Self::prepad_len(prev_tail);
        if prepad > 0 {
            // Pad with zeros; not part of logical payload.
            let pad = [0u8; 64];
            file.write_all(&pad[..prepad])?;
        }

        let mut buffer = vec![0; WRITE_STREAM_BUFFER_SIZE];
        let mut total_written = 0;
        let mut checksum_state = crc32fast::Hasher::new();
        let mut is_null_only = true;

        while let Ok(bytes_read) = reader.read(&mut buffer) {
            if bytes_read == 0 {
                break;
            }

            if buffer[..bytes_read].iter().any(|&b| b != NULL_BYTE[0]) {
                is_null_only = false;
            }

            file.write_all(&buffer[..bytes_read])?;
            checksum_state.update(&buffer[..bytes_read]);
            total_written += bytes_read;
        }

        if total_written > 0 && is_null_only {
            return Err(std::io::Error::new(
                std::io::ErrorKind::InvalidInput,
                "NULL-byte-only streams cannot be written directly.",
            ));
        }

        if total_written == 0 {
            return Err(std::io::Error::new(
                std::io::ErrorKind::InvalidInput,
                "Payload cannot be empty.",
            ));
        }

        let checksum = checksum_state.finalize().to_le_bytes();
        // Link to previous tail; readers derive aligned start.
        let metadata = EntryMetadata {
            key_hash,
            prev_offset: prev_tail,
            checksum,
        };
        file.write_all(&metadata.serialize())?;
        file.flush()?;

        let tail_offset = prev_tail + prepad as u64 + total_written as u64 + METADATA_SIZE as u64;

        self.reindex(
            &file,
            &[(key_hash, tail_offset - METADATA_SIZE as u64)],
            tail_offset,
            None,
        )?;
        Ok(tail_offset)
    }

    fn write(&self, key: &[u8], payload: &[u8]) -> Result<u64> {
        let key_hash = compute_hash(key);
        self.write_with_key_hash(key_hash, payload)
    }

    fn write_with_key_hash(&self, key_hash: u64, payload: &[u8]) -> Result<u64> {
        self.batch_write_with_key_hashes(vec![(key_hash, payload)], false)
    }

    // TODO: Consider change signature to:
    // fn batch_write(&self, entries: Vec<(Vec<u8>, Vec<u8>)>) -> Result<u64>
    fn batch_write(&self, entries: &[(&[u8], &[u8])]) -> Result<u64> {
        let (keys, payloads): (Vec<_>, Vec<_>) = entries.iter().cloned().unzip();
        let hashes = compute_hash_batch(&keys);
        let hashed_entries = hashes.into_iter().zip(payloads).collect::<Vec<_>>();
        self.batch_write_with_key_hashes(hashed_entries, false)
    }

    // TODO: Consider change `prehashed_keys: Vec<(u64, &[u8])>` to
    // `prehashed_keys: Vec<(u64, Vec<u8>)>`
    fn batch_write_with_key_hashes(
        &self,
        prehashed_keys: Vec<(u64, &[u8])>,
        allow_null_bytes: bool,
    ) -> Result<u64> {
        let mut file = self
            .file
            .write()
            .map_err(|_| std::io::Error::other("Failed to acquire file lock"))?;

        let mut buffer = Vec::new();
        let mut tail_offset = self.tail_offset.load(Ordering::Acquire);

        let mut key_hash_offsets: Vec<(u64, u64)> = Vec::with_capacity(prehashed_keys.len());
        let mut deleted_keys: HashSet<u64> = HashSet::new();

        for (key_hash, payload) in prehashed_keys {
            if payload == NULL_BYTE {
                if !allow_null_bytes {
                    return Err(std::io::Error::new(
                        std::io::ErrorKind::InvalidInput,
                        "NULL-byte payloads cannot be written directly.",
                    ));
                }
                // Tombstone: write 1 byte, no pre-pad.
                let link_to_prev_tail = tail_offset;

                if payload.is_empty() {
                    return Err(std::io::Error::new(
                        std::io::ErrorKind::InvalidInput,
                        "Payload cannot be empty.",
                    ));
                }

                let checksum = compute_checksum(payload);
                let metadata = EntryMetadata {
                    key_hash,
                    prev_offset: link_to_prev_tail,
                    checksum,
                };

                let mut entry: Vec<u8> = vec![0u8; 1 + METADATA_SIZE];
                entry[0] = NULL_BYTE[0];
                entry[1..].copy_from_slice(&metadata.serialize());

                buffer.extend_from_slice(&entry);

                tail_offset += entry.len() as u64;
                key_hash_offsets.push((key_hash, tail_offset - METADATA_SIZE as u64));
                deleted_keys.insert(key_hash);
                continue;
            }

            if payload.is_empty() {
                return Err(std::io::Error::new(
                    std::io::ErrorKind::InvalidInput,
                    "Payload cannot be empty.",
                ));
            }

            // Non-tombstone: pre-align current payload.
            let link_to_prev_tail = tail_offset;
            let prepad = Self::prepad_len(tail_offset);
            if prepad > 0 {
                let old_len = buffer.len();
                buffer.resize(old_len + prepad, 0u8);
                tail_offset += prepad as u64;
            }

            let checksum = compute_checksum(payload);
            let metadata = EntryMetadata {
                key_hash,
                prev_offset: link_to_prev_tail,
                checksum,
            };
            let payload_len = payload.len();

            let mut entry: Vec<u8> = vec![0u8; payload_len + METADATA_SIZE];
            simd_copy(&mut entry[..payload.len()], payload);
            entry[payload.len()..].copy_from_slice(&metadata.serialize());
            buffer.extend_from_slice(&entry);

            tail_offset += entry.len() as u64;
            key_hash_offsets.push((key_hash, tail_offset - METADATA_SIZE as u64));
        }

        file.write_all(&buffer)?;
        file.flush()?;

        self.reindex(&file, &key_hash_offsets, tail_offset, Some(&deleted_keys))?;

        Ok(self.tail_offset.load(Ordering::Acquire))
    }

    fn rename(&self, old_key: &[u8], new_key: &[u8]) -> Result<u64> {
        if old_key == new_key {
            return Err(std::io::Error::new(
                std::io::ErrorKind::InvalidInput,
                "Cannot rename a key to itself",
            ));
        }

        let old_entry = self.read(old_key)?.ok_or_else(|| {
            std::io::Error::new(std::io::ErrorKind::NotFound, "Old key not found")
        })?;
        let mut old_entry_stream = EntryStream::from(old_entry);

        self.write_stream(new_key, &mut old_entry_stream)?;

        let new_offset = self.delete(old_key)?;
        Ok(new_offset)
    }

    fn copy(&self, key: &[u8], target: &DataStore) -> Result<u64> {
        if self.path == target.path {
            return Err(std::io::Error::new(
                std::io::ErrorKind::InvalidInput,
                format!(
                    "Cannot copy entry to the same storage ({:?}). \
                     Use `rename` instead.",
                    self.path
                ),
            ));
        }

        let entry_handle = self.read(key)?.ok_or_else(|| {
            std::io::Error::new(
                std::io::ErrorKind::NotFound,
                format!("Key not found: {:?}", String::from_utf8_lossy(key)),
            )
        })?;
        self.copy_handle(&entry_handle, target)
    }

    fn transfer(&self, key: &[u8], target: &DataStore) -> Result<u64> {
        self.copy(key, target)?;
        self.delete(key)
    }

    fn delete(&self, key: &[u8]) -> Result<u64> {
        self.batch_delete(&[key])
    }

    fn batch_delete(&self, keys: &[&[u8]]) -> Result<u64> {
        let key_hashes = compute_hash_batch(keys);
        self.batch_delete_key_hashes(&key_hashes)
    }

    fn batch_delete_key_hashes(&self, prehashed_keys: &[u64]) -> Result<u64> {
        // First, check which keys actually exist to avoid writing
        // useless tombstones.
        let keys_to_delete: Vec<u64> = {
            let key_indexer_guard = self
                .key_indexer
                .read()
                .map_err(|_| Error::other("Key-index lock poisoned during batch_delete check"))?;

            prehashed_keys
                .iter()
                .filter(|&&key_hash| key_indexer_guard.get_packed(&key_hash).is_some())
                .cloned()
                .collect()
        };

        // If no keys were found to delete, exit early without any I/O.
        if keys_to_delete.is_empty() {
            return Ok(self.tail_offset.load(Ordering::Acquire));
        }

        // Prepare the delete operations (a key hash + a null byte).
        let delete_ops: Vec<(u64, &[u8])> = keys_to_delete
            .iter()
            .map(|&key_hash| (key_hash, &NULL_BYTE as &[u8]))
            .collect();

        // Use the underlying batch write method, allowing null bytes.
        self.batch_write_with_key_hashes(delete_ops, true)
    }
}

impl DataStoreReader for DataStore {
    type EntryHandleType = EntryHandle;

    fn exists(&self, key: &[u8]) -> Result<bool> {
        Ok(self.read(key)?.is_some())
    }

    fn exists_with_key_hash(&self, prehashed_key: u64) -> Result<bool> {
        // This is a lightweight wrapper around the read method, just
        // like exists().
        Ok(self.read_with_key_hash(prehashed_key)?.is_some())
    }

    fn read(&self, key: &[u8]) -> Result<Option<EntryHandle>> {
        let key_hash = compute_hash(key);
        let key_indexer_guard = self
            .key_indexer
            .read()
            .map_err(|_| Error::other("key-index lock poisoned"))?;
        let mmap_arc = self.get_mmap_arc();

        Ok(self.read_entry_with_context(Some(key), key_hash, &mmap_arc, &key_indexer_guard))
    }

    fn read_with_key_hash(&self, prehashed_key: u64) -> Result<Option<EntryHandle>> {
        let key_indexer_guard = self
            .key_indexer
            .read()
            .map_err(|_| Error::other("key-index lock poisoned"))?;
        let mmap_arc = self.get_mmap_arc();

        Ok(self.read_entry_with_context(None, prehashed_key, &mmap_arc, &key_indexer_guard))
    }

    fn read_last_entry(&self) -> Result<Option<EntryHandle>> {
        let mmap_arc = self.get_mmap_arc();
        let tail_offset = self.tail_offset.load(std::sync::atomic::Ordering::Acquire);
        if tail_offset < METADATA_SIZE as u64 || mmap_arc.is_empty() {
            return Ok(None);
        }

        let metadata_offset = (tail_offset - METADATA_SIZE as u64) as usize;
        if metadata_offset + METADATA_SIZE > mmap_arc.len() {
            return Ok(None);
        }

        let metadata_bytes = &mmap_arc[metadata_offset..metadata_offset + METADATA_SIZE];
        let metadata = EntryMetadata::deserialize(metadata_bytes);

        // Derive aligned start; support tombstone no-prepad case.
        let prev_tail = metadata.prev_offset;
        let derived = prev_tail + Self::prepad_len(prev_tail) as u64;
        let entry_end = metadata_offset;

        let mut entry_start = derived as usize;
        if entry_end > prev_tail as usize
            && entry_end - prev_tail as usize == 1
            && mmap_arc[prev_tail as usize..entry_end] == NULL_BYTE
        {
            entry_start = prev_tail as usize;
        }

        if entry_start >= entry_end || entry_end > mmap_arc.len() {
            return Ok(None);
        }

        #[cfg(any(test, debug_assertions))]
        {
            debug_assert_aligned_offset(entry_start as u64);
        }

        Ok(Some(EntryHandle {
            mmap_arc,
            range: entry_start..entry_end,
            metadata,
        }))
    }

    fn batch_read(&self, keys: &[&[u8]]) -> Result<Vec<Option<EntryHandle>>> {
        let hashed_keys = compute_hash_batch(keys);

        self.batch_read_hashed_keys(&hashed_keys, Some(keys))
    }

    fn batch_read_hashed_keys(
        &self,
        prehashed_keys: &[u64],
        non_hashed_keys: Option<&[&[u8]]>,
    ) -> Result<Vec<Option<EntryHandle>>> {
        let mmap_arc = self.get_mmap_arc();
        let key_indexer_guard = self
            .key_indexer
            .read()
            .map_err(|_| Error::other("Key-index lock poisoned during `batch_read`"))?;

        // Use a match to handle the two possible scenarios
        let results = match non_hashed_keys {
            // Case 1: We have the original keys for tag verification.
            Some(keys) => {
                // Good practice to ensure lengths match.
                if keys.len() != prehashed_keys.len() {
                    return Err(std::io::Error::new(
                        std::io::ErrorKind::InvalidInput,
                        "Mismatched lengths for hashed and non-hashed keys.",
                    ));
                }

                prehashed_keys
                    .iter()
                    .zip(keys.iter())
                    .map(|(key_hash, &key)| {
                        // Correctly pass `Some(key)` for verification
                        self.read_entry_with_context(
                            Some(key),
                            *key_hash,
                            &mmap_arc,
                            &key_indexer_guard,
                        )
                    })
                    .collect()
            }
            // Case 2: We only have the hashes and must skip tag check.
            None => prehashed_keys
                .iter()
                .map(|key_hash| {
                    self.read_entry_with_context(None, *key_hash, &mmap_arc, &key_indexer_guard)
                })
                .collect(),
        };

        Ok(results)
    }

    fn read_metadata(&self, key: &[u8]) -> Result<Option<EntryMetadata>> {
        Ok(self.read(key)?.map(|entry| entry.metadata().clone()))
    }

    fn len(&self) -> Result<usize> {
        let read_guard = self
            .key_indexer
            .read()
            .map_err(|_| Error::other("Key-index lock poisoned during `len`"))?;

        Ok(read_guard.len())
    }

    fn is_empty(&self) -> Result<bool> {
        let len = self.len()?;

        Ok(len == 0)
    }

    fn file_size(&self) -> Result<u64> {
        std::fs::metadata(&self.path).map(|meta| meta.len())
    }
}