|
Packit |
7e09eb |
/*
|
|
Packit |
7e09eb |
* Intel(R) Enclosure LED Utilities
|
|
Packit |
7e09eb |
* Copyright (C) 2009-2018 Intel Corporation.
|
|
Packit |
7e09eb |
*
|
|
Packit |
7e09eb |
* This program is free software; you can redistribute it and/or modify it
|
|
Packit |
7e09eb |
* under the terms and conditions of the GNU General Public License,
|
|
Packit |
7e09eb |
* version 2, as published by the Free Software Foundation.
|
|
Packit |
7e09eb |
*
|
|
Packit |
7e09eb |
* This program is distributed in the hope it will be useful, but WITHOUT
|
|
Packit |
7e09eb |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
Packit |
7e09eb |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
|
Packit |
7e09eb |
* more details.
|
|
Packit |
7e09eb |
*
|
|
Packit |
7e09eb |
* You should have received a copy of the GNU General Public License along with
|
|
Packit |
7e09eb |
* this program; if not, write to the Free Software Foundation, Inc.,
|
|
Packit |
7e09eb |
* 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
|
|
Packit |
7e09eb |
*
|
|
Packit |
7e09eb |
*/
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
#include <assert.h>
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
#include "list.h"
|
|
Packit |
7e09eb |
#include "utils.h"
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
void __list_erase(struct list *list, item_free_t free_fn)
|
|
Packit |
7e09eb |
{
|
|
Packit |
7e09eb |
struct node *node;
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
list_for_each_node(list, node) {
|
|
Packit |
7e09eb |
if (free_fn)
|
|
Packit |
7e09eb |
free_fn(node->item);
|
|
Packit |
7e09eb |
free(node);
|
|
Packit |
7e09eb |
}
|
|
Packit |
7e09eb |
list->head = list->tail = NULL;
|
|
Packit |
7e09eb |
}
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
void __list_remove(struct node *node, item_free_t free_fn)
|
|
Packit |
7e09eb |
{
|
|
Packit |
7e09eb |
struct list *list = node->list;
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
if (node->prev)
|
|
Packit |
7e09eb |
node->prev->next = node->next;
|
|
Packit |
7e09eb |
else
|
|
Packit |
7e09eb |
list->head = node->next;
|
|
Packit |
7e09eb |
if (node->next)
|
|
Packit |
7e09eb |
node->next->prev = node->prev;
|
|
Packit |
7e09eb |
else
|
|
Packit |
7e09eb |
list->tail = node->prev;
|
|
Packit |
7e09eb |
node->list = NULL;
|
|
Packit |
7e09eb |
node->next = NULL;
|
|
Packit |
7e09eb |
node->prev = NULL;
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
if (free_fn)
|
|
Packit |
7e09eb |
free_fn(node->item);
|
|
Packit |
7e09eb |
}
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
void list_insert(struct list *list, void *item, struct node *after)
|
|
Packit |
7e09eb |
{
|
|
Packit |
7e09eb |
struct node *new;
|
|
Packit |
7e09eb |
struct node **x;
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
new = malloc(sizeof(struct node));
|
|
Packit |
7e09eb |
if (!new) {
|
|
Packit |
7e09eb |
log_error("Failed to allocate memory for list node.");
|
|
Packit |
7e09eb |
exit(1);
|
|
Packit |
7e09eb |
}
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
new->list = list;
|
|
Packit |
7e09eb |
new->item = item;
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
if (after) {
|
|
Packit |
7e09eb |
assert(list == after->list);
|
|
Packit |
7e09eb |
x = &after->next;
|
|
Packit |
7e09eb |
} else {
|
|
Packit |
7e09eb |
x = &list->head;
|
|
Packit |
7e09eb |
}
|
|
Packit |
7e09eb |
|
|
Packit |
7e09eb |
if (*x == NULL)
|
|
Packit |
7e09eb |
list->tail = new;
|
|
Packit |
7e09eb |
else
|
|
Packit |
7e09eb |
(*x)->prev = new;
|
|
Packit |
7e09eb |
new->next = *x;
|
|
Packit |
7e09eb |
*x = new;
|
|
Packit |
7e09eb |
new->prev = after;
|
|
Packit |
7e09eb |
}
|