bcast.h 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  1. /*
  2. * net/tipc/bcast.h: Include file for TIPC broadcast code
  3. *
  4. * Copyright (c) 2003-2006, Ericsson AB
  5. * Copyright (c) 2005, Wind River Systems
  6. * All rights reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions are met:
  10. *
  11. * 1. Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in the
  15. * documentation and/or other materials provided with the distribution.
  16. * 3. Neither the names of the copyright holders nor the names of its
  17. * contributors may be used to endorse or promote products derived from
  18. * this software without specific prior written permission.
  19. *
  20. * Alternatively, this software may be distributed under the terms of the
  21. * GNU General Public License ("GPL") version 2 as published by the Free
  22. * Software Foundation.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  25. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  34. * POSSIBILITY OF SUCH DAMAGE.
  35. */
  36. #ifndef _TIPC_BCAST_H
  37. #define _TIPC_BCAST_H
  38. #define MAX_NODES 4096
  39. #define WSIZE 32
  40. /**
  41. * struct node_map - set of node identifiers
  42. * @count: # of nodes in set
  43. * @map: bitmap of node identifiers that are in the set
  44. */
  45. struct node_map {
  46. u32 count;
  47. u32 map[MAX_NODES / WSIZE];
  48. };
  49. #define PLSIZE 32
  50. /**
  51. * struct port_list - set of node local destination ports
  52. * @count: # of ports in set (only valid for first entry in list)
  53. * @next: pointer to next entry in list
  54. * @ports: array of port references
  55. */
  56. struct port_list {
  57. int count;
  58. struct port_list *next;
  59. u32 ports[PLSIZE];
  60. };
  61. struct node;
  62. extern char tipc_bclink_name[];
  63. /**
  64. * nmap_get - determine if node exists in a node map
  65. */
  66. static inline int tipc_nmap_get(struct node_map *nm_ptr, u32 node)
  67. {
  68. int n = tipc_node(node);
  69. int w = n / WSIZE;
  70. int b = n % WSIZE;
  71. return nm_ptr->map[w] & (1 << b);
  72. }
  73. /**
  74. * nmap_add - add a node to a node map
  75. */
  76. static inline void tipc_nmap_add(struct node_map *nm_ptr, u32 node)
  77. {
  78. int n = tipc_node(node);
  79. int w = n / WSIZE;
  80. u32 mask = (1 << (n % WSIZE));
  81. if ((nm_ptr->map[w] & mask) == 0) {
  82. nm_ptr->count++;
  83. nm_ptr->map[w] |= mask;
  84. }
  85. }
  86. /**
  87. * nmap_remove - remove a node from a node map
  88. */
  89. static inline void tipc_nmap_remove(struct node_map *nm_ptr, u32 node)
  90. {
  91. int n = tipc_node(node);
  92. int w = n / WSIZE;
  93. u32 mask = (1 << (n % WSIZE));
  94. if ((nm_ptr->map[w] & mask) != 0) {
  95. nm_ptr->map[w] &= ~mask;
  96. nm_ptr->count--;
  97. }
  98. }
  99. /**
  100. * nmap_equal - test for equality of node maps
  101. */
  102. static inline int tipc_nmap_equal(struct node_map *nm_a, struct node_map *nm_b)
  103. {
  104. return !memcmp(nm_a, nm_b, sizeof(*nm_a));
  105. }
  106. /**
  107. * nmap_diff - find differences between node maps
  108. * @nm_a: input node map A
  109. * @nm_b: input node map B
  110. * @nm_diff: output node map A-B (i.e. nodes of A that are not in B)
  111. */
  112. static inline void tipc_nmap_diff(struct node_map *nm_a, struct node_map *nm_b,
  113. struct node_map *nm_diff)
  114. {
  115. int stop = sizeof(nm_a->map) / sizeof(u32);
  116. int w;
  117. int b;
  118. u32 map;
  119. memset(nm_diff, 0, sizeof(*nm_diff));
  120. for (w = 0; w < stop; w++) {
  121. map = nm_a->map[w] ^ (nm_a->map[w] & nm_b->map[w]);
  122. nm_diff->map[w] = map;
  123. if (map != 0) {
  124. for (b = 0 ; b < WSIZE; b++) {
  125. if (map & (1 << b))
  126. nm_diff->count++;
  127. }
  128. }
  129. }
  130. }
  131. /**
  132. * port_list_add - add a port to a port list, ensuring no duplicates
  133. */
  134. static inline void tipc_port_list_add(struct port_list *pl_ptr, u32 port)
  135. {
  136. struct port_list *item = pl_ptr;
  137. int i;
  138. int item_sz = PLSIZE;
  139. int cnt = pl_ptr->count;
  140. for (; ; cnt -= item_sz, item = item->next) {
  141. if (cnt < PLSIZE)
  142. item_sz = cnt;
  143. for (i = 0; i < item_sz; i++)
  144. if (item->ports[i] == port)
  145. return;
  146. if (i < PLSIZE) {
  147. item->ports[i] = port;
  148. pl_ptr->count++;
  149. return;
  150. }
  151. if (!item->next) {
  152. item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
  153. if (!item->next) {
  154. warn("Incomplete multicast delivery, no memory\n");
  155. return;
  156. }
  157. item->next->next = NULL;
  158. }
  159. }
  160. }
  161. /**
  162. * port_list_free - free dynamically created entries in port_list chain
  163. *
  164. * Note: First item is on stack, so it doesn't need to be released
  165. */
  166. static inline void tipc_port_list_free(struct port_list *pl_ptr)
  167. {
  168. struct port_list *item;
  169. struct port_list *next;
  170. for (item = pl_ptr->next; item; item = next) {
  171. next = item->next;
  172. kfree(item);
  173. }
  174. }
  175. int tipc_bclink_init(void);
  176. void tipc_bclink_stop(void);
  177. void tipc_bclink_acknowledge(struct node *n_ptr, u32 acked);
  178. int tipc_bclink_send_msg(struct sk_buff *buf);
  179. void tipc_bclink_recv_pkt(struct sk_buff *buf);
  180. u32 tipc_bclink_get_last_sent(void);
  181. u32 tipc_bclink_acks_missing(struct node *n_ptr);
  182. void tipc_bclink_check_gap(struct node *n_ptr, u32 seqno);
  183. int tipc_bclink_stats(char *stats_buf, const u32 buf_size);
  184. int tipc_bclink_reset_stats(void);
  185. int tipc_bclink_set_queue_limits(u32 limit);
  186. void tipc_bcbearer_sort(void);
  187. void tipc_bcbearer_push(void);
  188. #endif