FM / net

/usr/src/linux-headers-5.15.0-181/include/net/

/usr/src/linux-headers-5.15.0-181/include/net

Name	Size	Mode	Actions
9p/	-	0755	rm
bluetooth/	-	0755	rm
caif/	-	0755	rm
iucv/	-	0755	rm
netfilter/	-	0755	rm
netns/	-	0755	rm
nfc/	-	0755	rm
phonet/	-	0755	rm
sctp/	-	0755	rm
tc_act/	-	0755	rm
6lowpan.h	10270	0644	edit dl rm
act_api.h	8647	0644	edit dl rm
addrconf.h	14594	0644	edit dl rm
af_ieee802154.h	1220	0644	edit dl rm
af_rxrpc.h	2798	0644	edit dl rm
af_unix.h	3375	0644	edit dl rm
af_vsock.h	7592	0644	edit dl rm
ah.h	382	0644	edit dl rm
arp.h	2141	0644	edit dl rm
atmclip.h	1515	0644	edit dl rm
ax25.h	15443	0644	edit dl rm
ax88796.h	1440	0644	edit dl rm
bareudp.h	572	0644	edit dl rm
bonding.h	20263	0644	edit dl rm
bond_3ad.h	9706	0644	edit dl rm
bond_alb.h	6251	0644	edit dl rm
bond_options.h	3876	0644	edit dl rm
bpf_sk_storage.h	1780	0644	edit dl rm
busy_poll.h	3959	0644	edit dl rm
calipso.h	1590	0644	edit dl rm
cfg80211-wext.h	1854	0644	edit dl rm
cfg80211.h	301317	0644	edit dl rm
cfg802154.h	10779	0644	edit dl rm
checksum.h	4869	0644	edit dl rm
cipso_ipv4.h	7548	0644	edit dl rm
cls_cgroup.h	2086	0644	edit dl rm
codel.h	5782	0644	edit dl rm
codel_impl.h	8167	0644	edit dl rm
codel_qdisc.h	2973	0644	edit dl rm
compat.h	2586	0644	edit dl rm
datalink.h	619	0644	edit dl rm
dcbevent.h	742	0644	edit dl rm
dcbnl.h	4317	0644	edit dl rm
devlink.h	63593	0644	edit dl rm
dsa.h	36231	0644	edit dl rm
dsfield.h	1147	0644	edit dl rm
dst.h	15153	0644	edit dl rm
dst_cache.h	3031	0644	edit dl rm
dst_metadata.h	5521	0644	edit dl rm
dst_ops.h	2125	0644	edit dl rm
erspan.h	9180	0644	edit dl rm
esp.h	1190	0644	edit dl rm
espintcp.h	966	0644	edit dl rm
ethoc.h	391	0644	edit dl rm
failover.h	1178	0644	edit dl rm
fib_notifier.h	1384	0644	edit dl rm
fib_rules.h	6450	0644	edit dl rm
firewire.h	636	0644	edit dl rm
flow.h	5119	0644	edit dl rm
flow_dissector.h	10517	0644	edit dl rm
flow_offload.h	15938	0644	edit dl rm
fou.h	549	0644	edit dl rm
fq.h	2528	0644	edit dl rm
fq_impl.h	8076	0644	edit dl rm
garp.h	2678	0644	edit dl rm
genetlink.h	13854	0644	edit dl rm
geneve.h	1898	0644	edit dl rm
gen_stats.h	2889	0644	edit dl rm
gre.h	3369	0644	edit dl rm
gro.h	783	0644	edit dl rm
gro_cells.h	443	0644	edit dl rm
gtp.h	633	0644	edit dl rm
gue.h	3313	0644	edit dl rm
hwbm.h	969	0644	edit dl rm
icmp.h	1918	0644	edit dl rm
ieee80211_radiotap.h	13518	0644	edit dl rm
ieee802154_netdev.h	10095	0644	edit dl rm
ife.h	1057	0644	edit dl rm
if_inet6.h	6692	0644	edit dl rm
ila.h	291	0644	edit dl rm
inet6_connection_sock.h	765	0644	edit dl rm
inet6_hashtables.h	4259	0644	edit dl rm
inetpeer.h	3372	0644	edit dl rm
inet_common.h	2614	0644	edit dl rm
inet_connection_sock.h	11519	0644	edit dl rm
inet_ecn.h	7625	0644	edit dl rm
inet_frag.h	5046	0644	edit dl rm
inet_hashtables.h	12532	0644	edit dl rm
inet_sock.h	9994	0644	edit dl rm
inet_timewait_sock.h	3735	0644	edit dl rm
ioam6.h	1199	0644	edit dl rm
ip.h	22759	0644	edit dl rm
ip6_checksum.h	2770	0644	edit dl rm
ip6_fib.h	16280	0644	edit dl rm
ip6_route.h	10230	0644	edit dl rm
ip6_tunnel.h	5096	0644	edit dl rm
ipcomp.h	659	0644	edit dl rm
ipconfig.h	811	0644	edit dl rm
ipv6.h	36182	0644	edit dl rm
ipv6_frag.h	3361	0644	edit dl rm
ipv6_stubs.h	3482	0644	edit dl rm
ip_fib.h	16346	0644	edit dl rm
ip_tunnels.h	15949	0644	edit dl rm
ip_vs.h	50588	0644	edit dl rm
iw_handler.h	21413	0644	edit dl rm
kcm.h	4961	0644	edit dl rm
l3mdev.h	7202	0644	edit dl rm
lag.h	409	0644	edit dl rm
lapb.h	4938	0644	edit dl rm
lib80211.h	4017	0644	edit dl rm
llc.h	4514	0644	edit dl rm
llc_conn.h	4155	0644	edit dl rm
llc_c_ac.h	9537	0644	edit dl rm
llc_c_ev.h	10940	0644	edit dl rm
llc_c_st.h	1762	0644	edit dl rm
llc_if.h	2210	0644	edit dl rm
llc_pdu.h	14697	0644	edit dl rm
llc_sap.h	1108	0644	edit dl rm
llc_s_ac.h	1591	0644	edit dl rm
llc_s_ev.h	2255	0644	edit dl rm
llc_s_st.h	947	0644	edit dl rm
lwtunnel.h	6806	0644	edit dl rm
mac80211.h	273972	0644	edit dl rm
mac802154.h	15235	0644	edit dl rm
macsec.h	7084	0644	edit dl rm
mctp.h	6155	0644	edit dl rm
mctpdevice.h	841	0644	edit dl rm
mip6.h	1016	0644	edit dl rm
mld.h	2918	0644	edit dl rm
mpls.h	943	0644	edit dl rm
mpls_iptunnel.h	429	0644	edit dl rm
mptcp.h	6776	0644	edit dl rm
mrp.h	3119	0644	edit dl rm
ncsi.h	1964	0644	edit dl rm
ndisc.h	15150	0644	edit dl rm
neighbour.h	16099	0644	edit dl rm
netevent.h	1044	0644	edit dl rm
netlabel.h	20676	0644	edit dl rm
netlink.h	61656	0644	edit dl rm
netprio_cgroup.h	1047	0644	edit dl rm
netrom.h	7895	0644	edit dl rm
net_failover.h	1023	0644	edit dl rm
net_namespace.h	12795	0644	edit dl rm
net_ratelimit.h	220	0644	edit dl rm
nexthop.h	12565	0644	edit dl rm
nl802154.h	12384	0644	edit dl rm
nsh.h	12602	0644	edit dl rm
p8022.h	447	0644	edit dl rm
page_pool.h	8646	0644	edit dl rm
pie.h	3684	0644	edit dl rm
ping.h	2970	0644	edit dl rm
pkt_cls.h	24431	0644	edit dl rm
pkt_sched.h	6042	0644	edit dl rm
pptp.h	557	0644	edit dl rm
protocol.h	3900	0644	edit dl rm
psample.h	1083	0644	edit dl rm
psnap.h	351	0644	edit dl rm
raw.h	2136	0644	edit dl rm
rawv6.h	854	0644	edit dl rm
red.h	11654	0644	edit dl rm
regulatory.h	10901	0644	edit dl rm
request_sock.h	6660	0644	edit dl rm
rose.h	7802	0644	edit dl rm
route.h	11582	0644	edit dl rm
rpl.h	839	0644	edit dl rm
rsi_91x.h	1710	0644	edit dl rm
rtnetlink.h	7638	0644	edit dl rm
rtnh.h	859	0644	edit dl rm
sch_generic.h	34720	0644	edit dl rm
scm.h	3877	0644	edit dl rm
secure_seq.h	855	0644	edit dl rm
seg6.h	2237	0644	edit dl rm
seg6_hmac.h	1473	0644	edit dl rm
seg6_local.h	644	0644	edit dl rm
selftests.h	582	0644	edit dl rm
slhc_vj.h	6831	0644	edit dl rm
smc.h	2513	0644	edit dl rm
snmp.h	5268	0644	edit dl rm
sock.h	86351	0644	edit dl rm
sock_reuseport.h	1873	0644	edit dl rm
Space.h	737	0644	edit dl rm
stp.h	383	0644	edit dl rm
strparser.h	4250	0644	edit dl rm
switchdev.h	14614	0644	edit dl rm
tcp.h	75246	0644	edit dl rm
tcp_states.h	1225	0644	edit dl rm
timewait_sock.h	925	0644	edit dl rm
tipc.h	2405	0644	edit dl rm
tls.h	21465	0644	edit dl rm
tls_toe.h	3006	0644	edit dl rm
transp_v6.h	1996	0644	edit dl rm
tso.h	566	0644	edit dl rm
tun_proto.h	988	0644	edit dl rm
udp.h	17035	0644	edit dl rm
udplite.h	3762	0644	edit dl rm
udp_tunnel.h	12201	0644	edit dl rm
vsock_addr.h	662	0644	edit dl rm
vxlan.h	14424	0644	edit dl rm
wext.h	1510	0644	edit dl rm
x25.h	9718	0644	edit dl rm
x25device.h	387	0644	edit dl rm
xdp.h	8829	0644	edit dl rm
xdp_priv.h	446	0644	edit dl rm
xdp_sock.h	2094	0644	edit dl rm
xdp_sock_drv.h	5607	0644	edit dl rm
xfrm.h	56304	0644	edit dl rm
xsk_buff_pool.h	5138	0644	edit dl rm

