mirror of https://github.com/aya-rs/aya
Merge pull request #231 from nimrodshn/bpf_lpm_trie
Add LPMTrie Map to aya-bpf for BPF programspull/234/head
commit
01fe3a6b5e
@ -0,0 +1,101 @@
|
||||
use core::{marker::PhantomData, mem, ptr::NonNull};
|
||||
|
||||
use aya_bpf_cty::{c_long, c_void};
|
||||
|
||||
use crate::{
|
||||
bindings::{bpf_map_def, bpf_map_type::BPF_MAP_TYPE_LPM_TRIE},
|
||||
helpers::{bpf_map_delete_elem, bpf_map_lookup_elem, bpf_map_update_elem},
|
||||
maps::PinningType,
|
||||
};
|
||||
|
||||
#[repr(transparent)]
|
||||
pub struct LpmTrie<K, V> {
|
||||
def: bpf_map_def,
|
||||
_k: PhantomData<K>,
|
||||
_v: PhantomData<V>,
|
||||
}
|
||||
|
||||
#[repr(packed)]
|
||||
pub struct Key<K> {
|
||||
/// Represents the number of bytes matched against.
|
||||
pub prefix_len: u32,
|
||||
/// Represents arbitrary data stored in the LpmTrie.
|
||||
pub data: K,
|
||||
}
|
||||
|
||||
impl<K> Key<K> {
|
||||
pub fn new(prefix_len: u32, data: K) -> Self {
|
||||
Self { prefix_len, data }
|
||||
}
|
||||
}
|
||||
|
||||
impl<K, V> LpmTrie<K, V> {
|
||||
pub const fn with_max_entries(max_entries: u32, flags: u32) -> LpmTrie<K, V> {
|
||||
LpmTrie {
|
||||
def: build_def::<K, V>(BPF_MAP_TYPE_LPM_TRIE, max_entries, flags, PinningType::None),
|
||||
_k: PhantomData,
|
||||
_v: PhantomData,
|
||||
}
|
||||
}
|
||||
|
||||
pub const fn pinned(max_entries: u32, flags: u32) -> LpmTrie<K, V> {
|
||||
LpmTrie {
|
||||
def: build_def::<K, V>(
|
||||
BPF_MAP_TYPE_LPM_TRIE,
|
||||
max_entries,
|
||||
flags,
|
||||
PinningType::ByName,
|
||||
),
|
||||
_k: PhantomData,
|
||||
_v: PhantomData,
|
||||
}
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn get(&mut self, key: &Key<K>) -> Option<&V> {
|
||||
unsafe {
|
||||
let value = bpf_map_lookup_elem(
|
||||
&mut self.def as *mut _ as *mut _,
|
||||
key as *const _ as *const c_void,
|
||||
);
|
||||
// FIXME: alignment
|
||||
NonNull::new(value as *mut V).map(|p| p.as_ref())
|
||||
}
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn insert(&mut self, key: &Key<K>, value: &V, flags: u64) -> Result<(), c_long> {
|
||||
let ret = unsafe {
|
||||
bpf_map_update_elem(
|
||||
&mut self.def as *mut _ as *mut _,
|
||||
key as *const _ as *const _,
|
||||
value as *const _ as *const _,
|
||||
flags,
|
||||
)
|
||||
};
|
||||
(ret >= 0).then(|| ()).ok_or(ret)
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn remove(&mut self, key: &Key<K>) -> Result<(), c_long> {
|
||||
let ret = unsafe {
|
||||
bpf_map_delete_elem(
|
||||
&mut self.def as *mut _ as *mut _,
|
||||
key as *const _ as *const c_void,
|
||||
)
|
||||
};
|
||||
(ret >= 0).then(|| ()).ok_or(ret)
|
||||
}
|
||||
}
|
||||
|
||||
const fn build_def<K, V>(ty: u32, max_entries: u32, flags: u32, pin: PinningType) -> bpf_map_def {
|
||||
bpf_map_def {
|
||||
type_: ty,
|
||||
key_size: mem::size_of::<Key<K>>() as u32,
|
||||
value_size: mem::size_of::<V>() as u32,
|
||||
max_entries,
|
||||
map_flags: flags,
|
||||
id: 0,
|
||||
pinning: pin as u32,
|
||||
}
|
||||
}
|
Loading…
Reference in New Issue