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/kernel.h>
15 #include <linux/skbuff.h>
16 #include <linux/timer.h>
20 #include <net/inet_timewait_sock.h>
27 struct inet_timewait_death_row dccp_death_row = {
28 .sysctl_max_tw_buckets = NR_FILE * 2,
29 .period = DCCP_TIMEWAIT_LEN / INET_TWDR_TWKILL_SLOTS,
30 .death_lock = __SPIN_LOCK_UNLOCKED(dccp_death_row.death_lock),
31 .hashinfo = &dccp_hashinfo,
32 .tw_timer = TIMER_INITIALIZER(inet_twdr_hangman, 0,
33 (unsigned long)&dccp_death_row),
34 .twkill_work = __WORK_INITIALIZER(dccp_death_row.twkill_work,
35 inet_twdr_twkill_work),
36 /* Short-time timewait calendar */
39 .twcal_timer = TIMER_INITIALIZER(inet_twdr_twcal_tick, 0,
40 (unsigned long)&dccp_death_row),
43 EXPORT_SYMBOL_GPL(dccp_death_row);
45 void dccp_minisock_init(struct dccp_minisock *dmsk)
47 dmsk->dccpms_sequence_window = sysctl_dccp_feat_sequence_window;
48 dmsk->dccpms_send_ack_vector = sysctl_dccp_feat_send_ack_vector;
49 dmsk->dccpms_send_ndp_count = sysctl_dccp_feat_send_ndp_count;
52 void dccp_time_wait(struct sock *sk, int state, int timeo)
54 struct inet_timewait_sock *tw = NULL;
56 if (dccp_death_row.tw_count < dccp_death_row.sysctl_max_tw_buckets)
57 tw = inet_twsk_alloc(sk, state);
60 const struct inet_connection_sock *icsk = inet_csk(sk);
61 const int rto = (icsk->icsk_rto << 2) - (icsk->icsk_rto >> 1);
62 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
63 if (tw->tw_family == PF_INET6) {
64 const struct ipv6_pinfo *np = inet6_sk(sk);
65 struct inet6_timewait_sock *tw6;
67 tw->tw_ipv6_offset = inet6_tw_offset(sk->sk_prot);
68 tw6 = inet6_twsk((struct sock *)tw);
69 ipv6_addr_copy(&tw6->tw_v6_daddr, &np->daddr);
70 ipv6_addr_copy(&tw6->tw_v6_rcv_saddr, &np->rcv_saddr);
71 tw->tw_ipv6only = np->ipv6only;
74 /* Linkage updates. */
75 __inet_twsk_hashdance(tw, sk, &dccp_hashinfo);
77 /* Get the TIME_WAIT timeout firing. */
81 tw->tw_timeout = DCCP_TIMEWAIT_LEN;
82 if (state == DCCP_TIME_WAIT)
83 timeo = DCCP_TIMEWAIT_LEN;
85 inet_twsk_schedule(tw, &dccp_death_row, timeo,
89 /* Sorry, if we're out of memory, just CLOSE this
90 * socket up. We've got bigger problems than
91 * non-graceful socket closings.
93 DCCP_WARN("time wait bucket table overflow\n");
99 struct sock *dccp_create_openreq_child(struct sock *sk,
100 const struct request_sock *req,
101 const struct sk_buff *skb)
104 * Step 3: Process LISTEN state
106 * (* Generate a new socket and switch to that socket *)
107 * Set S := new socket for this port pair
109 struct sock *newsk = inet_csk_clone(sk, req, GFP_ATOMIC);
112 struct dccp_request_sock *dreq = dccp_rsk(req);
113 struct inet_connection_sock *newicsk = inet_csk(newsk);
114 struct dccp_sock *newdp = dccp_sk(newsk);
115 struct dccp_minisock *newdmsk = dccp_msk(newsk);
117 newdp->dccps_role = DCCP_ROLE_SERVER;
118 newdp->dccps_hc_rx_ackvec = NULL;
119 newdp->dccps_service_list = NULL;
120 newdp->dccps_service = dreq->dreq_service;
121 newdp->dccps_timestamp_echo = dreq->dreq_timestamp_echo;
122 newdp->dccps_timestamp_time = dreq->dreq_timestamp_time;
123 newicsk->icsk_rto = DCCP_TIMEOUT_INIT;
125 INIT_LIST_HEAD(&newdp->dccps_featneg);
127 * Step 3: Process LISTEN state
129 * Choose S.ISS (initial seqno) or set from Init Cookies
130 * Initialize S.GAR := S.ISS
131 * Set S.ISR, S.GSR, S.SWL, S.SWH from packet or Init Cookies
134 /* See dccp_v4_conn_request */
135 newdmsk->dccpms_sequence_window = req->rcv_wnd;
137 newdp->dccps_gar = newdp->dccps_iss = dreq->dreq_iss;
138 dccp_update_gss(newsk, dreq->dreq_iss);
140 newdp->dccps_isr = dreq->dreq_isr;
141 dccp_update_gsr(newsk, dreq->dreq_isr);
144 * SWL and AWL are initially adjusted so that they are not less than
145 * the initial Sequence Numbers received and sent, respectively:
146 * SWL := max(GSR + 1 - floor(W/4), ISR),
147 * AWL := max(GSS - W' + 1, ISS).
148 * These adjustments MUST be applied only at the beginning of the
151 dccp_set_seqno(&newdp->dccps_swl,
152 max48(newdp->dccps_swl, newdp->dccps_isr));
153 dccp_set_seqno(&newdp->dccps_awl,
154 max48(newdp->dccps_awl, newdp->dccps_iss));
157 * Activate features after initialising the sequence numbers,
158 * since CCID initialisation may depend on GSS, ISR, ISS etc.
160 if (dccp_feat_activate_values(newsk, &dreq->dreq_featneg)) {
161 /* It is still raw copy of parent, so invalidate
162 * destructor and make plain sk_free() */
163 newsk->sk_destruct = NULL;
167 dccp_init_xmit_timers(newsk);
169 DCCP_INC_STATS_BH(DCCP_MIB_PASSIVEOPENS);
174 EXPORT_SYMBOL_GPL(dccp_create_openreq_child);
177 * Process an incoming packet for RESPOND sockets represented
178 * as an request_sock.
180 struct sock *dccp_check_req(struct sock *sk, struct sk_buff *skb,
181 struct request_sock *req,
182 struct request_sock **prev)
184 struct sock *child = NULL;
185 struct dccp_request_sock *dreq = dccp_rsk(req);
187 /* Check for retransmitted REQUEST */
188 if (dccp_hdr(skb)->dccph_type == DCCP_PKT_REQUEST) {
190 if (after48(DCCP_SKB_CB(skb)->dccpd_seq, dreq->dreq_isr)) {
191 dccp_pr_debug("Retransmitted REQUEST\n");
192 dreq->dreq_isr = DCCP_SKB_CB(skb)->dccpd_seq;
194 * Send another RESPONSE packet
195 * To protect against Request floods, increment retrans
196 * counter (backoff, monitored by dccp_response_timer).
199 req->rsk_ops->rtx_syn_ack(sk, req);
201 /* Network Duplicate, discard packet */
205 DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_PACKET_ERROR;
207 if (dccp_hdr(skb)->dccph_type != DCCP_PKT_ACK &&
208 dccp_hdr(skb)->dccph_type != DCCP_PKT_DATAACK)
212 if (DCCP_SKB_CB(skb)->dccpd_ack_seq != dreq->dreq_iss) {
213 dccp_pr_debug("Invalid ACK number: ack_seq=%llu, "
216 DCCP_SKB_CB(skb)->dccpd_ack_seq,
217 (unsigned long long) dreq->dreq_iss);
221 if (dccp_parse_options(sk, dreq, skb))
224 child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL);
226 goto listen_overflow;
228 inet_csk_reqsk_queue_unlink(sk, req, prev);
229 inet_csk_reqsk_queue_removed(sk, req);
230 inet_csk_reqsk_queue_add(sk, req, child);
234 dccp_pr_debug("listen_overflow!\n");
235 DCCP_SKB_CB(skb)->dccpd_reset_code = DCCP_RESET_CODE_TOO_BUSY;
237 if (dccp_hdr(skb)->dccph_type != DCCP_PKT_RESET)
238 req->rsk_ops->send_reset(sk, skb);
240 inet_csk_reqsk_queue_drop(sk, req, prev);
244 EXPORT_SYMBOL_GPL(dccp_check_req);
247 * Queue segment on the new socket if the new socket is active,
248 * otherwise we just shortcircuit this and continue with
251 int dccp_child_process(struct sock *parent, struct sock *child,
255 const int state = child->sk_state;
257 if (!sock_owned_by_user(child)) {
258 ret = dccp_rcv_state_process(child, skb, dccp_hdr(skb),
261 /* Wakeup parent, send SIGIO */
262 if (state == DCCP_RESPOND && child->sk_state != state)
263 parent->sk_data_ready(parent, 0);
265 /* Alas, it is possible again, because we do lookup
266 * in main socket hash table and lock on listening
267 * socket does not protect us more.
269 sk_add_backlog(child, skb);
272 bh_unlock_sock(child);
277 EXPORT_SYMBOL_GPL(dccp_child_process);
279 void dccp_reqsk_send_ack(struct sock *sk, struct sk_buff *skb,
280 struct request_sock *rsk)
282 DCCP_BUG("DCCP-ACK packets are never sent in LISTEN/RESPOND state");
285 EXPORT_SYMBOL_GPL(dccp_reqsk_send_ack);
287 int dccp_reqsk_init(struct request_sock *req,
288 struct dccp_sock const *dp, struct sk_buff const *skb)
290 struct dccp_request_sock *dreq = dccp_rsk(req);
292 inet_rsk(req)->rmt_port = dccp_hdr(skb)->dccph_sport;
293 inet_rsk(req)->acked = 0;
294 req->rcv_wnd = sysctl_dccp_feat_sequence_window;
295 dreq->dreq_timestamp_echo = 0;
297 /* inherit feature negotiation options from listening socket */
298 return dccp_feat_clone_list(&dp->dccps_featneg, &dreq->dreq_featneg);
301 EXPORT_SYMBOL_GPL(dccp_reqsk_init);