Gecko [ v99win.today ]

Name	Size	Permission
9p	[ DIR ]	drwxr-xr-x
bluetooth	[ DIR ]	drwxr-xr-x
caif	[ DIR ]	drwxr-xr-x
iucv	[ DIR ]	drwxr-xr-x
netfilter	[ DIR ]	drwxr-xr-x
netns	[ DIR ]	drwxr-xr-x
nfc	[ DIR ]	drwxr-xr-x
phonet	[ DIR ]	drwxr-xr-x
sctp	[ DIR ]	drwxr-xr-x
tc_act	[ DIR ]	drwxr-xr-x
6lowpan.h	10.03 KB	-rw-r--r--
Space.h	737 B	-rw-r--r--
act_api.h	8.42 KB	-rw-r--r--
addrconf.h	13.95 KB	-rw-r--r--
af_ieee802154.h	1.19 KB	-rw-r--r--
af_rxrpc.h	2.73 KB	-rw-r--r--
af_unix.h	2.92 KB	-rw-r--r--
af_vsock.h	7.37 KB	-rw-r--r--
ah.h	382 B	-rw-r--r--
arp.h	2.03 KB	-rw-r--r--
atmclip.h	1.48 KB	-rw-r--r--
ax25.h	14.84 KB	-rw-r--r--
ax88796.h	1.41 KB	-rw-r--r--
bareudp.h	572 B	-rw-r--r--
bond_3ad.h	9.49 KB	-rw-r--r--
bond_alb.h	6.09 KB	-rw-r--r--
bond_options.h	3.76 KB	-rw-r--r--
bonding.h	20.18 KB	-rw-r--r--
bpf_sk_storage.h	1.74 KB	-rw-r--r--
busy_poll.h	3.85 KB	-rw-r--r--
calipso.h	1.55 KB	-rw-r--r--
cfg80211-wext.h	1.81 KB	-rw-r--r--
cfg80211.h	291.42 KB	-rw-r--r--
cfg802154.h	10.5 KB	-rw-r--r--
checksum.h	4.74 KB	-rw-r--r--
cipso_ipv4.h	7.37 KB	-rw-r--r--
cls_cgroup.h	2.04 KB	-rw-r--r--
codel.h	5.65 KB	-rw-r--r--
codel_impl.h	7.98 KB	-rw-r--r--
codel_qdisc.h	2.9 KB	-rw-r--r--
compat.h	2.53 KB	-rw-r--r--
datalink.h	619 B	-rw-r--r--
dcbevent.h	742 B	-rw-r--r--
dcbnl.h	4.22 KB	-rw-r--r--
devlink.h	62.1 KB	-rw-r--r--
dn.h	6.88 KB	-rw-r--r--
dn_dev.h	5.36 KB	-rw-r--r--
dn_fib.h	3.99 KB	-rw-r--r--
dn_neigh.h	968 B	-rw-r--r--
dn_nsp.h	5.39 KB	-rw-r--r--
dn_route.h	3.96 KB	-rw-r--r--
dsa.h	34.12 KB	-rw-r--r--
dsfield.h	1.12 KB	-rw-r--r--
dst.h	14.46 KB	-rw-r--r--
dst_cache.h	2.96 KB	-rw-r--r--
dst_metadata.h	5.39 KB	-rw-r--r--
dst_ops.h	2.07 KB	-rw-r--r--
erspan.h	8.96 KB	-rw-r--r--
esp.h	1.23 KB	-rw-r--r--
espintcp.h	966 B	-rw-r--r--
ethoc.h	391 B	-rw-r--r--
failover.h	1.15 KB	-rw-r--r--
fib_notifier.h	1.35 KB	-rw-r--r--
fib_rules.h	6.3 KB	-rw-r--r--
firewire.h	636 B	-rw-r--r--
flow.h	5.53 KB	-rw-r--r--
flow_dissector.h	9.89 KB	-rw-r--r--
flow_offload.h	15.34 KB	-rw-r--r--
fou.h	549 B	-rw-r--r--
fq.h	2.47 KB	-rw-r--r--
fq_impl.h	7.89 KB	-rw-r--r--
garp.h	2.62 KB	-rw-r--r--
gen_stats.h	2.82 KB	-rw-r--r--
genetlink.h	13.32 KB	-rw-r--r--
geneve.h	1.85 KB	-rw-r--r--
gre.h	3.29 KB	-rw-r--r--
gro.h	783 B	-rw-r--r--
gro_cells.h	443 B	-rw-r--r--
gtp.h	633 B	-rw-r--r--
gue.h	3.24 KB	-rw-r--r--
hwbm.h	969 B	-rw-r--r--
icmp.h	1.87 KB	-rw-r--r--
ieee80211_radiotap.h	13.2 KB	-rw-r--r--
ieee802154_netdev.h	8.75 KB	-rw-r--r--
if_inet6.h	6.3 KB	-rw-r--r--
ife.h	1.03 KB	-rw-r--r--
ila.h	291 B	-rw-r--r--
inet6_connection_sock.h	765 B	-rw-r--r--
inet6_hashtables.h	3.44 KB	-rw-r--r--
inet_common.h	2.55 KB	-rw-r--r--
inet_connection_sock.h	11.06 KB	-rw-r--r--
inet_ecn.h	7.45 KB	-rw-r--r--
inet_frag.h	4.93 KB	-rw-r--r--
inet_hashtables.h	13.99 KB	-rw-r--r--
inet_sock.h	9.25 KB	-rw-r--r--
inet_timewait_sock.h	3.65 KB	-rw-r--r--
inetpeer.h	3.29 KB	-rw-r--r--
ioam6.h	1.17 KB	-rw-r--r--
ip.h	22.08 KB	-rw-r--r--
ip6_checksum.h	2.71 KB	-rw-r--r--
ip6_fib.h	15.82 KB	-rw-r--r--
ip6_route.h	9.99 KB	-rw-r--r--
ip6_tunnel.h	4.97 KB	-rw-r--r--
ip_fib.h	15.86 KB	-rw-r--r--
ip_tunnels.h	14.14 KB	-rw-r--r--
ip_vs.h	49.38 KB	-rw-r--r--
ipcomp.h	659 B	-rw-r--r--
ipconfig.h	811 B	-rw-r--r--
ipv6.h	35.34 KB	-rw-r--r--
ipv6_frag.h	3.28 KB	-rw-r--r--
ipv6_stubs.h	3.23 KB	-rw-r--r--
iw_handler.h	20.91 KB	-rw-r--r--
kcm.h	4.82 KB	-rw-r--r--
l3mdev.h	6.99 KB	-rw-r--r--
lag.h	409 B	-rw-r--r--
lapb.h	4.81 KB	-rw-r--r--
lib80211.h	3.92 KB	-rw-r--r--
llc.h	4.41 KB	-rw-r--r--
llc_c_ac.h	9.31 KB	-rw-r--r--
llc_c_ev.h	10.68 KB	-rw-r--r--
llc_c_st.h	1.72 KB	-rw-r--r--
llc_conn.h	4.06 KB	-rw-r--r--
llc_if.h	2.16 KB	-rw-r--r--
llc_pdu.h	14.44 KB	-rw-r--r--
llc_s_ac.h	1.55 KB	-rw-r--r--
llc_s_ev.h	2.2 KB	-rw-r--r--
llc_s_st.h	947 B	-rw-r--r--
llc_sap.h	1.08 KB	-rw-r--r--
lwtunnel.h	6.49 KB	-rw-r--r--
mac80211.h	266.84 KB	-rw-r--r--
mac802154.h	14.88 KB	-rw-r--r--
macsec.h	6.9 KB	-rw-r--r--
mctp.h	6.01 KB	-rw-r--r--
mctpdevice.h	735 B	-rw-r--r--
mip6.h	1016 B	-rw-r--r--
mld.h	2.85 KB	-rw-r--r--
mpls.h	943 B	-rw-r--r--
mpls_iptunnel.h	429 B	-rw-r--r--
mptcp.h	6.34 KB	-rw-r--r--
mrp.h	3.03 KB	-rw-r--r--
ncsi.h	1.92 KB	-rw-r--r--
ndisc.h	14.79 KB	-rw-r--r--
neighbour.h	15.97 KB	-rw-r--r--
net_failover.h	1023 B	-rw-r--r--
net_namespace.h	11.87 KB	-rw-r--r--
net_ratelimit.h	220 B	-rw-r--r--
netevent.h	1.02 KB	-rw-r--r--
netlabel.h	20.19 KB	-rw-r--r--
netlink.h	60.21 KB	-rw-r--r--
netprio_cgroup.h	1.02 KB	-rw-r--r--
netrom.h	7.71 KB	-rw-r--r--
nexthop.h	12.27 KB	-rw-r--r--
nl802154.h	12.09 KB	-rw-r--r--
nsh.h	12.31 KB	-rw-r--r--
p8022.h	447 B	-rw-r--r--
page_pool.h	8.88 KB	-rw-r--r--
pie.h	3.6 KB	-rw-r--r--
ping.h	2.9 KB	-rw-r--r--
pkt_cls.h	23.86 KB	-rw-r--r--
pkt_sched.h	5.37 KB	-rw-r--r--
pptp.h	557 B	-rw-r--r--
protocol.h	4 KB	-rw-r--r--
psample.h	1.06 KB	-rw-r--r--
psnap.h	351 B	-rw-r--r--
raw.h	2.08 KB	-rw-r--r--
rawv6.h	854 B	-rw-r--r--
red.h	11.38 KB	-rw-r--r--
regulatory.h	10.65 KB	-rw-r--r--
request_sock.h	6.47 KB	-rw-r--r--
rose.h	7.62 KB	-rw-r--r--
route.h	11.24 KB	-rw-r--r--
rpl.h	972 B	-rw-r--r--
rsi_91x.h	1.67 KB	-rw-r--r--
rtnetlink.h	6.72 KB	-rw-r--r--
rtnh.h	859 B	-rw-r--r--
sch_generic.h	33.86 KB	-rw-r--r--
scm.h	3.58 KB	-rw-r--r--
secure_seq.h	855 B	-rw-r--r--
seg6.h	2.18 KB	-rw-r--r--
seg6_hmac.h	1.44 KB	-rw-r--r--
seg6_local.h	644 B	-rw-r--r--
selftests.h	582 B	-rw-r--r--
slhc_vj.h	6.67 KB	-rw-r--r--
smc.h	2.45 KB	-rw-r--r--
snmp.h	5.14 KB	-rw-r--r--
sock.h	79.96 KB	-rw-r--r--
sock_reuseport.h	1.74 KB	-rw-r--r--
stp.h	383 B	-rw-r--r--
strparser.h	4.1 KB	-rw-r--r--
switchdev.h	13.96 KB	-rw-r--r--
tcp.h	71.78 KB	-rw-r--r--
tcp_states.h	1.2 KB	-rw-r--r--
timewait_sock.h	925 B	-rw-r--r--
tipc.h	2.35 KB	-rw-r--r--
tls.h	20.91 KB	-rw-r--r--
tls_toe.h	2.94 KB	-rw-r--r--
transp_v6.h	1.95 KB	-rw-r--r--
tso.h	566 B	-rw-r--r--
tun_proto.h	988 B	-rw-r--r--
udp.h	16.42 KB	-rw-r--r--
udp_tunnel.h	11.75 KB	-rw-r--r--
udplite.h	3.83 KB	-rw-r--r--
vsock_addr.h	662 B	-rw-r--r--
vxlan.h	13.91 KB	-rw-r--r--
wext.h	1.47 KB	-rw-r--r--
x25.h	9.49 KB	-rw-r--r--
x25device.h	387 B	-rw-r--r--
xdp.h	8.48 KB	-rw-r--r--
xdp_priv.h	446 B	-rw-r--r--
xdp_sock.h	2.04 KB	-rw-r--r--
xdp_sock_drv.h	5.53 KB	-rw-r--r--
xfrm.h	55.02 KB	-rw-r--r--
xsk_buff_pool.h	4.98 KB	-rw-r--r--

