mirror of
https://github.com/BobTheBlinker/android_kernel_motorola_sm6375.git
synced 2026-10-29 19:21:31 -04:00
lib: Export interval_tree
lib/interval_tree.c provides a simple interface for an interval-tree
(an augmented red-black tree) but is only built when testing the generic
macros for building interval-trees. For drivers with modest needs,
export the simple interval-tree library as is.
v2: Lots of help from Michel Lespinasse to only compile the code
as required:
- make INTERVAL_TREE a config option
- make INTERVAL_TREE_TEST select the library functions
and sanitize the filenames & Makefile
- prepare interval_tree for being built as a module if required
Signed-off-by: Chris Wilson <[email protected]>
Cc: Michel Lespinasse <[email protected]>
Cc: Rik van Riel <[email protected]>
Cc: Peter Zijlstra <[email protected]>
Cc: Andrea Arcangeli <[email protected]>
Cc: David Woodhouse <[email protected]>
Cc: Andrew Morton <[email protected]>
Reviewed-by: Michel Lespinasse <[email protected]>
[Acked for inclusion via drm/i915 by Andrew Morton.]
[danvet: switch to _GPL as per the mailing list discussion.]
Signed-off-by: Daniel Vetter <[email protected]>
This commit is contained in:
parent
8d4eee9cd7
commit
a88cc108f6
5 changed files with 22 additions and 2 deletions
14
lib/Kconfig
14
lib/Kconfig
|
|
@ -331,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
|
||||
|
|
|
|||
Loading…
Reference in a new issue