Searched refs:rbnode (Results 1 – 11 of 11) sorted by relevance
| /Zephyr-Core-3.5.0/include/zephyr/sys/ |
| D | rb.h | 58 struct rbnode { struct
60 struct rbnode *children[2]; argument
86 typedef bool (*rb_lessthan_t)(struct rbnode *a, struct rbnode *b);
93 struct rbnode *root;
99 struct rbnode *iter_stack[Z_MAX_RBTREE_DEPTH];
110 typedef void (*rb_visit_t)(struct rbnode *node, void *cookie);
112 struct rbnode *z_rb_child(struct rbnode *node, uint8_t side);
113 int z_rb_is_black(struct rbnode *node);
115 void z_rb_walk(struct rbnode *node, rb_visit_t visit_fn, void *cookie);
117 struct rbnode *z_rb_get_minmax(struct rbtree *tree, uint8_t side);
[all …]
|
| D | p4wq.h | 39 struct rbnode rbnode; member
|
| /Zephyr-Core-3.5.0/lib/os/ |
| D | rb.c | 21 static struct rbnode *get_child(struct rbnode *n, uint8_t side) in get_child()
31 return (struct rbnode *) l; in get_child()
34 static void set_child(struct rbnode *n, uint8_t side, void *val) in set_child()
47 static enum rb_color get_color(struct rbnode *n) in get_color()
53 static bool is_black(struct rbnode *n) in is_black()
58 static bool is_red(struct rbnode *n) in is_red()
63 static void set_color(struct rbnode *n, enum rb_color color) in set_color()
79 static int find_and_stack(struct rbtree *tree, struct rbnode *node, in find_and_stack()
80 struct rbnode **stack) in find_and_stack()
88 struct rbnode *ch = get_child(stack[sz - 1], side); in find_and_stack()
[all …]
|
| D | p4wq.c | 26 static bool rb_lessthan(struct rbnode *a, struct rbnode *b) in rb_lessthan()
28 struct k_p4wq_work *aw = CONTAINER_OF(a, struct k_p4wq_work, rbnode); in rb_lessthan()
29 struct k_p4wq_work *bw = CONTAINER_OF(b, struct k_p4wq_work, rbnode); in rb_lessthan()
83 struct rbnode *r = rb_get_max(&queue->queue); in p4wq_loop()
87 = CONTAINER_OF(r, struct k_p4wq_work, rbnode); in p4wq_loop()
238 rb_insert(&queue->queue, &item->rbnode); in k_p4wq_submit()
245 if (rb_get_max(&queue->queue) != &item->rbnode) { in k_p4wq_submit()
298 bool ret = rb_contains(&queue->queue, &item->rbnode); in k_p4wq_cancel()
301 rb_remove(&queue->queue, &item->rbnode); in k_p4wq_cancel()
|
| /Zephyr-Core-3.5.0/tests/benchmarks/data_structure_perf/rbtree_perf/src/ |
| D | rbtree_perf.c | 18 struct rbnode node;
21 static struct rbnode nodes[TREE_SIZE];
25 bool node_lessthan(struct rbnode *a, struct rbnode *b) in node_lessthan()
79 struct rbnode *foreach_node; in ZTEST()
116 static int search_height_recurse(struct rbnode *node, struct rbnode in search_height_recurse()
128 struct rbnode *ch = z_rb_child(node, in search_height_recurse()
134 static void verify_rbtree_perf(struct rbnode *root, struct rbnode *test) in verify_rbtree_perf()
192 struct rbnode *root = test_rbtree.root; in ZTEST()
193 struct rbnode *test = NULL; in ZTEST()
|
| /Zephyr-Core-3.5.0/tests/unit/rbtree/ |
| D | main.c | 18 static struct rbnode nodes[MAX_NODES];
24 static struct rbnode *walked_nodes[MAX_NODES];
27 static struct rbnode *current_insertee;
46 int node_index(struct rbnode *n) in node_index()
52 bool node_lessthan(struct rbnode *a, struct rbnode *b) in node_lessthan()
77 void visit_node(struct rbnode *node, void *cookie) in visit_node()
92 void check_rbnode(struct rbnode *node, int blacks_above) in check_rbnode()
97 struct rbnode *ch = z_rb_child(node, side); in check_rbnode()
138 struct rbnode *n, *last = NULL; in _check_tree()
189 void checked_insert(struct rbtree *tree, struct rbnode *node) in checked_insert()
[all …]
|
| /Zephyr-Core-3.5.0/include/zephyr/ |
| D | kernel_structs.h | 235 extern bool z_priq_rb_lessthan(struct rbnode *a, struct rbnode *b);
|
| /Zephyr-Core-3.5.0/doc/kernel/data_structures/ |
| D | rbtree.rst | 29 represented as a :c:struct:`rbnode` structure which exists in
32 rbnode is entirely opaque. It is not possible for the user to extract
97 internal "data" pointers, but because the Zephyr :c:struct:`rbnode` is
102 The :c:struct:`rbnode` struct for a Zephyr rbtree contains only two
|
| /Zephyr-Core-3.5.0/include/zephyr/kernel/ |
| D | thread.h | 63 struct rbnode qnode_rb;
|
| /Zephyr-Core-3.5.0/kernel/ |
| D | sched.c | 1181 bool z_priq_rb_lessthan(struct rbnode *a, struct rbnode *b) in z_priq_rb_lessthan()
1238 struct rbnode *n = rb_get_min(&pq->tree); in z_priq_rb_best()
|
| /Zephyr-Core-3.5.0/doc/releases/ |
| D | release-notes-2.7.rst | 1698 * :github:`36061` - Undefined reference to ``z_priq_rb_lessthan(rbnode*, rbnode*)`` when using k_ti…
|
