Struct LruPerCpuHashMap

pub struct LruPerCpuHashMap<'a, K: Clone, V: Clone> { /* private fields */ }

An LRU per-cpu BPF hash map structure

This provides higher level API for BPF maps whose type is BPF_MAP_TYPE_LRU_PERCPU_HASH

Implementations

impl<'base, K: Clone, V: Clone> LruPerCpuHashMap<'base, K, V>

pub fn new(base: &Map) -> Result<LruPerCpuHashMap<'_, K, V>>

pub fn set(&self, key: K, values: PerCpuValues<V>) -> Result<()>

Set per-cpu values to the BPF map at key

The number of elements in values should be equal to the number of possible CPUs. This requirement is automatically fulfilled when values is created by PerCpuValues::new

Err can be returned if the number of elements is wrong or underlying bpf_map_update_elem function returns a negative value.

pub fn get(&self, key: K) -> Option<PerCpuValues<V>>

Get per-cpu values corresponding to the key from the BPF map

If key is found, Some([PerCpuValues](./struct.PerCpuValues.html)) is returned.

pub fn delete(&self, key: K)

Delete key from the BPF map

pub fn iter<'a>(&'a self) -> MapIter<'a, K, PerCpuValues<V>>

Return an iterator over all items in the map