summaryrefslogtreecommitdiffabout
path: root/src/stat.c
blob: 434d19e22b315b2c6c6e20617e6a0148146128d8 (plain)
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
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
/* This file is part of tagr.
   Copyright (C) 2005, 2009 Sergey Poznyakoff

   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 3, 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, see <http://www.gnu.org/licenses/>. */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <glob.h>
#define obstack_chunk_alloc malloc
#define obstack_chunk_free free
#include <obstack.h>
#include <tagr.h>

double cut_out_fraction = TAGR_CUT_OUT;

typedef int (*ovf_t) (struct traffic_history *th, struct traffic_record *tr);

void
interpolate (queue_t *q,
	     time_t step, time_t now,
	     time_t last_time, struct traffic_history *last_rates,
	     time_t interval, double inrate, double outrate,
	     ovf_t ovf,
	     struct traffic_record *tr)
{
  time_t next;
  struct traffic_history th;

  if (now - last_time <= step)
    {
      th.time = now;
      th.inrate = inrate;
      th.outrate = outrate;
      verbose (3, _("insert %lu %g %g"), next, th.inrate, th.outrate);
      queue_put (q, &th);
      if (ovf)
	ovf (&th, tr);
      return;
    }
  
  for (next = last_time + step; next <= now; next += step)
    {
      th.time = next;
      th.inrate  = (inrate - last_rates->inrate) * (next - last_time)
	           / interval + last_rates->inrate;
      th.outrate = (outrate - last_rates->outrate) * (next - last_time)
	           / interval + last_rates->outrate;
      verbose (3, _("insert %lu %g %g"), next, th.inrate, th.outrate);
      queue_put (q, &th);
      if (ovf)
	ovf (&th, tr);
    }
}

int
overflow (struct traffic_history *th,
	  struct traffic_record *tr,
	  ovf_t ovf,
	  struct avg_acc *avg,
	  queue_t *q,
	  int step)
{
  time_t interval = th->time - avg->time;
  if (interval >= step)
    {
      struct traffic_history *lastp = queue_get_tail (q);
      if (lastp && interval < step * cut_out_fraction)
	interpolate (q,
		     step,
		     th->time,
		     avg->time,
		     lastp,
		     interval,
		     avg->inrate, avg->outrate,
		     ovf, tr);
      else
	{
	  struct traffic_history tmp;
	  tmp.time = avg->time;
	  tmp.inrate = avg->inrate;
	  tmp.outrate = avg->outrate;
	  verbose (3, _("insert %lu %g %g"),
		   tmp.time, tmp.inrate, tmp.outrate);
	  queue_put (q, &tmp);
	}
	  
      avg->inrate = avg->outrate = 0;
      avg->count = 0;
      avg->time = th->time;
    }
  avg->inrate = (avg->count * avg->inrate + th->inrate) / (avg->count + 1);
  avg->outrate = (avg->count * avg->outrate + th->outrate) / (avg->count + 1);
  avg->count++;  
}

int
ovf_monthly (struct traffic_history *th, struct traffic_record *tr)
{
  verbose (2, _("begin overflow_monthly %lu %g %g"),
	   th->time, th->inrate, th->outrate);
  overflow (th, tr, NULL, &tr->year_avg, &tr->year_hist,
	    YEAR_SAMPLE);
  verbose (2, _("end overflow_monthly"));
}

int
ovf_weekly (struct traffic_history *th, struct traffic_record *tr)
{
  verbose (2, _("begin overflow_weekly %lu %g %g"),
	   th->time, th->inrate, th->outrate);
  overflow (th, tr, ovf_monthly, &tr->month_avg, &tr->month_hist,
	    MONTH_SAMPLE);
  verbose (2, _("end overflow_daily"));
}

int
ovf_daily (struct traffic_history *th, struct traffic_record *tr)
{
  verbose (2, _("begin overflow_daily %lu %g %g"),
	   th->time, th->inrate, th->outrate);
  overflow (th, tr, ovf_weekly, &tr->week_avg, &tr->week_hist,
	    WEEK_SAMPLE);
  verbose (2, _("end overflow_daily"));
}

void
update_stats (struct monitor *mon, struct traffic_sample *sample,
	      struct traffic_record *tr)
{
  time_t interval;
  double inrate, outrate;
  
  struct traffic_history *lastp = queue_get_tail (&tr->day_hist);

  interval = sample->time - tr->last.time;
  if (interval == 0)
    {
      logmsg (L_ERR, _("ignoring zero interval"));
      return;
    }
  else if (interval < 0)
    {
      logmsg (L_ERR, _("ignoring negative interval"));
      return;
    }
    
