2 * netifd - network interface daemon
3 * Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2
7 * as published by the Free Software Foundation
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 #ifndef __NETIFD_UTILS_H
15 #define __NETIFD_UTILS_H
17 #include <libubox/list.h>
18 #include <libubox/avl.h>
19 #include <libubox/avl-cmp.h>
20 #include <libubox/blobmsg.h>
23 #define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)]))
25 extern int __build_bug_on_failed
;
26 #define BUILD_BUG_ON(condition) \
28 ((void)sizeof(char[1 - 2*!!(condition)])); \
29 if (condition) __build_bug_on_failed = 1; \
33 static inline bool blobmsg_get_bool_default(struct blob_attr
*attr
, bool val
)
38 return blobmsg_get_bool(attr
);
41 #define __init __attribute__((constructor))
46 typedef void (*vlist_update_cb
)(struct vlist_tree
*tree
,
47 struct vlist_node
*node_new
,
48 struct vlist_node
*node_old
);
53 vlist_update_cb update
;
65 void vlist_init(struct vlist_tree
*tree
, avl_tree_comp cmp
, vlist_update_cb update
);
67 #define vlist_find(tree, name, element, node_member) \
68 avl_find_element(&(tree)->avl, name, element, node_member.avl)
70 static inline void vlist_update(struct vlist_tree
*tree
)
75 void vlist_add(struct vlist_tree
*tree
, struct vlist_node
*node
, void *key
);
76 void vlist_delete(struct vlist_tree
*tree
, struct vlist_node
*node
);
77 void vlist_flush(struct vlist_tree
*tree
);
78 void vlist_flush_all(struct vlist_tree
*tree
);
80 #define vlist_for_each_element(tree, element, node_member) \
81 avl_for_each_element(&(tree)->avl, element, node_member.avl)
84 struct vlist_simple_tree
{
85 struct list_head list
;
90 struct vlist_simple_node
{
91 struct list_head list
;
95 #define vlist_simple_init(tree, node, member) \
96 __vlist_simple_init(tree, offsetof(node, member))
98 void __vlist_simple_init(struct vlist_simple_tree
*tree
, int offset
);
99 void vlist_simple_delete(struct vlist_simple_tree
*tree
, struct vlist_simple_node
*node
);
100 void vlist_simple_flush(struct vlist_simple_tree
*tree
);
101 void vlist_simple_flush_all(struct vlist_simple_tree
*tree
);
102 void vlist_simple_replace(struct vlist_simple_tree
*dest
, struct vlist_simple_tree
*old
);
104 static inline void vlist_simple_update(struct vlist_simple_tree
*tree
)
109 static inline void vlist_simple_add(struct vlist_simple_tree
*tree
, struct vlist_simple_node
*node
)
111 node
->version
= tree
->version
;
112 list_add(&node
->list
, &tree
->list
);
115 #define vlist_simple_for_each_element(tree, element, node_member) \
116 list_for_each_entry(element, &(tree)->list, node_member.list)
118 #define vlist_simple_empty(tree) \
119 list_empty(&(tree)->list)
123 static inline int fls(int x
)
129 if (!(x
& 0xffff0000u
)) {
133 if (!(x
& 0xff000000u
)) {
137 if (!(x
& 0xf0000000u
)) {
141 if (!(x
& 0xc0000000u
)) {
145 if (!(x
& 0x80000000u
)) {