4 * An implementation of the DCCP protocol
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
12 #include <linux/dccp.h>
13 #include <linux/module.h>
14 #include <linux/types.h>
15 #include <linux/sched.h>
16 #include <linux/kernel.h>
17 #include <linux/skbuff.h>
18 #include <linux/netdevice.h>
20 #include <linux/if_arp.h>
21 #include <linux/init.h>
22 #include <linux/random.h>
23 #include <linux/slab.h>
24 #include <net/checksum.h>
26 #include <net/inet_sock.h>
27 #include <net/inet_common.h>
31 #include <asm/ioctls.h>
32 #include <linux/spinlock.h>
33 #include <linux/timer.h>
34 #include <linux/delay.h>
35 #include <linux/poll.h>
41 DEFINE_SNMP_STAT(struct dccp_mib, dccp_statistics) __read_mostly;
43 EXPORT_SYMBOL_GPL(dccp_statistics);
45 struct percpu_counter dccp_orphan_count;
46 EXPORT_SYMBOL_GPL(dccp_orphan_count);
48 struct inet_hashinfo dccp_hashinfo;
49 EXPORT_SYMBOL_GPL(dccp_hashinfo);
51 /* the maximum queue length for tx in packets. 0 is no limit */
52 int sysctl_dccp_tx_qlen __read_mostly = 5;
54 #ifdef CONFIG_IP_DCCP_DEBUG
55 static const char *dccp_state_name(const int state)
57 static const char *const dccp_state_names[] = {
59 [DCCP_REQUESTING] = "REQUESTING",
60 [DCCP_PARTOPEN] = "PARTOPEN",
61 [DCCP_LISTEN] = "LISTEN",
62 [DCCP_RESPOND] = "RESPOND",
63 [DCCP_CLOSING] = "CLOSING",
64 [DCCP_ACTIVE_CLOSEREQ] = "CLOSEREQ",
65 [DCCP_PASSIVE_CLOSE] = "PASSIVE_CLOSE",
66 [DCCP_PASSIVE_CLOSEREQ] = "PASSIVE_CLOSEREQ",
67 [DCCP_TIME_WAIT] = "TIME_WAIT",
68 [DCCP_CLOSED] = "CLOSED",
71 if (state >= DCCP_MAX_STATES)
72 return "INVALID STATE!";
74 return dccp_state_names[state];
78 void dccp_set_state(struct sock *sk, const int state)
80 const int oldstate = sk->sk_state;
82 dccp_pr_debug("%s(%p) %s --> %s\n", dccp_role(sk), sk,
83 dccp_state_name(oldstate), dccp_state_name(state));
84 WARN_ON(state == oldstate);
88 if (oldstate != DCCP_OPEN)
89 DCCP_INC_STATS(DCCP_MIB_CURRESTAB);
90 /* Client retransmits all Confirm options until entering OPEN */
91 if (oldstate == DCCP_PARTOPEN)
92 dccp_feat_list_purge(&dccp_sk(sk)->dccps_featneg);
96 if (oldstate == DCCP_OPEN || oldstate == DCCP_ACTIVE_CLOSEREQ ||
97 oldstate == DCCP_CLOSING)
98 DCCP_INC_STATS(DCCP_MIB_ESTABRESETS);
100 sk->sk_prot->unhash(sk);
101 if (inet_csk(sk)->icsk_bind_hash != NULL &&
102 !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
106 if (oldstate == DCCP_OPEN)
107 DCCP_DEC_STATS(DCCP_MIB_CURRESTAB);
110 /* Change state AFTER socket is unhashed to avoid closed
111 * socket sitting in hash tables.
113 sk->sk_state = state;
116 EXPORT_SYMBOL_GPL(dccp_set_state);
118 static void dccp_finish_passive_close(struct sock *sk)
120 switch (sk->sk_state) {
121 case DCCP_PASSIVE_CLOSE:
122 /* Node (client or server) has received Close packet. */
123 dccp_send_reset(sk, DCCP_RESET_CODE_CLOSED);
124 dccp_set_state(sk, DCCP_CLOSED);
126 case DCCP_PASSIVE_CLOSEREQ:
128 * Client received CloseReq. We set the `active' flag so that
129 * dccp_send_close() retransmits the Close as per RFC 4340, 8.3.
131 dccp_send_close(sk, 1);
132 dccp_set_state(sk, DCCP_CLOSING);
136 void dccp_done(struct sock *sk)
138 dccp_set_state(sk, DCCP_CLOSED);
139 dccp_clear_xmit_timers(sk);
141 sk->sk_shutdown = SHUTDOWN_MASK;
143 if (!sock_flag(sk, SOCK_DEAD))
144 sk->sk_state_change(sk);
146 inet_csk_destroy_sock(sk);
149 EXPORT_SYMBOL_GPL(dccp_done);
151 const char *dccp_packet_name(const int type)
153 static const char *const dccp_packet_names[] = {
154 [DCCP_PKT_REQUEST] = "REQUEST",
155 [DCCP_PKT_RESPONSE] = "RESPONSE",
156 [DCCP_PKT_DATA] = "DATA",
157 [DCCP_PKT_ACK] = "ACK",
158 [DCCP_PKT_DATAACK] = "DATAACK",
159 [DCCP_PKT_CLOSEREQ] = "CLOSEREQ",
160 [DCCP_PKT_CLOSE] = "CLOSE",
161 [DCCP_PKT_RESET] = "RESET",
162 [DCCP_PKT_SYNC] = "SYNC",
163 [DCCP_PKT_SYNCACK] = "SYNCACK",
166 if (type >= DCCP_NR_PKT_TYPES)
169 return dccp_packet_names[type];
172 EXPORT_SYMBOL_GPL(dccp_packet_name);
174 static void dccp_sk_destruct(struct sock *sk)
176 struct dccp_sock *dp = dccp_sk(sk);
178 ccid_hc_tx_delete(dp->dccps_hc_tx_ccid, sk);
179 dp->dccps_hc_tx_ccid = NULL;
180 inet_sock_destruct(sk);
183 int dccp_init_sock(struct sock *sk, const __u8 ctl_sock_initialized)
185 struct dccp_sock *dp = dccp_sk(sk);
186 struct inet_connection_sock *icsk = inet_csk(sk);
188 icsk->icsk_rto = DCCP_TIMEOUT_INIT;
189 icsk->icsk_syn_retries = sysctl_dccp_request_retries;
190 sk->sk_state = DCCP_CLOSED;
191 sk->sk_write_space = dccp_write_space;
192 sk->sk_destruct = dccp_sk_destruct;
193 icsk->icsk_sync_mss = dccp_sync_mss;
194 dp->dccps_mss_cache = 536;
195 dp->dccps_rate_last = jiffies;
196 dp->dccps_role = DCCP_ROLE_UNDEFINED;
197 dp->dccps_service = DCCP_SERVICE_CODE_IS_ABSENT;
198 dp->dccps_tx_qlen = sysctl_dccp_tx_qlen;
200 dccp_init_xmit_timers(sk);
202 INIT_LIST_HEAD(&dp->dccps_featneg);
203 /* control socket doesn't need feat nego */
204 if (likely(ctl_sock_initialized))
205 return dccp_feat_init(sk);
209 EXPORT_SYMBOL_GPL(dccp_init_sock);
211 void dccp_destroy_sock(struct sock *sk)
213 struct dccp_sock *dp = dccp_sk(sk);
215 __skb_queue_purge(&sk->sk_write_queue);
216 if (sk->sk_send_head != NULL) {
217 kfree_skb(sk->sk_send_head);
218 sk->sk_send_head = NULL;
221 /* Clean up a referenced DCCP bind bucket. */
222 if (inet_csk(sk)->icsk_bind_hash != NULL)
225 kfree(dp->dccps_service_list);
226 dp->dccps_service_list = NULL;
228 if (dp->dccps_hc_rx_ackvec != NULL) {
229 dccp_ackvec_free(dp->dccps_hc_rx_ackvec);
230 dp->dccps_hc_rx_ackvec = NULL;
232 ccid_hc_rx_delete(dp->dccps_hc_rx_ccid, sk);
233 dp->dccps_hc_rx_ccid = NULL;
235 /* clean up feature negotiation state */
236 dccp_feat_list_purge(&dp->dccps_featneg);
239 EXPORT_SYMBOL_GPL(dccp_destroy_sock);
241 static inline int dccp_listen_start(struct sock *sk, int backlog)
243 struct dccp_sock *dp = dccp_sk(sk);
245 dp->dccps_role = DCCP_ROLE_LISTEN;
246 /* do not start to listen if feature negotiation setup fails */
247 if (dccp_feat_finalise_settings(dp))
249 return inet_csk_listen_start(sk, backlog);
252 static inline int dccp_need_reset(int state)
254 return state != DCCP_CLOSED && state != DCCP_LISTEN &&
255 state != DCCP_REQUESTING;
258 int dccp_disconnect(struct sock *sk, int flags)
260 struct inet_connection_sock *icsk = inet_csk(sk);
261 struct inet_sock *inet = inet_sk(sk);
263 const int old_state = sk->sk_state;
265 if (old_state != DCCP_CLOSED)
266 dccp_set_state(sk, DCCP_CLOSED);
269 * This corresponds to the ABORT function of RFC793, sec. 3.8
270 * TCP uses a RST segment, DCCP a Reset packet with Code 2, "Aborted".
272 if (old_state == DCCP_LISTEN) {
273 inet_csk_listen_stop(sk);
274 } else if (dccp_need_reset(old_state)) {
275 dccp_send_reset(sk, DCCP_RESET_CODE_ABORTED);
276 sk->sk_err = ECONNRESET;
277 } else if (old_state == DCCP_REQUESTING)
278 sk->sk_err = ECONNRESET;
280 dccp_clear_xmit_timers(sk);
282 __skb_queue_purge(&sk->sk_receive_queue);
283 __skb_queue_purge(&sk->sk_write_queue);
284 if (sk->sk_send_head != NULL) {
285 __kfree_skb(sk->sk_send_head);
286 sk->sk_send_head = NULL;
289 inet->inet_dport = 0;
291 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
292 inet_reset_saddr(sk);
295 sock_reset_flag(sk, SOCK_DONE);
297 icsk->icsk_backoff = 0;
298 inet_csk_delack_init(sk);
301 WARN_ON(inet->inet_num && !icsk->icsk_bind_hash);
303 sk->sk_error_report(sk);
307 EXPORT_SYMBOL_GPL(dccp_disconnect);
310 * Wait for a DCCP event.
312 * Note that we don't need to lock the socket, as the upper poll layers
313 * take care of normal races (between the test and the event) and we don't
314 * go look at any of the socket buffers directly.
316 unsigned int dccp_poll(struct file *file, struct socket *sock,
320 struct sock *sk = sock->sk;
322 sock_poll_wait(file, sk_sleep(sk), wait);
323 if (sk->sk_state == DCCP_LISTEN)
324 return inet_csk_listen_poll(sk);
326 /* Socket is not locked. We are protected from async events
327 by poll logic and correct handling of state changes
328 made by another threads is impossible in any case.
335 if (sk->sk_shutdown == SHUTDOWN_MASK || sk->sk_state == DCCP_CLOSED)
337 if (sk->sk_shutdown & RCV_SHUTDOWN)
338 mask |= POLLIN | POLLRDNORM | POLLRDHUP;
341 if ((1 << sk->sk_state) & ~(DCCPF_REQUESTING | DCCPF_RESPOND)) {
342 if (atomic_read(&sk->sk_rmem_alloc) > 0)
343 mask |= POLLIN | POLLRDNORM;
345 if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
346 if (sk_stream_is_writeable(sk)) {
347 mask |= POLLOUT | POLLWRNORM;
348 } else { /* send SIGIO later */
349 sk_set_bit(SOCKWQ_ASYNC_NOSPACE, sk);
350 set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
352 /* Race breaker. If space is freed after
353 * wspace test but before the flags are set,
354 * IO signal will be lost.
356 if (sk_stream_is_writeable(sk))
357 mask |= POLLOUT | POLLWRNORM;
364 EXPORT_SYMBOL_GPL(dccp_poll);
366 int dccp_ioctl(struct sock *sk, int cmd, unsigned long arg)
372 if (sk->sk_state == DCCP_LISTEN)
378 unsigned long amount = 0;
380 skb = skb_peek(&sk->sk_receive_queue);
383 * We will only return the amount of this packet since
384 * that is all that will be read.
388 rc = put_user(amount, (int __user *)arg);
400 EXPORT_SYMBOL_GPL(dccp_ioctl);
402 static int dccp_setsockopt_service(struct sock *sk, const __be32 service,
403 char __user *optval, unsigned int optlen)
405 struct dccp_sock *dp = dccp_sk(sk);
406 struct dccp_service_list *sl = NULL;
408 if (service == DCCP_SERVICE_INVALID_VALUE ||
409 optlen > DCCP_SERVICE_LIST_MAX_LEN * sizeof(u32))
412 if (optlen > sizeof(service)) {
413 sl = kmalloc(optlen, GFP_KERNEL);
417 sl->dccpsl_nr = optlen / sizeof(u32) - 1;
418 if (copy_from_user(sl->dccpsl_list,
419 optval + sizeof(service),
420 optlen - sizeof(service)) ||
421 dccp_list_has_service(sl, DCCP_SERVICE_INVALID_VALUE)) {
428 dp->dccps_service = service;
430 kfree(dp->dccps_service_list);
432 dp->dccps_service_list = sl;
437 static int dccp_setsockopt_cscov(struct sock *sk, int cscov, bool rx)
442 if (cscov < 0 || cscov > 15)
445 * Populate a list of permissible values, in the range cscov...15. This
446 * is necessary since feature negotiation of single values only works if
447 * both sides incidentally choose the same value. Since the list starts
448 * lowest-value first, negotiation will pick the smallest shared value.
454 list = kmalloc(len, GFP_KERNEL);
458 for (i = 0; i < len; i++)
461 rc = dccp_feat_register_sp(sk, DCCPF_MIN_CSUM_COVER, rx, list, len);
465 dccp_sk(sk)->dccps_pcrlen = cscov;
467 dccp_sk(sk)->dccps_pcslen = cscov;
473 static int dccp_setsockopt_ccid(struct sock *sk, int type,
474 char __user *optval, unsigned int optlen)
479 if (optlen < 1 || optlen > DCCP_FEAT_MAX_SP_VALS)
482 val = memdup_user(optval, optlen);
487 if (type == DCCP_SOCKOPT_TX_CCID || type == DCCP_SOCKOPT_CCID)
488 rc = dccp_feat_register_sp(sk, DCCPF_CCID, 1, val, optlen);
490 if (!rc && (type == DCCP_SOCKOPT_RX_CCID || type == DCCP_SOCKOPT_CCID))
491 rc = dccp_feat_register_sp(sk, DCCPF_CCID, 0, val, optlen);
498 static int do_dccp_setsockopt(struct sock *sk, int level, int optname,
499 char __user *optval, unsigned int optlen)
501 struct dccp_sock *dp = dccp_sk(sk);
505 case DCCP_SOCKOPT_PACKET_SIZE:
506 DCCP_WARN("sockopt(PACKET_SIZE) is deprecated: fix your app\n");
508 case DCCP_SOCKOPT_CHANGE_L:
509 case DCCP_SOCKOPT_CHANGE_R:
510 DCCP_WARN("sockopt(CHANGE_L/R) is deprecated: fix your app\n");
512 case DCCP_SOCKOPT_CCID:
513 case DCCP_SOCKOPT_RX_CCID:
514 case DCCP_SOCKOPT_TX_CCID:
515 return dccp_setsockopt_ccid(sk, optname, optval, optlen);
518 if (optlen < (int)sizeof(int))
521 if (get_user(val, (int __user *)optval))
524 if (optname == DCCP_SOCKOPT_SERVICE)
525 return dccp_setsockopt_service(sk, val, optval, optlen);
529 case DCCP_SOCKOPT_SERVER_TIMEWAIT:
530 if (dp->dccps_role != DCCP_ROLE_SERVER)
533 dp->dccps_server_timewait = (val != 0);
535 case DCCP_SOCKOPT_SEND_CSCOV:
536 err = dccp_setsockopt_cscov(sk, val, false);
538 case DCCP_SOCKOPT_RECV_CSCOV:
539 err = dccp_setsockopt_cscov(sk, val, true);
541 case DCCP_SOCKOPT_QPOLICY_ID:
542 if (sk->sk_state != DCCP_CLOSED)
544 else if (val < 0 || val >= DCCPQ_POLICY_MAX)
547 dp->dccps_qpolicy = val;
549 case DCCP_SOCKOPT_QPOLICY_TXQLEN:
553 dp->dccps_tx_qlen = val;
564 int dccp_setsockopt(struct sock *sk, int level, int optname,
565 char __user *optval, unsigned int optlen)
567 if (level != SOL_DCCP)
568 return inet_csk(sk)->icsk_af_ops->setsockopt(sk, level,
571 return do_dccp_setsockopt(sk, level, optname, optval, optlen);
574 EXPORT_SYMBOL_GPL(dccp_setsockopt);
577 int compat_dccp_setsockopt(struct sock *sk, int level, int optname,
578 char __user *optval, unsigned int optlen)
580 if (level != SOL_DCCP)
581 return inet_csk_compat_setsockopt(sk, level, optname,
583 return do_dccp_setsockopt(sk, level, optname, optval, optlen);
586 EXPORT_SYMBOL_GPL(compat_dccp_setsockopt);
589 static int dccp_getsockopt_service(struct sock *sk, int len,
590 __be32 __user *optval,
593 const struct dccp_sock *dp = dccp_sk(sk);
594 const struct dccp_service_list *sl;
595 int err = -ENOENT, slen = 0, total_len = sizeof(u32);
598 if ((sl = dp->dccps_service_list) != NULL) {
599 slen = sl->dccpsl_nr * sizeof(u32);
608 if (put_user(total_len, optlen) ||
609 put_user(dp->dccps_service, optval) ||
610 (sl != NULL && copy_to_user(optval + 1, sl->dccpsl_list, slen)))
617 static int do_dccp_getsockopt(struct sock *sk, int level, int optname,
618 char __user *optval, int __user *optlen)
620 struct dccp_sock *dp;
623 if (get_user(len, optlen))
626 if (len < (int)sizeof(int))
632 case DCCP_SOCKOPT_PACKET_SIZE:
633 DCCP_WARN("sockopt(PACKET_SIZE) is deprecated: fix your app\n");
635 case DCCP_SOCKOPT_SERVICE:
636 return dccp_getsockopt_service(sk, len,
637 (__be32 __user *)optval, optlen);
638 case DCCP_SOCKOPT_GET_CUR_MPS:
639 val = dp->dccps_mss_cache;
641 case DCCP_SOCKOPT_AVAILABLE_CCIDS:
642 return ccid_getsockopt_builtin_ccids(sk, len, optval, optlen);
643 case DCCP_SOCKOPT_TX_CCID:
644 val = ccid_get_current_tx_ccid(dp);
648 case DCCP_SOCKOPT_RX_CCID:
649 val = ccid_get_current_rx_ccid(dp);
653 case DCCP_SOCKOPT_SERVER_TIMEWAIT:
654 val = dp->dccps_server_timewait;
656 case DCCP_SOCKOPT_SEND_CSCOV:
657 val = dp->dccps_pcslen;
659 case DCCP_SOCKOPT_RECV_CSCOV:
660 val = dp->dccps_pcrlen;
662 case DCCP_SOCKOPT_QPOLICY_ID:
663 val = dp->dccps_qpolicy;
665 case DCCP_SOCKOPT_QPOLICY_TXQLEN:
666 val = dp->dccps_tx_qlen;
669 return ccid_hc_rx_getsockopt(dp->dccps_hc_rx_ccid, sk, optname,
670 len, (u32 __user *)optval, optlen);
672 return ccid_hc_tx_getsockopt(dp->dccps_hc_tx_ccid, sk, optname,
673 len, (u32 __user *)optval, optlen);
679 if (put_user(len, optlen) || copy_to_user(optval, &val, len))
685 int dccp_getsockopt(struct sock *sk, int level, int optname,
686 char __user *optval, int __user *optlen)
688 if (level != SOL_DCCP)
689 return inet_csk(sk)->icsk_af_ops->getsockopt(sk, level,
692 return do_dccp_getsockopt(sk, level, optname, optval, optlen);
695 EXPORT_SYMBOL_GPL(dccp_getsockopt);
698 int compat_dccp_getsockopt(struct sock *sk, int level, int optname,
699 char __user *optval, int __user *optlen)
701 if (level != SOL_DCCP)
702 return inet_csk_compat_getsockopt(sk, level, optname,
704 return do_dccp_getsockopt(sk, level, optname, optval, optlen);
707 EXPORT_SYMBOL_GPL(compat_dccp_getsockopt);
710 static int dccp_msghdr_parse(struct msghdr *msg, struct sk_buff *skb)
712 struct cmsghdr *cmsg;
715 * Assign an (opaque) qpolicy priority value to skb->priority.
717 * We are overloading this skb field for use with the qpolicy subystem.
718 * The skb->priority is normally used for the SO_PRIORITY option, which
719 * is initialised from sk_priority. Since the assignment of sk_priority
720 * to skb->priority happens later (on layer 3), we overload this field
721 * for use with queueing priorities as long as the skb is on layer 4.
722 * The default priority value (if nothing is set) is 0.
726 for_each_cmsghdr(cmsg, msg) {
727 if (!CMSG_OK(msg, cmsg))
730 if (cmsg->cmsg_level != SOL_DCCP)
733 if (cmsg->cmsg_type <= DCCP_SCM_QPOLICY_MAX &&
734 !dccp_qpolicy_param_ok(skb->sk, cmsg->cmsg_type))
737 switch (cmsg->cmsg_type) {
738 case DCCP_SCM_PRIORITY:
739 if (cmsg->cmsg_len != CMSG_LEN(sizeof(__u32)))
741 skb->priority = *(__u32 *)CMSG_DATA(cmsg);
750 int dccp_sendmsg(struct sock *sk, struct msghdr *msg, size_t len)
752 const struct dccp_sock *dp = dccp_sk(sk);
753 const int flags = msg->msg_flags;
754 const int noblock = flags & MSG_DONTWAIT;
759 if (len > dp->dccps_mss_cache)
764 if (dccp_qpolicy_full(sk)) {
769 timeo = sock_sndtimeo(sk, noblock);
772 * We have to use sk_stream_wait_connect here to set sk_write_pending,
773 * so that the trick in dccp_rcv_request_sent_state_process.
775 /* Wait for a connection to finish. */
776 if ((1 << sk->sk_state) & ~(DCCPF_OPEN | DCCPF_PARTOPEN))
777 if ((rc = sk_stream_wait_connect(sk, &timeo)) != 0)
780 size = sk->sk_prot->max_header + len;
782 skb = sock_alloc_send_skb(sk, size, noblock, &rc);
787 skb_reserve(skb, sk->sk_prot->max_header);
788 rc = memcpy_from_msg(skb_put(skb, len), msg, len);
792 rc = dccp_msghdr_parse(msg, skb);
796 dccp_qpolicy_push(sk, skb);
798 * The xmit_timer is set if the TX CCID is rate-based and will expire
799 * when congestion control permits to release further packets into the
800 * network. Window-based CCIDs do not use this timer.
802 if (!timer_pending(&dp->dccps_xmit_timer))
812 EXPORT_SYMBOL_GPL(dccp_sendmsg);
814 int dccp_recvmsg(struct sock *sk, struct msghdr *msg, size_t len, int nonblock,
815 int flags, int *addr_len)
817 const struct dccp_hdr *dh;
822 if (sk->sk_state == DCCP_LISTEN) {
827 timeo = sock_rcvtimeo(sk, nonblock);
830 struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
833 goto verify_sock_status;
837 switch (dh->dccph_type) {
839 case DCCP_PKT_DATAACK:
843 case DCCP_PKT_CLOSEREQ:
844 if (!(flags & MSG_PEEK))
845 dccp_finish_passive_close(sk);
848 dccp_pr_debug("found fin (%s) ok!\n",
849 dccp_packet_name(dh->dccph_type));
853 dccp_pr_debug("packet_type=%s\n",
854 dccp_packet_name(dh->dccph_type));
858 if (sock_flag(sk, SOCK_DONE)) {
864 len = sock_error(sk);
868 if (sk->sk_shutdown & RCV_SHUTDOWN) {
873 if (sk->sk_state == DCCP_CLOSED) {
874 if (!sock_flag(sk, SOCK_DONE)) {
875 /* This occurs when user tries to read
876 * from never connected socket.
890 if (signal_pending(current)) {
891 len = sock_intr_errno(timeo);
895 sk_wait_data(sk, &timeo, NULL);
900 else if (len < skb->len)
901 msg->msg_flags |= MSG_TRUNC;
903 if (skb_copy_datagram_msg(skb, 0, msg, len)) {
904 /* Exception. Bailout! */
908 if (flags & MSG_TRUNC)
911 if (!(flags & MSG_PEEK))
920 EXPORT_SYMBOL_GPL(dccp_recvmsg);
922 int inet_dccp_listen(struct socket *sock, int backlog)
924 struct sock *sk = sock->sk;
925 unsigned char old_state;
931 if (sock->state != SS_UNCONNECTED || sock->type != SOCK_DCCP)
934 old_state = sk->sk_state;
935 if (!((1 << old_state) & (DCCPF_CLOSED | DCCPF_LISTEN)))
938 /* Really, if the socket is already in listen state
939 * we can only allow the backlog to be adjusted.
941 if (old_state != DCCP_LISTEN) {
943 * FIXME: here it probably should be sk->sk_prot->listen_start
944 * see tcp_listen_start
946 err = dccp_listen_start(sk, backlog);
950 sk->sk_max_ack_backlog = backlog;
958 EXPORT_SYMBOL_GPL(inet_dccp_listen);
960 static void dccp_terminate_connection(struct sock *sk)
962 u8 next_state = DCCP_CLOSED;
964 switch (sk->sk_state) {
965 case DCCP_PASSIVE_CLOSE:
966 case DCCP_PASSIVE_CLOSEREQ:
967 dccp_finish_passive_close(sk);
970 dccp_pr_debug("Stop PARTOPEN timer (%p)\n", sk);
971 inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
974 dccp_send_close(sk, 1);
976 if (dccp_sk(sk)->dccps_role == DCCP_ROLE_SERVER &&
977 !dccp_sk(sk)->dccps_server_timewait)
978 next_state = DCCP_ACTIVE_CLOSEREQ;
980 next_state = DCCP_CLOSING;
983 dccp_set_state(sk, next_state);
987 void dccp_close(struct sock *sk, long timeout)
989 struct dccp_sock *dp = dccp_sk(sk);
991 u32 data_was_unread = 0;
996 sk->sk_shutdown = SHUTDOWN_MASK;
998 if (sk->sk_state == DCCP_LISTEN) {
999 dccp_set_state(sk, DCCP_CLOSED);
1002 inet_csk_listen_stop(sk);
1004 goto adjudge_to_death;
1007 sk_stop_timer(sk, &dp->dccps_xmit_timer);
1010 * We need to flush the recv. buffs. We do this only on the
1011 * descriptor close, not protocol-sourced closes, because the
1012 *reader process may not have drained the data yet!
1014 while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
1015 data_was_unread += skb->len;
1019 /* If socket has been already reset kill it. */
1020 if (sk->sk_state == DCCP_CLOSED)
1021 goto adjudge_to_death;
1023 if (data_was_unread) {
1024 /* Unread data was tossed, send an appropriate Reset Code */
1025 DCCP_WARN("ABORT with %u bytes unread\n", data_was_unread);
1026 dccp_send_reset(sk, DCCP_RESET_CODE_ABORTED);
1027 dccp_set_state(sk, DCCP_CLOSED);
1028 } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
1029 /* Check zero linger _after_ checking for unread data. */
1030 sk->sk_prot->disconnect(sk, 0);
1031 } else if (sk->sk_state != DCCP_CLOSED) {
1033 * Normal connection termination. May need to wait if there are
1034 * still packets in the TX queue that are delayed by the CCID.
1036 dccp_flush_write_queue(sk, &timeout);
1037 dccp_terminate_connection(sk);
1041 * Flush write queue. This may be necessary in several cases:
1042 * - we have been closed by the peer but still have application data;
1043 * - abortive termination (unread data or zero linger time),
1044 * - normal termination but queue could not be flushed within time limit
1046 __skb_queue_purge(&sk->sk_write_queue);
1048 sk_stream_wait_close(sk, timeout);
1051 state = sk->sk_state;
1056 * It is the last release_sock in its life. It will remove backlog.
1060 * Now socket is owned by kernel and we acquire BH lock
1061 * to finish close. No need to check for user refs.
1065 WARN_ON(sock_owned_by_user(sk));
1067 percpu_counter_inc(sk->sk_prot->orphan_count);
1069 /* Have we already been destroyed by a softirq or backlog? */
1070 if (state != DCCP_CLOSED && sk->sk_state == DCCP_CLOSED)
1073 if (sk->sk_state == DCCP_CLOSED)
1074 inet_csk_destroy_sock(sk);
1076 /* Otherwise, socket is reprieved until protocol close. */
1084 EXPORT_SYMBOL_GPL(dccp_close);
1086 void dccp_shutdown(struct sock *sk, int how)
1088 dccp_pr_debug("called shutdown(%x)\n", how);
1091 EXPORT_SYMBOL_GPL(dccp_shutdown);
1093 static inline int __init dccp_mib_init(void)
1095 dccp_statistics = alloc_percpu(struct dccp_mib);
1096 if (!dccp_statistics)
1101 static inline void dccp_mib_exit(void)
1103 free_percpu(dccp_statistics);
1106 static int thash_entries;
1107 module_param(thash_entries, int, 0444);
1108 MODULE_PARM_DESC(thash_entries, "Number of ehash buckets");
1110 #ifdef CONFIG_IP_DCCP_DEBUG
1112 module_param(dccp_debug, bool, 0644);
1113 MODULE_PARM_DESC(dccp_debug, "Enable debug messages");
1115 EXPORT_SYMBOL_GPL(dccp_debug);
1118 static int __init dccp_init(void)
1121 int ehash_order, bhash_order, i;
1124 BUILD_BUG_ON(sizeof(struct dccp_skb_cb) >
1125 FIELD_SIZEOF(struct sk_buff, cb));
1126 rc = percpu_counter_init(&dccp_orphan_count, 0, GFP_KERNEL);
1130 inet_hashinfo_init(&dccp_hashinfo);
1131 dccp_hashinfo.bind_bucket_cachep =
1132 kmem_cache_create("dccp_bind_bucket",
1133 sizeof(struct inet_bind_bucket), 0,
1134 SLAB_HWCACHE_ALIGN, NULL);
1135 if (!dccp_hashinfo.bind_bucket_cachep)
1136 goto out_free_percpu;
1139 * Size and allocate the main established and bind bucket
1142 * The methodology is similar to that of the buffer cache.
1144 if (totalram_pages >= (128 * 1024))
1145 goal = totalram_pages >> (21 - PAGE_SHIFT);
1147 goal = totalram_pages >> (23 - PAGE_SHIFT);
1150 goal = (thash_entries *
1151 sizeof(struct inet_ehash_bucket)) >> PAGE_SHIFT;
1152 for (ehash_order = 0; (1UL << ehash_order) < goal; ehash_order++)
1155 unsigned long hash_size = (1UL << ehash_order) * PAGE_SIZE /
1156 sizeof(struct inet_ehash_bucket);
1158 while (hash_size & (hash_size - 1))
1160 dccp_hashinfo.ehash_mask = hash_size - 1;
1161 dccp_hashinfo.ehash = (struct inet_ehash_bucket *)
1162 __get_free_pages(GFP_ATOMIC|__GFP_NOWARN, ehash_order);
1163 } while (!dccp_hashinfo.ehash && --ehash_order > 0);
1165 if (!dccp_hashinfo.ehash) {
1166 DCCP_CRIT("Failed to allocate DCCP established hash table");
1167 goto out_free_bind_bucket_cachep;
1170 for (i = 0; i <= dccp_hashinfo.ehash_mask; i++)
1171 INIT_HLIST_NULLS_HEAD(&dccp_hashinfo.ehash[i].chain, i);
1173 if (inet_ehash_locks_alloc(&dccp_hashinfo))
1174 goto out_free_dccp_ehash;
1176 bhash_order = ehash_order;
1179 dccp_hashinfo.bhash_size = (1UL << bhash_order) * PAGE_SIZE /
1180 sizeof(struct inet_bind_hashbucket);
1181 if ((dccp_hashinfo.bhash_size > (64 * 1024)) &&
1184 dccp_hashinfo.bhash = (struct inet_bind_hashbucket *)
1185 __get_free_pages(GFP_ATOMIC|__GFP_NOWARN, bhash_order);
1186 } while (!dccp_hashinfo.bhash && --bhash_order >= 0);
1188 if (!dccp_hashinfo.bhash) {
1189 DCCP_CRIT("Failed to allocate DCCP bind hash table");
1190 goto out_free_dccp_locks;
1193 for (i = 0; i < dccp_hashinfo.bhash_size; i++) {
1194 spin_lock_init(&dccp_hashinfo.bhash[i].lock);
1195 INIT_HLIST_HEAD(&dccp_hashinfo.bhash[i].chain);
1198 rc = dccp_mib_init();
1200 goto out_free_dccp_bhash;
1202 rc = dccp_ackvec_init();
1204 goto out_free_dccp_mib;
1206 rc = dccp_sysctl_init();
1208 goto out_ackvec_exit;
1210 rc = ccid_initialize_builtins();
1212 goto out_sysctl_exit;
1214 dccp_timestamping_init();
1224 out_free_dccp_bhash:
1225 free_pages((unsigned long)dccp_hashinfo.bhash, bhash_order);
1226 out_free_dccp_locks:
1227 inet_ehash_locks_free(&dccp_hashinfo);
1228 out_free_dccp_ehash:
1229 free_pages((unsigned long)dccp_hashinfo.ehash, ehash_order);
1230 out_free_bind_bucket_cachep:
1231 kmem_cache_destroy(dccp_hashinfo.bind_bucket_cachep);
1233 percpu_counter_destroy(&dccp_orphan_count);
1235 dccp_hashinfo.bhash = NULL;
1236 dccp_hashinfo.ehash = NULL;
1237 dccp_hashinfo.bind_bucket_cachep = NULL;
1241 static void __exit dccp_fini(void)
1243 ccid_cleanup_builtins();
1245 free_pages((unsigned long)dccp_hashinfo.bhash,
1246 get_order(dccp_hashinfo.bhash_size *
1247 sizeof(struct inet_bind_hashbucket)));
1248 free_pages((unsigned long)dccp_hashinfo.ehash,
1249 get_order((dccp_hashinfo.ehash_mask + 1) *
1250 sizeof(struct inet_ehash_bucket)));
1251 inet_ehash_locks_free(&dccp_hashinfo);
1252 kmem_cache_destroy(dccp_hashinfo.bind_bucket_cachep);
1255 percpu_counter_destroy(&dccp_orphan_count);
1258 module_init(dccp_init);
1259 module_exit(dccp_fini);
1261 MODULE_LICENSE("GPL");
1263 MODULE_DESCRIPTION("DCCP - Datagram Congestion Controlled Protocol");