mirror of
https://git.kernel.org/pub/scm/network/iproute2/iproute2.git
synced 2024-11-16 14:35:34 +08:00
9e71352581
dump more than TCA_ACT_MAX_PRIO actions per batch when the kernel supports it. Introduced keyword "since" for time based filtering of actions. Some example (we have 400 actions bound to 400 filters); at installation time. Using updated when tc setting the time of interest to 120 seconds earlier (we see 400 actions): prompt$ hackedtc actions ls action gact since 120000| grep index | wc -l 400 go get some coffee and wait for > 120 seconds and try again: prompt$ hackedtc actions ls action gact since 120000 | grep index | wc -l 0 Lets see a filter bound to one of these actions: .... filter pref 10 u32 filter pref 10 u32 fh 800: ht divisor 1 filter pref 10 u32 fh 800::800 order 2048 key ht 800 bkt 0 flowid 1:10 (rule hit 2 success 1) match 7f000002/ffffffff at 12 (success 1 ) action order 1: gact action pass random type none pass val 0 index 23 ref 2 bind 1 installed 1145 sec used 802 sec Action statistics: Sent 84 bytes 1 pkt (dropped 0, overlimits 0 requeues 0) backlog 0b 0p requeues 0 ... that coffee took long, no? It was good. Now lets ping -c 1 127.0.0.2, then run the actions again: prompt$ hackedtc actions ls action gact since 120 | grep index | wc -l 1 More details please: prompt$ hackedtc -s actions ls action gact since 120000 action order 0: gact action pass random type none pass val 0 index 23 ref 2 bind 1 installed 1270 sec used 30 sec Action statistics: Sent 168 bytes 2 pkt (dropped 0, overlimits 0 requeues 0) backlog 0b 0p requeues 0 And the filter? filter pref 10 u32 filter pref 10 u32 fh 800: ht divisor 1 filter pref 10 u32 fh 800::800 order 2048 key ht 800 bkt 0 flowid 1:10 (rule hit 4 success 2) match 7f000002/ffffffff at 12 (success 2 ) action order 1: gact action pass random type none pass val 0 index 23 ref 2 bind 1 installed 1324 sec used 84 sec Action statistics: Sent 168 bytes 2 pkt (dropped 0, overlimits 0 requeues 0) backlog 0b 0p requeues 0 Signed-off-by: Jamal Hadi Salim <jhs@mojatatu.com>
252 lines
6.6 KiB
C
252 lines
6.6 KiB
C
/*
|
|
* f_bpf.c BPF-based Classifier
|
|
*
|
|
* This program is free software; you can distribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version
|
|
* 2 of the License, or (at your option) any later version.
|
|
*
|
|
* Authors: Daniel Borkmann <daniel@iogearbox.net>
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include <linux/bpf.h>
|
|
|
|
#include "utils.h"
|
|
|
|
#include "tc_util.h"
|
|
#include "bpf_util.h"
|
|
|
|
static const enum bpf_prog_type bpf_type = BPF_PROG_TYPE_SCHED_CLS;
|
|
|
|
static void explain(void)
|
|
{
|
|
fprintf(stderr, "Usage: ... bpf ...\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "BPF use case:\n");
|
|
fprintf(stderr, " bytecode BPF_BYTECODE\n");
|
|
fprintf(stderr, " bytecode-file FILE\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "eBPF use case:\n");
|
|
fprintf(stderr, " object-file FILE [ section CLS_NAME ] [ export UDS_FILE ]");
|
|
fprintf(stderr, " [ verbose ] [ direct-action ] [ skip_hw | skip_sw ]\n");
|
|
fprintf(stderr, " object-pinned FILE [ direct-action ] [ skip_hw | skip_sw ]\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "Common remaining options:\n");
|
|
fprintf(stderr, " [ action ACTION_SPEC ]\n");
|
|
fprintf(stderr, " [ classid CLASSID ]\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "Where BPF_BYTECODE := \'s,c t f k,c t f k,c t f k,...\'\n");
|
|
fprintf(stderr, "c,t,f,k and s are decimals; s denotes number of 4-tuples\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "Where FILE points to a file containing the BPF_BYTECODE string,\n");
|
|
fprintf(stderr, "an ELF file containing eBPF map definitions and bytecode, or a\n");
|
|
fprintf(stderr, "pinned eBPF program.\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "Where CLS_NAME refers to the section name containing the\n");
|
|
fprintf(stderr, "classifier (default \'%s\').\n", bpf_prog_to_default_section(bpf_type));
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "Where UDS_FILE points to a unix domain socket file in order\n");
|
|
fprintf(stderr, "to hand off control of all created eBPF maps to an agent.\n");
|
|
fprintf(stderr, "\n");
|
|
fprintf(stderr, "ACTION_SPEC := ... look at individual actions\n");
|
|
fprintf(stderr, "NOTE: CLASSID is parsed as hexadecimal input.\n");
|
|
}
|
|
|
|
static void bpf_cbpf_cb(void *nl, const struct sock_filter *ops, int ops_len)
|
|
{
|
|
addattr16(nl, MAX_MSG, TCA_BPF_OPS_LEN, ops_len);
|
|
addattr_l(nl, MAX_MSG, TCA_BPF_OPS, ops,
|
|
ops_len * sizeof(struct sock_filter));
|
|
}
|
|
|
|
static void bpf_ebpf_cb(void *nl, int fd, const char *annotation)
|
|
{
|
|
addattr32(nl, MAX_MSG, TCA_BPF_FD, fd);
|
|
addattrstrz(nl, MAX_MSG, TCA_BPF_NAME, annotation);
|
|
}
|
|
|
|
static const struct bpf_cfg_ops bpf_cb_ops = {
|
|
.cbpf_cb = bpf_cbpf_cb,
|
|
.ebpf_cb = bpf_ebpf_cb,
|
|
};
|
|
|
|
static int bpf_parse_opt(struct filter_util *qu, char *handle,
|
|
int argc, char **argv, struct nlmsghdr *n)
|
|
{
|
|
const char *bpf_obj = NULL, *bpf_uds_name = NULL;
|
|
struct tcmsg *t = NLMSG_DATA(n);
|
|
unsigned int bpf_gen_flags = 0;
|
|
unsigned int bpf_flags = 0;
|
|
struct bpf_cfg_in cfg = {};
|
|
bool seen_run = false;
|
|
struct rtattr *tail;
|
|
int ret = 0;
|
|
|
|
if (handle) {
|
|
if (get_u32(&t->tcm_handle, handle, 0)) {
|
|
fprintf(stderr, "Illegal \"handle\"\n");
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
if (argc == 0)
|
|
return 0;
|
|
|
|
tail = (struct rtattr *)(((void *)n) + NLMSG_ALIGN(n->nlmsg_len));
|
|
addattr_l(n, MAX_MSG, TCA_OPTIONS, NULL, 0);
|
|
|
|
while (argc > 0) {
|
|
if (matches(*argv, "run") == 0) {
|
|
NEXT_ARG();
|
|
opt_bpf:
|
|
seen_run = true;
|
|
cfg.argc = argc;
|
|
cfg.argv = argv;
|
|
|
|
if (bpf_parse_common(bpf_type, &cfg, &bpf_cb_ops, n))
|
|
return -1;
|
|
|
|
argc = cfg.argc;
|
|
argv = cfg.argv;
|
|
|
|
bpf_obj = cfg.object;
|
|
bpf_uds_name = cfg.uds;
|
|
} else if (matches(*argv, "classid") == 0 ||
|
|
matches(*argv, "flowid") == 0) {
|
|
unsigned int handle;
|
|
|
|
NEXT_ARG();
|
|
if (get_tc_classid(&handle, *argv)) {
|
|
fprintf(stderr, "Illegal \"classid\"\n");
|
|
return -1;
|
|
}
|
|
addattr32(n, MAX_MSG, TCA_BPF_CLASSID, handle);
|
|
} else if (matches(*argv, "direct-action") == 0 ||
|
|
matches(*argv, "da") == 0) {
|
|
bpf_flags |= TCA_BPF_FLAG_ACT_DIRECT;
|
|
} else if (matches(*argv, "skip_hw") == 0) {
|
|
bpf_gen_flags |= TCA_CLS_FLAGS_SKIP_HW;
|
|
} else if (matches(*argv, "skip_sw") == 0) {
|
|
bpf_gen_flags |= TCA_CLS_FLAGS_SKIP_SW;
|
|
} else if (matches(*argv, "action") == 0) {
|
|
NEXT_ARG();
|
|
if (parse_action(&argc, &argv, TCA_BPF_ACT, n)) {
|
|
fprintf(stderr, "Illegal \"action\"\n");
|
|
return -1;
|
|
}
|
|
continue;
|
|
} else if (matches(*argv, "police") == 0) {
|
|
NEXT_ARG();
|
|
if (parse_police(&argc, &argv, TCA_BPF_POLICE, n)) {
|
|
fprintf(stderr, "Illegal \"police\"\n");
|
|
return -1;
|
|
}
|
|
continue;
|
|
} else if (matches(*argv, "help") == 0) {
|
|
explain();
|
|
return -1;
|
|
} else {
|
|
if (!seen_run)
|
|
goto opt_bpf;
|
|
|
|
fprintf(stderr, "What is \"%s\"?\n", *argv);
|
|
explain();
|
|
return -1;
|
|
}
|
|
|
|
NEXT_ARG_FWD();
|
|
}
|
|
|
|
if (bpf_gen_flags)
|
|
addattr32(n, MAX_MSG, TCA_BPF_FLAGS_GEN, bpf_gen_flags);
|
|
if (bpf_flags)
|
|
addattr32(n, MAX_MSG, TCA_BPF_FLAGS, bpf_flags);
|
|
|
|
tail->rta_len = (((void *)n) + n->nlmsg_len) - (void *)tail;
|
|
|
|
if (bpf_uds_name)
|
|
ret = bpf_send_map_fds(bpf_uds_name, bpf_obj);
|
|
|
|
return ret;
|
|
}
|
|
|
|
static int bpf_print_opt(struct filter_util *qu, FILE *f,
|
|
struct rtattr *opt, __u32 handle)
|
|
{
|
|
struct rtattr *tb[TCA_BPF_MAX + 1];
|
|
|
|
if (opt == NULL)
|
|
return 0;
|
|
|
|
parse_rtattr_nested(tb, TCA_BPF_MAX, opt);
|
|
|
|
if (handle)
|
|
fprintf(f, "handle 0x%x ", handle);
|
|
|
|
if (tb[TCA_BPF_CLASSID]) {
|
|
SPRINT_BUF(b1);
|
|
fprintf(f, "flowid %s ",
|
|
sprint_tc_classid(rta_getattr_u32(tb[TCA_BPF_CLASSID]), b1));
|
|
}
|
|
|
|
if (tb[TCA_BPF_NAME])
|
|
fprintf(f, "%s ", rta_getattr_str(tb[TCA_BPF_NAME]));
|
|
|
|
if (tb[TCA_BPF_FLAGS]) {
|
|
unsigned int flags = rta_getattr_u32(tb[TCA_BPF_FLAGS]);
|
|
|
|
if (flags & TCA_BPF_FLAG_ACT_DIRECT)
|
|
fprintf(f, "direct-action ");
|
|
}
|
|
|
|
if (tb[TCA_BPF_FLAGS_GEN]) {
|
|
unsigned int flags =
|
|
rta_getattr_u32(tb[TCA_BPF_FLAGS_GEN]);
|
|
|
|
if (flags & TCA_CLS_FLAGS_SKIP_HW)
|
|
fprintf(f, "skip_hw ");
|
|
if (flags & TCA_CLS_FLAGS_SKIP_SW)
|
|
fprintf(f, "skip_sw ");
|
|
|
|
if (flags & TCA_CLS_FLAGS_IN_HW)
|
|
fprintf(f, "in_hw ");
|
|
else if (flags & TCA_CLS_FLAGS_NOT_IN_HW)
|
|
fprintf(f, "not_in_hw ");
|
|
}
|
|
|
|
if (tb[TCA_BPF_OPS] && tb[TCA_BPF_OPS_LEN])
|
|
bpf_print_ops(f, tb[TCA_BPF_OPS],
|
|
rta_getattr_u16(tb[TCA_BPF_OPS_LEN]));
|
|
|
|
if (tb[TCA_BPF_TAG]) {
|
|
SPRINT_BUF(b);
|
|
|
|
fprintf(f, "tag %s ",
|
|
hexstring_n2a(RTA_DATA(tb[TCA_BPF_TAG]),
|
|
RTA_PAYLOAD(tb[TCA_BPF_TAG]),
|
|
b, sizeof(b)));
|
|
}
|
|
|
|
if (tb[TCA_BPF_ID])
|
|
bpf_dump_prog_info(f, rta_getattr_u32(tb[TCA_BPF_ID]));
|
|
|
|
if (tb[TCA_BPF_POLICE]) {
|
|
fprintf(f, "\n");
|
|
tc_print_police(f, tb[TCA_BPF_POLICE]);
|
|
}
|
|
|
|
if (tb[TCA_BPF_ACT])
|
|
tc_print_action(f, tb[TCA_BPF_ACT], 0);
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct filter_util bpf_filter_util = {
|
|
.id = "bpf",
|
|
.parse_fopt = bpf_parse_opt,
|
|
.print_fopt = bpf_print_opt,
|
|
};
|