1 #ifndef __NETIFD_UTILS_H
2 #define __NETIFD_UTILS_H
4 #include <libubox/list.h>
5 #include <libubox/avl.h>
7 #define __init __attribute__((constructor))
12 typedef void (*vlist_update_cb
)(struct vlist_tree
*tree
,
13 struct vlist_node
*node_new
,
14 struct vlist_node
*node_old
);
19 vlist_update_cb update
;
32 void __vlist_init(struct vlist_tree
*tree
, avl_tree_comp cmp
, vlist_update_cb update
, int offset
);
34 #define vlist_init(tree, cmp, update, type, node, key) \
35 __vlist_init(tree, cmp, update, offsetof(type, key) - offsetof(type, node))
37 static inline void vlist_update(struct vlist_tree
*tree
)
42 void vlist_add(struct vlist_tree
*tree
, struct vlist_node
*node
);
43 void vlist_delete(struct vlist_tree
*tree
, struct vlist_node
*node
);
44 void vlist_flush(struct vlist_tree
*tree
);
45 void vlist_flush_all(struct vlist_tree
*tree
);
47 #define vlist_for_each_element(tree, element, node_member) \
48 avl_for_each_element(&(tree)->avl, element, node_member.avl)
51 static inline int fls(int x
)
57 if (!(x
& 0xffff0000u
)) {
61 if (!(x
& 0xff000000u
)) {
65 if (!(x
& 0xf0000000u
)) {
69 if (!(x
& 0xc0000000u
)) {
73 if (!(x
& 0x80000000u
)) {
81 int avl_strcmp(const void *k1
, const void *k2
, void *ptr
);