lib: Export interval_tree

[sfrench/cifs-2.6.git] / lib / Kconfig

diff --git a/lib/Kconfig b/lib/Kconfig
index 5d4984c505f8c10d0d7250b7f59d3234fe3b21b5..334f7722a999232aa46b706d8cda61b57c854708 100644 (file)
--- a/lib/Kconfig
+++ b/lib/Kconfig
@@ -182,6 +182,15 @@ config AUDIT_GENERIC
        depends on AUDIT && !AUDIT_ARCH
        default y
 
+config AUDIT_ARCH_COMPAT_GENERIC
+       bool
+       default n
+
+config AUDIT_COMPAT_GENERIC
+       bool
+       depends on AUDIT_GENERIC && AUDIT_ARCH_COMPAT_GENERIC && COMPAT
+       default y
+
 config RANDOM32_SELFTEST
        bool "PRNG perform self test on init"
        default n
@@ -322,6 +331,20 @@ config TEXTSEARCH_FSM
 config BTREE
        boolean
 
+config INTERVAL_TREE
+       boolean
+       help
+         Simple, embeddable, interval-tree. Can find the start of an
+         overlapping range in log(n) time and then iterate over all
+         overlapping nodes. The algorithm is implemented as an
+         augmented rbtree.
+
+         See:
+
+               Documentation/rbtree.txt
+
+         for more information.
+
 config ASSOCIATIVE_ARRAY
        bool
        help