Linux Device Drivers Development

Deleting a node from the list

List handling is an easy task in kernel code. Deleting a node is straightforward:

 void list_del(struct list_head *entry); 

Following the preceding example, let's delete the red car:

list_del(&redcar->list); 

list_del disconnects the prev and next pointers of the given entry, resulting in entry removal. The memory allocated for the node is not freed yet; you need to do that manually with kfree.