#ifndef _MYLIST_H
#define _MYLIST_H
struct list_head
{
struct list_head *prev;
struct list_head *next;
}
//将结点插入链表尾部
//head 为链表的头结点,item为要插入的新结点
void list_tail_add(struct list_head *head,struct list_head *item);
//将结点从链表中移除
void list_remove(struct list_head *item);
//取链表第一个有效结点,并从链表移除
struct list_head * list_first(struct list_head *head);
//判断链表是否为空,如为空则返回1,否则0
int list_is_empty(struct list_head *head);
//在当前结点后面插入一个结点insert_item
void list_insert_after(struct list_head *curr_item,struct list_head *insert_item);
#endif