Edit: /usr/src/linux-headers-5.15.0-181/include/net/red.h (11654B)

/* SPDX-License-Identifier: GPL-2.0 */
#ifndef __NET_SCHED_RED_H
#define __NET_SCHED_RED_H

#include <linux/types.h>
#include <linux/bug.h>
#include <net/pkt_sched.h>
#include <net/inet_ecn.h>
#include <net/dsfield.h>
#include <linux/reciprocal_div.h>

/*	Random Early Detection (RED) algorithm.
	=======================================

Source: Sally Floyd and Van Jacobson, "Random Early Detection Gateways
	for Congestion Avoidance", 1993, IEEE/ACM Transactions on Networking.

This file codes a "divisionless" version of RED algorithm
	as written down in Fig.17 of the paper.

Short description.
	------------------

When a new packet arrives we calculate the average queue length:

avg = (1-W)*avg + W*current_queue_len,

W is the filter time constant (chosen as 2^(-Wlog)), it controls
	the inertia of the algorithm. To allow larger bursts, W should be
	decreased.

if (avg > th_max) -> packet marked (dropped).
	if (avg < th_min) -> packet passes.
	if (th_min < avg < th_max) we calculate probability:

Pb = max_P * (avg - th_min)/(th_max-th_min)

and mark (drop) packet with this probability.
	Pb changes from 0 (at avg==th_min) to max_P (avg==th_max).
	max_P should be small (not 1), usually 0.01..0.02 is good value.

max_P is chosen as a number, so that max_P/(th_max-th_min)
	is a negative power of two in order arithmetics to contain
	only shifts.

Parameters, settable by user:
	-----------------------------

qth_min		- bytes (should be < qth_max/2)
	qth_max		- bytes (should be at least 2*qth_min and less limit)
	Wlog	       	- bits (<32) log(1/W).
	Plog	       	- bits (<32)

Plog is related to max_P by formula:

max_P = (qth_max-qth_min)/2^Plog;

F.e. if qth_max=128K and qth_min=32K, then Plog=22
	corresponds to max_P=0.02

Scell_log
	Stab

Lookup table for log((1-W)^(t/t_ave).

NOTES:

Upper bound on W.
	-----------------

If you want to allow bursts of L packets of size S,
	you should choose W:

L + 1 - th_min/S < (1-(1-W)^L)/W

th_min/S = 32         th_min/S = 4

log(W)	L
	-1	33
	-2	35
	-3	39
	-4	46
	-5	57
	-6	75
	-7	101
	-8	135
	-9	190
	etc.
 */

