Linux内核红黑树使用方法.docVIP

Linux内核红黑树使用方法 2011-01-06 23:44?1635人阅读?评论(0)?收藏?举报linux内核structtreestructuresearchinsert 转载自Linux2.6.29 内核文档，rbtree.txt 如果要使用红黑树，可直接复制内核中的代码rbtree.c/h Red-black Trees (rbtree) in Linux?January 18, 2007?Rob Landley rob@ ============================= What are red-black trees, and what are they for? ------------------------------------------------ Red-black trees are a type of self-balancing binary search tree, used for storing sortable key/value data pairs.??This differs from radix trees (which are used to efficiently store sparse arrays and thus use long integer indexes to insert/access/delete nodes) and hash tables (which are not kept sorted to be easily traversed in order, and must be tuned for a specific size and hash function where rbtrees scale gracefully storing arbitrary keys). Red-black trees are similar to?AVL?trees, but provide faster real-time bounded worst case performance for insertion and deletion (at most two rotations and three rotations, respectively, to balance the tree), with slightly slower (but still O(log n)) lookup time. To quote Linux Weekly News: ????There are a number of red-black trees in use in the kernel. ????The anticipatory, deadline, and CFQ I/O schedulers all employ rbtrees to track requests; the packet CD/DVD?driver does the same. ????The high-resolution timer code uses an rbtree to organize outstanding timer requests.??The ext3 filesystem tracks directory entries in a red-black tree.??Virtual memory areas (VMAs) are tracked with red-black trees, as are epoll file descriptors, cryptographic keys, and network packets in the hierarchical token bucket scheduler. This document covers use of the Linux rbtree implementation.??For more information on the nature and implementation of Red Black Trees,??see: ??Linux Weekly News article on red-black trees /Articles/184495/ ??Wikipedia entry on red-black trees /wiki/Red-black_tree Linux implementation of red-black trees --------------------------------------- Linuxs rbtree implementation lives