[net-next-2.6.git] / net / sctp / endpointola.c

/* SCTP kernel reference Implementation
 * Copyright (c) 1999-2000 Cisco, Inc.
 * Copyright (c) 1999-2001 Motorola, Inc.
 * Copyright (c) 2001-2002 International Business Machines, Corp.
 * Copyright (c) 2001 Intel Corp.
 * Copyright (c) 2001 Nokia, Inc.
 * Copyright (c) 2001 La Monte H.P. Yarroll
 *
 * This file is part of the SCTP kernel reference Implementation
 *
 * This abstraction represents an SCTP endpoint.
 *
 * This file is part of the implementation of the add-IP extension,
 * based on <draft-ietf-tsvwg-addip-sctp-02.txt> June 29, 2001,
 * for the SCTP kernel reference Implementation.
 *
 * The SCTP reference implementation is free software;
 * you can redistribute it and/or modify it under the terms of
 * the GNU General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 *
 * The SCTP reference implementation is distributed in the hope that it
 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
 *                 ************************
 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with GNU CC; see the file COPYING.  If not, write to
 * the Free Software Foundation, 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 *
 * Please send any bug reports or fixes you make to the
 * email address(es):
 *    lksctp developers <lksctp-developers@lists.sourceforge.net>
 *
 * Or submit a bug report through the following website:
 *    http://www.sf.net/projects/lksctp
 *
 * Written or modified by:
 *    La Monte H.P. Yarroll <piggy@acm.org>
 *    Karl Knutson <karl@athena.chicago.il.us>
 *    Jon Grimm <jgrimm@austin.ibm.com>
 *    Daisy Chang <daisyc@us.ibm.com>
 *    Dajiang Zhang <dajiang.zhang@nokia.com>
 *
 * Any bugs reported given to us we will try to fix... any fixes shared will
 * be incorporated into the next SCTP release.
 */

#include <linux/types.h>
#include <linux/sched.h>
#include <linux/slab.h>
#include <linux/in.h>
#include <linux/random.h>	/* get_random_bytes() */
#include <linux/crypto.h>
#include <net/sock.h>
#include <net/ipv6.h>
#include <net/sctp/sctp.h>
#include <net/sctp/sm.h>

/* Forward declarations for internal helpers. */
static void sctp_endpoint_bh_rcv(struct work_struct *work);

/*
 * Initialize the base fields of the endpoint structure.
 */
static struct sctp_endpoint *sctp_endpoint_init(struct sctp_endpoint *ep,
						struct sock *sk,
						gfp_t gfp)
{
	memset(ep, 0, sizeof(struct sctp_endpoint));

	/* Initialize the base structure. */
	/* What type of endpoint are we?  */
	ep->base.type = SCTP_EP_TYPE_SOCKET;

	/* Initialize the basic object fields. */
	atomic_set(&ep->base.refcnt, 1);
	ep->base.dead = 0;
	ep->base.malloced = 1;

	/* Create an input queue.  */
	sctp_inq_init(&ep->base.inqueue);

	/* Set its top-half handler */
	sctp_inq_set_th_handler(&ep->base.inqueue, sctp_endpoint_bh_rcv);

	/* Initialize the bind addr area */
	sctp_bind_addr_init(&ep->base.bind_addr, 0);
	rwlock_init(&ep->base.addr_lock);

	/* Remember who we are attached to.  */
	ep->base.sk = sk;
	sock_hold(ep->base.sk);

	/* Create the lists of associations.  */
	INIT_LIST_HEAD(&ep->asocs);

	/* Use SCTP specific send buffer space queues.  */
	ep->sndbuf_policy = sctp_sndbuf_policy;
	sk->sk_write_space = sctp_write_space;
	sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);

	/* Get the receive buffer policy for this endpoint */
	ep->rcvbuf_policy = sctp_rcvbuf_policy;

	/* Initialize the secret key used with cookie. */
	get_random_bytes(&ep->secret_key[0], SCTP_SECRET_SIZE);
	ep->last_key = ep->current_key = 0;
	ep->key_changed_at = jiffies;

	return ep;
}

/* Create a sctp_endpoint with all that boring stuff initialized.
 * Returns NULL if there isn't enough memory.
 */
struct sctp_endpoint *sctp_endpoint_new(struct sock *sk, gfp_t gfp)
{
	struct sctp_endpoint *ep;

