lkml.org 
[lkml]   [2000]   [Feb]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subject[PATCH] Generic AVL-Trees.

The following patch replaces the three independent implementations of AVL
trees in the kernel with one "generic" implementation. This implementation
is based on the same idea as linux/list.h.

The existing uses of AVL Trees are in:
linux/mm/mmap_tree.c
linux/net/bridge/br_tree.c
linux/net/ipv4/inetpeer.c

This patch has been repackaged with kernel 2.3.46. (The existing AVL code
rarely changes, so it will probably also apply to most other kernel
versions as well.)

I feel the inclusion of this patch will make the kernel just a little more
friendly for developers that wish to explore different types of storage
mechanisms. With the generic AVL-Tree code, it is trivial to implement the
standard binary-tree functions, and there is little to no debugging or
detailed analysis of the AVL internals required.

Your comments would be appreciated,
-Kevin


The patch is attached in gzip format; it can also be obtained from:
http://www.cse.buffalo.edu/~koconnor/kernel-avl-patch-1.2

--
------------------------------------------------------------------------
| Kevin O'Connor "BTW, IMHO we need a FAQ for |
| koconnor@cse.buffalo.edu 'IMHO', 'FAQ', 'BTW', etc. !" |
------------------------------------------------------------------------
[unhandled content-type:application/x-gzip]
\
 
 \ /
  Last update: 2005-03-22 13:56    [W:0.043 / U:0.092 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site