nntp-proxy 0.5.0

//! Cache module for NNTP article caching
//!
//! This module provides caching functionality for NNTP articles,
//! allowing the proxy to cache article content and reduce backend load.
//!
//! The `ArticleAvailability` type serves dual purposes:
//! 1. Cache persistence - track which backends have which articles across requests
//! 2. Retry tracking - track which backends tried during 430 retry loops (transient)
//!
//! ## Cache Implementations
//!
//! - [`ArticleCache`] - In-memory body cache using moka when article bodies stay in memory
//! - [`HybridArticleCache`] - Memory + disk cache using foyer (when `[cache.disk]` configured)
//! - [`UnifiedCache`] - Enum that wraps availability-only, memory, or hybrid cache modes

mod article;
mod availability;
mod availability_index;
mod hybrid;
mod hybrid_codec;
pub mod ttl;

#[cfg(test)]
mod mock_hybrid;

pub use article::{ArticleCache, CachedArticle};
pub use availability::{ArticleAvailability, BackendStatus, MAX_BACKENDS};
pub use availability_index::AvailabilityIndex;
pub use hybrid::{HybridArticleCache, HybridCacheConfig, HybridCacheStats};

use crate::protocol::StatusCode;
use crate::types::{BackendId, MessageId};
use smallvec::SmallVec;

/// Owned response storage passed across the async cache ingest boundary.
///
/// Hot-path code should hand off one of these owned forms directly instead of
/// flattening into a fresh `Vec<u8>` before spawning cache work.
#[derive(Debug)]
#[allow(clippy::large_enum_variant)]
pub enum CacheIngestResponse {
    Owned(Box<[u8]>),
    Pooled(crate::pool::PooledBuffer),
    Chunked(crate::pool::ChunkedResponse),
    Inline(SmallVec<[u8; 128]>),
}

impl CacheIngestResponse {
    #[must_use]
    pub(crate) fn len(&self) -> usize {
        match self {
            Self::Owned(buf) => buf.len(),
            Self::Pooled(buf) => buf.len(),
            Self::Chunked(buf) => buf.len(),
            Self::Inline(buf) => buf.len(),
        }
    }

    #[cfg(test)]
    #[must_use]
    pub(crate) fn status_code(&self) -> Option<StatusCode> {
        match self {
            Self::Owned(buf) => StatusCode::parse(buf),
            Self::Pooled(buf) => StatusCode::parse(buf.as_ref()),
            Self::Chunked(buf) => {
                let mut prefix = SmallVec::<[u8; 128]>::new();
                buf.copy_prefix_into(3, &mut prefix);
                StatusCode::parse(&prefix)
            }
            Self::Inline(buf) => StatusCode::parse(buf),
        }
    }
}

#[cfg(test)]
impl PartialEq for CacheIngestResponse {
    fn eq(&self, other: &Self) -> bool {
        fn chunks<'a>(buf: &'a CacheIngestResponse) -> Box<dyn Iterator<Item = &'a [u8]> + 'a> {
            match buf {
                CacheIngestResponse::Owned(v) => Box::new(std::iter::once(v.as_ref())),
                CacheIngestResponse::Pooled(v) => Box::new(std::iter::once(v.as_ref())),
                CacheIngestResponse::Chunked(v) => Box::new(v.iter_chunks()),
                CacheIngestResponse::Inline(v) => Box::new(std::iter::once(v.as_slice())),
            }
        }

        if self.len() != other.len() {
            return false;
        }

        let left = chunks(self).flat_map(|chunk| chunk.iter().copied());
        let mut right = chunks(other).flat_map(|chunk| chunk.iter().copied());
        left.eq(&mut right)
    }
}

#[cfg(test)]
impl Eq for CacheIngestResponse {}

impl From<Vec<u8>> for CacheIngestResponse {
    fn from(value: Vec<u8>) -> Self {
        Self::Owned(value.into_boxed_slice())
    }
}

