]>
git.ipfire.org Git - thirdparty/squid.git/blob - src/cache_diff.cc
5 * AUTHOR: Alex Rousskov
7 * SQUID Web Proxy Cache http://www.squid-cache.org/
8 * ----------------------------------------------------------
10 * Squid is the result of efforts by numerous individuals from
11 * the Internet community; see the CONTRIBUTORS file for full
12 * details. Many organizations have provided support for Squid's
13 * development; see the SPONSORS file for full details. Squid is
14 * Copyrighted (C) 2001 by the Regents of the University of
15 * California; see the COPYRIGHT file for full details. Squid
16 * incorporates software developed and/or copyrighted by other
17 * sources; see the CREDITS file for full details.
19 * This program is free software; you can redistribute it and/or modify
20 * it under the terms of the GNU General Public License as published by
21 * the Free Software Foundation; either version 2 of the License, or
22 * (at your option) any later version.
24 * This program is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 * GNU General Public License for more details.
29 * You should have received a copy of the GNU General Public License
30 * along with this program; if not, write to the Free Software
31 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
36 * Computes the difference between the contents of two caches
38 * Reports the percentage of common files and other stats
46 int count
; /* #currently cached entries */
47 int scanned_count
; /* #scanned entries */
48 int bad_add_count
; /* #duplicate adds */
49 int bad_del_count
; /* #dels with no prior add */
53 typedef struct _CacheEntry
{
56 struct _CacheEntry
*next
;
57 /* StoreSwapLogData s; */
58 unsigned char key_arr
[SQUID_MD5_DIGEST_LENGTH
];
62 /* copied from url.c */
63 const char *RequestMethodStr
[] = {
75 static int cacheIndexScan(CacheIndex
* idx
, const char *fname
, FILE * file
);
79 cacheEntryCreate(const StoreSwapLogData
* s
)
81 CacheEntry
*e
= xcalloc(1, sizeof(CacheEntry
));
84 memcpy(e
->key_arr
, s
->key
, SQUID_MD5_DIGEST_LENGTH
);
85 e
->key
= &e
->key_arr
[0];
90 cacheEntryDestroy(CacheEntry
* e
)
97 cacheIndexCreate(const char *name
)
101 if (!name
|| !strlen(name
))
104 idx
= xcalloc(1, sizeof(CacheIndex
));
108 idx
->hash
= hash_create(storeKeyHashCmp
, 2e6
, storeKeyHashHash
);
114 cacheIndexDestroy(CacheIndex
* idx
)
116 hash_link
*hashr
= NULL
;
119 /* destroy hash list contents */
120 hash_first(idx
->hash
);
122 while (hashr
= hash_next(idx
->hash
)) {
123 hash_remove_link(idx
->hash
, hashr
);
124 cacheEntryDestroy((CacheEntry
*) hashr
);
127 /* destroy the hash table itself */
128 hashFreeMemory(idx
->hash
);
135 cacheIndexAddLog(CacheIndex
* idx
, const char *fname
)
138 int scanned_count
= 0;
140 assert(fname
&& strlen(fname
));
142 file
= fopen(fname
, "r");
145 fprintf(stderr
, "cannot open %s: %s\n", fname
, strerror(errno
));
150 setmode(fileno(file
), O_BINARY
);
153 scanned_count
= cacheIndexScan(idx
, fname
, file
);
157 return scanned_count
;
161 cacheIndexInitReport(CacheIndex
* idx
)
164 fprintf(stderr
, "%s: bad swap_add: %d\n",
165 idx
->name
, idx
->bad_add_count
);
166 fprintf(stderr
, "%s: bad swap_del: %d\n",
167 idx
->name
, idx
->bad_del_count
);
168 fprintf(stderr
, "%s: scanned lines: %d\n",
169 idx
->name
, idx
->scanned_count
);
173 cacheIndexScan(CacheIndex
* idx
, const char *fname
, FILE * file
)
177 fprintf(stderr
, "%s scanning\n", fname
);
179 while (fread(&s
, sizeof(s
), 1, file
) == 1) {
181 idx
->scanned_count
++;
182 /* if (s.op <= SWAP_LOG_NOP || s.op >= SWAP_LOG_MAX)
185 if (s
.op
== SWAP_LOG_ADD
) {
186 CacheEntry
*olde
= (CacheEntry
*) hash_lookup(idx
->hash
, s
.key
);
189 idx
->bad_add_count
++;
191 CacheEntry
*e
= cacheEntryCreate(&s
);
192 hash_join(idx
->hash
, &e
->hash
);
195 } else if (s
.op
== SWAP_LOG_DEL
) {
196 CacheEntry
*olde
= (CacheEntry
*) hash_lookup(idx
->hash
, s
.key
);
199 idx
->bad_del_count
++;
202 hash_remove_link(idx
->hash
, (hash_link
*) olde
);
203 cacheEntryDestroy(olde
);
207 fprintf(stderr
, "%s:%d: unknown swap log action\n", fname
, count
);
212 fprintf(stderr
, "%s:%d: scanned (size: %d bytes)\n",
213 fname
, count
, (int) (count
* sizeof(CacheEntry
)));
218 cacheIndexCmpReport(CacheIndex
* idx
, int shared_count
)
220 assert(idx
&& shared_count
<= idx
->count
);
222 printf("%s:\t %7d = %7d + %7d (%7.2f%% + %7.2f%%)\n",
225 idx
->count
- shared_count
,
227 xpercent(idx
->count
- shared_count
, idx
->count
),
228 xpercent(shared_count
, idx
->count
));
232 cacheIndexCmp(CacheIndex
* idx1
, CacheIndex
* idx2
)
234 int shared_count
= 0;
235 int hashed_count
= 0;
236 hash_link
*hashr
= NULL
;
237 CacheIndex
*small_idx
= idx1
;
238 CacheIndex
*large_idx
= idx2
;
239 assert(idx1
&& idx2
);
241 /* check our guess */
243 if (idx1
->count
> idx2
->count
) {
248 /* find shared_count */
249 hash_first(small_idx
->hash
);
251 for (hashr
= hash_next(small_idx
->hash
)) {
254 if (hash_lookup(large_idx
->hash
, hashr
->key
))
258 assert(hashed_count
== small_idx
->count
);
260 cacheIndexCmpReport(idx1
, shared_count
);
261 cacheIndexCmpReport(idx2
, shared_count
);
266 usage(const char *prg_name
)
268 fprintf(stderr
, "usage: %s <label1>: <swap_state>... <label2>: <swap_state>...\n",
274 main(int argc
, char *argv
[])
276 CacheIndex
*CacheIdx
[2];
277 CacheIndex
*idx
= NULL
;
282 return usage(argv
[0]);
284 for (i
= 1; i
< argc
; ++i
) {
285 const int len
= strlen(argv
[i
]);
288 return usage(argv
[0]);
290 if (argv
[i
][len
- 1] == ':') {
293 if (len
< 2 || idxCount
> 2)
294 return usage(argv
[0]);
296 idx
= cacheIndexCreate(argv
[i
]);
298 CacheIdx
[idxCount
- 1] = idx
;
301 return usage(argv
[0]);
303 cacheIndexAddLog(idx
, argv
[i
]);
308 return usage(argv
[0]);
310 cacheIndexInitReport(CacheIdx
[0]);
312 cacheIndexInitReport(CacheIdx
[1]);
314 cacheIndexCmp(CacheIdx
[0], CacheIdx
[1]);
316 cacheIndexDestroy(CacheIdx
[0]);
318 cacheIndexDestroy(CacheIdx
[1]);