2 * NET Generic infrastructure for Network protocols.
4 * Definitions for request_sock
6 * Authors: Arnaldo Carvalho de Melo <acme@conectiva.com.br>
8 * From code originally in include/net/tcp.h
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.
15 #ifndef _REQUEST_SOCK_H
16 #define _REQUEST_SOCK_H
18 #include <linux/slab.h>
19 #include <linux/spinlock.h>
20 #include <linux/types.h>
21 #include <linux/bug.h>
30 struct request_sock_ops
{
33 struct kmem_cache
*slab
;
34 int (*rtx_syn_ack
)(struct sock
*sk
,
35 struct request_sock
*req
);
36 void (*send_ack
)(struct sock
*sk
, struct sk_buff
*skb
,
37 struct request_sock
*req
);
38 void (*send_reset
)(struct sock
*sk
,
40 void (*destructor
)(struct request_sock
*req
);
43 /* struct request_sock - mini sock to represent a connection request
46 struct request_sock
*dl_next
; /* Must be first member! */
49 u8 cookie_ts
; /* syncookie: encode tcpopts in timestamp */
50 /* The following two fields can be easily recomputed I think -AK */
51 u32 window_clamp
; /* window clamp at creation time */
52 u32 rcv_wnd
; /* rcv_wnd offered first time */
54 unsigned long expires
;
55 const struct request_sock_ops
*rsk_ops
;
61 static inline struct request_sock
*reqsk_alloc(const struct request_sock_ops
*ops
)
63 struct request_sock
*req
= kmem_cache_alloc(ops
->slab
, GFP_ATOMIC
);
71 static inline void __reqsk_free(struct request_sock
*req
)
73 kmem_cache_free(req
->rsk_ops
->slab
, req
);
76 static inline void reqsk_free(struct request_sock
*req
)
78 req
->rsk_ops
->destructor(req
);
82 extern int sysctl_max_syn_backlog
;
84 /** struct listen_sock - listen state
86 * @max_qlen_log - log_2 of maximal queued SYNs/REQUESTs
90 /* 3 bytes hole, try to use */
96 struct request_sock
*syn_table
[0];
99 /** struct request_sock_queue - queue of request_socks
101 * @rskq_accept_head - FIFO head of established children
102 * @rskq_accept_tail - FIFO tail of established children
103 * @rskq_defer_accept - User waits for some data after accept()
104 * @syn_wait_lock - serializer
106 * %syn_wait_lock is necessary only to avoid proc interface having to grab the main
107 * lock sock while browsing the listening hash (otherwise it's deadlock prone).
109 * This lock is acquired in read mode only from listening_get_next() seq_file
110 * op and it's acquired in write mode _only_ from code that is actively
111 * changing rskq_accept_head. All readers that are holding the master sock lock
112 * don't need to grab this lock in read mode too as rskq_accept_head. writes
113 * are always protected from the main sock lock.
115 struct request_sock_queue
{
116 struct request_sock
*rskq_accept_head
;
117 struct request_sock
*rskq_accept_tail
;
118 rwlock_t syn_wait_lock
;
119 u8 rskq_defer_accept
;
120 /* 3 bytes hole, try to pack */
121 struct listen_sock
*listen_opt
;
124 extern int reqsk_queue_alloc(struct request_sock_queue
*queue
,
125 unsigned int nr_table_entries
);
127 extern void __reqsk_queue_destroy(struct request_sock_queue
*queue
);
128 extern void reqsk_queue_destroy(struct request_sock_queue
*queue
);
130 static inline struct request_sock
*
131 reqsk_queue_yank_acceptq(struct request_sock_queue
*queue
)
133 struct request_sock
*req
= queue
->rskq_accept_head
;
135 queue
->rskq_accept_head
= NULL
;
139 static inline int reqsk_queue_empty(struct request_sock_queue
*queue
)
141 return queue
->rskq_accept_head
== NULL
;
144 static inline void reqsk_queue_unlink(struct request_sock_queue
*queue
,
145 struct request_sock
*req
,
146 struct request_sock
**prev_req
)
148 write_lock(&queue
->syn_wait_lock
);
149 *prev_req
= req
->dl_next
;
150 write_unlock(&queue
->syn_wait_lock
);
153 static inline void reqsk_queue_add(struct request_sock_queue
*queue
,
154 struct request_sock
*req
,
159 sk_acceptq_added(parent
);
161 if (queue
->rskq_accept_head
== NULL
)
162 queue
->rskq_accept_head
= req
;
164 queue
->rskq_accept_tail
->dl_next
= req
;
166 queue
->rskq_accept_tail
= req
;
170 static inline struct request_sock
*reqsk_queue_remove(struct request_sock_queue
*queue
)
172 struct request_sock
*req
= queue
->rskq_accept_head
;
174 WARN_ON(req
== NULL
);
176 queue
->rskq_accept_head
= req
->dl_next
;
177 if (queue
->rskq_accept_head
== NULL
)
178 queue
->rskq_accept_tail
= NULL
;
183 static inline struct sock
*reqsk_queue_get_child(struct request_sock_queue
*queue
,
186 struct request_sock
*req
= reqsk_queue_remove(queue
);
187 struct sock
*child
= req
->sk
;
189 WARN_ON(child
== NULL
);
191 sk_acceptq_removed(parent
);
196 static inline int reqsk_queue_removed(struct request_sock_queue
*queue
,
197 struct request_sock
*req
)
199 struct listen_sock
*lopt
= queue
->listen_opt
;
201 if (req
->retrans
== 0)
207 static inline int reqsk_queue_added(struct request_sock_queue
*queue
)
209 struct listen_sock
*lopt
= queue
->listen_opt
;
210 const int prev_qlen
= lopt
->qlen
;
217 static inline int reqsk_queue_len(const struct request_sock_queue
*queue
)
219 return queue
->listen_opt
!= NULL
? queue
->listen_opt
->qlen
: 0;
222 static inline int reqsk_queue_len_young(const struct request_sock_queue
*queue
)
224 return queue
->listen_opt
->qlen_young
;
227 static inline int reqsk_queue_is_full(const struct request_sock_queue
*queue
)
229 return queue
->listen_opt
->qlen
>> queue
->listen_opt
->max_qlen_log
;
232 static inline void reqsk_queue_hash_req(struct request_sock_queue
*queue
,
233 u32 hash
, struct request_sock
*req
,
234 unsigned long timeout
)
236 struct listen_sock
*lopt
= queue
->listen_opt
;
238 req
->expires
= jiffies
+ timeout
;
241 req
->dl_next
= lopt
->syn_table
[hash
];
243 write_lock(&queue
->syn_wait_lock
);
244 lopt
->syn_table
[hash
] = req
;
245 write_unlock(&queue
->syn_wait_lock
);
248 #endif /* _REQUEST_SOCK_H */