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
);
102 rwlock_init(&asoc
->base
.addr_lock
);
104 asoc
->state
= SCTP_STATE_CLOSED
;
106 /* Set these values from the socket values, a conversion between
107 * millsecons to seconds/microseconds must also be done.
109 asoc
->cookie_life
.tv_sec
= sp
->assocparams
.sasoc_cookie_life
/ 1000;
110 asoc
->cookie_life
.tv_usec
= (sp
->assocparams
.sasoc_cookie_life
% 1000)
112 asoc
->frag_point
= 0;
114 /* Set the association max_retrans and RTO values from the
117 asoc
->max_retrans
= sp
->assocparams
.sasoc_asocmaxrxt
;
118 asoc
->rto_initial
= msecs_to_jiffies(sp
->rtoinfo
.srto_initial
);
119 asoc
->rto_max
= msecs_to_jiffies(sp
->rtoinfo
.srto_max
);
120 asoc
->rto_min
= msecs_to_jiffies(sp
->rtoinfo
.srto_min
);
122 asoc
->overall_error_count
= 0;
124 /* Initialize the association's heartbeat interval based on the
125 * sock configured value.
127 asoc
->hbinterval
= msecs_to_jiffies(sp
->hbinterval
);
129 /* Initialize path max retrans value. */
130 asoc
->pathmaxrxt
= sp
->pathmaxrxt
;
132 /* Initialize default path MTU. */
133 asoc
->pathmtu
= sp
->pathmtu
;
135 /* Set association default SACK delay */
136 asoc
->sackdelay
= msecs_to_jiffies(sp
->sackdelay
);
138 /* Set the association default flags controlling
139 * Heartbeat, SACK delay, and Path MTU Discovery.
141 asoc
->param_flags
= sp
->param_flags
;
143 /* Initialize the maximum mumber of new data packets that can be sent
146 asoc
->max_burst
= sp
->max_burst
;
148 /* initialize association timers */
149 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_NONE
] = 0;
150 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T1_COOKIE
] = asoc
->rto_initial
;
151 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T1_INIT
] = asoc
->rto_initial
;
152 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T2_SHUTDOWN
] = asoc
->rto_initial
;
153 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T3_RTX
] = 0;
154 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T4_RTO
] = 0;
156 /* sctpimpguide Section 2.12.2
157 * If the 'T5-shutdown-guard' timer is used, it SHOULD be set to the
158 * recommended value of 5 times 'RTO.Max'.
160 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD
]
163 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_HEARTBEAT
] = 0;
164 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_SACK
] = asoc
->sackdelay
;
165 asoc
->timeouts
[SCTP_EVENT_TIMEOUT_AUTOCLOSE
] =
168 /* Initilizes the timers */
169 for (i
= SCTP_EVENT_TIMEOUT_NONE
; i
< SCTP_NUM_TIMEOUT_TYPES
; ++i
) {
170 init_timer(&asoc
->timers
[i
]);
171 asoc
->timers
[i
].function
= sctp_timer_events
[i
];
172 asoc
->timers
[i
].data
= (unsigned long) asoc
;
175 /* Pull default initialization values from the sock options.
176 * Note: This assumes that the values have already been
177 * validated in the sock.
179 asoc
->c
.sinit_max_instreams
= sp
->initmsg
.sinit_max_instreams
;
180 asoc
->c
.sinit_num_ostreams
= sp
->initmsg
.sinit_num_ostreams
;
181 asoc
->max_init_attempts
= sp
->initmsg
.sinit_max_attempts
;
183 asoc
->max_init_timeo
=
184 msecs_to_jiffies(sp
->initmsg
.sinit_max_init_timeo
);
186 /* Allocate storage for the ssnmap after the inbound and outbound
187 * streams have been negotiated during Init.
191 /* Set the local window size for receive.
192 * This is also the rcvbuf space per association.
193 * RFC 6 - A SCTP receiver MUST be able to receive a minimum of
194 * 1500 bytes in one SCTP packet.
196 if ((sk
->sk_rcvbuf
/2) < SCTP_DEFAULT_MINWINDOW
)
197 asoc
->rwnd
= SCTP_DEFAULT_MINWINDOW
;
199 asoc
->rwnd
= sk
->sk_rcvbuf
/2;
201 asoc
->a_rwnd
= asoc
->rwnd
;
205 /* Use my own max window until I learn something better. */
206 asoc
->peer
.rwnd
= SCTP_DEFAULT_MAXWINDOW
;
208 /* Set the sndbuf size for transmit. */
209 asoc
->sndbuf_used
= 0;
211 /* Initialize the receive memory counter */
212 atomic_set(&asoc
->rmem_alloc
, 0);
214 init_waitqueue_head(&asoc
->wait
);
216 asoc
->c
.my_vtag
= sctp_generate_tag(ep
);
217 asoc
->peer
.i
.init_tag
= 0; /* INIT needs a vtag of 0. */
218 asoc
->c
.peer_vtag
= 0;
220 asoc
->c
.peer_ttag
= 0;
221 asoc
->c
.my_port
= ep
->base
.bind_addr
.port
;
223 asoc
->c
.initial_tsn
= sctp_generate_tsn(ep
);
225 asoc
->next_tsn
= asoc
->c
.initial_tsn
;
227 asoc
->ctsn_ack_point
= asoc
->next_tsn
- 1;
228 asoc
->adv_peer_ack_point
= asoc
->ctsn_ack_point
;
229 asoc
->highest_sacked
= asoc
->ctsn_ack_point
;
230 asoc
->last_cwr_tsn
= asoc
->ctsn_ack_point
;
231 asoc
->unack_data
= 0;
233 /* ADDIP Section 4.1 Asconf Chunk Procedures
235 * When an endpoint has an ASCONF signaled change to be sent to the
236 * remote endpoint it should do the following:
238 * A2) a serial number should be assigned to the chunk. The serial
239 * number SHOULD be a monotonically increasing number. The serial
240 * numbers SHOULD be initialized at the start of the
241 * association to the same value as the initial TSN.
243 asoc
->addip_serial
= asoc
->c
.initial_tsn
;
245 INIT_LIST_HEAD(&asoc
->addip_chunk_list
);
247 /* Make an empty list of remote transport addresses. */
248 INIT_LIST_HEAD(&asoc
->peer
.transport_addr_list
);
249 asoc
->peer
.transport_count
= 0;
251 /* RFC 2960 5.1 Normal Establishment of an Association
253 * After the reception of the first data chunk in an
254 * association the endpoint must immediately respond with a
255 * sack to acknowledge the data chunk. Subsequent
256 * acknowledgements should be done as described in Section
259 * [We implement this by telling a new association that it
260 * already received one packet.]
262 asoc
->peer
.sack_needed
= 1;
264 /* Assume that the peer recongizes ASCONF until reported otherwise
265 * via an ERROR chunk.
267 asoc
->peer
.asconf_capable
= 1;
269 /* Create an input queue. */
270 sctp_inq_init(&asoc
->base
.inqueue
);
271 sctp_inq_set_th_handler(&asoc
->base
.inqueue
, sctp_assoc_bh_rcv
);
273 /* Create an output queue. */
274 sctp_outq_init(asoc
, &asoc
->outqueue
);
276 if (!sctp_ulpq_init(&asoc
->ulpq
, asoc
))
279 /* Set up the tsn tracking. */
280 sctp_tsnmap_init(&asoc
->peer
.tsn_map
, SCTP_TSN_MAP_SIZE
, 0);
286 /* Assume that peer would support both address types unless we are
289 asoc
->peer
.ipv4_address
= 1;
290 asoc
->peer
.ipv6_address
= 1;
291 INIT_LIST_HEAD(&asoc
->asocs
);
293 asoc
->autoclose
= sp
->autoclose
;
295 asoc
->default_stream
= sp
->default_stream
;
296 asoc
->default_ppid
= sp
->default_ppid
;
297 asoc
->default_flags
= sp
->default_flags
;
298 asoc
->default_context
= sp
->default_context
;
299 asoc
->default_timetolive
= sp
->default_timetolive
;
300 asoc
->default_rcv_context
= sp
->default_rcv_context
;
305 sctp_endpoint_put(asoc
->ep
);
306 sock_put(asoc
->base
.sk
);
310 /* Allocate and initialize a new association */
311 struct sctp_association
*sctp_association_new(const struct sctp_endpoint
*ep
,
312 const struct sock
*sk
,
316 struct sctp_association
*asoc
;
318 asoc
= t_new(struct sctp_association
, gfp
);
322 if (!sctp_association_init(asoc
, ep
, sk
, scope
, gfp
))
325 asoc
->base
.malloced
= 1;
326 SCTP_DBG_OBJCNT_INC(assoc
);
327 SCTP_DEBUG_PRINTK("Created asoc %p\n", asoc
);
337 /* Free this association if possible. There may still be users, so
338 * the actual deallocation may be delayed.
340 void sctp_association_free(struct sctp_association
*asoc
)
342 struct sock
*sk
= asoc
->base
.sk
;
343 struct sctp_transport
*transport
;
344 struct list_head
*pos
, *temp
;
347 /* Only real associations count against the endpoint, so
348 * don't bother for if this is a temporary association.
351 list_del(&asoc
->asocs
);
353 /* Decrement the backlog value for a TCP-style listening
356 if (sctp_style(sk
, TCP
) && sctp_sstate(sk
, LISTENING
))
357 sk
->sk_ack_backlog
--;
360 /* Mark as dead, so other users can know this structure is
365 /* Dispose of any data lying around in the outqueue. */
366 sctp_outq_free(&asoc
->outqueue
);
368 /* Dispose of any pending messages for the upper layer. */
369 sctp_ulpq_free(&asoc
->ulpq
);
371 /* Dispose of any pending chunks on the inqueue. */
372 sctp_inq_free(&asoc
->base
.inqueue
);
374 /* Free ssnmap storage. */
375 sctp_ssnmap_free(asoc
->ssnmap
);
377 /* Clean up the bound address list. */
378 sctp_bind_addr_free(&asoc
->base
.bind_addr
);
380 /* Do we need to go through all of our timers and
381 * delete them? To be safe we will try to delete all, but we
382 * should be able to go through and make a guess based
385 for (i
= SCTP_EVENT_TIMEOUT_NONE
; i
< SCTP_NUM_TIMEOUT_TYPES
; ++i
) {
386 if (timer_pending(&asoc
->timers
[i
]) &&
387 del_timer(&asoc
->timers
[i
]))
388 sctp_association_put(asoc
);
391 /* Free peer's cached cookie. */
392 kfree(asoc
->peer
.cookie
);
394 /* Release the transport structures. */
395 list_for_each_safe(pos
, temp
, &asoc
->peer
.transport_addr_list
) {
396 transport
= list_entry(pos
, struct sctp_transport
, transports
);
398 sctp_transport_free(transport
);
401 asoc
->peer
.transport_count
= 0;
403 /* Free any cached ASCONF_ACK chunk. */
404 if (asoc
->addip_last_asconf_ack
)
405 sctp_chunk_free(asoc
->addip_last_asconf_ack
);
407 /* Free any cached ASCONF chunk. */
408 if (asoc
->addip_last_asconf
)
409 sctp_chunk_free(asoc
->addip_last_asconf
);
411 sctp_association_put(asoc
);
414 /* Cleanup and free up an association. */
415 static void sctp_association_destroy(struct sctp_association
*asoc
)
417 SCTP_ASSERT(asoc
->base
.dead
, "Assoc is not dead", return);
419 sctp_endpoint_put(asoc
->ep
);
420 sock_put(asoc
->base
.sk
);
422 if (asoc
->assoc_id
!= 0) {
423 spin_lock_bh(&sctp_assocs_id_lock
);
424 idr_remove(&sctp_assocs_id
, asoc
->assoc_id
);
425 spin_unlock_bh(&sctp_assocs_id_lock
);
428 BUG_TRAP(!atomic_read(&asoc
->rmem_alloc
));
430 if (asoc
->base
.malloced
) {
432 SCTP_DBG_OBJCNT_DEC(assoc
);
436 /* Change the primary destination address for the peer. */
437 void sctp_assoc_set_primary(struct sctp_association
*asoc
,
438 struct sctp_transport
*transport
)
440 asoc
->peer
.primary_path
= transport
;
442 /* Set a default msg_name for events. */
443 memcpy(&asoc
->peer
.primary_addr
, &transport
->ipaddr
,
444 sizeof(union sctp_addr
));
446 /* If the primary path is changing, assume that the
447 * user wants to use this new path.
449 if ((transport
->state
== SCTP_ACTIVE
) ||
450 (transport
->state
== SCTP_UNKNOWN
))
451 asoc
->peer
.active_path
= transport
;
454 * SFR-CACC algorithm:
455 * Upon the receipt of a request to change the primary
456 * destination address, on the data structure for the new
457 * primary destination, the sender MUST do the following:
459 * 1) If CHANGEOVER_ACTIVE is set, then there was a switch
460 * to this destination address earlier. The sender MUST set
461 * CYCLING_CHANGEOVER to indicate that this switch is a
462 * double switch to the same destination address.
464 if (transport
->cacc
.changeover_active
)
465 transport
->cacc
.cycling_changeover
= 1;
467 /* 2) The sender MUST set CHANGEOVER_ACTIVE to indicate that
468 * a changeover has occurred.
470 transport
->cacc
.changeover_active
= 1;
472 /* 3) The sender MUST store the next TSN to be sent in
473 * next_tsn_at_change.
475 transport
->cacc
.next_tsn_at_change
= asoc
->next_tsn
;
478 /* Remove a transport from an association. */
479 void sctp_assoc_rm_peer(struct sctp_association
*asoc
,
480 struct sctp_transport
*peer
)
482 struct list_head
*pos
;
483 struct sctp_transport
*transport
;
485 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_rm_peer:association %p addr: ",
489 ntohs(peer
->ipaddr
.v4
.sin_port
));
491 /* If we are to remove the current retran_path, update it
492 * to the next peer before removing this peer from the list.
494 if (asoc
->peer
.retran_path
== peer
)
495 sctp_assoc_update_retran_path(asoc
);
497 /* Remove this peer from the list. */
498 list_del(&peer
->transports
);
500 /* Get the first transport of asoc. */
501 pos
= asoc
->peer
.transport_addr_list
.next
;
502 transport
= list_entry(pos
, struct sctp_transport
, transports
);
504 /* Update any entries that match the peer to be deleted. */
505 if (asoc
->peer
.primary_path
== peer
)
506 sctp_assoc_set_primary(asoc
, transport
);
507 if (asoc
->peer
.active_path
== peer
)
508 asoc
->peer
.active_path
= transport
;
509 if (asoc
->peer
.last_data_from
== peer
)
510 asoc
->peer
.last_data_from
= transport
;
512 /* If we remove the transport an INIT was last sent to, set it to
513 * NULL. Combined with the update of the retran path above, this
514 * will cause the next INIT to be sent to the next available
515 * transport, maintaining the cycle.
517 if (asoc
->init_last_sent_to
== peer
)
518 asoc
->init_last_sent_to
= NULL
;
520 asoc
->peer
.transport_count
--;
522 sctp_transport_free(peer
);
525 /* Add a transport address to an association. */
526 struct sctp_transport
*sctp_assoc_add_peer(struct sctp_association
*asoc
,
527 const union sctp_addr
*addr
,
529 const int peer_state
)
531 struct sctp_transport
*peer
;
532 struct sctp_sock
*sp
;
535 sp
= sctp_sk(asoc
->base
.sk
);
537 /* AF_INET and AF_INET6 share common port field. */
538 port
= ntohs(addr
->v4
.sin_port
);
540 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_add_peer:association %p addr: ",
541 " port: %d state:%d\n",
547 /* Set the port if it has not been set yet. */
548 if (0 == asoc
->peer
.port
)
549 asoc
->peer
.port
= port
;
551 /* Check to see if this is a duplicate. */
552 peer
= sctp_assoc_lookup_paddr(asoc
, addr
);
554 if (peer
->state
== SCTP_UNKNOWN
) {
555 if (peer_state
== SCTP_ACTIVE
)
556 peer
->state
= SCTP_ACTIVE
;
557 if (peer_state
== SCTP_UNCONFIRMED
)
558 peer
->state
= SCTP_UNCONFIRMED
;
563 peer
= sctp_transport_new(addr
, gfp
);
567 sctp_transport_set_owner(peer
, asoc
);
569 /* Initialize the peer's heartbeat interval based on the
570 * association configured value.
572 peer
->hbinterval
= asoc
->hbinterval
;
574 /* Set the path max_retrans. */
575 peer
->pathmaxrxt
= asoc
->pathmaxrxt
;
577 /* Initialize the peer's SACK delay timeout based on the
578 * association configured value.
580 peer
->sackdelay
= asoc
->sackdelay
;
582 /* Enable/disable heartbeat, SACK delay, and path MTU discovery
583 * based on association setting.
585 peer
->param_flags
= asoc
->param_flags
;
587 /* Initialize the pmtu of the transport. */
588 if (peer
->param_flags
& SPP_PMTUD_ENABLE
)
589 sctp_transport_pmtu(peer
);
590 else if (asoc
->pathmtu
)
591 peer
->pathmtu
= asoc
->pathmtu
;
593 peer
->pathmtu
= SCTP_DEFAULT_MAXSEGMENT
;
595 /* If this is the first transport addr on this association,
596 * initialize the association PMTU to the peer's PMTU.
597 * If not and the current association PMTU is higher than the new
598 * peer's PMTU, reset the association PMTU to the new peer's PMTU.
601 asoc
->pathmtu
= min_t(int, peer
->pathmtu
, asoc
->pathmtu
);
603 asoc
->pathmtu
= peer
->pathmtu
;
605 SCTP_DEBUG_PRINTK("sctp_assoc_add_peer:association %p PMTU set to "
606 "%d\n", asoc
, asoc
->pathmtu
);
608 asoc
->frag_point
= sctp_frag_point(sp
, asoc
->pathmtu
);
610 /* The asoc->peer.port might not be meaningful yet, but
611 * initialize the packet structure anyway.
613 sctp_packet_init(&peer
->packet
, peer
, asoc
->base
.bind_addr
.port
,
618 * o The initial cwnd before DATA transmission or after a sufficiently
619 * long idle period MUST be set to
620 * min(4*MTU, max(2*MTU, 4380 bytes))
622 * o The initial value of ssthresh MAY be arbitrarily high
623 * (for example, implementations MAY use the size of the
624 * receiver advertised window).
626 peer
->cwnd
= min(4*asoc
->pathmtu
, max_t(__u32
, 2*asoc
->pathmtu
, 4380));
628 /* At this point, we may not have the receiver's advertised window,
629 * so initialize ssthresh to the default value and it will be set
630 * later when we process the INIT.
632 peer
->ssthresh
= SCTP_DEFAULT_MAXWINDOW
;
634 peer
->partial_bytes_acked
= 0;
635 peer
->flight_size
= 0;
637 /* Set the transport's RTO.initial value */
638 peer
->rto
= asoc
->rto_initial
;
640 /* Set the peer's active state. */
641 peer
->state
= peer_state
;
643 /* Attach the remote transport to our asoc. */
644 list_add_tail(&peer
->transports
, &asoc
->peer
.transport_addr_list
);
645 asoc
->peer
.transport_count
++;
647 /* If we do not yet have a primary path, set one. */
648 if (!asoc
->peer
.primary_path
) {
649 sctp_assoc_set_primary(asoc
, peer
);
650 asoc
->peer
.retran_path
= peer
;
653 if (asoc
->peer
.active_path
== asoc
->peer
.retran_path
) {
654 asoc
->peer
.retran_path
= peer
;
660 /* Delete a transport address from an association. */
661 void sctp_assoc_del_peer(struct sctp_association
*asoc
,
662 const union sctp_addr
*addr
)
664 struct list_head
*pos
;
665 struct list_head
*temp
;
666 struct sctp_transport
*transport
;
668 list_for_each_safe(pos
, temp
, &asoc
->peer
.transport_addr_list
) {
669 transport
= list_entry(pos
, struct sctp_transport
, transports
);
670 if (sctp_cmp_addr_exact(addr
, &transport
->ipaddr
)) {
671 /* Do book keeping for removing the peer and free it. */
672 sctp_assoc_rm_peer(asoc
, transport
);
678 /* Lookup a transport by address. */
679 struct sctp_transport
*sctp_assoc_lookup_paddr(
680 const struct sctp_association
*asoc
,
681 const union sctp_addr
*address
)
683 struct sctp_transport
*t
;
684 struct list_head
*pos
;
686 /* Cycle through all transports searching for a peer address. */
688 list_for_each(pos
, &asoc
->peer
.transport_addr_list
) {
689 t
= list_entry(pos
, struct sctp_transport
, transports
);
690 if (sctp_cmp_addr_exact(address
, &t
->ipaddr
))
697 /* Engage in transport control operations.
698 * Mark the transport up or down and send a notification to the user.
699 * Select and update the new active and retran paths.
701 void sctp_assoc_control_transport(struct sctp_association
*asoc
,
702 struct sctp_transport
*transport
,
703 sctp_transport_cmd_t command
,
704 sctp_sn_error_t error
)
706 struct sctp_transport
*t
= NULL
;
707 struct sctp_transport
*first
;
708 struct sctp_transport
*second
;
709 struct sctp_ulpevent
*event
;
710 struct sockaddr_storage addr
;
711 struct list_head
*pos
;
714 /* Record the transition on the transport. */
716 case SCTP_TRANSPORT_UP
:
717 /* If we are moving from UNCONFIRMED state due
718 * to heartbeat success, report the SCTP_ADDR_CONFIRMED
719 * state to the user, otherwise report SCTP_ADDR_AVAILABLE.
721 if (SCTP_UNCONFIRMED
== transport
->state
&&
722 SCTP_HEARTBEAT_SUCCESS
== error
)
723 spc_state
= SCTP_ADDR_CONFIRMED
;
725 spc_state
= SCTP_ADDR_AVAILABLE
;
726 transport
->state
= SCTP_ACTIVE
;
729 case SCTP_TRANSPORT_DOWN
:
730 transport
->state
= SCTP_INACTIVE
;
731 spc_state
= SCTP_ADDR_UNREACHABLE
;
738 /* Generate and send a SCTP_PEER_ADDR_CHANGE notification to the
741 memset(&addr
, 0, sizeof(struct sockaddr_storage
));
742 memcpy(&addr
, &transport
->ipaddr
, transport
->af_specific
->sockaddr_len
);
743 event
= sctp_ulpevent_make_peer_addr_change(asoc
, &addr
,
744 0, spc_state
, error
, GFP_ATOMIC
);
746 sctp_ulpq_tail_event(&asoc
->ulpq
, event
);
748 /* Select new active and retran paths. */
750 /* Look for the two most recently used active transports.
752 * This code produces the wrong ordering whenever jiffies
753 * rolls over, but we still get usable transports, so we don't
756 first
= NULL
; second
= NULL
;
758 list_for_each(pos
, &asoc
->peer
.transport_addr_list
) {
759 t
= list_entry(pos
, struct sctp_transport
, transports
);
761 if ((t
->state
== SCTP_INACTIVE
) ||
762 (t
->state
== SCTP_UNCONFIRMED
))
764 if (!first
|| t
->last_time_heard
> first
->last_time_heard
) {
768 if (!second
|| t
->last_time_heard
> second
->last_time_heard
)
772 /* RFC 2960 6.4 Multi-Homed SCTP Endpoints
774 * By default, an endpoint should always transmit to the
775 * primary path, unless the SCTP user explicitly specifies the
776 * destination transport address (and possibly source
777 * transport address) to use.
779 * [If the primary is active but not most recent, bump the most
780 * recently used transport.]
782 if (((asoc
->peer
.primary_path
->state
== SCTP_ACTIVE
) ||
783 (asoc
->peer
.primary_path
->state
== SCTP_UNKNOWN
)) &&
784 first
!= asoc
->peer
.primary_path
) {
786 first
= asoc
->peer
.primary_path
;
789 /* If we failed to find a usable transport, just camp on the
790 * primary, even if it is inactive.
793 first
= asoc
->peer
.primary_path
;
794 second
= asoc
->peer
.primary_path
;
797 /* Set the active and retran transports. */
798 asoc
->peer
.active_path
= first
;
799 asoc
->peer
.retran_path
= second
;
802 /* Hold a reference to an association. */
803 void sctp_association_hold(struct sctp_association
*asoc
)
805 atomic_inc(&asoc
->base
.refcnt
);
808 /* Release a reference to an association and cleanup
809 * if there are no more references.
811 void sctp_association_put(struct sctp_association
*asoc
)
813 if (atomic_dec_and_test(&asoc
->base
.refcnt
))
814 sctp_association_destroy(asoc
);
817 /* Allocate the next TSN, Transmission Sequence Number, for the given
820 __u32
sctp_association_get_next_tsn(struct sctp_association
*asoc
)
822 /* From Section 1.6 Serial Number Arithmetic:
823 * Transmission Sequence Numbers wrap around when they reach
824 * 2**32 - 1. That is, the next TSN a DATA chunk MUST use
825 * after transmitting TSN = 2*32 - 1 is TSN = 0.
827 __u32 retval
= asoc
->next_tsn
;
834 /* Compare two addresses to see if they match. Wildcard addresses
835 * only match themselves.
837 int sctp_cmp_addr_exact(const union sctp_addr
*ss1
,
838 const union sctp_addr
*ss2
)
842 af
= sctp_get_af_specific(ss1
->sa
.sa_family
);
846 return af
->cmp_addr(ss1
, ss2
);
849 /* Return an ecne chunk to get prepended to a packet.
850 * Note: We are sly and return a shared, prealloced chunk. FIXME:
851 * No we don't, but we could/should.
853 struct sctp_chunk
*sctp_get_ecne_prepend(struct sctp_association
*asoc
)
855 struct sctp_chunk
*chunk
;
857 /* Send ECNE if needed.
858 * Not being able to allocate a chunk here is not deadly.
861 chunk
= sctp_make_ecne(asoc
, asoc
->last_ecne_tsn
);
869 * Find which transport this TSN was sent on.
871 struct sctp_transport
*sctp_assoc_lookup_tsn(struct sctp_association
*asoc
,
874 struct sctp_transport
*active
;
875 struct sctp_transport
*match
;
876 struct list_head
*entry
, *pos
;
877 struct sctp_transport
*transport
;
878 struct sctp_chunk
*chunk
;
879 __be32 key
= htonl(tsn
);
884 * FIXME: In general, find a more efficient data structure for
889 * The general strategy is to search each transport's transmitted
890 * list. Return which transport this TSN lives on.
892 * Let's be hopeful and check the active_path first.
893 * Another optimization would be to know if there is only one
894 * outbound path and not have to look for the TSN at all.
898 active
= asoc
->peer
.active_path
;
900 list_for_each(entry
, &active
->transmitted
) {
901 chunk
= list_entry(entry
, struct sctp_chunk
, transmitted_list
);
903 if (key
== chunk
->subh
.data_hdr
->tsn
) {
909 /* If not found, go search all the other transports. */
910 list_for_each(pos
, &asoc
->peer
.transport_addr_list
) {
911 transport
= list_entry(pos
, struct sctp_transport
, transports
);
913 if (transport
== active
)
915 list_for_each(entry
, &transport
->transmitted
) {
916 chunk
= list_entry(entry
, struct sctp_chunk
,
918 if (key
== chunk
->subh
.data_hdr
->tsn
) {
928 /* Is this the association we are looking for? */
929 struct sctp_transport
*sctp_assoc_is_match(struct sctp_association
*asoc
,
930 const union sctp_addr
*laddr
,
931 const union sctp_addr
*paddr
)
933 struct sctp_transport
*transport
;
935 sctp_read_lock(&asoc
->base
.addr_lock
);
937 if ((htons(asoc
->base
.bind_addr
.port
) == laddr
->v4
.sin_port
) &&
938 (htons(asoc
->peer
.port
) == paddr
->v4
.sin_port
)) {
939 transport
= sctp_assoc_lookup_paddr(asoc
, paddr
);
943 if (sctp_bind_addr_match(&asoc
->base
.bind_addr
, laddr
,
944 sctp_sk(asoc
->base
.sk
)))
950 sctp_read_unlock(&asoc
->base
.addr_lock
);
954 /* Do delayed input processing. This is scheduled by sctp_rcv(). */
955 static void sctp_assoc_bh_rcv(struct work_struct
*work
)
957 struct sctp_association
*asoc
=
958 container_of(work
, struct sctp_association
,
959 base
.inqueue
.immediate
);
960 struct sctp_endpoint
*ep
;
961 struct sctp_chunk
*chunk
;
963 struct sctp_inq
*inqueue
;
965 sctp_subtype_t subtype
;
968 /* The association should be held so we should be safe. */
972 inqueue
= &asoc
->base
.inqueue
;
973 sctp_association_hold(asoc
);
974 while (NULL
!= (chunk
= sctp_inq_pop(inqueue
))) {
976 subtype
= SCTP_ST_CHUNK(chunk
->chunk_hdr
->type
);
978 /* Remember where the last DATA chunk came from so we
979 * know where to send the SACK.
981 if (sctp_chunk_is_data(chunk
))
982 asoc
->peer
.last_data_from
= chunk
->transport
;
984 SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS
);
986 if (chunk
->transport
)
987 chunk
->transport
->last_time_heard
= jiffies
;
989 /* Run through the state machine. */
990 error
= sctp_do_sm(SCTP_EVENT_T_CHUNK
, subtype
,
991 state
, ep
, asoc
, chunk
, GFP_ATOMIC
);
993 /* Check to see if the association is freed in response to
994 * the incoming chunk. If so, get out of the while loop.
999 /* If there is an error on chunk, discard this packet. */
1001 chunk
->pdiscard
= 1;
1003 sctp_association_put(asoc
);
1006 /* This routine moves an association from its old sk to a new sk. */
1007 void sctp_assoc_migrate(struct sctp_association
*assoc
, struct sock
*newsk
)
1009 struct sctp_sock
*newsp
= sctp_sk(newsk
);
1010 struct sock
*oldsk
= assoc
->base
.sk
;
1012 /* Delete the association from the old endpoint's list of
1015 list_del_init(&assoc
->asocs
);
1017 /* Decrement the backlog value for a TCP-style socket. */
1018 if (sctp_style(oldsk
, TCP
))
1019 oldsk
->sk_ack_backlog
--;
1021 /* Release references to the old endpoint and the sock. */
1022 sctp_endpoint_put(assoc
->ep
);
1023 sock_put(assoc
->base
.sk
);
1025 /* Get a reference to the new endpoint. */
1026 assoc
->ep
= newsp
->ep
;
1027 sctp_endpoint_hold(assoc
->ep
);
1029 /* Get a reference to the new sock. */
1030 assoc
->base
.sk
= newsk
;
1031 sock_hold(assoc
->base
.sk
);
1033 /* Add the association to the new endpoint's list of associations. */
1034 sctp_endpoint_add_asoc(newsp
->ep
, assoc
);
1037 /* Update an association (possibly from unexpected COOKIE-ECHO processing). */
1038 void sctp_assoc_update(struct sctp_association
*asoc
,
1039 struct sctp_association
*new)
1041 struct sctp_transport
*trans
;
1042 struct list_head
*pos
, *temp
;
1044 /* Copy in new parameters of peer. */
1046 asoc
->peer
.rwnd
= new->peer
.rwnd
;
1047 asoc
->peer
.sack_needed
= new->peer
.sack_needed
;
1048 asoc
->peer
.i
= new->peer
.i
;
1049 sctp_tsnmap_init(&asoc
->peer
.tsn_map
, SCTP_TSN_MAP_SIZE
,
1050 asoc
->peer
.i
.initial_tsn
);
1052 /* Remove any peer addresses not present in the new association. */
1053 list_for_each_safe(pos
, temp
, &asoc
->peer
.transport_addr_list
) {
1054 trans
= list_entry(pos
, struct sctp_transport
, transports
);
1055 if (!sctp_assoc_lookup_paddr(new, &trans
->ipaddr
))
1056 sctp_assoc_del_peer(asoc
, &trans
->ipaddr
);
1058 if (asoc
->state
>= SCTP_STATE_ESTABLISHED
)
1059 sctp_transport_reset(trans
);
1062 /* If the case is A (association restart), use
1063 * initial_tsn as next_tsn. If the case is B, use
1064 * current next_tsn in case data sent to peer
1065 * has been discarded and needs retransmission.
1067 if (asoc
->state
>= SCTP_STATE_ESTABLISHED
) {
1068 asoc
->next_tsn
= new->next_tsn
;
1069 asoc
->ctsn_ack_point
= new->ctsn_ack_point
;
1070 asoc
->adv_peer_ack_point
= new->adv_peer_ack_point
;
1072 /* Reinitialize SSN for both local streams
1073 * and peer's streams.
1075 sctp_ssnmap_clear(asoc
->ssnmap
);
1077 /* Flush the ULP reassembly and ordered queue.
1078 * Any data there will now be stale and will
1081 sctp_ulpq_flush(&asoc
->ulpq
);
1083 /* reset the overall association error count so
1084 * that the restarted association doesn't get torn
1085 * down on the next retransmission timer.
1087 asoc
->overall_error_count
= 0;
1090 /* Add any peer addresses from the new association. */
1091 list_for_each(pos
, &new->peer
.transport_addr_list
) {
1092 trans
= list_entry(pos
, struct sctp_transport
,
1094 if (!sctp_assoc_lookup_paddr(asoc
, &trans
->ipaddr
))
1095 sctp_assoc_add_peer(asoc
, &trans
->ipaddr
,
1096 GFP_ATOMIC
, trans
->state
);
1099 asoc
->ctsn_ack_point
= asoc
->next_tsn
- 1;
1100 asoc
->adv_peer_ack_point
= asoc
->ctsn_ack_point
;
1101 if (!asoc
->ssnmap
) {
1102 /* Move the ssnmap. */
1103 asoc
->ssnmap
= new->ssnmap
;
1109 /* Update the retran path for sending a retransmitted packet.
1110 * Round-robin through the active transports, else round-robin
1111 * through the inactive transports as this is the next best thing
1114 void sctp_assoc_update_retran_path(struct sctp_association
*asoc
)
1116 struct sctp_transport
*t
, *next
;
1117 struct list_head
*head
= &asoc
->peer
.transport_addr_list
;
1118 struct list_head
*pos
;
1120 /* Find the next transport in a round-robin fashion. */
1121 t
= asoc
->peer
.retran_path
;
1122 pos
= &t
->transports
;
1126 /* Skip the head. */
1127 if (pos
->next
== head
)
1132 t
= list_entry(pos
, struct sctp_transport
, transports
);
1134 /* Try to find an active transport. */
1136 if ((t
->state
== SCTP_ACTIVE
) ||
1137 (t
->state
== SCTP_UNKNOWN
)) {
1140 /* Keep track of the next transport in case
1141 * we don't find any active transport.
1147 /* We have exhausted the list, but didn't find any
1148 * other active transports. If so, use the next
1151 if (t
== asoc
->peer
.retran_path
) {
1157 asoc
->peer
.retran_path
= t
;
1159 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1164 ntohs(t
->ipaddr
.v4
.sin_port
));
1167 /* Choose the transport for sending a INIT packet. */
1168 struct sctp_transport
*sctp_assoc_choose_init_transport(
1169 struct sctp_association
*asoc
)
1171 struct sctp_transport
*t
;
1173 /* Use the retran path. If the last INIT was sent over the
1174 * retran path, update the retran path and use it.
1176 if (!asoc
->init_last_sent_to
) {
1177 t
= asoc
->peer
.active_path
;
1179 if (asoc
->init_last_sent_to
== asoc
->peer
.retran_path
)
1180 sctp_assoc_update_retran_path(asoc
);
1181 t
= asoc
->peer
.retran_path
;
1184 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1189 ntohs(t
->ipaddr
.v4
.sin_port
));
1194 /* Choose the transport for sending a SHUTDOWN packet. */
1195 struct sctp_transport
*sctp_assoc_choose_shutdown_transport(
1196 struct sctp_association
*asoc
)
1198 /* If this is the first time SHUTDOWN is sent, use the active path,
1199 * else use the retran path. If the last SHUTDOWN was sent over the
1200 * retran path, update the retran path and use it.
1202 if (!asoc
->shutdown_last_sent_to
)
1203 return asoc
->peer
.active_path
;
1205 if (asoc
->shutdown_last_sent_to
== asoc
->peer
.retran_path
)
1206 sctp_assoc_update_retran_path(asoc
);
1207 return asoc
->peer
.retran_path
;
1212 /* Update the association's pmtu and frag_point by going through all the
1213 * transports. This routine is called when a transport's PMTU has changed.
1215 void sctp_assoc_sync_pmtu(struct sctp_association
*asoc
)
1217 struct sctp_transport
*t
;
1218 struct list_head
*pos
;
1224 /* Get the lowest pmtu of all the transports. */
1225 list_for_each(pos
, &asoc
->peer
.transport_addr_list
) {
1226 t
= list_entry(pos
, struct sctp_transport
, transports
);
1227 if (!pmtu
|| (t
->pathmtu
< pmtu
))
1232 struct sctp_sock
*sp
= sctp_sk(asoc
->base
.sk
);
1233 asoc
->pathmtu
= pmtu
;
1234 asoc
->frag_point
= sctp_frag_point(sp
, pmtu
);
1237 SCTP_DEBUG_PRINTK("%s: asoc:%p, pmtu:%d, frag_point:%d\n",
1238 __FUNCTION__
, asoc
, asoc
->pathmtu
, asoc
->frag_point
);
1241 /* Should we send a SACK to update our peer? */
1242 static inline int sctp_peer_needs_update(struct sctp_association
*asoc
)
1244 switch (asoc
->state
) {
1245 case SCTP_STATE_ESTABLISHED
:
1246 case SCTP_STATE_SHUTDOWN_PENDING
:
1247 case SCTP_STATE_SHUTDOWN_RECEIVED
:
1248 case SCTP_STATE_SHUTDOWN_SENT
:
1249 if ((asoc
->rwnd
> asoc
->a_rwnd
) &&
1250 ((asoc
->rwnd
- asoc
->a_rwnd
) >=
1251 min_t(__u32
, (asoc
->base
.sk
->sk_rcvbuf
>> 1), asoc
->pathmtu
)))
1260 /* Increase asoc's rwnd by len and send any window update SACK if needed. */
1261 void sctp_assoc_rwnd_increase(struct sctp_association
*asoc
, unsigned len
)
1263 struct sctp_chunk
*sack
;
1264 struct timer_list
*timer
;
1266 if (asoc
->rwnd_over
) {
1267 if (asoc
->rwnd_over
>= len
) {
1268 asoc
->rwnd_over
-= len
;
1270 asoc
->rwnd
+= (len
- asoc
->rwnd_over
);
1271 asoc
->rwnd_over
= 0;
1277 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd increased by %d to (%u, %u) "
1278 "- %u\n", __FUNCTION__
, asoc
, len
, asoc
->rwnd
,
1279 asoc
->rwnd_over
, asoc
->a_rwnd
);
1281 /* Send a window update SACK if the rwnd has increased by at least the
1282 * minimum of the association's PMTU and half of the receive buffer.
1283 * The algorithm used is similar to the one described in
1284 * Section 4.2.3.3 of RFC 1122.
1286 if (sctp_peer_needs_update(asoc
)) {
1287 asoc
->a_rwnd
= asoc
->rwnd
;
1288 SCTP_DEBUG_PRINTK("%s: Sending window update SACK- asoc: %p "
1289 "rwnd: %u a_rwnd: %u\n", __FUNCTION__
,
1290 asoc
, asoc
->rwnd
, asoc
->a_rwnd
);
1291 sack
= sctp_make_sack(asoc
);
1295 asoc
->peer
.sack_needed
= 0;
1297 sctp_outq_tail(&asoc
->outqueue
, sack
);
1299 /* Stop the SACK timer. */
1300 timer
= &asoc
->timers
[SCTP_EVENT_TIMEOUT_SACK
];
1301 if (timer_pending(timer
) && del_timer(timer
))
1302 sctp_association_put(asoc
);
1306 /* Decrease asoc's rwnd by len. */
1307 void sctp_assoc_rwnd_decrease(struct sctp_association
*asoc
, unsigned len
)
1309 SCTP_ASSERT(asoc
->rwnd
, "rwnd zero", return);
1310 SCTP_ASSERT(!asoc
->rwnd_over
, "rwnd_over not zero", return);
1311 if (asoc
->rwnd
>= len
) {
1314 asoc
->rwnd_over
= len
- asoc
->rwnd
;
1317 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd decreased by %d to (%u, %u)\n",
1318 __FUNCTION__
, asoc
, len
, asoc
->rwnd
,
1322 /* Build the bind address list for the association based on info from the
1323 * local endpoint and the remote peer.
1325 int sctp_assoc_set_bind_addr_from_ep(struct sctp_association
*asoc
,
1331 /* Use scoping rules to determine the subset of addresses from
1334 scope
= sctp_scope(&asoc
->peer
.active_path
->ipaddr
);
1335 flags
= (PF_INET6
== asoc
->base
.sk
->sk_family
) ? SCTP_ADDR6_ALLOWED
: 0;
1336 if (asoc
->peer
.ipv4_address
)
1337 flags
|= SCTP_ADDR4_PEERSUPP
;
1338 if (asoc
->peer
.ipv6_address
)
1339 flags
|= SCTP_ADDR6_PEERSUPP
;
1341 return sctp_bind_addr_copy(&asoc
->base
.bind_addr
,
1342 &asoc
->ep
->base
.bind_addr
,
1346 /* Build the association's bind address list from the cookie. */
1347 int sctp_assoc_set_bind_addr_from_cookie(struct sctp_association
*asoc
,
1348 struct sctp_cookie
*cookie
,
1351 int var_size2
= ntohs(cookie
->peer_init
->chunk_hdr
.length
);
1352 int var_size3
= cookie
->raw_addr_list_len
;
1353 __u8
*raw
= (__u8
*)cookie
->peer_init
+ var_size2
;
1355 return sctp_raw_to_bind_addrs(&asoc
->base
.bind_addr
, raw
, var_size3
,
1356 asoc
->ep
->base
.bind_addr
.port
, gfp
);
1359 /* Lookup laddr in the bind address list of an association. */
1360 int sctp_assoc_lookup_laddr(struct sctp_association
*asoc
,
1361 const union sctp_addr
*laddr
)
1365 sctp_read_lock(&asoc
->base
.addr_lock
);
1366 if ((asoc
->base
.bind_addr
.port
== ntohs(laddr
->v4
.sin_port
)) &&
1367 sctp_bind_addr_match(&asoc
->base
.bind_addr
, laddr
,
1368 sctp_sk(asoc
->base
.sk
))) {
1375 sctp_read_unlock(&asoc
->base
.addr_lock
);