Lines Matching full:linked

4 Linked Lists in Linux
14 Linked lists are one of the most basic data structures used in many programs.
15 The Linux kernel implements several different flavours of linked lists. The
16 purpose of this document is not to explain linked lists in general, but to show
17 new kernel developers how to use the Linux kernel implementations of linked
20 Please note that while linked lists certainly are ubiquitous, they are rarely
22 suffice. In particular, due to their poor data locality, linked lists are a bad
27 Linux implementation of doubly linked lists
30 Linux's linked list implementations can be used by including the header file
33 The doubly-linked list will likely be the most familiar to many readers. It's a
36 The Linux kernel's doubly-linked list is circular in nature. This means that to
44 A node in a doubly-linked list is declared by adding a struct list_head
56 linked list is a list node data structure with pointers to the previous and next
67 A doubly-linked list can then be declared as just another struct list_head,
93 have its own type. The concept of the entire linked list and a
100 Adding a node to the linked list is done through the list_add() macro.
770 * `How does the kernel implements Linked Lists? - KernelNewbies <https://kernelnewbies.org/FAQ/Link…