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 : fq_impl.h

/* SPDX-License-Identifier: GPL-2.0-only */
/*
 * Copyright (c) 2016 Qualcomm Atheros, Inc
 *
 * Based on net/sched/sch_fq_codel.c
 */
#ifndef __NET_SCHED_FQ_IMPL_H
#define __NET_SCHED_FQ_IMPL_H

#include <net/fq.h>

/* functions that are embedded into includer */

static void
__fq_adjust_removal(struct fq *fq, struct fq_flow *flow, unsigned int packets,
		    unsigned int bytes, unsigned int truesize)
{
	struct fq_tin *tin = flow->tin;
	int idx;

tin->backlog_bytes -= bytes;
	tin->backlog_packets -= packets;
	flow->backlog -= bytes;
	fq->backlog -= packets;
	fq->memory_usage -= truesize;

if (flow->backlog)
		return;

if (flow == &tin->default_flow) {
		list_del_init(&tin->tin_list);
		return;
	}

idx = flow - fq->flows;
	__clear_bit(idx, fq->flows_bitmap);
}

static void fq_adjust_removal(struct fq *fq,
			      struct fq_flow *flow,
			      struct sk_buff *skb)
{
	__fq_adjust_removal(fq, flow, 1, skb->len, skb->truesize);
}

static struct sk_buff *fq_flow_dequeue(struct fq *fq,
				       struct fq_flow *flow)
{
	struct sk_buff *skb;

lockdep_assert_held(&fq->lock);

skb = __skb_dequeue(&flow->queue);
	if (!skb)
		return NULL;

fq_adjust_removal(fq, flow, skb);

return skb;
}

static int fq_flow_drop(struct fq *fq, struct fq_flow *flow,
			fq_skb_free_t free_func)
{
	unsigned int packets = 0, bytes = 0, truesize = 0;
	struct fq_tin *tin = flow->tin;
	struct sk_buff *skb;
	int pending;

lockdep_assert_held(&fq->lock);

pending = min_t(int, 32, skb_queue_len(&flow->queue) / 2);
	do {
		skb = __skb_dequeue(&flow->queue);
		if (!skb)
			break;

packets++;
		bytes += skb->len;
		truesize += skb->truesize;
		free_func(fq, tin, flow, skb);
	} while (packets < pending);

__fq_adjust_removal(fq, flow, packets, bytes, truesize);

return packets;
}

static struct sk_buff *fq_tin_dequeue(struct fq *fq,
				      struct fq_tin *tin,
				      fq_tin_dequeue_t dequeue_func)
{
	struct fq_flow *flow;
	struct list_head *head;
	struct sk_buff *skb;

lockdep_assert_held(&fq->lock);

begin:
	head = &tin->new_flows;
	if (list_empty(head)) {
		head = &tin->old_flows;
		if (list_empty(head))
			return NULL;
	}

flow = list_first_entry(head, struct fq_flow, flowchain);

if (flow->deficit <= 0) {
		flow->deficit += fq->quantum;
		list_move_tail(&flow->flowchain,
			       &tin->old_flows);
		goto begin;
	}

skb = dequeue_func(fq, tin, flow);
	if (!skb) {
		/* force a pass through old_flows to prevent starvation */
		if ((head == &tin->new_flows) &&
		    !list_empty(&tin->old_flows)) {
			list_move_tail(&flow->flowchain, &tin->old_flows);
		} else {
			list_del_init(&flow->flowchain);
			flow->tin = NULL;
		}
		goto begin;
	}

flow->deficit -= skb->len;
	tin->tx_bytes += skb->len;
	tin->tx_packets++;

return skb;
}

static u32 fq_flow_idx(struct fq *fq, struct sk_buff *skb)
{
	u32 hash = skb_get_hash(skb);

return reciprocal_scale(hash, fq->flows_cnt);
}

static struct fq_flow *fq_flow_classify(struct fq *fq,
					struct fq_tin *tin, u32 idx,
					struct sk_buff *skb)
{
	struct fq_flow *flow;

lockdep_assert_held(&fq->lock);

flow = &fq->flows[idx];
	if (flow->tin && flow->tin != tin) {
		flow = &tin->default_flow;
		tin->collisions++;
		fq->collisions++;
	}

if (!flow->tin)
		tin->flows++;

return flow;
}

static struct fq_flow *fq_find_fattest_flow(struct fq *fq)
{
	struct fq_tin *tin;
	struct fq_flow *flow = NULL;
	u32 len = 0;
	int i;

for_each_set_bit(i, fq->flows_bitmap, fq->flows_cnt) {
		struct fq_flow *cur = &fq->flows[i];
		unsigned int cur_len;

cur_len = cur->backlog;
		if (cur_len <= len)
			continue;

flow = cur;
		len = cur_len;
	}

list_for_each_entry(tin, &fq->tin_backlog, tin_list) {
		unsigned int cur_len = tin->default_flow.backlog;

if (cur_len <= len)
			continue;

flow = &tin->default_flow;
		len = cur_len;
	}

return flow;
}

