-
/*
- * $Id: carp.cc,v 1.27 2008/01/14 12:13:49 hno Exp $
- *
- * DEBUG: section 39 Peer source hash based selection
- * AUTHOR: Henrik Nordstrom
- * BASED ON: carp.cc
- *
- * SQUID Web Proxy Cache http://www.squid-cache.org/
- * ----------------------------------------------------------
- *
- * Squid is the result of efforts by numerous individuals from
- * the Internet community; see the CONTRIBUTORS file for full
- * details. Many organizations have provided support for Squid's
- * development; see the SPONSORS file for full details. Squid is
- * Copyrighted (C) 2001 by the Regents of the University of
- * California; see the COPYRIGHT file for full details. Squid
- * incorporates software developed and/or copyrighted by other
- * sources; see the CREDITS file for full details.
- *
- * 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 2 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, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
+ * Copyright (C) 1996-2017 The Squid Software Foundation and contributors
*
+ * Squid software is distributed under GPLv2+ license and includes
+ * contributions from numerous individuals and organizations.
+ * Please see the COPYING and CONTRIBUTORS files for details.
*/
+/* DEBUG: section 39 Peer source hash based selection */
+
#include "squid.h"
-#include "CacheManager.h"
+#include "CachePeer.h"
+#include "HttpRequest.h"
+#include "mgr/Registration.h"
+#include "neighbors.h"
+#include "SquidConfig.h"
#include "Store.h"
+#include <cmath>
+
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
-static int n_carp_peers = 0;
-static peer **carp_peers = NULL;
-static OBJH carpCachemgr;
+static int n_sourcehash_peers = 0;
+static CachePeer **sourcehash_peers = NULL;
+static OBJH peerSourceHashCachemgr;
+static void peerSourceHashRegisterWithCacheManager(void);
static int
peerSortWeight(const void *a, const void *b)
{
- const peer *const *p1 = (const peer *const *)a;
- const peer *const *p2 = (const peer *const *)b;
+ const CachePeer *const *p1 = (const CachePeer *const *)a;
+ const CachePeer *const *p2 = (const CachePeer *const *)b;
return (*p1)->weight - (*p2)->weight;
}
void
-carpInit(void)
+peerSourceHashInit(void)
{
int W = 0;
int K;
int k;
double P_last, X_last, Xn;
- peer *p;
- peer **P;
+ CachePeer *p;
+ CachePeer **P;
char *t;
/* Clean up */
- for (k = 0; k < n_carp_peers; k++) {
- cbdataReferenceDone(carp_peers[k]);
+ for (k = 0; k < n_sourcehash_peers; ++k) {
+ cbdataReferenceDone(sourcehash_peers[k]);
}
- safe_free(carp_peers);
- n_carp_peers = 0;
+ safe_free(sourcehash_peers);
+ n_sourcehash_peers = 0;
/* find out which peers we have */
for (p = Config.peers; p; p = p->next) {
- if (!p->options.carp)
+ if (!p->options.sourcehash)
continue;
assert(p->type == PEER_PARENT);
if (p->weight == 0)
continue;
- n_carp_peers++;
+ ++n_sourcehash_peers;
W += p->weight;
}
- if (n_carp_peers == 0)
+ peerSourceHashRegisterWithCacheManager();
+
+ if (n_sourcehash_peers == 0)
return;
- carp_peers = (peer **)xcalloc(n_carp_peers, sizeof(*carp_peers));
+ sourcehash_peers = (CachePeer **)xcalloc(n_sourcehash_peers, sizeof(*sourcehash_peers));
/* Build a list of the found peers and calculate hashes and load factors */
- for (P = carp_peers, p = Config.peers; p; p = p->next) {
- if (!p->options.carp)
+ for (P = sourcehash_peers, p = Config.peers; p; p = p->next) {
+ if (!p->options.sourcehash)
continue;
if (p->weight == 0)
continue;
/* calculate this peers hash */
- p->carp.hash = 0;
+ p->sourcehash.hash = 0;
- for (t = p->name; *t != 0; t++)
- p->carp.hash += ROTATE_LEFT(p->carp.hash, 19) + (unsigned int) *t;
+ for (t = p->name; *t != 0; ++t)
+ p->sourcehash.hash += ROTATE_LEFT(p->sourcehash.hash, 19) + (unsigned int) *t;
- p->carp.hash += p->carp.hash * 0x62531965;
+ p->sourcehash.hash += p->sourcehash.hash * 0x62531965;
- p->carp.hash = ROTATE_LEFT(p->carp.hash, 21);
+ p->sourcehash.hash = ROTATE_LEFT(p->sourcehash.hash, 21);
/* and load factor */
- p->carp.load_factor = ((double) p->weight) / (double) W;
+ p->sourcehash.load_factor = ((double) p->weight) / (double) W;
- if (floor(p->carp.load_factor * 1000.0) == 0.0)
- p->carp.load_factor = 0.0;
+ if (floor(p->sourcehash.load_factor * 1000.0) == 0.0)
+ p->sourcehash.load_factor = 0.0;
/* add it to our list of peers */
*P++ = cbdataReference(p);
}
/* Sort our list on weight */
- qsort(carp_peers, n_carp_peers, sizeof(*carp_peers), peerSortWeight);
+ qsort(sourcehash_peers, n_sourcehash_peers, sizeof(*sourcehash_peers), peerSortWeight);
/* Calculate the load factor multipliers X_k
*
* X_k = pow (X_k, {1/(K-k+1)})
* simplified to have X_1 part of the loop
*/
- K = n_carp_peers;
+ K = n_sourcehash_peers;
- P_last = 0.0; /* Empty P_0 */
+ P_last = 0.0; /* Empty P_0 */
- Xn = 1.0; /* Empty starting point of X_1 * X_2 * ... * X_{x-1} */
+ Xn = 1.0; /* Empty starting point of X_1 * X_2 * ... * X_{x-1} */
- X_last = 0.0; /* Empty X_0, nullifies the first pow statement */
+ X_last = 0.0; /* Empty X_0, nullifies the first pow statement */
- for (k = 1; k <= K; k++) {
+ for (k = 1; k <= K; ++k) {
double Kk1 = (double) (K - k + 1);
- p = carp_peers[k - 1];
- p->carp.load_multiplier = (Kk1 * (p->carp.load_factor - P_last)) / Xn;
- p->carp.load_multiplier += pow(X_last, Kk1);
- p->carp.load_multiplier = pow(p->carp.load_multiplier, 1.0 / Kk1);
- Xn *= p->carp.load_multiplier;
- X_last = p->carp.load_multiplier;
- P_last = p->carp.load_factor;
+ p = sourcehash_peers[k - 1];
+ p->sourcehash.load_multiplier = (Kk1 * (p->sourcehash.load_factor - P_last)) / Xn;
+ p->sourcehash.load_multiplier += pow(X_last, Kk1);
+ p->sourcehash.load_multiplier = pow(p->sourcehash.load_multiplier, 1.0 / Kk1);
+ Xn *= p->sourcehash.load_multiplier;
+ X_last = p->sourcehash.load_multiplier;
+ P_last = p->sourcehash.load_factor;
}
}
-void
-carpRegisterWithCacheManager(CacheManager & manager)
+static void
+peerSourceHashRegisterWithCacheManager(void)
{
- manager.registerAction("carp", "CARP information", carpCachemgr, 0, 1);
+ Mgr::RegisterAction("sourcehash", "peer sourcehash information",
+ peerSourceHashCachemgr, 0, 1);
}
-peer *
-carpSelectParent(HttpRequest * request)
+CachePeer *
+peerSourceHashSelectParent(HttpRequest * request)
{
int k;
const char *c;
- peer *p = NULL;
- peer *tp;
+ CachePeer *p = NULL;
+ CachePeer *tp;
unsigned int user_hash = 0;
unsigned int combined_hash;
double score;
const char *key = NULL;
char ntoabuf[MAX_IPSTRLEN];
- if (n_carp_peers == 0)
+ if (n_sourcehash_peers == 0)
return NULL;
- key = request->client_addr.NtoA(ntoabuf, sizeof(ntoabuf));
+ key = request->client_addr.toStr(ntoabuf, sizeof(ntoabuf));
/* calculate hash key */
- debugs(39, 2, "carpSelectParent: Calculating hash for " << key);
+ debugs(39, 2, "peerSourceHashSelectParent: Calculating hash for " << key);
- for (c = key; *c != 0; c++)
+ for (c = key; *c != 0; ++c)
user_hash += ROTATE_LEFT(user_hash, 19) + *c;
- /* select peer */
- for (k = 0; k < n_carp_peers; k++) {
- tp = carp_peers[k];
- combined_hash = (user_hash ^ tp->carp.hash);
+ /* select CachePeer */
+ for (k = 0; k < n_sourcehash_peers; ++k) {
+ tp = sourcehash_peers[k];
+ combined_hash = (user_hash ^ tp->sourcehash.hash);
combined_hash += combined_hash * 0x62531965;
combined_hash = ROTATE_LEFT(combined_hash, 21);
- score = combined_hash * tp->carp.load_multiplier;
- debugs(39, 3, "carpSelectParent: " << tp->name << " combined_hash " << combined_hash <<
+ score = combined_hash * tp->sourcehash.load_multiplier;
+ debugs(39, 3, "peerSourceHashSelectParent: " << tp->name << " combined_hash " << combined_hash <<
" score " << std::setprecision(0) << score);
if ((score > high_score) && peerHTTPOkay(tp, request)) {
}
if (p)
- debugs(39, 2, "carpSelectParent: selected " << p->name);
+ debugs(39, 2, "peerSourceHashSelectParent: selected " << p->name);
return p;
}
static void
-carpCachemgr(StoreEntry * sentry)
+peerSourceHashCachemgr(StoreEntry * sentry)
{
- peer *p;
+ CachePeer *p;
int sumfetches = 0;
storeAppendPrintf(sentry, "%24s %10s %10s %10s %10s\n",
"Hostname",
for (p = Config.peers; p; p = p->next) {
storeAppendPrintf(sentry, "%24s %10x %10f %10f %10f\n",
- p->name, p->carp.hash,
- p->carp.load_multiplier,
- p->carp.load_factor,
+ p->name, p->sourcehash.hash,
+ p->sourcehash.load_multiplier,
+ p->sourcehash.load_factor,
sumfetches ? (double) p->stats.fetches / sumfetches : -1.0);
}
}
+
projects / thirdparty / squid.git / blobdiff