[ SYSTEM ]: Linux srv.persadacompanies.com 4.18.0-553.56.1.el8_10.x86_64 #1 SMP Tue Jun 10 05:00:59 EDT 2025 x86_64
[ SERVER ]: Apache | PHP: 8.4.19
[ USER ]: persadamedika | IP: 45.64.1.108
GEFORCE FILE MANAGER
/
usr
/
src
/
kernels
/
4.18.0-553.64.1.el8_10.x86_64
/
include
/
net
/
UPLOAD:
NAME
SIZE
QUICK PERMS
ACTIONS
📁 9p
SET
[ DEL ]
📁 bluetooth
SET
[ DEL ]
📁 caif
SET
[ DEL ]
📁 iucv
SET
[ DEL ]
📁 mana
SET
[ DEL ]
📁 netfilter
SET
[ DEL ]
📁 netns
SET
[ DEL ]
📁 nfc
SET
[ DEL ]
📁 phonet
SET
[ DEL ]
📁 sctp
SET
[ DEL ]
📁 tc_act
SET
[ DEL ]
📄 6lowpan.h
10,271 B
SET
[ EDIT ]
|
[ DEL ]
📄 Space.h
1,094 B
SET
[ EDIT ]
|
[ DEL ]
📄 act_api.h
9,478 B
SET
[ EDIT ]
|
[ DEL ]
📄 addrconf.h
13,826 B
SET
[ EDIT ]
|
[ DEL ]
📄 af_ieee802154.h
1,591 B
SET
[ EDIT ]
|
[ DEL ]
📄 af_rxrpc.h
2,976 B
SET
[ EDIT ]
|
[ DEL ]
📄 af_unix.h
2,272 B
SET
[ EDIT ]
|
[ DEL ]
📄 af_vsock.h
7,295 B
SET
[ EDIT ]
|
[ DEL ]
📄 ah.h
382 B
SET
[ EDIT ]
|
[ DEL ]
📄 arp.h
2,052 B
SET
[ EDIT ]
|
[ DEL ]
📄 atmclip.h
1,515 B
SET
[ EDIT ]
|
[ DEL ]
📄 ax25.h
14,999 B
SET
[ EDIT ]
|
[ DEL ]
📄 ax88796.h
1,488 B
SET
[ EDIT ]
|
[ DEL ]
📄 bareudp.h
333 B
SET
[ EDIT ]
|
[ DEL ]
📄 bond_3ad.h
9,629 B
SET
[ EDIT ]
|
[ DEL ]
📄 bond_alb.h
6,251 B
SET
[ EDIT ]
|
[ DEL ]
📄 bond_options.h
3,916 B
SET
[ EDIT ]
|
[ DEL ]
📄 bonding.h
20,225 B
SET
[ EDIT ]
|
[ DEL ]
📄 bpf_sk_storage.h
1,802 B
SET
[ EDIT ]
|
[ DEL ]
📄 busy_poll.h
4,973 B
SET
[ EDIT ]
|
[ DEL ]
📄 calipso.h
2,199 B
SET
[ EDIT ]
|
[ DEL ]
📄 cfg80211-wext.h
1,900 B
SET
[ EDIT ]
|
[ DEL ]
📄 cfg80211.h
325,844 B
SET
[ EDIT ]
|
[ DEL ]
📄 cfg802154.h
11,175 B
SET
[ EDIT ]
|
[ DEL ]
📄 checksum.h
4,850 B
SET
[ EDIT ]
|
[ DEL ]
📄 cipso_ipv4.h
8,399 B
SET
[ EDIT ]
|
[ DEL ]
📄 cls_cgroup.h
2,301 B
SET
[ EDIT ]
|
[ DEL ]
📄 codel.h
6,000 B
SET
[ EDIT ]
|
[ DEL ]
📄 codel_impl.h
8,500 B
SET
[ EDIT ]
|
[ DEL ]
📄 codel_qdisc.h
3,001 B
SET
[ EDIT ]
|
[ DEL ]
📄 compat.h
1,711 B
SET
[ EDIT ]
|
[ DEL ]
📄 datalink.h
619 B
SET
[ EDIT ]
|
[ DEL ]
📄 dcbevent.h
1,293 B
SET
[ EDIT ]
|
[ DEL ]
📄 dcbnl.h
5,267 B
SET
[ EDIT ]
|
[ DEL ]
📄 devlink.h
64,711 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn.h
7,046 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn_dev.h
5,488 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn_fib.h
4,077 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn_neigh.h
968 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn_nsp.h
5,966 B
SET
[ EDIT ]
|
[ DEL ]
📄 dn_route.h
4,500 B
SET
[ EDIT ]
|
[ DEL ]
📄 drop_monitor.h
901 B
SET
[ EDIT ]
|
[ DEL ]
📄 dropreason-core.h
12,063 B
SET
[ EDIT ]
|
[ DEL ]
📄 dsa.h
16,605 B
SET
[ EDIT ]
|
[ DEL ]
📄 dsfield.h
1,139 B
SET
[ EDIT ]
|
[ DEL ]
📄 dst.h
13,989 B
SET
[ EDIT ]
|
[ DEL ]
📄 dst_cache.h
2,596 B
SET
[ EDIT ]
|
[ DEL ]
📄 dst_metadata.h
5,521 B
SET
[ EDIT ]
|
[ DEL ]
📄 dst_ops.h
2,564 B
SET
[ EDIT ]
|
[ DEL ]
📄 erspan.h
8,527 B
SET
[ EDIT ]
|
[ DEL ]
📄 esp.h
1,190 B
SET
[ EDIT ]
|
[ DEL ]
📄 espintcp.h
966 B
SET
[ EDIT ]
|
[ DEL ]
📄 ethoc.h
537 B
SET
[ EDIT ]
|
[ DEL ]
📄 failover.h
1,178 B
SET
[ EDIT ]
|
[ DEL ]
📄 fib_notifier.h
1,476 B
SET
[ EDIT ]
|
[ DEL ]
📄 fib_rules.h
5,728 B
SET
[ EDIT ]
|
[ DEL ]
📄 firewire.h
636 B
SET
[ EDIT ]
|
[ DEL ]
📄 flow.h
6,353 B
SET
[ EDIT ]
|
[ DEL ]
📄 flow_dissector.h
11,284 B
SET
[ EDIT ]
|
[ DEL ]
📄 flow_offload.h
17,797 B
SET
[ EDIT ]
|
[ DEL ]
📄 fou.h
549 B
SET
[ EDIT ]
|
[ DEL ]
📄 fq.h
2,497 B
SET
[ EDIT ]
|
[ DEL ]
📄 fq_impl.h
8,144 B
SET
[ EDIT ]
|
[ DEL ]
📄 garp.h
2,678 B
SET
[ EDIT ]
|
[ DEL ]
📄 gen_stats.h
3,034 B
SET
[ EDIT ]
|
[ DEL ]
📄 genetlink.h
14,647 B
SET
[ EDIT ]
|
[ DEL ]
📄 geneve.h
1,898 B
SET
[ EDIT ]
|
[ DEL ]
📄 gre.h
3,377 B
SET
[ EDIT ]
|
[ DEL ]
📄 gro_cells.h
443 B
SET
[ EDIT ]
|
[ DEL ]
📄 gtp.h
633 B
SET
[ EDIT ]
|
[ DEL ]
📄 gue.h
3,311 B
SET
[ EDIT ]
|
[ DEL ]
📄 hwbm.h
937 B
SET
[ EDIT ]
|
[ DEL ]
📄 icmp.h
1,765 B
SET
[ EDIT ]
|
[ DEL ]
📄 ieee80211_radiotap.h
23,017 B
SET
[ EDIT ]
|
[ DEL ]
📄 ieee802154_netdev.h
9,358 B
SET
[ EDIT ]
|
[ DEL ]
📄 if_inet6.h
6,591 B
SET
[ EDIT ]
|
[ DEL ]
📄 ife.h
1,057 B
SET
[ EDIT ]
|
[ DEL ]
📄 ila.h
498 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet6_connection_sock.h
976 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet6_hashtables.h
3,746 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_common.h
2,614 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_connection_sock.h
11,981 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_ecn.h
8,071 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_frag.h
4,816 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_hashtables.h
13,847 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_sock.h
9,828 B
SET
[ EDIT ]
|
[ DEL ]
📄 inet_timewait_sock.h
3,926 B
SET
[ EDIT ]
|
[ DEL ]
📄 inetpeer.h
3,372 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip.h
21,221 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip6_checksum.h
2,981 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip6_fib.h
13,766 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip6_route.h
9,220 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip6_tunnel.h
5,096 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip_fib.h
14,290 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip_tunnels.h
14,697 B
SET
[ EDIT ]
|
[ DEL ]
📄 ip_vs.h
49,407 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipcomp.h
659 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipconfig.h
811 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipv6.h
32,741 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipv6_frag.h
3,321 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipv6_stubs.h
2,671 B
SET
[ EDIT ]
|
[ DEL ]
📄 ipx.h
4,386 B
SET
[ EDIT ]
|
[ DEL ]
📄 iw_handler.h
21,413 B
SET
[ EDIT ]
|
[ DEL ]
📄 kcm.h
5,083 B
SET
[ EDIT ]
|
[ DEL ]
📄 l3mdev.h
6,743 B
SET
[ EDIT ]
|
[ DEL ]
📄 lag.h
409 B
SET
[ EDIT ]
|
[ DEL ]
📄 lapb.h
4,869 B
SET
[ EDIT ]
|
[ DEL ]
📄 lib80211.h
4,017 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc.h
4,464 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_c_ac.h
9,537 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_c_ev.h
10,940 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_c_st.h
1,762 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_conn.h
4,155 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_if.h
2,210 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_pdu.h
14,783 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_s_ac.h
1,591 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_s_ev.h
2,255 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_s_st.h
947 B
SET
[ EDIT ]
|
[ DEL ]
📄 llc_sap.h
1,108 B
SET
[ EDIT ]
|
[ DEL ]
📄 lwtunnel.h
6,563 B
SET
[ EDIT ]
|
[ DEL ]
📄 mac80211.h
294,437 B
SET
[ EDIT ]
|
[ DEL ]
📄 mac802154.h
15,633 B
SET
[ EDIT ]
|
[ DEL ]
📄 mip6.h
1,617 B
SET
[ EDIT ]
|
[ DEL ]
📄 mld.h
2,870 B
SET
[ EDIT ]
|
[ DEL ]
📄 mpls.h
1,340 B
SET
[ EDIT ]
|
[ DEL ]
📄 mpls_iptunnel.h
827 B
SET
[ EDIT ]
|
[ DEL ]
📄 mptcp.h
6,242 B
SET
[ EDIT ]
|
[ DEL ]
📄 mrp.h
3,103 B
SET
[ EDIT ]
|
[ DEL ]
📄 ncsi.h
1,964 B
SET
[ EDIT ]
|
[ DEL ]
📄 ndisc.h
15,095 B
SET
[ EDIT ]
|
[ DEL ]
📄 neighbour.h
16,289 B
SET
[ EDIT ]
|
[ DEL ]
📄 net_failover.h
1,023 B
SET
[ EDIT ]
|
[ DEL ]
📄 net_namespace.h
14,177 B
SET
[ EDIT ]
|
[ DEL ]
📄 net_ratelimit.h
220 B
SET
[ EDIT ]
|
[ DEL ]
📄 netdev_queues.h
5,609 B
SET
[ EDIT ]
|
[ DEL ]
📄 netevent.h
1,044 B
SET
[ EDIT ]
|
[ DEL ]
📄 netlabel.h
21,236 B
SET
[ EDIT ]
|
[ DEL ]
📄 netlink.h
63,253 B
SET
[ EDIT ]
|
[ DEL ]
📄 netprio_cgroup.h
1,260 B
SET
[ EDIT ]
|
[ DEL ]
📄 netrom.h
7,896 B
SET
[ EDIT ]
|
[ DEL ]
📄 nexthop.h
865 B
SET
[ EDIT ]
|
[ DEL ]
📄 nl802154.h
12,385 B
SET
[ EDIT ]
|
[ DEL ]
📄 nsh.h
12,602 B
SET
[ EDIT ]
|
[ DEL ]
📄 p8022.h
447 B
SET
[ EDIT ]
|
[ DEL ]
📄 page_pool.h
6,985 B
SET
[ EDIT ]
|
[ DEL ]
📄 pie.h
3,684 B
SET
[ EDIT ]
|
[ DEL ]
📄 ping.h
3,197 B
SET
[ EDIT ]
|
[ DEL ]
📄 pkt_cls.h
26,178 B
SET
[ EDIT ]
|
[ DEL ]
📄 pkt_sched.h
6,543 B
SET
[ EDIT ]
|
[ DEL ]
📄 pptp.h
557 B
SET
[ EDIT ]
|
[ DEL ]
📄 protocol.h
4,320 B
SET
[ EDIT ]
|
[ DEL ]
📄 psample.h
1,083 B
SET
[ EDIT ]
|
[ DEL ]
📄 psnap.h
351 B
SET
[ EDIT ]
|
[ DEL ]
📄 raw.h
2,161 B
SET
[ EDIT ]
|
[ DEL ]
📄 rawv6.h
856 B
SET
[ EDIT ]
|
[ DEL ]
📄 red.h
11,600 B
SET
[ EDIT ]
|
[ DEL ]
📄 regulatory.h
10,961 B
SET
[ EDIT ]
|
[ DEL ]
📄 request_sock.h
6,871 B
SET
[ EDIT ]
|
[ DEL ]
📄 rose.h
7,802 B
SET
[ EDIT ]
|
[ DEL ]
📄 route.h
11,327 B
SET
[ EDIT ]
|
[ DEL ]
📄 rsi_91x.h
1,710 B
SET
[ EDIT ]
|
[ DEL ]
📄 rtnetlink.h
7,212 B
SET
[ EDIT ]
|
[ DEL ]
📄 sch_generic.h
33,841 B
SET
[ EDIT ]
|
[ DEL ]
📄 scm.h
3,671 B
SET
[ EDIT ]
|
[ DEL ]
📄 secure_seq.h
855 B
SET
[ EDIT ]
|
[ DEL ]
📄 seg6.h
1,874 B
SET
[ EDIT ]
|
[ DEL ]
📄 seg6_hmac.h
1,699 B
SET
[ EDIT ]
|
[ DEL ]
📄 seg6_local.h
870 B
SET
[ EDIT ]
|
[ DEL ]
📄 slhc_vj.h
6,831 B
SET
[ EDIT ]
|
[ DEL ]
📄 smc.h
2,155 B
SET
[ EDIT ]
|
[ DEL ]
📄 snmp.h
5,482 B
SET
[ EDIT ]
|
[ DEL ]
📄 sock.h
79,182 B
SET
[ EDIT ]
|
[ DEL ]
📄 sock_reuseport.h
1,565 B
SET
[ EDIT ]
|
[ DEL ]
📄 stp.h
383 B
SET
[ EDIT ]
|
[ DEL ]
📄 strparser.h
4,340 B
SET
[ EDIT ]
|
[ DEL ]
📄 switchdev.h
17,812 B
SET
[ EDIT ]
|
[ DEL ]
📄 tc_wrapper.h
7,033 B
SET
[ EDIT ]
|
[ DEL ]
📄 tcp.h
73,125 B
SET
[ EDIT ]
|
[ DEL ]
📄 tcp_states.h
1,540 B
SET
[ EDIT ]
|
[ DEL ]
📄 timewait_sock.h
1,136 B
SET
[ EDIT ]
|
[ DEL ]
📄 tipc.h
2,405 B
SET
[ EDIT ]
|
[ DEL ]
📄 tls.h
21,363 B
SET
[ EDIT ]
|
[ DEL ]
📄 tls_toe.h
3,006 B
SET
[ EDIT ]
|
[ DEL ]
📄 transp_v6.h
1,996 B
SET
[ EDIT ]
|
[ DEL ]
📄 tso.h
515 B
SET
[ EDIT ]
|
[ DEL ]
📄 tun_proto.h
988 B
SET
[ EDIT ]
|
[ DEL ]
📄 udp.h
16,481 B
SET
[ EDIT ]
|
[ DEL ]
📄 udp_tunnel.h
13,376 B
SET
[ EDIT ]
|
[ DEL ]
📄 udplite.h
3,762 B
SET
[ EDIT ]
|
[ DEL ]
📄 vsock_addr.h
662 B
SET
[ EDIT ]
|
[ DEL ]
📄 vxlan.h
13,541 B
SET
[ EDIT ]
|
[ DEL ]
📄 wext.h
1,510 B
SET
[ EDIT ]
|
[ DEL ]
📄 wimax.h
20,445 B
SET
[ EDIT ]
|
[ DEL ]
📄 x25.h
9,658 B
SET
[ EDIT ]
|
[ DEL ]
📄 x25device.h
387 B
SET
[ EDIT ]
|
[ DEL ]
📄 xdp.h
9,436 B
SET
[ EDIT ]
|
[ DEL ]
📄 xdp_priv.h
446 B
SET
[ EDIT ]
|
[ DEL ]
📄 xdp_sock.h
2,094 B
SET
[ EDIT ]
|
[ DEL ]
📄 xdp_sock_drv.h
6,423 B
SET
[ EDIT ]
|
[ DEL ]
📄 xfrm.h
59,628 B
SET
[ EDIT ]
|
[ DEL ]
📄 xsk_buff_pool.h
6,550 B
SET
[ EDIT ]
|
[ DEL ]
DELETE SELECTED
[ CLOSE ]
EDIT: red.h
/* 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 */ }; 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