Code Editor : codel_impl.h

#ifndef __NET_SCHED_CODEL_IMPL_H
#define __NET_SCHED_CODEL_IMPL_H

/*
 * Codel - The Controlled-Delay Active Queue Management algorithm
 *
 *  Copyright (C) 2011-2012 Kathleen Nichols <nichols@pollere.com>
 *  Copyright (C) 2011-2012 Van Jacobson <van@pollere.net>
 *  Copyright (C) 2012 Michael D. Taht <dave.taht@bufferbloat.net>
 *  Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions, and the following disclaimer,
 *    without modification.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The names of the authors may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * Alternatively, provided that this notice is retained in full, this
 * software may be distributed under the terms of the GNU General
 * Public License ("GPL") version 2, in which case the provisions of the
 * GPL apply INSTEAD OF those given above.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 *
 */

/* Controlling Queue Delay (CoDel) algorithm
 * =========================================
 * Source : Kathleen Nichols and Van Jacobson
 * http://queue.acm.org/detail.cfm?id=2209336
 *
 * Implemented on linux by Dave Taht and Eric Dumazet
 */

static void codel_params_init(struct codel_params *params)
{
	params->interval = MS2TIME(100);
	params->target = MS2TIME(5);
	params->ce_threshold = CODEL_DISABLED_THRESHOLD;
	params->ecn = false;
}

