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; member21 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 …]
43 static void get_index(const struct prio_tree_node *node, in get_index()75 static struct prio_tree_node *prio_tree_expand(struct prio_tree_root *root, in prio_tree_expand()76 struct prio_tree_node *node, unsigned long max_heap_index) in prio_tree_expand()78 struct prio_tree_node *first = NULL, *prev, *last = NULL; in prio_tree_expand()90 first = root->prio_tree_node; in prio_tree_expand()91 prio_tree_remove(root, root->prio_tree_node); in prio_tree_expand()96 last = root->prio_tree_node; in prio_tree_expand()97 prio_tree_remove(root, root->prio_tree_node); in prio_tree_expand()113 last->left = root->prio_tree_node; in prio_tree_expand()117 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()