2 * Copyright © 2008-2011 Kristian Høgsberg
3 * Copyright © 2011 Intel Corporation
5 * Permission to use, copy, modify, distribute, and sell this software and its
6 * documentation for any purpose is hereby granted without fee, provided that
7 * the above copyright notice appear in all copies and that both that copyright
8 * notice and this permission notice appear in supporting documentation, and
9 * that the name of the copyright holders not be used in advertising or
10 * publicity pertaining to distribution of the software without specific,
11 * written prior permission. The copyright holders make no representations
12 * about the suitability of this software for any purpose. It is provided "as
13 * is" without express or implied warranty.
15 * THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
16 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
17 * EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
18 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
19 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
20 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
27 #include "wayland-util.h"
30 wl_list_init(struct wl_list *list)
37 wl_list_insert(struct wl_list *list, struct wl_list *elm)
40 elm->next = list->next;
42 elm->next->prev = elm;
46 wl_list_remove(struct wl_list *elm)
48 elm->prev->next = elm->next;
49 elm->next->prev = elm->prev;
53 wl_list_length(struct wl_list *list)
69 wl_list_empty(struct wl_list *list)
71 return list->next == list;
75 wl_list_insert_list(struct wl_list *list, struct wl_list *other)
77 other->next->prev = list;
78 other->prev->next = list->next;
79 list->next->prev = other->prev;
80 list->next = other->next;
84 wl_array_init(struct wl_array *array)
86 memset(array, 0, sizeof *array);
90 wl_array_release(struct wl_array *array)
96 wl_array_add(struct wl_array *array, int size)
101 if (array->alloc > 0)
102 alloc = array->alloc;
106 while (alloc < array->size + size)
109 if (array->alloc < alloc) {
110 if (array->alloc > 0)
111 data = realloc(array->data, alloc);
113 data = malloc(alloc);
118 array->alloc = alloc;
121 p = array->data + array->size;
128 wl_array_copy(struct wl_array *array, struct wl_array *source)
131 wl_array_add(array, source->size);
132 memcpy(array->data, source->data, source->size);
141 wl_map_init(struct wl_map *map)
143 memset(map, 0, sizeof *map);
147 wl_map_release(struct wl_map *map)
149 wl_array_release(&map->entries);
153 wl_map_insert_new(struct wl_map *map, void *data)
155 union map_entry *start, *entry;
157 if (map->free_list) {
158 start = map->entries.data;
159 entry = &start[map->free_list >> 1];
160 map->free_list = entry->next;
162 entry = wl_array_add(&map->entries, sizeof *entry);
163 start = map->entries.data;
168 return entry - start;
172 wl_map_insert_at(struct wl_map *map, uint32_t i, void *data)
174 union map_entry *start;
177 /* assert(map->free_list == NULL */
178 count = map->entries.size / sizeof *start;
184 wl_array_add(&map->entries, sizeof *start);
186 start = map->entries.data;
187 start[i].data = data;
193 wl_map_remove(struct wl_map *map, uint32_t i)
195 union map_entry *start;
197 start = map->entries.data;
198 start[i].next = map->free_list;
199 map->free_list = (i << 1) | 1;
203 wl_map_lookup(struct wl_map *map, uint32_t i)
205 union map_entry *start;
208 start = map->entries.data;
209 count = map->entries.size / sizeof *start;
211 if (i < count && !(start[i].next & 1))
212 return start[i].data;
218 wl_map_for_each(struct wl_map *map, wl_iterator_func_t func, void *data)
220 union map_entry *start, *end, *p;
222 start = map->entries.data;
223 end = (union map_entry *) ((char *) map->entries.data + map->entries.size);
225 for (p = start; p < end; p++)
226 if (p->data && !(p->next & 1))