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
|
// Copyright (C) 2009-2010 David Sugar, Tycho Softworks.
//
// 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 of the License, 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/>.
#include <config.h>
#include <ucommon/ucommon.h>
#include <ucommon/export.h>
#include <sipwitch/stats.h>
#include <sipwitch/control.h>
using namespace SIPWITCH_NAMESPACE;
using namespace UCOMMON_NAMESPACE;
static unsigned used = 0, total = 7;
static stats *base = NULL;
static class __LOCAL sta : public mapped_array<stats>
{
public:
sta();
void init(void);
} shm;
sta::sta() : mapped_array<stats>()
{
}
void sta::init(void)
{
const char *statmap = control::env("statmap");
::remove(statmap);
create(statmap, total);
}
stats *stats::create(void)
{
shm.init();
base = request("system");
request("extension");
request("service");
request("gateway");
request("external");
request("other");
return base;
}
stats *stats::request(const char *id)
{
assert(id && *id);
if(used >= total)
return NULL;
stats *node = shm(used++);
snprintf(node->id, sizeof(node->id), "%s", id);
return node;
}
void stats::allocate(unsigned count)
{
assert(count > 0);
total += count;
}
unsigned stats::active(void) const
{
return data[0].current + data[1].current;
}
void stats::assign(stat_t entry)
{
Mutex::protect(this);
++data[entry].period;
++data[entry].total;
++data[entry].current;
if(data[entry].current > data[entry].peak)
data[entry].peak = data[entry].current;
if(data[entry].current > data[entry].max)
data[entry].max = data[entry].current;
Mutex::release(this);
if(this != base)
base->assign(entry);
}
void stats::release(void)
{
shm.release();
shm.remove(control::env("statmap"));
}
void stats::release(stat_t entry)
{
Mutex::protect(this);
if(active() == 1)
time(&lastcall);
--data[entry].current;
if(data[entry].current < data[entry].min)
data[entry].min = data[entry].current;
Mutex::release(this);
if(this != base)
base->release(entry);
}
void stats::period(FILE *fp)
{
unsigned pos = 0;
char text[80];
size_t len;
time_t last;
while(pos < total) {
stats *node = shm(pos++);
if(!node->id[0])
continue;
if(fp) {
snprintf(text, sizeof(text), " %-12s", node->id);
len = strlen(text);
}
else
len = 0;
Mutex::protect(node);
for(unsigned entry = 0; entry < 2; ++entry) {
if(fp) {
snprintf(text + len, sizeof(text) - len, " %09lu %05hu %05hu",
node->data[entry].period, node->data[entry].min, node->data[entry].max);
len = strlen(text);
}
node->data[entry].pperiod = node->data[entry].period;
node->data[entry].pmin = node->data[entry].min;
node->data[entry].pmax = node->data[entry].max;
node->data[entry].min = node->data[entry].max = node->data[entry].current;
node->data[entry].period = 0;
}
last = node->lastcall;
Mutex::release(node);
if(fp)
fprintf(fp, "%s %ld\n", text, (long)last);
}
}
|