  inrate = (double) sample->in / interval;
  outrate = (double) sample->out / interval;
  if (lastp && interval < DAY_SAMPLE * cut_out_fraction)
    {
      interpolate (&tr->day_hist,
		   DAY_SAMPLE,
		   sample->time,
		   tr->last.time,
		   &tr->last_rates,
		   interval,
		   inrate, outrate,
		   ovf_daily, tr);
    }
  else
    {
      struct traffic_history th;
      interval = sample->time - tr->last.time;
      th.time = sample->time;
      th.inrate = inrate;
      th.outrate = outrate;
      queue_put (&tr->day_hist, &th);
    }
  tr->last.time = sample->time;
  tr->last.in = sample->in;
  tr->last.out = sample->out;
  tr->last_rates.time = sample->time;
  tr->last_rates.inrate = inrate;
  tr->last_rates.outrate = outrate;
}




static void
compute_avg (struct avg_acc *avg, queue_t *q, struct traffic_sample *last)
{
  int i, n = queue_count (q);
  avg->inrate = avg->outrate = 0;
  avg->count = n;

  for (i = 0; i < n; i++)
    {
      struct traffic_history *th = queue_get_ptr (q, i);
      avg->inrate += th->inrate;
      avg->outrate += th->outrate;
    }
  avg->inrate /= n;
  avg->outrate /= n;
  avg->time = last->time;
}

static void
_convert (queue_t *q, ovf_t ovf,
	  struct traffic_record *tr, struct traffic_sample *hist, size_t count,
	  time_t sample_interval)
{
  size_t i;
  struct traffic_sample *hp;

  tr->last.time = hist[count-1].time - sample_interval;
  for (hp = hist + count - 1; hp >= hist; hp--)
    {
      time_t interval;
      double inrate, outrate;
      struct traffic_history *lastp = queue_get_tail (q);

      interval = hp->time - tr->last.time;
      inrate = (double) hp->in;
      outrate = (double) hp->out;

      if (interval == 0)
	{
	  logmsg (L_ERR, _("ignoring zero interval"));
	  break;
	}
      if (lastp)
	{
	  interpolate (q,
		       sample_interval,
		       hp->time,
		       tr->last.time,
		       &tr->last_rates,
		       interval,
		       inrate, outrate,
		       ovf, tr);
	}
      else
	{
	  struct traffic_history th;
	  interval = hp->time - tr->last.time;
	  th.time = hp->time;
	  th.inrate = inrate;
	  th.outrate = outrate;
	  queue_put (q, &th);
	}

      tr->last.time = hp->time;
      tr->last.in = hp->in;
      tr->last.out = hp->out;
      tr->last_rates.time = hp->time;
      tr->last_rates.inrate = inrate;
      tr->last_rates.outrate = outrate;
    }  
}

static void
convert_yearly (struct traffic_record *tr, struct traffic_sample *hp,
		size_t count)
{
  verbose (2, _("begin convert_yearly"));
  _convert (&tr->year_hist, NULL, tr,
	    hp, count, YEAR_SAMPLE);
  compute_avg (&tr->year_avg, &tr->year_hist, &tr->last);
  verbose (2, _("end convert_yearly"));
}

static void
convert_monthly (struct traffic_record *tr, struct traffic_sample *hp,
		 size_t count)
{
  verbose (2, _("begin convert_monthly"));
  if (count > MONTH_COUNT+1)
    convert_yearly (tr, hp + MONTH_COUNT + 1, count - (MONTH_COUNT + 1));
  _convert (&tr->month_hist, ovf_monthly, tr,
	    hp, MONTH_COUNT + 1, MONTH_SAMPLE);
  compute_avg (&tr->month_avg, &tr->month_hist, &tr->last);
  verbose (2, _("end convert_monthly"));
}

static void
convert_weekly (struct traffic_record *tr, struct traffic_sample *hp, size_t count)
{
  verbose (2, _("begin convert_weekly"));
  if (count > WEEK_COUNT+1)
    convert_monthly (tr, hp + WEEK_COUNT + 1, count - (WEEK_COUNT + 1));
  _convert (&tr->week_hist, ovf_weekly,
	    tr, hp, WEEK_COUNT + 1, WEEK_SAMPLE);
  compute_avg (&tr->week_avg, &tr->week_hist, &tr->last);
  verbose (2, _("end convert_weekly"));
}

static void
convert_daily (struct traffic_record *tr, struct traffic_sample *hp, size_t count)
{
  verbose (2, _("begin convert_daily"));
  if (count > DAY_COUNT+1)
    convert_weekly (tr, hp + DAY_COUNT + 1, count - (DAY_COUNT + 1));
  _convert (&tr->day_hist, ovf_daily, tr, hp, DAY_COUNT + 1, DAY_SAMPLE);
  verbose (2, _("end convert_daily"));
}

