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
28 #include "wayland-util.h"
29 #include "wayland-private.h"
32 wl_list_init(struct wl_list *list)
39 wl_list_insert(struct wl_list *list, struct wl_list *elm)
42 elm->next = list->next;
44 elm->next->prev = elm;
48 wl_list_remove(struct wl_list *elm)
50 elm->prev->next = elm->next;
51 elm->next->prev = elm->prev;
57 wl_list_length(struct wl_list *list)
73 wl_list_empty(struct wl_list *list)
75 return list->next == list;
79 wl_list_insert_list(struct wl_list *list, struct wl_list *other)
81 other->next->prev = list;
82 other->prev->next = list->next;
83 list->next->prev = other->prev;
84 list->next = other->next;
88 wl_array_init(struct wl_array *array)
90 memset(array, 0, sizeof *array);
94 wl_array_release(struct wl_array *array)
100 wl_array_add(struct wl_array *array, int size)
105 if (array->alloc > 0)
106 alloc = array->alloc;
110 while (alloc < array->size + size)
113 if (array->alloc < alloc) {
114 if (array->alloc > 0)
115 data = realloc(array->data, alloc);
117 data = malloc(alloc);
122 array->alloc = alloc;
125 p = array->data + array->size;
132 wl_array_copy(struct wl_array *array, struct wl_array *source)
135 wl_array_add(array, source->size);
136 memcpy(array->data, source->data, source->size);
145 wl_map_init(struct wl_map *map)
147 memset(map, 0, sizeof *map);
151 wl_map_release(struct wl_map *map)
153 wl_array_release(&map->client_entries);
154 wl_array_release(&map->server_entries);
158 wl_map_insert_new(struct wl_map *map, uint32_t side, void *data)
160 union map_entry *start, *entry;
161 struct wl_array *entries;
164 if (side == WL_MAP_CLIENT_SIDE) {
165 entries = &map->client_entries;
168 entries = &map->server_entries;
169 base = WL_SERVER_ID_START;
172 if (map->free_list) {
173 start = entries->data;
174 entry = &start[map->free_list >> 1];
175 map->free_list = entry->next;
177 entry = wl_array_add(entries, sizeof *entry);
178 start = entries->data;
183 return (entry - start) + base;
187 wl_map_insert_at(struct wl_map *map, uint32_t i, void *data)
189 union map_entry *start;
191 struct wl_array *entries;
193 if (i < WL_SERVER_ID_START) {
194 entries = &map->client_entries;
196 entries = &map->server_entries;
197 i -= WL_SERVER_ID_START;
200 count = entries->size / sizeof *start;
205 wl_array_add(entries, sizeof *start);
207 start = entries->data;
208 start[i].data = data;
214 wl_map_remove(struct wl_map *map, uint32_t i)
216 union map_entry *start;
217 struct wl_array *entries;
219 if (i < WL_SERVER_ID_START) {
220 entries = &map->client_entries;
222 entries = &map->server_entries;
223 i -= WL_SERVER_ID_START;
226 start = entries->data;
227 start[i].next = map->free_list;
228 map->free_list = (i << 1) | 1;
232 wl_map_lookup(struct wl_map *map, uint32_t i)
234 union map_entry *start;
236 struct wl_array *entries;
238 if (i < WL_SERVER_ID_START) {
239 entries = &map->client_entries;
241 entries = &map->server_entries;
242 i -= WL_SERVER_ID_START;
245 start = entries->data;
246 count = entries->size / sizeof *start;
248 if (i < count && !(start[i].next & 1))
249 return start[i].data;
255 for_each_helper(struct wl_array *entries, wl_iterator_func_t func, void *data)
257 union map_entry *start, *end, *p;
259 start = entries->data;
260 end = (union map_entry *) ((char *) entries->data + entries->size);
262 for (p = start; p < end; p++)
263 if (p->data && !(p->next & 1))
268 wl_map_for_each(struct wl_map *map, wl_iterator_func_t func, void *data)
270 for_each_helper(&map->client_entries, func, data);
271 for_each_helper(&map->server_entries, func, data);