zone.c 4.5 KB

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