Explainer breaks down how Linux uses intrusive linked lists for process management
A technical post explains intrusive linked lists, a linked-list variant where the 'next' pointer is embedded directly inside the data structure being linked rather than stored in a separate wrapper node. It walks through how to construct such a list in C, including how to recover the address of a containing object by subtracting the offset of its embedded list member.