Lines Matching full:graph_value
52 struct graph_value {
190 struct graph_value *i;
192 i = flist_entry(entry, struct graph_value, list);
250 struct graph_value *i;
252 i = flist_entry(entry, struct graph_value, list);
488 typedef double (*xy_value_extractor)(struct graph_value *v);
490 static double getx(struct graph_value *v)
496 static double gety(struct graph_value *v)
506 struct graph_value *j;
514 j = flist_entry(jentry, struct graph_value, list);
533 struct graph_value *j;
599 j = flist_entry(entry, struct graph_value, list);
668 static void __graph_value_drop(struct graph_label *l, struct graph_value *v)
678 static void graph_value_drop(struct graph_label *l, struct graph_value *v)
690 v = flist_entry(v->alias.next, struct graph_value, alias);
699 struct graph_value *a;
701 a = flist_entry(v->alias.next, struct graph_value, alias);
714 struct graph_value *x;
753 struct graph_value *alias;
755 alias = container_of(ret, struct graph_value, node);
776 x = flist_entry(i->value_list.next, struct graph_value, list);
805 struct graph_value *v;
807 v = flist_entry(entry, struct graph_value, list);
836 struct graph_value *i;
839 i = flist_entry(l->value_list.next, struct graph_value, list);
962 struct graph_value *best = NULL;
992 struct graph_value *v, *rootv;
995 v = container_of(n, struct graph_value, node);
1013 v = flist_entry(v->alias.next, struct graph_value, alias);
