1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169

// Copyright 2015-2020 Parity Technologies (UK) Ltd.
// This file is part of OpenEthereum.

// OpenEthereum is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// OpenEthereum is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with OpenEthereum.  If not, see <http://www.gnu.org/licenses/>.

use std::{
    ops::{Deref, DerefMut},
    sync::atomic::{AtomicUsize, Ordering},
};

use parking_lot::{RwLock, RwLockReadGuard, RwLockWriteGuard};

use Len;

/// Can be used in place of a [`RwLock`](../../lock_api/struct.RwLock.html) where
/// reading `T`'s `len()` without needing to lock, is advantageous.
/// When the WriteGuard is released, `T`'s `len()` will be cached.
#[derive(Debug)]
pub struct LenCachingRwLock<T: ?Sized> {
    len: AtomicUsize,
    data: RwLock<T>,
}

impl<T: Len + Default> Default for LenCachingRwLock<T> {
    fn default() -> Self {
        LenCachingRwLock::new(T::default())
    }
}

impl<T: Len> From<T> for LenCachingRwLock<T> {
    fn from(data: T) -> Self {
        LenCachingRwLock::new(data)
    }
}

impl<T: Len> LenCachingRwLock<T> {
    /// Constructs a new LenCachingRwLock
    pub fn new(data: T) -> Self {
        LenCachingRwLock {
            len: AtomicUsize::new(data.len()),
            data: RwLock::new(data),
        }
    }
}

impl<T: Len + ?Sized> LenCachingRwLock<T> {
    /// Load the cached value that was returned from your `T`'s `len()`
    /// subsequent to the most recent lock being released.
    pub fn load_len(&self) -> usize {
        self.len.load(Ordering::SeqCst)
    }

    /// Delegates to `parking_lot::RwLock`
    /// [`write()`](../../lock_api/struct.RwLock.html#method.write).
    pub fn write(&self) -> CachingRwLockWriteGuard<T> {
        CachingRwLockWriteGuard {
            write_guard: self.data.write(),
            len: &self.len,
        }
    }

    /// Delegates to `parking_lot::RwLock`
    /// [`try_write()`](../../lock_api/struct.RwLock.html#method.try_write).
    pub fn try_write(&self) -> Option<CachingRwLockWriteGuard<T>> {
        Some(CachingRwLockWriteGuard {
            write_guard: self.data.try_write()?,
            len: &self.len,
        })
    }

    /// Delegates to `parking_lot::RwLock`
    /// [`read()`](../../lock_api/struct.RwLock.html#method.read).
    pub fn read(&self) -> RwLockReadGuard<T> {
        self.data.read()
    }

    /// Delegates to `parking_lot::RwLock`
    /// [`try_read()`](../../lock_api/struct.RwLock.html#method.try_read).
    pub fn try_read(&self) -> Option<RwLockReadGuard<T>> {
        self.data.try_read()
    }
}

/// Guard that caches `T`'s `len()` in an `AtomicUsize` when dropped
pub struct CachingRwLockWriteGuard<'a, T: Len + 'a + ?Sized> {
    write_guard: RwLockWriteGuard<'a, T>,
    len: &'a AtomicUsize,
}

impl<'a, T: Len + ?Sized> CachingRwLockWriteGuard<'a, T> {
    /// Returns a mutable reference to the contained
    /// [`RwLockWriteGuard`](../../parking_lot/rwlock/type.RwLockWriteGuard.html)
    pub fn inner_mut(&mut self) -> &mut RwLockWriteGuard<'a, T> {
        &mut self.write_guard
    }

    /// Returns a non-mutable reference to the contained
    /// [`RwLockWriteGuard`](../../parking_lot/rwlock/type.RwLockWriteGuard.html)
    pub fn inner(&self) -> &RwLockWriteGuard<'a, T> {
        &self.write_guard
    }
}

impl<'a, T: Len + ?Sized> Drop for CachingRwLockWriteGuard<'a, T> {
    fn drop(&mut self) {
        self.len.store(self.write_guard.len(), Ordering::SeqCst);
    }
}

impl<'a, T: Len + ?Sized> Deref for CachingRwLockWriteGuard<'a, T> {
    type Target = T;
    fn deref(&self) -> &T {
        self.write_guard.deref()
    }
}

impl<'a, T: Len + ?Sized> DerefMut for CachingRwLockWriteGuard<'a, T> {
    fn deref_mut(&mut self) -> &mut T {
        self.write_guard.deref_mut()
    }
}

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

    #[test]
    fn caches_len() {
        let v = vec![1, 2, 3];
        let lcl = LenCachingRwLock::new(v);
        assert_eq!(lcl.load_len(), 3);
        lcl.write().push(4);
        assert_eq!(lcl.load_len(), 4);
    }

    #[test]
    fn works_with_vec() {
        let v: Vec<i32> = Vec::new();
        let lcl = LenCachingRwLock::new(v);
        assert!(lcl.write().is_empty());
    }

    #[test]
    fn works_with_vecdeque() {
        let v: VecDeque<i32> = VecDeque::new();
        let lcl = LenCachingRwLock::new(v);
        lcl.write().push_front(4);
        assert_eq!(lcl.load_len(), 1);
    }

    #[test]
    fn read_works() {
        let v = vec![1, 2, 3];
        let lcl = LenCachingRwLock::new(v);
        assert_eq!(lcl.read().len(), 3);
    }
}