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