/*
 * Adaptative RED : An Algorithm for Increasing the Robustness of RED's AQM
 * (Sally FLoyd, Ramakrishna Gummadi, and Scott Shenker) August 2001
 *
 * Every 500 ms:
 *  if (avg > target and max_p <= 0.5)
 *   increase max_p : max_p += alpha;
 *  else if (avg < target and max_p >= 0.01)
 *   decrease max_p : max_p *= beta;
 *
 * target :[qth_min + 0.4*(qth_min - qth_max),
 *          qth_min + 0.6*(qth_min - qth_max)].
 * alpha : min(0.01, max_p / 4)
 * beta : 0.9
 * max_P is a Q0.32 fixed point number (with 32 bits mantissa)
 * max_P between 0.01 and 0.5 (1% - 50%) [ Its no longer a negative power of two ]
 */
#define RED_ONE_PERCENT ((u32)DIV_ROUND_CLOSEST(1ULL<<32, 100))

#define MAX_P_MIN (1 * RED_ONE_PERCENT)
#define MAX_P_MAX (50 * RED_ONE_PERCENT)
#define MAX_P_ALPHA(val) min(MAX_P_MIN, val / 4)

#define RED_STAB_SIZE	256
#define RED_STAB_MASK	(RED_STAB_SIZE - 1)

