1 /* Conky, a system monitor, based on torsmo
3 * Any original torsmo code is licensed under the BSD license
5 * All code written since the fork of torsmo is licensed under the GPL
7 * Please see COPYING for details
9 * Copyright (c) 2004, Hannu Saransaari and Lauri Hakkarainen
10 * Copyright (c) 2005-2008 Brenden Matthews, Philip Kovacs, et. al.
12 * All rights reserved.
14 * This program is free software: you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation, either version 3 of the License, or
17 * (at your option) any later version.
19 * This program is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
23 * You should have received a copy of the GNU General Public License
24 * along with this program. If not, see <http://www.gnu.org/licenses/>.
36 /* maximum number of special things, e.g. fonts, offsets, aligns, etc. */
37 unsigned int max_specials = MAX_SPECIALS_DEFAULT;
39 /* create specials array on heap instead of stack with introduction of
41 struct special_t *specials = NULL;
43 unsigned int special_count;
46 * Scanning arguments to various special text objects
49 const char *scan_gauge(const char *args, int *w, int *h)
55 /* gauge's argument is either height or height,width */
59 if (sscanf(args, "%d,%d %n", h, w, &n) <= 1) {
60 sscanf(args, "%d %n", h, &n);
61 *w = *h; /*square gauge*/
69 const char *scan_bar(const char *args, int *w, int *h)
71 /* zero width means all space that is available */
74 /* bar's argument is either height or height,width */
78 if (sscanf(args, "%d,%d %n", h, w, &n) <= 1) {
79 sscanf(args, "%d %n", h, &n);
87 char *scan_font(const char *args)
90 return strndup(args, DEFAULT_TEXT_BUFFER_SIZE);
96 char *scan_graph(const char *args, int *w, int *h,
97 unsigned int *first_colour, unsigned int *last_colour,
98 unsigned int *scale, char *showaslog)
100 const char *nographtype;
104 /* zero width means all space that is available */
111 //set showaslog and place the rest of the args in nographtype
112 if(strcasecmp(args, LOGGRAPH) == EQUAL) {
115 }else if(strcasecmp(args, NORMGRAPH) == EQUAL) {
118 }else if(strncasecmp(args, LOGGRAPH" ", strlen(LOGGRAPH) + 1 ) == EQUAL) {
120 nographtype = &args[strlen(LOGGRAPH) + 1];
121 }else if(strncasecmp(args, NORMGRAPH" ", strlen(NORMGRAPH) + 1 ) == EQUAL) {
123 nographtype = &args[strlen(NORMGRAPH) + 1];
128 DBGP("printing graph as %s, other args are: %s", (*showaslog ? "log" : "normal"), nographtype);
129 //check the rest of the args
130 if (sscanf(nographtype, "%d,%d %x %x %u", h, w, first_colour, last_colour, scale) == 5) {
134 if (sscanf(nographtype, "%d,%d %x %x", h, w, first_colour, last_colour) == 4) {
137 if (sscanf(nographtype, "%63s %d,%d %x %x %u", buf, h, w, first_colour, last_colour, scale) == 6) {
138 return strndup(buf, text_buffer_size);
141 if (sscanf(nographtype, "%63s %d,%d %x %x", buf, h, w, first_colour, last_colour) == 5) {
142 return strndup(buf, text_buffer_size);
147 if (sscanf(nographtype, "%x %x %u", first_colour, last_colour, scale) == 3) {
151 if (sscanf(nographtype, "%x %x", first_colour, last_colour) == 2) {
154 if (sscanf(nographtype, "%63s %x %x %u", buf, first_colour, last_colour, scale) == 4) {
155 return strndup(buf, text_buffer_size);
158 if (sscanf(nographtype, "%63s %x %x", buf, first_colour, last_colour) == 3) {
159 return strndup(buf, text_buffer_size);
164 if (sscanf(nographtype, "%d,%d %u", h, w, scale) == 3) {
168 if (sscanf(nographtype, "%d,%d", h, w) == 2) {
171 if (sscanf(nographtype, "%63s %d,%d %u", buf, h, w, scale) < 4) {
173 //TODO: check the return value and throw an error?
174 sscanf(nographtype, "%63s %d,%d", buf, h, w);
177 return strndup(buf, text_buffer_size);
180 if (buf[0] == '\0') {
183 return strndup(buf, text_buffer_size);
188 * Printing various special text objects
191 static struct special_t *new_special(char *buf, enum special_types t)
193 if (special_count >= max_specials) {
194 CRIT_ERR("too many special things in text");
197 buf[0] = SPECIAL_CHAR;
199 specials[special_count].type = t;
200 return &specials[special_count++];
203 void new_gauge(char *buf, int w, int h, int usage)
205 struct special_t *s = new_special(buf, GAUGE);
207 s->arg = (usage > 255) ? 255 : ((usage < 0) ? 0 : usage);
212 void new_bar(char *buf, int w, int h, int usage)
214 struct special_t *s = new_special(buf, BAR);
216 s->arg = (usage > 255) ? 255 : ((usage < 0) ? 0 : usage);
221 void new_font(char *buf, char *args)
223 if ((output_methods & TO_X) == 0)
227 struct special_t *s = new_special(buf, FONT);
229 if (s->font_added > font_count || !s->font_added || (strncmp(args, fonts[s->font_added].name, DEFAULT_TEXT_BUFFER_SIZE) != EQUAL) ) {
230 int tmp = selected_font;
232 selected_font = s->font_added = addfont(args);
237 struct special_t *s = new_special(buf, FONT);
238 int tmp = selected_font;
240 selected_font = s->font_added = 0;
250 static void graph_append(struct special_t *graph, double f, char showaslog)
260 if (!graph->scaled && f > graph->graph_scale) {
261 f = graph->graph_scale;
264 /* Already happens in new_graph
266 graph->graph_scale = 1;
269 graph->graph[0] = f; /* add new data */
270 /* shift all the data by 1 */
271 for (i = graph->graph_width - 1; i > 0; i--) {
272 graph->graph[i] = graph->graph[i - 1];
273 if (graph->scaled && graph->graph[i] > graph->graph_scale) {
274 /* check if we need to update the scale */
275 graph->graph_scale = graph->graph[i];
280 void new_graph(char *buf, int w, int h, unsigned int first_colour,
281 unsigned int second_colour, double i, int scale, int append, char showaslog)
283 struct special_t *s = new_special(buf, GRAPH);
286 if (s->graph == NULL) {
287 if (s->width > 0 && s->width < MAX_GRAPH_DEPTH) {
288 // subtract 2 for the box
289 s->graph_width = s->width /* - 2 */;
291 s->graph_width = MAX_GRAPH_DEPTH - 2;
293 s->graph = malloc(s->graph_width * sizeof(double));
294 memset(s->graph, 0, s->graph_width * sizeof(double));
295 s->graph_scale = 100;
298 s->first_colour = adjust_colors(first_colour);
299 s->last_colour = adjust_colors(second_colour);
302 s->graph_scale = scale;
310 s->graph_width = s->width - 2; // subtract 2 for rectangle around
314 s->graph_scale = log10(s->graph_scale + 1);
318 graph_append(s, i, showaslog);
322 void new_hr(char *buf, int a)
324 new_special(buf, HORIZONTAL_LINE)->height = a;
327 void new_stippled_hr(char *buf, int a, int b)
329 struct special_t *s = new_special(buf, STIPPLED_HR);
335 void new_fg(char *buf, long c)
337 new_special(buf, FG)->arg = c;
340 void new_bg(char *buf, long c)
342 new_special(buf, BG)->arg = c;
345 void new_outline(char *buf, long c)
347 new_special(buf, OUTLINE)->arg = c;
350 void new_offset(char *buf, long c)
352 new_special(buf, OFFSET)->arg = c;
355 void new_voffset(char *buf, long c)
357 new_special(buf, VOFFSET)->arg = c;
360 void new_alignr(char *buf, long c)
362 new_special(buf, ALIGNR)->arg = c;
365 // A postive offset pushes the text further left
366 void new_alignc(char *buf, long c)
368 new_special(buf, ALIGNC)->arg = c;
371 void new_goto(char *buf, long c)
373 new_special(buf, GOTO)->arg = c;
376 void new_tab(char *buf, int a, int b)
378 struct special_t *s = new_special(buf, TAB);