load_balancer/

window.rs

use crate::FilteredLoadBalancer;
use crate::LoadBalancer;
use std::sync::atomic::Ordering::{Acquire, Release};
use std::{
    future::Future,
    sync::{Arc, atomic::AtomicU64},
    time::{Duration, Instant},
};
use tokio::{
    spawn,
    sync::{Mutex, RwLock},
    task::{JoinHandle, yield_now},
    time::sleep,
};

/// Per-entry state for the sliding-window limiter (`max_count == 0` means unlimited).
pub struct Entry<T>
where
    T: Send + Sync + Clone + 'static,
{
    pub max_count: u64,
    pub count: AtomicU64,
    pub value: T,
}

impl<T> Clone for Entry<T>
where
    T: Send + Sync + Clone + 'static,
{
    fn clone(&self) -> Self {
        Self {
            max_count: self.max_count.clone(),
            count: self.count.load(Acquire).into(),
            value: self.value.clone(),
        }
    }
}

pub struct Inner<T>
where
    T: Send + Sync + Clone + 'static,
{
    pub entries: RwLock<Vec<Entry<T>>>,
    pub timer: Mutex<Option<JoinHandle<()>>>,
    pub interval: RwLock<Duration>,
    pub next_reset: RwLock<Instant>,
}

/// Sliding-window load balancer: each entry has a per-interval allocation cap.
///
/// Counts reset every `interval` (default 1 second); entries with `max_count == 0`
/// are unlimited.
#[derive(Clone)]
pub struct Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    inner: Arc<Inner<T>>,
}

impl<T> Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// Create a `Window` with a 1-second reset interval.
    ///
    /// Each tuple is `(max_count, value)` — `max_count == 0` means unlimited.
    pub fn new(entries: Vec<(u64, T)>) -> Self {
        Self::new_interval(entries, Duration::from_secs(1))
    }

    /// Create a `Window` with a custom reset `interval`.
    pub fn new_interval(entries: Vec<(u64, T)>, interval: Duration) -> Self {
        Self {
            inner: Arc::new(Inner {
                entries: entries
                    .into_iter()
                    .map(|(max_count, value)| Entry {
                        max_count,
                        value,
                        count: 0.into(),
                    })
                    .collect::<Vec<_>>()
                    .into(),
                timer: Mutex::new(None),
                interval: interval.into(),
                next_reset: RwLock::new(Instant::now() + interval),
            }),
        }
    }

    /// Run an async callback with access to the internal state.
    pub async fn update<F, R, N>(&self, handler: F) -> anyhow::Result<N>
    where
        F: Fn(Arc<Inner<T>>) -> R,
        R: Future<Output = anyhow::Result<N>>,
    {
        handler(self.inner.clone()).await
    }

    /// Spawn a background task that calls `handler` every `interval`.
    ///
    /// The handler is called once immediately; if that initial call fails
    /// the error is returned and no background task is spawned.
    /// Returns a [`JoinHandle`] that can be aborted to stop the timer.
    pub async fn update_timer<F, R>(
        &self,
        handler: F,
        interval: Duration,
    ) -> anyhow::Result<JoinHandle<()>>
    where
        F: Fn(Arc<Inner<T>>) -> R + Send + Sync + 'static,
        R: Future<Output = anyhow::Result<()>> + Send,
    {
        handler(self.inner.clone()).await?;

        let inner = self.inner.clone();

        Ok(spawn(async move {
            loop {
                sleep(interval).await;
                let _ = handler(inner.clone()).await;
            }
        }))
    }
}

impl<T> FilteredLoadBalancer<T> for Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    async fn alloc_filter(
        &self,
        mut predicate: impl FnMut((usize, &T)) -> bool + Send,
    ) -> (usize, T) {
        loop {
            if let Some(result) = self.try_alloc_filter(&mut predicate) {
                return result;
            }

            let now = Instant::now();

            let next = *self.inner.next_reset.read().await;

            let remaining = if now < next {
                next - now
            } else {
                Duration::ZERO
            };

            if remaining > Duration::ZERO {
                sleep(remaining).await;
            } else {
                yield_now().await;
            }
        }
    }

    fn try_alloc_filter(
        &self,
        mut predicate: impl FnMut((usize, &T)) -> bool,
    ) -> Option<(usize, T)> {
        if let Ok(mut timer_guard) = self.inner.timer.try_lock() {
            if timer_guard.is_none() {
                let this = self.inner.clone();

                *timer_guard = Some(spawn(async move {
                    let mut interval = *this.interval.read().await;

                    *this.next_reset.write().await = Instant::now() + interval;

                    loop {
                        sleep(match this.interval.try_read() {
                            Ok(v) => {
                                interval = *v;
                                interval
                            }
                            Err(_) => interval,
                        })
                        .await;

                        let now = Instant::now();

                        let entries = this.entries.read().await;

                        for entry in entries.iter() {
                            entry.count.store(0, Release);
                        }

                        *this.next_reset.write().await = now + interval;
                    }
                }));
            }
        }

        if let Ok(entries) = self.inner.entries.try_read() {
            for (i, entry) in entries.iter().enumerate() {
                if !predicate((i, &entry.value)) {
                    continue;
                }

                let count = entry.count.load(Acquire);

                if entry.max_count == 0
                    || count < entry.max_count
                        && entry
                            .count
                            .compare_exchange(count, count + 1, Release, Acquire)
                            .is_ok()
                {
                    return Some((i, entry.value.clone()));
                }
            }
        }

        None
    }
}

impl<T> LoadBalancer<T> for Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    fn alloc(&self) -> impl Future<Output = T> + Send {
        async move { self.alloc_filter(|_| true).await.1 }
    }

    fn try_alloc(&self) -> Option<T> {
        self.try_alloc_filter(|_| true).map(|v| v.1)
    }
}