struct red_stats {
	u32		prob_drop;	/* Early probability drops */
	u32		prob_mark;	/* Early probability marks */
	u32		forced_drop;	/* Forced drops, qavg > max_thresh */
	u32		forced_mark;	/* Forced marks, qavg > max_thresh */
	u32		pdrop;          /* Drops due to queue limits */
	u32		other;          /* Drops due to drop() calls */
};

struct red_parms {
	/* Parameters */
	u32		qth_min;	/* Min avg length threshold: Wlog scaled */
	u32		qth_max;	/* Max avg length threshold: Wlog scaled */
	u32		Scell_max;
	u32		max_P;		/* probability, [0 .. 1.0] 32 scaled */
	/* reciprocal_value(max_P / qth_delta) */
	struct reciprocal_value	max_P_reciprocal;
	u32		qth_delta;	/* max_th - min_th */
	u32		target_min;	/* min_th + 0.4*(max_th - min_th) */
	u32		target_max;	/* min_th + 0.6*(max_th - min_th) */
	u8		Scell_log;
	u8		Wlog;		/* log(W)		*/
	u8		Plog;		/* random number bits	*/
	u8		Stab[RED_STAB_SIZE];
};

struct red_vars {
	/* Variables */
	int		qcount;		/* Number of packets since last random
					   number generation */
	u32		qR;		/* Cached random number */

unsigned long	qavg;		/* Average queue length: Wlog scaled */
	ktime_t		qidlestart;	/* Start of current idle period */
};

static inline u32 red_maxp(u8 Plog)
{
	return Plog < 32 ? (~0U >> Plog) : ~0U;
}

static inline void red_set_vars(struct red_vars *v)
{
	/* Reset average queue length, the value is strictly bound
	 * to the parameters below, reseting hurts a bit but leaving
	 * it might result in an unreasonable qavg for a while. --TGR
	 */
	v->qavg		= 0;

v->qcount	= -1;
}

static inline bool red_check_params(u32 qth_min, u32 qth_max, u8 Wlog,
				    u8 Scell_log, u8 *stab)
{
	if (fls(qth_min) + Wlog >= 32)
		return false;
	if (fls(qth_max) + Wlog >= 32)
		return false;
	if (Scell_log >= 32)
		return false;
	if (qth_max < qth_min)
		return false;
	if (stab) {
		int i;

for (i = 0; i < RED_STAB_SIZE; i++)
			if (stab[i] >= 32)
				return false;
	}
	return true;
}

