request_sock.h 8.1 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 31 32 33 34
/* empty to "strongly type" an otherwise void parameter.
 */
struct request_values {
};

35
struct request_sock_ops {
36 37
	int		family;
	int		obj_size;
38
	struct kmem_cache	*slab;
39
	char		*slab_name;
40
	int		(*rtx_syn_ack)(struct sock *sk,
41 42
				       struct request_sock *req,
				       struct request_values *rvp);
43
	void		(*send_ack)(struct sock *sk, struct sk_buff *skb,
44
				    struct request_sock *req);
45 46
	void		(*send_reset)(struct sock *sk,
				      struct sk_buff *skb);
47
	void		(*destructor)(struct request_sock *req);
48 49
	void		(*syn_ack_timeout)(struct sock *sk,
					   struct request_sock *req);
50 51
};

52 53
extern int inet_rtx_syn_ack(struct sock *parent, struct request_sock *req);

54
/* struct request_sock - mini sock to represent a connection request
55
 */
56 57
struct request_sock {
	struct request_sock		*dl_next; /* Must be first member! */
58
	u16				mss;
59 60 61
	u8				num_retrans; /* number of retransmits */
	u8				cookie_ts:1; /* syncookie: encode tcpopts in timestamp */
	u8				num_timeout:7; /* number of timeouts */
62 63 64 65 66
	/* 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;
	unsigned long			expires;
67
	const struct request_sock_ops	*rsk_ops;
68
	struct sock			*sk;
69
	u32				secid;
70
	u32				peer_secid;
71 72
};

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

	if (req != NULL)
78
		req->rsk_ops = ops;
79 80 81 82

	return req;
}

83
static inline void __reqsk_free(struct request_sock *req)
84
{
85
	kmem_cache_free(req->rsk_ops->slab, req);
86 87
}

88
static inline void reqsk_free(struct request_sock *req)
89
{
90 91
	req->rsk_ops->destructor(req);
	__reqsk_free(req);
92 93
}

94 95
extern int sysctl_max_syn_backlog;

96
/** struct listen_sock - listen state
97 98 99
 *
 * @max_qlen_log - log_2 of maximal queued SYNs/REQUESTs
 */
100
struct listen_sock {
101
	u8			max_qlen_log;
102 103
	u8			synflood_warned;
	/* 2 bytes hole, try to use */
104 105 106 107
	int			qlen;
	int			qlen_young;
	int			clock_hand;
	u32			hash_rnd;
108
	u32			nr_table_entries;
109 110 111
	struct request_sock	*syn_table[0];
};

112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
/*
 * 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 */
};

140 141 142 143
/** struct request_sock_queue - queue of request_socks
 *
 * @rskq_accept_head - FIFO head of established children
 * @rskq_accept_tail - FIFO tail of established children
144
 * @rskq_defer_accept - User waits for some data after accept()
145 146 147 148 149 150 151 152 153 154 155 156 157 158 159
 * @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).
 *
 * This lock is acquired in read mode only from listening_get_next() seq_file
 * op and it's acquired in write mode _only_ from code that is actively
 * changing rskq_accept_head. All readers that are holding the master sock lock
 * don't need to grab this lock in read mode too as rskq_accept_head. writes
 * are always protected from the main sock lock.
 */
struct request_sock_queue {
	struct request_sock	*rskq_accept_head;
	struct request_sock	*rskq_accept_tail;
	rwlock_t		syn_wait_lock;
160 161
	u8			rskq_defer_accept;
	/* 3 bytes hole, try to pack */
162
	struct listen_sock	*listen_opt;
163 164 165 166 167 168
	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.
					     */
169 170 171
};

extern int reqsk_queue_alloc(struct request_sock_queue *queue,
172
			     unsigned int nr_table_entries);
173

174
extern void __reqsk_queue_destroy(struct request_sock_queue *queue);
175
extern void reqsk_queue_destroy(struct request_sock_queue *queue);
176 177
extern void reqsk_fastopen_remove(struct sock *sk,
				  struct request_sock *req, bool reset);
178

179 180 181 182 183
static inline struct request_sock *
	reqsk_queue_yank_acceptq(struct request_sock_queue *queue)
{
	struct request_sock *req = queue->rskq_accept_head;

184
	queue->rskq_accept_head = NULL;
185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222
	return req;
}

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

static inline void reqsk_queue_unlink(struct request_sock_queue *queue,
				      struct request_sock *req,
				      struct request_sock **prev_req)
{
	write_lock(&queue->syn_wait_lock);
	*prev_req = req->dl_next;
	write_unlock(&queue->syn_wait_lock);
}

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;

223
	WARN_ON(req == NULL);
224 225 226 227 228 229 230 231 232 233 234

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

	return req;
}

static inline int reqsk_queue_removed(struct request_sock_queue *queue,
				      struct request_sock *req)
{
235
	struct listen_sock *lopt = queue->listen_opt;
236

237
	if (req->num_timeout == 0)
238 239 240 241 242 243 244
		--lopt->qlen_young;

	return --lopt->qlen;
}

static inline int reqsk_queue_added(struct request_sock_queue *queue)
{
245
	struct listen_sock *lopt = queue->listen_opt;
246 247 248 249 250 251 252
	const int prev_qlen = lopt->qlen;

	lopt->qlen_young++;
	lopt->qlen++;
	return prev_qlen;
}

253
static inline int reqsk_queue_len(const struct request_sock_queue *queue)
254 255 256 257
{
	return queue->listen_opt != NULL ? queue->listen_opt->qlen : 0;
}

258
static inline int reqsk_queue_len_young(const struct request_sock_queue *queue)
259 260 261 262
{
	return queue->listen_opt->qlen_young;
}

263
static inline int reqsk_queue_is_full(const struct request_sock_queue *queue)
264 265 266 267 268 269
{
	return queue->listen_opt->qlen >> queue->listen_opt->max_qlen_log;
}

static inline void reqsk_queue_hash_req(struct request_sock_queue *queue,
					u32 hash, struct request_sock *req,
270
					unsigned long timeout)
271
{
272
	struct listen_sock *lopt = queue->listen_opt;
273 274

	req->expires = jiffies + timeout;
275 276
	req->num_retrans = 0;
	req->num_timeout = 0;
277 278 279 280 281 282 283 284
	req->sk = NULL;
	req->dl_next = lopt->syn_table[hash];

	write_lock(&queue->syn_wait_lock);
	lopt->syn_table[hash] = req;
	write_unlock(&queue->syn_wait_lock);
}

285
#endif /* _REQUEST_SOCK_H */