      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
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    305
    306
    307
    308
    309
    310
    311
    312
    313
    314
    315
    316
    317
    318
    319
    320
    321
    322
    323
    324
    325
    326
    327
    328
    329
    330
    331
    332
    333
    334
    335
    336
    337
    338
    339
    340
    341
    342
    343
    344
    345
    346
    347
    348
    349
    350
    351
    352
    353
    354
    355
    356
    357
    358
    359
    360
    361
    362
    363
    364
    365
    366
    367
    368
    369
    370
    371
    372
    373
    374
    375
    376
    377
    378
    379
    380
    381
    382
    383
    384
    385
    386
    387
    388
    389
    390
    391
    392
    393
    394
    395
    396
    397
    398
    399
    400
    401
    402
    403
    404
    405
    406
    407
    408
    409
    410
    411
    412
    413
    414
    415
    416
    417
    418
    419
    420
    421
    422
    423
    424
    425
    426
    427
    428
    429
    430
    431
    432
    433
    434
    435
    436
    437
    438
    439
    440
    441
    442
    443
    444
    445
    446
    447
    448
    449
    450
    451
    452
    453
    454
    455
    456
    457
    458
    459
    460
    461
    462
    463
    464
    465
    466
    467
    468
    469
    470
    471
    472
    473
    474
    475
    476
    477
    478
    479
    480
    481
    482
    483
    484
    485
    486
    487
    488
    489
    490
    491
    492
    493
    494
    495
    496
    497
    498
    499
    500
    501
    502
    503
    504
    505
    506
    507
    508
    509
    510
    511
    512
    513
    514
    515
    516
    517
    518
    519
    520
    521
    522
    523
    524
    525
    526
    527
    528
    529
    530
    531
    532
    533
    534
    535
    536
    537
    538
    539
    540
    541
    542
    543
    544
    545
    546
    547
    548
    549
    550
    551
    552
    553
    554
    555
    556
    557
    558
    559
    560
    561
    562
    563
    564
    565
    566
    567
    568
    569
    570
    571
    572
    573
    574
    575
    576
    577
    578
    579
    580
    581
    582
    583
    584
    585
    586
    587
    588
    589
    590
    591
    592
    593
    594
    595
    596
    597
    598
    599
    600
    601
    602
    603
    604
    605
    606
    607
    608
    609
    610
    611
    612
    613
    614
    615
    616
    617
    618

    // Copyright 2018 Amanieu d'Antras
    //
    // Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
    // http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
    // http://opensource.org/licenses/MIT>, at your option. This file may not be
    // copied, modified, or distributed except according to those terms.

    use core::cell::{Cell, UnsafeCell};
    use core::fmt;
    use core::marker::PhantomData;
    use core::mem;
    use core::ops::Deref;
    use core::sync::atomic::{AtomicUsize, Ordering};
    use mutex::{RawMutex, RawMutexFair, RawMutexTimed};
    use GuardNoSend;

    #[cfg(feature = "owning_ref")]
    use owning_ref::StableAddress;

    /// Helper trait which returns a non-zero thread ID.
    ///
    /// The simplest way to implement this trait is to return the address of a
    /// thread-local variable.
    ///
    /// # Safety
    ///
    /// Implementations of this trait must ensure that no two active threads share
    /// the same thread ID. However the ID of a thread that has exited can be
    /// re-used since that thread is no longer active.
    pub unsafe trait GetThreadId {
        /// Initial value.
        const INIT: Self;

        /// Returns a non-zero thread ID which identifies the current thread of
        /// execution.
        fn nonzero_thread_id(&self) -> usize;
    }

    struct RawReentrantMutex<R: RawMutex, G: GetThreadId> {
        owner: AtomicUsize,
        lock_count: Cell<usize>,
        mutex: R,
        get_thread_id: G,
    }

    impl<R: RawMutex, G: GetThreadId> RawReentrantMutex<R, G> {
        #[inline]
        fn lock_internal<F: FnOnce() -> bool>(&self, try_lock: F) -> bool {
            let id = self.get_thread_id.nonzero_thread_id();
            if self.owner.load(Ordering::Relaxed) == id {
                self.lock_count.set(
                    self.lock_count
                        .get()
                        .checked_add(1)
                        .expect("ReentrantMutex lock count overflow"),
                );
            } else {
                if !try_lock() {
                    return false;
                }
                self.owner.store(id, Ordering::Relaxed);
                self.lock_count.set(1);
            }
            true
        }

        #[inline]
        fn lock(&self) {
            self.lock_internal(|| {
                self.mutex.lock();
                true
            });
        }

        #[inline]
        fn try_lock(&self) -> bool {
            self.lock_internal(|| self.mutex.try_lock())
        }

        #[inline]
        fn unlock(&self) {
            let lock_count = self.lock_count.get() - 1;
            if lock_count == 0 {
                self.owner.store(0, Ordering::Relaxed);
                self.mutex.unlock();
            } else {
                self.lock_count.set(lock_count);
            }
        }
    }

    impl<R: RawMutexFair, G: GetThreadId> RawReentrantMutex<R, G> {
        #[inline]
        fn unlock_fair(&self) {
            let lock_count = self.lock_count.get() - 1;
            if lock_count == 0 {
                self.owner.store(0, Ordering::Relaxed);
                self.mutex.unlock_fair();
            } else {
                self.lock_count.set(lock_count);
            }
        }

        #[inline]
        fn bump(&self) {
            if self.lock_count.get() == 1 {
                let id = self.owner.load(Ordering::Relaxed);
                self.owner.store(0, Ordering::Relaxed);
                self.mutex.bump();
                self.owner.store(id, Ordering::Relaxed);
            }
        }
    }

    impl<R: RawMutexTimed, G: GetThreadId> RawReentrantMutex<R, G> {
        #[inline]
        fn try_lock_until(&self, timeout: R::Instant) -> bool {
            self.lock_internal(|| self.mutex.try_lock_until(timeout))
        }

        #[inline]
        fn try_lock_for(&self, timeout: R::Duration) -> bool {
            self.lock_internal(|| self.mutex.try_lock_for(timeout))
        }
    }

    /// A mutex which can be recursively locked by a single thread.
    ///
    /// This type is identical to `Mutex` except for the following points:
    ///
    /// - Locking multiple times from the same thread will work correctly instead of
    ///   deadlocking.
    /// - `ReentrantMutexGuard` does not give mutable references to the locked data.
    ///   Use a `RefCell` if you need this.
    ///
    /// See [`Mutex`](struct.Mutex.html) for more details about the underlying mutex
    /// primitive.
    pub struct ReentrantMutex<R: RawMutex, G: GetThreadId, T: ?Sized> {
        raw: RawReentrantMutex<R, G>,
        data: UnsafeCell<T>,
    }

    unsafe impl<R: RawMutex + Send, G: GetThreadId + Send, T: ?Sized + Send> Send
        for ReentrantMutex<R, G, T>
    {}
    unsafe impl<R: RawMutex + Sync, G: GetThreadId + Sync, T: ?Sized + Send> Sync
        for ReentrantMutex<R, G, T>
    {}

    impl<R: RawMutex, G: GetThreadId, T> ReentrantMutex<R, G, T> {
        /// Creates a new reentrant mutex in an unlocked state ready for use.
        #[cfg(feature = "nightly")]
        #[inline]
        pub const fn new(val: T) -> ReentrantMutex<R, G, T> {
            ReentrantMutex {
                data: UnsafeCell::new(val),
                raw: RawReentrantMutex {
                    owner: AtomicUsize::new(0),
                    lock_count: Cell::new(0),
                    mutex: R::INIT,
                    get_thread_id: G::INIT,
                },
            }
        }

        /// Creates a new reentrant mutex in an unlocked state ready for use.
        #[cfg(not(feature = "nightly"))]
        #[inline]
        pub fn new(val: T) -> ReentrantMutex<R, G, T> {
            ReentrantMutex {
                data: UnsafeCell::new(val),
                raw: RawReentrantMutex {
                    owner: AtomicUsize::new(0),
                    lock_count: Cell::new(0),
                    mutex: R::INIT,
                    get_thread_id: G::INIT,
                },
            }
        }

        /// Consumes this mutex, returning the underlying data.
        #[inline]
        #[allow(unused_unsafe)]
        pub fn into_inner(self) -> T {
            unsafe { self.data.into_inner() }
        }
    }

    impl<R: RawMutex, G: GetThreadId, T: ?Sized> ReentrantMutex<R, G, T> {
        #[inline]
        fn guard(&self) -> ReentrantMutexGuard<R, G, T> {
            ReentrantMutexGuard {
                remutex: &self,
                marker: PhantomData,
            }
        }

        /// Acquires a reentrant mutex, blocking the current thread until it is able
        /// to do so.
        ///
        /// If the mutex is held by another thread then this function will block the
        /// local thread until it is available to acquire the mutex. If the mutex is
        /// already held by the current thread then this function will increment the
        /// lock reference count and return immediately. Upon returning,
        /// the thread is the only thread with the mutex held. An RAII guard is
        /// returned to allow scoped unlock of the lock. When the guard goes out of
        /// scope, the mutex will be unlocked.
        #[inline]
        pub fn lock(&self) -> ReentrantMutexGuard<R, G, T> {
            self.raw.lock();
            self.guard()
        }

        /// Attempts to acquire this lock.
        ///
        /// If the lock could not be acquired at this time, then `None` is returned.
        /// Otherwise, an RAII guard is returned. The lock will be unlocked when the
        /// guard is dropped.
        ///
        /// This function does not block.
        #[inline]
        pub fn try_lock(&self) -> Option<ReentrantMutexGuard<R, G, T>> {
            if self.raw.try_lock() {
                Some(self.guard())
            } else {
                None
            }
        }

        /// Returns a mutable reference to the underlying data.
        ///
        /// Since this call borrows the `ReentrantMutex` mutably, no actual locking needs to
        /// take place---the mutable borrow statically guarantees no locks exist.
        #[inline]
        pub fn get_mut(&mut self) -> &mut T {
            unsafe { &mut *self.data.get() }
        }

        /// Forcibly unlocks the mutex.
        ///
        /// This is useful when combined with `mem::forget` to hold a lock without
        /// the need to maintain a `ReentrantMutexGuard` object alive, for example when
        /// dealing with FFI.
        ///
        /// # Safety
        ///
        /// This method must only be called if the current thread logically owns a
        /// `ReentrantMutexGuard` but that guard has be discarded using `mem::forget`.
        /// Behavior is undefined if a mutex is unlocked when not locked.
        #[inline]
        pub unsafe fn force_unlock(&self) {
            self.raw.unlock();
        }

        /// Returns the underlying raw mutex object.
        ///
        /// Note that you will most likely need to import the `RawMutex` trait from
        /// `lock_api` to be able to call functions on the raw mutex.
        ///
        /// # Safety
        ///
        /// This method is unsafe because it allows unlocking a mutex while
        /// still holding a reference to a `ReentrantMutexGuard`.
        #[inline]
        pub unsafe fn raw(&self) -> &R {
            &self.raw.mutex
        }
    }

    impl<R: RawMutexFair, G: GetThreadId, T: ?Sized> ReentrantMutex<R, G, T> {
        /// Forcibly unlocks the mutex using a fair unlock protocol.
        ///
        /// This is useful when combined with `mem::forget` to hold a lock without
        /// the need to maintain a `ReentrantMutexGuard` object alive, for example when
        /// dealing with FFI.
        ///
        /// # Safety
        ///
        /// This method must only be called if the current thread logically owns a
        /// `ReentrantMutexGuard` but that guard has be discarded using `mem::forget`.
        /// Behavior is undefined if a mutex is unlocked when not locked.
        #[inline]
        pub unsafe fn force_unlock_fair(&self) {
            self.raw.unlock_fair();
        }
    }

    impl<R: RawMutexTimed, G: GetThreadId, T: ?Sized> ReentrantMutex<R, G, T> {
        /// Attempts to acquire this lock until a timeout is reached.
        ///
        /// If the lock could not be acquired before the timeout expired, then
        /// `None` is returned. Otherwise, an RAII guard is returned. The lock will
        /// be unlocked when the guard is dropped.
        #[inline]
        pub fn try_lock_for(&self, timeout: R::Duration) -> Option<ReentrantMutexGuard<R, G, T>> {
            if self.raw.try_lock_for(timeout) {
                Some(self.guard())
            } else {
                None
            }
        }

        /// Attempts to acquire this lock until a timeout is reached.
        ///
        /// If the lock could not be acquired before the timeout expired, then
        /// `None` is returned. Otherwise, an RAII guard is returned. The lock will
        /// be unlocked when the guard is dropped.
        #[inline]
        pub fn try_lock_until(&self, timeout: R::Instant) -> Option<ReentrantMutexGuard<R, G, T>> {
            if self.raw.try_lock_until(timeout) {
                Some(self.guard())
            } else {
                None
            }
        }
    }

    impl<R: RawMutex, G: GetThreadId, T: ?Sized + Default> Default for ReentrantMutex<R, G, T> {
        #[inline]
        fn default() -> ReentrantMutex<R, G, T> {
            ReentrantMutex::new(Default::default())
        }
    }

    impl<R: RawMutex, G: GetThreadId, T> From<T> for ReentrantMutex<R, G, T> {
        #[inline]
        fn from(t: T) -> ReentrantMutex<R, G, T> {
            ReentrantMutex::new(t)
        }
    }

    impl<R: RawMutex, G: GetThreadId, T: ?Sized + fmt::Debug> fmt::Debug for ReentrantMutex<R, G, T> {
        fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
            match self.try_lock() {
                Some(guard) => f
                    .debug_struct("ReentrantMutex")
                    .field("data", &&*guard)
                    .finish(),
                None => f.pad("ReentrantMutex { <locked> }"),
            }
        }
    }

    /// An RAII implementation of a "scoped lock" of a reentrant mutex. When this structure
    /// is dropped (falls out of scope), the lock will be unlocked.
    ///
    /// The data protected by the mutex can be accessed through this guard via its
    /// `Deref` implementation.
    #[must_use]
    pub struct ReentrantMutexGuard<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> {
        remutex: &'a ReentrantMutex<R, G, T>,
        marker: PhantomData<(&'a T, GuardNoSend)>,
    }

    unsafe impl<'a, R: RawMutex + Sync + 'a, G: GetThreadId + Sync + 'a, T: ?Sized + Sync + 'a> Sync
        for ReentrantMutexGuard<'a, R, G, T>
    {}

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> ReentrantMutexGuard<'a, R, G, T> {
        /// Returns a reference to the original `ReentrantMutex` object.
        pub fn remutex(s: &Self) -> &'a ReentrantMutex<R, G, T> {
            s.remutex
        }

        /// Makes a new `MappedReentrantMutexGuard` for a component of the locked data.
        ///
        /// This operation cannot fail as the `ReentrantMutexGuard` passed
        /// in already locked the mutex.
        ///
        /// This is an associated function that needs to be
        /// used as `ReentrantMutexGuard::map(...)`. A method would interfere with methods of
        /// the same name on the contents of the locked data.
        #[inline]
        pub fn map<U: ?Sized, F>(s: Self, f: F) -> MappedReentrantMutexGuard<'a, R, G, U>
        where
            F: FnOnce(&T) -> &U,
        {
            let raw = &s.remutex.raw;
            let data = f(unsafe { &*s.remutex.data.get() });
            mem::forget(s);
            MappedReentrantMutexGuard {
                raw,
                data,
                marker: PhantomData,
            }
        }

        /// Attempts to make  a new `MappedReentrantMutexGuard` for a component of the
        /// locked data. The original guard is return if the closure returns `None`.
        ///
        /// This operation cannot fail as the `ReentrantMutexGuard` passed
        /// in already locked the mutex.
        ///
        /// This is an associated function that needs to be
        /// used as `ReentrantMutexGuard::map(...)`. A method would interfere with methods of
        /// the same name on the contents of the locked data.
        #[inline]
        pub fn try_map<U: ?Sized, F>(s: Self, f: F) -> Result<MappedReentrantMutexGuard<'a, R, G, U>, Self>
        where
            F: FnOnce(&mut T) -> Option<&mut U>,
        {
            let raw = &s.remutex.raw;
            let data = match f(unsafe { &mut *s.remutex.data.get() }) {
                Some(data) => data,
                None => return Err(s),
            };
            mem::forget(s);
            Ok(MappedReentrantMutexGuard {
                raw,
                data,
                marker: PhantomData,
            })
        }

        /// Temporarily unlocks the mutex to execute the given function.
        ///
        /// This is safe because `&mut` guarantees that there exist no other
        /// references to the data protected by the mutex.
        #[inline]
        pub fn unlocked<F, U>(s: &mut Self, f: F) -> U
        where
            F: FnOnce() -> U,
        {
            s.remutex.raw.unlock();
            defer!(s.remutex.raw.lock());
            f()
        }
    }

    impl<'a, R: RawMutexFair + 'a, G: GetThreadId + 'a, T: ?Sized + 'a>
        ReentrantMutexGuard<'a, R, G, T>
    {
        /// Unlocks the mutex using a fair unlock protocol.
        ///
        /// By default, mutexes are unfair and allow the current thread to re-lock
        /// the mutex before another has the chance to acquire the lock, even if
        /// that thread has been blocked on the mutex for a long time. This is the
        /// default because it allows much higher throughput as it avoids forcing a
        /// context switch on every mutex unlock. This can result in one thread
        /// acquiring a mutex many more times than other threads.
        ///
        /// However in some cases it can be beneficial to ensure fairness by forcing
        /// the lock to pass on to a waiting thread if there is one. This is done by
        /// using this method instead of dropping the `ReentrantMutexGuard` normally.
        #[inline]
        pub fn unlock_fair(s: Self) {
            s.remutex.raw.unlock_fair();
            mem::forget(s);
        }

        /// Temporarily unlocks the mutex to execute the given function.
        ///
        /// The mutex is unlocked a fair unlock protocol.
        ///
        /// This is safe because `&mut` guarantees that there exist no other
        /// references to the data protected by the mutex.
        #[inline]
        pub fn unlocked_fair<F, U>(s: &mut Self, f: F) -> U
        where
            F: FnOnce() -> U,
        {
            s.remutex.raw.unlock_fair();
            defer!(s.remutex.raw.lock());
            f()
        }

        /// Temporarily yields the mutex to a waiting thread if there is one.
        ///
        /// This method is functionally equivalent to calling `unlock_fair` followed
        /// by `lock`, however it can be much more efficient in the case where there
        /// are no waiting threads.
        #[inline]
        pub fn bump(s: &mut Self) {
            s.remutex.raw.bump();
        }
    }

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> Deref
        for ReentrantMutexGuard<'a, R, G, T>
    {
        type Target = T;
        #[inline]
        fn deref(&self) -> &T {
            unsafe { &*self.remutex.data.get() }
        }
    }

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> Drop
        for ReentrantMutexGuard<'a, R, G, T>
    {
        #[inline]
        fn drop(&mut self) {
            self.remutex.raw.unlock();
        }
    }

    #[cfg(feature = "owning_ref")]
    unsafe impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> StableAddress
        for ReentrantMutexGuard<'a, R, G, T>
    {}

    /// An RAII mutex guard returned by `ReentrantMutexGuard::map`, which can point to a
    /// subfield of the protected data.
    ///
    /// The main difference between `MappedReentrantMutexGuard` and `ReentrantMutexGuard` is that the
    /// former doesn't support temporarily unlocking and re-locking, since that
    /// could introduce soundness issues if the locked object is modified by another
    /// thread.
    #[must_use]
    pub struct MappedReentrantMutexGuard<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> {
        raw: &'a RawReentrantMutex<R, G>,
        data: *const T,
        marker: PhantomData<&'a T>,
    }

    unsafe impl<'a, R: RawMutex + Sync + 'a, G: GetThreadId + Sync + 'a, T: ?Sized + Sync + 'a> Sync
        for MappedReentrantMutexGuard<'a, R, G, T>
    {}

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a>
        MappedReentrantMutexGuard<'a, R, G, T>
    {
        /// Makes a new `MappedReentrantMutexGuard` for a component of the locked data.
        ///
        /// This operation cannot fail as the `MappedReentrantMutexGuard` passed
        /// in already locked the mutex.
        ///
        /// This is an associated function that needs to be
        /// used as `MappedReentrantMutexGuard::map(...)`. A method would interfere with methods of
        /// the same name on the contents of the locked data.
        #[inline]
        pub fn map<U: ?Sized, F>(s: Self, f: F) -> MappedReentrantMutexGuard<'a, R, G, U>
        where
            F: FnOnce(&T) -> &U,
        {
            let raw = s.raw;
            let data = f(unsafe { &*s.data });
            mem::forget(s);
            MappedReentrantMutexGuard {
                raw,
                data,
                marker: PhantomData,
            }
        }

        /// Attempts to make  a new `MappedReentrantMutexGuard` for a component of the
        /// locked data. The original guard is return if the closure returns `None`.
        ///
        /// This operation cannot fail as the `MappedReentrantMutexGuard` passed
        /// in already locked the mutex.
        ///
        /// This is an associated function that needs to be
        /// used as `MappedReentrantMutexGuard::map(...)`. A method would interfere with methods of
        /// the same name on the contents of the locked data.
        #[inline]
        pub fn try_map<U: ?Sized, F>(s: Self, f: F) -> Result<MappedReentrantMutexGuard<'a, R, G, U>, Self>
        where
            F: FnOnce(&T) -> Option<&U>,
        {
            let raw = s.raw;
            let data = match f(unsafe { &*s.data }) {
                Some(data) => data,
                None => return Err(s),
            };
            mem::forget(s);
            Ok(MappedReentrantMutexGuard {
                raw,
                data,
                marker: PhantomData,
            })
        }
    }

    impl<'a, R: RawMutexFair + 'a, G: GetThreadId + 'a, T: ?Sized + 'a>
        MappedReentrantMutexGuard<'a, R, G, T>
    {
        /// Unlocks the mutex using a fair unlock protocol.
        ///
        /// By default, mutexes are unfair and allow the current thread to re-lock
        /// the mutex before another has the chance to acquire the lock, even if
        /// that thread has been blocked on the mutex for a long time. This is the
        /// default because it allows much higher throughput as it avoids forcing a
        /// context switch on every mutex unlock. This can result in one thread
        /// acquiring a mutex many more times than other threads.
        ///
        /// However in some cases it can be beneficial to ensure fairness by forcing
        /// the lock to pass on to a waiting thread if there is one. This is done by
        /// using this method instead of dropping the `ReentrantMutexGuard` normally.
        #[inline]
        pub fn unlock_fair(s: Self) {
            s.raw.unlock_fair();
            mem::forget(s);
        }
    }

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> Deref
        for MappedReentrantMutexGuard<'a, R, G, T>
    {
        type Target = T;
        #[inline]
        fn deref(&self) -> &T {
            unsafe { &*self.data }
        }
    }

    impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> Drop
        for MappedReentrantMutexGuard<'a, R, G, T>
    {
        #[inline]
        fn drop(&mut self) {
            self.raw.unlock();
        }
    }

    #[cfg(feature = "owning_ref")]
    unsafe impl<'a, R: RawMutex + 'a, G: GetThreadId + 'a, T: ?Sized + 'a> StableAddress
        for MappedReentrantMutexGuard<'a, R, G, T>
    {}

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g., `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g., `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)