static inline int red_get_flags(unsigned char qopt_flags,
				unsigned char historic_mask,
				struct nlattr *flags_attr,
				unsigned char supported_mask,
				struct nla_bitfield32 *p_flags,
				unsigned char *p_userbits,
				struct netlink_ext_ack *extack)
{
	struct nla_bitfield32 flags;

if (qopt_flags && flags_attr) {
		NL_SET_ERR_MSG_MOD(extack, "flags should be passed either through qopt, or through a dedicated attribute");
		return -EINVAL;
	}

if (flags_attr) {
		flags = nla_get_bitfield32(flags_attr);
	} else {
		flags.selector = historic_mask;
		flags.value = qopt_flags & historic_mask;
	}

*p_flags = flags;
	*p_userbits = qopt_flags & ~historic_mask;
	return 0;
}

static inline int red_validate_flags(unsigned char flags,
				     struct netlink_ext_ack *extack)
{
	if ((flags & TC_RED_NODROP) && !(flags & TC_RED_ECN)) {
		NL_SET_ERR_MSG_MOD(extack, "nodrop mode is only meaningful with ECN");
		return -EINVAL;
	}

return 0;
}

static inline void red_set_parms(struct red_parms *p,
				 u32 qth_min, u32 qth_max, u8 Wlog, u8 Plog,
				 u8 Scell_log, u8 *stab, u32 max_P)
{
	int delta = qth_max - qth_min;
	u32 max_p_delta;

p->qth_min	= qth_min << Wlog;
	p->qth_max	= qth_max << Wlog;
	p->Wlog		= Wlog;
	p->Plog		= Plog;
	if (delta <= 0)
		delta = 1;
	p->qth_delta	= delta;
	if (!max_P) {
		max_P = red_maxp(Plog);
		max_P *= delta; /* max_P = (qth_max - qth_min)/2^Plog */
	}
	p->max_P = max_P;
	max_p_delta = max_P / delta;
	max_p_delta = max(max_p_delta, 1U);
	p->max_P_reciprocal  = reciprocal_value(max_p_delta);

/* RED Adaptative target :
	 * [min_th + 0.4*(min_th - max_th),
	 *  min_th + 0.6*(min_th - max_th)].
	 */
	delta /= 5;
	p->target_min = qth_min + 2*delta;
	p->target_max = qth_min + 3*delta;

p->Scell_log	= Scell_log;
	p->Scell_max	= (255 << Scell_log);

if (stab)
		memcpy(p->Stab, stab, sizeof(p->Stab));
}

static inline int red_is_idling(const struct red_vars *v)
{
	return v->qidlestart != 0;
}

static inline void red_start_of_idle_period(struct red_vars *v)
{
	v->qidlestart = ktime_get();
}

static inline void red_end_of_idle_period(struct red_vars *v)
{
	v->qidlestart = 0;
}

static inline void red_restart(struct red_vars *v)
{
	red_end_of_idle_period(v);
	v->qavg = 0;
	v->qcount = -1;
}

static inline unsigned long red_calc_qavg_from_idle_time(const struct red_parms *p,
							 const struct red_vars *v)
{
	s64 delta = ktime_us_delta(ktime_get(), v->qidlestart);
	long us_idle = min_t(s64, delta, p->Scell_max);
	int  shift;

/*
	 * The problem: ideally, average length queue recalculation should
	 * be done over constant clock intervals. This is too expensive, so
	 * that the calculation is driven by outgoing packets.
	 * When the queue is idle we have to model this clock by hand.
	 *
	 * SF+VJ proposed to "generate":
	 *
	 *	m = idletime / (average_pkt_size / bandwidth)
	 *
	 * dummy packets as a burst after idle time, i.e.
	 *
	 * 	v->qavg *= (1-W)^m
	 *
	 * This is an apparently overcomplicated solution (f.e. we have to
	 * precompute a table to make this calculation in reasonable time)
	 * I believe that a simpler model may be used here,
	 * but it is field for experiments.
	 */

shift = p->Stab[(us_idle >> p->Scell_log) & RED_STAB_MASK];

if (shift)
		return v->qavg >> shift;
	else {
		/* Approximate initial part of exponent with linear function:
		 *
		 * 	(1-W)^m ~= 1-mW + ...
		 *
		 * Seems, it is the best solution to
		 * problem of too coarse exponent tabulation.
		 */
		us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log;

if (us_idle < (v->qavg >> 1))
			return v->qavg - us_idle;
		else
			return v->qavg >> 1;
	}
}

