Lines Matching full:graph_label
61 struct graph_label {
157 static int count_values(struct graph_label *l)
180 static double find_double_values(struct graph_label *l, double_comparator cmp)
207 struct graph_label *i;
215 i = flist_entry(entry, struct graph_label, list);
237 static void draw_bars(struct graph *bg, cairo_t *cr, struct graph_label *lb,
442 struct graph_label *lb;
474 lb = flist_entry(entry, struct graph_label, list);
505 struct graph_label *i;
511 i = flist_entry(entry, struct graph_label, list);
532 struct graph_label *i;
592 i = flist_entry(lentry, struct graph_label, list);
636 static struct graph_label *graph_find_label(struct graph *bg,
640 struct graph_label *i;
643 i = flist_entry(entry, struct graph_label, list);
654 struct graph_label *i;
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)
710 static void graph_label_add_value(struct graph_label *i, void *value,
790 struct graph_label *i = label;
800 static int graph_nonzero_y(struct graph_label *l)
818 struct graph_label *i = label;
834 static void graph_free_values(struct graph_label *l)
846 struct graph_label *i;
849 i = flist_first_entry(&g->label_list, struct graph_label, list);
859 struct graph_label *i;
862 i = flist_entry(node, struct graph_label, list);
870 struct graph_label *i = label;
935 struct graph_label *i;
938 i = flist_entry(entry, struct graph_label, list);
978 struct graph_label *i;
980 i = flist_entry(entry, struct graph_label, list);
