X-Git-Url: http://git.archive.openwrt.org/?p=project%2Fnetifd.git;a=blobdiff_plain;f=utils.h;h=ec2231331c9d1cdbe4828b95f238e1268ffb7ca4;hp=5ea9c6f092915138fbff666e4e09c17ea789a56a;hb=6094417533d97662f693d134ab04595a292de30c;hpb=655ef783b1d5f72af3acccc87455c365fea4ad42 diff --git a/utils.h b/utils.h index 5ea9c6f..ec22313 100644 --- a/utils.h +++ b/utils.h @@ -1,9 +1,24 @@ +/* + * netifd - network interface daemon + * Copyright (C) 2012 Felix Fietkau + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ #ifndef __NETIFD_UTILS_H #define __NETIFD_UTILS_H #include #include +#include #include +#include #ifndef __OPTIMIZE__ #define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)])) @@ -26,47 +41,6 @@ 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; @@ -85,6 +59,7 @@ void __vlist_simple_init(struct vlist_simple_tree *tree, int offset); 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) { @@ -135,6 +110,8 @@ static inline int fls(int x) } #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); #endif