impl From<crate::pool::PooledBuffer> for CacheIngestResponse {
    fn from(value: crate::pool::PooledBuffer) -> Self {
        Self::Pooled(value)
    }
}

impl From<crate::pool::ChunkedResponse> for CacheIngestResponse {
    fn from(value: crate::pool::ChunkedResponse) -> Self {
        Self::Chunked(value)
    }
}

impl From<SmallVec<[u8; 128]>> for CacheIngestResponse {
    fn from(value: SmallVec<[u8; 128]>) -> Self {
        Self::Inline(value)
    }
}

impl From<&[u8]> for CacheIngestResponse {
    fn from(value: &[u8]) -> Self {
        if value.len() <= 128 {
            Self::Inline(SmallVec::<[u8; 128]>::from_slice(value))
        } else {
            Self::Owned(value.into())
        }
    }
}

impl<const N: usize> From<&[u8; N]> for CacheIngestResponse {
    fn from(value: &[u8; N]) -> Self {
        Self::from(value.as_slice())
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[tokio::test]
    async fn cache_ingest_response_equality_spans_storage_forms() {
        let bytes = b"220 0 <test@example.com>\r\nBody\r\n.\r\n";
        let pool =
            crate::pool::BufferPool::new(crate::types::BufferSize::try_new(1024).unwrap(), 1)
                .with_capture_pool(8, 4);

        let mut pooled = pool.acquire();
        pooled.copy_from_slice(bytes);

        let mut chunked = crate::pool::ChunkedResponse::default();
        chunked.extend_from_slice(&pool, bytes);

        let small = SmallVec::<[u8; 128]>::from_slice(bytes);

        assert_eq!(
            CacheIngestResponse::Owned(bytes.to_vec().into_boxed_slice()),
            CacheIngestResponse::Pooled(pooled)
        );
        assert_eq!(
            CacheIngestResponse::Chunked(chunked),
            CacheIngestResponse::Inline(small)
        );
    }

    #[tokio::test]
    async fn cache_ingest_response_status_code_spans_storage_forms() {
        let bytes = b"220 0 <test@example.com>\r\nBody\r\n.\r\n";
        let pool =
            crate::pool::BufferPool::new(crate::types::BufferSize::try_new(1024).unwrap(), 1)
                .with_capture_pool(8, 4);

        let mut pooled = pool.acquire();
        pooled.copy_from_slice(bytes);

        let mut chunked = crate::pool::ChunkedResponse::default();
        chunked.extend_from_slice(&pool, bytes);

        let small = SmallVec::<[u8; 128]>::from_slice(bytes);

        assert_eq!(
            CacheIngestResponse::Owned(bytes.to_vec().into_boxed_slice()).status_code(),
            Some(StatusCode::new(220))
        );
        assert_eq!(
            CacheIngestResponse::Pooled(pooled).status_code(),
            Some(StatusCode::new(220))
        );
        assert_eq!(
            CacheIngestResponse::Chunked(chunked).status_code(),
            Some(StatusCode::new(220))
        );
        assert_eq!(
            CacheIngestResponse::Inline(small).status_code(),
            Some(StatusCode::new(220))
        );
    }

    #[test]
    fn cache_ingest_response_from_short_slice_uses_inline_storage() {
        let buffer = CacheIngestResponse::from(b"223\r\n".as_slice());

        assert!(matches!(buffer, CacheIngestResponse::Inline(_)));
        assert_eq!(buffer.status_code(), Some(StatusCode::new(223)));
    }

    #[test]
    fn cache_ingest_response_from_large_slice_stores_owned_slice() {
        let bytes = [b'x'; 129];

        let buffer = CacheIngestResponse::from(bytes.as_slice());

        assert!(matches!(buffer, CacheIngestResponse::Owned(_)));
    }

    #[test]
    fn cache_ingest_response_from_vec_stores_tight_owned_slice() {
        let buffer = CacheIngestResponse::from(Vec::from(&b"220 1 <tight@example>\r\n.\r\n"[..]));

        assert!(matches!(buffer, CacheIngestResponse::Owned(_)));
        assert_eq!(buffer.status_code(), Some(StatusCode::new(220)));
    }

    #[tokio::test]
    async fn unified_cache_records_typed_availability_without_payload() {
        let cache = UnifiedCache::memory(1000, std::time::Duration::from_secs(60));
        let msg_id = MessageId::new("<typed-availability@example>".to_string()).unwrap();
        let backend_id = BackendId::from_index(1);

        cache
            .record_backend_has_status(
                msg_id.clone(),
                StatusCode::new(220),
                backend_id,
                ttl::CacheTier::new(2),
            )
            .await;

        let entry = cache.get(&msg_id).await.expect("entry is recorded");
        assert_eq!(entry.status_code(), StatusCode::new(220));
        assert_eq!(
            entry
                .request_cache_metadata(&entry.availability())
                .payload_kind(),
            crate::protocol::RequestCachePayloadKind::AvailabilityOnly
        );
        assert_eq!(entry.payload_len().get(), 0);
        assert!(entry.has_availability_info());
        assert!(entry.should_try_backend(backend_id));
    }
}

/// Statistics for cache display in TUI
#[derive(Debug, Clone, Default)]
pub struct CacheDisplayStats {
    /// Number of cached entries
    pub entry_count: u64,
    /// Total size in bytes (memory tier for hybrid)
    pub size_bytes: u64,
    /// Cache hit rate as percentage (0.0 to 100.0)
    pub hit_rate: f64,
    /// Disk cache statistics (only for hybrid cache)
    pub disk: Option<DiskDisplayStats>,
}

/// Disk-tier statistics for hybrid cache
#[derive(Debug, Clone, Default)]
pub struct DiskDisplayStats {
    /// Hits served from disk tier
    pub disk_hits: u64,
    /// Percentage of total hits served from disk
    pub disk_hit_rate: f64,
    /// Configured disk capacity in bytes
    pub capacity: u64,
    /// Bytes actually written to disk
    pub bytes_written: u64,
    /// Bytes read from disk
    pub bytes_read: u64,
    /// Number of write I/O operations
    pub write_ios: u64,
    /// Number of read I/O operations
    pub read_ios: u64,
}

/// Trait for getting cache statistics for TUI display
pub trait CacheStatsProvider: Send + Sync {
    /// Get statistics for TUI display
    fn display_stats(&self) -> CacheDisplayStats;
}

impl CacheStatsProvider for ArticleCache {
    fn display_stats(&self) -> CacheDisplayStats {
        CacheDisplayStats {
            entry_count: self.entry_count(),
            size_bytes: self.weighted_size(),
            hit_rate: self.hit_rate(),
            disk: None,
        }
    }
}

impl CacheStatsProvider for AvailabilityIndex {
    fn display_stats(&self) -> CacheDisplayStats {
        CacheDisplayStats {
            entry_count: self.entry_count(),
            size_bytes: self.used_bytes(),
            hit_rate: self.hit_rate(),
            disk: None,
        }
    }
}

impl CacheStatsProvider for HybridArticleCache {
    fn display_stats(&self) -> CacheDisplayStats {
        let stats = self.stats();
        CacheDisplayStats {
            entry_count: 0,                    // foyer doesn't expose entry count easily
            size_bytes: stats.memory_capacity, // Use configured capacity
            hit_rate: stats.hit_rate(),
            disk: Some(DiskDisplayStats {
                disk_hits: stats.disk_hits,
                disk_hit_rate: stats.disk_hit_rate(),
                capacity: stats.disk_capacity,
                bytes_written: stats.disk_write_bytes,
                bytes_read: stats.disk_read_bytes,
                write_ios: stats.disk_write_ios,
                read_ios: stats.disk_read_ios,
            }),
        }
    }
}

/// Unified cache that can be availability-only, memory-only (moka), or hybrid (foyer)
///
/// This enum provides a common interface for all cache implementations,
/// allowing the proxy to switch between availability-only, memory, and disk-backed
/// caching based on configuration.
#[derive(Debug)]
pub enum UnifiedCache {
    /// Availability-only negative index with exact key matches.
    Availability(AvailabilityIndex),
    /// Memory-only cache using moka
    Memory(ArticleCache),
    /// Hybrid memory+disk cache using foyer
    Hybrid(HybridArticleCache),
}

impl UnifiedCache {
    /// Create an availability-only negative index.
    #[must_use]
    pub fn availability(ttl: std::time::Duration) -> Self {
        Self::Availability(AvailabilityIndex::with_ttl(ttl))
    }

