-
Notifications
You must be signed in to change notification settings - Fork 3.9k
/
test_queuestack_table.cc
101 lines (86 loc) · 2.45 KB
/
test_queuestack_table.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
* Copyright (c) 2020 Politecnico di Torino
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "BPF.h"
#include "catch.hpp"
#include <iostream>
#include <linux/version.h>
//Queue/Stack types are available only from 5.0.0
#if LINUX_VERSION_CODE >= KERNEL_VERSION(5, 0, 0)
TEST_CASE("queue table", "[queue_table]") {
const std::string BPF_PROGRAM = R"(
BPF_QUEUE(myqueue, int, 30);
)";
ebpf::BPF bpf;
ebpf::StatusTuple res(0);
res = bpf.init(BPF_PROGRAM);
REQUIRE(res.code() == 0);
ebpf::BPFQueueStackTable<int> t = bpf.get_queuestack_table<int>("myqueue");
SECTION("standard methods") {
int i, val;
std::string value;
// insert elements
for (i=0; i<30; i++) {
res = t.push_value(i);
REQUIRE(res.code() == 0);
}
// checking head (peek)
res = t.get_head(val);
REQUIRE(res.code() == 0);
REQUIRE(val == 0);
// retrieve elements
for (i=0; i<30; i++) {
res = t.pop_value(val);
REQUIRE(res.code() == 0);
REQUIRE(val == i);
}
// get non existing element
res = t.pop_value(val);
REQUIRE(res.code() != 0);
}
}
TEST_CASE("stack table", "[stack_table]") {
const std::string BPF_PROGRAM = R"(
BPF_STACK(mystack, int, 30);
)";
ebpf::BPF bpf;
ebpf::StatusTuple res(0);
res = bpf.init(BPF_PROGRAM);
REQUIRE(res.code() == 0);
ebpf::BPFQueueStackTable<int> t = bpf.get_queuestack_table<int>("mystack");
SECTION("standard methods") {
int i, val;
std::string value;
// insert elements
for (i=0; i<30; i++) {
res = t.push_value(i);
REQUIRE(res.code() == 0);
}
// checking head (peek)
res = t.get_head(val);
REQUIRE(res.code() == 0);
REQUIRE(val == 29);
// retrieve elements
for (i=0; i<30; i++) {
res = t.pop_value(val);
REQUIRE(res.code() == 0);
REQUIRE( val == (30 - 1 - i));
}
// get non existing element
res = t.pop_value(val);
REQUIRE(res.code() != 0);
}
}
#endif