inet_frag.h 4.4 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

7
struct netns_frags {
8
	/* sysctls */
9 10
	long			high_thresh;
	long			low_thresh;
11
	int			timeout;
12
	int			max_dist;
13
	struct inet_frags	*f;
14 15 16 17 18

	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;
19 20
};

21 22 23 24 25 26 27 28 29 30 31 32 33
/**
 * 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),
};

34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
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;
};

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

91
struct inet_frags {
92
	unsigned int		qsize;
93

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

103
int inet_frags_init(struct inet_frags *);
104 105
void inet_frags_fini(struct inet_frags *);

106
static inline int inet_frags_init_net(struct netns_frags *nf)
E
Eric Dumazet 已提交
107
{
108
	atomic_long_set(&nf->mem, 0);
109
	return rhashtable_init(&nf->rhashtable, &nf->f->rhash_params);
E
Eric Dumazet 已提交
110
}
111
void inet_frags_exit_net(struct netns_frags *nf);
112

113 114
void inet_frag_kill(struct inet_frag_queue *q);
void inet_frag_destroy(struct inet_frag_queue *q);
115
struct inet_frag_queue *inet_frag_find(struct netns_frags *nf, void *key);
116

117 118 119
/* Free all skbs in the queue; return the sum of their truesizes. */
unsigned int inet_frag_rbtree_purge(struct rb_root *root);

120
static inline void inet_frag_put(struct inet_frag_queue *q)
P
Pavel Emelyanov 已提交
121
{
122
	if (refcount_dec_and_test(&q->refcnt))
123
		inet_frag_destroy(q);
P
Pavel Emelyanov 已提交
124 125
}

126 127
/* Memory Tracking Functions. */

128
static inline long frag_mem_limit(const struct netns_frags *nf)
129
{
130
	return atomic_long_read(&nf->mem);
131 132
}

133
static inline void sub_frag_mem_limit(struct netns_frags *nf, long val)
134
{
135
	atomic_long_sub(val, &nf->mem);
136 137
}

138
static inline void add_frag_mem_limit(struct netns_frags *nf, long val)
139
{
140
	atomic_long_add(val, &nf->mem);
141 142
}

143 144 145 146 147 148 149 150 151 152 153
/* 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];

154 155 156 157 158 159 160 161 162 163 164 165
/* 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);

166
#endif