static void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}
static int list_empty(struct list_head *head)
{
return head->next == head;
}
static void list_splice(struct list_head *list, struct list_head *head)
{
struct list_head *first = list->next;
if (first != list) {
struct list_head *last = list->prev;
struct list_head *at = head->next;
first->prev = head;
head->next = first;
last->next = at;
at->prev = last;
}
}
typedef struct int_list
{
struct list_head list;
int data;
} int_list, *pint_list;
void test_int_list()
{
struct int_list *dlink, *newnode, *posnode;
struct list_head *pos;
int i;
NEW_LIST_NODE(int_list, dlink);
INIT_LIST_HEAD(&dlink->list);
for (i = 1; i < 10; i++)
{
NEW_LIST_NODE(int_list, newnode);
newnode->data = i;
list_add_tail(&newnode->list, &dlink->list);
}