static void fq_tin_enqueue(struct fq *fq,
			   struct fq_tin *tin, u32 idx,
			   struct sk_buff *skb,
			   fq_skb_free_t free_func)
{
	struct fq_flow *flow;
	bool oom;

lockdep_assert_held(&fq->lock);

flow = fq_flow_classify(fq, tin, idx, skb);

if (!flow->backlog) {
		if (flow != &tin->default_flow)
			__set_bit(idx, fq->flows_bitmap);
		else if (list_empty(&tin->tin_list))
			list_add(&tin->tin_list, &fq->tin_backlog);
	}

flow->tin = tin;
	flow->backlog += skb->len;
	tin->backlog_bytes += skb->len;
	tin->backlog_packets++;
	fq->memory_usage += skb->truesize;
	fq->backlog++;

if (list_empty(&flow->flowchain)) {
		flow->deficit = fq->quantum;
		list_add_tail(&flow->flowchain,
			      &tin->new_flows);
	}

__skb_queue_tail(&flow->queue, skb);
	oom = (fq->memory_usage > fq->memory_limit);
	while (fq->backlog > fq->limit || oom) {
		flow = fq_find_fattest_flow(fq);
		if (!flow)
			return;

if (!fq_flow_drop(fq, flow, free_func))
			return;

flow->tin->overlimit++;
		fq->overlimit++;
		if (oom) {
			fq->overmemory++;
			oom = (fq->memory_usage > fq->memory_limit);
		}
	}
}

static void fq_flow_filter(struct fq *fq,
			   struct fq_flow *flow,
			   fq_skb_filter_t filter_func,
			   void *filter_data,
			   fq_skb_free_t free_func)
{
	struct fq_tin *tin = flow->tin;
	struct sk_buff *skb, *tmp;

lockdep_assert_held(&fq->lock);

skb_queue_walk_safe(&flow->queue, skb, tmp) {
		if (!filter_func(fq, tin, flow, skb, filter_data))
			continue;

__skb_unlink(skb, &flow->queue);
		fq_adjust_removal(fq, flow, skb);
		free_func(fq, tin, flow, skb);
	}
}

static void fq_tin_filter(struct fq *fq,
			  struct fq_tin *tin,
			  fq_skb_filter_t filter_func,
			  void *filter_data,
			  fq_skb_free_t free_func)
{
	struct fq_flow *flow;

lockdep_assert_held(&fq->lock);

list_for_each_entry(flow, &tin->new_flows, flowchain)
		fq_flow_filter(fq, flow, filter_func, filter_data, free_func);
	list_for_each_entry(flow, &tin->old_flows, flowchain)
		fq_flow_filter(fq, flow, filter_func, filter_data, free_func);
}

static void fq_flow_reset(struct fq *fq,
			  struct fq_flow *flow,
			  fq_skb_free_t free_func)
{
	struct fq_tin *tin = flow->tin;
	struct sk_buff *skb;

while ((skb = fq_flow_dequeue(fq, flow)))
		free_func(fq, tin, flow, skb);

if (!list_empty(&flow->flowchain)) {
		list_del_init(&flow->flowchain);
		if (list_empty(&tin->new_flows) &&
		    list_empty(&tin->old_flows))
			list_del_init(&tin->tin_list);
	}

flow->tin = NULL;

WARN_ON_ONCE(flow->backlog);
}

static void fq_tin_reset(struct fq *fq,
			 struct fq_tin *tin,
			 fq_skb_free_t free_func)
{
	struct list_head *head;
	struct fq_flow *flow;

for (;;) {
		head = &tin->new_flows;
		if (list_empty(head)) {
			head = &tin->old_flows;
			if (list_empty(head))
				break;
		}

flow = list_first_entry(head, struct fq_flow, flowchain);
		fq_flow_reset(fq, flow, free_func);
	}

WARN_ON_ONCE(!list_empty(&tin->tin_list));
	WARN_ON_ONCE(tin->backlog_bytes);
	WARN_ON_ONCE(tin->backlog_packets);
}

static void fq_flow_init(struct fq_flow *flow)
{
	INIT_LIST_HEAD(&flow->flowchain);
	__skb_queue_head_init(&flow->queue);
}

static void fq_tin_init(struct fq_tin *tin)
{
	INIT_LIST_HEAD(&tin->new_flows);
	INIT_LIST_HEAD(&tin->old_flows);
	INIT_LIST_HEAD(&tin->tin_list);
	fq_flow_init(&tin->default_flow);
}

static int fq_init(struct fq *fq, int flows_cnt)
{
	int i;

memset(fq, 0, sizeof(fq[0]));
	spin_lock_init(&fq->lock);
	INIT_LIST_HEAD(&fq->tin_backlog);
	fq->flows_cnt = max_t(u32, flows_cnt, 1);
	fq->quantum = 300;
	fq->limit = 8192;
	fq->memory_limit = 16 << 20; /* 16 MBytes */

fq->flows = kvcalloc(fq->flows_cnt, sizeof(fq->flows[0]), GFP_KERNEL);
	if (!fq->flows)
		return -ENOMEM;

fq->flows_bitmap = kcalloc(BITS_TO_LONGS(fq->flows_cnt), sizeof(long),
				   GFP_KERNEL);
	if (!fq->flows_bitmap) {
		kvfree(fq->flows);
		fq->flows = NULL;
		return -ENOMEM;
	}

for (i = 0; i < fq->flows_cnt; i++)
		fq_flow_init(&fq->flows[i]);

return 0;
}

static void fq_reset(struct fq *fq,
		     fq_skb_free_t free_func)
{
	int i;

for (i = 0; i < fq->flows_cnt; i++)
		fq_flow_reset(fq, &fq->flows[i], free_func);

kvfree(fq->flows);
	fq->flows = NULL;

kfree(fq->flows_bitmap);
	fq->flows_bitmap = NULL;
}

#endif

${this.title}

Code Editor : fq_impl.h