#include "patricia.h"
+//#define LEAK_DETECTION
+
+#ifdef LEAK_DETECTION
+#define MAGIC 0x6a3b4ef3
+
+struct fake_node {
+ patricia_node_t node;
+ uint32_t magic;
+ patricia_node_t *real_node;
+};
+#endif
+
/* prefix_tochar
* convert prefix information to bytes
*/
prefix->ref_count--;
if (prefix->ref_count <= 0) {
- freeprefix(prefix);
- return;
+ freeprefix(prefix);
+ return;
}
}
}
}
+#ifdef LEAK_DETECTION
+static patricia_node_t *getrealnode(patricia_node_t *node) {
+ struct fake_node *f = (struct fake_node *)node;
+ if(f->magic != MAGIC) {
+ printf("magic failure\n");
+ abort();
+ }
+ return f->real_node;
+}
+#endif
patricia_node_t *
refnode(patricia_tree_t *tree, struct irc_in_addr *sin, int bitlen) {
patricia_ref_prefix(node->prefix);
}
+#ifdef LEAK_DETECTION
+ struct fake_node *f = malloc(sizeof(struct fake_node));
+ f->magic = MAGIC;
+ f->node = *node;
+ f->real_node = node;
+ node = (patricia_node_t *)f;
+#endif
+
return node;
}
if (!node || !node->prefix)
return;
+#ifdef LEAK_DETECTION
+ patricia_node_t *real_node = getrealnode(node);
+ free(node);
+ node = real_node;
+
+ if (!node || !node->prefix)
+ return;
+#endif
+
if (node->prefix->ref_count == 1) {
patricia_remove(tree, node);
} else
}
void node_increment_usercount( patricia_node_t *node) {
+#ifdef LEAK_DETECTION
+ node = getrealnode(node);
+#endif
+
while(node) {
node->usercount++;
node=node->parent;
}
void node_decrement_usercount( patricia_node_t *node) {
+#ifdef LEAK_DETECTION
+ node = getrealnode(node);
+#endif
+
while(node) {
node->usercount--;
node=node->parent;
}
}
+
+int is_normalized_ipmask( struct irc_in_addr *sin, unsigned char bitlen ) {
+ u_char *addr = (u_char *)sin;
+
+ while (bitlen < PATRICIA_MAXBITS) {
+ if (is_bit_set(addr,bitlen))
+ return 0;
+ bitlen++;
+ }
+ return 1;
+}