d6b50a1d3f
nxstyle fixes to pass the CI checks Signed-off-by: Alin Jerpelea <alin.jerpelea@sony.com>
66 lines
2.1 KiB
C
66 lines
2.1 KiB
C
/****************************************************************************
|
|
* libs/libc/queue/sq_rem.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 <queue.h>
|
|
|
|
/****************************************************************************
|
|
* Public Functions
|
|
****************************************************************************/
|
|
|
|
/****************************************************************************
|
|
* Name: sq_rem
|
|
*
|
|
* Description:
|
|
* sq_rem removes a 'node' for 'queue.'
|
|
*
|
|
****************************************************************************/
|
|
|
|
void sq_rem(FAR sq_entry_t *node, sq_queue_t *queue)
|
|
{
|
|
if (queue->head && node)
|
|
{
|
|
if (node == queue->head)
|
|
{
|
|
queue->head = node->flink;
|
|
if (node == queue->tail)
|
|
{
|
|
queue->tail = NULL;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
FAR sq_entry_t *prev;
|
|
|
|
for (prev = (FAR sq_entry_t *)queue->head;
|
|
prev && prev->flink != node;
|
|
prev = prev->flink);
|
|
|
|
if (prev)
|
|
{
|
|
sq_remafter(prev, queue);
|
|
}
|
|
}
|
|
}
|
|
}
|