Home
last modified time | relevance | path

Searched refs:rbtree (Results 1 – 24 of 24) sorted by relevance

/linux/Documentation/core-api/
H A Drbtree.rst2 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 …]
H A Dindex.rst45 rbtree
/linux/tools/testing/selftests/bpf/prog_tests/
H A Drbtree.c19 struct rbtree *skel; in test_rbtree_add_nodes()
41 struct rbtree *skel; in test_rbtree_add_nodes_nested()
63 struct rbtree *skel; in test_rbtree_add_and_remove()
85 struct rbtree *skel; in test_rbtree_add_and_remove_array()
106 struct rbtree *skel; in test_rbtree_first_and_remove()
130 struct rbtree *skel; in test_rbtree_api_release_aliasing()
/linux/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst4 :Original: Documentation/core-api/rbtree.rst
11 Linux中的红黑树（rbtree）
47 Linux的红黑树实现在文件“lib/rbtree.c”中。要使用它，需要“#include <linux/rbtree.h>”。
219 实现增强型红黑树操作的C文件必须包含<linux/rbtree_augmented.h>而不是<linux/rbtree.h>。
H A Dindex.rst46 rbtree
/linux/rust/kernel/
H A Drbtree.rs342 rbtree: self, in raw_entry()
351 rbtree: raw_self, in raw_entry()
1154 rbtree: *mut RBTree<K, V>, field
1181 unsafe { bindings::rb_insert_color(node_links, addr_of_mut!((*self.rbtree).root)) }; in insert()
1200 rbtree: &'a mut RBTree<K, V>, field
1235 unsafe { bindings::rb_erase(self.node_links, &mut self.rbtree.root) }; in remove_node()
1269 bindings::rb_replace_node(self.node_links, new_node_links, &mut self.rbtree.root) in replace()
/linux/tools/bpf/resolve_btfids/
H A DBuild4 resolve_btfids-y += rbtree.o
/linux/Documentation/bpf/
H A Dgraph_ds_impl.rst6 structures (linked_list, rbtree), with particular focus on the verifier's
35 Two such data structures - linked_list and rbtree - have many verification
73 The "root" type for both linked_list and rbtree expects to be in a map_value
201 Any reference to a node that is in an rbtree _must_ be non-owning, since
203 that isn't in rbtree _must_ be owning. This results in a nice property:
247 a node which is not in an rbtree. Statement 5 will try to remove a node which
/linux/tools/testing/selftests/bpf/progs/
H A Dexceptions_fail.c30 private(A) struct bpf_rb_root rbtree __contains(foo, node);
173 bpf_rbtree_add(&rbtree, &f->node, rbless); in reject_with_rbtree_add_throw()
/linux/scripts/gdb/linux/
H A Dproc.py21 from linux import rbtree
176 … for mnt in rbtree.rb_inorder_for_each_entry(namespace['mounts'], mount_ptr_type, "mnt_node"):
H A Dtimerlist.py10 from linux import rbtree
50 curr = rbtree.rb_next(curr)
/linux/scripts/gdb/
H A Dvmlinux-gdb.py37 import linux.rbtree
/linux/tools/perf/
H A DMANIFEST18 tools/lib/rbtree.c
/linux/tools/objtool/
H A DBuild31 $(OUTPUT)librbtree.o: ../lib/rbtree.c FORCE
/linux/drivers/base/regmap/
H A DMakefile6 obj-$(CONFIG_REGMAP) += regcache-rbtree.o regcache-flat.o regcache-maple.o
/linux/Documentation/locking/
H A Drt-mutex-design.rst106 the task is blocked on. It also has rbtree node structures to
107 place the task in the waiters rbtree of a mutex as well as the
108 pi_waiters rbtree of a mutex owner task (described below).
200 mutex has a rbtree to store these waiters by priority. This tree is protected
208 To keep track of the PI chains, each process has its own PI rbtree. This is
218 This tree is stored in the task structure of a process as a rbtree called
408 should be at, but the rbtree nodes of the task's waiter have not been updated
474 to the mutex. The rbtree node of waiter are initialized to the processes
/linux/Documentation/timers/
H A Dhrtimers.rst95 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/Documentation/scheduler/
H A Dsched-design-CFS.rst61 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
75 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
86 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
/linux/Documentation/block/
H A Ddeadline-iosched.rst69 rbtree front sector lookup when the io scheduler merge function is called.
/linux/tools/testing/selftests/hid/
H A DMakefile158 $(TOOLSDIR)/lib/rbtree.c \
/linux/drivers/block/xen-blkback/
H A Dblkback.c150 #define foreach_grant_safe(pos, n, rbtree, node) \ argument
151 for ((pos) = container_of(rb_first((rbtree)), typeof(*(pos)), node), \
/linux/tools/testing/selftests/bpf/
H A DMakefile410 $(TOOLSDIR)/lib/rbtree.c \
/linux/lib/
H A DKconfig.debug2375 A benchmark measuring the performance of the rbtree library.
2376 Also includes rbtree invariant checks.
/linux/Documentation/admin-guide/
H A Dcgroup-v2.rst3225 rbtree and treated like equal peers, regardless where they are located