1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
|
/* $Id: processor.c,v 1.5 2000/04/15 11:56:35 reinelt Exp $
*
* main data processing
*
* Copyright 1999, 2000 by Michael Reinelt (reinelt@eunet.at)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*
* $Log: processor.c,v $
* Revision 1.5 2000/04/15 11:56:35 reinelt
*
* more debug messages
*
* Revision 1.4 2000/04/15 11:13:54 reinelt
*
* added '-d' (debugging) switch
* added several debugging messages
* removed config entry 'Delay' for HD44780 driver
* delay loop for HD44780 will be calibrated automatically
*
* Revision 1.3 2000/04/01 16:22:38 reinelt
*
* bug that caused a segfault in processor.c fixed (thanks to herp)
*
* Revision 1.2 2000/03/23 07:24:48 reinelt
*
* PPM driver up and running (but slow!)
*
* Revision 1.1 2000/03/22 07:33:50 reinelt
*
* FAQ added
* new modules 'processor.c' contains all data processing
*
*/
/*
* exported functions:
*
* void process_init (void);
* does all necessary initializations
*
* void process (int smooth);
* processes a whole screen
* bars will always be processed
* texts only if smooth=0
*
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "debug.h"
#include "cfg.h"
#include "system.h"
#include "isdn.h"
#include "parser.h"
#include "display.h"
#include "processor.h"
#define ROWS 16
char *row[ROWS];
int rows, cols, xres, yres, supported_bars;
int token_usage[256]={0,};
struct { int total, used, free, shared, buffer, cache, avail; } ram;
struct { double load1, load2, load3, overload; } load;
struct { double user, nice, system, idle; } busy;
struct { int read, write, total, max, peak; } disk;
struct { int rx, tx, total, max, peak; } net;
struct { int usage, in, out, total, max, peak; } isdn;
struct { double val, min, max; } sensor[SENSORS];
static double query (int token)
{
switch (token) {
case T_MEM_TOTAL:
return ram.total;
case T_MEM_USED:
return ram.used;
case T_MEM_FREE:
return ram.free;
case T_MEM_SHARED:
return ram.shared;
case T_MEM_BUFFER:
return ram.buffer;
case T_MEM_CACHE:
return ram.cache;
case T_MEM_AVAIL:
return ram.avail;
case T_LOAD_1:
return load.load1;
case T_LOAD_2:
return load.load2;
case T_LOAD_3:
return load.load3;
case T_CPU_USER:
return busy.user;
case T_CPU_NICE:
return busy.nice;
case T_CPU_SYSTEM:
return busy.system;
case T_CPU_BUSY:
return 1.0-busy.idle;
case T_CPU_IDLE:
return busy.idle;
case T_DISK_READ:
return disk.read;
case T_DISK_WRITE:
return disk.write;
case T_DISK_TOTAL:
return disk.total;
case T_DISK_MAX:
return disk.max;
case T_NET_RX:
return net.rx;
case T_NET_TX:
return net.tx;
case T_NET_TOTAL:
return net.total;
case T_NET_MAX:
return net.max;
case T_ISDN_IN:
return isdn.in;
case T_ISDN_OUT:
return isdn.out;
case T_ISDN_TOTAL:
return isdn.total;
case T_ISDN_MAX:
return isdn.max;
case T_SENSOR_1:
case T_SENSOR_2:
case T_SENSOR_3:
case T_SENSOR_4:
case T_SENSOR_5:
case T_SENSOR_6:
case T_SENSOR_7:
case T_SENSOR_8:
case T_SENSOR_9:
return sensor[token-T_SENSOR_1+1].val;
}
return 0.0;
}
static double query_bar (int token)
{
int i;
double value=query(token);
switch (token) {
case T_MEM_TOTAL:
case T_MEM_USED:
case T_MEM_FREE:
case T_MEM_SHARED:
case T_MEM_BUFFER:
case T_MEM_CACHE:
case T_MEM_AVAIL:
return value/ram.total;
case T_LOAD_1:
case T_LOAD_2:
case T_LOAD_3:
return value/load.overload;
case T_DISK_READ:
case T_DISK_WRITE:
case T_DISK_MAX:
return value/disk.peak;
case T_DISK_TOTAL:
return value/disk.peak/2.0;
case T_NET_RX:
case T_NET_TX:
case T_NET_MAX:
return value/net.peak;
case T_NET_TOTAL:
return value/net.peak/2.0;
case T_ISDN_IN:
case T_ISDN_OUT:
case T_ISDN_MAX:
return value/isdn.peak;
case T_ISDN_TOTAL:
return value/isdn.peak/2.0;
case T_SENSOR_1:
case T_SENSOR_2:
case T_SENSOR_3:
case T_SENSOR_4:
case T_SENSOR_5:
case T_SENSOR_6:
case T_SENSOR_7:
case T_SENSOR_8:
case T_SENSOR_9:
i=token-T_SENSOR_1+1;
return (value-sensor[i].min)/(sensor[i].max-sensor[i].min);
}
return value;
}
static void print_token (int token, char **p)
{
double val;
switch (token) {
case T_PERCENT:
*(*p)++='%';
break;
case T_DOLLAR:
*(*p)++='$';
break;
case T_OS:
*p+=sprintf (*p, "%s", System());
break;
case T_RELEASE:
*p+=sprintf (*p, "%s", Release());
break;
case T_CPU:
*p+=sprintf (*p, "%s", Processor());
break;
case T_RAM:
*p+=sprintf (*p, "%d", Memory());
break;
case T_OVERLOAD:
*(*p)++=load.load1>load.overload?'!':' ';
break;
case T_MEM_TOTAL:
case T_MEM_USED:
case T_MEM_FREE:
case T_MEM_SHARED:
case T_MEM_BUFFER:
case T_MEM_CACHE:
case T_MEM_AVAIL:
*p+=sprintf (*p, "%6.0f", query(token));
break;
case T_LOAD_1:
case T_LOAD_2:
case T_LOAD_3:
case T_SENSOR_1:
case T_SENSOR_2:
case T_SENSOR_3:
case T_SENSOR_4:
case T_SENSOR_5:
case T_SENSOR_6:
case T_SENSOR_7:
case T_SENSOR_8:
case T_SENSOR_9:
val=query(token);
if (val<10.0) {
*p+=sprintf (*p, "%4.2f", val);
} else if (val<100.0) {
*p+=sprintf (*p, "%4.1f", val);
} else {
*p+=sprintf (*p, "%4.0f", val);
}
break;
case T_CPU_USER:
case T_CPU_NICE:
case T_CPU_SYSTEM:
case T_CPU_BUSY:
case T_CPU_IDLE:
*p+=sprintf (*p, "%3.0f", 100.0*query(token));
break;
case T_ISDN_IN:
case T_ISDN_OUT:
case T_ISDN_MAX:
case T_ISDN_TOTAL:
if (isdn.usage)
*p+=sprintf (*p, "%4.0f", query(token));
else
*p+=sprintf (*p, "----");
break;
default:
*p+=sprintf (*p, "%4.0f", query(token));
}
}
static void collect_data (void)
{
int i;
if (token_usage[C_MEM]) {
Ram (&ram.total, &ram.free, &ram.shared, &ram.buffer, &ram.cache);
ram.used=ram.total-ram.free;
ram.avail=ram.free+ram.buffer+ram.cache;
}
if (token_usage[C_LOAD]) {
Load (&load.load1, &load.load2, &load.load3);
}
if (token_usage[C_CPU]) {
Busy (&busy.user, &busy.nice, &busy.system, &busy.idle);
}
if (token_usage[C_DISK]) {
Disk (&disk.read, &disk.write);
disk.total=disk.read+disk.write;
disk.max=disk.read>disk.write?disk.read:disk.write;
if (disk.max>disk.peak) disk.peak=disk.max;
}
if (token_usage[C_NET]) {
Net (&net.rx, &net.tx);
net.total=net.rx+net.tx;
net.max=net.rx>net.tx?net.rx:net.tx;
if (net.max>net.peak) net.peak=net.max;
}
if (token_usage[C_ISDN]) {
Isdn (&isdn.in, &isdn.out, &isdn.usage);
isdn.total=isdn.in+isdn.out;
isdn.max=isdn.in>isdn.out?isdn.in:isdn.out;
if (isdn.max>isdn.peak) isdn.peak=isdn.max;
}
for (i=1; i<SENSORS; i++) {
if (token_usage[T_SENSOR_1+i-1]) {
Sensor (i, &sensor[i].val, &sensor[i].min, &sensor[i].max);
}
}
}
static char *process_row (int r)
{
static char buffer[256];
char *s=row[r];
char *p=buffer;
do {
if (*s=='%') {
print_token (*(unsigned char*)++s, &p);
} else if (*s=='$') {
int i;
int type=*++s;
int len=*++s;
double val1=query_bar(*(unsigned char*)++s);
double val2=val1;
if (type & (BAR_H2 | BAR_V2))
val2=query_bar(*(unsigned char*)++s);
if (type & BAR_H)
lcd_bar (type, r, p-buffer+1, len*xres, val1*len*xres, val2*len*xres);
else
lcd_bar (type, r, p-buffer+1, len*yres, val1*len*yres, val2*len*yres);
if (type & BAR_H) {
for (i=0; i<len && p-buffer<cols; i++)
*p++='\t';
} else {
*p++='\t';
}
} else {
*p++=*s;
}
} while (*s++);
return buffer;
}
void process_init (void)
{
int i;
load.overload=atof(cfg_get("overload")?:"2.0");
lcd_query (&rows, &cols, &xres, &yres, &supported_bars);
debug ("%d rows, %d columns, %dx%d pixels\n", rows, cols, xres, yres);
for (i=1; i<=rows; i++) {
char buffer[8], *p;
snprintf (buffer, sizeof(buffer), "Row%d", i);
p=cfg_get(buffer)?:"";
debug ("%s: %s\n", buffer, p);
row[i]=strdup(parse(p, supported_bars, token_usage));
}
}
void process (int smooth)
{
int i;
char *txt;
collect_data();
for (i=1; i<=rows; i++) {
txt=process_row (i);
if (smooth==0)
lcd_put (i, 1, txt);
}
lcd_flush();
}
|