atuin-common 18.22.0

use std::hash::{DefaultHasher, Hash, Hasher};
use std::marker::PhantomData;
use std::num::NonZeroUsize;

/// A fixed number of locks of type `M`, selected by hashing a `K`.
///
/// Reach it through [`AsyncShardedMutex`] (tokio) or [`ShardedMutex`] (parking_lot).
#[derive(Debug)]
pub struct Sharded<K, M> {
    shards: Box<[M]>,
    key: PhantomData<fn() -> K>,
}

impl<K: Hash, M: Default> Sharded<K, M> {
    /// `shards` locks, each starting at `M::default()`.
    #[must_use]
    pub fn new(shards: NonZeroUsize) -> Self {
        Self {
            shards: (0..shards.get()).map(|_| M::default()).collect(),
            key: PhantomData,
        }
    }
}

impl<K: Hash, M> Sharded<K, M> {
    /// The lock `key` hashes to.
    #[must_use]
    pub fn shard(&self, key: &K) -> &M {
        &self.shards[self.shard_of(key)]
    }

    /// How many shards there are.
    #[must_use]
    pub fn shards(&self) -> usize {
        self.shards.len()
    }

    fn shard_of(&self, key: &K) -> usize {
        let mut hasher = DefaultHasher::new();
        key.hash(&mut hasher);
        let count = u64::try_from(self.shards.len()).expect("a shard count fits in u64");
        usize::try_from(hasher.finish() % count).expect("a shard index is below the count")
    }
}

impl<K: Hash, V> Sharded<K, tokio::sync::Mutex<V>> {
    /// Lock the shard `key` hashes to, waiting while another task holds it. The guard may be held
    /// across `.await`s.
    pub async fn lock(&self, key: &K) -> tokio::sync::MutexGuard<'_, V> {
        self.shard(key).lock().await
    }
}

impl<K: Hash, V> Sharded<K, parking_lot::Mutex<V>> {
    /// Lock the shard `key` hashes to, blocking the thread while another holds it. Never hold the
    /// guard across an `.await`.
    pub fn lock(&self, key: &K) -> parking_lot::MutexGuard<'_, V> {
        self.shard(key).lock()
    }
}

/// `Sharded` over [`tokio::sync::Mutex`] used purely as a lock (it guards `()`, carrying no
/// value): `lock` is `async`, and its guard may be held across `.await`s.
pub type AsyncShardedMutex<K> = Sharded<K, tokio::sync::Mutex<()>>;

/// `Sharded` over [`parking_lot::Mutex`] used purely as a lock (it guards `()`, carrying no
/// value): `lock` blocks the calling thread, so never hold its guard across an `.await`.
pub type ShardedMutex<K> = Sharded<K, parking_lot::Mutex<()>>;

#[cfg(test)]
mod tests {
    use std::num::NonZeroUsize;
    use std::sync::Arc;
    use std::time::Duration;

    use rstest::rstest;

    use super::{AsyncShardedMutex, Sharded, ShardedMutex};

    fn shards(n: usize) -> NonZeroUsize {
        NonZeroUsize::new(n).expect("test shard counts are non-zero")
    }

    #[rstest]
    #[tokio::test]
    async fn the_same_key_waits_for_its_holder() {
        let mutex: Arc<AsyncShardedMutex<&str>> = Arc::new(AsyncShardedMutex::new(shards(16)));
        let held = mutex.lock(&"key").await;

        let contender = Arc::clone(&mutex);
        let waiter = tokio::spawn(async move {
            let _ = contender.lock(&"key").await;
        });
        // While the guard is held, the second lock of the same key cannot complete.
        assert!(
            tokio::time::timeout(Duration::from_millis(50), waiter_ready(&waiter)).await.is_err()
        );

        drop(held);
        waiter.await.expect("the waiter acquires the shard once it is released");
    }

