mirrors/wayland
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/wayland/wayland.git synced 2025-11-01 22:58:40 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Import Eric Anholts hash table implementation

Browse source 
Adapted from git://people.freedesktop.org/~anholt/hash_table.
This commit is contained in:
Kristian Høgsberg 2010-02-26 11:42:59 -05:00
parent a5db589efa
commit f52e03ff47
8 changed files with 326 additions and 98 deletions
Download patch file Download diff file Expand all files Collapse all files

76
wayland-util.c
View file

@ -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)
{