X-Git-Url: http://git.tuebingen.mpg.de/?p=adu.git;a=blobdiff_plain;f=bloom.c;fp=bloom.c;h=2aff535e833f75ba178bfcbf0524e0bf19d0cca7;hp=9b66b903be5d189704d0fedbac0cb07c70bd5113;hb=4074e7034641cbbbfc861961d216d58a503d0aee;hpb=fa21c55adb75551452241369424a146c7acb71a4

diff --git a/bloom.c b/bloom.c
index 9b66b90..2aff535 100644
--- a/bloom.c
+++ b/bloom.c
@@ -12,6 +12,9 @@
 void *adu_calloc(size_t size)
 {
 	void *ret = malloc(size);
+
+	if (!ret)
+		exit(EXIT_FAILURE);
 	memset(ret, 0, size);
 	return ret;
 }
@@ -128,13 +131,15 @@ void bloom_free(struct bloom *b)
 }
 
 /**
- * Initialize a bloom filter.
+ * Allocate and initialize a new bloom filter.
  *
  * \param order Use a filter containing 2^order bits.
  * \param num_hash_functions Set that many bits in the filter per entry.
+ *
+ * \return This function either returns a freshly allocated and initialized
+ * bloom filter or does not return at all (if the underlying malloc() failed).
  */
-int bloom_init(unsigned order, unsigned num_hash_functions,
-		struct bloom **result)
+struct bloom *bloom_new(unsigned order, unsigned num_hash_functions)
 {
 	struct bloom *b = adu_calloc(sizeof(*b));
 
@@ -143,8 +148,7 @@ int bloom_init(unsigned order, unsigned num_hash_functions,
 	b->order = order;
 	b->num_hash_functions = num_hash_functions;
 	b->filter = adu_calloc(filter_bits(b) / 8);
-	*result = b;
-	return 1;
+	return b;
 }
 
 #ifdef TEST_BLOOM
@@ -184,7 +188,7 @@ int main(int argc, char **argv)
 		printf("k: # of hash functions to use\n");
 		exit(1);
 	}
-	bloom_init(atoi(argv[1]), atoi(argv[2]), &b);
+	b = bloom_new(atoi(argv[1]), atoi(argv[2]));
 	add_stdin(b);
 	INFO_LOG("%u%% of bits are set\n", (unsigned)
 		(b->num_set_bits * 100ULL / filter_bits(b)));