	/* Build a local endpoint. */
	ep = t_new(struct sctp_endpoint, gfp);
	if (!ep)
		goto fail;
	if (!sctp_endpoint_init(ep, sk, gfp))
		goto fail_init;
	ep->base.malloced = 1;
	SCTP_DBG_OBJCNT_INC(ep);
	return ep;

fail_init:
	kfree(ep);
fail:
	return NULL;
}

/* Add an association to an endpoint.  */
void sctp_endpoint_add_asoc(struct sctp_endpoint *ep,
			    struct sctp_association *asoc)
{
	struct sock *sk = ep->base.sk;

	/* If this is a temporary association, don't bother
	 * since we'll be removing it shortly and don't
	 * want anyone to find it anyway.
	 */
	if (asoc->temp)
		return;

	/* Now just add it to our list of asocs */
	list_add_tail(&asoc->asocs, &ep->asocs);

	/* Increment the backlog value for a TCP-style listening socket. */
	if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
		sk->sk_ack_backlog++;
}

/* Free the endpoint structure.  Delay cleanup until
 * all users have released their reference count on this structure.
 */
void sctp_endpoint_free(struct sctp_endpoint *ep)
{
	ep->base.dead = 1;

	ep->base.sk->sk_state = SCTP_SS_CLOSED;

	/* Unlink this endpoint, so we can't find it again! */
	sctp_unhash_endpoint(ep);

	sctp_endpoint_put(ep);
}

/* Final destructor for endpoint.  */
static void sctp_endpoint_destroy(struct sctp_endpoint *ep)
{
	SCTP_ASSERT(ep->base.dead, "Endpoint is not dead", return);

	/* Free up the HMAC transform. */
	crypto_free_hash(sctp_sk(ep->base.sk)->hmac);

	/* Cleanup. */
	sctp_inq_free(&ep->base.inqueue);
	sctp_bind_addr_free(&ep->base.bind_addr);

	/* Remove and free the port */
	if (sctp_sk(ep->base.sk)->bind_hash)
		sctp_put_port(ep->base.sk);

	/* Give up our hold on the sock. */
	if (ep->base.sk)
		sock_put(ep->base.sk);

	/* Finally, free up our memory. */
	if (ep->base.malloced) {
		kfree(ep);
		SCTP_DBG_OBJCNT_DEC(ep);
	}
}

/* Hold a reference to an endpoint. */
void sctp_endpoint_hold(struct sctp_endpoint *ep)
{
	atomic_inc(&ep->base.refcnt);
}

/* Release a reference to an endpoint and clean up if there are
 * no more references.
 */
void sctp_endpoint_put(struct sctp_endpoint *ep)
{
	if (atomic_dec_and_test(&ep->base.refcnt))
		sctp_endpoint_destroy(ep);
}

/* Is this the endpoint we are looking for?  */
struct sctp_endpoint *sctp_endpoint_is_match(struct sctp_endpoint *ep,
					       const union sctp_addr *laddr)
{
	struct sctp_endpoint *retval;

	sctp_read_lock(&ep->base.addr_lock);
	if (ep->base.bind_addr.port == laddr->v4.sin_port) {
		if (sctp_bind_addr_match(&ep->base.bind_addr, laddr,
					 sctp_sk(ep->base.sk))) {
			retval = ep;
			goto out;
		}
	}

	retval = NULL;

out:
	sctp_read_unlock(&ep->base.addr_lock);
	return retval;
}

/* Find the association that goes with this chunk.
 * We do a linear search of the associations for this endpoint.
 * We return the matching transport address too.
 */
static struct sctp_association *__sctp_endpoint_lookup_assoc(
	const struct sctp_endpoint *ep,
	const union sctp_addr *paddr,
	struct sctp_transport **transport)
{
	int rport;
	struct sctp_association *asoc;
	struct list_head *pos;

	rport = paddr->v4.sin_port;

	list_for_each(pos, &ep->asocs) {
		asoc = list_entry(pos, struct sctp_association, asocs);
		if (rport == asoc->peer.port) {
			sctp_read_lock(&asoc->base.addr_lock);
			*transport = sctp_assoc_lookup_paddr(asoc, paddr);
			sctp_read_unlock(&asoc->base.addr_lock);

			if (*transport)
				return asoc;
		}
	}

	*transport = NULL;
	return NULL;
}

