[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20220520174616.74684-1-xiyou.wangcong@gmail.com>
Date: Fri, 20 May 2022 10:46:14 -0700
From: Cong Wang <xiyou.wangcong@...il.com>
To: netdev@...r.kernel.org
Cc: jhs@...atatu.com, jiri@...nulli.us, toke@...hat.com,
bpf@...r.kernel.org, Cong Wang <cong.wang@...edance.com>
Subject: [RFC Patch v4 0/2] net_sched: introduce eBPF based Qdisc
From: Cong Wang <cong.wang@...edance.com>
This *incomplete* patch introduces a programmable Qdisc with eBPF.
There are a few use cases:
1. Allow customizing Qdisc's in an easier way. So that people don't
have to write a complete Qdisc kernel module just to experiment
some new queuing theory.
2. Solve EDT's problem. EDT calcuates the "tokens" in clsact which
is before enqueue, it is impossible to adjust those "tokens" after
packets get dropped in enqueue. With eBPF Qdisc, it is easy to
be solved with a shared map between clsact and sch_bpf.
3. Potentially pave a way for ingress to queue packets, although
current implementation is still only for egress.
4. Potentially pave a way for handling TCP protocol in TC, as
rbtree itself is already used by TCP to handle TCP retransmission.
The goal is to make this Qdisc as programmable as possible,
that is, to replace as many existing Qdisc's as we can, no matter
in tree or out of tree. This is why I give up on PIFO which has
serious limitations on the programmablity.
Here is a summary of design decisions I made:
1. Avoid eBPF struct_ops, as it would be really hard to program
a Qdisc with this approach, literally all the struct Qdisc_ops
and struct Qdisc_class_ops are needed to implement. This is almost
as hard as programming a Qdisc kernel module.
2. Introduce skb map, which will allow other eBPF programs to store skb's
too.
a) As eBPF maps are not directly visible to the kernel, we have to
dump the stats via eBPF map API's instead of netlink.
b) The user-space is not allowed to read the entire packets, only __sk_buff
itself is readable, because we don't have such a use case yet and it would
require a different API to read the data, as map values have fixed length.
c) Two eBPF helpers are introduced for skb map operations:
bpf_skb_map_push() and bpf_skb_map_pop(). Normal map update is
not allowed.
d) Multi-queue support should be done via map-in-map. This is TBD.
e) Use the netdevice notifier to reset the packets inside skb map upon
NETDEV_DOWN event.
3. Integrate with existing TC infra. For example, if the user doesn't want
to implement her own filters (e.g. a flow dissector), she should be able
to re-use the existing TC filters. Another helper bpf_skb_classify() is
introduced for this purpose.
Any high-level feedback is welcome. Please kindly do not review any coding
details until RFC tag is removed.
TODO:
1. actually test it
2. write a document for this Qdisc
3. add test cases and sample code
Cc: Toke Høiland-Jørgensen <toke@...hat.com>
Cc: Jamal Hadi Salim <jhs@...atatu.com>
Cc: Jiri Pirko <jiri@...nulli.us>
Signed-off-by: Cong Wang <cong.wang@...edance.com>
---
v4: get rid of PIFO, use rbtree directly
v3: move priority queue from sch_bpf to skb map
introduce skb map and its helpers
introduce bpf_skb_classify()
use netdevice notifier to reset skb's
Rebase on latest bpf-next
v2: Rebase on latest net-next
Make the code more complete (but still incomplete)
Cong Wang (2):
bpf: introduce skb map
net_sched: introduce eBPF based Qdisc
include/linux/bpf_types.h | 2 +
include/linux/skbuff.h | 4 +-
include/uapi/linux/bpf.h | 15 +
include/uapi/linux/pkt_sched.h | 17 ++
kernel/bpf/Makefile | 2 +-
kernel/bpf/skb_map.c | 337 +++++++++++++++++++++
net/sched/Kconfig | 15 +
net/sched/Makefile | 1 +
net/sched/sch_bpf.c | 520 +++++++++++++++++++++++++++++++++
9 files changed, 911 insertions(+), 2 deletions(-)
create mode 100644 kernel/bpf/skb_map.c
create mode 100644 net/sched/sch_bpf.c
--
2.34.1
Powered by blists - more mailing lists