static void
convert_stats (struct monitor *mon, struct traffic_sample *last,
	       struct traffic_sample *hp, size_t count)
{
  struct traffic_record *trp, tr;

  memset (&tr, 0, sizeof tr);
  tr_init (&tr);
  
  convert_daily (&tr, hp, count);
  
  read_db (mon, &trp);
  *trp = tr;
  trp->last = *last;
  write_db (mon, trp);
  free (trp);
}

static int
import_log (const char *name)
{
  FILE *fp;
  int rc = 0;
  struct obstack stk;
  struct traffic_sample last, hist, *hp;
  unsigned long inmax, outmax;
  size_t count = 0;
  char *buf = NULL;
  size_t bufsize = 0;
  size_t line = 1;
  time_t cur;
  
  fp = fopen (name, "r");
  if (!fp)
    {
      logmsg (L_ERR, _("cannot open `%s': %s"), name, strerror (errno));
      return 1;
    }
  verbose (2, _("importing %s"), name);


  if (fscanf (fp, "%ld %lu %lu\n", &last.time, &last.in, &last.out) != 3)
    {
      logmsg (L_ERR, _("%s:1: unexpected number of fields"), name);
      fclose (fp);
      return 1;
    }
  cur = last.time;

  obstack_init (&stk);
  while (getline (&buf, &bufsize, fp) > 0)
    {
      int i;
      unsigned long rd[5];
      
      line++;
      
      if (sscanf (buf, "%lu %lu %lu %lu %lu",
		  &rd[0], &rd[1], &rd[2], &rd[3], &rd[4]) < 5)
	{
	  rd[3] = rd[1];
	  rd[4] = rd[2];
	}
	  
      for (i = 0; i <= 4; i++) 
	rd[i] = rd[i] < 0 ? 0 : rd[i];

      hist.time = rd[0];
      if (hist.time > cur)
	{
	  logmsg (L_WARNING, _("%s:%lu: is corrupted"), name, line);
	  break;
	}
      cur = hist.time;
      hist.in = rd[1];
      hist.out = rd[2];
      if (inmax < rd[3])
	inmax = rd[3];
      if (inmax < hist.in)
	inmax = hist.in;
      if (outmax < rd[4])
	outmax = rd[4];
      if (outmax < hist.out)
	outmax = hist.out;
      
      obstack_grow (&stk, &hist, sizeof (hist));
      count++;
    }
  fclose (fp);
  free (buf);
  
  hp = obstack_finish (&stk);
  if (count)
    {
      struct monitor *mon;

      char *p = strrchr (name, '/');
      char *base = xstrdup (p ? p + 1 : name);
      p = strrchr (base, '.');
      if (p)
	*p = 0;

      mon = find_monitor (base);
      if (!mon)
	{
	  logmsg (L_ERR, _("cannot find monitor `%s'"), base);
	  rc = 1;
	}
      else
	convert_stats (mon, &last, hp, count);
    }
  
  obstack_free (&stk, NULL);
  return rc;
}

void
import (const char *dirname)
{
  size_t count = 0;
  struct stat st;

  verbose (2, _("examining `%s'"), dirname);
  
  if (stat (dirname, &st))
    die (EX_OSERR, _("cannot stat file `%s': %s"),
	 dirname, strerror (errno));
  else if (S_ISREG (st.st_mode))
    {
      if (open_db (TAGR_DB_WR))
	exit (EX_UNAVAILABLE);
      if (import_log (dirname) == 0)
	count++;
      close_db ();
    }
  else if (S_ISDIR (st.st_mode))
    {
      char *pattern;
      glob_t gl;
      size_t i;
      int rc;
      
      pattern = mkfilename (dirname, "*/", "*.log");
      rc = glob (pattern, 0, NULL, &gl);
      free (pattern);

      switch (rc)
	{
	case 0:
	  if (open_db (TAGR_DB_WR))
	    exit (EX_UNAVAILABLE);
	  for (i = 0; i < gl.gl_pathc; i++)
	    if (import_log (gl.gl_pathv[i]) == 0)
	      count++;
	  globfree (&gl);
	  close_db ();
	  break;
	  
	case GLOB_NOSPACE:
	  die (EX_UNAVAILABLE, _("cannot scan directory: %s"),
	       strerror (ENOMEM));
	  
	case GLOB_ABORTED:
	  die (EX_UNAVAILABLE, _("scanning aborted"));
	  
	case GLOB_NOMATCH:
	  break;
	  
	default:
	  die (EX_UNAVAILABLE, _("cannot scan directory `%s'"), dirname);
	}
    }

  verbose (1, _("number of imported log files: %d"), count);
}

Return to:

Send suggestions and report system problems to the System administrator.