1 /* SCTP kernel reference Implementation
2 * (C) Copyright IBM Corp. 2001, 2004
3 * Copyright (c) 1999-2000 Cisco, Inc.
4 * Copyright (c) 1999-2001 Motorola, Inc.
5 * Copyright (c) 2001 Intel Corp.
6 * Copyright (c) 2001 La Monte H.P. Yarroll
8 * This file is part of the SCTP kernel reference Implementation
10 * This module provides the abstraction for an SCTP association.
12 * The SCTP reference implementation is free software;
13 * you can redistribute it and/or modify it under the terms of
14 * the GNU General Public License as published by
15 * the Free Software Foundation; either version 2, or (at your option)
18 * The SCTP reference implementation is distributed in the hope that it
19 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
20 * ************************
21 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
22 * See the GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with GNU CC; see the file COPYING. If not, write to
26 * the Free Software Foundation, 59 Temple Place - Suite 330,
27 * Boston, MA 02111-1307, USA.
29 * Please send any bug reports or fixes you make to the
31 * lksctp developers <lksctp-developers@lists.sourceforge.net>
33 * Or submit a bug report through the following website:
34 * http://www.sf.net/projects/lksctp
36 * Written or modified by:
37 * La Monte H.P. Yarroll <piggy@acm.org>
38 * Karl Knutson <karl@athena.chicago.il.us>
39 * Jon Grimm <jgrimm@us.ibm.com>
40 * Xingang Guo <xingang.guo@intel.com>
41 * Hui Huang <hui.huang@nokia.com>
42 * Sridhar Samudrala <sri@us.ibm.com>
43 * Daisy Chang <daisyc@us.ibm.com>
44 * Ryan Layer <rmlayer@us.ibm.com>
45 * Kevin Gao <kevin.gao@intel.com>
47 * Any bugs reported given to us we will try to fix... any fixes shared will
48 * be incorporated into the next SCTP release.
51 #include <linux/types.h>
52 #include <linux/fcntl.h>
53 #include <linux/poll.h>
54 #include <linux/init.h>
56 #include <linux/slab.h>
59 #include <net/sctp/sctp.h>
60 #include <net/sctp/sm.h>
62 /* Forward declarations for internal functions. */
63 static void sctp_assoc_bh_rcv(struct work_struct *work);
66 /* 1st Level Abstractions. */
68 /* Initialize a new association from provided memory. */
69 static struct sctp_association *sctp_association_init(struct sctp_association *asoc,
70 const struct sctp_endpoint *ep,
71 const struct sock *sk,
78 /* Retrieve the SCTP per socket area. */
79 sp = sctp_sk((struct sock *)sk);
81 /* Init all variables to a known value. */
82 memset(asoc, 0, sizeof(struct sctp_association));
84 /* Discarding const is appropriate here. */
85 asoc->ep = (struct sctp_endpoint *)ep;
86 sctp_endpoint_hold(asoc->ep);
89 asoc->base.sk = (struct sock *)sk;
90 sock_hold(asoc->base.sk);
92 /* Initialize the common base substructure. */
93 asoc->base.type = SCTP_EP_TYPE_ASSOCIATION;
95 /* Initialize the object handling fields. */
96 atomic_set(&asoc->base.refcnt, 1);
98 asoc->base.malloced = 0;
100 /* Initialize the bind addr area. */
101 sctp_bind_addr_init(&asoc->base.bind_addr, ep->base.bind_addr.port);
103 asoc->state = SCTP_STATE_CLOSED;
105 /* Set these values from the socket values, a conversion between
106 * millsecons to seconds/microseconds must also be done.
108 asoc->cookie_life.tv_sec = sp->assocparams.sasoc_cookie_life / 1000;
109 asoc->cookie_life.tv_usec = (sp->assocparams.sasoc_cookie_life % 1000)
111 asoc->frag_point = 0;
113 /* Set the association max_retrans and RTO values from the
116 asoc->max_retrans = sp->assocparams.sasoc_asocmaxrxt;
117 asoc->rto_initial = msecs_to_jiffies(sp->rtoinfo.srto_initial);
118 asoc->rto_max = msecs_to_jiffies(sp->rtoinfo.srto_max);
119 asoc->rto_min = msecs_to_jiffies(sp->rtoinfo.srto_min);
121 asoc->overall_error_count = 0;
123 /* Initialize the association's heartbeat interval based on the
124 * sock configured value.
126 asoc->hbinterval = msecs_to_jiffies(sp->hbinterval);
128 /* Initialize path max retrans value. */
129 asoc->pathmaxrxt = sp->pathmaxrxt;
131 /* Initialize default path MTU. */
132 asoc->pathmtu = sp->pathmtu;
134 /* Set association default SACK delay */
135 asoc->sackdelay = msecs_to_jiffies(sp->sackdelay);
137 /* Set the association default flags controlling
138 * Heartbeat, SACK delay, and Path MTU Discovery.
140 asoc->param_flags = sp->param_flags;
142 /* Initialize the maximum mumber of new data packets that can be sent
145 asoc->max_burst = sp->max_burst;
147 /* initialize association timers */
148 asoc->timeouts[SCTP_EVENT_TIMEOUT_NONE] = 0;
149 asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_COOKIE] = asoc->rto_initial;
150 asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_INIT] = asoc->rto_initial;
151 asoc->timeouts[SCTP_EVENT_TIMEOUT_T2_SHUTDOWN] = asoc->rto_initial;
152 asoc->timeouts[SCTP_EVENT_TIMEOUT_T3_RTX] = 0;
153 asoc->timeouts[SCTP_EVENT_TIMEOUT_T4_RTO] = 0;
155 /* sctpimpguide Section 2.12.2
156 * If the 'T5-shutdown-guard' timer is used, it SHOULD be set to the
157 * recommended value of 5 times 'RTO.Max'.
159 asoc->timeouts[SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD]
162 asoc->timeouts[SCTP_EVENT_TIMEOUT_HEARTBEAT] = 0;
163 asoc->timeouts[SCTP_EVENT_TIMEOUT_SACK] = asoc->sackdelay;
164 asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE] =
167 /* Initilizes the timers */
168 for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i) {
169 init_timer(&asoc->timers[i]);
170 asoc->timers[i].function = sctp_timer_events[i];
171 asoc->timers[i].data = (unsigned long) asoc;
174 /* Pull default initialization values from the sock options.
175 * Note: This assumes that the values have already been
176 * validated in the sock.
178 asoc->c.sinit_max_instreams = sp->initmsg.sinit_max_instreams;
179 asoc->c.sinit_num_ostreams = sp->initmsg.sinit_num_ostreams;
180 asoc->max_init_attempts = sp->initmsg.sinit_max_attempts;
182 asoc->max_init_timeo =
183 msecs_to_jiffies(sp->initmsg.sinit_max_init_timeo);
185 /* Allocate storage for the ssnmap after the inbound and outbound
186 * streams have been negotiated during Init.
190 /* Set the local window size for receive.
191 * This is also the rcvbuf space per association.
192 * RFC 6 - A SCTP receiver MUST be able to receive a minimum of
193 * 1500 bytes in one SCTP packet.
195 if ((sk->sk_rcvbuf/2) < SCTP_DEFAULT_MINWINDOW)
196 asoc->rwnd = SCTP_DEFAULT_MINWINDOW;
198 asoc->rwnd = sk->sk_rcvbuf/2;
200 asoc->a_rwnd = asoc->rwnd;
204 /* Use my own max window until I learn something better. */
205 asoc->peer.rwnd = SCTP_DEFAULT_MAXWINDOW;
207 /* Set the sndbuf size for transmit. */
208 asoc->sndbuf_used = 0;
210 /* Initialize the receive memory counter */
211 atomic_set(&asoc->rmem_alloc, 0);
213 init_waitqueue_head(&asoc->wait);
215 asoc->c.my_vtag = sctp_generate_tag(ep);
216 asoc->peer.i.init_tag = 0; /* INIT needs a vtag of 0. */
217 asoc->c.peer_vtag = 0;
219 asoc->c.peer_ttag = 0;
220 asoc->c.my_port = ep->base.bind_addr.port;
222 asoc->c.initial_tsn = sctp_generate_tsn(ep);
224 asoc->next_tsn = asoc->c.initial_tsn;
226 asoc->ctsn_ack_point = asoc->next_tsn - 1;
227 asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
228 asoc->highest_sacked = asoc->ctsn_ack_point;
229 asoc->last_cwr_tsn = asoc->ctsn_ack_point;
230 asoc->unack_data = 0;
232 /* ADDIP Section 4.1 Asconf Chunk Procedures
234 * When an endpoint has an ASCONF signaled change to be sent to the
235 * remote endpoint it should do the following:
237 * A2) a serial number should be assigned to the chunk. The serial
238 * number SHOULD be a monotonically increasing number. The serial
239 * numbers SHOULD be initialized at the start of the
240 * association to the same value as the initial TSN.
242 asoc->addip_serial = asoc->c.initial_tsn;
244 INIT_LIST_HEAD(&asoc->addip_chunk_list);
246 /* Make an empty list of remote transport addresses. */
247 INIT_LIST_HEAD(&asoc->peer.transport_addr_list);
248 asoc->peer.transport_count = 0;
250 /* RFC 2960 5.1 Normal Establishment of an Association
252 * After the reception of the first data chunk in an
253 * association the endpoint must immediately respond with a
254 * sack to acknowledge the data chunk. Subsequent
255 * acknowledgements should be done as described in Section
258 * [We implement this by telling a new association that it
259 * already received one packet.]
261 asoc->peer.sack_needed = 1;
263 /* Assume that the peer recongizes ASCONF until reported otherwise
264 * via an ERROR chunk.
266 asoc->peer.asconf_capable = 1;
268 /* Create an input queue. */
269 sctp_inq_init(&asoc->base.inqueue);
270 sctp_inq_set_th_handler(&asoc->base.inqueue, sctp_assoc_bh_rcv);
272 /* Create an output queue. */
273 sctp_outq_init(asoc, &asoc->outqueue);
275 if (!sctp_ulpq_init(&asoc->ulpq, asoc))
278 /* Set up the tsn tracking. */
279 sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE, 0);
285 /* Assume that peer would support both address types unless we are
288 asoc->peer.ipv4_address = 1;
289 asoc->peer.ipv6_address = 1;
290 INIT_LIST_HEAD(&asoc->asocs);
292 asoc->autoclose = sp->autoclose;
294 asoc->default_stream = sp->default_stream;
295 asoc->default_ppid = sp->default_ppid;
296 asoc->default_flags = sp->default_flags;
297 asoc->default_context = sp->default_context;
298 asoc->default_timetolive = sp->default_timetolive;
299 asoc->default_rcv_context = sp->default_rcv_context;
304 sctp_endpoint_put(asoc->ep);
305 sock_put(asoc->base.sk);
309 /* Allocate and initialize a new association */
310 struct sctp_association *sctp_association_new(const struct sctp_endpoint *ep,
311 const struct sock *sk,
315 struct sctp_association *asoc;
317 asoc = t_new(struct sctp_association, gfp);
321 if (!sctp_association_init(asoc, ep, sk, scope, gfp))
324 asoc->base.malloced = 1;
325 SCTP_DBG_OBJCNT_INC(assoc);
326 SCTP_DEBUG_PRINTK("Created asoc %p\n", asoc);
336 /* Free this association if possible. There may still be users, so
337 * the actual deallocation may be delayed.
339 void sctp_association_free(struct sctp_association *asoc)
341 struct sock *sk = asoc->base.sk;
342 struct sctp_transport *transport;
343 struct list_head *pos, *temp;
346 /* Only real associations count against the endpoint, so
347 * don't bother for if this is a temporary association.
350 list_del(&asoc->asocs);
352 /* Decrement the backlog value for a TCP-style listening
355 if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
356 sk->sk_ack_backlog--;
359 /* Mark as dead, so other users can know this structure is
364 /* Dispose of any data lying around in the outqueue. */
365 sctp_outq_free(&asoc->outqueue);
367 /* Dispose of any pending messages for the upper layer. */
368 sctp_ulpq_free(&asoc->ulpq);
370 /* Dispose of any pending chunks on the inqueue. */
371 sctp_inq_free(&asoc->base.inqueue);
373 /* Free ssnmap storage. */
374 sctp_ssnmap_free(asoc->ssnmap);
376 /* Clean up the bound address list. */
377 sctp_bind_addr_free(&asoc->base.bind_addr);
379 /* Do we need to go through all of our timers and
380 * delete them? To be safe we will try to delete all, but we
381 * should be able to go through and make a guess based
384 for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i) {
385 if (timer_pending(&asoc->timers[i]) &&
386 del_timer(&asoc->timers[i]))
387 sctp_association_put(asoc);
390 /* Free peer's cached cookie. */
391 kfree(asoc->peer.cookie);
393 /* Release the transport structures. */
394 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
395 transport = list_entry(pos, struct sctp_transport, transports);
397 sctp_transport_free(transport);
400 asoc->peer.transport_count = 0;
402 /* Free any cached ASCONF_ACK chunk. */
403 if (asoc->addip_last_asconf_ack)
404 sctp_chunk_free(asoc->addip_last_asconf_ack);
406 /* Free any cached ASCONF chunk. */
407 if (asoc->addip_last_asconf)
408 sctp_chunk_free(asoc->addip_last_asconf);
410 sctp_association_put(asoc);
413 /* Cleanup and free up an association. */
414 static void sctp_association_destroy(struct sctp_association *asoc)
416 SCTP_ASSERT(asoc->base.dead, "Assoc is not dead", return);
418 sctp_endpoint_put(asoc->ep);
419 sock_put(asoc->base.sk);
421 if (asoc->assoc_id != 0) {
422 spin_lock_bh(&sctp_assocs_id_lock);
423 idr_remove(&sctp_assocs_id, asoc->assoc_id);
424 spin_unlock_bh(&sctp_assocs_id_lock);
427 BUG_TRAP(!atomic_read(&asoc->rmem_alloc));
429 if (asoc->base.malloced) {
431 SCTP_DBG_OBJCNT_DEC(assoc);
435 /* Change the primary destination address for the peer. */
436 void sctp_assoc_set_primary(struct sctp_association *asoc,
437 struct sctp_transport *transport)
439 asoc->peer.primary_path = transport;
441 /* Set a default msg_name for events. */
442 memcpy(&asoc->peer.primary_addr, &transport->ipaddr,
443 sizeof(union sctp_addr));
445 /* If the primary path is changing, assume that the
446 * user wants to use this new path.
448 if ((transport->state == SCTP_ACTIVE) ||
449 (transport->state == SCTP_UNKNOWN))
450 asoc->peer.active_path = transport;
453 * SFR-CACC algorithm:
454 * Upon the receipt of a request to change the primary
455 * destination address, on the data structure for the new
456 * primary destination, the sender MUST do the following:
458 * 1) If CHANGEOVER_ACTIVE is set, then there was a switch
459 * to this destination address earlier. The sender MUST set
460 * CYCLING_CHANGEOVER to indicate that this switch is a
461 * double switch to the same destination address.
463 if (transport->cacc.changeover_active)
464 transport->cacc.cycling_changeover = 1;
466 /* 2) The sender MUST set CHANGEOVER_ACTIVE to indicate that
467 * a changeover has occurred.
469 transport->cacc.changeover_active = 1;
471 /* 3) The sender MUST store the next TSN to be sent in
472 * next_tsn_at_change.
474 transport->cacc.next_tsn_at_change = asoc->next_tsn;
477 /* Remove a transport from an association. */
478 void sctp_assoc_rm_peer(struct sctp_association *asoc,
479 struct sctp_transport *peer)
481 struct list_head *pos;
482 struct sctp_transport *transport;
484 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_rm_peer:association %p addr: ",
488 ntohs(peer->ipaddr.v4.sin_port));
490 /* If we are to remove the current retran_path, update it
491 * to the next peer before removing this peer from the list.
493 if (asoc->peer.retran_path == peer)
494 sctp_assoc_update_retran_path(asoc);
496 /* Remove this peer from the list. */
497 list_del(&peer->transports);
499 /* Get the first transport of asoc. */
500 pos = asoc->peer.transport_addr_list.next;
501 transport = list_entry(pos, struct sctp_transport, transports);
503 /* Update any entries that match the peer to be deleted. */
504 if (asoc->peer.primary_path == peer)
505 sctp_assoc_set_primary(asoc, transport);
506 if (asoc->peer.active_path == peer)
507 asoc->peer.active_path = transport;
508 if (asoc->peer.last_data_from == peer)
509 asoc->peer.last_data_from = transport;
511 /* If we remove the transport an INIT was last sent to, set it to
512 * NULL. Combined with the update of the retran path above, this
513 * will cause the next INIT to be sent to the next available
514 * transport, maintaining the cycle.
516 if (asoc->init_last_sent_to == peer)
517 asoc->init_last_sent_to = NULL;
519 asoc->peer.transport_count--;
521 sctp_transport_free(peer);
524 /* Add a transport address to an association. */
525 struct sctp_transport *sctp_assoc_add_peer(struct sctp_association *asoc,
526 const union sctp_addr *addr,
528 const int peer_state)
530 struct sctp_transport *peer;
531 struct sctp_sock *sp;
534 sp = sctp_sk(asoc->base.sk);
536 /* AF_INET and AF_INET6 share common port field. */
537 port = ntohs(addr->v4.sin_port);
539 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_add_peer:association %p addr: ",
540 " port: %d state:%d\n",
546 /* Set the port if it has not been set yet. */
547 if (0 == asoc->peer.port)
548 asoc->peer.port = port;
550 /* Check to see if this is a duplicate. */
551 peer = sctp_assoc_lookup_paddr(asoc, addr);
553 if (peer->state == SCTP_UNKNOWN) {
554 if (peer_state == SCTP_ACTIVE)
555 peer->state = SCTP_ACTIVE;
556 if (peer_state == SCTP_UNCONFIRMED)
557 peer->state = SCTP_UNCONFIRMED;
562 peer = sctp_transport_new(addr, gfp);
566 sctp_transport_set_owner(peer, asoc);
568 /* Initialize the peer's heartbeat interval based on the
569 * association configured value.
571 peer->hbinterval = asoc->hbinterval;
573 /* Set the path max_retrans. */
574 peer->pathmaxrxt = asoc->pathmaxrxt;
576 /* Initialize the peer's SACK delay timeout based on the
577 * association configured value.
579 peer->sackdelay = asoc->sackdelay;
581 /* Enable/disable heartbeat, SACK delay, and path MTU discovery
582 * based on association setting.
584 peer->param_flags = asoc->param_flags;
586 /* Initialize the pmtu of the transport. */
587 if (peer->param_flags & SPP_PMTUD_ENABLE)
588 sctp_transport_pmtu(peer);
589 else if (asoc->pathmtu)
590 peer->pathmtu = asoc->pathmtu;
592 peer->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
594 /* If this is the first transport addr on this association,
595 * initialize the association PMTU to the peer's PMTU.
596 * If not and the current association PMTU is higher than the new
597 * peer's PMTU, reset the association PMTU to the new peer's PMTU.
600 asoc->pathmtu = min_t(int, peer->pathmtu, asoc->pathmtu);
602 asoc->pathmtu = peer->pathmtu;
604 SCTP_DEBUG_PRINTK("sctp_assoc_add_peer:association %p PMTU set to "
605 "%d\n", asoc, asoc->pathmtu);
607 asoc->frag_point = sctp_frag_point(sp, asoc->pathmtu);
609 /* The asoc->peer.port might not be meaningful yet, but
610 * initialize the packet structure anyway.
612 sctp_packet_init(&peer->packet, peer, asoc->base.bind_addr.port,
617 * o The initial cwnd before DATA transmission or after a sufficiently
618 * long idle period MUST be set to
619 * min(4*MTU, max(2*MTU, 4380 bytes))
621 * o The initial value of ssthresh MAY be arbitrarily high
622 * (for example, implementations MAY use the size of the
623 * receiver advertised window).
625 peer->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
627 /* At this point, we may not have the receiver's advertised window,
628 * so initialize ssthresh to the default value and it will be set
629 * later when we process the INIT.
631 peer->ssthresh = SCTP_DEFAULT_MAXWINDOW;
633 peer->partial_bytes_acked = 0;
634 peer->flight_size = 0;
636 /* Set the transport's RTO.initial value */
637 peer->rto = asoc->rto_initial;
639 /* Set the peer's active state. */
640 peer->state = peer_state;
642 /* Attach the remote transport to our asoc. */
643 list_add_tail(&peer->transports, &asoc->peer.transport_addr_list);
644 asoc->peer.transport_count++;
646 /* If we do not yet have a primary path, set one. */
647 if (!asoc->peer.primary_path) {
648 sctp_assoc_set_primary(asoc, peer);
649 asoc->peer.retran_path = peer;
652 if (asoc->peer.active_path == asoc->peer.retran_path) {
653 asoc->peer.retran_path = peer;
659 /* Delete a transport address from an association. */
660 void sctp_assoc_del_peer(struct sctp_association *asoc,
661 const union sctp_addr *addr)
663 struct list_head *pos;
664 struct list_head *temp;
665 struct sctp_transport *transport;
667 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
668 transport = list_entry(pos, struct sctp_transport, transports);
669 if (sctp_cmp_addr_exact(addr, &transport->ipaddr)) {
670 /* Do book keeping for removing the peer and free it. */
671 sctp_assoc_rm_peer(asoc, transport);
677 /* Lookup a transport by address. */
678 struct sctp_transport *sctp_assoc_lookup_paddr(
679 const struct sctp_association *asoc,
680 const union sctp_addr *address)
682 struct sctp_transport *t;
683 struct list_head *pos;
685 /* Cycle through all transports searching for a peer address. */
687 list_for_each(pos, &asoc->peer.transport_addr_list) {
688 t = list_entry(pos, struct sctp_transport, transports);
689 if (sctp_cmp_addr_exact(address, &t->ipaddr))
696 /* Engage in transport control operations.
697 * Mark the transport up or down and send a notification to the user.
698 * Select and update the new active and retran paths.
700 void sctp_assoc_control_transport(struct sctp_association *asoc,
701 struct sctp_transport *transport,
702 sctp_transport_cmd_t command,
703 sctp_sn_error_t error)
705 struct sctp_transport *t = NULL;
706 struct sctp_transport *first;
707 struct sctp_transport *second;
708 struct sctp_ulpevent *event;
709 struct sockaddr_storage addr;
710 struct list_head *pos;
713 /* Record the transition on the transport. */
715 case SCTP_TRANSPORT_UP:
716 /* If we are moving from UNCONFIRMED state due
717 * to heartbeat success, report the SCTP_ADDR_CONFIRMED
718 * state to the user, otherwise report SCTP_ADDR_AVAILABLE.
720 if (SCTP_UNCONFIRMED == transport->state &&
721 SCTP_HEARTBEAT_SUCCESS == error)
722 spc_state = SCTP_ADDR_CONFIRMED;
724 spc_state = SCTP_ADDR_AVAILABLE;
725 transport->state = SCTP_ACTIVE;
728 case SCTP_TRANSPORT_DOWN:
729 /* if the transort was never confirmed, do not transition it
732 if (transport->state != SCTP_UNCONFIRMED)
733 transport->state = SCTP_INACTIVE;
735 spc_state = SCTP_ADDR_UNREACHABLE;
742 /* Generate and send a SCTP_PEER_ADDR_CHANGE notification to the
745 memset(&addr, 0, sizeof(struct sockaddr_storage));
746 memcpy(&addr, &transport->ipaddr, transport->af_specific->sockaddr_len);
747 event = sctp_ulpevent_make_peer_addr_change(asoc, &addr,
748 0, spc_state, error, GFP_ATOMIC);
750 sctp_ulpq_tail_event(&asoc->ulpq, event);
752 /* Select new active and retran paths. */
754 /* Look for the two most recently used active transports.
756 * This code produces the wrong ordering whenever jiffies
757 * rolls over, but we still get usable transports, so we don't
760 first = NULL; second = NULL;
762 list_for_each(pos, &asoc->peer.transport_addr_list) {
763 t = list_entry(pos, struct sctp_transport, transports);
765 if ((t->state == SCTP_INACTIVE) ||
766 (t->state == SCTP_UNCONFIRMED))
768 if (!first || t->last_time_heard > first->last_time_heard) {
772 if (!second || t->last_time_heard > second->last_time_heard)
776 /* RFC 2960 6.4 Multi-Homed SCTP Endpoints
778 * By default, an endpoint should always transmit to the
779 * primary path, unless the SCTP user explicitly specifies the
780 * destination transport address (and possibly source
781 * transport address) to use.
783 * [If the primary is active but not most recent, bump the most
784 * recently used transport.]
786 if (((asoc->peer.primary_path->state == SCTP_ACTIVE) ||
787 (asoc->peer.primary_path->state == SCTP_UNKNOWN)) &&
788 first != asoc->peer.primary_path) {
790 first = asoc->peer.primary_path;
793 /* If we failed to find a usable transport, just camp on the
794 * primary, even if it is inactive.
797 first = asoc->peer.primary_path;
798 second = asoc->peer.primary_path;
801 /* Set the active and retran transports. */
802 asoc->peer.active_path = first;
803 asoc->peer.retran_path = second;
806 /* Hold a reference to an association. */
807 void sctp_association_hold(struct sctp_association *asoc)
809 atomic_inc(&asoc->base.refcnt);
812 /* Release a reference to an association and cleanup
813 * if there are no more references.
815 void sctp_association_put(struct sctp_association *asoc)
817 if (atomic_dec_and_test(&asoc->base.refcnt))
818 sctp_association_destroy(asoc);
821 /* Allocate the next TSN, Transmission Sequence Number, for the given
824 __u32 sctp_association_get_next_tsn(struct sctp_association *asoc)
826 /* From Section 1.6 Serial Number Arithmetic:
827 * Transmission Sequence Numbers wrap around when they reach
828 * 2**32 - 1. That is, the next TSN a DATA chunk MUST use
829 * after transmitting TSN = 2*32 - 1 is TSN = 0.
831 __u32 retval = asoc->next_tsn;
838 /* Compare two addresses to see if they match. Wildcard addresses
839 * only match themselves.
841 int sctp_cmp_addr_exact(const union sctp_addr *ss1,
842 const union sctp_addr *ss2)
846 af = sctp_get_af_specific(ss1->sa.sa_family);
850 return af->cmp_addr(ss1, ss2);
853 /* Return an ecne chunk to get prepended to a packet.
854 * Note: We are sly and return a shared, prealloced chunk. FIXME:
855 * No we don't, but we could/should.
857 struct sctp_chunk *sctp_get_ecne_prepend(struct sctp_association *asoc)
859 struct sctp_chunk *chunk;
861 /* Send ECNE if needed.
862 * Not being able to allocate a chunk here is not deadly.
865 chunk = sctp_make_ecne(asoc, asoc->last_ecne_tsn);
873 * Find which transport this TSN was sent on.
875 struct sctp_transport *sctp_assoc_lookup_tsn(struct sctp_association *asoc,
878 struct sctp_transport *active;
879 struct sctp_transport *match;
880 struct list_head *entry, *pos;
881 struct sctp_transport *transport;
882 struct sctp_chunk *chunk;
883 __be32 key = htonl(tsn);
888 * FIXME: In general, find a more efficient data structure for
893 * The general strategy is to search each transport's transmitted
894 * list. Return which transport this TSN lives on.
896 * Let's be hopeful and check the active_path first.
897 * Another optimization would be to know if there is only one
898 * outbound path and not have to look for the TSN at all.
902 active = asoc->peer.active_path;
904 list_for_each(entry, &active->transmitted) {
905 chunk = list_entry(entry, struct sctp_chunk, transmitted_list);
907 if (key == chunk->subh.data_hdr->tsn) {
913 /* If not found, go search all the other transports. */
914 list_for_each(pos, &asoc->peer.transport_addr_list) {
915 transport = list_entry(pos, struct sctp_transport, transports);
917 if (transport == active)
919 list_for_each(entry, &transport->transmitted) {
920 chunk = list_entry(entry, struct sctp_chunk,
922 if (key == chunk->subh.data_hdr->tsn) {
932 /* Is this the association we are looking for? */
933 struct sctp_transport *sctp_assoc_is_match(struct sctp_association *asoc,
934 const union sctp_addr *laddr,
935 const union sctp_addr *paddr)
937 struct sctp_transport *transport;
939 if ((htons(asoc->base.bind_addr.port) == laddr->v4.sin_port) &&
940 (htons(asoc->peer.port) == paddr->v4.sin_port)) {
941 transport = sctp_assoc_lookup_paddr(asoc, paddr);
945 if (sctp_bind_addr_match(&asoc->base.bind_addr, laddr,
946 sctp_sk(asoc->base.sk)))
955 /* Do delayed input processing. This is scheduled by sctp_rcv(). */
956 static void sctp_assoc_bh_rcv(struct work_struct *work)
958 struct sctp_association *asoc =
959 container_of(work, struct sctp_association,
960 base.inqueue.immediate);
961 struct sctp_endpoint *ep;
962 struct sctp_chunk *chunk;
964 struct sctp_inq *inqueue;
966 sctp_subtype_t subtype;
969 /* The association should be held so we should be safe. */
973 inqueue = &asoc->base.inqueue;
974 sctp_association_hold(asoc);
975 while (NULL != (chunk = sctp_inq_pop(inqueue))) {
977 subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
979 /* Remember where the last DATA chunk came from so we
980 * know where to send the SACK.
982 if (sctp_chunk_is_data(chunk))
983 asoc->peer.last_data_from = chunk->transport;
985 SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
987 if (chunk->transport)
988 chunk->transport->last_time_heard = jiffies;
990 /* Run through the state machine. */
991 error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype,
992 state, ep, asoc, chunk, GFP_ATOMIC);
994 /* Check to see if the association is freed in response to
995 * the incoming chunk. If so, get out of the while loop.
1000 /* If there is an error on chunk, discard this packet. */
1002 chunk->pdiscard = 1;
1004 sctp_association_put(asoc);
1007 /* This routine moves an association from its old sk to a new sk. */
1008 void sctp_assoc_migrate(struct sctp_association *assoc, struct sock *newsk)
1010 struct sctp_sock *newsp = sctp_sk(newsk);
1011 struct sock *oldsk = assoc->base.sk;
1013 /* Delete the association from the old endpoint's list of
1016 list_del_init(&assoc->asocs);
1018 /* Decrement the backlog value for a TCP-style socket. */
1019 if (sctp_style(oldsk, TCP))
1020 oldsk->sk_ack_backlog--;
1022 /* Release references to the old endpoint and the sock. */
1023 sctp_endpoint_put(assoc->ep);
1024 sock_put(assoc->base.sk);
1026 /* Get a reference to the new endpoint. */
1027 assoc->ep = newsp->ep;
1028 sctp_endpoint_hold(assoc->ep);
1030 /* Get a reference to the new sock. */
1031 assoc->base.sk = newsk;
1032 sock_hold(assoc->base.sk);
1034 /* Add the association to the new endpoint's list of associations. */
1035 sctp_endpoint_add_asoc(newsp->ep, assoc);
1038 /* Update an association (possibly from unexpected COOKIE-ECHO processing). */
1039 void sctp_assoc_update(struct sctp_association *asoc,
1040 struct sctp_association *new)
1042 struct sctp_transport *trans;
1043 struct list_head *pos, *temp;
1045 /* Copy in new parameters of peer. */
1047 asoc->peer.rwnd = new->peer.rwnd;
1048 asoc->peer.sack_needed = new->peer.sack_needed;
1049 asoc->peer.i = new->peer.i;
1050 sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE,
1051 asoc->peer.i.initial_tsn);
1053 /* Remove any peer addresses not present in the new association. */
1054 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
1055 trans = list_entry(pos, struct sctp_transport, transports);
1056 if (!sctp_assoc_lookup_paddr(new, &trans->ipaddr))
1057 sctp_assoc_del_peer(asoc, &trans->ipaddr);
1059 if (asoc->state >= SCTP_STATE_ESTABLISHED)
1060 sctp_transport_reset(trans);
1063 /* If the case is A (association restart), use
1064 * initial_tsn as next_tsn. If the case is B, use
1065 * current next_tsn in case data sent to peer
1066 * has been discarded and needs retransmission.
1068 if (asoc->state >= SCTP_STATE_ESTABLISHED) {
1069 asoc->next_tsn = new->next_tsn;
1070 asoc->ctsn_ack_point = new->ctsn_ack_point;
1071 asoc->adv_peer_ack_point = new->adv_peer_ack_point;
1073 /* Reinitialize SSN for both local streams
1074 * and peer's streams.
1076 sctp_ssnmap_clear(asoc->ssnmap);
1078 /* Flush the ULP reassembly and ordered queue.
1079 * Any data there will now be stale and will
1082 sctp_ulpq_flush(&asoc->ulpq);
1084 /* reset the overall association error count so
1085 * that the restarted association doesn't get torn
1086 * down on the next retransmission timer.
1088 asoc->overall_error_count = 0;
1091 /* Add any peer addresses from the new association. */
1092 list_for_each(pos, &new->peer.transport_addr_list) {
1093 trans = list_entry(pos, struct sctp_transport,
1095 if (!sctp_assoc_lookup_paddr(asoc, &trans->ipaddr))
1096 sctp_assoc_add_peer(asoc, &trans->ipaddr,
1097 GFP_ATOMIC, trans->state);
1100 asoc->ctsn_ack_point = asoc->next_tsn - 1;
1101 asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
1102 if (!asoc->ssnmap) {
1103 /* Move the ssnmap. */
1104 asoc->ssnmap = new->ssnmap;
1108 if (!asoc->assoc_id) {
1109 /* get a new association id since we don't have one
1112 sctp_assoc_set_id(asoc, GFP_ATOMIC);
1117 /* Update the retran path for sending a retransmitted packet.
1118 * Round-robin through the active transports, else round-robin
1119 * through the inactive transports as this is the next best thing
1122 void sctp_assoc_update_retran_path(struct sctp_association *asoc)
1124 struct sctp_transport *t, *next;
1125 struct list_head *head = &asoc->peer.transport_addr_list;
1126 struct list_head *pos;
1128 /* Find the next transport in a round-robin fashion. */
1129 t = asoc->peer.retran_path;
1130 pos = &t->transports;
1134 /* Skip the head. */
1135 if (pos->next == head)
1140 t = list_entry(pos, struct sctp_transport, transports);
1142 /* Try to find an active transport. */
1144 if ((t->state == SCTP_ACTIVE) ||
1145 (t->state == SCTP_UNKNOWN)) {
1148 /* Keep track of the next transport in case
1149 * we don't find any active transport.
1155 /* We have exhausted the list, but didn't find any
1156 * other active transports. If so, use the next
1159 if (t == asoc->peer.retran_path) {
1165 asoc->peer.retran_path = t;
1167 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1172 ntohs(t->ipaddr.v4.sin_port));
1175 /* Choose the transport for sending a INIT packet. */
1176 struct sctp_transport *sctp_assoc_choose_init_transport(
1177 struct sctp_association *asoc)
1179 struct sctp_transport *t;
1181 /* Use the retran path. If the last INIT was sent over the
1182 * retran path, update the retran path and use it.
1184 if (!asoc->init_last_sent_to) {
1185 t = asoc->peer.active_path;
1187 if (asoc->init_last_sent_to == asoc->peer.retran_path)
1188 sctp_assoc_update_retran_path(asoc);
1189 t = asoc->peer.retran_path;
1192 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1197 ntohs(t->ipaddr.v4.sin_port));
1202 /* Choose the transport for sending a SHUTDOWN packet. */
1203 struct sctp_transport *sctp_assoc_choose_shutdown_transport(
1204 struct sctp_association *asoc)
1206 /* If this is the first time SHUTDOWN is sent, use the active path,
1207 * else use the retran path. If the last SHUTDOWN was sent over the
1208 * retran path, update the retran path and use it.
1210 if (!asoc->shutdown_last_sent_to)
1211 return asoc->peer.active_path;
1213 if (asoc->shutdown_last_sent_to == asoc->peer.retran_path)
1214 sctp_assoc_update_retran_path(asoc);
1215 return asoc->peer.retran_path;
1220 /* Update the association's pmtu and frag_point by going through all the
1221 * transports. This routine is called when a transport's PMTU has changed.
1223 void sctp_assoc_sync_pmtu(struct sctp_association *asoc)
1225 struct sctp_transport *t;
1226 struct list_head *pos;
1232 /* Get the lowest pmtu of all the transports. */
1233 list_for_each(pos, &asoc->peer.transport_addr_list) {
1234 t = list_entry(pos, struct sctp_transport, transports);
1235 if (t->pmtu_pending && t->dst) {
1236 sctp_transport_update_pmtu(t, dst_mtu(t->dst));
1237 t->pmtu_pending = 0;
1239 if (!pmtu || (t->pathmtu < pmtu))
1244 struct sctp_sock *sp = sctp_sk(asoc->base.sk);
1245 asoc->pathmtu = pmtu;
1246 asoc->frag_point = sctp_frag_point(sp, pmtu);
1249 SCTP_DEBUG_PRINTK("%s: asoc:%p, pmtu:%d, frag_point:%d\n",
1250 __FUNCTION__, asoc, asoc->pathmtu, asoc->frag_point);
1253 /* Should we send a SACK to update our peer? */
1254 static inline int sctp_peer_needs_update(struct sctp_association *asoc)
1256 switch (asoc->state) {
1257 case SCTP_STATE_ESTABLISHED:
1258 case SCTP_STATE_SHUTDOWN_PENDING:
1259 case SCTP_STATE_SHUTDOWN_RECEIVED:
1260 case SCTP_STATE_SHUTDOWN_SENT:
1261 if ((asoc->rwnd > asoc->a_rwnd) &&
1262 ((asoc->rwnd - asoc->a_rwnd) >=
1263 min_t(__u32, (asoc->base.sk->sk_rcvbuf >> 1), asoc->pathmtu)))
1272 /* Increase asoc's rwnd by len and send any window update SACK if needed. */
1273 void sctp_assoc_rwnd_increase(struct sctp_association *asoc, unsigned len)
1275 struct sctp_chunk *sack;
1276 struct timer_list *timer;
1278 if (asoc->rwnd_over) {
1279 if (asoc->rwnd_over >= len) {
1280 asoc->rwnd_over -= len;
1282 asoc->rwnd += (len - asoc->rwnd_over);
1283 asoc->rwnd_over = 0;
1289 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd increased by %d to (%u, %u) "
1290 "- %u\n", __FUNCTION__, asoc, len, asoc->rwnd,
1291 asoc->rwnd_over, asoc->a_rwnd);
1293 /* Send a window update SACK if the rwnd has increased by at least the
1294 * minimum of the association's PMTU and half of the receive buffer.
1295 * The algorithm used is similar to the one described in
1296 * Section 4.2.3.3 of RFC 1122.
1298 if (sctp_peer_needs_update(asoc)) {
1299 asoc->a_rwnd = asoc->rwnd;
1300 SCTP_DEBUG_PRINTK("%s: Sending window update SACK- asoc: %p "
1301 "rwnd: %u a_rwnd: %u\n", __FUNCTION__,
1302 asoc, asoc->rwnd, asoc->a_rwnd);
1303 sack = sctp_make_sack(asoc);
1307 asoc->peer.sack_needed = 0;
1309 sctp_outq_tail(&asoc->outqueue, sack);
1311 /* Stop the SACK timer. */
1312 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK];
1313 if (timer_pending(timer) && del_timer(timer))
1314 sctp_association_put(asoc);
1318 /* Decrease asoc's rwnd by len. */
1319 void sctp_assoc_rwnd_decrease(struct sctp_association *asoc, unsigned len)
1321 SCTP_ASSERT(asoc->rwnd, "rwnd zero", return);
1322 SCTP_ASSERT(!asoc->rwnd_over, "rwnd_over not zero", return);
1323 if (asoc->rwnd >= len) {
1326 asoc->rwnd_over = len - asoc->rwnd;
1329 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd decreased by %d to (%u, %u)\n",
1330 __FUNCTION__, asoc, len, asoc->rwnd,
1334 /* Build the bind address list for the association based on info from the
1335 * local endpoint and the remote peer.
1337 int sctp_assoc_set_bind_addr_from_ep(struct sctp_association *asoc,
1343 /* Use scoping rules to determine the subset of addresses from
1346 scope = sctp_scope(&asoc->peer.active_path->ipaddr);
1347 flags = (PF_INET6 == asoc->base.sk->sk_family) ? SCTP_ADDR6_ALLOWED : 0;
1348 if (asoc->peer.ipv4_address)
1349 flags |= SCTP_ADDR4_PEERSUPP;
1350 if (asoc->peer.ipv6_address)
1351 flags |= SCTP_ADDR6_PEERSUPP;
1353 return sctp_bind_addr_copy(&asoc->base.bind_addr,
1354 &asoc->ep->base.bind_addr,
1358 /* Build the association's bind address list from the cookie. */
1359 int sctp_assoc_set_bind_addr_from_cookie(struct sctp_association *asoc,
1360 struct sctp_cookie *cookie,
1363 int var_size2 = ntohs(cookie->peer_init->chunk_hdr.length);
1364 int var_size3 = cookie->raw_addr_list_len;
1365 __u8 *raw = (__u8 *)cookie->peer_init + var_size2;
1367 return sctp_raw_to_bind_addrs(&asoc->base.bind_addr, raw, var_size3,
1368 asoc->ep->base.bind_addr.port, gfp);
1371 /* Lookup laddr in the bind address list of an association. */
1372 int sctp_assoc_lookup_laddr(struct sctp_association *asoc,
1373 const union sctp_addr *laddr)
1377 if ((asoc->base.bind_addr.port == ntohs(laddr->v4.sin_port)) &&
1378 sctp_bind_addr_match(&asoc->base.bind_addr, laddr,
1379 sctp_sk(asoc->base.sk)))
1385 /* Set an association id for a given association */
1386 int sctp_assoc_set_id(struct sctp_association *asoc, gfp_t gfp)
1391 if (unlikely(!idr_pre_get(&sctp_assocs_id, gfp)))
1394 spin_lock_bh(&sctp_assocs_id_lock);
1395 error = idr_get_new_above(&sctp_assocs_id, (void *)asoc,
1397 spin_unlock_bh(&sctp_assocs_id_lock);
1398 if (error == -EAGAIN)
1403 asoc->assoc_id = (sctp_assoc_t) assoc_id;