/* Lookup association on an endpoint based on a peer address.  BH-safe.  */
struct sctp_association *sctp_endpoint_lookup_assoc(
	const struct sctp_endpoint *ep,
	const union sctp_addr *paddr,
	struct sctp_transport **transport)
{
	struct sctp_association *asoc;

	sctp_local_bh_disable();
	asoc = __sctp_endpoint_lookup_assoc(ep, paddr, transport);
	sctp_local_bh_enable();

	return asoc;
}

/* Look for any peeled off association from the endpoint that matches the
 * given peer address.
 */
int sctp_endpoint_is_peeled_off(struct sctp_endpoint *ep,
				const union sctp_addr *paddr)
{
	struct list_head *pos;
	struct sctp_sockaddr_entry *addr;
	struct sctp_bind_addr *bp;

	sctp_read_lock(&ep->base.addr_lock);
	bp = &ep->base.bind_addr;
	list_for_each(pos, &bp->address_list) {
		addr = list_entry(pos, struct sctp_sockaddr_entry, list);
		if (sctp_has_association(&addr->a, paddr)) {
			sctp_read_unlock(&ep->base.addr_lock);
			return 1;
		}
	}
	sctp_read_unlock(&ep->base.addr_lock);

	return 0;
}

/* Do delayed input processing.  This is scheduled by sctp_rcv().
 * This may be called on BH or task time.
 */
static void sctp_endpoint_bh_rcv(struct work_struct *work)
{
	struct sctp_endpoint *ep =
		container_of(work, struct sctp_endpoint,
			     base.inqueue.immediate);
	struct sctp_association *asoc;
	struct sock *sk;
	struct sctp_transport *transport;
	struct sctp_chunk *chunk;
	struct sctp_inq *inqueue;
	sctp_subtype_t subtype;
	sctp_state_t state;
	int error = 0;

	if (ep->base.dead)
		return;

	asoc = NULL;
	inqueue = &ep->base.inqueue;
	sk = ep->base.sk;

	while (NULL != (chunk = sctp_inq_pop(inqueue))) {
		subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);

		/* We might have grown an association since last we
		 * looked, so try again.
		 *
		 * This happens when we've just processed our
		 * COOKIE-ECHO chunk.
		 */
		if (NULL == chunk->asoc) {
			asoc = sctp_endpoint_lookup_assoc(ep,
							  sctp_source(chunk),
							  &transport);
			chunk->asoc = asoc;
			chunk->transport = transport;
		}

		state = asoc ? asoc->state : SCTP_STATE_CLOSED;

		/* Remember where the last DATA chunk came from so we
		 * know where to send the SACK.
		 */
		if (asoc && sctp_chunk_is_data(chunk))
			asoc->peer.last_data_from = chunk->transport;
		else
			SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);

		if (chunk->transport)
			chunk->transport->last_time_heard = jiffies;

		error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, state,
                                   ep, asoc, chunk, GFP_ATOMIC);

		if (error && chunk)
			chunk->pdiscard = 1;

		/* Check to see if the endpoint is freed in response to
		 * the incoming chunk. If so, get out of the while loop.
		 */
		if (!sctp_sk(sk)->ep)
			break;
	}
}
Commit	Line	Data
1da177e4 LT	1	/* SCTP kernel reference 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 reference Implementation
	10	*
	11	* This abstraction represents an SCTP endpoint.
	12	*
	13	* This file is part of the implementation of the add-IP extension,
	14	* based on <draft-ietf-tsvwg-addip-sctp-02.txt> June 29, 2001,
	15	* for the SCTP kernel reference Implementation.
	16	*
	17	* The SCTP reference implementation is free software;
	18	* you can redistribute it and/or modify it under the terms of
	19	* the GNU General Public License as published by
	20	* the Free Software Foundation; either version 2, or (at your option)
	21	* any later version.
	22	*
	23	* The SCTP reference implementation is distributed in the hope that it
	24	* will be useful, but WITHOUT ANY WARRANTY; without even the implied
	25	* ************************
	26	* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
	27	* See the GNU General Public License for more details.
	28	*
	29	* You should have received a copy of the GNU General Public License
	30	* along with GNU CC; see the file COPYING. If not, write to
	31	* the Free Software Foundation, 59 Temple Place - Suite 330,
	32	* Boston, MA 02111-1307, USA.
	33	*
	34	* Please send any bug reports or fixes you make to the
	35	* email address(es):
	36	* lksctp developers <lksctp-developers@lists.sourceforge.net>
	37	*
	38	* Or submit a bug report through the following website:
	39	* http://www.sf.net/projects/lksctp
	40	*
	41	* Written or modified by:
	42	* La Monte H.P. Yarroll <piggy@acm.org>
	43	* Karl Knutson <karl@athena.chicago.il.us>
	44	* Jon Grimm <jgrimm@austin.ibm.com>
	45	* Daisy Chang <daisyc@us.ibm.com>
	46	* Dajiang Zhang <dajiang.zhang@nokia.com>
	47	*
	48	* Any bugs reported given to us we will try to fix... any fixes shared will
	49	* be incorporated into the next SCTP release.
	50	*/
	51
	52	#include <linux/types.h>
	53	#include <linux/sched.h>
	54	#include <linux/slab.h>
	55	#include <linux/in.h>
	56	#include <linux/random.h> /* get_random_bytes() */
	57	#include <linux/crypto.h>
	58	#include <net/sock.h>
	59	#include <net/ipv6.h>
	60	#include <net/sctp/sctp.h>
	61	#include <net/sctp/sm.h>
	62
	63	/* Forward declarations for internal helpers. */
