]>
Commit | Line | Data |
---|---|---|
9b7de833 | 1 | |
2 | /* | |
262a0e14 | 3 | * $Id$ |
9b7de833 | 4 | * |
5 | * DEBUG: section 72 Peer Digest Routines | |
6 | * AUTHOR: Alex Rousskov | |
7 | * | |
2b6662ba | 8 | * SQUID Web Proxy Cache http://www.squid-cache.org/ |
e25c139f | 9 | * ---------------------------------------------------------- |
9b7de833 | 10 | * |
2b6662ba | 11 | * Squid is the result of efforts by numerous individuals from |
12 | * the Internet community; see the CONTRIBUTORS file for full | |
13 | * details. Many organizations have provided support for Squid's | |
14 | * development; see the SPONSORS file for full details. Squid is | |
15 | * Copyrighted (C) 2001 by the Regents of the University of | |
16 | * California; see the COPYRIGHT file for full details. Squid | |
17 | * incorporates software developed and/or copyrighted by other | |
18 | * sources; see the CREDITS file for full details. | |
9b7de833 | 19 | * |
20 | * This program is free software; you can redistribute it and/or modify | |
21 | * it under the terms of the GNU General Public License as published by | |
22 | * the Free Software Foundation; either version 2 of the License, or | |
23 | * (at your option) any later version. | |
26ac0430 | 24 | * |
9b7de833 | 25 | * This program is distributed in the hope that it will be useful, |
26 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
27 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
28 | * GNU General Public License for more details. | |
26ac0430 | 29 | * |
9b7de833 | 30 | * You should have received a copy of the GNU General Public License |
31 | * along with this program; if not, write to the Free Software | |
cbdec147 | 32 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. |
e25c139f | 33 | * |
9b7de833 | 34 | */ |
35 | ||
f7f3304a | 36 | #include "squid-old.h" |
6cfa8966 | 37 | #if USE_CACHE_DIGESTS |
7a2e5bb5 | 38 | |
a553a5a3 | 39 | #include "event.h" |
aa839030 | 40 | #include "forward.h" |
528b2c61 | 41 | #include "Store.h" |
42 | #include "HttpRequest.h" | |
43 | #include "HttpReply.h" | |
44 | #include "MemObject.h" | |
aa839030 | 45 | #include "PeerDigest.h" |
985c86bc | 46 | #include "SquidTime.h" |
598465f1 | 47 | #include "StoreClient.h" |
48 | ||
9b7de833 | 49 | /* local types */ |
50 | ||
51 | /* local prototypes */ | |
e13ee7ad | 52 | static time_t peerDigestIncDelay(const PeerDigest * pd); |
53 | static time_t peerDigestNewDelay(const StoreEntry * e); | |
54 | static void peerDigestSetCheck(PeerDigest * pd, time_t delay); | |
eb16313f | 55 | static void peerDigestClean(PeerDigest *); |
e13ee7ad | 56 | static EVH peerDigestCheck; |
57 | static void peerDigestRequest(PeerDigest * pd); | |
add2192d | 58 | static STCB peerDigestHandleReply; |
3dfaa3d2 | 59 | static int peerDigestFetchReply(void *, char *, ssize_t); |
1f140227 | 60 | int peerDigestSwapInHeaders(void *, char *, ssize_t); |
61 | int peerDigestSwapInCBlock(void *, char *, ssize_t); | |
62 | int peerDigestSwapInMask(void *, char *, ssize_t); | |
4b4cd312 | 63 | static int peerDigestFetchedEnough(DigestFetchState * fetch, char *buf, ssize_t size, const char *step_name); |
551e60a9 | 64 | static void peerDigestFetchStop(DigestFetchState * fetch, char *buf, const char *reason); |
e13ee7ad | 65 | static void peerDigestFetchAbort(DigestFetchState * fetch, char *buf, const char *reason); |
66 | static void peerDigestReqFinish(DigestFetchState * fetch, char *buf, int, int, int, const char *reason, int err); | |
67 | static void peerDigestPDFinish(DigestFetchState * fetch, int pcb_valid, int err); | |
68 | static void peerDigestFetchFinish(DigestFetchState * fetch, int err); | |
69 | static void peerDigestFetchSetStats(DigestFetchState * fetch); | |
70 | static int peerDigestSetCBlock(PeerDigest * pd, const char *buf); | |
71 | static int peerDigestUseful(const PeerDigest * pd); | |
395b813e | 72 | |
9b7de833 | 73 | |
74 | /* local constants */ | |
aa839030 | 75 | Version const CacheDigestVer = { 5, 3 }; |
9d486b43 | 76 | |
9b7de833 | 77 | #define StoreDigestCBlockSize sizeof(StoreDigestCBlock) |
78 | ||
e13ee7ad | 79 | /* min interval for requesting digests from a given peer */ |
80 | static const time_t PeerDigestReqMinGap = 5 * 60; /* seconds */ | |
81 | /* min interval for requesting digests (cumulative request stream) */ | |
82 | static const time_t GlobDigestReqMinGap = 1 * 60; /* seconds */ | |
bd890734 | 83 | |
84 | /* local vars */ | |
9d486b43 | 85 | |
8a6218c6 | 86 | static time_t pd_last_req_time = 0; /* last call to Check */ |
9b7de833 | 87 | |
e13ee7ad | 88 | /* initialize peer digest */ |
89 | static void | |
8a6218c6 | 90 | peerDigestInit(PeerDigest * pd, peer * p) |
9b7de833 | 91 | { |
e13ee7ad | 92 | assert(pd && p); |
93 | ||
94 | memset(pd, 0, sizeof(*pd)); | |
4e454ade | 95 | /* |
96 | * DPW 2007-04-12 | |
97 | * Lock on to the peer here. The corresponding cbdataReferenceDone() | |
98 | * is in peerDigestDestroy(). | |
99 | */ | |
100 | pd->peer = cbdataReference(p); | |
e13ee7ad | 101 | /* if peer disappears, we will know it's name */ |
528b2c61 | 102 | pd->host = p->host; |
e13ee7ad | 103 | |
104 | pd->times.initialized = squid_curtime; | |
9b7de833 | 105 | } |
106 | ||
4b4cd312 | 107 | static void |
8a6218c6 | 108 | peerDigestClean(PeerDigest * pd) |
9b7de833 | 109 | { |
e13ee7ad | 110 | assert(pd); |
62e76326 | 111 | |
e13ee7ad | 112 | if (pd->cd) |
62e76326 | 113 | cacheDigestDestroy(pd->cd); |
114 | ||
30abd221 | 115 | pd->host.clean(); |
9b7de833 | 116 | } |
117 | ||
0353e724 | 118 | CBDATA_CLASS_INIT(PeerDigest); |
119 | ||
120 | void * | |
121 | PeerDigest::operator new (size_t) | |
122 | { | |
123 | CBDATA_INIT_TYPE(PeerDigest); | |
124 | PeerDigest *result = cbdataAlloc(PeerDigest); | |
125 | return result; | |
126 | } | |
127 | ||
128 | void | |
129 | PeerDigest::operator delete (void *address) | |
130 | { | |
131 | PeerDigest *t = static_cast<PeerDigest *>(address); | |
132 | cbdataFree(t); | |
133 | } | |
134 | ||
e13ee7ad | 135 | /* allocate new peer digest, call Init, and lock everything */ |
136 | PeerDigest * | |
8a6218c6 | 137 | peerDigestCreate(peer * p) |
e13ee7ad | 138 | { |
139 | PeerDigest *pd; | |
8a6218c6 | 140 | assert(p); |
e13ee7ad | 141 | |
0353e724 | 142 | pd = new PeerDigest; |
e13ee7ad | 143 | peerDigestInit(pd, p); |
e13ee7ad | 144 | |
fa80a8ef | 145 | /* XXX This does not look right, and the same thing again in the caller */ |
146 | return cbdataReference(pd); | |
e13ee7ad | 147 | } |
148 | ||
149 | /* call Clean and free/unlock everything */ | |
2d72d4fd | 150 | static void |
8a6218c6 | 151 | peerDigestDestroy(PeerDigest * pd) |
e13ee7ad | 152 | { |
8abf232c | 153 | void *p; |
e13ee7ad | 154 | assert(pd); |
8abf232c | 155 | void * peerTmp = pd->peer; |
e13ee7ad | 156 | |
4e454ade | 157 | /* |
158 | * DPW 2007-04-12 | |
159 | * We locked the peer in peerDigestInit(), this is | |
160 | * where we unlock it. If the peer is still valid, | |
161 | * tell it that the digest is gone. | |
162 | */ | |
8abf232c | 163 | if (cbdataReferenceValidDone(peerTmp, &p)) |
164 | peerNoteDigestGone((peer *)p); | |
e13ee7ad | 165 | |
166 | peerDigestClean(pd); | |
62e76326 | 167 | |
00d77d6b | 168 | delete pd; |
e13ee7ad | 169 | } |
170 | ||
171 | /* called by peer to indicate that somebody actually needs this digest */ | |
172 | void | |
8a6218c6 | 173 | peerDigestNeeded(PeerDigest * pd) |
e13ee7ad | 174 | { |
175 | assert(pd); | |
176 | assert(!pd->flags.needed); | |
177 | assert(!pd->cd); | |
178 | ||
179 | pd->flags.needed = 1; | |
180 | pd->times.needed = squid_curtime; | |
8a6218c6 | 181 | peerDigestSetCheck(pd, 0); /* check asap */ |
e13ee7ad | 182 | } |
183 | ||
184 | /* currently we do not have a reason to disable without destroying */ | |
8a6218c6 | 185 | #if FUTURE_CODE |
395b813e | 186 | /* disables peer for good */ |
187 | static void | |
8a6218c6 | 188 | peerDigestDisable(PeerDigest * pd) |
395b813e | 189 | { |
bf8fe701 | 190 | debugs(72, 2, "peerDigestDisable: peer " << pd->host.buf() << " disabled for good"); |
e13ee7ad | 191 | pd->times.disabled = squid_curtime; |
8a6218c6 | 192 | pd->times.next_check = -1; /* never */ |
e13ee7ad | 193 | pd->flags.usable = 0; |
194 | ||
195 | if (pd->cd) { | |
62e76326 | 196 | cacheDigestDestroy(pd->cd); |
197 | pd->cd = NULL; | |
e13ee7ad | 198 | } |
62e76326 | 199 | |
e13ee7ad | 200 | /* we do not destroy the pd itself to preserve its "history" and stats */ |
395b813e | 201 | } |
62e76326 | 202 | |
e13ee7ad | 203 | #endif |
395b813e | 204 | |
e13ee7ad | 205 | /* increment retry delay [after an unsuccessful attempt] */ |
395b813e | 206 | static time_t |
8a6218c6 | 207 | peerDigestIncDelay(const PeerDigest * pd) |
395b813e | 208 | { |
e13ee7ad | 209 | assert(pd); |
210 | return pd->times.retry_delay > 0 ? | |
62e76326 | 211 | 2 * pd->times.retry_delay : /* exponential backoff */ |
212 | PeerDigestReqMinGap; /* minimal delay */ | |
395b813e | 213 | } |
214 | ||
62e76326 | 215 | /* artificially increases Expires: setting to avoid race conditions |
e13ee7ad | 216 | * returns the delay till that [increased] expiration time */ |
00485c29 | 217 | static time_t |
e13ee7ad | 218 | peerDigestNewDelay(const StoreEntry * e) |
00485c29 | 219 | { |
e13ee7ad | 220 | assert(e); |
62e76326 | 221 | |
00485c29 | 222 | if (e->expires > 0) |
62e76326 | 223 | return e->expires + PeerDigestReqMinGap - squid_curtime; |
224 | ||
e13ee7ad | 225 | return PeerDigestReqMinGap; |
00485c29 | 226 | } |
227 | ||
e13ee7ad | 228 | /* registers next digest verification */ |
395b813e | 229 | static void |
e13ee7ad | 230 | peerDigestSetCheck(PeerDigest * pd, time_t delay) |
395b813e | 231 | { |
e13ee7ad | 232 | eventAdd("peerDigestCheck", peerDigestCheck, pd, (double) delay, 1); |
233 | pd->times.next_check = squid_curtime + delay; | |
bb790702 | 234 | debugs(72, 3, "peerDigestSetCheck: will check peer " << pd->host << " in " << delay << " secs"); |
e13ee7ad | 235 | } |
236 | ||
5385c86a | 237 | /* |
238 | * called when peer is about to disappear or have already disappeared | |
239 | */ | |
e13ee7ad | 240 | void |
8a6218c6 | 241 | peerDigestNotePeerGone(PeerDigest * pd) |
242 | { | |
e13ee7ad | 243 | if (pd->flags.requested) { |
bb790702 | 244 | debugs(72, 2, "peerDigest: peer " << pd->host << " gone, will destroy after fetch."); |
62e76326 | 245 | /* do nothing now, the fetching chain will notice and take action */ |
395b813e | 246 | } else { |
bb790702 | 247 | debugs(72, 2, "peerDigest: peer " << pd->host << " is gone, destroying now."); |
62e76326 | 248 | peerDigestDestroy(pd); |
395b813e | 249 | } |
250 | } | |
251 | ||
e13ee7ad | 252 | /* callback for eventAdd() (with peer digest locked) |
26ac0430 | 253 | * request new digest if our copy is too old or if we lack one; |
e13ee7ad | 254 | * schedule next check otherwise */ |
9b7de833 | 255 | static void |
e13ee7ad | 256 | peerDigestCheck(void *data) |
9b7de833 | 257 | { |
e6ccf245 | 258 | PeerDigest *pd = (PeerDigest *)data; |
e13ee7ad | 259 | time_t req_time; |
260 | ||
e13ee7ad | 261 | assert(!pd->flags.requested); |
5d9bb360 | 262 | |
8a6218c6 | 263 | pd->times.next_check = 0; /* unknown */ |
e13ee7ad | 264 | |
fa80a8ef | 265 | if (!cbdataReferenceValid(pd->peer)) { |
62e76326 | 266 | peerDigestNotePeerGone(pd); |
267 | return; | |
9b7de833 | 268 | } |
62e76326 | 269 | |
cc192b50 | 270 | debugs(72, 3, "peerDigestCheck: peer " << pd->peer->host << ":" << pd->peer->http_port); |
26ac0430 AJ |
271 | debugs(72, 3, "peerDigestCheck: time: " << squid_curtime << |
272 | ", last received: " << (long int) pd->times.received << " (" << | |
bf8fe701 | 273 | std::showpos << (int) (squid_curtime - pd->times.received) << ")"); |
e13ee7ad | 274 | |
275 | /* decide when we should send the request: | |
276 | * request now unless too close to other requests */ | |
277 | req_time = squid_curtime; | |
278 | ||
279 | /* per-peer limit */ | |
62e76326 | 280 | |
e13ee7ad | 281 | if (req_time - pd->times.received < PeerDigestReqMinGap) { |
b4197865 | 282 | debugs(72, 2, "peerDigestCheck: " << pd->host << |
bf8fe701 | 283 | ", avoiding close peer requests (" << |
284 | (int) (req_time - pd->times.received) << " < " << | |
285 | (int) PeerDigestReqMinGap << " secs)."); | |
286 | ||
62e76326 | 287 | req_time = pd->times.received + PeerDigestReqMinGap; |
bd890734 | 288 | } |
62e76326 | 289 | |
e13ee7ad | 290 | /* global limit */ |
291 | if (req_time - pd_last_req_time < GlobDigestReqMinGap) { | |
b4197865 | 292 | debugs(72, 2, "peerDigestCheck: " << pd->host << |
bf8fe701 | 293 | ", avoiding close requests (" << |
294 | (int) (req_time - pd_last_req_time) << " < " << | |
295 | (int) GlobDigestReqMinGap << " secs)."); | |
296 | ||
62e76326 | 297 | req_time = pd_last_req_time + GlobDigestReqMinGap; |
9b7de833 | 298 | } |
62e76326 | 299 | |
e13ee7ad | 300 | if (req_time <= squid_curtime) |
62e76326 | 301 | peerDigestRequest(pd); /* will set pd->flags.requested */ |
e13ee7ad | 302 | else |
62e76326 | 303 | peerDigestSetCheck(pd, req_time - squid_curtime); |
9b7de833 | 304 | } |
305 | ||
2812146b | 306 | CBDATA_TYPE(DigestFetchState); |
307 | ||
e13ee7ad | 308 | /* ask store for a digest */ |
9b7de833 | 309 | static void |
e13ee7ad | 310 | peerDigestRequest(PeerDigest * pd) |
9b7de833 | 311 | { |
e13ee7ad | 312 | peer *p = pd->peer; |
9b7de833 | 313 | StoreEntry *e, *old_e; |
314 | char *url; | |
9d486b43 | 315 | const cache_key *key; |
190154cf | 316 | HttpRequest *req; |
9b7de833 | 317 | DigestFetchState *fetch = NULL; |
528b2c61 | 318 | StoreIOBuffer tempBuffer; |
e13ee7ad | 319 | |
320 | pd->req_result = NULL; | |
321 | pd->flags.requested = 1; | |
322 | ||
9b7de833 | 323 | /* compute future request components */ |
62e76326 | 324 | |
7e3ce7b9 | 325 | if (p->digest_url) |
62e76326 | 326 | url = xstrdup(p->digest_url); |
7e3ce7b9 | 327 | else |
62e76326 | 328 | url = internalRemoteUri(p->host, p->http_port, |
329 | "/squid-internal-periodic/", StoreDigestFileName); | |
7e3ce7b9 | 330 | |
c21ad0f5 | 331 | req = HttpRequest::CreateFromUrl(url); |
62e76326 | 332 | |
e13ee7ad | 333 | assert(req); |
62e76326 | 334 | |
f66a9ef4 | 335 | key = storeKeyPublicByRequest(req); |
62e76326 | 336 | |
bf8fe701 | 337 | debugs(72, 2, "peerDigestRequest: " << url << " key: " << storeKeyText(key)); |
e13ee7ad | 338 | |
9b7de833 | 339 | /* add custom headers */ |
2246b732 | 340 | assert(!req->header.len); |
62e76326 | 341 | |
a9925b40 | 342 | req->header.putStr(HDR_ACCEPT, StoreDigestMimeStr); |
62e76326 | 343 | |
a9925b40 | 344 | req->header.putStr(HDR_ACCEPT, "text/html"); |
62e76326 | 345 | |
9bc73deb | 346 | if (p->login) |
62e76326 | 347 | xstrncpy(req->login, p->login, MAX_LOGIN_SZ); |
348 | ||
9b7de833 | 349 | /* create fetch state structure */ |
2812146b | 350 | CBDATA_INIT_TYPE(DigestFetchState); |
62e76326 | 351 | |
72711e31 | 352 | fetch = cbdataAlloc(DigestFetchState); |
62e76326 | 353 | |
6dd9f4bd | 354 | fetch->request = HTTPMSGLOCK(req); |
62e76326 | 355 | |
fa80a8ef | 356 | fetch->pd = cbdataReference(pd); |
62e76326 | 357 | |
e13ee7ad | 358 | fetch->offset = 0; |
62e76326 | 359 | |
add2192d | 360 | fetch->state = DIGEST_READ_REPLY; |
e13ee7ad | 361 | |
362 | /* update timestamps */ | |
9b7de833 | 363 | fetch->start_time = squid_curtime; |
62e76326 | 364 | |
e13ee7ad | 365 | pd->times.requested = squid_curtime; |
62e76326 | 366 | |
e13ee7ad | 367 | pd_last_req_time = squid_curtime; |
368 | ||
92695e5e | 369 | req->flags.cachable = 1; |
62e76326 | 370 | |
9b7de833 | 371 | /* the rest is based on clientProcessExpired() */ |
92695e5e | 372 | req->flags.refresh = 1; |
62e76326 | 373 | |
c8f4eac4 | 374 | old_e = fetch->old_entry = Store::Root().get(key); |
62e76326 | 375 | |
9b7de833 | 376 | if (old_e) { |
bf8fe701 | 377 | debugs(72, 5, "peerDigestRequest: found old entry"); |
34266cde | 378 | |
3d0ac046 | 379 | old_e->lock(); |
3900307b | 380 | old_e->createMemObject(url, url); |
34266cde | 381 | |
62e76326 | 382 | fetch->old_sc = storeClientListAdd(old_e, fetch); |
9b7de833 | 383 | } |
62e76326 | 384 | |
9b7de833 | 385 | e = fetch->entry = storeCreateEntry(url, url, req->flags, req->method); |
e13ee7ad | 386 | assert(EBIT_TEST(e->flags, KEY_PRIVATE)); |
06d2839d | 387 | fetch->sc = storeClientListAdd(e, fetch); |
9b7de833 | 388 | /* set lastmod to trigger IMS request if possible */ |
62e76326 | 389 | |
9b7de833 | 390 | if (old_e) |
62e76326 | 391 | e->lastmod = old_e->lastmod; |
e13ee7ad | 392 | |
9b7de833 | 393 | /* push towards peer cache */ |
bf8fe701 | 394 | debugs(72, 3, "peerDigestRequest: forwarding to fwdStart..."); |
62e76326 | 395 | |
e83cc785 | 396 | FwdState::fwdStart(Comm::ConnectionPointer(), e, req); |
62e76326 | 397 | |
598465f1 | 398 | tempBuffer.offset = 0; |
62e76326 | 399 | |
f95db407 | 400 | tempBuffer.length = SM_PAGE_SIZE; |
62e76326 | 401 | |
598465f1 | 402 | tempBuffer.data = fetch->buf; |
62e76326 | 403 | |
598465f1 | 404 | storeClientCopy(fetch->sc, e, tempBuffer, |
62e76326 | 405 | peerDigestHandleReply, fetch); |
9b7de833 | 406 | } |
407 | ||
add2192d | 408 | |
409 | /* Handle the data copying .. */ | |
410 | ||
411 | /* | |
412 | * This routine handles the copy data and then redirects the | |
413 | * copy to a bunch of subfunctions depending upon the copy state. | |
414 | * It also tracks the buffer offset and "seen", since I'm actually | |
415 | * not interested in rewriting everything to suit my little idea. | |
416 | */ | |
9b7de833 | 417 | static void |
2324cda2 | 418 | peerDigestHandleReply(void *data, StoreIOBuffer receivedData) |
add2192d | 419 | { |
e6ccf245 | 420 | DigestFetchState *fetch = (DigestFetchState *)data; |
add2192d | 421 | int retsize = -1; |
422 | digest_read_state_t prevstate; | |
423 | int newsize; | |
424 | ||
2324cda2 | 425 | assert(fetch->pd && receivedData.data); |
426 | /* The existing code assumes that the received pointer is | |
598465f1 | 427 | * where we asked the data to be put |
428 | */ | |
2324cda2 | 429 | assert(fetch->buf + fetch->bufofs == receivedData.data); |
add2192d | 430 | |
431 | /* Update the buffer size */ | |
2324cda2 | 432 | fetch->bufofs += receivedData.length; |
add2192d | 433 | |
434 | assert(fetch->bufofs <= SM_PAGE_SIZE); | |
435 | ||
436 | /* If we've fetched enough, return */ | |
62e76326 | 437 | |
add2192d | 438 | if (peerDigestFetchedEnough(fetch, fetch->buf, fetch->bufofs, "peerDigestHandleReply")) |
62e76326 | 439 | return; |
add2192d | 440 | |
441 | /* Call the right function based on the state */ | |
442 | /* (Those functions will update the state if needed) */ | |
fa80a8ef | 443 | |
e2848e94 | 444 | /* Give us a temporary reference. Some of the calls we make may |
445 | * try to destroy the fetch structure, and we like to know if they | |
446 | * do | |
bac6d4bd | 447 | */ |
e2848e94 | 448 | fetch = cbdataReference(fetch); |
add2192d | 449 | |
450 | /* Repeat this loop until we're out of data OR the state changes */ | |
451 | /* (So keep going if the state has changed and we still have data */ | |
452 | do { | |
62e76326 | 453 | prevstate = fetch->state; |
454 | ||
455 | switch (fetch->state) { | |
456 | ||
457 | case DIGEST_READ_REPLY: | |
458 | retsize = peerDigestFetchReply(fetch, fetch->buf, fetch->bufofs); | |
459 | break; | |
460 | ||
461 | case DIGEST_READ_HEADERS: | |
462 | retsize = peerDigestSwapInHeaders(fetch, fetch->buf, fetch->bufofs); | |
463 | break; | |
464 | ||
465 | case DIGEST_READ_CBLOCK: | |
466 | retsize = peerDigestSwapInCBlock(fetch, fetch->buf, fetch->bufofs); | |
467 | break; | |
468 | ||
469 | case DIGEST_READ_MASK: | |
470 | retsize = peerDigestSwapInMask(fetch, fetch->buf, fetch->bufofs); | |
471 | break; | |
472 | ||
473 | case DIGEST_READ_NONE: | |
474 | break; | |
475 | ||
476 | case DIGEST_READ_DONE: | |
477 | goto finish; | |
478 | break; | |
479 | ||
480 | default: | |
481 | fatal("Bad digest transfer mode!\n"); | |
482 | } | |
483 | ||
484 | if (retsize < 0) | |
485 | goto finish; | |
486 | ||
487 | /* | |
488 | * The returned size indicates how much of the buffer was read - | |
489 | * so move the remainder of the buffer to the beginning | |
490 | * and update the bufofs / bufsize | |
491 | */ | |
492 | newsize = fetch->bufofs - retsize; | |
493 | ||
41d00cd3 | 494 | memmove(fetch->buf, fetch->buf + retsize, fetch->bufofs - newsize); |
62e76326 | 495 | |
496 | fetch->bufofs = newsize; | |
add2192d | 497 | |
e2848e94 | 498 | } while (cbdataReferenceValid(fetch) && prevstate != fetch->state && fetch->bufofs > 0); |
add2192d | 499 | |
500 | /* Update the copy offset */ | |
2324cda2 | 501 | fetch->offset += receivedData.length; |
add2192d | 502 | |
503 | /* Schedule another copy */ | |
fa80a8ef | 504 | if (cbdataReferenceValid(fetch)) { |
62e76326 | 505 | StoreIOBuffer tempBuffer; |
506 | tempBuffer.offset = fetch->offset; | |
507 | tempBuffer.length = SM_PAGE_SIZE - fetch->bufofs; | |
508 | tempBuffer.data = fetch->buf + fetch->bufofs; | |
509 | storeClientCopy(fetch->sc, fetch->entry, tempBuffer, | |
510 | peerDigestHandleReply, fetch); | |
add2192d | 511 | } |
62e76326 | 512 | |
513 | finish: | |
e2848e94 | 514 | /* Get rid of our reference, we've finished with it for now */ |
515 | cbdataReferenceDone(fetch); | |
add2192d | 516 | } |
517 | ||
518 | ||
519 | ||
520 | /* wait for full http headers to be received then parse them */ | |
521 | /* | |
522 | * This routine handles parsing the reply line. | |
523 | * If the reply line indicates an OK, the same data is thrown | |
524 | * to SwapInHeaders(). If the reply line is a NOT_MODIFIED, | |
525 | * we simply stop parsing. | |
526 | */ | |
527 | static int | |
9b7de833 | 528 | peerDigestFetchReply(void *data, char *buf, ssize_t size) |
529 | { | |
e6ccf245 | 530 | DigestFetchState *fetch = (DigestFetchState *)data; |
e13ee7ad | 531 | PeerDigest *pd = fetch->pd; |
9bc73deb | 532 | size_t hdr_size; |
e13ee7ad | 533 | assert(pd && buf); |
9b7de833 | 534 | assert(!fetch->offset); |
e13ee7ad | 535 | |
add2192d | 536 | assert(fetch->state == DIGEST_READ_REPLY); |
62e76326 | 537 | |
9b7de833 | 538 | if (peerDigestFetchedEnough(fetch, buf, size, "peerDigestFetchReply")) |
62e76326 | 539 | return -1; |
e13ee7ad | 540 | |
9bc73deb | 541 | if ((hdr_size = headersEnd(buf, size))) { |
62e76326 | 542 | http_status status; |
543 | HttpReply const *reply = fetch->entry->getReply(); | |
544 | assert(reply); | |
545 | assert (reply->sline.status != 0); | |
546 | status = reply->sline.status; | |
b4197865 | 547 | debugs(72, 3, "peerDigestFetchReply: " << pd->host << " status: " << status << |
26ac0430 | 548 | ", expires: " << (long int) reply->expires << " (" << std::showpos << |
bf8fe701 | 549 | (int) (reply->expires - squid_curtime) << ")"); |
62e76326 | 550 | |
551 | /* this "if" is based on clientHandleIMSReply() */ | |
552 | ||
553 | if (status == HTTP_NOT_MODIFIED) { | |
190154cf | 554 | HttpRequest *r = NULL; |
62e76326 | 555 | /* our old entry is fine */ |
556 | assert(fetch->old_entry); | |
557 | ||
558 | if (!fetch->old_entry->mem_obj->request) | |
559 | fetch->old_entry->mem_obj->request = r = | |
6dd9f4bd | 560 | HTTPMSGLOCK(fetch->entry->mem_obj->request); |
62e76326 | 561 | |
562 | assert(fetch->old_entry->mem_obj->request); | |
563 | ||
07947ad8 | 564 | HttpReply *old_rep = (HttpReply *) fetch->old_entry->getReply(); |
565 | ||
06a5ae20 | 566 | old_rep->updateOnNotModified(reply); |
62e76326 | 567 | |
3900307b | 568 | fetch->old_entry->timestampsSet(); |
62e76326 | 569 | |
570 | /* get rid of 304 reply */ | |
571 | storeUnregister(fetch->sc, fetch->entry, fetch); | |
572 | ||
97b5e68f | 573 | fetch->entry->unlock(); |
62e76326 | 574 | |
575 | fetch->entry = fetch->old_entry; | |
576 | ||
577 | fetch->old_entry = NULL; | |
578 | ||
579 | /* preserve request -- we need its size to update counters */ | |
580 | /* requestUnlink(r); */ | |
581 | /* fetch->entry->mem_obj->request = NULL; */ | |
582 | } else if (status == HTTP_OK) { | |
583 | /* get rid of old entry if any */ | |
584 | ||
585 | if (fetch->old_entry) { | |
bf8fe701 | 586 | debugs(72, 3, "peerDigestFetchReply: got new digest, releasing old one"); |
62e76326 | 587 | storeUnregister(fetch->old_sc, fetch->old_entry, fetch); |
d88e3c49 | 588 | fetch->old_entry->releaseRequest(); |
97b5e68f | 589 | fetch->old_entry->unlock(); |
62e76326 | 590 | fetch->old_entry = NULL; |
591 | } | |
592 | } else { | |
593 | /* some kind of a bug */ | |
594 | peerDigestFetchAbort(fetch, buf, httpStatusLineReason(&reply->sline)); | |
595 | return -1; /* XXX -1 will abort stuff in ReadReply! */ | |
596 | } | |
597 | ||
598 | /* must have a ready-to-use store entry if we got here */ | |
599 | /* can we stay with the old in-memory digest? */ | |
600 | if (status == HTTP_NOT_MODIFIED && fetch->pd->cd) { | |
601 | peerDigestFetchStop(fetch, buf, "Not modified"); | |
602 | fetch->state = DIGEST_READ_DONE; | |
603 | } else { | |
604 | fetch->state = DIGEST_READ_HEADERS; | |
605 | } | |
9b7de833 | 606 | } else { |
62e76326 | 607 | /* need more data, do we have space? */ |
608 | ||
609 | if (size >= SM_PAGE_SIZE) | |
610 | peerDigestFetchAbort(fetch, buf, "reply header too big"); | |
9b7de833 | 611 | } |
add2192d | 612 | |
613 | /* We don't want to actually ack that we've handled anything, | |
614 | * otherwise SwapInHeaders() won't get the reply line .. */ | |
615 | return 0; | |
9b7de833 | 616 | } |
617 | ||
618 | /* fetch headers from disk, pass on to SwapInCBlock */ | |
1f140227 | 619 | int |
9b7de833 | 620 | peerDigestSwapInHeaders(void *data, char *buf, ssize_t size) |
621 | { | |
e6ccf245 | 622 | DigestFetchState *fetch = (DigestFetchState *)data; |
9b7de833 | 623 | size_t hdr_size; |
e13ee7ad | 624 | |
add2192d | 625 | assert(fetch->state == DIGEST_READ_HEADERS); |
62e76326 | 626 | |
9b7de833 | 627 | if (peerDigestFetchedEnough(fetch, buf, size, "peerDigestSwapInHeaders")) |
62e76326 | 628 | return -1; |
e13ee7ad | 629 | |
9d486b43 | 630 | assert(!fetch->offset); |
62e76326 | 631 | |
9b7de833 | 632 | if ((hdr_size = headersEnd(buf, size))) { |
62e76326 | 633 | assert(fetch->entry->getReply()); |
634 | assert (fetch->entry->getReply()->sline.status != 0); | |
635 | ||
636 | if (fetch->entry->getReply()->sline.status != HTTP_OK) { | |
b4197865 | 637 | debugs(72, 1, "peerDigestSwapInHeaders: " << fetch->pd->host << |
bf8fe701 | 638 | " status " << fetch->entry->getReply()->sline.status << |
639 | " got cached!"); | |
640 | ||
62e76326 | 641 | peerDigestFetchAbort(fetch, buf, "internal status error"); |
642 | return -1; | |
643 | } | |
644 | ||
645 | fetch->state = DIGEST_READ_CBLOCK; | |
646 | return hdr_size; /* Say how much data we read */ | |
9b7de833 | 647 | } else { |
62e76326 | 648 | /* need more data, do we have space? */ |
649 | ||
650 | if (size >= SM_PAGE_SIZE) { | |
651 | peerDigestFetchAbort(fetch, buf, "stored header too big"); | |
652 | return -1; | |
653 | } else { | |
654 | return 0; /* We need to read more to parse .. */ | |
655 | } | |
9b7de833 | 656 | } |
62e76326 | 657 | |
add2192d | 658 | fatal("peerDigestSwapInHeaders() - shouldn't get here!\n"); |
0b5f04b8 | 659 | return 0; /* keep gcc happy */ |
9b7de833 | 660 | } |
661 | ||
1f140227 | 662 | int |
9b7de833 | 663 | peerDigestSwapInCBlock(void *data, char *buf, ssize_t size) |
664 | { | |
e6ccf245 | 665 | DigestFetchState *fetch = (DigestFetchState *)data; |
e13ee7ad | 666 | |
add2192d | 667 | assert(fetch->state == DIGEST_READ_CBLOCK); |
62e76326 | 668 | |
9b7de833 | 669 | if (peerDigestFetchedEnough(fetch, buf, size, "peerDigestSwapInCBlock")) |
62e76326 | 670 | return -1; |
e13ee7ad | 671 | |
e6ccf245 | 672 | if (size >= (ssize_t)StoreDigestCBlockSize) { |
62e76326 | 673 | PeerDigest *pd = fetch->pd; |
62e76326 | 674 | |
e4a67a80 | 675 | assert(pd && fetch->entry->getReply()); |
62e76326 | 676 | |
677 | if (peerDigestSetCBlock(pd, buf)) { | |
678 | /* XXX: soon we will have variable header size */ | |
679 | /* switch to CD buffer and fetch digest guts */ | |
680 | buf = NULL; | |
681 | assert(pd->cd->mask); | |
682 | fetch->state = DIGEST_READ_MASK; | |
683 | return StoreDigestCBlockSize; | |
684 | } else { | |
685 | peerDigestFetchAbort(fetch, buf, "invalid digest cblock"); | |
686 | return -1; | |
687 | } | |
9b7de833 | 688 | } else { |
62e76326 | 689 | /* need more data, do we have space? */ |
690 | ||
691 | if (size >= SM_PAGE_SIZE) { | |
692 | peerDigestFetchAbort(fetch, buf, "digest cblock too big"); | |
693 | return -1; | |
694 | } else { | |
695 | return 0; /* We need more data */ | |
696 | } | |
9b7de833 | 697 | } |
62e76326 | 698 | |
add2192d | 699 | fatal("peerDigestSwapInCBlock(): shouldn't get here!\n"); |
0b5f04b8 | 700 | return 0; /* keep gcc happy */ |
9b7de833 | 701 | } |
702 | ||
1f140227 | 703 | int |
9b7de833 | 704 | peerDigestSwapInMask(void *data, char *buf, ssize_t size) |
705 | { | |
e6ccf245 | 706 | DigestFetchState *fetch = (DigestFetchState *)data; |
e13ee7ad | 707 | PeerDigest *pd; |
708 | ||
e13ee7ad | 709 | pd = fetch->pd; |
710 | assert(pd->cd && pd->cd->mask); | |
9d486b43 | 711 | |
add2192d | 712 | /* |
713 | * NOTENOTENOTENOTENOTE: buf doesn't point to pd->cd->mask anymore! | |
714 | * we need to do the copy ourselves! | |
715 | */ | |
41d00cd3 | 716 | memcpy(pd->cd->mask + fetch->mask_offset, buf, size); |
add2192d | 717 | |
718 | /* NOTE! buf points to the middle of pd->cd->mask! */ | |
62e76326 | 719 | |
add2192d | 720 | if (peerDigestFetchedEnough(fetch, NULL, size, "peerDigestSwapInMask")) |
62e76326 | 721 | return -1; |
add2192d | 722 | |
da407def | 723 | fetch->mask_offset += size; |
62e76326 | 724 | |
57d55dfa | 725 | if (fetch->mask_offset >= pd->cd->mask_size) { |
e4049756 | 726 | debugs(72, 2, "peerDigestSwapInMask: Done! Got " << |
727 | fetch->mask_offset << ", expected " << pd->cd->mask_size); | |
57d55dfa | 728 | assert(fetch->mask_offset == pd->cd->mask_size); |
62e76326 | 729 | assert(peerDigestFetchedEnough(fetch, NULL, 0, "peerDigestSwapInMask")); |
730 | return -1; /* XXX! */ | |
e13ee7ad | 731 | } else { |
62e76326 | 732 | /* We always read everything, so return so */ |
733 | return size; | |
9b7de833 | 734 | } |
62e76326 | 735 | |
add2192d | 736 | fatal("peerDigestSwapInMask(): shouldn't get here!\n"); |
0b5f04b8 | 737 | return 0; /* keep gcc happy */ |
9b7de833 | 738 | } |
739 | ||
740 | static int | |
4b4cd312 | 741 | peerDigestFetchedEnough(DigestFetchState * fetch, char *buf, ssize_t size, const char *step_name) |
9b7de833 | 742 | { |
e13ee7ad | 743 | PeerDigest *pd = NULL; |
8a6218c6 | 744 | const char *host = "<unknown>"; /* peer host */ |
745 | const char *reason = NULL; /* reason for completion */ | |
746 | const char *no_bug = NULL; /* successful completion if set */ | |
e2848e94 | 747 | const int pdcb_valid = cbdataReferenceValid(fetch->pd); |
748 | const int pcb_valid = cbdataReferenceValid(fetch->pd->peer); | |
e13ee7ad | 749 | |
750 | /* test possible exiting conditions (the same for most steps!) | |
751 | * cases marked with '?!' should not happen */ | |
752 | ||
753 | if (!reason) { | |
62e76326 | 754 | if (!(pd = fetch->pd)) |
755 | reason = "peer digest disappeared?!"; | |
756 | ||
bac6d4bd | 757 | #if DONT /* WHY NOT? /HNO */ |
62e76326 | 758 | |
759 | else if (!cbdataReferenceValid(pd)) | |
760 | reason = "invalidated peer digest?!"; | |
761 | ||
5385c86a | 762 | #endif |
62e76326 | 763 | |
764 | else | |
b4197865 | 765 | host = pd->host.termedBuf(); |
e13ee7ad | 766 | } |
62e76326 | 767 | |
e4049756 | 768 | debugs(72, 6, step_name << ": peer " << host << ", offset: " << |
769 | fetch->offset << " size: " << size << "."); | |
e13ee7ad | 770 | |
771 | /* continue checking (with pd and host known and valid) */ | |
62e76326 | 772 | |
e13ee7ad | 773 | if (!reason) { |
62e76326 | 774 | if (!cbdataReferenceValid(pd->peer)) |
775 | reason = "peer disappeared"; | |
776 | else if (size < 0) | |
777 | reason = "swap failure"; | |
778 | else if (!fetch->entry) | |
779 | reason = "swap aborted?!"; | |
780 | else if (EBIT_TEST(fetch->entry->flags, ENTRY_ABORTED)) | |
781 | reason = "swap aborted"; | |
e13ee7ad | 782 | } |
62e76326 | 783 | |
e13ee7ad | 784 | /* continue checking (maybe-successful eof case) */ |
785 | if (!reason && !size) { | |
62e76326 | 786 | if (!pd->cd) |
787 | reason = "null digest?!"; | |
47f6e231 | 788 | else if (fetch->mask_offset != (int)pd->cd->mask_size) |
62e76326 | 789 | reason = "premature end of digest?!"; |
790 | else if (!peerDigestUseful(pd)) | |
791 | reason = "useless digest"; | |
792 | else | |
793 | reason = no_bug = "success"; | |
e13ee7ad | 794 | } |
62e76326 | 795 | |
e13ee7ad | 796 | /* finish if we have a reason */ |
9b7de833 | 797 | if (reason) { |
62e76326 | 798 | const int level = strstr(reason, "?!") ? 1 : 3; |
bf8fe701 | 799 | debugs(72, level, "" << step_name << ": peer " << host << ", exiting after '" << reason << "'"); |
62e76326 | 800 | peerDigestReqFinish(fetch, buf, |
801 | 1, pdcb_valid, pcb_valid, reason, !no_bug); | |
e13ee7ad | 802 | } else { |
62e76326 | 803 | /* paranoid check */ |
804 | assert(pdcb_valid && pcb_valid); | |
e13ee7ad | 805 | } |
62e76326 | 806 | |
e13ee7ad | 807 | return reason != NULL; |
808 | } | |
809 | ||
551e60a9 | 810 | /* call this when all callback data is valid and fetch must be stopped but |
811 | * no error has occurred (e.g. we received 304 reply and reuse old digest) */ | |
812 | static void | |
813 | peerDigestFetchStop(DigestFetchState * fetch, char *buf, const char *reason) | |
814 | { | |
815 | assert(reason); | |
b4197865 | 816 | debugs(72, 2, "peerDigestFetchStop: peer " << fetch->pd->host << ", reason: " << reason); |
551e60a9 | 817 | peerDigestReqFinish(fetch, buf, 1, 1, 1, reason, 0); |
818 | } | |
819 | ||
e13ee7ad | 820 | /* call this when all callback data is valid but something bad happened */ |
821 | static void | |
822 | peerDigestFetchAbort(DigestFetchState * fetch, char *buf, const char *reason) | |
823 | { | |
551e60a9 | 824 | assert(reason); |
b4197865 | 825 | debugs(72, 2, "peerDigestFetchAbort: peer " << fetch->pd->host << ", reason: " << reason); |
e13ee7ad | 826 | peerDigestReqFinish(fetch, buf, 1, 1, 1, reason, 1); |
827 | } | |
828 | ||
829 | /* complete the digest transfer, update stats, unlock/release everything */ | |
830 | static void | |
831 | peerDigestReqFinish(DigestFetchState * fetch, char *buf, | |
62e76326 | 832 | int fcb_valid, int pdcb_valid, int pcb_valid, |
833 | const char *reason, int err) | |
e13ee7ad | 834 | { |
835 | assert(reason); | |
836 | ||
837 | /* must go before peerDigestPDFinish */ | |
62e76326 | 838 | |
e13ee7ad | 839 | if (pdcb_valid) { |
62e76326 | 840 | fetch->pd->flags.requested = 0; |
841 | fetch->pd->req_result = reason; | |
e13ee7ad | 842 | } |
62e76326 | 843 | |
e13ee7ad | 844 | /* schedule next check if peer is still out there */ |
845 | if (pcb_valid) { | |
62e76326 | 846 | PeerDigest *pd = fetch->pd; |
847 | ||
848 | if (err) { | |
849 | pd->times.retry_delay = peerDigestIncDelay(pd); | |
850 | peerDigestSetCheck(pd, pd->times.retry_delay); | |
851 | } else { | |
852 | pd->times.retry_delay = 0; | |
853 | peerDigestSetCheck(pd, peerDigestNewDelay(fetch->entry)); | |
854 | } | |
9b7de833 | 855 | } |
62e76326 | 856 | |
e13ee7ad | 857 | /* note: order is significant */ |
858 | if (fcb_valid) | |
62e76326 | 859 | peerDigestFetchSetStats(fetch); |
860 | ||
e13ee7ad | 861 | if (pdcb_valid) |
62e76326 | 862 | peerDigestPDFinish(fetch, pcb_valid, err); |
863 | ||
e13ee7ad | 864 | if (fcb_valid) |
62e76326 | 865 | peerDigestFetchFinish(fetch, err); |
9b7de833 | 866 | } |
867 | ||
e13ee7ad | 868 | |
869 | /* destroys digest if peer disappeared | |
870 | * must be called only when fetch and pd cbdata are valid */ | |
9b7de833 | 871 | static void |
e13ee7ad | 872 | peerDigestPDFinish(DigestFetchState * fetch, int pcb_valid, int err) |
9b7de833 | 873 | { |
e13ee7ad | 874 | PeerDigest *pd = fetch->pd; |
b4197865 | 875 | const char *host = pd->host.termedBuf(); |
e13ee7ad | 876 | |
877 | pd->times.received = squid_curtime; | |
878 | pd->times.req_delay = fetch->resp_time; | |
8a6218c6 | 879 | kb_incr(&pd->stats.sent.kbytes, (size_t) fetch->sent.bytes); |
880 | kb_incr(&pd->stats.recv.kbytes, (size_t) fetch->recv.bytes); | |
e13ee7ad | 881 | pd->stats.sent.msgs += fetch->sent.msg; |
882 | pd->stats.recv.msgs += fetch->recv.msg; | |
883 | ||
884 | if (err) { | |
bf8fe701 | 885 | debugs(72, 1, "" << (pcb_valid ? "temporary " : "" ) << "disabling (" << pd->req_result << ") digest from " << host); |
62e76326 | 886 | |
887 | if (pd->cd) { | |
888 | cacheDigestDestroy(pd->cd); | |
889 | pd->cd = NULL; | |
890 | } | |
891 | ||
892 | pd->flags.usable = 0; | |
893 | ||
894 | if (!pcb_valid) | |
895 | peerDigestNotePeerGone(pd); | |
e13ee7ad | 896 | } else { |
62e76326 | 897 | assert(pcb_valid); |
898 | ||
899 | pd->flags.usable = 1; | |
e13ee7ad | 900 | |
62e76326 | 901 | /* XXX: ugly condition, but how? */ |
e13ee7ad | 902 | |
62e76326 | 903 | if (fetch->entry->store_status == STORE_OK) |
bf8fe701 | 904 | debugs(72, 2, "re-used old digest from " << host); |
62e76326 | 905 | else |
bf8fe701 | 906 | debugs(72, 2, "received valid digest from " << host); |
d1cdaa16 | 907 | } |
62e76326 | 908 | |
fa80a8ef | 909 | cbdataReferenceDone(fetch->pd); |
e13ee7ad | 910 | } |
911 | ||
912 | /* free fetch state structures | |
913 | * must be called only when fetch cbdata is valid */ | |
914 | static void | |
915 | peerDigestFetchFinish(DigestFetchState * fetch, int err) | |
916 | { | |
917 | assert(fetch->entry && fetch->request); | |
918 | ||
9b7de833 | 919 | if (fetch->old_entry) { |
48e7baac | 920 | debugs(72, 3, "peerDigestFetchFinish: deleting old entry"); |
8121ba82 | 921 | storeUnregister(fetch->old_sc, fetch->old_entry, fetch); |
d88e3c49 | 922 | fetch->old_entry->releaseRequest(); |
97b5e68f | 923 | fetch->old_entry->unlock(); |
62e76326 | 924 | fetch->old_entry = NULL; |
9b7de833 | 925 | } |
62e76326 | 926 | |
1543ab6c | 927 | /* update global stats */ |
83704487 | 928 | kb_incr(&statCounter.cd.kbytes_sent, (size_t) fetch->sent.bytes); |
62e76326 | 929 | |
83704487 | 930 | kb_incr(&statCounter.cd.kbytes_recv, (size_t) fetch->recv.bytes); |
62e76326 | 931 | |
83704487 | 932 | statCounter.cd.msgs_sent += fetch->sent.msg; |
62e76326 | 933 | |
83704487 | 934 | statCounter.cd.msgs_recv += fetch->recv.msg; |
e13ee7ad | 935 | |
1543ab6c | 936 | /* unlock everything */ |
06d2839d | 937 | storeUnregister(fetch->sc, fetch->entry, fetch); |
62e76326 | 938 | |
97b5e68f | 939 | fetch->entry->unlock(); |
62e76326 | 940 | |
6dd9f4bd | 941 | HTTPMSGUNLOCK(fetch->request); |
62e76326 | 942 | |
9b7de833 | 943 | fetch->entry = NULL; |
62e76326 | 944 | |
3855c318 | 945 | assert(fetch->pd == NULL); |
62e76326 | 946 | |
9b7de833 | 947 | cbdataFree(fetch); |
9b7de833 | 948 | } |
949 | ||
e13ee7ad | 950 | /* calculate fetch stats after completion */ |
951 | static void | |
952 | peerDigestFetchSetStats(DigestFetchState * fetch) | |
953 | { | |
954 | MemObject *mem; | |
955 | assert(fetch->entry && fetch->request); | |
956 | ||
957 | mem = fetch->entry->mem_obj; | |
958 | assert(mem); | |
959 | ||
960 | /* XXX: outgoing numbers are not precise */ | |
961 | /* XXX: we must distinguish between 304 hits and misses here */ | |
e11fe29a | 962 | fetch->sent.bytes = fetch->request->prefixLen(); |
528b2c61 | 963 | /* XXX: this is slightly wrong: we don't KNOW that the entire memobject |
964 | * was fetched. We only know how big it is | |
965 | */ | |
966 | fetch->recv.bytes = mem->size(); | |
e13ee7ad | 967 | fetch->sent.msg = fetch->recv.msg = 1; |
968 | fetch->expires = fetch->entry->expires; | |
969 | fetch->resp_time = squid_curtime - fetch->start_time; | |
970 | ||
bf8fe701 | 971 | debugs(72, 3, "peerDigestFetchFinish: recv " << fetch->recv.bytes << |
972 | " bytes in " << (int) fetch->resp_time << " secs"); | |
973 | ||
974 | debugs(72, 3, "peerDigestFetchFinish: expires: " << | |
975 | (long int) fetch->expires << " (" << std::showpos << | |
976 | (int) (fetch->expires - squid_curtime) << "), lmt: " << | |
977 | std::noshowpos << (long int) fetch->entry->lastmod << " (" << | |
978 | std::showpos << (int) (fetch->entry->lastmod - squid_curtime) << | |
979 | ")"); | |
980 | ||
e13ee7ad | 981 | } |
982 | ||
983 | ||
9b7de833 | 984 | static int |
8a6218c6 | 985 | peerDigestSetCBlock(PeerDigest * pd, const char *buf) |
9b7de833 | 986 | { |
987 | StoreDigestCBlock cblock; | |
988 | int freed_size = 0; | |
b4197865 | 989 | const char *host = pd->host.termedBuf(); |
e13ee7ad | 990 | |
41d00cd3 | 991 | memcpy(&cblock, buf, sizeof(cblock)); |
9b7de833 | 992 | /* network -> host conversions */ |
993 | cblock.ver.current = ntohs(cblock.ver.current); | |
994 | cblock.ver.required = ntohs(cblock.ver.required); | |
995 | cblock.capacity = ntohl(cblock.capacity); | |
996 | cblock.count = ntohl(cblock.count); | |
997 | cblock.del_count = ntohl(cblock.del_count); | |
998 | cblock.mask_size = ntohl(cblock.mask_size); | |
bf8fe701 | 999 | debugs(72, 2, "got digest cblock from " << host << "; ver: " << |
1000 | (int) cblock.ver.current << " (req: " << (int) cblock.ver.required << | |
1001 | ")"); | |
1002 | ||
26ac0430 AJ |
1003 | debugs(72, 2, "\t size: " << |
1004 | cblock.mask_size << " bytes, e-cnt: " << | |
1005 | cblock.count << ", e-util: " << | |
bf8fe701 | 1006 | xpercentInt(cblock.count, cblock.capacity) << "%" ); |
6106c6fc | 1007 | /* check version requirements (both ways) */ |
62e76326 | 1008 | |
9b7de833 | 1009 | if (cblock.ver.required > CacheDigestVer.current) { |
bf8fe701 | 1010 | debugs(72, 1, "" << host << " digest requires version " << |
1011 | cblock.ver.required << "; have: " << CacheDigestVer.current); | |
1012 | ||
62e76326 | 1013 | return 0; |
9b7de833 | 1014 | } |
62e76326 | 1015 | |
6106c6fc | 1016 | if (cblock.ver.current < CacheDigestVer.required) { |
bf8fe701 | 1017 | debugs(72, 1, "" << host << " digest is version " << |
1018 | cblock.ver.current << "; we require: " << | |
1019 | CacheDigestVer.required); | |
1020 | ||
62e76326 | 1021 | return 0; |
6106c6fc | 1022 | } |
62e76326 | 1023 | |
9b7de833 | 1024 | /* check consistency */ |
4b4cd312 | 1025 | if (cblock.ver.required > cblock.ver.current || |
62e76326 | 1026 | cblock.mask_size <= 0 || cblock.capacity <= 0 || |
1027 | cblock.bits_per_entry <= 0 || cblock.hash_func_count <= 0) { | |
bf8fe701 | 1028 | debugs(72, 0, "" << host << " digest cblock is corrupted."); |
62e76326 | 1029 | return 0; |
9b7de833 | 1030 | } |
62e76326 | 1031 | |
d1cdaa16 | 1032 | /* check consistency further */ |
e6ccf245 | 1033 | if ((size_t)cblock.mask_size != cacheDigestCalcMaskSize(cblock.capacity, cblock.bits_per_entry)) { |
e4049756 | 1034 | debugs(72, 0, host << " digest cblock is corrupted " << |
1035 | "(mask size mismatch: " << cblock.mask_size << " ? " << | |
1036 | cacheDigestCalcMaskSize(cblock.capacity, cblock.bits_per_entry) | |
1037 | << ")."); | |
62e76326 | 1038 | return 0; |
d1cdaa16 | 1039 | } |
62e76326 | 1040 | |
d1cdaa16 | 1041 | /* there are some things we cannot do yet */ |
1042 | if (cblock.hash_func_count != CacheDigestHashFuncCount) { | |
bf8fe701 | 1043 | debugs(72, 0, "" << host << " digest: unsupported #hash functions: " << |
1044 | cblock.hash_func_count << " ? " << CacheDigestHashFuncCount << "."); | |
62e76326 | 1045 | return 0; |
d1cdaa16 | 1046 | } |
62e76326 | 1047 | |
9b7de833 | 1048 | /* |
1049 | * no cblock bugs below this point | |
1050 | */ | |
1051 | /* check size changes */ | |
e6ccf245 | 1052 | if (pd->cd && cblock.mask_size != (ssize_t)pd->cd->mask_size) { |
e4049756 | 1053 | debugs(72, 2, host << " digest changed size: " << cblock.mask_size << |
1054 | " -> " << pd->cd->mask_size); | |
62e76326 | 1055 | freed_size = pd->cd->mask_size; |
1056 | cacheDigestDestroy(pd->cd); | |
1057 | pd->cd = NULL; | |
9b7de833 | 1058 | } |
62e76326 | 1059 | |
e13ee7ad | 1060 | if (!pd->cd) { |
26ac0430 AJ |
1061 | debugs(72, 2, "creating " << host << " digest; size: " << cblock.mask_size << " (" << |
1062 | std::showpos << (int) (cblock.mask_size - freed_size) << ") bytes"); | |
62e76326 | 1063 | pd->cd = cacheDigestCreate(cblock.capacity, cblock.bits_per_entry); |
1064 | ||
1065 | if (cblock.mask_size >= freed_size) | |
1066 | kb_incr(&statCounter.cd.memory, cblock.mask_size - freed_size); | |
9b7de833 | 1067 | } |
62e76326 | 1068 | |
e13ee7ad | 1069 | assert(pd->cd); |
9b7de833 | 1070 | /* these assignments leave us in an inconsistent state until we finish reading the digest */ |
e13ee7ad | 1071 | pd->cd->count = cblock.count; |
1072 | pd->cd->del_count = cblock.del_count; | |
9b7de833 | 1073 | return 1; |
1074 | } | |
1075 | ||
9b7de833 | 1076 | static int |
8a6218c6 | 1077 | peerDigestUseful(const PeerDigest * pd) |
9b7de833 | 1078 | { |
d1cdaa16 | 1079 | /* TODO: we should calculate the prob of a false hit instead of bit util */ |
e13ee7ad | 1080 | const int bit_util = cacheDigestBitUtil(pd->cd); |
62e76326 | 1081 | |
e13ee7ad | 1082 | if (bit_util > 65) { |
b4197865 | 1083 | debugs(72, 0, "Warning: " << pd->host << |
bf8fe701 | 1084 | " peer digest has too many bits on (" << bit_util << "%%)."); |
1085 | ||
62e76326 | 1086 | return 0; |
9b7de833 | 1087 | } |
62e76326 | 1088 | |
9b7de833 | 1089 | return 1; |
1090 | } | |
7f6eb0fe | 1091 | |
e13ee7ad | 1092 | static int |
1093 | saneDiff(time_t diff) | |
1094 | { | |
3db6fb54 | 1095 | return abs((int) diff) > squid_curtime / 2 ? 0 : diff; |
e13ee7ad | 1096 | } |
1097 | ||
1098 | void | |
8a6218c6 | 1099 | peerDigestStatsReport(const PeerDigest * pd, StoreEntry * e) |
e13ee7ad | 1100 | { |
1101 | #define f2s(flag) (pd->flags.flag ? "yes" : "no") | |
38650cc8 | 1102 | #define appendTime(tm) storeAppendPrintf(e, "%s\t %10ld\t %+d\t %+d\n", \ |
1103 | ""#tm, (long int)pd->times.tm, \ | |
e13ee7ad | 1104 | saneDiff(pd->times.tm - squid_curtime), \ |
1105 | saneDiff(pd->times.tm - pd->times.initialized)) | |
1106 | ||
e13ee7ad | 1107 | assert(pd); |
1108 | ||
b4197865 | 1109 | const char *host = pd->host.termedBuf(); |
e13ee7ad | 1110 | storeAppendPrintf(e, "\npeer digest from %s\n", host); |
1111 | ||
1112 | cacheDigestGuessStatsReport(&pd->stats.guess, e, host); | |
1113 | ||
1114 | storeAppendPrintf(e, "\nevent\t timestamp\t secs from now\t secs from init\n"); | |
1115 | appendTime(initialized); | |
1116 | appendTime(needed); | |
1117 | appendTime(requested); | |
1118 | appendTime(received); | |
1119 | appendTime(next_check); | |
1120 | ||
1121 | storeAppendPrintf(e, "peer digest state:\n"); | |
1122 | storeAppendPrintf(e, "\tneeded: %3s, usable: %3s, requested: %3s\n", | |
62e76326 | 1123 | f2s(needed), f2s(usable), f2s(requested)); |
e13ee7ad | 1124 | storeAppendPrintf(e, "\n\tlast retry delay: %d secs\n", |
62e76326 | 1125 | (int) pd->times.retry_delay); |
e13ee7ad | 1126 | storeAppendPrintf(e, "\tlast request response time: %d secs\n", |
62e76326 | 1127 | (int) pd->times.req_delay); |
e13ee7ad | 1128 | storeAppendPrintf(e, "\tlast request result: %s\n", |
62e76326 | 1129 | pd->req_result ? pd->req_result : "(none)"); |
e13ee7ad | 1130 | |
1131 | storeAppendPrintf(e, "\npeer digest traffic:\n"); | |
1132 | storeAppendPrintf(e, "\trequests sent: %d, volume: %d KB\n", | |
62e76326 | 1133 | pd->stats.sent.msgs, (int) pd->stats.sent.kbytes.kb); |
e13ee7ad | 1134 | storeAppendPrintf(e, "\treplies recv: %d, volume: %d KB\n", |
62e76326 | 1135 | pd->stats.recv.msgs, (int) pd->stats.recv.kbytes.kb); |
e13ee7ad | 1136 | |
1137 | storeAppendPrintf(e, "\npeer digest structure:\n"); | |
62e76326 | 1138 | |
e13ee7ad | 1139 | if (pd->cd) |
62e76326 | 1140 | cacheDigestReport(pd->cd, host, e); |
e13ee7ad | 1141 | else |
62e76326 | 1142 | storeAppendPrintf(e, "\tno in-memory copy\n"); |
e13ee7ad | 1143 | } |
1144 | ||
7f6eb0fe | 1145 | #endif |