40ef5bc6db
to avoid the conflict with libuv's queue.h Signed-off-by: Xiang Xiao <xiaoxiang@xiaomi.com>
61 lines
2.0 KiB
C
61 lines
2.0 KiB
C
/****************************************************************************
|
|
* libs/libc/queue/sq_remafter.c
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
* this work for additional information regarding copyright ownership. The
|
|
* ASF licenses this file to you under the Apache License, Version 2.0 (the
|
|
* "License"); you may not use this file except in compliance with the
|
|
* License. You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
|
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
* License for the specific language governing permissions and limitations
|
|
* under the License.
|
|
*
|
|
****************************************************************************/
|
|
|
|
/****************************************************************************
|
|
* Included Files
|
|
****************************************************************************/
|
|
|
|
#include <nuttx/queue.h>
|
|
|
|
/****************************************************************************
|
|
* Public Functions
|
|
****************************************************************************/
|
|
|
|
/****************************************************************************
|
|
* Name: sq_remafter
|
|
*
|
|
* Description:
|
|
* sq_remafter removes the entry following 'node' from the 'queue'.
|
|
* Returns a reference to the removed entry.
|
|
*
|
|
****************************************************************************/
|
|
|
|
FAR sq_entry_t *sq_remafter(FAR sq_entry_t *node, sq_queue_t *queue)
|
|
{
|
|
FAR sq_entry_t *ret = node->flink;
|
|
|
|
if (queue->head && ret)
|
|
{
|
|
if (queue->tail == ret)
|
|
{
|
|
queue->tail = node;
|
|
node->flink = NULL;
|
|
}
|
|
else
|
|
{
|
|
node->flink = ret->flink;
|
|
}
|
|
|
|
ret->flink = NULL;
|
|
}
|
|
|
|
return ret;
|
|
}
|