rename hashset to hashmap

add module arguments parse in modargs.c
make module-pipe-sink use it


git-svn-id: file:///home/lennart/svn/public/pulseaudio/trunk@61 fefdeb5f-60dc-0310-8127-8f9354f1896f

1 files changed, 145 insertions, 0 deletions

diff --git a/src/hashmap.c b/src/hashmap.c
new file mode 100644
index 00000000..0c963f12
--- /dev/null
+++ b/src/hashmap.c
@@ -0,0 +1,145 @@
+#include <stdlib.h>
+#include <assert.h>
+#include <string.h>
+
+#include "hashmap.h"
+#include "idxset.h"
+
+struct hashmap_entry {
+    struct hashmap_entry *next, *previous, *bucket_next, *bucket_previous;
+    unsigned hash;
+    const void *key;
+    void *value;
+};
+
+struct pa_hashmap {
+    unsigned size;
+    struct hashmap_entry **data;
+    struct hashmap_entry *first_entry;
+    
+    unsigned n_entries;
+    unsigned (*hash_func) (const void *p);
+    int (*compare_func) (const void*a, const void*b);
+};
+
+struct pa_hashmap *pa_hashmap_new(unsigned (*hash_func) (const void *p), int (*compare_func) (const void*a, const void*b)) {
+    struct pa_hashmap *h;
+    h = malloc(sizeof(struct pa_hashmap));
+    assert(h);
+    h->data = malloc(sizeof(struct hashmap_entry*)*(h->size = 1023));
+    assert(h->data);
+    memset(h->data, 0, sizeof(struct hashmap_entry*)*(h->size = 1023));
+    h->first_entry = NULL;
+    h->n_entries = 0;
+    h->hash_func = hash_func ? hash_func : pa_idxset_trivial_hash_func;
+    h->compare_func = compare_func ? compare_func : pa_idxset_trivial_compare_func;
+    return h;
+}
+
+static void remove(struct pa_hashmap *h, struct hashmap_entry *e) {
+    assert(e);
+
+    if (e->next)
+        e->next->previous = e->previous;
+    if (e->previous)
+        e->previous->next = e->next;
+    else
+        h->first_entry = e->next;
+
+    if (e->bucket_next)
+        e->bucket_next->bucket_previous = e->bucket_previous;
+    if (e->bucket_previous)
+        e->bucket_previous->bucket_next = e->bucket_next;
+    else
+        h->data[e->hash] = e->bucket_next;
+
+    free(e);
+    h->n_entries--;
+}
+
+void pa_hashmap_free(struct pa_hashmap*h, void (*free_func)(void *p, void *userdata), void *userdata) {
+    assert(h);
+
+    while (h->first_entry) {
+        if (free_func)
+            free_func(h->first_entry->value, userdata);
+        remove(h, h->first_entry);
+    }
+    
+    free(h->data);
+    free(h);
+}
+
+static struct hashmap_entry *get(struct pa_hashmap *h, unsigned hash, const void *key) {
+    struct hashmap_entry *e;
+
+    for (e = h->data[hash]; e; e = e->bucket_next)
+        if (h->compare_func(e->key, key) == 0)
+            return e;
+
+    return NULL;
+}
+
+int pa_hashmap_put(struct pa_hashmap *h, const void *key, void *value) {
+    struct hashmap_entry *e;
+    unsigned hash;
+    assert(h && key);
+
+    hash = h->hash_func(key) % h->size;
+
+    if ((e = get(h, hash, key)))
+        return -1;
+    
+    e = malloc(sizeof(struct hashmap_entry));
+    assert(e);
+    
+    e->hash = hash;
+    e->key = key;
+    e->value = value;
+    
+    e->previous = NULL;
+    e->next = h->first_entry;
+    if (h->first_entry)
+        h->first_entry->previous = e;
+    h->first_entry = e;
+    
+    e->bucket_previous = NULL;
+    e->bucket_next = h->data[hash];
+    if (h->data[hash])
+        h->data[hash]->bucket_previous = e;
+    h->data[hash] = e;
+    
+    h->n_entries ++;
+    return 0;
+}
+
+void* pa_hashmap_get(struct pa_hashmap *h, const void *key) {
+    unsigned hash;
+    struct hashmap_entry *e;
+    assert(h && key);
+
+    hash = h->hash_func(key) % h->size;
+
+    if (!(e = get(h, hash, key)))
+        return NULL;
+
+    return e->value;
+}
+
+int pa_hashmap_remove(struct pa_hashmap *h, const void *key) {
+    struct hashmap_entry *e;
+    unsigned hash;
+    assert(h && key);
+
+    hash = h->hash_func(key) % h->size;
+
+    if (!(e = get(h, hash, key)))
+        return 1;
+
+    remove(h, e);
+    return 0;
+}
+
+unsigned pa_hashmap_ncontents(struct pa_hashmap *h) {
+    return h->n_entries;
+}