Searched refs:prio_tree_node (Results 1 – 3 of 3) sorted by relevance
7 struct prio_tree_node { struct8 struct prio_tree_node *left; argument9 struct prio_tree_node *right; argument10 struct prio_tree_node *parent; argument16 struct prio_tree_node *prio_tree_node; argument21 struct prio_tree_node *cur;42 (ptr)->prio_tree_node = NULL; \64 return root->prio_tree_node == NULL; in prio_tree_empty()67 static inline int prio_tree_root(const struct prio_tree_node *node) in prio_tree_root()72 static inline int prio_tree_left_empty(const struct prio_tree_node *node) in prio_tree_left_empty()[all …]
46 static void get_index(const struct prio_tree_node *node, in get_index()78 static struct prio_tree_node *prio_tree_expand(struct prio_tree_root *root, in prio_tree_expand()79 struct prio_tree_node *node, unsigned long max_heap_index) in prio_tree_expand()81 struct prio_tree_node *first = NULL, *prev, *last = NULL; in prio_tree_expand()93 first = root->prio_tree_node; in prio_tree_expand()94 prio_tree_remove(root, root->prio_tree_node); in prio_tree_expand()99 last = root->prio_tree_node; in prio_tree_expand()100 prio_tree_remove(root, root->prio_tree_node); in prio_tree_expand()116 last->left = root->prio_tree_node; in prio_tree_expand()120 root->prio_tree_node = node; in prio_tree_expand()[all …]
54 struct prio_tree_node node;728 struct prio_tree_node *ret; in graph_label_add_value()961 struct prio_tree_node *n; in graph_find_tooltip()