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
23 #ifndef WAYLAND_UTIL_H
24 #define WAYLAND_UTIL_H
33 #if defined(__GNUC__) && __GNUC__ >= 4
34 #define WL_EXPORT __attribute__ ((visibility("default")))
39 #define ARRAY_LENGTH(a) (sizeof (a) / sizeof (a)[0])
40 #define ALIGN(n, a) ( ((n) + ((a) - 1)) & ~((a) - 1) )
41 #define DIV_ROUNDUP(n, a) ( ((n) + ((a) - 1)) / (a) )
43 #define container_of(ptr, type, member) ({ \
44 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
45 (type *)( (char *)__mptr - offsetof(type,member) );})
54 const char *signature;
62 const struct wl_message *methods;
64 const struct wl_message *events;
68 const struct wl_interface *interface;
69 void (**implementation)(void);
74 struct wl_hash_table *wl_hash_table_create(void);
75 void wl_hash_table_destroy(struct wl_hash_table *ht);
76 void *wl_hash_table_lookup(struct wl_hash_table *ht, uint32_t hash);
77 int wl_hash_table_insert(struct wl_hash_table *ht, uint32_t hash, void *data);
78 void wl_hash_table_remove(struct wl_hash_table *ht, uint32_t hash);
86 void wl_list_init(struct wl_list *list);
87 void wl_list_insert(struct wl_list *list, struct wl_list *elm);
88 void wl_list_remove(struct wl_list *elm);
89 int wl_list_length(struct wl_list *list);
90 int wl_list_empty(struct wl_list *list);
92 #define __container_of(ptr, sample, member) \
93 (void *)((char *)(ptr) - \
94 ((char *)&(sample)->member - (char *)(sample)))
96 #define wl_list_for_each(pos, head, member) \
97 for (pos = __container_of((head)->next, pos, member); \
98 &pos->member != (head); \
99 pos = __container_of(pos->member.next, pos, member))
101 #define wl_list_for_each_safe(pos, tmp, head, member) \
102 for (pos = __container_of((head)->next, pos, member), \
103 tmp = __container_of((pos)->member.next, tmp, member); \
104 &pos->member != (head); \
106 tmp = __container_of(pos->member.next, tmp, member))
108 #define wl_list_for_each_reverse(pos, head, member) \
109 for (pos = __container_of((head)->prev, pos, member); \
110 &pos->member != (head); \
111 pos = __container_of(pos->member.prev, pos, member))
119 void wl_array_init(struct wl_array *array);
120 void wl_array_release(struct wl_array *array);
121 void *wl_array_add(struct wl_array *array, int size);