pub struct Map { /* private fields */ }
Expand description
Represents a libbpf-created map.
Some methods require working with raw bytes. You may find libraries such as
plain
helpful.
Implementations§
Methods from Deref<Target = MapHandle>§
sourcepub fn value_size(&self) -> u32
pub fn value_size(&self) -> u32
Value size in bytes
sourcepub fn lookup(&self, key: &[u8], flags: MapFlags) -> Result<Option<Vec<u8>>>
pub fn lookup(&self, key: &[u8], flags: MapFlags) -> Result<Option<Vec<u8>>>
Returns map value as Vec
of u8
.
key
must have exactly MapHandle::key_size()
elements.
If the map is one of the per-cpu data structures, the function MapHandle::lookup_percpu()
must be used.
If the map is of type bloom_filter the function MapHandle::lookup_bloom_filter()
must be used
sourcepub fn lookup_bloom_filter(&self, value: &[u8]) -> Result<bool>
pub fn lookup_bloom_filter(&self, value: &[u8]) -> Result<bool>
Returns if the given value is likely present in bloom_filter as bool
.
value
must have exactly MapHandle::value_size()
elements.
sourcepub fn lookup_percpu(
&self,
key: &[u8],
flags: MapFlags,
) -> Result<Option<Vec<Vec<u8>>>>
pub fn lookup_percpu( &self, key: &[u8], flags: MapFlags, ) -> Result<Option<Vec<Vec<u8>>>>
Returns one value per cpu as Vec
of Vec
of u8
for per per-cpu maps.
For normal maps, MapHandle::lookup()
must be used.
sourcepub fn delete(&self, key: &[u8]) -> Result<()>
pub fn delete(&self, key: &[u8]) -> Result<()>
Deletes an element from the map.
key
must have exactly MapHandle::key_size()
elements.
sourcepub fn delete_batch(
&self,
keys: &[u8],
count: u32,
elem_flags: MapFlags,
flags: MapFlags,
) -> Result<()>
pub fn delete_batch( &self, keys: &[u8], count: u32, elem_flags: MapFlags, flags: MapFlags, ) -> Result<()>
Deletes many elements in batch mode from the map.
keys
must have exactly [MapHandle::key_size()
* count] elements.
sourcepub fn lookup_and_delete(&self, key: &[u8]) -> Result<Option<Vec<u8>>>
pub fn lookup_and_delete(&self, key: &[u8]) -> Result<Option<Vec<u8>>>
Same as MapHandle::lookup()
except this also deletes the key from the map.
Note that this operation is currently only implemented in the kernel for MapType::Queue
and MapType::Stack
.
key
must have exactly MapHandle::key_size()
elements.
sourcepub fn update(&self, key: &[u8], value: &[u8], flags: MapFlags) -> Result<()>
pub fn update(&self, key: &[u8], value: &[u8], flags: MapFlags) -> Result<()>
Update an element.
key
must have exactly MapHandle::key_size()
elements. value
must have exactly
MapHandle::value_size()
elements.
For per-cpu maps, MapHandle::update_percpu()
must be used.
sourcepub fn update_batch(
&self,
keys: &[u8],
values: &[u8],
count: u32,
elem_flags: MapFlags,
flags: MapFlags,
) -> Result<()>
pub fn update_batch( &self, keys: &[u8], values: &[u8], count: u32, elem_flags: MapFlags, flags: MapFlags, ) -> Result<()>
Updates many elements in batch mode in the map
keys
must have exactly [MapHandle::key_size()
* count] elements. value
must have exactly
[MapHandle::key_size()
* count] elements
sourcepub fn update_percpu(
&self,
key: &[u8],
values: &[Vec<u8>],
flags: MapFlags,
) -> Result<()>
pub fn update_percpu( &self, key: &[u8], values: &[Vec<u8>], flags: MapFlags, ) -> Result<()>
Update an element in an per-cpu map with one value per cpu.
key
must have exactly MapHandle::key_size()
elements. value
must have one
element per cpu (see num_possible_cpus
)
with exactly MapHandle::value_size()
elements each.
For per-cpu maps, MapHandle::update_percpu()
must be used.
sourcepub fn freeze(&self) -> Result<()>
pub fn freeze(&self) -> Result<()>
Freeze the map as read-only from user space.
Entries from a frozen map can no longer be updated or deleted with the bpf() system call. This operation is not reversible, and the map remains immutable from user space until its destruction. However, read and write permissions for BPF programs to the map remain unchanged.
sourcepub fn keys(&self) -> MapKeyIter<'_> ⓘ
pub fn keys(&self) -> MapKeyIter<'_> ⓘ
Returns an iterator over keys in this map
Note that if the map is not stable (stable meaning no updates or deletes) during iteration, iteration can skip keys, restart from the beginning, or duplicate keys. In other words, iteration becomes unpredictable.
Trait Implementations§
source§impl AsFd for Map
impl AsFd for Map
source§fn as_fd(&self) -> BorrowedFd<'_>
fn as_fd(&self) -> BorrowedFd<'_>
source§impl AsRawLibbpf for Map
impl AsRawLibbpf for Map
source§fn as_libbpf_object(&self) -> NonNull<Self::LibbpfType>
fn as_libbpf_object(&self) -> NonNull<Self::LibbpfType>
Retrieve the underlying libbpf_sys::bpf_map
.
§type LibbpfType = bpf_map
type LibbpfType = bpf_map
libbpf
type.