Therefore, the Linux kernel defines the list_head data structure, whose only fields next and prev represent the forward and back pointers of a generic doubly linked list element, respectively.

• 对于每个链表，必须要实现一系列主要的操作：初始化链表，插入和删除元素，遍历链表等等。