sctp: do not enable peer features if we can't do them.
[linux-2.6-block.git] / net / sctp / associola.c
CommitLineData
60c778b2 1/* SCTP kernel implementation
1da177e4
LT
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
7 *
60c778b2 8 * This file is part of the SCTP kernel implementation
1da177e4
LT
9 *
10 * This module provides the abstraction for an SCTP association.
11 *
60c778b2 12 * This SCTP implementation is free software;
1da177e4
LT
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)
16 * any later version.
17 *
60c778b2 18 * This SCTP implementation is distributed in the hope that it
1da177e4
LT
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.
23 *
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.
28 *
29 * Please send any bug reports or fixes you make to the
30 * email address(es):
31 * lksctp developers <lksctp-developers@lists.sourceforge.net>
32 *
33 * Or submit a bug report through the following website:
34 * http://www.sf.net/projects/lksctp
35 *
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>
46 *
47 * Any bugs reported given to us we will try to fix... any fixes shared will
48 * be incorporated into the next SCTP release.
49 */
50
51#include <linux/types.h>
52#include <linux/fcntl.h>
53#include <linux/poll.h>
54#include <linux/init.h>
1da177e4
LT
55
56#include <linux/slab.h>
57#include <linux/in.h>
58#include <net/ipv6.h>
59#include <net/sctp/sctp.h>
60#include <net/sctp/sm.h>
61
62/* Forward declarations for internal functions. */
c4028958 63static void sctp_assoc_bh_rcv(struct work_struct *work);
a08de64d 64static void sctp_assoc_free_asconf_acks(struct sctp_association *asoc);
1da177e4
LT
65
66
67/* 1st Level Abstractions. */
68
69/* Initialize a new association from provided memory. */
70static struct sctp_association *sctp_association_init(struct sctp_association *asoc,
71 const struct sctp_endpoint *ep,
72 const struct sock *sk,
73 sctp_scope_t scope,
dd0fc66f 74 gfp_t gfp)
1da177e4
LT
75{
76 struct sctp_sock *sp;
77 int i;
a29a5bd4
VY
78 sctp_paramhdr_t *p;
79 int err;
1da177e4
LT
80
81 /* Retrieve the SCTP per socket area. */
82 sp = sctp_sk((struct sock *)sk);
83
84 /* Init all variables to a known value. */
85 memset(asoc, 0, sizeof(struct sctp_association));
86
87 /* Discarding const is appropriate here. */
88 asoc->ep = (struct sctp_endpoint *)ep;
89 sctp_endpoint_hold(asoc->ep);
90
91 /* Hold the sock. */
92 asoc->base.sk = (struct sock *)sk;
93 sock_hold(asoc->base.sk);
94
95 /* Initialize the common base substructure. */
96 asoc->base.type = SCTP_EP_TYPE_ASSOCIATION;
97
98 /* Initialize the object handling fields. */
99 atomic_set(&asoc->base.refcnt, 1);
100 asoc->base.dead = 0;
101 asoc->base.malloced = 0;
102
103 /* Initialize the bind addr area. */
104 sctp_bind_addr_init(&asoc->base.bind_addr, ep->base.bind_addr.port);
1da177e4
LT
105
106 asoc->state = SCTP_STATE_CLOSED;
107
108 /* Set these values from the socket values, a conversion between
109 * millsecons to seconds/microseconds must also be done.
110 */
111 asoc->cookie_life.tv_sec = sp->assocparams.sasoc_cookie_life / 1000;
112 asoc->cookie_life.tv_usec = (sp->assocparams.sasoc_cookie_life % 1000)
113 * 1000;
1da177e4
LT
114 asoc->frag_point = 0;
115
116 /* Set the association max_retrans and RTO values from the
117 * socket values.
118 */
119 asoc->max_retrans = sp->assocparams.sasoc_asocmaxrxt;
120 asoc->rto_initial = msecs_to_jiffies(sp->rtoinfo.srto_initial);
121 asoc->rto_max = msecs_to_jiffies(sp->rtoinfo.srto_max);
122 asoc->rto_min = msecs_to_jiffies(sp->rtoinfo.srto_min);
123
124 asoc->overall_error_count = 0;
125
52ccb8e9
FF
126 /* Initialize the association's heartbeat interval based on the
127 * sock configured value.
128 */
129 asoc->hbinterval = msecs_to_jiffies(sp->hbinterval);
130
131 /* Initialize path max retrans value. */
132 asoc->pathmaxrxt = sp->pathmaxrxt;
133
134 /* Initialize default path MTU. */
135 asoc->pathmtu = sp->pathmtu;
136
137 /* Set association default SACK delay */
138 asoc->sackdelay = msecs_to_jiffies(sp->sackdelay);
d364d927 139 asoc->sackfreq = sp->sackfreq;
52ccb8e9
FF
140
141 /* Set the association default flags controlling
142 * Heartbeat, SACK delay, and Path MTU Discovery.
143 */
144 asoc->param_flags = sp->param_flags;
145
1da177e4
LT
146 /* Initialize the maximum mumber of new data packets that can be sent
147 * in a burst.
148 */
70331571 149 asoc->max_burst = sp->max_burst;
1da177e4 150
1e7d3d90
VY
151 /* initialize association timers */
152 asoc->timeouts[SCTP_EVENT_TIMEOUT_NONE] = 0;
153 asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_COOKIE] = asoc->rto_initial;
154 asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_INIT] = asoc->rto_initial;
155 asoc->timeouts[SCTP_EVENT_TIMEOUT_T2_SHUTDOWN] = asoc->rto_initial;
156 asoc->timeouts[SCTP_EVENT_TIMEOUT_T3_RTX] = 0;
157 asoc->timeouts[SCTP_EVENT_TIMEOUT_T4_RTO] = 0;
158
159 /* sctpimpguide Section 2.12.2
160 * If the 'T5-shutdown-guard' timer is used, it SHOULD be set to the
161 * recommended value of 5 times 'RTO.Max'.
162 */
d808ad9a 163 asoc->timeouts[SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD]
1e7d3d90
VY
164 = 5 * asoc->rto_max;
165
166 asoc->timeouts[SCTP_EVENT_TIMEOUT_HEARTBEAT] = 0;
52ccb8e9 167 asoc->timeouts[SCTP_EVENT_TIMEOUT_SACK] = asoc->sackdelay;
1e7d3d90
VY
168 asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE] =
169 sp->autoclose * HZ;
d808ad9a 170
1e7d3d90 171 /* Initilizes the timers */
b24b8a24
PE
172 for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i)
173 setup_timer(&asoc->timers[i], sctp_timer_events[i],
174 (unsigned long)asoc);
1da177e4
LT
175
176 /* Pull default initialization values from the sock options.
177 * Note: This assumes that the values have already been
178 * validated in the sock.
179 */
180 asoc->c.sinit_max_instreams = sp->initmsg.sinit_max_instreams;
181 asoc->c.sinit_num_ostreams = sp->initmsg.sinit_num_ostreams;
182 asoc->max_init_attempts = sp->initmsg.sinit_max_attempts;
183
184 asoc->max_init_timeo =
185 msecs_to_jiffies(sp->initmsg.sinit_max_init_timeo);
186
187 /* Allocate storage for the ssnmap after the inbound and outbound
188 * streams have been negotiated during Init.
189 */
190 asoc->ssnmap = NULL;
191
192 /* Set the local window size for receive.
193 * This is also the rcvbuf space per association.
194 * RFC 6 - A SCTP receiver MUST be able to receive a minimum of
195 * 1500 bytes in one SCTP packet.
196 */
049b3ff5 197 if ((sk->sk_rcvbuf/2) < SCTP_DEFAULT_MINWINDOW)
1da177e4
LT
198 asoc->rwnd = SCTP_DEFAULT_MINWINDOW;
199 else
049b3ff5 200 asoc->rwnd = sk->sk_rcvbuf/2;
1da177e4
LT
201
202 asoc->a_rwnd = asoc->rwnd;
203
204 asoc->rwnd_over = 0;
205
206 /* Use my own max window until I learn something better. */
207 asoc->peer.rwnd = SCTP_DEFAULT_MAXWINDOW;
208
209 /* Set the sndbuf size for transmit. */
210 asoc->sndbuf_used = 0;
211
049b3ff5
NH
212 /* Initialize the receive memory counter */
213 atomic_set(&asoc->rmem_alloc, 0);
214
1da177e4
LT
215 init_waitqueue_head(&asoc->wait);
216
217 asoc->c.my_vtag = sctp_generate_tag(ep);
218 asoc->peer.i.init_tag = 0; /* INIT needs a vtag of 0. */
219 asoc->c.peer_vtag = 0;
220 asoc->c.my_ttag = 0;
221 asoc->c.peer_ttag = 0;
222 asoc->c.my_port = ep->base.bind_addr.port;
223
224 asoc->c.initial_tsn = sctp_generate_tsn(ep);
225
226 asoc->next_tsn = asoc->c.initial_tsn;
227
228 asoc->ctsn_ack_point = asoc->next_tsn - 1;
229 asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
230 asoc->highest_sacked = asoc->ctsn_ack_point;
231 asoc->last_cwr_tsn = asoc->ctsn_ack_point;
232 asoc->unack_data = 0;
233
1da177e4
LT
234 /* ADDIP Section 4.1 Asconf Chunk Procedures
235 *
236 * When an endpoint has an ASCONF signaled change to be sent to the
237 * remote endpoint it should do the following:
238 * ...
239 * A2) a serial number should be assigned to the chunk. The serial
240 * number SHOULD be a monotonically increasing number. The serial
241 * numbers SHOULD be initialized at the start of the
242 * association to the same value as the initial TSN.
243 */
244 asoc->addip_serial = asoc->c.initial_tsn;
245
79af02c2 246 INIT_LIST_HEAD(&asoc->addip_chunk_list);
a08de64d 247 INIT_LIST_HEAD(&asoc->asconf_ack_list);
1da177e4
LT
248
249 /* Make an empty list of remote transport addresses. */
250 INIT_LIST_HEAD(&asoc->peer.transport_addr_list);
3f7a87d2 251 asoc->peer.transport_count = 0;
1da177e4
LT
252
253 /* RFC 2960 5.1 Normal Establishment of an Association
254 *
255 * After the reception of the first data chunk in an
256 * association the endpoint must immediately respond with a
257 * sack to acknowledge the data chunk. Subsequent
258 * acknowledgements should be done as described in Section
259 * 6.2.
260 *
261 * [We implement this by telling a new association that it
262 * already received one packet.]
263 */
264 asoc->peer.sack_needed = 1;
d364d927 265 asoc->peer.sack_cnt = 0;
1da177e4 266
73d9c4fd
VY
267 /* Assume that the peer will tell us if he recognizes ASCONF
268 * as part of INIT exchange.
269 * The sctp_addip_noauth option is there for backward compatibilty
270 * and will revert old behavior.
1da177e4 271 */
88799fe5 272 asoc->peer.asconf_capable = 0;
73d9c4fd
VY
273 if (sctp_addip_noauth)
274 asoc->peer.asconf_capable = 1;
1da177e4
LT
275
276 /* Create an input queue. */
277 sctp_inq_init(&asoc->base.inqueue);
c4028958 278 sctp_inq_set_th_handler(&asoc->base.inqueue, sctp_assoc_bh_rcv);
1da177e4
LT
279
280 /* Create an output queue. */
281 sctp_outq_init(asoc, &asoc->outqueue);
282
283 if (!sctp_ulpq_init(&asoc->ulpq, asoc))
284 goto fail_init;
285
286 /* Set up the tsn tracking. */
287 sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE, 0);
288
289 asoc->need_ecne = 0;
290
291 asoc->assoc_id = 0;
292
293 /* Assume that peer would support both address types unless we are
294 * told otherwise.
295 */
296 asoc->peer.ipv4_address = 1;
297 asoc->peer.ipv6_address = 1;
298 INIT_LIST_HEAD(&asoc->asocs);
299
300 asoc->autoclose = sp->autoclose;
301
302 asoc->default_stream = sp->default_stream;
303 asoc->default_ppid = sp->default_ppid;
304 asoc->default_flags = sp->default_flags;
305 asoc->default_context = sp->default_context;
306 asoc->default_timetolive = sp->default_timetolive;
6ab792f5 307 asoc->default_rcv_context = sp->default_rcv_context;
1da177e4 308
a29a5bd4
VY
309 /* AUTH related initializations */
310 INIT_LIST_HEAD(&asoc->endpoint_shared_keys);
311 err = sctp_auth_asoc_copy_shkeys(ep, asoc, gfp);
312 if (err)
313 goto fail_init;
314
315 asoc->active_key_id = ep->active_key_id;
316 asoc->asoc_shared_key = NULL;
317
318 asoc->default_hmac_id = 0;
319 /* Save the hmacs and chunks list into this association */
320 if (ep->auth_hmacs_list)
321 memcpy(asoc->c.auth_hmacs, ep->auth_hmacs_list,
322 ntohs(ep->auth_hmacs_list->param_hdr.length));
323 if (ep->auth_chunk_list)
324 memcpy(asoc->c.auth_chunks, ep->auth_chunk_list,
325 ntohs(ep->auth_chunk_list->param_hdr.length));
326
327 /* Get the AUTH random number for this association */
328 p = (sctp_paramhdr_t *)asoc->c.auth_random;
329 p->type = SCTP_PARAM_RANDOM;
330 p->length = htons(sizeof(sctp_paramhdr_t) + SCTP_AUTH_RANDOM_LENGTH);
331 get_random_bytes(p+1, SCTP_AUTH_RANDOM_LENGTH);
332
1da177e4
LT
333 return asoc;
334
335fail_init:
336 sctp_endpoint_put(asoc->ep);
337 sock_put(asoc->base.sk);
338 return NULL;
339}
340
341/* Allocate and initialize a new association */
342struct sctp_association *sctp_association_new(const struct sctp_endpoint *ep,
343 const struct sock *sk,
3182cd84 344 sctp_scope_t scope,
dd0fc66f 345 gfp_t gfp)
1da177e4
LT
346{
347 struct sctp_association *asoc;
348
349 asoc = t_new(struct sctp_association, gfp);
350 if (!asoc)
351 goto fail;
352
353 if (!sctp_association_init(asoc, ep, sk, scope, gfp))
354 goto fail_init;
355
356 asoc->base.malloced = 1;
357 SCTP_DBG_OBJCNT_INC(assoc);
3f7a87d2 358 SCTP_DEBUG_PRINTK("Created asoc %p\n", asoc);
1da177e4
LT
359
360 return asoc;
361
362fail_init:
363 kfree(asoc);
364fail:
365 return NULL;
366}
367
368/* Free this association if possible. There may still be users, so
369 * the actual deallocation may be delayed.
370 */
371void sctp_association_free(struct sctp_association *asoc)
372{
373 struct sock *sk = asoc->base.sk;
374 struct sctp_transport *transport;
375 struct list_head *pos, *temp;
376 int i;
377
de76e695
VY
378 /* Only real associations count against the endpoint, so
379 * don't bother for if this is a temporary association.
380 */
381 if (!asoc->temp) {
382 list_del(&asoc->asocs);
383
384 /* Decrement the backlog value for a TCP-style listening
385 * socket.
386 */
387 if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
388 sk->sk_ack_backlog--;
389 }
1da177e4
LT
390
391 /* Mark as dead, so other users can know this structure is
392 * going away.
393 */
394 asoc->base.dead = 1;
395
396 /* Dispose of any data lying around in the outqueue. */
397 sctp_outq_free(&asoc->outqueue);
398
399 /* Dispose of any pending messages for the upper layer. */
400 sctp_ulpq_free(&asoc->ulpq);
401
402 /* Dispose of any pending chunks on the inqueue. */
403 sctp_inq_free(&asoc->base.inqueue);
404
405 /* Free ssnmap storage. */
406 sctp_ssnmap_free(asoc->ssnmap);
407
408 /* Clean up the bound address list. */
409 sctp_bind_addr_free(&asoc->base.bind_addr);
410
411 /* Do we need to go through all of our timers and
412 * delete them? To be safe we will try to delete all, but we
413 * should be able to go through and make a guess based
414 * on our state.
415 */
416 for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i) {
417 if (timer_pending(&asoc->timers[i]) &&
418 del_timer(&asoc->timers[i]))
419 sctp_association_put(asoc);
420 }
421
422 /* Free peer's cached cookie. */
a51482bd 423 kfree(asoc->peer.cookie);
730fc3d0
VY
424 kfree(asoc->peer.peer_random);
425 kfree(asoc->peer.peer_chunks);
426 kfree(asoc->peer.peer_hmacs);
1da177e4
LT
427
428 /* Release the transport structures. */
429 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
430 transport = list_entry(pos, struct sctp_transport, transports);
431 list_del(pos);
432 sctp_transport_free(transport);
433 }
434
3f7a87d2
FF
435 asoc->peer.transport_count = 0;
436
1da177e4 437 /* Free any cached ASCONF_ACK chunk. */
a08de64d 438 sctp_assoc_free_asconf_acks(asoc);
1da177e4
LT
439
440 /* Free any cached ASCONF chunk. */
441 if (asoc->addip_last_asconf)
442 sctp_chunk_free(asoc->addip_last_asconf);
443
a29a5bd4
VY
444 /* AUTH - Free the endpoint shared keys */
445 sctp_auth_destroy_keys(&asoc->endpoint_shared_keys);
446
447 /* AUTH - Free the association shared key */
448 sctp_auth_key_put(asoc->asoc_shared_key);
449
1da177e4
LT
450 sctp_association_put(asoc);
451}
452
453/* Cleanup and free up an association. */
454static void sctp_association_destroy(struct sctp_association *asoc)
455{
456 SCTP_ASSERT(asoc->base.dead, "Assoc is not dead", return);
457
458 sctp_endpoint_put(asoc->ep);
459 sock_put(asoc->base.sk);
460
461 if (asoc->assoc_id != 0) {
462 spin_lock_bh(&sctp_assocs_id_lock);
463 idr_remove(&sctp_assocs_id, asoc->assoc_id);
464 spin_unlock_bh(&sctp_assocs_id_lock);
465 }
466
547b792c 467 WARN_ON(atomic_read(&asoc->rmem_alloc));
049b3ff5 468
1da177e4
LT
469 if (asoc->base.malloced) {
470 kfree(asoc);
471 SCTP_DBG_OBJCNT_DEC(assoc);
472 }
473}
474
475/* Change the primary destination address for the peer. */
476void sctp_assoc_set_primary(struct sctp_association *asoc,
477 struct sctp_transport *transport)
478{
319fa2a2
VY
479 int changeover = 0;
480
481 /* it's a changeover only if we already have a primary path
482 * that we are changing
483 */
484 if (asoc->peer.primary_path != NULL &&
485 asoc->peer.primary_path != transport)
486 changeover = 1 ;
487
1da177e4
LT
488 asoc->peer.primary_path = transport;
489
490 /* Set a default msg_name for events. */
491 memcpy(&asoc->peer.primary_addr, &transport->ipaddr,
492 sizeof(union sctp_addr));
493
494 /* If the primary path is changing, assume that the
495 * user wants to use this new path.
496 */
ad8fec17
SS
497 if ((transport->state == SCTP_ACTIVE) ||
498 (transport->state == SCTP_UNKNOWN))
1da177e4
LT
499 asoc->peer.active_path = transport;
500
501 /*
502 * SFR-CACC algorithm:
503 * Upon the receipt of a request to change the primary
504 * destination address, on the data structure for the new
505 * primary destination, the sender MUST do the following:
506 *
507 * 1) If CHANGEOVER_ACTIVE is set, then there was a switch
508 * to this destination address earlier. The sender MUST set
509 * CYCLING_CHANGEOVER to indicate that this switch is a
510 * double switch to the same destination address.
511 */
512 if (transport->cacc.changeover_active)
319fa2a2 513 transport->cacc.cycling_changeover = changeover;
1da177e4
LT
514
515 /* 2) The sender MUST set CHANGEOVER_ACTIVE to indicate that
516 * a changeover has occurred.
517 */
319fa2a2 518 transport->cacc.changeover_active = changeover;
1da177e4
LT
519
520 /* 3) The sender MUST store the next TSN to be sent in
521 * next_tsn_at_change.
522 */
523 transport->cacc.next_tsn_at_change = asoc->next_tsn;
524}
525
3f7a87d2
FF
526/* Remove a transport from an association. */
527void sctp_assoc_rm_peer(struct sctp_association *asoc,
528 struct sctp_transport *peer)
529{
530 struct list_head *pos;
531 struct sctp_transport *transport;
532
533 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_rm_peer:association %p addr: ",
534 " port: %d\n",
535 asoc,
536 (&peer->ipaddr),
b3f5b3b6 537 ntohs(peer->ipaddr.v4.sin_port));
3f7a87d2
FF
538
539 /* If we are to remove the current retran_path, update it
540 * to the next peer before removing this peer from the list.
541 */
542 if (asoc->peer.retran_path == peer)
543 sctp_assoc_update_retran_path(asoc);
544
545 /* Remove this peer from the list. */
546 list_del(&peer->transports);
547
548 /* Get the first transport of asoc. */
549 pos = asoc->peer.transport_addr_list.next;
550 transport = list_entry(pos, struct sctp_transport, transports);
551
552 /* Update any entries that match the peer to be deleted. */
553 if (asoc->peer.primary_path == peer)
554 sctp_assoc_set_primary(asoc, transport);
555 if (asoc->peer.active_path == peer)
556 asoc->peer.active_path = transport;
557 if (asoc->peer.last_data_from == peer)
558 asoc->peer.last_data_from = transport;
559
560 /* If we remove the transport an INIT was last sent to, set it to
561 * NULL. Combined with the update of the retran path above, this
562 * will cause the next INIT to be sent to the next available
563 * transport, maintaining the cycle.
564 */
565 if (asoc->init_last_sent_to == peer)
566 asoc->init_last_sent_to = NULL;
567
568 asoc->peer.transport_count--;
569
570 sctp_transport_free(peer);
571}
572
1da177e4
LT
573/* Add a transport address to an association. */
574struct sctp_transport *sctp_assoc_add_peer(struct sctp_association *asoc,
575 const union sctp_addr *addr,
dd0fc66f 576 const gfp_t gfp,
3f7a87d2 577 const int peer_state)
1da177e4
LT
578{
579 struct sctp_transport *peer;
580 struct sctp_sock *sp;
581 unsigned short port;
582
583 sp = sctp_sk(asoc->base.sk);
584
585 /* AF_INET and AF_INET6 share common port field. */
4bdf4b5f 586 port = ntohs(addr->v4.sin_port);
1da177e4 587
3f7a87d2 588 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_add_peer:association %p addr: ",
ad8fec17 589 " port: %d state:%d\n",
3f7a87d2
FF
590 asoc,
591 addr,
4bdf4b5f 592 port,
ad8fec17 593 peer_state);
3f7a87d2 594
1da177e4
LT
595 /* Set the port if it has not been set yet. */
596 if (0 == asoc->peer.port)
597 asoc->peer.port = port;
598
599 /* Check to see if this is a duplicate. */
600 peer = sctp_assoc_lookup_paddr(asoc, addr);
3f7a87d2 601 if (peer) {
ad8fec17
SS
602 if (peer->state == SCTP_UNKNOWN) {
603 if (peer_state == SCTP_ACTIVE)
604 peer->state = SCTP_ACTIVE;
605 if (peer_state == SCTP_UNCONFIRMED)
606 peer->state = SCTP_UNCONFIRMED;
607 }
1da177e4 608 return peer;
3f7a87d2 609 }
1da177e4
LT
610
611 peer = sctp_transport_new(addr, gfp);
612 if (!peer)
613 return NULL;
614
615 sctp_transport_set_owner(peer, asoc);
616
52ccb8e9
FF
617 /* Initialize the peer's heartbeat interval based on the
618 * association configured value.
619 */
620 peer->hbinterval = asoc->hbinterval;
621
622 /* Set the path max_retrans. */
623 peer->pathmaxrxt = asoc->pathmaxrxt;
624
625 /* Initialize the peer's SACK delay timeout based on the
626 * association configured value.
627 */
628 peer->sackdelay = asoc->sackdelay;
d364d927 629 peer->sackfreq = asoc->sackfreq;
52ccb8e9
FF
630
631 /* Enable/disable heartbeat, SACK delay, and path MTU discovery
632 * based on association setting.
633 */
634 peer->param_flags = asoc->param_flags;
635
1da177e4 636 /* Initialize the pmtu of the transport. */
52ccb8e9
FF
637 if (peer->param_flags & SPP_PMTUD_ENABLE)
638 sctp_transport_pmtu(peer);
639 else if (asoc->pathmtu)
640 peer->pathmtu = asoc->pathmtu;
641 else
642 peer->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
1da177e4
LT
643
644 /* If this is the first transport addr on this association,
645 * initialize the association PMTU to the peer's PMTU.
646 * If not and the current association PMTU is higher than the new
647 * peer's PMTU, reset the association PMTU to the new peer's PMTU.
648 */
52ccb8e9
FF
649 if (asoc->pathmtu)
650 asoc->pathmtu = min_t(int, peer->pathmtu, asoc->pathmtu);
1da177e4 651 else
52ccb8e9 652 asoc->pathmtu = peer->pathmtu;
1da177e4
LT
653
654 SCTP_DEBUG_PRINTK("sctp_assoc_add_peer:association %p PMTU set to "
52ccb8e9 655 "%d\n", asoc, asoc->pathmtu);
6d0ccbac 656 peer->pmtu_pending = 0;
1da177e4 657
52ccb8e9 658 asoc->frag_point = sctp_frag_point(sp, asoc->pathmtu);
1da177e4
LT
659
660 /* The asoc->peer.port might not be meaningful yet, but
661 * initialize the packet structure anyway.
662 */
663 sctp_packet_init(&peer->packet, peer, asoc->base.bind_addr.port,
664 asoc->peer.port);
665
666 /* 7.2.1 Slow-Start
667 *
668 * o The initial cwnd before DATA transmission or after a sufficiently
669 * long idle period MUST be set to
670 * min(4*MTU, max(2*MTU, 4380 bytes))
671 *
672 * o The initial value of ssthresh MAY be arbitrarily high
673 * (for example, implementations MAY use the size of the
674 * receiver advertised window).
675 */
52ccb8e9 676 peer->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
1da177e4
LT
677
678 /* At this point, we may not have the receiver's advertised window,
679 * so initialize ssthresh to the default value and it will be set
680 * later when we process the INIT.
681 */
682 peer->ssthresh = SCTP_DEFAULT_MAXWINDOW;
683
684 peer->partial_bytes_acked = 0;
685 peer->flight_size = 0;
686
1da177e4
LT
687 /* Set the transport's RTO.initial value */
688 peer->rto = asoc->rto_initial;
689
3f7a87d2
FF
690 /* Set the peer's active state. */
691 peer->state = peer_state;
692
1da177e4
LT
693 /* Attach the remote transport to our asoc. */
694 list_add_tail(&peer->transports, &asoc->peer.transport_addr_list);
3f7a87d2 695 asoc->peer.transport_count++;
1da177e4
LT
696
697 /* If we do not yet have a primary path, set one. */
698 if (!asoc->peer.primary_path) {
699 sctp_assoc_set_primary(asoc, peer);
700 asoc->peer.retran_path = peer;
701 }
702
3f7a87d2 703 if (asoc->peer.active_path == asoc->peer.retran_path) {
1da177e4 704 asoc->peer.retran_path = peer;
3f7a87d2 705 }
1da177e4
LT
706
707 return peer;
708}
709
710/* Delete a transport address from an association. */
711void sctp_assoc_del_peer(struct sctp_association *asoc,
712 const union sctp_addr *addr)
713{
714 struct list_head *pos;
715 struct list_head *temp;
1da177e4
LT
716 struct sctp_transport *transport;
717
718 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
719 transport = list_entry(pos, struct sctp_transport, transports);
720 if (sctp_cmp_addr_exact(addr, &transport->ipaddr)) {
3f7a87d2
FF
721 /* Do book keeping for removing the peer and free it. */
722 sctp_assoc_rm_peer(asoc, transport);
1da177e4
LT
723 break;
724 }
725 }
1da177e4
LT
726}
727
728/* Lookup a transport by address. */
729struct sctp_transport *sctp_assoc_lookup_paddr(
730 const struct sctp_association *asoc,
731 const union sctp_addr *address)
732{
733 struct sctp_transport *t;
1da177e4
LT
734
735 /* Cycle through all transports searching for a peer address. */
736
9dbc15f0
RD
737 list_for_each_entry(t, &asoc->peer.transport_addr_list,
738 transports) {
1da177e4
LT
739 if (sctp_cmp_addr_exact(address, &t->ipaddr))
740 return t;
741 }
742
743 return NULL;
744}
745
42e30bf3
VY
746/* Remove all transports except a give one */
747void sctp_assoc_del_nonprimary_peers(struct sctp_association *asoc,
748 struct sctp_transport *primary)
749{
750 struct sctp_transport *temp;
751 struct sctp_transport *t;
752
753 list_for_each_entry_safe(t, temp, &asoc->peer.transport_addr_list,
754 transports) {
755 /* if the current transport is not the primary one, delete it */
756 if (t != primary)
757 sctp_assoc_rm_peer(asoc, t);
758 }
759
760 return;
761}
762
1da177e4
LT
763/* Engage in transport control operations.
764 * Mark the transport up or down and send a notification to the user.
765 * Select and update the new active and retran paths.
766 */
767void sctp_assoc_control_transport(struct sctp_association *asoc,
768 struct sctp_transport *transport,
769 sctp_transport_cmd_t command,
770 sctp_sn_error_t error)
771{
772 struct sctp_transport *t = NULL;
773 struct sctp_transport *first;
774 struct sctp_transport *second;
775 struct sctp_ulpevent *event;
0906e20f 776 struct sockaddr_storage addr;
1da177e4
LT
777 int spc_state = 0;
778
779 /* Record the transition on the transport. */
780 switch (command) {
781 case SCTP_TRANSPORT_UP:
1ae4114d
VY
782 /* If we are moving from UNCONFIRMED state due
783 * to heartbeat success, report the SCTP_ADDR_CONFIRMED
784 * state to the user, otherwise report SCTP_ADDR_AVAILABLE.
785 */
786 if (SCTP_UNCONFIRMED == transport->state &&
787 SCTP_HEARTBEAT_SUCCESS == error)
788 spc_state = SCTP_ADDR_CONFIRMED;
789 else
790 spc_state = SCTP_ADDR_AVAILABLE;
3f7a87d2 791 transport->state = SCTP_ACTIVE;
1da177e4
LT
792 break;
793
794 case SCTP_TRANSPORT_DOWN:
cc75689a
VY
795 /* if the transort was never confirmed, do not transition it
796 * to inactive state.
797 */
798 if (transport->state != SCTP_UNCONFIRMED)
799 transport->state = SCTP_INACTIVE;
800
1da177e4
LT
801 spc_state = SCTP_ADDR_UNREACHABLE;
802 break;
803
804 default:
805 return;
3ff50b79 806 }
1da177e4
LT
807
808 /* Generate and send a SCTP_PEER_ADDR_CHANGE notification to the
809 * user.
810 */
0906e20f 811 memset(&addr, 0, sizeof(struct sockaddr_storage));
8cec6b80 812 memcpy(&addr, &transport->ipaddr, transport->af_specific->sockaddr_len);
0906e20f 813 event = sctp_ulpevent_make_peer_addr_change(asoc, &addr,
1da177e4
LT
814 0, spc_state, error, GFP_ATOMIC);
815 if (event)
816 sctp_ulpq_tail_event(&asoc->ulpq, event);
817
818 /* Select new active and retran paths. */
819
820 /* Look for the two most recently used active transports.
821 *
822 * This code produces the wrong ordering whenever jiffies
823 * rolls over, but we still get usable transports, so we don't
824 * worry about it.
825 */
826 first = NULL; second = NULL;
827
9dbc15f0
RD
828 list_for_each_entry(t, &asoc->peer.transport_addr_list,
829 transports) {
1da177e4 830
ad8fec17
SS
831 if ((t->state == SCTP_INACTIVE) ||
832 (t->state == SCTP_UNCONFIRMED))
1da177e4
LT
833 continue;
834 if (!first || t->last_time_heard > first->last_time_heard) {
835 second = first;
836 first = t;
837 }
838 if (!second || t->last_time_heard > second->last_time_heard)
839 second = t;
840 }
841
842 /* RFC 2960 6.4 Multi-Homed SCTP Endpoints
843 *
844 * By default, an endpoint should always transmit to the
845 * primary path, unless the SCTP user explicitly specifies the
846 * destination transport address (and possibly source
847 * transport address) to use.
848 *
849 * [If the primary is active but not most recent, bump the most
850 * recently used transport.]
851 */
ad8fec17
SS
852 if (((asoc->peer.primary_path->state == SCTP_ACTIVE) ||
853 (asoc->peer.primary_path->state == SCTP_UNKNOWN)) &&
1da177e4
LT
854 first != asoc->peer.primary_path) {
855 second = first;
856 first = asoc->peer.primary_path;
857 }
858
859 /* If we failed to find a usable transport, just camp on the
860 * primary, even if it is inactive.
861 */
862 if (!first) {
863 first = asoc->peer.primary_path;
864 second = asoc->peer.primary_path;
865 }
866
867 /* Set the active and retran transports. */
868 asoc->peer.active_path = first;
869 asoc->peer.retran_path = second;
870}
871
872/* Hold a reference to an association. */
873void sctp_association_hold(struct sctp_association *asoc)
874{
875 atomic_inc(&asoc->base.refcnt);
876}
877
878/* Release a reference to an association and cleanup
879 * if there are no more references.
880 */
881void sctp_association_put(struct sctp_association *asoc)
882{
883 if (atomic_dec_and_test(&asoc->base.refcnt))
884 sctp_association_destroy(asoc);
885}
886
887/* Allocate the next TSN, Transmission Sequence Number, for the given
888 * association.
889 */
890__u32 sctp_association_get_next_tsn(struct sctp_association *asoc)
891{
892 /* From Section 1.6 Serial Number Arithmetic:
893 * Transmission Sequence Numbers wrap around when they reach
894 * 2**32 - 1. That is, the next TSN a DATA chunk MUST use
895 * after transmitting TSN = 2*32 - 1 is TSN = 0.
896 */
897 __u32 retval = asoc->next_tsn;
898 asoc->next_tsn++;
899 asoc->unack_data++;
900
901 return retval;
902}
903
904/* Compare two addresses to see if they match. Wildcard addresses
905 * only match themselves.
906 */
907int sctp_cmp_addr_exact(const union sctp_addr *ss1,
908 const union sctp_addr *ss2)
909{
910 struct sctp_af *af;
911
912 af = sctp_get_af_specific(ss1->sa.sa_family);
913 if (unlikely(!af))
914 return 0;
915
916 return af->cmp_addr(ss1, ss2);
917}
918
919/* Return an ecne chunk to get prepended to a packet.
920 * Note: We are sly and return a shared, prealloced chunk. FIXME:
921 * No we don't, but we could/should.
922 */
923struct sctp_chunk *sctp_get_ecne_prepend(struct sctp_association *asoc)
924{
925 struct sctp_chunk *chunk;
926
927 /* Send ECNE if needed.
928 * Not being able to allocate a chunk here is not deadly.
929 */
930 if (asoc->need_ecne)
931 chunk = sctp_make_ecne(asoc, asoc->last_ecne_tsn);
932 else
933 chunk = NULL;
934
935 return chunk;
936}
937
938/*
939 * Find which transport this TSN was sent on.
940 */
941struct sctp_transport *sctp_assoc_lookup_tsn(struct sctp_association *asoc,
942 __u32 tsn)
943{
944 struct sctp_transport *active;
945 struct sctp_transport *match;
1da177e4
LT
946 struct sctp_transport *transport;
947 struct sctp_chunk *chunk;
dbc16db1 948 __be32 key = htonl(tsn);
1da177e4
LT
949
950 match = NULL;
951
952 /*
953 * FIXME: In general, find a more efficient data structure for
954 * searching.
955 */
956
957 /*
958 * The general strategy is to search each transport's transmitted
959 * list. Return which transport this TSN lives on.
960 *
961 * Let's be hopeful and check the active_path first.
962 * Another optimization would be to know if there is only one
963 * outbound path and not have to look for the TSN at all.
964 *
965 */
966
967 active = asoc->peer.active_path;
968
9dbc15f0
RD
969 list_for_each_entry(chunk, &active->transmitted,
970 transmitted_list) {
1da177e4
LT
971
972 if (key == chunk->subh.data_hdr->tsn) {
973 match = active;
974 goto out;
975 }
976 }
977
978 /* If not found, go search all the other transports. */
9dbc15f0
RD
979 list_for_each_entry(transport, &asoc->peer.transport_addr_list,
980 transports) {
1da177e4
LT
981
982 if (transport == active)
983 break;
9dbc15f0
RD
984 list_for_each_entry(chunk, &transport->transmitted,
985 transmitted_list) {
1da177e4
LT
986 if (key == chunk->subh.data_hdr->tsn) {
987 match = transport;
988 goto out;
989 }
990 }
991 }
992out:
993 return match;
994}
995
996/* Is this the association we are looking for? */
997struct sctp_transport *sctp_assoc_is_match(struct sctp_association *asoc,
998 const union sctp_addr *laddr,
999 const union sctp_addr *paddr)
1000{
1001 struct sctp_transport *transport;
1002
e2fccedb
AV
1003 if ((htons(asoc->base.bind_addr.port) == laddr->v4.sin_port) &&
1004 (htons(asoc->peer.port) == paddr->v4.sin_port)) {
1da177e4
LT
1005 transport = sctp_assoc_lookup_paddr(asoc, paddr);
1006 if (!transport)
1007 goto out;
1008
1009 if (sctp_bind_addr_match(&asoc->base.bind_addr, laddr,
1010 sctp_sk(asoc->base.sk)))
1011 goto out;
1012 }
1013 transport = NULL;
1014
1015out:
1da177e4
LT
1016 return transport;
1017}
1018
1019/* Do delayed input processing. This is scheduled by sctp_rcv(). */
c4028958 1020static void sctp_assoc_bh_rcv(struct work_struct *work)
1da177e4 1021{
c4028958
DH
1022 struct sctp_association *asoc =
1023 container_of(work, struct sctp_association,
1024 base.inqueue.immediate);
1da177e4
LT
1025 struct sctp_endpoint *ep;
1026 struct sctp_chunk *chunk;
1027 struct sock *sk;
1028 struct sctp_inq *inqueue;
1029 int state;
1030 sctp_subtype_t subtype;
1031 int error = 0;
1032
1033 /* The association should be held so we should be safe. */
1034 ep = asoc->ep;
1035 sk = asoc->base.sk;
1036
1037 inqueue = &asoc->base.inqueue;
1038 sctp_association_hold(asoc);
1039 while (NULL != (chunk = sctp_inq_pop(inqueue))) {
1040 state = asoc->state;
1041 subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
1042
bbd0d598
VY
1043 /* SCTP-AUTH, Section 6.3:
1044 * The receiver has a list of chunk types which it expects
1045 * to be received only after an AUTH-chunk. This list has
1046 * been sent to the peer during the association setup. It
1047 * MUST silently discard these chunks if they are not placed
1048 * after an AUTH chunk in the packet.
1049 */
1050 if (sctp_auth_recv_cid(subtype.chunk, asoc) && !chunk->auth)
1051 continue;
1052
1da177e4
LT
1053 /* Remember where the last DATA chunk came from so we
1054 * know where to send the SACK.
1055 */
1056 if (sctp_chunk_is_data(chunk))
1057 asoc->peer.last_data_from = chunk->transport;
1058 else
1059 SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
1060
1061 if (chunk->transport)
1062 chunk->transport->last_time_heard = jiffies;
1063
1064 /* Run through the state machine. */
1065 error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype,
1066 state, ep, asoc, chunk, GFP_ATOMIC);
1067
1068 /* Check to see if the association is freed in response to
1069 * the incoming chunk. If so, get out of the while loop.
1070 */
1071 if (asoc->base.dead)
1072 break;
1073
1074 /* If there is an error on chunk, discard this packet. */
1075 if (error && chunk)
1076 chunk->pdiscard = 1;
1077 }
1078 sctp_association_put(asoc);
1079}
1080
1081/* This routine moves an association from its old sk to a new sk. */
1082void sctp_assoc_migrate(struct sctp_association *assoc, struct sock *newsk)
1083{
1084 struct sctp_sock *newsp = sctp_sk(newsk);
1085 struct sock *oldsk = assoc->base.sk;
1086
1087 /* Delete the association from the old endpoint's list of
1088 * associations.
1089 */
1090 list_del_init(&assoc->asocs);
1091
1092 /* Decrement the backlog value for a TCP-style socket. */
1093 if (sctp_style(oldsk, TCP))
1094 oldsk->sk_ack_backlog--;
1095
1096 /* Release references to the old endpoint and the sock. */
1097 sctp_endpoint_put(assoc->ep);
1098 sock_put(assoc->base.sk);
1099
1100 /* Get a reference to the new endpoint. */
1101 assoc->ep = newsp->ep;
1102 sctp_endpoint_hold(assoc->ep);
1103
1104 /* Get a reference to the new sock. */
1105 assoc->base.sk = newsk;
1106 sock_hold(assoc->base.sk);
1107
1108 /* Add the association to the new endpoint's list of associations. */
1109 sctp_endpoint_add_asoc(newsp->ep, assoc);
1110}
1111
1112/* Update an association (possibly from unexpected COOKIE-ECHO processing). */
1113void sctp_assoc_update(struct sctp_association *asoc,
1114 struct sctp_association *new)
1115{
1116 struct sctp_transport *trans;
1117 struct list_head *pos, *temp;
1118
1119 /* Copy in new parameters of peer. */
1120 asoc->c = new->c;
1121 asoc->peer.rwnd = new->peer.rwnd;
1122 asoc->peer.sack_needed = new->peer.sack_needed;
1123 asoc->peer.i = new->peer.i;
1124 sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE,
1125 asoc->peer.i.initial_tsn);
1126
1127 /* Remove any peer addresses not present in the new association. */
1128 list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) {
1129 trans = list_entry(pos, struct sctp_transport, transports);
1130 if (!sctp_assoc_lookup_paddr(new, &trans->ipaddr))
1131 sctp_assoc_del_peer(asoc, &trans->ipaddr);
749bf921
VY
1132
1133 if (asoc->state >= SCTP_STATE_ESTABLISHED)
1134 sctp_transport_reset(trans);
1da177e4
LT
1135 }
1136
1137 /* If the case is A (association restart), use
1138 * initial_tsn as next_tsn. If the case is B, use
1139 * current next_tsn in case data sent to peer
1140 * has been discarded and needs retransmission.
1141 */
1142 if (asoc->state >= SCTP_STATE_ESTABLISHED) {
1143 asoc->next_tsn = new->next_tsn;
1144 asoc->ctsn_ack_point = new->ctsn_ack_point;
1145 asoc->adv_peer_ack_point = new->adv_peer_ack_point;
1146
1147 /* Reinitialize SSN for both local streams
1148 * and peer's streams.
1149 */
1150 sctp_ssnmap_clear(asoc->ssnmap);
1151
0b58a811
VY
1152 /* Flush the ULP reassembly and ordered queue.
1153 * Any data there will now be stale and will
1154 * cause problems.
1155 */
1156 sctp_ulpq_flush(&asoc->ulpq);
1157
749bf921
VY
1158 /* reset the overall association error count so
1159 * that the restarted association doesn't get torn
1160 * down on the next retransmission timer.
1161 */
1162 asoc->overall_error_count = 0;
1163
1da177e4
LT
1164 } else {
1165 /* Add any peer addresses from the new association. */
9dbc15f0
RD
1166 list_for_each_entry(trans, &new->peer.transport_addr_list,
1167 transports) {
1da177e4
LT
1168 if (!sctp_assoc_lookup_paddr(asoc, &trans->ipaddr))
1169 sctp_assoc_add_peer(asoc, &trans->ipaddr,
ad8fec17 1170 GFP_ATOMIC, trans->state);
1da177e4
LT
1171 }
1172
1173 asoc->ctsn_ack_point = asoc->next_tsn - 1;
1174 asoc->adv_peer_ack_point = asoc->ctsn_ack_point;
1175 if (!asoc->ssnmap) {
1176 /* Move the ssnmap. */
1177 asoc->ssnmap = new->ssnmap;
1178 new->ssnmap = NULL;
1179 }
07d93967
VY
1180
1181 if (!asoc->assoc_id) {
1182 /* get a new association id since we don't have one
1183 * yet.
1184 */
1185 sctp_assoc_set_id(asoc, GFP_ATOMIC);
1186 }
1da177e4 1187 }
a29a5bd4 1188
730fc3d0
VY
1189 /* SCTP-AUTH: Save the peer parameters from the new assocaitions
1190 * and also move the association shared keys over
1191 */
1192 kfree(asoc->peer.peer_random);
1193 asoc->peer.peer_random = new->peer.peer_random;
1194 new->peer.peer_random = NULL;
1195
1196 kfree(asoc->peer.peer_chunks);
1197 asoc->peer.peer_chunks = new->peer.peer_chunks;
1198 new->peer.peer_chunks = NULL;
1199
1200 kfree(asoc->peer.peer_hmacs);
1201 asoc->peer.peer_hmacs = new->peer.peer_hmacs;
1202 new->peer.peer_hmacs = NULL;
1203
1204 sctp_auth_key_put(asoc->asoc_shared_key);
1205 sctp_auth_asoc_init_active_key(asoc, GFP_ATOMIC);
1da177e4
LT
1206}
1207
1208/* Update the retran path for sending a retransmitted packet.
1209 * Round-robin through the active transports, else round-robin
1210 * through the inactive transports as this is the next best thing
1211 * we can try.
1212 */
1213void sctp_assoc_update_retran_path(struct sctp_association *asoc)
1214{
1215 struct sctp_transport *t, *next;
1216 struct list_head *head = &asoc->peer.transport_addr_list;
1217 struct list_head *pos;
1218
4141ddc0
GJ
1219 if (asoc->peer.transport_count == 1)
1220 return;
1221
1da177e4
LT
1222 /* Find the next transport in a round-robin fashion. */
1223 t = asoc->peer.retran_path;
1224 pos = &t->transports;
1225 next = NULL;
1226
1227 while (1) {
1228 /* Skip the head. */
1229 if (pos->next == head)
1230 pos = head->next;
1231 else
1232 pos = pos->next;
1233
1234 t = list_entry(pos, struct sctp_transport, transports);
1235
4141ddc0
GJ
1236 /* We have exhausted the list, but didn't find any
1237 * other active transports. If so, use the next
1238 * transport.
1239 */
1240 if (t == asoc->peer.retran_path) {
1241 t = next;
1242 break;
1243 }
1244
1da177e4
LT
1245 /* Try to find an active transport. */
1246
ad8fec17
SS
1247 if ((t->state == SCTP_ACTIVE) ||
1248 (t->state == SCTP_UNKNOWN)) {
1da177e4
LT
1249 break;
1250 } else {
1251 /* Keep track of the next transport in case
1252 * we don't find any active transport.
1253 */
1254 if (!next)
1255 next = t;
1256 }
1da177e4
LT
1257 }
1258
1259 asoc->peer.retran_path = t;
3f7a87d2
FF
1260
1261 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1262 " %p addr: ",
1263 " port: %d\n",
1264 asoc,
1265 (&t->ipaddr),
b3f5b3b6 1266 ntohs(t->ipaddr.v4.sin_port));
3f7a87d2
FF
1267}
1268
1269/* Choose the transport for sending a INIT packet. */
1270struct sctp_transport *sctp_assoc_choose_init_transport(
1271 struct sctp_association *asoc)
1272{
1273 struct sctp_transport *t;
1274
1275 /* Use the retran path. If the last INIT was sent over the
1276 * retran path, update the retran path and use it.
1277 */
1278 if (!asoc->init_last_sent_to) {
1279 t = asoc->peer.active_path;
1280 } else {
1281 if (asoc->init_last_sent_to == asoc->peer.retran_path)
1282 sctp_assoc_update_retran_path(asoc);
1283 t = asoc->peer.retran_path;
1284 }
1285
1286 SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association"
1287 " %p addr: ",
1288 " port: %d\n",
1289 asoc,
1290 (&t->ipaddr),
b3f5b3b6 1291 ntohs(t->ipaddr.v4.sin_port));
3f7a87d2
FF
1292
1293 return t;
1da177e4
LT
1294}
1295
1296/* Choose the transport for sending a SHUTDOWN packet. */
1297struct sctp_transport *sctp_assoc_choose_shutdown_transport(
1298 struct sctp_association *asoc)
1299{
1300 /* If this is the first time SHUTDOWN is sent, use the active path,
1301 * else use the retran path. If the last SHUTDOWN was sent over the
1302 * retran path, update the retran path and use it.
1303 */
1304 if (!asoc->shutdown_last_sent_to)
1305 return asoc->peer.active_path;
1306 else {
1307 if (asoc->shutdown_last_sent_to == asoc->peer.retran_path)
1308 sctp_assoc_update_retran_path(asoc);
1309 return asoc->peer.retran_path;
1310 }
1311
1312}
1313
1314/* Update the association's pmtu and frag_point by going through all the
1315 * transports. This routine is called when a transport's PMTU has changed.
1316 */
1317void sctp_assoc_sync_pmtu(struct sctp_association *asoc)
1318{
1319 struct sctp_transport *t;
1da177e4
LT
1320 __u32 pmtu = 0;
1321
1322 if (!asoc)
1323 return;
1324
1325 /* Get the lowest pmtu of all the transports. */
9dbc15f0
RD
1326 list_for_each_entry(t, &asoc->peer.transport_addr_list,
1327 transports) {
8a479491
VY
1328 if (t->pmtu_pending && t->dst) {
1329 sctp_transport_update_pmtu(t, dst_mtu(t->dst));
1330 t->pmtu_pending = 0;
1331 }
52ccb8e9
FF
1332 if (!pmtu || (t->pathmtu < pmtu))
1333 pmtu = t->pathmtu;
1da177e4
LT
1334 }
1335
1336 if (pmtu) {
1337 struct sctp_sock *sp = sctp_sk(asoc->base.sk);
52ccb8e9 1338 asoc->pathmtu = pmtu;
1da177e4
LT
1339 asoc->frag_point = sctp_frag_point(sp, pmtu);
1340 }
1341
1342 SCTP_DEBUG_PRINTK("%s: asoc:%p, pmtu:%d, frag_point:%d\n",
0dc47877 1343 __func__, asoc, asoc->pathmtu, asoc->frag_point);
1da177e4
LT
1344}
1345
1346/* Should we send a SACK to update our peer? */
1347static inline int sctp_peer_needs_update(struct sctp_association *asoc)
1348{
1349 switch (asoc->state) {
1350 case SCTP_STATE_ESTABLISHED:
1351 case SCTP_STATE_SHUTDOWN_PENDING:
1352 case SCTP_STATE_SHUTDOWN_RECEIVED:
1353 case SCTP_STATE_SHUTDOWN_SENT:
1354 if ((asoc->rwnd > asoc->a_rwnd) &&
1355 ((asoc->rwnd - asoc->a_rwnd) >=
52ccb8e9 1356 min_t(__u32, (asoc->base.sk->sk_rcvbuf >> 1), asoc->pathmtu)))
1da177e4
LT
1357 return 1;
1358 break;
1359 default:
1360 break;
1361 }
1362 return 0;
1363}
1364
1365/* Increase asoc's rwnd by len and send any window update SACK if needed. */
1366void sctp_assoc_rwnd_increase(struct sctp_association *asoc, unsigned len)
1367{
1368 struct sctp_chunk *sack;
1369 struct timer_list *timer;
1370
1371 if (asoc->rwnd_over) {
1372 if (asoc->rwnd_over >= len) {
1373 asoc->rwnd_over -= len;
1374 } else {
1375 asoc->rwnd += (len - asoc->rwnd_over);
1376 asoc->rwnd_over = 0;
1377 }
1378 } else {
1379 asoc->rwnd += len;
1380 }
1381
1382 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd increased by %d to (%u, %u) "
0dc47877 1383 "- %u\n", __func__, asoc, len, asoc->rwnd,
1da177e4
LT
1384 asoc->rwnd_over, asoc->a_rwnd);
1385
1386 /* Send a window update SACK if the rwnd has increased by at least the
1387 * minimum of the association's PMTU and half of the receive buffer.
1388 * The algorithm used is similar to the one described in
1389 * Section 4.2.3.3 of RFC 1122.
1390 */
1391 if (sctp_peer_needs_update(asoc)) {
1392 asoc->a_rwnd = asoc->rwnd;
1393 SCTP_DEBUG_PRINTK("%s: Sending window update SACK- asoc: %p "
0dc47877 1394 "rwnd: %u a_rwnd: %u\n", __func__,
1da177e4
LT
1395 asoc, asoc->rwnd, asoc->a_rwnd);
1396 sack = sctp_make_sack(asoc);
1397 if (!sack)
1398 return;
1399
1400 asoc->peer.sack_needed = 0;
1401
1402 sctp_outq_tail(&asoc->outqueue, sack);
1403
1404 /* Stop the SACK timer. */
1405 timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK];
1406 if (timer_pending(timer) && del_timer(timer))
1407 sctp_association_put(asoc);
1408 }
1409}
1410
1411/* Decrease asoc's rwnd by len. */
1412void sctp_assoc_rwnd_decrease(struct sctp_association *asoc, unsigned len)
1413{
1414 SCTP_ASSERT(asoc->rwnd, "rwnd zero", return);
1415 SCTP_ASSERT(!asoc->rwnd_over, "rwnd_over not zero", return);
1416 if (asoc->rwnd >= len) {
1417 asoc->rwnd -= len;
1418 } else {
1419 asoc->rwnd_over = len - asoc->rwnd;
1420 asoc->rwnd = 0;
1421 }
1422 SCTP_DEBUG_PRINTK("%s: asoc %p rwnd decreased by %d to (%u, %u)\n",
0dc47877 1423 __func__, asoc, len, asoc->rwnd,
1da177e4
LT
1424 asoc->rwnd_over);
1425}
1426
1427/* Build the bind address list for the association based on info from the
1428 * local endpoint and the remote peer.
1429 */
3182cd84 1430int sctp_assoc_set_bind_addr_from_ep(struct sctp_association *asoc,
dd0fc66f 1431 gfp_t gfp)
1da177e4
LT
1432{
1433 sctp_scope_t scope;
1434 int flags;
1435
1436 /* Use scoping rules to determine the subset of addresses from
1437 * the endpoint.
1438 */
1439 scope = sctp_scope(&asoc->peer.active_path->ipaddr);
1440 flags = (PF_INET6 == asoc->base.sk->sk_family) ? SCTP_ADDR6_ALLOWED : 0;
1441 if (asoc->peer.ipv4_address)
1442 flags |= SCTP_ADDR4_PEERSUPP;
1443 if (asoc->peer.ipv6_address)
1444 flags |= SCTP_ADDR6_PEERSUPP;
1445
1446 return sctp_bind_addr_copy(&asoc->base.bind_addr,
1447 &asoc->ep->base.bind_addr,
1448 scope, gfp, flags);
1449}
1450
1451/* Build the association's bind address list from the cookie. */
1452int sctp_assoc_set_bind_addr_from_cookie(struct sctp_association *asoc,
3182cd84 1453 struct sctp_cookie *cookie,
dd0fc66f 1454 gfp_t gfp)
1da177e4
LT
1455{
1456 int var_size2 = ntohs(cookie->peer_init->chunk_hdr.length);
1457 int var_size3 = cookie->raw_addr_list_len;
1458 __u8 *raw = (__u8 *)cookie->peer_init + var_size2;
1459
1460 return sctp_raw_to_bind_addrs(&asoc->base.bind_addr, raw, var_size3,
1461 asoc->ep->base.bind_addr.port, gfp);
1462}
1463
d808ad9a
YH
1464/* Lookup laddr in the bind address list of an association. */
1465int sctp_assoc_lookup_laddr(struct sctp_association *asoc,
1da177e4
LT
1466 const union sctp_addr *laddr)
1467{
559cf710 1468 int found = 0;
1da177e4 1469
1da177e4
LT
1470 if ((asoc->base.bind_addr.port == ntohs(laddr->v4.sin_port)) &&
1471 sctp_bind_addr_match(&asoc->base.bind_addr, laddr,
559cf710 1472 sctp_sk(asoc->base.sk)))
1da177e4 1473 found = 1;
1da177e4 1474
1da177e4
LT
1475 return found;
1476}
07d93967
VY
1477
1478/* Set an association id for a given association */
1479int sctp_assoc_set_id(struct sctp_association *asoc, gfp_t gfp)
1480{
1481 int assoc_id;
1482 int error = 0;
1483retry:
1484 if (unlikely(!idr_pre_get(&sctp_assocs_id, gfp)))
1485 return -ENOMEM;
1486
1487 spin_lock_bh(&sctp_assocs_id_lock);
1488 error = idr_get_new_above(&sctp_assocs_id, (void *)asoc,
1489 1, &assoc_id);
1490 spin_unlock_bh(&sctp_assocs_id_lock);
1491 if (error == -EAGAIN)
1492 goto retry;
1493 else if (error)
1494 return error;
1495
1496 asoc->assoc_id = (sctp_assoc_t) assoc_id;
1497 return error;
1498}
a08de64d
VY
1499
1500/* Free asconf_ack cache */
1501static void sctp_assoc_free_asconf_acks(struct sctp_association *asoc)
1502{
1503 struct sctp_chunk *ack;
1504 struct sctp_chunk *tmp;
1505
1506 list_for_each_entry_safe(ack, tmp, &asoc->asconf_ack_list,
1507 transmitted_list) {
1508 list_del_init(&ack->transmitted_list);
1509 sctp_chunk_free(ack);
1510 }
1511}
1512
1513/* Clean up the ASCONF_ACK queue */
1514void sctp_assoc_clean_asconf_ack_cache(const struct sctp_association *asoc)
1515{
1516 struct sctp_chunk *ack;
1517 struct sctp_chunk *tmp;
1518
1519 /* We can remove all the entries from the queue upto
1520 * the "Peer-Sequence-Number".
1521 */
1522 list_for_each_entry_safe(ack, tmp, &asoc->asconf_ack_list,
1523 transmitted_list) {
1524 if (ack->subh.addip_hdr->serial ==
1525 htonl(asoc->peer.addip_serial))
1526 break;
1527
1528 list_del_init(&ack->transmitted_list);
1529 sctp_chunk_free(ack);
1530 }
1531}
1532
1533/* Find the ASCONF_ACK whose serial number matches ASCONF */
1534struct sctp_chunk *sctp_assoc_lookup_asconf_ack(
1535 const struct sctp_association *asoc,
1536 __be32 serial)
1537{
a8699814 1538 struct sctp_chunk *ack;
a08de64d
VY
1539
1540 /* Walk through the list of cached ASCONF-ACKs and find the
1541 * ack chunk whose serial number matches that of the request.
1542 */
1543 list_for_each_entry(ack, &asoc->asconf_ack_list, transmitted_list) {
1544 if (ack->subh.addip_hdr->serial == serial) {
1545 sctp_chunk_hold(ack);
a8699814 1546 return ack;
a08de64d
VY
1547 }
1548 }
1549
a8699814 1550 return NULL;
a08de64d 1551}