Struct tikv::server::lock_manager::waiter_manager::WaitTable

struct WaitTable {
    wait_table: HashMap<u64, Vec<Waiter>>,
    waiter_count: Arc<AtomicUsize>,
}

Fields

wait_table: HashMap<u64, Vec<Waiter>>

waiter_count: Arc<AtomicUsize>

Implementations

impl WaitTable

fn new(waiter_count: Arc<AtomicUsize>) -> Self

fn is_empty(&self) -> bool

fn add_waiter(&mut self, waiter: Waiter) -> Option<Waiter>

Returns the duplicated Waiter if there is.

fn remove(&mut self, lock: Lock)

Removes all waiters waiting for the lock.

fn remove_waiter(&mut self, lock: Lock, waiter_ts: TimeStamp) -> Option<Waiter>

fn remove_oldest_waiter(
    &mut self,
    lock: Lock
) -> Option<(Waiter, &mut Vec<Waiter>)>

Removes the Waiter with the smallest start ts and returns it with remaining waiters.

NOTE: Due to the borrow checker, it doesn’t remove the entry in the WaitTable even if there is no remaining waiter.

fn to_wait_for_entries(&self) -> Vec<WaitForEntry>