Home
last modified time | relevance | path

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

12

/OK3568_Linux_fs/kernel/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.rst39 rbtree
/OK3568_Linux_fs/kernel/drivers/gpu/arm/midgard/
H A Dmali_kbase_mem.c49 struct rb_root *rbtree = NULL; in kbase_reg_flags_to_rbtree() local
53 rbtree = &kctx->reg_rbtree_custom; in kbase_reg_flags_to_rbtree()
56 rbtree = &kctx->reg_rbtree_exec; in kbase_reg_flags_to_rbtree()
59 rbtree = &kctx->reg_rbtree_same; in kbase_reg_flags_to_rbtree()
62 rbtree = &kctx->reg_rbtree_same; in kbase_reg_flags_to_rbtree()
66 return rbtree; in kbase_reg_flags_to_rbtree()
74 struct rb_root *rbtree = NULL; in kbase_gpu_va_to_rbtree() local
80 rbtree = &kctx->reg_rbtree_custom; in kbase_gpu_va_to_rbtree()
82 rbtree = &kctx->reg_rbtree_exec; in kbase_gpu_va_to_rbtree()
84 rbtree = &kctx->reg_rbtree_same; in kbase_gpu_va_to_rbtree()
[all …]
H A Dmali_kbase_debug_mem_view.c158 static int debug_mem_zone_open(struct rb_root *rbtree, in debug_mem_zone_open() argument
166 for (p = rb_first(rbtree); p; p = rb_next(p)) { in debug_mem_zone_open()
/OK3568_Linux_fs/kernel/drivers/gpu/arm/bifrost/
H A Dmali_kbase_mem.c110 struct rb_root *rbtree = NULL; in kbase_gpu_va_to_rbtree() local
122 rbtree = &kctx->reg_rbtree_fixed; in kbase_gpu_va_to_rbtree()
123 return rbtree; in kbase_gpu_va_to_rbtree()
125 rbtree = &kctx->reg_rbtree_exec_fixed; in kbase_gpu_va_to_rbtree()
126 return rbtree; in kbase_gpu_va_to_rbtree()
130 rbtree = &kctx->reg_rbtree_exec; in kbase_gpu_va_to_rbtree()
144 rbtree = &kctx->reg_rbtree_custom; in kbase_gpu_va_to_rbtree()
146 rbtree = &kctx->reg_rbtree_same; in kbase_gpu_va_to_rbtree()
149 return rbtree; in kbase_gpu_va_to_rbtree()
158 struct rb_root *rbtree = NULL; in kbase_region_tracker_insert() local
[all …]
H A Dmali_kbase_debug_mem_allocs.c46 static void debug_zone_mem_allocs_show(char *zone, struct rb_root *rbtree, struct seq_file *sfile) in debug_zone_mem_allocs_show() argument
62 for (p = rb_first(rbtree); p; p = rb_next(p)) { in debug_zone_mem_allocs_show()
H A Dmali_kbase_mem.h446 struct rb_root *rbtree; member
1368 void kbase_region_tracker_term_rbtree(struct rb_root *rbtree);
1373 struct rb_root *rbtree, u64 gpu_addr);
1387 struct kbase_va_region *kbase_find_region_base_address(struct rb_root *rbtree,
1390 struct kbase_va_region *kbase_alloc_free_region(struct kbase_device *kbdev, struct rb_root *rbtree,
H A Dmali_kbase_debug_mem_view.c192 static int debug_mem_zone_open(struct rb_root *rbtree, in debug_mem_zone_open() argument
200 for (p = rb_first(rbtree); p; p = rb_next(p)) { in debug_mem_zone_open()
H A Dmali_kbase_mem_linux.c294 struct rb_root *rbtree; in kbase_mem_alloc() local
365 rbtree = &kctx->reg_rbtree_same; in kbase_mem_alloc()
372 rbtree = &kctx->reg_rbtree_exec_fixed; in kbase_mem_alloc()
375 rbtree = &kctx->reg_rbtree_fixed; in kbase_mem_alloc()
381 rbtree = &kctx->reg_rbtree_exec; in kbase_mem_alloc()
384 rbtree = &kctx->reg_rbtree_custom; in kbase_mem_alloc()
388 reg = kbase_alloc_free_region(kctx->kbdev, rbtree, PFN_DOWN(*gpu_va), va_pages, zone); in kbase_mem_alloc()
1580 struct rb_root *rbtree; in kbase_mem_from_user_buffer() local
1646 rbtree = &kctx->reg_rbtree_same; in kbase_mem_from_user_buffer()
1648 rbtree = &kctx->reg_rbtree_custom; in kbase_mem_from_user_buffer()
[all …]
/OK3568_Linux_fs/kernel/scripts/gdb/linux/
H A Dtimerlist.py10 from linux import rbtree
47 curr = curr.address.cast(rbtree.rb_node_type.get_type().pointer())
51 curr = rbtree.rb_next(curr)
/OK3568_Linux_fs/yocto/poky/meta/recipes-kernel/blktrace/
H A Dblktrace_git.bb28 # 1) ../rbtree.o: error adding symbols: Invalid operation
34 # 3) ld: rbtree.o: invalid string offset 128 >= 125 for section `.strtab'
/OK3568_Linux_fs/kernel/tools/lib/lockdep/
H A DBuild1 liblockdep-y += common.o lockdep.o preload.o rbtree.o
/OK3568_Linux_fs/kernel/tools/bpf/resolve_btfids/
H A DBuild2 resolve_btfids-y += rbtree.o
/OK3568_Linux_fs/kernel/scripts/gdb/
H A Dvmlinux-gdb.py33 import linux.rbtree
/OK3568_Linux_fs/kernel/tools/perf/
H A DMANIFEST14 tools/lib/rbtree.c
/OK3568_Linux_fs/kernel/drivers/base/regmap/
H A DMakefile6 obj-$(CONFIG_REGMAP) += regcache-rbtree.o regcache-flat.o
/OK3568_Linux_fs/kernel/tools/objtool/
H A DBuild35 $(OUTPUT)librbtree.o: ../lib/rbtree.c FORCE
/OK3568_Linux_fs/kernel/tools/perf/util/
H A Dpython-ext-sources32 ../lib/rbtree.c
H A DBuild31 perf-y += rbtree.o
293 $(OUTPUT)util/rbtree.o: ../lib/rbtree.c FORCE
/OK3568_Linux_fs/kernel/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
/OK3568_Linux_fs/kernel/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
/OK3568_Linux_fs/kernel/Documentation/scheduler/
H A Dsched-design-CFS.rst57 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
71 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
82 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
/OK3568_Linux_fs/u-boot/lib/
H A DMakefile44 obj-$(CONFIG_RBTREE) += rbtree.o
/OK3568_Linux_fs/kernel/Documentation/block/
H A Ddeadline-iosched.rst69 rbtree front sector lookup when the io scheduler merge function is called.
/OK3568_Linux_fs/kernel/Documentation/dev-tools/
H A Dkmemleak.rst86 information like size and stack trace, are stored in a rbtree.
102 the values against the addresses stored in the rbtree. If

12