mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-24 01:15:59 +07:00
187d0738ff
A cgroup skb BPF program to limit cgroup output bandwidth.
It uses a modified virtual token bucket queue to limit average
egress bandwidth. The implementation uses credits instead of tokens.
Negative credits imply that queueing would have happened (this is
a virtual queue, so no queueing is done by it. However, queueing may
occur at the actual qdisc (which is not used for rate limiting).
This implementation uses 3 thresholds, one to start marking packets and
the other two to drop packets:
CREDIT
- <--------------------------|------------------------> +
| | | 0
| Large pkt |
| drop thresh |
Small pkt drop Mark threshold
thresh
The effect of marking depends on the type of packet:
a) If the packet is ECN enabled, then the packet is ECN ce marked.
The current mark threshold is tuned for DCTCP.
c) Else, it is dropped if it is a large packet.
If the credit is below the drop threshold, the packet is dropped.
Note that dropping a packet through the BPF program does not trigger CWR
(Congestion Window Reduction) in TCP packets. A future patch will add
support for triggering CWR.
This BPF program actually uses 2 drop thresholds, one threshold
for larger packets (>= 120 bytes) and another for smaller packets. This
protects smaller packets such as SYNs, ACKs, etc.
The default bandwidth limit is set at 1Gbps but this can be changed by
a user program through a shared BPF map. In addition, by default this BPF
program does not limit connections using loopback. This behavior can be
overwritten by the user program. There is also an option to calculate
some statistics, such as percent of packets marked or dropped, which
the user program can access.
A latter patch provides such a program (hbm.c)
Signed-off-by: Lawrence Brakmo <brakmo@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
138 lines
3.8 KiB
C
138 lines
3.8 KiB
C
/* SPDX-License-Identifier: GPL-2.0
|
|
*
|
|
* Copyright (c) 2019 Facebook
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of version 2 of the GNU General Public
|
|
* License as published by the Free Software Foundation.
|
|
*
|
|
* Include file for sample Host Bandwidth Manager (HBM) BPF programs
|
|
*/
|
|
#define KBUILD_MODNAME "foo"
|
|
#include <stddef.h>
|
|
#include <stdbool.h>
|
|
#include <uapi/linux/bpf.h>
|
|
#include <uapi/linux/if_ether.h>
|
|
#include <uapi/linux/if_packet.h>
|
|
#include <uapi/linux/ip.h>
|
|
#include <uapi/linux/ipv6.h>
|
|
#include <uapi/linux/in.h>
|
|
#include <uapi/linux/tcp.h>
|
|
#include <uapi/linux/filter.h>
|
|
#include <uapi/linux/pkt_cls.h>
|
|
#include <net/ipv6.h>
|
|
#include <net/inet_ecn.h>
|
|
#include "bpf_endian.h"
|
|
#include "bpf_helpers.h"
|
|
#include "hbm.h"
|
|
|
|
#define DROP_PKT 0
|
|
#define ALLOW_PKT 1
|
|
#define TCP_ECN_OK 1
|
|
|
|
#define HBM_DEBUG 0 // Set to 1 to enable debugging
|
|
#if HBM_DEBUG
|
|
#define bpf_printk(fmt, ...) \
|
|
({ \
|
|
char ____fmt[] = fmt; \
|
|
bpf_trace_printk(____fmt, sizeof(____fmt), \
|
|
##__VA_ARGS__); \
|
|
})
|
|
#else
|
|
#define bpf_printk(fmt, ...)
|
|
#endif
|
|
|
|
#define INITIAL_CREDIT_PACKETS 100
|
|
#define MAX_BYTES_PER_PACKET 1500
|
|
#define MARK_THRESH (40 * MAX_BYTES_PER_PACKET)
|
|
#define DROP_THRESH (80 * 5 * MAX_BYTES_PER_PACKET)
|
|
#define LARGE_PKT_DROP_THRESH (DROP_THRESH - (15 * MAX_BYTES_PER_PACKET))
|
|
#define MARK_REGION_SIZE (LARGE_PKT_DROP_THRESH - MARK_THRESH)
|
|
#define LARGE_PKT_THRESH 120
|
|
#define MAX_CREDIT (100 * MAX_BYTES_PER_PACKET)
|
|
#define INIT_CREDIT (INITIAL_CREDIT_PACKETS * MAX_BYTES_PER_PACKET)
|
|
|
|
// rate in bytes per ns << 20
|
|
#define CREDIT_PER_NS(delta, rate) ((((u64)(delta)) * (rate)) >> 20)
|
|
|
|
struct bpf_map_def SEC("maps") queue_state = {
|
|
.type = BPF_MAP_TYPE_CGROUP_STORAGE,
|
|
.key_size = sizeof(struct bpf_cgroup_storage_key),
|
|
.value_size = sizeof(struct hbm_vqueue),
|
|
};
|
|
BPF_ANNOTATE_KV_PAIR(queue_state, struct bpf_cgroup_storage_key,
|
|
struct hbm_vqueue);
|
|
|
|
struct bpf_map_def SEC("maps") queue_stats = {
|
|
.type = BPF_MAP_TYPE_ARRAY,
|
|
.key_size = sizeof(u32),
|
|
.value_size = sizeof(struct hbm_queue_stats),
|
|
.max_entries = 1,
|
|
};
|
|
BPF_ANNOTATE_KV_PAIR(queue_stats, int, struct hbm_queue_stats);
|
|
|
|
struct hbm_pkt_info {
|
|
bool is_ip;
|
|
bool is_tcp;
|
|
short ecn;
|
|
};
|
|
|
|
static __always_inline void hbm_get_pkt_info(struct __sk_buff *skb,
|
|
struct hbm_pkt_info *pkti)
|
|
{
|
|
struct iphdr iph;
|
|
struct ipv6hdr *ip6h;
|
|
|
|
bpf_skb_load_bytes(skb, 0, &iph, 12);
|
|
if (iph.version == 6) {
|
|
ip6h = (struct ipv6hdr *)&iph;
|
|
pkti->is_ip = true;
|
|
pkti->is_tcp = (ip6h->nexthdr == 6);
|
|
pkti->ecn = (ip6h->flow_lbl[0] >> 4) & INET_ECN_MASK;
|
|
} else if (iph.version == 4) {
|
|
pkti->is_ip = true;
|
|
pkti->is_tcp = (iph.protocol == 6);
|
|
pkti->ecn = iph.tos & INET_ECN_MASK;
|
|
} else {
|
|
pkti->is_ip = false;
|
|
pkti->is_tcp = false;
|
|
pkti->ecn = 0;
|
|
}
|
|
}
|
|
|
|
static __always_inline void hbm_init_vqueue(struct hbm_vqueue *qdp, int rate)
|
|
{
|
|
bpf_printk("Initializing queue_state, rate:%d\n", rate * 128);
|
|
qdp->lasttime = bpf_ktime_get_ns();
|
|
qdp->credit = INIT_CREDIT;
|
|
qdp->rate = rate * 128;
|
|
}
|
|
|
|
static __always_inline void hbm_update_stats(struct hbm_queue_stats *qsp,
|
|
int len,
|
|
unsigned long long curtime,
|
|
bool congestion_flag,
|
|
bool drop_flag)
|
|
{
|
|
if (qsp != NULL) {
|
|
// Following is needed for work conserving
|
|
__sync_add_and_fetch(&(qsp->bytes_total), len);
|
|
if (qsp->stats) {
|
|
// Optionally update statistics
|
|
if (qsp->firstPacketTime == 0)
|
|
qsp->firstPacketTime = curtime;
|
|
qsp->lastPacketTime = curtime;
|
|
__sync_add_and_fetch(&(qsp->pkts_total), 1);
|
|
if (congestion_flag || drop_flag) {
|
|
__sync_add_and_fetch(&(qsp->pkts_marked), 1);
|
|
__sync_add_and_fetch(&(qsp->bytes_marked), len);
|
|
}
|
|
if (drop_flag) {
|
|
__sync_add_and_fetch(&(qsp->pkts_dropped), 1);
|
|
__sync_add_and_fetch(&(qsp->bytes_dropped),
|
|
len);
|
|
}
|
|
}
|
|
}
|
|
}
|