Bidirectional linked list in Linux Kernel

The Linux kernel defines the list_head data structure. The fields next and Prev indicate the forward and backward pointer elements of the universal two-way linked list, respectively. List--head (list_name): Create a New linked list list_add (n, p): insert the elements pointed to by N into the specific elements pointed to by P and then list_add_tail (n, p ), insert the element pointed to by N to the specific element pointed to by P before list_del (P): Delete the element list pointed to by p -- empty (P) check whether the linked list pointed to by address P of the first element is empty.