Diff markup
1 /* SCTP kernel implementation 1 /* SCTP kernel implementation
2 * Copyright (c) 1999-2000 Cisco, Inc. 2 * Copyright (c) 1999-2000 Cisco, Inc.
3 * Copyright (c) 1999-2001 Motorola, Inc. 3 * Copyright (c) 1999-2001 Motorola, Inc.
4 * Copyright (c) 2001-2002 International Busin 4 * Copyright (c) 2001-2002 International Business Machines, Corp.
5 * Copyright (c) 2001 Intel Corp. 5 * Copyright (c) 2001 Intel Corp.
6 * Copyright (c) 2001 Nokia, Inc. 6 * Copyright (c) 2001 Nokia, Inc.
7 * Copyright (c) 2001 La Monte H.P. Yarroll 7 * Copyright (c) 2001 La Monte H.P. Yarroll
8 * 8 *
9 * This file is part of the SCTP kernel implem 9 * This file is part of the SCTP kernel implementation
10 * 10 *
11 * This abstraction represents an SCTP endpoin 11 * This abstraction represents an SCTP endpoint.
12 * 12 *
13 * The SCTP implementation is free software; 13 * The SCTP implementation is free software;
14 * you can redistribute it and/or modify it un 14 * you can redistribute it and/or modify it under the terms of
15 * the GNU General Public License as published 15 * the GNU General Public License as published by
16 * the Free Software Foundation; either versio 16 * the Free Software Foundation; either version 2, or (at your option)
17 * any later version. 17 * any later version.
18 * 18 *
19 * The SCTP implementation is distributed in t 19 * The SCTP implementation is distributed in the hope that it
20 * will be useful, but WITHOUT ANY WARRANTY; w 20 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
21 * ************************ 21 * ************************
22 * warranty of MERCHANTABILITY or FITNESS FOR 22 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
23 * See the GNU General Public License for more 23 * See the GNU General Public License for more details.
24 * 24 *
25 * You should have received a copy of the GNU 25 * You should have received a copy of the GNU General Public License
26 * along with GNU CC; see the file COPYING. I 26 * along with GNU CC; see the file COPYING. If not, write to
27 * the Free Software Foundation, 59 Temple Pla 27 * the Free Software Foundation, 59 Temple Place - Suite 330,
28 * Boston, MA 02111-1307, USA. 28 * Boston, MA 02111-1307, USA.
29 * 29 *
30 * Please send any bug reports or fixes you ma 30 * Please send any bug reports or fixes you make to the
31 * email address(es): 31 * email address(es):
32 * lksctp developers <lksctp-developers@lis 32 * lksctp developers <lksctp-developers@lists.sourceforge.net>
33 * 33 *
34 * Or submit a bug report through the followin 34 * Or submit a bug report through the following website:
35 * http://www.sf.net/projects/lksctp 35 * http://www.sf.net/projects/lksctp
36 * 36 *
37 * Written or modified by: 37 * Written or modified by:
38 * La Monte H.P. Yarroll <piggy@acm.org> 38 * La Monte H.P. Yarroll <piggy@acm.org>
39 * Karl Knutson <karl@athena.chicago.il.us> 39 * Karl Knutson <karl@athena.chicago.il.us>
40 * Jon Grimm <jgrimm@austin.ibm.com> 40 * Jon Grimm <jgrimm@austin.ibm.com>
41 * Daisy Chang <daisyc@us.ibm.com> 41 * Daisy Chang <daisyc@us.ibm.com>
42 * Dajiang Zhang <dajiang.zhang@nokia.com> 42 * Dajiang Zhang <dajiang.zhang@nokia.com>
43 * 43 *
44 * Any bugs reported given to us we will try t 44 * Any bugs reported given to us we will try to fix... any fixes shared will
45 * be incorporated into the next SCTP release. 45 * be incorporated into the next SCTP release.
46 */ 46 */
47 47
48 #include <linux/types.h> 48 #include <linux/types.h>
49 #include <linux/slab.h> 49 #include <linux/slab.h>
50 #include <linux/in.h> 50 #include <linux/in.h>
51 #include <linux/random.h> /* get_random_ 51 #include <linux/random.h> /* get_random_bytes() */
52 #include <linux/crypto.h> 52 #include <linux/crypto.h>
53 #include <net/sock.h> 53 #include <net/sock.h>
54 #include <net/ipv6.h> 54 #include <net/ipv6.h>
55 #include <net/sctp/sctp.h> 55 #include <net/sctp/sctp.h>
56 #include <net/sctp/sm.h> 56 #include <net/sctp/sm.h>
57 57
58 /* Forward declarations for internal helpers. 58 /* Forward declarations for internal helpers. */
59 static void sctp_endpoint_bh_rcv(struct work_s 59 static void sctp_endpoint_bh_rcv(struct work_struct *work);
60 60
61 /* 61 /*
62 * Initialize the base fields of the endpoint 62 * Initialize the base fields of the endpoint structure.
63 */ 63 */
64 static struct sctp_endpoint *sctp_endpoint_ini 64 static struct sctp_endpoint *sctp_endpoint_init(struct sctp_endpoint *ep,
65 65 struct sock *sk,
66 66 gfp_t gfp)
67 { 67 {
68 struct sctp_hmac_algo_param *auth_hmac 68 struct sctp_hmac_algo_param *auth_hmacs = NULL;
69 struct sctp_chunks_param *auth_chunks 69 struct sctp_chunks_param *auth_chunks = NULL;
70 struct sctp_shared_key *null_key; 70 struct sctp_shared_key *null_key;
71 int err; 71 int err;
72 72
73 memset(ep, 0, sizeof(struct sctp_endpo 73 memset(ep, 0, sizeof(struct sctp_endpoint));
74 74
75 ep->digest = kzalloc(SCTP_SIGNATURE_SI 75 ep->digest = kzalloc(SCTP_SIGNATURE_SIZE, gfp);
76 if (!ep->digest) 76 if (!ep->digest)
77 return NULL; 77 return NULL;
78 78
79 if (sctp_auth_enable) { 79 if (sctp_auth_enable) {
80 /* Allocate space for HMACS an 80 /* Allocate space for HMACS and CHUNKS authentication
81 * variables. There are array 81 * variables. There are arrays that we encode directly
82 * into parameters to make the 82 * into parameters to make the rest of the operations easier.
83 */ 83 */
84 auth_hmacs = kzalloc(sizeof(sc 84 auth_hmacs = kzalloc(sizeof(sctp_hmac_algo_param_t) +
85 sizeof(__u16) 85 sizeof(__u16) * SCTP_AUTH_NUM_HMACS, gfp);
86 if (!auth_hmacs) 86 if (!auth_hmacs)
87 goto nomem; 87 goto nomem;
88 88
89 auth_chunks = kzalloc(sizeof(s 89 auth_chunks = kzalloc(sizeof(sctp_chunks_param_t) +
90 SCTP_N 90 SCTP_NUM_CHUNK_TYPES, gfp);
91 if (!auth_chunks) 91 if (!auth_chunks)
92 goto nomem; 92 goto nomem;
93 93
94 /* Initialize the HMACS parame 94 /* Initialize the HMACS parameter.
95 * SCTP-AUTH: Section 3.3 95 * SCTP-AUTH: Section 3.3
96 * Every endpoint supportin 96 * Every endpoint supporting SCTP chunk authentication MUST
97 * support the HMAC based o 97 * support the HMAC based on the SHA-1 algorithm.
98 */ 98 */
99 auth_hmacs->param_hdr.type = S 99 auth_hmacs->param_hdr.type = SCTP_PARAM_HMAC_ALGO;
100 auth_hmacs->param_hdr.length = 100 auth_hmacs->param_hdr.length =
101 htons( 101 htons(sizeof(sctp_paramhdr_t) + 2);
102 auth_hmacs->hmac_ids[0] = hton 102 auth_hmacs->hmac_ids[0] = htons(SCTP_AUTH_HMAC_ID_SHA1);
103 103
104 /* Initialize the CHUNKS param 104 /* Initialize the CHUNKS parameter */
105 auth_chunks->param_hdr.type = 105 auth_chunks->param_hdr.type = SCTP_PARAM_CHUNKS;
106 auth_chunks->param_hdr.length <<
107 106
108 /* If the Add-IP functionality 107 /* If the Add-IP functionality is enabled, we must
109 * authenticate, ASCONF and AS 108 * authenticate, ASCONF and ASCONF-ACK chunks
110 */ 109 */
111 if (sctp_addip_enable) { 110 if (sctp_addip_enable) {
112 auth_chunks->chunks[0] 111 auth_chunks->chunks[0] = SCTP_CID_ASCONF;
113 auth_chunks->chunks[1] 112 auth_chunks->chunks[1] = SCTP_CID_ASCONF_ACK;
114 auth_chunks->param_hdr 113 auth_chunks->param_hdr.length =
115 htons( 114 htons(sizeof(sctp_paramhdr_t) + 2);
116 } 115 }
117 } 116 }
118 117
119 /* Initialize the base structure. */ 118 /* Initialize the base structure. */
120 /* What type of endpoint are we? */ 119 /* What type of endpoint are we? */
121 ep->base.type = SCTP_EP_TYPE_SOCKET; 120 ep->base.type = SCTP_EP_TYPE_SOCKET;
122 121
123 /* Initialize the basic object fields. 122 /* Initialize the basic object fields. */
124 atomic_set(&ep->base.refcnt, 1); 123 atomic_set(&ep->base.refcnt, 1);
125 ep->base.dead = 0; 124 ep->base.dead = 0;
126 ep->base.malloced = 1; 125 ep->base.malloced = 1;
127 126
128 /* Create an input queue. */ 127 /* Create an input queue. */
129 sctp_inq_init(&ep->base.inqueue); 128 sctp_inq_init(&ep->base.inqueue);
130 129
131 /* Set its top-half handler */ 130 /* Set its top-half handler */
132 sctp_inq_set_th_handler(&ep->base.inqu 131 sctp_inq_set_th_handler(&ep->base.inqueue, sctp_endpoint_bh_rcv);
133 132
134 /* Initialize the bind addr area */ 133 /* Initialize the bind addr area */
135 sctp_bind_addr_init(&ep->base.bind_add 134 sctp_bind_addr_init(&ep->base.bind_addr, 0);
136 135
137 /* Remember who we are attached to. * 136 /* Remember who we are attached to. */
138 ep->base.sk = sk; 137 ep->base.sk = sk;
139 sock_hold(ep->base.sk); 138 sock_hold(ep->base.sk);
140 139
141 /* Create the lists of associations. 140 /* Create the lists of associations. */
142 INIT_LIST_HEAD(&ep->asocs); 141 INIT_LIST_HEAD(&ep->asocs);
143 142
144 /* Use SCTP specific send buffer space 143 /* Use SCTP specific send buffer space queues. */
145 ep->sndbuf_policy = sctp_sndbuf_policy 144 ep->sndbuf_policy = sctp_sndbuf_policy;
146 145
147 sk->sk_write_space = sctp_write_space; 146 sk->sk_write_space = sctp_write_space;
148 sock_set_flag(sk, SOCK_USE_WRITE_QUEUE 147 sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);
149 148
150 /* Get the receive buffer policy for t 149 /* Get the receive buffer policy for this endpoint */
151 ep->rcvbuf_policy = sctp_rcvbuf_policy 150 ep->rcvbuf_policy = sctp_rcvbuf_policy;
152 151
153 /* Initialize the secret key used with 152 /* Initialize the secret key used with cookie. */
154 get_random_bytes(&ep->secret_key[0], S 153 get_random_bytes(&ep->secret_key[0], SCTP_SECRET_SIZE);
155 ep->last_key = ep->current_key = 0; 154 ep->last_key = ep->current_key = 0;
156 ep->key_changed_at = jiffies; 155 ep->key_changed_at = jiffies;
157 156
158 /* SCTP-AUTH extensions*/ 157 /* SCTP-AUTH extensions*/
159 INIT_LIST_HEAD(&ep->endpoint_shared_ke 158 INIT_LIST_HEAD(&ep->endpoint_shared_keys);
160 null_key = sctp_auth_shkey_create(0, G 159 null_key = sctp_auth_shkey_create(0, GFP_KERNEL);
161 if (!null_key) 160 if (!null_key)
162 goto nomem; 161 goto nomem;
163 162
164 list_add(&null_key->key_list, &ep->end 163 list_add(&null_key->key_list, &ep->endpoint_shared_keys);
165 164
166 /* Allocate and initialize transorms a 165 /* Allocate and initialize transorms arrays for suported HMACs. */
167 err = sctp_auth_init_hmacs(ep, gfp); 166 err = sctp_auth_init_hmacs(ep, gfp);
168 if (err) 167 if (err)
169 goto nomem_hmacs; 168 goto nomem_hmacs;
170 169
171 /* Add the null key to the endpoint sh 170 /* Add the null key to the endpoint shared keys list and
172 * set the hmcas and chunks pointers. 171 * set the hmcas and chunks pointers.
173 */ 172 */
174 ep->auth_hmacs_list = auth_hmacs; 173 ep->auth_hmacs_list = auth_hmacs;
175 ep->auth_chunk_list = auth_chunks; 174 ep->auth_chunk_list = auth_chunks;
176 175
177 return ep; 176 return ep;
178 177
179 nomem_hmacs: 178 nomem_hmacs:
180 sctp_auth_destroy_keys(&ep->endpoint_s 179 sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
181 nomem: 180 nomem:
182 /* Free all allocations */ 181 /* Free all allocations */
183 kfree(auth_hmacs); 182 kfree(auth_hmacs);
184 kfree(auth_chunks); 183 kfree(auth_chunks);
185 kfree(ep->digest); 184 kfree(ep->digest);
186 return NULL; 185 return NULL;
187 186
188 } 187 }
189 188
190 /* Create a sctp_endpoint with all that boring 189 /* Create a sctp_endpoint with all that boring stuff initialized.
191 * Returns NULL if there isn't enough memory. 190 * Returns NULL if there isn't enough memory.
192 */ 191 */
193 struct sctp_endpoint *sctp_endpoint_new(struct 192 struct sctp_endpoint *sctp_endpoint_new(struct sock *sk, gfp_t gfp)
194 { 193 {
195 struct sctp_endpoint *ep; 194 struct sctp_endpoint *ep;
196 195
197 /* Build a local endpoint. */ 196 /* Build a local endpoint. */
198 ep = t_new(struct sctp_endpoint, gfp); 197 ep = t_new(struct sctp_endpoint, gfp);
199 if (!ep) 198 if (!ep)
200 goto fail; 199 goto fail;
201 if (!sctp_endpoint_init(ep, sk, gfp)) 200 if (!sctp_endpoint_init(ep, sk, gfp))
202 goto fail_init; 201 goto fail_init;
203 ep->base.malloced = 1; 202 ep->base.malloced = 1;
204 SCTP_DBG_OBJCNT_INC(ep); 203 SCTP_DBG_OBJCNT_INC(ep);
205 return ep; 204 return ep;
206 205
207 fail_init: 206 fail_init:
208 kfree(ep); 207 kfree(ep);
209 fail: 208 fail:
210 return NULL; 209 return NULL;
211 } 210 }
212 211
213 /* Add an association to an endpoint. */ 212 /* Add an association to an endpoint. */
214 void sctp_endpoint_add_asoc(struct sctp_endpoi 213 void sctp_endpoint_add_asoc(struct sctp_endpoint *ep,
215 struct sctp_associ 214 struct sctp_association *asoc)
216 { 215 {
217 struct sock *sk = ep->base.sk; 216 struct sock *sk = ep->base.sk;
218 217
219 /* If this is a temporary association, 218 /* If this is a temporary association, don't bother
220 * since we'll be removing it shortly 219 * since we'll be removing it shortly and don't
221 * want anyone to find it anyway. 220 * want anyone to find it anyway.
222 */ 221 */
223 if (asoc->temp) 222 if (asoc->temp)
224 return; 223 return;
225 224
226 /* Now just add it to our list of asoc 225 /* Now just add it to our list of asocs */
227 list_add_tail(&asoc->asocs, &ep->asocs 226 list_add_tail(&asoc->asocs, &ep->asocs);
228 227
229 /* Increment the backlog value for a T 228 /* Increment the backlog value for a TCP-style listening socket. */
230 if (sctp_style(sk, TCP) && sctp_sstate 229 if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
231 sk->sk_ack_backlog++; 230 sk->sk_ack_backlog++;
232 } 231 }
233 232
234 /* Free the endpoint structure. Delay cleanup 233 /* Free the endpoint structure. Delay cleanup until
235 * all users have released their reference cou 234 * all users have released their reference count on this structure.
236 */ 235 */
237 void sctp_endpoint_free(struct sctp_endpoint * 236 void sctp_endpoint_free(struct sctp_endpoint *ep)
238 { 237 {
239 ep->base.dead = 1; 238 ep->base.dead = 1;
240 239
241 ep->base.sk->sk_state = SCTP_SS_CLOSED 240 ep->base.sk->sk_state = SCTP_SS_CLOSED;
242 241
243 /* Unlink this endpoint, so we can't f 242 /* Unlink this endpoint, so we can't find it again! */
244 sctp_unhash_endpoint(ep); 243 sctp_unhash_endpoint(ep);
245 244
246 sctp_endpoint_put(ep); 245 sctp_endpoint_put(ep);
247 } 246 }
248 247
249 /* Final destructor for endpoint. */ 248 /* Final destructor for endpoint. */
250 static void sctp_endpoint_destroy(struct sctp_ 249 static void sctp_endpoint_destroy(struct sctp_endpoint *ep)
251 { 250 {
252 SCTP_ASSERT(ep->base.dead, "Endpoint i 251 SCTP_ASSERT(ep->base.dead, "Endpoint is not dead", return);
253 252
254 /* Free up the HMAC transform. */ 253 /* Free up the HMAC transform. */
255 crypto_free_hash(sctp_sk(ep->base.sk)- 254 crypto_free_hash(sctp_sk(ep->base.sk)->hmac);
256 255
257 /* Free the digest buffer */ 256 /* Free the digest buffer */
258 kfree(ep->digest); 257 kfree(ep->digest);
259 258
260 /* SCTP-AUTH: Free up AUTH releated da 259 /* SCTP-AUTH: Free up AUTH releated data such as shared keys
261 * chunks and hmacs arrays that were a 260 * chunks and hmacs arrays that were allocated
262 */ 261 */
263 sctp_auth_destroy_keys(&ep->endpoint_s 262 sctp_auth_destroy_keys(&ep->endpoint_shared_keys);
264 kfree(ep->auth_hmacs_list); 263 kfree(ep->auth_hmacs_list);
265 kfree(ep->auth_chunk_list); 264 kfree(ep->auth_chunk_list);
266 265
267 /* AUTH - Free any allocated HMAC tran 266 /* AUTH - Free any allocated HMAC transform containers */
268 sctp_auth_destroy_hmacs(ep->auth_hmacs 267 sctp_auth_destroy_hmacs(ep->auth_hmacs);
269 268
270 /* Cleanup. */ 269 /* Cleanup. */
271 sctp_inq_free(&ep->base.inqueue); 270 sctp_inq_free(&ep->base.inqueue);
272 sctp_bind_addr_free(&ep->base.bind_add 271 sctp_bind_addr_free(&ep->base.bind_addr);
273 272
274 /* Remove and free the port */ 273 /* Remove and free the port */
275 if (sctp_sk(ep->base.sk)->bind_hash) 274 if (sctp_sk(ep->base.sk)->bind_hash)
276 sctp_put_port(ep->base.sk); 275 sctp_put_port(ep->base.sk);
277 276
278 /* Give up our hold on the sock. */ 277 /* Give up our hold on the sock. */
279 if (ep->base.sk) 278 if (ep->base.sk)
280 sock_put(ep->base.sk); 279 sock_put(ep->base.sk);
281 280
282 /* Finally, free up our memory. */ 281 /* Finally, free up our memory. */
283 if (ep->base.malloced) { 282 if (ep->base.malloced) {
284 kfree(ep); 283 kfree(ep);
285 SCTP_DBG_OBJCNT_DEC(ep); 284 SCTP_DBG_OBJCNT_DEC(ep);
286 } 285 }
287 } 286 }
288 287
289 /* Hold a reference to an endpoint. */ 288 /* Hold a reference to an endpoint. */
290 void sctp_endpoint_hold(struct sctp_endpoint * 289 void sctp_endpoint_hold(struct sctp_endpoint *ep)
291 { 290 {
292 atomic_inc(&ep->base.refcnt); 291 atomic_inc(&ep->base.refcnt);
293 } 292 }
294 293
295 /* Release a reference to an endpoint and clea 294 /* Release a reference to an endpoint and clean up if there are
296 * no more references. 295 * no more references.
297 */ 296 */
298 void sctp_endpoint_put(struct sctp_endpoint *e 297 void sctp_endpoint_put(struct sctp_endpoint *ep)
299 { 298 {
300 if (atomic_dec_and_test(&ep->base.refc 299 if (atomic_dec_and_test(&ep->base.refcnt))
301 sctp_endpoint_destroy(ep); 300 sctp_endpoint_destroy(ep);
302 } 301 }
303 302
304 /* Is this the endpoint we are looking for? * 303 /* Is this the endpoint we are looking for? */
305 struct sctp_endpoint *sctp_endpoint_is_match(s 304 struct sctp_endpoint *sctp_endpoint_is_match(struct sctp_endpoint *ep,
306 305 const union sctp_addr *laddr)
307 { 306 {
308 struct sctp_endpoint *retval = NULL; 307 struct sctp_endpoint *retval = NULL;
309 308
310 if (htons(ep->base.bind_addr.port) == 309 if (htons(ep->base.bind_addr.port) == laddr->v4.sin_port) {
311 if (sctp_bind_addr_match(&ep-> 310 if (sctp_bind_addr_match(&ep->base.bind_addr, laddr,
312 sctp_ 311 sctp_sk(ep->base.sk)))
313 retval = ep; 312 retval = ep;
314 } 313 }
315 314
316 return retval; 315 return retval;
317 } 316 }
318 317
319 /* Find the association that goes with this ch 318 /* Find the association that goes with this chunk.
320 * We do a linear search of the associations f 319 * We do a linear search of the associations for this endpoint.
321 * We return the matching transport address to 320 * We return the matching transport address too.
322 */ 321 */
323 static struct sctp_association *__sctp_endpoin 322 static struct sctp_association *__sctp_endpoint_lookup_assoc(
324 const struct sctp_endpoint *ep, 323 const struct sctp_endpoint *ep,
325 const union sctp_addr *paddr, 324 const union sctp_addr *paddr,
326 struct sctp_transport **transport) 325 struct sctp_transport **transport)
327 { 326 {
328 struct sctp_association *asoc = NULL; 327 struct sctp_association *asoc = NULL;
329 struct sctp_transport *t = NULL; 328 struct sctp_transport *t = NULL;
330 struct sctp_hashbucket *head; 329 struct sctp_hashbucket *head;
331 struct sctp_ep_common *epb; 330 struct sctp_ep_common *epb;
332 struct hlist_node *node; 331 struct hlist_node *node;
333 int hash; 332 int hash;
334 int rport; 333 int rport;
335 334
336 *transport = NULL; 335 *transport = NULL;
337 rport = ntohs(paddr->v4.sin_port); 336 rport = ntohs(paddr->v4.sin_port);
338 337
339 hash = sctp_assoc_hashfn(ep->base.bind 338 hash = sctp_assoc_hashfn(ep->base.bind_addr.port, rport);
340 head = &sctp_assoc_hashtable[hash]; 339 head = &sctp_assoc_hashtable[hash];
341 read_lock(&head->lock); 340 read_lock(&head->lock);
342 sctp_for_each_hentry(epb, node, &head- 341 sctp_for_each_hentry(epb, node, &head->chain) {
343 asoc = sctp_assoc(epb); 342 asoc = sctp_assoc(epb);
344 if (asoc->ep != ep || rport != 343 if (asoc->ep != ep || rport != asoc->peer.port)
345 goto next; 344 goto next;
346 345
347 t = sctp_assoc_lookup_paddr(as 346 t = sctp_assoc_lookup_paddr(asoc, paddr);
348 if (t) { 347 if (t) {
349 *transport = t; 348 *transport = t;
350 break; 349 break;
351 } 350 }
352 next: 351 next:
353 asoc = NULL; 352 asoc = NULL;
354 } 353 }
355 read_unlock(&head->lock); 354 read_unlock(&head->lock);
356 return asoc; 355 return asoc;
357 } 356 }
358 357
359 /* Lookup association on an endpoint based on 358 /* Lookup association on an endpoint based on a peer address. BH-safe. */
360 struct sctp_association *sctp_endpoint_lookup_ 359 struct sctp_association *sctp_endpoint_lookup_assoc(
361 const struct sctp_endpoint *ep, 360 const struct sctp_endpoint *ep,
362 const union sctp_addr *paddr, 361 const union sctp_addr *paddr,
363 struct sctp_transport **transport) 362 struct sctp_transport **transport)
364 { 363 {
365 struct sctp_association *asoc; 364 struct sctp_association *asoc;
366 365
367 sctp_local_bh_disable(); 366 sctp_local_bh_disable();
368 asoc = __sctp_endpoint_lookup_assoc(ep 367 asoc = __sctp_endpoint_lookup_assoc(ep, paddr, transport);
369 sctp_local_bh_enable(); 368 sctp_local_bh_enable();
370 369
371 return asoc; 370 return asoc;
372 } 371 }
373 372
374 /* Look for any peeled off association from th 373 /* Look for any peeled off association from the endpoint that matches the
375 * given peer address. 374 * given peer address.
376 */ 375 */
377 int sctp_endpoint_is_peeled_off(struct sctp_en 376 int sctp_endpoint_is_peeled_off(struct sctp_endpoint *ep,
378 const union sc 377 const union sctp_addr *paddr)
379 { 378 {
380 struct sctp_sockaddr_entry *addr; 379 struct sctp_sockaddr_entry *addr;
381 struct sctp_bind_addr *bp; 380 struct sctp_bind_addr *bp;
382 381
383 bp = &ep->base.bind_addr; 382 bp = &ep->base.bind_addr;
384 /* This function is called with the so 383 /* This function is called with the socket lock held,
385 * so the address_list can not change. 384 * so the address_list can not change.
386 */ 385 */
387 list_for_each_entry(addr, &bp->address 386 list_for_each_entry(addr, &bp->address_list, list) {
388 if (sctp_has_association(&addr 387 if (sctp_has_association(&addr->a, paddr))
389 return 1; 388 return 1;
390 } 389 }
391 390
392 return 0; 391 return 0;
393 } 392 }
394 393
395 /* Do delayed input processing. This is sched 394 /* Do delayed input processing. This is scheduled by sctp_rcv().
396 * This may be called on BH or task time. 395 * This may be called on BH or task time.
397 */ 396 */
398 static void sctp_endpoint_bh_rcv(struct work_s 397 static void sctp_endpoint_bh_rcv(struct work_struct *work)
399 { 398 {
400 struct sctp_endpoint *ep = 399 struct sctp_endpoint *ep =
401 container_of(work, struct sctp 400 container_of(work, struct sctp_endpoint,
402 base.inqueue.imme 401 base.inqueue.immediate);
403 struct sctp_association *asoc; 402 struct sctp_association *asoc;
404 struct sock *sk; 403 struct sock *sk;
405 struct sctp_transport *transport; 404 struct sctp_transport *transport;
406 struct sctp_chunk *chunk; 405 struct sctp_chunk *chunk;
407 struct sctp_inq *inqueue; 406 struct sctp_inq *inqueue;
408 sctp_subtype_t subtype; 407 sctp_subtype_t subtype;
409 sctp_state_t state; 408 sctp_state_t state;
410 int error = 0; 409 int error = 0;
411 int first_time = 1; /* is this the 410 int first_time = 1; /* is this the first time through the looop */
412 411
413 if (ep->base.dead) 412 if (ep->base.dead)
414 return; 413 return;
415 414
416 asoc = NULL; 415 asoc = NULL;
417 inqueue = &ep->base.inqueue; 416 inqueue = &ep->base.inqueue;
418 sk = ep->base.sk; 417 sk = ep->base.sk;
419 418
420 while (NULL != (chunk = sctp_inq_pop(i 419 while (NULL != (chunk = sctp_inq_pop(inqueue))) {
421 subtype = SCTP_ST_CHUNK(chunk- 420 subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
422 421
423 /* If the first chunk in the p 422 /* If the first chunk in the packet is AUTH, do special
424 * processing specified in Sec 423 * processing specified in Section 6.3 of SCTP-AUTH spec
425 */ 424 */
426 if (first_time && (subtype.chu 425 if (first_time && (subtype.chunk == SCTP_CID_AUTH)) {
427 struct sctp_chunkhdr * 426 struct sctp_chunkhdr *next_hdr;
428 427
429 next_hdr = sctp_inq_pe 428 next_hdr = sctp_inq_peek(inqueue);
430 if (!next_hdr) 429 if (!next_hdr)
431 goto normal; 430 goto normal;
432 431
433 /* If the next chunk i 432 /* If the next chunk is COOKIE-ECHO, skip the AUTH
434 * chunk while saving 433 * chunk while saving a pointer to it so we can do
435 * Authentication late 434 * Authentication later (during cookie-echo
436 * processing). 435 * processing).
437 */ 436 */
438 if (next_hdr->type == 437 if (next_hdr->type == SCTP_CID_COOKIE_ECHO) {
439 chunk->auth_ch 438 chunk->auth_chunk = skb_clone(chunk->skb,
440 439 GFP_ATOMIC);
441 chunk->auth = 440 chunk->auth = 1;
442 continue; 441 continue;
443 } 442 }
444 } 443 }
445 normal: 444 normal:
446 /* We might have grown an asso 445 /* We might have grown an association since last we
447 * looked, so try again. 446 * looked, so try again.
448 * 447 *
449 * This happens when we've jus 448 * This happens when we've just processed our
450 * COOKIE-ECHO chunk. 449 * COOKIE-ECHO chunk.
451 */ 450 */
452 if (NULL == chunk->asoc) { 451 if (NULL == chunk->asoc) {
453 asoc = sctp_endpoint_l 452 asoc = sctp_endpoint_lookup_assoc(ep,
454 453 sctp_source(chunk),
455 454 &transport);
456 chunk->asoc = asoc; 455 chunk->asoc = asoc;
457 chunk->transport = tra 456 chunk->transport = transport;
458 } 457 }
459 458
460 state = asoc ? asoc->state : S 459 state = asoc ? asoc->state : SCTP_STATE_CLOSED;
461 if (sctp_auth_recv_cid(subtype 460 if (sctp_auth_recv_cid(subtype.chunk, asoc) && !chunk->auth)
462 continue; 461 continue;
463 462
464 /* Remember where the last DAT 463 /* Remember where the last DATA chunk came from so we
465 * know where to send the SACK 464 * know where to send the SACK.
466 */ 465 */
467 if (asoc && sctp_chunk_is_data 466 if (asoc && sctp_chunk_is_data(chunk))
468 asoc->peer.last_data_f 467 asoc->peer.last_data_from = chunk->transport;
469 else 468 else
470 SCTP_INC_STATS(SCTP_MI 469 SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
471 470
472 if (chunk->transport) 471 if (chunk->transport)
473 chunk->transport->last 472 chunk->transport->last_time_heard = jiffies;
474 473
475 error = sctp_do_sm(SCTP_EVENT_ 474 error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, state,
476 ep, asoc, c 475 ep, asoc, chunk, GFP_ATOMIC);
477 476
478 if (error && chunk) 477 if (error && chunk)
479 chunk->pdiscard = 1; 478 chunk->pdiscard = 1;
480 479
481 /* Check to see if the endpoin 480 /* Check to see if the endpoint is freed in response to
482 * the incoming chunk. If so, 481 * the incoming chunk. If so, get out of the while loop.
483 */ 482 */
484 if (!sctp_sk(sk)->ep) 483 if (!sctp_sk(sk)->ep)
485 break; 484 break;
486 485
487 if (first_time) 486 if (first_time)
488 first_time = 0; 487 first_time = 0;
489 } 488 }
490 } 489 }
491 490
|
This page was automatically generated by the
LXR engine.
|