Add iob_freechain
This commit is contained in:
parent
7ef0fb1460
commit
6a83cc5d17
|
@ -123,11 +123,22 @@ FAR struct iob_s *iob_alloc(void);
|
|||
|
||||
FAR struct iob_s *iob_free(FAR struct iob_s *iob);
|
||||
|
||||
/****************************************************************************
|
||||
* Name: iob_freechain
|
||||
*
|
||||
* Description:
|
||||
* Free an entire buffer chain, starting at the beginning of the I/O
|
||||
* buffer chain
|
||||
*
|
||||
****************************************************************************/
|
||||
|
||||
void iob_freechain(FAR struct iob_s *iob);
|
||||
|
||||
/****************************************************************************
|
||||
* Name: iob_freeq
|
||||
*
|
||||
* Description:
|
||||
* Free an entire buffer chain
|
||||
* Free an entire buffer chain, starting at a queue head
|
||||
*
|
||||
****************************************************************************/
|
||||
|
||||
|
|
|
@ -41,8 +41,8 @@ ifeq ($(CONFIG_NET_IOB),y)
|
|||
# Include IOB src files
|
||||
|
||||
NET_CSRCS += iob_alloc.c iob_clone.c iob_concat.c iob_copyin.c iob_copyout.c
|
||||
NET_CSRCS += iob_free.c iob_freeq.c iob_initialize.c iob_pack.c
|
||||
NET_CSRCS += iob_trimhead.c iob_trimtail.c
|
||||
NET_CSRCS += iob_free.c iob_freechain.c iob_freeq.c iob_initialize.c
|
||||
NET_CSRCS += iob_pack.c iob_trimhead.c iob_trimtail.c
|
||||
|
||||
# Include iob build support
|
||||
|
||||
|
|
|
@ -0,0 +1,101 @@
|
|||
/****************************************************************************
|
||||
* net/iob/iob_freechain.c
|
||||
*
|
||||
* Copyright (C) 2014 Gregory Nutt. All rights reserved.
|
||||
* Author: Gregory Nutt <gnutt@nuttx.org>
|
||||
*
|
||||
* 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
|
||||
****************************************************************************/
|
||||
|
||||
#include <nuttx/config.h>
|
||||
|
||||
#include <queue.h>
|
||||
|
||||
#include <nuttx/net/iob.h>
|
||||
|
||||
#include "iob.h"
|
||||
|
||||
/****************************************************************************
|
||||
* Pre-processor Definitions
|
||||
****************************************************************************/
|
||||
|
||||
/****************************************************************************
|
||||
* Private Types
|
||||
****************************************************************************/
|
||||
|
||||
/****************************************************************************
|
||||
* Private Data
|
||||
****************************************************************************/
|
||||
|
||||
/****************************************************************************
|
||||
* Public Data
|
||||
****************************************************************************/
|
||||
|
||||
/****************************************************************************
|
||||
* Public Functions
|
||||
****************************************************************************/
|
||||
|
||||
/****************************************************************************
|
||||
* Name: iob_freechain
|
||||
*
|
||||
* Description:
|
||||
* Free an entire buffer chain, starting at the beginning of the I/O
|
||||
* buffer chain
|
||||
*
|
||||
****************************************************************************/
|
||||
|
||||
void iob_freechain(FAR struct iob_s *iob)
|
||||
{
|
||||
FAR sq_entry_t *first = (sq_entry_t *)&iob->io_link;
|
||||
FAR sq_entry_t *last;
|
||||
|
||||
/* Find the last entry in the I/O buffer list */
|
||||
|
||||
for (last = first; last->flink; last = last->flink);
|
||||
|
||||
/* If the free list is empty, then just move the I/O buffer chain to the
|
||||
* free list. Otherwise, append the I/O buffer chain to the end of the
|
||||
* free list.
|
||||
*/
|
||||
|
||||
if (g_iob_freelist.tail)
|
||||
{
|
||||
g_iob_freelist.tail->flink = first;
|
||||
}
|
||||
else
|
||||
{
|
||||
g_iob_freelist.head = first;
|
||||
}
|
||||
|
||||
g_iob_freelist.tail = last;
|
||||
}
|
|
@ -69,7 +69,7 @@
|
|||
* Name: iob_freeq
|
||||
*
|
||||
* Description:
|
||||
* Free an entire buffer chain
|
||||
* Free an entire buffer chain, starting at a queue head
|
||||
*
|
||||
****************************************************************************/
|
||||
|
||||
|
|
Loading…
Reference in New Issue