static void
heap_add(RemovalPolicy * policy, StoreEntry * entry, RemovalPolicyNode * node)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
assert(!node->data);
if (EBIT_TEST(entry->flags, ENTRY_SPECIAL))
return; /* We won't manage these.. they messes things up */
- node->data = heap_insert(heap->theHeap, entry);
+ node->data = heap_insert(h->theHeap, entry);
- heap->count += 1;
+ h->count += 1;
- if (!heap->type)
- heap->type = heap_guessType(entry, node);
+ if (!h->type)
+ h->type = heap_guessType(entry, node);
/* Add a little more variance to the aging factor */
- heap->theHeap->age += heap->theHeap->age / 100000000;
+ h->theHeap->age += h->theHeap->age / 100000000;
}
static void
heap_remove(RemovalPolicy * policy, StoreEntry * entry,
RemovalPolicyNode * node)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
heap_node *hnode = (heap_node *)node->data;
if (!hnode)
return;
- heap_delete(heap->theHeap, hnode);
+ heap_delete(h->theHeap, hnode);
node->data = NULL;
- heap->count -= 1;
+ h->count -= 1;
}
static void
heap_referenced(RemovalPolicy * policy, const StoreEntry * entry,
RemovalPolicyNode * node)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
heap_node *hnode = (heap_node *)node->data;
if (!hnode)
return;
- heap_update(heap->theHeap, hnode, (StoreEntry *) entry);
+ heap_update(h->theHeap, hnode, (StoreEntry *) entry);
}
/** RemovalPolicyWalker **/
{
HeapWalkData *heap_walk = (HeapWalkData *)walker->_data;
RemovalPolicy *policy = walker->_policy;
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
StoreEntry *entry;
- if (heap_walk->current >= heap_nodes(heap->theHeap))
+ if (heap_walk->current >= heap_nodes(h->theHeap))
return NULL; /* done */
- entry = (StoreEntry *) heap_peep(heap->theHeap, heap_walk->current++);
+ entry = (StoreEntry *) heap_peep(h->theHeap, heap_walk->current++);
return entry;
}
heap_walkDone(RemovalPolicyWalker * walker)
{
RemovalPolicy *policy = walker->_policy;
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
assert(strcmp(policy->_type, "heap") == 0);
- assert(heap->nwalkers > 0);
- heap->nwalkers -= 1;
+ assert(h->nwalkers > 0);
+ h->nwalkers -= 1;
safe_free(walker->_data);
delete walker;
}
static RemovalPolicyWalker *
heap_walkInit(RemovalPolicy * policy)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
RemovalPolicyWalker *walker;
HeapWalkData *heap_walk;
- heap->nwalkers += 1;
+ h->nwalkers += 1;
walker = new RemovalPolicyWalker;
heap_walk = (HeapWalkData *)xcalloc(1, sizeof(*heap_walk));
heap_walk->current = 0;
{
HeapPurgeData *heap_walker = (HeapPurgeData *)walker->_data;
RemovalPolicy *policy = walker->_policy;
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
StoreEntry *entry;
heap_key age;
try_again:
- if (!heap_nodes(heap->theHeap) > 0)
+ if (!heap_nodes(h->theHeap) > 0)
return NULL; /* done */
- age = heap_peepminkey(heap->theHeap);
+ age = heap_peepminkey(h->theHeap);
- entry = (StoreEntry *)heap_extractmin(heap->theHeap);
+ entry = (StoreEntry *)heap_extractmin(h->theHeap);
if (entry->locked()) {
}
heap_walker->min_age = age;
- heap->setPolicyNode(entry, NULL);
+ h->setPolicyNode(entry, NULL);
return entry;
}
{
HeapPurgeData *heap_walker = (HeapPurgeData *)walker->_data;
RemovalPolicy *policy = walker->_policy;
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
StoreEntry *entry;
assert(strcmp(policy->_type, "heap") == 0);
- assert(heap->nwalkers > 0);
- heap->nwalkers -= 1;
+ assert(h->nwalkers > 0);
+ h->nwalkers -= 1;
if (heap_walker->min_age > 0) {
- heap->theHeap->age = heap_walker->min_age;
- debugs(81, 3, "heap_purgeDone: Heap age set to " << heap->theHeap->age );
+ h->theHeap->age = heap_walker->min_age;
+ debugs(81, 3, "Heap age set to " << h->theHeap->age);
}
/*
* Reinsert the locked entries
*/
while ((entry = (StoreEntry *)linklistShift(&heap_walker->locked_entries))) {
- heap_node *node = heap_insert(heap->theHeap, entry);
- heap->setPolicyNode(entry, node);
+ heap_node *node = heap_insert(h->theHeap, entry);
+ h->setPolicyNode(entry, node);
entry->unlock();
}
static RemovalPurgeWalker *
heap_purgeInit(RemovalPolicy * policy, int max_scan)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
RemovalPurgeWalker *walker;
HeapPurgeData *heap_walk;
- heap->nwalkers += 1;
+ h->nwalkers += 1;
walker = new RemovalPurgeWalker;
heap_walk = (HeapPurgeData *)xcalloc(1, sizeof(*heap_walk));
heap_walk->min_age = 0.0;
static void
heap_free(RemovalPolicy * policy)
{
- HeapPolicyData *heap = (HeapPolicyData *)policy->_data;
+ HeapPolicyData *h = (HeapPolicyData *)policy->_data;
/* Make some verification of the policy state */
assert(strcmp(policy->_type, "heap") == 0);
- assert(heap->nwalkers);
- assert(heap->count);
+ assert(h->nwalkers);
+ assert(h->count);
/* Ok, time to destroy this policy */
- safe_free(heap);
+ safe_free(h);
memset(policy, 0, sizeof(*policy));
delete policy;
}