2008-11-20 20:24:06 +01:00
|
|
|
/****************************************************************************
|
2008-12-12 19:57:05 +01:00
|
|
|
* net/uip/uip_tcpbacklog.c
|
2008-11-20 20:24:06 +01:00
|
|
|
*
|
2013-03-09 22:12:20 +01:00
|
|
|
* Copyright (C) 2008-2009, 2011-2013 Gregory Nutt. All rights reserved.
|
2012-03-04 00:18:34 +01:00
|
|
|
* Author: Gregory Nutt <gnutt@nuttx.org>
|
2008-11-20 20:24:06 +01:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
* 3. Neither the name NuttX nor the names of its contributors may be
|
|
|
|
* used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
|
|
|
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Included Files
|
|
|
|
****************************************************************************/
|
|
|
|
|
2012-03-04 00:18:34 +01:00
|
|
|
#include <nuttx/net/uip/uipopt.h>
|
2008-11-20 20:24:06 +01:00
|
|
|
#if defined(CONFIG_NET) && defined(CONFIG_NET_TCP) && defined(CONFIG_NET_TCPBACKLOG)
|
|
|
|
|
2009-12-15 15:53:45 +01:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdbool.h>
|
2008-11-20 20:24:06 +01:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <queue.h>
|
|
|
|
#include <debug.h>
|
|
|
|
|
2013-03-09 22:12:20 +01:00
|
|
|
#include <nuttx/kmalloc.h>
|
2012-03-04 00:18:34 +01:00
|
|
|
#include <nuttx/net/uip/uip.h>
|
|
|
|
#include <nuttx/net/uip/uip-tcp.h>
|
2008-11-20 20:24:06 +01:00
|
|
|
|
2008-12-12 19:57:05 +01:00
|
|
|
#include "uip_internal.h"
|
2008-11-20 20:24:06 +01:00
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Private Data
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Private Functions
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Public Functions
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogcreate
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Called from the listen() logic to setup the backlog as specified in the
|
2009-06-15 20:58:22 +02:00
|
|
|
* the listen arguments.
|
2008-11-20 20:24:06 +01:00
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* Called from normal user code. Interrupts may be disabled.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int uip_backlogcreate(FAR struct uip_conn *conn, int nblg)
|
|
|
|
{
|
|
|
|
FAR struct uip_backlog_s *bls = NULL;
|
|
|
|
FAR struct uip_blcontainer_s *blc;
|
2011-03-15 21:26:34 +01:00
|
|
|
uip_lock_t flags;
|
2008-11-20 20:24:06 +01:00
|
|
|
int size;
|
|
|
|
int offset;
|
|
|
|
int i;
|
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nllvdbg("conn=%p nblg=%d\n", conn, nblg);
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
#ifdef CONFIG_DEBUG
|
|
|
|
if (!conn)
|
|
|
|
{
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Then allocate the backlog as requested */
|
|
|
|
|
|
|
|
if (nblg > 0)
|
|
|
|
{
|
|
|
|
/* Align the list of backlog structures to 32-bit boundaries. This
|
|
|
|
* may be excessive on 24-16-bit address machines; and insufficient
|
|
|
|
* on 64-bit address machines -- REVISIT
|
|
|
|
*/
|
|
|
|
|
|
|
|
offset = (sizeof(struct uip_backlog_s) + 3) & ~3;
|
|
|
|
|
|
|
|
/* Then determine the full size of the allocation include the
|
|
|
|
* uip_backlog_s, a pre-allocated array of struct uip_blcontainer_s
|
|
|
|
* and alignement padding
|
|
|
|
*/
|
|
|
|
|
|
|
|
size = offset + nblg * sizeof(struct uip_blcontainer_s);
|
|
|
|
|
|
|
|
/* Then allocate that much */
|
|
|
|
|
2013-03-09 22:12:20 +01:00
|
|
|
bls = (FAR struct uip_backlog_s *)kzalloc(size);
|
2008-11-20 20:24:06 +01:00
|
|
|
if (!bls)
|
|
|
|
{
|
2009-09-15 17:44:14 +02:00
|
|
|
nlldbg("Failed to allocate backlog\n");
|
2008-11-20 20:24:06 +01:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2009-06-25 19:44:35 +02:00
|
|
|
/* Then add all of the pre-allocated containers to the free list */
|
2008-11-20 20:24:06 +01:00
|
|
|
|
2009-12-15 15:53:45 +01:00
|
|
|
blc = (FAR struct uip_blcontainer_s*)(((FAR uint8_t*)bls) + offset);
|
2008-11-20 20:24:06 +01:00
|
|
|
for (i = 0; i < nblg; i++)
|
|
|
|
{
|
2008-11-21 13:47:36 +01:00
|
|
|
sq_addfirst(&blc->bc_node, &bls->bl_free);
|
2013-09-06 19:43:59 +02:00
|
|
|
blc++;
|
2008-11-20 20:24:06 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Destroy any existing backlog (shouldn't be any) */
|
|
|
|
|
2011-03-15 21:26:34 +01:00
|
|
|
flags = uip_lock();
|
2008-11-20 20:24:06 +01:00
|
|
|
uip_backlogdestroy(conn);
|
|
|
|
|
|
|
|
/* Now install the backlog tear-off in the connection. NOTE that bls may
|
|
|
|
* actually be NULL if nblg is <= 0; In that case, we are disabling backlog
|
|
|
|
* support. Since interrupts are disabled, destroying the old backlog and
|
|
|
|
* replace it with the new is an atomic operation
|
|
|
|
*/
|
|
|
|
|
|
|
|
conn->backlog = bls;
|
2011-03-15 21:26:34 +01:00
|
|
|
uip_unlock(flags);
|
2008-11-20 20:24:06 +01:00
|
|
|
return OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogdestroy
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* (1) Called from uip_tcpfree() whenever a connection is freed.
|
|
|
|
* (2) Called from uip_backlogcreate() to destroy any old backlog
|
|
|
|
*
|
|
|
|
* NOTE: This function may re-enter uip_tcpfree when a connection that
|
|
|
|
* is freed that has pending connections.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* The caller has disabled interrupts so that there can be no conflict
|
|
|
|
* with ongoing, interrupt driven activity
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int uip_backlogdestroy(FAR struct uip_conn *conn)
|
|
|
|
{
|
|
|
|
FAR struct uip_backlog_s *blg;
|
|
|
|
FAR struct uip_blcontainer_s *blc;
|
|
|
|
FAR struct uip_conn *blconn;
|
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nllvdbg("conn=%p\n", conn);
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
#ifdef CONFIG_DEBUG
|
|
|
|
if (!conn)
|
|
|
|
{
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Make sure that the connection has a backlog to be destroyed */
|
|
|
|
|
|
|
|
if (conn->backlog)
|
|
|
|
{
|
|
|
|
/* Remove the backlog structure reference from the connection */
|
|
|
|
|
|
|
|
blg = conn->backlog;
|
|
|
|
conn->backlog = NULL;
|
|
|
|
|
|
|
|
/* Handle any pending connections in the backlog */
|
|
|
|
|
2008-11-21 13:47:36 +01:00
|
|
|
while ((blc = (FAR struct uip_blcontainer_s*)sq_remfirst(&blg->bl_pending)) != NULL)
|
2008-11-20 20:24:06 +01:00
|
|
|
{
|
|
|
|
blconn = blc->bc_conn;
|
|
|
|
if (blconn)
|
|
|
|
{
|
|
|
|
/* REVISIT -- such connections really need to be gracefully closed */
|
|
|
|
|
|
|
|
blconn->blparent = NULL;
|
|
|
|
blconn->backlog = NULL;
|
2009-09-16 18:28:53 +02:00
|
|
|
blconn->crefs = 0;
|
2008-11-20 20:24:06 +01:00
|
|
|
uip_tcpfree(blconn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Then free the entire backlog structure */
|
|
|
|
|
2013-04-11 14:54:29 +02:00
|
|
|
kfree(blg);
|
2008-11-20 20:24:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogadd
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Called uip_listen when a new connection is made with a listener socket
|
2009-06-15 20:58:22 +02:00
|
|
|
* but when there is no accept() in place to receive the connection. This
|
2008-11-20 20:24:06 +01:00
|
|
|
* function adds the new connection to the backlog.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* Called from the interrupt level with interrupts disabled
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int uip_backlogadd(FAR struct uip_conn *conn, FAR struct uip_conn *blconn)
|
|
|
|
{
|
|
|
|
FAR struct uip_backlog_s *bls;
|
|
|
|
FAR struct uip_blcontainer_s *blc;
|
|
|
|
int ret = -EINVAL;
|
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nllvdbg("conn=%p blconn=%p\n", conn, blconn);
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
#ifdef CONFIG_DEBUG
|
|
|
|
if (!conn)
|
|
|
|
{
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
bls = conn->backlog;
|
2009-09-16 22:28:30 +02:00
|
|
|
if (bls && blconn)
|
2008-11-20 20:24:06 +01:00
|
|
|
{
|
|
|
|
/* Allocate a container for the connection from the free list */
|
|
|
|
|
2008-11-21 13:47:36 +01:00
|
|
|
blc = (FAR struct uip_blcontainer_s *)sq_remfirst(&bls->bl_free);
|
2008-11-20 20:24:06 +01:00
|
|
|
if (!blc)
|
|
|
|
{
|
2009-09-15 17:44:14 +02:00
|
|
|
nlldbg("Failed to allocate container\n");
|
2008-11-20 20:24:06 +01:00
|
|
|
ret = -ENOMEM;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Save the connection reference in the container and put the
|
|
|
|
* container at the end of the pending connection list (FIFO).
|
|
|
|
*/
|
|
|
|
|
|
|
|
blc->bc_conn = blconn;
|
2008-11-21 13:47:36 +01:00
|
|
|
sq_addlast(&blc->bc_node, &bls->bl_pending);
|
2008-11-20 20:24:06 +01:00
|
|
|
ret = OK;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-09-11 00:55:52 +02:00
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogremove
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Called from poll(). Before waiting for a new connection, poll will
|
|
|
|
* call this API to see if there are pending connections in the backlog.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* Called from normal user code, but with interrupts disabled,
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
#ifndef CONFIG_DISABLE_POLL
|
2009-12-15 15:53:45 +01:00
|
|
|
bool uip_backlogavailable(FAR struct uip_conn *conn)
|
2009-09-11 00:55:52 +02:00
|
|
|
{
|
|
|
|
return (conn && conn->backlog && !sq_empty(&conn->backlog->bl_pending));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogremove
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Called from accept(). Before waiting for a new connection, accept will
|
|
|
|
* call this API to see if there are pending connections in the backlog.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* Called from normal user code, but with interrupts disabled,
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
struct uip_conn *uip_backlogremove(FAR struct uip_conn *conn)
|
|
|
|
{
|
|
|
|
FAR struct uip_backlog_s *bls;
|
|
|
|
FAR struct uip_blcontainer_s *blc;
|
|
|
|
FAR struct uip_conn *blconn = NULL;
|
|
|
|
|
|
|
|
#ifdef CONFIG_DEBUG
|
|
|
|
if (!conn)
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
#endif
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
bls = conn->backlog;
|
2008-11-20 22:50:55 +01:00
|
|
|
if (bls)
|
2008-11-20 20:24:06 +01:00
|
|
|
{
|
|
|
|
/* Remove the a container at the head of the pending connection list
|
|
|
|
* (FIFO)
|
|
|
|
*/
|
|
|
|
|
2008-11-21 13:47:36 +01:00
|
|
|
blc = (FAR struct uip_blcontainer_s *)sq_remfirst(&bls->bl_pending);
|
2008-11-20 20:24:06 +01:00
|
|
|
if (blc)
|
|
|
|
{
|
|
|
|
/* Extract the connection reference from the container and put
|
|
|
|
* container in the free list
|
|
|
|
*/
|
|
|
|
|
|
|
|
blconn = blc->bc_conn;
|
|
|
|
blc->bc_conn = NULL;
|
2008-11-21 13:47:36 +01:00
|
|
|
sq_addlast(&blc->bc_node, &bls->bl_free);
|
2008-11-20 20:24:06 +01:00
|
|
|
}
|
|
|
|
}
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nllvdbg("conn=%p, returning %p\n", conn, blconn);
|
2008-11-20 20:24:06 +01:00
|
|
|
return blconn;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
* Function: uip_backlogdelete
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Called from uip_tcpfree() when a connection is freed that this also
|
|
|
|
* retained in the pending connectino list of a listener. We simply need
|
|
|
|
* to remove the defunct connecton from the list.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* Called from the interrupt level with interrupts disabled
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int uip_backlogdelete(FAR struct uip_conn *conn, FAR struct uip_conn *blconn)
|
|
|
|
{
|
|
|
|
FAR struct uip_backlog_s *bls;
|
|
|
|
FAR struct uip_blcontainer_s *blc;
|
2008-11-21 13:47:36 +01:00
|
|
|
FAR struct uip_blcontainer_s *prev;
|
2008-11-20 20:24:06 +01:00
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nllvdbg("conn=%p blconn=%p\n", conn, blconn);
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
#ifdef CONFIG_DEBUG
|
|
|
|
if (!conn)
|
|
|
|
{
|
2008-11-20 22:50:55 +01:00
|
|
|
return -EINVAL;
|
2008-11-20 20:24:06 +01:00
|
|
|
}
|
|
|
|
#endif
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2008-11-20 20:24:06 +01:00
|
|
|
bls = conn->backlog;
|
|
|
|
if (bls)
|
|
|
|
{
|
|
|
|
/* Find the container hold the connection */
|
|
|
|
|
2008-11-21 13:47:36 +01:00
|
|
|
for (blc = (FAR struct uip_blcontainer_s *)sq_peek(&bls->bl_pending), prev = NULL;
|
2008-11-20 20:24:06 +01:00
|
|
|
blc;
|
2008-11-21 13:47:36 +01:00
|
|
|
prev = blc, blc = (FAR struct uip_blcontainer_s *)sq_next(&blc->bc_node))
|
2008-11-20 20:24:06 +01:00
|
|
|
{
|
|
|
|
if (blc->bc_conn == blconn)
|
|
|
|
{
|
2008-11-21 13:47:36 +01:00
|
|
|
if (prev)
|
|
|
|
{
|
|
|
|
/* Remove the a container from the middle of the list of
|
|
|
|
* pending connections
|
|
|
|
*/
|
|
|
|
|
|
|
|
(void)sq_remafter(&prev->bc_node, &bls->bl_pending);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Remove the a container from the head of the list of
|
|
|
|
* pending connections
|
|
|
|
*/
|
|
|
|
|
|
|
|
(void)sq_remfirst(&bls->bl_pending);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put container in the free list */
|
|
|
|
|
|
|
|
blc->bc_conn = NULL;
|
|
|
|
sq_addlast(&blc->bc_node, &bls->bl_free);
|
2008-11-20 20:24:06 +01:00
|
|
|
return OK;
|
|
|
|
}
|
|
|
|
}
|
2008-11-20 22:50:55 +01:00
|
|
|
|
2009-09-15 17:44:14 +02:00
|
|
|
nlldbg("Failed to find pending connection\n");
|
2008-11-20 20:24:06 +01:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
return OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_NET && CONFIG_NET_TCP && CONFIG_NET_TCPBACKLOG */
|