blob: 401ea1b8c2f20f68fb448a3297015cf75a99917b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
#ifndef _LIBDECT_UTILS_H
#define _LIBDECT_UTILS_H
#include <assert.h>
#include <stddef.h>
#include <stdint.h>
#ifndef AF_DECT
#define AF_DECT 38
#endif
#ifndef SOL_DECT
#define SOL_DECT 279
#endif
#ifndef NETLINK_DECT
#define NETLINK_DECT 20
#endif
#define __init __attribute__((constructor))
#define __exit __attribute__((destructor))
#define __must_check __attribute__((warn_unused_result))
#define __maybe_unused __attribute__((unused))
#define __noreturn __attribute__((__noreturn__))
#define __aligned(x) __attribute__((aligned(x)))
#define __packed __attribute__((packed))
#define __visible __attribute__((visibility("default")))
struct dect_handle;
extern void *dect_malloc(const struct dect_handle *dh, size_t size);
extern void *dect_zalloc(const struct dect_handle *dh, size_t size);
extern void dect_free(const struct dect_handle *dh, void *ptr);
#define EXPORT_SYMBOL(x) typeof(x) (x) __visible
#define BUG() assert(0)
/* Force a compilation error if condition is true */
#define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)]))
#define BUILD_BUG_ON_ZERO(e) (sizeof(char[1 - 2 * !!(e)]) - 1)
#define __must_be_array(a) \
BUILD_BUG_ON_ZERO(__builtin_types_compatible_p(typeof(a), typeof(&a[0])))
#define array_size(arr) (sizeof(arr) / sizeof((arr)[0]) + __must_be_array(arr))
#define field_sizeof(t, f) (sizeof(((t *)NULL)->f))
#define div_round_up(n, d) (((n) + (d) - 1) / (d))
#define min(x, y) ({ \
typeof(x) _min1 = (x); \
typeof(y) _min2 = (y); \
(void) (&_min1 == &_min2); \
_min1 < _min2 ? _min1 : _min2; })
#define max(x, y) ({ \
typeof(x) _max1 = (x); \
typeof(y) _max2 = (y); \
(void) (&_max1 == &_max2); \
_max1 > _max2 ? _max1 : _max2; })
static inline unsigned int fls(uint64_t v)
{
unsigned int len = 0;
while (v) {
v >>= 1;
len++;
}
return len;
}
#define ptrlist_init(head) \
do { \
*(head) = NULL; \
} while (0)
#define ptrlist_add_tail(new, head) \
do { \
typeof(new) *pprev; \
pprev = (head); \
while (*pprev != NULL) \
pprev = &(*pprev)->next; \
*pprev = new; \
} while (0)
#define ptrlist_dequeue_head(head) \
({ \
typeof(*head) elem = *(head); \
if (elem != NULL) \
*(head) = elem->next; \
elem; \
})
#endif /* _LIBDECT_UTILS_H */
|