c4028958	64	static void sctp_endpoint_bh_rcv(struct work_struct *work);
1da177e4 LT	65
	66	/*
	67	* Initialize the base fields of the endpoint structure.
	68	*/
	69	static struct sctp_endpoint sctp_endpoint_init(struct sctp_endpoint ep,
3182cd84	70	struct sock *sk,
dd0fc66f	71	gfp_t gfp)
1da177e4	72	{
1da177e4 LT	73	memset(ep, 0, sizeof(struct sctp_endpoint));
	74
	75	/* Initialize the base structure. */
	76	/* What type of endpoint are we? */
	77	ep->base.type = SCTP_EP_TYPE_SOCKET;
	78
	79	/* Initialize the basic object fields. */
	80	atomic_set(&ep->base.refcnt, 1);
	81	ep->base.dead = 0;
	82	ep->base.malloced = 1;
	83
	84	/* Create an input queue. */
	85	sctp_inq_init(&ep->base.inqueue);
	86
	87	/* Set its top-half handler */
c4028958	88	sctp_inq_set_th_handler(&ep->base.inqueue, sctp_endpoint_bh_rcv);
1da177e4 LT	89
	90	/* Initialize the bind addr area */
	91	sctp_bind_addr_init(&ep->base.bind_addr, 0);
	92	rwlock_init(&ep->base.addr_lock);
	93
	94	/* Remember who we are attached to. */
	95	ep->base.sk = sk;
	96	sock_hold(ep->base.sk);
	97
	98	/* Create the lists of associations. */
	99	INIT_LIST_HEAD(&ep->asocs);
	100
1da177e4	101	/* Use SCTP specific send buffer space queues. */
4eb701df	102	ep->sndbuf_policy = sctp_sndbuf_policy;
1da177e4 LT	103	sk->sk_write_space = sctp_write_space;
	104	sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);
	105
049b3ff5 NH	106	/* Get the receive buffer policy for this endpoint */
	107	ep->rcvbuf_policy = sctp_rcvbuf_policy;
	108
1da177e4 LT	109	/* Initialize the secret key used with cookie. */
	110	get_random_bytes(&ep->secret_key[0], SCTP_SECRET_SIZE);
	111	ep->last_key = ep->current_key = 0;
	112	ep->key_changed_at = jiffies;
	113
1da177e4 LT	114	return ep;
	115	}
	116
	117	/* Create a sctp_endpoint with all that boring stuff initialized.
	118	* Returns NULL if there isn't enough memory.
	119	*/
