* Please see COPYING for details
*
* Copyright (c) 2004, Hannu Saransaari and Lauri Hakkarainen
- * Copyright (c) 2005-2009 Brenden Matthews, Philip Kovacs, et. al.
+ * Copyright (c) 2005-2010 Brenden Matthews, Philip Kovacs, et. al.
* (see AUTHORS)
* All rights reserved.
*
f = graph->graph_scale;
}
- graph->graph[0] = f; /* add new data */
/* shift all the data by 1 */
for (i = graph->graph_width - 1; i > 0; i--) {
graph->graph[i] = graph->graph[i - 1];
graph->graph_scale = graph->graph[i - 1];
}
}
- if (graph->scaled && graph->graph[graph->graph_width] > graph->graph_scale) {
+ graph->graph[0] = f; /* add new data */
+ if (graph->scaled && graph->graph[0] > graph->graph_scale) {
/* check if we need to update the scale */
- graph->graph_scale = graph->graph[graph->graph_width];
+ graph->graph_scale = graph->graph[0];
}
}
-void new_graph(struct text_object *obj, char *buf, double val)
+void new_graph(struct text_object *obj, char *buf, int buf_max_size, double val)
{
struct special_t *s = 0;
struct graph *g = obj->special_data;
if ((output_methods & TO_X) == 0)
return;
- if (!g)
+ if (!g || !buf_max_size)
return;
s = new_special(buf, GRAPH);
struct special_t *s = 0;
struct bar *b = obj->special_data;
- if ((output_methods & TO_X) == 0)
- return;
-
- if (!b)
- return;
-
s = new_special(buf, BAR);
s->arg = usage;
- s->width = b->width;
- s->height = b->height;
+ s->width = b ? b->width : default_bar_width;
+ s->height = b ? b->height : default_bar_height;
}
#endif /* X11 */