request_sock.h 8.4 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * NET		Generic infrastructure for Network protocols.
 *
 *		Definitions for request_sock 
 *
 * Authors:	Arnaldo Carvalho de Melo <acme@conectiva.com.br>
 *
 * 		From code originally in include/net/tcp.h
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 */
#ifndef _REQUEST_SOCK_H
#define _REQUEST_SOCK_H

#include <linux/slab.h>
19
#include <linux/spinlock.h>
20
#include <linux/types.h>
21
#include <linux/bug.h>
22

23 24
#include <net/sock.h>

25
struct request_sock;
26 27 28 29
struct sk_buff;
struct dst_entry;
struct proto;

30
struct request_sock_ops {
31 32
	int		family;
	int		obj_size;
33
	struct kmem_cache	*slab;
34
	char		*slab_name;
35
	int		(*rtx_syn_ack)(const struct sock *sk,
C
Christoph Paasch 已提交
36
				       struct request_sock *req);
37
	void		(*send_ack)(const struct sock *sk, struct sk_buff *skb,
38
				    struct request_sock *req);
39
	void		(*send_reset)(const struct sock *sk,
40
				      struct sk_buff *skb);
41
	void		(*destructor)(struct request_sock *req);
42
	void		(*syn_ack_timeout)(const struct request_sock *req);
43 44
};

45
int inet_rtx_syn_ack(const struct sock *parent, struct request_sock *req);
46

47
/* struct request_sock - mini sock to represent a connection request
48
 */
49
struct request_sock {
50
	struct sock_common		__req_common;
51
#define rsk_refcnt			__req_common.skc_refcnt
52
#define rsk_hash			__req_common.skc_hash
53

54
	struct request_sock		*dl_next;
55
	struct sock			*rsk_listener;
56
	u16				mss;
57 58 59
	u8				num_retrans; /* number of retransmits */
	u8				cookie_ts:1; /* syncookie: encode tcpopts in timestamp */
	u8				num_timeout:7; /* number of timeouts */
60 61 62 63
	/* The following two fields can be easily recomputed I think -AK */
	u32				window_clamp; /* window clamp at creation time */
	u32				rcv_wnd;	  /* rcv_wnd offered first time */
	u32				ts_recent;
64
	struct timer_list		rsk_timer;
65
	const struct request_sock_ops	*rsk_ops;
66
	struct sock			*sk;
67
	u32				*saved_syn;
68
	u32				secid;
69
	u32				peer_secid;
70 71
};

72 73
static inline struct request_sock *
reqsk_alloc(const struct request_sock_ops *ops, struct sock *sk_listener)
74
{
75
	struct request_sock *req = kmem_cache_alloc(ops->slab, GFP_ATOMIC);
76

77
	if (req) {
78
		req->rsk_ops = ops;
79 80
		sock_hold(sk_listener);
		req->rsk_listener = sk_listener;
81
		req->saved_syn = NULL;
82 83 84 85
		/* Following is temporary. It is coupled with debugging
		 * helpers in reqsk_put() & reqsk_free()
		 */
		atomic_set(&req->rsk_refcnt, 0);
86
	}
87 88 89
	return req;
}

90 91 92 93 94
static inline struct request_sock *inet_reqsk(struct sock *sk)
{
	return (struct request_sock *)sk;
}

95 96 97 98 99
static inline struct sock *req_to_sk(struct request_sock *req)
{
	return (struct sock *)req;
}

100
static inline void reqsk_free(struct request_sock *req)
101
{
102 103 104
	/* temporary debugging */
	WARN_ON_ONCE(atomic_read(&req->rsk_refcnt) != 0);

105
	req->rsk_ops->destructor(req);
106 107
	if (req->rsk_listener)
		sock_put(req->rsk_listener);
108
	kfree(req->saved_syn);
109
	kmem_cache_free(req->rsk_ops->slab, req);
110 111
}

112 113 114 115 116 117
static inline void reqsk_put(struct request_sock *req)
{
	if (atomic_dec_and_test(&req->rsk_refcnt))
		reqsk_free(req);
}

118 119
extern int sysctl_max_syn_backlog;

120
/** struct listen_sock - listen state
121 122 123
 *
 * @max_qlen_log - log_2 of maximal queued SYNs/REQUESTs
 */
124
struct listen_sock {
125 126 127 128 129 130 131 132
	int			qlen_inc; /* protected by listener lock */
	int			young_inc;/* protected by listener lock */

	/* following fields can be updated by timer */
	atomic_t		qlen_dec; /* qlen = qlen_inc - qlen_dec */
	atomic_t		young_dec;

	u8			max_qlen_log ____cacheline_aligned_in_smp;
133 134
	u8			synflood_warned;
	/* 2 bytes hole, try to use */
135
	u32			hash_rnd;
136
	u32			nr_table_entries;
137 138 139
	struct request_sock	*syn_table[0];
};

140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167
/*
 * For a TCP Fast Open listener -
 *	lock - protects the access to all the reqsk, which is co-owned by
 *		the listener and the child socket.
 *	qlen - pending TFO requests (still in TCP_SYN_RECV).
 *	max_qlen - max TFO reqs allowed before TFO is disabled.
 *
 *	XXX (TFO) - ideally these fields can be made as part of "listen_sock"
 *	structure above. But there is some implementation difficulty due to
 *	listen_sock being part of request_sock_queue hence will be freed when
 *	a listener is stopped. But TFO related fields may continue to be
 *	accessed even after a listener is closed, until its sk_refcnt drops
 *	to 0 implying no more outstanding TFO reqs. One solution is to keep
 *	listen_opt around until	sk_refcnt drops to 0. But there is some other
 *	complexity that needs to be resolved. E.g., a listener can be disabled
 *	temporarily through shutdown()->tcp_disconnect(), and re-enabled later.
 */
