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