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
|
//string cvs_version = "$Id: cache.pike,v 1.20 1998/05/07 20:06:52 js Exp $";
#include <config.h>
inherit "roxenlib";
#define TIMESTAMP 0
#define DATA 1
#define TIMEOUT 2
#define ENTRY_SIZE 3
#define CACHE_TIME_OUT 300
#if DEBUG_LEVEL > 8
#ifndef CACHE_DEBUG
#define CACHE_DEBUG
#endif
#endif
mapping cache;
mapping hits=([]), all=([]);
#ifdef THREADS
object cleaning_lock = Thread.Mutex();
#endif /* THREADS */
void cache_expire(string in)
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
m_delete(cache, in);
}
mixed cache_lookup(string in, string what)
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
#ifdef CACHE_DEBUG
perror(sprintf("CACHE: cache_lookup(\"%s\",\"%s\") -> ", in, what));
#endif
all[in]++;
if(cache[in] && cache[in][what])
{
#ifdef CACHE_DEBUG
perror("Hit\n");
#endif
hits[in]++;
cache[in][what][TIMESTAMP]=time(1);
return cache[in][what][DATA];
}
#ifdef CACHE_DEBUG
perror("Miss\n");
#endif
return 0;
}
string status()
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
string res, a;
res = "<table border=0 cellspacing=0 cellpadding=2><tr bgcolor=lightblue>"
"<th align=left>Class</th><th align=left>Entries</th><th align=left>(KB)</th><th align=left>Hits</td><th align=left>Misses</th><th align=left>Hitrate</th></tr>";
array c, b;
mapping ca = ([]), cb=([]), ch=([]), ct=([]);
b=indices(cache);
c=Array.map(values(cache), get_size);
int i;
for(i=0; i<sizeof(b); i++)
{
int s = sizeof(cache[b[i]]);
int h = hits[b[i]];
int t = all[b[i]];
sscanf(b[i], "%s:", b[i]);
ca[b[i]]+=c[i]; cb[b[i]]+=s; ch[b[i]]+=h; ct[b[i]]+=t;
}
b=indices(ca);
c=values(ca);
sort(c,b);
int n, totale, totalm, totalh, mem, totalr;
i=0;
c=reverse(c);
foreach(reverse(b), a)
{
if(ct[a])
{
res += ("<tr align=right bgcolor="+(n/3%2?"#f0f0ff":"white")+
"><td align=left>"+a+"</td><td>"+cb[a]+"</td><td>" +
sprintf("%.1f", ((mem=c[i])/1024.0)) + "</td>");
res += "<td>"+ch[a]+"</td><td>"+(ct[a]-ch[a])+"</td>";
if(ct[a])
res += "<td>"+(ch[a]*100)/ct[a]+"%</td>";
else
res += "<td>0%</td>";
res += "</tr>";
totale += cb[a];
totalm += mem;
totalh += ch[a];
totalr += ct[a];
}
i++;
}
res += "<tr align=right bgcolor=lightblue><td align=left>Total</td><td>"+totale+"</td><td>" + sprintf("%.1f", (totalm/1024.0)) + "</td>";
res += "<td>"+totalh+"</td><td>"+(totalr-totalh)+"</td>";
if(totalr)
res += "<td>"+(totalh*100)/totalr+"%</td>";
else
res += "<td>0%</td>";
res += "</tr>";
return res + "</table>";
}
void cache_remove(string in, string what)
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
#ifdef CACHE_DEBUG
perror(sprintf("CACHE: cache_remove(\"%s\",\"%O\")\n", in, what));
#endif
if(!what)
m_delete(cache, in);
else
if(cache[in])
m_delete(cache[in], what);
}
void cache_set(string in, string what, mixed to, int|void tm)
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
#ifdef CACHE_DEBUG
perror(sprintf("CACHE: cache_set(\"%s\", \"%s\", %O)\n",
in, what, to));
#endif
if(!cache[in])
cache[in]=([ ]);
cache[in][what] = allocate(ENTRY_SIZE);
cache[in][what][DATA] = to;
cache[in][what][TIMEOUT] = tm;
cache[in][what][TIMESTAMP] = time(1);
}
void cache_clear(string in)
{
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
#ifdef CACHE_DEBUG
perror("CACHE: cache_clear(\"%s\")\n", in);
#endif
if(cache[in])
m_delete(cache,in);
}
void cache_clean()
{
remove_call_out(cache_clean);
remove_call_out(cache_clean);
call_out(cache_clean, CACHE_TIME_OUT);
call_out(cache_clean, CACHE_TIME_OUT);
gc();
// #ifdef THREADS
// mixed key;
// catch { key = cleaning_lock->lock(); };
// #endif /* THREADS */
string a, b;
int cache_time_out=CACHE_TIME_OUT;
#ifdef CACHE_DEBUG
perror("CACHE: cache_clean()\n");
#endif
foreach(indices(cache), a)
{
#ifdef CACHE_DEBUG
#if DEBUG_LEVEL > 40
perror("CACHE: Class " + a + "\n");
#endif
#endif
foreach(indices(cache[a]), b)
{
#ifdef CACHE_DEBUG
#if DEBUG_LEVEL > 40
perror("CACHE: " + b + " ");
#endif
#endif
#ifdef DEBUG
if(!intp(cache[a][b][TIMESTAMP]))
error("Illegal timestamp in cache ("+a+":"+b+")\n");
#endif
if(cache[a][b][TIMESTAMP]+cache[a][b][TIMEOUT] <
(time(1) - (cache_time_out - get_size(cache[a][b][DATA])/100)))
{
#ifdef CACHE_DEBUG
#if DEBUG_LEVEL > 40
perror("DELETED\n");
#endif
#endif
m_delete(cache[a], b);
}
#ifdef CACHE_DEBUG
#if DEBUG_LEVEL > 40
else
perror("Ok\n");
#endif
#endif
if(!sizeof(cache[a]))
{
#ifdef CACHE_DEBUG
#if DEBUG_LEVEL > 40
perror("CACHE: Class DELETED.\n");
#endif
#endif
m_delete(cache, a);
}
}
}
gc();
}
void create()
{
#ifdef CACHE_DEBUG
perror("CACHE: Now online.\n");
#endif
cache=([ ]);
call_out(cache_clean, CACHE_TIME_OUT);
}
|
