* the top of the heap (as in the smallest object key value). Child nodes
* are larger than their parent.
****************************************************************************/
-#ifndef SQUID_HEAP_H
-#define SQUID_HEAP_H
+#ifndef SQUID_HEAP_H
+#define SQUID_HEAP_H
/*
* Function for generating heap keys. The first argument will typically be
heap_mutex_t lock;
unsigned long size;
unsigned long last;
- heap_key_func *gen_key; /* key generator for heap */
- heap_key age; /* aging factor for heap */
+ heap_key_func *gen_key; /* key generator for heap */
+ heap_key age; /* aging factor for heap */
heap_node **nodes;
} heap;
/*
* Generate a heap key for a given data object. Alternative macro form:
*/
-#ifdef MACRO_DEBUG
+#ifdef MACRO_DEBUG
SQUIDCEXTERN heap_key heap_gen_key(heap * hp, heap_t dat);
#else
-#define heap_gen_key(hp,md) ((hp)->gen_key((md),(hp)->age))
+#define heap_gen_key(hp,md) ((hp)->gen_key((md),(hp)->age))
#endif /* MACRO_DEBUG */
/*
/*
* Is the heap empty? How many nodes (data objects) are in it?
*/
-#ifdef MACRO_DEBUG
+#ifdef MACRO_DEBUG
SQUIDCEXTERN int heap_empty(heap *);
SQUIDCEXTERN int heap_nodes(heap *);
#else /* MACRO_DEBUG */
-#define heap_nodes(heap) ((heap)->last)
-#define heap_empty(heap) ((heap)->last <= 0 ? 1 : 0)
+#define heap_nodes(heap) ((heap)->last)
+#define heap_empty(heap) ((heap)->last <= 0 ? 1 : 0)
#endif /* MACRO_DEBUG */
/*
SQUIDCEXTERN int verify_heap_property(heap *);
#endif /* SQUID_HEAP_H */
+