request_sock.h 6.5 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
};

50
/* struct request_sock - mini sock to represent a connection request
51
 */
52 53
struct request_sock {
	struct request_sock		*dl_next; /* Must be first member! */
54 55
	u16				mss;
	u8				retrans;
56
	u8				cookie_ts; /* syncookie: encode tcpopts in timestamp */
57 58 59 60 61
	/* 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;
62
	const struct request_sock_ops	*rsk_ops;
63
	struct sock			*sk;
64
	u32				secid;
65
	u32				peer_secid;
66 67
};

68
static inline struct request_sock *reqsk_alloc(const struct request_sock_ops *ops)
69
{
70
	struct request_sock *req = kmem_cache_alloc(ops->slab, GFP_ATOMIC);
71 72

	if (req != NULL)
73
		req->rsk_ops = ops;
74 75 76 77

	return req;
}

78
static inline void __reqsk_free(struct request_sock *req)
79
{
80
	kmem_cache_free(req->rsk_ops->slab, req);
81 82
}

83
static inline void reqsk_free(struct request_sock *req)
84
{
85 86
	req->rsk_ops->destructor(req);
	__reqsk_free(req);
87 88
}

89 90
extern int sysctl_max_syn_backlog;

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

/** struct request_sock_queue - queue of request_socks
 *
 * @rskq_accept_head - FIFO head of established children
 * @rskq_accept_tail - FIFO tail of established children
110
 * @rskq_defer_accept - User waits for some data after accept()
111 112 113 114 115 116 117 118 119 120 121 122 123 124 125
 * @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;
126 127
	u8			rskq_defer_accept;
	/* 3 bytes hole, try to pack */
128
	struct listen_sock	*listen_opt;
129 130 131
};

extern int reqsk_queue_alloc(struct request_sock_queue *queue,
132
			     unsigned int nr_table_entries);
133

134
extern void __reqsk_queue_destroy(struct request_sock_queue *queue);
135 136
extern void reqsk_queue_destroy(struct request_sock_queue *queue);

137 138 139 140 141
static inline struct request_sock *
	reqsk_queue_yank_acceptq(struct request_sock_queue *queue)
{
	struct request_sock *req = queue->rskq_accept_head;

142
	queue->rskq_accept_head = NULL;
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 168 169 170 171 172 173 174 175 176 177 178 179 180
	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;

181
	WARN_ON(req == NULL);
182 183 184 185 186 187 188 189 190 191 192 193 194 195

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

	return req;
}

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

196
	WARN_ON(child == NULL);
197 198 199 200 201 202 203 204 205

	sk_acceptq_removed(parent);
	__reqsk_free(req);
	return child;
}

static inline int reqsk_queue_removed(struct request_sock_queue *queue,
				      struct request_sock *req)
{
206
	struct listen_sock *lopt = queue->listen_opt;
207 208 209 210 211 212 213 214 215

	if (req->retrans == 0)
		--lopt->qlen_young;

	return --lopt->qlen;
}

static inline int reqsk_queue_added(struct request_sock_queue *queue)
{
216
	struct listen_sock *lopt = queue->listen_opt;
217 218 219 220 221 222 223
	const int prev_qlen = lopt->qlen;

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

224
static inline int reqsk_queue_len(const struct request_sock_queue *queue)
225 226 227 228
{
	return queue->listen_opt != NULL ? queue->listen_opt->qlen : 0;
}

229
static inline int reqsk_queue_len_young(const struct request_sock_queue *queue)
230 231 232 233
{
	return queue->listen_opt->qlen_young;
}

234
static inline int reqsk_queue_is_full(const struct request_sock_queue *queue)
235 236 237 238 239 240
{
	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,
241
					unsigned long timeout)
242
{
243
	struct listen_sock *lopt = queue->listen_opt;
244 245 246 247 248 249 250 251 252 253 254

	req->expires = jiffies + timeout;
	req->retrans = 0;
	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);
}

255
#endif /* _REQUEST_SOCK_H */