Home
last modified time | relevance | path

Searched full:rbtree (Results 1 – 17 of 17) sorted by relevance

/Zephyr-Core-3.5.0/tests/benchmarks/data_structure_perf/rbtree_perf/src/
Drbtree_perf.c22 static struct rbtree test_rbtree;
31 * @brief Test whether rbtree node struct is embedded
36 * - Define and initialize a rbtree, and test two features:
37 * first, rbtree node struct can be embedded in any user struct.
38 * last, rbtree can be walked though by some macro APIs.
47 * - Define a rbtree by using struct rbtree
53 * -# Define some arrays of rbtree nodes.And initialize
54 * the rbtree.
55 * -# Then inserting some nodes into the rbtree.
57 * rbtree by using the iteration APIs.
[all …]
/Zephyr-Core-3.5.0/doc/kernel/data_structures/
Drbtree.rst13 The :c:struct:`rbtree` tracking struct for a rbtree may be initialized
19 within an rbtree must be provided as a predicate function by the user.
21 ``lessthan_fn`` field of the :c:struct:`rbtree` struct before any tree
28 As with the slist and dlist containers, nodes within an rbtree are
46 rbtree. The first, :c:func:`rb_walk`, is a simple callback implementation
69 As described, the Zephyr rbtree implementation is a conventional
85 .. figure:: rbtree.png
87 :alt: rbtree example
90 A maximally unbalanced rbtree with a black height of two. No more
102 The :c:struct:`rbnode` struct for a Zephyr rbtree contains only two
[all …]
Dindex.rst35 rbtree.rst
/Zephyr-Core-3.5.0/include/zephyr/sys/
Drb.h91 struct rbtree { struct
117 struct rbnode *z_rb_get_minmax(struct rbtree *tree, uint8_t side); argument
122 void rb_insert(struct rbtree *tree, struct rbnode *node);
127 void rb_remove(struct rbtree *tree, struct rbnode *node);
132 static inline struct rbnode *rb_get_min(struct rbtree *tree) in rb_get_min()
140 static inline struct rbnode *rb_get_max(struct rbtree *tree) in rb_get_max()
154 bool rb_contains(struct rbtree *tree, struct rbnode *node);
158 * @brief Walk/enumerate a rbtree
165 static inline void rb_walk(struct rbtree *tree, rb_visit_t visit_fn, in rb_walk()
193 struct rbnode *z_rb_foreach_next(struct rbtree *tree, struct _rb_foreach *f);
[all …]
Dp4wq.h70 struct rbtree queue;
/Zephyr-Core-3.5.0/tests/benchmarks/data_structure_perf/rbtree_perf/
Dtestcase.yaml2 benchmark.data_structure_perf.rbtree:
5 - rbtree
DCMakeLists.txt5 project(rbtree) project
/Zephyr-Core-3.5.0/tests/unit/rbtree/
Dtestcase.yaml3 tags: rbtree
DCMakeLists.txt5 project(rbtree) project
Dmain.c16 static struct rbtree test_rbtree;
189 void checked_insert(struct rbtree *tree, struct rbnode *node) in checked_insert()
/Zephyr-Core-3.5.0/lib/os/
Drb.c10 * working on the rbtree code itself
79 static int find_and_stack(struct rbtree *tree, struct rbnode *node, in find_and_stack()
100 struct rbnode *z_rb_get_minmax(struct rbtree *tree, uint8_t side) in z_rb_get_minmax()
217 void rb_insert(struct rbtree *tree, struct rbnode *node) in rb_insert()
367 void rb_remove(struct rbtree *tree, struct rbnode *node) in rb_remove()
517 bool rb_contains(struct rbtree *tree, struct rbnode *node) in rb_contains()
557 struct rbnode *z_rb_foreach_next(struct rbtree *tree, struct _rb_foreach *f) in z_rb_foreach_next()
/Zephyr-Core-3.5.0/include/zephyr/kernel/internal/
Dsched_priq.h38 struct rbtree tree;
/Zephyr-Core-3.5.0/tests/unit/winstream/
Dmain.c9 * Or so I gather from tests/unit/rbtree ...
/Zephyr-Core-3.5.0/kernel/
DKconfig318 are not otherwise using the rbtree somewhere) requires an
361 SCHED_SCALABLE) if the rbtree is not used elsewhere in the
/Zephyr-Core-3.5.0/doc/releases/
Drelease-notes-1.12.rst615 * :github:`7264` - [Coverity CID :185391] Incorrect expression in /tests/lib/rbtree/src/main.c
654 * :github:`7511` - [Coverity CID :185391] Incorrect expression in /tests/lib/rbtree/src/main.c
Drelease-notes-2.6.rst1048 * Testcases of data structure include stack, queue, ringbuffer and rbtree.
1665 * :github:`33239` - lib/rbtree: Remove dead case in rb_remove()
Drelease-notes-2.4.rst1345 * :github:`26619` - tests/unit/rbtree fails