Intrusive linked lists - Data structures in practice

This post will teach you what intrusive linked lists are and how they are used to manage processes in Linux.

This post will teach you what intrusive linked lists are and how they are used to manage processes in Linux. What are intrusive linked lists? Intrusive linked lists are a variation of linked lists where the links are embedded in the structure that's being linked. In a typical linked list implementation, a list node contains a data pointer to the linked data and a next pointer to the next node in the list. Figure 1: A linked list In an intrusive linked list implementation, the list node contains next pointer to the next list node, but no data pointer because the list is embedded in the linked o

saved by

• Andrew Chen

related reading

• Kernel Data Structures Linkedlistmedium.com
• Linked list - Wikipediaen.wikipedia.org
• Introduction - Learning Rust With Entirely Too Many Linked Listsrust-unofficial.github.io
• Intro - Putting the "You" in CPUcpu.land
• The true cost of linked lists · YKarroumykarroum.com
• list - C++ Referencecplusplus.com
• Linux kernel memory barriers — The Linux Kernel documentationdocs.kernel.org
• CS106B Linked Structuresweb.stanford.edu
• Inter-process communication in Linux: Shared storage | Opensource.comopensource.com
• The Lost Art of Structure Packingcatb.org
• Unreliable Guide To Locking — The Linux Kernel documentationdocs.kernel.org
• Processes in Linux - Everything You Need to Knowreliabilityengineering.substack.com