how it the linux implementation of double linked lists useful
while reading through linux/list.h I noticed that the linked list structure is really simple with only pointer to the previous node and pointer to next node with no other data (It can't handle anything inside it ) I started to wonder how such linked list can be useful to the kernel or (useful in general) ! thanks
On Sun, 2 Aug 2015, Ahmed Soliman wrote:
while reading through linux/list.h I noticed that the linked list structure is really simple with only pointer to the previous node and pointer to next node with no other data (It can't handle anything inside it ) I started to wonder how such linked list can be useful to the kernel or (useful in general) ! thanks
i wrote a tutorial about that once: http://www.crashcourse.ca/introduction-linux-kernel-programming/intermission... rday -- ======================================================================== Robert P. J. Day Ottawa, Ontario, CANADA http://crashcourse.ca Twitter: http://twitter.com/rpjday LinkedIn: http://ca.linkedin.com/in/rpjday ========================================================================
participants (2)
-
Ahmed Soliman -
Robert P. J. Day