#include <string.h>
#include "idxset.h"
+#include "xmalloc.h"
struct idxset_entry {
void *data;
struct pa_idxset* pa_idxset_new(unsigned (*hash_func) (const void *p), int (*compare_func) (const void*a, const void*b)) {
struct pa_idxset *s;
- s = malloc(sizeof(struct pa_idxset));
- assert(s);
+ s = pa_xmalloc(sizeof(struct pa_idxset));
s->hash_func = hash_func ? hash_func : pa_idxset_trivial_hash_func;
s->compare_func = compare_func ? compare_func : pa_idxset_trivial_compare_func;
s->hash_table_size = 1023;
- s->hash_table = malloc(sizeof(struct idxset_entry*)*s->hash_table_size);
- assert(s->hash_table);
- memset(s->hash_table, 0, sizeof(struct idxset_entry*)*s->hash_table_size);
+ s->hash_table = pa_xmalloc0(sizeof(struct idxset_entry*)*s->hash_table_size);
s->array = NULL;
s->array_size = 0;
s->index = 0;
if (free_func)
free_func(e->data, userdata);
- free(e);
+ pa_xfree(e);
}
- free(s->hash_table);
- free(s->array);
- free(s);
+ pa_xfree(s->hash_table);
+ pa_xfree(s->array);
+ pa_xfree(s);
}
static struct idxset_entry* hash_scan(struct pa_idxset *s, struct idxset_entry* e, void *p) {
break;
l = index - s->start_index - i + 100;
- n = malloc(sizeof(struct hash_table_entry*)*l);
- assert(n);
- memset(n, 0, sizeof(struct hash_table_entry*)*l);
+ n = pa_xmalloc0(sizeof(struct hash_table_entry*)*l);
for (j = 0; j < s->array_size-i; j++)
n[j] = s->array[i+j];
- free(s->array);
+ pa_xfree(s->array);
s->array = n;
s->array_size = l;
return -1;
}
- e = malloc(sizeof(struct idxset_entry));
- assert(e);
-
+ e = pa_xmalloc(sizeof(struct idxset_entry));
e->data = p;
e->index = s->index++;
e->hash_value = h;
else
s->hash_table[e->hash_value] = e->hash_next;
- free(e);
+ pa_xfree(e);
assert(s->n_entries >= 1);
s->n_entries--;