    /// Create a memory-only cache
    #[must_use]
    pub fn memory(capacity: u64, ttl: std::time::Duration) -> Self {
        Self::Memory(ArticleCache::new(capacity, ttl))
    }

    /// Create a hybrid cache (async because foyer needs async initialization)
    pub async fn hybrid(config: HybridCacheConfig) -> anyhow::Result<Self> {
        Ok(Self::Hybrid(HybridArticleCache::new(config).await?))
    }

    /// Returns true when successful backend responses update positive
    /// availability metadata.
    #[must_use]
    pub const fn records_backend_has_status(&self) -> bool {
        !matches!(self, Self::Availability(_))
    }

    /// Returns true when this cache stores response payloads.
    #[must_use]
    pub const fn stores_payload_responses(&self) -> bool {
        !matches!(self, Self::Availability(_))
    }

    /// Get an article from the cache
    pub async fn get(&self, message_id: &MessageId<'_>) -> Option<CachedArticle> {
        match self {
            Self::Availability(index) => index.get(message_id),
            Self::Memory(cache) => cache.get(message_id).await,
            Self::Hybrid(cache) => cache
                .get(message_id)
                .await
                .map(hybrid_codec::DiskCachedArticle::into_cached_article),
        }
    }

    /// Get an article from a validated request message-id string (`<...>`).
    ///
    /// Memory and hybrid cache hits avoid rebuilding a `MessageId` by looking up
    /// the stripped cache key directly.
    pub async fn get_request_message_id(&self, message_id: &str) -> Option<CachedArticle> {
        match self {
            Self::Availability(index) => index.get_request_message_id(message_id),
            Self::Memory(cache) => {
                let key = message_id.strip_prefix('<')?.strip_suffix('>')?;
                cache.get_by_cache_key(key).await
            }
            Self::Hybrid(cache) => {
                let key = message_id.strip_prefix('<')?.strip_suffix('>')?;
                cache
                    .get_by_cache_key(key)
                    .await
                    .map(hybrid_codec::DiskCachedArticle::into_cached_article)
            }
        }
    }

