zone.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /*
  2. * net/tipc/zone.c: TIPC zone management routines
  3. *
  4. * Copyright (c) 2000-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. #include "core.h"
  37. #include "zone.h"
  38. #include "net.h"
  39. #include "addr.h"
  40. #include "node_subscr.h"
  41. #include "cluster.h"
  42. #include "node.h"
  43. struct _zone *tipc_zone_create(u32 addr)
  44. {
  45. struct _zone *z_ptr;
  46. u32 z_num;
  47. if (!tipc_addr_domain_valid(addr)) {
  48. err("Zone creation failed, invalid domain 0x%x\n", addr);
  49. return NULL;
  50. }
  51. z_ptr = kzalloc(sizeof(*z_ptr), GFP_ATOMIC);
  52. if (!z_ptr) {
  53. warn("Zone creation failed, insufficient memory\n");
  54. return NULL;
  55. }
  56. z_num = tipc_zone(addr);
  57. z_ptr->addr = tipc_addr(z_num, 0, 0);
  58. tipc_net.zones[z_num] = z_ptr;
  59. return z_ptr;
  60. }
  61. void tipc_zone_delete(struct _zone *z_ptr)
  62. {
  63. u32 c_num;
  64. if (!z_ptr)
  65. return;
  66. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  67. tipc_cltr_delete(z_ptr->clusters[c_num]);
  68. }
  69. kfree(z_ptr);
  70. }
  71. void tipc_zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr)
  72. {
  73. u32 c_num = tipc_cluster(c_ptr->addr);
  74. assert(c_ptr->addr);
  75. assert(c_num <= tipc_max_clusters);
  76. assert(z_ptr->clusters[c_num] == 0);
  77. z_ptr->clusters[c_num] = c_ptr;
  78. }
  79. void tipc_zone_remove_as_router(struct _zone *z_ptr, u32 router)
  80. {
  81. u32 c_num;
  82. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  83. if (z_ptr->clusters[c_num]) {
  84. tipc_cltr_remove_as_router(z_ptr->clusters[c_num],
  85. router);
  86. }
  87. }
  88. }
  89. void tipc_zone_send_external_routes(struct _zone *z_ptr, u32 dest)
  90. {
  91. u32 c_num;
  92. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  93. if (z_ptr->clusters[c_num]) {
  94. if (in_own_cluster(z_ptr->addr))
  95. continue;
  96. tipc_cltr_send_ext_routes(z_ptr->clusters[c_num], dest);
  97. }
  98. }
  99. }
  100. struct node *tipc_zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref)
  101. {
  102. struct cluster *c_ptr;
  103. struct node *n_ptr;
  104. u32 c_num;
  105. if (!z_ptr)
  106. return NULL;
  107. c_ptr = z_ptr->clusters[tipc_cluster(addr)];
  108. if (!c_ptr)
  109. return NULL;
  110. n_ptr = tipc_cltr_select_node(c_ptr, ref);
  111. if (n_ptr)
  112. return n_ptr;
  113. /* Links to any other clusters within this zone ? */
  114. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  115. c_ptr = z_ptr->clusters[c_num];
  116. if (!c_ptr)
  117. return NULL;
  118. n_ptr = tipc_cltr_select_node(c_ptr, ref);
  119. if (n_ptr)
  120. return n_ptr;
  121. }
  122. return NULL;
  123. }
  124. u32 tipc_zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref)
  125. {
  126. struct cluster *c_ptr;
  127. u32 c_num;
  128. u32 router;
  129. if (!z_ptr)
  130. return 0;
  131. c_ptr = z_ptr->clusters[tipc_cluster(addr)];
  132. router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
  133. if (router)
  134. return router;
  135. /* Links to any other clusters within the zone? */
  136. for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
  137. c_ptr = z_ptr->clusters[c_num];
  138. router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
  139. if (router)
  140. return router;
  141. }
  142. return 0;
  143. }
  144. u32 tipc_zone_next_node(u32 addr)
  145. {
  146. struct cluster *c_ptr = tipc_cltr_find(addr);
  147. if (c_ptr)
  148. return tipc_cltr_next_node(c_ptr, addr);
  149. return 0;
  150. }