Home
last modified time | relevance | path

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

12

/linux/tools/testing/selftests/bpf/prog_tests/
H A Drbtree.c7 #include "rbtree.skel.h"
21 struct rbtree *skel; in test_rbtree_add_nodes()
43 struct rbtree *skel; in test_rbtree_add_nodes_nested()
65 struct rbtree *skel; in test_rbtree_add_and_remove()
87 struct rbtree *skel; in test_rbtree_add_and_remove_array()
108 struct rbtree *skel; in test_rbtree_first_and_remove()
132 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/drivers/android/binder/
H A Dfreeze.rs9 rbtree::{self, RBTreeNodeReservation},
189 if let rbtree::Entry::Occupied(ref dupe) = freeze_entry { in request_freeze_notif()
201 rbtree::Entry::Vacant(entry) => { in request_freeze_notif()
215 rbtree::Entry::Occupied(mut dupe) => { in request_freeze_notif()
H A Dprocess.rs26 rbtree::{self, RBTree, RBTreeNode, RBTreeNodeReservation},
705 rbtree::Entry::Vacant(entry) => { in get_current_thread()
709 rbtree::Entry::Occupied(_entry) => { in get_current_thread()
844 rbtree::Entry::Vacant(entry) => break (res, entry), in insert_or_update_handle()
845 rbtree::Entry::Occupied(_) => { in insert_or_update_handle()
/linux/rust/kernel/
H A Drbtree.rs5 //! C header: [`include/linux/rbtree.h`](srctree/include/linux/rbtree.h)
7 //! Reference: <https://docs.kernel.org/core-api/rbtree.html>
27 /// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNode, RBTreeNodeReservation}};
101 /// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNode}, sync::SpinLock};
118 /// use kernel::{alloc::flags, rbtree::{RBTree, RBTreeNodeReservation}};
378 rbtree: self, in raw_entry()
387 rbtree: raw_self, in raw_entry()
572 /// use kernel::{alloc::flags, rbtree::RBTree};
611 /// use kernel::{alloc::flags, rbtree
1301 rbtree: *mut RBTree<K, V>, global() field
1347 rbtree: &'a mut RBTree<K, V>, global() field
[all...]
H A Dlib.rs114 pub mod rbtree; module
/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/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/testing/selftests/bpf/progs/
H A Dexceptions_fail.c35 private(A) struct bpf_rb_root rbtree __contains(foo, node);
193 bpf_rbtree_add(&rbtree, &f->node, rbless); in reject_with_rbtree_add_throw()
/linux/drivers/base/regmap/
H A DMakefile6 obj-$(CONFIG_REGMAP) += regcache-rbtree.o regcache-flat.o regcache-maple.o
H A Dregcache-rbtree.c176 DEFINE_SHOW_ATTRIBUTE(rbtree);
/linux/tools/perf/
H A DMANIFEST20 tools/lib/rbtree.c
/linux/tools/objtool/
H A DBuild35 $(OUTPUT)librbtree.o: ../lib/rbtree.c FORCE
/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/block/
H A Ddeadline-iosched.rst69 rbtree front sector lookup when the io scheduler merge function is called.
/linux/tools/perf/util/
H A DBuild44 perf-util-y += rbtree.o
400 $(OUTPUT)util/rbtree.o: ../lib/rbtree.c FORCE
/linux/tools/testing/selftests/hid/
H A DMakefile158 $(TOOLSDIR)/lib/rbtree.c \
/linux/drivers/android/binder/range_alloc/
H A Dtree.rs8 rbtree::{RBTree, RBTreeNode, RBTreeNodeReservation},
/linux/tools/testing/selftests/kvm/
H A DMakefile.kvm14 LIBKVM += 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), \

12