static inline unsigned long red_calc_qavg_no_idle_time(const struct red_parms *p,
						       const struct red_vars *v,
						       unsigned int backlog)
{
	/*
	 * NOTE: v->qavg is fixed point number with point at Wlog.
	 * The formula below is equvalent to floating point
	 * version:
	 *
	 * 	qavg = qavg*(1-W) + backlog*W;
	 *
	 * --ANK (980924)
	 */
	return v->qavg + (backlog - (v->qavg >> p->Wlog));
}

static inline unsigned long red_calc_qavg(const struct red_parms *p,
					  const struct red_vars *v,
					  unsigned int backlog)
{
	if (!red_is_idling(v))
		return red_calc_qavg_no_idle_time(p, v, backlog);
	else
		return red_calc_qavg_from_idle_time(p, v);
}

static inline u32 red_random(const struct red_parms *p)
{
	return reciprocal_divide(prandom_u32(), p->max_P_reciprocal);
}

static inline int red_mark_probability(const struct red_parms *p,
				       const struct red_vars *v,
				       unsigned long qavg)
{
	/* The formula used below causes questions.

OK. qR is random number in the interval
		(0..1/max_P)*(qth_max-qth_min)
	   i.e. 0..(2^Plog). If we used floating point
	   arithmetics, it would be: (2^Plog)*rnd_num,
	   where rnd_num is less 1.

Taking into account, that qavg have fixed
	   point at Wlog, two lines
	   below have the following floating point equivalent:

max_P*(qavg - qth_min)/(qth_max-qth_min) < rnd/qcount

Any questions? --ANK (980924)
	 */
	return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR);
}

enum {
	RED_BELOW_MIN_THRESH,
	RED_BETWEEN_TRESH,
	RED_ABOVE_MAX_TRESH,
};

static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg)
{
	if (qavg < p->qth_min)
		return RED_BELOW_MIN_THRESH;
	else if (qavg >= p->qth_max)
		return RED_ABOVE_MAX_TRESH;
	else
		return RED_BETWEEN_TRESH;
}

enum {
	RED_DONT_MARK,
	RED_PROB_MARK,
	RED_HARD_MARK,
};

static inline int red_action(const struct red_parms *p,
			     struct red_vars *v,
			     unsigned long qavg)
{
	switch (red_cmp_thresh(p, qavg)) {
		case RED_BELOW_MIN_THRESH:
			v->qcount = -1;
			return RED_DONT_MARK;

case RED_BETWEEN_TRESH:
			if (++v->qcount) {
				if (red_mark_probability(p, v, qavg)) {
					v->qcount = 0;
					v->qR = red_random(p);
					return RED_PROB_MARK;
				}
			} else
				v->qR = red_random(p);

return RED_DONT_MARK;

case RED_ABOVE_MAX_TRESH:
			v->qcount = -1;
			return RED_HARD_MARK;
	}

BUG();
	return RED_DONT_MARK;
}

static inline void red_adaptative_algo(struct red_parms *p, struct red_vars *v)
{
	unsigned long qavg;
	u32 max_p_delta;

qavg = v->qavg;
	if (red_is_idling(v))
		qavg = red_calc_qavg_from_idle_time(p, v);

/* v->qavg is fixed point number with point at Wlog */
	qavg >>= p->Wlog;

if (qavg > p->target_max && p->max_P <= MAX_P_MAX)
		p->max_P += MAX_P_ALPHA(p->max_P); /* maxp = maxp + alpha */
	else if (qavg < p->target_min && p->max_P >= MAX_P_MIN)
		p->max_P = (p->max_P/10)*9; /* maxp = maxp * Beta */

max_p_delta = DIV_ROUND_CLOSEST(p->max_P, p->qth_delta);
	max_p_delta = max(max_p_delta, 1U);
	p->max_P_reciprocal = reciprocal_value(max_p_delta);
}
#endif

cmd: