util: clear pointers on wl_list_remove()

[profile/ivi/wayland.git] / src / wayland-util.c

diff --git a/src/wayland-util.c b/src/wayland-util.c
index 3643274..06bd245 100644 (file)
--- a/src/wayland-util.c
+++ b/src/wayland-util.c
@@ -1,5 +1,6 @@
 /*
- * Copyright © 2008 Kristian Høgsberg
+ * Copyright © 2008-2011 Kristian Høgsberg
+ * Copyright © 2011 Intel Corporation
  *
  * Permission to use, copy, modify, distribute, and sell this software and its
  * documentation for any purpose is hereby granted without fee, provided that
@@ -23,7 +24,9 @@
 #include <stdlib.h>
 #include <stdint.h>
 #include <string.h>
+
 #include "wayland-util.h"
+#include "wayland-private.h"
 
 WL_EXPORT void
 wl_list_init(struct wl_list *list)
@@ -46,6 +49,8 @@ wl_list_remove(struct wl_list *elm)
 {
        elm->prev->next = elm->next;
        elm->next->prev = elm->prev;
+       elm->next = NULL;
+       elm->prev = NULL;
 }
 
 WL_EXPORT int
@@ -71,6 +76,15 @@ wl_list_empty(struct wl_list *list)
 }
 
 WL_EXPORT void
+wl_list_insert_list(struct wl_list *list, struct wl_list *other)
+{
+       other->next->prev = list;
+       other->prev->next = list->next;
+       list->next->prev = other->prev;
+       list->next = other->next;
+}
+
+WL_EXPORT void
 wl_array_init(struct wl_array *array)
 {
        memset(array, 0, sizeof *array);
@@ -121,3 +135,138 @@ wl_array_copy(struct wl_array *array, struct wl_array *source)
        wl_array_add(array, source->size);
        memcpy(array->data, source->data, source->size);
 }
+
+union map_entry {
+       uintptr_t next;
+       void *data;
+};
+
+WL_EXPORT void
+wl_map_init(struct wl_map *map)
+{
+       memset(map, 0, sizeof *map);
+}
+
+WL_EXPORT void
+wl_map_release(struct wl_map *map)
+{
+       wl_array_release(&map->client_entries);
+       wl_array_release(&map->server_entries);
+}
+
+WL_EXPORT uint32_t
+wl_map_insert_new(struct wl_map *map, uint32_t side, void *data)
+{
+       union map_entry *start, *entry;
+       struct wl_array *entries;
+       uint32_t base;
+
+       if (side == WL_MAP_CLIENT_SIDE) {
+               entries = &map->client_entries;
+               base = 0;
+       } else {
+               entries = &map->server_entries;
+               base = WL_SERVER_ID_START;
+       }
+
+       if (map->free_list) {
+               start = entries->data;
+               entry = &start[map->free_list >> 1];
+               map->free_list = entry->next;
+       } else {
+               entry = wl_array_add(entries, sizeof *entry);
+               start = entries->data;
+       }
+
+       entry->data = data;
+
+       return (entry - start) + base;
+}
+
+WL_EXPORT int
+wl_map_insert_at(struct wl_map *map, uint32_t i, void *data)
+{
+       union map_entry *start;
+       uint32_t count;
+       struct wl_array *entries;
+
+       if (i < WL_SERVER_ID_START) {
+               entries = &map->client_entries;
+       } else {
+               entries = &map->server_entries;
+               i -= WL_SERVER_ID_START;
+       }
+
+       count = entries->size / sizeof *start;
+       if (count < i)
+               return -1;
+
+       if (count == i)
+               wl_array_add(entries, sizeof *start);
+
+       start = entries->data;
+       start[i].data = data;
+
+       return 0;
+}
+
+WL_EXPORT void
+wl_map_remove(struct wl_map *map, uint32_t i)
+{
+       union map_entry *start;
+       struct wl_array *entries;
+
+       if (i < WL_SERVER_ID_START) {
+               entries = &map->client_entries;
+       } else {
+               entries = &map->server_entries;
+               i -= WL_SERVER_ID_START;
+       }
+
+       start = entries->data;
+       start[i].next = map->free_list;
+       map->free_list = (i << 1) | 1;
+}
+
+WL_EXPORT void *
+wl_map_lookup(struct wl_map *map, uint32_t i)
+{
+       union map_entry *start;
+       uint32_t count;
+       struct wl_array *entries;
+
+       if (i < WL_SERVER_ID_START) {
+               entries = &map->client_entries;
+       } else {
+               entries = &map->server_entries;
+               i -= WL_SERVER_ID_START;
+       }
+
+       start = entries->data;
+       count = entries->size / sizeof *start;
+
+       if (i < count && !(start[i].next & 1))
+               return start[i].data;
+
+       return NULL;
+}
+
+static void
+for_each_helper(struct wl_array *entries, wl_iterator_func_t func, void *data)
+{
+       union map_entry *start, *end, *p;
+
+       start = entries->data;
+       end = (union map_entry *) ((char *) entries->data + entries->size);
+
+       for (p = start; p < end; p++)
+               if (p->data && !(p->next & 1))
+                       func(p->data, data);
+}
+
+WL_EXPORT void
+wl_map_for_each(struct wl_map *map, wl_iterator_func_t func, void *data)
+{
+       for_each_helper(&map->client_entries, func, data);
+       for_each_helper(&map->server_entries, func, data);
+}