Searched refs:rbtree (Results 1 – 17 of 17) sorted by relevance
| /Linux-v4.19/Documentation/ |
| D | rbtree.txt | 2 Red-black Trees (rbtree) in Linux
29 The high-resolution timer code uses an rbtree to organize outstanding
35 This document covers use of the Linux rbtree implementation. For more
47 Linux's rbtree implementation lives in the file "lib/rbtree.c". To use it,
48 "#include <linux/rbtree.h>".
50 The Linux rbtree implementation is optimized for speed, and thus has one
56 which call the provided rbtree functions. Locking is also left up to the
57 user of the rbtree code.
59 Creating a new rbtree
62 Data nodes in an rbtree tree are structures containing a struct rb_node member::
[all …]
|
| D | 00-INDEX | 339 rbtree.txt
|
| /Linux-v4.19/tools/lib/lockdep/ |
| D | Build | 1 liblockdep-y += common.o lockdep.o preload.o rbtree.o
|
| /Linux-v4.19/tools/perf/ |
| D | MANIFEST | 11 tools/lib/rbtree.c
|
| /Linux-v4.19/drivers/base/regmap/ |
| D | Makefile | 6 obj-$(CONFIG_REGMAP) += regcache-rbtree.o regcache-flat.o
|
| /Linux-v4.19/tools/perf/util/ |
| D | python-ext-sources | 30 ../lib/rbtree.c
|
| D | Build | 22 libperf-y += rbtree.o
209 $(OUTPUT)util/rbtree.o: ../lib/rbtree.c FORCE
|
| /Linux-v4.19/Documentation/locking/ |
| D | rt-mutex-design.txt | 100 the task is blocked on. It also has rbtree node structures to
101 place the task in the waiters rbtree of a mutex as well as the
102 pi_waiters rbtree of a mutex owner task (described below).
190 mutex has a rbtree to store these waiters by priority. This tree is protected
198 To keep track of the PI chains, each process has its own PI rbtree. This is
208 This tree is stored in the task structure of a process as a rbtree called
397 should be at, but the rbtree nodes of the task's waiter have not been updated
462 to the mutex. The rbtree node of waiter are initialized to the processes
|
| /Linux-v4.19/Documentation/timers/ |
| D | hrtimers.txt | 95 file systems. The rbtree is solely used for time sorted ordering, while
97 queued timers, without having to walk the rbtree.
113 be set without having to touch the rbtree. This also makes the handling
|
| /Linux-v4.19/Documentation/scheduler/ |
| D | sched-design-CFS.txt | 54 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
79 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
|
| /Linux-v4.19/Documentation/block/ |
| D | deadline-iosched.txt | 70 rbtree front sector lookup when the io scheduler merge function is called.
|
| /Linux-v4.19/Documentation/dev-tools/ |
| D | kmemleak.rst | 81 information like size and stack trace, are stored in a rbtree.
97 the values against the addresses stored in the rbtree. If
|
| /Linux-v4.19/lib/ |
| D | Makefile | 21 rbtree.o radix-tree.o timerqueue.o\
|
| D | Kconfig | 394 augmented rbtree.
398 Documentation/rbtree.txt
|
| D | Kconfig.debug | 1747 A benchmark measuring the performance of the rbtree library.
1748 Also includes rbtree invariant checks.
|
| /Linux-v4.19/drivers/block/xen-blkback/ |
| D | blkback.c | 212 #define foreach_grant_safe(pos, n, rbtree, node) \ argument
213 for ((pos) = container_of(rb_first((rbtree)), typeof(*(pos)), node), \
|
| /Linux-v4.19/Documentation/admin-guide/ |
| D | cgroup-v2.rst | 2082 rbtree and treated like equal peers, regardless where they are located
|
