mirror of https://github.com/aya-rs/aya
ebpf: add peak() method to Queue and Stack
Add integration tests covering push,pop,peek for both types. Signed-off-by: Xiaobo Liu <cppcoffee@gmail.com> Signed-off-by: Tamir Duberstein <tamird@gmail.com>reviewable/pr1338/r1
Xiaobo Liu
1 month ago
committed by
Tamir Duberstein
parent
f6606473af
commit
53ec616411
@ -0,0 +1,71 @@
|
||||
#![no_std]
|
||||
#![no_main]
|
||||
|
||||
#[cfg(not(test))]
|
||||
extern crate ebpf_panic;
|
||||
|
||||
use aya_ebpf::{
|
||||
cty::c_long,
|
||||
macros::{map, uprobe},
|
||||
maps::{Array, Queue, Stack},
|
||||
programs::ProbeContext,
|
||||
};
|
||||
use integration_common::linear_data_structures::{PEEK_INDEX, POP_INDEX};
|
||||
|
||||
#[map]
|
||||
static RESULT: Array<u64> = Array::<u64>::with_max_entries(2, 0);
|
||||
|
||||
#[inline(always)]
|
||||
fn result_set(index: u32, value: u64) -> Result<(), c_long> {
|
||||
let ptr = RESULT.get_ptr_mut(index).ok_or(-1)?;
|
||||
let dst = unsafe { ptr.as_mut() };
|
||||
let dst_res = dst.ok_or(-1)?;
|
||||
*dst_res = value;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
macro_rules! define_linear_ds_test {
|
||||
($Type:ident, $map_ident:ident,
|
||||
push_fn: $push_fn:ident,
|
||||
pop_fn: $pop_fn:ident,
|
||||
peek_fn: $peek_fn:ident,
|
||||
) => {
|
||||
#[map]
|
||||
static $map_ident: $Type<u64> = $Type::with_max_entries(10, 0);
|
||||
|
||||
#[uprobe]
|
||||
pub fn $push_fn(ctx: ProbeContext) -> Result<(), c_long> {
|
||||
let value = ctx.arg(0).ok_or(-1)?;
|
||||
$map_ident.push(&value, 0)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
#[uprobe]
|
||||
pub fn $pop_fn(_: ProbeContext) -> Result<(), c_long> {
|
||||
let value = $map_ident.pop().ok_or(-1)?;
|
||||
result_set(POP_INDEX, value)?;
|
||||
Ok(())
|
||||
}
|
||||
|
||||
#[uprobe]
|
||||
pub fn $peek_fn(_: ProbeContext) -> Result<(), c_long> {
|
||||
let value = $map_ident.peek().ok_or(-1)?;
|
||||
result_set(PEEK_INDEX, value)?;
|
||||
Ok(())
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
use define_linear_ds_test;
|
||||
|
||||
define_linear_ds_test!(Stack, TEST_STACK,
|
||||
push_fn: test_stack_push,
|
||||
pop_fn: test_stack_pop,
|
||||
peek_fn: test_stack_peek,
|
||||
);
|
||||
|
||||
define_linear_ds_test!(Queue, TEST_QUEUE,
|
||||
push_fn: test_queue_push,
|
||||
pop_fn: test_queue_pop,
|
||||
peek_fn: test_queue_peek,
|
||||
);
|
||||
@ -0,0 +1,94 @@
|
||||
use aya::{EbpfLoader, maps::Array, programs::UProbe};
|
||||
use integration_common::linear_data_structures::{PEEK_INDEX, POP_INDEX};
|
||||
|
||||
enum Order {
|
||||
Lifo,
|
||||
Fifo,
|
||||
}
|
||||
|
||||
macro_rules! define_linear_ds_host_test {
|
||||
(
|
||||
push_prog: $push_prog:literal,
|
||||
pop_prog: $pop_prog:literal,
|
||||
peek_prog: $peek_prog:literal,
|
||||
push_fn: $push_fn:ident,
|
||||
pop_fn: $pop_fn:ident,
|
||||
peek_fn: $peek_fn:ident,
|
||||
test_fn: $test_fn:ident,
|
||||
order: $order:expr,
|
||||
) => {
|
||||
#[unsafe(no_mangle)]
|
||||
#[inline(never)]
|
||||
pub extern "C" fn $push_fn(arg: u64) {
|
||||
core::hint::black_box(arg);
|
||||
}
|
||||
#[unsafe(no_mangle)]
|
||||
#[inline(never)]
|
||||
pub extern "C" fn $peek_fn(marker: u64) -> u64 {
|
||||
core::hint::black_box($peek_fn);
|
||||
marker + 1
|
||||
}
|
||||
#[unsafe(no_mangle)]
|
||||
#[inline(never)]
|
||||
pub extern "C" fn $pop_fn(marker: u64) -> u64 {
|
||||
core::hint::black_box($pop_fn);
|
||||
marker + 2
|
||||
}
|
||||
|
||||
#[test_log::test]
|
||||
fn $test_fn() {
|
||||
let mut bpf = EbpfLoader::new()
|
||||
.load(crate::LINEAR_DATA_STRUCTURES)
|
||||
.unwrap();
|
||||
for (prog_name, symbol) in [
|
||||
($push_prog, stringify!($push_fn)),
|
||||
($peek_prog, stringify!($peek_fn)),
|
||||
($pop_prog, stringify!($pop_fn)),
|
||||
] {
|
||||
let prog: &mut UProbe = bpf.program_mut(prog_name).unwrap().try_into().unwrap();
|
||||
prog.load().unwrap();
|
||||
prog.attach(symbol, "/proc/self/exe", None, None).unwrap();
|
||||
}
|
||||
let array_map = bpf.map("RESULT").unwrap();
|
||||
let array = Array::<_, u64>::try_from(array_map).unwrap();
|
||||
let seq = 0..9;
|
||||
for i in seq.clone() {
|
||||
$push_fn(i);
|
||||
}
|
||||
let mut rev = seq.clone().rev();
|
||||
let mut seq = seq;
|
||||
let iter: &mut dyn Iterator<Item = u64> = match $order {
|
||||
Order::Lifo => &mut rev,
|
||||
Order::Fifo => &mut seq,
|
||||
};
|
||||
for i in iter {
|
||||
$peek_fn(i);
|
||||
assert_eq!(array.get(&PEEK_INDEX, 0).unwrap(), i);
|
||||
$pop_fn(i);
|
||||
assert_eq!(array.get(&POP_INDEX, 0).unwrap(), i);
|
||||
}
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
define_linear_ds_host_test!(
|
||||
push_prog: "test_stack_push",
|
||||
pop_prog: "test_stack_pop",
|
||||
peek_prog: "test_stack_peek",
|
||||
push_fn: trigger_stack_push,
|
||||
pop_fn: trigger_stack_pop,
|
||||
peek_fn: trigger_stack_peek,
|
||||
test_fn: stack_basic,
|
||||
order: Order::Lifo,
|
||||
);
|
||||
|
||||
define_linear_ds_host_test!(
|
||||
push_prog: "test_queue_push",
|
||||
pop_prog: "test_queue_pop",
|
||||
peek_prog: "test_queue_peek",
|
||||
push_fn: trigger_queue_push,
|
||||
pop_fn: trigger_queue_pop,
|
||||
peek_fn: trigger_queue_peek,
|
||||
test_fn: queue_basic,
|
||||
order: Order::Fifo,
|
||||
);
|
||||
Loading…
Reference in New Issue