inet_frag.h 4.8 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
	bool			dead;
17 18 19 20 21

	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;
22
	struct rcu_work		destroy_rwork;
23 24
};

25 26 27 28 29 30
/**
 * 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
31
 * @INET_FRAG_HASH_DEAD: inet_frag_kill() has not removed fq from rhashtable
32 33 34 35 36
 */
enum {
	INET_FRAG_FIRST_IN	= BIT(0),
	INET_FRAG_LAST_IN	= BIT(1),
	INET_FRAG_COMPLETE	= BIT(2),
37
	INET_FRAG_HASH_DEAD	= BIT(3),
38 39
};

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
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;
};

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

97
struct inet_frags {
98
	unsigned int		qsize;
99

100
	void			(*constructor)(struct inet_frag_queue *q,
101
					       const void *arg);
102
	void			(*destructor)(struct inet_frag_queue *);
103
	void			(*frag_expire)(struct timer_list *t);
104 105
	struct kmem_cache	*frags_cachep;
	const char		*frags_cache_name;
106
	struct rhashtable_params rhash_params;
107 108
};

109
int inet_frags_init(struct inet_frags *);
110 111
void inet_frags_fini(struct inet_frags *);

112
static inline int fqdir_init(struct fqdir **fqdirp, struct inet_frags *f,
113
			     struct net *net)
E
Eric Dumazet 已提交
114
{
115 116 117 118 119
	struct fqdir *fqdir = kzalloc(sizeof(*fqdir), GFP_KERNEL);
	int res;

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

131
void fqdir_exit(struct fqdir *fqdir);
132

133 134
void inet_frag_kill(struct inet_frag_queue *q);
void inet_frag_destroy(struct inet_frag_queue *q);
E
Eric Dumazet 已提交
135
struct inet_frag_queue *inet_frag_find(struct fqdir *fqdir, void *key);
136

137 138 139
/* Free all skbs in the queue; return the sum of their truesizes. */
unsigned int inet_frag_rbtree_purge(struct rb_root *root);

140
static inline void inet_frag_put(struct inet_frag_queue *q)
P
Pavel Emelyanov 已提交
141
{
142
	if (refcount_dec_and_test(&q->refcnt))
143
		inet_frag_destroy(q);
P
Pavel Emelyanov 已提交
144 145
}

146 147
/* Memory Tracking Functions. */

E
Eric Dumazet 已提交
148
static inline long frag_mem_limit(const struct fqdir *fqdir)
149
{
E
Eric Dumazet 已提交
150
	return atomic_long_read(&fqdir->mem);
151 152
}

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

E
Eric Dumazet 已提交
158
static inline void add_frag_mem_limit(struct fqdir *fqdir, long val)
159
{
E
Eric Dumazet 已提交
160
	atomic_long_add(val, &fqdir->mem);
161 162
}

163 164 165 166 167 168 169 170 171 172 173
/* 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];

174 175 176 177 178 179 180 181 182 183 184 185
/* 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);

186
#endif