blob: dcb6a1449c32271db0934486971cb718193359d5 [file] [log] [blame]
yuezonghe824eb0c2024-06-27 02:32:26 -07001/*
2 * NET Generic infrastructure for Network protocols.
3 *
4 * Definitions for request_sock
5 *
6 * Authors: Arnaldo Carvalho de Melo <acme@conectiva.com.br>
7 *
8 * From code originally in include/net/tcp.h
9 *
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License
12 * as published by the Free Software Foundation; either version
13 * 2 of the License, or (at your option) any later version.
14 */
15#ifndef _REQUEST_SOCK_H
16#define _REQUEST_SOCK_H
17
18#include <linux/slab.h>
19#include <linux/spinlock.h>
20#include <linux/types.h>
21#include <linux/bug.h>
22
23#include <net/sock.h>
24
25struct request_sock;
26struct sk_buff;
27struct dst_entry;
28struct proto;
29
30/* empty to "strongly type" an otherwise void parameter.
31 */
32struct request_values {
33};
34
35struct request_sock_ops {
36 int family;
37 int obj_size;
38 struct kmem_cache *slab;
39 char *slab_name;
40 int (*rtx_syn_ack)(struct sock *sk,
41 struct request_sock *req,
42 struct request_values *rvp);
43 void (*send_ack)(struct sock *sk, struct sk_buff *skb,
44 struct request_sock *req);
45 void (*send_reset)(struct sock *sk,
46 struct sk_buff *skb);
47 void (*destructor)(struct request_sock *req);
48 void (*syn_ack_timeout)(struct sock *sk,
49 struct request_sock *req);
50};
51
52/* struct request_sock - mini sock to represent a connection request
53 */
54struct request_sock {
55 struct request_sock *dl_next; /* Must be first member! */
56 u16 mss;
57 u8 retrans;
58 u8 cookie_ts; /* syncookie: encode tcpopts in timestamp */
59 /* The following two fields can be easily recomputed I think -AK */
60 u32 window_clamp; /* window clamp at creation time */
61 u32 rcv_wnd; /* rcv_wnd offered first time */
62 u32 ts_recent;
63 unsigned long expires;
64 const struct request_sock_ops *rsk_ops;
65 struct sock *sk;
66 u32 secid;
67 u32 peer_secid;
68};
69
70static inline struct request_sock *reqsk_alloc(const struct request_sock_ops *ops)
71{
72 struct request_sock *req = kmem_cache_alloc(ops->slab, GFP_ATOMIC);
73
74 if (req != NULL)
75 req->rsk_ops = ops;
76 netslab_inc(REQUEST_SOCK_SLAB);
77 return req;
78}
79
80static inline void __reqsk_free(struct request_sock *req)
81{
82 netslab_dec(REQUEST_SOCK_SLAB);
83 kmem_cache_free(req->rsk_ops->slab, req);
84}
85
86static inline void reqsk_free(struct request_sock *req)
87{
88 req->rsk_ops->destructor(req);
89 __reqsk_free(req);
90}
91
92extern int sysctl_max_syn_backlog;
93
94/** struct listen_sock - listen state
95 *
96 * @max_qlen_log - log_2 of maximal queued SYNs/REQUESTs
97 */
98struct listen_sock {
99 u8 max_qlen_log;
100 u8 synflood_warned;
101 /* 2 bytes hole, try to use */
102 int qlen;
103 int qlen_young;
104 int clock_hand;
105 u32 hash_rnd;
106 u32 nr_table_entries;
107 struct request_sock *syn_table[0];
108};
109
110/** struct request_sock_queue - queue of request_socks
111 *
112 * @rskq_accept_head - FIFO head of established children
113 * @rskq_accept_tail - FIFO tail of established children
114 * @rskq_defer_accept - User waits for some data after accept()
115 * @syn_wait_lock - serializer
116 *
117 * %syn_wait_lock is necessary only to avoid proc interface having to grab the main
118 * lock sock while browsing the listening hash (otherwise it's deadlock prone).
119 *
120 * This lock is acquired in read mode only from listening_get_next() seq_file
121 * op and it's acquired in write mode _only_ from code that is actively
122 * changing rskq_accept_head. All readers that are holding the master sock lock
123 * don't need to grab this lock in read mode too as rskq_accept_head. writes
124 * are always protected from the main sock lock.
125 */
126struct request_sock_queue {
127 struct request_sock *rskq_accept_head;
128 struct request_sock *rskq_accept_tail;
129 rwlock_t syn_wait_lock;
130 u8 rskq_defer_accept;
131 /* 3 bytes hole, try to pack */
132 struct listen_sock *listen_opt;
133};
134
135extern int reqsk_queue_alloc(struct request_sock_queue *queue,
136 unsigned int nr_table_entries);
137
138extern void __reqsk_queue_destroy(struct request_sock_queue *queue);
139extern void reqsk_queue_destroy(struct request_sock_queue *queue);
140
141static inline struct request_sock *
142 reqsk_queue_yank_acceptq(struct request_sock_queue *queue)
143{
144 struct request_sock *req = queue->rskq_accept_head;
145
146 queue->rskq_accept_head = NULL;
147 return req;
148}
149
150static inline int reqsk_queue_empty(struct request_sock_queue *queue)
151{
152 return queue->rskq_accept_head == NULL;
153}
154
155static inline void reqsk_queue_unlink(struct request_sock_queue *queue,
156 struct request_sock *req,
157 struct request_sock **prev_req)
158{
159 write_lock(&queue->syn_wait_lock);
160 *prev_req = req->dl_next;
161 write_unlock(&queue->syn_wait_lock);
162}
163
164static inline void reqsk_queue_add(struct request_sock_queue *queue,
165 struct request_sock *req,
166 struct sock *parent,
167 struct sock *child)
168{
169 req->sk = child;
170 sk_acceptq_added(parent);
171
172 if (queue->rskq_accept_head == NULL)
173 queue->rskq_accept_head = req;
174 else
175 queue->rskq_accept_tail->dl_next = req;
176
177 queue->rskq_accept_tail = req;
178 req->dl_next = NULL;
179}
180
181static inline struct request_sock *reqsk_queue_remove(struct request_sock_queue *queue)
182{
183 struct request_sock *req = queue->rskq_accept_head;
184
185 WARN_ON(req == NULL);
186
187 queue->rskq_accept_head = req->dl_next;
188 if (queue->rskq_accept_head == NULL)
189 queue->rskq_accept_tail = NULL;
190
191 return req;
192}
193
194static inline struct sock *reqsk_queue_get_child(struct request_sock_queue *queue,
195 struct sock *parent)
196{
197 struct request_sock *req = reqsk_queue_remove(queue);
198 struct sock *child = req->sk;
199
200 WARN_ON(child == NULL);
201
202 sk_acceptq_removed(parent);
203 __reqsk_free(req);
204 return child;
205}
206
207static inline int reqsk_queue_removed(struct request_sock_queue *queue,
208 struct request_sock *req)
209{
210 struct listen_sock *lopt = queue->listen_opt;
211
212 if (req->retrans == 0)
213 --lopt->qlen_young;
214
215 return --lopt->qlen;
216}
217
218static inline int reqsk_queue_added(struct request_sock_queue *queue)
219{
220 struct listen_sock *lopt = queue->listen_opt;
221 const int prev_qlen = lopt->qlen;
222
223 lopt->qlen_young++;
224 lopt->qlen++;
225 return prev_qlen;
226}
227
228static inline int reqsk_queue_len(const struct request_sock_queue *queue)
229{
230 return queue->listen_opt != NULL ? queue->listen_opt->qlen : 0;
231}
232
233static inline int reqsk_queue_len_young(const struct request_sock_queue *queue)
234{
235 return queue->listen_opt->qlen_young;
236}
237
238static inline int reqsk_queue_is_full(const struct request_sock_queue *queue)
239{
240 return queue->listen_opt->qlen >> queue->listen_opt->max_qlen_log;
241}
242
243static inline void reqsk_queue_hash_req(struct request_sock_queue *queue,
244 u32 hash, struct request_sock *req,
245 unsigned long timeout)
246{
247 struct listen_sock *lopt = queue->listen_opt;
248
249 req->expires = jiffies + timeout;
250 req->retrans = 0;
251 req->sk = NULL;
252 req->dl_next = lopt->syn_table[hash];
253
254 write_lock(&queue->syn_wait_lock);
255 lopt->syn_table[hash] = req;
256 write_unlock(&queue->syn_wait_lock);
257}
258
259#endif /* _REQUEST_SOCK_H */