|
cemu
|
#include "list.h"函数 | |
| void | __list_add (struct list_head *l_new, struct list_head *prev, struct list_head *next) |
| void | list_add (struct list_head *l_new, struct list_head *head) |
| void | list_add_tail (struct list_head *l_new, struct list_head *head) |
| void | __list_del (struct list_head *prev, struct list_head *next) |
| void | list_del (struct list_head *entry) |
| void | list_del_init (struct list_head *entry) |
| int | list_empty (struct list_head *head) |
| void | list_splice (struct list_head *list, struct list_head *head) |
| static void | __hlist_del (struct hlist_node *n) |
| void | hlist_del (struct hlist_node *n) |
| void | hlist_del_init (struct hlist_node *n) |
| void | hlist_add_head (struct hlist_node *n, struct hlist_head *h) |
| void | hlist_add_before (struct hlist_node *n, struct hlist_node *next) |
| void | hlist_add_behind (struct hlist_node *n, struct hlist_node *prev) |
| void | hlist_add_fake (struct hlist_node *n) |
| int | hlist_fake (struct hlist_node *h) |
| void | hlist_move_list (struct hlist_head *old, struct hlist_head *l_new) |
list_add - add a l_new entry @l_new: l_new entry to be added @head: list head to add it after
Insert a l_new entry after the specified head. This is good for implementing stacks.
list_add_tail - add a l_new entry @l_new: l_new entry to be added @head: list head to add it before
Insert a l_new entry before the specified head. This is useful for implementing queues.
| void list_del | ( | struct list_head * | entry | ) |
list_del - deletes entry from list. @entry: the element to delete from the list. Note: list_empty on entry does not return true after this, the entry is in an undefined state.
| void list_del_init | ( | struct list_head * | entry | ) |
list_del_init - deletes entry from list and reinitialize it. @entry: the element to delete from the list.
| int list_empty | ( | struct list_head * | head | ) |
list_empty - tests whether a list is empty @head: the list to test.