Lines Matching defs:node
54 struct prio_tree_node node;
693 node);
737 INIT_PRIO_TREE_NODE(&x->node);
738 x->node.start = minx;
739 x->node.last = maxx;
741 if (x->node.last == x->node.start) {
742 x->node.last += fabs(g->xtick_delta);
743 if (x->node.last == x->node.start)
744 x->node.last++;
748 * If ret != &x->node, we have an alias. Since the values
751 ret = prio_tree_insert(&i->prio_tree, &x->node);
752 if (ret != &x->node) {
755 alias = container_of(ret, struct graph_value, node);
858 struct flist_head *node;
861 flist_for_each(node, &g->label_list) {
862 i = flist_entry(node, struct graph_label, list);
995 v = container_of(n, struct graph_value, node);