    pub async fn upsert_ingest(
        &self,
        message_id: MessageId<'_>,
        buffer: impl Into<CacheIngestResponse>,
        backend_id: BackendId,
        tier: ttl::CacheTier,
    ) {
        let buffer = buffer.into();
        match self {
            Self::Availability(_) => {}
            Self::Memory(cache) => {
                cache
                    .upsert_ingest(message_id, buffer, backend_id, tier)
                    .await;
            }
            Self::Hybrid(cache) => {
                cache
                    .upsert_ingest(message_id, buffer, backend_id, tier)
                    .await;
            }
        }
    }

    /// Record that a backend returned 430 for this article
    pub async fn record_backend_missing(&self, message_id: MessageId<'_>, backend_id: BackendId) {
        match self {
            Self::Availability(index) => index.record_backend_missing(&message_id, backend_id),
            Self::Memory(cache) => cache.record_backend_missing(message_id, backend_id).await,
            Self::Hybrid(cache) => cache.record_missing(message_id, backend_id).await,
        }
    }

    /// Record that a backend has an article with a known status, without storing payload bytes.
    pub async fn record_backend_has_status(
        &self,
        message_id: MessageId<'_>,
        status_code: StatusCode,
        backend_id: BackendId,
        tier: ttl::CacheTier,
    ) {
        match self {
            Self::Availability(_) => {}
            Self::Memory(cache) => {
                cache
                    .record_backend_has_status(message_id, status_code, backend_id, tier)
                    .await;
            }
            Self::Hybrid(cache) => {
                cache
                    .record_has_status(message_id, status_code, backend_id, tier)
                    .await;
            }
        }
    }

