inet_frag.h 4.6 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3 4
#ifndef __NET_FRAG_H__
#define __NET_FRAG_H__

N
NeilBrown 已提交
5
#include <linux/rhashtable-types.h>
6

E
Eric Dumazet 已提交
7 8
/* Per netns frag queues directory */
struct fqdir {
9
	/* sysctls */
10 11
	long			high_thresh;
	long			low_thresh;
12
	int			timeout;
13
	int			max_dist;
14
	struct inet_frags	*f;
15
	struct net		*net;
16 17 18 19 20

	struct rhashtable       rhashtable ____cacheline_aligned_in_smp;

	/* Keep atomic mem on separate cachelines in structs that include it */
	atomic_long_t		mem ____cacheline_aligned_in_smp;
21 22
};

23 24 25 26 27 28 29 30 31 32 33 34 35
/**
 * fragment queue flags
 *
 * @INET_FRAG_FIRST_IN: first fragment has arrived
 * @INET_FRAG_LAST_IN: final fragment has arrived
 * @INET_FRAG_COMPLETE: frag queue has been processed and is due for destruction
 */
enum {
	INET_FRAG_FIRST_IN	= BIT(0),
	INET_FRAG_LAST_IN	= BIT(1),
	INET_FRAG_COMPLETE	= BIT(2),
};

36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
struct frag_v4_compare_key {
	__be32		saddr;
	__be32		daddr;
	u32		user;
	u32		vif;
	__be16		id;
	u16		protocol;
};

struct frag_v6_compare_key {
	struct in6_addr	saddr;
	struct in6_addr	daddr;
	u32		user;
	__be32		id;
	u32		iif;
};

53 54 55
/**
 * struct inet_frag_queue - fragment queue
 *
56 57
 * @node: rhash node
 * @key: keys identifying this frag.
58
 * @timer: queue expiration timer
59
 * @lock: spinlock protecting this frag
60
 * @refcnt: reference count of the queue
61
 * @rb_fragments: received fragments rb-tree root
62
 * @fragments_tail: received fragments tail
63
 * @last_run_head: the head of the last "run". see ip_fragment.c
64 65 66 67
 * @stamp: timestamp of the last received fragment
 * @len: total length of the original datagram
 * @meat: length of received fragments so far
 * @flags: fragment queue flags
68
 * @max_size: maximum received fragment size
E
Eric Dumazet 已提交
69
 * @fqdir: pointer to struct fqdir
70
 * @rcu: rcu head for freeing deferall
71
 */
72
struct inet_frag_queue {
73 74 75 76 77
	struct rhash_head	node;
	union {
		struct frag_v4_compare_key v4;
		struct frag_v6_compare_key v6;
	} key;
78
	struct timer_list	timer;
79
	spinlock_t		lock;
80
	refcount_t		refcnt;
81
	struct rb_root		rb_fragments;
82
	struct sk_buff		*fragments_tail;
83
	struct sk_buff		*last_run_head;
84
	ktime_t			stamp;
85
	int			len;
86
	int			meat;
87
	__u8			flags;
88
	u16			max_size;
E
Eric Dumazet 已提交
89
	struct fqdir		*fqdir;
90
	struct rcu_head		rcu;
91 92
};

93
struct inet_frags {
94
	unsigned int		qsize;
95

96
	void			(*constructor)(struct inet_frag_queue *q,
97
					       const void *arg);
98
	void			(*destructor)(struct inet_frag_queue *);
99
	void			(*frag_expire)(struct timer_list *t);
100 101
	struct kmem_cache	*frags_cachep;
	const char		*frags_cache_name;
102
	struct rhashtable_params rhash_params;
103 104
};

105
int inet_frags_init(struct inet_frags *);
106 107
void inet_frags_fini(struct inet_frags *);

108
static inline int fqdir_init(struct fqdir **fqdirp, struct inet_frags *f,
109
			     struct net *net)
E
Eric Dumazet 已提交
110
{
111 112 113 114 115
	struct fqdir *fqdir = kzalloc(sizeof(*fqdir), GFP_KERNEL);
	int res;

	if (!fqdir)
		return -ENOMEM;
116
	fqdir->f = f;
117
	fqdir->net = net;
118 119 120 121 122 123 124
	res = rhashtable_init(&fqdir->rhashtable, &fqdir->f->rhash_params);
	if (res < 0) {
		kfree(fqdir);
		return res;
	}
	*fqdirp = fqdir;
	return 0;
E
Eric Dumazet 已提交
125
}
126

127
void fqdir_exit(struct fqdir *fqdir);
128

129 130
void inet_frag_kill(struct inet_frag_queue *q);
void inet_frag_destroy(struct inet_frag_queue *q);
E
Eric Dumazet 已提交
131
struct inet_frag_queue *inet_frag_find(struct fqdir *fqdir, void *key);
132

133 134 135
/* Free all skbs in the queue; return the sum of their truesizes. */
unsigned int inet_frag_rbtree_purge(struct rb_root *root);

136
static inline void inet_frag_put(struct inet_frag_queue *q)
P
Pavel Emelyanov 已提交
137
{
138
	if (refcount_dec_and_test(&q->refcnt))
139
		inet_frag_destroy(q);
P
Pavel Emelyanov 已提交
140 141
}

142 143
/* Memory Tracking Functions. */

E
Eric Dumazet 已提交
144
static inline long frag_mem_limit(const struct fqdir *fqdir)
145
{
E
Eric Dumazet 已提交
146
	return atomic_long_read(&fqdir->mem);
147 148
}

E
Eric Dumazet 已提交
149
static inline void sub_frag_mem_limit(struct fqdir *fqdir, long val)
150
{
E
Eric Dumazet 已提交
151
	atomic_long_sub(val, &fqdir->mem);
152 153
}

E
Eric Dumazet 已提交
154
static inline void add_frag_mem_limit(struct fqdir *fqdir, long val)
155
{
E
Eric Dumazet 已提交
156
	atomic_long_add(val, &fqdir->mem);
157 158
}

159 160 161 162 163 164 165 166 167 168 169
/* RFC 3168 support :
 * We want to check ECN values of all fragments, do detect invalid combinations.
 * In ipq->ecn, we store the OR value of each ip4_frag_ecn() fragment value.
 */
#define	IPFRAG_ECN_NOT_ECT	0x01 /* one frag had ECN_NOT_ECT */
#define	IPFRAG_ECN_ECT_1	0x02 /* one frag had ECN_ECT_1 */
#define	IPFRAG_ECN_ECT_0	0x04 /* one frag had ECN_ECT_0 */
#define	IPFRAG_ECN_CE		0x08 /* one frag had ECN_CE */

extern const u8 ip_frag_ecn_table[16];

170 171 172 173 174 175 176 177 178 179 180 181
/* Return values of inet_frag_queue_insert() */
#define IPFRAG_OK	0
#define IPFRAG_DUP	1
#define IPFRAG_OVERLAP	2
int inet_frag_queue_insert(struct inet_frag_queue *q, struct sk_buff *skb,
			   int offset, int end);
void *inet_frag_reasm_prepare(struct inet_frag_queue *q, struct sk_buff *skb,
			      struct sk_buff *parent);
void inet_frag_reasm_finish(struct inet_frag_queue *q, struct sk_buff *head,
			    void *reasm_data);
struct sk_buff *inet_frag_pull_head(struct inet_frag_queue *q);

182
#endif