Linux 内核的实现,大量使用了数据结构,包括了数组、链表和散列表。其中用的最多的是双向循环链表。 Linux 内核使用的是自己定义的链表和散列表,简单而高效,使用方法也非常的别具一格。-Implementation of Linux core, the extensive use of data structures, including arrays, linked lists and hash table. The most widely used is the double circular linked list. The Linux kernel is using its own definition of linked lists and hash tables, simple and efficient method, use is also very have a style of one s own.