#ifndef __NETIFD_UTILS_H
#define __NETIFD_UTILS_H
+#include <unistd.h>
+#include <stdio.h>
+#include <uci_blob.h>
#include <libubox/list.h>
#include <libubox/avl.h>
+#include <libubox/avl-cmp.h>
#include <libubox/blobmsg.h>
-
-#ifndef __OPTIMIZE__
-#define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)]))
-#else
-extern int __build_bug_on_failed;
-#define BUILD_BUG_ON(condition) \
- do { \
- ((void)sizeof(char[1 - 2*!!(condition)])); \
- if (condition) __build_bug_on_failed = 1; \
- } while(0)
-#endif
+#include <libubox/vlist.h>
+#include <libubox/utils.h>
static inline bool blobmsg_get_bool_default(struct blob_attr *attr, bool val)
{
#define __init __attribute__((constructor))
-struct vlist_tree;
-struct vlist_node;
-
-typedef void (*vlist_update_cb)(struct vlist_tree *tree,
- struct vlist_node *node_new,
- struct vlist_node *node_old);
-
-struct vlist_tree {
- struct avl_tree avl;
-
- vlist_update_cb update;
- bool keep_old;
- bool no_delete;
-
- int version;
-};
-
-struct vlist_node {
- struct avl_node avl;
- int version;
-};
-
-void vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update);
-
-#define vlist_find(tree, name, element, node_member) \
- avl_find_element(&(tree)->avl, name, element, node_member.avl)
-
-static inline void vlist_update(struct vlist_tree *tree)
-{
- tree->version++;
-}
-
-void vlist_add(struct vlist_tree *tree, struct vlist_node *node, void *key);
-void vlist_delete(struct vlist_tree *tree, struct vlist_node *node);
-void vlist_flush(struct vlist_tree *tree);
-void vlist_flush_all(struct vlist_tree *tree);
-
-#define vlist_for_each_element(tree, element, node_member) \
- avl_for_each_element(&(tree)->avl, element, node_member.avl)
-
-
struct vlist_simple_tree {
struct list_head list;
int head_offset;
int version;
};
+#define vlist_for_each_element_safe(tree, element, node_member, ptr) \
+ avl_for_each_element_safe(&(tree)->avl, element, node_member.avl, ptr)
+
#define vlist_simple_init(tree, node, member) \
__vlist_simple_init(tree, offsetof(node, member))
void vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node);
void vlist_simple_flush(struct vlist_simple_tree *tree);
void vlist_simple_flush_all(struct vlist_simple_tree *tree);
+void vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old);
static inline void vlist_simple_update(struct vlist_simple_tree *tree)
{
static inline void vlist_simple_add(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
{
node->version = tree->version;
- list_add(&node->list, &tree->list);
+ list_add_tail(&node->list, &tree->list);
}
#define vlist_simple_for_each_element(tree, element, node_member) \
x <<= 2;
r -= 2;
}
- if (!(x & 0x80000000u)) {
- x <<= 1;
+ if (!(x & 0x80000000u))
r -= 1;
- }
return r;
}
#endif
-int avl_strcmp(const void *k1, const void *k2, void *ptr);
+unsigned int parse_netmask_string(const char *str, bool v6);
+bool split_netmask(char *str, unsigned int *netmask, bool v6);
+int parse_ip_and_netmask(int af, const char *str, void *addr, unsigned int *netmask);
+bool check_pid_path(int pid, const char *exe);
+
+char * format_macaddr(uint8_t *mac);
+
+uint32_t crc32_file(FILE *fp);
+
+const char * uci_get_validate_string(const struct uci_blob_param_list *p, int i);
+
+#ifdef __APPLE__
+#define s6_addr32 __u6_addr.__u6_addr32
+#endif
#endif