no need for linking contexts

now that we just use the talloc hierarchy

diff --git a/src/lib/util/hash.c b/src/lib/util/hash.c
index 328b01f84be4846b9e6948edccebf256d602c403..ec2009f5d64cd1cb3e679f76d7ba63eefa244e59 100644 (file)
--- a/src/lib/util/hash.c
+++ b/src/lib/util/hash.c
@@ -255,24 +255,7 @@ static int list_delete(fr_hash_table_t *ht,
 
 static int _fr_hash_table_free(fr_hash_table_t *ht)
 {
-       int i;
-       fr_hash_entry_t *node, *next;
-
-       /*
-        *      Walk over the buckets, freeing them all.
-        */
-       for (i = 0; i < ht->num_buckets; i++) {
-               if (ht->buckets[i]) for (node = ht->buckets[i];
-                                        node != &ht->null;
-                                        node = next) {
-                       next = node->next;
-                       if (!node->data) continue; /* dummy entry */
-
-                       talloc_free(node);
-               }
-       }
-       talloc_free(ht->buckets);
-
+       talloc_free_children(ht);
        return 0;
 }
 
@@ -290,10 +273,9 @@ fr_hash_table_t *fr_hash_table_create(TALLOC_CTX *ctx,
 
        if (!hash_func) return NULL;
 
-       ht = talloc_zero(NULL, fr_hash_table_t);
+       ht = talloc_zero(ctx, fr_hash_table_t);
        if (!ht) return NULL;
        talloc_set_destructor(ht, _fr_hash_table_free);
-       talloc_link_ctx(ctx, ht);
 
        ht->free = free_func;
        ht->hash = hash_func;