First USB sketch.

[cascardo/kernel/slides/.git] / 03types / types

diff --git a/03types/types b/03types/types
index 3f823c3..da8a825 100644 (file)
--- a/03types/types
+++ b/03types/types
@@ -55,14 +55,16 @@ Reference:
 
 # Little endian and Big endian
 
-* FIXME
 * Little endian machines
+       - Alpha
        - x86
 * Big endian machines
+       - PowerPC
        - SPARC
-       - MIPS
 * Multi-endian machines
        - ARM
+       - MIPS
+       - SH
 
 # Headers
 
@@ -136,6 +138,43 @@ Reference:
 * find\\_next\\_zero\\_bit
 * for\\_each\\_set\\_bit
 
-# Trees and hashes
+# Reb-black tree
+
+# Files
+
+* Documentation/rbtree.txt
+* lib/rbtree.c
+* include linux/rbtree.h
+
+# Usage
+
+* Embed struct rb\\_node into your data structure
+* There's no callback for comparison, write your own lookup and insertion
+  functions
+* Locking is up to the user
+
+# API
+
+* rb\\_entry is the same as container\\_of
+* Create the root with struct rb\\_root name = RB\\_ROOT;
+* Lookup function (see example) uses rb\\_left and rb\\_right members
+* Insertion: lookup insertion point, save the parent and use the functions
+  rb\\_link\\_node and rb\\_insert\\_color (example in Documentation)
+* Erase with rb\\_erase
+* Iterate with functions rb\\_first, rb\\_last, rb\\_next and rb\\_prev
+
+# Hashes
+
+* No hash table
+* There are hash functions found at
+       - include linux/hash.h
+       - include linux/jhash.h
+* Users usually do chaining to resolve collisions
 
 # Other data types
+
+* IDR
+* Flexible Array
+* Plist
+* Radix tree
+* Btree