Searched refs:prio_tree_root (Results 1 – 3 of 3) sorted by relevance
15 struct prio_tree_root { struct26 struct prio_tree_root *root; argument32 struct prio_tree_root *root, uint64_t r_index, uint64_t h_index) in prio_tree_iter_init()62 static inline int prio_tree_empty(const struct prio_tree_root *root) in prio_tree_empty()67 static inline int prio_tree_root(const struct prio_tree_node *node) in prio_tree_root() function83 struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root,85 struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root,87 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node);
75 static struct prio_tree_node *prio_tree_expand(struct prio_tree_root *root, in prio_tree_expand()124 struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root, in prio_tree_replace()129 if (prio_tree_root(old)) { in prio_tree_replace()168 struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root, in prio_tree_insert()245 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node) in prio_tree_remove()274 if (prio_tree_root(cur)) { in prio_tree_remove()401 struct prio_tree_root *root; in prio_tree_first()451 while (!prio_tree_root(iter->cur) && in prio_tree_next()455 if (prio_tree_root(iter->cur)) in prio_tree_next()
65 struct prio_tree_root prio_tree;