static void codel_vars_init(struct codel_vars *vars)
{
	memset(vars, 0, sizeof(*vars));
}

static void codel_stats_init(struct codel_stats *stats)
{
	stats->maxpacket = 0;
}

/*
 * http://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Iterative_methods_for_reciprocal_square_roots
 * new_invsqrt = (invsqrt / 2) * (3 - count * invsqrt^2)
 *
 * Here, invsqrt is a fixed point number (< 1.0), 32bit mantissa, aka Q0.32
 */
static void codel_Newton_step(struct codel_vars *vars)
{
	u32 invsqrt = ((u32)vars->rec_inv_sqrt) << REC_INV_SQRT_SHIFT;
	u32 invsqrt2 = ((u64)invsqrt * invsqrt) >> 32;
	u64 val = (3LL << 32) - ((u64)vars->count * invsqrt2);

val >>= 2; /* avoid overflow in following multiply */
	val = (val * invsqrt) >> (32 - 2 + 1);

vars->rec_inv_sqrt = val >> REC_INV_SQRT_SHIFT;
}

/*
 * CoDel control_law is t + interval/sqrt(count)
 * We maintain in rec_inv_sqrt the reciprocal value of sqrt(count) to avoid
 * both sqrt() and divide operation.
 */
static codel_time_t codel_control_law(codel_time_t t,
				      codel_time_t interval,
				      u32 rec_inv_sqrt)
{
	return t + reciprocal_scale(interval, rec_inv_sqrt << REC_INV_SQRT_SHIFT);
}

