load_balancer/

window.rs

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,
};

/// A single entry in the `Window` load balancer.
///
/// Tracks the maximum number of allowed allocations within the interval
/// and the current allocation count.
pub struct Entry<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// Maximum number of allocations allowed for this entry in the interval.
    pub max_count: u64,
    /// Current allocation count within the interval.
    pub count: AtomicU64,
    /// The underlying value/resource of type `T`.
    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(),
        }
    }
}

/// Internal state for `Window`.
///
/// Holds the entries and the interval timer.
pub struct Inner<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// The entries managed by this load balancer.
    pub entries: RwLock<Vec<Entry<T>>>,
    /// Timer task handle for resetting counts periodically.
    pub timer: Mutex<Option<JoinHandle<()>>>,
    /// The interval at which counts are reset.
    pub interval: RwLock<Duration>,
    /// The next scheduled reset time.
    pub next_reset: RwLock<Instant>,
}

/// A load balancer that limits the number of allocations per entry
/// over a specified time interval.
///
/// This implementation supports both async and sync allocation.
#[derive(Clone)]
pub struct Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// Shared reference to the internal state.
    inner: Arc<Inner<T>>,
}

impl<T> Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// Create a new `Window` with the default interval of 1 second.
    ///
    /// # Arguments
    ///
    /// * `entries` - A vector of tuples `(max_count, value)`.
    pub fn new(entries: Vec<(u64, T)>) -> Self {
        Self::new_interval(entries, Duration::from_secs(1))
    }

    /// Create a new `Window` with a custom interval duration.
    ///
    /// # Arguments
    ///
    /// * `entries` - A vector of tuples `(max_count, value)`.
    /// * `interval` - Duration after which allocation counts are reset.
    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),
            }),
        }
    }

    /// Update the load balancer using an async callback.
    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;
            }
        }))
    }

    /// Asynchronously allocate an entry, skipping the specified index.
    /// Loops until a valid entry is found.
    pub async fn alloc_skip(&self, index: usize) -> (usize, T) {
        loop {
            if let Some(v) = self.try_alloc_skip(index) {
                return v;
            }

            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;
            }
        }
    }

    /// Try to allocate an entry without awaiting.
    /// Returns `None` immediately if no entry is available.
    pub fn try_alloc_skip(&self, index: usize) -> 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, n) in entries.iter().enumerate() {
                if i == index {
                    continue;
                }

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

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

        None
    }
}

impl<T> LoadBalancer<T> for Window<T>
where
    T: Send + Sync + Clone + 'static,
{
    /// Asynchronously allocate a resource from the load balancer.
    fn alloc(&self) -> impl Future<Output = T> + Send {
        async move { self.alloc_skip(usize::MAX).await.1 }
    }

    /// Synchronously try to allocate a resource.
    fn try_alloc(&self) -> Option<T> {
        self.try_alloc_skip(usize::MAX).map(|v| v.1)
    }
}