2 * Copyright © 2008 Kristian Høgsberg
4 * Permission to use, copy, modify, distribute, and sell this software and its
5 * documentation for any purpose is hereby granted without fee, provided that
6 * the above copyright notice appear in all copies and that both that copyright
7 * notice and this permission notice appear in supporting documentation, and
8 * that the name of the copyright holders not be used in advertising or
9 * publicity pertaining to distribution of the software without specific,
10 * written prior permission. The copyright holders make no representations
11 * about the suitability of this software for any purpose. It is provided "as
12 * is" without express or implied warranty.
14 * THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
15 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
16 * EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
17 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
18 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
19 * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
26 #include "wayland-util.h"
29 wl_list_init(struct wl_list *list)
36 wl_list_insert(struct wl_list *list, struct wl_list *elm)
39 elm->next = list->next;
41 elm->next->prev = elm;
45 wl_list_remove(struct wl_list *elm)
47 elm->prev->next = elm->next;
48 elm->next->prev = elm->prev;
52 wl_list_length(struct wl_list *list)
68 wl_list_empty(struct wl_list *list)
70 return list->next == list;
74 wl_list_insert_list(struct wl_list *list, struct wl_list *other)
76 other->next->prev = list;
77 other->prev->next = list->next;
78 list->next->prev = other->prev;
79 list->next = other->next;
83 wl_array_init(struct wl_array *array)
85 memset(array, 0, sizeof *array);
89 wl_array_release(struct wl_array *array)
95 wl_array_add(struct wl_array *array, int size)
100 if (array->alloc > 0)
101 alloc = array->alloc;
105 while (alloc < array->size + size)
108 if (array->alloc < alloc) {
109 if (array->alloc > 0)
110 data = realloc(array->data, alloc);
112 data = malloc(alloc);
117 array->alloc = alloc;
120 p = array->data + array->size;
127 wl_array_copy(struct wl_array *array, struct wl_array *source)
130 wl_array_add(array, source->size);
131 memcpy(array->data, source->data, source->size);
140 wl_map_init(struct wl_map *map)
142 memset(map, 0, sizeof *map);
146 wl_map_release(struct wl_map *map)
148 wl_array_release(&map->entries);
152 wl_map_insert_new(struct wl_map *map, void *data)
154 union map_entry *start, *entry;
156 if (map->free_list) {
157 start = map->entries.data;
158 entry = &start[map->free_list >> 1];
159 map->free_list = entry->next;
161 entry = wl_array_add(&map->entries, sizeof *entry);
162 start = map->entries.data;
167 return entry - start;
171 wl_map_insert_at(struct wl_map *map, uint32_t i, void *data)
173 union map_entry *start;
176 /* assert(map->free_list == NULL */
177 count = map->entries.size / sizeof *start;
183 wl_array_add(&map->entries, sizeof *start);
185 start = map->entries.data;
186 start[i].data = data;
192 wl_map_remove(struct wl_map *map, uint32_t i)
194 union map_entry *start;
197 start = map->entries.data;
198 count = map->entries.size / sizeof *start;
200 start[i].next = map->free_list;
201 map->free_list = (i << 1) | 1;
205 wl_map_lookup(struct wl_map *map, uint32_t i)
207 union map_entry *start;
210 start = map->entries.data;
211 count = map->entries.size / sizeof *start;
213 if (i < count && !(start[i].next & 1))
214 return start[i].data;
220 wl_map_for_each(struct wl_map *map, wl_iterator_func_t func, void *data)
222 union map_entry *start, *end, *p;
224 start = map->entries.data;
225 end = (union map_entry *) ((char *) map->entries.data + map->entries.size);
227 for (p = start; p < end; p++)
228 if (p->data && !(p->next & 1))