95 lines
2.7 KiB
C
95 lines
2.7 KiB
C
/*
|
|
* Copyright © 2008-2011 Kristian Høgsberg
|
|
* Copyright © 2011 Intel Corporation
|
|
* Copyright © 2013-2015 Red Hat, Inc.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice (including the next
|
|
* paragraph) shall be included in all copies or substantial portions of the
|
|
* Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
* DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#include <assert.h>
|
|
#include <stddef.h>
|
|
#include <stdbool.h>
|
|
|
|
#include "util-list.h"
|
|
|
|
void
|
|
list_init(struct list *list)
|
|
{
|
|
list->prev = list;
|
|
list->next = list;
|
|
}
|
|
|
|
void
|
|
list_insert(struct list *list, struct list *elm)
|
|
{
|
|
assert((list->next != NULL && list->prev != NULL) ||
|
|
!"list->next|prev is NULL, possibly missing list_init()");
|
|
assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) ||
|
|
!"elm->next|prev is not NULL, list node used twice?");
|
|
|
|
elm->prev = list;
|
|
elm->next = list->next;
|
|
list->next = elm;
|
|
elm->next->prev = elm;
|
|
}
|
|
|
|
void
|
|
list_append(struct list *list, struct list *elm)
|
|
{
|
|
assert((list->next != NULL && list->prev != NULL) ||
|
|
!"list->next|prev is NULL, possibly missing list_init()");
|
|
assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) ||
|
|
!"elm->next|prev is not NULL, list node used twice?");
|
|
|
|
elm->next = list;
|
|
elm->prev = list->prev;
|
|
list->prev = elm;
|
|
elm->prev->next = elm;
|
|
}
|
|
|
|
void
|
|
list_remove(struct list *elm)
|
|
{
|
|
assert((elm->next != NULL && elm->prev != NULL) ||
|
|
!"list->next|prev is NULL, possibly missing list_init()");
|
|
|
|
elm->prev->next = elm->next;
|
|
elm->next->prev = elm->prev;
|
|
elm->next = NULL;
|
|
elm->prev = NULL;
|
|
}
|
|
|
|
bool
|
|
list_empty(const struct list *list)
|
|
{
|
|
assert((list->next != NULL && list->prev != NULL) ||
|
|
!"list->next|prev is NULL, possibly missing list_init()");
|
|
|
|
return list->next == list;
|
|
}
|
|
|
|
bool
|
|
list_is_last(const struct list *list, const struct list *elm)
|
|
{
|
|
return elm->next == list;
|
|
}
|