diff options
author | Kristian Høgsberg <krh@bitplanet.net> | 2010-02-26 11:42:59 -0500 |
---|---|---|
committer | Kristian Høgsberg <krh@bitplanet.net> | 2010-02-26 11:42:59 -0500 |
commit | f52e03ff473a504a9a12a98b68b9b923de664fe2 (patch) | |
tree | 0fced1a3bd65ce47d1766fac1f928d34c3e8f0d4 /wayland-util.c | |
parent | a5db589efaedebf2b01a61baa2efc917a7e45d68 (diff) | |
download | wayland-f52e03ff473a504a9a12a98b68b9b923de664fe2.tar.gz wayland-f52e03ff473a504a9a12a98b68b9b923de664fe2.tar.xz wayland-f52e03ff473a504a9a12a98b68b9b923de664fe2.zip |
Import Eric Anholts hash table implementation
Adapted from git://people.freedesktop.org/~anholt/hash_table.
Diffstat (limited to 'wayland-util.c')
-rw-r--r-- | wayland-util.c | 76 |
1 files changed, 0 insertions, 76 deletions
diff --git a/wayland-util.c b/wayland-util.c index cd73542..a287cce 100644 --- a/wayland-util.c +++ b/wayland-util.c @@ -25,82 +25,6 @@ #include <string.h> #include "wayland-util.h" -struct wl_hash { - struct wl_object **objects; - uint32_t count, alloc; -}; - -struct wl_hash * -wl_hash_create(void) -{ - struct wl_hash *hash; - - hash = malloc(sizeof *hash); - if (hash == NULL) - return hash; - - memset(hash, 0, sizeof *hash); - - return hash; -} - -void -wl_hash_destroy(struct wl_hash *hash) -{ - free(hash); -} - -int wl_hash_insert(struct wl_hash *hash, struct wl_object *object) -{ - struct wl_object **objects; - uint32_t alloc; - - if (hash->count == hash->alloc) { - if (hash->alloc == 0) - alloc = 16; - else - alloc = hash->alloc * 2; - objects = realloc(hash->objects, alloc * sizeof *objects); - if (objects == NULL) - return -1; - - hash->objects = objects; - hash->alloc = alloc; - } - - hash->objects[hash->count] = object; - hash->count++; - - return 0; -} - -struct wl_object * -wl_hash_lookup(struct wl_hash *hash, uint32_t id) -{ - int i; - - for (i = 0; i < hash->count; i++) { - if (hash->objects[i]->id == id) - return hash->objects[i]; - } - - return NULL; -} - -void -wl_hash_remove(struct wl_hash *hash, struct wl_object *object) -{ - int i; - - for (i = 0; i < hash->count; i++) { - if (hash->objects[i]->id == object->id) { - hash->objects[i] = hash->objects[hash->count - 1]; - hash->count--; - break; - } - } -} - WL_EXPORT void wl_list_init(struct wl_list *list) { |