✳flâneur — a map of the web's best reading
Intrusive linked lists - Data structures in practice
data-structures-in-practice.com · 2,290 words · saved by 1 readers
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
Explore this link on the map →saved by
related reading
- Linked list - Wikipediaen.wikipedia.org
- The true cost of linked lists · YKarroumykarroum.com
- Introduction - Learning Rust With Entirely Too Many Linked Listsrust-unofficial.github.io
- CS106B Linked Structuresweb.stanford.edu
- list - C++ Referencecplusplus.com
- tldp.org/LDP/tlk/kernel/processes.htmltldp.org
- Unreliable Guide To Locking — The Linux Kernel documentationdocs.kernel.org
- abseil / Performance Hintsabseil.io
- The "Basics" | Putting the "You" in CPUcpu.land
- What is RCU, Fundamentally? [LWN.net]lwn.net
- Spinlocks Considered Harmfulmatklad.github.io
- Reading 11: Recursive Data Typesweb.mit.edu