Struct solana_runtime::in_mem_accounts_index::InMemAccountsIndex

pub struct InMemAccountsIndex<T: IndexValue> { /* private fields */ }

Implementations

impl<T: IndexValue> InMemAccountsIndex<T>

pub fn new(storage: &Arc<BucketMapHolder<T>>, bin: usize) -> Self

pub fn shrink_to_fit(&self)

Release entire in-mem hashmap to free all memory associated with it. Idea is that during startup we needed a larger map than we need during runtime. When using disk-buckets, in-mem index grows over time with dynamic use and then shrinks, in theory back to 0.

pub fn items<R>(&self, range: &R) -> Vec<(Pubkey, Arc<AccountMapEntryInner<T>>)> where
    R: RangeBounds<Pubkey> + Debug,

pub fn keys(&self) -> Vec<Pubkey>

pub fn get(&self, pubkey: &Pubkey) -> Option<Arc<AccountMapEntryInner<T>>>

lookup ‘pubkey’ in index (in mem or on disk)

pub fn remove_if_slot_list_empty(&self, pubkey: Pubkey) -> bool

pub fn slot_list_mut<RT>(
    &self,
    pubkey: &Pubkey,
    user: impl for<'a> FnOnce(&mut RwLockWriteGuard<'a, SlotList<T>>) -> RT
) -> Option<RT>

pub fn upsert(
    &self,
    pubkey: &Pubkey,
    new_value: PreAllocatedAccountMapEntry<T>,
    other_slot: Option<Slot>,
    reclaims: &mut SlotList<T>,
    reclaim: UpsertReclaim
)

pub fn len_for_stats(&self) -> usize

pub fn startup_insert_only(
    &self,
    slot: Slot,
    items: impl Iterator<Item = (Pubkey, T)>
)

Queue up these insertions for when the flush thread is dealing with this bin. This is very fast and requires no lookups or disk access.

pub fn insert_new_entry_if_missing_with_lock(
    &self,
    pubkey: Pubkey,
    new_entry: PreAllocatedAccountMapEntry<T>
) -> InsertNewEntryResults

pub fn hold_range_in_memory<R>(&self, range: &R, start_holding: bool)where
    R: RangeBounds<Pubkey> + Debug,

if ‘start_holding’=true, then: at the end of this function, cache_ranges_held will be updated to contain ‘range’ and all pubkeys in that range will be in the in-mem cache if ‘start_holding’=false, then: ‘range’ will be removed from cache_ranges_held and all pubkeys will be eligible for being removed from in-mem cache in the bg if no other range is holding them Any in-process flush will be aborted when it gets to evicting items from in-mem.

pub fn retrieve_duplicate_keys_from_startup(&self) -> Vec<(Slot, Pubkey)>

pull out all duplicate pubkeys from ‘startup_info’ duplicate pubkeys have a slot list with len > 1 These were collected for this bin when we did batch inserts in the bg flush threads.

pub fn stats(&self) -> &BucketMapHolderStats

pub fn update_time_stat(stat: &AtomicU64, m: Measure)

Trait Implementations

impl<T: IndexValue> Debug for InMemAccountsIndex<T>

fn fmt(&self, _f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.