2
0

utils.h 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119
  1. /*
  2. * netifd - network interface daemon
  3. * Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
  4. *
  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
  8. *
  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.
  13. */
  14. #ifndef __NETIFD_UTILS_H
  15. #define __NETIFD_UTILS_H
  16. #include <stdio.h>
  17. #include <libubox/list.h>
  18. #include <libubox/avl.h>
  19. #include <libubox/avl-cmp.h>
  20. #include <libubox/blobmsg.h>
  21. #include <libubox/vlist.h>
  22. #include <libubox/utils.h>
  23. static inline bool blobmsg_get_bool_default(struct blob_attr *attr, bool val)
  24. {
  25. if (!attr)
  26. return val;
  27. return blobmsg_get_bool(attr);
  28. }
  29. #define __init __attribute__((constructor))
  30. struct vlist_simple_tree {
  31. struct list_head list;
  32. int head_offset;
  33. int version;
  34. };
  35. struct vlist_simple_node {
  36. struct list_head list;
  37. int version;
  38. };
  39. #define vlist_for_each_element_safe(tree, element, node_member, ptr) \
  40. avl_for_each_element_safe(&(tree)->avl, element, node_member.avl, ptr)
  41. #define vlist_simple_init(tree, node, member) \
  42. __vlist_simple_init(tree, offsetof(node, member))
  43. void __vlist_simple_init(struct vlist_simple_tree *tree, int offset);
  44. void vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node);
  45. void vlist_simple_flush(struct vlist_simple_tree *tree);
  46. void vlist_simple_flush_all(struct vlist_simple_tree *tree);
  47. void vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old);
  48. static inline void vlist_simple_update(struct vlist_simple_tree *tree)
  49. {
  50. tree->version++;
  51. }
  52. static inline void vlist_simple_add(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
  53. {
  54. node->version = tree->version;
  55. list_add_tail(&node->list, &tree->list);
  56. }
  57. #define vlist_simple_for_each_element(tree, element, node_member) \
  58. list_for_each_entry(element, &(tree)->list, node_member.list)
  59. #define vlist_simple_empty(tree) \
  60. list_empty(&(tree)->list)
  61. #ifdef __linux__
  62. static inline int fls(int x)
  63. {
  64. int r = 32;
  65. if (!x)
  66. return 0;
  67. if (!(x & 0xffff0000u)) {
  68. x <<= 16;
  69. r -= 16;
  70. }
  71. if (!(x & 0xff000000u)) {
  72. x <<= 8;
  73. r -= 8;
  74. }
  75. if (!(x & 0xf0000000u)) {
  76. x <<= 4;
  77. r -= 4;
  78. }
  79. if (!(x & 0xc0000000u)) {
  80. x <<= 2;
  81. r -= 2;
  82. }
  83. if (!(x & 0x80000000u)) {
  84. x <<= 1;
  85. r -= 1;
  86. }
  87. return r;
  88. }
  89. #endif
  90. unsigned int parse_netmask_string(const char *str, bool v6);
  91. bool split_netmask(char *str, unsigned int *netmask, bool v6);
  92. int parse_ip_and_netmask(int af, const char *str, void *addr, unsigned int *netmask);
  93. char * format_macaddr(uint8_t *mac);
  94. uint32_t crc32_file(FILE *fp);
  95. #ifdef __APPLE__
  96. #define s6_addr32 __u6_addr.__u6_addr32
  97. #endif
  98. #endif