struct fastopen_queue {
	struct request_sock	*rskq_rst_head; /* Keep track of past TFO */
	struct request_sock	*rskq_rst_tail; /* requests that caused RST.
						 * This is part of the defense
						 * against spoofing attack.
						 */
	spinlock_t	lock;
	int		qlen;		/* # of pending (TCP_SYN_RECV) reqs */
	int		max_qlen;	/* != 0 iff TFO is currently enabled */
};

168 169 170 171
/** struct request_sock_queue - queue of request_socks
 *
 * @rskq_accept_head - FIFO head of established children
 * @rskq_accept_tail - FIFO tail of established children
172
 * @rskq_defer_accept - User waits for some data after accept()
173 174 175 176 177 178 179 180 181
 * @syn_wait_lock - serializer
 *
 * %syn_wait_lock is necessary only to avoid proc interface having to grab the main
 * lock sock while browsing the listening hash (otherwise it's deadlock prone).
 *
 */
struct request_sock_queue {
	struct request_sock	*rskq_accept_head;
	struct request_sock	*rskq_accept_tail;
182
	u8			rskq_defer_accept;
183
	struct listen_sock	*listen_opt;
184 185 186 187 188 189
	struct fastopen_queue	*fastopenq; /* This is non-NULL iff TFO has been
					     * enabled on this listener. Check
					     * max_qlen != 0 in fastopen_queue
					     * to determine if TFO is enabled
					     * right at this moment.
					     */
190 191

	/* temporary alignment, our goal is to get rid of this lock */
192
	spinlock_t		syn_wait_lock ____cacheline_aligned_in_smp;
193 194
};

195 196
int reqsk_queue_alloc(struct request_sock_queue *queue,
		      unsigned int nr_table_entries);
197

198 199 200 201
void __reqsk_queue_destroy(struct request_sock_queue *queue);
void reqsk_queue_destroy(struct request_sock_queue *queue);
void reqsk_fastopen_remove(struct sock *sk, struct request_sock *req,
			   bool reset);
202

203 204 205 206 207
static inline struct request_sock *
	reqsk_queue_yank_acceptq(struct request_sock_queue *queue)
{
	struct request_sock *req = queue->rskq_accept_head;

208
	queue->rskq_accept_head = NULL;
209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237
	return req;
}

static inline int reqsk_queue_empty(struct request_sock_queue *queue)
{
	return queue->rskq_accept_head == NULL;
}

static inline void reqsk_queue_add(struct request_sock_queue *queue,
				   struct request_sock *req,
				   struct sock *parent,
				   struct sock *child)
{
	req->sk = child;
	sk_acceptq_added(parent);

	if (queue->rskq_accept_head == NULL)
		queue->rskq_accept_head = req;
	else
		queue->rskq_accept_tail->dl_next = req;

	queue->rskq_accept_tail = req;
	req->dl_next = NULL;
}

static inline struct request_sock *reqsk_queue_remove(struct request_sock_queue *queue)
{
	struct request_sock *req = queue->rskq_accept_head;

238
	WARN_ON(req == NULL);
239 240 241 242 243 244 245 246

	queue->rskq_accept_head = req->dl_next;
	if (queue->rskq_accept_head == NULL)
		queue->rskq_accept_tail = NULL;

	return req;
}

247 248
static inline void reqsk_queue_removed(struct request_sock_queue *queue,
				       const struct request_sock *req)
249
{
250
	struct listen_sock *lopt = queue->listen_opt;
251

252
	if (req->num_timeout == 0)
253 254
		atomic_inc(&lopt->young_dec);
	atomic_inc(&lopt->qlen_dec);
255 256
}

257
static inline void reqsk_queue_added(struct request_sock_queue *queue)
258
{
259
	struct listen_sock *lopt = queue->listen_opt;
260

261 262
	lopt->young_inc++;
	lopt->qlen_inc++;
263 264
}

265
static inline int listen_sock_qlen(const struct listen_sock *lopt)
266
{
267
	return lopt->qlen_inc - atomic_read(&lopt->qlen_dec);
268 269
}

270
static inline int listen_sock_young(const struct listen_sock *lopt)
271
{
272
	return lopt->young_inc - atomic_read(&lopt->young_dec);
273 274
}

275
static inline int reqsk_queue_len(const struct request_sock_queue *queue)
276
{
277 278 279
	const struct listen_sock *lopt = queue->listen_opt;

	return lopt ? listen_sock_qlen(lopt) : 0;
280 281
}

282
static inline int reqsk_queue_len_young(const struct request_sock_queue *queue)
283
{
284 285
	return listen_sock_young(queue->listen_opt);
}
286

287 288 289
static inline int reqsk_queue_is_full(const struct request_sock_queue *queue)
{
	return reqsk_queue_len(queue) >> queue->listen_opt->max_qlen_log;
290 291
}

292 293 294 295
void reqsk_queue_hash_req(struct request_sock_queue *queue,
			  u32 hash, struct request_sock *req,
			  unsigned long timeout);

296
#endif /* _REQUEST_SOCK_H */