37 int init_list_head(struct list_node *head)  in init_list_head()  argument
39     if (head == NULL)  in init_list_head()
42     memset(head, 0, sizeof(*head));  in init_list_head()
47 struct list_node *add_list_node(struct list_node *head, void *data)  in add_list_node()  argument
52     if (head == NULL) {  in add_list_node()
61     new_node->next = head->next;  in add_list_node()
62     new_node->compare = head->compare;  in add_list_node()
63     new_node->dump = head->dump;  in add_list_node()
64     head->next = new_node;  in add_list_node()
69 int is_list_empty(struct list_node *head)  in is_list_empty()  argument
71     return (head == NULL || head->next == NULL);  in is_list_empty()
77 int remove_list_node(struct list_node *head, struct list_node *del_node)  in remove_list_node()  argument
82     if (head == NULL || head->next == NULL) {  in remove_list_node()
86     current_node = head->next;  in remove_list_node()
87     saved_node = head;  in remove_list_node()
110 void dump_list(struct list_node *head)  in dump_list()  argument
112     struct list_node *current_node = head;  in dump_list()
114     if (head == NULL)  in dump_list()
126 struct list_node *find_node(struct list_node *head, void *comparison_data)  in find_node()  argument
128     struct list_node *current_node = head;  in find_node()
130     if (head == NULL)  in find_node()