-
/*
- * $Id: store_repl_lru.cc,v 1.17 2006/05/08 23:38:35 robertc Exp $
- *
- * DEBUG: section ? LRU Removal policy
- * AUTHOR: Henrik Nordstrom
- *
- * 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-2023 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: none LRU Removal Policy */
+
#include "squid.h"
-#include "Store.h"
#include "MemObject.h"
-#include "SquidTime.h"
+#include "Store.h"
REMOVALPOLICYCREATE createRemovalPolicy_lru;
-struct LruPolicyData
-{
+struct LruPolicyData {
void setPolicyNode (StoreEntry *, void *) const;
RemovalPolicy *policy;
dlink_list list;
}
}
-typedef struct _LruNode LruNode;
-
-struct _LruNode
+class LruNode
{
+ MEMPROXY_CLASS(LruNode);
+
+public:
/* Note: the dlink_node MUST be the first member of the LruNode
* structure. This member is later pointer typecasted to LruNode *.
*/
dlink_node node;
};
-static MemPool *lru_node_pool = NULL;
static int nr_lru_policies = 0;
static void
LruPolicyData *lru = (LruPolicyData *)policy->_data;
LruNode *lru_node;
assert(!node->data);
- node->data = lru_node = (LruNode *)lru_node_pool->alloc();
+ node->data = lru_node = new LruNode;
dlinkAddTail(entry, &lru_node->node, &lru->list);
lru->count += 1;
* but not be in the LRU list, so check for that case rather
* than suffer a NULL pointer access.
*/
- if (NULL == lru_node->node.data)
+ if (nullptr == lru_node->node.data)
return;
assert(lru_node->node.data == entry);
- node->data = NULL;
+ node->data = nullptr;
dlinkDelete(&lru_node->node, &lru->list);
- lru_node_pool->free(lru_node);
+ delete lru_node;
lru->count -= 1;
}
typedef struct _LruWalkData LruWalkData;
-struct _LruWalkData
-{
+struct _LruWalkData {
LruNode *current;
};
LruNode *lru_node = lru_walk->current;
if (!lru_node)
- return NULL;
+ return nullptr;
lru_walk->current = (LruNode *) lru_node->node.next;
assert(lru->nwalkers > 0);
lru->nwalkers -= 1;
safe_free(walker->_data);
- cbdataFree(walker);
+ delete walker;
}
static RemovalPolicyWalker *
RemovalPolicyWalker *walker;
LruWalkData *lru_walk;
lru->nwalkers += 1;
- walker = cbdataAlloc(RemovalPolicyWalker);
+ walker = new RemovalPolicyWalker;
lru_walk = (LruWalkData *)xcalloc(1, sizeof(*lru_walk));
walker->_policy = policy;
walker->_data = lru_walk;
typedef struct _LruPurgeData LruPurgeData;
-struct _LruPurgeData
-{
+struct _LruPurgeData {
LruNode *current;
LruNode *start;
};
lru_node = lru_walker->current;
if (!lru_node || walker->scanned >= walker->max_scan)
- return NULL;
+ return nullptr;
walker->scanned += 1;
if (lru_walker->current == lru_walker->start) {
/* Last node found */
- lru_walker->current = NULL;
+ lru_walker->current = nullptr;
}
entry = (StoreEntry *) lru_node->node.data;
dlinkDelete(&lru_node->node, &lru->list);
- if (storeEntryLocked(entry)) {
+ if (entry->locked()) {
/* Shit, it is locked. we can't return this one */
- walker->locked++;
+ ++ walker->locked;
dlinkAddTail(entry, &lru_node->node, &lru->list);
goto try_again;
}
- lru_node_pool->free(lru_node);
+ delete lru_node;
lru->count -= 1;
- lru->setPolicyNode(entry, NULL);
+ lru->setPolicyNode(entry, nullptr);
return entry;
}
assert(lru->nwalkers > 0);
lru->nwalkers -= 1;
safe_free(walker->_data);
- cbdataFree(walker);
+ delete walker;
}
static RemovalPurgeWalker *
RemovalPurgeWalker *walker;
LruPurgeData *lru_walk;
lru->nwalkers += 1;
- walker = cbdataAlloc(RemovalPurgeWalker);
+ walker = new RemovalPurgeWalker;
lru_walk = (LruPurgeData *)xcalloc(1, sizeof(*lru_walk));
walker->_policy = policy;
walker->_data = lru_walk;
if (lru_node) {
StoreEntry *entry = (StoreEntry *) lru_node->node.data;
- if (storeEntryLocked(entry)) {
+ if (entry->locked()) {
lru_node = (LruNode *) lru_node->node.next;
goto again;
}
/* Ok, time to destroy this policy */
safe_free(lru);
memset(policy, 0, sizeof(*policy));
- cbdataFree(policy);
+ delete policy;
}
RemovalPolicy *
LruPolicyData *lru_data;
/* no arguments expected or understood */
assert(!args);
- /* Initialize */
-
- if (!lru_node_pool) {
- /* Must be chunked */
- lru_node_pool = new MemPool("LRU policy node", sizeof(LruNode));
- lru_node_pool->setChunkSize(512 * 1024);
- }
/* Allocate the needed structures */
lru_data = (LruPolicyData *)xcalloc(1, sizeof(*lru_data));
- policy = cbdataAlloc(RemovalPolicy);
+ policy = new RemovalPolicy;
/* Initialize the URL data */
lru_data->policy = policy;
return policy;
}
+
projects / thirdparty / squid.git / blobdiff