README: Clarify red-black tree statements.

As noted by Sebastian Stark, the old text was a bit misleading. So
make it clear that no special linux files are necessary to compile
the library.

Also, the sentence on table locking was not quite true: There's the
dirty bit in each osl table which is some kind of locking. Correct that
statement as well.

diff --git a/README b/README
index 23f177f6626f2dc5fd7465e96fb7303fbe5566b8..c8cfff0824f9e76322601ee1fda525ae244a206d 100644 (file)
--- a/README
+++ b/README
@@ -12,15 +12,18 @@ Libosl is simple:
        - There is no fancy query language but only a relatively
        simple C-API.
 
-       - There's no support for network-access and libosl does not
-       use any table locking.
+       - There's no network support for network-access and libosl
+       only uses a very rudimentary table locking mechanism.
+
+       - There are no dependencies on external libraries. An augmented
+       version of the red-black tree implementation of the linux
+       kernel is in included in the libosl package.
 
 Libosl is fast:
 
        - It uses sha1 hashes for content-based addressing.
 
-        - An augmented version of the rbtree implementation of the
-        linux kernel is used for lookups.
+       - Red-black trees are used to make lookups fast.
 
 Libosl is portable: