diff options
author | Kristian Høgsberg <krh@redhat.com> | 2008-11-23 23:41:08 -0500 |
---|---|---|
committer | Naruto Uzumaki <root@kabuto.bos.redhat.com> | 2008-11-24 00:06:16 -0500 |
commit | 1e4b86af1ae16b9eeb4f952f2735b65536bcdc7c (patch) | |
tree | 9a2a49e71efd7489a033f8d4013055aa9bec88b6 /wayland-util.c | |
parent | 14fcff77265bbdf9893925c993c10d52c178e566 (diff) | |
download | wayland-1e4b86af1ae16b9eeb4f952f2735b65536bcdc7c.tar.gz wayland-1e4b86af1ae16b9eeb4f952f2735b65536bcdc7c.tar.xz wayland-1e4b86af1ae16b9eeb4f952f2735b65536bcdc7c.zip |
Expose screenshooting as an interface, drop SIGUSR hack.
This pulls in a bit of extra infrastructure for discovering adertised objects on the
client side.
Diffstat (limited to 'wayland-util.c')
-rw-r--r-- | wayland-util.c | 83 |
1 files changed, 83 insertions, 0 deletions
diff --git a/wayland-util.c b/wayland-util.c new file mode 100644 index 0000000..e763453 --- /dev/null +++ b/wayland-util.c @@ -0,0 +1,83 @@ +#include <stdlib.h> +#include "wayland.h" + +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_delete(struct wl_hash *hash, struct wl_object *object) +{ + /* writeme */ +} + + +void wl_list_init(struct wl_list *list) +{ + list->prev = list; + list->next = list; +} + +void +wl_list_insert(struct wl_list *list, struct wl_list *elm) +{ + elm->prev = list; + elm->next = list->next; + list->next = elm; + elm->next->prev = elm; +} + +void +wl_list_remove(struct wl_list *elm) +{ + elm->prev->next = elm->next; + elm->next->prev = elm->prev; +} + +int +wl_list_length(struct wl_list *list) +{ + struct wl_list *e; + int count; + + e = list->next; + while (e != list) { + e = e->next; + count++; + } + + return count; +} |