Commit | Line | Data |
---|---|---|
1da177e4 LT |
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 | |
7 | * | |
8 | * This file is part of the SCTP kernel reference Implementation | |
9 | * | |
10 | * This module provides the abstraction for an SCTP association. | |
11 | * | |
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) | |
16 | * any later version. | |
17 | * | |
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. | |
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> | |
55 | #include <linux/sched.h> | |
56 | ||
57 | #include <linux/slab.h> | |
58 | #include <linux/in.h> | |
59 | #include <net/ipv6.h> | |
60 | #include <net/sctp/sctp.h> | |
61 | #include <net/sctp/sm.h> | |
62 | ||
63 | /* Forward declarations for internal functions. */ | |
64 | static void sctp_assoc_bh_rcv(struct sctp_association *asoc); | |
65 | ||
66 | ||
67 | /* 1st Level Abstractions. */ | |
68 | ||
69 | /* Initialize a new association from provided memory. */ | |
70 | static 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; | |
78 | ||
79 | /* Retrieve the SCTP per socket area. */ | |
80 | sp = sctp_sk((struct sock *)sk); | |
81 | ||
82 | /* Init all variables to a known value. */ | |
83 | memset(asoc, 0, sizeof(struct sctp_association)); | |
84 | ||
85 | /* Discarding const is appropriate here. */ | |
86 | asoc->ep = (struct sctp_endpoint *)ep; | |
87 | sctp_endpoint_hold(asoc->ep); | |
88 | ||
89 | /* Hold the sock. */ | |
90 | asoc->base.sk = (struct sock *)sk; | |
91 | sock_hold(asoc->base.sk); | |
92 | ||
93 | /* Initialize the common base substructure. */ | |
94 | asoc->base.type = SCTP_EP_TYPE_ASSOCIATION; | |
95 | ||
96 | /* Initialize the object handling fields. */ | |
97 | atomic_set(&asoc->base.refcnt, 1); | |
98 | asoc->base.dead = 0; | |
99 | asoc->base.malloced = 0; | |
100 | ||
101 | /* Initialize the bind addr area. */ | |
102 | sctp_bind_addr_init(&asoc->base.bind_addr, ep->base.bind_addr.port); | |
103 | rwlock_init(&asoc->base.addr_lock); | |
104 | ||
105 | asoc->state = SCTP_STATE_CLOSED; | |
106 | ||
107 | /* Set these values from the socket values, a conversion between | |
108 | * millsecons to seconds/microseconds must also be done. | |
109 | */ | |
110 | asoc->cookie_life.tv_sec = sp->assocparams.sasoc_cookie_life / 1000; | |
111 | asoc->cookie_life.tv_usec = (sp->assocparams.sasoc_cookie_life % 1000) | |
112 | * 1000; | |
1da177e4 LT |
113 | asoc->frag_point = 0; |
114 | ||
115 | /* Set the association max_retrans and RTO values from the | |
116 | * socket values. | |
117 | */ | |
118 | asoc->max_retrans = sp->assocparams.sasoc_asocmaxrxt; | |
119 | asoc->rto_initial = msecs_to_jiffies(sp->rtoinfo.srto_initial); | |
120 | asoc->rto_max = msecs_to_jiffies(sp->rtoinfo.srto_max); | |
121 | asoc->rto_min = msecs_to_jiffies(sp->rtoinfo.srto_min); | |
122 | ||
123 | asoc->overall_error_count = 0; | |
124 | ||
52ccb8e9 FF |
125 | /* Initialize the association's heartbeat interval based on the |
126 | * sock configured value. | |
127 | */ | |
128 | asoc->hbinterval = msecs_to_jiffies(sp->hbinterval); | |
129 | ||
130 | /* Initialize path max retrans value. */ | |
131 | asoc->pathmaxrxt = sp->pathmaxrxt; | |
132 | ||
133 | /* Initialize default path MTU. */ | |
134 | asoc->pathmtu = sp->pathmtu; | |
135 | ||
136 | /* Set association default SACK delay */ | |
137 | asoc->sackdelay = msecs_to_jiffies(sp->sackdelay); | |
138 | ||
139 | /* Set the association default flags controlling | |
140 | * Heartbeat, SACK delay, and Path MTU Discovery. | |
141 | */ | |
142 | asoc->param_flags = sp->param_flags; | |
143 | ||
1da177e4 LT |
144 | /* Initialize the maximum mumber of new data packets that can be sent |
145 | * in a burst. | |
146 | */ | |
147 | asoc->max_burst = sctp_max_burst; | |
148 | ||
1e7d3d90 VY |
149 | /* initialize association timers */ |
150 | asoc->timeouts[SCTP_EVENT_TIMEOUT_NONE] = 0; | |
151 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_COOKIE] = asoc->rto_initial; | |
152 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T1_INIT] = asoc->rto_initial; | |
153 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T2_SHUTDOWN] = asoc->rto_initial; | |
154 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T3_RTX] = 0; | |
155 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T4_RTO] = 0; | |
156 | ||
157 | /* sctpimpguide Section 2.12.2 | |
158 | * If the 'T5-shutdown-guard' timer is used, it SHOULD be set to the | |
159 | * recommended value of 5 times 'RTO.Max'. | |
160 | */ | |
161 | asoc->timeouts[SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD] | |
162 | = 5 * asoc->rto_max; | |
163 | ||
164 | asoc->timeouts[SCTP_EVENT_TIMEOUT_HEARTBEAT] = 0; | |
52ccb8e9 | 165 | asoc->timeouts[SCTP_EVENT_TIMEOUT_SACK] = asoc->sackdelay; |
1e7d3d90 VY |
166 | asoc->timeouts[SCTP_EVENT_TIMEOUT_AUTOCLOSE] = |
167 | sp->autoclose * HZ; | |
168 | ||
169 | /* Initilizes the timers */ | |
1da177e4 | 170 | for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i) { |
1da177e4 LT |
171 | init_timer(&asoc->timers[i]); |
172 | asoc->timers[i].function = sctp_timer_events[i]; | |
173 | asoc->timers[i].data = (unsigned long) asoc; | |
174 | } | |
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); |
1da177e4 LT |
247 | |
248 | /* Make an empty list of remote transport addresses. */ | |
249 | INIT_LIST_HEAD(&asoc->peer.transport_addr_list); | |
3f7a87d2 | 250 | asoc->peer.transport_count = 0; |
1da177e4 LT |
251 | |
252 | /* RFC 2960 5.1 Normal Establishment of an Association | |
253 | * | |
254 | * After the reception of the first data chunk in an | |
255 | * association the endpoint must immediately respond with a | |
256 | * sack to acknowledge the data chunk. Subsequent | |
257 | * acknowledgements should be done as described in Section | |
258 | * 6.2. | |
259 | * | |
260 | * [We implement this by telling a new association that it | |
261 | * already received one packet.] | |
262 | */ | |
263 | asoc->peer.sack_needed = 1; | |
264 | ||
265 | /* Assume that the peer recongizes ASCONF until reported otherwise | |
266 | * via an ERROR chunk. | |
267 | */ | |
268 | asoc->peer.asconf_capable = 1; | |
269 | ||
270 | /* Create an input queue. */ | |
271 | sctp_inq_init(&asoc->base.inqueue); | |
272 | sctp_inq_set_th_handler(&asoc->base.inqueue, | |
273 | (void (*)(void *))sctp_assoc_bh_rcv, | |
274 | asoc); | |
275 | ||
276 | /* Create an output queue. */ | |
277 | sctp_outq_init(asoc, &asoc->outqueue); | |
278 | ||
279 | if (!sctp_ulpq_init(&asoc->ulpq, asoc)) | |
280 | goto fail_init; | |
281 | ||
282 | /* Set up the tsn tracking. */ | |
283 | sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE, 0); | |
284 | ||
285 | asoc->need_ecne = 0; | |
286 | ||
287 | asoc->assoc_id = 0; | |
288 | ||
289 | /* Assume that peer would support both address types unless we are | |
290 | * told otherwise. | |
291 | */ | |
292 | asoc->peer.ipv4_address = 1; | |
293 | asoc->peer.ipv6_address = 1; | |
294 | INIT_LIST_HEAD(&asoc->asocs); | |
295 | ||
296 | asoc->autoclose = sp->autoclose; | |
297 | ||
298 | asoc->default_stream = sp->default_stream; | |
299 | asoc->default_ppid = sp->default_ppid; | |
300 | asoc->default_flags = sp->default_flags; | |
301 | asoc->default_context = sp->default_context; | |
302 | asoc->default_timetolive = sp->default_timetolive; | |
303 | ||
304 | return asoc; | |
305 | ||
306 | fail_init: | |
307 | sctp_endpoint_put(asoc->ep); | |
308 | sock_put(asoc->base.sk); | |
309 | return NULL; | |
310 | } | |
311 | ||
312 | /* Allocate and initialize a new association */ | |
313 | struct sctp_association *sctp_association_new(const struct sctp_endpoint *ep, | |
314 | const struct sock *sk, | |
3182cd84 | 315 | sctp_scope_t scope, |
dd0fc66f | 316 | gfp_t gfp) |
1da177e4 LT |
317 | { |
318 | struct sctp_association *asoc; | |
319 | ||
320 | asoc = t_new(struct sctp_association, gfp); | |
321 | if (!asoc) | |
322 | goto fail; | |
323 | ||
324 | if (!sctp_association_init(asoc, ep, sk, scope, gfp)) | |
325 | goto fail_init; | |
326 | ||
327 | asoc->base.malloced = 1; | |
328 | SCTP_DBG_OBJCNT_INC(assoc); | |
3f7a87d2 | 329 | SCTP_DEBUG_PRINTK("Created asoc %p\n", asoc); |
1da177e4 LT |
330 | |
331 | return asoc; | |
332 | ||
333 | fail_init: | |
334 | kfree(asoc); | |
335 | fail: | |
336 | return NULL; | |
337 | } | |
338 | ||
339 | /* Free this association if possible. There may still be users, so | |
340 | * the actual deallocation may be delayed. | |
341 | */ | |
342 | void sctp_association_free(struct sctp_association *asoc) | |
343 | { | |
344 | struct sock *sk = asoc->base.sk; | |
345 | struct sctp_transport *transport; | |
346 | struct list_head *pos, *temp; | |
347 | int i; | |
348 | ||
de76e695 VY |
349 | /* Only real associations count against the endpoint, so |
350 | * don't bother for if this is a temporary association. | |
351 | */ | |
352 | if (!asoc->temp) { | |
353 | list_del(&asoc->asocs); | |
354 | ||
355 | /* Decrement the backlog value for a TCP-style listening | |
356 | * socket. | |
357 | */ | |
358 | if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING)) | |
359 | sk->sk_ack_backlog--; | |
360 | } | |
1da177e4 LT |
361 | |
362 | /* Mark as dead, so other users can know this structure is | |
363 | * going away. | |
364 | */ | |
365 | asoc->base.dead = 1; | |
366 | ||
367 | /* Dispose of any data lying around in the outqueue. */ | |
368 | sctp_outq_free(&asoc->outqueue); | |
369 | ||
370 | /* Dispose of any pending messages for the upper layer. */ | |
371 | sctp_ulpq_free(&asoc->ulpq); | |
372 | ||
373 | /* Dispose of any pending chunks on the inqueue. */ | |
374 | sctp_inq_free(&asoc->base.inqueue); | |
375 | ||
376 | /* Free ssnmap storage. */ | |
377 | sctp_ssnmap_free(asoc->ssnmap); | |
378 | ||
379 | /* Clean up the bound address list. */ | |
380 | sctp_bind_addr_free(&asoc->base.bind_addr); | |
381 | ||
382 | /* Do we need to go through all of our timers and | |
383 | * delete them? To be safe we will try to delete all, but we | |
384 | * should be able to go through and make a guess based | |
385 | * on our state. | |
386 | */ | |
387 | for (i = SCTP_EVENT_TIMEOUT_NONE; i < SCTP_NUM_TIMEOUT_TYPES; ++i) { | |
388 | if (timer_pending(&asoc->timers[i]) && | |
389 | del_timer(&asoc->timers[i])) | |
390 | sctp_association_put(asoc); | |
391 | } | |
392 | ||
393 | /* Free peer's cached cookie. */ | |
a51482bd | 394 | kfree(asoc->peer.cookie); |
1da177e4 LT |
395 | |
396 | /* Release the transport structures. */ | |
397 | list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) { | |
398 | transport = list_entry(pos, struct sctp_transport, transports); | |
399 | list_del(pos); | |
400 | sctp_transport_free(transport); | |
401 | } | |
402 | ||
3f7a87d2 FF |
403 | asoc->peer.transport_count = 0; |
404 | ||
1da177e4 LT |
405 | /* Free any cached ASCONF_ACK chunk. */ |
406 | if (asoc->addip_last_asconf_ack) | |
407 | sctp_chunk_free(asoc->addip_last_asconf_ack); | |
408 | ||
409 | /* Free any cached ASCONF chunk. */ | |
410 | if (asoc->addip_last_asconf) | |
411 | sctp_chunk_free(asoc->addip_last_asconf); | |
412 | ||
413 | sctp_association_put(asoc); | |
414 | } | |
415 | ||
416 | /* Cleanup and free up an association. */ | |
417 | static void sctp_association_destroy(struct sctp_association *asoc) | |
418 | { | |
419 | SCTP_ASSERT(asoc->base.dead, "Assoc is not dead", return); | |
420 | ||
421 | sctp_endpoint_put(asoc->ep); | |
422 | sock_put(asoc->base.sk); | |
423 | ||
424 | if (asoc->assoc_id != 0) { | |
425 | spin_lock_bh(&sctp_assocs_id_lock); | |
426 | idr_remove(&sctp_assocs_id, asoc->assoc_id); | |
427 | spin_unlock_bh(&sctp_assocs_id_lock); | |
428 | } | |
429 | ||
049b3ff5 NH |
430 | BUG_TRAP(!atomic_read(&asoc->rmem_alloc)); |
431 | ||
1da177e4 LT |
432 | if (asoc->base.malloced) { |
433 | kfree(asoc); | |
434 | SCTP_DBG_OBJCNT_DEC(assoc); | |
435 | } | |
436 | } | |
437 | ||
438 | /* Change the primary destination address for the peer. */ | |
439 | void sctp_assoc_set_primary(struct sctp_association *asoc, | |
440 | struct sctp_transport *transport) | |
441 | { | |
442 | asoc->peer.primary_path = transport; | |
443 | ||
444 | /* Set a default msg_name for events. */ | |
445 | memcpy(&asoc->peer.primary_addr, &transport->ipaddr, | |
446 | sizeof(union sctp_addr)); | |
447 | ||
448 | /* If the primary path is changing, assume that the | |
449 | * user wants to use this new path. | |
450 | */ | |
ad8fec17 SS |
451 | if ((transport->state == SCTP_ACTIVE) || |
452 | (transport->state == SCTP_UNKNOWN)) | |
1da177e4 LT |
453 | asoc->peer.active_path = transport; |
454 | ||
455 | /* | |
456 | * SFR-CACC algorithm: | |
457 | * Upon the receipt of a request to change the primary | |
458 | * destination address, on the data structure for the new | |
459 | * primary destination, the sender MUST do the following: | |
460 | * | |
461 | * 1) If CHANGEOVER_ACTIVE is set, then there was a switch | |
462 | * to this destination address earlier. The sender MUST set | |
463 | * CYCLING_CHANGEOVER to indicate that this switch is a | |
464 | * double switch to the same destination address. | |
465 | */ | |
466 | if (transport->cacc.changeover_active) | |
467 | transport->cacc.cycling_changeover = 1; | |
468 | ||
469 | /* 2) The sender MUST set CHANGEOVER_ACTIVE to indicate that | |
470 | * a changeover has occurred. | |
471 | */ | |
472 | transport->cacc.changeover_active = 1; | |
473 | ||
474 | /* 3) The sender MUST store the next TSN to be sent in | |
475 | * next_tsn_at_change. | |
476 | */ | |
477 | transport->cacc.next_tsn_at_change = asoc->next_tsn; | |
478 | } | |
479 | ||
3f7a87d2 FF |
480 | /* Remove a transport from an association. */ |
481 | void sctp_assoc_rm_peer(struct sctp_association *asoc, | |
482 | struct sctp_transport *peer) | |
483 | { | |
484 | struct list_head *pos; | |
485 | struct sctp_transport *transport; | |
486 | ||
487 | SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_rm_peer:association %p addr: ", | |
488 | " port: %d\n", | |
489 | asoc, | |
490 | (&peer->ipaddr), | |
491 | peer->ipaddr.v4.sin_port); | |
492 | ||
493 | /* If we are to remove the current retran_path, update it | |
494 | * to the next peer before removing this peer from the list. | |
495 | */ | |
496 | if (asoc->peer.retran_path == peer) | |
497 | sctp_assoc_update_retran_path(asoc); | |
498 | ||
499 | /* Remove this peer from the list. */ | |
500 | list_del(&peer->transports); | |
501 | ||
502 | /* Get the first transport of asoc. */ | |
503 | pos = asoc->peer.transport_addr_list.next; | |
504 | transport = list_entry(pos, struct sctp_transport, transports); | |
505 | ||
506 | /* Update any entries that match the peer to be deleted. */ | |
507 | if (asoc->peer.primary_path == peer) | |
508 | sctp_assoc_set_primary(asoc, transport); | |
509 | if (asoc->peer.active_path == peer) | |
510 | asoc->peer.active_path = transport; | |
511 | if (asoc->peer.last_data_from == peer) | |
512 | asoc->peer.last_data_from = transport; | |
513 | ||
514 | /* If we remove the transport an INIT was last sent to, set it to | |
515 | * NULL. Combined with the update of the retran path above, this | |
516 | * will cause the next INIT to be sent to the next available | |
517 | * transport, maintaining the cycle. | |
518 | */ | |
519 | if (asoc->init_last_sent_to == peer) | |
520 | asoc->init_last_sent_to = NULL; | |
521 | ||
522 | asoc->peer.transport_count--; | |
523 | ||
524 | sctp_transport_free(peer); | |
525 | } | |
526 | ||
1da177e4 LT |
527 | /* Add a transport address to an association. */ |
528 | struct sctp_transport *sctp_assoc_add_peer(struct sctp_association *asoc, | |
529 | const union sctp_addr *addr, | |
dd0fc66f | 530 | const gfp_t gfp, |
3f7a87d2 | 531 | const int peer_state) |
1da177e4 LT |
532 | { |
533 | struct sctp_transport *peer; | |
534 | struct sctp_sock *sp; | |
535 | unsigned short port; | |
536 | ||
537 | sp = sctp_sk(asoc->base.sk); | |
538 | ||
539 | /* AF_INET and AF_INET6 share common port field. */ | |
540 | port = addr->v4.sin_port; | |
541 | ||
3f7a87d2 | 542 | SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_add_peer:association %p addr: ", |
ad8fec17 | 543 | " port: %d state:%d\n", |
3f7a87d2 FF |
544 | asoc, |
545 | addr, | |
546 | addr->v4.sin_port, | |
ad8fec17 | 547 | peer_state); |
3f7a87d2 | 548 | |
1da177e4 LT |
549 | /* Set the port if it has not been set yet. */ |
550 | if (0 == asoc->peer.port) | |
551 | asoc->peer.port = port; | |
552 | ||
553 | /* Check to see if this is a duplicate. */ | |
554 | peer = sctp_assoc_lookup_paddr(asoc, addr); | |
3f7a87d2 | 555 | if (peer) { |
ad8fec17 SS |
556 | if (peer->state == SCTP_UNKNOWN) { |
557 | if (peer_state == SCTP_ACTIVE) | |
558 | peer->state = SCTP_ACTIVE; | |
559 | if (peer_state == SCTP_UNCONFIRMED) | |
560 | peer->state = SCTP_UNCONFIRMED; | |
561 | } | |
1da177e4 | 562 | return peer; |
3f7a87d2 | 563 | } |
1da177e4 LT |
564 | |
565 | peer = sctp_transport_new(addr, gfp); | |
566 | if (!peer) | |
567 | return NULL; | |
568 | ||
569 | sctp_transport_set_owner(peer, asoc); | |
570 | ||
52ccb8e9 FF |
571 | /* Initialize the peer's heartbeat interval based on the |
572 | * association configured value. | |
573 | */ | |
574 | peer->hbinterval = asoc->hbinterval; | |
575 | ||
576 | /* Set the path max_retrans. */ | |
577 | peer->pathmaxrxt = asoc->pathmaxrxt; | |
578 | ||
579 | /* Initialize the peer's SACK delay timeout based on the | |
580 | * association configured value. | |
581 | */ | |
582 | peer->sackdelay = asoc->sackdelay; | |
583 | ||
584 | /* Enable/disable heartbeat, SACK delay, and path MTU discovery | |
585 | * based on association setting. | |
586 | */ | |
587 | peer->param_flags = asoc->param_flags; | |
588 | ||
1da177e4 | 589 | /* Initialize the pmtu of the transport. */ |
52ccb8e9 FF |
590 | if (peer->param_flags & SPP_PMTUD_ENABLE) |
591 | sctp_transport_pmtu(peer); | |
592 | else if (asoc->pathmtu) | |
593 | peer->pathmtu = asoc->pathmtu; | |
594 | else | |
595 | peer->pathmtu = SCTP_DEFAULT_MAXSEGMENT; | |
1da177e4 LT |
596 | |
597 | /* If this is the first transport addr on this association, | |
598 | * initialize the association PMTU to the peer's PMTU. | |
599 | * If not and the current association PMTU is higher than the new | |
600 | * peer's PMTU, reset the association PMTU to the new peer's PMTU. | |
601 | */ | |
52ccb8e9 FF |
602 | if (asoc->pathmtu) |
603 | asoc->pathmtu = min_t(int, peer->pathmtu, asoc->pathmtu); | |
1da177e4 | 604 | else |
52ccb8e9 | 605 | asoc->pathmtu = peer->pathmtu; |
1da177e4 LT |
606 | |
607 | SCTP_DEBUG_PRINTK("sctp_assoc_add_peer:association %p PMTU set to " | |
52ccb8e9 | 608 | "%d\n", asoc, asoc->pathmtu); |
1da177e4 | 609 | |
52ccb8e9 | 610 | asoc->frag_point = sctp_frag_point(sp, asoc->pathmtu); |
1da177e4 LT |
611 | |
612 | /* The asoc->peer.port might not be meaningful yet, but | |
613 | * initialize the packet structure anyway. | |
614 | */ | |
615 | sctp_packet_init(&peer->packet, peer, asoc->base.bind_addr.port, | |
616 | asoc->peer.port); | |
617 | ||
618 | /* 7.2.1 Slow-Start | |
619 | * | |
620 | * o The initial cwnd before DATA transmission or after a sufficiently | |
621 | * long idle period MUST be set to | |
622 | * min(4*MTU, max(2*MTU, 4380 bytes)) | |
623 | * | |
624 | * o The initial value of ssthresh MAY be arbitrarily high | |
625 | * (for example, implementations MAY use the size of the | |
626 | * receiver advertised window). | |
627 | */ | |
52ccb8e9 | 628 | peer->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380)); |
1da177e4 LT |
629 | |
630 | /* At this point, we may not have the receiver's advertised window, | |
631 | * so initialize ssthresh to the default value and it will be set | |
632 | * later when we process the INIT. | |
633 | */ | |
634 | peer->ssthresh = SCTP_DEFAULT_MAXWINDOW; | |
635 | ||
636 | peer->partial_bytes_acked = 0; | |
637 | peer->flight_size = 0; | |
638 | ||
1da177e4 LT |
639 | /* Set the transport's RTO.initial value */ |
640 | peer->rto = asoc->rto_initial; | |
641 | ||
3f7a87d2 FF |
642 | /* Set the peer's active state. */ |
643 | peer->state = peer_state; | |
644 | ||
1da177e4 LT |
645 | /* Attach the remote transport to our asoc. */ |
646 | list_add_tail(&peer->transports, &asoc->peer.transport_addr_list); | |
3f7a87d2 | 647 | asoc->peer.transport_count++; |
1da177e4 LT |
648 | |
649 | /* If we do not yet have a primary path, set one. */ | |
650 | if (!asoc->peer.primary_path) { | |
651 | sctp_assoc_set_primary(asoc, peer); | |
652 | asoc->peer.retran_path = peer; | |
653 | } | |
654 | ||
3f7a87d2 | 655 | if (asoc->peer.active_path == asoc->peer.retran_path) { |
1da177e4 | 656 | asoc->peer.retran_path = peer; |
3f7a87d2 | 657 | } |
1da177e4 LT |
658 | |
659 | return peer; | |
660 | } | |
661 | ||
662 | /* Delete a transport address from an association. */ | |
663 | void sctp_assoc_del_peer(struct sctp_association *asoc, | |
664 | const union sctp_addr *addr) | |
665 | { | |
666 | struct list_head *pos; | |
667 | struct list_head *temp; | |
1da177e4 LT |
668 | struct sctp_transport *transport; |
669 | ||
670 | list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) { | |
671 | transport = list_entry(pos, struct sctp_transport, transports); | |
672 | if (sctp_cmp_addr_exact(addr, &transport->ipaddr)) { | |
3f7a87d2 FF |
673 | /* Do book keeping for removing the peer and free it. */ |
674 | sctp_assoc_rm_peer(asoc, transport); | |
1da177e4 LT |
675 | break; |
676 | } | |
677 | } | |
1da177e4 LT |
678 | } |
679 | ||
680 | /* Lookup a transport by address. */ | |
681 | struct sctp_transport *sctp_assoc_lookup_paddr( | |
682 | const struct sctp_association *asoc, | |
683 | const union sctp_addr *address) | |
684 | { | |
685 | struct sctp_transport *t; | |
686 | struct list_head *pos; | |
687 | ||
688 | /* Cycle through all transports searching for a peer address. */ | |
689 | ||
690 | list_for_each(pos, &asoc->peer.transport_addr_list) { | |
691 | t = list_entry(pos, struct sctp_transport, transports); | |
692 | if (sctp_cmp_addr_exact(address, &t->ipaddr)) | |
693 | return t; | |
694 | } | |
695 | ||
696 | return NULL; | |
697 | } | |
698 | ||
699 | /* Engage in transport control operations. | |
700 | * Mark the transport up or down and send a notification to the user. | |
701 | * Select and update the new active and retran paths. | |
702 | */ | |
703 | void sctp_assoc_control_transport(struct sctp_association *asoc, | |
704 | struct sctp_transport *transport, | |
705 | sctp_transport_cmd_t command, | |
706 | sctp_sn_error_t error) | |
707 | { | |
708 | struct sctp_transport *t = NULL; | |
709 | struct sctp_transport *first; | |
710 | struct sctp_transport *second; | |
711 | struct sctp_ulpevent *event; | |
712 | struct list_head *pos; | |
713 | int spc_state = 0; | |
714 | ||
715 | /* Record the transition on the transport. */ | |
716 | switch (command) { | |
717 | case SCTP_TRANSPORT_UP: | |
3f7a87d2 | 718 | transport->state = SCTP_ACTIVE; |
1da177e4 LT |
719 | spc_state = SCTP_ADDR_AVAILABLE; |
720 | break; | |
721 | ||
722 | case SCTP_TRANSPORT_DOWN: | |
3f7a87d2 | 723 | transport->state = SCTP_INACTIVE; |
1da177e4 LT |
724 | spc_state = SCTP_ADDR_UNREACHABLE; |
725 | break; | |
726 | ||
727 | default: | |
728 | return; | |
729 | }; | |
730 | ||
731 | /* Generate and send a SCTP_PEER_ADDR_CHANGE notification to the | |
732 | * user. | |
733 | */ | |
734 | event = sctp_ulpevent_make_peer_addr_change(asoc, | |
735 | (struct sockaddr_storage *) &transport->ipaddr, | |
736 | 0, spc_state, error, GFP_ATOMIC); | |
737 | if (event) | |
738 | sctp_ulpq_tail_event(&asoc->ulpq, event); | |
739 | ||
740 | /* Select new active and retran paths. */ | |
741 | ||
742 | /* Look for the two most recently used active transports. | |
743 | * | |
744 | * This code produces the wrong ordering whenever jiffies | |
745 | * rolls over, but we still get usable transports, so we don't | |
746 | * worry about it. | |
747 | */ | |
748 | first = NULL; second = NULL; | |
749 | ||
750 | list_for_each(pos, &asoc->peer.transport_addr_list) { | |
751 | t = list_entry(pos, struct sctp_transport, transports); | |
752 | ||
ad8fec17 SS |
753 | if ((t->state == SCTP_INACTIVE) || |
754 | (t->state == SCTP_UNCONFIRMED)) | |
1da177e4 LT |
755 | continue; |
756 | if (!first || t->last_time_heard > first->last_time_heard) { | |
757 | second = first; | |
758 | first = t; | |
759 | } | |
760 | if (!second || t->last_time_heard > second->last_time_heard) | |
761 | second = t; | |
762 | } | |
763 | ||
764 | /* RFC 2960 6.4 Multi-Homed SCTP Endpoints | |
765 | * | |
766 | * By default, an endpoint should always transmit to the | |
767 | * primary path, unless the SCTP user explicitly specifies the | |
768 | * destination transport address (and possibly source | |
769 | * transport address) to use. | |
770 | * | |
771 | * [If the primary is active but not most recent, bump the most | |
772 | * recently used transport.] | |
773 | */ | |
ad8fec17 SS |
774 | if (((asoc->peer.primary_path->state == SCTP_ACTIVE) || |
775 | (asoc->peer.primary_path->state == SCTP_UNKNOWN)) && | |
1da177e4 LT |
776 | first != asoc->peer.primary_path) { |
777 | second = first; | |
778 | first = asoc->peer.primary_path; | |
779 | } | |
780 | ||
781 | /* If we failed to find a usable transport, just camp on the | |
782 | * primary, even if it is inactive. | |
783 | */ | |
784 | if (!first) { | |
785 | first = asoc->peer.primary_path; | |
786 | second = asoc->peer.primary_path; | |
787 | } | |
788 | ||
789 | /* Set the active and retran transports. */ | |
790 | asoc->peer.active_path = first; | |
791 | asoc->peer.retran_path = second; | |
792 | } | |
793 | ||
794 | /* Hold a reference to an association. */ | |
795 | void sctp_association_hold(struct sctp_association *asoc) | |
796 | { | |
797 | atomic_inc(&asoc->base.refcnt); | |
798 | } | |
799 | ||
800 | /* Release a reference to an association and cleanup | |
801 | * if there are no more references. | |
802 | */ | |
803 | void sctp_association_put(struct sctp_association *asoc) | |
804 | { | |
805 | if (atomic_dec_and_test(&asoc->base.refcnt)) | |
806 | sctp_association_destroy(asoc); | |
807 | } | |
808 | ||
809 | /* Allocate the next TSN, Transmission Sequence Number, for the given | |
810 | * association. | |
811 | */ | |
812 | __u32 sctp_association_get_next_tsn(struct sctp_association *asoc) | |
813 | { | |
814 | /* From Section 1.6 Serial Number Arithmetic: | |
815 | * Transmission Sequence Numbers wrap around when they reach | |
816 | * 2**32 - 1. That is, the next TSN a DATA chunk MUST use | |
817 | * after transmitting TSN = 2*32 - 1 is TSN = 0. | |
818 | */ | |
819 | __u32 retval = asoc->next_tsn; | |
820 | asoc->next_tsn++; | |
821 | asoc->unack_data++; | |
822 | ||
823 | return retval; | |
824 | } | |
825 | ||
826 | /* Compare two addresses to see if they match. Wildcard addresses | |
827 | * only match themselves. | |
828 | */ | |
829 | int sctp_cmp_addr_exact(const union sctp_addr *ss1, | |
830 | const union sctp_addr *ss2) | |
831 | { | |
832 | struct sctp_af *af; | |
833 | ||
834 | af = sctp_get_af_specific(ss1->sa.sa_family); | |
835 | if (unlikely(!af)) | |
836 | return 0; | |
837 | ||
838 | return af->cmp_addr(ss1, ss2); | |
839 | } | |
840 | ||
841 | /* Return an ecne chunk to get prepended to a packet. | |
842 | * Note: We are sly and return a shared, prealloced chunk. FIXME: | |
843 | * No we don't, but we could/should. | |
844 | */ | |
845 | struct sctp_chunk *sctp_get_ecne_prepend(struct sctp_association *asoc) | |
846 | { | |
847 | struct sctp_chunk *chunk; | |
848 | ||
849 | /* Send ECNE if needed. | |
850 | * Not being able to allocate a chunk here is not deadly. | |
851 | */ | |
852 | if (asoc->need_ecne) | |
853 | chunk = sctp_make_ecne(asoc, asoc->last_ecne_tsn); | |
854 | else | |
855 | chunk = NULL; | |
856 | ||
857 | return chunk; | |
858 | } | |
859 | ||
860 | /* | |
861 | * Find which transport this TSN was sent on. | |
862 | */ | |
863 | struct sctp_transport *sctp_assoc_lookup_tsn(struct sctp_association *asoc, | |
864 | __u32 tsn) | |
865 | { | |
866 | struct sctp_transport *active; | |
867 | struct sctp_transport *match; | |
868 | struct list_head *entry, *pos; | |
869 | struct sctp_transport *transport; | |
870 | struct sctp_chunk *chunk; | |
dbc16db1 | 871 | __be32 key = htonl(tsn); |
1da177e4 LT |
872 | |
873 | match = NULL; | |
874 | ||
875 | /* | |
876 | * FIXME: In general, find a more efficient data structure for | |
877 | * searching. | |
878 | */ | |
879 | ||
880 | /* | |
881 | * The general strategy is to search each transport's transmitted | |
882 | * list. Return which transport this TSN lives on. | |
883 | * | |
884 | * Let's be hopeful and check the active_path first. | |
885 | * Another optimization would be to know if there is only one | |
886 | * outbound path and not have to look for the TSN at all. | |
887 | * | |
888 | */ | |
889 | ||
890 | active = asoc->peer.active_path; | |
891 | ||
892 | list_for_each(entry, &active->transmitted) { | |
893 | chunk = list_entry(entry, struct sctp_chunk, transmitted_list); | |
894 | ||
895 | if (key == chunk->subh.data_hdr->tsn) { | |
896 | match = active; | |
897 | goto out; | |
898 | } | |
899 | } | |
900 | ||
901 | /* If not found, go search all the other transports. */ | |
902 | list_for_each(pos, &asoc->peer.transport_addr_list) { | |
903 | transport = list_entry(pos, struct sctp_transport, transports); | |
904 | ||
905 | if (transport == active) | |
906 | break; | |
907 | list_for_each(entry, &transport->transmitted) { | |
908 | chunk = list_entry(entry, struct sctp_chunk, | |
909 | transmitted_list); | |
910 | if (key == chunk->subh.data_hdr->tsn) { | |
911 | match = transport; | |
912 | goto out; | |
913 | } | |
914 | } | |
915 | } | |
916 | out: | |
917 | return match; | |
918 | } | |
919 | ||
920 | /* Is this the association we are looking for? */ | |
921 | struct sctp_transport *sctp_assoc_is_match(struct sctp_association *asoc, | |
922 | const union sctp_addr *laddr, | |
923 | const union sctp_addr *paddr) | |
924 | { | |
925 | struct sctp_transport *transport; | |
926 | ||
927 | sctp_read_lock(&asoc->base.addr_lock); | |
928 | ||
929 | if ((asoc->base.bind_addr.port == laddr->v4.sin_port) && | |
930 | (asoc->peer.port == paddr->v4.sin_port)) { | |
931 | transport = sctp_assoc_lookup_paddr(asoc, paddr); | |
932 | if (!transport) | |
933 | goto out; | |
934 | ||
935 | if (sctp_bind_addr_match(&asoc->base.bind_addr, laddr, | |
936 | sctp_sk(asoc->base.sk))) | |
937 | goto out; | |
938 | } | |
939 | transport = NULL; | |
940 | ||
941 | out: | |
942 | sctp_read_unlock(&asoc->base.addr_lock); | |
943 | return transport; | |
944 | } | |
945 | ||
946 | /* Do delayed input processing. This is scheduled by sctp_rcv(). */ | |
947 | static void sctp_assoc_bh_rcv(struct sctp_association *asoc) | |
948 | { | |
949 | struct sctp_endpoint *ep; | |
950 | struct sctp_chunk *chunk; | |
951 | struct sock *sk; | |
952 | struct sctp_inq *inqueue; | |
953 | int state; | |
954 | sctp_subtype_t subtype; | |
955 | int error = 0; | |
956 | ||
957 | /* The association should be held so we should be safe. */ | |
958 | ep = asoc->ep; | |
959 | sk = asoc->base.sk; | |
960 | ||
961 | inqueue = &asoc->base.inqueue; | |
962 | sctp_association_hold(asoc); | |
963 | while (NULL != (chunk = sctp_inq_pop(inqueue))) { | |
964 | state = asoc->state; | |
965 | subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type); | |
966 | ||
967 | /* Remember where the last DATA chunk came from so we | |
968 | * know where to send the SACK. | |
969 | */ | |
970 | if (sctp_chunk_is_data(chunk)) | |
971 | asoc->peer.last_data_from = chunk->transport; | |
972 | else | |
973 | SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS); | |
974 | ||
975 | if (chunk->transport) | |
976 | chunk->transport->last_time_heard = jiffies; | |
977 | ||
978 | /* Run through the state machine. */ | |
979 | error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, | |
980 | state, ep, asoc, chunk, GFP_ATOMIC); | |
981 | ||
982 | /* Check to see if the association is freed in response to | |
983 | * the incoming chunk. If so, get out of the while loop. | |
984 | */ | |
985 | if (asoc->base.dead) | |
986 | break; | |
987 | ||
988 | /* If there is an error on chunk, discard this packet. */ | |
989 | if (error && chunk) | |
990 | chunk->pdiscard = 1; | |
991 | } | |
992 | sctp_association_put(asoc); | |
993 | } | |
994 | ||
995 | /* This routine moves an association from its old sk to a new sk. */ | |
996 | void sctp_assoc_migrate(struct sctp_association *assoc, struct sock *newsk) | |
997 | { | |
998 | struct sctp_sock *newsp = sctp_sk(newsk); | |
999 | struct sock *oldsk = assoc->base.sk; | |
1000 | ||
1001 | /* Delete the association from the old endpoint's list of | |
1002 | * associations. | |
1003 | */ | |
1004 | list_del_init(&assoc->asocs); | |
1005 | ||
1006 | /* Decrement the backlog value for a TCP-style socket. */ | |
1007 | if (sctp_style(oldsk, TCP)) | |
1008 | oldsk->sk_ack_backlog--; | |
1009 | ||
1010 | /* Release references to the old endpoint and the sock. */ | |
1011 | sctp_endpoint_put(assoc->ep); | |
1012 | sock_put(assoc->base.sk); | |
1013 | ||
1014 | /* Get a reference to the new endpoint. */ | |
1015 | assoc->ep = newsp->ep; | |
1016 | sctp_endpoint_hold(assoc->ep); | |
1017 | ||
1018 | /* Get a reference to the new sock. */ | |
1019 | assoc->base.sk = newsk; | |
1020 | sock_hold(assoc->base.sk); | |
1021 | ||
1022 | /* Add the association to the new endpoint's list of associations. */ | |
1023 | sctp_endpoint_add_asoc(newsp->ep, assoc); | |
1024 | } | |
1025 | ||
1026 | /* Update an association (possibly from unexpected COOKIE-ECHO processing). */ | |
1027 | void sctp_assoc_update(struct sctp_association *asoc, | |
1028 | struct sctp_association *new) | |
1029 | { | |
1030 | struct sctp_transport *trans; | |
1031 | struct list_head *pos, *temp; | |
1032 | ||
1033 | /* Copy in new parameters of peer. */ | |
1034 | asoc->c = new->c; | |
1035 | asoc->peer.rwnd = new->peer.rwnd; | |
1036 | asoc->peer.sack_needed = new->peer.sack_needed; | |
1037 | asoc->peer.i = new->peer.i; | |
1038 | sctp_tsnmap_init(&asoc->peer.tsn_map, SCTP_TSN_MAP_SIZE, | |
1039 | asoc->peer.i.initial_tsn); | |
1040 | ||
1041 | /* Remove any peer addresses not present in the new association. */ | |
1042 | list_for_each_safe(pos, temp, &asoc->peer.transport_addr_list) { | |
1043 | trans = list_entry(pos, struct sctp_transport, transports); | |
1044 | if (!sctp_assoc_lookup_paddr(new, &trans->ipaddr)) | |
1045 | sctp_assoc_del_peer(asoc, &trans->ipaddr); | |
1046 | } | |
1047 | ||
1048 | /* If the case is A (association restart), use | |
1049 | * initial_tsn as next_tsn. If the case is B, use | |
1050 | * current next_tsn in case data sent to peer | |
1051 | * has been discarded and needs retransmission. | |
1052 | */ | |
1053 | if (asoc->state >= SCTP_STATE_ESTABLISHED) { | |
1054 | asoc->next_tsn = new->next_tsn; | |
1055 | asoc->ctsn_ack_point = new->ctsn_ack_point; | |
1056 | asoc->adv_peer_ack_point = new->adv_peer_ack_point; | |
1057 | ||
1058 | /* Reinitialize SSN for both local streams | |
1059 | * and peer's streams. | |
1060 | */ | |
1061 | sctp_ssnmap_clear(asoc->ssnmap); | |
1062 | ||
1063 | } else { | |
1064 | /* Add any peer addresses from the new association. */ | |
1065 | list_for_each(pos, &new->peer.transport_addr_list) { | |
1066 | trans = list_entry(pos, struct sctp_transport, | |
1067 | transports); | |
1068 | if (!sctp_assoc_lookup_paddr(asoc, &trans->ipaddr)) | |
1069 | sctp_assoc_add_peer(asoc, &trans->ipaddr, | |
ad8fec17 | 1070 | GFP_ATOMIC, trans->state); |
1da177e4 LT |
1071 | } |
1072 | ||
1073 | asoc->ctsn_ack_point = asoc->next_tsn - 1; | |
1074 | asoc->adv_peer_ack_point = asoc->ctsn_ack_point; | |
1075 | if (!asoc->ssnmap) { | |
1076 | /* Move the ssnmap. */ | |
1077 | asoc->ssnmap = new->ssnmap; | |
1078 | new->ssnmap = NULL; | |
1079 | } | |
1080 | } | |
1081 | } | |
1082 | ||
1083 | /* Update the retran path for sending a retransmitted packet. | |
1084 | * Round-robin through the active transports, else round-robin | |
1085 | * through the inactive transports as this is the next best thing | |
1086 | * we can try. | |
1087 | */ | |
1088 | void sctp_assoc_update_retran_path(struct sctp_association *asoc) | |
1089 | { | |
1090 | struct sctp_transport *t, *next; | |
1091 | struct list_head *head = &asoc->peer.transport_addr_list; | |
1092 | struct list_head *pos; | |
1093 | ||
1094 | /* Find the next transport in a round-robin fashion. */ | |
1095 | t = asoc->peer.retran_path; | |
1096 | pos = &t->transports; | |
1097 | next = NULL; | |
1098 | ||
1099 | while (1) { | |
1100 | /* Skip the head. */ | |
1101 | if (pos->next == head) | |
1102 | pos = head->next; | |
1103 | else | |
1104 | pos = pos->next; | |
1105 | ||
1106 | t = list_entry(pos, struct sctp_transport, transports); | |
1107 | ||
1108 | /* Try to find an active transport. */ | |
1109 | ||
ad8fec17 SS |
1110 | if ((t->state == SCTP_ACTIVE) || |
1111 | (t->state == SCTP_UNKNOWN)) { | |
1da177e4 LT |
1112 | break; |
1113 | } else { | |
1114 | /* Keep track of the next transport in case | |
1115 | * we don't find any active transport. | |
1116 | */ | |
1117 | if (!next) | |
1118 | next = t; | |
1119 | } | |
1120 | ||
1121 | /* We have exhausted the list, but didn't find any | |
1122 | * other active transports. If so, use the next | |
1123 | * transport. | |
1124 | */ | |
1125 | if (t == asoc->peer.retran_path) { | |
1126 | t = next; | |
1127 | break; | |
1128 | } | |
1129 | } | |
1130 | ||
1131 | asoc->peer.retran_path = t; | |
3f7a87d2 FF |
1132 | |
1133 | SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association" | |
1134 | " %p addr: ", | |
1135 | " port: %d\n", | |
1136 | asoc, | |
1137 | (&t->ipaddr), | |
1138 | t->ipaddr.v4.sin_port); | |
1139 | } | |
1140 | ||
1141 | /* Choose the transport for sending a INIT packet. */ | |
1142 | struct sctp_transport *sctp_assoc_choose_init_transport( | |
1143 | struct sctp_association *asoc) | |
1144 | { | |
1145 | struct sctp_transport *t; | |
1146 | ||
1147 | /* Use the retran path. If the last INIT was sent over the | |
1148 | * retran path, update the retran path and use it. | |
1149 | */ | |
1150 | if (!asoc->init_last_sent_to) { | |
1151 | t = asoc->peer.active_path; | |
1152 | } else { | |
1153 | if (asoc->init_last_sent_to == asoc->peer.retran_path) | |
1154 | sctp_assoc_update_retran_path(asoc); | |
1155 | t = asoc->peer.retran_path; | |
1156 | } | |
1157 | ||
1158 | SCTP_DEBUG_PRINTK_IPADDR("sctp_assoc_update_retran_path:association" | |
1159 | " %p addr: ", | |
1160 | " port: %d\n", | |
1161 | asoc, | |
1162 | (&t->ipaddr), | |
1163 | t->ipaddr.v4.sin_port); | |
1164 | ||
1165 | return t; | |
1da177e4 LT |
1166 | } |
1167 | ||
1168 | /* Choose the transport for sending a SHUTDOWN packet. */ | |
1169 | struct sctp_transport *sctp_assoc_choose_shutdown_transport( | |
1170 | struct sctp_association *asoc) | |
1171 | { | |
1172 | /* If this is the first time SHUTDOWN is sent, use the active path, | |
1173 | * else use the retran path. If the last SHUTDOWN was sent over the | |
1174 | * retran path, update the retran path and use it. | |
1175 | */ | |
1176 | if (!asoc->shutdown_last_sent_to) | |
1177 | return asoc->peer.active_path; | |
1178 | else { | |
1179 | if (asoc->shutdown_last_sent_to == asoc->peer.retran_path) | |
1180 | sctp_assoc_update_retran_path(asoc); | |
1181 | return asoc->peer.retran_path; | |
1182 | } | |
1183 | ||
1184 | } | |
1185 | ||
1186 | /* Update the association's pmtu and frag_point by going through all the | |
1187 | * transports. This routine is called when a transport's PMTU has changed. | |
1188 | */ | |
1189 | void sctp_assoc_sync_pmtu(struct sctp_association *asoc) | |
1190 | { | |
1191 | struct sctp_transport *t; | |
1192 | struct list_head *pos; | |
1193 | __u32 pmtu = 0; | |
1194 | ||
1195 | if (!asoc) | |
1196 | return; | |
1197 | ||
1198 | /* Get the lowest pmtu of all the transports. */ | |
1199 | list_for_each(pos, &asoc->peer.transport_addr_list) { | |
1200 | t = list_entry(pos, struct sctp_transport, transports); | |
52ccb8e9 FF |
1201 | if (!pmtu || (t->pathmtu < pmtu)) |
1202 | pmtu = t->pathmtu; | |
1da177e4 LT |
1203 | } |
1204 | ||
1205 | if (pmtu) { | |
1206 | struct sctp_sock *sp = sctp_sk(asoc->base.sk); | |
52ccb8e9 | 1207 | asoc->pathmtu = pmtu; |
1da177e4 LT |
1208 | asoc->frag_point = sctp_frag_point(sp, pmtu); |
1209 | } | |
1210 | ||
1211 | SCTP_DEBUG_PRINTK("%s: asoc:%p, pmtu:%d, frag_point:%d\n", | |
52ccb8e9 | 1212 | __FUNCTION__, asoc, asoc->pathmtu, asoc->frag_point); |
1da177e4 LT |
1213 | } |
1214 | ||
1215 | /* Should we send a SACK to update our peer? */ | |
1216 | static inline int sctp_peer_needs_update(struct sctp_association *asoc) | |
1217 | { | |
1218 | switch (asoc->state) { | |
1219 | case SCTP_STATE_ESTABLISHED: | |
1220 | case SCTP_STATE_SHUTDOWN_PENDING: | |
1221 | case SCTP_STATE_SHUTDOWN_RECEIVED: | |
1222 | case SCTP_STATE_SHUTDOWN_SENT: | |
1223 | if ((asoc->rwnd > asoc->a_rwnd) && | |
1224 | ((asoc->rwnd - asoc->a_rwnd) >= | |
52ccb8e9 | 1225 | min_t(__u32, (asoc->base.sk->sk_rcvbuf >> 1), asoc->pathmtu))) |
1da177e4 LT |
1226 | return 1; |
1227 | break; | |
1228 | default: | |
1229 | break; | |
1230 | } | |
1231 | return 0; | |
1232 | } | |
1233 | ||
1234 | /* Increase asoc's rwnd by len and send any window update SACK if needed. */ | |
1235 | void sctp_assoc_rwnd_increase(struct sctp_association *asoc, unsigned len) | |
1236 | { | |
1237 | struct sctp_chunk *sack; | |
1238 | struct timer_list *timer; | |
1239 | ||
1240 | if (asoc->rwnd_over) { | |
1241 | if (asoc->rwnd_over >= len) { | |
1242 | asoc->rwnd_over -= len; | |
1243 | } else { | |
1244 | asoc->rwnd += (len - asoc->rwnd_over); | |
1245 | asoc->rwnd_over = 0; | |
1246 | } | |
1247 | } else { | |
1248 | asoc->rwnd += len; | |
1249 | } | |
1250 | ||
1251 | SCTP_DEBUG_PRINTK("%s: asoc %p rwnd increased by %d to (%u, %u) " | |
1252 | "- %u\n", __FUNCTION__, asoc, len, asoc->rwnd, | |
1253 | asoc->rwnd_over, asoc->a_rwnd); | |
1254 | ||
1255 | /* Send a window update SACK if the rwnd has increased by at least the | |
1256 | * minimum of the association's PMTU and half of the receive buffer. | |
1257 | * The algorithm used is similar to the one described in | |
1258 | * Section 4.2.3.3 of RFC 1122. | |
1259 | */ | |
1260 | if (sctp_peer_needs_update(asoc)) { | |
1261 | asoc->a_rwnd = asoc->rwnd; | |
1262 | SCTP_DEBUG_PRINTK("%s: Sending window update SACK- asoc: %p " | |
1263 | "rwnd: %u a_rwnd: %u\n", __FUNCTION__, | |
1264 | asoc, asoc->rwnd, asoc->a_rwnd); | |
1265 | sack = sctp_make_sack(asoc); | |
1266 | if (!sack) | |
1267 | return; | |
1268 | ||
1269 | asoc->peer.sack_needed = 0; | |
1270 | ||
1271 | sctp_outq_tail(&asoc->outqueue, sack); | |
1272 | ||
1273 | /* Stop the SACK timer. */ | |
1274 | timer = &asoc->timers[SCTP_EVENT_TIMEOUT_SACK]; | |
1275 | if (timer_pending(timer) && del_timer(timer)) | |
1276 | sctp_association_put(asoc); | |
1277 | } | |
1278 | } | |
1279 | ||
1280 | /* Decrease asoc's rwnd by len. */ | |
1281 | void sctp_assoc_rwnd_decrease(struct sctp_association *asoc, unsigned len) | |
1282 | { | |
1283 | SCTP_ASSERT(asoc->rwnd, "rwnd zero", return); | |
1284 | SCTP_ASSERT(!asoc->rwnd_over, "rwnd_over not zero", return); | |
1285 | if (asoc->rwnd >= len) { | |
1286 | asoc->rwnd -= len; | |
1287 | } else { | |
1288 | asoc->rwnd_over = len - asoc->rwnd; | |
1289 | asoc->rwnd = 0; | |
1290 | } | |
1291 | SCTP_DEBUG_PRINTK("%s: asoc %p rwnd decreased by %d to (%u, %u)\n", | |
1292 | __FUNCTION__, asoc, len, asoc->rwnd, | |
1293 | asoc->rwnd_over); | |
1294 | } | |
1295 | ||
1296 | /* Build the bind address list for the association based on info from the | |
1297 | * local endpoint and the remote peer. | |
1298 | */ | |
3182cd84 | 1299 | int sctp_assoc_set_bind_addr_from_ep(struct sctp_association *asoc, |
dd0fc66f | 1300 | gfp_t gfp) |
1da177e4 LT |
1301 | { |
1302 | sctp_scope_t scope; | |
1303 | int flags; | |
1304 | ||
1305 | /* Use scoping rules to determine the subset of addresses from | |
1306 | * the endpoint. | |
1307 | */ | |
1308 | scope = sctp_scope(&asoc->peer.active_path->ipaddr); | |
1309 | flags = (PF_INET6 == asoc->base.sk->sk_family) ? SCTP_ADDR6_ALLOWED : 0; | |
1310 | if (asoc->peer.ipv4_address) | |
1311 | flags |= SCTP_ADDR4_PEERSUPP; | |
1312 | if (asoc->peer.ipv6_address) | |
1313 | flags |= SCTP_ADDR6_PEERSUPP; | |
1314 | ||
1315 | return sctp_bind_addr_copy(&asoc->base.bind_addr, | |
1316 | &asoc->ep->base.bind_addr, | |
1317 | scope, gfp, flags); | |
1318 | } | |
1319 | ||
1320 | /* Build the association's bind address list from the cookie. */ | |
1321 | int sctp_assoc_set_bind_addr_from_cookie(struct sctp_association *asoc, | |
3182cd84 | 1322 | struct sctp_cookie *cookie, |
dd0fc66f | 1323 | gfp_t gfp) |
1da177e4 LT |
1324 | { |
1325 | int var_size2 = ntohs(cookie->peer_init->chunk_hdr.length); | |
1326 | int var_size3 = cookie->raw_addr_list_len; | |
1327 | __u8 *raw = (__u8 *)cookie->peer_init + var_size2; | |
1328 | ||
1329 | return sctp_raw_to_bind_addrs(&asoc->base.bind_addr, raw, var_size3, | |
1330 | asoc->ep->base.bind_addr.port, gfp); | |
1331 | } | |
1332 | ||
1333 | /* Lookup laddr in the bind address list of an association. */ | |
1334 | int sctp_assoc_lookup_laddr(struct sctp_association *asoc, | |
1335 | const union sctp_addr *laddr) | |
1336 | { | |
1337 | int found; | |
1338 | ||
1339 | sctp_read_lock(&asoc->base.addr_lock); | |
1340 | if ((asoc->base.bind_addr.port == ntohs(laddr->v4.sin_port)) && | |
1341 | sctp_bind_addr_match(&asoc->base.bind_addr, laddr, | |
1342 | sctp_sk(asoc->base.sk))) { | |
1343 | found = 1; | |
1344 | goto out; | |
1345 | } | |
1346 | ||
1347 | found = 0; | |
1348 | out: | |
1349 | sctp_read_unlock(&asoc->base.addr_lock); | |
1350 | return found; | |
1351 | } |