Per Liden | b97bf3f | 2006-01-02 19:04:38 +0100 | [diff] [blame] | 1 | /* |
| 2 | * net/tipc/zone.c: TIPC zone management routines |
| 3 | * |
Per Liden | 593a5f2 | 2006-01-11 19:14:19 +0100 | [diff] [blame^] | 4 | * Copyright (c) 2000-2006, Ericsson AB |
Per Liden | b97bf3f | 2006-01-02 19:04:38 +0100 | [diff] [blame] | 5 | * Copyright (c) 2005, Wind River Systems |
Per Liden | b97bf3f | 2006-01-02 19:04:38 +0100 | [diff] [blame] | 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 | * |
Per Liden | 9ea1fd3 | 2006-01-11 13:30:43 +0100 | [diff] [blame] | 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. |
Per Liden | b97bf3f | 2006-01-02 19:04:38 +0100 | [diff] [blame] | 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 | |
| 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 | |
| 45 | struct _zone *zone_create(u32 addr) |
| 46 | { |
| 47 | struct _zone *z_ptr = 0; |
| 48 | u32 z_num; |
| 49 | |
| 50 | if (!addr_domain_valid(addr)) |
| 51 | return 0; |
| 52 | |
| 53 | z_ptr = (struct _zone *)kmalloc(sizeof(*z_ptr), GFP_ATOMIC); |
| 54 | if (z_ptr != NULL) { |
| 55 | memset(z_ptr, 0, sizeof(*z_ptr)); |
| 56 | z_num = tipc_zone(addr); |
| 57 | z_ptr->addr = tipc_addr(z_num, 0, 0); |
| 58 | net.zones[z_num] = z_ptr; |
| 59 | } |
| 60 | return z_ptr; |
| 61 | } |
| 62 | |
| 63 | void zone_delete(struct _zone *z_ptr) |
| 64 | { |
| 65 | u32 c_num; |
| 66 | |
| 67 | if (!z_ptr) |
| 68 | return; |
| 69 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
| 70 | cluster_delete(z_ptr->clusters[c_num]); |
| 71 | } |
| 72 | kfree(z_ptr); |
| 73 | } |
| 74 | |
| 75 | void zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr) |
| 76 | { |
| 77 | u32 c_num = tipc_cluster(c_ptr->addr); |
| 78 | |
| 79 | assert(c_ptr->addr); |
| 80 | assert(c_num <= tipc_max_clusters); |
| 81 | assert(z_ptr->clusters[c_num] == 0); |
| 82 | z_ptr->clusters[c_num] = c_ptr; |
| 83 | } |
| 84 | |
| 85 | void zone_remove_as_router(struct _zone *z_ptr, u32 router) |
| 86 | { |
| 87 | u32 c_num; |
| 88 | |
| 89 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
| 90 | if (z_ptr->clusters[c_num]) { |
| 91 | cluster_remove_as_router(z_ptr->clusters[c_num], |
| 92 | router); |
| 93 | } |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | void zone_send_external_routes(struct _zone *z_ptr, u32 dest) |
| 98 | { |
| 99 | u32 c_num; |
| 100 | |
| 101 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
| 102 | if (z_ptr->clusters[c_num]) { |
| 103 | if (in_own_cluster(z_ptr->addr)) |
| 104 | continue; |
| 105 | cluster_send_ext_routes(z_ptr->clusters[c_num], dest); |
| 106 | } |
| 107 | } |
| 108 | } |
| 109 | |
| 110 | struct node *zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref) |
| 111 | { |
| 112 | struct cluster *c_ptr; |
| 113 | struct node *n_ptr; |
| 114 | u32 c_num; |
| 115 | |
| 116 | if (!z_ptr) |
| 117 | return 0; |
| 118 | c_ptr = z_ptr->clusters[tipc_cluster(addr)]; |
| 119 | if (!c_ptr) |
| 120 | return 0; |
| 121 | n_ptr = cluster_select_node(c_ptr, ref); |
| 122 | if (n_ptr) |
| 123 | return n_ptr; |
| 124 | |
| 125 | /* Links to any other clusters within this zone ? */ |
| 126 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
| 127 | c_ptr = z_ptr->clusters[c_num]; |
| 128 | if (!c_ptr) |
| 129 | return 0; |
| 130 | n_ptr = cluster_select_node(c_ptr, ref); |
| 131 | if (n_ptr) |
| 132 | return n_ptr; |
| 133 | } |
| 134 | return 0; |
| 135 | } |
| 136 | |
| 137 | u32 zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref) |
| 138 | { |
| 139 | struct cluster *c_ptr; |
| 140 | u32 c_num; |
| 141 | u32 router; |
| 142 | |
| 143 | if (!z_ptr) |
| 144 | return 0; |
| 145 | c_ptr = z_ptr->clusters[tipc_cluster(addr)]; |
| 146 | router = c_ptr ? cluster_select_router(c_ptr, ref) : 0; |
| 147 | if (router) |
| 148 | return router; |
| 149 | |
| 150 | /* Links to any other clusters within the zone? */ |
| 151 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
| 152 | c_ptr = z_ptr->clusters[c_num]; |
| 153 | router = c_ptr ? cluster_select_router(c_ptr, ref) : 0; |
| 154 | if (router) |
| 155 | return router; |
| 156 | } |
| 157 | return 0; |
| 158 | } |
| 159 | |
| 160 | |
| 161 | u32 zone_next_node(u32 addr) |
| 162 | { |
| 163 | struct cluster *c_ptr = cluster_find(addr); |
| 164 | |
| 165 | if (c_ptr) |
| 166 | return cluster_next_node(c_ptr, addr); |
| 167 | return 0; |
| 168 | } |
| 169 | |