static bool codel_should_drop(const struct sk_buff *skb,
			      void *ctx,
			      struct codel_vars *vars,
			      struct codel_params *params,
			      struct codel_stats *stats,
			      codel_skb_len_t skb_len_func,
			      codel_skb_time_t skb_time_func,
			      u32 *backlog,
			      codel_time_t now)
{
	bool ok_to_drop;
	u32 skb_len;

if (!skb) {
		vars->first_above_time = 0;
		return false;
	}

skb_len = skb_len_func(skb);
	vars->ldelay = now - skb_time_func(skb);

if (unlikely(skb_len > stats->maxpacket))
		stats->maxpacket = skb_len;

if (codel_time_before(vars->ldelay, params->target) ||
	    *backlog <= params->mtu) {
		/* went below - stay below for at least interval */
		vars->first_above_time = 0;
		return false;
	}
	ok_to_drop = false;
	if (vars->first_above_time == 0) {
		/* just went above from below. If we stay above
		 * for at least interval we'll say it's ok to drop
		 */
		vars->first_above_time = now + params->interval;
	} else if (codel_time_after(now, vars->first_above_time)) {
		ok_to_drop = true;
	}
	return ok_to_drop;
}

static struct sk_buff *codel_dequeue(void *ctx,
				     u32 *backlog,
				     struct codel_params *params,
				     struct codel_vars *vars,
				     struct codel_stats *stats,
				     codel_skb_len_t skb_len_func,
				     codel_skb_time_t skb_time_func,
				     codel_skb_drop_t drop_func,
				     codel_skb_dequeue_t dequeue_func)
{
	struct sk_buff *skb = dequeue_func(vars, ctx);
	codel_time_t now;
	bool drop;

if (!skb) {
		vars->dropping = false;
		return skb;
	}
	now = codel_get_time();
	drop = codel_should_drop(skb, ctx, vars, params, stats,
				 skb_len_func, skb_time_func, backlog, now);
	if (vars->dropping) {
		if (!drop) {
			/* sojourn time below target - leave dropping state */
			vars->dropping = false;
		} else if (codel_time_after_eq(now, vars->drop_next)) {
			/* It's time for the next drop. Drop the current
			 * packet and dequeue the next. The dequeue might
			 * take us out of dropping state.
			 * If not, schedule the next drop.
			 * A large backlog might result in drop rates so high
			 * that the next drop should happen now,
			 * hence the while loop.
			 */
			while (vars->dropping &&
			       codel_time_after_eq(now, vars->drop_next)) {
				vars->count++; /* dont care of possible wrap
						* since there is no more divide
						*/
				codel_Newton_step(vars);
				if (params->ecn && INET_ECN_set_ce(skb)) {
					stats->ecn_mark++;
					vars->drop_next =
						codel_control_law(vars->drop_next,
								  params->interval,
								  vars->rec_inv_sqrt);
					goto end;
				}
				stats->drop_len += skb_len_func(skb);
				drop_func(skb, ctx);
				stats->drop_count++;
				skb = dequeue_func(vars, ctx);
				if (!codel_should_drop(skb, ctx,
						       vars, params, stats,
						       skb_len_func,
						       skb_time_func,
						       backlog, now)) {
					/* leave dropping state */
					vars->dropping = false;
				} else {
					/* and schedule the next drop */
					vars->drop_next =
						codel_control_law(vars->drop_next,
								  params->interval,
								  vars->rec_inv_sqrt);
				}
			}
		}
	} else if (drop) {
		u32 delta;

if (params->ecn && INET_ECN_set_ce(skb)) {
			stats->ecn_mark++;
		} else {
			stats->drop_len += skb_len_func(skb);
			drop_func(skb, ctx);
			stats->drop_count++;

skb = dequeue_func(vars, ctx);
			drop = codel_should_drop(skb, ctx, vars, params,
						 stats, skb_len_func,
						 skb_time_func, backlog, now);
		}
		vars->dropping = true;
		/* if min went above target close to when we last went below it
		 * assume that the drop rate that controlled the queue on the
		 * last cycle is a good starting point to control it now.
		 */
		delta = vars->count - vars->lastcount;
		if (delta > 1 &&
		    codel_time_before(now - vars->drop_next,
				      16 * params->interval)) {
			vars->count = delta;
			/* we dont care if rec_inv_sqrt approximation
			 * is not very precise :
			 * Next Newton steps will correct it quadratically.
			 */
			codel_Newton_step(vars);
		} else {
			vars->count = 1;
			vars->rec_inv_sqrt = ~0U >> REC_INV_SQRT_SHIFT;
		}
		vars->lastcount = vars->count;
		vars->drop_next = codel_control_law(now, params->interval,
						    vars->rec_inv_sqrt);
	}
end:
	if (skb && codel_time_after(vars->ldelay, params->ce_threshold) &&
	    INET_ECN_set_ce(skb))
		stats->ce_mark++;
	return skb;
}

#endif

${this.title}

Code Editor : codel_impl.h