[292045]: common / cache.cpp Maximize Restore History

Download this file

cache.cpp    196 lines (166 with data), 4.6 kB

  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
// Copyright (C) 2006-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 <sipwitch-config.h>
#include <ucommon/ucommon.h>
#include <ucommon/export.h>
#include <sipwitch/cache.h>
#include <sipwitch/control.h>
using namespace SIPWITCH_NAMESPACE;
using namespace UCOMMON_NAMESPACE;
#define USER_KEY_SIZE 177
static mempager cache_heap(16384);
static LinkedObject *user_freelist = NULL;
static condlock_t user_lock;
static LinkedObject *user_keys[USER_KEY_SIZE];
Cache::Cache() :
LinkedObject()
{
time(&created);
}
UserCache::UserCache() :
Cache()
{
}
void Cache::expire(LinkedObject **root, LinkedObject **freelist)
{
Cache *prior = NULL;
Cache *node = (Cache *)*root;
Cache *next;
time_t now;
time(&now);
while(node) {
next = (Cache *)node->next;
if(node->expires && now > node->expires) {
if(!prior)
*root = next;
else
prior->next = next;
node->enlist(freelist);
}
else
prior = node;
node = next;
}
}
void cache::init(void)
{
memset(&user_keys, 0, sizeof(user_keys));
}
void cache::cleanup(void)
{
for(unsigned i = 0; i < USER_KEY_SIZE; ++i) {
user_lock.modify();
expire(&user_keys[i], &user_freelist);
user_lock.commit();
}
}
void cache::userdump(void)
{
FILE *fp = control::output("usercache");
char buffer[128];
time_t now;
if(!fp) {
shell::log(shell::ERR, "%s\n",
_TEXT("usercache; cannot access file"));
return;
}
for(unsigned i = 0; i < USER_KEY_SIZE; ++i) {
user_lock.access();
time(&now);
linked_pointer<UserCache> up = user_keys[i];
while(is(up)) {
if(!up->expires || up->expires > now) {
Socket::query((struct sockaddr *)(&up->address), buffer, sizeof(buffer));
if(up->expires)
fprintf(fp, "%s=%s; expires=%ld\n",
up->userid, buffer, (long)(up->expires - now));
else
fprintf(fp, "%s=%s\n", up->userid, buffer);
}
up.next();
}
user_lock.release();
}
fclose(fp);
}
UserCache *UserCache::request(const char *id)
{
assert(id != NULL && *id != 0);
linked_pointer<UserCache> up;
unsigned path = NamedObject::keyindex(id, USER_KEY_SIZE);
up = user_keys[path];
while(up) {
if(eq(up->userid, id))
break;
up.next();
}
return *up;
}
UserCache *UserCache::find(const char *id)
{
time_t now;
time(&now);
if(strchr(id, '@'))
return NULL;
user_lock.access();
UserCache *cp = request(id);
if(cp) {
if(!cp->expires || cp->expires > now)
return cp;
}
user_lock.release();
return NULL;
}
void UserCache::release(UserCache *entry)
{
if(entry)
user_lock.release();
}
void UserCache::add(const char *id, struct sockaddr *addr, time_t create, unsigned expire)
{
assert(id != NULL && *id != 0);
if(strchr(id, '@'))
return;
unsigned path = NamedObject::keyindex(id, USER_KEY_SIZE);
user_lock.modify();
UserCache *cp = request(id);
if(cp) {
// only update if not trumped by existing entry...
if(create >= cp->created)
goto update;
goto release;
}
if(user_freelist) {
cp = (UserCache *)user_freelist;
user_freelist = cp->next;
}
else {
caddr_t mp = (caddr_t)cache_heap.alloc(sizeof(UserCache));
cp = new(mp) UserCache;
}
cp->enlist(&user_keys[path]);
String::set(cp->userid, sizeof(cp->userid), id);
update:
cp->created = create;
if(expire) {
time(&cp->expires);
cp->expires += expire;
}
else
cp->expires = 0;
cp->set(addr);
release:
user_lock.commit();
}