Struct tikv::storage::txn::scheduler::SchedulerInner

[+] Show declaration

struct SchedulerInner<L: LockManager> {
    task_slots: Vec<CachePadded<Mutex<HashMap<u64, TaskContext>>>>,
    id_alloc: CachePadded<AtomicU64>,
    latches: Latches,
    sched_pending_write_threshold: usize,
    worker_pool: SchedPool,
    high_priority_pool: SchedPool,
    running_write_bytes: CachePadded<AtomicUsize>,
    lock_mgr: L,
    concurrency_manager: ConcurrencyManager,
    pipelined_pessimistic_lock: Arc<AtomicBool>,
    enable_async_apply_prewrite: bool,
}

Fields

task_slots: Vec<CachePadded<Mutex<HashMap<u64, TaskContext>>>>

id_alloc: CachePadded<AtomicU64>

latches: Latches

sched_pending_write_threshold: usize

worker_pool: SchedPool

high_priority_pool: SchedPool

running_write_bytes: CachePadded<AtomicUsize>

lock_mgr: L

concurrency_manager: ConcurrencyManager

pipelined_pessimistic_lock: Arc<AtomicBool>

enable_async_apply_prewrite: bool

Implementations

impl<L: LockManager> SchedulerInner<L>[−]

fn gen_id(&self) -> u64[−]

Generates the next command ID.

fn get_task_slot(&self, cid: u64) -> MutexGuard<'_, HashMap<u64, TaskContext>>

fn new_task_context(&self, task: Task, callback: StorageCallback) -> TaskContext

fn dequeue_task_context(&self, cid: u64) -> TaskContext

fn take_task_cb_and_pr(
    &self,
    cid: u64
) -> (Option<StorageCallback>, Option<ProcessResult>)

fn store_pr(&self, cid: u64, pr: ProcessResult)

fn too_busy(&self) -> bool

fn acquire_lock(&self, cid: u64) -> Result<Option<Task>, StorageError>[−]

Tries to acquire all the required latches for a command.

Returns the Task if successful; returns None otherwise.

fn dump_wait_for_entries(&self, cb: Callback)