Searched refs:rbtree (Results 1 – 19 of 19) sorted by relevance
| /linux-4.1.27/Documentation/ |
| D | rbtree.txt | 1 Red-black Trees (rbtree) in Linux
26 The high-resolution timer code uses an rbtree to organize outstanding
32 This document covers use of the Linux rbtree implementation. For more
44 Linux's rbtree implementation lives in the file "lib/rbtree.c". To use it,
45 "#include <linux/rbtree.h>".
47 The Linux rbtree implementation is optimized for speed, and thus has one
53 which call the provided rbtree functions. Locking is also left up to the
54 user of the rbtree code.
56 Creating a new rbtree
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
[all …]
|
| D | kmemleak.txt | 74 information like size and stack trace, are stored in a rbtree.
90 the values against the addresses stored in the rbtree. If
|
| D | 00-INDEX | 384 rbtree.txt
|
| /linux-4.1.27/net/netfilter/ipset/ |
| D | ip_set_hash_netiface.c | 272 ret = iface_test(&h->rbtree, &e.iface); in hash_netiface4_kadt()
275 ret = iface_add(&h->rbtree, &e.iface); in hash_netiface4_kadt()
324 ret = iface_test(&h->rbtree, &e.iface); in hash_netiface4_uadt()
327 ret = iface_add(&h->rbtree, &e.iface); in hash_netiface4_uadt()
509 ret = iface_test(&h->rbtree, &e.iface); in hash_netiface6_kadt()
512 ret = iface_add(&h->rbtree, &e.iface); in hash_netiface6_kadt()
562 ret = iface_test(&h->rbtree, &e.iface); in hash_netiface6_uadt()
565 ret = iface_add(&h->rbtree, &e.iface); in hash_netiface6_uadt()
|
| D | ip_set_hash_gen.h | 284 struct rb_root rbtree; member
427 rbtree_destroy(&h->rbtree); in mtype_destroy()
|
| /linux-4.1.27/tools/lib/lockdep/ |
| D | Build | 1 liblockdep-y += common.o lockdep.o preload.o rbtree.o
|
| /linux-4.1.27/tools/perf/ |
| D | MANIFEST | 32 include/linux/rbtree.h
37 lib/rbtree.c
|
| /linux-4.1.27/drivers/base/regmap/ |
| D | Makefile | 5 obj-$(CONFIG_REGMAP) += regcache-rbtree.o regcache-lzo.o regcache-flat.o
|
| /linux-4.1.27/tools/perf/util/ |
| D | Build | 20 libperf-y += rbtree.o
139 $(OUTPUT)util/rbtree.o: ../../lib/rbtree.c FORCE
|
| D | python-ext-sources | 21 ../../lib/rbtree.c
|
| /linux-4.1.27/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-4.1.27/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-4.1.27/Documentation/block/ |
| D | deadline-iosched.txt | 70 rbtree front sector lookup when the io scheduler merge function is called.
|
| /linux-4.1.27/lib/ |
| D | Makefile | 11 rbtree.o radix-tree.o dump_stack.o timerqueue.o\
|
| D | Kconfig | 351 augmented rbtree.
355 Documentation/rbtree.txt
|
| D | Kconfig.debug | 1586 A benchmark measuring the performance of the rbtree library.
1587 Also includes rbtree invariant checks.
|
| /linux-4.1.27/drivers/block/xen-blkback/ |
| D | blkback.c | 176 #define foreach_grant_safe(pos, n, rbtree, node) \ argument
177 for ((pos) = container_of(rb_first((rbtree)), typeof(*(pos)), node), \
|
| /linux-4.1.27/Documentation/cgroups/ |
| D | unified-hierarchy.txt | 337 global rbtree and treated like equal peers, regardless where they
|
| /linux-4.1.27/net/netfilter/ |
| D | Kconfig | 471 tristate "Netfilter nf_tables rbtree set module"
473 This option adds the "rbtree" set type (Red Black tree) that is used
|