3 * DEBUG: section 72 Peer Digest Routines
4 * AUTHOR: Alex Rousskov
6 * SQUID Web Proxy Cache http://www.squid-cache.org/
7 * ----------------------------------------------------------
9 * Squid is the result of efforts by numerous individuals from
10 * the Internet community; see the CONTRIBUTORS file for full
11 * details. Many organizations have provided support for Squid's
12 * development; see the SPONSORS file for full details. Squid is
13 * Copyrighted (C) 2001 by the Regents of the University of
14 * California; see the COPYRIGHT file for full details. Squid
15 * incorporates software developed and/or copyrighted by other
16 * sources; see the CREDITS file for full details.
18 * This program is free software; you can redistribute it and/or modify
19 * it under the terms of the GNU General Public License as published by
20 * the Free Software Foundation; either version 2 of the License, or
21 * (at your option) any later version.
23 * This program is distributed in the hope that it will be useful,
24 * but WITHOUT ANY WARRANTY; without even the implied warranty of
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
26 * GNU General Public License for more details.
28 * You should have received a copy of the GNU General Public License
29 * along with this program; if not, write to the Free Software
30 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
36 #include "CacheDigest.h"
37 #include "CachePeer.h"
41 #include "HttpReply.h"
42 #include "HttpRequest.h"
44 #include "MemObject.h"
45 #include "mime_header.h"
46 #include "neighbors.h"
47 #include "PeerDigest.h"
48 #include "SquidTime.h"
50 #include "store_key_md5.h"
51 #include "StoreClient.h"
56 /* local prototypes */
57 static time_t peerDigestIncDelay(const PeerDigest
* pd
);
58 static time_t peerDigestNewDelay(const StoreEntry
* e
);
59 static void peerDigestSetCheck(PeerDigest
* pd
, time_t delay
);
60 static void peerDigestClean(PeerDigest
*);
61 static EVH peerDigestCheck
;
62 static void peerDigestRequest(PeerDigest
* pd
);
63 static STCB peerDigestHandleReply
;
64 static int peerDigestFetchReply(void *, char *, ssize_t
);
65 int peerDigestSwapInHeaders(void *, char *, ssize_t
);
66 int peerDigestSwapInCBlock(void *, char *, ssize_t
);
67 int peerDigestSwapInMask(void *, char *, ssize_t
);
68 static int peerDigestFetchedEnough(DigestFetchState
* fetch
, char *buf
, ssize_t size
, const char *step_name
);
69 static void peerDigestFetchStop(DigestFetchState
* fetch
, char *buf
, const char *reason
);
70 static void peerDigestFetchAbort(DigestFetchState
* fetch
, char *buf
, const char *reason
);
71 static void peerDigestReqFinish(DigestFetchState
* fetch
, char *buf
, int, int, int, const char *reason
, int err
);
72 static void peerDigestPDFinish(DigestFetchState
* fetch
, int pcb_valid
, int err
);
73 static void peerDigestFetchFinish(DigestFetchState
* fetch
, int err
);
74 static void peerDigestFetchSetStats(DigestFetchState
* fetch
);
75 static int peerDigestSetCBlock(PeerDigest
* pd
, const char *buf
);
76 static int peerDigestUseful(const PeerDigest
* pd
);
79 Version
const CacheDigestVer
= { 5, 3 };
81 #define StoreDigestCBlockSize sizeof(StoreDigestCBlock)
83 /* min interval for requesting digests from a given peer */
84 static const time_t PeerDigestReqMinGap
= 5 * 60; /* seconds */
85 /* min interval for requesting digests (cumulative request stream) */
86 static const time_t GlobDigestReqMinGap
= 1 * 60; /* seconds */
90 static time_t pd_last_req_time
= 0; /* last call to Check */
92 /* initialize peer digest */
94 peerDigestInit(PeerDigest
* pd
, CachePeer
* p
)
98 memset(pd
, 0, sizeof(*pd
));
101 * Lock on to the peer here. The corresponding cbdataReferenceDone()
102 * is in peerDigestDestroy().
104 pd
->peer
= cbdataReference(p
);
105 /* if peer disappears, we will know it's name */
108 pd
->times
.initialized
= squid_curtime
;
112 peerDigestClean(PeerDigest
* pd
)
117 cacheDigestDestroy(pd
->cd
);
122 CBDATA_CLASS_INIT(PeerDigest
);
124 /* allocate new peer digest, call Init, and lock everything */
126 peerDigestCreate(CachePeer
* p
)
132 peerDigestInit(pd
, p
);
134 /* XXX This does not look right, and the same thing again in the caller */
135 return cbdataReference(pd
);
138 /* call Clean and free/unlock everything */
140 peerDigestDestroy(PeerDigest
* pd
)
144 void * peerTmp
= pd
->peer
;
148 * We locked the peer in peerDigestInit(), this is
149 * where we unlock it. If the peer is still valid,
150 * tell it that the digest is gone.
152 if (cbdataReferenceValidDone(peerTmp
, &p
))
153 peerNoteDigestGone((CachePeer
*)p
);
160 /* called by peer to indicate that somebody actually needs this digest */
162 peerDigestNeeded(PeerDigest
* pd
)
165 assert(!pd
->flags
.needed
);
168 pd
->flags
.needed
= true;
169 pd
->times
.needed
= squid_curtime
;
170 peerDigestSetCheck(pd
, 0); /* check asap */
173 /* currently we do not have a reason to disable without destroying */
175 /* disables peer for good */
177 peerDigestDisable(PeerDigest
* pd
)
179 debugs(72, 2, "peerDigestDisable: peer " << pd
->host
.buf() << " disabled for good");
180 pd
->times
.disabled
= squid_curtime
;
181 pd
->times
.next_check
= -1; /* never */
182 pd
->flags
.usable
= 0;
185 cacheDigestDestroy(pd
->cd
);
189 /* we do not destroy the pd itself to preserve its "history" and stats */
194 /* increment retry delay [after an unsuccessful attempt] */
196 peerDigestIncDelay(const PeerDigest
* pd
)
199 return pd
->times
.retry_delay
> 0 ?
200 2 * pd
->times
.retry_delay
: /* exponential backoff */
201 PeerDigestReqMinGap
; /* minimal delay */
204 /* artificially increases Expires: setting to avoid race conditions
205 * returns the delay till that [increased] expiration time */
207 peerDigestNewDelay(const StoreEntry
* e
)
212 return e
->expires
+ PeerDigestReqMinGap
- squid_curtime
;
214 return PeerDigestReqMinGap
;
217 /* registers next digest verification */
219 peerDigestSetCheck(PeerDigest
* pd
, time_t delay
)
221 eventAdd("peerDigestCheck", peerDigestCheck
, pd
, (double) delay
, 1);
222 pd
->times
.next_check
= squid_curtime
+ delay
;
223 debugs(72, 3, "peerDigestSetCheck: will check peer " << pd
->host
<< " in " << delay
<< " secs");
227 * called when peer is about to disappear or have already disappeared
230 peerDigestNotePeerGone(PeerDigest
* pd
)
232 if (pd
->flags
.requested
) {
233 debugs(72, 2, "peerDigest: peer " << pd
->host
<< " gone, will destroy after fetch.");
234 /* do nothing now, the fetching chain will notice and take action */
236 debugs(72, 2, "peerDigest: peer " << pd
->host
<< " is gone, destroying now.");
237 peerDigestDestroy(pd
);
241 /* callback for eventAdd() (with peer digest locked)
242 * request new digest if our copy is too old or if we lack one;
243 * schedule next check otherwise */
245 peerDigestCheck(void *data
)
247 PeerDigest
*pd
= (PeerDigest
*)data
;
250 assert(!pd
->flags
.requested
);
252 pd
->times
.next_check
= 0; /* unknown */
254 if (!cbdataReferenceValid(pd
->peer
)) {
255 peerDigestNotePeerGone(pd
);
259 debugs(72, 3, "peerDigestCheck: peer " << pd
->peer
->host
<< ":" << pd
->peer
->http_port
);
260 debugs(72, 3, "peerDigestCheck: time: " << squid_curtime
<<
261 ", last received: " << (long int) pd
->times
.received
<< " (" <<
262 std::showpos
<< (int) (squid_curtime
- pd
->times
.received
) << ")");
264 /* decide when we should send the request:
265 * request now unless too close to other requests */
266 req_time
= squid_curtime
;
270 if (req_time
- pd
->times
.received
< PeerDigestReqMinGap
) {
271 debugs(72, 2, "peerDigestCheck: " << pd
->host
<<
272 ", avoiding close peer requests (" <<
273 (int) (req_time
- pd
->times
.received
) << " < " <<
274 (int) PeerDigestReqMinGap
<< " secs).");
276 req_time
= pd
->times
.received
+ PeerDigestReqMinGap
;
280 if (req_time
- pd_last_req_time
< GlobDigestReqMinGap
) {
281 debugs(72, 2, "peerDigestCheck: " << pd
->host
<<
282 ", avoiding close requests (" <<
283 (int) (req_time
- pd_last_req_time
) << " < " <<
284 (int) GlobDigestReqMinGap
<< " secs).");
286 req_time
= pd_last_req_time
+ GlobDigestReqMinGap
;
289 if (req_time
<= squid_curtime
)
290 peerDigestRequest(pd
); /* will set pd->flags.requested */
292 peerDigestSetCheck(pd
, req_time
- squid_curtime
);
295 CBDATA_TYPE(DigestFetchState
);
297 /* ask store for a digest */
299 peerDigestRequest(PeerDigest
* pd
)
301 CachePeer
*p
= pd
->peer
;
302 StoreEntry
*e
, *old_e
;
304 const cache_key
*key
;
306 DigestFetchState
*fetch
= NULL
;
307 StoreIOBuffer tempBuffer
;
309 pd
->req_result
= NULL
;
310 pd
->flags
.requested
= true;
312 /* compute future request components */
315 url
= xstrdup(p
->digest_url
);
317 url
= internalRemoteUri(p
->host
, p
->http_port
,
318 "/squid-internal-periodic/", StoreDigestFileName
);
320 req
= HttpRequest::CreateFromUrl(url
);
324 key
= storeKeyPublicByRequest(req
);
326 debugs(72, 2, "peerDigestRequest: " << url
<< " key: " << storeKeyText(key
));
328 /* add custom headers */
329 assert(!req
->header
.len
);
331 req
->header
.putStr(HDR_ACCEPT
, StoreDigestMimeStr
);
333 req
->header
.putStr(HDR_ACCEPT
, "text/html");
336 p
->login
[0] != '*' &&
337 strcmp(p
->login
, "PASS") != 0 &&
338 strcmp(p
->login
, "PASSTHRU") != 0 &&
339 strcmp(p
->login
, "NEGOTIATE") != 0 &&
340 strcmp(p
->login
, "PROXYPASS") != 0) {
341 xstrncpy(req
->login
, p
->login
, MAX_LOGIN_SZ
);
343 /* create fetch state structure */
344 CBDATA_INIT_TYPE(DigestFetchState
);
346 fetch
= cbdataAlloc(DigestFetchState
);
348 fetch
->request
= req
;
349 HTTPMSGLOCK(fetch
->request
);
351 fetch
->pd
= cbdataReference(pd
);
355 fetch
->state
= DIGEST_READ_REPLY
;
357 /* update timestamps */
358 fetch
->start_time
= squid_curtime
;
360 pd
->times
.requested
= squid_curtime
;
362 pd_last_req_time
= squid_curtime
;
364 req
->flags
.cachable
= true;
366 /* the rest is based on clientProcessExpired() */
367 req
->flags
.refresh
= true;
369 old_e
= fetch
->old_entry
= Store::Root().get(key
);
372 debugs(72, 5, "peerDigestRequest: found old entry");
374 old_e
->lock("peerDigestRequest");
375 old_e
->createMemObject(url
, url
, req
->method
);
377 fetch
->old_sc
= storeClientListAdd(old_e
, fetch
);
380 e
= fetch
->entry
= storeCreateEntry(url
, url
, req
->flags
, req
->method
);
381 assert(EBIT_TEST(e
->flags
, KEY_PRIVATE
));
382 fetch
->sc
= storeClientListAdd(e
, fetch
);
383 /* set lastmod to trigger IMS request if possible */
386 e
->lastmod
= old_e
->lastmod
;
388 /* push towards peer cache */
389 debugs(72, 3, "peerDigestRequest: forwarding to fwdStart...");
391 FwdState::fwdStart(Comm::ConnectionPointer(), e
, req
);
393 tempBuffer
.offset
= 0;
395 tempBuffer
.length
= SM_PAGE_SIZE
;
397 tempBuffer
.data
= fetch
->buf
;
399 storeClientCopy(fetch
->sc
, e
, tempBuffer
,
400 peerDigestHandleReply
, fetch
);
403 /* Handle the data copying .. */
406 * This routine handles the copy data and then redirects the
407 * copy to a bunch of subfunctions depending upon the copy state.
408 * It also tracks the buffer offset and "seen", since I'm actually
409 * not interested in rewriting everything to suit my little idea.
412 peerDigestHandleReply(void *data
, StoreIOBuffer receivedData
)
414 DigestFetchState
*fetch
= (DigestFetchState
*)data
;
416 digest_read_state_t prevstate
;
419 assert(fetch
->pd
&& receivedData
.data
);
420 /* The existing code assumes that the received pointer is
421 * where we asked the data to be put
423 assert(fetch
->buf
+ fetch
->bufofs
== receivedData
.data
);
425 /* Update the buffer size */
426 fetch
->bufofs
+= receivedData
.length
;
428 assert(fetch
->bufofs
<= SM_PAGE_SIZE
);
430 /* If we've fetched enough, return */
432 if (peerDigestFetchedEnough(fetch
, fetch
->buf
, fetch
->bufofs
, "peerDigestHandleReply"))
435 /* Call the right function based on the state */
436 /* (Those functions will update the state if needed) */
438 /* Give us a temporary reference. Some of the calls we make may
439 * try to destroy the fetch structure, and we like to know if they
442 fetch
= cbdataReference(fetch
);
444 /* Repeat this loop until we're out of data OR the state changes */
445 /* (So keep going if the state has changed and we still have data */
447 prevstate
= fetch
->state
;
449 switch (fetch
->state
) {
451 case DIGEST_READ_REPLY
:
452 retsize
= peerDigestFetchReply(fetch
, fetch
->buf
, fetch
->bufofs
);
455 case DIGEST_READ_HEADERS
:
456 retsize
= peerDigestSwapInHeaders(fetch
, fetch
->buf
, fetch
->bufofs
);
459 case DIGEST_READ_CBLOCK
:
460 retsize
= peerDigestSwapInCBlock(fetch
, fetch
->buf
, fetch
->bufofs
);
463 case DIGEST_READ_MASK
:
464 retsize
= peerDigestSwapInMask(fetch
, fetch
->buf
, fetch
->bufofs
);
467 case DIGEST_READ_NONE
:
470 case DIGEST_READ_DONE
:
475 fatal("Bad digest transfer mode!\n");
482 * The returned size indicates how much of the buffer was read -
483 * so move the remainder of the buffer to the beginning
484 * and update the bufofs / bufsize
486 newsize
= fetch
->bufofs
- retsize
;
488 memmove(fetch
->buf
, fetch
->buf
+ retsize
, fetch
->bufofs
- newsize
);
490 fetch
->bufofs
= newsize
;
492 } while (cbdataReferenceValid(fetch
) && prevstate
!= fetch
->state
&& fetch
->bufofs
> 0);
494 /* Update the copy offset */
495 fetch
->offset
+= receivedData
.length
;
497 /* Schedule another copy */
498 if (cbdataReferenceValid(fetch
)) {
499 StoreIOBuffer tempBuffer
;
500 tempBuffer
.offset
= fetch
->offset
;
501 tempBuffer
.length
= SM_PAGE_SIZE
- fetch
->bufofs
;
502 tempBuffer
.data
= fetch
->buf
+ fetch
->bufofs
;
503 storeClientCopy(fetch
->sc
, fetch
->entry
, tempBuffer
,
504 peerDigestHandleReply
, fetch
);
508 /* Get rid of our reference, we've finished with it for now */
509 cbdataReferenceDone(fetch
);
512 /* wait for full http headers to be received then parse them */
514 * This routine handles parsing the reply line.
515 * If the reply line indicates an OK, the same data is thrown
516 * to SwapInHeaders(). If the reply line is a NOT_MODIFIED,
517 * we simply stop parsing.
520 peerDigestFetchReply(void *data
, char *buf
, ssize_t size
)
522 DigestFetchState
*fetch
= (DigestFetchState
*)data
;
523 PeerDigest
*pd
= fetch
->pd
;
526 assert(!fetch
->offset
);
528 assert(fetch
->state
== DIGEST_READ_REPLY
);
530 if (peerDigestFetchedEnough(fetch
, buf
, size
, "peerDigestFetchReply"))
533 if ((hdr_size
= headersEnd(buf
, size
))) {
534 HttpReply
const *reply
= fetch
->entry
->getReply();
536 assert(reply
->sline
.status() != Http::scNone
);
537 const Http::StatusCode status
= reply
->sline
.status();
538 debugs(72, 3, "peerDigestFetchReply: " << pd
->host
<< " status: " << status
<<
539 ", expires: " << (long int) reply
->expires
<< " (" << std::showpos
<<
540 (int) (reply
->expires
- squid_curtime
) << ")");
542 /* this "if" is based on clientHandleIMSReply() */
544 if (status
== Http::scNotModified
) {
545 /* our old entry is fine */
546 assert(fetch
->old_entry
);
548 if (!fetch
->old_entry
->mem_obj
->request
) {
549 fetch
->old_entry
->mem_obj
->request
= fetch
->entry
->mem_obj
->request
;
550 HTTPMSGLOCK(fetch
->old_entry
->mem_obj
->request
);
553 assert(fetch
->old_entry
->mem_obj
->request
);
555 HttpReply
*old_rep
= (HttpReply
*) fetch
->old_entry
->getReply();
557 old_rep
->updateOnNotModified(reply
);
559 fetch
->old_entry
->timestampsSet();
561 /* get rid of 304 reply */
562 storeUnregister(fetch
->sc
, fetch
->entry
, fetch
);
564 fetch
->entry
->unlock("peerDigestFetchReply 304");
566 fetch
->entry
= fetch
->old_entry
;
568 fetch
->old_entry
= NULL
;
570 /* preserve request -- we need its size to update counters */
571 /* requestUnlink(r); */
572 /* fetch->entry->mem_obj->request = NULL; */
573 } else if (status
== Http::scOkay
) {
574 /* get rid of old entry if any */
576 if (fetch
->old_entry
) {
577 debugs(72, 3, "peerDigestFetchReply: got new digest, releasing old one");
578 storeUnregister(fetch
->old_sc
, fetch
->old_entry
, fetch
);
579 fetch
->old_entry
->releaseRequest();
580 fetch
->old_entry
->unlock("peerDigestFetchReply 200");
581 fetch
->old_entry
= NULL
;
584 /* some kind of a bug */
585 peerDigestFetchAbort(fetch
, buf
, reply
->sline
.reason());
586 return -1; /* XXX -1 will abort stuff in ReadReply! */
589 /* must have a ready-to-use store entry if we got here */
590 /* can we stay with the old in-memory digest? */
591 if (status
== Http::scNotModified
&& fetch
->pd
->cd
) {
592 peerDigestFetchStop(fetch
, buf
, "Not modified");
593 fetch
->state
= DIGEST_READ_DONE
;
595 fetch
->state
= DIGEST_READ_HEADERS
;
598 /* need more data, do we have space? */
600 if (size
>= SM_PAGE_SIZE
)
601 peerDigestFetchAbort(fetch
, buf
, "reply header too big");
604 /* We don't want to actually ack that we've handled anything,
605 * otherwise SwapInHeaders() won't get the reply line .. */
609 /* fetch headers from disk, pass on to SwapInCBlock */
611 peerDigestSwapInHeaders(void *data
, char *buf
, ssize_t size
)
613 DigestFetchState
*fetch
= (DigestFetchState
*)data
;
616 assert(fetch
->state
== DIGEST_READ_HEADERS
);
618 if (peerDigestFetchedEnough(fetch
, buf
, size
, "peerDigestSwapInHeaders"))
621 assert(!fetch
->offset
);
623 if ((hdr_size
= headersEnd(buf
, size
))) {
624 assert(fetch
->entry
->getReply());
625 assert(fetch
->entry
->getReply()->sline
.status() != Http::scNone
);
627 if (fetch
->entry
->getReply()->sline
.status() != Http::scOkay
) {
628 debugs(72, DBG_IMPORTANT
, "peerDigestSwapInHeaders: " << fetch
->pd
->host
<<
629 " status " << fetch
->entry
->getReply()->sline
.status() <<
632 peerDigestFetchAbort(fetch
, buf
, "internal status error");
636 fetch
->state
= DIGEST_READ_CBLOCK
;
637 return hdr_size
; /* Say how much data we read */
639 /* need more data, do we have space? */
641 if (size
>= SM_PAGE_SIZE
) {
642 peerDigestFetchAbort(fetch
, buf
, "stored header too big");
645 return 0; /* We need to read more to parse .. */
649 fatal("peerDigestSwapInHeaders() - shouldn't get here!\n");
650 return 0; /* keep gcc happy */
654 peerDigestSwapInCBlock(void *data
, char *buf
, ssize_t size
)
656 DigestFetchState
*fetch
= (DigestFetchState
*)data
;
658 assert(fetch
->state
== DIGEST_READ_CBLOCK
);
660 if (peerDigestFetchedEnough(fetch
, buf
, size
, "peerDigestSwapInCBlock"))
663 if (size
>= (ssize_t
)StoreDigestCBlockSize
) {
664 PeerDigest
*pd
= fetch
->pd
;
666 assert(pd
&& fetch
->entry
->getReply());
668 if (peerDigestSetCBlock(pd
, buf
)) {
669 /* XXX: soon we will have variable header size */
670 /* switch to CD buffer and fetch digest guts */
672 assert(pd
->cd
->mask
);
673 fetch
->state
= DIGEST_READ_MASK
;
674 return StoreDigestCBlockSize
;
676 peerDigestFetchAbort(fetch
, buf
, "invalid digest cblock");
680 /* need more data, do we have space? */
682 if (size
>= SM_PAGE_SIZE
) {
683 peerDigestFetchAbort(fetch
, buf
, "digest cblock too big");
686 return 0; /* We need more data */
690 fatal("peerDigestSwapInCBlock(): shouldn't get here!\n");
691 return 0; /* keep gcc happy */
695 peerDigestSwapInMask(void *data
, char *buf
, ssize_t size
)
697 DigestFetchState
*fetch
= (DigestFetchState
*)data
;
701 assert(pd
->cd
&& pd
->cd
->mask
);
704 * NOTENOTENOTENOTENOTE: buf doesn't point to pd->cd->mask anymore!
705 * we need to do the copy ourselves!
707 memcpy(pd
->cd
->mask
+ fetch
->mask_offset
, buf
, size
);
709 /* NOTE! buf points to the middle of pd->cd->mask! */
711 if (peerDigestFetchedEnough(fetch
, NULL
, size
, "peerDigestSwapInMask"))
714 fetch
->mask_offset
+= size
;
716 if (fetch
->mask_offset
>= pd
->cd
->mask_size
) {
717 debugs(72, 2, "peerDigestSwapInMask: Done! Got " <<
718 fetch
->mask_offset
<< ", expected " << pd
->cd
->mask_size
);
719 assert(fetch
->mask_offset
== pd
->cd
->mask_size
);
720 assert(peerDigestFetchedEnough(fetch
, NULL
, 0, "peerDigestSwapInMask"));
721 return -1; /* XXX! */
723 /* We always read everything, so return so */
727 fatal("peerDigestSwapInMask(): shouldn't get here!\n");
728 return 0; /* keep gcc happy */
732 peerDigestFetchedEnough(DigestFetchState
* fetch
, char *buf
, ssize_t size
, const char *step_name
)
734 PeerDigest
*pd
= NULL
;
735 const char *host
= "<unknown>"; /* peer host */
736 const char *reason
= NULL
; /* reason for completion */
737 const char *no_bug
= NULL
; /* successful completion if set */
738 const int pdcb_valid
= cbdataReferenceValid(fetch
->pd
);
739 const int pcb_valid
= cbdataReferenceValid(fetch
->pd
->peer
);
741 /* test possible exiting conditions (the same for most steps!)
742 * cases marked with '?!' should not happen */
745 if (!(pd
= fetch
->pd
))
746 reason
= "peer digest disappeared?!";
748 #if DONT /* WHY NOT? /HNO */
750 else if (!cbdataReferenceValid(pd
))
751 reason
= "invalidated peer digest?!";
756 host
= pd
->host
.termedBuf();
759 debugs(72, 6, step_name
<< ": peer " << host
<< ", offset: " <<
760 fetch
->offset
<< " size: " << size
<< ".");
762 /* continue checking (with pd and host known and valid) */
765 if (!cbdataReferenceValid(pd
->peer
))
766 reason
= "peer disappeared";
768 reason
= "swap failure";
769 else if (!fetch
->entry
)
770 reason
= "swap aborted?!";
771 else if (EBIT_TEST(fetch
->entry
->flags
, ENTRY_ABORTED
))
772 reason
= "swap aborted";
775 /* continue checking (maybe-successful eof case) */
776 if (!reason
&& !size
) {
778 reason
= "null digest?!";
779 else if (fetch
->mask_offset
!= (int)pd
->cd
->mask_size
)
780 reason
= "premature end of digest?!";
781 else if (!peerDigestUseful(pd
))
782 reason
= "useless digest";
784 reason
= no_bug
= "success";
787 /* finish if we have a reason */
789 const int level
= strstr(reason
, "?!") ? 1 : 3;
790 debugs(72, level
, "" << step_name
<< ": peer " << host
<< ", exiting after '" << reason
<< "'");
791 peerDigestReqFinish(fetch
, buf
,
792 1, pdcb_valid
, pcb_valid
, reason
, !no_bug
);
795 assert(pdcb_valid
&& pcb_valid
);
798 return reason
!= NULL
;
801 /* call this when all callback data is valid and fetch must be stopped but
802 * no error has occurred (e.g. we received 304 reply and reuse old digest) */
804 peerDigestFetchStop(DigestFetchState
* fetch
, char *buf
, const char *reason
)
807 debugs(72, 2, "peerDigestFetchStop: peer " << fetch
->pd
->host
<< ", reason: " << reason
);
808 peerDigestReqFinish(fetch
, buf
, 1, 1, 1, reason
, 0);
811 /* call this when all callback data is valid but something bad happened */
813 peerDigestFetchAbort(DigestFetchState
* fetch
, char *buf
, const char *reason
)
816 debugs(72, 2, "peerDigestFetchAbort: peer " << fetch
->pd
->host
<< ", reason: " << reason
);
817 peerDigestReqFinish(fetch
, buf
, 1, 1, 1, reason
, 1);
820 /* complete the digest transfer, update stats, unlock/release everything */
822 peerDigestReqFinish(DigestFetchState
* fetch
, char *buf
,
823 int fcb_valid
, int pdcb_valid
, int pcb_valid
,
824 const char *reason
, int err
)
828 /* must go before peerDigestPDFinish */
831 fetch
->pd
->flags
.requested
= false;
832 fetch
->pd
->req_result
= reason
;
835 /* schedule next check if peer is still out there */
837 PeerDigest
*pd
= fetch
->pd
;
840 pd
->times
.retry_delay
= peerDigestIncDelay(pd
);
841 peerDigestSetCheck(pd
, pd
->times
.retry_delay
);
843 pd
->times
.retry_delay
= 0;
844 peerDigestSetCheck(pd
, peerDigestNewDelay(fetch
->entry
));
848 /* note: order is significant */
850 peerDigestFetchSetStats(fetch
);
853 peerDigestPDFinish(fetch
, pcb_valid
, err
);
856 peerDigestFetchFinish(fetch
, err
);
859 /* destroys digest if peer disappeared
860 * must be called only when fetch and pd cbdata are valid */
862 peerDigestPDFinish(DigestFetchState
* fetch
, int pcb_valid
, int err
)
864 PeerDigest
*pd
= fetch
->pd
;
865 const char *host
= pd
->host
.termedBuf();
867 pd
->times
.received
= squid_curtime
;
868 pd
->times
.req_delay
= fetch
->resp_time
;
869 kb_incr(&pd
->stats
.sent
.kbytes
, (size_t) fetch
->sent
.bytes
);
870 kb_incr(&pd
->stats
.recv
.kbytes
, (size_t) fetch
->recv
.bytes
);
871 pd
->stats
.sent
.msgs
+= fetch
->sent
.msg
;
872 pd
->stats
.recv
.msgs
+= fetch
->recv
.msg
;
875 debugs(72, DBG_IMPORTANT
, "" << (pcb_valid
? "temporary " : "" ) << "disabling (" << pd
->req_result
<< ") digest from " << host
);
878 cacheDigestDestroy(pd
->cd
);
882 pd
->flags
.usable
= false;
885 peerDigestNotePeerGone(pd
);
889 pd
->flags
.usable
= true;
891 /* XXX: ugly condition, but how? */
893 if (fetch
->entry
->store_status
== STORE_OK
)
894 debugs(72, 2, "re-used old digest from " << host
);
896 debugs(72, 2, "received valid digest from " << host
);
899 cbdataReferenceDone(fetch
->pd
);
902 /* free fetch state structures
903 * must be called only when fetch cbdata is valid */
905 peerDigestFetchFinish(DigestFetchState
* fetch
, int err
)
907 assert(fetch
->entry
&& fetch
->request
);
909 if (fetch
->old_entry
) {
910 debugs(72, 3, "peerDigestFetchFinish: deleting old entry");
911 storeUnregister(fetch
->old_sc
, fetch
->old_entry
, fetch
);
912 fetch
->old_entry
->releaseRequest();
913 fetch
->old_entry
->unlock("peerDigestFetchFinish old");
914 fetch
->old_entry
= NULL
;
917 /* update global stats */
918 kb_incr(&statCounter
.cd
.kbytes_sent
, (size_t) fetch
->sent
.bytes
);
920 kb_incr(&statCounter
.cd
.kbytes_recv
, (size_t) fetch
->recv
.bytes
);
922 statCounter
.cd
.msgs_sent
+= fetch
->sent
.msg
;
924 statCounter
.cd
.msgs_recv
+= fetch
->recv
.msg
;
926 /* unlock everything */
927 storeUnregister(fetch
->sc
, fetch
->entry
, fetch
);
929 fetch
->entry
->unlock("peerDigestFetchFinish new");
931 HTTPMSGUNLOCK(fetch
->request
);
935 assert(fetch
->pd
== NULL
);
940 /* calculate fetch stats after completion */
942 peerDigestFetchSetStats(DigestFetchState
* fetch
)
945 assert(fetch
->entry
&& fetch
->request
);
947 mem
= fetch
->entry
->mem_obj
;
950 /* XXX: outgoing numbers are not precise */
951 /* XXX: we must distinguish between 304 hits and misses here */
952 fetch
->sent
.bytes
= fetch
->request
->prefixLen();
953 /* XXX: this is slightly wrong: we don't KNOW that the entire memobject
954 * was fetched. We only know how big it is
956 fetch
->recv
.bytes
= mem
->size();
957 fetch
->sent
.msg
= fetch
->recv
.msg
= 1;
958 fetch
->expires
= fetch
->entry
->expires
;
959 fetch
->resp_time
= squid_curtime
- fetch
->start_time
;
961 debugs(72, 3, "peerDigestFetchFinish: recv " << fetch
->recv
.bytes
<<
962 " bytes in " << (int) fetch
->resp_time
<< " secs");
964 debugs(72, 3, "peerDigestFetchFinish: expires: " <<
965 (long int) fetch
->expires
<< " (" << std::showpos
<<
966 (int) (fetch
->expires
- squid_curtime
) << "), lmt: " <<
967 std::noshowpos
<< (long int) fetch
->entry
->lastmod
<< " (" <<
968 std::showpos
<< (int) (fetch
->entry
->lastmod
- squid_curtime
) <<
974 peerDigestSetCBlock(PeerDigest
* pd
, const char *buf
)
976 StoreDigestCBlock cblock
;
978 const char *host
= pd
->host
.termedBuf();
980 memcpy(&cblock
, buf
, sizeof(cblock
));
981 /* network -> host conversions */
982 cblock
.ver
.current
= ntohs(cblock
.ver
.current
);
983 cblock
.ver
.required
= ntohs(cblock
.ver
.required
);
984 cblock
.capacity
= ntohl(cblock
.capacity
);
985 cblock
.count
= ntohl(cblock
.count
);
986 cblock
.del_count
= ntohl(cblock
.del_count
);
987 cblock
.mask_size
= ntohl(cblock
.mask_size
);
988 debugs(72, 2, "got digest cblock from " << host
<< "; ver: " <<
989 (int) cblock
.ver
.current
<< " (req: " << (int) cblock
.ver
.required
<<
992 debugs(72, 2, "\t size: " <<
993 cblock
.mask_size
<< " bytes, e-cnt: " <<
994 cblock
.count
<< ", e-util: " <<
995 xpercentInt(cblock
.count
, cblock
.capacity
) << "%" );
996 /* check version requirements (both ways) */
998 if (cblock
.ver
.required
> CacheDigestVer
.current
) {
999 debugs(72, DBG_IMPORTANT
, "" << host
<< " digest requires version " <<
1000 cblock
.ver
.required
<< "; have: " << CacheDigestVer
.current
);
1005 if (cblock
.ver
.current
< CacheDigestVer
.required
) {
1006 debugs(72, DBG_IMPORTANT
, "" << host
<< " digest is version " <<
1007 cblock
.ver
.current
<< "; we require: " <<
1008 CacheDigestVer
.required
);
1013 /* check consistency */
1014 if (cblock
.ver
.required
> cblock
.ver
.current
||
1015 cblock
.mask_size
<= 0 || cblock
.capacity
<= 0 ||
1016 cblock
.bits_per_entry
<= 0 || cblock
.hash_func_count
<= 0) {
1017 debugs(72, DBG_CRITICAL
, "" << host
<< " digest cblock is corrupted.");
1021 /* check consistency further */
1022 if ((size_t)cblock
.mask_size
!= cacheDigestCalcMaskSize(cblock
.capacity
, cblock
.bits_per_entry
)) {
1023 debugs(72, DBG_CRITICAL
, host
<< " digest cblock is corrupted " <<
1024 "(mask size mismatch: " << cblock
.mask_size
<< " ? " <<
1025 cacheDigestCalcMaskSize(cblock
.capacity
, cblock
.bits_per_entry
)
1030 /* there are some things we cannot do yet */
1031 if (cblock
.hash_func_count
!= CacheDigestHashFuncCount
) {
1032 debugs(72, DBG_CRITICAL
, "" << host
<< " digest: unsupported #hash functions: " <<
1033 cblock
.hash_func_count
<< " ? " << CacheDigestHashFuncCount
<< ".");
1038 * no cblock bugs below this point
1040 /* check size changes */
1041 if (pd
->cd
&& cblock
.mask_size
!= (ssize_t
)pd
->cd
->mask_size
) {
1042 debugs(72, 2, host
<< " digest changed size: " << cblock
.mask_size
<<
1043 " -> " << pd
->cd
->mask_size
);
1044 freed_size
= pd
->cd
->mask_size
;
1045 cacheDigestDestroy(pd
->cd
);
1050 debugs(72, 2, "creating " << host
<< " digest; size: " << cblock
.mask_size
<< " (" <<
1051 std::showpos
<< (int) (cblock
.mask_size
- freed_size
) << ") bytes");
1052 pd
->cd
= cacheDigestCreate(cblock
.capacity
, cblock
.bits_per_entry
);
1054 if (cblock
.mask_size
>= freed_size
)
1055 kb_incr(&statCounter
.cd
.memory
, cblock
.mask_size
- freed_size
);
1059 /* these assignments leave us in an inconsistent state until we finish reading the digest */
1060 pd
->cd
->count
= cblock
.count
;
1061 pd
->cd
->del_count
= cblock
.del_count
;
1066 peerDigestUseful(const PeerDigest
* pd
)
1068 /* TODO: we should calculate the prob of a false hit instead of bit util */
1069 const int bit_util
= cacheDigestBitUtil(pd
->cd
);
1071 if (bit_util
> 65) {
1072 debugs(72, DBG_CRITICAL
, "Warning: " << pd
->host
<<
1073 " peer digest has too many bits on (" << bit_util
<< "%%).");
1082 saneDiff(time_t diff
)
1084 return abs((int) diff
) > squid_curtime
/ 2 ? 0 : diff
;
1088 peerDigestStatsReport(const PeerDigest
* pd
, StoreEntry
* e
)
1090 #define f2s(flag) (pd->flags.flag ? "yes" : "no")
1091 #define appendTime(tm) storeAppendPrintf(e, "%s\t %10ld\t %+d\t %+d\n", \
1092 ""#tm, (long int)pd->times.tm, \
1093 saneDiff(pd->times.tm - squid_curtime), \
1094 saneDiff(pd->times.tm - pd->times.initialized))
1098 const char *host
= pd
->host
.termedBuf();
1099 storeAppendPrintf(e
, "\npeer digest from %s\n", host
);
1101 cacheDigestGuessStatsReport(&pd
->stats
.guess
, e
, host
);
1103 storeAppendPrintf(e
, "\nevent\t timestamp\t secs from now\t secs from init\n");
1104 appendTime(initialized
);
1106 appendTime(requested
);
1107 appendTime(received
);
1108 appendTime(next_check
);
1110 storeAppendPrintf(e
, "peer digest state:\n");
1111 storeAppendPrintf(e
, "\tneeded: %3s, usable: %3s, requested: %3s\n",
1112 f2s(needed
), f2s(usable
), f2s(requested
));
1113 storeAppendPrintf(e
, "\n\tlast retry delay: %d secs\n",
1114 (int) pd
->times
.retry_delay
);
1115 storeAppendPrintf(e
, "\tlast request response time: %d secs\n",
1116 (int) pd
->times
.req_delay
);
1117 storeAppendPrintf(e
, "\tlast request result: %s\n",
1118 pd
->req_result
? pd
->req_result
: "(none)");
1120 storeAppendPrintf(e
, "\npeer digest traffic:\n");
1121 storeAppendPrintf(e
, "\trequests sent: %d, volume: %d KB\n",
1122 pd
->stats
.sent
.msgs
, (int) pd
->stats
.sent
.kbytes
.kb
);
1123 storeAppendPrintf(e
, "\treplies recv: %d, volume: %d KB\n",
1124 pd
->stats
.recv
.msgs
, (int) pd
->stats
.recv
.kbytes
.kb
);
1126 storeAppendPrintf(e
, "\npeer digest structure:\n");
1129 cacheDigestReport(pd
->cd
, host
, e
);
1131 storeAppendPrintf(e
, "\tno in-memory copy\n");