    /// Resolves once `handle`'s task has finished; used to observe "still blocked".
    async fn waiter_ready(handle: &tokio::task::JoinHandle<()>) {
        while !handle.is_finished() {
            tokio::time::sleep(Duration::from_millis(1)).await;
        }
    }

    // The public aliases guard `()`, but `Sharded` itself still carries a value per shard; these
    // exercise that generality directly.
    #[rstest]
    #[tokio::test]
    async fn the_value_belongs_to_the_shard() {
        // One shard: every key shares it, and therefore shares its value.
        let mutex: Sharded<u32, tokio::sync::Mutex<u32>> = Sharded::new(shards(1));
        *mutex.lock(&1).await += 1;
        *mutex.lock(&2).await += 1;
        assert_eq!(*mutex.lock(&3).await, 2);
    }

    #[rstest]
    #[tokio::test]
    async fn the_guard_hands_out_the_stored_value() {
        let mutex: Sharded<String, tokio::sync::Mutex<Vec<u8>>> = Sharded::new(shards(8));
        mutex.lock(&"a".to_string()).await.push(7);
        assert_eq!(*mutex.lock(&"a".to_string()).await, vec![7]);
    }

    #[rstest]
    fn keys_spread_across_shards() {
        let mutex: AsyncShardedMutex<u64> = AsyncShardedMutex::new(shards(64));
        let used: std::collections::HashSet<usize> =
            (0..256u64).map(|k| mutex.shard_of(&k)).collect();
        assert_eq!(mutex.shards(), 64);
        assert!(
            used.len() >= 32,
            "256 keys should land in at least half of 64 shards, got {}",
            used.len()
        );
    }

    #[rstest]
    #[tokio::test]
    async fn colliding_keys_serialise() {
        // One shard: two different keys collide, so the second waits for the first.
        let mutex: Arc<AsyncShardedMutex<u32>> = Arc::new(AsyncShardedMutex::new(shards(1)));
        let held = mutex.lock(&1).await;

        let contender = Arc::clone(&mutex);
        let waiter = tokio::spawn(async move {
            let _ = contender.lock(&2).await;
        });
        assert!(
            tokio::time::timeout(Duration::from_millis(50), waiter_ready(&waiter)).await.is_err()
        );

        drop(held);
        waiter.await.expect("the waiter acquires the shard once it is released");
    }

    #[rstest]
    #[tokio::test]
    async fn keys_on_different_shards_lock_independently() {
        let mutex: AsyncShardedMutex<u64> = AsyncShardedMutex::new(shards(64));
        let first = 0u64;
        let other = (1..=1024u64)
            .find(|k| mutex.shard_of(k) != mutex.shard_of(&first))
            .expect("one of 1024 keys lands on another of 64 shards");
        let _held = mutex.lock(&first).await;

        // Not one big lock: a key on another shard is acquired immediately.
        assert!(tokio::time::timeout(Duration::from_millis(50), mutex.lock(&other)).await.is_ok());
    }

    #[rstest]
    fn the_blocking_flavour_locks_the_same_shard_for_the_same_key() {
        // `Sharded` directly so the guard still carries a value, exercising the parking_lot path.
        let mutex: Sharded<&str, parking_lot::Mutex<u32>> = Sharded::new(shards(16));
        let mut held = mutex.lock(&"key");
        *held += 1;
        // The shard is taken: a second acquisition of the same key cannot succeed right now.
        assert!(mutex.shard(&"key").try_lock().is_none());
        drop(held);
        assert_eq!(*mutex.lock(&"key"), 1);
    }

    #[rstest]
    fn both_flavours_are_send_and_sync_regardless_of_the_key() {
        fn assert_send_sync<T: Send + Sync>() {}
        // `Rc` is neither; the key marker must not drag the key's auto traits into the mutex.
        assert_send_sync::<AsyncShardedMutex<std::rc::Rc<u8>>>();
        assert_send_sync::<ShardedMutex<std::rc::Rc<u8>>>();
    }
}