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
|
/*
* Copyright (c) 2011 Eric Faurot <eric@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/queue.h>
#include <sys/tree.h>
#include <sys/param.h>
#include <event.h>
#include <imsg.h>
#include <stdio.h>
#include "smtpd.h"
static struct stat_counter *counters = NULL;
static int ncounter = 0;
void
stat_init(struct stat_counter *c, int n)
{
counters = c;
ncounter = n;
}
size_t
stat_increment(int stat)
{
if (stat < 0 || stat >= ncounter)
return (-1);
counters[stat].count++;
if (++counters[stat].active > counters[stat].maxactive)
counters[stat].maxactive = counters[stat].active;
return (counters[stat].active);
}
size_t
stat_decrement(int stat)
{
if (stat < 0 || stat >= ncounter)
return (-1);
counters[stat].active--;
return (counters[stat].active);
}
size_t
stat_get(int stat, int what)
{
if (stat < 0 || stat >= ncounter)
return (-1);
switch (what) {
case STAT_COUNT:
return counters[stat].count;
case STAT_ACTIVE:
return counters[stat].active;
case STAT_MAXACTIVE:
return counters[stat].maxactive;
default:
return (-1);
}
}
|