dd0fc66f	120	struct sctp_endpoint sctp_endpoint_new(struct sock sk, gfp_t gfp)
1da177e4 LT	121	{
	122	struct sctp_endpoint *ep;
	123
	124	/* Build a local endpoint. */
	125	ep = t_new(struct sctp_endpoint, gfp);
	126	if (!ep)
	127	goto fail;
	128	if (!sctp_endpoint_init(ep, sk, gfp))
	129	goto fail_init;
	130	ep->base.malloced = 1;
	131	SCTP_DBG_OBJCNT_INC(ep);
	132	return ep;
	133
	134	fail_init:
	135	kfree(ep);
	136	fail:
	137	return NULL;
	138	}
	139
	140	/* Add an association to an endpoint. */
	141	void sctp_endpoint_add_asoc(struct sctp_endpoint *ep,
	142	struct sctp_association *asoc)
	143	{
	144	struct sock *sk = ep->base.sk;
	145
de76e695 VY	146	/* If this is a temporary association, don't bother
	147	* since we'll be removing it shortly and don't
	148	* want anyone to find it anyway.
	149	*/
	150	if (asoc->temp)
	151	return;
	152
1da177e4 LT	153	/* Now just add it to our list of asocs */
	154	list_add_tail(&asoc->asocs, &ep->asocs);
	155
	156	/* Increment the backlog value for a TCP-style listening socket. */
	157	if (sctp_style(sk, TCP) && sctp_sstate(sk, LISTENING))
	158	sk->sk_ack_backlog++;
	159	}
	160
	161	/* Free the endpoint structure. Delay cleanup until
	162	* all users have released their reference count on this structure.
	163	*/
	164	void sctp_endpoint_free(struct sctp_endpoint *ep)
	165	{
	166	ep->base.dead = 1;
cfdeef32 VY	167
	168	ep->base.sk->sk_state = SCTP_SS_CLOSED;
	169
	170	/* Unlink this endpoint, so we can't find it again! */
	171	sctp_unhash_endpoint(ep);
	172
1da177e4 LT	173	sctp_endpoint_put(ep);
	174	}
	175
	176	/* Final destructor for endpoint. */
	177	static void sctp_endpoint_destroy(struct sctp_endpoint *ep)
	178	{
	179	SCTP_ASSERT(ep->base.dead, "Endpoint is not dead", return);
	180
1da177e4	181	/* Free up the HMAC transform. */
1b489e11	182	crypto_free_hash(sctp_sk(ep->base.sk)->hmac);
1da177e4 LT	183
	184	/* Cleanup. */
	185	sctp_inq_free(&ep->base.inqueue);
	186	sctp_bind_addr_free(&ep->base.bind_addr);
	187
	188	/* Remove and free the port */
	189	if (sctp_sk(ep->base.sk)->bind_hash)
	190	sctp_put_port(ep->base.sk);
	191
	192	/* Give up our hold on the sock. */
	193	if (ep->base.sk)
	194	sock_put(ep->base.sk);
	195
	196	/* Finally, free up our memory. */
	197	if (ep->base.malloced) {
	198	kfree(ep);
	199	SCTP_DBG_OBJCNT_DEC(ep);
	200	}
	201	}
	202
	203	/* Hold a reference to an endpoint. */
	204	void sctp_endpoint_hold(struct sctp_endpoint *ep)
	205	{
	206	atomic_inc(&ep->base.refcnt);
	207	}
	208
	209	/* Release a reference to an endpoint and clean up if there are
	210	* no more references.
	211	*/
	212	void sctp_endpoint_put(struct sctp_endpoint *ep)
	213	{
	214	if (atomic_dec_and_test(&ep->base.refcnt))
	215	sctp_endpoint_destroy(ep);
	216	}
	217
	218	/* Is this the endpoint we are looking for? */
	219	struct sctp_endpoint sctp_endpoint_is_match(struct sctp_endpoint ep,
	220	const union sctp_addr *laddr)
	221	{
	222	struct sctp_endpoint *retval;
	223
	224	sctp_read_lock(&ep->base.addr_lock);
	225	if (ep->base.bind_addr.port == laddr->v4.sin_port) {
	226	if (sctp_bind_addr_match(&ep->base.bind_addr, laddr,
	227	sctp_sk(ep->base.sk))) {
	228	retval = ep;
	229	goto out;
	230	}
	231	}
	232
	233	retval = NULL;
	234
	235	out:
	236	sctp_read_unlock(&ep->base.addr_lock);
	237	return retval;
	238	}
	239
	240	/* Find the association that goes with this chunk.
	241	* We do a linear search of the associations for this endpoint.
	242	* We return the matching transport address too.
	243	*/
	244	static struct sctp_association *__sctp_endpoint_lookup_assoc(
	245	const struct sctp_endpoint *ep,
	246	const union sctp_addr *paddr,
247	struct sctp_transport **transport)
248	{
249	int rport;
250	struct sctp_association *asoc;
251	struct list_head *pos;
252
253	rport = paddr->v4.sin_port;
254
255	list_for_each(pos, &ep->asocs) {
256	asoc = list_entry(pos, struct sctp_association, asocs);
257	if (rport == asoc->peer.port) {
258	sctp_read_lock(&asoc->base.addr_lock);
259	*transport = sctp_assoc_lookup_paddr(asoc, paddr);
260	sctp_read_unlock(&asoc->base.addr_lock);
261
262	if (*transport)
263	return asoc;
264	}
265	}
266
267	*transport = NULL;
268	return NULL;
269	}
270
271	/* Lookup association on an endpoint based on a peer address. BH-safe. */
272	struct sctp_association *sctp_endpoint_lookup_assoc(
273	const struct sctp_endpoint *ep,
274	const union sctp_addr *paddr,
275	struct sctp_transport **transport)
276	{
277	struct sctp_association *asoc;
278
279	sctp_local_bh_disable();
280	asoc = __sctp_endpoint_lookup_assoc(ep, paddr, transport);
281	sctp_local_bh_enable();
282
283	return asoc;
284	}
285
286	/* Look for any peeled off association from the endpoint that matches the
287	* given peer address.
288	*/
289	int sctp_endpoint_is_peeled_off(struct sctp_endpoint *ep,
290	const union sctp_addr *paddr)
291	{
292	struct list_head *pos;
293	struct sctp_sockaddr_entry *addr;
294	struct sctp_bind_addr *bp;
295
296	sctp_read_lock(&ep->base.addr_lock);
297	bp = &ep->base.bind_addr;
298	list_for_each(pos, &bp->address_list) {
299	addr = list_entry(pos, struct sctp_sockaddr_entry, list);
300	if (sctp_has_association(&addr->a, paddr)) {
301	sctp_read_unlock(&ep->base.addr_lock);
302	return 1;
303	}
304	}
305	sctp_read_unlock(&ep->base.addr_lock);
306
307	return 0;
308	}
309
310	/* Do delayed input processing. This is scheduled by sctp_rcv().
311	* This may be called on BH or task time.
312	*/
c4028958	313	static void sctp_endpoint_bh_rcv(struct work_struct *work)
1da177e4	314	{
c4028958 DH	315	struct sctp_endpoint *ep =
	316	container_of(work, struct sctp_endpoint,
	317	base.inqueue.immediate);
1da177e4 LT	318	struct sctp_association *asoc;
	319	struct sock *sk;
	320	struct sctp_transport *transport;
	321	struct sctp_chunk *chunk;
	322	struct sctp_inq *inqueue;
	323	sctp_subtype_t subtype;
	324	sctp_state_t state;
	325	int error = 0;
	326
	327	if (ep->base.dead)
	328	return;
	329
	330	asoc = NULL;
	331	inqueue = &ep->base.inqueue;
	332	sk = ep->base.sk;
	333
	334	while (NULL != (chunk = sctp_inq_pop(inqueue))) {
	335	subtype = SCTP_ST_CHUNK(chunk->chunk_hdr->type);
	336
	337	/* We might have grown an association since last we
	338	* looked, so try again.
	339	*
	340	* This happens when we've just processed our
	341	* COOKIE-ECHO chunk.
	342	*/
	343	if (NULL == chunk->asoc) {
	344	asoc = sctp_endpoint_lookup_assoc(ep,
	345	sctp_source(chunk),
	346	&transport);
	347	chunk->asoc = asoc;
	348	chunk->transport = transport;
	349	}
	350
	351	state = asoc ? asoc->state : SCTP_STATE_CLOSED;
	352
	353	/* Remember where the last DATA chunk came from so we
	354	* know where to send the SACK.
	355	*/
	356	if (asoc && sctp_chunk_is_data(chunk))
	357	asoc->peer.last_data_from = chunk->transport;
	358	else
	359	SCTP_INC_STATS(SCTP_MIB_INCTRLCHUNKS);
	360
	361	if (chunk->transport)
	362	chunk->transport->last_time_heard = jiffies;
	363
	364	error = sctp_do_sm(SCTP_EVENT_T_CHUNK, subtype, state,
	365	ep, asoc, chunk, GFP_ATOMIC);
	366
	367	if (error && chunk)
	368	chunk->pdiscard = 1;
	369
	370	/* Check to see if the endpoint is freed in response to
	371	* the incoming chunk. If so, get out of the while loop.
	372	*/
	373	if (!sctp_sk(sk)->ep)
	374	break;
	375	}
	376	}