zone.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. /*
  2. * net/tipc/zone.c: TIPC zone management routines
  3. *
  4. * Copyright (c) 2003-2005, Ericsson Research Canada
  5. * Copyright (c) 2005, Wind River Systems
  6. * Copyright (c) 2005-2006, Ericsson AB
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions are met:
  11. *
  12. * Redistributions of source code must retain the above copyright notice, this
  13. * list of conditions and the following disclaimer.
  14. * Redistributions in binary form must reproduce the above copyright notice,
  15. * this list of conditions and the following disclaimer in the documentation
  16. * and/or other materials provided with the distribution.
  17. * Neither the names of the copyright holders nor the names of its
  18. * contributors may be used to endorse or promote products derived from this
  19. * software without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  22. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  25. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  26. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  27. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  28. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  29. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  30. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  31. * POSSIBILITY OF SUCH DAMAGE.
  32. */
  33. #include "core.h"
  34. #include "zone.h"
  35. #include "net.h"
  36. #include "addr.h"
  37. #include "node_subscr.h"
  38. #include "cluster.h"
  39. #include "node.h"
  40. struct _zone *zone_create(u32 addr)
  41. {
  42. struct _zone *z_ptr = 0;
  43. u32 z_num;
  44. if (!addr_domain_valid(addr))
  45. return 0;
  46. z_ptr = (struct _zone *)kmalloc(sizeof(*z_ptr), GFP_ATOMIC);
  47. if (z_ptr != NULL) {
  48. memset(z_ptr, 0, sizeof(*z_ptr));
  49. z_num = tipc_zone(addr);
  50. z_ptr->addr = tipc_addr(z_num, 0, 0);
  51. net.zones[z_num] = z_ptr;
  52. }
  53. return z_ptr;
  54. }
  55. void zone_delete(struct _zone *z_ptr)
  56. {
  57. u32 c_num;
  58. if (!z_ptr)
  59. return;
  60. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  61. cluster_delete(z_ptr->clusters[c_num]);
  62. }
  63. kfree(z_ptr);
  64. }
  65. void zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr)
  66. {
  67. u32 c_num = tipc_cluster(c_ptr->addr);
  68. assert(c_ptr->addr);
  69. assert(c_num <= tipc_max_clusters);
  70. assert(z_ptr->clusters[c_num] == 0);
  71. z_ptr->clusters[c_num] = c_ptr;
  72. }
  73. void zone_remove_as_router(struct _zone *z_ptr, u32 router)
  74. {
  75. u32 c_num;
  76. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  77. if (z_ptr->clusters[c_num]) {
  78. cluster_remove_as_router(z_ptr->clusters[c_num],
  79. router);
  80. }
  81. }
  82. }
  83. void zone_send_external_routes(struct _zone *z_ptr, u32 dest)
  84. {
  85. u32 c_num;
  86. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  87. if (z_ptr->clusters[c_num]) {
  88. if (in_own_cluster(z_ptr->addr))
  89. continue;
  90. cluster_send_ext_routes(z_ptr->clusters[c_num], dest);
  91. }
  92. }
  93. }
  94. struct node *zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref)
  95. {
  96. struct cluster *c_ptr;
  97. struct node *n_ptr;
  98. u32 c_num;
  99. if (!z_ptr)
  100. return 0;
  101. c_ptr = z_ptr->clusters[tipc_cluster(addr)];
  102. if (!c_ptr)
  103. return 0;
  104. n_ptr = cluster_select_node(c_ptr, ref);
  105. if (n_ptr)
  106. return n_ptr;
  107. /* Links to any other clusters within this zone ? */
  108. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  109. c_ptr = z_ptr->clusters[c_num];
  110. if (!c_ptr)
  111. return 0;
  112. n_ptr = cluster_select_node(c_ptr, ref);
  113. if (n_ptr)
  114. return n_ptr;
  115. }
  116. return 0;
  117. }
  118. u32 zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref)
  119. {
  120. struct cluster *c_ptr;
  121. u32 c_num;
  122. u32 router;
  123. if (!z_ptr)
  124. return 0;
  125. c_ptr = z_ptr->clusters[tipc_cluster(addr)];
  126. router = c_ptr ? cluster_select_router(c_ptr, ref) : 0;
  127. if (router)
  128. return router;
  129. /* Links to any other clusters within the zone? */
  130. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  131. c_ptr = z_ptr->clusters[c_num];
  132. router = c_ptr ? cluster_select_router(c_ptr, ref) : 0;
  133. if (router)
  134. return router;
  135. }
  136. return 0;
  137. }
  138. u32 zone_next_node(u32 addr)
  139. {
  140. struct cluster *c_ptr = cluster_find(addr);
  141. if (c_ptr)
  142. return cluster_next_node(c_ptr, addr);
  143. return 0;
  144. }