Tag
Hash :
ae063d89
Author :
Date :
2013-03-01T10:24:57
queue: refactor to use pkg_list_t framework
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90
/*
* iter.h
* Linked lists and iterators.
*
* Copyright (c) 2013 pkgconf authors (see AUTHORS).
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* This software is provided 'as is' and without any warranty, express or
* implied. In no event shall the authors be liable for any damages arising
* from the use of this software.
*/
#ifndef PKGCONF__ITER_H
#define PKGCONF__ITER_H
typedef struct pkg_node_ pkg_node_t;
struct pkg_node_ {
pkg_node_t *prev, *next;
void *data;
};
typedef struct {
pkg_node_t *head, *tail;
} pkg_list_t;
#define PKG_LIST_INITIALIZER { NULL, NULL }
static inline void
pkg_node_insert(pkg_node_t *node, void *data, pkg_list_t *list)
{
pkg_node_t *tnode;
node->data = data;
if (list->head == NULL)
{
list->head = node;
list->tail = node;
return;
}
tnode = list->head;
node->next = tnode;
tnode->prev = node;
list->head = node;
}
static inline void
pkg_node_insert_tail(pkg_node_t *node, void *data, pkg_list_t *list)
{
pkg_node_t *tnode;
node->data = data;
if (list->head == NULL)
{
list->head = node;
list->tail = node;
return;
}
tnode = list->tail;
node->prev = tnode;
tnode->next = node;
list->tail = node;
}
static inline void
pkg_node_delete(pkg_node_t *node, pkg_list_t *list)
{
if (node->prev == NULL)
list->head = node->next;
else
node->prev->next = node->next;
if (node->next == NULL)
list->tail = node->prev;
else
node->next->prev = node->prev;
}
#endif