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