4
* An implementation of the DCCP protocol
5
* Arnaldo Carvalho de Melo <acme@conectiva.com.br>
7
* This program is free software; you can redistribute it and/or
8
* modify it under the terms of the GNU General Public License
9
* as published by the Free Software Foundation; either version
10
* 2 of the License, or (at your option) any later version.
13
#include <linux/dccp.h>
14
#include <linux/gfp.h>
15
#include <linux/kernel.h>
16
#include <linux/skbuff.h>
17
#include <linux/timer.h>
21
#include <net/inet_timewait_sock.h>
28
struct inet_timewait_death_row dccp_death_row = {
29
.sysctl_max_tw_buckets = NR_FILE * 2,
30
.period = DCCP_TIMEWAIT_LEN / INET_TWDR_TWKILL_SLOTS,
31
.death_lock = __SPIN_LOCK_UNLOCKED(dccp_death_row.death_lock),
32
.hashinfo = &dccp_hashinfo,
33
.tw_timer = TIMER_INITIALIZER(inet_twdr_hangman, 0,
34
(unsigned long)&dccp_death_row),
35
.twkill_work = __WORK_INITIALIZER(dccp_death_row.twkill_work,
36
inet_twdr_twkill_work),
37
/* Short-time timewait calendar */
40
.twcal_timer = TIMER_INITIALIZER(inet_twdr_twcal_tick, 0,
41
(unsigned long)&dccp_death_row),
44
EXPORT_SYMBOL_GPL(dccp_death_row);
46
void dccp_time_wait(struct sock *sk, int state, int timeo)
48
struct inet_timewait_sock *tw = NULL;
50
if (dccp_death_row.tw_count < dccp_death_row.sysctl_max_tw_buckets)
51
tw = inet_twsk_alloc(sk, state);
54
const struct inet_connection_sock *icsk = inet_csk(sk);
55
const int rto = (icsk->icsk_rto << 2) - (icsk->icsk_rto >> 1);
56
#if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
57
if (tw->tw_family == PF_INET6) {
58
const struct ipv6_pinfo *np = inet6_sk(sk);
59
struct inet6_timewait_sock *tw6;
61
tw->tw_ipv6_offset = inet6_tw_offset(sk->sk_prot);
62
tw6 = inet6_twsk((struct sock *)tw);
63
ipv6_addr_copy(&tw6->tw_v6_daddr, &np->daddr);
64
ipv6_addr_copy(&tw6->tw_v6_rcv_saddr, &np->rcv_saddr);
65
tw->tw_ipv6only = np->ipv6only;
68
/* Linkage updates. */
69
__inet_twsk_hashdance(tw, sk, &dccp_hashinfo);
71
/* Get the TIME_WAIT timeout firing. */
75
tw->tw_timeout = DCCP_TIMEWAIT_LEN;
76
if (state == DCCP_TIME_WAIT)
77
timeo = DCCP_TIMEWAIT_LEN;
79
inet_twsk_schedule(tw, &dccp_death_row, timeo,
83
/* Sorry, if we're out of memory, just CLOSE this
84
* socket up. We've got bigger problems than
85
* non-graceful socket closings.
87
DCCP_WARN("time wait bucket table overflow\n");
93
struct sock *dccp_create_openreq_child(struct sock *sk,
94
const struct request_sock *req,
95
const struct sk_buff *skb)
98
* Step 3: Process LISTEN state
100
* (* Generate a new socket and switch to that socket *)
101
* Set S := new socket for this port pair
103
struct sock *newsk = inet_csk_clone(sk, req, GFP_ATOMIC);
106
struct dccp_request_sock *dreq = dccp_rsk(req);
107
struct inet_connection_sock *newicsk = inet_csk(newsk);
108
struct dccp_sock *newdp = dccp_sk(newsk);
110
newdp->dccps_role = DCCP_ROLE_SERVER;
111
newdp->dccps_hc_rx_ackvec = NULL;
112
newdp->dccps_service_list = NULL;
113
newdp->dccps_service = dreq->dreq_service;
114
newdp->dccps_timestamp_echo = dreq->dreq_timestamp_echo;
115
newdp->dccps_timestamp_time = dreq->dreq_timestamp_time;
116
newicsk->icsk_rto = DCCP_TIMEOUT_INIT;
118
INIT_LIST_HEAD(&newdp->dccps_featneg);
120
* Step 3: Process LISTEN state
122
* Choose S.ISS (initial seqno) or set from Init Cookies
123
* Initialize S.GAR := S.ISS
124
* Set S.ISR, S.GSR from packet (or Init Cookies)
126
* Setting AWL/AWH and SWL/SWH happens as part of the feature
127
* activation below, as these windows all depend on the local
128
* and remote Sequence Window feature values (7.5.2).
130
newdp->dccps_gss = newdp->dccps_iss = dreq->dreq_iss;
131
newdp->dccps_gar = newdp->dccps_iss;
132
newdp->dccps_gsr = newdp->dccps_isr = dreq->dreq_isr;
135
* Activate features: initialise CCIDs, sequence windows etc.
137
if (dccp_feat_activate_values(newsk, &dreq->dreq_featneg)) {
138
/* It is still raw copy of parent, so invalidate
139
* destructor and make plain sk_free() */
140
newsk->sk_destruct = NULL;
144
dccp_init_xmit_timers(newsk);
146
DCCP_INC_STATS_BH(DCCP_MIB_PASSIVEOPENS);
151
EXPORT_SYMBOL_GPL(dccp_create_openreq_child);
154
* Process an incoming packet for RESPOND sockets represented
155
* as an request_sock.
157
struct sock *dccp_check_req(struct sock *sk, struct sk_buff *skb,
158
struct request_sock *req,
159
struct request_sock **prev)
161
struct sock *child = NULL;
162
struct dccp_request_sock *dreq = dccp_rsk(req);
164
/* Check for retransmitted REQUEST */
165
if (dccp_hdr(skb)->dccph_type == DCCP_PKT_REQUEST) {
167
if (after48(DCCP_SKB_CB(skb)->dccpd_seq, dreq->dreq_isr)) {
168
dccp_pr_debug("Retransmitted REQUEST\n");
169
dreq->dreq_isr = DCCP_SKB_CB(skb)->dccpd_seq;
171
* Send another RESPONSE packet
172
* To protect against Request floods, increment retrans
173
* counter (backoff, monitored by dccp_response_timer).
176
req->rsk_ops->rtx_syn_ack(sk, req, NULL);
178
/* Network Duplicate, discard packet */
182
DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_PACKET_ERROR;
184
if (dccp_hdr(skb)->dccph_type != DCCP_PKT_ACK &&
185
dccp_hdr(skb)->dccph_type != DCCP_PKT_DATAACK)
189
if (DCCP_SKB_CB(skb)->dccpd_ack_seq != dreq->dreq_iss) {
190
dccp_pr_debug("Invalid ACK number: ack_seq=%llu, "
193
DCCP_SKB_CB(skb)->dccpd_ack_seq,
194
(unsigned long long) dreq->dreq_iss);
198
if (dccp_parse_options(sk, dreq, skb))
201
child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
203
goto listen_overflow;
205
inet_csk_reqsk_queue_unlink(sk, req, prev);
206
inet_csk_reqsk_queue_removed(sk, req);
207
inet_csk_reqsk_queue_add(sk, req, child);
211
dccp_pr_debug("listen_overflow!\n");
212
DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_TOO_BUSY;
214
if (dccp_hdr(skb)->dccph_type != DCCP_PKT_RESET)
215
req->rsk_ops->send_reset(sk, skb);
217
inet_csk_reqsk_queue_drop(sk, req, prev);
221
EXPORT_SYMBOL_GPL(dccp_check_req);
224
* Queue segment on the new socket if the new socket is active,
225
* otherwise we just shortcircuit this and continue with
228
int dccp_child_process(struct sock *parent, struct sock *child,
232
const int state = child->sk_state;
234
if (!sock_owned_by_user(child)) {
235
ret = dccp_rcv_state_process(child, skb, dccp_hdr(skb),
238
/* Wakeup parent, send SIGIO */
239
if (state == DCCP_RESPOND && child->sk_state != state)
240
parent->sk_data_ready(parent, 0);
242
/* Alas, it is possible again, because we do lookup
243
* in main socket hash table and lock on listening
244
* socket does not protect us more.
246
__sk_add_backlog(child, skb);
249
bh_unlock_sock(child);
254
EXPORT_SYMBOL_GPL(dccp_child_process);
256
void dccp_reqsk_send_ack(struct sock *sk, struct sk_buff *skb,
257
struct request_sock *rsk)
259
DCCP_BUG("DCCP-ACK packets are never sent in LISTEN/RESPOND state");
262
EXPORT_SYMBOL_GPL(dccp_reqsk_send_ack);
264
int dccp_reqsk_init(struct request_sock *req,
265
struct dccp_sock const *dp, struct sk_buff const *skb)
267
struct dccp_request_sock *dreq = dccp_rsk(req);
269
inet_rsk(req)->rmt_port = dccp_hdr(skb)->dccph_sport;
270
inet_rsk(req)->loc_port = dccp_hdr(skb)->dccph_dport;
271
inet_rsk(req)->acked = 0;
272
dreq->dreq_timestamp_echo = 0;
274
/* inherit feature negotiation options from listening socket */
275
return dccp_feat_clone_list(&dp->dccps_featneg, &dreq->dreq_featneg);
278
EXPORT_SYMBOL_GPL(dccp_reqsk_init);