    /// Sync availability information for an article
    pub async fn sync_availability(
        &self,
        message_id: MessageId<'_>,
        availability: &ArticleAvailability,
    ) {
        match self {
            Self::Availability(index) => index.sync_availability(&message_id, availability),
            Self::Memory(cache) => cache.sync_availability(message_id, availability).await,
            Self::Hybrid(cache) => cache.sync_availability(message_id, availability).await,
        }
    }

    /// Load persisted availability state if this is an availability-only cache.
    pub fn load_from_disk(&self, path: &std::path::Path) -> anyhow::Result<bool> {
        match self {
            Self::Availability(index) => index.load_from_path(path),
            Self::Memory(_) | Self::Hybrid(_) => Ok(false),
        }
    }

    /// Save persisted availability state if this is an availability-only cache.
    pub fn save_to_disk(&self, path: &std::path::Path) -> anyhow::Result<bool> {
        match self {
            Self::Availability(index) => {
                index.save_to_path(path)?;
                Ok(true)
            }
            Self::Memory(_) | Self::Hybrid(_) => Ok(false),
        }
    }

    /// Get cache capacity
    #[must_use]
    pub fn capacity(&self) -> u64 {
        match self {
            Self::Availability(index) => index.capacity_bytes(),
            Self::Memory(cache) => cache.capacity(),
            Self::Hybrid(cache) => cache.stats().memory_capacity,
        }
    }

    /// Get number of cached entries
    #[must_use]
    pub fn entry_count(&self) -> u64 {
        match self {
            Self::Availability(index) => index.entry_count(),
            Self::Memory(cache) => cache.entry_count(),
            Self::Hybrid(_cache) => 0, // foyer doesn't expose this easily
        }
    }

    /// Get weighted size in bytes
    #[must_use]
    pub fn weighted_size(&self) -> u64 {
        match self {
            Self::Availability(index) => index.used_bytes(),
            Self::Memory(cache) => cache.weighted_size(),
            Self::Hybrid(cache) => cache.stats().memory_capacity,
        }
    }

    /// Get cache hit rate
    #[must_use]
    pub fn hit_rate(&self) -> f64 {
        match self {
            Self::Availability(index) => index.hit_rate(),
            Self::Memory(cache) => cache.hit_rate(),
            Self::Hybrid(cache) => cache.stats().hit_rate(),
        }
    }

    /// Check if this is a hybrid cache (has disk tier)
    #[must_use]
    pub const fn is_hybrid(&self) -> bool {
        matches!(self, Self::Hybrid(_))
    }

    /// Check if this cache is the dedicated availability-only index.
    #[must_use]
    pub const fn is_availability_only(&self) -> bool {
        matches!(self, Self::Availability(_))
    }

    /// Run pending background tasks (for testing)
    ///
    /// Ensures all async maintenance tasks complete for deterministic testing.
    pub async fn sync(&self) {
        match self {
            Self::Availability(_) | Self::Hybrid(_) => {}
            Self::Memory(cache) => cache.sync().await,
        }
    }

    /// Close the cache and flush all pending writes
    ///
    /// For hybrid cache, this ensures all enqueued disk writes complete before returning.
    /// For memory cache, this is a no-op (no persistent state).
    pub async fn close(&self) -> anyhow::Result<()> {
        match self {
            Self::Availability(_) => Ok(()),
            Self::Memory(_) => Ok(()), // No persistent state
            Self::Hybrid(cache) => cache.close().await,
        }
    }
}

impl CacheStatsProvider for UnifiedCache {
    fn display_stats(&self) -> CacheDisplayStats {
        match self {
            Self::Availability(index) => index.display_stats(),
            Self::Memory(cache) => cache.display_stats(),
            Self::Hybrid(cache) => cache.display_stats(),
        }
    }
}